This paper is driven by a general motto: bisimulate an hybrid system by a finite symbolic dynamical system. In the case of ominimal hybrid systems, the continuous and discrete components can be decoupled, and hence, the problem reduces in building a finite symbolic dynamical system for the continuous dynamics of each location. We show that this can be done for a quite general class of hybrid sy...

several tables have been given due to a − minimal sets. our main aim in this paper is tocomplete these tables by employing several examples.

Methodologically oriented, the present work sketches an approach for prosodic information retrieval and speech segmentation, based on both symbolic and probabilistic information. We have recourse to probabilistic grammars, within which we implement a minimal hierarchical structure. Both the stages of probabilistic grammar building and its testing in prediction are explored and quantitatively an...

The aim of this paper is to optimize the building shape parameters and envelope parameters influencing the rural building energy consumption in cold winter and hot summer climate. Several typical models are established and optimized by integrated TRNSYS and GenOpt. Single-objective optimization has provided guidance to the multi-dimensional optimization. Building shape and envelope parameters a...

We introduce a linear code based on resilient maps on vector spaces over finite fields, we give a basis of this code and upper and lower bounds for its minimal distance. Then the use of the introduced code for building vector space secret sharing schemes is explained and an estimation of the robustness of the schemes against cheaters is provided.

Étale endomorphisms of complex projective manifolds are constructed from two building blocks up to isomorphism if the good minimal model conjecture is true. They are the endomorphisms of abelian varieties and the nearly étale rational endomorphisms of weak Calabi-Yau varieties.

I review some of the latest directions in supersymmetric model building, focusing on SUSY breaking mechanisms in the minimal supersymmetric standard model [MSSM], the “little” hierarchy and μ problems, etc. I then discuss SUSY GUTs and UV completions in string theory. PACS. PACS-key discribing text of that key – PACS-key discribing text of that key

Abstract. The syntactic and semantic complexity of the so-called numeral classifier (Num-Cl) constructions in Korean challenges theoretical as well as computational linguists. We provide a constraint-based analysis of these constructions within the framework of HPSG with the semantic representations of MRS (Minimal Recursion Semantics) and reports its implementation in the LKB (Linguistic Knowl...

We address the problem of generating a minimal state graph from a program, without building the whole state graph. Minimality is considered here with respect to bisimulation. A generation algorithm is derived and illustrated. Applications concern program veri cation and control synthesis in reactive program compilation.

We discuss the role of flavour physics in building effective theories at the TeV scale. Particular attention is devoted to the Minimal Flavour Violation hypothesis, both in the quark and in the lepton sector. Alternative flavour-protection mechanisms, such as the hierarchical fermion profiles of models with a warped fifth dimension, are also briefly discussed.