Model formalization

Tuyển tập các báo cáo nghiên cứu khoa học ngành toán học được đăng trên tạp chí toán học quốc tế đề tài: Modeling formalisms in Systems Biology
31p sting03 04022012 31 3 Download

In this chapter, we describing features that have been proposed for semantic data models, and show how the ER model can be enhanced to include these concepts, leading to the Enhanced ER (EER) model.
22p kiepnaybinhyen_04 15122015 10 1 Download

The estimation process begins by assuming or hypothesizing that the least squares linear regression model (drawn from a sample) is valid. The formal twovariable linear regression model is based on the following assumptions: (1) The population regression is adequately represented by a straight line: E(Yi) = μ(Xi) = β0 + β1Xi (2) The error terms have zero mean: E(∈i) = 0 (3) A constant variance (homoscedasticity): V(∈i) = σ2
12p truongdoan 10112009 88 16 Download

The final chapter of the book presents an innovative method for fluid mechanical design in which an object within the flow field is build elementbyelement. Each element is introduced into the flow, and its effect on a cost function is minimized with respect to the object’s position. An element may represent added material or a removed part of the existing structure. This chapter presents a strong degree of mathematical formality.
150p contentnew 12042012 74 16 Download

All geographic information systems (GIS) are built using formal models that describe how things are located in space. A formal model is an abstract and welldefined system of concepts. It defines the vocabulary that we can use to describe and reason about things. A geographic data model defines the vocabulary for describing and reasoning about the things that are located on the earth. Geographic data models serve as the foundation on which all geographic information systems are built. We are all familiar with one model for geographic information—the map.
201p hotmoingay 03012013 24 5 Download

As I am finishing this book, Science magazine is running a special issue about the sequencing of the macaque genome. It turns out that macaques share about 93 percent of their genes with us, humans. Previously it has been already reported that chimpanzees share about 96 percent of their genes with us. Yes, the macaque is our common ancestor, and it might be expected that, together with the chimps, we continued with our natural selection some 23 million years ago until, some 6 million years ago, we departed from the chimps to continue our further search for better adaptation.
433p phoebe75 01022013 31 5 Download

A basic problem that must be dealt with in order to build an intelligent tutoring system (ITS) in the domain of foreign language teaching is that of establishing what kind of grammatical knowledge has to be included in the domain expert module. Two basic options are possible: (i) to use a naive or pedagogical grammar, comprising knowledge derived from textbooks and school grammars or (ii) to use one of the formal grammars developed by theoretical and computational linguists.
6p buncha_1 08052013 28 5 Download

Formal methods mathematical languages, techniques and tools, used to specify and verify systems, goal is help engineers construct more reliable systems. Introduction to Formal Methodspresents about introduction; formal specification; formalformal verificationverification; model checking; theorem proving.
29p ngkhacvu 22052015 16 5 Download

We proposed in this paper an approach for checking the conformability in CORBA component model specifications. In software engineering, it is demonstrated that discovering bugs in earlier phases is much more economical than later phases. We focused thus on verifying components by their ports specification. In order to do this, firstly we determined constraints on kinds of port as well as on types of port which the connection between ports must satisfy, and then formalized them to be able to prove automatically using formal prover tools.
11p tuanlocmuido 13122012 32 4 Download

The relational Model of Data is based on the concept of a Relation. A Relation is a mathematical concept based on the ideas of sets. The strength of the relational approach to data management comes from the formal foundation provided by the theory of relations. We review the essentials of the relational approach in this chapter.
31p thienthanoze 12112012 29 3 Download

The aim of this work is to present some preliminary results of an investigation in course on the typology of the morphology of the native South American languages from the point of view of the formal language theory. With this object, we give two contrasting examples of descriptions of two Aboriginal languages ﬁnite verb forms morphology: Argentinean Quechua (quichua santiague˜ o) and Toba.
6p hongdo_1 12042013 32 3 Download

The paper investigates the problem of providing a formal device for the dependency approach to syntax, and to link it with a parsing model. After reviewing the basic tenets of the paradigm and the few existing mathematical results, we describe a dependency formalism which is able to deal with longdistance dependencies. Finally, we present an Earleystyle parser for the formalism and discuss the (polynomial) complexity results.
7p bunrieu_1 18042013 27 3 Download

(BQ) Part 1 book "Database system concepts" has contents: Introduction to the relational model, introduction to SQL, advanced SQL, intermediate SQL, formal relational query languages, database design and the ER Model, indexing and hashing, relational database design, query processing, query optimization,...and other contents.
651p bautroibinhyen20 06032017 8 3 Download

Dominance links were introduced in grammars to model long distance scrambling phenomena, motivating the deﬁnition of multisetvalued linear indexed grammars (MLIGs) by Rambow (1994b), and inspiring quite a few recent formalisms. It turns out that MLIGs have since been rediscovered and reused in a variety of contexts, and that the complexity of their emptiness problem has become the key to several open questions in computer science.
11p hongdo_1 12042013 22 2 Download

Báo cáo khoa học: "Mixture Model POMDPs for Efﬁcient Handling of Uncertainty in Dialogue Management"
In spoken dialogue systems, Partially Observable Markov Decision Processes (POMDPs) provide a formal framework for making dialogue management decisions under uncertainty, but efﬁciency and interpretability considerations mean that most current statistical dialogue managers are only MDPs. These MDP systems encode uncertainty explicitly in a single state representation.
4p hongphan_1 15042013 20 2 Download

We present a statistical phrasebased translation model that uses hierarchical phrases— phrases that contain subphrases. The model is formally a synchronous contextfree grammar but is learned from a bitext without any syntactic information. Thus it can be seen as a shift to the formal machinery of syntaxbased translation systems without any linguistic commitment. In our experiments using BLEU as a metric, the hierarchical phrasebased model achieves a relative improvement of 7.5% over Pharaoh, a stateoftheart phrasebased system. ...
8p bunbo_1 17042013 10 2 Download

Minimal Recursion Semantics (MRS) is the standard formalism used in largescale HPSG grammars to model underspeciﬁed semantics. We present the ﬁrst provably efﬁcient algorithm to enumerate the readings of MRS structures, by translating them into normal dominance constraints.
8p bunbo_1 17042013 21 2 Download

Following this tradition, many researchers recognize their usefulness in the description of language   even if they do not agree on their significance [7]. However, a weak or strong commitment to this notion does not elude the fact that it proves to be very difficult to settle on a finite set of labels along with their formal definitions. The dilemma resulting from this challenge is well known: to require a univocal identification by each role results in an increase in their number while to abstract their semantic content gives rise to an inconsistent set. ...
2p bunmoc_1 20042013 20 2 Download

This paper shows how to formally characterize language learning in a finite parameter space as a Markov structure, hnportant new language learning results follow directly: explicitly calculated sample complexity learning times under different input distribution assumptions (including CHILDES database language input) and learning regimes. We also briefly describe a new way to formally model (rapid) diachronic syntax change.
10p bunmoc_1 20042013 19 2 Download

A natural next step in the evolution of constraintbased grammar formalisms from rewriting formalisms is to abstract fully away from the details of the grammar mechanismto express syntactic theories purely in terms of the properties of the class of structures they license.
7p bunmoc_1 20042013 31 2 Download