1,721,219 research outputs found
PLEXMATH: Mathematical framework for multiplex networks FET PROACTIVE Final Project Revision
No full textThe aim of PLEXMATH is that of formulating a brand new mathematical framework for the analysis of multi-level time-dependent complex networks in terms of tensor-like structures, in particular rank-four objects that represent with four indices the most general structure of possible connections. Generally speaking, our goal is similar
to that of Maxwell equations when representing the foundation of classical electromagnetism, i.e. to provide a closed representation of the theory (of complex networks in our case) unifying notation and dynamical equations. We therefore will accommodate current and future theoretical and algorithmic needs by adopting a radically new point of view. Capitalizing on 4th-rank order algebra we will reformulate all network descriptors and will propose dynamical equations to represent diffusive processes on multiplex networks. In doing this, we will generate
new mathematical models that will be validated on unparalleled amounts of ICT data that describe relevant socioeconomic and techno- social systems, like the structure and dynamics of social networks and transportation systems that operate at different levels. PLEXMATH constitutes a vital step towards a more general formalism for real-world networks, as the generated knowledge will substantially improve our understanding of complex systems, and will directly impact the way we deal with structural and dynamical patterns in many systems, including ICT
DATA-SIM: Data Science for Simulating the Era of Electric Vehicles
No full textDATA SIM aims at providing an entirely new and highly detailed spatio-temporal microsimulation methodology for human mobility, grounded on massive amounts of big data of various types and from various sources, with the goal to forecast the nation-wide consequences of a massive switch to electric vehicles, given the intertwined nature of mobility and power distribution networks.
While the increasing availability of big data about human activities provides radical new ways of understanding the social and ecological universe, it is our ambition in this project to complement this information with behaviourally rich data, pertaining to the purpose of human travels. In terms of interdependencies, our advanced integrated methodological environment allows for more realistic and consistent linkages across travel choices made by the individuals in the course of a day than conventional models, with the goal of simulating tens of millions of individual agents, each with their detailed prediction of every activity-travel schedule, enabling more detailed segmentations based on user profiles of the agents, different activity types, trip duration and driving ranges. Significant breakthroughs can be gained from the project, which lead to novel dimensions of use, along the milestones that were set forward in the European Industry Roadmap for the Electrification of Road Transport from today till 2020.
Many scientists have already pointed out that the goal of social sciences is not simply to understand how people behave in large groups, but to understand what motivates individuals to behave the way they do.
This fundamental insight, which can be gained from this project, is a step forward towards the solution of this important challenge,, and it can help us to better understand the dynamics of our society and, in the longer run, to have an impact on overall and wider societal well-being
2nd EATCS YOUNG RESEARCHERS SCHOOL & Topdrim SCHOOL Understanding COMPLEXITY and CONCURRENCY through TOPOLOGY of DATA -- Camerino, Italy - July 13-22, 2015
No full textThe European Association for Theoretical Computer Science (EATCS) established a series of Young Researchers Schools on TCS topics. This year we propose a trans-disciplinary school, joined with the TOPDRIM EU project school, dedicated to understanding COMPLEXITY and CONCURRENCY through TOPOLOGY of DATA. The motivation comes from the need of modern society to tame the huge amount of available data, Big Data, by constructing suitable methods that allow to extract, as much as possible, features from data and to give them semantics, to become information. Currently, topology and formal methods are the two main theoretical research areas involved in pursuing such a goal.
The school offers two main streams of topics: (i) methods from topology and their application in data analysis, and (ii) methods from semantics and models of computation, and their applications in computer science. The aim is training a future generation of transdisciplinary researchers. The topics of the lectures are of interest for PhD students and young researchers with a background in one of the two main areas. Researchers in complexity science can be also interested
DATA-SIM
No full textDATA SIM aims at providing an entirely new and highly detailed spatio-temporal microsimulation methodology for human mobility, grounded on massive amounts of big data of various types and from various sources, with the goal to forecast the nation-wide consequences of a massive switch to electric vehicles, given the intertwined nature of mobility and power distribution networks.
While the increasing availability of big data about human activities provides radical new ways of understanding the social and ecological universe, it is our ambition in this project to complement this information with behaviourally rich data, pertaining to the purpose of human travels. In terms of interdependencies, our advanced integrated methodological environment allows for more realistic and consistent linkages across travel choices made by the individuals in the course of a day than conventional models, with the goal of simulating tens of millions of individual agents, each with their detailed prediction of every activity-travel schedule, enabling more detailed segmentations based on user profiles of the agents, different activity types, trip duration and driving ranges. Significant breakthroughs can be gained from the project, which lead to novel dimensions of use, along the milestones that were set forward in the European Industry Roadmap for the Electrification of Road Transport from today till 2020.
Many scientists have already pointed out that the goal of social sciences is not simply to understand how people behave in large groups, but to understand what motivates individuals to behave the way they do. This fundamental insight, which can be gained from this project, is a step forward towards the solution of this important challenge, and it can help us to better understand the dynamics of our society and, in the longer run, to have an impact on overall and wider societal well-being
WORKSHOP on TOPOLOGY DRIVEN METHODS FOR COMPLEX SYSTEMS - Camerino, Italy - July 18th & July 22nd, 2015
No full textMany complex systems are characterised by multi-level properties that make the study of their dynamics and of their emerging phenomena a daunting task. The huge amount of data available in modern sciences can be expected to support great progress in these studies, even though the nature of the data varies. Given that, it is crucial to extract as much as possible features from data and give them semantics to become information. The aim of the 2-day workshop is to offer a wide spectrum of current research as well as applications of topological data analysis from one side and geometry and theoretical computer science form the other with the aim at training future generation of trans-disciplinary researchers
UaESMC: Usable and Efficient Secure Multiparty Computation 1st Year revison FET OPEN
No full textSecure Multiparty Computation (SMC) is a universal cryptographic functionality. In this functionality, there are n parties P1, . . . , Pn, each holding a piece of data xi, and wishing to compute a function (y1, . . . , yn) = f(x1,...,xn). They require that each party Pi only learns yi (and anything deducible from the fact that on Pi’s input xi, the output was yi), but nothing beyond that. The universality of SMC stems from the fact that any e↵ciently computable function can serve in place of f. In the 1980s, it was shown how to transform the description of any such f to a cryptographic protocol that implements SMC for that f.
The objective of UaESMC is to bring the benefits of SMC to many more and di↵erent fields of activity, where currently the parties have to weigh the benefits obtained from the interaction with other parties against the privacy losses this interaction entails. We are looking for sets of techniques and procedures that convince the parties to adopt SMC and interact without the need to consider the sensitivity of the data they would have to input to a joint computation. Regarding the techniques, we need reasonably ecient SMC protocols for the computational tasks that are actually relevant in practice. Regarding the procedures, we need means to achieve accountability and truthfulness despite strong privacy guarantees. It makes sense to perform a computation only if its result is useful, which requires that the inputs submitted by di↵erent parties are actually their true ones. This requires the design of appropriate incentive mechanisms
UaESMC: Usable and Efficient Secure Multiparty Computation FET OPEN 2nd Year Project revision
No full textSecure Multiparty Computation (SMC) is a universal cryptographic functionality. In this functionality, there are n parties P1, . . . , Pn, each holding a piece of data xi, and wishing to compute a function (y1, . . . , yn) = f(x1,...,xn). They require that each party Pi only learns yi (and anything deducible from the fact that on Pi’s input xi, the output was yi), but nothing beyond that. The universality of SMC stems from the fact that any e↵ciently computable function can serve in place of f. In the 1980s, it was shown how to transform the description of any such f to a cryptographic protocol that implements SMC for that f.
The objective of UaESMC is to bring the benefits of SMC to many more and di↵erent fields of activity, where currently the parties have to weigh the benefits obtained from the interaction with other parties against the privacy losses this interaction entails. We are looking for sets of techniques and procedures that convince the parties to adopt SMC and interact without the need to consider the sensitivity of the data they would have to input to a joint computation. Regarding the techniques, we need reasonably ecient SMC protocols for the computational tasks that are actually relevant in practice. Regarding the procedures, we need means to achieve accountability and truthfulness despite strong privacy guarantees. It makes sense to perform a computation only if its result is useful, which requires that the inputs submitted by di↵erent parties are actually their true ones. This requires the design of appropriate incentive mechanisms
PLEXMATH: Mathematical framework for multiplex networks FET PROACTIVE 1st Year project revision
No full textThe aim of PLEXMATH is that of formulating a brand new mathematical framework for the analysis of multi-level time-dependent complex networks in terms of tensor-like structures, in particular rank-four objects that represent with four indices the most general structure of possible connections. Generally speaking, our goal is similar
to that of Maxwell equations when representing the foundation of classical electromagnetism, i.e. to provide a closed representation of the theory (of complex networks in our case) unifying notation and dynamical equations. We therefore will accommodate current and future theoretical and algorithmic needs by adopting a radically new point of view. Capitalizing on 4th-rank order algebra we will reformulate all network descriptors and will propose dynamical equations to represent diffusive processes on multiplex networks. In doing this, we will generate
new mathematical models that will be validated on unparalleled amounts of ICT data that describe relevant socioeconomic and techno- social systems, like the structure and dynamics of social networks and transportation systems that operate at different levels. PLEXMATH constitutes a vital step towards a more general formalism for real-world networks, as the generated knowledge will substantially improve our understanding of complex systems, and will directly impact the way we deal with structural and dynamical patterns in many systems, including ICT
A rule based language for Web data management, Tesi di dottorato di Ricerca in Sistemi, Artificiali Intelligenti
No full textUaESMC: Usable and Efficient Secure Multiparty Computation FET OPEN 3rd Year Project revision
No full textSecure Multiparty Computation (SMC) is a universal cryptographic functionality. In this functionality, there are n parties P1, . . . , Pn, each holding a piece of data xi, and wishing to compute a function (y1, . . . , yn) = f(x1,...,xn). They require that each party Pi only learns yi (and anything deducible from the fact that on Pi’s input xi, the output was yi), but nothing beyond that. The universality of SMC stems from the fact that any e↵ciently computable function can serve in place of f. In the 1980s, it was shown how to transform the description of any such f to a cryptographic protocol that implements SMC for that f.
The objective of UaESMC is to bring the benefits of SMC to many more and di↵erent fields of activity, where currently the parties have to weigh the benefits obtained from the interaction with other parties against the privacy losses this interaction entails. We are looking for sets of techniques and procedures that convince the parties to adopt SMC and interact without the need to consider the sensitivity of the data they would have to input to a joint computation. Regarding the techniques, we need reasonably ecient SMC protocols for the computational tasks that are actually relevant in practice. Regarding the procedures, we need means to achieve accountability and truthfulness despite strong privacy guarantees. It makes sense to perform a computation only if its result is useful, which requires that the inputs submitted by di↵erent parties are actually their true ones. This requires the design of appropriate incentive mechanisms
- …
