نتایج جستجو برای: construction

تعداد نتایج: 208697  

2012
Laura A. Michaelis

A foundational assumption of traditional generative grammar is that a grammar is organized in the mind of the speaker as a number of hermetically sealed modules, which in the course of a derivation hand off data one to the other.1 Sign-Based Construction Grammar (SBCG) assumes that the grammar contains no such modules, but rather that grammar is an inventory of signs, complexes of linguistic co...

2011
Amber Tomas

We consider the problem of online classification in nonstationary environments. Specifically, we take a Bayesian approach to sequential parameter estimation of a logistic MCS, and compare this method with other algorithms for nonstationary classification. We comment on several design considerations.

Journal: :L'OBJET 2007
Pierre-André Caron Mireille Blay-Fornarino Xavier Le Pallec

The MDA approach may be broadly reduced to the following lifecycle: defining platform independent business models and transforming them into platform dependent models for software implementation concerns. The NOCE team works in the Technology Enhanced Learning (TEL) area. One of its works aims to apply the MDA approach in TEL domain. This application presents two particularities: the versatilit...

Journal: :Ann. Pure Appl. Logic 2012
Alex K. Simpson

This paper investigates aspects of measure and randomness in the context of locale theory (point-free topology). We prove that every measure (σ-continuous valuation) μ, on the σ-frame of opens of a fitted σ-locale X, extends to a measure on the lattice of all σ-sublocales of X (Theorem 1). Furthermore, when μ is a finite measure with μ(X) = M , the σ-locale X has a smallest σ-sublocale of measu...

2009
Emmanuel Filiot Naiyong Jin Jean-François Raskin

In this paper, we study the structure of underlying automata based constructions for solving the LTL realizability problem. We show how to reduce the LTL realizability problem to a game with an observer which checks that the game visits a bounded number of times accepting states of a universal co-Büchi word automaton. We show that such an observer can be made deterministic and that this determi...

2013
Mark Van de Velde Jean-Christophe Verstraete

When two nominal constituents are in a relation of dependency in the Bantu languages, the syntactically dependent constituent is usually introduced by a relator. In Bantu studies this relator is called connective (also associative, genitive or connexive) element (or pronoun, clitic, prefix, marker or particle). The order is HEAD (R1) RELATOR (REL) DEPENDENT (R2). R1 and R2 are short for first a...

Journal: :World journal of microbiology & biotechnology 2015
Viktor Stabnikov Volodymyr Ivanov Jian Chu

A new scientific and engineering discipline, Construction Biotechnology, is developing exponentially during the last decade. The major directions of this discipline are selection of microorganisms and development of the microbially-mediated construction processes and biotechnologies for the production of construction biomaterials. The products of construction biotechnologies are low cost, susta...

2013
Arijit Sinha Rakesh Gupta Andreja Kutnar

Global sustainability goals have led to the development of the green building movement. The Green Building Program, stemming from the movement, has had unprecedented success as it provides a quantifi able metric to people’s efforts towards sustainable development. Sustainable development and green buildings are often used interchangeably. Although, sustainable development and green buildings ar...

2007
BENOIT FRESSE

The standard reduced bar complex B(A) of a differential graded algebra A inherits a natural commutative algebra structure if A is a commutative algebra. We address an extension of this construction in the context of E-infinity algebras. We prove that the bar complex of any E-infinity algebra can be equipped with the structure of an E-infinity algebra so that the bar construction defines a funct...

Journal: :IACR Cryptology ePrint Archive 2011
Joan Daemen Tony Dusenge Gilles Van Assche

In this paper we give a generic security proof for hashing modes that make use of an underlying fixed-length permutation. We formulate a set of five simple conditions, which are easy to implement and to verify, for such a hashing mode to be sound. These hashing modes include tree hashing modes and sequential hashing modes. We provide a proof that for any hashing mode satisfying the five conditi...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید