pinecone/core-2020-05-10-deduplication huggingface dataset:
SWiM -- A Semantic Wiki for Mathematical Knowledge Management

SWiM is a semantic wiki for collaboratively building, editing and browsing
mathematical knowledge represented in the domain-specific structural semantic
markup language OMDoc. It motivates users to contribute to collections of
mathematical knowledge by instantly sharing the benefits of knowledge-powered
services with them. SWiM is currently being used for authoring content
dictionaries, i. e. collections of uniquely identified mathematical symbols,
and prepared for managing a large-scale proof formalisation effort
Just enough structure at the edge of chaos: Agile information system development in practice

Agile information systems development is not well understood and suffers from a lack of sustainable theories, which are based on empirical research of practice. We use a framework that focuses on the ‘edge of chaos’ as the area, where agile information systems development takes place to fill in this gap. Our study identifies for a concrete project under investigation, where the beneficial balance between stability and instability lies. It discusses the circumstances, which influence this balance and the relationships of the elements, which constitute it
Model driven formal development of digital libraries

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-68262-2_13Revised Selected Papers of the Third International Conference, WEBIST 2007, Barcelona, Spain, March 3-6, 2007This paper shows our model-driven approach for the formal construction and validation of Digital Libraries (DLs). We have defined a Domain Specific Visual Language (DSVL) called VisMODLE, which allows the description of a DL using five different viewpoints: services, behaviour, collections, structure and society. From a meta-model based description of the different viewpoints, we have generated a modelling environment for VisMODLE. We have provided the environment with a code generator that produces XUL code for the DL’s user interface and composes the application using predefined components that implement the different services. Moreover, we have also added validation and simulation capabilities to the environment. Using the behavioural models (state-machine based), we can visually animate the system. In addition, the combined behaviour of actors and services can be transformed into a Petri net for further analysis.Work sponsored by projects MODUWEB (TIN2006-09678) and MOSAIC (TIC2005-08225-C07-06) of the Spanish Ministry of Science and Educatio
A Formal Account of WS-BPEL

We introduce B lite, a lightweight language for web services orchestration designed around some of WS-BPEL peculiar features like partner links, process termination, message correlation, long-running business transactions and compensation handlers. B lite  formal presentation helps clarifying some ambiguous aspects of the WS-BPEL specification, which have led to engines implementing different semantics and, thus, have undermined portability of WS-BPEL programs over different platforms. We illustrate the main features of B lite  by means of many examples, some of which are also exploited to test and compare the behaviour of three of the most known free WS-BPEL engines.\u
Implementing Session Centered Calculi

Recently, specific attention has been devoted to the development of service oriented process calculi. Besides the foundational aspects, it is also interesting to have prototype implementations for them in order to assess usability and to minimize the gap between theory and practice. Typically, these implementations are done in Java taking advantage of its mechanisms supporting network applications. However, most of the recurrent features of service oriented applications are re-implemented from scratch. In this paper we show how to implement a service oriented calculus, CaSPiS (Calculus of Services with Pipelines and Sessions) using the Java framework IMC, where recurrent mechanisms for network applications are already provided. By using the session oriented and pattern matching communication mechanisms provided by IMC, it is relatively simple to implement in Java all CaSPiS abstractions and thus to easily write the implementation in Java of a CaSPiS process.\u
Actors with multi-headed message receive patterns

acceptance rate = 34.4%The actor model provides high-level concurrency abstractions
to coordinate simultaneous computations by message passing. Languages implementing the actor model such as Erlang commonly only support single-headed pattern matching over received messages. We propose and design an extension of Erlang style actors with receive clauses containing multi-headed message patterns. Patterns may be non-linear
and constrained by guards. We provide a number of examples to show the usefulness of the extension. We also explore the design space for multi-headed message matching semantics, for example first-match and rule priority-match semantics. The various semantics are inspired by the multi-set constraint matching semantics found in Constraint Handling
Rules. This provides us with a formal model to study actors with multiheaded message receive patterns. The system can be implemented efficiently and we have built a prototype as a library-extension to Haskell.status: publishe
Nonlinear Integer Programming

Research efforts of the past fifty years have led to a development of linear
integer programming as a mature discipline of mathematical optimization. Such a
level of maturity has not been reached when one considers nonlinear systems
subject to integrality requirements for the variables. This chapter is
dedicated to this topic.
  The primary goal is a study of a simple version of general nonlinear integer
problems, where all constraints are still linear. Our focus is on the
computational complexity of the problem, which varies significantly with the
type of nonlinear objective function in combination with the underlying
combinatorial structure. Numerous boundary cases of complexity emerge, which
sometimes surprisingly lead even to polynomial time algorithms.
  We also cover recent successful approaches for more general classes of
