Results 1  10
of
716
1Modelling Digital Systems using Behavioural Fragments
, 2015
"... is a discussion of the work I have been doing since I started ..."
Generic behaviours in impact fragmentation
, 2008
"... We present a simple numerical model for investigating the general properties of fragmentation. By use of molecular dynamics simulations, we study the impact fragmentation of a solid disk of interacting particles with a wall. Regardless of the particular form of the interaction potential, the fragmen ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
, the fragment size distribution exhibits a power law behaviour with an exponent that increases logarithmically with the energy deposited in the system, in agreement with experiments. We expect this behaviour to be generic in fragmentation phenomena.
Asymptotic Behaviour of Solutions to the CoagulationFragmentation Equations. II. Weak Fragmentation
 Proc. Royal Soc. Edinburgh
, 1992
"... this paper we assume that a j,k # K a (j + k) (1.3) for all j, k # 1, and some constant K a > 0. This condition ensures coagulation does not lead to the breakdown of density conservation, [2]. Equations (1.1) , as well as some important special cases such as the Smoluchowski (b j,k # 0 for ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
] for coagulation coe#cients satisfying (1.3). Two classes of fragmentation coe#cients have been identified, each leading to distinctive behaviour of solutions. In a recent paper, [4], Carr considered the following `strong fragmentation' condition, namely that there exists a # > 0 such that for all m # 0
Kinetics of fragmentation
, 1989
"... Abstract. A general discussion of the kinetics of continuous, irreversible fragmentation processes is presented. For a linear process, where particle breakup is driven by an external force, we develop a scaling theory to describe the evolution of the cluster size distribution. We treat the general c ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
is determined by the initial condition. In this regime, we also investigate the nature of a ‘shattering ’ transition, where mass is lost to a ‘dust ’ phase of zeromass particles. We also study the kinetics of a nonlinear, collisioninduced fragmentation process. We analyse the asymptotic behaviours of a simple
Discretization methods for homogeneous fragmentations
 J. London Math. soc
, 2005
"... Summary. Homogeneous fragmentations describe the evolution of a unit mass that breaks down randomly into pieces as time passes. They can be thought of as continuous time analogs of a certain type of branching random walks, which suggests the use of timediscretization to shift known results from the ..."
Abstract

Cited by 28 (6 self)
 Add to MetaCart
the theory of branching random walks to the fragmentation setting. In particular, this yields interesting information about the asymptotic behaviour of fragmentations. On the other hand, homogeneous fragmentations can also be investigated using a powerful technique of discretization of space due to Kingman
Mining Web Navigation Path Fragments
 In Proceedings of the Workshop on Web Mining for ECommerce – Challenges and Opportunities
, 2000
"... For many web usage mining applications like, e.g., user segmentation, it is crucial to compare navigation paths of dierent users. We model user navigation path fragments by generalized subsequences that take into consideration local deviations but still sketch the global user navigational behaviour. ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
For many web usage mining applications like, e.g., user segmentation, it is crucial to compare navigation paths of dierent users. We model user navigation path fragments by generalized subsequences that take into consideration local deviations but still sketch the global user navigational behaviour
Eigenelements of a general aggregationfragmentation model
, 2009
"... We consider a linear integrodifferential equation which arises to describe both aggregationfragmentation processes and cell division. We prove the existence of a solution (λ, U, φ) to the related eigenproblem. Such eigenelements are useful to study the long time asymptotic behaviour of solutions a ..."
Abstract

Cited by 40 (17 self)
 Add to MetaCart
We consider a linear integrodifferential equation which arises to describe both aggregationfragmentation processes and cell division. We prove the existence of a solution (λ, U, φ) to the related eigenproblem. Such eigenelements are useful to study the long time asymptotic behaviour of solutions
Fragmented Retrenchment, Concurrency and Fairness
"... Retrenchment is presented in a simple relational framework as a more flexible development concept than refinement for capturing the early preformal stages of development, and briefly justified. Fragmented retrenchment permits the granularity of actions to decrease across a development step, many con ..."
Abstract

Cited by 6 (5 self)
 Add to MetaCart
of the fragmented retrenchment proof obligation permits acceptable interleavings of retrenchments of different steps. It is observed that retrenchment allows the convenient description of unfair behaviours when fairness is not guaranteed.
Deciding the guarded fragments by resolution
 J. Symbolic Computat
"... Abstract The guarded fragment (GF) is a fragment of firstorder logic that has been introduced for two main reasons: first, to explain the good computational and logical behaviour of propositional modal logics. Second, to serve as a breeding ground for wellbehaved process logics. In this paper we ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Abstract The guarded fragment (GF) is a fragment of firstorder logic that has been introduced for two main reasons: first, to explain the good computational and logical behaviour of propositional modal logics. Second, to serve as a breeding ground for wellbehaved process logics. In this paper we
FREE AND FRAGMENTING FILLING LENGTH
, 2005
"... Abstract. The filling length of an edgecircuitη in the Cayley 2complex of a finite presentation of a group is the minimal integer length L such that there is a combinatorial nullhomotopy ofηdown to a base point through loops of length at most L. We introduce similar notions in which the nullhomo ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
homotopy is not required to fix a base point, and in which the contracting loop is allowed to bifurcate. We exhibit a group in which the resulting filling invariants exhibit dramatically different behaviour to the standard notion of filling length. We also define the corresponding filling invariants for Riemannian
Results 1  10
of
716