pinecone/core-2020-05-10-deduplication huggingface dataset:
Verification of Java Bytecode using Analysis and Transformation of Logic
  Programs

State of the art analyzers in the Logic Programming (LP) paradigm are
nowadays mature and sophisticated. They allow inferring a wide variety of
global properties including termination, bounds on resource consumption, etc.
The aim of this work is to automatically transfer the power of such analysis
tools for LP to the analysis and verification of Java bytecode (JVML). In order
to achieve our goal, we rely on well-known techniques for meta-programming and
program specialization. More precisely, we propose to partially evaluate a JVML
interpreter implemented in LP together with (an LP representation of) a JVML
program and then analyze the residual program. Interestingly, at least for the
examples we have studied, our approach produces very simple LP representations
of the original JVML programs. This can be seen as a decompilation from JVML to
high-level LP source. By reasoning about such residual programs, we can
automatically prove in the CiaoPP system some non-trivial properties of JVML
programs such as termination, run-time error freeness and infer bounds on its
resource consumption. We are not aware of any other system which is able to
verify such advanced properties of Java bytecode
Geometric Spanner of Objects under L1 Distance (Computing and Combinatorics)

Computing and combinatorics : 14th annual international conference, COCOON 2008, Dalian, China, June 27-29, 2008 : proceedings : (Lecture notes in computer science ; 5092)The 14th Annual International Computing and Combinatorics Conference (COCOON 2008)Geometric spanner is a fundamental structure in computational geometry and plays an important role in many geometric networks design applications. In this paper, we consider the following generalized geometric spanner problem under L 1 distance: Given a set of disjoint objects S, find a spanning network G with minimum size so that for any pair of points in different objects of S, there exists a path in G with length no more than t times their L 1 distance, where t is the stretch factor. Specifically, we focus on three types of objects: rectilinear segments, axis aligned rectangles, and rectilinear monotone polygons. By combining ideas of t-weekly dominating set, walls, aligned pairs and interval cover, we develop a 4-approximation algorithm (measured by the number of Steiner points) for each type of objects. Our algorithms run in near quadratic time, and can be easily implemented for practical applications
Covering Directed Graphs by In-Trees (Computing and Combinatorics)

Computing and Combinatorics : 14th annual international conference, COCOON 2008, Dalian, China, June 27-29, 2008 : (Lecture notes in computer science ; 5092)The 14th Annual International Computing and Combinatorics Conference (COCOON 2008)Given a directed graph D = (V, A) with a set of d specified vertices S = {s 1, ..., s d } ⊆ V and a function where ℤ +  denotes the set of non-negative integers, we consider the problem which asks whether there exist in-trees denoted by for every i = 1, ..., d such that are rooted at s i , each T i, j spans vertices from which s i is reachable and the union of all arc sets of T i, j for i = 1, ..., d and j = 1, ..., f(s i ) covers A. In this paper, we prove that such set of in-trees covering A can be found by using an algorithm for the weighted matroid intersection problem in time bounded by a polynomial in and the size of D. Furthermore, for the case where D is acyclic, we present another characterization of the existence of in-trees covering A, and then we prove that in-trees covering A can be computed more efficiently than the general case by finding maximum matchings in a series of bipartite graphs
Automated verification of shape and size properties via separation logic.

Despite their popularity and importance, pointer-based programs remain a major challenge for program verification. In this paper, we propose an automated verification system that is concise, precise and expressive for ensuring the safety of pointer-based programs. Our approach uses user-definable shape predicates to allow programmers to describe a wide range of data structures with their associated size properties. To support automatic verification, we design a new entailment checking procedure that can handle well-founded inductive predicates using unfold/fold reasoning. We have proven the soundness and termination of our verification system, and have built a prototype system
Mo Músaem Fíorúil: a web-based search and information service for museum visitors

Abstract. We describe the prototype of an interactive, web-based, museum artifact search and information service. Mo Músaem Fíorúil clusters and indexes images of museum artifacts taken by visitors to the museum where the images are captured using a passive capture device such as Microsoft's SenseCam [1]. The system also matches clustered artifacts to images of the same artifact from the museums o cial photo collection and allows the user to view images of the same artifact taken by other visitors to the museum. This matching process potentially allows the system to provide more detailed information about a particular artifact to the user based on their inferred preferences, thereby greatly enhancing the user's overall museum experience. In this work, we introduce the system and describe, in broad terms, it's overall functionality and use. Using different image sets of artificial museum objects, we also describe experiments and results carried out in relation to the artifact matching component of the system
The Meta in Meta-object Architectures

