pinecone/core-2020-05-10-deduplication huggingface dataset:
Runtime Enforcement of Timed Properties

International audienceRuntime enforcement is a powerful technique to ensure that a running system respects some desired properties. Using an enforcement monitor, an (untrustworthy) input execution (in the form of a sequence of events) is modified into an output sequence that complies to a property. Runtime enforcement has been extensively studied over the last decade in the context of untimed properties. This paper introduces runtime enforcement of timed properties. We revisit the foundations of runtime enforcement when time between events matters.We show how runtime enforcers can be synthesized for any safety or co-safety timed property. Proposed runtime enforcers are time retardant: to produce an output sequence, additional delays are introduced between the events of the input sequence to correct it. Runtime enforcers have been prototyped and our simulation experiments validate their effectiveness
Modified constrained differential evolution for solving nonlinear global optimization problems

Nonlinear optimization problems introduce the possibility of
multiple local optima. The task of global optimization is to find a point
where the objective function obtains its most extreme value while satisfying
the constraints. Some methods try to make the solution feasible
by using penalty function methods, but the performance is not always
satisfactory since the selection of the penalty parameters for the problem
at hand is not a straightforward issue. Differential evolution has
shown to be very efficient when solving global optimization problems
with simple bounds. In this paper, we propose a modified constrained
differential evolution based on different constraints handling techniques,
namely, feasibility and dominance rules, stochastic ranking and global
competitive ranking and compare their performances on a benchmark
set of problems. A comparison with other solution methods available in
literature is also provided. The convergence behavior of the algorithm to
handle discrete and integer variables is analyzed using four well-known
mixed-integer engineering design problems. It is shown that our method
is rather effective when solving nonlinear optimization problems.Fundação para a Ciência e a Tecnologia (FCT
The evolution of the evolving neuro-fuzzy systems: from expert systems to spiking-, neurogenetic-, and quantum inspired

This chapter follows the development of a class of intelligent information systems called evolving neuro-fuzzy systems (ENFS). ENFS combine the adaptive/ evolving learning ability of neural networks and the approximate reasoning and linguistically meaningful explanation features of fuzzy rules. The review includes fuzzy expert systems, fuzzy neuronal networks, evolving connectionist systems, spiking neural networks, neurogenetic systems, and quantum inspired systems, all discussed from the point of few of fuzzy rule interpretation as new knowledge acquired during their adaptive/evolving learning. This review is based on the author’s personal (evolving) research, integrating principles from neural networks, fuzzy systems and nature
Characterization of the Free-Molecular Pressure Probe Employing Gas-Kinetic Simulation

Free-molecular pressure probes are employed to deduce particle flux in highly rarefied flow fields, such as the farfield or the backflow region of a plume expanding into vacuum. Analytical approaches to model the probe behavior are known in the literature for some time now. Numerical methods such as DSMC however allow to conduct investigations into the probe response in regimes inaccessible to analytical approaches. Besides, the numerical results may be compared to theoretical models in order to test their fidelity. We computed the response of a probe with slot orifice to a highly rarefied, parallel flow with varying molecular speed ratio.We confirmed the negligible influence of the speed ratio on probe response for low angles of attack, but observed significant deviations from theory as the angle of attack\ud
approaches 90 degrees
Numerical Simulation of the Oscillatory Ventilation in Simplified Human Lung Models

To improve the understanding of gas transport mechanisms under conditions of high-frequency oscillatory ventilation (HFOV), we performed numerical simulations of the unsteady flow in simplified airway geometries using time varying\ud
Dirichlet boundary conditions (BC) for the pressure. The flow in a generic trachea shows excellent agreement with the analytical solution for non-dimensional frequencies up to Wo = 14. Nonetheless, the computational effort increases with\ud
Wo due to a long relaxation phase and strong velocity gradients near the wall despite of relatively low Reynolds numbers.We also use the pressure BCs on multiple\ud
open outlets at a single bifurcation and a three-generation airway model, while guaranteeing mass conservation. By employing identical and slightly different pressure\ud
values at the distal bifurcation ends, flow fields are reproduced, similar to that occurring under conditions of uneven physiological behaviour of different lung regions
Experimental Investigation of Flow Structure Formation in a Heated Duct Flow

The pattern formation of a Poiseuille flow in a rectangular duct, which is heated from below, is studied experimentally for the Reynolds number Re = 200 within the Rayleigh number range 4 ×108 ≤ Ra ≤ 7 ×108 . The channel has an aspect ratio of Γ yz = width : height = 25 : 2. As working fluid, water (Pr ≈ 6) is used. In order to study the influence of buoyancy on the forced flow, velocity fields are measured plane parallel to the heated bottom plate by means of Particle Image Velocimetry (PIV). Furthermore, the measured data is analyzed concerning the flow structure formation as a function of the temperature difference between the inflow and the bottom of the duct. In this connection, two different mechanisms can be distinguished, which cause the transition from a laminar to a turbulent flow: a successively progressing transition on the one hand and, above a certain Archimedes number Ar, an abrupt transition
Scaling of the Aeroacoustics of High-Speed Trains

The present study focuses on the scaling of aeroacoustic sound sources of a high-speed train. To cover a wide Reynolds number range the experimental investigations are carried out with a 1:25 Inter City Express 3 model by measuring in two wind tunnels by means of microphone array technique. The facilities are the Aeroacoustic Wind tunnel (AWB) of the German Aerospace Center (DLR) in Brunswick, which provides nearly perfect acoustical conditions, and in the Cryogenic wind tunnel (DNW-KKK) of the DNW (German - Dutch wind tunnels) in Cologne, which allows measurements at higher Reynolds numbers. Two sources of sound with different characteristics are identified at Reynolds numbers up to Re = 0.46 mio. The aeroacoustic noise from the bogie section is dominant for frequencies f < 5 kHz and can be characterised by cavity mode excitation. The pantograph is the dominant source of sound above f = 5 kHz with a Aeolian tone characteristic. Additionally aeroacoustic measurements at higher Reynolds numbers of up to 3.70 mio have been conducted in the DNW-KKK. By cooling down one can increase the Reynolds number, and besides, this wind tunnel admits to vary the Mach and Reynolds numbers independently. Drawback of this facility is that it is not optimised for aeroacoustic experiments and reflexions as well as the high background noise level can disturb the results. These measurements revealed only a weak Reynolds number dependence of the noise source generated at the first bogie
A transformation of business process models into software-executable models using MDA

Traditional software development projects for process-oriented organizations are time consuming and do not always guarantee the
fulfillment of the functional requirements of the client organization, and thus the quality of the resulting software product. To reduce the time
spent for developing software and improve its quality, we adopt the inclusion of automation in some parts of the software development process.
Thus, in this paper, we propose a model transformation approach to derive an executable model for the business processes of a given organization. We execute a mapping between processes (described with a business process execution language) and software components. We also propose a supporting software architecture based on an Enterprise Service Bus and on Java Business Integration, and we use an already defined methodology to execute the model transformation project.FEDER, FC
Abstraction and Verification of Properties of a Real-Time Java

We present a tool for analysing resource sharing conflicts in multithreaded Java programs. Java programs are translated to timed automata models verified afterwards by the Uppaal model checker. Analysed programs are annotated with timing information indicating the execution duration of a particular statement. Based on the timing information, the analysis of execution paths is performed, which gives an answer whether resource sharing conflicts are possible in a multithreaded Java program. If the analysis succeeds, resource locks may be eliminated from the Java program
Bigraphical modelling of architectural patterns

Selected for publication in FACS'2011 post-proceedings, to appear in Springer Lecture Notes in Computer ScienceArchery is a language for behavioural modelling of architectural patterns, supporting hierarchical composition and a type discipline. This paper extends Archery to cope with the patterns' structural dimension through a set of (re-)configuration combinators and constraints that all instances of a pattern must obey. Both types and instances of architectural patterns are semantically represented as bigraphical reactive systems and operations upon them as reaction rules. Such a bigraphical semantics provides a rigorous model for Archery patterns and reduces constraint verification in architectures to a type-checking problem
Evaluating the performance of model transformation styles in Maude

Rule-based programming has been shown to be very successful in many application areas. Two prominent examples are the specification of model transformations in model driven development approaches and the definition of structured operational semantics of formal languages. General rewriting frameworks such as Maude are flexible enough to allow the programmer to adopt and mix various rule styles. The choice between styles can be biased by the programmer’s background. For instance, experts in visual formalisms might prefer graph-rewriting styles, while experts in semantics might prefer structurally inductive rules. This paper evaluates the performance of different rule styles on a significant benchmark taken from the literature on model transformation. Depending on the actual transformation being carried out, our results show that different rule styles can offer drastically different performances. We point out the situations from which each rule style benefits to offer a valuable set of hints for choosing one style over the other
From Functional Analysis to CAD Modelling Based on Knowledge Transformation Driven by the Design Process

Part 5: Modelling for PLMInternational audienceMost of industries currently spend too much time to find information on past product design process. This considerably reduces the time it can devote to innovation. The authors assume that the design process meta-model seems very interesting for modelling the design rational and then for accelerating information retrieval. Indeed, the model of the design process partly supports every resources involved in decision making activities (i.e. who, what, when, why, where, how). The authors therefore propose the use of a MBE architecture for driving the product modelling based on the design process model. The UML activity diagrams and the IDEFØ meta-model are linked for supporting automatic generation ofproduct models using specific transformation knowledge. The CAD model is partly generated from the product functional analysis
FOLE: The First-order Logical Environment

This paper describes the first-order logical environment FOLE. Institutions
in general, and logical environments in particular, give equivalent
heterogeneous and homogeneous representations for logical systems. As such,
they offer a rigorous and principled approach to distributed interoperable
information systems via system consequence. Since FOLE is a particular logical
environment, this provides a rigorous and principled approach to distributed
interoperable first-order information systems. The FOLE represents the
formalism and semantics of first-order logic in a classification form. By using
an interpretation form, a companion approach defines the formalism and
semantics of first-order logical/relational database systems. In a strict
sense, the two forms have transformational passages (generalized inverses)
between one another. The classification form of first-order logic in the FOLE
corresponds to ideas discussed in the Information Flow Framework (IFF). The
FOLE representation follows a conceptual structures approach, that is
completely compatible with formal concept analysis and information flow.Comment: Conceptual Structures for STEM Research and Education, 20th
  International Conference on Conceptual Structures, ICCS 2013, Mumbai, India,
  January 10-12, 2013. Proceedings. Can be found online at:
  http://link.springer.com/chapter/10.1007%2F978-3-642-35786-2_1
Taking SPARQL 1.1 extensions into account in the SWIP system

The SWIP system aims at hiding the complexity of expressing a query in a graph query language such as SPARQL. We propose a mechanism by which a query expressed in natural language is translated into a SPARQL query. Our system analyses the sentence in order to exhibit concepts, instances and relations. Then it generates a query in an internal format called the pivot language. Finally, it selects pre-written query patterns and instantiates them with regard to the keywords of the initial query. These queries are presented by means of explicative natural language sentences among which the user can select the query he/she is actually interested in. We are currently focusing on new kinds of queries which are handled by the new version of our system, which is now based on the 1.1 version of SPARQL
European cities in globalization: a comparative analysis based on the location strategies of advanced producer services

This is a book chapter. The original publication is available at www.springerlink.com.Today there is a key question that lurks behind any consideration of Europe and its cities: is this foundation core zone of the modern world-system showing symptoms of dropping out of the contemporary core zone? It certainly appears that in the period of crises since 2008, Europe has been falling behind other major world-regions. Dubbed the “austerity region” of the world, such an interpretation sees Europe as the first part of the world-economy core to be subject to what are effectively structural adjustment programmes, largely self-imposed but still resulting in a process of peripheralization. Although uneven in impact, this is clearly a result of Europe’s states failing to adequately manage and regulate the economic activities within their territories. However it is far too soon to say whether such a monumental global economic shift is happening but we can investigate the current unevenness of economic globalization amongst European states. We compare three of these states that represent different degrees of potential peripheralization: Spain showing the stronger symptoms, Germany with least symptoms, and Britain somewhere in between. Our study is based upon an original analysis of advanced producer services that combines comparisons between countries and relations between cities
Export decisions of services firms between agglomeration effects and market-entry costs

The paper tests the role of agglomeration effects on the export decision of services firms. Recent theories on trade with heterogeneous firms predict that export participation goes along with sunk market-entry costs. Only the more productive firms will be able to overcome these sunk costs. This leads to a process of  - ex ante - self selection. These predictions are tested for the services industry, with due account for the possible role of agglomeration effects in large-city areas. 
	Standard empirical tests of the new trade models consistently find productivity-based ex ante self selection by exporters, and this effect is mostly explained by unobserved sunk entry costs that exporters have to absorb in new foreign markets. Recent research by urban economists (e.g. Combes et al., 2012) suggests, however, that operating in large-city areas also goes along with positive productivity sorting. Ignoring this leads to upwardly biased estimates of the effect of foreign market entry costs. A large set of micro-data for establishments in Dutch services is used to investigate this hypothesis. 
	I find evidence that positive productivity self-selection is based on the combined effects of agglomeration and anticipated market-entry cost for export starters. This effect is strongest in markets with more or less homogeneous products.  I also find evidence that the productivity self-selection effect (of exporters compared to non-traders) is stronger in non-urban areas and smaller agglomerations.
Italian Lemmatization by Rules with GETARUNS

We present an approach to lemmatization based on exhaustive
morphological analysis and use of external knowledge sources to help
disambiguation which is the most relevant issue to cope with. Our system
GETARUNS was not concerned with lemmatization directly and used
morphological analysis only as backoff solution in case the word was not
retrieved in the wordform dictionaries available. We found out that both the
rules and the root dictionary needed amending. This was started during
development and before testset was distributed, but not completed for lack of
time. Thus the task final results only depict an incomplete system, which has
now eventually come to a complete version with rather different outcome. We
moved from 98.42 to 99.82 in the testset and from 99.82 to 99.91 in the devset.
As said above, this is produced by rules and is not subject to statistical
evaluation which may change according to different training sets. In this
version of the paper we perform additional experiments with WordForm
dictionaries of Italian freely available online
Logic Characterization of Invisibly Structured Languages: The Case of Floyd Languages

Operator precedence grammars define a classical Boolean and deterministic context-free language family (called Floyd languages or FLs). FLs have been shown to strictly include the well-known Visibly Pushdown Languages, and enjoy the same nice closure properties. In this paper we provide a complete characterization of FLs in terms of a suitable Monadic Second-Order Logic. Traditional approaches to logic characterization of formal languages refer explicitly to the structures over which they are interpreted - e.g, trees or graphs - or to strings that are isomorphic to the structure, as in parenthesis languages. In the case of FLs, instead, the syntactic structure of input strings is “invisible” and must be reconstructed through parsing. This requires that logic formulae encode some typical context-free parsing actions, such as shift-reduce ones
Algorithms and almost tight results for 3-colorability of small diameter graphs.

The 3-coloring problem is well known to be NP-complete. It is also well known that it remains NP-complete when the input is restricted to graphs with diameter 4. Moreover, assuming the Exponential Time Hypothesis (ETH), 3-coloring can not be solved in time 2 o(n) on graphs with n vertices and diameter at most 4. In spite of the extensive studies of the 3-coloring problem with respect to several basic parameters, the complexity status of this problem on graphs with small diameter, i.e. with diameter at most 2, or at most 3, has been a longstanding and challenging open question. In this paper we investigate graphs with small diameter. For graphs with diameter at most 2, we provide the first subexponential algorithm for 3-coloring, with complexity 2O(nlogn√). Furthermore we present a subclass of graphs with diameter 2 that admits a polynomial algorithm for 3-coloring. For graphs with diameter at most 3, we establish the complexity of 3-coloring, even for the case of triangle-free graphs. Namely we prove that for every  ε∈[0,1), 3-coloring is NP-complete on triangle-free graphs of diameter 3 and radius 2 with n vertices and minimum degree δ = Θ(n ε ). Moreover, assuming ETH, we use three different amplification techniques of our hardness results, in order to obtain for every  ε∈[0,1) subexponential asymptotic lower bounds for the complexity of 3-coloring on triangle-free graphs with diameter 3 and minimum degree δ = Θ(n ε ). Finally, we provide a 3-coloring algorithm with running time  2O(min{δΔ, nδlogδ}) for arbitrary graphs with diameter 3, where n is the number of vertices and δ (resp. Δ) is the minimum (resp. maximum) degree of the input graph. To the best of our knowledge, this algorithm is the first subexponential algorithm for graphs with δ = ω(1) and for graphs with δ = O(1) and Δ = o(n). Due to the above lower bounds of the complexity of 3-coloring, the running time of this algorithm is asymptotically almost tight when the minimum degree of the input graph is δ = Θ(n ε ), where ε∈[12,1
ISICIL: Semantics and Social Networks for Business Intelligence

International audienceThe ISICIL initiative (Information Semantic Integration through Communities of Intelligence onLine) mixes viral new web applications with formal semantic web representations and processes to integrate them into corporate practices for technological watch, business intelligence and scientific monitoring. The resulting open source platform proposes three functionalities: (1) a semantic social bookmarking platform monitored by semantic social network analysis tools, (2) a system for semantically enriching folksonomies and linking them to corporate terminologies and (3) semantically augmented user interfaces , activity monitoring and reporting tools for business intelligence
Evolution of a Flexible Manufacturing System: From Communicating to Autonomous Product

International audienceProduction activity control of industrial systems is evolving in two separate directions for the past decade, double evolution which seems contra-dictory at first. First, a deeper integration of all the actors in/each actor of the industrial system, from the raw materials suppliersup to the customerservice department dealing with customers'rising demands. This is known as the con-cept of "supply chain", generally international as the market is globalized. The second evolution is due to an increasing need for flexibility and reactivity, on one hand to answer to an increasingly varied demand, and on the other hand to have a better reaction to the disruptions appearing in the increasingly complex manufacturing systems. These evolutions imply a deep modification of the structure of these manufacturing systems, progressively mutating from an hie-rarchical organization – where the decisions are taken level by level, top to bot-tom, each level communicating its decisions to lower levels – to a networked organization, each node of this network being to some extent an/more or less an autonomous decision center. This control concept is very attractive, as it enables to significantly increase the control's robustness by considering model-ing uncertainties and disruptions. However, very few academic papers deal with a detailed example of highly intelligent products in a context of product driven systems. This paper intends to show the evolution of a flexible manufacturing system, from a data oriented perspective to a product driven one