نتایج جستجو برای: constrained exible ow lines

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

1998
David A. Meyer

Conventional lattice gas automata consist of particles moving discretely on a xed lattice. While such models have been quite successful for a variety of uid ow problems, there are other systems, e.g., ow in a exible membrane or chemical self-assembly, in which the geometry is dynamical and coupled to the particle ow. Systems of this type seem to call for lattice gas models with dynamical geomet...

Journal: :Information & Software Technology 2002
Hai Zhuge

Matching between two work¯ow processes is the key step of work¯ow process reuse. This paper presents an inexact matching approach for ¯exible work¯ow process reuse. A multi-valued process specialization relationship is de®ned based on the de®nition of activity specialization and the characteristics of work¯ow process. The matching degree between two work¯ow processes is determined by the matchi...

ژورنال: Journal of Railway Research 2017
Moaveni, Bijan, Najafi, Sima ,

This study is concerned with the real-time delay recovery problem in metro loop lines. Metro is the backbone of public transportation system in large cities. A discrete event model for traffic system of metro loop lines is derived and presented. Two effective automatic controllers, linear quadratic regulator (LQR) and model predictive controller (MPC), are used to recover train delays. A newly-...

1998
Weigang Wang

In current work ow and groupware systems, there is a gap between formal and informal coordination mechanisms. To ll the gap, exible coordination support covers the whole spectrum of informal and formal coordination mechanisms. In this paper, a exible coordination model integrating formal and informal coordination mechanisms is presented. Methods of using cooperative hypermedia concepts to unifo...

1995
Ernst H. Kristiansen Geir Horn Svein Linge

OMI/HIC is a point-to-point link technology under development. It has a exible packet format and supports ow control, which makes OMI/HIC usable as an alternative physical layer for other higher level protocols, like SCI and ATM. Routing chips with advanced routing strategies are made, and these routing chips are useful building blocks for larger switches for point to point links.

1991
Uday S. Rao Peter L. Jackson

This paper reviews a cyclic scheduling model of repetitive manufacturing environments consisting of exible machines and multi-stage jobs. We explicitly model two system performance measures, throughput and ow time, while incorporating variability arising from uncertainty in operation processing times. We present an iterative approximation scheme to estimate the two moment behavior of our perfor...

1999
Tony A. Plate

One of the widely acknowledged drawbacks of exible statistical models is that the tted models are often extremely diicult to interpret. However, if exible models are constrained to be additive the tted models are much easier to interpret, as each input can be considered independently. The problem with additive models is that they cannot provide an accurate model if the phenomenon being modeled ...

1998
Mohan Kamath Krithi Ramamritham

Work ow management systems (WFMSs) coordinate the execution of applications distributed over networks. In WFMSs, data inconsistencies can arise due to (i) the interaction between steps of concurrent threads within a work ow (intra-work ow coordination) (ii) the interaction between steps of concurrent work ows (interwork ow coordination) and (iii) the presence of failures. Since these problems h...

Journal: :Electr. Notes Theor. Comput. Sci. 1997
Flemming Nielson Hanne Riis Nielson

Flow logic is a \fast prototyping" approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the ow logic as well as in the operational semantics may inhibit proving the analysis correct. Our main conclusion is that environment based semantics is more exible than either substit...

1997
Alexandre Boudet Evelyne Contejean

We present a complete algorithm for the uniication of higher-order patterns modulo the associative-commutative theory of some constants +1; : : : ; +n. Given an AC-uniication problem over higher-order patterns, the output of the algorithm is a nite set DAG solved forms 9], constrained by some exible-exible equations with the same head on both sides. Indeed, in the presence of AC constants, such...

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

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