نتایج جستجو برای: duration dij

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

1997
Ernst-Rüdiger Olderog Henning Dierks

In this paper we show that every real-time system speciied in a certain subset of Duration Calculus 24] can be decomposed into an untimed system communicating with suitable timers. Both asynchronous and synchronous communication are considered.

1998
W. Hübner G. P. Zhang

The spin dynamics in Ni is studied by an exact diagonalization method on the ultrafast time scale. It is shown that the femtosecond relaxation of the magneto-optical response results from exchange interaction and spin-orbit coupling. Each of the two mechanisms affects the relaxation process differently. We find that the intrinsic spin dynamics occurs during about 10 fs while extrinsic effects s...

Journal: :Journal of Applied Non-Classical Logics 2004
Dimitar P. Guelev Dang Van Hung

We present a complete axiomatisation of the operator of projection onto state in the Duration Calculus (DC ) relative to validity in DC without extending constructs. Projection onto state was introduced and studied extensively in our earlier works. We first establish the completeness of a system of axioms and proof rules for the operator relative to validity in the extension of DC by neighbourh...

2004
Samuel Colin Georges Mariano Vincent Poirriez

Among the possible approaches for expressing real-time problems with the B method, two are dominant : the use of the usual B mechanisms to define temporal constraints on one hand, and extending B through another formalism more adapted to the real-time context. We define here a possible temporal semantic for B, by using a temporal logic (the duration calculus), and we illustrate how this extensi...

Journal: :Angewandte Chemie 2021

Study of mid-infrared (mid-IR) nonlinear optical (NLO) materials is hindered by the competing requirements optimized second-harmonic generation (SHG) coefficient dij and laser-induced damage threshold (LIDT) as well harsh synthetic conditions. Herein, we report facile hydrothermal synthesis a polar NLO vanadate Cs4V8O22 (CVO) featuring quasi-rigid honeycomb-layered structure with [VO4] [VO5] po...

2007
Theresa Beaubouef Frederick E. Petry

The rough relational database model was developed for the management of uncertainty in relational databases. A particular type of knowledge discovery, attribute oriented induction of rules from generalized data is described in this paper. Rough Relational Databases In rough sets (Pawlak 1984) an approximation space is defined on some universe U by defining some equivalence relation that partiti...

Journal: :iran agricultural research 2015
naghmeh moghimi yahya emam

in order to evaluate the impact of different amounts of nitrogen fertilizer on growth and yield of two forage sorghum cultivars, a 2-year field experiment was carried out at the college of agriculture, shiraz university, shiraz, iran during 2010 and 2011 growing seasons. two factorial experiments were carried out in randomized block design with three replicates, in which the treatments included...

Journal: :Journal on Education 2022

The aims of this research are (i) to find out the economic base sector in Nunukan Regency; (ii) knowing shift structure Regency (iii) classifying pattern growth Regency. This method uses a descriptive quantitative approach. data used study is secondary from 2015-2019. analysis Location Quotient (LQ) Analysis, shiftshare and class typology. results LQ show that sectors have comparative advantage...

2005
Brian Taylor

As minimum feature sizes shrink into the deep-subwavelength range, manufacturing becomes increasingly diJ~cult, and the costs and complexity of standard cell ASIC design become prohibitive for all but the highest-volume products. Many manufacturing diJ3~culties owe to the irregularity of standard cellbased design; therefore, design using more regular logic fabrics becomes an attractive alternat...

Journal: :Optimization Letters 2012
Carlile Lavor Jon Lee Audrey Lee-St. John Leo Liberti Antonio Mucherino Maxim Sviridenko

Given a weighted, undirected simple graph G = (V,E, d) (where d : E → R+), the Distance Geometry Problem (DGP) is to determine an embedding x : V → R K such that ∀{i, j} ∈ E ‖xi − xj‖ = dij . Although, in general, the DGP is solved using continuous methods, under certain conditions the search is reduced to a discrete set of points. We give one such condition as a particular order on V . We form...

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

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