The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We address the problem of analyzing interoperable software services, focusing on determining the existence of those aspects omitted from the software services specifications, which may jeopardize the interaction between the involved parties. Based on the wide visualization possibilities offered by the representation of software service using Open Workflow Nets, we can easily identify those deadlock...
An important feature of statically typed XML programming languages is the type inference of variables in regular expression patterns, when matching is performed on input of a known type. At least, such an algorithm must be be simple, local, and locally precise. In this paper we investigate the possibility to go beyond local type inference, and propose an algorithm to compute the precise type of the...
The coloring of random graphs has been the subject of intensive research in the last decades. As a result, the asymptotic behaviour of both the chromatic number and the complexity of the colorability problem are quite well understood. However, the asymptotic results give limited help in predicting the behaviour in specific finite cases. In this paper, we consider the application of the usual backtrack...
The paper proposes a linear algebraic based approach to finding a set of home markings in a bounded and live Equal Conflict System. Our algorithm is based on the theory of T-invariants, controlled-siphons and traps. The idea is to decompose the initial net in a certain subset of T-components, which are Choice-Free nets, find a set of live and potentially reversible markings for them and then compose...
We discuss computation of approximate Gröbner bases at finite precision. We show how this can be used to deduce exact results for polynomial greatest common divisors and factorization. In particular we indicate an algorithm for factoring multivariate polynomials over the closure algebraic of the rationals.
This paper presents a new double hybridized genetic algorithm for optimizing the variable order in Reduced Ordered Binary Decision Diagrams. The first hybridization adopts embryonic chromosomes as prefixes of variable orders instead of complete variable orders and combines a branch & bound technique with the basic genetic algorithm. The second hybridization is done with the existing sifting...
We defined FCGlight, a refined version of the Fluid Construction Grammar (FCG), which is a formalism for studying the evolution of the natural language. We picked a core subset of FCG, and expressed it in the semantic framework of the Order-Sorted Features (OSF) logic. This allows for efficient processing, and also gives FCG a solid formal background for further analysis and improvement. Inspired...
We present and illustrate a method for the generation of the termination conditions for nested loops with abrupt termination statements. The conditions are (first-order) formulae obtained by certain transformations of the program text. The loops are treated similarly to calls of recursively defined functions. The program text is analyzed on all possible execution paths by forward symbolic execution...
This paper aims to offer a potential solution to the traffic management problem. In order to achieve this goal we considered implementing a distributed simulator that brings together a great variety of traffic environments. By adjusting some set of parameters of the simulation, we can get an improvement on average waiting time for many crowded infrastructures, traffic fluency being a major criterion...
The paper presents a new technique for the control of the population's dynamic in evolutionary optimization. The technique is inspired by the endocrine system, respectively, by the control mechanism of the hormones concentration. The approach is suitable for multimodal optimization in static or dynamic environment. The major advantage of the proposal is given by the fact that there is no need of a...
Many transformation systems for program optimization, program synthesis, and program specialization are based on fold/unfold transformations. In this paper, we investigate the semantic properties of a narrowing-based unfolding transformation that is useful to transform rewriting logic theories. We also present a transformation methodology that is able to determine whether an unfolding transformation...
The K framework is a rewrite-based executable semantic framework built with the purpose to define programming languages and formal analysis methods. This paper introduces K definition of the path-directed symbolic execution, which is that part of Counterexample Guided Abstraction Refinement (CEGAR) where the counterexample is checked for spuriousness. To express this technique in K, we use strongest...
Argumentation is one of the most active domains in Artificial Intelligence, especially in multi-agent systems. Since the initial work of Dung on abstract argumentation frameworks, many semantics have been proposed, but for most practical cases argument acceptability is still a matter of choice. This paper introduces a formal model that aims to provide a unifying representation of argument extensions...
We present an environment for proving correctness of mutually recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae - verification conditions. As a distinctive feature of our method, these formulae are not only sufficient, but also necessary for the correctness.
This paper presents a segregative genetic algorithm for "I"/U"-shaped assembly line balancing problem. It uses a basic genetic algorithm and a feature function that associates a time profile of the workstations to each chromosome. The similarity based clustering in the feature space induces subpopulations of chromosomes. The segregative genetic algorithm acts both on representation...
The typical approach for declaratively reasoning about phenomena that evolves in time is to use a cognitive system centered on the given problem domain ontology as a vehicle for knowledge representation and processing. Current ontological-based approaches are successful only for the static structural description of a given domain of discourse. We present a modeling approach suitable for building and...
Given a task set T, determining the number of processors leading to a feasible schedule for T is an important problem in the real-time embedded systems community. For periodic and independent task sets, the utilization rate represents a lower bound on the number of processors. A multiprocessor platform with fewer processors than the utilization rate of a given task set does not have a feasible schedule...
Chaotic behaviour has been shown to exist in financial data. This paper advances the use of the sparse kernel machine model for the prediction of directional change for this class of dynamical systems. The notions of low entropy trajectory sets and low entropy trajectory balls in phase space are defined as the building patterns for the predictor. The statistical stability and robustness of the sparse...
In this paper we address the problem of segmenting (and summarizing) a text by Formal Concept Analysis (FCA) using Lexical Chains established for the text. The first proposed method relies on the Conceptual hierarchy (Concept lattice) derived for a formal context expressing the map of Lexical Chains to the text. The second one offers a conceptual view for a segmentation, using a conceptual clustering...
Workflow management systems allow the development of complex applications at a higher level, by orchestrating functional components without handling the implementation details. Although a wide range of workflow engines are developed in enterprise environments, the open source engines available for scientific applications lack some functionalities or are too difficult to use for non-specialists. Moreover,...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.