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

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

2003
Henrik Nilsson John Peterson Paul Hudak

The modeling and simulation of physical systems is of key importance in many areas of science and engineering, and thus can benefit from high-quality software tools. In previous research we have demonstrated how functional programming can form the basis of an expressive language for causal hybrid modeling and simulation. There is a growing realization, however, that a move toward non-causal mod...

Journal: :Image Vision Comput. 2003
Paul Wing Hing Kwan Keisuke Kameyama Kazuo Toraichi

In this paper, we propose a relaxation-labeling algorithm for real-time contour-based image similarity retrieval that treats the matching between two images as a consistent labeling problem. To satisfy real-time response, our algorithm works by reducing the size of the labeling problem, thus decreasing the processing required. This is accomplished by adding compatibility constraints on contour ...

2013
Simon Price Peter A. Flach

We define a relational algebra on basic terms, strongly typed terms in a higher-order logic, that are well suited to the representation of heterogeneous data, irrespective of whether the data originated from relational, unstructured, semi-structured or structured sources. This higher-order generalisation of the relational model has potential applications in NoSQL databases and Big Variety, Big ...

1988
Ronald Morrison Alan Dearle Chris D. Marlin

Adaptive data is characterised by its ability to react to changes in the environment. Such data frequently occurs in Artificial Intelligence applications where the knowledge base may alter dynamically to adapt to new stimuli. Such systems are usually written in typeless, dynamically bound languages. Here we describe the concept of persistence and show how it may also be used in conjunction with...

Journal: :Journal of Object Technology 2017
Zeinab Iranmanesh Mehran S. Fallah

We present MTMJ, a multithreaded middleweight model language for Java which is strongly typed and prevents multiple run-time start of threads. The key point in designing the language is to balance precision and efficiency by judicious utilization of context information during type checking. While the types are flow-insensitive, the required flowdependent information is collected as type checkin...

Journal: :TAPOS 1998
Didier Rémy Jérôme Vouillon

Objective ML is a small practical extension to ML with objects and top level classes. It is fully compatible with ML; its type system is based on ML polymorphism, record types with polymorphic access, and a better treatment of type abbreviations. Objective ML allows for most features of object-oriented languages including multiple inheritance, methods returning self and binary methods as well a...

2015
Roger R. Betancourt

A fundamental distinction between goods and services is that in the retailing of goods and some services the costs of production and distribution are clearly separable in a non-arbitrary fashion, usually identified as costs of goods sold. They have type I separability. Distribution services, which are also known as attributes, marketing mix or output variables, are produced, distributed and con...

Journal: :J. Symb. Log. 2001
Byunghan Kim

Firstly, in this paper, we prove that the equivalence of simplicity and the symmetry of forking. Secondly, we attempt to recover deenability part of stability theory to simplicity theory. In particular, using elimination of hyperimaginaries we prove that for any supersimple T , canonical base of an amalgamation class P is the union of names of-deenitions of P, ranging over stationary L-formulas...

Journal: :Electr. Notes Theor. Comput. Sci. 2011
David J. Pearce James Noble

Dynamically typed languages are flexible and impose few burdens on the programmer. In contrast, static typing leads to software that is more efficient and has fewer errors. However, static type systems traditionally require every variable to have one type, and that relationships between types (e.g. subclassing) be declared explicitly. The Whiley language aims to hit a sweet spot between dynamic...

2007
V. J. MIZEL

where Q <= Rm is a bounded domain, JS?W denotes m-dimensional Lebesgue measure, (p = (<p\..., (p) is a continuous transformation from Q to Rn (m ^ n) belonging to some Sobolev space W x p' (Q), and (px is the (almost everywhere defined) matrix function (d^/oxj). Here ƒ is a realvalued function o n Q x i ? n x M „ x m , where Mnxm is the space o f n x m matrices. Such integrals arise in the anal...

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

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