problems. Though no positive theoretical efficiency results are available, nor
are they likely to ever be available, these seem to be the currently most
successful and interesting approaches for solving practical problems.
  It is our belief that the study of algorithms motivated by theoretical
considerations and those motivated by our desire to solve practical instances
should and do inform one another. So it is with this viewpoint that we present
the subject, and it is in this direction that we hope to spark further
research.Comment: 57 pages. To appear in: M. J\"unger, T. Liebling, D. Naddef, G.
  Nemhauser, W. Pulleyblank, G. Reinelt, G. Rinaldi, and L. Wolsey (eds.), 50
  Years of Integer Programming 1958--2008: The Early Years and State-of-the-Art
  Surveys, Springer-Verlag, 2009, ISBN 354068274
Tropical deforestation modelling : a comparative analysis of different predictive approaches. The case study of Peten, Guatemala.

The frequent use of predictive models for analysing of complex, natural or artificial, phenomena is changing the traditional approaches to environmental and hazard problems. The continuous improvement of computer performances allows more detailed numerical methods, based on space-time discretisation, to be developed and run for a predictive modeling of complex real systems, reproducing the way their spatial patterns evolve and pointing out the degree of simulation accuracy. In this contribution we present an application of several models (Geomatics, Neural Networks, Land Cover Modeler and Dinamica EGO) in a tropical training area of Peten, Guatemala. During the last decades this region, included into the Biosphere Maya reserve, has known a fast demographic raise and a subsequent uncontrolled pressure on its own geo-resources; the test area can be divided into several sub-regions characterized by different land use dynamics. Understand and quantify these differences permits a better approximation of real system; moreover we have to consider all the physic, socio-economic parameters which will be of use for represent the complex and sometime at random, human impact. Because of the absence of detailed data for our test area, nearly all information were derived from the image processing of 41 ETM+, TM and SPOT scenes; we pointed out the past environmental dynamics and we built the Input layers for the predictive models. The data from 1998 and 2000 were used during the calibration to simulate the Land Cover changes in 2003, selected as reference date for the validation. The basic statistics permit to highlight the qualities or the weaknesses for each model on the different sub-regions
Prospective modelling of environmental dynamics. A methodological comparison applied to mountain land cover changes

During the last 10 years, scientists performed significant advances in modelling environmental dynamics. A wide range of new methodological approaches in geomatics - such as neural networks, multi-agent systems or fuzzy logics - was developed. Despite these progresses, the modelling softwares available have to be considered as experimental tools rather than as improved procedures able to work for environmental management or decision support. Particularly, the authors consider that a large number of publications suffer from lakes in the validation of the model results. This contribution describes three different modelling approaches applied to prospective land cover prediction. The first one, a combined geomatic method, uses Markov chains for temporal transition prediction while their spatial assignment is supervised manually by the construction of suitability maps. Compared to this directed method, the two others may be considered as semi automatic because both the polychotomous regression and the multilayer perceptron only need to be optimized during a training step - the algorithms detect themselves the spatial-temporal changes in land cover. The authors describe the three methodological approaches and their practical applications to two mountain studied areas: one in French Pyrenees, the second including a large part of Sierra Nevada, Spain. The article focuses on the comparison of results. The main result is that prediction scores are on the more high that land cover is persistent. They also underline that the geomatic model is complementary to the statistical ones which perform higher overall prediction rate but produce worse simulations when land cover changes are numerous
Acoustic event detection: SVM-based system and evaluation setup in CLEAR’07

