pinecone/core-2020-05-10-deduplication huggingface dataset:
Annotation inference for separation logic based verifiers

With the years, program complexity has increased dramatically: ensuring program correctness has become considerably more difficult with the advent of multithreading, security has grown more prominent
during the last decade, etc. As a result, static verification has become more important than ever.
Automated verification tools exist, but they are only able to prove a limited set of properties, such as memory safety. If we want to prove full functional correctness of a program, other more powerful tools are available,
but they generally require a lot more input from the programmer: they often need the code to be verified to be heavily annotated. In this paper, we attempt to combine the best of both worlds by starting off with a manual verification tool based on separation logic for which we
develop techniques to automatically generate part of the required annotations. This approach provides more flexibility: for instance, it makes it possible to automatically check as large a part of the program as possible for memory errors and then manually add extra annotations only to those parts of the code where automated tools failed and/or full correctness is actually needed.status: publishe
Global State Estimates for Distributed Systems

International audienceWe consider distributed systems modeled as communicating finite state machines with reliable unbounded FIFO channels. As an essential sub-routine for control, monitoring and diagnosis applications, we provide an algorithm that computes, during the execution of the system, an estimate of the current global state of the distributed system for each local subsystem. This algorithm does not change the behavior of the system; each subsystem only computes and records a symbolic representation of the state estimates, and piggybacks some extra information to the messages sent to the other subsystems in order to refine their estimates. Our algorithm relies on the computation of reachable states. Since the reachability problem is undecidable in our model, we use abstract interpretation techniques to obtain regular overapproximations of the possible FIFO channel contents, and hence of the possible current global states. An implementation of this algorithm provides an empirical evaluation of our method
A Framework for Verifying Data-Centric Protocols

International audienceData centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, while still admitting efficient distributed execution. We show that they also provide a promising approach to the verification of distributed protocols, thanks to their data centric orientation, which allows us to explicitly handle global structures such as the topology of the network. We consider a framework using an original formalization in the Coq proof assistant of a distributed computation model based on message passing with either synchronous or asynchronous behavior. The declarative rules of the Netlog language for specifying distributed protocols and the virtual machines for evaluating these rules are encoded in Coq as well. We consider as a case study tree protocols, and show how this framework enables us to formally verify them in both the asynchronous and synchronous setting
Relational Concurrent Refinement: Timed Refinement

Data refinement in a state-based language such as Z is defined using a relational model in terms of the behaviour of abstract programs. Downward and upward simulation conditions form a sound and jointly complete methodology to verify relational data refinements, which can be checked on an event-by-event basis rather than per trace. In models of concurrency, refinement is often defined in terms of sets of observations, which can include the events a system is prepared to accept or refuse, or depend on explicit properties of states and transitions. By embedding such concurrent semantics into a relational one, eventwise verification methods for such refinement relations can be derived. In this paper we continue our program of deriving simulation conditions for process algebraic refinement by considering how notions of time should be embedded into a relational model, and thereby deriving relational notions of timed refinement
Easing Model Transformation Learning with Automatically Aligned Examples

International audienceModel Based Transformation Example (MTBE) is a recent track of research aiming at learning a transformation from examples. In most MTBE processes, a transformation example is given in the form of a source model, a transformed model and links between source elements and the corresponding transformed elements. Building the links is done manually, which is a tedious task, while in many cases, they can be de- duced from the examination of the source and transformed models, by using relevant attributes, like names or identifiers. We exploit this characteristic by proposing a semi-automatic matching operation, suitable for discovering matches between the source model and the transformed model. Our technique is inspired by and extends the Anchor-Prompt approach, and is based on the automatic discovery of pairs of anchors (pairs of elements for which there is a strong assumption of matching) to support the whole matching discovery. An implementation of the approach is provided for validation on a case study
Contracts for Model Execution Verification

International audienceOne of the main goals of model-driven engineering is the manipulation of models as exclusive software artifacts. Model execution is in particular a means to substitute models for code. We focus in this paper on verifying model executions. We use a contract-based approach to specify an execution semantics for a meta-model. We show that an execution semantics is a seamless extension of a rigorous meta-model specification and is composed of complementary levels, from static element definition to dynamic elements, execution specifications as well. We use model transformation contracts for controlling the dynamic consistent evolution of a model during its execution. As an illustration, we apply our approach to UML state machines using OCL as the contract expression language
Carrier ethernet OAM: An overview and comparison to IP OAM

