pinecone/core-2020-05-10-deduplication huggingface dataset:
Towards self-organized service-oriented multi-agent systems

The demand for large-scale systems running in complex and even chaotic environments requires the consideration of new paradigms and technologies that provide flexibility, robustness, agility and responsiveness. Multiagents systems is pointed out as a suitable approach to address this challenge by offering an alternative way to design control systems, based on the decentralization of control functions over distributed autonomous and cooperative entities. However, in spite of their enormous potential, they usually lack some aspects related to interoperability, optimization in decentralized structures and truly self-adaptation. This paper discusses a new perspective to engineer adaptive
complex systems considering a 3-layer framework integrating several complementary
paradigms and technologies. In a first step, it suggests the integration of multi-agent systems with service-oriented architectures to overcome the limitations of interoperability and smooth migration, followed by the use of technology
enablers, such as cloud computing and wireless sensor networks, to provide a ubiquitous and reconfigurable environment. Finally, the resulted service-oriented multi-agent system should be enhanced with biologically inspired techniques, namely self-organization, to reach a truly robust, agile and adaptive system
A Complete Life-Cycle for the Semantic Enrichment of Folksonomies

International audienceTags freely provided by users of social tagging services are not explicitly semantically linked, and this significantly hinders the possibilities for browsing and exploring these data. On the other hand, folksonomies provide great opportunities to bootstrap the construction of thesauri. We propose an approach to semantic enrichment of folksonomies that integrates both automatic processing and user input, while formally supporting multiple points of view. We take into account the social structure of our target communities to integrate the folksonomy enrichment process into everyday tasks. Our system allows individual users to navigate more efficiently within folksonomies, and also to maintain their own structure of tags while benefiting from others contributions. Our approach brings also solutions to the bottleneck problem of knowledge acquisition by helping communities to build thesauri by integrating the manifold contributions of all their members, thus providing for a truly socio-semantic solution to folksonomy enrichment and thesauri construction
A Constraint Solver based on Abstract Domains

International audienceIn this article, we apply techniques from Abstract Interpretation (a general theory of semantic abstractions) to Constraint Programming (which aims at solving hard combinatorial problems with a generic framework based on first-order logics). We highlight some links and differences between these fields: both compute fixpoints by iteration but employ different extrapolation and refinement strategies; moreover, consistencies in Constraint Programming can be mapped to non-relational abstract domains. We then use these correspondences to build an abstract constraint solver that leverages abstract interpretation techniques (such as relational domains) to go beyond classic solvers. We present encouraging experimental results obtained with our prototype implementation
Quantifying Information Leakage of Randomized Protocols

International audienceThe quantification of information leakage provides a quantitative evaluation of the security of a system. We propose the usage of Markovian processes to model deterministic and probabilistic systems. By using a methodology generalizing the lattice of information approach we model refined attackers capable to observe the internal behavior of the system, and quantify the information leakage of such systems. We also use our method to obtain an algorithm for the computation of channel capacity from our Markovian models. Finally, we show how to use the method to analyze timed and non-timed attacks on the Onion Routing protocol
Component Assemblies in the Context of Manycore

International audienceWe present a component-based software design flow for building parallel applications running on top of manycore platforms. The flow is based on the BIP - Behaviour, Interaction, Priority - component frameworkand its associated toolbox. It provides full support for modeling of application software, validation of its functional correctness, modeling and performance analysis on system-level models, code generation and deployment on target manycore platforms. The paper details some of the steps of the design flow. The design flow is illustrated through the modeling and deployment of two applications, the Cholesky factorization and the MJPEG decoding on MPARM, an ARM-based manycore platform. We emphasize the merits of the design flow, notably fast performance analysis as well as code generation and effi cient deployment on manycore platforms
Range Extremum Queries

There has been a renewal of interest in data structures for range extremum queries. In such problems, the input comprises N points, which are either elements of a d-dimensional matrix, that is, their coordinates are specified by the 1D submatrices they lie in (row and column indices for d = 2), or they are points in ℝ[superscript d] . Furthermore, associated with each point is a priority that is independent of the point’s coordinate. The objective is to pre-process the given points and priorities to answer the range maximum query (RMQ): given a d-dimensional rectangle, report the points with maximum priority. The objective is to minimze the space used by the data structure and the time taken to answer the above query. This talk surveys a number of recent developments in this area, focussing on the cases d = 1 and d = 2.Pre-print23rd International Workshop On Combinatorial Algorithms (IWOCA 2012), Tamil Nadu, Indi
Square root voting system, optimal threshold and \pi

