Clustering techniques for adaptive horizontal fragmentation in object oriented databases.
Co je LOGO?
Coalgebras for binary methods : properties of bisimulations and invariants
Coalgebras for endofunctors can be used to model classes of object-oriented languages. However, binary methods do not fit directly into this approach. This paper proposes an extension of the coalgebraic framework, namely the use of extended polynomial functors . This extension allows the incorporation of binary methods into coalgebraic class specifications. The paper also discusses how to define bisimulation and invariants for coalgebras of extended polynomial functors and proves many standard...
Coalgebras for Binary Methods: Properties of Bisimulations and Invariants
Coalgebras for endofunctors can be used to model classes of object-oriented languages. However, binary methods do not fit directly into this approach. This paper proposes an extension of the coalgebraic framework, namely the use of extended polynomial functors. This extension allows the incorporation of binary methods into coalgebraic class specifications. The paper also discusses how to define bisimulation and invariants for coalgebras of extended polynomial functors and proves many...
Cobham's theorem for substitutions
The seminal theorem of Cobham has given rise during the last 40 years to a lot of work about non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences. Let and be two multiplicatively independent Perron numbers. Then a sequence , where is a finite alphabet, is both -substitutive and -substitutive if and only if is ultimately periodic....
Cocktail: a tool for deriving correct programs.
Cocktail is a tool for deriving correct programs from their specifications. The present version is powerful enough for educational purposes. The tool yields support for many sorted first order predicate logic, formulated in a pure type system with parametric constants (CPTS), as the specification language, a simple While-language, a Hoare logic represented in the same CPTS for deriving programs from their specifications and a simple tableau based automated theorem prover for verifying proof obligations....
Codes avec des mots infinis
Codes et motifs
Codes infinitaires et automates non-ambigus
Codes, languages and MOL schemes
Codes that attain minimum distance in every possible direction
The following problem motivated by investigation of databases is studied. Let be a q-ary code of length n with the properties that has minimum distance at least n − k + 1, and for any set of k − 1 coordinates there exist two codewords that agree exactly there. Let f(q, k)be the maximum n for which such a code exists. f(q, k)is bounded by linear functions of k and q, and the exact values for special k and qare determined.
Coevolutionary genetic algorithms for establishing Nash equilibrium in symmetric Cournot games.
Cognitive psychology and artificial intelligence
Coherence principles for handling qualitative and quantitative partial probabilistic assessments.
In this paper we present an overview of mathematical models for handling partial entailments and their extensions in a probabilistic frame.
Cohesiveness in promise problems
Promise problems have been introduced in 1985 by S. Even e.a. as a generalization of decision problems. Using a very general approach we study solvability and unsolvability conditions for promise problems of set and language families. We show, that cores of unsolvability are completely determined by partitions of cohesive sets. We prove the existence of cores in unsolvable promise problems assuming certain closure properties for the given set family. Connections to immune sets and complexity cores...
Cohomología 3D y visualización.
Collaborative power management in WPANs using rational controllers: a case study.
Collective tree spanners and routing in AT-free related graphs.
Collision patterns on mollusc shells.
Colored decision process Petri nets: modeling, analysis and stability
In this paper we introduce a new modeling paradigm for developing a decision process representation called the Colored Decision Process Petri Net (CDPPN). It extends the Colored Petri Net (CPN) theoretic approach including Markov decision processes. CPNs are used for process representation taking advantage of the formal semantic and the graphical display. A Markov decision process is utilized as a tool for trajectory planning via a utility function. The main point of the CDPPN is its ability to...