Our work is concerned with finding optimum connection strategies in highperformance associative memory models. Taking inspiration from axonal branching in biological neurons, we impose a displacement of the point of efferent arborisation, so that the output from each node travels a certain distance before branching to connect to other units. This technique is applied to networks constructed wit...

In these notes we give an extensive survey of the recent progress for critical spread-out oriented percolation above the upper critical dimension. We describe the main tools, which are the lace expansion and the inductive method. The lace expansion gives a recursion relation for the two-point functions involved, and the inductive method gives an inductive analysis of the arising recursion relat...

K. Azizi,* H. Sundu, and S. Şahin Department of Physics, Doğuş University, Acıbadem-Kadıköy, 34722 Istanbul, Turkey Department of Physics, Kocaeli University, 41380 Izmit, Turkey (Received 6 May 2013; revised manuscript received 18 July 2013; published 9 August 2013) The transition form factors of the semileptonic B ! D 2ð2460Þ‘ ð‘ 1⁄4 ; ; eÞ decay channel are calculated within the framework of...

Motion processing in visual systems is supported by various subcortical and cortical microcircuits. However, all motion processing requires a basic capacity to integrate and combine information over time, as may be true for all microcircuits that support perceptual and cognitive functions. In the present study, a generic microcircuit model is presented that selftunes its recurrent spiking dynam...

In this paper we investigate principles of the representation of time and modality in terms of conceptual graphs. Based on the works of A. N. Prior, and C. S. Peirce, we suggest a formalism that takes into account the notion of ‘Now’, as a starting point for developing a formalism that can account for comprehension of texts involving temporal descriptions. We analyze the temporal structure of t...

A necessary and sufficient condition for the almost sure existence of an absolutely continuous (with respect to the branching measure) exact Hausdorff measure on the boundary of a Galton–Watson tree is obtained. In the case where the absolutely continuous exact Hausdorff measure does not exist almost surely, a criterion which classifies gauge functions φ according to whether φ-Hausdorff measure...

Net unfoldings are a well-known partial order semantics for Petri nets. Here we show that they are well suited to act as models for branching-time logics interpreted on local states. Such local logics (in particular a distributed-calculus) can be used to express properties from the point of view of one component in a distributed system. Local logics often allow for more eecient veriication proc...

Three results'are presented: (1) The semi-leptonic branching ratio of the A, has been measured at SPEAR to be B(A+ -+ efx) = (4.5? 1.7)%. of T-pair production have been measuredCat PEP at fi = 29 GeV: (2) Properties orr/,QED = 0.972 0.05 + 0.06; the forward-backward asymmetry is A,, = (-3.5 t 5.0)%; inclusive branching ratios are B(T -+ 1 Prong) = (86 +4)%, B(T + 3 Prongs) = (14 ?4)%, B(-c + 5 ...

We give explicit formulae for most likely paths to extinction in simple branching models when initial population is large. In discrete time, we study the Galton-Watson process, and in continuous time, the branching diffusion. Themost likely paths are found with the help of the large deviation principle (LDP). We also find asymptotics for the extinction probability, which gives a new expression ...

In this work we formally verify the soundness and precision of a static program analysis that detects conflicts (e.g. data races) in programs with procedures, thread creation and monitors with the Isabelle theorem prover. As common in static program analysis, our program model abstracts guarded branching by nondeterministic branching, but completely interprets the call-/return behavior of proce...