نتایج جستجو برای: irregular lattice networks

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

Journal: :Neural computation 2008
Arvind Kumar Sven Schrader Ad Aertsen Stefan Rotter

We studied the dynamics of large networks of spiking neurons with conductance-based (nonlinear) synapses and compared them to networks with current-based (linear) synapses. For systems with sparse and inhibition-dominated recurrent connectivity, weak external inputs induced asynchronous irregular firing at low rates. Membrane potentials fluctuated a few millivolts below threshold, and membrane ...

1999
Jie Wu Li Sheng

In this paper we propose a deadlock free routing in irregular networks using pre x routing Pre x routing is a special type of routing with a compact routing table associated with each node processor Basically each outgoing channel of a node is assigned a special label and an outgoing channel is selected if its label is a pre x of the label of the destination node Node and channel labeling in an...

1999
Matthew G. Jacunski P. Sadayappan Dhabaleswar K. Panda

This paper presents efficient all-to-all broadcast algorithms for arbitrary irregular networks with switch-based wormhole interconnection and unicast message passing. First, all-to-all broadcast is considered within a single switch cluster. Both combining and non-combining algorithms are compared via analytical modeling and simulation. The characteristics of optimal all-to-all broadcast operati...

2006
Ashok Subramanian Nitin

This paper presents the reliability studies of fault-tolerant Zeta Networks (ZTNs): a MIN, designed specially for an irregular class of hybrid networks. The reliability of ZTNs under Dynamic Full Access (DFA) is studied. The metrics used are mean time to failure (MTTF) and cost-effectiveness. Studies of tight Upper Bound (UB) and Lower Bound (LB) of the MTTF shows that ZTNs are more reliable an...

2015
Renato Baldini Filho Unias de Lucena Antonio

This paper presents a study on the VHDL implementation of a class of binary irregular structured LDPC codes (IS-LDPC) applied to 100 Gbps optical networks. A comparison between two iterative decoding algorithms for irregular structured LDPC codes, sum-product based on loglikelihood ratio and min-sum, is used to define the best choice for implementation. The performances of IS-LDPC codes are eva...

2012
RON PELED

We consider the hard-core lattice gas model on Z and investigate its phase structure in high dimensions. We prove that when the intensity parameter exceeds Cd−1/3(log d), the model exhibits multiple hard-core measures, thus improving the previous bound of Cd−1/4(log d) given by Galvin and Kahn. At the heart of our approach lies the study of a certain class of edge cutsets in Z, the so-called od...

2010
Ronald P. Barry Julie McIntyre

Density estimates based on point processes are often restrained to regions with irregular boundaries or holes. We propose a density estimator, the lattice-based density estimator, which produces reasonable density estimates under these circumstances. The estimation process starts with overlaying the region with nodes, linking these together in a lattice and then computing the density of random ...

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

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