Search results for " Computer Science"

More restrictive Gray codes for some classes of pattern avoiding permutations

2009

In a recent article [W.M.B. Dukes, M.F. Flanagan, T. Mansour, V. Vajnovszki, Combinatorial Gray codes for classes of pattern avoiding permutations, Theoret. Comput. Sci. 396 (2008) 35-49], Dukes, Flanagan, Mansour and Vajnovszki present Gray codes for several families of pattern avoiding permutations. In their Gray codes two consecutive objects differ in at most four or five positions, which is not optimal. In this paper, we present a unified construction in order to refine their results (or to find other Gray codes). In particular, we obtain more restrictive Gray codes for the two Wilf classes of Catalan permutations of length n; two consecutive objects differ in at most two or three posit…

Minimal change list for Lucas strings and some graph theoretic consequences

2005

AbstractWe give a minimal change list for the set of order p length-n Lucas strings, i.e., the set of length-n binary strings with no p consecutive 1's nor a 1ℓ prefix and a 1m suffix with ℓ+m⩾p. The construction of this list proves also that the order p n-dimensional Lucas cube has a Hamiltonian path if and only if n is not a multiple of p+1, and its second power always has a Hamiltonian path.

Multi-frequency orthogonality sampling for inverse obstacle scattering problems

2011

We discuss a simple non-iterative method to reconstruct the support of a collection of obstacles from the measurements of far-field patterns of acoustic or electromagnetic waves corresponding to plane-wave incident fields with one or few incident directions at several frequencies. The method is a variant of the orthogonality sampling algorithm recently studied by Potthast (2010 Inverse Problems 26 074015). Our theoretical analysis of the algorithm relies on an asymptotic expansion of the far-field pattern of the scattered field as the size of the scatterers tends to zero with respect to the wavelength of the incident field that holds not only at a single frequency, but also across appropria…

Operational and financial effectiveness of e-collaboration tools in supply chain integration

2004

This paper develops a comprehensive model of supply chain integration and uses it to analyze and assess the operational and financial effectiveness of different e-collaboration tools at various levels of supply chain integration. This model is also used to evaluate the importance of the sequence in which e-collaboration tools are adopted in supply chain integration. Computational results from a validated system dynamics simulation model with different implementation sequences of e-collaboration tools and different financial scenarios show that local financial constraints can also severely impact operational and financial performance of the entire supply chain. (C) 2003 Elsevier B.V. All rig…

An Introduction to the GAMS Modeling System

2010

PANORMUS-SPH. A new Smoothed Particle Hydrodynamics solver for incompressible flows

2015

Abstract A new Smoothed Particle Hydrodynamics (SPH) solver is presented, fully integrated within the PANORMUS package [7] , originally developed as a Finite Volume Method (FVM) solver. The proposed model employs the fully Incompressible SPH approach, where a Fractional Step Method is used to make the numerical solution march in time. The main novelty of the proposed model is the use of a general and highly flexible procedure to account for different boundary conditions, based on the discretization of the boundary surfaces with a set of triangles and the introduction of mirror particles with suitable hydrodynamic properties. Both laminar and turbulent flows can be solved (the latter using t…

Quantum inductive inference by finite automata

2008

AbstractFreivalds and Smith [R. Freivalds, C.H. Smith Memory limited inductive inference machines, Springer Lecture Notes in Computer Science 621 (1992) 19–29] proved that probabilistic limited memory inductive inference machines can learn with probability 1 certain classes of total recursive functions, which cannot be learned by deterministic limited memory inductive inference machines. We introduce quantum limited memory inductive inference machines as quantum finite automata acting as inductive inference machines. These machines, we show, can learn classes of total recursive functions not learnable by any deterministic, nor even by probabilistic, limited memory inductive inference machin…

Complexity of probabilistic versus deterministic automata

2005

FPGA-based embedded Logic Controllers

2014

In general case, reconfigurable logic controllers (RLC) are included into reactive digital embedded systems, carrying out control for several processes proceeding concurrently. The paper presents a practical application of a formal, rule-based specification language in Gentzen sequent logic, which is used as an intermediate textual description of a control interpreted Petri net. On the other hand exactly the same description serves also as logic design expressions, related with different versions of functionally equivalent concurrent state machine models, considered on Register Transfer Level. The symbolic rule-based specification of Petri net-based embedded Logic Controllers (LCs) can be s…

Finite automata on timed ω-trees

2003

AbstractIn the last decade Alur and Dill introduced a model of automata on timed ω-sequences which extends the traditional models of finite automata. In this paper, we present a theory of timed ω-trees which extends both the theory of timed ω-sequences and the theory of ω-trees. The main motivation is to introduce a new way of specifying real-time systems and provide tools for studying decidability problems in related fields. We focus on the decision problems and their applications in system verification and synthesis.