Social tagging has opened new possibilities for applications interoperability on the semantic web, while at the same time posing new privacy treats. Recommendation and information filtering systems in fact predict users preferences, providing personalized content to their users, but also exposing their profiles to possible privacy attacks. Tag suppression and forgery are Privacy Enhancing Techniques that protect users privacy to a certain extent, at the loss of semantic accuracy loss, or in other words privacy gain at the expenses of utility loss. The impact of tag suppression and forgery to content-based recommendation is hence investigated in a real world application scenario.
MongoDB Europe 2016 - Graph Operations with MongoDBMongoDB
The popularity of dedicated graph technologies has risen greatly in recent years, at least partly fuelled by the explosion in social media and similar systems, where a friend network or recommendation engine is often a critical component when delivering a successful application. MongoDB 3.4 introduces a new Aggregation Framework graph operator, $graphLookup, to enable some of these types of use cases to be built easily on top of MongoDB. We will see how semantic relationships can be modelled inside MongoDB today, how the new $graphLookup operator can help simplify this in 3.4, and how $graphLookup can be used to leverage these relationships and build a commercially focused news article recommendation system.
Abstract: Privacy is one of the friction points that emerge when communications get mediated in Online Social Networks (OSNs). Different communities of computer science researchers have framed the ‘OSN privacy problem’ as one of surveillance, institutional or social privacy. In this article, first we provide an introduction to the surveillance and social privacy perspectives emphasizing the narratives that inform them, as well as their assumptions and goals. This paper mainly addresses visitors events (population) on an users account and updates the account holders log information. And thus the evolutionary aspects of Surveillance are reflected in User's Log, this needs the implementation of Genetic Algorithm. Further, this requires a bridge module between every interaction between the user and social network server. This paper implements mutation aspects through Genetic Algorithm by differing users into Guests and Friends, and identifies and Cross Over issues of a guest Clicking Friend of a friend.
Abstract: Privacy is one of the friction points that emerge when communications get mediated in Online Social Networks (OSNs). Different communities of computer science researchers have framed the ‘OSN privacy problem’ as one of surveillance, institutional or social privacy. In this article, first we provide an introduction to the surveillance and social privacy perspectives emphasizing the narratives that inform them, as well as their assumptions and goals. This paper mainly addresses visitors events (population) on an users account and updates the account holders log information. And thus the evolutionary aspects of Surveillance are reflected in User's Log, this needs the implementation of Genetic Algorithm. Further, this requires a bridge module between every interaction between the user and social network server. This paper implements mutation aspects through Genetic Algorithm by differing users into Guests and Friends, and identifies and Cross Over issues of a guest Clicking Friend of a friend.Title: MUTATION AND CROSSOVER ISSUES FOR OSN PRIVACY
Author: C. Narasimham, Jacob
International Journal of Recent Research in Mathematics Computer Science and Information Technology
ISSN: 2350-1022
Paper Publications
Cryptography and Network Security is a difficult subject to understand, mainly because of the complexity of security protocols and the mathematical rigour required to understand encryption algorithms. Realizing the need for an interactive visualization tool to facilitate the understanding of cryptographic concepts and protocols, several tools had been developed. However, these tools cannot be easily adapted to animate different protocols. The aim of this paper is to propose an interactive visualization tool, called the Cryptographic Protocol Animator (CPAnim). The tool enables a student to specify a protocol and gain knowledge about the impact of its behavior. The protocol is specified by using a scenario-based approach and it is demonstrated as a number of scenes displaying a complete scenario. The effectiveness of this tool was tested using an empirical evaluation method. The results show that this tool was effective in meeting its learning objectives.
AN INTERACTIVE VISUALIZATION TOOL FOR ANIMATING BEHAVIOR OF CRYPTOGRAPHIC PRO...IJNSA Journal
Cryptography and Network Security is a difficult subject to understand, mainly because of the complexity of security protocols and the mathematical rigour required to understand encryption algorithms. Realizing the need for an interactive visualization tool to facilitate the understanding of cryptographic concepts and protocols, several tools had been developed. However, these tools cannot be easily adapted to animate different protocols. The aim of this paper is to propose an interactive visualization tool, called the Cryptographic Protocol Animator (CPAnim). The tool enables a student to specify a protocol and gain knowledge about the impact of its behavior. The protocol is specified by using a scenario-based approach and it is demonstrated as a number of scenes displaying a complete scenario. The effectiveness of this tool was tested using an empirical evaluation method. The results show that this tool was effective in meeting its learning objectives.
MongoDB Europe 2016 - Graph Operations with MongoDBMongoDB
The popularity of dedicated graph technologies has risen greatly in recent years, at least partly fuelled by the explosion in social media and similar systems, where a friend network or recommendation engine is often a critical component when delivering a successful application. MongoDB 3.4 introduces a new Aggregation Framework graph operator, $graphLookup, to enable some of these types of use cases to be built easily on top of MongoDB. We will see how semantic relationships can be modelled inside MongoDB today, how the new $graphLookup operator can help simplify this in 3.4, and how $graphLookup can be used to leverage these relationships and build a commercially focused news article recommendation system.
Abstract: Privacy is one of the friction points that emerge when communications get mediated in Online Social Networks (OSNs). Different communities of computer science researchers have framed the ‘OSN privacy problem’ as one of surveillance, institutional or social privacy. In this article, first we provide an introduction to the surveillance and social privacy perspectives emphasizing the narratives that inform them, as well as their assumptions and goals. This paper mainly addresses visitors events (population) on an users account and updates the account holders log information. And thus the evolutionary aspects of Surveillance are reflected in User's Log, this needs the implementation of Genetic Algorithm. Further, this requires a bridge module between every interaction between the user and social network server. This paper implements mutation aspects through Genetic Algorithm by differing users into Guests and Friends, and identifies and Cross Over issues of a guest Clicking Friend of a friend.
Abstract: Privacy is one of the friction points that emerge when communications get mediated in Online Social Networks (OSNs). Different communities of computer science researchers have framed the ‘OSN privacy problem’ as one of surveillance, institutional or social privacy. In this article, first we provide an introduction to the surveillance and social privacy perspectives emphasizing the narratives that inform them, as well as their assumptions and goals. This paper mainly addresses visitors events (population) on an users account and updates the account holders log information. And thus the evolutionary aspects of Surveillance are reflected in User's Log, this needs the implementation of Genetic Algorithm. Further, this requires a bridge module between every interaction between the user and social network server. This paper implements mutation aspects through Genetic Algorithm by differing users into Guests and Friends, and identifies and Cross Over issues of a guest Clicking Friend of a friend.Title: MUTATION AND CROSSOVER ISSUES FOR OSN PRIVACY
Author: C. Narasimham, Jacob
International Journal of Recent Research in Mathematics Computer Science and Information Technology
ISSN: 2350-1022
Paper Publications
Cryptography and Network Security is a difficult subject to understand, mainly because of the complexity of security protocols and the mathematical rigour required to understand encryption algorithms. Realizing the need for an interactive visualization tool to facilitate the understanding of cryptographic concepts and protocols, several tools had been developed. However, these tools cannot be easily adapted to animate different protocols. The aim of this paper is to propose an interactive visualization tool, called the Cryptographic Protocol Animator (CPAnim). The tool enables a student to specify a protocol and gain knowledge about the impact of its behavior. The protocol is specified by using a scenario-based approach and it is demonstrated as a number of scenes displaying a complete scenario. The effectiveness of this tool was tested using an empirical evaluation method. The results show that this tool was effective in meeting its learning objectives.
AN INTERACTIVE VISUALIZATION TOOL FOR ANIMATING BEHAVIOR OF CRYPTOGRAPHIC PRO...IJNSA Journal
Cryptography and Network Security is a difficult subject to understand, mainly because of the complexity of security protocols and the mathematical rigour required to understand encryption algorithms. Realizing the need for an interactive visualization tool to facilitate the understanding of cryptographic concepts and protocols, several tools had been developed. However, these tools cannot be easily adapted to animate different protocols. The aim of this paper is to propose an interactive visualization tool, called the Cryptographic Protocol Animator (CPAnim). The tool enables a student to specify a protocol and gain knowledge about the impact of its behavior. The protocol is specified by using a scenario-based approach and it is demonstrated as a number of scenes displaying a complete scenario. The effectiveness of this tool was tested using an empirical evaluation method. The results show that this tool was effective in meeting its learning objectives.
To the end of our possibilities with Adaptive User InterfacesJean Vanderdonckt
Slides of the keynote presented at the 1st International Workshop on Human-in-the-Loop Applied Machine Learning (HITLAML '23)
September 04 - 06, 2023 - Belval, Luxembourg.
This presentation summarizes the evolution of techniques used to adapt the user interfaces to the context of use, which is composed of the user, the platform, and the environment.
Bridging Sensor Data Streams and Human KnowledgeMattia Zeni
Generating useful and meaningful knowledge out of personal big data is a difficult task that presents multiple challenges due to the intrinsic characteristics of these type of data, namely their volume, velocity, variety and noisiness. This work proposes an interdisciplinary approach for solving this problem that is based on the idea that the user and the world surrounding him can be modeled, defining most of the elements of her context as entities (locations, people, objects) in addition with their attributes and the relations among them. This allows to create a structure out of the unstructured, noisy and highly variable sensor data that can then be used by the machine to provide personalized, context-aware services to the final user with the final goal of improving her quality of life.
https://utilitasmathematica.com/index.php/Index
Our journal has academic and professional communities fosters collaboration and knowledge sharing. When all voices are heard and respected, it strengthens the collective capabilities of the statistical community.
IDENTITY DISCLOSURE PROTECTION IN DYNAMIC NETWORKS USING K W – STRUCTURAL DIV...IJITE
The data mining figures out accurate information for requesting user after the raw data is analyzed. Among
lots of developments, data mining face hot issues on security, privacy and integrity. Data mining use one of the latest technique called privacy preserving data publishing (PPDP), which enforces security for the digital information provided by governments, corporations, companies and individuals in social networks. People become embarrassed when adversary tries to know the sensitive information shared. Sensitive information is gathered through the vertex and multi community identities of the user. Vertex identity denotes the self-information of user like name, address, mobile number, etc. Multi community identity denotes the community group in which the user participates. To prevent such identity disclosures, this paper proposes KW -structural diversity anonymity technique, for the protection of vertex and multi community identity disclosure. In KW -structural diversity anonymity technique, k is privacy level applied for users and W is an adversary monitoring time.
Analysis and assessment software for multi-user collaborative cognitive radi...IJECEIAES
Computer simulations are without a doubt a useful methodology that allows to explore research queries and develop prototypes at lower costs and timeframes than those required in hardware processes. The simulation tools used in cognitive radio networks (CRN) are undergoing an active process. Currently, there is no stable simulator that enables to characterize every element of the cognitive cycle and the available tools are a framework for discrete-event software. This work presents the spectral mobility simulator in CRN called “App MultiColl-DCRN”, developed with MATLAB’s app designer. In contrast with other frameworks, the simulator uses real spectral occupancy data and simultaneously analyzes features regarding spectral mobility, decision-making, multi-user access, collaborative scenarios and decentralized architectures. Performance metrics include bandwidth, throughput level, number of failed handoffs, number of total handoffs, number of handoffs with interference, number of anticipated handoffs and number of perfect handoffs. The assessment of the simulator involves three scenarios: the first and second scenarios present a collaborative structure using the multi-criteria optimization and compromise solution (VIKOR) decision-making model and the naïve Bayes prediction technique respectively. The third scenario presents a multi-user structure and uses simple additive weighting (SAW) as a decision-making technique. The present development represents a contribution in the cognitive radio network field since there is currently no software with the same features.
Show and Tell - Data and Digitalisation, Digital Twins.pdfSIFOfgem
This is the third in a series of 'Show and Tell' webinars from the Ofgem Strategic Innovation Fund Discovery phase, covering the Digital Twin projects.
As the move towards a net zero energy system accelerates, network customers and consumers will require simplified and accessible digital products, processes and services that can improve their user experience. Data and digital initiatives are already beginning to show the potential to improve the efficiency of energy networks whilst making it easier for third parties to interact with and innovate for the energy system. Digitalisation of energy network activities will contribute to better coordination, planning and network optimisation.
You will hear from SIF projects which are investigating new digital products and services such as digital twins.
The Strategic Innovation Fund (SIF) is an Ofgem programme managed in partnership with Innovate UK, part of UKRI. The SIF aims to fund network innovation that will contribute to achieving Net Zero rapidly and at lowest cost to consumers, and help transform the UK into the ‘Silicon Valley’ of energy, making it the best place for high-potential businesses to grow and scale in the energy market.
For more information on the SIF visit: www.ofgem.gov.uk/sif
Or sign-up for our newsletter here: https://ukri.innovateuk.org/ofgem-sif-subscription-sign-up
Dr. Frederic Andres (NII, Japan) „Collective Intelligence-based Social Projec...Saulius Maskeliunas
(Presentation at the VU IMI and LIKS AI section seminar, 8th November 2013)
Abstract:
Social Project Management is a novel enhancement approach to project management based on social network. Social Project Management is defined as the effort of designing and executing research project, problem-solving tasks collaboratively by levering social networking. It aims at:
– Exploiting weak ties between researchers and implicit research know-how to improve activity execution and improving of knowledge sharing and collective intelligence.
– Increasing transparency and participation to the decision procedures, so as to raise awareness of the research processes and acceptance of the outcomes.
– Involving (informal) communities in research execution, thus assigning the execution to a broader set of performers or to find most appropriate contributor within a group.
We will present how social project management combines social networking, collective intelligence, and problem solving to increase the effectiveness of best practices. Current work on Collective Intelligence will be presented for the applicability of universal knowledge sharing inside social project management.
It is widely acknowledged that good performances of content-based image retrieval systems can be attained by adopting relevance feedback mechanisms. One of the main difficulties in exploiting relevance information is the availability of few relevant images, as users typically label a few dozen of images, the majority of them often being non-relevant to user’s needs. In order to boost the learning capabilities of relevance feedback techniques, this paper proposes the creation of points in the feature space which can be considered as representation of relevant images. The new points are generated taking into account not only the available relevant points in the feature space, but also the relative positions of non-relevant ones. This approach has been tested on a relevance feedback technique, based on the Nearest-Neighbor classification paradigm. Reported experiments show the effectiveness of the proposed technique relatively to precision and recall.
Battista Biggio @ ICML 2015 - "Is Feature Selection Secure against Training D...Pluribus One
Learning in adversarial settings is becoming an important task for application domains where attackers may inject malicious data into the training set to subvert normal operation of data-driven technologies. Feature selection has been widely used in machine learning for security applications to improve generalization and computational efficiency, although it is not clear whether its use may be beneficial or even counterproductive when training data are poisoned by intelligent attackers. In this work, we shed light on this issue by providing a framework to investigate the robustness of popular feature selection methods, including LASSO, ridge regression and the elastic net. Our results on malware detection show that feature selection methods can be significantly compromised under attack (we can reduce LASSO to almost random choices of feature sets by careful insertion of less than 5% poisoned training samples), highlighting the need for specific countermeasures.
To the end of our possibilities with Adaptive User InterfacesJean Vanderdonckt
Slides of the keynote presented at the 1st International Workshop on Human-in-the-Loop Applied Machine Learning (HITLAML '23)
September 04 - 06, 2023 - Belval, Luxembourg.
This presentation summarizes the evolution of techniques used to adapt the user interfaces to the context of use, which is composed of the user, the platform, and the environment.
Bridging Sensor Data Streams and Human KnowledgeMattia Zeni
Generating useful and meaningful knowledge out of personal big data is a difficult task that presents multiple challenges due to the intrinsic characteristics of these type of data, namely their volume, velocity, variety and noisiness. This work proposes an interdisciplinary approach for solving this problem that is based on the idea that the user and the world surrounding him can be modeled, defining most of the elements of her context as entities (locations, people, objects) in addition with their attributes and the relations among them. This allows to create a structure out of the unstructured, noisy and highly variable sensor data that can then be used by the machine to provide personalized, context-aware services to the final user with the final goal of improving her quality of life.
https://utilitasmathematica.com/index.php/Index
Our journal has academic and professional communities fosters collaboration and knowledge sharing. When all voices are heard and respected, it strengthens the collective capabilities of the statistical community.
IDENTITY DISCLOSURE PROTECTION IN DYNAMIC NETWORKS USING K W – STRUCTURAL DIV...IJITE
The data mining figures out accurate information for requesting user after the raw data is analyzed. Among
lots of developments, data mining face hot issues on security, privacy and integrity. Data mining use one of the latest technique called privacy preserving data publishing (PPDP), which enforces security for the digital information provided by governments, corporations, companies and individuals in social networks. People become embarrassed when adversary tries to know the sensitive information shared. Sensitive information is gathered through the vertex and multi community identities of the user. Vertex identity denotes the self-information of user like name, address, mobile number, etc. Multi community identity denotes the community group in which the user participates. To prevent such identity disclosures, this paper proposes KW -structural diversity anonymity technique, for the protection of vertex and multi community identity disclosure. In KW -structural diversity anonymity technique, k is privacy level applied for users and W is an adversary monitoring time.
Analysis and assessment software for multi-user collaborative cognitive radi...IJECEIAES
Computer simulations are without a doubt a useful methodology that allows to explore research queries and develop prototypes at lower costs and timeframes than those required in hardware processes. The simulation tools used in cognitive radio networks (CRN) are undergoing an active process. Currently, there is no stable simulator that enables to characterize every element of the cognitive cycle and the available tools are a framework for discrete-event software. This work presents the spectral mobility simulator in CRN called “App MultiColl-DCRN”, developed with MATLAB’s app designer. In contrast with other frameworks, the simulator uses real spectral occupancy data and simultaneously analyzes features regarding spectral mobility, decision-making, multi-user access, collaborative scenarios and decentralized architectures. Performance metrics include bandwidth, throughput level, number of failed handoffs, number of total handoffs, number of handoffs with interference, number of anticipated handoffs and number of perfect handoffs. The assessment of the simulator involves three scenarios: the first and second scenarios present a collaborative structure using the multi-criteria optimization and compromise solution (VIKOR) decision-making model and the naïve Bayes prediction technique respectively. The third scenario presents a multi-user structure and uses simple additive weighting (SAW) as a decision-making technique. The present development represents a contribution in the cognitive radio network field since there is currently no software with the same features.
Show and Tell - Data and Digitalisation, Digital Twins.pdfSIFOfgem
This is the third in a series of 'Show and Tell' webinars from the Ofgem Strategic Innovation Fund Discovery phase, covering the Digital Twin projects.
As the move towards a net zero energy system accelerates, network customers and consumers will require simplified and accessible digital products, processes and services that can improve their user experience. Data and digital initiatives are already beginning to show the potential to improve the efficiency of energy networks whilst making it easier for third parties to interact with and innovate for the energy system. Digitalisation of energy network activities will contribute to better coordination, planning and network optimisation.
You will hear from SIF projects which are investigating new digital products and services such as digital twins.
The Strategic Innovation Fund (SIF) is an Ofgem programme managed in partnership with Innovate UK, part of UKRI. The SIF aims to fund network innovation that will contribute to achieving Net Zero rapidly and at lowest cost to consumers, and help transform the UK into the ‘Silicon Valley’ of energy, making it the best place for high-potential businesses to grow and scale in the energy market.
For more information on the SIF visit: www.ofgem.gov.uk/sif
Or sign-up for our newsletter here: https://ukri.innovateuk.org/ofgem-sif-subscription-sign-up
Dr. Frederic Andres (NII, Japan) „Collective Intelligence-based Social Projec...Saulius Maskeliunas
(Presentation at the VU IMI and LIKS AI section seminar, 8th November 2013)
Abstract:
Social Project Management is a novel enhancement approach to project management based on social network. Social Project Management is defined as the effort of designing and executing research project, problem-solving tasks collaboratively by levering social networking. It aims at:
– Exploiting weak ties between researchers and implicit research know-how to improve activity execution and improving of knowledge sharing and collective intelligence.
– Increasing transparency and participation to the decision procedures, so as to raise awareness of the research processes and acceptance of the outcomes.
– Involving (informal) communities in research execution, thus assigning the execution to a broader set of performers or to find most appropriate contributor within a group.
We will present how social project management combines social networking, collective intelligence, and problem solving to increase the effectiveness of best practices. Current work on Collective Intelligence will be presented for the applicability of universal knowledge sharing inside social project management.
It is widely acknowledged that good performances of content-based image retrieval systems can be attained by adopting relevance feedback mechanisms. One of the main difficulties in exploiting relevance information is the availability of few relevant images, as users typically label a few dozen of images, the majority of them often being non-relevant to user’s needs. In order to boost the learning capabilities of relevance feedback techniques, this paper proposes the creation of points in the feature space which can be considered as representation of relevant images. The new points are generated taking into account not only the available relevant points in the feature space, but also the relative positions of non-relevant ones. This approach has been tested on a relevance feedback technique, based on the Nearest-Neighbor classification paradigm. Reported experiments show the effectiveness of the proposed technique relatively to precision and recall.
Battista Biggio @ ICML 2015 - "Is Feature Selection Secure against Training D...Pluribus One
Learning in adversarial settings is becoming an important task for application domains where attackers may inject malicious data into the training set to subvert normal operation of data-driven technologies. Feature selection has been widely used in machine learning for security applications to improve generalization and computational efficiency, although it is not clear whether its use may be beneficial or even counterproductive when training data are poisoned by intelligent attackers. In this work, we shed light on this issue by providing a framework to investigate the robustness of popular feature selection methods, including LASSO, ridge regression and the elastic net. Our results on malware detection show that feature selection methods can be significantly compromised under attack (we can reduce LASSO to almost random choices of feature sets by careful insertion of less than 5% poisoned training samples), highlighting the need for specific countermeasures.
Analysis, modelling and protection of online private data.Silvia Puglisi
Do we have online privacy? And what is privacy anyway in an online context?
This work aim at discovering what footprints users leave online and how these represent a threat to privacy.
These are the slides of a Lightening Talk I will be giving at Chaos Communication Congress at the end of Dec 2013.
Speakers not can be read here: https://docs.google.com/presentation/d/1gmBd11DBEYW-Hka6c74C4uKTvyyo5sF7DmtPdvoYnzY/edit?usp=sharing
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
Essentials of Automations: Optimizing FME Workflows with ParametersSafe Software
Are you looking to streamline your workflows and boost your projects’ efficiency? Do you find yourself searching for ways to add flexibility and control over your FME workflows? If so, you’re in the right place.
Join us for an insightful dive into the world of FME parameters, a critical element in optimizing workflow efficiency. This webinar marks the beginning of our three-part “Essentials of Automation” series. This first webinar is designed to equip you with the knowledge and skills to utilize parameters effectively: enhancing the flexibility, maintainability, and user control of your FME projects.
Here’s what you’ll gain:
- Essentials of FME Parameters: Understand the pivotal role of parameters, including Reader/Writer, Transformer, User, and FME Flow categories. Discover how they are the key to unlocking automation and optimization within your workflows.
- Practical Applications in FME Form: Delve into key user parameter types including choice, connections, and file URLs. Allow users to control how a workflow runs, making your workflows more reusable. Learn to import values and deliver the best user experience for your workflows while enhancing accuracy.
- Optimization Strategies in FME Flow: Explore the creation and strategic deployment of parameters in FME Flow, including the use of deployment and geometry parameters, to maximize workflow efficiency.
- Pro Tips for Success: Gain insights on parameterizing connections and leveraging new features like Conditional Visibility for clarity and simplicity.
We’ll wrap up with a glimpse into future webinars, followed by a Q&A session to address your specific questions surrounding this topic.
Don’t miss this opportunity to elevate your FME expertise and drive your projects to new heights of efficiency.
Le nuove frontiere dell'AI nell'RPA con UiPath Autopilot™UiPathCommunity
In questo evento online gratuito, organizzato dalla Community Italiana di UiPath, potrai esplorare le nuove funzionalità di Autopilot, il tool che integra l'Intelligenza Artificiale nei processi di sviluppo e utilizzo delle Automazioni.
📕 Vedremo insieme alcuni esempi dell'utilizzo di Autopilot in diversi tool della Suite UiPath:
Autopilot per Studio Web
Autopilot per Studio
Autopilot per Apps
Clipboard AI
GenAI applicata alla Document Understanding
👨🏫👨💻 Speakers:
Stefano Negro, UiPath MVPx3, RPA Tech Lead @ BSP Consultant
Flavio Martinelli, UiPath MVP 2023, Technical Account Manager @UiPath
Andrei Tasca, RPA Solutions Team Lead @NTT Data
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Accelerate your Kubernetes clusters with Varnish Caching
Resource recommendation vs privacy enhancement
1. 1/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Silvia Puglisi
silvia.puglisi@upc.edu
“Research Seminar”
Master in Telematics Engineering-UPC
On Content-Based Recommendation and Users Privacy in Social Tagging Systems
Silvia Puglisi
Barcelona, UPC, 2013
2. 2/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Social tagging is the activity that allows users to assign keywords (tags) to web
based resources.
What is social tagging?
3. 3/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Tagging and tags
Tag: a label attached to someone or something for identification or other
information
4. 4/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Scenario
Social tagging enables semantic interoperability in web applications.
Recommendation and information filtering systems have been developed to
predict users preferences.
Users hence reveal their personal preferences on social tagging platforms.
Privacy enhancing techniques (PET) have been developed to protect user
privacy to a certain extent, at the expense of semantic loss.
5. 5/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Objective
Using as starting point research done in the field of recommendations systems
[1] and PET [2].
The objective of this study is evaluate the impact of two PET, tag forgery and
suppression, on the performance of a recommendation system, on real world
application data.
[1] Bellogín, Alejandro, Iván Cantador, and Pablo Castells. "A comparative study of heterogeneous item
recommendations in social systems." Information Sciences (2012)
[2] Parra-Arnau, Javier, David Rebollo-Monedero, and Jordi Forné. "A privacy-protecting architecture for collaborative
filtering via forgery and suppression of ratings." Data Privacy Management and Autonomous Spontaneus Security
(2012): 42-57.
6. 6/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Dataset
Considering different social bookmarking platform, Delicious was identified as a
representative system of an application rich in collaborative tagging information.
Delicious is a social bookmarking platform for web resources.
The dataset containing Delicious data was obtained from the ones publicly
available at the 2nd
International Workshop on Information Heterogeneity and
Fusion in Recommender Systems.
8. 8/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Techniques
Modelling the User/Item Profile
The simplest approach to model users and items is to count the number of
times a tag has been used:
•By a user to annotate different items in the same category.
•Or by the community to annotate the item.
The user/item profile is then described as a histogram of the relative
frequencies of tags within a predefined set of categories of interest.
10. 10/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Techniques
Privacy Metric
The Kullback-Leibler (KL) divergence has been adopted as privacy criteria,
following the perspective of Jaynes’ rationale on entropy maximization methods.
Since the KL divergence may be regarded as a generalization of entropy of a
distribution, relative to another, it is often referred to as relative entropy.
D(p || q) = Ep log
p(x)
q(x)
= p(x)log
x
∑
p(x)
q(x)
11. 11/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Techniques
Utility Metric
A measure of how an item is useful for a certain user is needed.
We could convey that an item is useful if its profile is somehow similar to the
user profile.
Hence we need a measure of similarity.
Content based recommender models are defined as similarity measures
between users and item profiles. This is provided by the cosine-based similarity
measure:
12. 12/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Techniques
Performance Metric
The recommender system is evaluated considering a content retrieval scenario
where a user is provided with a ranked list of N recommended items.
The performance metric adopted is hence among the commonly used for
ranked list prediction, i.e. precision at top N.
In the field of Information Retrieval precision can be defined as the fraction of
recommended items that are relevant for a target user.
13. 13/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Techniques
Tag Forgery and Suppression
Tag suppression and forgery are privacy enhancing techniques that helps users
who tags resources online, from revealing sensible information to a possible
attacker.
14. 14/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Techniques
Tag Forgery and Suppression Rates
The tag forgery rate represents the ratio of forged items:
The tag suppression rate, is the proportion of items that the user consents to
eliminate:
ρ ∈ [0,1)
σ ∈ [0,1)
15. 15/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Techniques
The Privacy-Forgery-Suppression Function
Consistently the privacy-forgery-suppression function can be defined:
P(ρ,σ ) = maxr,s D
q +r − s
1+ ρ −σ
÷
ri ≥ 0 ri = ρ
i
n
∑
qi ≥ si ≥ 0 si =
1
n
∑ σ
17. 17/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Evaluation
Statistics about the dataset
Categories 11 Users 1867
Item-Category
Tuples
98998 Avg. tags per user 477.75
Items 69226
Avg. Items per
Category
81044
Avg. categories
per item
1.4 Tags per item 13.06
18. 18/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Results
Relative Risk Reduction with forgery - Utility
100×
Dinit (um || P)− Dρ,σ (um || P)
Dinit (um || P)
19. 19/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Results
Relative Risk Reduction with suppression - Utility
20. 20/21
Research Seminar. Silvia Puglisi
Departament d'Enginyeria Telemàtica
Conclusions
Tag suppression and forgery are simple privacy enhancing techniques able to
protect users privacy at the cost of some semantic loss.
This study shows with a simple experimental evaluation, in a real world
application scenario, how the performances degradation of a recommender
system, is small if compared to the privacy risk reduction offered by the
application of these techniques.
In information systems , a tag is a non-hierarchical keyword or term assigned to a piece of information (such as an Internet bookmark , digital image, or computer file ). This kind of metadata helps describe an item and allows it to be found again by browsing or searching. Tags are generally chosen informally and personally by the item's creator or by its viewer, depending on the system. Labeling and tagging are carried out to perform functions such as aiding in classification , marking ownership, noting boundaries, and indicating online identity . They may take the form of words, images, or other identifying marks. An analogous example of tags in the physical world is museum object tagging. In the organization of information and objects, the use of textual keywords as part of identification and classification long predates computers. However, computer based searching made the use of keywords a rapid way of exploring records.
Tagging has gained wide popularity due to the growth of social networking, photography sharing and bookmarking sites. These sites allow users to create and manage labels (or “tags”) that categorize content using simple keywords. The use of keywords as part of an identification and classification system long predates computers. In the early days of the web keywords meta tags were used by web page designers to tell search engines what the web page was about. Today's tagging takes the meta keywords concept and re-uses it. The users add the tags. The tags are clearly visible, and are themselves links to other items that share that keyword tag. User annotate items that are relevant for them. Tags describe interests, tastes, needs.
Tagging is popular. Everyone using web or mobile app tags resources online. Many blog systems allow authors to add free-form tags to a post, along with (or instead of) placing the post into categories. For example, a post may display that it has been tagged with baseball and tickets . Each of those tags is usually a web link leading to an index page listing all of the posts associated with that tag. The blog may have a sidebar listing all the tags in use on that blog, with each tag leading to an index page. To reclassify a post, an author edits its list of tags. All connections between posts are automatically tracked and updated by the blog software; there is no need to relocate the page within a complex hierarchy of categories.
One of the most popular privacy criteria in database anonymisation is k-anonymity. I.e. each combination of key attribute values is shared by at least k records in the set. K-anonymity is vulnerable against similarity attacks. An attacker will be able to compromise user privacy as long as the apparent user profile diverges from a reference probability measure. In probability theory and information theory , the Kullback–Leibler divergence [1] [2] [3] (also information divergence , information gain , relative entropy , or KLIC ) is a non-symmetric measure of the difference between two probability distributions P and Q . Specifically, the Kullback–Leibler divergence of Q from P , denoted D KL ( P || Q ), is a measure of the information lost when Q is used to approximate P : [4] KL measures the expected number of extra bits required to code samples from P when using a code based on Q , rather than using a code based on P . Typically P represents the "true" distribution of data, observations, or a precisely calculated theoretical distribution. The measure Q typically represents a theory, model, description, or approximation of P . Although it is often intuited as a metric or distance, the KL divergence is not a true metric — for example, it is not symmetric: the KL from P to Q is generally not the same as the KL from Q to P . However, its infinitesimal form, specifically its Hessian, is a metric tensor: it is the Fisher information metric.
Cosine similarity is a measure of similarity between two vectors of an inner product space that measures the cosine of the angle between them. The cosine of 0° is 1, and it is less than 1 for any other angle. It is thus a judgement of orientation and not magnitude: two vectors with the same orientation have a Cosine similarity of 1, two vectors at 90° have a similarity of 0, and two vectors diametrically opposed have a similarity of -1, independent of their magnitude. Cosine similarity is particularly used in positive space, where the outcome is neatly bounded in [0,1].
Two possible strategies can be contemplated for the user: a mixed strategy, where forgery and suppression are used in conjunction, a pure strategy , where either forgery or suppression are applied. Only the pure strategy is going to be evaluated for the purpose of this study. q is introduced as the probability distribution of the known items of a particular user. This is the probability distribution capturing the actual preferences of the user.