Ethernet has evolved from a local area to a wide area network technology. When it is used in a service provider environment, it has more complex requirements, which demand a set of management techniques for the Ethernet layer. Ethernet OAM comprises a set of management techniques for Carrier (or Metropolitan) Ethernet networks. Carrier Ethernet devices often have IP connectivity for management purposes, which might be used for IP OAM as an alternative management solution to Ethernet OAM. This paper provides an overview of Carrier Ethernet technology and evaluates whether, and until which extent, IP-based protocols can replace Ethernet OAM in Carrier Ethernet networks
Group Behavior Recognition in Context-Aware Systems

Proceedings of: 11th International Work-Conference on Artificial Neural Networks (IWANN 2011). International Workshop of Intelligent systems for context-based information fusion (ISCIF 11). Torremolinos-Málaga, Spain, June 8-10, 2011In most of the domains of the context-aware system the user make up a group and their behavior could be research with group behavior recognition techniques. Our approach try to take advantage of the context information to understand the user's behaviors like a group, and this information could be useful for other system to beat to the users. For this purpose it is exposed a new representation that concentrates all necessary information concerning relations two to two present in the group, and the semantics of the different groups formed by individuals and training (or structure) of each one of them.This work was supported in part by Projects CICYT TIN2008-06742-C02-02/TSI, CICYT TEC2008-06732-C02-02/TEC, CAM CONTEXTS
(S2009/ TIC-1485) and DPS2008-07029-C02-02.Publicad
Modeling Detection of HIV in Cuba

International audienceA nonlinear compartmental model is developed for the HIV detection system in Cuba with different types of detections, some random and others non-random. We analyze the dynamics of this system, compute the reproduction numbers, and use the data from the Cuban HIV/AIDS epidemic between 1986-2008 to fit the model. We obtain estimates for the detection-related parameters during two separate time periods to reflect the timeline of the implementation of various types of searches. The reproduction numbers for each time period are also computed from the sets of values of the parameters. We found that random screening is most important as a mean of surveillance. Moreover, local asymptotic stability for the Disease Free Equilibrium can be achieved if (i) random screening is sufficiently effective and (ii) infection by detected HIV-positive individuals is minimal. Our results highlight the importance of education for the known infectious for the purpose of preventing further infection. Fitting the 1986-2008 HIV data to obtain the model parameter estimates indicates that the HIV epidemic in Cuba is currently approaching an endemic equilibrium
Research Opportunities in Contextualized Fusion Systems. The Harbor Surveillance Case

Proceedings of: International Workshop of Intelligent Systems for Context-Based Information Fusion (ISCIF 2011) associated to 11th International Work-Conference on Artificial Neural Networks, IWANN, Torremolinos-Málaga, Spain, June 8-10, 2011.The design of modern Information Fusion (IF) systems involves a complex process to achieve the requirements in the selected applications, especially in domains with a high degree of customization. In general, an advanced
fusion system is required to show robust, context-sensitive behavior and efficient performance in real time. It is necessary to exploit all potentially relevant sensor and contextual information in the most appropriate way. Among modern applications for IF technology is the case of surveillance of complex harbor environments
that are comprised of large numbers of surface vessels, high-value and dangerous facilities, and many people. The particular conditions and open needs in the harbor scenario are reviewed in this paper, highlighting research
opportunities to explore in the development of fusion systems in this area.This work was supported in part by Projects CICYT TIN2008-06742-C02-02/TSI, CICYT TEC2008-06732-C02-02/TEC and CAM CONTEXTS S2009/TIC-1485.Publicad
Context-Awareness at the Service of Sensor Fusion Systems: Inverting the Usual Scheme

Proceedings of: 11th International Work-Conference on Artificial Neural Networks (IWANN 2011). International Workshop of Intelligent systems for context-based information fusion (ISCIF 11). Torremolinos-Málaga, Spain, June 8-10, 2011Many works on context-aware systems make use of location, navigation or tracking services offered by an underlying sensor fusion module, as part of the relevant contextual information. The obtained knowledge is typically consumed only by the high level layers of the system, in spite that context itself represents a valuable source of information from which every part of the implemented system could take benefit. This paper closes the loop, analyzing how can context knowledge be applied to improve the accuracy, robustness and adaptability of sensor fusion processes. The whole theoretical analysis will be related with the indoor/outdoor navigation system implemented for a wheeled robotic platform. Some preliminary results are presented, where the context information provided by a map is integrated in the sensor fusion system.This work was supported in part by Projects ATLANTIDA, CICYT TIN2008-06742-C02-02/TSI, CICYT TEC2008-06732-C02-02/TEC, SINPROB, CAM MADRINET S-0505/TIC/0255 DPS2008-07029-C02-02.Publicad
Back propagation with balanced MSE cost Function and nearest neighbor editing for handling class overlap and class imbalance