The problem of designing an optimal weighted voting system for the two-tier
voting, applicable in the case of the Council of Ministers of the European
Union (EU), is investigated. Various arguments in favour of the square root
voting system, where the voting weights of member states are proportional to
the square root of their population are discussed and a link between this
solution and the random walk in the one-dimensional lattice is established. It
is known that the voting power of every member state is approximately equal to
its voting weight, if the threshold q for the qualified majority in the voting
body is optimally chosen. We analyze the square root voting system for a
generic 'union' of M states and derive in this case an explicit approximate
formula for the level of the optimal threshold: q \simeq 1/2+1/\sqrt{{\pi} M}.
The prefactor 1/\sqrt{{\pi}} appears here as a result of averaging over the
ensemble of unions with random populations.Comment: revised version, 21 pages in late
Boomerang and Slide-Rotational Analysis of the SM3 Hash Function

SM3 is a hash function, designed by Xiaoyun Wang et al. and published by the Chinese Commercial Cryptography Administration Office for the use of electronic authentication service system. The design of SM3 builds upon the design of the SHA-2 hash function, but introduces additional strengthening features. In this paper, we present boomerang distinguishers for the SM3 compression function reduced to 32 steps out of 64 steps with complexity 214.4, 33 steps with complexity 232.4, 34 steps with complexity 253.1 and 35 steps with complexity 2117.1. Examples of zero-sum quartets for the 32-step and 33-step SM3 compression function are provided. We also point out a slide-rotational property of SM3-XOR, which exists due to the fact that constants used in the steps are not independent
Logic of Non-Monotonic Interactive Proofs (Formal Theory of Temporary
  Knowledge Transfer)

We propose a monotonic logic of internalised non-monotonic or instant
interactive proofs (LiiP) and reconstruct an existing monotonic logic of
internalised monotonic or persistent interactive proofs (LiP) as a minimal
conservative extension of LiiP. Instant interactive proofs effect a fragile
epistemic impact in their intended communities of peer reviewers that consists
in the impermanent induction of the knowledge of their proof goal by means of
the knowledge of the proof with the interpreting reviewer: If my peer reviewer
knew my proof then she would at least then (in that instant) know that its
proof goal is true. Their impact is fragile and their induction of knowledge
impermanent in the sense of being the case possibly only at the instant of
learning the proof. This accounts for the important possibility of
internalising proofs of statements whose truth value can vary, which, as
opposed to invariant statements, cannot have persistent proofs. So instant
interactive proofs effect a temporary transfer of certain propositional
knowledge (knowable ephemeral facts) via the transmission of certain individual
knowledge (knowable non-monotonic proofs) in distributed systems of multiple
interacting agents.Comment: continuation of arXiv:1201.3667 ; published extended abstract:
  DOI:10.1007/978-3-642-36039-8_16 ; related to arXiv:1208.591
Subset space logic with arbitrary announcements

In this paper we introduce public announcements to Subset Space Logic (SSL). In order to do this we have to change the original semantics for SSL a little and consider a weaker version of SSL without the cross axiom. We present an axiomatization, prove completeness and show that this logic is PSPACE-complete. Finally, we add the arbitrary announcement modality which expresses “true after any announcement”, prove several semantic results, and show completeness for a Hilbert-style axiomatization of this logic
Quantum Secret Sharing with Graph States

Revised Selected Papers - http://www.memics.cz/2012/International audienceWe study the graph-state-based quantum secret sharing protocols [24,17] which are not only very promising in terms of physical implementation, but also resource efficient since every player's share is composed of a single qubit. The threshold of a graph-state-based protocol admits a lower bound: for any graph of order n, the threshold of the corresponding n-player protocol is at least 0.506n. Regarding the upper bound, lexicographic product of the C 5 graph (cycle of size 5) are known to provide n-player protocols which threshold is n − n 0.68. Using Paley graphs we improve this bound to n − n 0.71. Moreover, using probabilistic methods, we prove the existence of graphs which associated threshold is at most 0.811n. Albeit non-constructive, probabilistic methods permit to prove that a random graph G of order n has a threshold at most 0.811n with high probability. However, verifying that the threshold of a given graph is acually smaller than 0.811n is hard since we prove that the corresponding decision problem is NP-Complete. These results are mainly based on the graphical characterization of the graph-state-based secret sharing properties, in particular we point out strong connections with domination with parity constraints
Solving electric market quadratic problems by branch and fix coordination methods