International audienceBehavioral reﬂection is crucial to support for example functional upgrades, on-the-ﬂy debugging, or monitoring critical applications. However the use of reﬂective features can lead to severe problems due to inﬁnite metacall recursion even in simple cases. This is especially a problem when reﬂecting on core language features since there is a high chance that such features are used to implement the reﬂective behavior itself. In this paper we analyze the problem of inﬁnite metaob ject call recursion and solve it by providing a ﬁrst class representation of meta-level execution: at any point in the execution of a system it can be determined if we are operating on a meta-level or base level so that we can prevent inﬁnite recursion. We present how meta-level execution can be represented by a meta-context and how reﬂection becomes context-aware. Our solution makes it possible to freely apply behavioral reﬂection even on system classes: the meta-context brings stability to behavioral reﬂection. We validate the concept with a robust implementation and we present benchmarks
A Comparison of State-Based Modelling Tools for Model Validation

In model-based testing, one of the biggest decisions taken before modelling is the modelling language and the model analysis tool to be used to model the system under investigation. UML, Alloy and Z are examples of popular state-based modelling languages. In the literature, there has been research about the similarities and the differences between modelling languages. However, we believe that, in addition to recognising the expressive power of modelling languages, it is crucial to detect the capabilities and the weaknesses of analysis tools that parse and analyse models written in these languages. In order to explore this area, we have chosen four model analysis tools: USE, Alloy Analyzer, ZLive and ProZ and observed how modelling and validation stages of MBT are handled by these tools for the same system. Through this experiment, we not only concretise the tasks that form the modelling and validation stages of MBT process, but also reveal how efficiently these tasks are carried out in different tools
Bgee: integrating and comparing heterogeneous transcriptome data among species

Gene expression patterns are a key feature in understanding gene function, notably in development. Comparing gene expression patterns between animals is a major step in the study of gene function as well as of animal evolution. It also provides a link between genes and phenotypes. Thus we have developed Bgee, a database designed to compare expression patterns between animals, by implementing ontologies describing anatomies and developmental stages of species, and then designing homology relationships between anatomies and comparison criteria between developmental stages. To define homology relationships between anatomical features we have developed the software Homolonto, which uses a modified ontology alignment approach to propose homology relationships between ontologies. Bgee then uses these aligned ontologies, onto which heterogeneous expression data types are mapped. These already include microarrays and ESTs
inTrack: High Precision Tracking of Mobile Sensor Nodes

Radio-interferometric ranging is a novel technique that allows\ud
for fine-grained node localization in networks of inexpensive COTS\ud
nodes. In this paper, we show that the approach can also be applied\ud
to precision tracking of mobile sensor nodes. We introduce inTrack, a\ud
cooperative tracking system based on radio-interferometry that features\ud
high accuracy, long range and low-power operation. The system utilizes\ud
a set of nodes placed at known locations to track a mobile sensor. We\ud
analyze how target speed and measurement errors affect the accuracy of\ud
the computed locations. To demonstrate the feasibility of our approach,\ud
we describe our prototype implementation using Berkeley motes. We\ud
evaluate the system using data from both simulations and field tests
Automated unsupervised geomorphometric classification of earth surface for landslide susceptibility assessment

The aim of this work is to define an automated method of terrain classification in order to evaluate the correlation degree between topographic forms of the analyzed territory and registered landslide phenomena with a Landslide Inventory and DEMs as unique input data. A reliable procedure that identifies areas subject to different levels of susceptibility by a geomorphometric approach is presented. The main objective is reached by means of intermediate steps. The first step is the individuation of a set of measures, a geometric signature, that describes topographic form to distinguish among geomorphically different landscapes; the identified parameters are slope gradient, aspect, plan and section curvatures, local convexity and surface texture, computed from a 30x30m square-grid digital elevation model (DEM). The second step is the classification of the analyzed territory in eleven classes using the geometric signature tool. Finally, the eleven classes are statistically correlated with the Landslide Inventory of the analyzed territory. This work represents a useful tool in large-scale landslide susceptibility analysis. In fact, the application of this repeatable and reliable procedure may return the best results in a short time and with low economic resources, providing specific useful information in planning Civil Protection investigations and operations
Volterra algorithm for modelling sea surface current circulation from satellite altimetry data

