Search results for "programming."
showing 10 items of 3035 documents
Forbidden Factors and Fragment Assembly
2001
In this paper methods and results related to the notion of minimal forbidden words are applied to the fragment assembly problem. The fragment assembly problem can be formulated, in its simplest form, as follows: reconstruct a word w from a given set I of substrings (fragments ) of a word w . We introduce an hypothesis involving the set of fragments I and the maximal length m(w) of the minimal forbidden factors of w . Such hypothesis allows us to reconstruct uniquely the word w from the set I in linear time. We prove also that, if w is a word randomly generated by a memoryless source with identical symbol probabilities, m(w) is logarithmic with respect to the size of w . This result shows th…
Basic Definitions and Facts
2001
Symbol is treated here as a primitive entity as point or line in geometry. Let Con = {f α : α < β} be a well-ordered set of symbols called a language type. β is an ordinal number. The elements of the above set are called connectives. To each connective f α a natural number α(α) ∈ w called the rank of f α or the arity of f α is assigned. The arity α(α) defines the number of arguments of f α . Thus we speak of nullary, unary, or binary connectives, etc. In the sequel Con is assumed to be fixed but arbitrary.
Right-Justified Characterization for Generating Regular Pattern Avoiding Permutations
2017
ECO-method and its corresponding succession rules allow to recursively define and construct combinatorial objects. The induced generating trees can be coded by corresponding pattern avoiding permutations. We refine succession rules by using succession functions in case when avoided patterns are regular or c-regular. Although regular patterns are hard to be recognized in general, we give a characterization for its right-justified property which is a prerequisite in the definition of the regular pattern. Based on this characterization, we show the (c-)regularity for various classes of permutations avoiding sets of patterns with variable lengths. Last, the technique of succession functions per…
XPL the Extensible Presentation Language
2009
The last decade has witnessed a growing interest in the development of web interfaces enabling both multiple ways to access contents and, at the same time, fruition by multiple modalities of interaction (point-and-click, contents reading, voice commands, gestures, etc.). In this paper we describe a framework aimed at streamlining the design process of multi-channel, multimodal interfaces enabling full reuse of software components. This framework is called the eXtensible Presentation architecture and Language (XPL), a presentation language based on design pattern paradigm that keeps separated the presentation layer from the underlying programming logic. The language supplies a methodology to…
A model of internal and external competition in a High Speed Rail line
2015
This paper is a contribution to evaluate structural and behavioral changes in railway passenger markets. The novel elements of our analysis are the following: (i) the consideration of inter-modal and intra-modal competition, (ii) the presence of public and private operators, and (iii) endogenous service frequency. After calibrating the model using actual data from two Spanish High Speed Rail lines, simulation exercises allow us to conclude the following. Privatization, whether entry occurs or not, would prompt an increase in prices and a reduction in the number of train services, eventually leading to welfare decreases, as compared with a regime where the incumbent rail operator remained pu…
Lexical competition in phonological priming: Assessing the role of phonological match and mismatch lengths between primes and targets
2003
In five experiments, we examined lexical competition effects using the phonological priming paradigm in a shadowing task. Experiments 1A and 1B replicate and extend Slowiaczek and Hamburger's (1992) observation that inhibitory effects occur when the prime and the target share the first three phonemes (e.g., /bRiz/-/bRik/) but not when they share the first two phonemes (e.g., /bRepsilonz/-/bRik/). This observation suggests that lexical competition depends on the length of the phonological match between the prime and the target. However, Experiment 2 revealed that an overlap of two phonemes is sufficient to cause an inhibitory effect provided that the primes mismatched the targets only on the…
Metamodelling architectures for complex data integration in systems biology
2010
Systems biology aims at deciphering the functioning of biological systems on the basis of the knowledge of their molecular components and the relations between such components. To address the issues involved, high-throughput technologies are used. Taking advantage of the standards that are being currently developed to achieve consensual representations of technological domains, we present a metamodelling architecture based on these standards. The proposed architecture organises standard-specific metamodels and models into a single hierarchy. Each metamodel describes a consensus that is shared by several models of applications. A metamodel construct for description of faceted element is prop…
Data-Centric and Multimedia Components
2011
The content of XML documents is often primarily plain text, interspersed with various headers and perhaps some lists and tables. However, there are many applications for which the content of documents is not primarily narrative in nature, but instead includes (portions of) data records that are subject to storage and computational manipulation. The latter documents are sometimes referred to as data-centric or record-like, and they rely extensively on precise descriptions of the forms of data that can appear. In this chapter we first introduce the data type definition capabilities in XML Schema. We then consider the types of data very common in traditional databases: numeric data, dates, and…
Determining a Random Schrödinger Operator : Both Potential and Source are Random
2020
We study an inverse scattering problem associated with a Schr\"odinger system where both the potential and source terms are random and unknown. The well-posedness of the forward scattering problem is first established in a proper sense. We then derive two unique recovery results in determining the rough strengths of the random source and the random potential, by using the corresponding far-field data. The first recovery result shows that a single realization of the passive scattering measurements uniquely recovers the rough strength of the random source. The second one shows that, by a single realization of the backscattering data, the rough strength of the random potential can be recovered…
Reverse inheritance in statically typed object-oriented programming languages
2010
Reverse inheritance is a new class reuse mechanism, an experimental implementation of which we have built for Eiffel. It enables a more natural design approach, factorization of common features (members), insertion of classes into an existing hierarchy etc. Due to its reuse potential in Eiffel we consider exploring its capabilities in other industrial-strength programming languages like C++, Java and C#.