نتایج جستجو برای: commonality minimal cn

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

Journal: :Int. J. Found. Comput. Sci. 2007
Peter R. J. Asveld

For each alphabet Σn = {a1, a2, . . . , an}, linearly ordered by a1 < a2 < · · · < an, let Cn be the language of circular or cyclic shifts over Σn, i.e., Cn = {a1a2 · · · an−1an, a2a3 · · · ana1, . . . , ana1 · · · an−2an−1}. We study a few families of context-free grammars Gn (n ≥ 1) in Greibach normal form such that Gn generates Cn. The members of these grammar families are investigated with ...

Journal: :Concurrent Engineering: R&A 2007
Roger Jianxin Jiao John K. Gershenson Jeremy J. Michalek

Managing modularity and commonality throughout product and process development has been well recognized as crucial to producing a large variety of products while maintaining low costs and quick response to the market. In recent years we have seen growing consensus and an increasing number of publications related to modularity and commonality, as well as many endeavors in industrial applications...

Journal: :Behavioural brain research 1997
T Eggert A Straube K Schroeder

In congenital nystagmus (CN) the threshold for detecting motion of visual objects is increased. To determine whether this increase is due to a deterioration of visual motion signals or whether visual-vestibular interactions (which are necessary to judge object-motion in space) are also involved we examined how CN patients use visual motion signals to evaluate self-motion in perceptual and behav...

2008
Ryan C. Boas Edward F. Crawley Olivier L. de Weck

Commonality, or the sharing of components, processes, technologies, interfaces and/or infrastructure across a product family, represents one of many potential tools for increasing corporate profitability. Industrial interest in commonality is strong, but results appear to be mixed. A rich stream of academic research has examined commonality (typically under terms such as “product platforms” and...

Journal: :Systems Engineering 2013
Ryan Boas Bruce G. Cameron Edward F. Crawley

Commonality, or the reuse and sharing of components, manufacturing processes, architectures, interfaces, and infrastructure across the members of a product family, is an often leveraged strategy targeted at improving corporate profitability. Commonality strategies are widespread in the literature and in industrial practice, but a clear gap exists: The literature has a distinctly positive bias t...

2012
Yi-Kuei Lin Ping-Chen Chang

With the development of information technology, the cloud computing service has become a new paradigm for the business and industry. In a cloud computing environment, the computer network (CN) can be constructed as a multistate network with several possible states due to failure, partial failure, or maintenance of edges (physical lines) and nodes (switches or routers). In order to guarantee the...

Journal: :CoRR 2017
Adi Shraibman

For integers n and k, the density Hales-Jewett number cn,k is defined as the maximal size of a subset of [k] that contains no combinatorial line. We prove a lower bound on cn,k, similar to the lower bound in [16], but with better dependency on k. The bound in [16] is roughly cn,k/k n ≥ exp(−O(log n)2 ) and we show cn,k/k n ≥ exp(−O(log n)). The proof of the bound uses the well-known constructio...

Journal: :Software Process: Improvement and Practice 2005
Alexis Ocampo Fabio Bella Jürgen Münch

One of the major challenges in software development projects consists of defining appropriate development processes and tailoring them to project and organizational constraints. One solution for this problem is to develop domainspecific adaptable reference process models based on empirically gained experience, observation of real processes, and comparison of these processes. This article presen...

1998
LOU VAN DEN DRIES PATRICK SPEISSEGGER

We construct a model complete and o-minimal expansion of the field of real numbers in which each real function given on [0, 1] by a series ∑ cnxn with 0 ≤ αn → ∞ and ∑ |cn|rαn < ∞ for some r > 1 is definable. This expansion is polynomially bounded.

Journal: :Int. J. Intell. Syst. 2009
Michel Grabisch

We extend the notion of belief function to the case where the underlying structure is no more the Boolean lattice of subsets of some universal set, but any lattice, which we will endow with a minimal set of properties according to our needs. We show that all classical constructions and definitions (e.g., mass allocation, commonality function, plausibility functions, necessity measures with nest...

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

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