This paper was utilized a new approach for modelling sea surface current from JASON-1 satellite altimetry data. This was based on utilizing of the Volterra series expansion in order to transform the time series satellite altimetry data into a real ocean surface current. Thus,the basic equation of hydrodynamic has been solved by second order Volterra model. Then, the Volterra kernel inversion used to obtain the sea surface current velocity. The finite element model of Lax-Wendorff schemes used which was based on triangular space-time elements to map the spatial current variation in the South China Sea over different monsoon periods. In situ sea surface current measurements were collected along the east coast of peninsular Malaysia by using electromagnetic current meters. The study shows that the maximum current magnitude of 1.2 m/s was occurred during the northeast monsoon period as compared to other monsoon periods. The main noticeable feature was an existence of anticlockwise eddy in the Gulf of Thailand. The results also shows a good correlation between in situ current measurements and the Volterra-Lax-Wendrof scheme with high R2 of 0.91. It can be said that Volterra-Lax-Wendrof scheme can be used as numerical scheme for modelling sea surface current from altimetry data
Feasibility and dominance rules in the electromagnetism-like algorithm for constrained global optimization

This paper presents the use of a constraint-handling technique, known as feasibility and dominance rules, in a electromagnetismlike
(ELM) mechanism for solving constrained global optimization problems. Since the original ELM algorithm is specifically designed for solving bound constrained problems, only the inequality and equality constraints violation together with the objective function value are used to select
points and to progress towards feasibility and optimality. Numerical experiments are presented, including a comparison with other methods recently reported in the literature
Hopfield neural network for sea surface current tracking from Tiungsat-1 data

This paper introduces a new approach for neural network application to coastal studies. The method is based on the utilization of the Hopfield neural network to model sea surface current movements from single TiungSAT-1 image. In matching process using Hopfield neural network, identified features have to be mathematically compared to each other in order to build an energy function that will be minimized. In this context, the neuron network has been taken in two dimensions; raw and column in order to match between the similar features of surface pattern. It was required that the two features were extracted from the same location. The Euler method is used to minimized the energy function of neuron equation. The study shows that the surface current features such as structure morphology of water plume can be automatically detected. In TiungSAT-1 data, green and near-infrared bands were competent at sea surface current features detection with high accuracy speed of Â±0.14 m/s. It can be said that, Hopfield neural network has highly promised feature enhancement and detection in optical satellite sensor such as TiungSAT-1 image. In conclusion, Hopfield neural network can be used advance computational tool for modeling the pattern movement of sea surface in satellite data
Role of defects and disorder in the half-metallic full-Heusler compounds

Half-metallic ferromagnets and especially the full-Heusler alloys containing
Co are at the center of scientific research due to their potential applications
in spintronics. For realistic devices it is important to control accurately the
creation of defects in these alloys. We review some of our late results on the
role of defects and impurities in these compounds. More precisely we present
results for the following cases (i) doping and disorder in Co$_2$Cr(Mn)Al(Si)
alloys, (ii) half-metallic ferrimagnetism appeared due to the creation of
Cr(Mn) antisites in these alloys, (iii) Co-doping in Mn$_2$VAl(Si) alloys
leading to half-metallic antiferromagnetism, and finally (iv) the occurrence of
vacancies in the full-Heusler alloys containing Co and Mn. These results are
susceptible of encouraging further theoretical and experimental research in the
properties of these compounds.Comment: Chapter intended for a book with contributions of the invited
  speakers of the International Conference on Nanoscale Magnetism 2007. Revised
  version contains new figure
Guarding Art Galleries: The Extra Cost for Sculptures is Linear

International audienceArt gallery problems have been extensively studied over the last decade and have found different type of applications. Normally the number of sides of a polygon or the general shape of the polygon is used as a measure of the complexity of the problem. In this paper we explore another measure of complexity, namely, the number of guards required to guard the boundary, or the walls, of the gallery. We prove that if n guards are necessary to guard the walls of an art gallery, then an additional team of at most 4n − 6 will guard the whole gallery. This result improves a previously known quadratic bound, and is a step towards a possibly optimal value of n − 2 additional guards. The proof is algorithmic, uses ideas from graph theory, and is mainly based on the definition of a new reduction operator which recursively eliminates the simple parts of the polygon. We also prove that every gallery with c convex vertices can be guarded by at most 2c − 4 guards, which is optimal
Analysing graph transformation rules through OCL

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-69927-9_16Proceedings of First International Conference, ICMT 2008, Zürich, Switzerland, July 1-2, 2008In this paper we present an approach to the analysis of graph transformation rules based on an intermediate OCL representation. We translate different semantics of rules into OCL, together with the properties of interest (like rule applicability, conflict or independence). The intermediate representation serves three purposes: (i) allows the seamless integration of graph transformation rules with the MOF and OCL standards, and enables taking into account meta-model and OCL constraints when verifying the correctness of the rules; (ii) permits the interoperability of graph transformation concepts with a number of standards-based model-driven development tools; and (iii) makes available a plethora of OCL tools to actually perform the rule analysis.Work supported by the Spanish Ministry of Education and Science, projects MOSAIC (TSI2005-08225-C07-06), MODUWEB (TIN2006-09678) and TIN2005-06053, and an UOC-IN3 research gran
Model Synchronisation: Definitions for Round-Trip Engineering

In a model-centric software development environment, a multitude of different models are used to describe a software system on different abstraction layers and from different perspectives. Following the MDA vision, model transformation is used to support the gradual reﬁnement from abstract models into more concrete models. However, target \ud
models do not stay untouched but may be changed due to maintenance work or evolution of the software. Therefore, in order to preserve a coherent description of the whole system, it is necessary to propagate certain changes to a target model back to the source model. However, as transformations in general are partial and not injective, they cannot be easily reversed to propagate changes. This paper presents a formal deﬁnition of round-trip engineering and the semantics of target changes in the context \ud
of partial and non-injective transformations
Secure biometric authentication with improved accuracy

We propose a new hybrid protocol for cryptographically secure biometric authentication. The main advantages of the proposed protocol over previous solutions can be summarised as follows: (1) potential for much better accuracy using different types of biometric signals, including behavioural ones; and (2) improved user privacy, since user identities are not transmitted at any point in the protocol execution. The new protocol takes advantage of state-of-the-art identification classifiers, which provide not only better accuracy, but also the possibility to perform authentication without knowing who the user claims to be. Cryptographic security is based on the Paillier public key encryption scheme
Enforcing User-Aware Browser-Based Mutual Authentication with Strong Locked Same Origin Policy

The standard solution for mutual authentication between human users and servers on the Internet is to execute a TLS handshake during which the server authenticates using a X.509 certificate followed by the authentication of the user either with own password or with some cookie stored within the user’s browser. Unfortunately, this solution is susceptible to various impersonation attacks such as phishing as it turned out that average Internet users are unable to authenticate servers based on their certificates. In this paper we address security of cookie-based authentication using the concept of strong locked same origin policy for browsers introduced at ACM CCS’07. We describe a cookie-based authentication protocol between human users and TLS-servers and prove its security in the extended formal model for browser-based mutual authentication introduced at ACM ASIACCS’08. It turns out that the small modification of the browser’s security policy is sufficient to achieve provably secure cookie-based authentication protocols considering the ability of users to recognize images, video, or audio sequences
Advanced permission-role relationship in role-based access control

Permission-role assignment is an important issue in role-based access control (RBAC). There are two types of problems that may arise in permission-role assignment. One is related to authorization granting process. Conflicting permissions may be granted to a role, and as a result, users with the role may have or derive a high level of authority. The other is related to authorization revocation. When a permission is revoked from a role, the role may still have the permission from other roles. In this paper, we discuss granting and revocation models related to mobile and immobile memberships between permissions and roles, then provide proposed authorization granting algorithm to check conflicts and help allocate the permissions without compromising the security. To our best knowledge, the new revocation models, local and global revocation, have not been studied before. The local and global revocation algorithms based on relational algebra and operations provide a rich variety. We also apply the new algorithms to an anonymity scalable payment scheme
Comparing the pre- and post-specified peer models for key agreement

13th Australasian Conference on Information Security and Privacy, ACISP 2008; Wollongong, NSW; Australia; 7 July 2008 through 9 July 2008In the pre-specified peer model for key agreement, it is assumed that a party knows the identifier of its intended communicating peer when it commences a protocol run. On the other hand, a party in the post-specified peer model for key agreement does not know the identifier of its communicating peer at the outset, but learns the identifier during the protocol run. In this paper we compare the security assurances provided by the Canetti-Krawczyk security definitions for key agreement in the pre- and post-specified peer models. We give examples of protocols that are secure in one model but insecure in the other. We also enhance the Canetti-Krawczyk security models and definitions to encompass a class of protocols that are executable and secure in both the pre- and post-specified peer models. © 2008 Springer-Verlag Berlin Heidelberg
Efficient one-round key exchange in the standard model

We consider one-round key exchange protocols  secure in the standard model. The security analysis uses the powerful security model of Canetti and Krawczyk and a natural extension of it to the ID-based setting. It is shown how KEMs can be used in a generic way to obtain two different protocol designs with progressively stronger security guarantees. A detailed analysis of the performance of the protocols is included; surprisingly, when instantiated with specific KEM constructions, the resulting protocols are competitive with the best previous schemes that have proofs only in the random oracle model