The class imbalance problem has been considered a critical factor for designing and constructing the supervised classifiers. In the case of artificial neural networks, this complexity negatively affects the generalization process on under-represented classes. However, it has also been observed that the decrease in the performance attainable of standard learners is not directly caused by the class imbalance, but is also related with other difficulties, such as overlapping. In this work, a new empirical study for handling class overlap and class imbalance on multi-class problem is described. In order to solve this problem, we propose the joint use of editing techniques and a modified MSE cost function for MLP. This analysis was made on a remote sensing data . The experimental results demonstrate the consistency and validity of the combined strategy here proposedPartially supported by the Spanish Ministry of Education and Science under grants CSD2007–00018, TIN2009–14205–C04–04, and by Fundació Caixa Castelló–Bancaixa under grants P1–1B2009–04 and P1–1B2009–45; SDMAIA-010 of the TESJO and 2933/2010 from the UAE
A Novel Strategy for Improving the Quality of Embedded Zerotree Wavelet Images Transmitted over Alamouti Coding Systems

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-21501-8[Abstract] This work deals with the transmission of images, previously coded using the Embedded Zerotree Wavelet (EZW) transform, over wireless systems in which
Space-Time Coding (STC) is used. It is shown how the system performance, measured in terms of Peak Signal to Noise Ratio (PSNR), can be improved using bit allocation strategies that take into account the special structure of the EZW bitstream, where the bits firstly allocated are associated to the lowest frequency subbands, and therefore, an error–free transmission of such bits will be crucial to appropriately
recover the transmitted image.Xunta de Galicia 10TIC105003PR and 09TIC008105PRMinisterio de Ciencia e Innovación of Spain TEC2010-19545-C04-01 and CSD2008-0001
Correlating Clinical Scores with Anatomical Electrodes Locations for Assessing Deep Brain Stimulation

International audienceMovement disorders in patients with Parkinson's disease may require functional surgery, when medical therapy isn't effective. In Deep Brain Stimulation (DBS), electrodes are implanted within the brain to stimulate deep structures such as SubThalamic Nucleus (STN). This paper describes successive steps for constructing digital atlases gathering patient's location of electrode contacts and clinical scores. Three motor and three neuro- psychological scores were integrated in the study. Correlations between active contacts localization and clinical data were carried out using an adapted Hierarchical Ascendant Classification and have enabled the extraction of clusters aiming to suggest optimum sites for therapeutic STN DBS. The postero-superior region has been found to be effective for motor score improvement whereas the antero-inferior region revealed noticeable neuro- psychological scores deterioration. Comparison with existing results has shown that such atlases are very promising for understanding phenomena better
Interactive VoiceXML module into SIP-based warning distribution system

This article discusses the use of the Voice Extensible Markup Language (VoiceXML, VXML) to create a complex voice menu in danger alert communication system. The system was created as a part of research at Department of Telecommunications at the VSB - Technical University of Ostrava. Creating a voice menu provides end-users more information about the impending danger as well as instructions on how to behave in a given situation. If users receive a pre-recorded warning message in the form of a phone call, it will provide a telephone number on which they can obtain more information. In order to achieve the desired functionality, we had to use open-source PBX Asterisk, the VoiceGlue package which features both the VoiceXML interpreter and the Text-to-Speech (TTS) moduleScopus14934433
Building oblivious transfer on channel delays

In the information-theoretic setting, where adversaries have unlimited computational power, the fundamental cryptographic primitive Oblivious Transfer (OT) cannot be securely achieved if the parties are communicating over a clear channel. To preserve secrecy and security, the players have to rely on noise in the communication. Noisy channels are therefore a useful tool to model noise behavior and build protocols implementing OT. This paper explores a source of errors that is inherently present in practically any transmission medium, but has been scarcely studied in this context: delays in the communication. In order to have a model for the delays that is both general and comparable to the channels usually used for OT – such as the Binary Symmetric Channel (BSC) – we introduce a new noisy channel, the Binary Discrete-time Delaying Channel (BDDC). We show that such a channel realistically reproduces real-life communication scenarios where delays are hard to predict and we propose a protocol for achieving oblivious transfer over the BDDC. We analyze the security of our construction in the semi-honest setting, showing that our realization of OT substantially decreases the protocol sensitivity to the user’s knowledge of the channel compared to solutions relying on other channel properties, and is very efficient for wide ranges of delay probabilities. The flexibility and generality of the model opens the way for future implementation in media where delays are a fundamental characteristic
Spanning trees with generalized degree constraints arising in the design of wireless networks

