pinecone/core-2020-05-10-deduplication huggingface dataset:
Checking model transformation refinement

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-38883-5_15Proceedings of 6th International Conference, ICMT 2013, Budapest, Hungary, June 18-19, 2013Refinement is a central notion in computer science, meaning that some artefact S can be safely replaced by a refinement R, which preserves S’s properties. Having available techniques and tools to check transformation refinement would enable (a) the reasoning on whether a transformation correctly implements some requirements, (b) whether a transformation implementation can be safely replaced by another one (e.g. when migrating from QVT-R to ATL), and (c) bring techniques from stepwise refinement for the engineering of model transformations.
In this paper, we propose an automated methodology and tool support to check transformation refinement. Our procedure admits heterogeneous specification (e.g. PaMoMo, Tracts, OCL) and implementation languages (e.g. ATL, QVT), relying on their translation to OCL as a common representation formalism and on the use of model finding tools.Research partially funded by the Nouvelles Equipes ´Program of the Pays de la Loire Region (France), the EU project NESSoS (FP7 256890), the Spanish Ministry of Economy and Competitivity (project “Go Lite” TIN2011-24139), the R&D programme of the Madrid Region (project “e-Madrid” S2009/TIC-1650
Spatio-temporal Registration of 2D US and 3D MR images for the Characterization of Hypertrophic Cardiomyopathy

International audienceA spatio-temporal registration procedure of speckle tracking echocardiography (STE) and cine magnetic resonance (MR) images is presented. It aims to fuse the mechanical information in STE with the tissue information in MR late-gadolinium-enhanced image (LGE-MR), in order to describe the relationship between left ventricular myocar- dial strain and macroscopic fibrosis in patients with hypertrophic cardiomyopathy (HCM). The registration was performed between the four- chambers-view STE contours (at rest), and the endocardial surfaces of the left ventricle (LV) from cine-MR short-axis-view sequence. The dy- namic LV geometries were described by their Fourier descriptors. This spatio-temporal representation of LV geometries was exploited to avoid the lack of dissimilarity between static geometries. To accomplish this goal, the temporal alignment was performed with the dynamical time warping method. The registration was evaluated on four HCM patients with myocardial fibrosis. First results suggest a relationship between my- ocardial fibrosis and the modification of the strain curve
Surface-based electrophysiology modeling and assessment of physiological simulations in atria

International audienceThe objective of this paper is to assess a previously-proposed surface-based electrophysiology model with detailed atrial simulations. This model - derived and substantiated by mathematical arguments - is specifically designed to address thin structures such as atria, and to take into account strong anisotropy effects related to fiber directions with possibly rapid variations across the wall thickness. The simulation results are in excellent adequacy with previous studies, and confirm the importance of anisotropy effects and variations thereof. Furthermore, this surface-based model provides dramatic computational benefits over 3D models with preserved accuracy
Model-Driven Engineering for Trusted Embedded Systems based on Security and Dependability Patterns

Nowadays, many practitioners express their worries about current software engineering practices. New recommendations should be considered to ground software engineering on two pillars: solid theory and proven principles. We took the second pillar towards software engineering for embedded system applications, focusing on the problem of integrating Security and Dependability (S&D) by design to foster reuse. The framework and the methodology we propose associate the model-driven paradigm and a model-based repository of S&D patterns to support the design of trusted Resource Constrained Embedded System (RCES) applications for multiple domains (e.g., railway, metrology, automotive). The approach has been successfully evaluated by the TERESA project external reviewers as well as internally by the Ikerlan Research Center for the railway domain
Static analysis techniques to verify mutual exclusion situations within SysML models

AVATAR is a real-time extension of SysML supported by the TTool open-source toolkit. So far, formal verification of AVATAR models has relied on reachability techniques that face a state explosion problem. The paper explores a new avenue: applying structural analysis to AVATAR model, so as to identify mutual exclusion situations. In practice, TTool translates a subset of an AVATAR model into a Petri net and solves an equation system built upon the incidence matrix of the net. TTool implements a push-button approach and displays verification results at the AVATAR model level. The approach is not restricted to AVATAR and may be adapted to other UML profiles
Significantly Increasing the Usability of Model Analysis Tools through Visual Feedback

A plethora of theoretical results are available which make possible the use of dynamic analysis and model-checking for software and system models expressed in high-level modeling languages like UML, SDL or AADL. Their usage is hindered by the complexity of information processing demanded from the modeler in order to apply them and to effectively exploit their results. Our thesis is that by improving the visual presentation of the analysis results, their exploitation can be highly improved. To support this thesis, we define a trace analysis approach based on the extraction of high-level semantics events from the low-level output of a simulation or model-checking tool. This extraction offers the basis for new types of scenario visualizations, improving scenario understanding and exploration. This approach was implemented in our UML/SysML analyzer and was validated in a controlled experiment that shows a significant increase in the usability of our tool, both in terms of task performance speed and in terms of user satisfaction
Completeness of Conversion between Reactive Programs for Ultrametric Models

In 1970 Friedman proved completeness of beta eta conversion in the simply-typed lambda calculus for the set-theoretical model. Recently Krishnaswami and Benton have captured the essence of Hudak’s reactive programs in an extension of simply typed lambda calculus with causal streams and a temporal modality and provided this typed lambda calculus for reactive programs with a sound ultrametric semantics.\ud
We show that beta eta conversion in the typed lambda calculus of reactive programs is complete for the ultrametric model.Peer-reviewedPost-print11th International Conference on Typed Lambda Calculi and Applications (TLCA), Eindhove
Realizability for Peano Arithmetic with Winning Conditions in HON Games

International audienceWe build a realizability model for Peano arithmetic based on winning conditions for HON games. First we define a notion of winning strategies on arenas equipped with winning conditions. We prove that the interpretation of a classical proof of a formula is a winning strategy on the arena with winning condition corresponding to the formula. Finally we apply this to Peano arithmetic with relativized quantifications and give the example of witness extraction for Π 0 2 -formulas
Efficient Algorithms for Universal Quantum Simulation

A universal quantum simulator would enable efficient simulation of quantum
dynamics by implementing quantum-simulation algorithms on a quantum computer.
Specifically the quantum simulator would efficiently generate qubit-string
states that closely approximate physical states obtained from a broad class of
dynamical evolutions. I provide an overview of theoretical research into
universal quantum simulators and the strategies for minimizing computational
space and time costs. Applications to simulating many-body quantum simulation
and solving linear equations are discussed
On the Effects of Omitting Information Exchange between Autonomous Resource Management Agents

We study the problem of information exchange between coordinated autonomous resource management agents. We limit information to that which can be directly observed by each agent. While exchanging all relevant observables leads to near optimal management, leaving out information leads to ”hidden variable” problems that affect only part of the overall behavior. The patterns observed for hidden variables in simulation predict what will happen in a realistic situation when not all information is interchanged. Through simulation, we observe that leaving out information results in non-optimal behavior of the resource management model when resource needs are decreasing, although the partial information model performs very well when resource needs are increasing
Retrieving monitoring and accounting information from constrained devices in internet-of-things applications

Internet-of-Things (IoT) is envisioned to provide connectiv- ity to a vast number of sensing or actuating devices with limited com- putational and communication capabilities. For the organizations that manage these constrained devices, the monitoring of each device's oper- ational status and performance level as well as the accounting of their re- source usage are of great importance. However, monitoring and account- ing support is lacking in today's IoT platforms. Hence, this paper stud- ies the applicability of the Constrained Application Protocol (CoAP), a lightweight transfer protocol under development by IETF, for eciently retrieving monitoring and accounting data from constrained devices. On the infrastructure side, the developed prototype relies on using stan- dard building blocks oered by the AMAAIS project in order to collect, pre-process, distribute, and persistently store monitoring and account- ing information. Necessary on-device and infrastructure components are prototypically implemented and empirically evaluated in a realistic sim- ulation environment. Experiment results indicate that CoAP is suited for eciently transferring monitoring and accounting data, both due to a small energy footprint and a memory-wise compact implementation
Semigroup approach to conservation laws with discontinuous flux

International audienceThe model one-dimensional conservation law with discontinuous spatially heterogeneous flux is $$ u_t + \mathfrak{f}(x,u)_x=0, \quad \mathfrak {f}(x,\cdot)= f^l(x,\cdot)\char_{x<0}\!+f^r(x,\cdot)\char_{x>0}. \eqno (\text{EvPb}) $$ We prove well-posedness for the Cauchy problem for (\text{EvPb}) in the framework of solutions satisfying the so-called adapted entropy inequalities. Exploiting the notion of integral solution that comes from the nonlinear semigroup theory, we propose a way to circumvent the use of strong interface traces for the evolution problem $(\text{EvPb})$ (in fact, proving existence of such traces for the case of $x$-dependent $f^{l,r}$ would be a delicate technical issue). The difficulty is shifted to the study of the associated one-dimensional stationary problem $ u + \mathfrak{f}(x,u)_x=g$, where existence of strong interface traces of entropy solutions is an easy fact. We give a direct proof of this fact, avoiding the subtle arguments of kinetic formulation \cite{KwonVasseur} or of the $H$-measure approach \cite{Panov-trace}
Umbra designer: Graphical modelling for telephony services

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-39013-5_13Proceedings of 9th European Conference, ECMFA 2013, Montpellier, France, July 1-5, 2013Almira Labs is a software company that develops value-added services for the telecommunications industry. It is focused on innovative technologies that enable enterprise business and mobile and landline operators to offer next-generation voice-driven applications for all types of phones. Telephony services are built atop the proprietary Umbra framework, which is a Java API relying on the JAIN SLEE standard for event-based communication applications.
This paper describes Umbra Designer, a novel graphical modelling tool for the visual development of telephony services, from which Java code for the Umbra framework is synthesized. In this way, it is easy to develop ready-to-use services, even by users not familiar with the Java API or the JAIN SLEE standard. We also report on some experiments aimed at measuring the efficiency gain derived from using the graphical tool, compared with coding directly using the Java API.This work was partially funded by the Innocash program and the project “Go Lite” TIN2011-24139 of the Spanish Ministry of Economy and Competitivity. The work was also funded by the R&D programme of the Madrid Region (project “e-Madrid” S2009/TIC-1650
Using Model Types to Support Contract-Aware Model Substitutability

International audienceModel typing brings the benefit associated with well-defined type systems to model-driven development (MDD) through the assignment of specific types to models. In particular, model type systems enable reuse of model manipulation operations (e.g., model transformations), where manipulations defined for models of a supertype can be used to manipulate models of subtypes. Existing model typing approaches are limited to structural typing defined in terms of object-oriented metamodels (e.g., MOF) in which the only structural (well-formedness) constraints are those that can be expressed directly in metamodeling notations (e.g., multiplicity and element containment constraints). In this paper we describe an extension to model typing that takes into consideration structural invariants, other than those that can be expressed directly in metamodeling notation, and specifications of behaviors associated with model types. The approach supports contract-aware substitutability, where contracts are defined in terms of invariants and pre-/postconditions expressed using OCL. Support for behavioral typing paves the way for behavioral substitutability. We also describe a technique to rigorously reason about model type substitutability as supported by contracts and apply the technique in use cases from the optimizing compiler community
The role of quality attributes in service-based systems architecting : a survey

Quality attributes (QA) play a fundamental role when architecting software systems. However, in contrast to QA in traditional software systems, the role of QA when architecting service-based systems (SBS) has not yet been studied in depth. Thus, we conducted a descriptive survey to explore how QA are treated during the architecting of SBS. Data were collected using an online questionnaire targeted at participants with architecting experience. Our survey shows that QA and functional requirements of SBS are mostly considered equally important. Also, QA are usually treated explicitly rather than implicitly. Furthermore, dependability and performance appear to be the most important QA in the context of SBS. Our results partially show that general findings on QA also apply to the domain of SBS. On the other hand, we did not find a confirmation that QA are primary drivers for the architecting of SBS, or that certain application domains would focus on particular QA.Peer ReviewedPreprin
Benefits and drawbacks of reference architectures

Reference architectures (RA) have been studied to create a consistent notion of what constitutes them as well as their benefits and drawbacks. However, few empirical studies have been conducted to provide evidence that support the claims made. To increase this evidence, this paper investigates the actual industrial practice of using RAs. The study consists of a survey with 28 stakeholders from everis, a multinational consulting company based in Spain. We report the findings and contextualize them with previous research.Peer ReviewedPreprin
Refinement-Based Similarity Measure over DL Conjunctive Queries

Similarity assessment is a key operation in case-based reasoning and other areas of artificial intelligence. This paper focuses on measuring similarity in the context of Description Logics (DL), and specifically on similarity between individuals. The main contribution of this paper is a novel approach based on measuring similarity in the space of Conjunctive Queries, rather than in the space of concepts. The advantage of this approach is two fold. On the one hand it is independent of the underlying DL, and thus, there is no need to design similarity measures for different DL, and on the other hand, the approach is computationally more efficient than searching in the space of concepts.Partially supported by Spanish Ministry of Economy and Competitiveness under grants TIN2009-13692-C03-01 and TIN2009-13692-C03-03 and by the Generalitat de Catalunya under the grant 2009-SGR-1434Peer Reviewe
Injective Encodings to Elliptic Curves

International audienceFor a number of elliptic curve-based cryptographic protocols, it is useful and sometimes necessary to be able to encode a message (a bit string) as a point on an elliptic curve in such a way that the message can be efficiently and uniquely recovered from the point. This is for exam-ple the case if one wants to instantiate CPA-secure ElGamal encryption directly in the group of points of an elliptic curve. More practically rele-vant settings include Lindell's UC commitment scheme (EUROCRYPT 2011) or structure-preserving primitives. It turns out that constructing such an encoding function is not easy in general, especially if one wishes to encode points whose length is large rel-ative to the size of the curve. There is a probabilistic, "folklore" method for doing so, but it only provably works for messages of length less than half the size of the curve. In this paper, we investigate several approaches to injective encoding to elliptic curves, and in particular, we propose a new, essentially opti-mal geometric construction for a large class of curves, including Edwards curves; the resulting algorithm is also quite efficient, requiring only one exponentiation in the base field and simple arithmetic operations (how-ever, the curves for which the map can be constructed have a point of order two, which may be a limiting factor for possible applications). The new approach is based on the existence of a covering curve of genus 2 for which a bijective encoding is known
Complexity of increasing the secure connectivity in wireless ad hoc networks

We consider the problem of maximizing the secure connectivity in wireless ad hoc networks, and analyze complexity of the post-deployment key establishment process constrained by physical layer properties such as connectivity, energy consumption and interference. Two approaches, based on graph augmentation problems with nonlinear edge costs, are formulated. \ud
\ud
The first one is based on establishing a secret key using only the links that are already secured by shared keys. This problem is in NP-hard and does not accept polynomial time approximation scheme PTAS since minimum cutsets to be augmented do not admit constant costs. The second one extends the first problem by increasing the power level between a pair of nodes that has a secret key to enable them physically connect. \ud
\ud
This problem can be formulated as the optimal key establishment problem with  interference constraints with bi-objectives: \ud
(i) maximizing the concurrent key establishment flow, \ud
(ii) minimizing the cost. \ud
We prove that both problems are NP-hard and MAX-SNP with a reduction to MAX3SAT problem
Count-min sketches for estimating password frequency within Hamming distance two

The count-min sketch is a useful data structure for recording and estimating the frequency of string occurrences, such as passwords, in sub-linear space with high accuracy. However, it cannot be used to draw conclusions on groups of strings that are similar, for example close in Hamming distance. This paper introduces a variant of the count-min sketch which allows for estimating counts within a specified Hamming distance of the queried string. This variant can be used to prevent users from choosing popular passwords, like the original sketch, but it also allows for a more efficient method of analysing password statistics
Unfolding – a library for interactive maps

Visualizing data with geo-spatial properties has become more important and prevalent due to the wide spread dissemination of devices, sensors, databases, and services with references to the physical world. Yet, with existing tools it is often difficult to create interactive geovisualizations tailored for a particular domain or a specific dataset. We present Unfolding, a library for interactive maps and data visualization. Unfolding provides an API for designers to quickly create and customize geo-visualizations. In this paper, we describe the design criteria, the development process, and the functionalities of Unfolding. We demonstrate its versatility in use through a collection of examples. Results from a user survey suggests programmers find the library easy to learn and to use.status: publishe
Towards Unification for Pointing Task Evaluation in 3D Desktop Virtual Environment

New visualization systems for large and complex datasets are emerging and 3D Virtual Environments turn out to be a relevant solution. Interaction tasks in these 3D VE have been defined, especially to support evaluation of these applications. Nevertheless there is a lack of unified protocol to assess these elementary tasks in this context. Moreover it can be complex to determine the appropriate technique to perform these tasks as there is a lack of reference data. A standard is available for 2D pointing task, but there is no equivalence in 3D. In this paper, we propose an adaptation of this standard to a pointing task in a 3D VE. We detail our protocol and an instrumentation, which aims at assessing performance, comfort of techniques and satisfaction of users. We also present results of a user experimentation conducted according to this standard’s adaptation
Cliquewidth and knowledge compilation

In this paper we study the role of cliquewidth in succinct representation of Boolean functions. Our main statement is the following: Let Z be a Boolean circuit having cliquewidth k. Then there is another circuit Z * computing the same function as Z having treewidth at most 18k + 2 and which has at most 4|Z| gates where |Z| is the number of gates of Z. In this sense, cliquewidth is not more ‘powerful’ than treewidth for the purpose of representation of Boolean functions. We believe this is quite a surprising fact because it contrasts the situation with graphs where an upper bound on the treewidth implies an upper bound on the cliquewidth but not vice versa.\ud
We demonstrate the usefulness of the new theorem for knowledge compilation. In particular, we show that a circuit Z of cliquewidth k can be compiled into a Decomposable Negation Normal Form (dnnf) of size O(918k k 2|Z|) and the same runtime. To the best of our knowledge, this is the first result on efficient knowledge compilation parameterized by cliquewidth of a Boolean circuit