The electric market regulation in Spain (MIBEL) establishes the rules for bilateral and futures contracts in the day-ahead optimal bid problem. Our model allows a price-taker generation company to decide the unit commitment of the thermal units, the economic dispatch of the bilateral and futures contracts between the thermal units and the optimal sale bids for the thermal units observing the MIBEL regulation. The uncertainty of the spot prices is represented through scenario sets. We solve this model on the framework of the Branch and Fix Coordination metodology as a quadratic two-stage stochastic problem. In order to gain computational efficiency, we use scenario clusters and propose to use perspective cuts. Numerical results are reportedPeer ReviewedPostprint (published version
PAPAGENO: A Parallel Parser Generator for Operator Precedence Grammars

In almost all language processing applications, languages are parsed\ud
employing classical algorithms (such as the LR(1) parsers generated by Bison),\ud
which are sequential due to their left-to-right state-dependent nature. Although\ud
early theoretical studies on parallel parsing algorithms delineated potential speed-\ud
ups on abstract parallel machines using a data-parallel approach, practical devel-\ud
opments have not materialized, except in recent experiments on ad hoc parsers\ud
for large XML files. We describe a general-purpose practical generator (PA-\ud
PAGENO) able to produce efficient deterministic parallel parsers, which exhibit\ud
significant speedups when parsing large texts on modern multi-core machines,\ud
while not penalizing sequential operation. The generated parser relies on the\ud
properties of Floyd’s operator precedence grammars, to provide a naturally paral-\ud
lel implementation of the parsing process. Parsing of each text portion proceeds in\ud
parallel and independently, without communication and synchronization, until all\ud
partial parse stacks are recombined into the final result. Since Floyd’s grammars\ud
can express most syntaxes with little adaptation, we have performed extensive ex-\ud
periments, on both synthetically generated texts and real JSON documents. The\ud
effective parallel code portion in the generated parsers exceeds 80% for most of\ud
the tested scenarios
The program is the model: Enabling transformations@run.time

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-36089-3_7Revised Selected Papers of 5th International Conference, SLE 2012, Dresden, Germany, September 26-28, 2012The increasing application of Model-Driven Engineering in a wide range of domains, in addition to pure code generation, raises the need to manipulate models at runtime, as part of regular programs. Moreover, certain kinds of programming tasks can be seen as model transformation tasks, and thus we could take advantage of model transformation technology in order to facilitate them.
In this paper we report on our works to bridge the gap between regular programming and model transformation by enabling the manipulation of Java APIs as models. Our approach is based on the specification of a mapping between a Java API (e.g., Swing) and a meta-model describing it. A model transformation definition is written against the API meta-model and we have built a compiler that generates the corresponding Java bytecode according to the mapping. We present several application scenarios and discuss the mapping between object-oriented meta-modelling and the Java object system. Our proposal has been validated by a prototype implementation which is also contributed.Work funded by the Spanish Ministry of Economy and Competitivity (TIN2011-24139), and the R&D programme of Madrid Region (S2009/TIC-1650)
Solving BDD by Enumeration: An Update

International audienceBounded Distance Decoding (BDD) is a basic lattice problem used in cryptanalysis: the security of most lattice-based encryption schemes relies on the hardness of some BDD, such as LWE. We study how to solve BDD using a classical method for finding shortest vectors in lattices: enumeration with pruning speedup, such as Gama-Nguyen-Regev extreme pruning from EUROCRYPT '10. We obtain significant improvements upon Lindner-Peikert's Search-LWE algorithm (from CT-RSA '11), and update experimental cryptanalytic results, such as attacks on DSA with partially known nonces and GGH encryption challenges. Our work shows that any security estimate of BDD-based cryptosystems must take into account enumeration attacks, and that BDD enumeration can be practical even in high dimension like 350
Timing Attack against Protected RSA-CRT Implementation Used in PolarSSL

International audienceIn this paper, we present a timing attack against the RSA-CRT algorithm used in the current version 1.1.4 of PolarSSL, an open-source cryptographic library for embedded systems. This implementation uses a classical countermeasure to avoid two previous attacks of Schindler and another one due to Boneh and Brumley. However, a careful analysis reveals a bias in the implementation of Montgomery multiplication. We theoretically analyse the distribution of output values for Montgomery multiplication when the output is greater than the Montgomery constant, R. In this case, we show that an extra bit is set in the top most significant word of the output and a time variance can be observed. Then we present some proofs with reasonable assumptions to explain this bias due to an extra bit. Moreover, we show it can be used to mount an attack that reveals the factorisation. We also study another countermeasure and show its resistance against attacked library
Masonry macro-block analysis

The structural analysis involves the definition of the model and selection of the analysis type. The model should represent the stiffness, the mass and the loads of the structure. The structures can be represented using simplified models, such as the lumped mass models, and advanced models resorting the Finite Element Method (FEM) and Discrete Element Method (DEM). Depending on the characteristics of the structure, different types of analysis can be used such as limit analysis, linear and non-linear static analysis and linear and non-linear dynamic analysis.
Unreinforced masonry structures present low tensile strength and the linear analyses seem to not be adequate for assessing their structural behaviour. On the other hand, the static and dynamic non-linear analyses are complex, since they involve large time computational requirements and advanced knowledge of the practitioner. The non-linear analysis requires advanced knowledge on the material properties, analysis tools and interpretation of results. The limit analysis with macro-blocks can be assumed as a more practical method in the estimation of maximum load capacity of structure. Furthermore, the limit analysis require a reduced number of parameters, which is an advantage for the assessment of ancient and historical masonry structures, due to the difficult in obtaining reliable data
Paleoseismic History of the Dead Sea Fault Zone

International audienceThe aim of this entry is to describe the DSF as a transform plate boundary pointing out the rate of activedeformation, fault segmentation, and geometrical complexities as a control of earthquake ruptures. Thedistribution of large historical earthquakes from a revisited seismicity catalogue using detailedmacroseismic maps allows the correlation between the location of past earthquakes and fault segments.The recent results of paleoearthquake investigations (paleoseismic and archeoseismic) with a recurrenceinterval of large events and long-term slip rate are presented and discussed along with the identification ofseismic gaps along the fault. Finally, the implications for the seismic hazard assessment are also discussed
Trust*: Using Local Guarantees to Extend the Reach of Trust

We propose a new concept called trust* as a way of avoiding the necessity to transitively trust others in a range of distributed environments. The trust* approach uses guarantees based upon already established trust relationships. These localised guarantees are then used to extend trust to a new relationship (which we call trust*) which can hold between principals which are unknown to and do not trust one another. Such chains of guarantees enable the risk involved to be shifted to another party (in a similar way to real world guarantees). If a guarantee is broken, some kind of `forfeit' is imposed, either to compensate the client or to deter the server from doing it habitually. Due to trust (and hence also forfeits) being localised, the specic micro-payment and trust management mechanisms that are used to implement the protocol can be heterogeneous. This paper describes the concept of trust* and some possible applications within a domain where the service being provided is also electronic
Probabilistic Verification at Runtime for Self-Adaptive Systems

An effective design of effective and efficient self-adaptive systems may rely on several existing approaches. Software models and model checking techniques at run time represent one of them since they support automatic reasoning about such changes, detect harmful configurations, and potentially enable appropriate (self-)reactions. However, traditional model checking techniques and tools may not be applied as they are at run time, since they hardly meet the constraints imposed by on-the-fly analysis, in terms of execution time and memory occupation. For this reason, efficient run-time model checking represents a crucial research challenge. This paper precisely addresses this issue and focuses on probabilistic run-time model checking in which reliability models are given in terms of Discrete Time Markov Chains which are verified at run-time against a set of requirements expressed as logical formulae. In particular, the paper discusses the use of probabilistic model checking at run-time for self-adaptive systems by surveying and comparing the existing approaches divided in two categories: state-elimination algorithms and algebra-based algorithms. The discussion is supported by a realistic example and by empirical experiments
Intention-Aware Motion Planning

As robots venture into new application domains as autonomous vehicles on the road or as domestic helpers at home, they must recognize human intentions and behaviors in order to operate effectively. This paper investigates a new class of motion planning problems with uncertainty in human intention. We propose a method for constructing a practical model by assuming a finite set of unknown intentions. We first construct a motion model for each intention in the set and then combine these models together into a single Mixed Observability Markov Decision Process (MOMDP), which is a structured variant of the more common Partially Observable Markov Decision Process (POMDP). By leveraging the latest advances in POMDP/MOMDP approximation algorithms, we can construct and solve moderately complex models for interesting robotic tasks. Experiments in simulation and with an autonomous vehicle show that the proposed method outperforms common alternatives because of its ability in recognizing intentions and using the information effectively for decision making.Singapore-MIT Alliance for Research and Technology (SMART) (grant R-252- 000-447-592)Singapore-MIT GAMBIT Game Lab (grant R-252-000-398-490)Singapore. Ministry of Education (AcRF grant 2010-T2-2-071
Artifact-centric business process models in UML

Business process modeling using an artifact-centric approach has raised a signi cant interest over the last few years. This approach is usually stated in terms of the BALSA framework which de nes the four \dimensions" of an artifact-centric business process model: Business Artifacts, Lifecycles, Services and Associations. One of the research challenges in this area is looking for di erent diagrams to represent these dimensions. Bearing this in mind, the present paper shows how all the elements in BALSA can be represented by using the UML language. The advantages of using UML are many. First of all, it is a formal language
with a precise semantics. Secondly, it is widely used and understandable by both business people and software developers. And, last but not least, UML allows us to provide an artifact-centric speci cation for BALSA which incorporates also some aspects of process-awareness.Peer ReviewedPreprin