In this paper, the Acoustic Event Detection (AED) system developed at the UPC is described, and its results in the CLEAR evaluations carried out in March 2007 are reported. The system uses a set of features composed of frequency-filtered band energies and perceptual features, and it is based on SVM classifiers and multi-microphone decision fusion. Also, the current evaluation setup and, in particular, the two new metrics used in this evaluation are presented.Peer ReviewedPostprint (author’s final draft
Multi-person tracking strategies based on voxel analysis

This paper presents two approaches to the problem of simultaneous tracking of several people in low resolution sequences from multiple calibrated cameras. Spatial redundancy is exploited to generate a discrete 3D binary representation of the foreground objects in the scene. Color information obtained from a zenithal camera view is added to this 3D information. The first tracking approach implements heuristic association rules between blobs labelled according to spatiotemporal connectivity criteria. Association rules are based on a cost function which considers their placement and color histogram. In the second approach, a particle filtering scheme adapted to the incoming 3D discrete data is proposed. A volume likelihood function and a discrete 3D re-sampling procedure are introduced to evaluate and drive particles. Multiple targets are tracked by means of multiple particle filters and interaction among them is modeled through a 3D blocking scheme. Evaluation over the CLEAR 2007 database yields quantitative results assessing the performance of the proposed algorithm for indoor scenarios.Postprint (published version
A New Approach to Memory Partitioning in On-board Spacecraft Software.\ud
In Fabrice Kordon and Tullio Vardanega (eds.), Reliable Software Technologies

The current trend to use partitioned architectures in on-board spacecraft software requires applications running on the same computer platform to be isolated from each other both in the temporal and memory domains. Memory isolation techniques currently used in Integrated Modular Avionics for Aeronautics usually require a Memory Management Unit (MMU), which is not commonly available in the kind of processors currently used in the Space domain. Two alternative approaches are discussed in the paper, based on some features of Ada and state-of-the art compilation tool-chains. Both approaches provide safe memory partitioning with less overhead than current IMA techniques. Some footprint and performance metrics taken on a prototype implementation of the most flexible approach are included
From domain to requirements

Source: CONCURRENCY, GRAPHS AND MODELS: ESSAYS DEDICATED TO UGO MONTANARI ON THE OCCASION OF HIS 65TH BIRTHDAY Book Series: LECTURE NOTES IN COMPUTER SCIENCE Volume: 5065 Pages: 278-300 Published: 2008We first present a summary of essentials of domain engineering, its motivation, and its modelling of abstractions of domains through the modelling of the intrinsics, support technologies, management and organisation, rules and regulations, scripts, and human behaviour of whichever domain is being described.\ud
Then we present the essence of two (of three) aspects of requirements: the domain requirements and the interface requirements prescriptions as they relate to domain descriptions and we survey the basic operations that “turn” a domain description into a domain requirements prescription: projection, instantiation, determination, extension and fitting. An essence of interface requirements is also presented: the “merging” of shared entities, operations, events and behaviours of the domain with those of the machine (i.e., the hardware and software to be designed)
On the asynchronous nature of the asynchronous π-calculus

We address the question of what kind of asynchronous com- munication is exactly modeled by the asynchronous pi-calculus (pi_a). To this purpose we define a calculus pi_B where channels are represented explicitly as special buffer processes. The base language for pi_B is the (synchronous) pi-calculus, except that ordinary processes communicate only via buffers. Then we compare this calculus with pi_a. It turns out that there is a strong correspondence between pi_a and pi_B in the case that buffers are bags: we can indeed encode each pi_a process into a strongly asynchronous bisimilar pi_B process, and each pi_B process into a weakly asynchronous bisimilar pi_a process. In case the buffers are queues or stacks, on the contrary, the correspondence does not hold. We show indeed that it is not possible to translate a stack or a queue into a weakly asynchronous bisimilar pi_a process. Actually, for stacks we show an even stronger result, namely that they cannot be encoded into weakly (asynchronous) bisimilar processes in a pi-calculus without mixed choice
What Do Semantics Matter When the Meat Is Overcooked?

This is the author's final draft of the paper published as Lecture Notes in Computer Science, 2008, volume 5065, pp. 563-580.  The original publication is available at www.springerlink.com.  Doi: 10.1007/978-3-540-68679-8_35We develop an abstract operational model for configuration management under service-oriented computing. This semantics is based on a graph-based representation of the configuration of global computers and an operational model of service-oriented dynamic reconfiguration based on a resolution-like mechanism similar to concurrent constraint programming. A resolution step involves a goal executed by a business activity and a clause that corresponds to a complex service. Unification captures service discovery, ranking and selection based on SLA-constraint optimisation and interpretations between specifications of conversations expected by the goal and provided by the discovered service. The resolvent is a reconfiguration of the original business activity that results from binding the goal with the discovered service
Specifying and Analysing SOC Applications with COWS

COWS is a recently defined process calculus for specifying and combining service-oriented applications, while modelling their dynamic behaviour. Since its introduction, a number of methods and tools have been devised to analyse COWS specifications, like e.g. a type system to check confidentiality properties, a logic and a model checker to express and check functional properties of services. In this paper, by means of a case study in the area of automotive systems, we demonstrate that COWS, with some mild linguistic additions, can model all the phases of the life cycle of service-oriented applications, such as publication, discovery, negotiation, orchestration, deployment, reconfiguration and execution. We also provide a flavour of the properties that can be analysed by using the tools mentioned above
The W_3 algebra: modules, semi-infinite cohomology and BV-algebras

The noncritical $D=4$ $W_3$ string is a model of $W_3$ gravity coupled to two
free scalar fields. In this paper we discuss its BRST quantization in direct
analogy with that of the $D=2$ (Virasoro) string. In particular, we calculate
the physical spectrum as a problem in BRST cohomology. The corresponding
operator cohomology forms a BV-algebra. We model this BV-algebra on that of the
polyderivations of a commutative ring on six variables with a quadratic
constraint, or, equivalently, on the BV-algebra of (polynomial) polyvector
fields on the base affine space of $SL(3,C)$. In this paper we attempt to
present a complete summary of the progress made in these studies. [...]Comment: 144 pages; 23 uuencoded ps figures; uses macros tables.tex, epsf and
  amssym.def (version 2.1 or later
Differential evolution for the offline and online optimization of fed-batch fermentation processes

The optimization of input variables (typically feeding trajectories over
time) in fed-batch fermentations has gained special attention, given the economic impact
and the complexity of the problem. Evolutionary Computation (EC) has been a
source of algorithms that have shown good performance in this task. In this chapter,
Differential Evolution (DE) is proposed to tackle this problem and quite promising
results are shown. DE is tested in several real world case studies and compared with
other EC algorihtms, such as Evolutionary Algorithms and Particle Swarms. Furthermore,
DE is also proposed as an alternative to perform online optimization, where the
input variables are adjusted while the real fermentation process is ongoing. In this case,
a changing landscape is optimized, therefore making the task of the algorithms more
difficult. However, that fact does not impair the performance of the DE and confirms
its good behaviour
Multiset Bisimulations as a Common Framework for Ordinary and Probabilistic Bisimulations

Our concrete objective is to present both ordinary bisimulations and probabilistic bisimulations in a common coalgebraic framework based on multiset bisimulations. For that we show how to relate the underlying powerset and probabilistic distributions functors with the multiset functor by means of adequate natural transformations. This leads us to the general topic that we investigate in the paper: a natural transformation from a functor F to another G transforms F-bisimulations into G-bisimulations but, in general, it is not possible to express G-bisimulations in terms of F-bisimulations. However, they can be characterized by considering Hughes and Jacobs’ notion of simulation, taking as the order on the functor F the equivalence induced by the epi-mono decomposition of the natural transformation relating F and G. We also consider the case of alternating probabilistic systems where non-deterministic and probabilistic choices are mixed, although only in a partial way, and extend all these results to categorical simulations
A caller-side inline reference monitor for an Object-Oriented intermediate language

The original publication is available at http://www.springerlink.com/content/8l30r27122322k11/Runtime security policy enforcement systems are crucial to limit the risks associated with running untrustworthy (malicious or buggy) code. The inlined reference monitor approach to policy enforcement, pioneered by Erlingsson and Schneider, implements runtime enforcement through program rewriting: security checks are inserted inside untrusted programs.
Ensuring complete mediation – the guarantee that every security-relevant event is actually intercepted by the monitor – is non-trivial when the program rewriter operates on an object-oriented intermediate language with state-of-the-art features such as virtual methods and delegates.
This paper proposes a caller-side rewriting algorithm for MSIL – the bytecode of the .NET virtual machine – where security checks are inserted around calls to security-relevant methods. We prove that this algorithm achieves sound and complete mediation and transparency for a simplified model of MSIL, and we report on our experiences with the implementation of the algorithm for full MSIL.status: publishe
Traceable privacy of recent provably-secure RFID protocols

The original publication is available at www.springerlink.comOne of the main challenges in RFIDs is the design of privacy-\ud
preserving authentication protocols. Indeed, such protocols should not\ud
only allow legitimate readers to authenticate tags but also protect these\ud
latter from privacy-violating attacks, ensuring their anonymity and un-\ud
traceability: an adversary should not be able to get any information that\ud
would reveal the identity of a tag or would be used for tracing it. In this\ud
paper, we analyze some recently proposed RFID authentication proto-\ud
cols that came with provable security \ud
avours. Our results are the  rst\ud
known privacy cryptanalysis of the protocols
A Very Compact "Perfectly Masked" S-box for AES

The article of record as published may be located at http://dx.doi.org/10.1007/978-3-540-68914-0_27Implementations of the Advanced Encryption Standard (AES), including hardware applications with limited resources (e.g., smart cards), may be vulnerable to ﾓside-channel attacks" such as differential power analysis. One countermeasure against such attacks is adding a random mask to the data; this randomizes the statistics of the calculation at the cost of computing ﾓmask corrections." The single nonlinear step in each AES round is the ﾓS-box" (involving a Galois inversion), which incurs the majority of the cost for mask corrections. Oswald (et al.) showed how the ﾔtower field" representation allows maintaining an additive mask throughout the Galois inverse calculation. This work applies a similar masking strategy to the most compact (unmasked) S-box to date. The result is the most compact masked S-box so far, with ﾓperfect masking" (by the definition of Blomer) giving suitable implementations immunity to first-order differential side-channel attacks