摘要 :
This survey gives an overview of popular generative models used in the modelling of stochastic temporal systems. In particular, this survey is organized into two parts. The first part discusses the discrete-time representations of...
展开
This survey gives an overview of popular generative models used in the modelling of stochastic temporal systems. In particular, this survey is organized into two parts. The first part discusses the discrete-time representations of dynamic Bayesian networks and dynamic relational probabilistic models, while the second part discusses the continuous-time representation of continuous-time Bayesian networks.
收起
摘要 :
In this report, I review the notations used for specifying software requirements211 in the Yourdon Systems Method (1993 version), the Fusion method (1996 version), 211 and the Unified Modeling Language (version 1.1, autumn 1997). ...
展开
In this report, I review the notations used for specifying software requirements211 in the Yourdon Systems Method (1993 version), the Fusion method (1996 version), 211 and the Unified Modeling Language (version 1.1, autumn 1997). I analyze and 211 compare these notations in terms of a framework for requirement specification 211 that is derived from systems engineering. The different structures of the 211 requirement specifications in each of these notations turn out to have much in 211 common. A detailed analysis of the notations leads to the identification of a 211 common structure, which incorporates elements of the Yourdon Systems Method as 211 well as of the object-oriented methods. The analysis shows that underneath the 211 differences between structured and object-oriented requirement specification, 211 there is a consensus about the structure of a software requirement specification. 211 This leads to the definition of a Toolkit for Requirements and Design Engineering 211 (TRADE), outlined in this report.
收起
摘要 :
In this paper we indicate the proof of an effective version of the Green-Griffiths conjecture for surfaces of general type and positive second Segre class (i.e. c21 > c2). Naturally this effective version is stronger than the Gree...
展开
In this paper we indicate the proof of an effective version of the Green-Griffiths conjecture for surfaces of general type and positive second Segre class (i.e. c21 > c2). Naturally this effective version is stronger than the Green-Griffiths conjecture itself. The manuscript is said to be preliminary since few details of our method of dynamic diophantine approximations are given for arbitrary ramified covers of the complex line. All the detials are, however, given in the case of the complex line itself, and whence a complete proof of the Green-Griffiths conjecture, for the said class of surfaces.
收起
摘要 :
The authors consider the following problem: for which values of n can the211 sequence a(sub 1),...,a(sub n) of real numbers be reconstructed (up to order) 211 from the sequence S(sub 1),...,S(sub m) of the sums a(sub i) + a(sub j)...
展开
The authors consider the following problem: for which values of n can the211 sequence a(sub 1),...,a(sub n) of real numbers be reconstructed (up to order) 211 from the sequence S(sub 1),...,S(sub m) of the sums a(sub i) + a(sub j) (1 < or + 211 i < j < or + n, m = ((sup n)(sub 2))). The answer is positive for n = 3, 5, 6, 211 and its negative for n = 2(sup k) (k > or = 0).
收起
