نتایج جستجو برای: strong and weak forms

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

Journal: :Software Engineering Journal 1987
Ronald Morrison Alfred L. Brown Raymund Carrick Richard C. H. Connor Alan Dearle Malcolm P. Atkinson

The major requirements of a system for software reuse are that it must provide an abstraction mechanism for adequately describing the components; a mechanism for naming and storing the components; and a mechanism for composing new objects out of existing components. In this paper we describe a polymorphic type system that may be used to describe generic components and a persistence mechanism th...

2003
Russ Abbott

This paper describes oogp, an object-oriented genetic programming system. Oogp provides traditional genetic programming capabilities in an object-oriented framework. Among the advantages of object-oriented genetic programming are: (a) strong typing, (b) availability of existing class libraries for inclusion in generated programs, and (c) straightforward extensibility to include features such as...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه رازی - پژوهشکده علوم 1388

heteropoly acids (hpa) and their salts have advantages as catalysts which make them both economically and environmentally attractive, strong br?nsted acidity, exhibiting fast reversible multi-electron redox transformations under rather mild conditions, very high solubility in polar solvents, fairly high thermal stability in the solid states, and efficient oxidizing ability, so that they are imp...

2001
Gail Martino Lawrence E. Marks

In this review, we distinguish strong and weak forms of synesthesia. Strong synesthesia is characterized by a vivid image in one sensory modality in response to stimulation in another one. Weak synesthesia is characterized by cross-sensory correspondences expressed through language, perceptual similarity, and perceptual interactions during information processing. Despite important phenomenologi...

Journal: :J. Symb. Log. 2013
John Goodrick Byunghan Kim Alexei S. Kolesnikov

We present definitions of homology groups Hn(p), n ≥ 0, associated to a complete type p. We show that if the generalized amalgamation properties hold, then the homology groups are trivial. We compute the group H2(p) for strong types in stable theories and show that any profinite abelian group can occur as the group H2(p). The work described in this paper was originally inspired by Hrushovski’s ...

2002
James H. Andrews

We deene a higher order logic which has only a weak notion of type, and which permits all terms of the untyped lambda calculus and allows the use of the Y combinator in writing recursive predicates. The consistency of the logic is maintained by a distinction between use and mention, as in Gilmore's logics. We give a consistent model theory and a proof system which is valid with respect to the m...

2000
Henning Makholm

The phrase \optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretation. As it has become clear that it does not imply \optimality" in the everyday meaning of the word, we propose to rename the concept \Jones-optimality". We argue that the 1993 de nition of Jones-optimality is in principle ...

2002
Michael A. Grasso

This paper presents an environment for collecting clinical data using structured speech input. The system uses nomenclature terms and data consistency rules to limit speech input to a discrete set of phrases which can be configured to support a wide range of studies. This information is stored in an eventoriented data model as strongly typed observations for subsequent distribution and data ana...

2015
Yun Seok Choi Minhee Seo David Scott Jeffrey J. Martin Jeffrey Martin

The purpose of this study was to examine the psychometric properties of the Korean version of the Organizational Culture Assessment Instrument (OCAI) based on the Competing Values Framework (CVF). More specially, cultural equivalence between the Korean version and the original English version of the OCAI was evaluated using 39 bilingual Koreans. Next, a field test was conducted to examine scale...

Journal: :INFORMS Journal on Computing 1998
Hemant K. Bhargava Ramayya Krishnan Peter Piela

The use of strong typing, exemplified in the Ascend modeling language, is a recent phenomenon in executable modeling languages for mathematical modeling. It is also one that has significant potential for improving the functionality of computer-based modeling environments. Besides being a strongly typed language, Ascend is unique in providing operators that allow dynamic type inference, a featur...

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

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