In this paper we describe a minimum spanning tree problem with generalized degree constraints which arises in the design of wireless networks. The signal strength on the receiver side of a wireless link decreases with the distance between transmitter and receiver. In order to work properly, the interference on the receiving part of the link must be under a given threshold. In order to guarantee this constraint, for each node we impose a degree constraint that depends on the ”length” of the links adjacent to the corresponding node, more precisely, nodes adjacent to long links must have a smaller degree and vice-versa. The problem is complicated by considering different signal strengths for each link. Increasing the strength in a link increases the cost of the link. However, it also reduces the maximum allowed degree on its end nodes. We create two models using adequate sets of variables, one may be considered an extended version of the other, and relate, from a theoretical perspective, the corresponding linear programming relaxations.FCT - POCTI-ISFL-1-152FCT - PTDC/EIA/64772/200
Modeling and optimization of production and distribution of drinking water at VMW

We develop and discuss an operational planning model aiming at minimizing production and distribution costs in large drinking water networks containing buffers with free inflow. Modeling drinking water networks is very challenging due of the presence of complex hydraulic constraints, such as friction losses and pump curves. Non-linear, non-convex constraints result from the relationships between pressure and flow in power terms. Also, binary variables are needed to model the possibility of free inflow or re-injection of water at reservoirs. The resulting model is thus a non-convex Mixed-Integer Non-Linear Program (MINLP). A discrete-time setting is proposed to solve the problem over a finite horizon made of several intervals. A commercial solver, BONMIN, suited for convex MINLP models is used to heuristically solve the problem. We are able to find a good solution for a small part of an existing network operated by the Vlaamse Maatschappij voor Watervoorziening (VMW), a major drinking water company in Flanders
Negative Cycle Separation in Wireless Network Design

The Wireless Network Design Problem (WND) consists in choosing values of
radio-electrical parameters of transmitters of a wireless network, to maximize
network coverage. We present a pure 0-1 Linear Programming formulation for the
WND that may contain an exponential number of constraints. Violated
inequalities of this formulation are hard to separate both theoretically and in
practice. However, a relevant subset of such inequalities can be separated more
efficiently in practice and can be used to strengthen classical MILP
formulations for the WND. Preliminary computational experience confirms the
effectiveness of our new technique both in terms of quality of solutions found
and provided bounds.Comment: This is the authors' final version of the paper published in Pahl J.,
  Reiners T., Voss S. (eds), Network Optimization - INOC 2011. Lecture Notes in
  Computer Science, vol 6701, pp. 51-56. Springer, Berlin, Heidelberg, 2011,
  DOI: 10.1007/978-3-642-21527-8_7. The final publication is available at
  Springer via http://dx.doi.org/10.1007/978-3-642-21527-8_
Where Are My Intelligent Assistant's Mistakes? A Systematic Testing Approach

Intelligent assistants are handling increasingly critical tasks, but until now, end users have had no way to systematically assess where their assistants make mistakes. For some intelligent assistants, this is a serious problem: if the assistant is doing work that is important, such as assisting with qualitative research or monitoring an elderly parent’s safety, the user may pay a high cost for unnoticed mistakes. This paper addresses the problem with WYSIWYT/ML (What You See Is What You Test for Machine Learning), a human/computer partnership that enables end users to systematically test intelligent assistants. Our empirical evaluation shows that WYSIWYT/ML helped end users find assistants’ mistakes significantly more effectively than ad hoc testing. Not only did it allow users to assess an assistant’s work on an average of 117 predictions in only 10 minutes, it also scaled to a much larger data set, assessing an assistant’s work on 623 out of 1,448 predictions using only the users’ original 10 minutes’ testing effort
End-users productivity in model-based spreadsheets: an empirical study

Lecture Notes in Computer Science Volume 6654, 2011Spreadsheets are widely used and studies show that most of the existing ones contain non-trivial errors. To improve end-users productivity, recent research proposes the use of a model-driven engineering approach to spreadsheets. In this paper we conduct the first empirical study to assess the effectiveness and efficiency of this approach. A set of spreadsheet end users worked with two different model-based spreadsheets. We present and analyze here the results achieved
Private Discovery of Common Social Contacts

The increasing use of computing devices for social interactions propels the proliferation of online social applications, yet, it prompts a number of privacy concerns. One common problem occurs when two unfamiliar users, in the process of establishing social relationships, want to assess their social proximity by discovering mutual contacts. In this paper, we introduce Private Contact Discovery, a novel cryptographic primitive that lets two users, on input their respective contact lists, learn their common contacts (if any), and nothing else. We present an efficient and provably secure construction, that (i) prevents arbitrary list manipulation by means of contact certification, and (ii) guarantees user authentication and revocability. Following a rigorous cryptographic treatment of the problem, we define the privacy-protecting contact-hiding property and prove it for our solution, under the RSA assumption in the Random Oracle Model (ROM). We also show that other related cryptographic techniques, such as Private Set Intersection and Secret Handshakes, are unsuitable in this context. Experimental analysis attests to the practicality of our technique, which achieves computational and communication overhead (almost) linear in the number of contacts