Circuit layout

Soukup, Jiří

doi:10.1109/proc.1981.12167

Cited by 174 publications

(33 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Two components are adjacent if immediately contiguous topologically (as are, e.g., the United States and Canada). The rule is a candidate for a network wire-minimizing heuristic (17); in fact, it is also extensively confirmed for macaque and cat visual cortex areas, rat olfactory areas, and C. elegans ganglia (1,2,18,19). Conformance of a cortex layout to such a ''myopic'' adjacency rule is much more feasible to compute than its total wire length cost: Just compare interconnections and contiguities of the layout's areas and score how many rule-violations occur.…”

Section: Adjacency Rule Costingmentioning

confidence: 99%

Global optimization of cerebral cortex layout

Cherniak

Mokhtarzada

Rodriguez‐Esteban

et al. 2004

Proc. Natl. Acad. Sci. U.S.A.

160

117

View full text Add to dashboard Cite

Functional areas of mammalian cerebral cortex seem positioned to minimize costs of their interconnections, down to a best-in-abillion optimality level. The optimization problem here, originating in microcircuit design, is: Given connections among components, what is the physical placement of the components on a surface that minimizes total length of connections? Because of unfeasibility of measuring long-range ''wire length'' in the cortex, a simpler adjacency cost was validated. To deal with incomplete information on brain networks, a size law was developed that predicts optimization patterns in subnetworks. Macaque and cat cortex rank better in this connection optimization than the wiring of comparably structured computer chips, but somewhat worse than the macroeconomic commodity-flow network among U.S. states. However, cortex wiring conforms to the size law better than the macroeconomic patterns, which may indicate cortex optimizing mechanisms involve more global processes.

show abstract

Section: Adjacency Rule Costingmentioning

confidence: 99%

Global optimization of cerebral cortex layout

Cherniak

Mokhtarzada

Rodriguez‐Esteban

et al. 2004

Proc. Natl. Acad. Sci. U.S.A.

160

117

View full text Add to dashboard Cite

show abstract

“…In the past few years considerable progress has been reported in nonlinear optimization problems by the introduction of simulated annealing (Kirkpatrick, Gelatt & Vecchi, 1983). Simulated annealing (SA) is now in widespread use in areas such as electronic circuit design (Soukop, 1981). The method usually consists of simulating the many-parameter system by a Monte Carlo algorithm (Metropolis, Rosenbluth, Rosenbluth, Teller & Teller, 1953) which involves trial moves of xl,x2,...,x,,.…”

Section: Y~ Wh[lfobs(h)l-klfc~~(h)l] 2 (I)mentioning

confidence: 99%

Crystallographic refinement by simulated annealing: application to crambin

Brünger¹,

Karplus²,

Petsko³

1989

Acta Cryst Sect A

293

167

View full text Add to dashboard Cite

A MEMORY-EFFICIENT FFT ALGORITHMvectorized SGFFT algorithm is up to 26 times faster than the vectorized direct summation method on the Cray-XMP. Since the SGFFT algorithm is designed in a general and simple way, it is expected that it could be efficiently implemented on supercomputers with new parallel architectures.The author thanks M. Karplus, J. Kuriyan, G. A. Petsko and W. I. Weis for useful discussions. The work described in this paper was begun while the author was a research associate at Harvard University. References AGARWAL, R. C. (1978). Acta Cryst. A43, 791-809. AGARWAL, R. C. (1981) International Tables for X-ray Crystallography (1952). Vol. I. Birmingham: Kynoch Press.International Tables for X-ray Co,stallography (1974 stage is discussed. Optimal success is achieved at relatively high temperatures. Regardless of the protocol used, the molecular-dynamics refined structure always yields an improved R factor compared with restrained least-squares refinement without manual re-fitting. The differences between the various refined structures and the corresponding electron density maps are discussed.

show abstract

“…Vintr's algorithm, as outlined by Soukup [9], only considers the implementation of nets from the endpoints (terminals). The middle portions of all nets are discarded and disregarded during routing.…”

Section: Vintr's Algorithm -Vinbasic and Vinpenaltymentioning

confidence: 99%

“…There are two main techniques that have been used: iterative routing and dynamic routing. Iterative routers [4,5,6,2,7,8,9] are characterised by multiple passes through the net list. Each net is routed so as to minimise a cost function that includes a crossover penalty for crossing other nets.…”

Section: Introductionmentioning

confidence: 99%