Netlist Oriented Sensitivity Evaluation (NOSE)
2017-03-01
representing the official policies or endorsements, either expressed or implied, of Air Force Research Laboratory (AFRL) and the Defense Advanced Research... Heuristics for generating an alternative netlist implementation for the same logic function to achieve a better robustness measure 2...sensitivity study: 1. Tools to calculate sensitivity of netlist nodes (signals) and heuristics for generating alternative netlist implementations
Einspruch, Norman G
1986-01-01
VLSI Electronics Microstructure Science, Volume 14: VLSI Design presents a comprehensive exposition and assessment of the developments and trends in VLSI (Very Large Scale Integration) electronics. This volume covers topics that range from microscopic aspects of materials behavior and device performance to the comprehension of VLSI in systems applications. Each article is prepared by a recognized authority. The subjects discussed in this book include VLSI processor design methodology; the RISC (Reduced Instruction Set Computer); the VLSI testing program; silicon compilers for VLSI; and special
Basu, D K
2014-01-01
Very Large Scale Integrated Circuits (VLSI) design has moved from costly curiosity to an everyday necessity, especially with the proliferated applications of embedded computing devices in communications, entertainment and household gadgets. As a result, more and more knowledge on various aspects of VLSI design technologies is becoming a necessity for the engineering/technology students of various disciplines. With this goal in mind the course material of this book has been designed to cover the various fundamental aspects of VLSI design, like Categorization and comparison between various technologies used for VLSI design Basic fabrication processes involved in VLSI design Design of MOS, CMOS and Bi CMOS circuits used in VLSI Structured design of VLSI Introduction to VHDL for VLSI design Automated design for placement and routing of VLSI systems VLSI testing and testability The various topics of the book have been discussed lucidly with analysis, when required, examples, figures and adequate analytical and the...
Triple Modular Redundancy verification via heuristic netlist analysis
Directory of Open Access Journals (Sweden)
Giovanni Beltrame
2015-08-01
Full Text Available Triple Modular Redundancy (TMR is a common technique to protect memory elements for digital processing systems subject to radiation effects (such as in space, high-altitude, or near nuclear sources. This paper presents an approach to verify the correct implementation of TMR for the memory elements of a given netlist (i.e., a digital circuit specification using heuristic analysis. The purpose is detecting any issues that might incur during the use of automatic tools for TMR insertion, optimization, place and route, etc. Our analysis does not require a testbench and can perform full, exhaustive coverage within less than an hour even for large designs. This is achieved by applying a divide et impera approach, splitting the circuit into smaller submodules without loss of generality, instead of applying formal verification to the whole netlist at once. The methodology has been applied to a production netlist of the LEON2-FT processor that had reported errors during radiation testing, successfully showing a number of unprotected memory elements, namely 351 flip-flops.
Chandrasetty, Vikram Arkalgud
2011-01-01
This book provides insight into the practical design of VLSI circuits. It is aimed at novice VLSI designers and other enthusiasts who would like to understand VLSI design flows. Coverage includes key concepts in CMOS digital design, design of DSP and communication blocks on FPGAs, ASIC front end and physical design, and analog and mixed signal design. The approach is designed to focus on practical implementation of key elements of the VLSI design process, in order to make the topic accessible to novices. The design concepts are demonstrated using software from Mathworks, Xilinx, Mentor Graphic
Agneessens, F.; Moser, C.; Barnett, G.A.
2011-01-01
Bipartite networks refer to a specific kind of network in which the nodes (or actors) can be partitioned into two subsets based on the fact that no links exist between actors within each subset, but only between the two subsets. Due to the partition of actors in two sets and the absence of relations
VLSI electronics microstructure science
1982-01-01
VLSI Electronics: Microstructure Science, Volume 4 reviews trends for the future of very large scale integration (VLSI) electronics and the scientific base that supports its development.This book discusses the silicon-on-insulator for VLSI and VHSIC, X-ray lithography, and transient response of electron transport in GaAs using the Monte Carlo method. The technology and manufacturing of high-density magnetic-bubble memories, metallic superlattices, challenge of education for VLSI, and impact of VLSI on medical signal processing are also elaborated. This text likewise covers the impact of VLSI t
Einspruch, Norman G
1989-01-01
VLSI Electronics Microstructure Science, Volume 17: VLSI in Medicine deals with the more important applications of VLSI in medical devices and instruments.This volume is comprised of 11 chapters. It begins with an article about medical electronics. The following three chapters cover diagnostic imaging, focusing on such medical devices as magnetic resonance imaging, neurometric analyzer, and ultrasound. Chapters 5, 6, and 7 present the impact of VLSI in cardiology. The electrocardiograph, implantable cardiac pacemaker, and the use of VLSI in Holter monitoring are detailed in these chapters. The
VLSI electronics microstructure science
1981-01-01
VLSI Electronics: Microstructure Science, Volume 3 evaluates trends for the future of very large scale integration (VLSI) electronics and the scientific base that supports its development.This book discusses the impact of VLSI on computer architectures; VLSI design and design aid requirements; and design, fabrication, and performance of CCD imagers. The approaches, potential, and progress of ultra-high-speed GaAs VLSI; computer modeling of MOSFETs; and numerical physics of micron-length and submicron-length semiconductor devices are also elaborated. This text likewise covers the optical linewi
Towards a more accurate extraction of the SPICE netlist from MAGIC based layouts
Energy Technology Data Exchange (ETDEWEB)
Geronimo, G.D.
1998-08-01
The extraction of the SPICE netlist form MAGIC based layouts is investigated. It is assumed that the layout is fully coherent with the corresponding mask representation. The process of the extraction can be made in three steps: (1) extraction of .EXT file from layout, through MAGIC command extract; (2) extraction of the netlist from .EXT file through ext2spice extractor; and (3) correction of the netlist through ext2spice.corr program. Each of these steps introduces some approximations, most of which can be optimized, and some errors, most of which can be corrected. Aim of this work is the description of each step, of the approximations and errors on each step, and of the corresponding optimizations and corrections to be made in order to improve the accuracy of the extraction. The HP AMOS14TB 0.5 {micro}m process with linear capacitor and silicide block options and the corresponding SCN3MLC{_}SUBM.30.tech27 technology file will be used in the following examples.
Einspruch, Norman G
1984-01-01
VLSI Electronics: Microstructure Science, Volume 8: Plasma Processing for VLSI (Very Large Scale Integration) discusses the utilization of plasmas for general semiconductor processing. It also includes expositions on advanced deposition of materials for metallization, lithographic methods that use plasmas as exposure sources and for multiple resist patterning, and device structures made possible by anisotropic etching.This volume is divided into four sections. It begins with the history of plasma processing, a discussion of some of the early developments and trends for VLSI. The second section
Einspruch, Norman G
1987-01-01
VLSI Electronics Microstructure Science, Volume 16: Lithography for VLSI treats special topics from each branch of lithography, and also contains general discussion of some lithographic methods.This volume contains 8 chapters that discuss the various aspects of lithography. Chapters 1 and 2 are devoted to optical lithography. Chapter 3 covers electron lithography in general, and Chapter 4 discusses electron resist exposure modeling. Chapter 5 presents the fundamentals of ion-beam lithography. Mask/wafer alignment for x-ray proximity printing and for optical lithography is tackled in Chapter 6.
DEFF Research Database (Denmark)
Elmasry, Amr; Jensen, Claus; Katajainen, Jyrki
2017-01-01
the (total) number of elements stored in the data structure(s) prior to the operation. As the resulting data structure consists of two components that are different variants of binomial heaps, we call it a bipartite binomial heap. Compared to its counterpart, a multipartite binomial heap, the new structure...
MRI findings in bipartite patella
International Nuclear Information System (INIS)
Kavanagh, Eoin C.; Zoga, Adam; Omar, Imran; Ford, Stephanie; Eustace, Stephen; Schweitzer, Mark
2007-01-01
Bipartite patella is a known cause of anterior knee pain. Our purpose was to detail the magnetic resonance imaging (MRI) features of bipartite patella in a retrospective cohort of patients imaged at our institution. MRI exams from 53 patients with findings of bipartite patella were evaluated to assess for the presence of bone marrow edema within the bipartite fragment and for the presence of abnormal signal across the synchondrosis or pseudarthrosis. Any other significant knee pathology seen at MRI was also recorded. We also reviewed 400 consecutive knee MRI studies to determine the MRI prevalence of bipartite patella. Of the 53 patients with bipartite patella 40 (75%) were male; 35 (66%) had edema within the bipartite fragment. Of the 18 with no edema an alternative explanation for knee pain was found in 13 (72%). Edema within the bipartite fragment was the sole finding in 26 of 53 (49%) patients. Bipartite patella was seen in 3 (0.7%) of 400 patients. In patients with bipartite patella at knee MRI, bone marrow edema within the bipartite fragment was the sole finding on knee MRI in almost half of the patients in our series. (orig.)
Truong, T. K.; Reed, I.; Yeh, C.; Shao, H.
1985-01-01
Fermat number transformation convolutes two digital data sequences. Very-large-scale integration (VLSI) applications, such as image and radar signal processing, X-ray reconstruction, and spectrum shaping, linear convolution of two digital data sequences of arbitrary lenghts accomplished using Fermat number transform (ENT).
Latent geometry of bipartite networks
Kitsak, Maksim; Papadopoulos, Fragkiskos; Krioukov, Dmitri
2017-03-01
Despite the abundance of bipartite networked systems, their organizing principles are less studied compared to unipartite networks. Bipartite networks are often analyzed after projecting them onto one of the two sets of nodes. As a result of the projection, nodes of the same set are linked together if they have at least one neighbor in common in the bipartite network. Even though these projections allow one to study bipartite networks using tools developed for unipartite networks, one-mode projections lead to significant loss of information and artificial inflation of the projected network with fully connected subgraphs. Here we pursue a different approach for analyzing bipartite systems that is based on the observation that such systems have a latent metric structure: network nodes are points in a latent metric space, while connections are more likely to form between nodes separated by shorter distances. This approach has been developed for unipartite networks, and relatively little is known about its applicability to bipartite systems. Here, we fully analyze a simple latent-geometric model of bipartite networks and show that this model explains the peculiar structural properties of many real bipartite systems, including the distributions of common neighbors and bipartite clustering. We also analyze the geometric information loss in one-mode projections in this model and propose an efficient method to infer the latent pairwise distances between nodes. Uncovering the latent geometry underlying real bipartite networks can find applications in diverse domains, ranging from constructing efficient recommender systems to understanding cell metabolism.
Directory of Open Access Journals (Sweden)
Urard Pascal
2006-01-01
Full Text Available We propose an efficient IP-block-based design environment for high-throughput VLSI systems. The flow generates SystemC register-transfer-level (RTL architecture, starting from a Matlab functional model described as a netlist of functional IP. The refinement model inserts automatically control structures to manage delays induced by the use of RTL IPs. It also inserts a control structure to coordinate the execution of parallel clocked IP. The delays may be managed by registers or by counters included in the control structure. The flow has been used successfully in three real-world DSP systems. The experimentations show that the approach can produce efficient RTL architecture and allows to save huge amount of time.
Groupies in random bipartite graphs
Yilun Shang
2010-01-01
A vertex $v$ of a graph $G$ is called a groupie if its degree is notless than the average of the degrees of its neighbors. In thispaper we study the influence of bipartition $(B_1,B_2)$ on groupiesin random bipartite graphs $G(B_1,B_2,p)$ with both fixed $p$ and$p$ tending to zero.
Chen, Wai-Kai
2007-01-01
Written by a stellar international panel of expert contributors, this handbook remains the most up-to-date, reliable, and comprehensive source for real answers to practical problems. In addition to updated information in most chapters, this edition features several heavily revised and completely rewritten chapters, new chapters on such topics as CMOS fabrication and high-speed circuit design, heavily revised sections on testing of digital systems and design languages, and two entirely new sections on low-power electronics and VLSI signal processing. An updated compendium of references and othe
McKenzie, Neil
1989-12-01
We present a design for a low-cost, functional VLSI chip tester. It is based on the Apple MacIntosh II personal computer. It tests chips that have up to 128 pins. All pin drivers of the tester are bidirectional; each pin is programmed independently as an input or an output. The tester can test both static and dynamic chips. Rudimentary speed testing is provided. Chips are tested by executing C programs written by the user. A software library is provided for program development. Tests run under both the Mac Operating System and A/UX. The design is implemented using Xilinx Logic Cell Arrays. Price/performance tradeoffs are discussed.
VLSI signal processing technology
Swartzlander, Earl
1994-01-01
This book is the first in a set of forthcoming books focussed on state-of-the-art development in the VLSI Signal Processing area. It is a response to the tremendous research activities taking place in that field. These activities have been driven by two factors: the dramatic increase in demand for high speed signal processing, especially in consumer elec tronics, and the evolving microelectronic technologies. The available technology has always been one of the main factors in determining al gorithms, architectures, and design strategies to be followed. With every new technology, signal processing systems go through many changes in concepts, design methods, and implementation. The goal of this book is to introduce the reader to the main features of VLSI Signal Processing and the ongoing developments in this area. The focus of this book is on: • Current developments in Digital Signal Processing (DSP) pro cessors and architectures - several examples and case studies of existing DSP chips are discussed in...
Hill, M.T.; Oei, Y.S.; Smit, M.K.
2007-01-01
We examine the use of micro and nano lasers to form digital photonic VLSI building blocks. Problems such as isolation and cascading of building blocks are addressed, and the potential of future nano lasers explored.
VLSI Architectures for Computing DFT's
Truong, T. K.; Chang, J. J.; Hsu, I. S.; Reed, I. S.; Pei, D. Y.
1986-01-01
Simplifications result from use of residue Fermat number systems. System of finite arithmetic over residue Fermat number systems enables calculation of discrete Fourier transform (DFT) of series of complex numbers with reduced number of multiplications. Computer architectures based on approach suitable for design of very-large-scale integrated (VLSI) circuits for computing DFT's. General approach not limited to DFT's; Applicable to decoding of error-correcting codes and other transform calculations. System readily implemented in VLSI.
VLSI implementations for image communications
Pirsch, P
1993-01-01
The past few years have seen a rapid growth in image processing and image communication technologies. New video services and multimedia applications are continuously being designed. Essential for all these applications are image and video compression techniques. The purpose of this book is to report on recent advances in VLSI architectures and their implementation for video signal processing applications with emphasis on video coding for bit rate reduction. Efficient VLSI implementation for video signal processing spans a broad range of disciplines involving algorithms, architectures, circuits
Fractal and multifractal analyses of bipartite networks
Liu, Jin-Long; Wang, Jian; Yu, Zu-Guo; Xie, Xian-Hua
2017-03-01
Bipartite networks have attracted considerable interest in various fields. Fractality and multifractality of unipartite (classical) networks have been studied in recent years, but there is no work to study these properties of bipartite networks. In this paper, we try to unfold the self-similarity structure of bipartite networks by performing the fractal and multifractal analyses for a variety of real-world bipartite network data sets and models. First, we find the fractality in some bipartite networks, including the CiteULike, Netflix, MovieLens (ml-20m), Delicious data sets and (u, v)-flower model. Meanwhile, we observe the shifted power-law or exponential behavior in other several networks. We then focus on the multifractal properties of bipartite networks. Our results indicate that the multifractality exists in those bipartite networks possessing fractality. To capture the inherent attribute of bipartite network with two types different nodes, we give the different weights for the nodes of different classes, and show the existence of multifractality in these node-weighted bipartite networks. In addition, for the data sets with ratings, we modify the two existing algorithms for fractal and multifractal analyses of edge-weighted unipartite networks to study the self-similarity of the corresponding edge-weighted bipartite networks. The results show that our modified algorithms are feasible and can effectively uncover the self-similarity structure of these edge-weighted bipartite networks and their corresponding node-weighted versions.
Searching for Communities in Bipartite Networks
Barber, Michael J.; Faria, Margarida; Streit, Ludwig; Strogan, Oleg
2008-01-01
Bipartite networks are a useful tool for representing and investigating interaction networks. We consider methods for identifying communities in bipartite networks. Intuitive notions of network community groups are made explicit using Newman's modularity measure. A specialized version of the modularity, adapted to be appropriate for bipartite networks, is presented; a corresponding algorithm is described for identifying community groups through maximizing this measure. The algorithm is applie...
Bone-scintigraphy in painful bipartite patella
International Nuclear Information System (INIS)
Iossifidis, A.; Brueton, R.N.; Nunan, T.O.
1995-01-01
Although, the use of technetium scintigraphy in the assessment of anterior knee pain has been described, no reference has been made to the scintigraphic appearances of painful bipartite patella. We report the scintigraphic-appearances of painful bipartite patella in 25-year-old man a 2 1/2 years history of unexplained patellar pain. Painful bipartite patella is a rare cause of chronic post-traumatic patellar pain. Bone scintigraphy, by demonstrating increased uptake by the painful accessory bipartite fragment, appears to be an imaging method of choice in the diagnosis of this condition. (orig./MG)
Effect of attachment strategies on bipartite networks
DEFF Research Database (Denmark)
Ganguly, N.; Saha, S.; Maiti, A.
2013-01-01
Bipartite systems show remarkable variations in their topological asymptotic properties, e. g., in their degree distribution. Such variations depend on the underlying growth dynamics. A scenario of particular importance is when the two partitions of the bipartite structure do not grow at an equal...
Quantum open system theory: bipartite aspects.
Yu, T; Eberly, J H
2006-10-06
We demonstrate in straightforward calculations that even under ideally weak noise the relaxation of bipartite open quantum systems contains elements not previously encountered in quantum noise physics. While additivity of decay rates is known to be generic for decoherence of a single system, we demonstrate that it breaks down for bipartite coherence of even the simplest composite systems.
VLSI structures for track finding
International Nuclear Information System (INIS)
Dell'Orso, M.
1989-01-01
We discuss the architecture of a device based on the concept of associative memory designed to solve the track finding problem, typical of high energy physics experiments, in a time span of a few microseconds even for very high multiplicity events. This ''machine'' is implemented as a large array of custom VLSI chips. All the chips are equal and each of them stores a number of ''patterns''. All the patterns in all the chips are compared in parallel to the data coming from the detector while the detector is being read out. (orig.)
Baviere, Ph.
Tests which have proven effective for evaluating VLSI circuits for space applications are described. It is recommended that circuits be examined after each manfacturing step to gain fast feedback on inadequacies in the production system. Data from failure modes which occur during operational lifetimes of circuits also permit redefinition of the manufacturing and quality control process to eliminate the defects identified. Other tests include determination of the operational envelope of the circuits, examination of the circuit response to controlled inputs, and the performance and functional speeds of ROM and RAM memories. Finally, it is desirable that all new circuits be designed with testing in mind.
Surface and interface effects in VLSI
Einspruch, Norman G
1985-01-01
VLSI Electronics Microstructure Science, Volume 10: Surface and Interface Effects in VLSI provides the advances made in the science of semiconductor surface and interface as they relate to electronics. This volume aims to provide a better understanding and control of surface and interface related properties. The book begins with an introductory chapter on the intimate link between interfaces and devices. The book is then divided into two parts. The first part covers the chemical and geometric structures of prototypical VLSI interfaces. Subjects detailed include, the technologically most import
3-biplacement of bipartite graphs
Directory of Open Access Journals (Sweden)
Lech Adamus
2008-01-01
Full Text Available Let \\(G=(L,R;E\\ be a bipartite graph with color classes \\(L\\ and \\(R\\ and edge set \\(E\\. A set of two bijections \\(\\{\\varphi_1 , \\varphi_2\\}\\, \\(\\varphi_1 , \\varphi_2 :L \\cup R \\to L \\cup R\\, is said to be a \\(3\\-biplacement of \\(G\\ if \\(\\varphi_1(L= \\varphi_2(L = L\\ and \\(E \\cap \\varphi_1^*(E=\\emptyset\\, \\(E \\cap \\varphi_2^*(E=\\emptyset\\, \\(\\varphi_1^*(E \\cap \\varphi_2^*(E=\\emptyset\\, where \\(\\varphi_1^*\\, \\(\\varphi_2^*\\ are the maps defined on \\(E\\, induced by \\(\\varphi_1\\, \\(\\varphi_2\\, respectively. We prove that if \\(|L| = p\\, \\(|R| = q\\, \\(3 \\leq p \\leq q\\, then every graph \\(G=(L,R;E\\ of size at most \\(p\\ has a \\(3\\-biplacement.
Separable decompositions of bipartite mixed states
Li, Jun-Li; Qiao, Cong-Feng
2018-04-01
We present a practical scheme for the decomposition of a bipartite mixed state into a sum of direct products of local density matrices, using the technique developed in Li and Qiao (Sci. Rep. 8:1442, 2018). In the scheme, the correlation matrix which characterizes the bipartite entanglement is first decomposed into two matrices composed of the Bloch vectors of local states. Then, we show that the symmetries of Bloch vectors are consistent with that of the correlation matrix, and the magnitudes of the local Bloch vectors are lower bounded by the correlation matrix. Concrete examples for the separable decompositions of bipartite mixed states are presented for illustration.
VLSI Technology for Cognitive Radio
VIJAYALAKSHMI, B.; SIDDAIAH, P.
2017-08-01
One of the most challenging tasks of cognitive radio is the efficiency in the spectrum sensing scheme to overcome the spectrum scarcity problem. The popular and widely used spectrum sensing technique is the energy detection scheme as it is very simple and doesn’t require any previous information related to the signal. We propose one such approach which is an optimised spectrum sensing scheme with reduced filter structure. The optimisation is done in terms of area and power performance of the spectrum. The simulations of the VLSI structure of the optimised flexible spectrum is done using verilog coding by using the XILINX ISE software. Our method produces performance with 13% reduction in area and 66% reduction in power consumption in comparison to the flexible spectrum sensing scheme. All the results are tabulated and comparisons are made. A new scheme for optimised and effective spectrum sensing opens up with our model.
Bipartite Bell Inequality and Maximal Violation
International Nuclear Information System (INIS)
Li Ming; Fei Shaoming; Li-Jost Xian-Qing
2011-01-01
We present new bell inequalities for arbitrary dimensional bipartite quantum systems. The maximal violation of the inequalities is computed. The Bell inequality is capable of detecting quantum entanglement of both pure and mixed quantum states more effectively. (general)
Data transfer using complete bipartite graph
Chandrasekaran, V. M.; Praba, B.; Manimaran, A.; Kailash, G.
2017-11-01
Information exchange extent is an estimation of the amount of information sent between two focuses on a framework in a given time period. It is an extremely significant perception in present world. There are many ways of message passing in the present situations. Some of them are through encryption, decryption, by using complete bipartite graph. In this paper, we recommend a method for communication using messages through encryption of a complete bipartite graph.
Anderson localization in bipartite lattices
International Nuclear Information System (INIS)
Fabrizio, Michele; Castellani, Claudio
2000-01-01
We study the localization properties of a disordered tight-binding Hamiltonian on a generic bipartite lattice close to the band center. By means of a fermionic replica trick method, we derive the effective non-linear σ-model describing the diffusive modes, which we analyse by using the Wilson-Polyakov renormalization group. In addition to the standard parameters which define the non-linear σ-model, namely, the conductance and the external frequency, a new parameter enters, which may be related to the fluctuations of the staggered density of states. We find that, when both the regular hopping and the disorder only couple one sublattice to the other, the quantum corrections to the Kubo conductivity vanish at the band center, thus implying the existence of delocalized states. In two dimensions, the RG equations predict that the conductance flows to a finite value, while both the density of states and the staggered density of states fluctuations diverge. In three dimensions, we find that, sufficiently close to the band center, all states are extended, independently of the disorder strength. We also discuss the role of various symmetry breaking terms, as a regular hopping between same sublattices, or an on-site disorder
Anderson localization in bipartite lattices
International Nuclear Information System (INIS)
Fabrizio, M.; Castellani, C.
2000-04-01
We study the localization properties of a disordered tight-binding Hamiltonian on a generic bipartite lattice close to the band center. By means of a fermionic replica trick method, we derive the effective non-linear σ-model describing the diffusive modes, which we analyse by using the Wilson-Polyakov renormalization group. In addition to the standard parameters which define the non-linear σ-model, namely the conductance and the external frequency, a new parameter enters, which may be related to the fluctuations of the staggered density of states. We find that, when both the regular hopping and the disorder only couple one sublattice to the other, the quantum corrections to the Kubo conductivity vanish at the band center, thus implying the existence of delocalized states. In two dimensions, the RG equations predict that the conductance flows to a finite value, while both the density of states and the staggered density of states fluctuations diverge. In three dimensions, we find that, sufficiently close to the band center, all states are extended, independently of the disorder strength. We also discuss the role of various symmetry breaking terms, as a regular hopping between same sublattices, or an on-site disorder. (author)
International Nuclear Information System (INIS)
Saucier, G.; Read, E.
1987-01-01
Fast-prototyping will be a reality in the very near future if both straightforward design methods and fast manufacturing facilities are available. This book focuses, first, on the motivation for fast-prototyping. Economic aspects and market considerations are analysed by European and Japanese companies. In the second chapter, new design methods are identified, mainly for full custom circuits. Of course, silicon compilers play a key role and the introduction of artificial intelligence techniques sheds a new light on the subject. At present, fast-prototyping on gate arrays or on standard cells is the most conventional technique and the third chapter updates the state-of-the art in this area. The fourth chapter concentrates specifically on the e-beam direct-writing for submicron IC technologies. In the fifth chapter, a strategic point in fast-prototyping, namely the test problem is addressed. The design for testability and the interface to the test equipment are mandatory to fulfill the test requirement for fast-prototyping. Finally, the last chapter deals with the subject of education when many people complain about the lack of use of fast-prototyping in higher education for VLSI
Compact MOSFET models for VLSI design
Bhattacharyya, A B
2009-01-01
Practicing designers, students, and educators in the semiconductor field face an ever expanding portfolio of MOSFET models. In Compact MOSFET Models for VLSI Design , A.B. Bhattacharyya presents a unified perspective on the topic, allowing the practitioner to view and interpret device phenomena concurrently using different modeling strategies. Readers will learn to link device physics with model parameters, helping to close the gap between device understanding and its use for optimal circuit performance. Bhattacharyya also lays bare the core physical concepts that will drive the future of VLSI.
Lithography requirements in complex VLSI device fabrication
International Nuclear Information System (INIS)
Wilson, A.D.
1985-01-01
Fabrication of complex very large scale integration (VLSI) circuits requires continual advances in lithography to satisfy: decreasing minimum linewidths, larger chip sizes, tighter linewidth and overlay control, increasing topography to linewidth ratios, higher yield demands, increased throughput, harsher device processing, lower lithography cost, and a larger part number set with quick turn-around time. Where optical, electron beam, x-ray, and ion beam lithography can be applied to judiciously satisfy the complex VLSI circuit fabrication requirements is discussed and those areas that are in need of major further advances are addressed. Emphasis will be placed on advanced electron beam and storage ring x-ray lithography
A Knowledge Based Approach to VLSI CAD
1983-09-01
Avail-and/or Dist ISpecial L| OI. SEICURITY CLASIIrCATION OP THIS IPA.lErllm S Daene." A KNOwLEDE BASED APPROACH TO VLSI CAD’ Louis L Steinberg and...major issues lies in building up and managing the knowledge base of oesign expertise. We expect that, as with many recent expert systems, in order to
Electro-optic techniques for VLSI interconnect
Neff, J. A.
1985-03-01
A major limitation to achieving significant speed increases in very large scale integration (VLSI) lies in the metallic interconnects. They are costly not only from the charge transport standpoint but also from capacitive loading effects. The Defense Advanced Research Projects Agency, in pursuit of the fifth generation supercomputer, is investigating alternatives to the VLSI metallic interconnects, especially the use of optical techniques to transport the information either inter or intrachip. As the on chip performance of VLSI continues to improve via the scale down of the logic elements, the problems associated with transferring data off and onto the chip become more severe. The use of optical carriers to transfer the information within the computer is very appealing from several viewpoints. Besides the potential for gigabit propagation rates, the conversion from electronics to optics conveniently provides a decoupling of the various circuits from one another. Significant gains will also be realized in reducing cross talk between the metallic routings, and the interconnects need no longer be constrained to the plane of a thin film on the VLSI chip. In addition, optics can offer an increased programming flexibility for restructuring the interconnect network.
Eigenvalues and expansion of bipartite graphs
DEFF Research Database (Denmark)
Høholdt, Tom; Janwa, Heeralal
2012-01-01
We prove lower bounds on the largest and second largest eigenvalue of the adjacency matrix of bipartite graphs and give necessary and sufficient conditions for equality. We give several examples of classes that are optimal with respect to the bouns. We prove that BIBD-graphs are characterized by ...
Relativistic quantum correlations in bipartite fermionic states
Indian Academy of Sciences (India)
The influences of relative motion, the size of the wave packet and the average momentum of the particles on different types of correlations present in bipartite quantum states are investigated. In particular, the dynamics of the quantum mutual information, the classical correlation and the quantum discord on the ...
Relativistic quantum correlations in bipartite fermionic states
Indian Academy of Sciences (India)
2016-09-21
Sep 21, 2016 ... particles on different types of correlations present in bipartite quantum states are investigated. In particular, the ... the focus of research for the last few years. Many re- ..... figures, the qualitative behaviour of all the three types ...
Dynamic Matchings in Convex Bipartite Graphs
DEFF Research Database (Denmark)
Brodal, Gerth Stølting; Georgiadis, Loukas; Hansen, Kristoffer Arnsfelt
2007-01-01
We consider the problem of maintaining a maximum matching in a convex bipartite graph G = (V,E) under a set of update operations which includes insertions and deletions of vertices and edges. It is not hard to show that it is impossible to maintain an explicit representation of a maximum matching...
Perioperative management of facial bipartition surgery
Directory of Open Access Journals (Sweden)
Caruselli M
2015-11-01
Full Text Available Marco Caruselli,1 Michael Tsapis,1,2 Fabrice Ughetto,1 Gregoire Pech-Gourg,3 Dario Galante,4 Olivier Paut1 1Anesthesia and Intensive Care Unit, La Timone Children’s Hospital, 2Pediatric Transport Team, SAMU 13, La Timone Hospital, 3Pediatric Neurosurgery Unit, La Timone Children’s Hospital, Marseille, France; 4Anesthesia and Intensive Care Unit, University Hospital Ospedali Riuniti of Foggia, Foggia, Italy Abstract: Severe craniofacial malformations, such as Crouzon, Apert, Saethre-Chotzen, and Pfeiffer syndromes, are very rare conditions (one in 50,000/100,000 live births that often require corrective surgery. Facial bipartition is the more radical corrective surgery. It is a high-risk intervention and needs complex perioperative management and a multidisciplinary approach. Keywords: craniofacial surgery, facial bipartition surgery, craniofacial malformations, pediatric anesthesia
Harnessing VLSI System Design with EDA Tools
Kamat, Rajanish K; Gaikwad, Pawan K; Guhilot, Hansraj
2012-01-01
This book explores various dimensions of EDA technologies for achieving different goals in VLSI system design. Although the scope of EDA is very broad and comprises diversified hardware and software tools to accomplish different phases of VLSI system design, such as design, layout, simulation, testability, prototyping and implementation, this book focuses only on demystifying the code, a.k.a. firmware development and its implementation with FPGAs. Since there are a variety of languages for system design, this book covers various issues related to VHDL, Verilog and System C synergized with EDA tools, using a variety of case studies such as testability, verification and power consumption. * Covers aspects of VHDL, Verilog and Handel C in one text; * Enables designers to judge the appropriateness of each EDA tool for relevant applications; * Omits discussion of design platforms and focuses on design case studies; * Uses design case studies from diversified application domains such as network on chip, hospital on...
VLSI 'smart' I/O module development
Kirk, Dan
The developmental history, design, and operation of the MIL-STD-1553A/B discrete and serial module (DSM) for the U.S. Navy AN/AYK-14(V) avionics computer are described and illustrated with diagrams. The ongoing preplanned product improvement for the AN/AYK-14(V) includes five dual-redundant MIL-STD-1553 channels based on DSMs. The DSM is a front-end processor for transferring data to and from a common memory, sharing memory with a host processor to provide improved 'smart' input/output performance. Each DSM comprises three hardware sections: three VLSI-6000 semicustomized CMOS arrays, memory units to support the arrays, and buffers and resynchronization circuits. The DSM hardware module design, VLSI-6000 design tools, controlware and test software, and checkout procedures (using a hardware simulator) are characterized in detail.
Parallel computation of nondeterministic algorithms in VLSI
Energy Technology Data Exchange (ETDEWEB)
Hortensius, P D
1987-01-01
This work examines parallel VLSI implementations of nondeterministic algorithms. It is demonstrated that conventional pseudorandom number generators are unsuitable for highly parallel applications. Efficient parallel pseudorandom sequence generation can be accomplished using certain classes of elementary one-dimensional cellular automata. The pseudorandom numbers appear in parallel on each clock cycle. Extensive study of the properties of these new pseudorandom number generators is made using standard empirical random number tests, cycle length tests, and implementation considerations. Furthermore, it is shown these particular cellular automata can form the basis of efficient VLSI architectures for computations involved in the Monte Carlo simulation of both the percolation and Ising models from statistical mechanics. Finally, a variation on a Built-In Self-Test technique based upon cellular automata is presented. These Cellular Automata-Logic-Block-Observation (CALBO) circuits improve upon conventional design for testability circuitry.
Heavy ion tests on programmable VLSI
International Nuclear Information System (INIS)
Provost-Grellier, A.
1989-11-01
The radiation from space environment induces operation damages in onboard computers systems. The definition of a strategy, for the Very Large Scale Integrated Circuitry (VLSI) qualification and choice, is needed. The 'upset' phenomena is known to be the most critical integrated circuit radiation effect. The strategies for testing integrated circuits are reviewed. A method and a test device were developed and applied to space applications candidate circuits. Cyclotron, synchrotron and Californium source experiments were carried out [fr
Applications of VLSI circuits to medical imaging
International Nuclear Information System (INIS)
O'Donnell, M.
1988-01-01
In this paper the application of advanced VLSI circuits to medical imaging is explored. The relationship of both general purpose signal processing chips and custom devices to medical imaging is discussed using examples of fabricated chips. In addition, advanced CAD tools for silicon compilation are presented. Devices built with these tools represent a possible alternative to custom devices and general purpose signal processors for the next generation of medical imaging systems
Building versatile bipartite probes for quantum metrology
Farace, Alessandro; De Pasquale, Antonella; Adesso, Gerardo; Giovannetti, Vittorio
2016-01-01
We consider bipartite systems as versatile probes for the estimation of transformations acting locally on one of the subsystems. We investigate what resources are required for the probes to offer a guaranteed level of metrological performance, when the latter is averaged over specific sets of local transformations. We quantify such a performance via the average skew information (AvSk), a convex quantity which we compute in closed form for bipartite states of arbitrary dimensions, and which is shown to be strongly dependent on the degree of local purity of the probes. Our analysis contrasts and complements the recent series of studies focused on the minimum, rather than the average, performance of bipartite probes in local estimation tasks, which was instead determined by quantum correlations other than entanglement. We provide explicit prescriptions to characterize the most reliable states maximizing the AvSk, and elucidate the role of state purity, separability and correlations in the classification of optimal probes. Our results can help in the identification of useful resources for sensing, estimation and discrimination applications when complete knowledge of the interaction mechanism realizing the local transformation is unavailable, and access to pure entangled probes is technologically limited.
Building versatile bipartite probes for quantum metrology
International Nuclear Information System (INIS)
Farace, Alessandro; Pasquale, Antonella De; Giovannetti, Vittorio; Adesso, Gerardo
2016-01-01
We consider bipartite systems as versatile probes for the estimation of transformations acting locally on one of the subsystems. We investigate what resources are required for the probes to offer a guaranteed level of metrological performance, when the latter is averaged over specific sets of local transformations. We quantify such a performance via the average skew information (AvSk), a convex quantity which we compute in closed form for bipartite states of arbitrary dimensions, and which is shown to be strongly dependent on the degree of local purity of the probes. Our analysis contrasts and complements the recent series of studies focused on the minimum, rather than the average, performance of bipartite probes in local estimation tasks, which was instead determined by quantum correlations other than entanglement. We provide explicit prescriptions to characterize the most reliable states maximizing the AvSk, and elucidate the role of state purity, separability and correlations in the classification of optimal probes. Our results can help in the identification of useful resources for sensing, estimation and discrimination applications when complete knowledge of the interaction mechanism realizing the local transformation is unavailable, and access to pure entangled probes is technologically limited. (paper)
An evolving model of online bipartite networks
Zhang, Chu-Xu; Zhang, Zi-Ke; Liu, Chuang
2013-12-01
Understanding the structure and evolution of online bipartite networks is a significant task since they play a crucial role in various e-commerce services nowadays. Recently, various attempts have been tried to propose different models, resulting in either power-law or exponential degree distributions. However, many empirical results show that the user degree distribution actually follows a shifted power-law distribution, the so-called Mandelbrot’s law, which cannot be fully described by previous models. In this paper, we propose an evolving model, considering two different user behaviors: random and preferential attachment. Extensive empirical results on two real bipartite networks, Delicious and CiteULike, show that the theoretical model can well characterize the structure of real networks for both user and object degree distributions. In addition, we introduce a structural parameter p, to demonstrate that the hybrid user behavior leads to the shifted power-law degree distribution, and the region of power-law tail will increase with the increment of p. The proposed model might shed some lights in understanding the underlying laws governing the structure of real online bipartite networks.
Quantum trajectory approach to the geometric phase: open bipartite systems
International Nuclear Information System (INIS)
Yi, X X; Liu, D P; Wang, W
2005-01-01
Through the quantum trajectory approach, we calculate the geometric phase acquired by a bipartite system subjected to decoherence. The subsystems that compose the bipartite system interact with each other and then are entangled in the evolution. The geometric phase due to the quantum jump for both the bipartite system and its subsystems is calculated and analysed. As an example, we present two coupled spin-1/2 particles to detail the calculations
A novel community detection method in bipartite networks
Zhou, Cangqi; Feng, Liang; Zhao, Qianchuan
2018-02-01
Community structure is a common and important feature in many complex networks, including bipartite networks, which are used as a standard model for many empirical networks comprised of two types of nodes. In this paper, we propose a two-stage method for detecting community structure in bipartite networks. Firstly, we extend the widely-used Louvain algorithm to bipartite networks. The effectiveness and efficiency of the Louvain algorithm have been proved by many applications. However, there lacks a Louvain-like algorithm specially modified for bipartite networks. Based on bipartite modularity, a measure that extends unipartite modularity and that quantifies the strength of partitions in bipartite networks, we fill the gap by developing the Bi-Louvain algorithm that iteratively groups the nodes in each part by turns. This algorithm in bipartite networks often produces a balanced network structure with equal numbers of two types of nodes. Secondly, for the balanced network yielded by the first algorithm, we use an agglomerative clustering method to further cluster the network. We demonstrate that the calculation of the gain of modularity of each aggregation, and the operation of joining two communities can be compactly calculated by matrix operations for all pairs of communities simultaneously. At last, a complete hierarchical community structure is unfolded. We apply our method to two benchmark data sets and a large-scale data set from an e-commerce company, showing that it effectively identifies community structure in bipartite networks.
Three methods to distill multipartite entanglement over bipartite noisy channels
International Nuclear Information System (INIS)
Lee, Soojoon; Park, Jungjoon
2008-01-01
We first assume that there are only bipartite noisy qubit channels in a given multipartite system, and present three methods to distill the general Greenberger-Horne-Zeilinger state. By investigating the methods, we show that multipartite entanglement distillation by bipartite entanglement distillation has higher yield than ones in the previous multipartite entanglement distillations
Connectivity and Nestedness in Bipartite Networks from Community Ecology
International Nuclear Information System (INIS)
Corso, Gilberto; De Araujo, A I Levartoski; De Almeida, Adriana M
2011-01-01
Bipartite networks and the nestedness concept appear in two different contexts in theoretical ecology: community ecology and islands biogeography. From a mathematical perspective nestedness is a pattern in a bipartite network. There are several nestedness indices in the market, we used the index ν. The index ν is found using the relation ν = 1 - τ where τ is the temperature of the adjacency matrix of the bipartite network. By its turn τ is defined with help of the Manhattan distance of the occupied elements of the adjacency matrix of the bipartite network. We prove that the nestedness index ν is a function of the connectivities of the bipartite network. In addition we find a concise way to find ν which avoid cumbersome algorithm manupulation of the adjacency matrix.
Connectivity and Nestedness in Bipartite Networks from Community Ecology
Energy Technology Data Exchange (ETDEWEB)
Corso, Gilberto [Departamento de Biofisica e Farmacologia, Centro de Biociencias, Universidade Federal do Rio Grande do Norte, UFRN - Campus Universitario, Lagoa Nova, CEP 59078 972, Natal, RN (Brazil); De Araujo, A I Levartoski [Instituto Federal de Educacao, Ciencia e Tecnologia do Ceara Av. Treze de Maio, 2081 - Benfica CEP 60040-531 - Fortaleza, CE (Brazil); De Almeida, Adriana M, E-mail: corso@cb.ufrn.br [Departamento de Botanica, Ecologia e Zoologia, Centro de Biociencias, Universidade Federal do Rio Grande do Norte, UFRN - Campus Universitario, Lagoa Nova, CEP 59078 972, Natal, RN (Brazil)
2011-03-01
Bipartite networks and the nestedness concept appear in two different contexts in theoretical ecology: community ecology and islands biogeography. From a mathematical perspective nestedness is a pattern in a bipartite network. There are several nestedness indices in the market, we used the index {nu}. The index {nu} is found using the relation {nu} = 1 - {tau} where {tau} is the temperature of the adjacency matrix of the bipartite network. By its turn {tau} is defined with help of the Manhattan distance of the occupied elements of the adjacency matrix of the bipartite network. We prove that the nestedness index {nu} is a function of the connectivities of the bipartite network. In addition we find a concise way to find {nu} which avoid cumbersome algorithm manupulation of the adjacency matrix.
Clustering coefficient and community structure of bipartite networks
Zhang, Peng; Wang, Jinliang; Li, Xiaojia; Li, Menghui; Di, Zengru; Fan, Ying
2008-12-01
Many real-world networks display natural bipartite structure, where the basic cycle is a square. In this paper, with the similar consideration of standard clustering coefficient in binary networks, a definition of the clustering coefficient for bipartite networks based on the fraction of squares is proposed. In order to detect community structures in bipartite networks, two different edge clustering coefficients LC4 and LC3 of bipartite networks are defined, which are based on squares and triples respectively. With the algorithm of cutting the edge with the least clustering coefficient, communities in artificial and real world networks are identified. The results reveal that investigating bipartite networks based on the original structure can show the detailed properties that is helpful to get deep understanding about the networks.
Bipartite entanglement in continuous variable cluster states
Energy Technology Data Exchange (ETDEWEB)
Cable, Hugo; Browne, Daniel E, E-mail: cqthvc@nus.edu.s, E-mail: d.browne@ucl.ac.u [Centre for Quantum Technologies, National University of Singapore, 3 Science Drive 2, Singapore 117543 (Singapore)
2010-11-15
A study of the entanglement properties of Gaussian cluster states, proposed as a universal resource for continuous variable (CV) quantum computing is presented in this paper. The central aim is to compare mathematically idealized cluster states defined using quadrature eigenstates, which have infinite squeezing and cannot exist in nature, with Gaussian approximations that are experimentally accessible. Adopting widely used definitions, we first review the key concepts, by analysing a process of teleportation along a CV quantum wire in the language of matrix product states. Next we consider the bipartite entanglement properties of the wire, providing analytic results. We proceed to grid cluster states, which are universal for the qubit case. To extend our analysis of the bipartite entanglement, we adopt the entropic-entanglement width, a specialized entanglement measure introduced recently by Van den Nest et al (2006 Phys. Rev. Lett. 97 150504), adapting their definition to the CV context. Finally, we consider the effects of photonic loss, extending our arguments to mixed states. Cumulatively our results point to key differences in the properties of idealized and Gaussian cluster states. Even modest loss rates are found to strongly limit the amount of entanglement. We discuss the implications for the potential of CV analogues for measurement-based quantum computation.
Community detection for networks with unipartite and bipartite structure
Chang, Chang; Tang, Chao
2014-09-01
Finding community structures in networks is important in network science, technology, and applications. To date, most algorithms that aim to find community structures only focus either on unipartite or bipartite networks. A unipartite network consists of one set of nodes and a bipartite network consists of two nonoverlapping sets of nodes with only links joining the nodes in different sets. However, a third type of network exists, defined here as the mixture network. Just like a bipartite network, a mixture network also consists of two sets of nodes, but some nodes may simultaneously belong to two sets, which breaks the nonoverlapping restriction of a bipartite network. The mixture network can be considered as a general case, with unipartite and bipartite networks viewed as its limiting cases. A mixture network can represent not only all the unipartite and bipartite networks, but also a wide range of real-world networks that cannot be properly represented as either unipartite or bipartite networks in fields such as biology and social science. Based on this observation, we first propose a probabilistic model that can find modules in unipartite, bipartite, and mixture networks in a unified framework based on the link community model for a unipartite undirected network [B Ball et al (2011 Phys. Rev. E 84 036103)]. We test our algorithm on synthetic networks (both overlapping and nonoverlapping communities) and apply it to two real-world networks: a southern women bipartite network and a human transcriptional regulatory mixture network. The results suggest that our model performs well for all three types of networks, is competitive with other algorithms for unipartite or bipartite networks, and is applicable to real-world networks.
Technology computer aided design simulation for VLSI MOSFET
Sarkar, Chandan Kumar
2013-01-01
Responding to recent developments and a growing VLSI circuit manufacturing market, Technology Computer Aided Design: Simulation for VLSI MOSFET examines advanced MOSFET processes and devices through TCAD numerical simulations. The book provides a balanced summary of TCAD and MOSFET basic concepts, equations, physics, and new technologies related to TCAD and MOSFET. A firm grasp of these concepts allows for the design of better models, thus streamlining the design process, saving time and money. This book places emphasis on the importance of modeling and simulations of VLSI MOS transistors and
Wavelength-encoded OCDMA system using opto-VLSI processors.
Aljada, Muhsen; Alameh, Kamal
2007-07-01
We propose and experimentally demonstrate a 2.5 Gbits/sper user wavelength-encoded optical code-division multiple-access encoder-decoder structure based on opto-VLSI processing. Each encoder and decoder is constructed using a single 1D opto-very-large-scale-integrated (VLSI) processor in conjunction with a fiber Bragg grating (FBG) array of different Bragg wavelengths. The FBG array spectrally and temporally slices the broadband input pulse into several components and the opto-VLSI processor generates codewords using digital phase holograms. System performance is measured in terms of the autocorrelation and cross-correlation functions as well as the eye diagram.
Wavelength-encoded OCDMA system using opto-VLSI processors
Aljada, Muhsen; Alameh, Kamal
2007-07-01
We propose and experimentally demonstrate a 2.5 Gbits/sper user wavelength-encoded optical code-division multiple-access encoder-decoder structure based on opto-VLSI processing. Each encoder and decoder is constructed using a single 1D opto-very-large-scale-integrated (VLSI) processor in conjunction with a fiber Bragg grating (FBG) array of different Bragg wavelengths. The FBG array spectrally and temporally slices the broadband input pulse into several components and the opto-VLSI processor generates codewords using digital phase holograms. System performance is measured in terms of the autocorrelation and cross-correlation functions as well as the eye diagram.
Bipartite quantum states and random complex networks
International Nuclear Information System (INIS)
Garnerone, Silvano; Zanardi, Paolo; Giorda, Paolo
2012-01-01
We introduce a mapping between graphs and pure quantum bipartite states and show that the associated entanglement entropy conveys non-trivial information about the structure of the graph. Our primary goal is to investigate the family of random graphs known as complex networks. In the case of classical random graphs, we derive an analytic expression for the averaged entanglement entropy S-bar while for general complex networks we rely on numerics. For a large number of nodes n we find a scaling S-bar ∼c log n +g e where both the prefactor c and the sub-leading O(1) term g e are characteristic of the different classes of complex networks. In particular, g e encodes topological features of the graphs and is named network topological entropy. Our results suggest that quantum entanglement may provide a powerful tool for the analysis of large complex networks with non-trivial topological properties. (paper)
Detecting quantum critical points using bipartite fluctuations.
Rachel, Stephan; Laflorencie, Nicolas; Song, H Francis; Le Hur, Karyn
2012-03-16
We show that the concept of bipartite fluctuations F provides a very efficient tool to detect quantum phase transitions in strongly correlated systems. Using state-of-the-art numerical techniques complemented with analytical arguments, we investigate paradigmatic examples for both quantum spins and bosons. As compared to the von Neumann entanglement entropy, we observe that F allows us to find quantum critical points with much better accuracy in one dimension. We further demonstrate that F can be successfully applied to the detection of quantum criticality in higher dimensions with no prior knowledge of the universality class of the transition. Promising approaches to experimentally access fluctuations are discussed for quantum antiferromagnets and cold gases.
Asymptotic adaptive bipartite entanglement-distillation protocol
International Nuclear Information System (INIS)
Hostens, Erik; Dehaene, Jeroen; De Moor, Bart
2006-01-01
We present an asymptotic bipartite entanglement-distillation protocol that outperforms all existing asymptotic schemes. This protocol is based on the breeding protocol with the incorporation of two-way classical communication. Like breeding, the protocol starts with an infinite number of copies of a Bell-diagonal mixed state. Breeding can be carried out as successive stages of partial information extraction, yielding the same result: one bit of information is gained at the cost (measurement) of one pure Bell state pair (ebit). The basic principle of our protocol is at every stage to replace measurements on ebits by measurements on a finite number of copies, whenever there are two equiprobable outcomes. In that case, the entropy of the global state is reduced by more than one bit. Therefore, every such replacement results in an improvement of the protocol. We explain how our protocol is organized as to have as many replacements as possible. The yield is then calculated for Werner states
Catalytic transformations for bipartite pure states
International Nuclear Information System (INIS)
Turgut, S
2007-01-01
Entanglement catalysis is a phenomenon that usually enhances the conversion probability in the transformation of entangled states by the temporary involvement of another entangled state (so-called catalyst), where after the process is completed the catalyst is returned to the same state. For some pairs of bipartite pure entangled states, catalysis enables a transformation with unit probability of success, in which case the respective Schmidt coefficients of the states are said to satisfy the trumping relation, a mathematical relation which is an extension of the majorization relation. This paper provides all necessary and sufficient conditions for the trumping and two other associated relations. Using these conditions, the least upper bound of conversion probabilities using catalysis is also obtained. Moreover, best conversion ratios achievable with catalysis are found for transformations involving many copies of states
Memory Based Machine Intelligence Techniques in VLSI hardware
James, Alex Pappachen
2012-01-01
We briefly introduce the memory based approaches to emulate machine intelligence in VLSI hardware, describing the challenges and advantages. Implementation of artificial intelligence techniques in VLSI hardware is a practical and difficult problem. Deep architectures, hierarchical temporal memories and memory networks are some of the contemporary approaches in this area of research. The techniques attempt to emulate low level intelligence tasks and aim at providing scalable solutions to high ...
ORGANIZATION OF GRAPHIC INFORMATION FOR VIEWING THE MULTILAYER VLSI TOPOLOGY
Directory of Open Access Journals (Sweden)
V. I. Romanov
2016-01-01
Full Text Available One of the possible ways to reorganize of graphical information describing the set of topology layers of modern VLSI. The method is directed on the use in the conditions of the bounded size of video card memory. An additional effect, providing high performance of forming multi- image layout a multi-layer topology of modern VLSI, is achieved by preloading the required texture by means of auxiliary background process.
Synthesis algorithm of VLSI multipliers for ASIC
Chua, O. H.; Eldin, A. G.
1993-01-01
Multipliers are critical sub-blocks in ASIC design, especially for digital signal processing and communications applications. A flexible multiplier synthesis tool is developed which is capable of generating multiplier blocks for word size in the range of 4 to 256 bits. A comparison of existing multiplier algorithms is made in terms of speed, silicon area, and suitability for automated synthesis and verification of its VLSI implementation. The algorithm divides the range of supported word sizes into sub-ranges and provides each sub-range with a specific multiplier architecture for optimal speed and area. The algorithm of the synthesis tool and the multiplier architectures are presented. Circuit implementation and the automated synthesis methodology are discussed.
Multi-net optimization of VLSI interconnect
Moiseev, Konstantin; Wimer, Shmuel
2015-01-01
This book covers layout design and layout migration methodologies for optimizing multi-net wire structures in advanced VLSI interconnects. Scaling-dependent models for interconnect power, interconnect delay and crosstalk noise are covered in depth, and several design optimization problems are addressed, such as minimization of interconnect power under delay constraints, or design for minimal delay in wire bundles within a given routing area. A handy reference or a guide for design methodologies and layout automation techniques, this book provides a foundation for physical design challenges of interconnect in advanced integrated circuits. • Describes the evolution of interconnect scaling and provides new techniques for layout migration and optimization, focusing on multi-net optimization; • Presents research results that provide a level of design optimization which does not exist in commercially-available design automation software tools; • Includes mathematical properties and conditions for optimal...
DPL/Daedalus design environment (for VLSI)
Energy Technology Data Exchange (ETDEWEB)
Batali, J; Mayle, N; Shrobe, H; Sussman, G; Weise, D
1981-01-01
The DPL/Daedalus design environment is an interactive VLSI design system implemented at the MIT Artificial Intelligence Laboratory. The system consists of several components: a layout language called DPL (for design procedure language); an interactive graphics facility (Daedalus); and several special purpose design procedures for constructing complex artifacts such as PLAs and microprocessor data paths. Coordinating all of these is a generalized property list data base which contains both the data representing circuits and the procedures for constructing them. The authors first review the nature of the data base and then turn to DPL and Daedalus, the two most common ways of entering information into the data base. The next two sections review the specialized procedures for constructing PLAs and data paths; the final section describes a tool for hierarchical node extraction. 5 references.
PLA realizations for VLSI state machines
Gopalakrishnan, S.; Whitaker, S.; Maki, G.; Liu, K.
1990-01-01
A major problem associated with state assignment procedures for VLSI controllers is obtaining an assignment that produces minimal or near minimal logic. The key item in Programmable Logic Array (PLA) area minimization is the number of unique product terms required by the design equations. This paper presents a state assignment algorithm for minimizing the number of product terms required to implement a finite state machine using a PLA. Partition algebra with predecessor state information is used to derive a near optimal state assignment. A maximum bound on the number of product terms required can be obtained by inspecting the predecessor state information. The state assignment algorithm presented is much simpler than existing procedures and leads to the same number of product terms or less. An area-efficient PLA structure implemented in a 1.0 micron CMOS process is presented along with a summary of the performance for a controller implemented using this design procedure.
Development methods for VLSI-processors
International Nuclear Information System (INIS)
Horninger, K.; Sandweg, G.
1982-01-01
The aim of this project, which was originally planed for 3 years, was the development of modern system and circuit concepts, for VLSI-processors having a 32 bit wide data path. The result of this first years work is the concept of a general purpose processor. This processor is not only logically but also physically (on the chip) divided into four functional units: a microprogrammable instruction unit, an execution unit in slice technique, a fully associative cache memory and an I/O unit. For the ALU of the execution unit circuits in PLA and slice techniques have been realized. On the basis of regularity, area consumption and achievable performance the slice technique has been prefered. The designs utilize selftesting circuitry. (orig.) [de
VLSI Design of Trusted Virtual Sensors
Directory of Open Access Journals (Sweden)
Macarena C. Martínez-Rodríguez
2018-01-01
Full Text Available This work presents a Very Large Scale Integration (VLSI design of trusted virtual sensors providing a minimum unitary cost and very good figures of size, speed and power consumption. The sensed variable is estimated by a virtual sensor based on a configurable and programmable PieceWise-Affine hyper-Rectangular (PWAR model. An algorithm is presented to find the best values of the programmable parameters given a set of (empirical or simulated input-output data. The VLSI design of the trusted virtual sensor uses the fast authenticated encryption algorithm, AEGIS, to ensure the integrity of the provided virtual measurement and to encrypt it, and a Physical Unclonable Function (PUF based on a Static Random Access Memory (SRAM to ensure the integrity of the sensor itself. Implementation results of a prototype designed in a 90-nm Complementary Metal Oxide Semiconductor (CMOS technology show that the active silicon area of the trusted virtual sensor is 0.86 mm 2 and its power consumption when trusted sensing at 50 MHz is 7.12 mW. The maximum operation frequency is 85 MHz, which allows response times lower than 0.25 μ s. As application example, the designed prototype was programmed to estimate the yaw rate in a vehicle, obtaining root mean square errors lower than 1.1%. Experimental results of the employed PUF show the robustness of the trusted sensing against aging and variations of the operation conditions, namely, temperature and power supply voltage (final value as well as ramp-up time.
VLSI Design of Trusted Virtual Sensors.
Martínez-Rodríguez, Macarena C; Prada-Delgado, Miguel A; Brox, Piedad; Baturone, Iluminada
2018-01-25
This work presents a Very Large Scale Integration (VLSI) design of trusted virtual sensors providing a minimum unitary cost and very good figures of size, speed and power consumption. The sensed variable is estimated by a virtual sensor based on a configurable and programmable PieceWise-Affine hyper-Rectangular (PWAR) model. An algorithm is presented to find the best values of the programmable parameters given a set of (empirical or simulated) input-output data. The VLSI design of the trusted virtual sensor uses the fast authenticated encryption algorithm, AEGIS, to ensure the integrity of the provided virtual measurement and to encrypt it, and a Physical Unclonable Function (PUF) based on a Static Random Access Memory (SRAM) to ensure the integrity of the sensor itself. Implementation results of a prototype designed in a 90-nm Complementary Metal Oxide Semiconductor (CMOS) technology show that the active silicon area of the trusted virtual sensor is 0.86 mm 2 and its power consumption when trusted sensing at 50 MHz is 7.12 mW. The maximum operation frequency is 85 MHz, which allows response times lower than 0.25 μ s. As application example, the designed prototype was programmed to estimate the yaw rate in a vehicle, obtaining root mean square errors lower than 1.1%. Experimental results of the employed PUF show the robustness of the trusted sensing against aging and variations of the operation conditions, namely, temperature and power supply voltage (final value as well as ramp-up time).
Asymmetric intimacy and algorithm for detecting communities in bipartite networks
Wang, Xingyuan; Qin, Xiaomeng
2016-11-01
In this paper, an algorithm to choose a good partition in bipartite networks has been proposed. Bipartite networks have more theoretical significance and broader prospect of application. In view of distinctive structure of bipartite networks, in our method, two parameters are defined to show the relationships between the same type nodes and heterogeneous nodes respectively. Moreover, our algorithm employs a new method of finding and expanding the core communities in bipartite networks. Two kinds of nodes are handled separately and merged, and then the sub-communities are obtained. After that, objective communities will be found according to the merging rule. The proposed algorithm has been simulated in real-world networks and artificial networks, and the result verifies the accuracy and reliability of the parameters on intimacy for our algorithm. Eventually, comparisons with similar algorithms depict that the proposed algorithm has better performance.
Spike Neuromorphic VLSI-Based Bat Echolocation for Micro-Aerial Vehicle Guidance
National Research Council Canada - National Science Library
Horiuchi, Timothy K; Krishnaprasad, P. S
2007-01-01
.... This includes multiple efforts related to a VLSI-based echolocation system being developed in one of our laboratories from algorithm development, bat flight data analysis, to VLSI circuit design...
A general evolving model for growing bipartite networks
International Nuclear Information System (INIS)
Tian, Lixin; He, Yinghuan; Liu, Haijun; Du, Ruijin
2012-01-01
In this Letter, we propose and study an inner evolving bipartite network model. Significantly, we prove that the degree distribution of two different kinds of nodes both obey power-law form with adjustable exponents. Furthermore, the joint degree distribution of any two nodes for bipartite networks model is calculated analytically by the mean-field method. The result displays that such bipartite networks are nearly uncorrelated networks, which is different from one-mode networks. Numerical simulations and empirical results are given to verify the theoretical results. -- Highlights: ► We proposed a general evolving bipartite network model which was based on priority connection, reconnection and breaking edges. ► We prove that the degree distribution of two different kinds of nodes both obey power-law form with adjustable exponents. ► The joint degree distribution of any two nodes for bipartite networks model is calculated analytically by the mean-field method. ► The result displays that such bipartite networks are nearly uncorrelated networks, which is different from one-mode networks.
Effect of Bipartite Hallucal Sesamoid on Hallux Valgus Surgery.
Park, Young Hwan; Jeong, Chan Dong; Choi, Gi Won; Kim, Hak Jun
2017-06-01
Bipartite hallucal sesamoids are often found in patients with hallux valgus. However, it is unknown whether bipartite hallucal sesamoids affect the results of hallux valgus surgery or not. The purpose of the present study was to evaluate the outcomes of chevron osteotomy for hallux valgus with and without bipartite hallucal sesamoid. A total of 152 patients (168 feet) treated with distal or proximal chevron osteotomy for hallux valgus constituted the study cohort. The 168 feet were divided into 2 groups: bipartite hallucal sesamoid (31 feet) and without bipartite hallucal sesamoid (137 feet). Hallux valgus angle (HVA), intermetatarsal angle (IMA), distal metatarsal articular angle (DMAA), tibial sesamoid position, and first metatarsal length were measured for radiographic outcomes and the American Orthopaedic Foot & Ankle Society (AOFAS) hallux metatarsophalangeal-interphalangeal (MTP-IP) score was measured for clinical outcomes. All radiographic measurements and the AOFAS score showed significant ( P .05) were found between the 2 groups in terms of HVA, IMA, DMAA, tibial sesamoid position, metatarsal shortening, and AOFAS score on final follow-up. This study suggests that bipartite hallucal sesamoids do not affect the results of hallux valgus surgery. Level III, retrospective comparative study.
Bipartite Community Structure of eQTLs.
Platig, John; Castaldi, Peter J; DeMeo, Dawn; Quackenbush, John
2016-09-01
Genome Wide Association Studies (GWAS) and expression quantitative trait locus (eQTL) analyses have identified genetic associations with a wide range of human phenotypes. However, many of these variants have weak effects and understanding their combined effect remains a challenge. One hypothesis is that multiple SNPs interact in complex networks to influence functional processes that ultimately lead to complex phenotypes, including disease states. Here we present CONDOR, a method that represents both cis- and trans-acting SNPs and the genes with which they are associated as a bipartite graph and then uses the modular structure of that graph to place SNPs into a functional context. In applying CONDOR to eQTLs in chronic obstructive pulmonary disease (COPD), we found the global network "hub" SNPs were devoid of disease associations through GWAS. However, the network was organized into 52 communities of SNPs and genes, many of which were enriched for genes in specific functional classes. We identified local hubs within each community ("core SNPs") and these were enriched for GWAS SNPs for COPD and many other diseases. These results speak to our intuition: rather than single SNPs influencing single genes, we see groups of SNPs associated with the expression of families of functionally related genes and that disease SNPs are associated with the perturbation of those functions. These methods are not limited in their application to COPD and can be used in the analysis of a wide variety of disease processes and other phenotypic traits.
Competition for popularity in bipartite networks
Beguerisse Díaz, Mariano; Porter, Mason A.; Onnela, Jukka-Pekka
2010-12-01
We present a dynamical model for rewiring and attachment in bipartite networks. Edges are placed between nodes that belong to catalogs that can either be fixed in size or growing in size. The model is motivated by an empirical study of data from the video rental service Netflix, which invites its users to give ratings to the videos available in its catalog. We find that the distribution of the number of ratings given by users and that of the number of ratings received by videos both follow a power law with an exponential cutoff. We also examine the activity patterns of Netflix users and find bursts of intense video-rating activity followed by long periods of inactivity. We derive ordinary differential equations to model the acquisition of edges by the nodes over time and obtain the corresponding time-dependent degree distributions. We then compare our results with the Netflix data and find good agreement. We conclude with a discussion of how catalog models can be used to study systems in which agents are forced to choose, rate, or prioritize their interactions from a large set of options.
An electron undulating ring for VLSI lithography
International Nuclear Information System (INIS)
Tomimasu, T.; Mikado, T.; Noguchi, T.; Sugiyama, S.; Yamazaki, T.
1985-01-01
The development of the ETL storage ring ''TERAS'' as an undulating ring has been continued to achieve a wide area exposure of synchrotron radiation (SR) in VLSI lithography. Stable vertical and horizontal undulating motions of stored beams are demonstrated around a horizontal design orbit of TERAS, using two small steering magnets of which one is used for vertical undulating and another for horizontal one. Each steering magnet is inserted into one of the periodic configulation of guide field elements. As one of useful applications of undulaing electron beams, a vertically wide exposure of SR has been demonstrated in the SR lithography. The maximum vertical deviation from the design orbit nCcurs near the steering magnet. The maximum vertical tilt angle of the undulating beam near the nodes is about + or - 2mrad for a steering magnetic field of 50 gauss. Another proposal is for hith-intensity, uniform and wide exposure of SR from a wiggler installed in TERAS, using vertical and horizontal undulating motions of stored beams. A 1.4 m long permanent magnet wiggler has been installed for this purpose in this April
Convolving optically addressed VLSI liquid crystal SLM
Jared, David A.; Stirk, Charles W.
1994-03-01
We designed, fabricated, and tested an optically addressed spatial light modulator (SLM) that performs a 3 X 3 kernel image convolution using ferroelectric liquid crystal on VLSI technology. The chip contains a 16 X 16 array of current-mirror-based convolvers with a fixed kernel for finding edges. The pixels are located on 75 micron centers, and the modulators are 20 microns on a side. The array successfully enhanced edges in illumination patterns. We developed a high-level simulation tool (CON) for analyzing the performance of convolving SLM designs. CON has a graphical interface and simulates SLM functions using SPICE-like device models. The user specifies the pixel function along with the device parameters and nonuniformities. We discovered through analysis, simulation and experiment that the operation of current-mirror-based convolver pixels is degraded at low light levels by the variation of transistor threshold voltages inherent to CMOS chips. To function acceptable, the test SLM required the input image to have an minimum irradiance of 10 (mu) W/cm2. The minimum required irradiance can be further reduced by adding a photodarlington near the photodetector or by increasing the size of the transistors used to calculate the convolution.
Multi-valued LSI/VLSI logic design
Santrakul, K.
A procedure for synthesizing any large complex logic system, such as LSI and VLSI integrated circuits is described. This scheme uses Multi-Valued Multi-plexers (MVMUX) as the basic building blocks and the tree as the structure of the circuit realization. Simple built-in test circuits included in the network (the main current), provide a thorough functional checking of the network at any time. In brief, four major contributions are made: (1) multi-valued Algorithmic State Machine (ASM) chart for describing an LSI/VLSI behavior; (2) a tree-structured multi-valued multiplexer network which can be obtained directly from an ASM chart; (3) a heuristic tree-structured synthesis method for realizing any combinational logic with minimal or nearly-minimal MVMUX; and (4) a hierarchical design of LSI/VLSI with built-in parallel testing capability.
NASA Space Engineering Research Center for VLSI systems design
1991-01-01
This annual review reports the center's activities and findings on very large scale integration (VLSI) systems design for 1990, including project status, financial support, publications, the NASA Space Engineering Research Center (SERC) Symposium on VLSI Design, research results, and outreach programs. Processor chips completed or under development are listed. Research results summarized include a design technique to harden complementary metal oxide semiconductors (CMOS) memory circuits against single event upset (SEU); improved circuit design procedures; and advances in computer aided design (CAD), communications, computer architectures, and reliability design. Also described is a high school teacher program that exposes teachers to the fundamentals of digital logic design.
Handbook of VLSI chip design and expert systems
Schwarz, A F
1993-01-01
Handbook of VLSI Chip Design and Expert Systems provides information pertinent to the fundamental aspects of expert systems, which provides a knowledge-based approach to problem solving. This book discusses the use of expert systems in every possible subtask of VLSI chip design as well as in the interrelations between the subtasks.Organized into nine chapters, this book begins with an overview of design automation, which can be identified as Computer-Aided Design of Circuits and Systems (CADCAS). This text then presents the progress in artificial intelligence, with emphasis on expert systems.
VLSI micro- and nanophotonics science, technology, and applications
Lee, El-Hang; Razeghi, Manijeh; Jagadish, Chennupati
2011-01-01
Addressing the growing demand for larger capacity in information technology, VLSI Micro- and Nanophotonics: Science, Technology, and Applications explores issues of science and technology of micro/nano-scale photonics and integration for broad-scale and chip-scale Very Large Scale Integration photonics. This book is a game-changer in the sense that it is quite possibly the first to focus on ""VLSI Photonics"". Very little effort has been made to develop integration technologies for micro/nanoscale photonic devices and applications, so this reference is an important and necessary early-stage pe
A Partial Order on Bipartite Graphs with n Vertices
Directory of Open Access Journals (Sweden)
Emil Daniel Schwab
2009-01-01
Full Text Available The paper examines a partial order on bipartite graphs (X1, X2, E with n vertices, X1∪X2={1,2,…,n}. The basis of such bipartite graph is X1 = {1,2,…,k}, 0≤k≤n. If U = (X1, X2, E(U and V = (Y1,Y2, E(V then U≤V iff |X1| ≤ |Y1| and {(i,jE(U: j>|Y1|} = ={(i,jE(V:i≤|X1|}. This partial order is a natural partial order of subobjects of an object in a triangular category with bipartite graphs as morphisms.
Two classes of bipartite networks: nested biological and social systems.
Burgos, Enrique; Ceva, Horacio; Hernández, Laura; Perazzo, R P J; Devoto, Mariano; Medan, Diego
2008-10-01
Bipartite graphs have received some attention in the study of social networks and of biological mutualistic systems. A generalization of a previous model is presented, that evolves the topology of the graph in order to optimally account for a given contact preference rule between the two guilds of the network. As a result, social and biological graphs are classified as belonging to two clearly different classes. Projected graphs, linking the agents of only one guild, are obtained from the original bipartite graph. The corresponding evolution of its statistical properties is also studied. An example of a biological mutualistic network is analyzed in detail, and it is found that the model provides a very good fitting of all the main statistical features. The model also provides a proper qualitative description of the same features observed in social webs, suggesting the possible reasons underlying the difference in the organization of these two kinds of bipartite networks.
Localization in random bipartite graphs: Numerical and empirical study
Slanina, František
2017-05-01
We investigate adjacency matrices of bipartite graphs with a power-law degree distribution. Motivation for this study is twofold: first, vibrational states in granular matter and jammed sphere packings; second, graphs encoding social interaction, especially electronic commerce. We establish the position of the mobility edge and show that it strongly depends on the power in the degree distribution and on the ratio of the sizes of the two parts of the bipartite graph. At the jamming threshold, where the two parts have the same size, localization vanishes. We found that the multifractal spectrum is nontrivial in the delocalized phase, but still near the mobility edge. We also study an empirical bipartite graph, namely, the Amazon reviewer-item network. We found that in this specific graph the mobility edge disappears, and we draw a conclusion from this fact regarding earlier empirical studies of the Amazon network.
Bipartite Fuzzy Stochastic Differential Equations with Global Lipschitz Condition
Directory of Open Access Journals (Sweden)
Marek T. Malinowski
2016-01-01
Full Text Available We introduce and analyze a new type of fuzzy stochastic differential equations. We consider equations with drift and diffusion terms occurring at both sides of equations. Therefore we call them the bipartite fuzzy stochastic differential equations. Under the Lipschitz and boundedness conditions imposed on drifts and diffusions coefficients we prove existence of a unique solution. Then, insensitivity of the solution under small changes of data of equation is examined. Finally, we mention that all results can be repeated for solutions to bipartite set-valued stochastic differential equations.
Inseparability inequalities for higher order moments for bipartite systems
International Nuclear Information System (INIS)
Agarwal, G S; Biswas, Asoka
2005-01-01
There are several examples of bipartite entangled states of continuous variables for which the existing criteria for entanglement using the inequalities involving the second-order moments are insufficient. We derive new inequalities involving higher order correlation, for testing entanglement in non-Gaussian states. In this context, we study an example of a non-Gaussian state, which is a bipartite entangled state of the form Ψ(x a , x b ) ∝ (αx a + βx b ) e -(x a 2 +x b 2 )/2 . Our results open up an avenue to search for new inequalities to test entanglement in non-Gaussian states
High performance VLSI telemetry data systems
Chesney, J.; Speciale, N.; Horner, W.; Sabia, S.
1990-01-01
NASA's deployment of major space complexes such as Space Station Freedom (SSF) and the Earth Observing System (EOS) will demand increased functionality and performance from ground based telemetry acquisition systems well above current system capabilities. Adaptation of space telemetry data transport and processing standards such as those specified by the Consultative Committee for Space Data Systems (CCSDS) standards and those required for commercial ground distribution of telemetry data, will drive these functional and performance requirements. In addition, budget limitations will force the requirement for higher modularity, flexibility, and interchangeability at lower cost in new ground telemetry data system elements. At NASA's Goddard Space Flight Center (GSFC), the design and development of generic ground telemetry data system elements, over the last five years, has resulted in significant solutions to these problems. This solution, referred to as the functional components approach includes both hardware and software components ready for end user application. The hardware functional components consist of modern data flow architectures utilizing Application Specific Integrated Circuits (ASIC's) developed specifically to support NASA's telemetry data systems needs and designed to meet a range of data rate requirements up to 300 Mbps. Real-time operating system software components support both embedded local software intelligence, and overall system control, status, processing, and interface requirements. These components, hardware and software, form the superstructure upon which project specific elements are added to complete a telemetry ground data system installation. This paper describes the functional components approach, some specific component examples, and a project example of the evolution from VLSI component, to basic board level functional component, to integrated telemetry data system.
Artificial immune system algorithm in VLSI circuit configuration
Mansor, Mohd. Asyraf; Sathasivam, Saratha; Kasihmuddin, Mohd Shareduwan Mohd
2017-08-01
In artificial intelligence, the artificial immune system is a robust bio-inspired heuristic method, extensively used in solving many constraint optimization problems, anomaly detection, and pattern recognition. This paper discusses the implementation and performance of artificial immune system (AIS) algorithm integrated with Hopfield neural networks for VLSI circuit configuration based on 3-Satisfiability problems. Specifically, we emphasized on the clonal selection technique in our binary artificial immune system algorithm. We restrict our logic construction to 3-Satisfiability (3-SAT) clauses in order to outfit with the transistor configuration in VLSI circuit. The core impetus of this research is to find an ideal hybrid model to assist in the VLSI circuit configuration. In this paper, we compared the artificial immune system (AIS) algorithm (HNN-3SATAIS) with the brute force algorithm incorporated with Hopfield neural network (HNN-3SATBF). Microsoft Visual C++ 2013 was used as a platform for training, simulating and validating the performances of the proposed network. The results depict that the HNN-3SATAIS outperformed HNN-3SATBF in terms of circuit accuracy and CPU time. Thus, HNN-3SATAIS can be used to detect an early error in the VLSI circuit design.
An efficient interpolation filter VLSI architecture for HEVC standard
Zhou, Wei; Zhou, Xin; Lian, Xiaocong; Liu, Zhenyu; Liu, Xiaoxiang
2015-12-01
The next-generation video coding standard of High-Efficiency Video Coding (HEVC) is especially efficient for coding high-resolution video such as 8K-ultra-high-definition (UHD) video. Fractional motion estimation in HEVC presents a significant challenge in clock latency and area cost as it consumes more than 40 % of the total encoding time and thus results in high computational complexity. With aims at supporting 8K-UHD video applications, an efficient interpolation filter VLSI architecture for HEVC is proposed in this paper. Firstly, a new interpolation filter algorithm based on the 8-pixel interpolation unit is proposed in this paper. It can save 19.7 % processing time on average with acceptable coding quality degradation. Based on the proposed algorithm, an efficient interpolation filter VLSI architecture, composed of a reused data path of interpolation, an efficient memory organization, and a reconfigurable pipeline interpolation filter engine, is presented to reduce the implement hardware area and achieve high throughput. The final VLSI implementation only requires 37.2k gates in a standard 90-nm CMOS technology at an operating frequency of 240 MHz. The proposed architecture can be reused for either half-pixel interpolation or quarter-pixel interpolation, which can reduce the area cost for about 131,040 bits RAM. The processing latency of our proposed VLSI architecture can support the real-time processing of 4:2:0 format 7680 × 4320@78fps video sequences.
Numerical analysis of electromigration in thin film VLSI interconnections
Petrescu, V.; Mouthaan, A.J.; Schoenmaker, W.; Angelescu, S.; Vissarion, R.; Dima, G.; Wallinga, Hans; Profirescu, M.D.
1995-01-01
Due to the continuing downscaling of the dimensions in VLSI circuits, electromigration is becoming a serious reliability hazard. A software tool based on finite element analysis has been developed to solve the two partial differential equations of the two particle vacancy/imperfection model.
Hybrid VLSI/QCA Architecture for Computing FFTs
Fijany, Amir; Toomarian, Nikzad; Modarres, Katayoon; Spotnitz, Matthew
2003-01-01
A data-processor architecture that would incorporate elements of both conventional very-large-scale integrated (VLSI) circuitry and quantum-dot cellular automata (QCA) has been proposed to enable the highly parallel and systolic computation of fast Fourier transforms (FFTs). The proposed circuit would complement the QCA-based circuits described in several prior NASA Tech Briefs articles, namely Implementing Permutation Matrices by Use of Quantum Dots (NPO-20801), Vol. 25, No. 10 (October 2001), page 42; Compact Interconnection Networks Based on Quantum Dots (NPO-20855) Vol. 27, No. 1 (January 2003), page 32; and Bit-Serial Adder Based on Quantum Dots (NPO-20869), Vol. 27, No. 1 (January 2003), page 35. The cited prior articles described the limitations of very-large-scale integrated (VLSI) circuitry and the major potential advantage afforded by QCA. To recapitulate: In a VLSI circuit, signal paths that are required not to interact with each other must not cross in the same plane. In contrast, for reasons too complex to describe in the limited space available for this article, suitably designed and operated QCAbased signal paths that are required not to interact with each other can nevertheless be allowed to cross each other in the same plane without adverse effect. In principle, this characteristic could be exploited to design compact, coplanar, simple (relative to VLSI) QCA-based networks to implement complex, advanced interconnection schemes.
Schur complements of matrices with acyclic bipartite graphs
DEFF Research Database (Denmark)
Britz, Thomas Johann; Olesky, D.D.; van den Driessche, P.
2005-01-01
Bipartite graphs are used to describe the generalized Schur complements of real matrices having nos quare submatrix with two or more nonzero diagonals. For any matrix A with this property, including any nearly reducible matrix, the sign pattern of each generalized Schur complement is shown to be ...
Transformation of bipartite non-maximally entangled states into a ...
Indian Academy of Sciences (India)
We present two schemes for transforming bipartite non-maximally entangled states into a W state in cavity QED system, by using highly detuned interactions and the resonant interactions between two-level atoms and a single-mode cavity field. A tri-atom W state can be generated by adjusting the interaction times between ...
Transformation of bipartite non-maximally entangled states into a ...
Indian Academy of Sciences (India)
We present two schemes for transforming bipartite non-maximally entangled states into a W state in cavity QED system, by using highly detuned interactions and the resonant interactions between ... Proceedings of the International Workshop/Conference on Computational Condensed Matter Physics and Materials Science
Controlled teleportation of a 3-dimensional bipartite quantum state
International Nuclear Information System (INIS)
Cao Haijing; Chen Zhonghua; Song Heshan
2008-01-01
A controlled teleportation scheme of an unknown 3-dimensional (3D) two-particle quantum state is proposed, where a 3D Bell state and 3D GHZ state function as the quantum channel. This teleportation scheme can be directly generalized to teleport an unknown d-dimensional bipartite quantum state
A bipartite fitness model for online music streaming services
Pongnumkul, Suchit; Motohashi, Kazuyuki
2018-01-01
This paper proposes an evolution model and an analysis of the behavior of music consumers on online music streaming services. While previous studies have observed power-law degree distributions of usage in online music streaming services, the underlying behavior of users has not been well understood. Users and songs can be described using a bipartite network where an edge exists between a user node and a song node when the user has listened that song. The growth mechanism of bipartite networks has been used to understand the evolution of online bipartite networks Zhang et al. (2013). Existing bipartite models are based on a preferential attachment mechanism László Barabási and Albert (1999) in which the probability that a user listens to a song is proportional to its current popularity. This mechanism does not allow for two types of real world phenomena. First, a newly released song with high quality sometimes quickly gains popularity. Second, the popularity of songs normally decreases as time goes by. Therefore, this paper proposes a new model that is more suitable for online music services by adding fitness and aging functions to the song nodes of the bipartite network proposed by Zhang et al. (2013). Theoretical analyses are performed for the degree distribution of songs. Empirical data from an online streaming service, Last.fm, are used to confirm the degree distribution of the object nodes. Simulation results show improvements from a previous model. Finally, to illustrate the application of the proposed model, a simplified royalty cost model for online music services is used to demonstrate how the changes in the proposed parameters can affect the costs for online music streaming providers. Managerial implications are also discussed.
Pursuit, Avoidance, and Cohesion in Flight: Multi-Purpose Control Laws and Neuromorphic VLSI
2010-10-01
spatial navigation in mammals. We have designed, fabricated, and are now testing a neuromorphic VLSI chip that implements a spike-based, attractor...Control Laws and Neuromorphic VLSI 5a. CONTRACT NUMBER 070402-7705 5b. GRANT NUMBER FA9550-07-1-0446 5c. PROGRAM ELEMENT NUMBER 6. AUTHOR(S...implementations (custom Neuromorphic VLSI and robotics) we will apply important practical constraints that can lead to deeper insight into how and why efficient
Advanced symbolic analysis for VLSI systems methods and applications
Shi, Guoyong; Tlelo Cuautle, Esteban
2014-01-01
This book provides comprehensive coverage of the recent advances in symbolic analysis techniques for design automation of nanometer VLSI systems. The presentation is organized in parts of fundamentals, basic implementation methods and applications for VLSI design. Topics emphasized include statistical timing and crosstalk analysis, statistical and parallel analysis, performance bound analysis and behavioral modeling for analog integrated circuits . Among the recent advances, the Binary Decision Diagram (BDD) based approaches are studied in depth. The BDD-based hierarchical symbolic analysis approaches, have essentially broken the analog circuit size barrier. In particular, this book • Provides an overview of classical symbolic analysis methods and a comprehensive presentation on the modern BDD-based symbolic analysis techniques; • Describes detailed implementation strategies for BDD-based algorithms, including the principles of zero-suppression, variable ordering and canonical reduction; • Int...
Trace-based post-silicon validation for VLSI circuits
Liu, Xiao
2014-01-01
This book first provides a comprehensive coverage of state-of-the-art validation solutions based on real-time signal tracing to guarantee the correctness of VLSI circuits. The authors discuss several key challenges in post-silicon validation and provide automated solutions that are systematic and cost-effective. A series of automatic tracing solutions and innovative design for debug (DfD) techniques are described, including techniques for trace signal selection for enhancing visibility of functional errors, a multiplexed signal tracing strategy for improving functional error detection, a tracing solution for debugging electrical errors, an interconnection fabric for increasing data bandwidth and supporting multi-core debug, an interconnection fabric design and optimization technique to increase transfer flexibility and a DfD design and associated tracing solution for improving debug efficiency and expanding tracing window. The solutions presented in this book improve the validation quality of VLSI circuit...
Emerging Applications for High K Materials in VLSI Technology
Clark, Robert D.
2014-01-01
The current status of High K dielectrics in Very Large Scale Integrated circuit (VLSI) manufacturing for leading edge Dynamic Random Access Memory (DRAM) and Complementary Metal Oxide Semiconductor (CMOS) applications is summarized along with the deposition methods and general equipment types employed. Emerging applications for High K dielectrics in future CMOS are described as well for implementations in 10 nm and beyond nodes. Additional emerging applications for High K dielectrics include Resistive RAM memories, Metal-Insulator-Metal (MIM) diodes, Ferroelectric logic and memory devices, and as mask layers for patterning. Atomic Layer Deposition (ALD) is a common and proven deposition method for all of the applications discussed for use in future VLSI manufacturing. PMID:28788599
Emerging Applications for High K Materials in VLSI Technology
Directory of Open Access Journals (Sweden)
Robert D. Clark
2014-04-01
Full Text Available The current status of High K dielectrics in Very Large Scale Integrated circuit (VLSI manufacturing for leading edge Dynamic Random Access Memory (DRAM and Complementary Metal Oxide Semiconductor (CMOS applications is summarized along with the deposition methods and general equipment types employed. Emerging applications for High K dielectrics in future CMOS are described as well for implementations in 10 nm and beyond nodes. Additional emerging applications for High K dielectrics include Resistive RAM memories, Metal-Insulator-Metal (MIM diodes, Ferroelectric logic and memory devices, and as mask layers for patterning. Atomic Layer Deposition (ALD is a common and proven deposition method for all of the applications discussed for use in future VLSI manufacturing.
A VLSI image processor via pseudo-mersenne transforms
International Nuclear Information System (INIS)
Sei, W.J.; Jagadeesh, J.M.
1986-01-01
The computational burden on image processing in medical fields where a large amount of information must be processed quickly and accurately has led to consideration of special-purpose image processor chip design for some time. The very large scale integration (VLSI) resolution has made it cost-effective and feasible to consider the design of special purpose chips for medical imaging fields. This paper describes a VLSI CMOS chip suitable for parallel implementation of image processing algorithms and cyclic convolutions by using Pseudo-Mersenne Number Transform (PMNT). The main advantages of the PMNT over the Fast Fourier Transform (FFT) are: (1) no multiplications are required; (2) integer arithmetic is used. The design and development of this processor, which operates on 32-point convolution or 5 x 5 window image, are described
VLSI Design with Alliance Free CAD Tools: an Implementation Example
Directory of Open Access Journals (Sweden)
Chávez-Bracamontes Ramón
2015-07-01
Full Text Available This paper presents the methodology used for a digital integrated circuit design that implements the communication protocol known as Serial Peripheral Interface, using the Alliance CAD System. The aim of this paper is to show how the work of VLSI design can be done by graduate and undergraduate students with minimal resources and experience. The physical design was sent to be fabricated using the CMOS AMI C5 process that features 0.5 micrometer in transistor size, sponsored by the MOSIS Educational Program. Tests were made on a platform that transfers data from inertial sensor measurements to the designed SPI chip, which in turn sends the data back on a parallel bus to a common microcontroller. The results show the efficiency of the employed methodology in VLSI design, as well as the feasibility of ICs manufacturing from school projects that have insufficient or no source of funding
Embedded Processor Based Automatic Temperature Control of VLSI Chips
Directory of Open Access Journals (Sweden)
Narasimha Murthy Yayavaram
2009-01-01
Full Text Available This paper presents embedded processor based automatic temperature control of VLSI chips, using temperature sensor LM35 and ARM processor LPC2378. Due to the very high packing density, VLSI chips get heated very soon and if not cooled properly, the performance is very much affected. In the present work, the sensor which is kept very near proximity to the IC will sense the temperature and the speed of the fan arranged near to the IC is controlled based on the PWM signal generated by the ARM processor. A buzzer is also provided with the hardware, to indicate either the failure of the fan or overheating of the IC. The entire process is achieved by developing a suitable embedded C program.
Design of a VLSI Decoder for Partially Structured LDPC Codes
Directory of Open Access Journals (Sweden)
Fabrizio Vacca
2008-01-01
of their parity matrix can be partitioned into two disjoint sets, namely, the structured and the random ones. For the proposed class of codes a constructive design method is provided. To assess the value of this method the constructed codes performance are presented. From these results, a novel decoding method called split decoding is introduced. Finally, to prove the effectiveness of the proposed approach a whole VLSI decoder is designed and characterized.
The AMchip: A VLSI associative memory for track finding
International Nuclear Information System (INIS)
Morsani, F.; Galeotti, S.; Passuello, D.; Amendolia, S.R.; Ristori, L.; Turini, N.
1992-01-01
An associative memory to be used for super-fast track finding in future high energy physics experiments, has been implemented on silicon as a full-custom CMOS VLSI chip (the AMchip). The first prototype has been designed and successfully tested at INFN in Pisa. It is implemented in 1.6 μm, double metal, silicon gate CMOS technology and contains about 140 000 MOS transistors on a 1x1 cm 2 silicon chip. (orig.)
Drift chamber tracking with a VLSI neural network
International Nuclear Information System (INIS)
Lindsey, C.S.; Denby, B.; Haggerty, H.; Johns, K.
1992-10-01
We have tested a commercial analog VLSI neural network chip for finding in real time the intercept and slope of charged particles traversing a drift chamber. Voltages proportional to the drift times were input to the Intel ETANN chip and the outputs were recorded and later compared off line to conventional track fits. We will discuss the chamber and test setup, the chip specifications, and results of recent tests. We'll briefly discuss possible applications in high energy physics detector triggers
Using Software Technology to Specify Abstract Interfaces in VLSI Design.
1985-01-01
with the complexity lev- els inherent in VLSI design, in that they can capitalize on their foundations in discrete mathemat- ics and the theory of...basis, rather than globally. Such a partitioning of module semantics makes the specification easier to construct and verify intelectual !y; it also...access function definitions. A standard language improves executability characteristics by capitalizing on portable, optimized system software developed
Emergent bipartiteness in a society of knights and knaves
International Nuclear Information System (INIS)
Del Genio, C I; Gross, T
2011-01-01
We propose a simple model of a social network based on the so-called knights-and-knaves puzzles. The model describes the formation of networks between two classes of agents where links are formed by agents introducing their neighbors to others of their own class. We show that if the proportion of knights and knaves is within a certain range, the network self-organizes to a perfectly bipartite state. However, if the excess of one of the two classes is greater than a threshold value, bipartiteness is not observed. We offer a detailed theoretical analysis of the behavior of the model, investigate its behavior in the thermodynamic limit and argue that it provides a simple example of a topology-driven model whose behavior is strongly reminiscent of first-order phase transitions far from equilibrium. (paper)
Controlling bi-partite entanglement in multi-qubit systems
International Nuclear Information System (INIS)
Plesch, Martin; Novotny, Jaroslav; Dzurakova, Zuzana; Buzek, VladimIr
2004-01-01
Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper, we utilize a concept of entangled graphs with weighted edges in order to analyse pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph, while the presence of bi-partite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition, we present a logic network with O(N 2 ) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits
Controlling bi-partite entanglement in multi-qubit systems
Plesch, Martin; Novotný, Jaroslav; Dzuráková, Zuzana; Buzek, Vladimír
2004-02-01
Bi-partite entanglement in multi-qubit systems cannot be shared freely. The rules of quantum mechanics impose bounds on how multi-qubit systems can be correlated. In this paper, we utilize a concept of entangled graphs with weighted edges in order to analyse pure quantum states of multi-qubit systems. Here qubits are represented by vertexes of the graph, while the presence of bi-partite entanglement is represented by an edge between corresponding vertexes. The weight of each edge is defined to be the entanglement between the two qubits connected by the edge, as measured by the concurrence. We prove that each entangled graph with entanglement bounded by a specific value of the concurrence can be represented by a pure multi-qubit state. In addition, we present a logic network with O(N2) elementary gates that can be used for preparation of the weighted entangled graphs of N qubits.
Bipartite separability and nonlocal quantum operations on graphs
Dutta, Supriyo; Adhikari, Bibhas; Banerjee, Subhashish; Srikanth, R.
2016-07-01
In this paper we consider the separability problem for bipartite quantum states arising from graphs. Earlier it was proved that the degree criterion is the graph-theoretic counterpart of the familiar positive partial transpose criterion for separability, although there are entangled states with positive partial transpose for which the degree criterion fails. Here we introduce the concept of partially symmetric graphs and degree symmetric graphs by using the well-known concept of partial transposition of a graph and degree criteria, respectively. Thus, we provide classes of bipartite separable states of dimension m ×n arising from partially symmetric graphs. We identify partially asymmetric graphs that lack the property of partial symmetry. We develop a combinatorial procedure to create a partially asymmetric graph from a given partially symmetric graph. We show that this combinatorial operation can act as an entanglement generator for mixed states arising from partially symmetric graphs.
Comment on "Protecting bipartite entanglement by quantum interferences"
Nair, Anjali N.; Arun, R.
2018-03-01
In an interesting article [Phys. Rev. A 81, 052341 (2010), 10.1103/PhysRevA.81.052341], Das and Agarwal have discussed the preservation of bipartite entanglement in three-level atoms employing the coherences induced by spontaneous emission. The authors considered various initially entangled qubits prepared from two V -type three-level atoms and showed that more than 50 % of the initial (bipartite) entanglement can be preserved in steady state due to vacuum-induced coherence. In this Comment, we point out that their analytical formulas for the entanglement measure contain errors affecting all the numerical results of that article. We substantiate our claim by giving correct analytical results for the time evolution of the two-atom system.
Quantumness of bipartite states in terms of conditional entropies
International Nuclear Information System (INIS)
Li, Nan; Luo, Shunlong; Zhang, Zhengmin
2007-01-01
Quantum discord, as defined by Olliver and Zurek (2002 Phys. Rev. Lett. 88 017901) as the difference of two natural quantum extensions of the classical mutual information, plays an interesting role in characterizing quantumness of correlations. Inspired by this idea, we will study quantumness of bipartite states arising from different quantum analogs of the classical conditional entropy. Our approach is intrinsic, in contrast to the Olliver-Zurek method that involves extrinsic local measurements. For this purpose, we introduce two alternative variants of quantum conditional entropies via conditional density operators, which in turn are intuitive quantum extensions of equivalent classical expressions for the conditional probability. The significance of these quantum conditional entropies in characterizing quantumness of bipartite states is illustrated through several examples
VLSI scaling methods and low power CMOS buffer circuit
International Nuclear Information System (INIS)
Sharma Vijay Kumar; Pattanaik Manisha
2013-01-01
Device scaling is an important part of the very large scale integration (VLSI) design to boost up the success path of VLSI industry, which results in denser and faster integration of the devices. As technology node moves towards the very deep submicron region, leakage current and circuit reliability become the key issues. Both are increasing with the new technology generation and affecting the performance of the overall logic circuit. The VLSI designers must keep the balance in power dissipation and the circuit's performance with scaling of the devices. In this paper, different scaling methods are studied first. These scaling methods are used to identify the effects of those scaling methods on the power dissipation and propagation delay of the CMOS buffer circuit. For mitigating the power dissipation in scaled devices, we have proposed a reliable leakage reduction low power transmission gate (LPTG) approach and tested it on complementary metal oxide semiconductor (CMOS) buffer circuit. All simulation results are taken on HSPICE tool with Berkeley predictive technology model (BPTM) BSIM4 bulk CMOS files. The LPTG CMOS buffer reduces 95.16% power dissipation with 84.20% improvement in figure of merit at 32 nm technology node. Various process, voltage and temperature variations are analyzed for proving the robustness of the proposed approach. Leakage current uncertainty decreases from 0.91 to 0.43 in the CMOS buffer circuit that causes large circuit reliability. (semiconductor integrated circuits)
Complexity of Products of Some Complete and Complete Bipartite Graphs
Directory of Open Access Journals (Sweden)
S. N. Daoud
2013-01-01
Full Text Available The number of spanning trees in graphs (networks is an important invariant; it is also an important measure of reliability of a network. In this paper, we derive simple formulas of the complexity, number of spanning trees, of products of some complete and complete bipartite graphs such as cartesian product, normal product, composition product, tensor product, and symmetric product, using linear algebra and matrix analysis techniques.
One-sided interval edge-colorings of bipartite graphs
DEFF Research Database (Denmark)
Casselgren, Carl Johan; Toft, Bjarne
2016-01-01
Let G be a bipartite graph with parts X and Y . An X-interval coloring of G is a proper edge coloring of G by integers such that the colors on the edges incident to any vertex in X form an interval. Denote by χ′int(G,X) the minimum k such that G has an X-interval coloring with k colors. In this p...
Introduction into bi-partite networks in python
Kasberger, Stefan
2016-01-01
This essay and the related computation delivers a comprehensive introduction into the concept of bipartite networks, a class of networks whose nodes are divided into two sets and only the connection between two nodes in different sets is allowed (Easley and Kleinberg, 2010). The analysis and visualization is done in the programming language Python and offers easy to understand first steps in both fields, network analyses and python programming. As data a collaboration network of github users ...
Correlation/Communication complexity of generating bipartite states
Jain, Rahul; Shi, Yaoyun; Wei, Zhaohui; Zhang, Shengyu
2012-01-01
We study the correlation complexity (or equivalently, the communication complexity) of generating a bipartite quantum state $\\rho$. When $\\rho$ is a pure state, we completely characterize the complexity for approximately generating $\\rho$ by a corresponding approximate rank, closing a gap left in Ambainis, Schulman, Ta-Shma, Vazirani and Wigderson (SIAM Journal on Computing, 32(6):1570-1585, 2003). When $\\rho$ is a classical distribution $P(x,y)$, we tightly characterize the complexity of gen...
Tripartite to Bipartite Entanglement Transformations and Polynomial Identity Testing
Chitambar, Eric; Duan, Runyao; Shi, Yaoyun
2009-01-01
We consider the problem of deciding if a given three-party entangled pure state can be converted, with a non-zero success probability, into a given two-party pure state through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to the question of tripartite to bipartit...
Disentangling bipartite and core-periphery structure in financial networks
International Nuclear Information System (INIS)
Barucca, Paolo; Lillo, Fabrizio
2016-01-01
A growing number of systems are represented as networks whose architecture conveys significant information and determines many of their properties. Examples of network architecture include modular, bipartite, and core-periphery structures. However inferring the network structure is a non trivial task and can depend sometimes on the chosen null model. Here we propose a method for classifying network structures and ranking its nodes in a statistically well-grounded fashion. The method is based on the use of Belief Propagation for learning through Entropy Maximization on both the Stochastic Block Model (SBM) and the degree-corrected Stochastic Block Model (dcSBM). As a specific application we show how the combined use of the two ensembles—SBM and dcSBM—allows to disentangle the bipartite and the core-periphery structure in the case of the e-MID interbank network. Specifically we find that, taking into account the degree, this interbank network is better described by a bipartite structure, while using the SBM the core-periphery structure emerges only when data are aggregated for more than a week.
Grand canonical validation of the bipartite international trade network
Straka, Mika J.; Caldarelli, Guido; Saracco, Fabio
2017-08-01
Devising strategies for economic development in a globally competitive landscape requires a solid and unbiased understanding of countries' technological advancements and similarities among export products. Both can be addressed through the bipartite representation of the International Trade Network. In this paper, we apply the recently proposed grand canonical projection algorithm to uncover country and product communities. Contrary to past endeavors, our methodology, based on information theory, creates monopartite projections in an unbiased and analytically tractable way. Single links between countries or products represent statistically significant signals, which are not accounted for by null models such as the bipartite configuration model. We find stable country communities reflecting the socioeconomic distinction in developed, newly industrialized, and developing countries. Furthermore, we observe product clusters based on the aforementioned country groups. Our analysis reveals the existence of a complicated structure in the bipartite International Trade Network: apart from the diversification of export baskets from the most basic to the most exclusive products, we observe a statistically significant signal of an export specialization mechanism towards more sophisticated products.
Grand canonical validation of the bipartite international trade network.
Straka, Mika J; Caldarelli, Guido; Saracco, Fabio
2017-08-01
Devising strategies for economic development in a globally competitive landscape requires a solid and unbiased understanding of countries' technological advancements and similarities among export products. Both can be addressed through the bipartite representation of the International Trade Network. In this paper, we apply the recently proposed grand canonical projection algorithm to uncover country and product communities. Contrary to past endeavors, our methodology, based on information theory, creates monopartite projections in an unbiased and analytically tractable way. Single links between countries or products represent statistically significant signals, which are not accounted for by null models such as the bipartite configuration model. We find stable country communities reflecting the socioeconomic distinction in developed, newly industrialized, and developing countries. Furthermore, we observe product clusters based on the aforementioned country groups. Our analysis reveals the existence of a complicated structure in the bipartite International Trade Network: apart from the diversification of export baskets from the most basic to the most exclusive products, we observe a statistically significant signal of an export specialization mechanism towards more sophisticated products.
Bipartite Diametrical Graphs of Diameter 4 and Extreme Orders
Directory of Open Access Journals (Sweden)
Salah Al-Addasi
2008-01-01
in which this upper bound is attained, this graph can be viewed as a generalization of the Rhombic Dodecahedron. Then we show that for any ≥2, the graph (2,2 is the unique (up to isomorphism bipartite diametrical graph of diameter 4 and partite sets of cardinalities 2 and 2, and hence in particular, for =3, the graph (6,8 which is just the Rhombic Dodecahedron is the unique (up to isomorphism bipartite diametrical graph of such a diameter and cardinalities of partite sets. Thus we complete a characterization of -graphs of diameter 4 and cardinality of the smaller partite set not exceeding 6. We prove that the neighborhoods of vertices of the larger partite set of (2,2 form a matroid whose basis graph is the hypercube . We prove that any -graph of diameter 4 is bipartite self complementary, thus in particular (2,2. Finally, we study some additional properties of (2,2 concerning the order of its automorphism group, girth, domination number, and when being Eulerian.
Induced bipartite entanglement from three qubit states and quantum teleportation
Energy Technology Data Exchange (ETDEWEB)
Park, Dae-Kil; Son, Jin-Woo; Cha, Seong-Keuck [Kyungnam University, Masan (Korea, Republic of)
2010-06-15
Only Greenberger-Horne-Zeilinger and W states are well known to have genuine tripartite entanglement in all three qubit states. The entanglement of quantum state is also well known to play an important role in various quantum information processes. Then, the following question naturally arises: which one is better between the Greenberger-Horne-Zeilinger and the W states in real quantum information processing? We try to give an answer to this question from two aspects. First, we compute the induced bipartite entanglement for a mixture consisting of Greenberger-Horne-Zeilinger and W states. If the entanglement is the only physical resource for information processing, the induced bipartite entanglement suggests that Greenberger-Horne-Zeilinger and W states are equally good. Second, we choose the bipartite teleportation scheme as an example of quantum information processing using the mixture as a quantum channel and compute the average fidelities. Our calculation shows that the W state is slightly more robust than the Greenberger-Horne-Zeilinger state when a small perturbation disturbs the teleportation process. This slight discrepancy seems to imply that entanglement is not the only resource for quantum information processing.
Induced bipartite entanglement from three qubit states and quantum teleportation
International Nuclear Information System (INIS)
Park, Dae-Kil; Son, Jin-Woo; Cha, Seong-Keuck
2010-01-01
Only Greenberger-Horne-Zeilinger and W states are well known to have genuine tripartite entanglement in all three qubit states. The entanglement of quantum state is also well known to play an important role in various quantum information processes. Then, the following question naturally arises: which one is better between the Greenberger-Horne-Zeilinger and the W states in real quantum information processing? We try to give an answer to this question from two aspects. First, we compute the induced bipartite entanglement for a mixture consisting of Greenberger-Horne-Zeilinger and W states. If the entanglement is the only physical resource for information processing, the induced bipartite entanglement suggests that Greenberger-Horne-Zeilinger and W states are equally good. Second, we choose the bipartite teleportation scheme as an example of quantum information processing using the mixture as a quantum channel and compute the average fidelities. Our calculation shows that the W state is slightly more robust than the Greenberger-Horne-Zeilinger state when a small perturbation disturbs the teleportation process. This slight discrepancy seems to imply that entanglement is not the only resource for quantum information processing.
vPELS: An E-Learning Social Environment for VLSI Design with Content Security Using DRM
Dewan, Jahangir; Chowdhury, Morshed; Batten, Lynn
2014-01-01
This article provides a proposal for personal e-learning system (vPELS [where "v" stands for VLSI: very large scale integrated circuit])) architecture in the context of social network environment for VLSI Design. The main objective of vPELS is to develop individual skills on a specific subject--say, VLSI--and share resources with peers.…
Las Vegas is better than determinism in VLSI and distributed computing
DEFF Research Database (Denmark)
Mehlhorn, Kurt; Schmidt, Erik Meineche
1982-01-01
In this paper we describe a new method for proving lower bounds on the complexity of VLSI - computations and more generally distributed computations. Lipton and Sedgewick observed that the crossing sequence arguments used to prove lower bounds in VLSI (or TM or distributed computing) apply to (ac...
Discord as a quantum resource for bi-partite communication
International Nuclear Information System (INIS)
Chrzanowski, Helen M.; Assad, Syed M.; Symul, Thomas; Lam, Ping Koy; Gu, Mile; Modi, Kavan; Vedral, Vlatko; Ralph, Timothy C.
2014-01-01
Coherent interactions that generate negligible entanglement can still exhibit unique quantum behaviour. This observation has motivated a search beyond entanglement for a complete description of all quantum correlations. Quantum discord is a promising candidate. Here, we experimentally demonstrate that under certain measurement constraints, discord between bipartite systems can be consumed to encode information that can only be accessed by coherent quantum interactions. The inability to access this information by any other means allows us to use discord to directly quantify this ‘quantum advantage’
Multipartite-to-bipartite entanglement transformations and polynomial identity testing
International Nuclear Information System (INIS)
Chitambar, Eric; Duan Runyao; Shi Yaoyun
2010-01-01
We consider the problem of deciding if some multiparty entangled pure state can be converted, with a nonzero success probability, into a given bipartite pure state shared between two specified parties through local quantum operations and classical communication. We show that this question is equivalent to the well-known computational problem of deciding if a multivariate polynomial is identically zero. Efficient randomized algorithms developed to study the latter can thus be applied to our question. As a result, a given transformation is possible if and only if it is generically attainable by a simple randomized protocol.
Point DCT VLSI Architecture for Emerging HEVC Standard
Ahmed, Ashfaq; Shahid, Muhammad Usman; Rehman, Ata ur
2012-01-01
This work presents a flexible VLSI architecture to compute the -point DCT. Since HEVC supports different block sizes for the computation of the DCT, that is, 4 × 4 up to 3 2 × 3 2 , the design of a flexible architecture to support them helps reducing the area overhead of hardware implementations. The hardware proposed in this work is partially folded to save area and to get speed for large video sequences sizes. The proposed architecture relies on the decomposition of the DCT matrices into ...
VLSI architectures for modern error-correcting codes
Zhang, Xinmiao
2015-01-01
Error-correcting codes are ubiquitous. They are adopted in almost every modern digital communication and storage system, such as wireless communications, optical communications, Flash memories, computer hard drives, sensor networks, and deep-space probing. New-generation and emerging applications demand codes with better error-correcting capability. On the other hand, the design and implementation of those high-gain error-correcting codes pose many challenges. They usually involve complex mathematical computations, and mapping them directly to hardware often leads to very high complexity. VLSI
Power efficient and high performance VLSI architecture for AES algorithm
Directory of Open Access Journals (Sweden)
K. Kalaiselvi
2015-09-01
Full Text Available Advanced encryption standard (AES algorithm has been widely deployed in cryptographic applications. This work proposes a low power and high throughput implementation of AES algorithm using key expansion approach. We minimize the power consumption and critical path delay using the proposed high performance architecture. It supports both encryption and decryption using 256-bit keys with a throughput of 0.06 Gbps. The VHDL language is utilized for simulating the design and an FPGA chip has been used for the hardware implementations. Experimental results reveal that the proposed AES architectures offer superior performance than the existing VLSI architectures in terms of power, throughput and critical path delay.
Formal verification an essential toolkit for modern VLSI design
Seligman, Erik; Kumar, M V Achutha Kiran
2015-01-01
Formal Verification: An Essential Toolkit for Modern VLSI Design presents practical approaches for design and validation, with hands-on advice for working engineers integrating these techniques into their work. Building on a basic knowledge of System Verilog, this book demystifies FV and presents the practical applications that are bringing it into mainstream design and validation processes at Intel and other companies. The text prepares readers to effectively introduce FV in their organization and deploy FV techniques to increase design and validation productivity. Presents formal verific
Additional Quantum Properties of Entangled Bipartite Qubit Systems Coupled to Photon Baths
International Nuclear Information System (INIS)
Quintana, C
2016-01-01
The time evolution of an entangled bi-partite qubit interacting with two independent photon baths in isolated cavities is not unitary. It is shown that the bi-partite qubit oscillates between pure and mixed states, and that the initial entanglement is lost and recovered in time by time as a consequence of its interaction with the baths. (paper)
Traumatic separation of a type I patella bipartite in a sportsman
DEFF Research Database (Denmark)
Ottesen, Casper Smedegaard; Barfod, Kristoffer Weisskirchner; Holck, Kim
2014-01-01
fibrocartilage was found on both parts of the patella. Asymptomatic patella bi-partite was found on X-ray imaging of the patient's left knee, and he was diagnosed to have traumatic separation of a type I patella bipartite. The diagnosis was confirmed by surgical and radiological findings....
Mutually Unbiased Maximally Entangled Bases for the Bipartite System Cd⊗ C^{dk}
Nan, Hua; Tao, Yuan-Hong; Wang, Tian-Jiao; Zhang, Jun
2016-10-01
The construction of maximally entangled bases for the bipartite system Cd⊗ Cd is discussed firstly, and some mutually unbiased bases with maximally entangled bases are given, where 2≤ d≤5. Moreover, we study a systematic way of constructing mutually unbiased maximally entangled bases for the bipartite system Cd⊗ C^{dk}.
Functional analysis of bipartite begomovirus coat protein promoter sequences
International Nuclear Information System (INIS)
Lacatus, Gabriela; Sunter, Garry
2008-01-01
We demonstrate that the AL2 gene of Cabbage leaf curl virus (CaLCuV) activates the CP promoter in mesophyll and acts to derepress the promoter in vascular tissue, similar to that observed for Tomato golden mosaic virus (TGMV). Binding studies indicate that sequences mediating repression and activation of the TGMV and CaLCuV CP promoter specifically bind different nuclear factors common to Nicotiana benthamiana, spinach and tomato. However, chromatin immunoprecipitation demonstrates that TGMV AL2 can interact with both sequences independently. Binding of nuclear protein(s) from different crop species to viral sequences conserved in both bipartite and monopartite begomoviruses, including TGMV, CaLCuV, Pepper golden mosaic virus and Tomato yellow leaf curl virus suggests that bipartite begomoviruses bind common host factors to regulate the CP promoter. This is consistent with a model in which AL2 interacts with different components of the cellular transcription machinery that bind viral sequences important for repression and activation of begomovirus CP promoters
Faster Double-Size Bipartite Multiplication out of Montgomery Multipliers
Yoshino, Masayuki; Okeya, Katsuyuki; Vuillaume, Camille
This paper proposes novel algorithms for computing double-size modular multiplications with few modulus-dependent precomputations. Low-end devices such as smartcards are usually equipped with hardware Montgomery multipliers. However, due to progresses of mathematical attacks, security institutions such as NIST have steadily demanded longer bit-lengths for public-key cryptography, making the multipliers quickly obsolete. In an attempt to extend the lifespan of such multipliers, double-size techniques compute modular multiplications with twice the bit-length of the multipliers. Techniques are known for extending the bit-length of classical Euclidean multipliers, of Montgomery multipliers and the combination thereof, namely bipartite multipliers. However, unlike classical and bipartite multiplications, Montgomery multiplications involve modulus-dependent precomputations, which amount to a large part of an RSA encryption or signature verification. The proposed double-size technique simulates double-size multiplications based on single-size Montgomery multipliers, and yet precomputations are essentially free: in an 2048-bit RSA encryption or signature verification with public exponent e=216+1, the proposal with a 1024-bit Montgomery multiplier is at least 1.5 times faster than previous double-size Montgomery multiplications.
Bipartite fidelity and Loschmidt echo of the bosonic conformal interface
Zhou, Tianci; Lin, Mao
2017-12-01
We study the quantum quench problem for a class of bosonic conformal interfaces by computing the Loschmidt echo and the bipartite fidelity. The quench can be viewed as a sudden change of boundary conditions parametrized by θ when connecting two one-dimensional critical systems. They are classified by S (θ ) matrices associated with the current scattering processes on the interface. The resulting Loschmidt echo of the quench has long time algebraic decay t-α, whose exponent also appears in the finite size bipartite fidelity as L-α/2. We perform analytic and numerical calculations of the exponent α , and find that it has a quadratic dependence on the change of θ if the prior and post-quench boundary conditions are of the same type of S , while remaining 1/4 otherwise. Possible physical realizations of these interfaces include, for instance, connecting different quantum wires (Luttinger liquids), quench of the topological phase edge states, etc., and the exponent can be detected in an x-ray edge singularity-type experiment.
Uncovering collective listening habits and music genres in bipartite networks
Lambiotte, R.; Ausloos, M.
2005-12-01
In this paper, we analyze web-downloaded data on people sharing their music library, that we use as their individual musical signatures. The system is represented by a bipartite network, nodes being the music groups and the listeners. Music groups’ audience size behaves like a power law, but the individual music library size is an exponential with deviations at small values. In order to extract structures from the network, we focus on correlation matrices, that we filter by removing the least correlated links. This percolation idea-based method reveals the emergence of social communities and music genres, that are visualized by a branching representation. Evidence of collective listening habits that do not fit the neat usual genres defined by the music industry indicates an alternative way of classifying listeners and music groups. The structure of the network is also studied by a more refined method, based upon a random walk exploration of its properties. Finally, a personal identification-community imitation model for growing bipartite networks is outlined, following Potts ingredients. Simulation results do reproduce quite well the empirical data.
Upper bounds on entangling rates of bipartite Hamiltonians
International Nuclear Information System (INIS)
Bravyi, Sergey
2007-01-01
We discuss upper bounds on the rate at which unitary evolution governed by a nonlocal Hamiltonian can generate entanglement in a bipartite system. Given a bipartite Hamiltonian H coupling two finite dimensional particles A and B, the entangling rate is shown to be upper bounded by c log(d) parallel H parallel, where d is the smallest dimension of the interacting particles parallel H parallel is the operator norm of H, and c is a constant close to 1. Under certain restrictions on the initial state we prove an analogous upper bound for the ancilla-assisted entangling rate with a constant c that does not depend upon dimensions of local ancillas. The restriction is that the initial state has at most two distinct Schmidt coefficients (each coefficient may have arbitrarily large multiplicity). Our proof is based on analysis of a mixing rate - a functional measuring how fast entropy can be produced if one mixes a time-independent state with a state evolving unitarily
Opto-VLSI-based reconfigurable free-space optical interconnects architecture
DEFF Research Database (Denmark)
Aljada, Muhsen; Alameh, Kamal; Chung, Il-Sug
2007-01-01
is the Opto-VLSI processor which can be driven by digital phase steering and multicasting holograms that reconfigure the optical interconnects between the input and output ports. The optical interconnects architecture is experimentally demonstrated at 2.5 Gbps using high-speed 1×3 VCSEL array and 1......×3 photoreceiver array in conjunction with two 1×4096 pixel Opto-VLSI processors. The minimisation of the crosstalk between the output ports is achieved by appropriately aligning the VCSEL and PD elements with respect to the Opto-VLSI processors and driving the latter with optimal steering phase holograms....
VLSI architecture and design for the Fermat Number Transform implementation
Energy Technology Data Exchange (ETDEWEB)
Pajayakrit, A.
1987-01-01
A new technique of sectioning a pipelined transformer, using the Fermat Number Transform (FNT), is introduced. Also, a novel VLSI design which overcomes the problems of implementing FNTs, for use in fast convolution/correlation, is described. The design comprises one complete section of a pipelined transformer and may be programmed to function at any point in a forward or inverse pipeline, so allowing the construction of a pipelined convolver or correlator using identical chips, thus the favorable properties of the transform can be exploited. This overcomes the difficulty of fitting a complete pipeline onto one chip without resorting to the use of several different designs. The implementation of high-speed convolver/correlator using the VLSI chips has been successfully developed and tested. For impulse response lengths of up to 16 points the sampling rates of 0.5 MHz can be achieved. Finally, the filter speed performance using the FNT chips is compared to other designs and conclusions drawn on the merits of the FNT for this application. Also, the advantages and limitations of the FNT are analyzed, with respect to the more conventional FFT, and the results are provided.
Assimilation of Biophysical Neuronal Dynamics in Neuromorphic VLSI.
Wang, Jun; Breen, Daniel; Akinin, Abraham; Broccard, Frederic; Abarbanel, Henry D I; Cauwenberghs, Gert
2017-12-01
Representing the biophysics of neuronal dynamics and behavior offers a principled analysis-by-synthesis approach toward understanding mechanisms of nervous system functions. We report on a set of procedures assimilating and emulating neurobiological data on a neuromorphic very large scale integrated (VLSI) circuit. The analog VLSI chip, NeuroDyn, features 384 digitally programmable parameters specifying for 4 generalized Hodgkin-Huxley neurons coupled through 12 conductance-based chemical synapses. The parameters also describe reversal potentials, maximal conductances, and spline regressed kinetic functions for ion channel gating variables. In one set of experiments, we assimilated membrane potential recorded from one of the neurons on the chip to the model structure upon which NeuroDyn was designed using the known current input sequence. We arrived at the programmed parameters except for model errors due to analog imperfections in the chip fabrication. In a related set of experiments, we replicated songbird individual neuron dynamics on NeuroDyn by estimating and configuring parameters extracted using data assimilation from intracellular neural recordings. Faithful emulation of detailed biophysical neural dynamics will enable the use of NeuroDyn as a tool to probe electrical and molecular properties of functional neural circuits. Neuroscience applications include studying the relationship between molecular properties of neurons and the emergence of different spike patterns or different brain behaviors. Clinical applications include studying and predicting effects of neuromodulators or neurodegenerative diseases on ion channel kinetics.
Development of Radhard VLSI electronics for SSC calorimeters
International Nuclear Information System (INIS)
Dawson, J.W.; Nodulman, L.J.
1989-01-01
A new program of development of integrated electronics for liquid argon calorimeters in the SSC detector environment is being started at Argonne National Laboratory. Scientists from Brookhaven National Laboratory and Vanderbilt University together with an industrial participants are expected to collaborate in this work. Interaction rates, segmentation, and the radiation environment dictate that front-end electronics of SSC calorimeters must be implemented in the form of highly integrated, radhard, analog, low noise, VLSI custom monolithic devices. Important considerations are power dissipation, choice of functions integrated on the front-end chips, and cabling requirements. An extensive level of expertise in radhard electronics exists within the industrial community, and a primary objective of this work is to bring that expertise to bear on the problems of SSC detector design. Radiation hardness measurements and requirements as well as calorimeter design will be primarily the responsibility of Argonne scientists and our Brookhaven and Vanderbilt colleagues. Radhard VLSI design and fabrication will be primarily the industrial participant's responsibility. The rapid-cycling synchrotron at Argonne will be used for radiation damage studies involving response to neutrons and charged particles, while damage from gammas will be investigated at Brookhaven. 10 refs., 6 figs., 2 tabs
Design of two easily-testable VLSI array multipliers
Energy Technology Data Exchange (ETDEWEB)
Ferguson, J.; Shen, J.P.
1983-01-01
Array multipliers are well-suited to VLSI implementation because of the regularity in their iterative structure. However, most VLSI circuits are very difficult to test. This paper shows that, with appropriate cell design, array multipliers can be designed to be very easily testable. An array multiplier is called c-testable if all its adder cells can be exhaustively tested while requiring only a constant number of test patterns. The testability of two well-known array multiplier structures are studied. The conventional design of the carry-save array multipler is shown to be not c-testable. However, a modified design, using a modified adder cell, is generated and shown to be c-testable and requires only 16 test patterns. Similar results are obtained for the baugh-wooley two's complement array multiplier. A modified design of the baugh-wooley array multiplier is shown to be c-testable and requires 55 test patterns. The implementation of a practical c-testable 16*16 array multiplier is also presented. 10 references.
Application of evolutionary algorithms for multi-objective optimization in VLSI and embedded systems
2015-01-01
This book describes how evolutionary algorithms (EA), including genetic algorithms (GA) and particle swarm optimization (PSO) can be utilized for solving multi-objective optimization problems in the area of embedded and VLSI system design. Many complex engineering optimization problems can be modelled as multi-objective formulations. This book provides an introduction to multi-objective optimization using meta-heuristic algorithms, GA and PSO, and how they can be applied to problems like hardware/software partitioning in embedded systems, circuit partitioning in VLSI, design of operational amplifiers in analog VLSI, design space exploration in high-level synthesis, delay fault testing in VLSI testing, and scheduling in heterogeneous distributed systems. It is shown how, in each case, the various aspects of the EA, namely its representation, and operators like crossover, mutation, etc. can be separately formulated to solve these problems. This book is intended for design engineers and researchers in the field ...
Pop, Paul; Madsen, Jan
2016-01-01
This book presents the state-of-the-art techniques for the modeling, simulation, testing, compilation and physical synthesis of mVLSI biochips. The authors describe a top-down modeling and synthesis methodology for the mVLSI biochips, inspired by microelectronics VLSI methodologies. They introduce a modeling framework for the components and the biochip architecture, and a high-level microfluidic protocol language. Coverage includes a topology graph-based model for the biochip architecture, and a sequencing graph to model for biochemical application, showing how the application model can be obtained from the protocol language. The techniques described facilitate programmability and automation, enabling developers in the emerging, large biochip market. · Presents the current models used for the research on compilation and synthesis techniques of mVLSI biochips in a tutorial fashion; · Includes a set of "benchmarks", that are presented in great detail and includes the source code of several of the techniques p...
Spike Neuromorphic VLSI-Based Bat Echolocation for Micro-Aerial Vehicle Guidance
2007-03-31
IFinal 03/01/04 - 02/28/07 4. TITLE AND SUBTITLE 5a. CONTRACT NUMBER Neuromorphic VLSI-based Bat Echolocation for Micro-aerial 5b.GRANTNUMBER Vehicle...uncovered interesting new issues in our choice for representing the intensity of signals. We have just finished testing the first chip version of an echo...timing-based algorithm (’openspace’) for sonar-guided navigation amidst multiple obstacles. 15. SUBJECT TERMS Neuromorphic VLSI, bat echolocation
VLSI Architectures for the Multiplication of Integers Modulo a Fermat Number
Chang, J. J.; Truong, T. K.; Reed, I. S.; Hsu, I. S.
1984-01-01
Multiplication is central in the implementation of Fermat number transforms and other residue number algorithms. There is need for a good multiplication algorithm that can be realized easily on a very large scale integration (VLSI) chip. The Leibowitz multiplier is modified to realize multiplication in the ring of integers modulo a Fermat number. This new algorithm requires only a sequence of cyclic shifts and additions. The designs developed for this new multiplier are regular, simple, expandable, and, therefore, suitable for VLSI implementation.
Rendezvous effects in the diffusion process on bipartite metapopulation networks.
Cao, Lang; Li, Xun; Wang, Bing; Aihara, Kazuyuki
2011-10-01
Epidemic outbreaks have been shown to be closely related to the rendezvous-induced transmission of infection, which is caused by casual contact with infected individuals in public gatherings. To investigate rendezvous effects in the spread of infectious diseases, we propose an epidemic model on metapopulation networks bipartite-divided into two sets of location and rendezvous nodes. At a given transition rate γ(kk')(p), each individual transfers from location k to rendezvous p (where rendezvous-induced disease incidence occurs) and thereafter moves to location k'. We find that the eigenstructure of a transition-rate-dependent matrix determines the epidemic threshold condition. Both analytical and numerical results show that rendezvous-induced transmission accelerates the progress of infectious diseases, implying the significance of outbreak control measures including prevention of public gatherings or decentralization of a large-scale rendezvous into downsized ones.
No-signaling, perfect bipartite dichotomic correlations and local randomness
International Nuclear Information System (INIS)
Seevinck, M. P.
2011-01-01
The no-signaling constraint on bi-partite correlations is reviewed. It is shown that in order to obtain non-trivial Bell-type inequalities that discern no-signaling correlations from more general ones, one must go beyond considering expectation values of products of observables only. A new set of nontrivial no-signaling inequalities is derived which have a remarkably close resemblance to the CHSH inequality, yet are fundamentally different. A set of inequalities by Roy and Singh and Avis et al., which is claimed to be useful for discerning no-signaling correlations, is shown to be trivially satisfied by any correlation whatsoever. Finally, using the set of newly derived no-signaling inequalities a result with potential cryptographic consequences is proven: if different parties use identical devices, then, once they have perfect correlations at spacelike separation between dichotomic observables, they know that because of no-signaling the local marginals cannot but be completely random.
Partial recovery of entanglement in bipartite-entanglement transformations
International Nuclear Information System (INIS)
Bandyopadhyay, Somshubhro; Roychowdhury, Vwani; Vatan, Farrokh
2002-01-01
Any deterministic bipartite-entanglement transformation involving finite copies of pure states and carried out using local operations and classical communication (LOCC) results in a net loss of entanglement. We show that for almost all such transformations, partial recovery of lost entanglement is achievable by using 2x2 auxiliary entangled states, no matter how large the dimensions of the parent states are. For the rest of the special cases of deterministic LOCC transformations, we show that the dimension of the auxiliary entangled state depends on the presence of equalities in the majorization relations of the parent states. We show that genuine recovery is still possible using auxiliary states in dimensions less than that of the parent states for all patterns of majorization relations except only one special case
E6 and the bipartite entanglement of three qutrits
International Nuclear Information System (INIS)
Duff, M. J.; Ferrara, S.
2007-01-01
Recent investigations have established an analogy between the entropy of four-dimensional supersymmetric black holes in string theory and entanglement in quantum information theory. Examples include: (1) N=2 STU black holes and the tripartite entanglement of three qubits (2-state systems), where the common symmetry is [SL(2)] 3 and (2) N=8 black holes and the tripartite entanglement of seven qubits where the common symmetry is E 7 superset of [SL(2)] 7 . Here we present another example: N=8 black holes (or black strings) in five dimensions and the bipartite entanglement of three qutrits (3-state systems), where the common symmetry is E 6 superset of [SL(3)] 3 . Both the black hole (or black string) entropy and the entanglement measure are provided by the Cartan cubic E 6 invariant. Similar analogies exist for magic N=2 supergravity black holes in both four and five dimensions
Epidemic spread in bipartite network by considering risk awareness
Han, She; Sun, Mei; Ampimah, Benjamin Chris; Han, Dun
2018-02-01
Human awareness plays an important role in the spread of infectious diseases and the control of propagation patterns. Exploring the interplay between human awareness and epidemic spreading is a topic that has been receiving increasing attention. Considering the fact, some well-known diseases only spread between different species we propose a theoretical analysis of the Susceptible-Infected-Susceptible (SIS) epidemic spread from the perspective of bipartite network and risk aversion. Using mean field theory, the epidemic threshold is calculated theoretically. Simulation results are consistent with the proposed analytic model. The results show that, the final infection density is negative linear with the value of individuals' risk awareness. Therefore, the epidemic spread could be effectively suppressed by improving individuals' risk awareness.
Spin-1 Dirac-Weyl fermions protected by bipartite symmetry
Energy Technology Data Exchange (ETDEWEB)
Lin, Zeren [College of Chemistry and Molecular Engineering, Peking University, Beijing 100871 (China); School of Physics, Peking University, Beijing 100871 (China); Liu, Zhirong, E-mail: LiuZhiRong@pku.edu.cn [College of Chemistry and Molecular Engineering, Peking University, Beijing 100871 (China); Center for Nanochemistry, Beijing National Laboratory for Molecular Sciences (BNLMS), Peking University, Beijing 100871 (China)
2015-12-07
We propose that bipartite symmetry allows spin-1 Dirac-Weyl points, a generalization of the spin-1/2 Dirac points in graphene, to appear as topologically protected at the Fermi level. In this spirit, we provide methodology to construct spin-1 Dirac-Weyl points of this kind in a given 2D space group and get the classification of the known spin-1 systems in the literature. We also apply the workflow to predict two new systems, P3m1-9 and P31m-15, to possess spin-1 at K/K′ in the Brillouin zone of hexagonal lattice. Their stability under various strains is investigated and compared with that of T{sub 3}, an extensively studied model of ultracold atoms trapped in optical lattice with spin-1 also at K/K′.
Quantum correlations for bipartite continuous-variable systems
Ma, Ruifen; Hou, Jinchuan; Qi, Xiaofei; Wang, Yangyang
2018-04-01
Two quantum correlations Q and Q_P for (m+n)-mode continuous-variable systems are introduced in terms of average distance between the reduced states under the local Gaussian positive operator-valued measurements, and analytical formulas of these quantum correlations for bipartite Gaussian states are provided. It is shown that the product states do not contain these quantum correlations, and conversely, all (m+n)-mode Gaussian states with zero quantum correlations are product states. Generally, Q≥ Q_{P}, but for the symmetric two-mode squeezed thermal states, these quantum correlations are the same and a computable formula is given. In addition, Q is compared with Gaussian geometric discord for symmetric squeezed thermal states.
Effect of bipartition on spectral properties of nanorings
International Nuclear Information System (INIS)
Gutiérrez, W.; García, L.F.; Mikhailov, I.D.
2013-01-01
The effects of a special topological transformation on the energy levels, far-infrared spectra and magnetization of one electron inside a semiconductor nanoring under magnetic fields are studied. We have called this transformation as bipartition, and it is defined by a change in ring topological structure, when its shape is changed successively from a single oval-shaped loop up to quasi-two disconnected loops. Our results show that in the course of such transformation the low-lying energies dependencies with multiple crossovers between them, typical for the free electron rotation along an almost circular loop, are converted into a set of non-crossing double plaits related to a sub-barrier electron tunneling along a strongly non-circular loop in a quasi-local state. Also, we find that during the restructuring of the oval-shaped nanostructures the selection rules for the dipole transitions are changed allowing the appearance of additional peaks in the FIR spectrum
Entanglement dynamics of a pure bipartite system in dissipative environments
Energy Technology Data Exchange (ETDEWEB)
Tahira, Rabia; Ikram, Manzoor; Azim, Tasnim; Suhail Zubairy, M [Centre for Quantum Physics, COMSATS Institute of Information Technology, Islamabad (Pakistan)
2008-10-28
We investigate the phenomenon of sudden death of entanglement in a bipartite system subjected to dissipative environments with arbitrary initial pure entangled state between two atoms. We find that in a vacuum reservoir the presence of the state where both atoms are in excited states is a necessary condition for the sudden death of entanglement. Otherwise entanglement remains for an infinite time and decays asymptotically with the decay of individual qubits. For pure 2-qubit entangled states in a thermal environment, we observe that the sudden death of entanglement always happens. The sudden death time of the entangled states is related to the temperature of the reservoir and the initial preparation of the entangled states.
Entanglement dynamics of a pure bipartite system in dissipative environments
International Nuclear Information System (INIS)
Tahira, Rabia; Ikram, Manzoor; Azim, Tasnim; Suhail Zubairy, M
2008-01-01
We investigate the phenomenon of sudden death of entanglement in a bipartite system subjected to dissipative environments with arbitrary initial pure entangled state between two atoms. We find that in a vacuum reservoir the presence of the state where both atoms are in excited states is a necessary condition for the sudden death of entanglement. Otherwise entanglement remains for an infinite time and decays asymptotically with the decay of individual qubits. For pure 2-qubit entangled states in a thermal environment, we observe that the sudden death of entanglement always happens. The sudden death time of the entangled states is related to the temperature of the reservoir and the initial preparation of the entangled states.
All pure bipartite entangled states can be self-tested
Coladangelo, Andrea; Goh, Koon Tong; Scarani, Valerio
2017-05-01
Quantum technologies promise advantages over their classical counterparts in the fields of computation, security and sensing. It is thus desirable that classical users are able to obtain guarantees on quantum devices, even without any knowledge of their inner workings. That such classical certification is possible at all is remarkable: it is a consequence of the violation of Bell inequalities by entangled quantum systems. Device-independent self-testing refers to the most complete such certification: it enables a classical user to uniquely identify the quantum state shared by uncharacterized devices by simply inspecting the correlations of measurement outcomes. Self-testing was first demonstrated for the singlet state and a few other examples of self-testable states were reported in recent years. Here, we address the long-standing open question of whether every pure bipartite entangled state is self-testable. We answer it affirmatively by providing explicit self-testing correlations for all such states.
VLSI and system architecture-the new development of system 5G
Energy Technology Data Exchange (ETDEWEB)
Sakamura, K.; Sekino, A.; Kodaka, T.; Uehara, T.; Aiso, H.
1982-01-01
A research and development proposal is presented for VLSI CAD systems and for a hardware environment called system 5G on which the VLSI CAD systems run. The proposed CAD systems use a hierarchically organized design language to enable design of anything from basic architectures of VLSI to VLSI mask patterns in a uniform manner. The cad systems will eventually become intelligent cad systems that acquire design knowledge and perform automatic design of VLSI chips when the characteristic requirements of VLSI chip is given. System 5G will consist of superinference machines and the 5G communication network. The superinference machine will be built based on a functionally distributed architecture connecting inferommunication network. The superinference machine will be built based on a functionally distributed architecture connecting inference machines and relational data base machines via a high-speed local network. The transfer rate of the local network will be 100 mbps at the first stage of the project and will be improved to 1 gbps. Remote access to the superinference machine will be possible through the 5G communication network. Access to system 5G will use the 5G network architecture protocol. The users will access the system 5G using standardized 5G personal computers. 5G personal logic programming stations, very high intelligent terminals providing an instruction set that supports predicate logic and input/output facilities for audio and graphical information.
De Bruyn, Alexandre; Harimalala, Mireille; Hoareau, Murielle; Ranomenjanahary, Sahondramalala; Reynaud, Bernard; Lefeuvre, Pierre; Lett, Jean-Michel
2015-06-01
Here, we describe for the first time the complete genome sequence of a new bipartite begomovirus in Madagascar isolated from the weed Asystasia gangetica (Acanthaceae), for which we propose the tentative name asystasia mosaic Madagascar virus (AMMGV). DNA-A and -B nucleotide sequences of AMMGV were only distantly related to known begomovirus sequence and shared highest nucleotide sequence identity of 72.9 % (DNA-A) and 66.9 % (DNA-B) with a recently described bipartite begomovirus infecting Asystasia sp. in West Africa. Phylogenetic analysis demonstrated that this novel virus from Madagascar belongs to a new lineage of Old World bipartite begomoviruses.
Modeling selective attention using a neuromorphic analog VLSI device.
Indiveri, G
2000-12-01
Attentional mechanisms are required to overcome the problem of flooding a limited processing capacity system with information. They are present in biological sensory systems and can be a useful engineering tool for artificial visual systems. In this article we present a hardware model of a selective attention mechanism implemented on a very large-scale integration (VLSI) chip, using analog neuromorphic circuits. The chip exploits a spike-based representation to receive, process, and transmit signals. It can be used as a transceiver module for building multichip neuromorphic vision systems. We describe the circuits that carry out the main processing stages of the selective attention mechanism and provide experimental data for each circuit. We demonstrate the expected behavior of the model at the system level by stimulating the chip with both artificially generated control signals and signals obtained from a saliency map, computed from an image containing several salient features.
Point DCT VLSI Architecture for Emerging HEVC Standard
Directory of Open Access Journals (Sweden)
Ashfaq Ahmed
2012-01-01
Full Text Available This work presents a flexible VLSI architecture to compute the -point DCT. Since HEVC supports different block sizes for the computation of the DCT, that is, 4×4 up to 32×32, the design of a flexible architecture to support them helps reducing the area overhead of hardware implementations. The hardware proposed in this work is partially folded to save area and to get speed for large video sequences sizes. The proposed architecture relies on the decomposition of the DCT matrices into sparse submatrices in order to reduce the multiplications. Finally, multiplications are completely eliminated using the lifting scheme. The proposed architecture sustains real-time processing of 1080P HD video codec running at 150 MHz.
PERFORMANCE OF LEAKAGE POWER MINIMIZATION TECHNIQUE FOR CMOS VLSI TECHNOLOGY
Directory of Open Access Journals (Sweden)
T. Tharaneeswaran
2012-06-01
Full Text Available Leakage power of CMOS VLSI Technology is a great concern. To reduce leakage power in CMOS circuits, a Leakage Power Minimiza-tion Technique (LPMT is implemented in this paper. Leakage cur-rents are monitored and compared. The Comparator kicks the charge pump to give body voltage (Vbody. Simulations of these circuits are done using TSMC 0.35µm technology with various operating temper-atures. Current steering Digital-to-Analog Converter (CSDAC is used as test core to validate the idea. The Test core (eg.8-bit CSDAC had power consumption of 347.63 mW. LPMT circuit alone consumes power of 6.3405 mW. This technique results in reduction of leakage power of 8-bit CSDAC by 5.51mW and increases the reliability of test core. Mentor Graphics ELDO and EZ-wave are used for simulations.
VLSI-based video event triggering for image data compression
Williams, Glenn L.
1994-02-01
Long-duration, on-orbit microgravity experiments require a combination of high resolution and high frame rate video data acquisition. The digitized high-rate video stream presents a difficult data storage problem. Data produced at rates of several hundred million bytes per second may require a total mission video data storage requirement exceeding one terabyte. A NASA-designed, VLSI-based, highly parallel digital state machine generates a digital trigger signal at the onset of a video event. High capacity random access memory storage coupled with newly available fuzzy logic devices permits the monitoring of a video image stream for long term (DC-like) or short term (AC-like) changes caused by spatial translation, dilation, appearance, disappearance, or color change in a video object. Pre-trigger and post-trigger storage techniques are then adaptable to archiving only the significant video images.
Carbon nanotube based VLSI interconnects analysis and design
Kaushik, Brajesh Kumar
2015-01-01
The brief primarily focuses on the performance analysis of CNT based interconnects in current research scenario. Different CNT structures are modeled on the basis of transmission line theory. Performance comparison for different CNT structures illustrates that CNTs are more promising than Cu or other materials used in global VLSI interconnects. The brief is organized into five chapters which mainly discuss: (1) an overview of current research scenario and basics of interconnects; (2) unique crystal structures and the basics of physical properties of CNTs, and the production, purification and applications of CNTs; (3) a brief technical review, the geometry and equivalent RLC parameters for different single and bundled CNT structures; (4) a comparative analysis of crosstalk and delay for different single and bundled CNT structures; and (5) various unique mixed CNT bundle structures and their equivalent electrical models.
Bayesian latent feature modeling for modeling bipartite networks with overlapping groups
DEFF Research Database (Denmark)
Jørgensen, Philip H.; Mørup, Morten; Schmidt, Mikkel Nørgaard
2016-01-01
Bi-partite networks are commonly modelled using latent class or latent feature models. Whereas the existing latent class models admit marginalization of parameters specifying the strength of interaction between groups, existing latent feature models do not admit analytical marginalization...... by the notion of community structure such that the edge density within groups is higher than between groups. Our model further assumes that entities can have different propensities of generating links in one of the modes. The proposed framework is contrasted on both synthetic and real bi-partite networks...... feature representations in bipartite networks provides a new framework for accounting for structure in bi-partite networks using binary latent feature representations providing interpretable representations that well characterize structure as quantified by link prediction....
A Family of Bipartite |Cardinality Matching Problems Solvable in O(n\\^2) Time
DEFF Research Database (Denmark)
Clausen, Jens; Krarup, J.
1995-01-01
For a given, unweighted bipartite graph G with 2n non isolated vertices, we consider the so called bipartite cardinality matching problem (BCMP) for which the time complexity of the fastest exact algorithm available is O(n/sup 5/2/ ). We devise a greedy algorithm which either finds a perfect...... matching in O(n/sup 2/ ) time or identifies cycle of length 4 in the complement G of G...
International Nuclear Information System (INIS)
Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo
2015-01-01
Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug–target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively
Daminelli, Simone; Thomas, Josephine Maria; Durán, Claudio; Vittorio Cannistraci, Carlo
2015-11-01
Bipartite networks are powerful descriptions of complex systems characterized by two different classes of nodes and connections allowed only across but not within the two classes. Unveiling physical principles, building theories and suggesting physical models to predict bipartite links such as product-consumer connections in recommendation systems or drug-target interactions in molecular networks can provide priceless information to improve e-commerce or to accelerate pharmaceutical research. The prediction of nonobserved connections starting from those already present in the topology of a network is known as the link-prediction problem. It represents an important subject both in many-body interaction theory in physics and in new algorithms for applied tools in computer science. The rationale is that the existing connectivity structure of a network can suggest where new connections can appear with higher likelihood in an evolving network, or where nonobserved connections are missing in a partially known network. Surprisingly, current complex network theory presents a theoretical bottle-neck: a general framework for local-based link prediction directly in the bipartite domain is missing. Here, we overcome this theoretical obstacle and present a formal definition of common neighbour index and local-community-paradigm (LCP) for bipartite networks. As a consequence, we are able to introduce the first node-neighbourhood-based and LCP-based models for topological link prediction that utilize the bipartite domain. We performed link prediction evaluations in several networks of different size and of disparate origin, including technological, social and biological systems. Our models significantly improve topological prediction in many bipartite networks because they exploit local physical driving-forces that participate in the formation and organization of many real-world bipartite networks. Furthermore, we present a local-based formalism that allows to intuitively
The bipartite mitochondrial genome of Ruizia karukerae (Rhigonematomorpha, Nematoda).
Kim, Taeho; Kern, Elizabeth; Park, Chungoo; Nadler, Steven A; Bae, Yeon Jae; Park, Joong-Ki
2018-05-10
Mitochondrial genes and whole mitochondrial genome sequences are widely used as molecular markers in studying population genetics and resolving both deep and shallow nodes in phylogenetics. In animals the mitochondrial genome is generally composed of a single chromosome, but mystifying exceptions sometimes occur. We determined the complete mitochondrial genome of the millipede-parasitic nematode Ruizia karukerae and found its mitochondrial genome consists of two circular chromosomes, which is highly unusual in bilateral animals. Chromosome I is 7,659 bp and includes six protein-coding genes, two rRNA genes and nine tRNA genes. Chromosome II comprises 7,647 bp, with seven protein-coding genes and 16 tRNA genes. Interestingly, both chromosomes share a 1,010 bp sequence containing duplicate copies of cox2 and three tRNA genes (trnD, trnG and trnH), and the nucleotide sequences between the duplicated homologous gene copies are nearly identical, suggesting a possible recent genesis for this bipartite mitochondrial genome. Given that little is known about the formation, maintenance or evolution of abnormal mitochondrial genome structures, R. karukerae mtDNA may provide an important early glimpse into this process.
Identifying online user reputation of user-object bipartite networks
Liu, Xiao-Lu; Liu, Jian-Guo; Yang, Kai; Guo, Qiang; Han, Jing-Ti
2017-02-01
Identifying online user reputation based on the rating information of the user-object bipartite networks is important for understanding online user collective behaviors. Based on the Bayesian analysis, we present a parameter-free algorithm for ranking online user reputation, where the user reputation is calculated based on the probability that their ratings are consistent with the main part of all user opinions. The experimental results show that the AUC values of the presented algorithm could reach 0.8929 and 0.8483 for the MovieLens and Netflix data sets, respectively, which is better than the results generated by the CR and IARR methods. Furthermore, the experimental results for different user groups indicate that the presented algorithm outperforms the iterative ranking methods in both ranking accuracy and computation complexity. Moreover, the results for the synthetic networks show that the computation complexity of the presented algorithm is a linear function of the network size, which suggests that the presented algorithm is very effective and efficient for the large scale dynamic online systems.
The Random Walk Model Based on Bipartite Network
Directory of Open Access Journals (Sweden)
Zhang Man-Dun
2016-01-01
Full Text Available With the continuing development of the electronic commerce and growth of network information, there is a growing possibility for citizens to be confused by the information. Though the traditional technology of information retrieval have the ability to relieve the overload of information in some extent, it can not offer a targeted personality service based on user’s interests and activities. In this context, the recommendation algorithm arose. In this paper, on the basis of conventional recommendation, we studied the scheme of random walk based on bipartite network and the application of it. We put forward a similarity measurement based on implicit feedback. In this method, a uneven character vector is imported(the weight of item in the system. We put forward a improved random walk pattern which make use of partial or incomplete neighbor information to create recommendation information. In the end, there is an experiment in the real data set, the recommendation accuracy and practicality are improved. We promise the reality of the result of the experiment
Conditional mutual information of bipartite unitaries and scrambling
Energy Technology Data Exchange (ETDEWEB)
Ding, Dawei; Hayden, Patrick; Walter, Michael [Stanford Institute for Theoretical Physics, Department of Physics, Stanford University,382 Via Pueblo, Stanford, CA 94305 (United States)
2016-12-28
One way to diagnose chaos in bipartite unitary channels is via the tripartite information of the corresponding Choi state, which for certain choices of the subsystems reduces to the negative conditional mutual information (CMI). We study this quantity from a quantum information-theoretic perspective to clarify its role in diagnosing scrambling. When the CMI is zero, we find that the channel has a special normal form consisting of local channels between individual inputs and outputs. However, we find that arbitrarily low CMI does not imply arbitrary proximity to a channel of this form, although it does imply a type of approximate recoverability of one of the inputs. When the CMI is maximal, we find that the residual channel from an individual input to an individual output is completely depolarizing when the other input is maximally mixed. However, we again find that this result is not robust. We also extend some of these results to the multipartite case and to the case of Haar-random pure input states. Finally, we look at the relationship between tripartite information and its Rényi-2 version which is directly related to out-of-time-order correlation functions. In particular, we demonstrate an arbitrarily large gap between the two quantities.
A High Performance VLSI Computer Architecture For Computer Graphics
Chin, Chi-Yuan; Lin, Wen-Tai
1988-10-01
A VLSI computer architecture, consisting of multiple processors, is presented in this paper to satisfy the modern computer graphics demands, e.g. high resolution, realistic animation, real-time display etc.. All processors share a global memory which are partitioned into multiple banks. Through a crossbar network, data from one memory bank can be broadcasted to many processors. Processors are physically interconnected through a hyper-crossbar network (a crossbar-like network). By programming the network, the topology of communication links among processors can be reconfigurated to satisfy specific dataflows of different applications. Each processor consists of a controller, arithmetic operators, local memory, a local crossbar network, and I/O ports to communicate with other processors, memory banks, and a system controller. Operations in each processor are characterized into two modes, i.e. object domain and space domain, to fully utilize the data-independency characteristics of graphics processing. Special graphics features such as 3D-to-2D conversion, shadow generation, texturing, and reflection, can be easily handled. With the current high density interconnection (MI) technology, it is feasible to implement a 64-processor system to achieve 2.5 billion operations per second, a performance needed in most advanced graphics applications.
Adaptive WTA with an analog VLSI neuromorphic learning chip.
Häfliger, Philipp
2007-03-01
In this paper, we demonstrate how a particular spike-based learning rule (where exact temporal relations between input and output spikes of a spiking model neuron determine the changes of the synaptic weights) can be tuned to express rate-based classical Hebbian learning behavior (where the average input and output spike rates are sufficient to describe the synaptic changes). This shift in behavior is controlled by the input statistic and by a single time constant. The learning rule has been implemented in a neuromorphic very large scale integration (VLSI) chip as part of a neurally inspired spike signal image processing system. The latter is the result of the European Union research project Convolution AER Vision Architecture for Real-Time (CAVIAR). Since it is implemented as a spike-based learning rule (which is most convenient in the overall spike-based system), even if it is tuned to show rate behavior, no explicit long-term average signals are computed on the chip. We show the rule's rate-based Hebbian learning ability in a classification task in both simulation and chip experiment, first with artificial stimuli and then with sensor input from the CAVIAR system.
Monolithic active pixel sensors (MAPS) in a VLSI CMOS technology
Turchetta, R; Manolopoulos, S; Tyndel, M; Allport, P P; Bates, R; O'Shea, V; Hall, G; Raymond, M
2003-01-01
Monolithic Active Pixel Sensors (MAPS) designed in a standard VLSI CMOS technology have recently been proposed as a compact pixel detector for the detection of high-energy charged particle in vertex/tracking applications. MAPS, also named CMOS sensors, are already extensively used in visible light applications. With respect to other competing imaging technologies, CMOS sensors have several potential advantages in terms of low cost, low power, lower noise at higher speed, random access of pixels which allows windowing of region of interest, ability to integrate several functions on the same chip. This brings altogether to the concept of 'camera-on-a-chip'. In this paper, we review the use of CMOS sensors for particle physics and we analyse their performances in term of the efficiency (fill factor), signal generation, noise, readout speed and sensor area. In most of high-energy physics applications, data reduction is needed in the sensor at an early stage of the data processing before transfer of the data to ta...
CAPCAL, 3-D Capacitance Calculator for VLSI Purposes
International Nuclear Information System (INIS)
Seidl, Albert; Klose, Helmut; Svoboda, Mildos
2004-01-01
1 - Description of program or function: CAPCAL is devoted to the calculation of capacitances of three-dimensional wiring configurations are typically used in VLSI circuits. Due to analogies in the mathematical description also conductance and heat transport problems can be treated by CAPCAL. To handle the problem using CAPCAL same approximations have to be applied to the structure under investigation: - the overall geometry has to be confined to a finite domain by using symmetry-properties of the problem - Non-rectangular structures have to be simplified into an artwork of multiple boxes. 2 - Method of solution: The electrical field is described by the Laplace-equation. The differential equation is discretized by using the finite difference method. NEA-1327/01: The linear equation system is solved by using a combined ADI-multigrid method. NEA-1327/04: The linear equation system is solved by using a conjugate gradient method for CAPCAL V1.3. NEA-1327/05: The linear equation system is solved by using a conjugate gradient method for CAPCAL V1.3. 3 - Restrictions on the complexity of the problem: NEA-1327/01: Certain restrictions of use may arise from the dimensioning of arrays. Field lengths are defined via PARAMETER-statements which can easily by modified. If the geometry of the problem is defined such that Neumann boundaries are dominating the convergence of the iterative equation system solver is affected
A second generation 50 Mbps VLSI level zero processing system prototype
Harris, Jonathan C.; Shi, Jeff; Speciale, Nick; Bennett, Toby
1994-01-01
Level Zero Processing (LZP) generally refers to telemetry data processing functions performed at ground facilities to remove all communication artifacts from instrument data. These functions typically include frame synchronization, error detection and correction, packet reassembly and sorting, playback reversal, merging, time-ordering, overlap deletion, and production of annotated data sets. The Data Systems Technologies Division (DSTD) at Goddard Space Flight Center (GSFC) has been developing high-performance Very Large Scale Integration Level Zero Processing Systems (VLSI LZPS) since 1989. The first VLSI LZPS prototype demonstrated 20 Megabits per second (Mbp's) capability in 1992. With a new generation of high-density Application-specific Integrated Circuits (ASIC) and a Mass Storage System (MSS) based on the High-performance Parallel Peripheral Interface (HiPPI), a second prototype has been built that achieves full 50 Mbp's performance. This paper describes the second generation LZPS prototype based upon VLSI technologies.
Design of a Low-Power VLSI Macrocell for Nonlinear Adaptive Video Noise Reduction
Directory of Open Access Journals (Sweden)
Sergio Saponara
2004-09-01
Full Text Available A VLSI macrocell for edge-preserving video noise reduction is proposed in the paper. It is based on a nonlinear rational filter enhanced by a noise estimator for blind and dynamic adaptation of the filtering parameters to the input signal statistics. The VLSI filter features a modular architecture allowing the extension of both mask size and filtering directions. Both spatial and spatiotemporal algorithms are supported. Simulation results with monochrome test videos prove its efficiency for many noise distributions with PSNR improvements up to 3.8 dB with respect to a nonadaptive solution. The VLSI macrocell has been realized in a 0.18 ÃŽÂ¼m CMOS technology using a standard-cells library; it allows for real-time processing of main video formats, up to 30 fps (frames per second 4CIF, with a power consumption in the order of few mW.
Synthesis of on-chip control circuits for mVLSI biochips
DEFF Research Database (Denmark)
Potluri, Seetal; Schneider, Alexander Rüdiger; Hørslev-Petersen, Martin
2017-01-01
them to laboratory environments. To address this issue, researchers have proposed methods to reduce the number of offchip pressure sources, through integration of on-chip pneumatic control logic circuits fabricated using three-layer monolithic membrane valve technology. Traditionally, mVLSI biochip......-chip control circuit design and (iii) the integration of on-chip control in the placement and routing design tasks. In this paper we present a design methodology for logic synthesis and physical synthesis of mVLSI biochips that use on-chip control. We show how the proposed methodology can be successfully...... applied to generate biochip layouts with integrated on-chip pneumatic control....
The GLUEchip: A custom VLSI chip for detectors readout and associative memories circuits
International Nuclear Information System (INIS)
Amendolia, S.R.; Galeotti, S.; Morsani, F.; Passuello, D.; Ristori, L.; Turini, N.
1993-01-01
An associative memory full-custom VLSI chip for pattern recognition has been designed and tested in the past years. It's the AMchip, that contains 128 patterns of 60 bits each. To expand the pattern capacity of an Associative Memory bank, the custom VLSI GLUEchip has been developed. The GLUEchip allows the interconnection of up to 16 AMchips or up to 16 GLUEchips: the resulting tree-like structure works like a single AMchip with an output pipelined structure and a pattern capacity increased by a factor 16 for each GLUEchip used
Digital VLSI design with Verilog a textbook from Silicon Valley Technical Institute
Williams, John
2008-01-01
This unique textbook is structured as a step-by-step course of study along the lines of a VLSI IC design project. In a nominal schedule of 12 weeks, two days and about 10 hours per week, the entire verilog language is presented, from the basics to everything necessary for synthesis of an entire 70,000 transistor, full-duplex serializer - deserializer, including synthesizable PLLs. Digital VLSI Design With Verilog is all an engineer needs for in-depth understanding of the verilog language: Syntax, synthesis semantics, simulation, and test. Complete solutions for the 27 labs are provided on the
Energy Technology Data Exchange (ETDEWEB)
Bateman, Nicholas W. [Women' s Health Integrated Research Center at Inova Health System, Gynecologic Cancer Center of Excellence, Annandale 22003, VA (United States); The John P. Murtha Cancer Center, Walter Reed National Military Medical Center, 8901 Wisconsin Avenue, Bethesda 20889, MD (United States); Shoji, Yutaka [Department of Obstetrics, Gynecology and Reproductive Biology, Michigan State University, Grand Rapids 49503, MI (United States); Conrads, Kelly A.; Stroop, Kevin D. [Women' s Health Integrated Research Center at Inova Health System, Gynecologic Cancer Center of Excellence, Annandale 22003, VA (United States); Hamilton, Chad A. [Women' s Health Integrated Research Center at Inova Health System, Gynecologic Cancer Center of Excellence, Annandale 22003, VA (United States); The John P. Murtha Cancer Center, Walter Reed National Military Medical Center, 8901 Wisconsin Avenue, Bethesda 20889, MD (United States); Gynecologic Oncology Service, Department of Obstetrics and Gynecology, Walter Reed National Military Medical Center, 8901 Wisconsin Ave, MD, Bethesda, 20889 (United States); Department of Obstetrics and Gynecology, Uniformed Services University of the Health Sciences, Bethesda 20814, MD (United States); Darcy, Kathleen M. [Women' s Health Integrated Research Center at Inova Health System, Gynecologic Cancer Center of Excellence, Annandale 22003, VA (United States); The John P. Murtha Cancer Center, Walter Reed National Military Medical Center, 8901 Wisconsin Avenue, Bethesda 20889, MD (United States); Maxwell, George L. [Department of Obstetrics and Gynecology, Inova Fairfax Hospital, Falls Church, VA 22042 (United States); Risinger, John I. [Department of Obstetrics, Gynecology and Reproductive Biology, Michigan State University, Grand Rapids 49503, MI (United States); and others
2016-01-01
AT-rich interactive domain-containing protein 1A (ARID1A) is a recently identified nuclear tumor suppressor frequently altered in solid tumor malignancies. We have identified a bipartite-like nuclear localization sequence (NLS) that contributes to nuclear import of ARID1A not previously described. We functionally confirm activity using GFP constructs fused with wild-type or mutant NLS sequences. We further show that cyto-nuclear localized, bipartite NLS mutant ARID1A exhibits greater stability than nuclear-localized, wild-type ARID1A. Identification of this undescribed functional NLS within ARID1A contributes vital insights to rationalize the impact of ARID1A missense mutations observed in patient tumors. - Highlights: • We have identified a bipartite nuclear localization sequence (NLS) in ARID1A. • Confirmation of the NLS was performed using GFP constructs. • NLS mutant ARID1A exhibits greater stability than wild-type ARID1A.
Effect of the social influence on topological properties of user-object bipartite networks
Liu, Jian-Guo; Hu, Zhaolong; Guo, Qiang
2013-11-01
Social influence plays an important role in analyzing online users' collective behaviors [Salganik et al., Science 311, 854 (2006)]. However, the effect of the social influence from the viewpoint of theoretical model is missing. In this paper, by taking into account the social influence and users' preferences, we develop a theoretical model to analyze the topological properties of user-object bipartite networks, including the degree distribution, average nearest neighbor degree and the bipartite clustering coefficient, as well as topological properties of the original user-object networks and their unipartite projections. According to the users' preferences and the global ranking effect, we analyze the theoretical results for two benchmark data sets, Amazon and Bookcrossing, which are approximately consistent with the empirical results. This work suggests that this model is feasible to analyze topological properties of bipartite networks in terms of the social influence and the users' preferences.
Leke, Walter N; Khatabi, Behnam; Fondong, Vincent N; Brown, Judith K
2016-08-01
The complete genome sequence was determined and characterized for a previously unreported bipartite begomovirus from fluted pumpkin (Telfairia occidentalis, family Cucurbitaceae) plants displaying mosaic symptoms in Cameroon. The DNA-A and DNA-B components were ~2.7 kb and ~2.6 kb in size, and the arrangement of viral coding regions on the genomic components was like those characteristic of other known bipartite begomoviruses originating in the Old World. While the DNA-A component was more closely related to that of chayote yellow mosaic virus (ChaYMV), at 78 %, the DNA-B component was more closely related to that of soybean chlorotic blotch virus (SbCBV), at 64 %. This newly discovered bipartite Old World virus is herein named telfairia mosaic virus (TelMV).
Bipartite consensus for multi-agent systems with antagonistic interactions and communication delays
Guo, Xing; Lu, Jianquan; Alsaedi, Ahmed; Alsaadi, Fuad E.
2018-04-01
This paper studies the consensus problems over signed digraphs with arbitrary finite communication delays. For the considered system, the information flow is directed and only locally delayed information can be used for each node. We derive that bipartite consensus of this system can be realized when the associated signed digraph is strongly connected. Furthermore, for structurally balanced networks, this paper studies the pinning partite consensus for the considered system. we design a pinning scheme to pin any one agent in the signed network, and obtain that the network achieves pinning bipartite consensus with any initial conditions. Finally, two examples are provided to demonstrate the effectiveness of our main results.
Brunner, R.; Akis, R.; Ferry, D. K.; Kuchar, F.; Meisels, R.
2008-07-01
We discuss a quantum system coupled to the environment, composed of an open array of billiards (dots) in series. Beside pointer states occurring in individual dots, we observe sets of robust states which arise only in the array. We define these new states as bipartite pointer states, since they cannot be described in terms of simple linear combinations of robust single-dot states. The classical existence of bipartite pointer states is confirmed by comparing the quantum-mechanical and classical results. The ability of the robust states to create “offspring” indicates that quantum Darwinism is in action.
Ordering non-bipartite unicyclic graphs with pendant vertices by the least Q-eigenvalue
Directory of Open Access Journals (Sweden)
Shu-Guang Guo
2016-05-01
Full Text Available Abstract A unicyclic graph is a connected graph whose number of edges is equal to the number of vertices. Fan et al. (Discrete Math. 313:903-909, 2013 and Liu et al. (Electron. J. Linear Algebra 26:333-344, 2013 determined, independently, the unique unicyclic graph whose least Q-eigenvalue attains the minimum among all non-bipartite unicyclic graphs of order n with k pendant vertices. In this paper, we extend their results and determine the first three non-bipartite unicyclic graphs of order n with k pendant vertices ordering by least Q-eigenvalue.
BATAS ATAS BILANGAN RAMSEY UNTUK GRAF BINTANG DAN GRAF BIPARTIT LENGKAP
Rosyida, Isnaini
2008-01-01
Misal G dan H dua buah graf sebarang, bilangan Ramsey R(G,H) adalah bilangan asli terkecil n sehingga untuk setiap graf F dengan n titik akan memuat G atau komplemen dari F memuat H. Makalah ini akan membahas batas atas dari bilangan Ramsey untuk graf bintang Sn dan graf bipartit lengkap Kp,q. Khususnya, kita akan menunjukkan batas atas dari R(Sn, K2,q) serta batas atas dari R(Sn, Kp,q) untuk n ≥ 5, 3 ≤ p ≤ n-1 dan q ≤ 2.Kata Kunci : Bilangan Ramsey, Graf Bintang dan Bipartit
Congenital bipartite atlas with hypodactyly in a dog: clinical, radiographic and CT findings.
Wrzosek, M; Płonek, M; Zeira, O; Bieżyński, J; Kinda, W; Guziński, M
2014-07-01
A three-year-old Border collie was diagnosed with a bipartite atlas and bilateral forelimb hypodactyly. The dog showed signs of acute, non-progressive neck pain, general stiffness and right thoracic limb non-weight-bearing lameness. Computed tomography imaging revealed a bipartite atlas with abaxial vertical bone proliferation, which was the cause of the clinical signs. In addition, bilateral hypodactyly of the second and fifth digits was incidentally found. This report suggests that hypodactyly may be associated with atlas malformations. © 2014 British Small Animal Veterinary Association.
High-energy heavy ion testing of VLSI devices for single event ...
Indian Academy of Sciences (India)
Unknown
per describes the high-energy heavy ion radiation testing of VLSI devices for single event upset (SEU) ... The experimental set up employed to produce low flux of heavy ions viz. silicon ... through which they pass, leaving behind a wake of elec- ... for use in Bus Management Unit (BMU) and bulk CMOS ... was scheduled.
Power gating of VLSI circuits using MEMS switches in low power applications
Shobak, Hosam; Ghoneim, Mohamed T.; El Boghdady, Nawal; Halawa, Sarah; Iskander, Sophinese M.; Anis, Mohab H.
2011-01-01
-designed MEMS switch to power gate VLSI circuits, such that leakage power is efficiently reduced while accounting for performance and reliability. The designed MEMS switch is characterized by an 0.1876 ? ON resistance and requires 4.5 V to switch. As a result
Implementation of a VLSI Level Zero Processing system utilizing the functional component approach
Shi, Jianfei; Horner, Ward P.; Grebowsky, Gerald J.; Chesney, James R.
1991-01-01
A high rate Level Zero Processing system is currently being prototyped at NASA/Goddard Space Flight Center (GSFC). Based on state-of-the-art VLSI technology and the functional component approach, the new system promises capabilities of handling multiple Virtual Channels and Applications with a combined data rate of up to 20 Megabits per second (Mbps) at low cost.
An area-efficient path memory structure for VLSI Implementation of high speed Viterbi decoders
DEFF Research Database (Denmark)
Paaske, Erik; Pedersen, Steen; Sparsø, Jens
1991-01-01
Path storage and selection methods for Viterbi decoders are investigated with special emphasis on VLSI implementations. Two well-known algorithms, the register exchange, algorithm, REA, and the trace back algorithm, TBA, are considered. The REA requires the smallest number of storage elements...
VLSI top-down design based on the separation of hierarchies
Spaanenburg, L.; Broekema, A.; Leenstra, J.; Huys, C.
1986-01-01
Despite the presence of structure, interactions between the three views on VLSI design still lead to lengthy iterations. By separating the hierarchies for the respective views, the interactions are reduced. This separated hierarchy allows top-down design with functional abstractions as exemplified
CMOS VLSI Active-Pixel Sensor for Tracking
Pain, Bedabrata; Sun, Chao; Yang, Guang; Heynssens, Julie
2004-01-01
An architecture for a proposed active-pixel sensor (APS) and a design to implement the architecture in a complementary metal oxide semiconductor (CMOS) very-large-scale integrated (VLSI) circuit provide for some advanced features that are expected to be especially desirable for tracking pointlike features of stars. The architecture would also make this APS suitable for robotic- vision and general pointing and tracking applications. CMOS imagers in general are well suited for pointing and tracking because they can be configured for random access to selected pixels and to provide readout from windows of interest within their fields of view. However, until now, the architectures of CMOS imagers have not supported multiwindow operation or low-noise data collection. Moreover, smearing and motion artifacts in collected images have made prior CMOS imagers unsuitable for tracking applications. The proposed CMOS imager (see figure) would include an array of 1,024 by 1,024 pixels containing high-performance photodiode-based APS circuitry. The pixel pitch would be 9 m. The operations of the pixel circuits would be sequenced and otherwise controlled by an on-chip timing and control block, which would enable the collection of image data, during a single frame period, from either the full frame (that is, all 1,024 1,024 pixels) or from within as many as 8 different arbitrarily placed windows as large as 8 by 8 pixels each. A typical prior CMOS APS operates in a row-at-a-time ( grolling-shutter h) readout mode, which gives rise to exposure skew. In contrast, the proposed APS would operate in a sample-first/readlater mode, suppressing rolling-shutter effects. In this mode, the analog readout signals from the pixels corresponding to the windows of the interest (which windows, in the star-tracking application, would presumably contain guide stars) would be sampled rapidly by routing them through a programmable diagonal switch array to an on-chip parallel analog memory array. The
The study of entanglement and teleportation of the harmonic oscillator bipartite coherent states
Directory of Open Access Journals (Sweden)
A Rabeie and
2015-01-01
Full Text Available In this paper, we reproduce the harmonic oscillator bipartite coherent states with imperfect cloning of coherent states. We show that if these entangled coherent states are embedded in a vacuum environment, their entanglement is degraded but not totally lost . Also, the optimal fidelity of these states is worked out for investigating their teleportation
On bipartite pure-state entanglement structure in terms of disentanglement
Herbut, Fedor
2006-12-01
Schrödinger's disentanglement [E. Schrödinger, Proc. Cambridge Philos. Soc. 31, 555 (1935)], i.e., remote state decomposition, as a physical way to study entanglement, is carried one step further with respect to previous work in investigating the qualitative side of entanglement in any bipartite state vector. Remote measurement (or, equivalently, remote orthogonal state decomposition) from previous work is generalized to remote linearly independent complete state decomposition both in the nonselective and the selective versions. The results are displayed in terms of commutative square diagrams, which show the power and beauty of the physical meaning of the (antiunitary) correlation operator inherent in the given bipartite state vector. This operator, together with the subsystem states (reduced density operators), constitutes the so-called correlated subsystem picture. It is the central part of the antilinear representation of a bipartite state vector, and it is a kind of core of its entanglement structure. The generalization of previously elaborated disentanglement expounded in this article is a synthesis of the antilinear representation of bipartite state vectors, which is reviewed, and the relevant results of [Cassinelli et al., J. Math. Anal. Appl. 210, 472 (1997)] in mathematical analysis, which are summed up. Linearly independent bases (finite or infinite) are shown to be almost as useful in some quantum mechanical studies as orthonormal ones. Finally, it is shown that linearly independent remote pure-state preparation carries the highest probability of occurrence. This singles out linearly independent remote influence from all possible ones.
Effects of the bipartite structure of a network on performance of recommenders
Wang, Qing-Xian; Li, Jian; Luo, Xin; Xu, Jian-Jun; Shang, Ming-Sheng
2018-02-01
Recommender systems aim to predict people's preferences for online items by analyzing their historical behaviors. A recommender can be modeled as a high-dimensional and sparse bipartite network, where the key issue is to understand the relation between the network structure and a recommender's performance. To address this issue, we choose three network characteristics, clustering coefficient, network density and user-item ratio, as the analyzing targets. For the cluster coefficient, we adopt the Degree-preserving rewiring algorithm to obtain a series of bipartite network with varying cluster coefficient, while the degree of user and item keep unchanged. Furthermore, five state-of-the-art recommenders are applied on two real datasets. The performances of recommenders are measured by both numerical and physical metrics. These results show that a recommender's performance is positively related to the clustering coefficient of a bipartite network. Meanwhile, higher density of a bipartite network can provide more accurate but less diverse or novel recommendations. Furthermore, the user-item ratio is positively correlated with the accuracy metrics but negatively correlated with the diverse and novel metrics.
Bipartite Networks of Wikipediaʼs Articles and Authors: a Meso-level Approach
DEFF Research Database (Denmark)
Jesus, Rut; Hansen-Schwartz, Martin; Jørgensen, Sune Lehmann
2009-01-01
This exploratory study investigates the bipartite network of articles linked by common editors in Wikipedia, 'The Free Encyclopedia that Anyone Can Edit'. We use the articles in the categories (to depth three) of Physics and Philosophy and extract and focus on significant editors (at least 7 or 10...
Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph
Nagarathinam, R.; Parvathi, N.
2018-04-01
Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat
A simple model of bipartite cooperation for ecological and organizational networks.
Saavedra, Serguei; Reed-Tsochas, Felix; Uzzi, Brian
2009-01-22
In theoretical ecology, simple stochastic models that satisfy two basic conditions about the distribution of niche values and feeding ranges have proved successful in reproducing the overall structural properties of real food webs, using species richness and connectance as the only input parameters. Recently, more detailed models have incorporated higher levels of constraint in order to reproduce the actual links observed in real food webs. Here, building on previous stochastic models of consumer-resource interactions between species, we propose a highly parsimonious model that can reproduce the overall bipartite structure of cooperative partner-partner interactions, as exemplified by plant-animal mutualistic networks. Our stochastic model of bipartite cooperation uses simple specialization and interaction rules, and only requires three empirical input parameters. We test the bipartite cooperation model on ten large pollination data sets that have been compiled in the literature, and find that it successfully replicates the degree distribution, nestedness and modularity of the empirical networks. These properties are regarded as key to understanding cooperation in mutualistic networks. We also apply our model to an extensive data set of two classes of company engaged in joint production in the garment industry. Using the same metrics, we find that the network of manufacturer-contractor interactions exhibits similar structural patterns to plant-animal pollination networks. This surprising correspondence between ecological and organizational networks suggests that the simple rules of cooperation that generate bipartite networks may be generic, and could prove relevant in many different domains, ranging from biological systems to human society.
Czech Academy of Sciences Publication Activity Database
Peřina Jr., J.; Arkhipov, I.I.; Michálek, Václav; Haderka, Ondřej
2017-01-01
Roč. 96, č. 4 (2017), s. 1-15, č. článku 043845. ISSN 2469-9926 Institutional support: RVO:68378271 Keywords : parametric down-conversion * photon statistic * bipartite optical fields * quadratic detectors Subject RIV: BH - Optics, Masers, Lasers OBOR OECD: Optics (including laser optics and quantum optics) Impact factor: 2.925, year: 2016
National Research Council Canada - National Science Library
Altmeyer, Ronald
2002-01-01
This thesis documents the research, circuit design, and simulation testing of a VLSI ASIC which extracts phase angle information from a complex sampled signal using the arctangent relationship: (phi=tan/-1 (Q/1...
Energy Technology Data Exchange (ETDEWEB)
Chiang, Patrick [Oregon State Univ., Corvallis, OR (United States)
2014-01-31
The research goal of this CAREER proposal is to develop energy-efficient, VLSI interconnect circuits and systems that will facilitate future massively-parallel, high-performance computing. Extreme-scale computing will exhibit massive parallelism on multiple vertical levels, from thou sands of computational units on a single processor to thousands of processors in a single data center. Unfortunately, the energy required to communicate between these units at every level (on chip, off-chip, off-rack) will be the critical limitation to energy efficiency. Therefore, the PI's career goal is to become a leading researcher in the design of energy-efficient VLSI interconnect for future computing systems.
VLSI Design of SVM-Based Seizure Detection System With On-Chip Learning Capability.
Feng, Lichen; Li, Zunchao; Wang, Yuanfa
2018-02-01
Portable automatic seizure detection system is very convenient for epilepsy patients to carry. In order to make the system on-chip trainable with high efficiency and attain high detection accuracy, this paper presents a very large scale integration (VLSI) design based on the nonlinear support vector machine (SVM). The proposed design mainly consists of a feature extraction (FE) module and an SVM module. The FE module performs the three-level Daubechies discrete wavelet transform to fit the physiological bands of the electroencephalogram (EEG) signal and extracts the time-frequency domain features reflecting the nonstationary signal properties. The SVM module integrates the modified sequential minimal optimization algorithm with the table-driven-based Gaussian kernel to enable efficient on-chip learning. The presented design is verified on an Altera Cyclone II field-programmable gate array and tested using the two publicly available EEG datasets. Experiment results show that the designed VLSI system improves the detection accuracy and training efficiency.
Power gating of VLSI circuits using MEMS switches in low power applications
Shobak, Hosam
2011-12-01
Power dissipation poses a great challenge for VLSI designers. With the intense down-scaling of technology, the total power consumption of the chip is made up primarily of leakage power dissipation. This paper proposes combining a custom-designed MEMS switch to power gate VLSI circuits, such that leakage power is efficiently reduced while accounting for performance and reliability. The designed MEMS switch is characterized by an 0.1876 ? ON resistance and requires 4.5 V to switch. As a result of implementing this novel power gating technique, a standby leakage power reduction of 99% and energy savings of 33.3% are achieved. Finally the possible effects of surge currents and ground bounce noise are studied. These findings allow longer operation times for battery-operated systems characterized by long standby periods. © 2011 IEEE.
Towards an Analogue Neuromorphic VLSI Instrument for the Sensing of Complex Odours
Ab Aziz, Muhammad Fazli; Harun, Fauzan Khairi Che; Covington, James A.; Gardner, Julian W.
2011-09-01
Almost all electronic nose instruments reported today employ pattern recognition algorithms written in software and run on digital processors, e.g. micro-processors, microcontrollers or FPGAs. Conversely, in this paper we describe the analogue VLSI implementation of an electronic nose through the design of a neuromorphic olfactory chip. The modelling, design and fabrication of the chip have already been reported. Here a smart interface has been designed and characterised for thisneuromorphic chip. Thus we can demonstrate the functionality of the a VLSI neuromorphic chip, producing differing principal neuron firing patterns to real sensor response data. Further work is directed towards integrating 9 separate neuromorphic chips to create a large neuronal network to solve more complex olfactory problems.
An analog VLSI real time optical character recognition system based on a neural architecture
International Nuclear Information System (INIS)
Bo, G.; Caviglia, D.; Valle, M.
1999-01-01
In this paper a real time Optical Character Recognition system is presented: it is based on a feature extraction module and a neural network classifier which have been designed and fabricated in analog VLSI technology. Experimental results validate the circuit functionality. The results obtained from a validation based on a mixed approach (i.e., an approach based on both experimental and simulation results) confirm the soundness and reliability of the system
An analog VLSI real time optical character recognition system based on a neural architecture
Energy Technology Data Exchange (ETDEWEB)
Bo, G.; Caviglia, D.; Valle, M. [Genoa Univ. (Italy). Dip. of Biophysical and Electronic Engineering
1999-03-01
In this paper a real time Optical Character Recognition system is presented: it is based on a feature extraction module and a neural network classifier which have been designed and fabricated in analog VLSI technology. Experimental results validate the circuit functionality. The results obtained from a validation based on a mixed approach (i.e., an approach based on both experimental and simulation results) confirm the soundness and reliability of the system.
First results from a silicon-strip detector with VLSI readout
International Nuclear Information System (INIS)
Anzivino, G.; Horisberger, R.; Hubbeling, L.; Hyams, B.; Parker, S.; Breakstone, A.; Litke, A.M.; Walker, J.T.; Bingefors, N.
1986-01-01
A 256-strip silicon detector with 25 μm strip pitch, connected to two 128-channel NMOS VLSI chips (Microplex), has been tested using straight-through tracks from a ruthenium beta source. The readout channels have a pitch of 47.5 μm. A single multiplexed output provides voltages proportional to the integrated charge from each strip. The most probable signal height from the beta traversals is approximately 14 times the rms noise in any single channel. (orig.)
International Conference on VLSI, Communication, Advanced Devices, Signals & Systems and Networking
Shirur, Yasha; Prasad, Rekha
2013-01-01
This book is a collection of papers presented by renowned researchers, keynote speakers and academicians in the International Conference on VLSI, Communication, Analog Designs, Signals and Systems, and Networking (VCASAN-2013), organized by B.N.M. Institute of Technology, Bangalore, India during July 17-19, 2013. The book provides global trends in cutting-edge technologies in electronics and communication engineering. The content of the book is useful to engineers, researchers and academicians as well as industry professionals.
Directory of Open Access Journals (Sweden)
Rachmad Vidya Wicaksana Putra
2016-06-01
Full Text Available Convolutional encoding and data decoding are fundamental processes in convolutional error correction. One of the most popular error correction methods in decoding is the Viterbi algorithm. It is extensively implemented in many digital communication applications. Its VLSI design challenges are about area, speed, power, complexity and configurability. In this research, we specifically propose a VLSI architecture for a configurable and low-complexity design of a hard-decision Viterbi decoding algorithm. The configurable and low-complexity design is achieved by designing a generic VLSI architecture, optimizing each processing element (PE at the logical operation level and designing a conditional adapter. The proposed design can be configured for any predefined number of trace-backs, only by changing the trace-back parameter value. Its computational process only needs N + 2 clock cycles latency, with N is the number of trace-backs. Its configurability function has been proven for N = 8, N = 16, N = 32 and N = 64. Furthermore, the proposed design was synthesized and evaluated in Xilinx and Altera FPGA target boards for area consumption and speed performance.
Chimera states in bipartite networks of FitzHugh-Nagumo oscillators
Wu, Zhi-Min; Cheng, Hong-Yan; Feng, Yuee; Li, Hai-Hong; Dai, Qiong-Lin; Yang, Jun-Zhong
2018-04-01
Chimera states consisting of spatially coherent and incoherent domains have been observed in different topologies such as rings, spheres, and complex networks. In this paper, we investigate bipartite networks of nonlocally coupled FitzHugh-Nagumo (FHN) oscillators in which the units are allocated evenly to two layers, and FHN units interact with each other only when they are in different layers. We report the existence of chimera states in bipartite networks. Owing to the interplay between chimera states in the two layers, many types of chimera states such as in-phase chimera states, antiphase chimera states, and out-of-phase chimera states are classified. Stability diagrams of several typical chimera states in the coupling strength-coupling radius plane, which show strong multistability of chimera states, are explored.
Co-clustering Analysis of Weblogs Using Bipartite Spectral Projection Approach
DEFF Research Database (Denmark)
Xu, Guandong; Zong, Yu; Dolog, Peter
2010-01-01
Web clustering is an approach for aggregating Web objects into various groups according to underlying relationships among them. Finding co-clusters of Web objects is an interesting topic in the context of Web usage mining, which is able to capture the underlying user navigational interest...... and content preference simultaneously. In this paper we will present an algorithm using bipartite spectral clustering to co-cluster Web users and pages. The usage data of users visiting Web sites is modeled as a bipartite graph and the spectral clustering is then applied to the graph representation of usage...... data. The proposed approach is evaluated by experiments performed on real datasets, and the impact of using various clustering algorithms is also investigated. Experimental results have demonstrated the employed method can effectively reveal the subset aggregates of Web users and pages which...
Energy Technology Data Exchange (ETDEWEB)
Kumar, Asutosh [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Homi Bhabha National Institute, Anushaktinagar, Mumbai 400094 (India); Dhar, Himadri Shekhar [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Institute for Theoretical Physics, Vienna University of Technology, Wiedner Hauptstraße 8-10/136, A-1040 Vienna (Austria); Prabhu, R. [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Department of Physics, Indian Institute of Technology Patna, Patna 800013 (India); Sen, Aditi [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Homi Bhabha National Institute, Anushaktinagar, Mumbai 400094 (India); Sen, Ujjwal, E-mail: ujjwal@hri.res.in [Harish-Chandra Research Institute, Chhatnag Road, Jhunsi, Allahabad 211019 (India); Homi Bhabha National Institute, Anushaktinagar, Mumbai 400094 (India)
2017-05-25
Monogamy is a nonclassical property that limits the distribution of quantum correlation among subparts of a multiparty system. We show that monogamy scores for different quantum correlation measures are bounded above by functions of genuine multipartite entanglement for a large majority of pure multiqubit states. The bound is universal for all three-qubit pure states. We derive necessary conditions to characterize the states that violate the bound, which can also be observed by numerical simulation for a small set of states, generated Haar uniformly. The results indicate that genuine multipartite entanglement restricts the distribution of bipartite quantum correlations in a multiparty system. - Highlights: • Monogamy is an intrinsic property of several quantum characteristics including entanglement. • It is possible to quantify monogamy by using the so-called monogamy scores. • Genuine multisite entanglement can be used to bound monogamy scores. • Distribution of bipartite entanglement in a system is, therefore, restricted by its multisite entanglement content.
Phase-controlled localization and directed transport in an optical bipartite lattice.
Hai, Kuo; Luo, Yunrong; Lu, Gengbiao; Hai, Wenhua
2014-02-24
We investigate coherent control of a single atom interacting with an optical bipartite lattice via a combined high-frequency modulation. Our analytical results show that the quantum tunneling and dynamical localization can depend on phase difference between the modulation components, which leads to a different route for the coherent destruction of tunneling and a convenient phase-control method for stabilizing the system to implement the directed transport of atom. The similar directed transport and the phase-controlled quantum transition are revealed for the corresponding many-particle system. The results can be referable for experimentally manipulating quantum transport and transition of cold atoms in the tilted and shaken optical bipartite lattice or of analogical optical two-mode quantum beam splitter, and also can be extended to other optical and solid-state systems.
Bipartite hallucal sesamoid bones: relationship with hallux valgus and metatarsal index
Energy Technology Data Exchange (ETDEWEB)
Munuera, Pedro V.; Dominguez, Gabriel [University of Seville, Department of Podiatrics, Seville (Spain); Centro Docente de Fisioterapia y Podologia, Departamento de Podologia, Seville (Spain); Reina, Maria; Trujillo, Piedad [Centro Docente de Fisioterapia y Podologia, Departamento de Podologia, Seville (Spain)
2007-11-15
The objective was to relate the incidence of the partition of the hallucal sesamoid bones to the size of the first metatarsal and the hallux valgus deformity. In a sample of 474 radiographs, the frequency of appearance of bipartite sesamoids was studied. The length and relative protrusion of the first metatarsal, and the hallux abductus angle, were measured and compared between the feet with and without sesamoid partition. The results showed that 14.6% of the feet studied had at least one partite sesamoid, that the sesamoid most frequently divided was the medial, and that unilateral partition was the most common. No difference was found in the incidence of partite sesamoids between men and women, or between left and right feet. Protrusion and length of the first metatarsal are greater in feet with partite sesamoids than in feet without this condition. A significantly higher incidence of bipartite medial sesamoid was obtained in feet with hallux valgus compared with normal feet. (orig.)
Bipartite hallucal sesamoid bones: relationship with hallux valgus and metatarsal index
International Nuclear Information System (INIS)
Munuera, Pedro V.; Dominguez, Gabriel; Reina, Maria; Trujillo, Piedad
2007-01-01
The objective was to relate the incidence of the partition of the hallucal sesamoid bones to the size of the first metatarsal and the hallux valgus deformity. In a sample of 474 radiographs, the frequency of appearance of bipartite sesamoids was studied. The length and relative protrusion of the first metatarsal, and the hallux abductus angle, were measured and compared between the feet with and without sesamoid partition. The results showed that 14.6% of the feet studied had at least one partite sesamoid, that the sesamoid most frequently divided was the medial, and that unilateral partition was the most common. No difference was found in the incidence of partite sesamoids between men and women, or between left and right feet. Protrusion and length of the first metatarsal are greater in feet with partite sesamoids than in feet without this condition. A significantly higher incidence of bipartite medial sesamoid was obtained in feet with hallux valgus compared with normal feet. (orig.)
Bipartite entangled stabilizer mutually unbiased bases as maximum cliques of Cayley graphs
van Dam, Wim; Howard, Mark
2011-07-01
We examine the existence and structure of particular sets of mutually unbiased bases (MUBs) in bipartite qudit systems. In contrast to well-known power-of-prime MUB constructions, we restrict ourselves to using maximally entangled stabilizer states as MUB vectors. Consequently, these bipartite entangled stabilizer MUBs (BES MUBs) provide no local information, but are sufficient and minimal for decomposing a wide variety of interesting operators including (mixtures of) Jamiołkowski states, entanglement witnesses, and more. The problem of finding such BES MUBs can be mapped, in a natural way, to that of finding maximum cliques in a family of Cayley graphs. Some relationships with known power-of-prime MUB constructions are discussed, and observables for BES MUBs are given explicitly in terms of Pauli operators.
Bipartite entangled stabilizer mutually unbiased bases as maximum cliques of Cayley graphs
International Nuclear Information System (INIS)
Dam, Wim van; Howard, Mark
2011-01-01
We examine the existence and structure of particular sets of mutually unbiased bases (MUBs) in bipartite qudit systems. In contrast to well-known power-of-prime MUB constructions, we restrict ourselves to using maximally entangled stabilizer states as MUB vectors. Consequently, these bipartite entangled stabilizer MUBs (BES MUBs) provide no local information, but are sufficient and minimal for decomposing a wide variety of interesting operators including (mixtures of) Jamiolkowski states, entanglement witnesses, and more. The problem of finding such BES MUBs can be mapped, in a natural way, to that of finding maximum cliques in a family of Cayley graphs. Some relationships with known power-of-prime MUB constructions are discussed, and observables for BES MUBs are given explicitly in terms of Pauli operators.
International Nuclear Information System (INIS)
Fan Hongyi; Lu Hailiang; Xu Xuefen
2006-01-01
We introduce the bipartite entangled states to present a quantum mechanical version of complex wavelet transform. Using the technique of integral within an ordered product of operators we show that the complex wavelet transform can be studied in terms of various quantum state vectors in two-mode Fock space. In this way the creterion for mother wavelet can be examined quantum-mechanically and therefore more deeply.
SibRank: Signed bipartite network analysis for neighbor-based collaborative ranking
Shams, Bita; Haratizadeh, Saman
2016-09-01
Collaborative ranking is an emerging field of recommender systems that utilizes users' preference data rather than rating values. Unfortunately, neighbor-based collaborative ranking has gained little attention despite its more flexibility and justifiability. This paper proposes a novel framework, called SibRank that seeks to improve the state of the art neighbor-based collaborative ranking methods. SibRank represents users' preferences as a signed bipartite network, and finds similar users, through a novel personalized ranking algorithm in signed networks.
Inferring monopartite projections of bipartite networks: an entropy-based approach
Saracco, Fabio; Straka, Mika J.; Di Clemente, Riccardo; Gabrielli, Andrea; Caldarelli, Guido; Squartini, Tiziano
2017-05-01
Bipartite networks are currently regarded as providing a major insight into the organization of many real-world systems, unveiling the mechanisms driving the interactions occurring between distinct groups of nodes. One of the most important issues encountered when modeling bipartite networks is devising a way to obtain a (monopartite) projection on the layer of interest, which preserves as much as possible the information encoded into the original bipartite structure. In the present paper we propose an algorithm to obtain statistically-validated projections of bipartite networks, according to which any two nodes sharing a statistically-significant number of neighbors are linked. Since assessing the statistical significance of nodes similarity requires a proper statistical benchmark, here we consider a set of four null models, defined within the exponential random graph framework. Our algorithm outputs a matrix of link-specific p-values, from which a validated projection is straightforwardly obtainable, upon running a multiple hypothesis testing procedure. Finally, we test our method on an economic network (i.e. the countries-products World Trade Web representation) and a social network (i.e. MovieLens, collecting the users’ ratings of a list of movies). In both cases non-trivial communities are detected: while projecting the World Trade Web on the countries layer reveals modules of similarly-industrialized nations, projecting it on the products layer allows communities characterized by an increasing level of complexity to be detected; in the second case, projecting MovieLens on the films layer allows clusters of movies whose affinity cannot be fully accounted for by genre similarity to be individuated.
Some Congruence Properties of a Restricted Bipartition Function cN(n
Directory of Open Access Journals (Sweden)
Nipen Saikia
2016-01-01
Full Text Available Let cN(n denote the number of bipartitions (λ,μ of a positive integer n subject to the restriction that each part of μ is divisible by N. In this paper, we prove some congruence properties of the function cN(n for N=7, 11, and 5l, for any integer l≥1, by employing Ramanujan’s theta-function identities.
Institute of Scientific and Technical Information of China (English)
YUAN Hong-Chun; QI Kai-Guo
2005-01-01
We mostly investigate two schemes. One is to teleport a multi-mode W-type entangled coherent state using a peculiar bipartite entangled state as the quantum channel different from other proposals. Based on our formalism,teleporting multi-mode coherent state or squeezed state is also possible. Another is that the tripartite entangled state is used as the quantum channel of controlled teleportation of an arbitrary and unknown continuous variable in the case of three participators.
iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection
Hu, Jinlong; Liang, Junjie; Dong, Shoubin
2017-01-01
Online mobile advertising plays a vital financial role in supporting free mobile apps, but detecting malicious apps publishers who generate fraudulent actions on the advertisements hosted on their apps is difficult, since fraudulent traffic often mimics behaviors of legitimate users and evolves rapidly. In this paper, we propose a novel bipartite graph-based propagation approach, iBGP, for mobile apps advertising fraud detection in large advertising system. We exploit the characteristics of m...
Zenchuk, A. I.
2010-01-01
We {characterize the multipartite entanglement in a quantum system by the quantity} which vanishes if only the quantum system may be decomposed into two weakly entangled subsystems, unlike measures of multipartite entanglement introduced before. We refer to this {quantity} as the minimal entanglement of bipartite decompositions (MEBD). Big MEBD means that the system may not be decomposed into two weakly entangled subsystems. MEBD allows one to define, for instance, whether the given quantum s...
Information Filtering via Clustering Coefficients of User-Object Bipartite Networks
Guo, Qiang; Leng, Rui; Shi, Kerui; Liu, Jian-Guo
The clustering coefficient of user-object bipartite networks is presented to evaluate the overlap percentage of neighbors rating lists, which could be used to measure interest correlations among neighbor sets. The collaborative filtering (CF) information filtering algorithm evaluates a given user's interests in terms of his/her friends' opinions, which has become one of the most successful technologies for recommender systems. In this paper, different from the object clustering coefficient, users' clustering coefficients of user-object bipartite networks are introduced to improve the user similarity measurement. Numerical results for MovieLens and Netflix data sets show that users' clustering effects could enhance the algorithm performance. For MovieLens data set, the algorithmic accuracy, measured by the average ranking score, can be improved by 12.0% and the diversity could be improved by 18.2% and reach 0.649 when the recommendation list equals to 50. For Netflix data set, the accuracy could be improved by 14.5% at the optimal case and the popularity could be reduced by 13.4% comparing with the standard CF algorithm. Finally, we investigate the sparsity effect on the performance. This work indicates the user clustering coefficients is an effective factor to measure the user similarity, meanwhile statistical properties of user-object bipartite networks should be investigated to estimate users' tastes.
Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games
Peña, Jorge; Rochat, Yannick
2012-01-01
By combining evolutionary game theory and graph theory, “games on graphs” study the evolutionary dynamics of frequency-dependent selection in population structures modeled as geographical or social networks. Networks are usually represented by means of unipartite graphs, and social interactions by two-person games such as the famous prisoner’s dilemma. Unipartite graphs have also been used for modeling interactions going beyond pairwise interactions. In this paper, we argue that bipartite graphs are a better alternative to unipartite graphs for describing population structures in evolutionary multiplayer games. To illustrate this point, we make use of bipartite graphs to investigate, by means of computer simulations, the evolution of cooperation under the conventional and the distributed N-person prisoner’s dilemma. We show that several implicit assumptions arising from the standard approach based on unipartite graphs (such as the definition of replacement neighborhoods, the intertwining of individual and group diversity, and the large overlap of interaction neighborhoods) can have a large impact on the resulting evolutionary dynamics. Our work provides a clear example of the importance of construction procedures in games on graphs, of the suitability of bigraphs and hypergraphs for computational modeling, and of the importance of concepts from social network analysis such as centrality, centralization and bipartite clustering for the understanding of dynamical processes occurring on networked population structures. PMID:22970237
Enhanced capital-asset pricing model for the reconstruction of bipartite financial networks
Squartini, Tiziano; Almog, Assaf; Caldarelli, Guido; van Lelyveld, Iman; Garlaschelli, Diego; Cimini, Giulio
2017-09-01
Reconstructing patterns of interconnections from partial information is one of the most important issues in the statistical physics of complex networks. A paramount example is provided by financial networks. In fact, the spreading and amplification of financial distress in capital markets are strongly affected by the interconnections among financial institutions. Yet, while the aggregate balance sheets of institutions are publicly disclosed, information on single positions is mostly confidential and, as such, unavailable. Standard approaches to reconstruct the network of financial interconnection produce unrealistically dense topologies, leading to a biased estimation of systemic risk. Moreover, reconstruction techniques are generally designed for monopartite networks of bilateral exposures between financial institutions, thus failing in reproducing bipartite networks of security holdings (e.g., investment portfolios). Here we propose a reconstruction method based on constrained entropy maximization, tailored for bipartite financial networks. Such a procedure enhances the traditional capital-asset pricing model (CAPM) and allows us to reproduce the correct topology of the network. We test this enhanced CAPM (ECAPM) method on a dataset, collected by the European Central Bank, of detailed security holdings of European institutional sectors over a period of six years (2009-2015). Our approach outperforms the traditional CAPM and the recently proposed maximum-entropy CAPM both in reproducing the network topology and in estimating systemic risk due to fire sales spillovers. In general, ECAPM can be applied to the whole class of weighted bipartite networks described by the fitness model.
VLSI Architectures for Sliding-Window-Based Space-Time Turbo Trellis Code Decoders
Directory of Open Access Journals (Sweden)
Georgios Passas
2012-01-01
Full Text Available The VLSI implementation of SISO-MAP decoders used for traditional iterative turbo coding has been investigated in the literature. In this paper, a complete architectural model of a space-time turbo code receiver that includes elementary decoders is presented. These architectures are based on newly proposed building blocks such as a recursive add-compare-select-offset (ACSO unit, A-, B-, Γ-, and LLR output calculation modules. Measurements of complexity and decoding delay of several sliding-window-technique-based MAP decoder architectures and a proposed parameter set lead to defining equations and comparison between those architectures.
Initial beam test results from a silicon-strip detector with VLSI readout
International Nuclear Information System (INIS)
Adolphsen, C.; Litke, A.; Schwarz, A.
1986-01-01
Silicon detectors with 256 strips, having a pitch of 25 μm, and connected to two 128 channel NMOS VLSI chips each (Microplex), have been tested in relativistic charged particle beams at CERN and at the Stanford Linear Accelerator Center. The readout chips have an input channel pitch of 47.5 μm and a single multiplexed output which provides voltages proportional to the integrated charge from each strip. The most probable signal height from minimum ionizing tracks was 15 times the rms noise in any single channel. Two-track traversals with a separation of 100 μm were cleanly resolved
Energy Technology Data Exchange (ETDEWEB)
Rubat Du Merac, C; Jutier, P; Laurent, J; Courtois, B
1983-07-01
This paper describes some aspects of specifying, designing and evaluating a specialized machine, Romuald, for the capture, coding, and processing of video and scanning electron microscope (SEM) pictures. First the authors present the functional organization of the process unit of romuald and its hardware, giving details of its behaviour. Then they study the capture and display unit which, thanks to its flexibility, enables SEM images coding. Finally, they describe an application which is now being developed in their laboratory: testing VLSI circuits with new methods: sem+voltage contrast and image processing. 15 references.
Vlsi implementation of flexible architecture for decision tree classification in data mining
Sharma, K. Venkatesh; Shewandagn, Behailu; Bhukya, Shankar Nayak
2017-07-01
The Data mining algorithms have become vital to researchers in science, engineering, medicine, business, search and security domains. In recent years, there has been a terrific raise in the size of the data being collected and analyzed. Classification is the main difficulty faced in data mining. In a number of the solutions developed for this problem, most accepted one is Decision Tree Classification (DTC) that gives high precision while handling very large amount of data. This paper presents VLSI implementation of flexible architecture for Decision Tree classification in data mining using c4.5 algorithm.
International Nuclear Information System (INIS)
Jones, W.F.; Byars, L.G.; Casey, M.E.
1988-01-01
A digital electronic architecture for parallel processing of the expectation maximization (EM) algorithm for Positron Emission tomography (PET) image reconstruction is proposed. Rapid (0.2 second) EM iterations on high resolution (256 x 256) images are supported. Arrays of two very large scale integration (VLSI) chips perform forward and back projection calculations. A description of the architecture is given, including data flow and partitioning relevant to EM and parallel processing. EM images shown are produced with software simulating the proposed hardware reconstruction algorithm. Projected cost of the system is estimated to be small in comparison to the cost of current PET scanners
FILTRES: a 128 channels VLSI mixed front-end readout electronic development for microstrip detectors
International Nuclear Information System (INIS)
Anstotz, F.; Hu, Y.; Michel, J.; Sohler, J.L.; Lachartre, D.
1998-01-01
We present a VLSI digital-analog readout electronic chain for silicon microstrip detectors. The characteristics of this circuit have been optimized for the high resolution tracker of the CERN CMS experiment. This chip consists of 128 channels at 50 μm pitch. Each channel is composed by a charge amplifier, a CR-RC shaper, an analog memory, an analog processor, an output FIFO read out serially by a multiplexer. This chip has been processed in the radiation hard technology DMILL. This paper describes the architecture of the circuit and presents test results of the 128 channel full chain chip. (orig.)
Techniques for Computing the DFT Using the Residue Fermat Number Systems and VLSI
Truong, T. K.; Chang, J. J.; Hsu, I. S.; Pei, D. Y.; Reed, I. S.
1985-01-01
The integer complex multiplier and adder over the direct sum of two copies of a finite field is specialized to the direct sum of the rings of integers modulo Fermat numbers. Such multiplications and additions can be used in the implementation of a discrete Fourier transform (DFT) of a sequence of complex numbers. The advantage of the present approach is that the number of multiplications needed for the DFT can be reduced substantially over the previous approach. The architectural designs using this approach are regular, simple, expandable and, therefore, naturally suitable for VLSI implementation.
Local hypothesis testing between a pure bipartite state and the white noise state
Owari, Masaki; Hayashi, Masahito
2010-01-01
In this paper, we treat a local discrimination problem in the framework of asymmetric hypothesis testing. We choose a known bipartite pure state $\\ket{\\Psi}$ as an alternative hypothesis, and the completely mixed state as a null hypothesis. As a result, we analytically derive an optimal type 2 error and an optimal POVM for one-way LOCC POVM and Separable POVM. For two-way LOCC POVM, we study a family of simple three-step LOCC protocols, and show that the best protocol in this family has stric...
Strong monogamy of bipartite and genuine multipartite entanglement: the Gaussian case.
Adesso, Gerardo; Illuminati, Fabrizio
2007-10-12
We demonstrate the existence of general constraints on distributed quantum correlations, which impose a trade-off on bipartite and multipartite entanglement at once. For all N-mode Gaussian states under permutation invariance, we establish exactly a monogamy inequality, stronger than the traditional one, that by recursion defines a proper measure of genuine N-partite entanglement. Strong monogamy holds as well for subsystems of arbitrary size, and the emerging multipartite entanglement measure is found to be scale invariant. We unveil its operational connection with the optimal fidelity of continuous variable teleportation networks.
Non-parametric co-clustering of large scale sparse bipartite networks on the GPU
DEFF Research Database (Denmark)
Hansen, Toke Jansen; Mørup, Morten; Hansen, Lars Kai
2011-01-01
of row and column clusters from a hypothesis space of an infinite number of clusters. To reach large scale applications of co-clustering we exploit that parameter inference for co-clustering is well suited for parallel computing. We develop a generic GPU framework for efficient inference on large scale...... sparse bipartite networks and achieve a speedup of two orders of magnitude compared to estimation based on conventional CPUs. In terms of scalability we find for networks with more than 100 million links that reliable inference can be achieved in less than an hour on a single GPU. To efficiently manage...
Bipartite Anterior Extraperitoneal Teratoma: Evidence for the Embryological Origins of Teratomas?
Directory of Open Access Journals (Sweden)
D. J. B. Keene
2011-01-01
Full Text Available Teratomas are thought to arise from totipotent primordial germ cells (PGCs Dehner (1983 which may miss their target destination Moore and Persaud (1984. Teratomas can occur anywhere from the brain to the coccygeal area but are usually in the midline close to the embryological position of the gonadal ridges Bale (1984, Nguyen and Laberge (2000. We report a case of a bipartite anterior extraperitoneal teratoma. This is an unusual position for a teratoma, but one which may support the “missed target” theory of embryology.
Kumar, Asutosh; Dhar, Himadri Shekhar; Prabhu, R.; Sen(De), Aditi; Sen, Ujjwal
2017-05-01
Monogamy is a nonclassical property that limits the distribution of quantum correlation among subparts of a multiparty system. We show that monogamy scores for different quantum correlation measures are bounded above by functions of genuine multipartite entanglement for a large majority of pure multiqubit states. The bound is universal for all three-qubit pure states. We derive necessary conditions to characterize the states that violate the bound, which can also be observed by numerical simulation for a small set of states, generated Haar uniformly. The results indicate that genuine multipartite entanglement restricts the distribution of bipartite quantum correlations in a multiparty system.
International Nuclear Information System (INIS)
Fortescue, Ben; Lo, H.-K.
2005-01-01
We derive lower limits on the inefficiency and classical communication costs of dilution between two-term bipartite pure states that are partially entangled. We first calculate explicit relations between the allowable error and classical communication costs of entanglement dilution using a previously described protocol, then consider a two-stage dilution from singlets with this protocol followed by some unknown protocol for conversion between partially entangled states. Applying overall lower bounds on classical communication and inefficiency to this two-stage protocol, we derive bounds for the unknown protocol. In addition we derive analogous (but looser) bounds for general pure states
Fithian, Donald C
2018-05-01
Bipartite patella is an uncommon but potentially troublesome problem for young athletes. Numerous uncontrolled retrospective studies have reported good results after various treatments. What is needed are studies that will guide workup and support treatment decisions based on the condition of the cartilage surfaces of the fragment, presence of pseudoarthrosis, and size and location of the fragment. To support decisions, we need prospective comparative studies, either randomized or, at least, prospective cohort studies that identify patients at the time of presentation, document key decision points, and follow patients to successful resolution of symptoms. Copyright © 2018 Arthroscopy Association of North America. Published by Elsevier Inc. All rights reserved.
Memory Efficient VLSI Implementation of Real-Time Motion Detection System Using FPGA Platform
Directory of Open Access Journals (Sweden)
Sanjay Singh
2017-06-01
Full Text Available Motion detection is the heart of a potentially complex automated video surveillance system, intended to be used as a standalone system. Therefore, in addition to being accurate and robust, a successful motion detection technique must also be economical in the use of computational resources on selected FPGA development platform. This is because many other complex algorithms of an automated video surveillance system also run on the same platform. Keeping this key requirement as main focus, a memory efficient VLSI architecture for real-time motion detection and its implementation on FPGA platform is presented in this paper. This is accomplished by proposing a new memory efficient motion detection scheme and designing its VLSI architecture. The complete real-time motion detection system using the proposed memory efficient architecture along with proper input/output interfaces is implemented on Xilinx ML510 (Virtex-5 FX130T FPGA development platform and is capable of operating at 154.55 MHz clock frequency. Memory requirement of the proposed architecture is reduced by 41% compared to the standard clustering based motion detection architecture. The new memory efficient system robustly and automatically detects motion in real-world scenarios (both for the static backgrounds and the pseudo-stationary backgrounds in real-time for standard PAL (720 × 576 size color video.
A multichip aVLSI system emulating orientation selectivity of primary visual cortical cells.
Shimonomura, Kazuhiro; Yagi, Tetsuya
2005-07-01
In this paper, we designed and fabricated a multichip neuromorphic analog very large scale integrated (aVLSI) system, which emulates the orientation selective response of the simple cell in the primary visual cortex. The system consists of a silicon retina and an orientation chip. An image, which is filtered by a concentric center-surround (CS) antagonistic receptive field of the silicon retina, is transferred to the orientation chip. The image transfer from the silicon retina to the orientation chip is carried out with analog signals. The orientation chip selectively aggregates multiple pixels of the silicon retina, mimicking the feedforward model proposed by Hubel and Wiesel. The chip provides the orientation-selective (OS) outputs which are tuned to 0 degrees, 60 degrees, and 120 degrees. The feed-forward aggregation reduces the fixed pattern noise that is due to the mismatch of the transistors in the orientation chip. The spatial properties of the orientation selective response were examined in terms of the adjustable parameters of the chip, i.e., the number of aggregated pixels and size of the receptive field of the silicon retina. The multichip aVLSI architecture used in the present study can be applied to implement higher order cells such as the complex cell of the primary visual cortex.
A Compact VLSI System for Bio-Inspired Visual Motion Estimation.
Shi, Cong; Luo, Gang
2018-04-01
This paper proposes a bio-inspired visual motion estimation algorithm based on motion energy, along with its compact very-large-scale integration (VLSI) architecture using low-cost embedded systems. The algorithm mimics motion perception functions of retina, V1, and MT neurons in a primate visual system. It involves operations of ternary edge extraction, spatiotemporal filtering, motion energy extraction, and velocity integration. Moreover, we propose the concept of confidence map to indicate the reliability of estimation results on each probing location. Our algorithm involves only additions and multiplications during runtime, which is suitable for low-cost hardware implementation. The proposed VLSI architecture employs multiple (frame, pixel, and operation) levels of pipeline and massively parallel processing arrays to boost the system performance. The array unit circuits are optimized to minimize hardware resource consumption. We have prototyped the proposed architecture on a low-cost field-programmable gate array platform (Zynq 7020) running at 53-MHz clock frequency. It achieved 30-frame/s real-time performance for velocity estimation on 160 × 120 probing locations. A comprehensive evaluation experiment showed that the estimated velocity by our prototype has relatively small errors (average endpoint error < 0.5 pixel and angular error < 10°) for most motion cases.
An engineering methodology for implementing and testing VLSI (Very Large Scale Integrated) circuits
Corliss, Walter F., II
1989-03-01
The engineering methodology for producing a fully tested VLSI chip from a design layout is presented. A 16-bit correlator, NPS CORN88, that was previously designed, was used as a vehicle to demonstrate this methodology. The study of the design and simulation tools, MAGIC and MOSSIM II, was the focus of the design and validation process. The design was then implemented and the chip was fabricated by MOSIS. This fabricated chip was then used to develop a testing methodology for using the digital test facilities at NPS. NPS CORN88 was the first full custom VLSI chip, designed at NPS, to be tested with the NPS digital analysis system, Tektronix DAS 9100 series tester. The capabilities and limitations of these test facilities are examined. NPS CORN88 test results are included to demonstrate the capabilities of the digital test system. A translator, MOS2DAS, was developed to convert the MOSSIM II simulation program to the input files required by the DAS 9100 device verification software, 91DVS. Finally, a tutorial for using the digital test facilities, including the DAS 9100 and associated support equipments, is included as an appendix.
VLSI architecture of a K-best detector for MIMO-OFDM wireless communication systems
International Nuclear Information System (INIS)
Jian Haifang; Shi Yin
2009-01-01
The K-best detector is considered as a promising technique in the MIMO-OFDM detection because of its good performance and low complexity. In this paper, a new K-best VLSI architecture is presented. In the proposed architecture, the metric computation units (MCUs) expand each surviving path only to its partial branches, based on the novel expansion scheme, which can predetermine the branches' ascending order by their local distances. Then a distributed sorter sorts out the new K surviving paths from the expanded branches in pipelines. Compared to the conventional K-best scheme, the proposed architecture can approximately reduce fundamental operations by 50% and 75% for the 16-QAM and the 64-QAM cases, respectively, and, consequently, lower the demand on the hardware resource significantly. Simulation results prove that the proposed architecture can achieve a performance very similar to conventional K-best detectors. Hence, it is an efficient solution to the K-best detector's VLSI implementation for high-throughput MIMO-OFDM systems.
VLSI architecture of a K-best detector for MIMO-OFDM wireless communication systems
Energy Technology Data Exchange (ETDEWEB)
Jian Haifang; Shi Yin, E-mail: jhf@semi.ac.c [Institute of Semiconductors, Chinese Academy of Sciences, Beijing 100083 (China)
2009-07-15
The K-best detector is considered as a promising technique in the MIMO-OFDM detection because of its good performance and low complexity. In this paper, a new K-best VLSI architecture is presented. In the proposed architecture, the metric computation units (MCUs) expand each surviving path only to its partial branches, based on the novel expansion scheme, which can predetermine the branches' ascending order by their local distances. Then a distributed sorter sorts out the new K surviving paths from the expanded branches in pipelines. Compared to the conventional K-best scheme, the proposed architecture can approximately reduce fundamental operations by 50% and 75% for the 16-QAM and the 64-QAM cases, respectively, and, consequently, lower the demand on the hardware resource significantly. Simulation results prove that the proposed architecture can achieve a performance very similar to conventional K-best detectors. Hence, it is an efficient solution to the K-best detector's VLSI implementation for high-throughput MIMO-OFDM systems.
A multi coding technique to reduce transition activity in VLSI circuits
International Nuclear Information System (INIS)
Vithyalakshmi, N.; Rajaram, M.
2014-01-01
Advances in VLSI technology have enabled the implementation of complex digital circuits in a single chip, reducing system size and power consumption. In deep submicron low power CMOS VLSI design, the main cause of energy dissipation is charging and discharging of internal node capacitances due to transition activity. Transition activity is one of the major factors that also affect the dynamic power dissipation. This paper proposes power reduction analyzed through algorithm and logic circuit levels. In algorithm level the key aspect of reducing power dissipation is by minimizing transition activity and is achieved by introducing a data coding technique. So a novel multi coding technique is introduced to improve the efficiency of transition activity up to 52.3% on the bus lines, which will automatically reduce the dynamic power dissipation. In addition, 1 bit full adders are introduced in the Hamming distance estimator block, which reduces the device count. This coding method is implemented using Verilog HDL. The overall performance is analyzed by using Modelsim and Xilinx Tools. In total 38.2% power saving capability is achieved compared to other existing methods. (semiconductor technology)
Parallel algorithms for placement and routing in VLSI design. Ph.D. Thesis
Brouwer, Randall Jay
1991-01-01
The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.
Built-in self-repair of VLSI memories employing neural nets
Mazumder, Pinaki
1998-10-01
The decades of the Eighties and the Nineties have witnessed the spectacular growth of VLSI technology, when the chip size has increased from a few hundred devices to a staggering multi-millon transistors. This trend is expected to continue as the CMOS feature size progresses towards the nanometric dimension of 100 nm and less. SIA roadmap projects that, where as the DRAM chips will integrate over 20 billion devices in the next millennium, the future microprocessors may incorporate over 100 million transistors on a single chip. As the VLSI chip size increase, the limited accessibility of circuit components poses great difficulty for external diagnosis and replacement in the presence of faulty components. For this reason, extensive work has been done in built-in self-test techniques, but little research is known concerning built-in self-repair. Moreover, the extra hardware introduced by conventional fault-tolerance techniques is also likely to become faulty, therefore causing the circuit to be useless. This research demonstrates the feasibility of implementing electronic neural networks as intelligent hardware for memory array repair. Most importantly, we show that the neural network control possesses a robust and degradable computing capability under various fault conditions. Overall, a yield analysis performed on 64K DRAM's shows that the yield can be improved from as low as 20 percent to near 99 percent due to the self-repair design, with overhead no more than 7 percent.
A mathematical model for generating bipartite graphs and its application to protein networks
Nacher, J. C.; Ochiai, T.; Hayashida, M.; Akutsu, T.
2009-12-01
Complex systems arise in many different contexts from large communication systems and transportation infrastructures to molecular biology. Most of these systems can be organized into networks composed of nodes and interacting edges. Here, we present a theoretical model that constructs bipartite networks with the particular feature that the degree distribution can be tuned depending on the probability rate of fundamental processes. We then use this model to investigate protein-domain networks. A protein can be composed of up to hundreds of domains. Each domain represents a conserved sequence segment with specific functional tasks. We analyze the distribution of domains in Homo sapiens and Arabidopsis thaliana organisms and the statistical analysis shows that while (a) the number of domain types shared by k proteins exhibits a power-law distribution, (b) the number of proteins composed of k types of domains decays as an exponential distribution. The proposed mathematical model generates bipartite graphs and predicts the emergence of this mixing of (a) power-law and (b) exponential distributions. Our theoretical and computational results show that this model requires (1) growth process and (2) copy mechanism.
iBGP: A Bipartite Graph Propagation Approach for Mobile Advertising Fraud Detection
Directory of Open Access Journals (Sweden)
Jinlong Hu
2017-01-01
Full Text Available Online mobile advertising plays a vital financial role in supporting free mobile apps, but detecting malicious apps publishers who generate fraudulent actions on the advertisements hosted on their apps is difficult, since fraudulent traffic often mimics behaviors of legitimate users and evolves rapidly. In this paper, we propose a novel bipartite graph-based propagation approach, iBGP, for mobile apps advertising fraud detection in large advertising system. We exploit the characteristics of mobile advertising user’s behavior and identify two persistent patterns: power law distribution and pertinence and propose an automatic initial score learning algorithm to formulate both concepts to learn the initial scores of non-seed nodes. We propose a weighted graph propagation algorithm to propagate the scores of all nodes in the user-app bipartite graphs until convergence. To extend our approach for large-scale settings, we decompose the objective function of the initial score learning model into separate one-dimensional problems and parallelize the whole approach on an Apache Spark cluster. iBGP was applied on a large synthetic dataset and a large real-world mobile advertising dataset; experiment results demonstrate that iBGP significantly outperforms other popular graph-based propagation methods.
A mathematical model for generating bipartite graphs and its application to protein networks
Energy Technology Data Exchange (ETDEWEB)
Nacher, J C [Department of Complex Systems, Future University-Hakodate (Japan); Ochiai, T [Faculty of Engineering, Toyama Prefectural University (Japan); Hayashida, M; Akutsu, T [Bioinformatics Center, Institute for Chemical Research, Kyoto University (Japan)
2009-12-04
Complex systems arise in many different contexts from large communication systems and transportation infrastructures to molecular biology. Most of these systems can be organized into networks composed of nodes and interacting edges. Here, we present a theoretical model that constructs bipartite networks with the particular feature that the degree distribution can be tuned depending on the probability rate of fundamental processes. We then use this model to investigate protein-domain networks. A protein can be composed of up to hundreds of domains. Each domain represents a conserved sequence segment with specific functional tasks. We analyze the distribution of domains in Homo sapiens and Arabidopsis thaliana organisms and the statistical analysis shows that while (a) the number of domain types shared by k proteins exhibits a power-law distribution, (b) the number of proteins composed of k types of domains decays as an exponential distribution. The proposed mathematical model generates bipartite graphs and predicts the emergence of this mixing of (a) power-law and (b) exponential distributions. Our theoretical and computational results show that this model requires (1) growth process and (2) copy mechanism.
A mathematical model for generating bipartite graphs and its application to protein networks
International Nuclear Information System (INIS)
Nacher, J C; Ochiai, T; Hayashida, M; Akutsu, T
2009-01-01
Complex systems arise in many different contexts from large communication systems and transportation infrastructures to molecular biology. Most of these systems can be organized into networks composed of nodes and interacting edges. Here, we present a theoretical model that constructs bipartite networks with the particular feature that the degree distribution can be tuned depending on the probability rate of fundamental processes. We then use this model to investigate protein-domain networks. A protein can be composed of up to hundreds of domains. Each domain represents a conserved sequence segment with specific functional tasks. We analyze the distribution of domains in Homo sapiens and Arabidopsis thaliana organisms and the statistical analysis shows that while (a) the number of domain types shared by k proteins exhibits a power-law distribution, (b) the number of proteins composed of k types of domains decays as an exponential distribution. The proposed mathematical model generates bipartite graphs and predicts the emergence of this mixing of (a) power-law and (b) exponential distributions. Our theoretical and computational results show that this model requires (1) growth process and (2) copy mechanism.
Directory of Open Access Journals (Sweden)
Feilong Tang
2010-01-01
Full Text Available Mobile and wireless networks are the integrant infrastructure of mobile and pervasive computing that aims at providing transparent and preferred information and services for people anytime anywhere. In such environments, end-to-end network bandwidth is crucial to improve user's transparent experience when providing on-demand services such as mobile video playing. As a result, powerful computing power is required for networked nodes, especially for routers. General-purpose processors cannot meet such requirements due to their limited processing ability, and poor programmability and scalability. Intel's network processor IXP is specially designed for fast packet processing to achieve a broad bandwidth. IXP provides a large number of registers to reduce the number of memory accesses. Registers in an IXP are physically partitioned as two banks so that two source operands in an instruction have to come from the two banks respectively, which makes the IXP register allocation tricky and different from conventional ones. In this paper, we investigate an approach for efficiently generating balanced bipartite graph and register allocation algorithms for the dual-bank register allocation in IXPs. The paper presents a graph uniform 2-way partition algorithm (FPT, which provides an optimal solution to the graph partition, and a heuristic algorithm for generating balanced bipartite graph. Finally, we design a framework for IXP register allocation. Experimental results demonstrate the framework and the algorithms are efficient in register allocation for IXP network processors.
Bipartite field theories: from D-brane probes to scattering amplitudes
Franco, Sebastián
2012-11-01
We introduce and initiate the investigation of a general class of 4d, {N}=1 quiver gauge theories whose Lagrangian is defined by a bipartite graph on a Riemann surface, with or without boundaries. We refer to such class of theories as Bipartite Field Theories (BFTs). BFTs underlie a wide spectrum of interesting physical systems, including: D3-branes probing toric Calabi-Yau 3-folds, their mirror configurations of D6-branes, cluster integrable systems in (0 + 1) dimensions and leading singularities in scattering amplitudes for {N}=4 SYM. While our discussion is fully general, we focus on models that are relevant for scattering amplitudes. We investigate the BFT perspective on graph modifications, the emergence of Calabi-Yau manifolds (which arise as the master and moduli spaces of BFTs), the translation between square moves in the graph and Seiberg duality and the identification of dual theories by means of the underlying Calabi-Yaus, the phenomenon of loop reduction and the interpretation of the boundary operator for cells in the positive Grassmannian as higgsing in the BFT. We develop a technique based on generalized Kasteleyn matrices that permits an efficient determination of the Calabi-Yau geometries associated to arbitrary graphs. Our techniques allow us to go beyond the planar limit by both increasing the number of boundaries of the graphs and the genus of the underlying Riemann surface. Our investigation suggests a central role for Calabi-Yau manifolds in the context of leading singularities, whose full scope is yet to be uncovered.
Akibue, Seiseki; Kato, Go
2018-04-01
For distinguishing quantum states sampled from a fixed ensemble, the gap in bipartite and single-party distinguishability can be interpreted as a nonlocality of the ensemble. In this paper, we consider bipartite state discrimination in a composite system consisting of N subsystems, where each subsystem is shared between two parties and the state of each subsystem is randomly sampled from a particular ensemble comprising the Bell states. We show that the success probability of perfectly identifying the state converges to 1 as N →∞ if the entropy of the probability distribution associated with the ensemble is less than 1, even if the success probability is less than 1 for any finite N . In other words, the nonlocality of the N -fold ensemble asymptotically disappears if the probability distribution associated with each ensemble is concentrated. Furthermore, we show that the disappearance of the nonlocality can be regarded as a remarkable counterexample of a fundamental open question in theoretical computer science, called a parallel repetition conjecture of interactive games with two classically communicating players. Measurements for the discrimination task include a projective measurement of one party represented by stabilizer states, which enable the other party to perfectly distinguish states that are sampled with high probability.
Tang, Xiaolan; Hong, Donghui; Chen, Wenlong
2017-06-08
Existing studies on data acquisition in vehicular networks often take the mobile vehicular nodes as data carriers. However, their autonomous movements, limited resources and security risks impact the quality of services. In this article, we propose a data acquisition model using stable matching of bipartite graph in cooperative vehicle-infrastructure systems, namely, DAS. Contents are distributed to roadside units, while vehicular nodes support supplementary storage. The original distribution problem is formulated as a stable matching problem of bipartite graph, where the data and the storage cells compose two sides of vertices. Regarding the factors relevant with the access ratio and delay, the preference rankings for contents and roadside units are calculated, respectively. With a multi-replica preprocessing algorithm to handle the potential one-to-many mapping, the matching problem is addressed in polynomial time. In addition, vehicular nodes carry and forward assistant contents to deliver the failed packets because of bandwidth competition. Furthermore, an incentive strategy is put forward to boost the vehicle cooperation and to achieve a fair bandwidth allocation at roadside units. Experiments show that DAS achieves a high access ratio and a small storage cost with an acceptable delay.
Energy Technology Data Exchange (ETDEWEB)
Jin, G R; Wang, X W; Li, D; Lu, Y W, E-mail: grjin@bjtu.edu.c [Department of Physics, Beijing Jiaotong University, Beijing 100044 (China)
2010-02-28
We investigate spin dynamics of a two-component Bose-Einstein condensate with weak Josephson coupling. Analytical expressions of atom-number squeezing and bipartite entanglement are presented for atom-atom repulsive interactions. For attractive interactions, there is no number squeezing; however, the squeezing parameter is still useful to recognize the appearance of Schroedinger's cat state.
Directory of Open Access Journals (Sweden)
Elias Ilan
2008-08-01
Full Text Available Abstract Introduction The bipartite medial cuneiform is an uncommon developmental osseous variant in the midfoot. To our knowledge, Magnetic Resonance Imaging (MRI characteristics of a non-symptomatic bipartite medial cuneiform have not been described in the orthopaedic literature. It is important for orthopaedic foot and ankle surgeons, musculoskeletal radiologists, and for podiatrists to identify this osseous variant as it may be mistakenly diagnosed as a fracture or not recognized as a source of non-traumatic or traumatic foot pain, which may sometimes even require surgical treatment. Case presentations In this report, we describe the characteristics of three cases of bipartite medial cuneiform on Magnetic Resonance Imaging and contrast its appearance to that of a medial cuneiform fracture. Conclusion A bipartite medial cuneiform is a rare developmental anomaly of the midfoot and may be the source of midfoot pain. Knowledge about its characteristic appearance on magnetic resonance imaging is important because it is a potential pitfall in diagnosis of midfoot injuries.
Directory of Open Access Journals (Sweden)
Rafael Del Valle Vega
2015-10-01
Full Text Available The Brualdi-Shen Conjecture on Eulerian Bipartite Tournaments states that any such graph can be decomposed into oriented 4-cycles. In this article we prove the balanced case of the mentioned conjecture. We show that for any $2n\\times 2n$ bipartite graph $G=(U\\cup V, E$ in which each vertex has $n$-neighbors with biadjacency matrix $M$ (or its transpose there is a proper edge coloring of a column permutation of $M$ denoted $M^{\\sigma}$ in which the nonzero entries of each of the $first$ $n$ columns are colored with elements from the set $\\{n+1, n+2, \\ldots, 2n\\}$ and the nonzero entries of each of the $last$ $n$ columns are colored with elements from the set $\\{1, 2, \\ldots, n\\}$ and if the nonzero entry $M^{\\sigma}_{r,j}$ is colored with color $i$ then $M^{\\sigma}_{r,i}$ must be a zero entry. Such a coloring will induce an oriented 4-cycle decomposition of the bipartite tournament corresponding to $M$. We achieve this by constructing an euler tour on the bipartite tournament which avoids traversing both pair of edges of any two internally disjoint $s$-$t$ 2-paths consecutively, where $s$ and $t$ belong to $V$.
An SEU analysis approach for error propagation in digital VLSI CMOS ASICs
International Nuclear Information System (INIS)
Baze, M.P.; Bartholet, W.G.; Dao, T.A.; Buchner, S.
1995-01-01
A critical issue in the development of ASIC designs is the ability to achieve first pass fabrication success. Unsuccessful fabrication runs have serious impact on ASIC costs and schedules. The ability to predict an ASICs radiation response prior to fabrication is therefore a key issue when designing ASICs for military and aerospace systems. This paper describes an analysis approach for calculating static bit error propagation in synchronous VLSI CMOS circuits developed as an aid for predicting the SEU response of ASIC's. The technique is intended for eventual application as an ASIC development simulation tool which can be used by circuit design engineers for performance evaluation during the pre-fabrication design process in much the same way that logic and timing simulators are used
Operation of a Fast-RICH Prototype with VLSI readout electronics
Energy Technology Data Exchange (ETDEWEB)
Guyonnet, J.L. (CRN, IN2P3-CNRS / Louis Pasteur Univ., Strasbourg (France)); Arnold, R. (CRN, IN2P3-CNRS / Louis Pasteur Univ., Strasbourg (France)); Jobez, J.P. (Coll. de France, 75 - Paris (France)); Seguinot, J. (Coll. de France, 75 - Paris (France)); Ypsilantis, T. (Coll. de France, 75 - Paris (France)); Chesi, E. (CERN / ECP Div., Geneve (Switzerland)); Racz, A. (CERN / ECP Div., Geneve (Switzerland)); Egger, J. (Paul Scherrer Inst., Villigen (Switzerland)); Gabathuler, K. (Paul Scherrer Inst., Villigen (Switzerland)); Joram, C. (Karlsruhe Univ. (Germany)); Adachi, I. (KEK, Tsukuba (Japan)); Enomoto, R. (KEK, Tsukuba (Japan)); Sumiyoshi, T. (KEK, Tsukuba (Japan))
1994-04-01
We discuss the first test results, obtained with cosmic rays, of a full-scale Fast-RICH Prototype with proximity-focused 10 mm thick LiF (CaF[sub 2]) solid radiators, TEA as photosensor in CH[sub 4], and readout of 12 x 10[sup 3] cathode pads (5.334 x 6.604 mm[sup 2]) using dedicated VLSI electronics we have developed. The number of detected photoelectrons is 7.7 (6.9) for the CaF[sub 2] (LiF) radiator, very near to the expected values 6.4 (7.5) from Monte Carlo simulations. The single-photon Cherenkov angle resolution [sigma][sub [theta
An Efficient VLSI Architecture for Multi-Channel Spike Sorting Using a Generalized Hebbian Algorithm
Chen, Ying-Lun; Hwang, Wen-Jyi; Ke, Chi-En
2015-01-01
A novel VLSI architecture for multi-channel online spike sorting is presented in this paper. In the architecture, the spike detection is based on nonlinear energy operator (NEO), and the feature extraction is carried out by the generalized Hebbian algorithm (GHA). To lower the power consumption and area costs of the circuits, all of the channels share the same core for spike detection and feature extraction operations. Each channel has dedicated buffers for storing the detected spikes and the principal components of that channel. The proposed circuit also contains a clock gating system supplying the clock to only the buffers of channels currently using the computation core to further reduce the power consumption. The architecture has been implemented by an application-specific integrated circuit (ASIC) with 90-nm technology. Comparisons to the existing works show that the proposed architecture has lower power consumption and hardware area costs for real-time multi-channel spike detection and feature extraction. PMID:26287193
Analog VLSI Models of Range-Tuned Neurons in the Bat Echolocation System
Directory of Open Access Journals (Sweden)
Horiuchi Timothy
2003-01-01
Full Text Available Bat echolocation is a fascinating topic of research for both neuroscientists and engineers, due to the complex and extremely time-constrained nature of the problem and its potential for application to engineered systems. In the bat's brainstem and midbrain exist neural circuits that are sensitive to the specific difference in time between the outgoing sonar vocalization and the returning echo. While some of the details of the neural mechanisms are known to be species-specific, a basic model of reafference-triggered, postinhibitory rebound timing is reasonably well supported by available data. We have designed low-power, analog VLSI circuits to mimic this mechanism and have demonstrated range-dependent outputs for use in a real-time sonar system. These circuits are being used to implement range-dependent vocalization amplitude, vocalization rate, and closest target isolation.
Chen, Ying-Lun; Hwang, Wen-Jyi; Ke, Chi-En
2015-08-13
A novel VLSI architecture for multi-channel online spike sorting is presented in this paper. In the architecture, the spike detection is based on nonlinear energy operator (NEO), and the feature extraction is carried out by the generalized Hebbian algorithm (GHA). To lower the power consumption and area costs of the circuits, all of the channels share the same core for spike detection and feature extraction operations. Each channel has dedicated buffers for storing the detected spikes and the principal components of that channel. The proposed circuit also contains a clock gating system supplying the clock to only the buffers of channels currently using the computation core to further reduce the power consumption. The architecture has been implemented by an application-specific integrated circuit (ASIC) with 90-nm technology. Comparisons to the existing works show that the proposed architecture has lower power consumption and hardware area costs for real-time multi-channel spike detection and feature extraction.
International Nuclear Information System (INIS)
Bingefors, N.; Ekeloef, T.; Eriksson, C.; Paulsson, M.; Moerk, G.; Sjoelund, A.
1992-01-01
Samples of the preamplifier circuit, as well as of separate n and p channel transistors of the type contained in the circuit, were irradiated with gammas from a 60 Co source up to an integrated dose of 3 Mrad (30 kGy). The VLSI manufacturing technology used is the SOS4 process of ABB Hafo. A first analysis of the tests shows that the performance of the amplifier remains practically unaffected by the radiation for total doses up to 1 Mrad. At higher doses up to 3 Mrad the circuit amplification factor decreases by a factor between 4 and 5 whereas the output noise level remains unchanged. It is argued that it may be possible to reduce the decrease in amplification factor in future by optimizing the amplifier circuit design further. (orig.)
Real time track finding in a drift chamber with a VLSI neural network
International Nuclear Information System (INIS)
Lindsey, C.S.; Denby, B.; Haggerty, H.; Johns, K.
1992-01-01
In a test setup, a hardware neural network determined track parameters of charged particles traversing a drift chamber. Voltages proportional to the drift times in 6 cells of the 3-layer chamber were inputs to the Intel ETANN neural network chip which had been trained to give the slope and intercept of tracks. We compare network track parameters to those obtained from off-line track fits. To our knowledge this is the first on-line application of a VLSI neural network to a high energy physics detector. This test explored the potential of the chip and the practical problems of using it in a real world setting. We compare the chip performance to a neural network simulation on a conventional computer. We discuss possible applications of the chip in high energy physics detector triggers. (orig.)
Ant System-Corner Insertion Sequence: An Efficient VLSI Hard Module Placer
Directory of Open Access Journals (Sweden)
HOO, C.-S.
2013-02-01
Full Text Available Placement is important in VLSI physical design as it determines the time-to-market and chip's reliability. In this paper, a new floorplan representation which couples with Ant System, namely Corner Insertion Sequence (CIS is proposed. Though CIS's search complexity is smaller than the state-of-the-art representation Corner Sequence (CS, CIS adopts a preset boundary on the placement and hence, leading to search bound similar to CS. This enables the previous unutilized corner edges to become viable. Also, the redundancy of CS representation is eliminated in CIS leads to a lower search complexity of CIS. Experimental results on Microelectronics Center of North Carolina (MCNC hard block benchmark circuits show that the proposed algorithm performs comparably in terms of area yet at least two times faster than CS.
A parallel VLSI architecture for a digital filter of arbitrary length using Fermat number transforms
Truong, T. K.; Reed, I. S.; Yeh, C. S.; Shao, H. M.
1982-01-01
A parallel architecture for computation of the linear convolution of two sequences of arbitrary lengths using the Fermat number transform (FNT) is described. In particular a pipeline structure is designed to compute a 128-point FNT. In this FNT, only additions and bit rotations are required. A standard barrel shifter circuit is modified so that it performs the required bit rotation operation. The overlap-save method is generalized for the FNT to compute a linear convolution of arbitrary length. A parallel architecture is developed to realize this type of overlap-save method using one FNT and several inverse FNTs of 128 points. The generalized overlap save method alleviates the usual dynamic range limitation in FNTs of long transform lengths. Its architecture is regular, simple, and expandable, and therefore naturally suitable for VLSI implementation.
International Nuclear Information System (INIS)
Paraan, Francis N. C.; Korepin, Vladimir E.; Molina-Vilaplana, Javier; Bose, Sougato
2011-01-01
We quantify the extractable entanglement of excited states of a Lieb-Liniger gas that are obtained from coarse-grained measurements on the ground state in which the boson number in one of two complementary contiguous partitions of the gas is determined. Numerically exact results obtained from the coordinate Bethe ansatz show that the von Neumann entropy of the resulting bipartite pure state increases monotonically with the strength of repulsive interactions and saturates to the impenetrable-boson limiting value. We also present evidence indicating that the largest amount of entanglement can be extracted from the most probable projected state having half the number of bosons in a given partition. Our study points to a fundamental difference between the nature of the entanglement in free-bosonic and free-fermionic systems, with the entanglement in the former being zero after projection, while that in the latter (corresponding to the impenetrable-boson limit) being nonzero.
Energy Technology Data Exchange (ETDEWEB)
Tahira, Rabia; Ikram, Manzoor; Zubairy, M Suhail [Centre for Quantum Physics, COMSATS Institute of Information Technology, Islamabad (Pakistan); Bougouffa, Smail [Department of Physics, Faculty of Science, Taibah University, PO Box 30002, Madinah (Saudi Arabia)
2010-02-14
We investigate the phenomenon of sudden death of entanglement in a high-dimensional bipartite system subjected to dissipative environments with an arbitrary initial pure entangled state between two fields in the cavities. We find that in a vacuum reservoir, the presence of the state where one or more than one (two) photons in each cavity are present is a necessary condition for the sudden death of entanglement. Otherwise entanglement remains for infinite time and decays asymptotically with the decay of individual qubits. For pure two-qubit entangled states in a thermal environment, we observe that sudden death of entanglement always occurs. The sudden death time of the entangled states is related to the number of photons in the cavities, the temperature of the reservoir and the initial preparation of the entangled states.
International Nuclear Information System (INIS)
Tahira, Rabia; Ikram, Manzoor; Zubairy, M Suhail; Bougouffa, Smail
2010-01-01
We investigate the phenomenon of sudden death of entanglement in a high-dimensional bipartite system subjected to dissipative environments with an arbitrary initial pure entangled state between two fields in the cavities. We find that in a vacuum reservoir, the presence of the state where one or more than one (two) photons in each cavity are present is a necessary condition for the sudden death of entanglement. Otherwise entanglement remains for infinite time and decays asymptotically with the decay of individual qubits. For pure two-qubit entangled states in a thermal environment, we observe that sudden death of entanglement always occurs. The sudden death time of the entangled states is related to the number of photons in the cavities, the temperature of the reservoir and the initial preparation of the entangled states.
Statistical Mechanics of a Simplified Bipartite Matching Problem: An Analytical Treatment
Dell'Erba, Matías Germán
2012-03-01
We perform an analytical study of a simplified bipartite matching problem in which there exists a constant matching energy, and both heterosexual and homosexual pairings are allowed. We obtain the partition function in a closed analytical form and we calculate the corresponding thermodynamic functions of this model. We conclude that the model is favored at high temperatures, for which the probabilities of heterosexual and homosexual pairs tend to become equal. In the limits of low and high temperatures, the system is extensive, however this property is lost in the general case. There exists a relation between the matching energies for which the system becomes more stable under external (thermal) perturbations. As the difference of energies between the two possible matches increases the system becomes more ordered, while the maximum of entropy is achieved when these energies are equal. In this limit, there is a first order phase transition between two phases with constant entropy.
Neural Correlates of Phrase Rhythm: An EEG Study of Bipartite vs. Rondo Sonata Form
Directory of Open Access Journals (Sweden)
Antonio Fernández-Caballero
2017-04-01
Full Text Available This paper introduces the neural correlates of phrase rhythm. In short, phrase rhythm is the rhythmic aspect of phrase construction and the relationships between phrases. For the sake of establishing the neural correlates, a musical experiment has been designed to induce music-evoked stimuli related to phrase rhythm. Brain activity is monitored through electroencephalography (EEG by using a brain–computer interface. The power spectral value of each EEG channel is estimated to obtain how power variance distributes as a function of frequency. Our experiment shows statistical differences in theta and alpha bands in the phrase rhythm variations of two classical sonatas, one in bipartite form and the other in rondo form.
Modeling the spread of vector-borne diseases on bipartite networks.
Directory of Open Access Journals (Sweden)
Donal Bisanzio
Full Text Available BACKGROUND: Vector-borne diseases for which transmission occurs exclusively between vectors and hosts can be modeled as spreading on a bipartite network. METHODOLOGY/PRINCIPAL FINDINGS: In such models the spreading of the disease strongly depends on the degree distribution of the two classes of nodes. It is sufficient for one of the classes to have a scale-free degree distribution with a slow enough decay for the network to have asymptotically vanishing epidemic threshold. Data on the distribution of Ixodes ricinus ticks on mice and lizards from two independent studies are well described by a scale-free distribution compatible with an asymptotically vanishing epidemic threshold. The commonly used negative binomial, instead, cannot describe the right tail of the empirical distribution. CONCLUSIONS/SIGNIFICANCE: The extreme aggregation of vectors on hosts, described by the power-law decay of the degree distribution, makes the epidemic threshold decrease with the size of the network and vanish asymptotically.
Energy Technology Data Exchange (ETDEWEB)
Han, Jia-Xing; Hu, Yuan; Jin, Yu [Key Laboratory of Micro-Nano Measurement-Manipulation and Physics (Ministry of Education), School of Physics and Nuclear Energy Engineering, Beihang University, Xueyuan Road No. 37, Beijing 100191 (China); Zhang, Guo-Feng, E-mail: gf1978zhang@buaa.edu.cn [Key Laboratory of Micro-Nano Measurement-Manipulation and Physics (Ministry of Education), School of Physics and Nuclear Energy Engineering, Beihang University, Xueyuan Road No. 37, Beijing 100191 (China); State Key Laboratory of Software Development Environment, Beihang University, Xueyuan Road No. 37, Beijing 100191 (China); State Key Laboratory of Low-Dimensional Quantum Physics, Tsinghua University, Beijing 100084 (China); Key Laboratory of Quantum Information, University of Science and Technology of China, Chinese Academy of Sciences, Hefei 230026 (China)
2016-04-07
An array of ultracold polar molecules trapped in an external electric field is regarded as a promising carrier of quantum information. Under the action of this field, molecules are compelled to undergo pendular oscillations by the Stark effect. Particular attention has been paid to the influence of intrinsic decoherence on the model of linear polar molecular pendular states, thereby we evaluate the tripartite entanglement with negativity, as well as fidelity of bipartite quantum systems for input and output signals using electric dipole moments of polar molecules as qubits. According to this study, we consider three typical initial states for both systems, respectively, and investigate the temporal evolution with variable values of the external field intensity, the intrinsic decoherence factor, and the dipole-dipole interaction. Thus, we demonstrate the sound selection of these three main parameters to obtain the best entanglement degree and fidelity.
Response to defects in multipartite and bipartite entanglement of isotropic quantum spin networks
Roy, Sudipto Singha; Dhar, Himadri Shekhar; Rakshit, Debraj; SenDe, Aditi; Sen, Ujjwal
2018-05-01
Quantum networks are an integral component in performing efficient computation and communication tasks that are not accessible using classical systems. A key aspect in designing an effective and scalable quantum network is generating entanglement between its nodes, which is robust against defects in the network. We consider an isotropic quantum network of spin-1/2 particles with a finite fraction of defects, where the corresponding wave function of the network is rotationally invariant under the action of local unitaries. By using quantum information-theoretic concepts like strong subadditivity of von Neumann entropy and approximate quantum telecloning, we prove analytically that in the presence of defects, caused by loss of a finite fraction of spins, the network, composed of a fixed numbers of lattice sites, sustains genuine multisite entanglement and at the same time may exhibit finite moderate-range bipartite entanglement, in contrast to the network with no defects.
Bipartite Networks of Universities and Companies: Recruiting New Graduates in Japan
Takahashi, Katsuhide; Kobayashi, Yuh; Kondo, Yohei; Takayasu, Hideki; Takayasu, Misako
We investigated the bipartite Universities-Companies Network in Japan in terms of companies' recruitment of new graduates. In Japan, graduates of universities are typically hired by companies upon their graduation. To examine socially accepted ideas about this recruiting system, we combined different types of data on education, recruitment and corporate finance. The hypothesis that graduates from prestigious universities have the advantage of entering excellent companies was verified by examining the determinants of ratio of graduates entering top-ranked companies. Through hierarchical clustering, we obtained classification trees and observed the stability of their structure, as well as interesting changes corresponding to the business climate. We also calculated weighted HITS hub and authority values for each university and company and identified the links between the results of this analysis and those above. Finally, analysis of all the data indicated that excellent companies recruiting many graduates from prestigious universities do not necessarily show superb performance in profit-making and growth.
Zounia, M.; Shamirzaie, M.; Ashouri, A.
2017-09-01
In this paper quantum teleportation of an unknown quantum state via noisy maximally bipartite (Bell) and maximally tripartite (Greenberger-Horne-Zeilinger (GHZ)) entangled states are investigated. We suppose that one of the observers who would receive the sent state accelerates uniformly with respect to the sender. The interactions of the quantum system with its environment during the teleportation process impose noises. These (unital and nonunital) noises are: phase damping, phase flip, amplitude damping and bit flip. In expressing the modes of the Dirac field used as qubits, in the accelerating frame, the so-called single mode approximation is not imposed. We calculate the fidelities of teleportation, and discuss their behaviors using suitable plots. The effects of noise, acceleration and going beyond the single mode approximation are discussed. Although the Bell states bring higher fidelities than GHZ states, the global behaviors of the two quantum systems with respect to some noise types, and therefore their fidelities, are different.
A novel configurable VLSI architecture design of window-based image processing method
Zhao, Hui; Sang, Hongshi; Shen, Xubang
2018-03-01
Most window-based image processing architecture can only achieve a certain kind of specific algorithms, such as 2D convolution, and therefore lack the flexibility and breadth of application. In addition, improper handling of the image boundary can cause loss of accuracy, or consume more logic resources. For the above problems, this paper proposes a new VLSI architecture of window-based image processing operations, which is configurable and based on consideration of the image boundary. An efficient technique is explored to manage the image borders by overlapping and flushing phases at the end of row and the end of frame, which does not produce new delay and reduce the overhead in real-time applications. Maximize the reuse of the on-chip memory data, in order to reduce the hardware complexity and external bandwidth requirements. To perform different scalar function and reduction function operations in pipeline, this can support a variety of applications of window-based image processing. Compared with the performance of other reported structures, the performance of the new structure has some similarities to some of the structures, but also superior to some other structures. Especially when compared with a systolic array processor CWP, this structure at the same frequency of approximately 12.9% of the speed increases. The proposed parallel VLSI architecture was implemented with SIMC 0.18-μm CMOS technology, and the maximum clock frequency, power consumption, and area are 125Mhz, 57mW, 104.8K Gates, respectively, furthermore the processing time is independent of the different window-based algorithms mapped to the structure
1984-04-01
Interpretation of IMMEDIATE fields of instructions (except ldhi ): W (c) (d) (e) sssssssssssss s imml9 sssssssssssssssssss...s imml3 Destination REGISTER of a LDHI instruction: imml9 0000000000000 Data in REGISTERS when operated upon: 32-bit quantity...Oll x l OOOO OOOl calli sll OOlO getpsw sra xxzOOll getlpc srl OlOO putpsw ldhi OlOl and zzzOllO or ldxw stxw Olll xor
VLSI Implementation of a Fixed-Complexity Soft-Output MIMO Detector for High-Speed Wireless
Directory of Open Access Journals (Sweden)
Di Wu
2010-01-01
Full Text Available This paper presents a low-complexity MIMO symbol detector with close-Maximum a posteriori performance for the emerging multiantenna enhanced high-speed wireless communications. The VLSI implementation is based on a novel MIMO detection algorithm called Modified Fixed-Complexity Soft-Output (MFCSO detection, which achieves a good trade-off between performance and implementation cost compared to the referenced prior art. By including a microcode-controlled channel preprocessing unit and a pipelined detection unit, it is flexible enough to cover several different standards and transmission schemes. The flexibility allows adaptive detection to minimize power consumption without degradation in throughput. The VLSI implementation of the detector is presented to show that real-time MIMO symbol detection of 20 MHz bandwidth 3GPP LTE and 10 MHz WiMAX downlink physical channel is achievable at reasonable silicon cost.
Shyu, H. C.; Reed, I. S.; Truong, T. K.; Hsu, I. S.; Chang, J. J.
1987-01-01
A quadratic-polynomial Fermat residue number system (QFNS) has been used to compute complex integer multiplications. The advantage of such a QFNS is that a complex integer multiplication requires only two integer multiplications. In this article, a new type Fermat number multiplier is developed which eliminates the initialization condition of the previous method. It is shown that the new complex multiplier can be implemented on a single VLSI chip. Such a chip is designed and fabricated in CMOS-Pw technology.
Directory of Open Access Journals (Sweden)
Fazal NOORBASHA
2012-08-01
Full Text Available In this present study includes the Very Large Scale Integration (VLSI system implementation of 200MHz, 8-bit, 90nm Complementary Metal Oxide Semiconductor (CMOS Arithmetic and Logic Unit (ALU processor control with logic gate design style and 0.12µm six metal 90nm CMOS fabrication technology. The system blocks and the behaviour are defined and the logical design is implemented in gate level in the design phase. Then, the logic circuits are simulated and the subunits are converted in to 90nm CMOS layout. Finally, in order to construct the VLSI system these units are placed in the floor plan and simulated with analog and digital, logic and switch level simulators. The results of the simulations indicates that the VLSI system can control different instructions which can divided into sub groups: transfer instructions, arithmetic and logic instructions, rotate and shift instructions, branch instructions, input/output instructions, control instructions. The data bus of the system is 16-bit. It runs at 200MHz, and operating power is 1.2V. In this paper, the parametric analysis of the system, the design steps and obtained results are explained.
Dynamics of bloggers’ communities: Bipartite networks from empirical data and agent-based modeling
Mitrović, Marija; Tadić, Bosiljka
2012-11-01
We present an analysis of the empirical data and the agent-based modeling of the emotional behavior of users on the Web portals where the user interaction is mediated by posted comments, like Blogs and Diggs. We consider the dataset of discussion-driven popular Diggs, in which all comments are screened by machine-learning emotion detection in the text, to determine positive and negative valence (attractiveness and aversiveness) of each comment. By mapping the data onto a suitable bipartite network, we perform an analysis of the network topology and the related time-series of the emotional comments. The agent-based model is then introduced to simulate the dynamics and to capture the emergence of the emotional behaviors and communities. The agents are linked to posts on a bipartite network, whose structure evolves through their actions on the posts. The emotional states (arousal and valence) of each agent fluctuate in time, subject to the current contents of the posts to which the agent is exposed. By an agent’s action on a post its current emotions are transferred to the post. The model rules and the key parameters are inferred from the considered empirical data to ensure their realistic values and mutual consistency. The model assumes that the emotional arousal over posts drives the agent’s action. The simulations are preformed for the case of constant flux of agents and the results are analyzed in full analogy with the empirical data. The main conclusions are that the emotion-driven dynamics leads to long-range temporal correlations and emergent networks with community structure, that are comparable with the ones in the empirical system of popular posts. In view of pure emotion-driven agents actions, this type of comparisons provide a quantitative measure for the role of emotions in the dynamics on real blogs. Furthermore, the model reveals the underlying mechanisms which relate the post popularity with the emotion dynamics and the prevalence of negative
dell'Anno, Fabio; de Siena, Silvio; Illuminati, Fabrizio
2004-03-01
Extending the scheme developed for a single mode of the electromagnetic field in the preceding paper [F. Dell’Anno, S. De Siena, and F. Illuminati, Phys. Rev. A 69, 033812 (2004)], we introduce two-mode nonlinear canonical transformations depending on two heterodyne mixing angles. They are defined in terms of Hermitian nonlinear functions that realize heterodyne superpositions of conjugate quadratures of bipartite systems. The canonical transformations diagonalize a class of Hamiltonians describing nondegenerate and degenerate multiphoton processes. We determine the coherent states associated with the canonical transformations, which generalize the nondegenerate two-photon squeezed states. Such heterodyne multiphoton squeezed states are defined as the simultaneous eigenstates of the transformed, coupled annihilation operators. They are generated by nonlinear unitary evolutions acting on two-mode squeezed states. They are non-Gaussian, highly nonclassical, entangled states. For a quadratic nonlinearity the heterodyne multiphoton squeezed states define two-mode cubic phase states. The statistical properties of these states can be widely adjusted by tuning the heterodyne mixing angles, the phases of the nonlinear couplings, as well as the strength of the nonlinearity. For quadratic nonlinearity, we study the higher-order contributions to the susceptibility in nonlinear media and we suggest possible experimental realizations of multiphoton conversion processes generating the cubic-phase heterodyne squeezed states.
Directory of Open Access Journals (Sweden)
Sagar Indurkhya
Full Text Available ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1 a small number of reactions tend to occur a disproportionately large percentage of the time, and (2 a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models.
Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting
International Nuclear Information System (INIS)
Azad, Ariful; Buluc, Aydn; Pothen, Alex
2016-01-01
It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.
Indurkhya, Sagar; Beal, Jacob
2010-01-01
ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1) a small number of reactions tend to occur a disproportionately large percentage of the time, and (2) a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models. PMID:20066048
Energy Technology Data Exchange (ETDEWEB)
Hooper, Sean D.; Anderson, Iain J; Pati, Amrita; Dalevi, Daniel; Mavromatis, Konstantinos; Kyrpides, Nikos C
2009-01-01
In order to simplify and meaningfully categorize large sets of protein sequence data, it is commonplace to cluster proteins based on the similarity of those sequences. However, it quickly becomes clear that the sequence flexibility allowed a given protein varies significantly among different protein families. The degree to which sequences are conserved not only differs for each protein family, but also is affected by the phylogenetic divergence of the source organisms. Clustering techniques that use similarity thresholds for protein families do not always allow for these variations and thus cannot be confidently used for applications such as automated annotation and phylogenetic profiling. In this work, we applied a spectral bipartitioning technique to all proteins from 53 archaeal genomes. Comparisons between different taxonomic levels allowed us to study the effects of phylogenetic distances on cluster structure. Likewise, by associating functional annotations and phenotypic metadata with each protein, we could compare our protein similarity clusters with both protein function and associated phenotype. Our clusters can be analyzed graphically and interactively online.
Bank-firm credit network in Japan: an analysis of a bipartite network.
Marotta, Luca; Miccichè, Salvatore; Fujiwara, Yoshi; Iyetomi, Hiroshi; Aoyama, Hideaki; Gallegati, Mauro; Mantegna, Rosario N
2015-01-01
We investigate the networked nature of the Japanese credit market. Our investigation is performed with tools of network science. In our investigation we perform community detection with an algorithm which is identifying communities composed of both banks and firms. We show that the communities obtained by directly working on the bipartite network carry information about the networked nature of the Japanese credit market. Our analysis is performed for each calendar year during the time period from 1980 to 2011. To investigate the time evolution of the networked structure of the credit market we introduce a new statistical method to track the time evolution of detected communities. We then characterize the time evolution of communities by detecting for each time evolving set of communities the over-expression of attributes of firms and banks. Specifically, we consider as attributes the economic sector and the geographical location of firms and the type of banks. In our 32-year-long analysis we detect a persistence of the over-expression of attributes of communities of banks and firms together with a slow dynamic of changes from some specific attributes to new ones. Our empirical observations show that the credit market in Japan is a networked market where the type of banks, geographical location of firms and banks, and economic sector of the firm play a role in shaping the credit relationships between banks and firms.
International Nuclear Information System (INIS)
Dell'Anno, Fabio; De Siena, Silvio; Illuminati, Fabrizio
2004-01-01
Extending the scheme developed for a single mode of the electromagnetic field in the preceding paper [F. Dell'Anno, S. De Siena, and F. Illuminati, Phys. Rev. A 69, 033812 (2004)], we introduce two-mode nonlinear canonical transformations depending on two heterodyne mixing angles. They are defined in terms of Hermitian nonlinear functions that realize heterodyne superpositions of conjugate quadratures of bipartite systems. The canonical transformations diagonalize a class of Hamiltonians describing nondegenerate and degenerate multiphoton processes. We determine the coherent states associated with the canonical transformations, which generalize the nondegenerate two-photon squeezed states. Such heterodyne multiphoton squeezed states are defined as the simultaneous eigenstates of the transformed, coupled annihilation operators. They are generated by nonlinear unitary evolutions acting on two-mode squeezed states. They are non-Gaussian, highly nonclassical, entangled states. For a quadratic nonlinearity the heterodyne multiphoton squeezed states define two-mode cubic phase states. The statistical properties of these states can be widely adjusted by tuning the heterodyne mixing angles, the phases of the nonlinear couplings, as well as the strength of the nonlinearity. For quadratic nonlinearity, we study the higher-order contributions to the susceptibility in nonlinear media and we suggest possible experimental realizations of multiphoton conversion processes generating the cubic-phase heterodyne squeezed states
Directory of Open Access Journals (Sweden)
Vandamme Peter
2003-03-01
Full Text Available Abstract Background Ralstonia solanacearum is an important plant pathogen. The genome of R. solananearum GMI1000 is organised into two replicons (a 3.7-Mb chromosome and a 2.1-Mb megaplasmid and this bipartite genome structure is characteristic for most R. solanacearum strains. To determine whether the megaplasmid was acquired via recent horizontal gene transfer or is part of an ancestral single chromosome, we compared the abundance, distribution and compositon of simple sequence repeats (SSRs between both replicons and also compared the respective compositional biases. Results Our data show that both replicons are very similar in respect to distribution and composition of SSRs and presence of compositional biases. Minor variations in SSR and compositional biases observed may be attributable to minor differences in gene expression and regulation of gene expression or can be attributed to the small sample numbers observed. Conclusions The observed similarities indicate that both replicons have shared a similar evolutionary history and thus suggest that the megaplasmid was not recently acquired from other organisms by lateral gene transfer but is a part of an ancestral R. solanacearum chromosome.
Bank-Firm Credit Network in Japan: An Analysis of a Bipartite Network
Marotta, Luca; Miccichè, Salvatore; Fujiwara, Yoshi; Iyetomi, Hiroshi; Aoyama, Hideaki; Gallegati, Mauro; Mantegna, Rosario N.
2015-01-01
We investigate the networked nature of the Japanese credit market. Our investigation is performed with tools of network science. In our investigation we perform community detection with an algorithm which is identifying communities composed of both banks and firms. We show that the communities obtained by directly working on the bipartite network carry information about the networked nature of the Japanese credit market. Our analysis is performed for each calendar year during the time period from 1980 to 2011. To investigate the time evolution of the networked structure of the credit market we introduce a new statistical method to track the time evolution of detected communities. We then characterize the time evolution of communities by detecting for each time evolving set of communities the over-expression of attributes of firms and banks. Specifically, we consider as attributes the economic sector and the geographical location of firms and the type of banks. In our 32-year-long analysis we detect a persistence of the over-expression of attributes of communities of banks and firms together with a slow dynamic of changes from some specific attributes to new ones. Our empirical observations show that the credit market in Japan is a networked market where the type of banks, geographical location of firms and banks, and economic sector of the firm play a role in shaping the credit relationships between banks and firms. PMID:25933413
Indurkhya, Sagar; Beal, Jacob
2010-01-06
ODE simulations of chemical systems perform poorly when some of the species have extremely low concentrations. Stochastic simulation methods, which can handle this case, have been impractical for large systems due to computational complexity. We observe, however, that when modeling complex biological systems: (1) a small number of reactions tend to occur a disproportionately large percentage of the time, and (2) a small number of species tend to participate in a disproportionately large percentage of reactions. We exploit these properties in LOLCAT Method, a new implementation of the Gillespie Algorithm. First, factoring reaction propensities allows many propensities dependent on a single species to be updated in a single operation. Second, representing dependencies between reactions with a bipartite graph of reactions and species requires only storage for reactions, rather than the required for a graph that includes only reactions. Together, these improvements allow our implementation of LOLCAT Method to execute orders of magnitude faster than currently existing Gillespie Algorithm variants when simulating several yeast MAPK cascade models.
An Extended HITS Algorithm on Bipartite Network for Features Extraction of Online Customer Reviews
Directory of Open Access Journals (Sweden)
Chen Liu
2018-05-01
Full Text Available How to acquire useful information intelligently in the age of information explosion has become an important issue. In this context, sentiment analysis emerges with the growth of the need of information extraction. One of the most important tasks of sentiment analysis is feature extraction of entities in consumer reviews. This paper first constitutes a directed bipartite feature-sentiment relation network with a set of candidate features-sentiment pairs that is extracted by dependency syntax analysis from consumer reviews. Then, a novel method called MHITS which combines PMI with weighted HITS algorithm is proposed to rank these candidate product features to find out real product features. Empirical experiments indicate the effectiveness of our approach across different kinds and various data sizes of product. In addition, the effect of the proposed algorithm is not the same for the corpus with different proportions of the word pair that includes the “bad”, “good”, “poor”, “pretty good”, “not bad” these general collocation words.
An Efficient VLSI Architecture for Multi-Channel Spike Sorting Using a Generalized Hebbian Algorithm
Directory of Open Access Journals (Sweden)
Ying-Lun Chen
2015-08-01
Full Text Available A novel VLSI architecture for multi-channel online spike sorting is presented in this paper. In the architecture, the spike detection is based on nonlinear energy operator (NEO, and the feature extraction is carried out by the generalized Hebbian algorithm (GHA. To lower the power consumption and area costs of the circuits, all of the channels share the same core for spike detection and feature extraction operations. Each channel has dedicated buffers for storing the detected spikes and the principal components of that channel. The proposed circuit also contains a clock gating system supplying the clock to only the buffers of channels currently using the computation core to further reduce the power consumption. The architecture has been implemented by an application-specific integrated circuit (ASIC with 90-nm technology. Comparisons to the existing works show that the proposed architecture has lower power consumption and hardware area costs for real-time multi-channel spike detection and feature extraction.
A Low Cost VLSI Architecture for Spike Sorting Based on Feature Extraction with Peak Search
Directory of Open Access Journals (Sweden)
Yuan-Jyun Chang
2016-12-01
Full Text Available The goal of this paper is to present a novel VLSI architecture for spike sorting with high classification accuracy, low area costs and low power consumption. A novel feature extraction algorithm with low computational complexities is proposed for the design of the architecture. In the feature extraction algorithm, a spike is separated into two portions based on its peak value. The area of each portion is then used as a feature. The algorithm is simple to implement and less susceptible to noise interference. Based on the algorithm, a novel architecture capable of identifying peak values and computing spike areas concurrently is proposed. To further accelerate the computation, a spike can be divided into a number of segments for the local feature computation. The local features are subsequently merged with the global ones by a simple hardware circuit. The architecture can also be easily operated in conjunction with the circuits for commonly-used spike detection algorithms, such as the Non-linear Energy Operator (NEO. The architecture has been implemented by an Application-Specific Integrated Circuit (ASIC with 90-nm technology. Comparisons to the existing works show that the proposed architecture is well suited for real-time multi-channel spike detection and feature extraction requiring low hardware area costs, low power consumption and high classification accuracy.
Motion-sensor fusion-based gesture recognition and its VLSI architecture design for mobile devices
Zhu, Wenping; Liu, Leibo; Yin, Shouyi; Hu, Siqi; Tang, Eugene Y.; Wei, Shaojun
2014-05-01
With the rapid proliferation of smartphones and tablets, various embedded sensors are incorporated into these platforms to enable multimodal human-computer interfaces. Gesture recognition, as an intuitive interaction approach, has been extensively explored in the mobile computing community. However, most gesture recognition implementations by now are all user-dependent and only rely on accelerometer. In order to achieve competitive accuracy, users are required to hold the devices in predefined manner during the operation. In this paper, a high-accuracy human gesture recognition system is proposed based on multiple motion sensor fusion. Furthermore, to reduce the energy overhead resulted from frequent sensor sampling and data processing, a high energy-efficient VLSI architecture implemented on a Xilinx Virtex-5 FPGA board is also proposed. Compared with the pure software implementation, approximately 45 times speed-up is achieved while operating at 20 MHz. The experiments show that the average accuracy for 10 gestures achieves 93.98% for user-independent case and 96.14% for user-dependent case when subjects hold the device randomly during completing the specified gestures. Although a few percent lower than the conventional best result, it still provides competitive accuracy acceptable for practical usage. Most importantly, the proposed system allows users to hold the device randomly during operating the predefined gestures, which substantially enhances the user experience.
Prototype architecture for a VLSI level zero processing system. [Space Station Freedom
Shi, Jianfei; Grebowsky, Gerald J.; Horner, Ward P.; Chesney, James R.
1989-01-01
The prototype architecture and implementation of a high-speed level zero processing (LZP) system are discussed. Due to the new processing algorithm and VLSI technology, the prototype LZP system features compact size, low cost, high processing throughput, and easy maintainability and increased reliability. Though extensive control functions have been done by hardware, the programmability of processing tasks makes it possible to adapt the system to different data formats and processing requirements. It is noted that the LZP system can handle up to 8 virtual channels and 24 sources with combined data volume of 15 Gbytes per orbit. For greater demands, multiple LZP systems can be configured in parallel, each called a processing channel and assigned a subset of virtual channels. The telemetry data stream will be steered into different processing channels in accordance with their virtual channel IDs. This super system can cope with a virtually unlimited number of virtual channels and sources. In the near future, it is expected that new disk farms with data rate exceeding 150 Mbps will be available from commercial vendors due to the advance in disk drive technology.
VLSI design of an RSA encryption/decryption chip using systolic array based architecture
Sun, Chi-Chia; Lin, Bor-Shing; Jan, Gene Eu; Lin, Jheng-Yi
2016-09-01
This article presents the VLSI design of a configurable RSA public key cryptosystem supporting the 512-bit, 1024-bit and 2048-bit based on Montgomery algorithm achieving comparable clock cycles of current relevant works but with smaller die size. We use binary method for the modular exponentiation and adopt Montgomery algorithm for the modular multiplication to simplify computational complexity, which, together with the systolic array concept for electric circuit designs effectively, lower the die size. The main architecture of the chip consists of four functional blocks, namely input/output modules, registers module, arithmetic module and control module. We applied the concept of systolic array to design the RSA encryption/decryption chip by using VHDL hardware language and verified using the TSMC/CIC 0.35 m 1P4 M technology. The die area of the 2048-bit RSA chip without the DFT is 3.9 × 3.9 mm2 (4.58 × 4.58 mm2 with DFT). Its average baud rate can reach 10.84 kbps under a 100 MHz clock.
A Low Cost VLSI Architecture for Spike Sorting Based on Feature Extraction with Peak Search.
Chang, Yuan-Jyun; Hwang, Wen-Jyi; Chen, Chih-Chang
2016-12-07
The goal of this paper is to present a novel VLSI architecture for spike sorting with high classification accuracy, low area costs and low power consumption. A novel feature extraction algorithm with low computational complexities is proposed for the design of the architecture. In the feature extraction algorithm, a spike is separated into two portions based on its peak value. The area of each portion is then used as a feature. The algorithm is simple to implement and less susceptible to noise interference. Based on the algorithm, a novel architecture capable of identifying peak values and computing spike areas concurrently is proposed. To further accelerate the computation, a spike can be divided into a number of segments for the local feature computation. The local features are subsequently merged with the global ones by a simple hardware circuit. The architecture can also be easily operated in conjunction with the circuits for commonly-used spike detection algorithms, such as the Non-linear Energy Operator (NEO). The architecture has been implemented by an Application-Specific Integrated Circuit (ASIC) with 90-nm technology. Comparisons to the existing works show that the proposed architecture is well suited for real-time multi-channel spike detection and feature extraction requiring low hardware area costs, low power consumption and high classification accuracy.
Emergent auditory feature tuning in a real-time neuromorphic VLSI system
Directory of Open Access Journals (Sweden)
Sadique eSheik
2012-02-01
Full Text Available Many sounds of ecological importance, such as communication calls, are characterised by time-varying spectra. However, most neuromorphic auditory models to date have focused on distinguishing mainly static patterns, under the assumption that dynamic patterns can be learned as sequences of static ones. In contrast, the emergence of dynamic feature sensitivity through exposure to formative stimuli has been recently modeled in a network of spiking neurons based on the thalamocortical architecture. The proposed network models the effect of lateral and recurrent connections between cortical layers, distance-dependent axonal transmission delays, and learning in the form of Spike Timing Dependent Plasticity (STDP, which effects stimulus-driven changes in the pattern of network connectivity. In this paper we demonstrate how these principles can be efficiently implemented in neuromorphic hardware. In doing so we address two principle problems in the design of neuromorphic systems: real-time event-based asynchronous communication in multi-chip systems, and the realization in hybrid analog/digital VLSI technology of neural computational principles that we propose underlie plasticity in neural processing of dynamic stimuli. The result is a hardware neural network that learns in real-time and shows preferential responses, after exposure, to stimuli exhibiting particular spectrotemporal patterns. The availability of hardware on which the model can be implemented, makes this a significant step towards the development of adaptive, neurobiologically plausible, spike-based, artificial sensory systems.
An Analogue VLSI Implementation of the Meddis Inner Hair Cell Model
McEwan, Alistair; van Schaik, André
2003-12-01
The Meddis inner hair cell model is a widely accepted, but computationally intensive computer model of mammalian inner hair cell function. We have produced an analogue VLSI implementation of this model that operates in real time in the current domain by using translinear and log-domain circuits. The circuit has been fabricated on a chip and tested against the Meddis model for (a) rate level functions for onset and steady-state response, (b) recovery after masking, (c) additivity, (d) two-component adaptation, (e) phase locking, (f) recovery of spontaneous activity, and (g) computational efficiency. The advantage of this circuit, over other electronic inner hair cell models, is its nearly exact implementation of the Meddis model which can be tuned to behave similarly to the biological inner hair cell. This has important implications on our ability to simulate the auditory system in real time. Furthermore, the technique of mapping a mathematical model of first-order differential equations to a circuit of log-domain filters allows us to implement real-time neuromorphic signal processors for a host of models using the same approach.
Robust working memory in an asynchronously spiking neural network realized in neuromorphic VLSI
Directory of Open Access Journals (Sweden)
Massimiliano eGiulioni
2012-02-01
Full Text Available We demonstrate bistable attractor dynamics in a spiking neural network implemented with neuromorphic VLSI hardware. The on-chip network consists of three interacting populations (two excitatory, one inhibitory of integrate-and-fire (LIF neurons. One excitatory population is distinguished by strong synaptic self-excitation, which sustains meta-stable states of ‘high’ and ‘low’-firing activity. Depending on the overall excitability, transitions to the ‘high’ state may be evoked by external stimulation, or may occur spontaneously due to random activity fluctuations. In the former case, the ‘high’ state retains a working memory of a stimulus until well after its release. In the latter case, ‘high’ states remain stable for seconds, three orders of magnitude longer than the largest time-scale implemented in the circuitry. Evoked and spontaneous transitions form a continuum and may exhibit a wide range of latencies, depending on the strength of external stimulation and of recurrent synaptic excitation. In addition, we investigated corrupted ‘high’ states comprising neurons of both excitatory populations. Within a basin of attraction, the network dynamics corrects such states and re-establishes the prototypical ‘high’ state. We conclude that, with effective theoretical guidance, full-fledged attractor dynamics can be realized with comparatively small populations of neuromorphic hardware neurons.
Robust Working Memory in an Asynchronously Spiking Neural Network Realized with Neuromorphic VLSI.
Giulioni, Massimiliano; Camilleri, Patrick; Mattia, Maurizio; Dante, Vittorio; Braun, Jochen; Del Giudice, Paolo
2011-01-01
We demonstrate bistable attractor dynamics in a spiking neural network implemented with neuromorphic VLSI hardware. The on-chip network consists of three interacting populations (two excitatory, one inhibitory) of leaky integrate-and-fire (LIF) neurons. One excitatory population is distinguished by strong synaptic self-excitation, which sustains meta-stable states of "high" and "low"-firing activity. Depending on the overall excitability, transitions to the "high" state may be evoked by external stimulation, or may occur spontaneously due to random activity fluctuations. In the former case, the "high" state retains a "working memory" of a stimulus until well after its release. In the latter case, "high" states remain stable for seconds, three orders of magnitude longer than the largest time-scale implemented in the circuitry. Evoked and spontaneous transitions form a continuum and may exhibit a wide range of latencies, depending on the strength of external stimulation and of recurrent synaptic excitation. In addition, we investigated "corrupted" "high" states comprising neurons of both excitatory populations. Within a "basin of attraction," the network dynamics "corrects" such states and re-establishes the prototypical "high" state. We conclude that, with effective theoretical guidance, full-fledged attractor dynamics can be realized with comparatively small populations of neuromorphic hardware neurons.
Biophysical Neural Spiking, Bursting, and Excitability Dynamics in Reconfigurable Analog VLSI.
Yu, T; Sejnowski, T J; Cauwenberghs, G
2011-10-01
We study a range of neural dynamics under variations in biophysical parameters underlying extended Morris-Lecar and Hodgkin-Huxley models in three gating variables. The extended models are implemented in NeuroDyn, a four neuron, twelve synapse continuous-time analog VLSI programmable neural emulation platform with generalized channel kinetics and biophysical membrane dynamics. The dynamics exhibit a wide range of time scales extending beyond 100 ms neglected in typical silicon models of tonic spiking neurons. Circuit simulations and measurements show transition from tonic spiking to tonic bursting dynamics through variation of a single conductance parameter governing calcium recovery. We similarly demonstrate transition from graded to all-or-none neural excitability in the onset of spiking dynamics through the variation of channel kinetic parameters governing the speed of potassium activation. Other combinations of variations in conductance and channel kinetic parameters give rise to phasic spiking and spike frequency adaptation dynamics. The NeuroDyn chip consumes 1.29 mW and occupies 3 mm × 3 mm in 0.5 μm CMOS, supporting emerging developments in neuromorphic silicon-neuron interfaces.
An Analogue VLSI Implementation of the Meddis Inner Hair Cell Model
Directory of Open Access Journals (Sweden)
Alistair McEwan
2003-06-01
Full Text Available The Meddis inner hair cell model is a widely accepted, but computationally intensive computer model of mammalian inner hair cell function. We have produced an analogue VLSI implementation of this model that operates in real time in the current domain by using translinear and log-domain circuits. The circuit has been fabricated on a chip and tested against the Meddis model for (a rate level functions for onset and steady-state response, (b recovery after masking, (c additivity, (d two-component adaptation, (e phase locking, (f recovery of spontaneous activity, and (g computational efficiency. The advantage of this circuit, over other electronic inner hair cell models, is its nearly exact implementation of the Meddis model which can be tuned to behave similarly to the biological inner hair cell. This has important implications on our ability to simulate the auditory system in real time. Furthermore, the technique of mapping a mathematical model of first-order differential equations to a circuit of log-domain filters allows us to implement real-time neuromorphic signal processors for a host of models using the same approach.
Biophysical synaptic dynamics in an analog VLSI network of Hodgkin-Huxley neurons.
Yu, Theodore; Cauwenberghs, Gert
2009-01-01
We study synaptic dynamics in a biophysical network of four coupled spiking neurons implemented in an analog VLSI silicon microchip. The four neurons implement a generalized Hodgkin-Huxley model with individually configurable rate-based kinetics of opening and closing of Na+ and K+ ion channels. The twelve synapses implement a rate-based first-order kinetic model of neurotransmitter and receptor dynamics, accounting for NMDA and non-NMDA type chemical synapses. The implemented models on the chip are fully configurable by 384 parameters accounting for conductances, reversal potentials, and pre/post-synaptic voltage-dependence of the channel kinetics. We describe the models and present experimental results from the chip characterizing single neuron dynamics, single synapse dynamics, and multi-neuron network dynamics showing phase-locking behavior as a function of synaptic coupling strength. The 3mm x 3mm microchip consumes 1.29 mW power making it promising for applications including neuromorphic modeling and neural prostheses.
Emergent Auditory Feature Tuning in a Real-Time Neuromorphic VLSI System.
Sheik, Sadique; Coath, Martin; Indiveri, Giacomo; Denham, Susan L; Wennekers, Thomas; Chicca, Elisabetta
2012-01-01
Many sounds of ecological importance, such as communication calls, are characterized by time-varying spectra. However, most neuromorphic auditory models to date have focused on distinguishing mainly static patterns, under the assumption that dynamic patterns can be learned as sequences of static ones. In contrast, the emergence of dynamic feature sensitivity through exposure to formative stimuli has been recently modeled in a network of spiking neurons based on the thalamo-cortical architecture. The proposed network models the effect of lateral and recurrent connections between cortical layers, distance-dependent axonal transmission delays, and learning in the form of Spike Timing Dependent Plasticity (STDP), which effects stimulus-driven changes in the pattern of network connectivity. In this paper we demonstrate how these principles can be efficiently implemented in neuromorphic hardware. In doing so we address two principle problems in the design of neuromorphic systems: real-time event-based asynchronous communication in multi-chip systems, and the realization in hybrid analog/digital VLSI technology of neural computational principles that we propose underlie plasticity in neural processing of dynamic stimuli. The result is a hardware neural network that learns in real-time and shows preferential responses, after exposure, to stimuli exhibiting particular spectro-temporal patterns. The availability of hardware on which the model can be implemented, makes this a significant step toward the development of adaptive, neurobiologically plausible, spike-based, artificial sensory systems.
A neuromorphic VLSI device for implementing 2-D selective attention systems.
Indiveri, G
2001-01-01
Selective attention is a mechanism used to sequentially select and process salient subregions of the input space, while suppressing inputs arriving from nonsalient regions. By processing small amounts of sensory information in a serial fashion, rather than attempting to process all the sensory data in parallel, this mechanism overcomes the problem of flooding limited processing capacity systems with sensory inputs. It is found in many biological systems and can be a useful engineering tool for developing artificial systems that need to process in real-time sensory data. In this paper we present a neuromorphic hardware model of a selective attention mechanism implemented on a very large scale integration (VLSI) chip, using analog circuits. The chip makes use of a spike-based representation for receiving input signals, transmitting output signals and for shifting the selection of the attended input stimulus over time. It can be interfaced to neuromorphic sensors and actuators, for implementing multichip selective attention systems. We describe the characteristics of the circuits used in the architecture and present experimental data measured from the system.
Dante, V; Del Giudice, P; Mattia, M
2001-01-01
We review a series of implementations of electronic devices aiming at imitating to some extent structure and function of simple neural systems, with particular emphasis on communication issues. We first provide a short overview of general features of such "neuromorphic" devices and the implications of setting up "tests" for them. We then review the developments directly related to our work at the Istituto Superiore di Sanità (ISS): a pilot electronic neural network implementing a simple classifier, autonomously developing internal representations of incoming stimuli; an output network, collecting information from the previous classifier and extracting the relevant part to be forwarded to the observer; an analog, VLSI (very large scale integration) neural chip implementing a recurrent network of spiking neurons and plastic synapses, and the test setup for it; a board designed to interface the standard PCI (peripheral component interconnect) bus of a PC with a special purpose, asynchronous bus for communication among neuromorphic chips; a short and preliminary account of an application-oriented device, taking advantage of the above communication infrastructure.
CASTOR a VLSI CMOS mixed analog-digital circuit for low noise multichannel counting applications
International Nuclear Information System (INIS)
Comes, G.; Loddo, F.; Hu, Y.; Kaplon, J.; Ly, F.; Turchetta, R.; Bonvicini, V.; Vacchi, A.
1996-01-01
In this paper we present the design and first experimental results of a VLSI mixed analog-digital 1.2 microns CMOS circuit (CASTOR) for multichannel radiation detectors applications demanding low noise amplification and counting of radiation pulses. This circuit is meant to be connected to pixel-like detectors. Imaging can be obtained by counting the number of hits in each pixel during a user-controlled exposure time. Each channel of the circuit features an analog and a digital part. In the former one, a charge preamplifier is followed by a CR-RC shaper with an output buffer and a threshold discriminator. In the digital part, a 16-bit counter is present together with some control logic. The readout of the counters is done serially on a common tri-state output. Daisy-chaining is possible. A 4-channel prototype has been built. This prototype has been optimised for use in the digital radiography Syrmep experiment at the Elettra synchrotron machine in Trieste (Italy): its main design parameters are: shaping time of about 850 ns, gain of 190 mV/fC and ENC (e - rms)=60+17 C (pF). The counting rate per channel, limited by the analog part, can be as high as about 200 kHz. Characterisation of the circuit and first tests with silicon microstrip detectors are presented. They show the circuit works according to design specification and can be used for imaging applications. (orig.)
A novel VLSI processor for high-rate, high resolution spectroscopy
Pullia, Antonio; Gatti, E; Longoni, A; Buttler, W
2000-01-01
A novel time-variant VLSI shaper amplifier, suitable for multi-anode Silicon Drift Detectors or other multi-element solid-state X-ray detection systems, is proposed. The new read-out scheme has been conceived for demanding applications with synchrotron light sources, such as X-ray holography or EXAFS, where both high count-rates and high-energy resolutions are required. The circuit is of the linear time-variant class, accepts randomly distributed events and features: a finite-width (1-10 mu s) quasi-optimal weight function, an ultra-low-level energy discrimination (approx 150 eV), and a full compatibility for monolithic integration in CMOS technology. Its impulse response has a staircase-like shape, but the weight function (which is in general different from the impulse response in time-variant systems) is quasi trapezoidal. The operation principles of the new scheme as well as the first experimental results obtained with a prototype of the circuit are presented and discussed in the work.
VLSI ARCHITECTURE FOR IMAGE COMPRESSION THROUGH ADDER MINIMIZATION TECHNIQUE AT DCT STRUCTURE
Directory of Open Access Journals (Sweden)
N.R. Divya
2014-08-01
Full Text Available Data compression plays a vital role in multimedia devices to present the information in a succinct frame. Initially, the DCT structure is used for Image compression, which has lesser complexity and area efficient. Similarly, 2D DCT also has provided reasonable data compression, but implementation concern, it calls more multipliers and adders thus its lead to acquire more area and high power consumption. To contain an account of all, this paper has been dealt with VLSI architecture for image compression using Rom free DA based DCT (Discrete Cosine Transform structure. This technique provides high-throughput and most suitable for real-time implementation. In order to achieve this image matrix is subdivided into odd and even terms then the multiplication functions are removed by shift and add approach. Kogge_Stone_Adder techniques are proposed for obtaining a bit-wise image quality which determines the new trade-off levels as compared to the previous techniques. Overall the proposed architecture produces reduced memory, low power consumption and high throughput. MATLAB is used as a funding tool for receiving an input pixel and obtaining output image. Verilog HDL is used for implementing the design, Model Sim for simulation, Quatres II is used to synthesize and obtain details about power and area.
Directory of Open Access Journals (Sweden)
B. SENTHILKUMAR
2015-05-01
Full Text Available A novel implementation of code based cryptography (Cryptocoding technique for multi-layer key distribution scheme is presented. VLSI chip is designed for storing information on generation of round keys. New algorithm is developed for reduced key size with optimal performance. Error Control Algorithm is employed for both generation of round keys and diffusion of non-linearity among them. Two new functions for bit inversion and its reversal are developed for cryptocoding. Probability of retrieving original key from any other round keys is reduced by diffusing nonlinear selective bit inversions on round keys. Randomized selective bit inversions are done on equal length of key bits by Round Constant Feedback Shift Register within the error correction limits of chosen code. Complexity of retrieving the original key from any other round keys is increased by optimal hardware usage. Proposed design is simulated and synthesized using VHDL coding for Spartan3E FPGA and results are shown. Comparative analysis is done between 128 bit Advanced Encryption Standard round keys and proposed round keys for showing security strength of proposed algorithm. This paper concludes that chip based multi-layer key distribution of proposed algorithm is an enhanced solution to the existing threats on cryptography algorithms.
A Single Chip VLSI Implementation of a QPSK/SQPSK Demodulator for a VSAT Receiver Station
Kwatra, S. C.; King, Brent
1995-01-01
This thesis presents a VLSI implementation of a QPSK/SQPSK demodulator. It is designed to be employed in a VSAT earth station that utilizes the FDMA/TDM link. A single chip architecture is used to enable this chip to be easily employed in the VSAT system. This demodulator contains lowpass filters, integrate and dump units, unique word detectors, a timing recovery unit, a phase recovery unit and a down conversion unit. The design stages start with a functional representation of the system by using the C programming language. Then it progresses into a register based representation using the VHDL language. The layout components are designed based on these VHDL models and simulated. Component generators are developed for the adder, multiplier, read-only memory and serial access memory in order to shorten the design time. These sub-components are then block routed to form the main components of the system. The main components are block routed to form the final demodulator.
Digital VLSI design with Verilog a textbook from Silicon Valley Polytechnic Institute
Williams, John Michael
2014-01-01
This book is structured as a step-by-step course of study along the lines of a VLSI integrated circuit design project. The entire Verilog language is presented, from the basics to everything necessary for synthesis of an entire 70,000 transistor, full-duplex serializer-deserializer, including synthesizable PLLs. The author includes everything an engineer needs for in-depth understanding of the Verilog language: Syntax, synthesis semantics, simulation, and test. Complete solutions for the 27 labs are provided in the downloadable files that accompany the book. For readers with access to appropriate electronic design tools, all solutions can be developed, simulated, and synthesized as described in the book. A partial list of design topics includes design partitioning, hierarchy decomposition, safe coding styles, back annotation, wrapper modules, concurrency, race conditions, assertion-based verification, clock synchronization, and design for test. A concluding presentation of special topics inclu...
Optimal Solution for VLSI Physical Design Automation Using Hybrid Genetic Algorithm
Directory of Open Access Journals (Sweden)
I. Hameem Shanavas
2014-01-01
Full Text Available In Optimization of VLSI Physical Design, area minimization and interconnect length minimization is an important objective in physical design automation of very large scale integration chips. The objective of minimizing the area and interconnect length would scale down the size of integrated chips. To meet the above objective, it is necessary to find an optimal solution for physical design components like partitioning, floorplanning, placement, and routing. This work helps to perform the optimization of the benchmark circuits with the above said components of physical design using hierarchical approach of evolutionary algorithms. The goal of minimizing the delay in partitioning, minimizing the silicon area in floorplanning, minimizing the layout area in placement, minimizing the wirelength in routing has indefinite influence on other criteria like power, clock, speed, cost, and so forth. Hybrid evolutionary algorithm is applied on each of its phases to achieve the objective. Because evolutionary algorithm that includes one or many local search steps within its evolutionary cycles to obtain the minimization of area and interconnect length. This approach combines a hierarchical design like genetic algorithm and simulated annealing to attain the objective. This hybrid approach can quickly produce optimal solutions for the popular benchmarks.
Aljada, Muhsen; Hwang, Seow; Alameh, Kamal
2008-01-21
In this paper we propose and experimentally demonstrate a reconfigurable 10Gbps frequency-encoded (1D) encoder/decoder structure for optical code division multiple access (OCDMA). The encoder is constructed using a single semiconductor optical amplifier (SOA) and 1D reflective Opto-VLSI processor. The SOA generates broadband amplified spontaneous emission that is dynamically sliced using digital phase holograms loaded onto the Opto-VLSI processor to generate 1D codewords. The selected wavelengths are injected back into the same SOA for amplifications. The decoder is constructed using single Opto-VLSI processor only. The encoded signal can successfully be retrieved at the decoder side only when the digital phase holograms of the encoder and the decoder are matched. The system performance is measured in terms of the auto-correlation and cross-correlation functions as well as the eye diagram.
Energy Technology Data Exchange (ETDEWEB)
Pereshenkov, V S [MIFI, Moscow, (Russian Federation); Shishianu, F S; Rusanovskij, V I [S. Lazo KPI, Chisinau, (Moldova, Republic of)
1992-01-01
The paper presents the method used and the experimental results obtained for 8-bit microprocessor irradiated with [gamma]-rays and neutrons. The correlation between the electrical and technological parameters with the irradiation ones is revealed. The influence of leakage current between devices incorporated in VLSI circuits was studied. The obtained results create the possibility to determine the technological parameters necessary for designing the circuit able to work at predetermined doses. The necessary substrate doping concentration for isolation which eliminates the leakage current between devices prevents the VLSI circuit break down was determined. (Author).
Fault tolerance in protein interaction networks: stable bipartite subgraphs and redundant pathways.
Directory of Open Access Journals (Sweden)
Arthur Brady
Full Text Available As increasing amounts of high-throughput data for the yeast interactome become available, more system-wide properties are uncovered. One interesting question concerns the fault tolerance of protein interaction networks: whether there exist alternative pathways that can perform some required function if a gene essential to the main mechanism is defective, absent or suppressed. A signature pattern for redundant pathways is the BPM (between-pathway model motif, introduced by Kelley and Ideker. Past methods proposed to search the yeast interactome for BPM motifs have had several important limitations. First, they have been driven heuristically by local greedy searches, which can lead to the inclusion of extra genes that may not belong in the motif; second, they have been validated solely by functional coherence of the putative pathways using GO enrichment, making it difficult to evaluate putative BPMs in the absence of already known biological annotation. We introduce stable bipartite subgraphs, and show they form a clean and efficient way of generating meaningful BPMs which naturally discard extra genes included by local greedy methods. We show by GO enrichment measures that our BPM set outperforms previous work, covering more known complexes and functional pathways. Perhaps most importantly, since our BPMs are initially generated by examining the genetic-interaction network only, the location of edges in the protein-protein physical interaction network can then be used to statistically validate each candidate BPM, even with sparse GO annotation (or none at all. We uncover some interesting biological examples of previously unknown putative redundant pathways in such areas as vesicle-mediated transport and DNA repair.
Fault tolerance in protein interaction networks: stable bipartite subgraphs and redundant pathways.
Brady, Arthur; Maxwell, Kyle; Daniels, Noah; Cowen, Lenore J
2009-01-01
As increasing amounts of high-throughput data for the yeast interactome become available, more system-wide properties are uncovered. One interesting question concerns the fault tolerance of protein interaction networks: whether there exist alternative pathways that can perform some required function if a gene essential to the main mechanism is defective, absent or suppressed. A signature pattern for redundant pathways is the BPM (between-pathway model) motif, introduced by Kelley and Ideker. Past methods proposed to search the yeast interactome for BPM motifs have had several important limitations. First, they have been driven heuristically by local greedy searches, which can lead to the inclusion of extra genes that may not belong in the motif; second, they have been validated solely by functional coherence of the putative pathways using GO enrichment, making it difficult to evaluate putative BPMs in the absence of already known biological annotation. We introduce stable bipartite subgraphs, and show they form a clean and efficient way of generating meaningful BPMs which naturally discard extra genes included by local greedy methods. We show by GO enrichment measures that our BPM set outperforms previous work, covering more known complexes and functional pathways. Perhaps most importantly, since our BPMs are initially generated by examining the genetic-interaction network only, the location of edges in the protein-protein physical interaction network can then be used to statistically validate each candidate BPM, even with sparse GO annotation (or none at all). We uncover some interesting biological examples of previously unknown putative redundant pathways in such areas as vesicle-mediated transport and DNA repair.
Ramachandran, S
2007-01-01
Digital VLSI Systems Design is written for an advanced level course using Verilog and is meant for undergraduates, graduates and research scholars of Electrical, Electronics, Embedded Systems, Computer Engineering and interdisciplinary departments such as Bio Medical, Mechanical, Information Technology, Physics, etc. It serves as a reference design manual for practicing engineers and researchers as well. Diligent freelance readers and consultants may also start using this book with ease. The book presents new material and theory as well as synthesis of recent work with complete Project Designs
Breuer, M. A.; Carlan, A. J.
1982-10-01
Fault simulation is widely used by industry in such applications as scoring the fault coverage of test sequences and construction of fault dictionaries. For use in testing VLSI circuits a simulator is evaluated by its accuracy, i.e., modelling capability. To be accurate simulators must employ multi-valued logic in order to represent unknown signal values, impedance, signal transitions, etc., circuit delays such as transport rise/fall, inertial, and the fault modes it is capable of handling. Of the three basic fault simulators now in use (parallel, deductive and concurrent) concurrent fault simulation appears most promising.
Driving a car with custom-designed fuzzy inferencing VLSI chips and boards
Pin, Francois G.; Watanabe, Yutaka
1993-01-01
Vehicle control in a-priori unknown, unpredictable, and dynamic environments requires many calculational and reasoning schemes to operate on the basis of very imprecise, incomplete, or unreliable data. For such systems, in which all the uncertainties can not be engineered away, approximate reasoning may provide an alternative to the complexity and computational requirements of conventional uncertainty analysis and propagation techniques. Two types of computer boards including custom-designed VLSI chips were developed to add a fuzzy inferencing capability to real-time control systems. All inferencing rules on a chip are processed in parallel, allowing execution of the entire rule base in about 30 microseconds, and therefore, making control of 'reflex-type' of motions envisionable. The use of these boards and the approach using superposition of elemental sensor-based behaviors for the development of qualitative reasoning schemes emulating human-like navigation in a-priori unknown environments are first discussed. Then how the human-like navigation scheme implemented on one of the qualitative inferencing boards was installed on a test-bed platform to investigate two control modes for driving a car in a-priori unknown environments on the basis of sparse and imprecise sensor data is described. In the first mode, the car navigates fully autonomously, while in the second mode, the system acts as a driver's aid providing the driver with linguistic (fuzzy) commands to turn left or right and speed up or slow down depending on the obstacles perceived by the sensors. Experiments with both modes of control are described in which the system uses only three acoustic range (sonar) sensor channels to perceive the environment. Simulation results as well as indoors and outdoors experiments are presented and discussed to illustrate the feasibility and robustness of autonomous navigation and/or safety enhancing driver's aid using the new fuzzy inferencing hardware system and some human
International Nuclear Information System (INIS)
Meng Fanyu; Zhu Aidong
2008-01-01
A quantum logic network to implement quantum telecloning is presented in this paper. The network includes two parts: the first part is used to create the telecloning channel and the second part to teleport the state. It can be used not only to implement universal telecloning for a bipartite entangled state which is completely unknown, but also to implement the phase-covariant telecloning for one that is partially known. Furthermore, the network can also be used to construct a tele-triplicator. It can easily be implemented in experiment because only single- and two-qubit operations are used in the network.
Dietzgen, Ralf G.; Kondo, Hideki; Goodin, Michael M.; Kurath, Gael; Vasilakis, Nikos
2017-01-01
The family Rhabdoviridae consists of mostly enveloped, bullet-shaped or bacilliform viruses with a negative-sense, single-stranded RNA genome that infect vertebrates, invertebrates or plants. This ecological diversity is reflected by the diversity and complexity of their genomes. Five canonical structural protein genes are conserved in all rhabdoviruses, but may be overprinted, overlapped or interspersed with several novel and diverse accessory genes. This review gives an overview of the characteristics and diversity of rhabdoviruses, their taxonomic classification, replication mechanism, properties of classical rhabdoviruses such as rabies virus and rhabdoviruses with complex genomes, rhabdoviruses infecting aquatic species, and plant rhabdoviruses with both mono- and bipartite genomes.
Directory of Open Access Journals (Sweden)
T. Kalavathi Devi
2015-01-01
Full Text Available Convolutional codes are comprehensively used as Forward Error Correction (FEC codes in digital communication systems. For decoding of convolutional codes at the receiver end, Viterbi decoder is often used to have high priority. This decoder meets the demand of high speed and low power. At present, the design of a competent system in Very Large Scale Integration (VLSI technology requires these VLSI parameters to be finely defined. The proposed asynchronous method focuses on reducing the power consumption of Viterbi decoder for various constraint lengths using asynchronous modules. The asynchronous designs are based on commonly used Quasi Delay Insensitive (QDI templates, namely, Precharge Half Buffer (PCHB and Weak Conditioned Half Buffer (WCHB. The functionality of the proposed asynchronous design is simulated and verified using Tanner Spice (TSPICE in 0.25 µm, 65 nm, and 180 nm technologies of Taiwan Semiconductor Manufacture Company (TSMC. The simulation result illustrates that the asynchronous design techniques have 25.21% of power reduction compared to synchronous design and work at a speed of 475 MHz.
Iranzo, Jaime; Koonin, Eugene V; Prangishvili, David; Krupovic, Mart
2016-12-15
Archaea and particularly hyperthermophilic crenarchaea are hosts to many unusual viruses with diverse virion shapes and distinct gene compositions. As is typical of viruses in general, there are no universal genes in the archaeal virosphere. Therefore, to obtain a comprehensive picture of the evolutionary relationships between viruses, network analysis methods are more productive than traditional phylogenetic approaches. Here we present a comprehensive comparative analysis of genomes and proteomes from all currently known taxonomically classified and unclassified, cultivated and uncultivated archaeal viruses. We constructed a bipartite network of archaeal viruses that includes two classes of nodes, the genomes and gene families that connect them. Dissection of this network using formal community detection methods reveals strong modularity, with 10 distinct modules and 3 putative supermodules. However, compared to similar previously analyzed networks of eukaryotic and bacterial viruses, the archaeal virus network is sparsely connected. With the exception of the tailed viruses related to bacteriophages of the order Caudovirales and the families Turriviridae and Sphaerolipoviridae that are linked to a distinct supermodule of eukaryotic and bacterial viruses, there are few connector genes shared by different archaeal virus modules. In contrast, most of these modules include, in addition to viruses, capsidless mobile elements, emphasizing tight evolutionary connections between the two types of entities in archaea. The relative contributions of distinct evolutionary origins, in particular from nonviral elements, and insufficient sampling to the sparsity of the archaeal virus network remain to be determined by further exploration of the archaeal virosphere. Viruses infecting archaea are among the most mysterious denizens of the virosphere. Many of these viruses display no genetic or even morphological relationship to viruses of bacteria and eukaryotes, raising questions
Multiple Substrate Usage of Coxiella burnetii to Feed a Bipartite Metabolic Network
Directory of Open Access Journals (Sweden)
Ina Häuslein
2017-06-01
Full Text Available The human pathogen Coxiella burnetii causes Q-fever and is classified as a category B bio-weapon. Exploiting the development of the axenic growth medium ACCM-2, we have now used 13C-labeling experiments and isotopolog profiling to investigate the highly diverse metabolic network of C. burnetii. To this aim, C. burnetii RSA 439 NMII was cultured in ACCM-2 containing 5 mM of either [U-13C3]serine, [U-13C6]glucose, or [U-13C3]glycerol until the late-logarithmic phase. GC/MS-based isotopolog profiling of protein-derived amino acids, methanol-soluble polar metabolites, fatty acids, and cell wall components (e.g., diaminopimelate and sugars from the labeled bacteria revealed differential incorporation rates and isotopolog profiles. These data served to decipher the diverse usages of the labeled substrates and the relative carbon fluxes into the core metabolism of the pathogen. Whereas, de novo biosynthesis from any of these substrates could not be found for histidine, isoleucine, leucine, lysine, phenylalanine, proline and valine, the other amino acids and metabolites under study acquired 13C-label at specific rates depending on the nature of the tracer compound. Glucose was directly used for cell wall biosynthesis, but was also converted into pyruvate (and its downstream metabolites through the glycolytic pathway or into erythrose 4-phosphate (e.g., for the biosynthesis of tyrosine via the non-oxidative pentose phosphate pathway. Glycerol efficiently served as a gluconeogenetic substrate and could also be used via phosphoenolpyruvate and diaminopimelate as a major carbon source for cell wall biosynthesis. In contrast, exogenous serine was mainly utilized in downstream metabolic processes, e.g., via acetyl-CoA in a complete citrate cycle with fluxes in the oxidative direction and as a carbon feed for fatty acid biosynthesis. In summary, the data reflect multiple and differential substrate usages by C. burnetii in a bipartite-type metabolic network
Chizinski, Christopher J.; Martin, Dustin R.; Shizuka, Daizaburo; Pope, Kevin L.
2018-01-01
Networks used to study interactions could provide insights to fisheries. We compiled data from 27 297 interviews of anglers across waterbodies that ranged in size from 1 to 12 113 ha. Catch rates of fish species among anglers grouped by species targeted generally differed between angling methods (bank or boat). We constructed angler–catch bipartite networks (angling method specific) between anglers and fish and measured several network metrics. There was considerable variation in networks among waterbodies, with multiple metrics influenced by waterbody size. Number of species-targeting angler groups and number of fish species caught increased with increasing waterbody size. Mean number of links for species-targeting angler groups and fish species caught also increased with waterbody size. Connectance (realized proportion of possible links) of angler–catch interaction networks decreased slower for boat anglers than for bank anglers with increasing waterbody size. Network specialization (deviation of number of interactions from expected) was not significantly related to waterbody size or angling methods. Application of bipartite networks in fishery science requires careful interpretation of outputs, especially considering the numerous confounding factors prevalent in recreational fisheries.
Energy Technology Data Exchange (ETDEWEB)
Mohamed, A.-B.A., E-mail: abdelbastm@yahoo.com [College of Sciences and Humanities, Prince Sattam Bin Abdulaziz University, Al-Aflaj (Saudi Arabia); Faculty of Science, Assiut University, Assiut (Egypt); Joshi, A., E-mail: mcbamji@gmail.com [Physics Department, Adelphi University Garden City, NY 11530 (United States); Department of Physics and Optical Engineering, RHIT, Terra Haute IN 47803 (United States); Hassan, S.S., E-mail: shoukryhassan@hotmail.com [Department of Mathematics, College of Science, University of Bahrain, P.O. Box 32038 (Bahrain)
2016-03-15
Several quantum-mechanical correlations, notably, quantum entanglement, measurement-induced nonlocality and Bell nonlocality are studied for a two qubit-system having no mutual interaction. Analytical expressions for the measures of these quantum-mechanical correlations of different bipartite partitions of the system are obtained, for initially two entangled qubits and the two photons are in their vacuum states. It is found that the qubits-fields interaction leads to the loss and gain of the initial quantum correlations. The lost initial quantum correlations transfer from the qubits to the cavity fields. It is found that the maximal violation of Bell’s inequality is occurring when the quantum correlations of both the logarithmic negativity and measurement-induced nonlocality reach particular values. The maximal violation of Bell’s inequality occurs only for certain bipartite partitions of the system. The frequency detuning leads to quick oscillations of the quantum correlations and inhibits their transfer from the qubits to the cavity modes. It is also found that the dynamical behavior of the quantum correlation clearly depends on the qubit distribution angle.
International Nuclear Information System (INIS)
Pal, Karoly F.; Vertesi, Tamas
2010-01-01
The I 3322 inequality is the simplest bipartite two-outcome Bell inequality beyond the Clauser-Horne-Shimony-Holt (CHSH) inequality, consisting of three two-outcome measurements per party. In the case of the CHSH inequality the maximal quantum violation can already be attained with local two-dimensional quantum systems; however, there is no such evidence for the I 3322 inequality. In this paper a family of measurement operators and states is given which enables us to attain the maximum quantum value in an infinite-dimensional Hilbert space. Further, it is conjectured that our construction is optimal in the sense that measuring finite-dimensional quantum systems is not enough to achieve the true quantum maximum. We also describe an efficient iterative algorithm for computing quantum maximum of an arbitrary two-outcome Bell inequality in any given Hilbert space dimension. This algorithm played a key role in obtaining our results for the I 3322 inequality, and we also applied it to improve on our previous results concerning the maximum quantum violation of several bipartite two-outcome Bell inequalities with up to five settings per party.
Directory of Open Access Journals (Sweden)
Li He
2014-01-01
Full Text Available For the purpose of improving the prediction of cancer prognosis in the clinical researches, various algorithms have been developed to construct the predictive models with the gene signatures detected by DNA microarrays. Due to the heterogeneity of the clinical samples, the list of differentially expressed genes (DEGs generated by the statistical methods or the machine learning algorithms often involves a number of false positive genes, which are not associated with the phenotypic differences between the compared clinical conditions, and subsequently impacts the reliability of the predictive models. In this study, we proposed a strategy, which combined the statistical algorithm with the gene-pathway bipartite networks, to generate the reliable lists of cancer-related DEGs and constructed the models by using support vector machine for predicting the prognosis of three types of cancers, namely, breast cancer, acute myeloma leukemia, and glioblastoma. Our results demonstrated that, combined with the gene-pathway bipartite networks, our proposed strategy can efficiently generate the reliable cancer-related DEG lists for constructing the predictive models. In addition, the model performance in the swap analysis was similar to that in the original analysis, indicating the robustness of the models in predicting the cancer outcomes.
International Nuclear Information System (INIS)
Zhang Xiu-Xing; Li Fu-Li
2011-01-01
The correlation dynamics are investigated for various bi-partitions of a composite quantum system consisting of two qubits and two independent and non-identical noisy environments. The two qubits have no direct interaction with each other and locally interact with their environments. Classical and quantum correlations including the entanglement are initially prepared only between the two qubits. We find that contrary to the identical noisy environment case, the quantum correlation transfer direction can be controlled by combining different noisy environments. The amplitude-damping environment determines whether there exists the entanglement transfer among bi-partitions of the system. When one qubit is coupled to an amplitude-damping environment and the other one to a bit-flip one, we find a very interesting result that all the quantum and the classical correlations, and even the entanglement, originally existing between the qubits, can be completely transferred without any loss to the qubit coupled to the bit-flit environment and the amplitude-damping environment. We also notice that it is possible to distinguish the quantum correlation from the classical correlation and the entanglement by combining different noisy environments. (general)
Borysov, Sergiy I.; Nepon-Sixt, Brook S.
2015-01-01
The N-terminal domain of the retinoblastoma (Rb) tumor suppressor protein (RbN) harbors in-frame exon deletions in partially penetrant hereditary retinoblastomas and is known to impair cell growth and tumorigenesis. However, how such RbN deletions contribute to Rb tumor- and growth-suppressive functions is unknown. Here we establish that RbN directly inhibits DNA replication initiation and elongation using a bipartite mechanism involving N-terminal exons lost in cancer. Specifically, Rb exon 7 is necessary and sufficient to target and inhibit the replicative CMG helicase, resulting in the accumulation of inactive CMGs on chromatin. An independent N-terminal loop domain, which forms a projection, specifically blocks DNA polymerase α (Pol-α) and Ctf4 recruitment without affecting DNA polymerases ε and δ or the CMG helicase. Individual disruption of exon 7 or the projection in RbN or Rb, as occurs in inherited cancers, partially impairs the ability of Rb/RbN to inhibit DNA replication and block G1-to-S cell cycle transit. However, their combined loss abolishes these functions of Rb. Thus, Rb growth-suppressive functions include its ability to block replicative complexes via bipartite, independent, and additive N-terminal domains. The partial loss of replication, CMG, or Pol-α control provides a potential molecular explanation for how N-terminal Rb loss-of-function deletions contribute to the etiology of partially penetrant retinoblastomas. PMID:26711265
Zhong, Zai-Zhe
2004-01-01
The partial separability of multipartite qubit density matrixes is strictly defined. We give a reduction way from N-partite qubit density matrixes to bipartite qubit density matrixes, and prove a necessary condition that a N-partite qubit density matrix to be partially separable is its reduced density matrix to satisfy PPT condition.
DEFF Research Database (Denmark)
Sparsø, Jens; Jørgensen, Henrik Nordtorp; Paaske, Erik
1991-01-01
A topology for single-chip implementation of computing structures based on shuffle-exchange (SE)-type interconnection networks is presented. The topology is suited for structures with a small number of processing elements (i.e. 32-128) whose area cannot be neglected compared to the area required....... The topology has been used in a VLSI implementation of the add-compare-select (ACS) module of a fully parallel K=7, R=1/2 Viterbi decoder. Both the floor-planning issues and some of the important algorithm and circuit-level aspects of this design are discussed. The chip has been designed and fabricated in a 2....... The interconnection network occupies 32% of the area.>...
10 K gate I(2)L and 1 K component analog compatible bipolar VLSI technology - HIT-2
Washio, K.; Watanabe, T.; Okabe, T.; Horie, N.
1985-02-01
An advanced analog/digital bipolar VLSI technology that combines on the same chip 2-ns 10 K I(2)L gates with 1 K analog devices is proposed. The new technology, called high-density integration technology-2, is based on a new structure concept that consists of three major techniques: shallow grooved-isolation, I(2)L active layer etching, and I(2)L current gain increase. I(2)L circuits with 80-MHz maximum toggle frequency have developed compatibly with n-p-n transistors having a BV(CE0) of more than 10 V and an f(T) of 5 GHz, and lateral p-n-p transistors having an f(T) of 150 MHz.
Singha Roy, Sudipto; Dhar, Himadri Shekhar; Rakshit, Debraj; Sen(De), Aditi; Sen, Ujjwal
2017-12-01
Phase transition in quantum many-body systems inevitably causes changes in certain physical properties which then serve as potential indicators of critical phenomena. Besides the traditional order parameters, characterization of quantum entanglement has proven to be a computationally efficient and successful method for detection of phase boundaries, especially in one-dimensional models. Here we determine the rich phase diagram of the ground states of a quantum spin-1/2 XXZ ladder by analyzing the variation of bipartite and multipartite entanglements. Our study characterizes the different ground state phases and notes the correspondence with known results, while highlighting the finer details that emerge from the behavior of ground state entanglement. Analysis of entanglement in the ground state provides a clearer picture of the complex ground state phase diagram of the system using only a moderate-size model.
Dietzgen, Ralf G; Kondo, Hideki; Goodin, Michael M; Kurath, Gael; Vasilakis, Nikos
2017-01-02
The family Rhabdoviridae consists of mostly enveloped, bullet-shaped or bacilliform viruses with a negative-sense, single-stranded RNA genome that infect vertebrates, invertebrates or plants. This ecological diversity is reflected by the diversity and complexity of their genomes. Five canonical structural protein genes are conserved in all rhabdoviruses, but may be overprinted, overlapped or interspersed with several novel and diverse accessory genes. This review gives an overview of the characteristics and diversity of rhabdoviruses, their taxonomic classification, replication mechanism, properties of classical rhabdoviruses such as rabies virus and rhabdoviruses with complex genomes, rhabdoviruses infecting aquatic species, and plant rhabdoviruses with both mono- and bipartite genomes. Copyright Â© 2016 Elsevier B.V. All rights reserved.
Effect of two-qutrit entanglement on quantum speed limit time of a bipartite V-type open system
Energy Technology Data Exchange (ETDEWEB)
Behzadi, N., E-mail: n.behzadi@tabrizu.ac.ir [Research Institute for Fundamental Sciences, University of Tabriz (Iran, Islamic Republic of); Ahansaz, B.; Ektesabi, A.; Faizi, E. [Physics Department, Azarbaijan Shahid Madani University, Tabriz (Iran, Islamic Republic of)
2017-03-15
In the present paper, quantum speed limit (QSL) time of a bipartite V-type three-level atomic system under the effect of two-qutrit entanglement is investigated. Each party interacts with own independent reservoir. By considering two local unitarily equivalent Werner states and the Horodecki PPT state, as initial states, the QSL time is evaluated for each of them in the respective entangled regions. It is counterintuitively observed that the effect of entanglement on the QSL time driven from each of the initial Werner states are completely different when the degree of non-Markovianity is considerable. In addition, it is interesting that the effect of entanglement of the non-equivalent Horodecki state on the calculated QSL time displays an intermediate behavior relative to the cases obtained for the Werner states.
International Nuclear Information System (INIS)
Alécio, Raphael C.; Lyra, Marcelo L.; Strečka, Jozef
2016-01-01
The ground-state phase diagram, magnetization process and bipartite entanglement of the frustrated spin-1/2 Ising-Heisenberg and Heisenberg triangular tube (three-leg ladder) are investigated in a non-zero external magnetic field. The exact ground-state phase diagram of the spin-1/2 Ising-Heisenberg tube with Heisenberg intra-rung and Ising inter-rung couplings consists of six distinct gapped phases, which manifest themselves in a magnetization curve as intermediate plateaus at zero, one-third and two-thirds of the saturation magnetization. Four out of six available ground states exhibit quantum entanglement between two spins from the same triangular unit evidenced by a non-zero concurrence. Density-matrix renormalization group calculations are used in order to construct the ground-state phase diagram of the analogous but purely quantum spin-1/2 Heisenberg tube with Heisenberg intra- and inter-rung couplings, which consists of four gapped and three gapless phases. The Heisenberg tube shows a continuous change of the magnetization instead of a plateau at zero magnetization, while the intermediate one-third and two-thirds plateaus may be present or not in the zero-temperature magnetization curve. - Highlights: • Ground-state properties of Ising-Heisenberg and full Heisenberg spin tubes are studied. • Phases with 1/3 and 2/3 magnetization plateaus are present in both models. • We unveil the region in the parameter space on which inter-rung quantum fluctuations are relevant. • The full Heisenberg tube exhibits quantum bipartite entanglement between intra- as well as inter-rung spins.
Straka, Mika J.; Caldarelli, Guido; Squartini, Tiziano; Saracco, Fabio
2018-04-01
Bipartite networks provide an insightful representation of many systems, ranging from mutualistic networks of species interactions to investment networks in finance. The analyses of their topological structures have revealed the ubiquitous presence of properties which seem to characterize many—apparently different—systems. Nestedness, for example, has been observed in biological plant-pollinator as well as in country-product exportation networks. Due to the interdisciplinary character of complex networks, tools developed in one field, for example ecology, can greatly enrich other areas of research, such as economy and finance, and vice versa. With this in mind, we briefly review several entropy-based bipartite null models that have been recently proposed and discuss their application to real-world systems. The focus on these models is motivated by the fact that they show three very desirable features: analytical character, general applicability, and versatility. In this respect, entropy-based methods have been proven to perform satisfactorily both in providing benchmarks for testing evidence-based null hypotheses and in reconstructing unknown network configurations from partial information. Furthermore, entropy-based models have been successfully employed to analyze ecological as well as economic systems. As an example, the application of entropy-based null models has detected early-warning signals, both in economic and financial systems, of the 2007-2008 world crisis. Moreover, they have revealed a statistically-significant export specialization phenomenon of country export baskets in international trade, a result that seems to reconcile Ricardo's hypothesis in classical economics with recent findings on the (empirical) diversification industrial production at the national level. Finally, these null models have shown that the information contained in the nestedness is already accounted for by the degree sequence of the corresponding graphs.
Xiu-Xing, Zhang; Fu-Li, Li
2012-01-01
We study the classical correlation (CC) and quantum discord (QD) between two spin subgroups of the Lipkin-Meshkov-Glick (LMG) model in both binary and trinary decompositions of spins. In the case of bipartition, we find that the classical correlations and all the quantum correlations including the QD, the entanglement of formation (EoF) and the logarithmic negativity (LN) are divergent in the same singular behavior at the critical point of the LMG model. In the case of tripartition, however, ...
A Bipartite Network-based Method for Prediction of Long Non-coding RNA–protein Interactions
Directory of Open Access Journals (Sweden)
Mengqu Ge
2016-02-01
Full Text Available As one large class of non-coding RNAs (ncRNAs, long ncRNAs (lncRNAs have gained considerable attention in recent years. Mutations and dysfunction of lncRNAs have been implicated in human disorders. Many lncRNAs exert their effects through interactions with the corresponding RNA-binding proteins. Several computational approaches have been developed, but only few are able to perform the prediction of these interactions from a network-based point of view. Here, we introduce a computational method named lncRNA–protein bipartite network inference (LPBNI. LPBNI aims to identify potential lncRNA–interacting proteins, by making full use of the known lncRNA–protein interactions. Leave-one-out cross validation (LOOCV test shows that LPBNI significantly outperforms other network-based methods, including random walk (RWR and protein-based collaborative filtering (ProCF. Furthermore, a case study was performed to demonstrate the performance of LPBNI using real data in predicting potential lncRNA–interacting proteins.
Directory of Open Access Journals (Sweden)
Adrien eTaudiere
2015-10-01
Full Text Available The ectomycorrhizal (ECM symbiosis connects mutualistic plants and fungal species into bipartite networks. While links between one focal ECM plant and its fungal symbionts have been widely documented, systemic views of ECM networks are lacking, in particular, concerning the ability of fungal species to mediate indirect ecological interactions between ECM plant species (projected-ECM networks. We assembled a large dataset of plant-fungi associations at the species level and at the scale of Corsica using molecular data and unambiguously host-assigned records to: (i examine the correlation between the number of fungal symbionts of a plant species and the average specialization of these fungal species, (ii explore the structure of the plant-plant projected network and (iii compare plant association patterns in regard to their position along the ecological succession. Our analysis reveals no trade-off between specialization of plants and specialization of their partners and a saturation of the plant projected network. Moreover, there is a significantly lower-than-expected sharing of partners between early- and late-successional plant species, with fewer fungal partners for early-successional ones and similar average specialization of symbionts of early- and late-successional plants. Our work paves the way for ecological readings of Mediterranean landscapes that include the astonishing diversity of below-ground interactions.
Alabi, Olufemi J; Villegas, Cecilia; Gregg, Lori; Murray, K Daniel
2016-06-01
Two isolates of a novel bipartite begomovirus, tentatively named malvastrum bright yellow mosaic virus (MaBYMV), were molecularly characterized from naturally infected plants of the genus Malvastrum showing bright yellow mosaic disease symptoms in South Texas. Six complete DNA-A and five DNA-B genome sequences of MaBYMV obtained from the isolates ranged in length from 2,608 to 2,609 nucleotides (nt) and 2,578 to 2,605 nt, respectively. Both genome segments shared a 178- to 180-nt common region. In pairwise comparisons, the complete DNA-A and DNA-B sequences of MaBYMV were most similar (87-88 % and 79-81 % identity, respectively) and phylogenetically related to the corresponding sequences of sida mosaic Sinaloa virus-[MX-Gua-06]. Further analysis revealed that MaBYMV is a putative recombinant virus, thus supporting the notion that malvaceous hosts may be influencing the evolution of several begomoviruses. The design of new diagnostic primers enabled the detection of MaBYMV in cohorts of Bemisia tabaci collected from symptomatic Malvastrum sp. plants, thus implicating whiteflies as potential vectors of the virus.
Moreira, Marcelo Rasga; Ribeiro, José Mendes; Ouverney, Assis Mafort
2017-04-01
This paper aims to identify and analyze the political obstacles to the implementation of Organizational Contract of Public Action (COAP) based on the perceptions of municipal health secretaries of Bipartite Interagency Commissions (CIB). For this purpose, we interviewed 195 secretaries (92% of the total) from October 2015 to August 2016. Based on the approach of policy analysis, the main hurdles identified were, in short, a traditional obstacle (lack of resources), one that has been gaining strength in recent years (judicialization of politics) and another, perhaps unheard of: the party-political system and the State Executive Branch are the great absentees in the coalitions in support of SUS regionalization policies. We can conclude that such obstacles indicate an extremely negative setting for the implementation of the COAP and other SUS regionalization policies. Thus, it is incumbent upon those involved to reflect, negotiate and build consensus on improving the health of the population and overcome such obstacles if, of course, they embrace the authors' concept that regionalization is fundamental for the SUS.
Makhijani, Vinod B.; Przekwas, Andrzej J.
2002-10-01
This report presents results of a DARPA/MTO Composite CAD Project aimed to develop a comprehensive microsystem CAD environment, CFD-ACE+ Multiphysics, for bio and microfluidic devices and complete microsystems. The project began in July 1998, and was a three-year team effort between CFD Research Corporation, California Institute of Technology (CalTech), University of California, Berkeley (UCB), and Tanner Research, with Mr. Don Verlee from Abbott Labs participating as a consultant on the project. The overall objective of this project was to develop, validate and demonstrate several applications of a user-configurable VLSI-type mixed-dimensionality software tool for design of biomicrofluidics devices and integrated systems. The developed tool would provide high fidelity 3-D multiphysics modeling capability, l-D fluidic circuits modeling, and SPICE interface for system level simulations, and mixed-dimensionality design. It would combine tools for layouts and process fabrication, geometric modeling, and automated grid generation, and interfaces to EDA tools (e.g. Cadence) and MCAD tools (e.g. ProE).
Xiang, Yu; Xu, Buqing; Mišta, Ladislav; Tufarelli, Tommaso; He, Qiongyi; Adesso, Gerardo
2017-10-01
Einstein-Podolsky-Rosen (EPR) steering is an asymmetric form of correlations which is intermediate between quantum entanglement and Bell nonlocality, and can be exploited as a resource for quantum communication with one untrusted party. In particular, steering of continuous-variable Gaussian states has been extensively studied theoretically and experimentally, as a fundamental manifestation of the EPR paradox. While most of these studies focused on quadrature measurements for steering detection, two recent works revealed that there exist Gaussian states which are only steerable by suitable non-Gaussian measurements. In this paper we perform a systematic investigation of EPR steering of bipartite Gaussian states by pseudospin measurements, complementing and extending previous findings. We first derive the density-matrix elements of two-mode squeezed thermal Gaussian states in the Fock basis, which may be of independent interest. We then use such a representation to investigate steering of these states as detected by a simple nonlinear criterion, based on second moments of the correlation matrix constructed from pseudospin operators. This analysis reveals previously unexplored regimes where non-Gaussian measurements are shown to be more effective than Gaussian ones to witness steering of Gaussian states in the presence of local noise. We further consider an alternative set of pseudospin observables, whose expectation value can be expressed more compactly in terms of Wigner functions for all two-mode Gaussian states. However, according to the adopted criterion, these observables are found to be always less sensitive than conventional Gaussian observables for steering detection. Finally, we investigate continuous-variable Werner states, which are non-Gaussian mixtures of Gaussian states, and find that pseudospin measurements are always more effective than Gaussian ones to reveal their steerability. Our results provide useful insights on the role of non
Chicca, E; Badoni, D; Dante, V; D'Andreagiovanni, M; Salina, G; Carota, L; Fusi, S; Del Giudice, P
2003-01-01
Electronic neuromorphic devices with on-chip, on-line learning should be able to modify quickly the synaptic couplings to acquire information about new patterns to be stored (synaptic plasticity) and, at the same time, preserve this information on very long time scales (synaptic stability). Here, we illustrate the electronic implementation of a simple solution to this stability-plasticity problem, recently proposed and studied in various contexts. It is based on the observation that reducing the analog depth of the synapses to the extreme (bistable synapses) does not necessarily disrupt the performance of the device as an associative memory, provided that 1) the number of neurons is large enough; 2) the transitions between stable synaptic states are stochastic; and 3) learning is slow. The drastic reduction of the analog depth of the synaptic variable also makes this solution appealing from the point of view of electronic implementation and offers a simple methodological alternative to the technological solution based on floating gates. We describe the full custom analog very large-scale integration (VLSI) realization of a small network of integrate-and-fire neurons connected by bistable deterministic plastic synapses which can implement the idea of stochastic learning. In the absence of stimuli, the memory is preserved indefinitely. During the stimulation the synapse undergoes quick temporary changes through the activities of the pre- and postsynaptic neurons; those changes stochastically result in a long-term modification of the synaptic efficacy. The intentionally disordered pattern of connectivity allows the system to generate a randomness suited to drive the stochastic selection mechanism. We check by a suitable stimulation protocol that the stochastic synaptic plasticity produces the expected pattern of potentiation and depression in the electronic network.
Carvajal, Gonzalo; Figueroa, Miguel
2014-07-01
Typical image recognition systems operate in two stages: feature extraction to reduce the dimensionality of the input space, and classification based on the extracted features. Analog Very Large Scale Integration (VLSI) is an attractive technology to achieve compact and low-power implementations of these computationally intensive tasks for portable embedded devices. However, device mismatch limits the resolution of the circuits fabricated with this technology. Traditional layout techniques to reduce the mismatch aim to increase the resolution at the transistor level, without considering the intended application. Relating mismatch parameters to specific effects in the application level would allow designers to apply focalized mismatch compensation techniques according to predefined performance/cost tradeoffs. This paper models, analyzes, and evaluates the effects of mismatched analog arithmetic in both feature extraction and classification circuits. For the feature extraction, we propose analog adaptive linear combiners with on-chip learning for both Least Mean Square (LMS) and Generalized Hebbian Algorithm (GHA). Using mathematical abstractions of analog circuits, we identify mismatch parameters that are naturally compensated during the learning process, and propose cost-effective guidelines to reduce the effect of the rest. For the classification, we derive analog models for the circuits necessary to implement Nearest Neighbor (NN) approach and Radial Basis Function (RBF) networks, and use them to emulate analog classifiers with standard databases of face and hand-writing digits. Formal analysis and experiments show how we can exploit adaptive structures and properties of the input space to compensate the effects of device mismatch at the application level, thus reducing the design overhead of traditional layout techniques. Results are also directly extensible to multiple application domains using linear subspace methods. Copyright © 2014 Elsevier Ltd. All rights
VLSI Design of a Variable-Length FFT/IFFT Processor for OFDM-Based Communication Systems
Directory of Open Access Journals (Sweden)
Jen-Chih Kuo
2003-12-01
Full Text Available The technique of {orthogonal frequency division multiplexing (OFDM} is famous for its robustness against frequency-selective fading channel. This technique has been widely used in many wired and wireless communication systems. In general, the {fast Fourier transform (FFT} and {inverse FFT (IFFT} operations are used as the modulation/demodulation kernel in the OFDM systems, and the sizes of FFT/IFFT operations are varied in different applications of OFDM systems. In this paper, we design and implement a variable-length prototype FFT/IFFT processor to cover different specifications of OFDM applications. The cached-memory FFT architecture is our suggested VLSI system architecture to design the prototype FFT/IFFT processor for the consideration of low-power consumption. We also implement the twiddle factor butterfly {processing element (PE} based on the {{coordinate} rotation digital computer (CORDIC} algorithm, which avoids the use of conventional multiplication-and-accumulation unit, but evaluates the trigonometric functions using only add-and-shift operations. Finally, we implement a variable-length prototype FFT/IFFT processor with TSMC 0.35Ã¢Â€Â‰ÃŽÂ¼m 1P4M CMOS technology. The simulations results show that the chip can perform (64-2048-point FFT/IFFT operations up to 80Ã¢Â€Â‰MHz operating frequency which can meet the speed requirement of most OFDM standards such as WLAN, ADSL, VDSL (256Ã¢ÂˆÂ¼2K, DAB, and 2K-mode DVB.
International Nuclear Information System (INIS)
Zhang, Xiu-xing; Li, Fu-li
2013-01-01
By using the lowest order expansion in the number of spins, we study the classical correlation (CC) and quantum correlations (QCs) between two spin subgroups of the Lipkin–Meshkov–Glick (LMG) model in both binary and trinary decompositions of spins. In the case of bipartitions, we find that the CC and all the QCs are divergent in the same singular behavior at the critical point of the LMG model. In the case of tripartitions, however, the CC is still divergent but the QCs remain finite at the critical point. The present result shows that the CC is very robust but the QCs are much frangible to the environment disturbance.
International Nuclear Information System (INIS)
Myhr, Geir Ove
2010-01-01
Just like we can divide the set of bipartite quantum states into separable states and entangled states, we can divide it into states with and without a symmetric extension. The states with a symmetric extension - which includes all the separable states - behave classically in many ways, while the states without a symmetric extension - which are all entangled - have the potential to exhibit quantum effects. The set of states with a symmetric extension is closed under local quantum operations assisted by one-way classical communication (1-LOCC) just like the set of separable states is closed under local operations assisted by two-way classical communication (LOCC). Because of this, states with a symmetric extension often play the same role in a one-way communication setting as the separable states play in a two-way communication setting. We show that any state with a symmetric extension can be decomposed into a convex combination of states that have a pure symmetric extension. A necessary condition for a state to have a pure symmetric extension is that the spectra of the local and global density matrices are equal. This condition is also sufficient for two qubits, but not for any larger systems. We present a conjectured necessary and sufficient condition for two-qubit states with a symmetric extension. Proofs are provided for some classes of states: rank-two states, states on the symmetric subspace, Bell-diagonal states and states that are invariant under S x S, where S is a phase gate. We also show how the symmetric extension problem for multi-qubit Bell-diagonal states can be simplified and the simplified problem implemented as a semidefinite program. Quantum key distribution protocols such as the six-state protocol and the BB84 protocol effectively gives Alice and Bob Bell-diagonal states that they measure in the standard basis to obtain a raw key which they may then process further to obtain a secret error-free key. When the raw key has a high error rate, the
Energy Technology Data Exchange (ETDEWEB)
Myhr, Geir Ove
2010-11-08
Just like we can divide the set of bipartite quantum states into separable states and entangled states, we can divide it into states with and without a symmetric extension. The states with a symmetric extension - which includes all the separable states - behave classically in many ways, while the states without a symmetric extension - which are all entangled - have the potential to exhibit quantum effects. The set of states with a symmetric extension is closed under local quantum operations assisted by one-way classical communication (1-LOCC) just like the set of separable states is closed under local operations assisted by two-way classical communication (LOCC). Because of this, states with a symmetric extension often play the same role in a one-way communication setting as the separable states play in a two-way communication setting. We show that any state with a symmetric extension can be decomposed into a convex combination of states that have a pure symmetric extension. A necessary condition for a state to have a pure symmetric extension is that the spectra of the local and global density matrices are equal. This condition is also sufficient for two qubits, but not for any larger systems. We present a conjectured necessary and sufficient condition for two-qubit states with a symmetric extension. Proofs are provided for some classes of states: rank-two states, states on the symmetric subspace, Bell-diagonal states and states that are invariant under S x S, where S is a phase gate. We also show how the symmetric extension problem for multi-qubit Bell-diagonal states can be simplified and the simplified problem implemented as a semidefinite program. Quantum key distribution protocols such as the six-state protocol and the BB84 protocol effectively gives Alice and Bob Bell-diagonal states that they measure in the standard basis to obtain a raw key which they may then process further to obtain a secret error-free key. When the raw key has a high error rate, the
Directory of Open Access Journals (Sweden)
Norton Sandra
2006-10-01
Full Text Available Abstract Background Hamate hook fracture is a common fracture in golfers and others who play sports that involve rackets or sticks such as tennis or hockey. This patient had a previous hamate fracture in the opposing wrist along with potential features of hamate bipartite. Case presentation A 19 year old male presented with a complaint of right wrist pain on the ulnar side of the wrist with no apparent mechanism of injury. The pain came on gradually one week before being seen in the office and he reported no prior care for the complaint. His history includes traumatic left hamate hook fracture with surgical excision. Conclusion The patient was found to have marked tenderness over the hamate and with a prior fracture to the other wrist, computed tomography of the wrist was ordered revealing a fracture to the hamate hook in the right wrist. He was referred for surgical evaluation and the hook of the hamate was excised. Post-surgically, the patient was able to return to normal activity within eight weeks. This case is indicative of fracture rather than hamate bipartite. This fracture should be considered in a case of ulnar sided wrist pain where marked tenderness is noted over the hamate, especially after participation in club or racket sports.
Mohamed, Abdel-Baset A.
2018-04-01
In this paper, some non-classical correlations are investigated for bipartite partitions of two qubits trapped in two spatially separated cavities connected by an optical fiber. The results show that the trace distance discord and Bell's non-locality introduce other quantum correlations beyond the entanglement. Moreover, the correlation functions of the trace distance discord and the Bell's non-locality are very sensitive to the initial correlations, the coupling strengths, and the dissipation rates of the cavities. The fluctuations of the correlation functions between their initial values and gained (loss) values appear due to the unitary evolution of the system. These fluctuations depend on the chosen initial correlations between the two subsystems. The maximal violations of Bell's inequality occur when the logarithmic negativity and the trace distance discord reach certain values. It is shown that the robustness of the non-classical correlations, against the dissipation rates of the cavities, depends on the bipartite partitions reduced density matrices of the system, and is also greatly enhanced by choosing appropriate coupling strengths.
Energy Technology Data Exchange (ETDEWEB)
Zhang, B
1999-07-01
This thesis deals with the design the development and the tests of an integrated circuit VLSI, supplying selective read and time measure for 16 channels. This circuit has been developed for a experiment of particles physics, BABAR, that will take place at SLAC (Stanford Linear Accelerator Center). A first part describes the physical stakes of the experiment, the electronic architecture and the place of the developed circuit in the research program. The second part presents the technical drawings of the circuit, the prototypes leading to the final design and the validity tests. (A.L.B.)
Hu, Kai; Ho, Tsung-Yi
2017-01-01
This book provides a comprehensive overview of flow-based, microfluidic VLSI. The authors describe and solve in a comprehensive and holistic manner practical challenges such as control synthesis, wash optimization, design for testability, and diagnosis of modern flow-based microfluidic biochips. They introduce practical solutions, based on rigorous optimization and formal models. The technical contributions presented in this book will not only shorten the product development cycle, but also accelerate the adoption and further development of modern flow-based microfluidic biochips, by facilitating the full exploitation of design complexities that are possible with current fabrication techniques. Offers the first practical problem formulation for automated control-layer design in flow-based microfluidic biochips and provides a systematic approach for solving this problem; Introduces a wash-optimization method for cross-contamination removal; Presents a design-for-testability (DfT) technique that can achieve 100...
Carrasco, Manuel; Garde, Andres; Murillo, Pilar; Serrano, Luis
2005-06-01
In this paper a novel design and implementation of a VLSI Analogue Neural Net based on Multi-Layer Perceptron (MLP) with on-chip Back Propagation (BP) learning algorithm suitable for the resolution of classification problems is described. In order to implement a general and programmable analogue architecture, the design has been carried out in a hierarchical way. In this way the net has been divided in synapsis-blocks and neuron-blocks providing an easy method for the analysis. These blocks basically consist on simple cells, which are mainly, the activation functions (NAF), derivatives (DNAF), multipliers and weight update circuits. The analogue design is based on current-mode translinear techniques using MOS transistors working in the weak inversion region in order to reduce both the voltage supply and the power consumption. Moreover, with the purpose of minimizing the noise, offset and distortion of even order, the topologies are fully-differential and balanced. The circuit, named ANNE (Analogue Neural NEt), has been prototyped and characterized as a proof of concept on CMOS AMI-0.5A technology occupying a total area of 2.7mm2. The chip includes two versions of neural nets with on-chip BP learning algorithm, which are respectively a 2-1 and a 2-2-1 implementations. The proposed nets have been experimentally tested using supply voltages from 2.5V to 1.8V, which is suitable for single cell lithium-ion battery supply applications. Experimental results of both implementations included in ANNE exhibit a good performance on solving classification problems. These results have been compared with other proposed Analogue VLSI implementations of Neural Nets published in the literature demonstrating that our proposal is very efficient in terms of occupied area and power consumption.
Directory of Open Access Journals (Sweden)
Vandewalle Pierre
2011-03-01
Full Text Available Abstract Background Quantitative studies of the variation of disparity during ontogeny exhibited by the radiation of coral reef fishes are lacking. Such studies dealing with the variation of disparity, i.e. the diversity of organic form, over ontogeny could be a first step in detecting evolutionary mechanisms in these fishes. The damselfishes (Pomacentridae have a bipartite life-cycle, as do the majority of demersal coral reef fishes. During their pelagic dispersion phase, all larvae feed on planktonic prey. On the other hand, juveniles and adults associated with the coral reef environment show a higher diversity of diets. Using geometric morphometrics, we study the ontogenetic dynamic of shape disparity of different head skeletal units (neurocranium, suspensorium and opercle, mandible and premaxilla in this fish family. We expected that larvae of different species might be relatively similar in shapes. Alternatively, specialization may become notable even in the juvenile and adult phase. Results The disparity levels increase significantly throughout ontogeny for each skeletal unit. At settlement, all larval shapes are already species-specific. Damselfishes show high levels of ontogenetic allometry during their post-settlement growth. The divergence of allometric patterns largely explains the changes in patterns and levels of shape disparity over ontogeny. The rate of shape change and the length of ontogenetic trajectories seem to be less variable among species. We also show that the high levels of shape disparity at the adult stage are correlated to a higher level of ecological and functional diversity in this stage. Conclusion Diversification throughout ontogeny of damselfishes results from the interaction among several developmental novelties enhancing disparity. The bipartite life-cycle of damselfishes exemplifies a case where the variation of environmental factors, i.e. the transition from the more homogeneous oceanic environment to the
2011-01-01
Background Quantitative studies of the variation of disparity during ontogeny exhibited by the radiation of coral reef fishes are lacking. Such studies dealing with the variation of disparity, i.e. the diversity of organic form, over ontogeny could be a first step in detecting evolutionary mechanisms in these fishes. The damselfishes (Pomacentridae) have a bipartite life-cycle, as do the majority of demersal coral reef fishes. During their pelagic dispersion phase, all larvae feed on planktonic prey. On the other hand, juveniles and adults associated with the coral reef environment show a higher diversity of diets. Using geometric morphometrics, we study the ontogenetic dynamic of shape disparity of different head skeletal units (neurocranium, suspensorium and opercle, mandible and premaxilla) in this fish family. We expected that larvae of different species might be relatively similar in shapes. Alternatively, specialization may become notable even in the juvenile and adult phase. Results The disparity levels increase significantly throughout ontogeny for each skeletal unit. At settlement, all larval shapes are already species-specific. Damselfishes show high levels of ontogenetic allometry during their post-settlement growth. The divergence of allometric patterns largely explains the changes in patterns and levels of shape disparity over ontogeny. The rate of shape change and the length of ontogenetic trajectories seem to be less variable among species. We also show that the high levels of shape disparity at the adult stage are correlated to a higher level of ecological and functional diversity in this stage. Conclusion Diversification throughout ontogeny of damselfishes results from the interaction among several developmental novelties enhancing disparity. The bipartite life-cycle of damselfishes exemplifies a case where the variation of environmental factors, i.e. the transition from the more homogeneous oceanic environment to the coral reef offering a wide
Johnsson, Lennart
1980-01-01
Integrated circuit technology is rapidly approaching a state where feature sizes of one micron or less are tractable. Chip sizes are increasing slowly. These two developments result in considerably increased complexity in chip design. The physical characteristics of integrated circuit technology are also changing. The cost of communication will be dominating making new architectures and algorithms both feasible and desirable. A large number of processors on a single chip will be possible....
DEFF Research Database (Denmark)
Rasmussen, Ole Steen
constructed. It contains a semantical embedding of Ruby in Zermelo-Fraenkel set theory (ZF) implemented in the Isabelle theorem prover. A small subset of Ruby, called Pure Ruby, is embedded as a conservative extension of ZF and characterised by an inductive definition. Many useful structures used...
1983-01-01
for otherwise, since sc = xs2 . we would ELIE system. This algorithm also applies to SL) systems have been able to compute zec without looking at block...Prof. Peter R. Cappello of the CompuLer Science Department, University of California, Santa Barbara, I I Im i Ii - 19 - Caiifo:nia. Some of the work...multiple pro- cessors will not be as simple as the MMM ones. Acknowledgments. Several useful ideas and suggestions were made by Jim Gray, Peter Honneyman
Directory of Open Access Journals (Sweden)
Lourdes de Costa Remor
2009-01-01
Full Text Available O artigo aborda o gerenciamento de processo e a sua implicação na construção da memória organizacional. Apresenta a relevância do conhecimento em uma organização e os danos causados quando eles não são incorporados à memória da organização. O gerenciamento de processo por organizar e sistematizar os trabalhos parece permitir a disseminação do conhecimento dentro da organização, tanto para os indivíduos quanto para os repositórios. E por fim, apresenta o processo da pactuação na Comissão Intergestores Bipartite, Fórum de negociação e tomada de decisão entre os Gestores: Municipais e Estadual do SUS.The article approaches the management process and the implication in the construction of the organization’s memory. It presents the relevance of the knowledge in an organization and the mischief caused when they are not incorporated to the memory of the organization. The management of the process by organizing and systematizing the works, and for that, it permits the dissemination of the knowledge inside the organization, so much for the individuals or for the repositories. And finally, it presents the process of the agreement in the Intergestores Bipartite Commission, Forum of negotiation and decision-making between the State and Municipal Agents of the SUS.
Gabus, C; Ficheux, D; Rau, M; Keith, G; Sandmeyer, S; Darlix, J L
1998-08-17
Retroviruses, including HIV-1 and the distantly related yeast retroelement Ty3, all encode a nucleoprotein required for virion structure and replication. During an in vitro comparison of HIV-1 and Ty3 nucleoprotein function in RNA dimerization and cDNA synthesis, we discovered a bipartite primer-binding site (PBS) for Ty3 composed of sequences located at opposite ends of the genome. Ty3 cDNA synthesis requires the 3' PBS for primer tRNAiMet annealing to the genomic RNA, and the 5' PBS, in cis or in trans, as the reverse transcription start site. Ty3 RNA alone is unable to dimerize, but formation of dimeric tRNAiMet bound to the PBS was found to direct dimerization of Ty3 RNA-tRNAiMet. Interestingly, HIV-1 nucleocapsid protein NCp7 and Ty3 NCp9 were interchangeable using HIV-1 and Ty3 RNA template-primer systems. Our findings impact on the understanding of non-canonical reverse transcription as well as on the use of Ty3 systems to screen for anti-NCp7 drugs.
Directory of Open Access Journals (Sweden)
De Bruyn Alexandre
2012-11-01
Full Text Available Abstract Background Cassava (Manihot esculenta is a major food source for over 200 million sub-Saharan Africans. Unfortunately, its cultivation is severely hampered by cassava mosaic disease (CMD. Caused by a complex of bipartite cassava mosaic geminiviruses (CMG species (Family: Geminivirideae; Genus: Begomovirus CMD has been widely described throughout Africa and it is apparent that CMG's are expanding their geographical distribution. Determining where and when CMG movements have occurred could help curtail its spread and reveal the ecological and anthropic factors associated with similar viral invasions. We applied Bayesian phylogeographic inference and recombination analyses to available and newly described CMG sequences to reconstruct a plausible history of CMG diversification and migration between Africa and South West Indian Ocean (SWIO islands. Results The isolation and analysis of 114 DNA-A and 41 DNA-B sequences demonstrated the presence of three CMG species circulating in the Comoros and Seychelles archipelagos (East African cassava mosaic virus, EACMV; East African cassava mosaic Kenya virus, EACMKV; and East African cassava mosaic Cameroon virus, EACMCV. Phylogeographic analyses suggest that CMG’s presence on these SWIO islands is probably the result of at least four independent introduction events from mainland Africa occurring between 1988 and 2009. Amongst the islands of the Comoros archipelago, two major migration pathways were inferred: One from Grande Comore to Mohéli and the second from Mayotte to Anjouan. While only two recombination events characteristic of SWIO islands isolates were identified, numerous re-assortments events were detected between EACMV and EACMKV, which seem to almost freely interchange their genome components. Conclusions Rapid and extensive virus spread within the SWIO islands was demonstrated for three CMG complex species. Strong evolutionary or ecological interaction between CMG species may explain
Partial Transposition on Bipartite System
International Nuclear Information System (INIS)
Xi-Jun, Ren; Yong-Jian, Han; Yu-Chun, Wu; Guang-Can, Guo
2008-01-01
Many properties of partial transposition are unclear as yet. Here we carefully consider the number of the negative eigenvalues of ρ T (ρ's partial transposition) when ρ is a two-partite state. There is strong evidence to show that the number of negative eigenvalues of ρ T is N(N − 1)/2 at most when ρ is a state in Hilbert space C N C N . For the special case, the 2 × 2 system, we use this result to give a partial proof of the conjecture |ρ T | T ≥ 0. We find that this conjecture is strongly connected with the entanglement of the state corresponding to the negative eigenvalue of ρ T or the negative entropy of ρ
Entanglement transfer between bipartite systems
International Nuclear Information System (INIS)
Bougouffa, Smail; Ficek, Zbigniew
2012-01-01
The problem of a controlled transfer of an entanglement initially encoded into two two-level atoms that are successively sent through two single-mode cavities is investigated. The atoms and the cavity modes form a four-qubit system and we demonstrate the conditions under which the initial entanglement encoded into the atoms can be completely transferred to other pairs of qubits. We find that in the case of non-zero detuning between the atomic transition frequencies and the cavity mode frequencies, no complete transfer of the initial entanglement is possible to any of the other pairs of qubits. In the case of exact resonance and equal coupling strengths of the atoms to the cavity modes, an initial maximally entangled state of the atoms can be completely transferred to the cavity modes. Complete transfer of the entanglement is restricted to the cavity modes, with transfer to the other pairs being limited to 50%. We find that complete transfer of an initial entanglement to other pairs of qubits may take place if the initial state is not the maximally entangled state and the atoms couple to the cavity modes with unequal strengths. Depending on the ratio between the coupling strengths, optimal entanglement can be created between the atoms and one of the cavity modes.
Recognition of VLSI Module Isomorphism
1990-03-01
forthforth->next; 6.5 else{ prev4=prev4->next; forth=forth->next; if (header-. nenI ->tai==third){ header-.nevrI->tail=prev3; prev3->next=NULL; end...end=TRUE; if (header-. nenI ->head=third){ header-.newn->head=third->next; I if((third!=prev3)&&(finished!=TRUE)){ prev3->next=prev3->next->next; third
VLSI Based Multiprocessor Communications Networks.
1982-09-01
Networks". The contract began on September 1,1980 and was approved on scientific /technical grounds for a duration of three years. Incremental funding was...values for the individual delays will vary from comunicating modules (ij) are shown in Figure 4 module to module due to processing and fabrication
Partial transposition on bi-partite system
Han, Y. -J.; Ren, X. J.; Wu, Y. C.; Guo, G. -C.
2006-01-01
Many of the properties of the partial transposition are not clear so far. Here the number of the negative eigenvalues of K(T)(the partial transposition of K) is considered carefully when K is a two-partite state. There are strong evidences to show that the number of negative eigenvalues of K(T) is N(N-1)/2 at most when K is a state in Hilbert space N*N. For the special case, 2*2 system(two qubits), we use this result to give a partial proof of the conjecture sqrt(K(T))(T)>=0. We find that thi...
Volumes of conditioned bipartite state spaces
International Nuclear Information System (INIS)
Milz, Simon; Strunz, Walter T
2015-01-01
We analyze the metric properties of conditioned quantum state spaces M η (n×m) . These spaces are the convex sets of nm×nm density matrices that, when partially traced over m degrees of freedom, respectively yield the given n × n density matrix η. For the case n = 2, the volume of M η (2×m) equipped with the Hilbert–Schmidt measure can be conjectured to be a simple polynomial of the radius of η in the Bloch-ball. Remarkably, for m=2,3 we find numerically that the probability p sep (2×m) (η) to find a separable state in M η (2×m) is independent of η (except for η pure). For m>3, the same holds for p PosPart (2×m) (η), the probability to find a state with a positive partial transpose in M η (2×m) . These results are proven analytically for the case of the family of 4 × 4 X-states, and thoroughly numerically investigated for the general case. The important implications of these findings for the clarification of open problems in quantum theory are pointed out and discussed. (paper)
Quantum control on entangled bipartite qubits
International Nuclear Information System (INIS)
Delgado, Francisco
2010-01-01
Ising interactions between qubits can produce distortion on entangled pairs generated for engineering purposes (e.g., for quantum computation or quantum cryptography). The presence of parasite magnetic fields destroys or alters the expected behavior for which it was intended. In addition, these pairs are generated with some dispersion in their original configuration, so their discrimination is necessary for applications. Nevertheless, discrimination should be made after Ising distortion. Quantum control helps in both problems; making some projective measurements upon the pair to decide the original state to replace it, or just trying to reconstruct it using some procedures which do not alter their quantum nature. Results about the performance of these procedures are reported. First, we will work with pure systems studying restrictions and advantages. Then, we will extend these operations for mixed states generated with uncertainty in the time of distortion, correcting them by assuming the control prescriptions for the most probable one.
VLSI implementation of an AMDF pitch detector
Smith, Tony; Gittel, Falko; Schwarzbacher, Andreas; Hilt, E.; Timoney, Joseph
2003-01-01
Pitch detectors are used in a variety of speech processing applications such as speech recognition systems where the pitch of the speaker is used as one parameter for identification purposes. Furthermore, pitch detectors are also sued with adaptive filters to achieve high quality adaptive noise cancellation of speech signals. In voice conversion systems, pitch detection is an essential step since the pitch of the modified signal is altered to model the target voice. This paper describes a ...
Robust Bioinformatics Recognition with VLSI Biochip Microsystem
Lue, Jaw-Chyng L.; Fang, Wai-Chi
2006-01-01
A microsystem architecture for real-time, on-site, robust bioinformatic patterns recognition and analysis has been proposed. This system is compatible with on-chip DNA analysis means such as polymerase chain reaction (PCR)amplification. A corresponding novel artificial neural network (ANN) learning algorithm using new sigmoid-logarithmic transfer function based on error backpropagation (EBP) algorithm is invented. Our results show the trained new ANN can recognize low fluorescence patterns better than the conventional sigmoidal ANN does. A differential logarithmic imaging chip is designed for calculating logarithm of relative intensities of fluorescence signals. The single-rail logarithmic circuit and a prototype ANN chip are designed, fabricated and characterized.
Custom VLSI circuits for high energy physics
International Nuclear Information System (INIS)
Parker, S.
1998-06-01
This article provides a brief guide to integrated circuits, including their design, fabrication, testing, radiation hardness, and packaging. It was requested by the Panel on Instrumentation, Innovation, and Development of the International Committee for Future Accelerators, as one of a series of articles on instrumentation for future experiments. Their original request emphasized a description of available custom circuits and a set of recommendations for future developments. That has been done, but while traps that stop charge in solid-state devices are well known, those that stop physicists trying to develop the devices are not. Several years spent dodging the former and developing the latter made clear the need for a beginner's guide through the maze, and that is the main purpose of this text
Learning in Neural Networks: VLSI Implementation Strategies
Duong, Tuan Anh
1995-01-01
Fully-parallel hardware neural network implementations may be applied to high-speed recognition, classification, and mapping tasks in areas such as vision, or can be used as low-cost self-contained units for tasks such as error detection in mechanical systems (e.g. autos). Learning is required not only to satisfy application requirements, but also to overcome hardware-imposed limitations such as reduced dynamic range of connections.
Global floor planning approach for VLSI design
International Nuclear Information System (INIS)
LaPotin, D.P.
1986-01-01
Within a hierarchical design environment, initial decisions regarding the partitioning and choice of module attributes greatly impact the quality of the resulting IC in terms of area and electrical performance. This dissertation presents a global floor-planning approach which allows designers to quickly explore layout issues during the initial stages of the IC design process. In contrast to previous efforts, which address the floor-planning problem from a strict module placement point of view, this approach considers floor-planning from an area planning point of view. The approach is based upon a combined min-cut and slicing paradigm, which ensures routability. To provide flexibility, modules may be specified as having a number of possible dimensions and orientations, and I/O pads as well as layout constraints are considered. A slicing-tree representation is employed, upon which a sequence of traversal operations are applied in order to obtain an area efficient layout. An in-place partitioning technique, which provides an improvement over previous min-cut and slicing-based efforts, is discussed. Global routing and module I/O pin assignment are provided for floor-plan evaluation purposes. A computer program, called Mason, has been developed which efficiently implements the approach and provides an interactive environment for designers to perform floor-planning. Performance of this program is illustrated via several industrial examples
Systolic automata for VLSI on balanced trees
Energy Technology Data Exchange (ETDEWEB)
Culik, K Ii; Gruska, J; Salomaa, A
1983-01-01
Systolic tree automata with a binary (or, more generally, balanced) underlying tree are investigated. The main emphasis is on input conditions, decidability, and characterization of acceptable languages. 4 references.
Custom VLSI circuits for high energy physics
Energy Technology Data Exchange (ETDEWEB)
Parker, S. [Univ. of Hawaii, Honolulu, HI (United States)
1998-06-01
This article provides a brief guide to integrated circuits, including their design, fabrication, testing, radiation hardness, and packaging. It was requested by the Panel on Instrumentation, Innovation, and Development of the International Committee for Future Accelerators, as one of a series of articles on instrumentation for future experiments. Their original request emphasized a description of available custom circuits and a set of recommendations for future developments. That has been done, but while traps that stop charge in solid-state devices are well known, those that stop physicists trying to develop the devices are not. Several years spent dodging the former and developing the latter made clear the need for a beginner`s guide through the maze, and that is the main purpose of this text.
Area-Efficient Graph Layouts (for VLSI).
1980-08-13
thle short side, then no rectangle is ew r generated x’.ho se aspect r~itho i s \\orse di ai aJ. ’I lie d i % ide-I mid -cimq tier clInt ruolIn in... Sutherland and Donald Oestrcichcr, "flow big should a printed circuit board be?," ILEEE, Transactions on Computers, Vol. C-22, May 1973, pp. 537-542. 22
VLSI PARTITIONING ALGORITHM WITH ADAPTIVE CONTROL PARAMETER
Directory of Open Access Journals (Sweden)
P. N. Filippenko
2013-03-01
Full Text Available The article deals with the problem of very large-scale integration circuit partitioning. A graph is selected as a mathematical model describing integrated circuit. Modification of ant colony optimization algorithm is presented, which is used to solve graph partitioning problem. Ant colony optimization algorithm is an optimization method based on the principles of self-organization and other useful features of the ants’ behavior. The proposed search system is based on ant colony optimization algorithm with the improved method of the initial distribution and dynamic adjustment of the control search parameters. The experimental results and performance comparison show that the proposed method of very large-scale integration circuit partitioning provides the better search performance over other well known algorithms.
General entanglement-assisted transformation for bipartite pure quantum states
Song, Wei; Huang, Yan; Nai-LeLiu; Chen, Zeng-Bing
2007-01-01
We introduce the general catalysts for pure entanglement transformations under local operations and classical communications in such a way that we disregard the profit and loss of entanglement of the catalysts per se. As such, the possibilities of pure entanglement transformations are greatly expanded. We also design an efficient algorithm to detect whether a k × k general catalyst exists for a given entanglement transformation. This algorithm can also be exploited to witness the existence of standard catalysts.
Information Filtering via Heterogeneous Diffusion in Online Bipartite Networks.
Zhang, Fu-Guo; Zeng, An
2015-01-01
The rapid expansion of Internet brings us overwhelming online information, which is impossible for an individual to go through all of it. Therefore, recommender systems were created to help people dig through this abundance of information. In networks composed by users and objects, recommender algorithms based on diffusion have been proven to be one of the best performing methods. Previous works considered the diffusion process from user to object, and from object to user to be equivalent. We show in this work that it is not the case and we improve the quality of the recommendation by taking into account the asymmetrical nature of this process. We apply this idea to modify the state-of-the-art recommendation methods. The simulation results show that the new methods can outperform these existing methods in both recommendation accuracy and diversity. Finally, this modification is checked to be able to improve the recommendation in a realistic case.
Tolerating Correlated Failures for Generalized Cartesian Distributions via Bipartite Matching
International Nuclear Information System (INIS)
Ali, Nawab; Krishnamoorthy, Sriram; Halappanavar, Mahantesh; Daily, Jeffrey A.
2011-01-01
Faults are expected to play an increasingly important role in how algorithms and applications are designed to run on future extreme-scale systems. A key ingredient of any approach to fault tolerance is effective support for fault tolerant data storage. A typical application execution consists of phases in which certain data structures are modified while others are read-only. Often, read-only data structures constitute a large fraction of total memory consumed. Fault tolerance for read-only data can be ensured through the use of checksums or parities, without resorting to expensive in-memory duplication or checkpointing to secondary storage. In this paper, we present a graph-matching approach to compute and store parity data for read-only matrices that are compatible with fault tolerant linear algebra (FTLA). Typical approaches only support blocked data distributions with each process holding one block with the parity located on additional processes. The matrices are assumed to be blocked by a cartesian grid with each block assigned to a process. We consider a generalized distribution in which each process can be assigned arbitrary blocks. We also account for the fact that multiple processes might be part of the same failure unit, say an SMP node. The flexibility enabled by our novel application of graph matching extends fault tolerance support to data distributions beyond those supported by prior work. We evaluate the matching implementations and cost to compute the parity and recover lost data, demonstrating the low overhead incurred by our approach.
Reply to "Comment on `Protecting bipartite entanglement by quantum interferences' "
Das, Sumanta; Agarwal, G. S.
2018-03-01
In a recent Comment Nair and Arun, Phys. Rev. A 97, 036301 (2018), 10.1103/PhysRevA.97.036301, it was concluded that the two-qubit entanglement protection reported in our work [Das and Agarwal, Phys. Rev. A 81, 052341 (2010), 10.1103/PhysRevA.81.052341] is erroneous. While we acknowledge the error in analytical results on concurrence when dipole matrix elements were unequal, the essential conclusions on entanglement protection are not affected.
Direct measurement of nonlinear properties of bipartite quantum states.
Bovino, Fabio Antonio; Castagnoli, Giuseppe; Ekert, Artur; Horodecki, Paweł; Alves, Carolina Moura; Sergienko, Alexander Vladimir
2005-12-09
Nonlinear properties of quantum states, such as entropy or entanglement, quantify important physical resources and are frequently used in quantum-information science. They are usually calculated from a full description of a quantum state, even though they depend only on a small number of parameters that specify the state. Here we extract a nonlocal and a nonlinear quantity, namely, the Renyi entropy, from local measurements on two pairs of polarization-entangled photons. We also introduce a "phase marking" technique which allows the selection of uncorrupted outcomes even with nondeterministic sources of entangled photons. We use our experimental data to demonstrate the violation of entropic inequalities. They are examples of nonlinear entanglement witnesses and their power exceeds all linear tests for quantum entanglement based on all possible Bell-Clauser-Horne-Shimony-Holt inequalities.
Quantum correlations in a bipartite multiqubit spin ring system
International Nuclear Information System (INIS)
Doronin, S I; Fel’dman, E B; Kuznetsova, E I
2015-01-01
We consider a spin ring with an arbitrary number of spins on the ring and one spin in its center in a strong external magnetic field. The spins on the ring are connected by the secular dipole–dipole interactions and interact with the central spin through the Heisenberg zz-interaction. We show that the quantum discord, describing quantum correlations between the ring and the central spin, can be obtained analytically for an arbitrary number of the spins in the high-temperature approximation. We demonstrate the evolution of quantum correlations at different numbers of the spins. The contributions of longitudinal and transversal spin interactions to the quantum discord are discussed. (paper)
Transformation of bipartite non-maximally entangled states into a ...
Indian Academy of Sciences (India)
Ministry of Education, School of Physics & Material Science, Anhui University, Hefei ... MS received 9 October 2014; revised 10 January 2015; accepted 22 April 2015 ... in some sense, be regarded as an entanglement concentration process.
Better bounds for incremental frequency allocation in bipartite graphs
Czech Academy of Sciences Publication Activity Database
Chrobak, M.; Jeż, Łukasz; Sgall, J.
2013-01-01
Roč. 514, 25 November (2013), s. 75-83 ISSN 0304-3975 R&D Projects: GA AV ČR IAA100190902; GA ČR GBP202/12/G061 Institutional support: RVO:67985840 Keywords : online algorithms * frequency allocation * graph algorithms Subject RIV: BA - General Mathematics Impact factor: 0.516, year: 2013 http://www.sciencedirect.com/science/article/pii/S0304397512004781
Partial list of bipartite Bell inequalities with four binary settings
International Nuclear Information System (INIS)
Brunner, Nicolas; Gisin, Nicolas
2008-01-01
We give a partial list of 26 tight Bell inequalities for the case where Alice and Bob choose among four two-outcome measurements. All tight Bell inequalities with less settings are reviewed as well. For each inequality we compute numerically the maximal quantum violation, the resistance to noise and the minimal detection efficiency required for closing the detection loophole. Surprisingly, most of these inequalities are outperformed by the CHSH inequality
VLSI Design Tools, Reference Manual, Release 2.0.
1984-08-01
eder. 2.3 ITACV: Libary ofC readne. far oesumdg a layoit 1-,, tiling. V ~2.4 "QUILT: CeinS"Wbesa-i-M-8euar ray f atwok til 2.5 "TIL: Tockmeleff...8217patterns package was added so that complex and repetitive digital waveforms could be generated far more easily. The recently written program MTP (Multiple...circuit model to estimate timing delays through digital circuits. It also has a mode that allows it to be used as a switch (gate) level simulator
A VLSI System-on-Chip for Particle Detectors
AUTHOR|(CDS)2078019
In this thesis I present a System-on-Chip (SoC) I designed to oer a self- contained, compact data acquisition platform for micromegas detector mon- itoring. I carried on my work within the RD-51 collab oration of CERN. With a companion ADC, my architecture is capable to acquire the signal from a detector electro de, pro cess the data and p erform monitoring tests. The SoC is built around on a custom 8-bit micropro cessor with internal mem- ory resources and emb eds the p eripherals to b e interf...
Handbook of VLSI microlithography principles, technology and applications
Glendinning, William B
1991-01-01
This handbook gives readers a close look at the entire technology of printing very high resolution and high density integrated circuit (IC) patterns into thin resist process transfer coatings-- including optical lithography, electron beam, ion beam, and x-ray lithography. The book's main theme is the special printing process needed to achieve volume high density IC chip production, especially in the Dynamic Random Access Memory (DRAM) industry. The book leads off with a comparison of various lithography methods, covering the three major patterning parameters of line/space, resolution, line e
Sputtering materials for VLSI and thin film devices
Sarkar, Jaydeep
2010-01-01
An important resource for students, engineers and researchers working in the area of thin film deposition using physical vapor deposition (e.g. sputtering) for semiconductor, liquid crystal displays, high density recording media and photovoltaic device (e.g. thin film solar cell) manufacturing. This book also reviews microelectronics industry topics such as history of inventions and technology trends, recent developments in sputtering technologies, manufacturing steps that require sputtering of thin films, the properties of thin films and the role of sputtering target performance on overall p
Principles of VLSI RTL design a practical guide
Churiwala, Sanjay; Gianfagna, Mike
2011-01-01
This book examines the impact of register transfer level (RTL) design choices that may result in issues of testability, data synchronization across clock domains, synthesizability, power consumption and routability, that appear later in the product lifecycle.
Rapid Assemblers for Voxel-Based VLSI Robotics
2014-02-12
flux vector given by the Nernst -Planck equation ( equation ), where the partial derivative of the concentration of ions with respect to time plus the...species i given by the Nernst -Einstein equation . The boundary conditions are that the diffusive and convective contribu- tions to the flux are zero at...dependent partial differential equations . SIAM Journal of Numerical Analysis, 32(3):797-823, 1995. Task 2: cm-scale voxels for prototypes Task
Non-linear feedback neural networks VLSI implementations and applications
Ansari, Mohd Samar
2014-01-01
This book aims to present a viable alternative to the Hopfield Neural Network (HNN) model for analog computation. It is well known that the standard HNN suffers from problems of convergence to local minima, and requirement of a large number of neurons and synaptic weights. Therefore, improved solutions are needed. The non-linear synapse neural network (NoSyNN) is one such possibility and is discussed in detail in this book. This book also discusses the applications in computationally intensive tasks like graph coloring, ranking, and linear as well as quadratic programming. The material in the book is useful to students, researchers and academician working in the area of analog computation.
A VLSI-Based High-Performance Raster Image System.
1986-05-08
and data in broadcast form to the array of memory -hips in the frame buffer, shown in the bottom block. This is simply a physical structure to hold up...Principal Investigator: John Poulton Collaboration on algorithm development: Prof. Jack Goldfeather (Dept. of Mathematics, Carleton Collge ...1983) Cheng-Hong Hsieh (MS, Computer Science, May, 1985) Jeff P. Hultquist Susan Spach Undergraduate ResearLh Assistant: Sonya Holder (BS, Physics , May
FFT Based VLSI Digital One Bit Electronic Warfare Receiver
National Research Council Canada - National Science Library
Chien-In, Henry
1998-01-01
... (1 GHz) digital receiver designed for electronic warfare applications. The receiver can process two simultaneous signals and has the potential for fabrication on a single multi-chip module (MCM...
High speed VLSI neural network for high energy physics
Masa, P.; Masa, P.; Hoen, K.; Hoen, Klaas; Wallinga, Hans
1994-01-01
A CMOS neural network IC is discussed which was designed for very high speed applications. The parallel architecture, analog computing and digital weight storage provides unprecedented computing speed combined with ease of use. The circuit classifies up to 70 dimensional vectors within 20
An analog VLSI chip emulating polarization vision of Octopus retina.
Momeni, Massoud; Titus, Albert H
2006-01-01
Biological systems provide a wealth of information which form the basis for human-made artificial systems. In this work, the visual system of Octopus is investigated and its polarization sensitivity mimicked. While in actual Octopus retina, polarization vision is mainly based on the orthogonal arrangement of its photoreceptors, our implementation uses a birefringent micropolarizer made of YVO4 and mounted on a CMOS chip with neuromorphic circuitry to process linearly polarized light. Arranged in an 8 x 5 array with two photodiodes per pixel, each consuming typically 10 microW, this circuitry mimics both the functionality of individual Octopus retina cells by computing the state of polarization and the interconnection of these cells through a bias-controllable resistive network.
Neuromorphic VLSI vision system for real-time texture segregation.
Shimonomura, Kazuhiro; Yagi, Tetsuya
2008-10-01
The visual system of the brain can perceive an external scene in real-time with extremely low power dissipation, although the response speed of an individual neuron is considerably lower than that of semiconductor devices. The neurons in the visual pathway generate their receptive fields using a parallel and hierarchical architecture. This architecture of the visual cortex is interesting and important for designing a novel perception system from an engineering perspective. The aim of this study is to develop a vision system hardware, which is designed inspired by a hierarchical visual processing in V1, for real time texture segregation. The system consists of a silicon retina, orientation chip, and field programmable gate array (FPGA) circuit. The silicon retina emulates the neural circuits of the vertebrate retina and exhibits a Laplacian-Gaussian-like receptive field. The orientation chip selectively aggregates multiple pixels of the silicon retina in order to produce Gabor-like receptive fields that are tuned to various orientations by mimicking the feed-forward model proposed by Hubel and Wiesel. The FPGA circuit receives the output of the orientation chip and computes the responses of the complex cells. Using this system, the neural images of simple cells were computed in real-time for various orientations and spatial frequencies. Using the orientation-selective outputs obtained from the multi-chip system, a real-time texture segregation was conducted based on a computational model inspired by psychophysics and neurophysiology. The texture image was filtered by the two orthogonally oriented receptive fields of the multi-chip system and the filtered images were combined to segregate the area of different texture orientation with the aid of FPGA. The present system is also useful for the investigation of the functions of the higher-order cells that can be obtained by combining the simple and complex cells.
Evolution of the MOS transistor - From conception to VLSI
International Nuclear Information System (INIS)
Sah, C.T.
1988-01-01
Historical developments of the metal-oxide-semiconductor field-effect-transistor (MOSFET) during the last sixty years are reviewed, from the 1928 patent disclosures of the field-effect conductivity modulation concept and the semiconductor triodes structures proposed by Lilienfeld to the 1947 Shockley-originated efforts which led to the laboratory demonstration of the modern silicon MOSFET thirty years later in 1960. A survey is then made of the milestones of the past thirty years leading to the latest submicron silicon logic CMOS (Complementary MOS) and BICMOS (Bipolar-Junction-Transistor CMOS combined) arrays and the three-dimensional and ferroelectric extensions of Dennard's one-transistor dynamic random access memory (DRAM) cell. Status of the submicron lithographic technologies (deep ultra-violet light, X-ray, electron-beam) are summarized. Future trends of memory cell density and logic gate speed are projected. Comparisons of the switching speed of the silicon MOSFET with that of silicon bipolar and GaAs field-effect transistors are reviewed. Use of high-temperature superconducting wires and GaAs-on-Si monolithic semiconductor optical clocks to break the interconnect-wiring delay barrier is discussed. Further needs in basic research and mathematical modeling on the failure mechanisms in submicron silicon transistors at high electric fields (hot electron effects) and in interconnection conductors at high current densities and low as well as high electric fields (electromigration) are indicated
Chaotic generation of PN sequences : a VLSI implementation
Dornbusch, A.; Pineda de Gyvez, J.
1999-01-01
Generation of repeatable pseudo-random sequences with chaotic analog electronics is not feasible using standard circuit topologies. Component variation caused by imperfect fabrication causes the same divergence of output sequences as does varying initial conditions. By quantizing the output of a
VLSI for High-Speed Digital Signal Processing
1994-09-30
particular, the design, layout and fab - rication of integrated circuits. The primary project for this grant has been the design and implementation of a...targeted at 33.36 dB, and PSNR (dB) Rate ( bpp ) the FRSBC algorithm, targeted at 0.5 bits/pixel, respec- Filter FDSBC FRSBC FDSBC FRSBC tively. The filter...to mean square error d by as shown in Fig. 6, is used, yielding a total of 16 subbands. 255’ The rates, in bits per pixel ( bpp ), and the peak signal
Complex VLSI Feature Comparison for Commercial Microelectronics Verification
2014-03-27
corruption , tampering and counterfeiting due to these technologies’ extremely sensitive purposes. Adversarial intervention in the IC design and...counterfeiting in its motive: whereas counterfeiting is usually motivated by greed , tampering is an act of espionage or sabotage [26]. Finally, poor
How to build VLSI-efficient neural chips
Energy Technology Data Exchange (ETDEWEB)
Beiu, V.
1998-02-01
This paper presents several upper and lower bounds for the number-of-bits required for solving a classification problem, as well as ways in which these bounds can be used to efficiently build neural network chips. The focus will be on complexity aspects pertaining to neural networks: (1) size complexity and depth (size) tradeoffs, and (2) precision of weights and thresholds as well as limited interconnectivity. They show difficult problems-exponential growth in either space (precision and size) and/or time (learning and depth)-when using neural networks for solving general classes of problems (particular cases may enjoy better performances). The bounds for the number-of-bits required for solving a classification problem represent the first step of a general class of constructive algorithms, by showing how the quantization of the input space could be done in O (m{sup 2}n) steps. Here m is the number of examples, while n is the number of dimensions. The second step of the algorithm finds its roots in the implementation of a class of Boolean functions using threshold gates. It is substantiated by mathematical proofs for the size O (mn/{Delta}), and the depth O [log(mn)/log{Delta}] of the resulting network (here {Delta} is the maximum fan in). Using the fan in as a parameter, a full class of solutions can be designed. The third step of the algorithm represents a reduction of the size and an increase of its generalization capabilities. Extensions by using analogue COMPARISONs, allows for real inputs, and increase the generalization capabilities at the expense of longer training times. Finally, several solutions which can lower the size of the resulting neural network are detailed. The interesting aspect is that they are obtained for limited, or even constant, fan-ins. In support of these claims many simulations have been performed and are called upon.
A Streaming PCA VLSI Chip for Neural Data Compression.
Wu, Tong; Zhao, Wenfeng; Guo, Hongsun; Lim, Hubert H; Yang, Zhi
2017-12-01
Neural recording system miniaturization and integration with low-power wireless technologies require compressing neural data before transmission. Feature extraction is a procedure to represent data in a low-dimensional space; its integration into a recording chip can be an efficient approach to compress neural data. In this paper, we propose a streaming principal component analysis algorithm and its microchip implementation to compress multichannel local field potential (LFP) and spike data. The circuits have been designed in a 65-nm CMOS technology and occupy a silicon area of 0.06 mm. Throughout the experiments, the chip compresses LFPs by 10 at the expense of as low as 1% reconstruction errors and 144-nW/channel power consumption; for spikes, the achieved compression ratio is 25 with 8% reconstruction errors and 3.05-W/channel power consumption. In addition, the algorithm and its hardware architecture can swiftly adapt to nonstationary spiking activities, which enables efficient hardware sharing among multiple channels to support a high-channel count recorder.
Improvement of CMOS VLSI rad tolerance by processing technics
International Nuclear Information System (INIS)
Guyomard, D.; Desoutter, I.
1986-01-01
The following study concerns the development of integrated circuits for fields requiring only relatively low radiation tolerance levels, and especially for the civil spatial district area. Process modifications constitute our basic study. They have been carried into effects. Our work and main results are reported in this paper. Well known 2.5 and 3 μm CMOS technologies are under our concern. A first set of modifications enables us to double the cumulative dose tolerance of a 4 Kbit SRAM, keeping at the same time the same kind of damage. We obtain memories which tolerate radiation doses as high as 16 KRad(Si). Repetitivity of the results, linked to the quality assurance of this specific circuit, is reported here. A second set of modifications concerns the processing of gate array. In particular, the choice of the silicon substrate type, (epitaxy substrate), is under investigation. On the other hand, a complete study of a test vehicule allows us to accurately measure the rad tolerance of various components of the Cell library [fr
Multi-operation cryptographic engine: VLSI design and implementation
International Nuclear Information System (INIS)
Selimis, George; Koufopavlou, Odysseas
2005-01-01
The environment of smart card lacks of system resources but the commercial and economic transactions via smart cards demand the use of certificated and secure cryptographic methods. In this paper a cryptographic approach in hardware for smart cards is proposed. The proposed system supports two basic operations of cryptography, authentication and encryption. The basic component of system is the one round of DES algorithm which supports the DES, Triple DES and the ANSI X9.17 standards. The proposed system is efficient in terms of area resources and techniques for low power consumption have applied. Due to the fact that the system is for smart card applications the overall throughput outperforms the typical smart card throughput standards
System Theoretic Models for High Density VLSI Structures
1989-01-01
vector is also called a stable We first present a simple example to help visualize how vector of the AMN. The set of all stable vectors is denoted these...New York: Springer- Verlag. 1978. 1980 [34] B. De Finetti. "Funtzione catatteristica di un fenomeno aleato- , [16] W A Little. "The existence of
Formal Multilevel Hierarchical Verification of Synchronous MOS VLSI Circuits.
1987-06-01
Thoasietor R.AMbS .. ................... 166 12.2 Bootstrap Driver ... . .. .. .. .................. 167 List of Tables 1.1 TheSigalLvelVrusthe Dgtal Lvel ...THIS RESEARCH 35 Protocols Functional Lvel Sequential Systes 0io" L"ve Figure 1.7: Silica Pithecus’s place in the verifier community. The only direct...athematial structere underlyisg it behavior When thin mathematical structue is sot mae explicis a weaiw will eithe fadl or sakea very .Mg time. The
VLSI implementation of a fairness ATM buffer system
DEFF Research Database (Denmark)
Nielsen, J.V.; Dittmann, Lars; Madsen, Jens Kargaard
1996-01-01
that can provide a resource allocation policy and enforcement of this policy. It can be used in networks in order to provide defined allocation policies (fairness) and improve network robustness. The presented design illustrates how the theoretical weighted fair queueing model can be approximated...
A WORK-NOTE on OSCILLATORS - LEARNING by DOING
DEFF Research Database (Denmark)
Lindberg, Erik
2005-01-01
The aim of this work-note is to give insight in computer aided design of electronic oscillators by means of a study of a number of circuits given as figures - equivalent schemes - or as net-list files for electronic circuit analysis programs - "SPICE FILES". For each figure or net-list a number...
New-fashioned Multi-channel Analyzer Based on Bipartition Method
International Nuclear Information System (INIS)
Liu Mingjian; Zhang Yan; Yan Xuekun; Chen Ying
2009-01-01
A new-fashioned digital-analog converter (DAC) which can find the pulse-signal amplitude through dichotomy is devised. With this new DAC method, a 256-channel multi-channel pulse amplitude analyzer (MCA) is designed successfully, and its hardware and software are introduced in detail. This provides a new method for designing MCA. (authors)
Design process robustness: A bi-partite network analysis reveals the central importance of people
DEFF Research Database (Denmark)
Piccolo, Sebastiano; Jørgensen, Sune Lehmann; Maier, Anja
2018-01-01
, reducing the risk of rework and delays. Although there has been much progress in modelling and understanding design processes, little is known about the interplay between people and the activities they perform and its influence on design process robustness. To analyse this interplay, we model a large...
Golczyk, Hieronim; Hasterok, Robert; Szklarczyk, Marek
2010-12-01
High- and low-stringency FISH and base-specific fluorescence were performed on the permanent translocation heterozygote Rhoeo spathacea (2n = 12). Our results indicate that 45S rDNA arrays, rDNA-related sequences and other GC-rich DNA fraction(s) are located within the pericentromeric regions of all twelve chromosomes, usually colocalizing with the chromomycin A(3)-positive bands. Homogenization of the pericentromeric regions appears to result from the concerted spread of GC-rich sequences, with differential amplification likely. We found new 5S rDNA patterns, which suggest a variability in the breakpoints and in the consequent chromosome reorganizations. It was found that the large 5S rDNA locus residing on each of the 8E and 9E arms consisted of two smaller loci. On each of the two chromosome arms 3b and 4b, in addition to the major subtelomeric 5S rDNA locus, a new minor locus was found interstitially about 40% along the arm length. The arrangement of cytotogenetic landmarks and chromosome arm measurements are discussed with regard to genome repatterning in Rhoeo.
Enhanced capital-asset pricing model for the reconstruction of bipartite financial networks
Squartini, Tiziano; Almog, Assaf; Caldarelli, Guido; Van Lelyveld, Iman; Garlaschelli, Diego; Cimini, Giulio
2017-01-01
Reconstructing patterns of interconnections from partial information is one of the most important issues in the statistical physics of complex networks. A paramount example is provided by financial networks. In fact, the spreading and amplification of financial distress in capital markets are
Evolution of gossip-based indirect reciprocity on a bipartite network
Giardini, Francesca; Vilone, Daniele
2016-11-01
Cooperation can be supported by indirect reciprocity via reputation. Thanks to gossip, reputations are built and circulated and humans can identify defectors and ostracise them. However, the evolutionary stability of gossip is allegedly undermined by the fact that it is more error-prone that direct observation, whereas ostracism could be ineffective if the partner selection mechanism is not robust. The aim of this work is to investigate the conditions under which the combination of gossip and ostracism might support cooperation in groups of different sizes. We are also interested in exploring the extent to which errors in transmission might undermine the reliability of gossip as a mechanism for identifying defectors. Our results show that a large quantity of gossip is necessary to support cooperation, and that group structure can mitigate the effects of errors in transmission.
Bipartite structure and functional independence of adenovirus type 5 packaging elements.
Schmid, S I; Hearing, P
1997-01-01
Selectivity and polarity of adenovirus type 5 DNA packaging are believed to be directed by an interaction of putative packaging factors with the cis-acting adenovirus packaging domain located within the genomic left end (nucleotides 194 to 380). In previous studies, this packaging domain was mutationally dissected into at least seven functional elements called A repeats. These elements, albeit redundant in function, exhibit differences in the ability to support viral packaging, with elements ...
Effects of high-order correlations on personalized recommendations for bipartite networks
Liu, Jian-Guo; Zhou, Tao; Che, Hong-An; Wang, Bing-Hong; Zhang, Yi-Cheng
2010-02-01
In this paper, we introduce a modified collaborative filtering (MCF) algorithm, which has remarkably higher accuracy than the standard collaborative filtering. In the MCF, instead of the cosine similarity index, the user-user correlations are obtained by a diffusion process. Furthermore, by considering the second-order correlations, we design an effective algorithm that depresses the influence of mainstream preferences. Simulation results show that the algorithmic accuracy, measured by the average ranking score, is further improved by 20.45% and 33.25% in the optimal cases of MovieLens and Netflix data. More importantly, the optimal value λ depends approximately monotonously on the sparsity of the training set. Given a real system, we could estimate the optimal parameter according to the data sparsity, which makes this algorithm easy to be applied. In addition, two significant criteria of algorithmic performance, diversity and popularity, are also taken into account. Numerical results show that as the sparsity increases, the algorithm considering the second-order correlation can outperform the MCF simultaneously in all three criteria.
Cross-Resistance: A Consequence of Bi-partite Host-Parasite Coevolution
Joop, Gerrit
2018-01-01
Host-parasite coevolution can influence interactions of the host and parasite with the wider ecological community. One way that this may manifest is in cross-resistance towards other parasites, which has been observed to occur in some host-parasite evolution experiments. In this paper, we test for cross-resistance towards Bacillus thuringiensis and Pseudomonas entomophila in the red flour beetle Tribolium castaneum, which was previously allowed to coevolve with the generalist entomopathogenic fungus Beauveria bassiana. We combine survival and gene expression assays upon infection to test for cross-resistance and underlying mechanisms. We show that larvae of T. castaneum that evolved with B. bassiana under coevolutionary conditions were positively cross-resistant to the bacterium B. thuringiensis, but not P. entomophila. Positive cross-resistance was mirrored at the gene expression level with markers that were representative of the oral route of infection being upregulated upon B. bassiana exposure. We find that positive cross-resistance towards B. thuringiensis evolved in T. castaneum as a consequence of its coevolutionary interactions with B. bassiana. This cross-resistance appears to be a consequence of resistance to oral toxicity. The fact that coevolution with B. bassiana results in resistance to B. thuringiensis, but not P. entomophila implies that B. thuringiensis and B. bassiana may share mechanisms of infection or toxicity not shared by P. entomophila. This supports previous suggestions that B. bassiana may possess Cry-like toxins, similar to those found in B. thuringiensis, which allow it to infect orally. PMID:29495405
Improving the recommender algorithms with the detected communities in bipartite networks
Zhang, Peng; Wang, Duo; Xiao, Jinghua
2017-04-01
Recommender system offers a powerful tool to make information overload problem well solved and thus gains wide concerns of scholars and engineers. A key challenge is how to make recommendations more accurate and personalized. We notice that community structures widely exist in many real networks, which could significantly affect the recommendation results. By incorporating the information of detected communities in the recommendation algorithms, an improved recommendation approach for the networks with communities is proposed. The approach is examined in both artificial and real networks, the results show that the improvement on accuracy and diversity can be 20% and 7%, respectively. This reveals that it is beneficial to classify the nodes based on the inherent properties in recommender systems.
International Nuclear Information System (INIS)
Feng Yuan; Duan Runyao; Ying Mingsheng
2006-01-01
We show that in some cases, catalyst-assisted entanglement transformation cannot be implemented by multiple-copy transformation for pure states. This fact, together with the result we obtained in R. Y. Duan, Y. Feng, X. Li, and M. S. Ying, Phys. Rev. A 71, 042319 (2005), namely that the latter can be completely implemented by the former, indicates that catalyst-assisted transformation is strictly more powerful than multiple-copy transformation. For the purely probabilistic setting we find, however, these two kinds of transformations are geometrically equivalent in the sense that the sets of pure states that can be converted into a given pure state with maximal probabilities not less than a given value have the same closure, regardless of whether catalyst-assisted transformation or multiple-copy transformation is used
Topical tags vs non-topical tags : Towards a bipartite classification?
Basile, Valerio; Peroni, Silvio; Tamburini, Fabio; Vitali, Fabio
2015-01-01
In this paper we investigate whether it is possible to create a computational approach that allows us to distinguish topical tags (i.e. talking about the topic of a resource) and non-topical tags (i.e. describing aspects of a resource that are not related to its topic) in folksonomies, in a way that
Teleportation of an unknown bipartite state via non-maximally entangled two-particle state
Institute of Scientific and Technical Information of China (English)
Cao Hai-Jing; Guo Yan-Qing; Song He-Shan
2006-01-01
In this paper a new scheme for teleporting an unknown entangled state of two particles is proposed. To weaken the requirement for the quantum channel, without loss of generality, two communicators only share a non-maximally entangled two-particle state. Teleportation can be probabilistically realized if sender performs Bell-state measurements and Hadamard transformation and receiver introduces two auxiliary particles, operates G-not operation, single-qubit measurements and appropriate unitary transformations. The probability of successful teleportation is determined by the smaller one among the coefficients' absolute values of the quantum channel.
Solution for a bipartite Euclidean traveling-salesman problem in one dimension
Caracciolo, Sergio; Di Gioacchino, Andrea; Gherardi, Marco; Malatesta, Enrico M.
2018-05-01
The traveling-salesman problem is one of the most studied combinatorial optimization problems, because of the simplicity in its statement and the difficulty in its solution. We characterize the optimal cycle for every convex and increasing cost function when the points are thrown independently and with an identical probability distribution in a compact interval. We compute the average optimal cost for every number of points when the distance function is the square of the Euclidean distance. We also show that the average optimal cost is not a self-averaging quantity by explicitly computing the variance of its distribution in the thermodynamic limit. Moreover, we prove that the cost of the optimal cycle is not smaller than twice the cost of the optimal assignment of the same set of points. Interestingly, this bound is saturated in the thermodynamic limit.
Cross-Resistance: A Consequence of Bi-partite Host-Parasite Coevolution
Directory of Open Access Journals (Sweden)
Tilottama Biswas
2018-02-01
Full Text Available Host-parasite coevolution can influence interactions of the host and parasite with the wider ecological community. One way that this may manifest is in cross-resistance towards other parasites, which has been observed to occur in some host-parasite evolution experiments. In this paper, we test for cross-resistance towards Bacillus thuringiensis and Pseudomonas entomophila in the red flour beetle Tribolium castaneum, which was previously allowed to coevolve with the generalist entomopathogenic fungus Beauveria bassiana. We combine survival and gene expression assays upon infection to test for cross-resistance and underlying mechanisms. We show that larvae of T. castaneum that evolved with B. bassiana under coevolutionary conditions were positively cross-resistant to the bacterium B. thuringiensis, but not P. entomophila. Positive cross-resistance was mirrored at the gene expression level with markers that were representative of the oral route of infection being upregulated upon B. bassiana exposure. We find that positive cross-resistance towards B. thuringiensis evolved in T. castaneum as a consequence of its coevolutionary interactions with B. bassiana. This cross-resistance appears to be a consequence of resistance to oral toxicity. The fact that coevolution with B. bassiana results in resistance to B. thuringiensis, but not P. entomophila implies that B. thuringiensis and B. bassiana may share mechanisms of infection or toxicity not shared by P. entomophila. This supports previous suggestions that B. bassiana may possess Cry-like toxins, similar to those found in B. thuringiensis, which allow it to infect orally.
Evolution of gossip-based indirect reciprocity on a bipartite network.
Giardini, Francesca; Vilone, Daniele
2016-11-25
Cooperation can be supported by indirect reciprocity via reputation. Thanks to gossip, reputations are built and circulated and humans can identify defectors and ostracise them. However, the evolutionary stability of gossip is allegedly undermined by the fact that it is more error-prone that direct observation, whereas ostracism could be ineffective if the partner selection mechanism is not robust. The aim of this work is to investigate the conditions under which the combination of gossip and ostracism might support cooperation in groups of different sizes. We are also interested in exploring the extent to which errors in transmission might undermine the reliability of gossip as a mechanism for identifying defectors. Our results show that a large quantity of gossip is necessary to support cooperation, and that group structure can mitigate the effects of errors in transmission.
A variable-depth search algorithm for recursive bi-partitioning of signal flow graphs
de Kock, E.A.; Aarts, E.H.L.; Essink, G.; Jansen, R.E.J.; Korst, J.H.M.
1995-01-01
We discuss the use of local search techniques for mapping video algorithms onto programmable high-performance video signal processors. The mapping problem is very complex due to many constraints that need to be satisfied in order to obtain a feasible solution. The complexity is reduced by
Non-existence of bipartite bound entanglement with negative partial transposition
Sperling, J.; Vogel, W.
2009-01-01
Bound entanglement with a nonpositive partial transposition (NPT) does not exist. For any NPT entangled state a distillation procedure can be based on a certain number of copies. This number is the minimal Schmidt rank of a pure state needed to witness the NPT entanglement under study.
Co-Clustering by Bipartite Spectral Graph Partitioning for Out-of-Tutor Prediction
Trivedi, Shubhendu; Pardos, Zachary A.; Sarkozy, Gabor N.; Heffernan, Neil T.
2012-01-01
Learning a more distributed representation of the input feature space is a powerful method to boost the performance of a given predictor. Often this is accomplished by partitioning the data into homogeneous groups by clustering so that separate models could be trained on each cluster. Intuitively each such predictor is a better representative of…
1987-09-01
level descrip- tion without human intervention. Although design rules and the layout function may not be checked, performance verification is still a...digital syvstems.- Proc. I1E1., vol. 69. no. 10. pp. 1200-1211. October 198 1. [2] A. Gupta, AT A circuit extractor." Proc. 20th Design Automiation
A Fully Parallel VLSI-implementation of the Viterbi Decoding Algorithm
DEFF Research Database (Denmark)
Sparsø, Jens; Jørgensen, Henrik Nordtorp; Paaske, Erik
1989-01-01
In this paper we describe the implementation of a K = 7, R = 1/2 single-chip Viterbi decoder intended to operate at 10-20 Mbit/sec. We propose a general, regular and area efficient floor-plan that is also suitable for implementation of decoders for codes with different generator polynomials...
Fault-Sensitivity and Wear-Out Analysis of VLSI Systems.
1995-06-01
DESCRIPTION MIXED-MODE HIERARCIAIFAULT DESCRIPTION FAULT SIMULATION TYPE OF FAULT TRANSIENT/STUCK-AT LOCATION/TIME * _AUTOMATIC FAULT INJECTION TRACE...4219-4224, December 1985. [15] J. Sosnowski, "Evaluation of transient hazards in microprocessor controll - ers," Digest, FTCS-16, The Sixteenth
Genetic Spot Optimization for Peak Power Estimation in Large VLSI Circuits
Directory of Open Access Journals (Sweden)
Michael S. Hsiao
2002-01-01
Full Text Available Estimating peak power involves optimization of the circuit's switching function. The switching of a given gate is not only dependent on the output capacitance of the node, but also heavily dependent on the gate delays in the circuit, since multiple switching events can result from uneven circuit delay paths in the circuit. Genetic spot expansion and optimization are proposed in this paper to estimate tight peak power bounds for large sequential circuits. The optimization spot shifts and expands dynamically based on the maximum power potential (MPP of the nodes under optimization. Four genetic spot optimization heuristics are studied for sequential circuits. Experimental results showed an average of 70.7% tighter peak power bounds for large sequential benchmark circuits was achieved in short execution times.
Application of statistics to VLSI circuit manufacturing : test, diagnosis, and reliability
Krishnan, Shaji
2017-01-01
Semiconductor product manufacturing companies strive to deliver defect free, and reliable products to their customers. However, with the down-scaling of technology, increasing the throughput at every stage of semiconductor product manufacturing becomes a harder challenge. To avoid process-related
VLSI implementation of RSA encryption system using ancient Indian Vedic mathematics
Thapliyal, Himanshu; Srinivas, M. B.
2005-06-01
This paper proposes the hardware implementation of RSA encryption/decryption algorithm using the algorithms of Ancient Indian Vedic Mathematics that have been modified to improve performance. The recently proposed hierarchical overlay multiplier architecture is used in the RSA circuitry for multiplication operation. The most significant aspect of the paper is the development of a division architecture based on Straight Division algorithm of Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. The coding is done in Verilog HDL and the FPGA synthesis is done using Xilinx Spartan library. The results show that RSA circuitry implemented using Vedic division and multiplication is efficient in terms of area/speed compared to its implementation using conventional multiplication and division architectures.
A Program of Research on Microfabrication Techniques for VLSI Magnetic Devices.
1981-10-01
directions. The result is the perpendicular lattice expansion of a nonconstrained film. The mismatch is calculated using the following equation. 3d /d - -60...electrons from Mo to the 3d band of Co thereby lowering its moment (Hasegawa, at. &l. 1975). The exhange constant, A. which depends on the individual...encouraging comments. J. J. Fernandez de Castro also thanks the Mexican Government (CONSEJO NACIONAL DE CIENCIA Y TECNOLOGIA ) for the funds that it
Braem, André; Filthaut, Frank; Go, A; Joram, C; Weilhammer, Peter; Wicht, P; Dulinski, W; Séguinot, Jacques; Wenzel, H; Ypsilantis, Thomas
2000-01-01
We report on the principles, design, fabrication, and operation of a highly segmented, large-area hybrid photodiode, which is being developed in the framework of the LHCb RICH project. The device consists of a cylindrical, 127 mm diameter vacuum envelope capped with a spherical borosilicate UV-glass entrance window, with an active-to-total-area fraction of 81A fountain-focusing electron optics is used to demagnify the image onto a 50 mm diameter silicon sensor, containing 2048 pads of size 1*1 mm/sup 2/. (10 refs).
Luo, Aiwen; An, Fengwei; Zhang, Xiangyu; Chen, Lei; Huang, Zunkai; Jürgen Mattausch, Hans
2018-04-01
Feature extraction techniques are a cornerstone of object detection in computer-vision-based applications. The detection performance of vison-based detection systems is often degraded by, e.g., changes in the illumination intensity of the light source, foreground-background contrast variations or automatic gain control from the camera. In order to avoid such degradation effects, we present a block-based L1-norm-circuit architecture which is configurable for different image-cell sizes, cell-based feature descriptors and image resolutions according to customization parameters from the circuit input. The incorporated flexibility in both the image resolution and the cell size for multi-scale image pyramids leads to lower computational complexity and power consumption. Additionally, an object-detection prototype for performance evaluation in 65 nm CMOS implements the proposed L1-norm circuit together with a histogram of oriented gradients (HOG) descriptor and a support vector machine (SVM) classifier. The proposed parallel architecture with high hardware efficiency enables real-time processing, high detection robustness, small chip-core area as well as low power consumption for multi-scale object detection.
VLSI implementation of a bio-inspired olfactory spiking neural network.
Hsieh, Hung-Yi; Tang, Kea-Tiong
2012-07-01
This paper presents a low-power, neuromorphic spiking neural network (SNN) chip that can be integrated in an electronic nose system to classify odor. The proposed SNN takes advantage of sub-threshold oscillation and onset-latency representation to reduce power consumption and chip area, providing a more distinct output for each odor input. The synaptic weights between the mitral and cortical cells are modified according to an spike-timing-dependent plasticity learning rule. During the experiment, the odor data are sampled by a commercial electronic nose (Cyranose 320) and are normalized before training and testing to ensure that the classification result is only caused by learning. Measurement results show that the circuit only consumed an average power of approximately 3.6 μW with a 1-V power supply to discriminate odor data. The SNN has either a high or low output response for a given input odor, making it easy to determine whether the circuit has made the correct decision. The measurement result of the SNN chip and some well-known algorithms (support vector machine and the K-nearest neighbor program) is compared to demonstrate the classification performance of the proposed SNN chip.The mean testing accuracy is 87.59% for the data used in this paper.
Real time unsupervised learning of visual stimuli in neuromorphic VLSI systems
Massimiliano Giulioni; Federico Corradi; Vittorio Dante; Paolo del Giudice
2015-01-01
Neuromorphic chips embody computational principles operating in the nervous system, into microelectronic devices. In this domain it is important to identify computational primitives that theory and experiments suggest as generic and reusable cognitive elements. One such element is provided by attractor dynamics in recurrent networks. Point attractors are equilibrium states of the dynamics (up to fluctuations), determined by the synaptic structure of the network; a 'basin' of attraction compri...
Indiveri, Giacomo
2008-09-03
Biological organisms perform complex selective attention operations continuously and effortlessly. These operations allow them to quickly determine the motor actions to take in response to combinations of external stimuli and internal states, and to pay attention to subsets of sensory inputs suppressing non salient ones. Selective attention strategies are extremely effective in both natural and artificial systems which have to cope with large amounts of input data and have limited computational resources. One of the main computational primitives used to perform these selection operations is the Winner-Take-All (WTA) network. These types of networks are formed by arrays of coupled computational nodes that selectively amplify the strongest input signals, and suppress the weaker ones. Neuromorphic circuits are an optimal medium for constructing WTA networks and for implementing efficient hardware models of selective attention systems. In this paper we present an overview of selective attention systems based on neuromorphic WTA circuits ranging from single-chip vision sensors for selecting and tracking the position of salient features, to multi-chip systems implement saliency-map based models of selective attention.
Giacomo Indiveri
2008-01-01
Biological organisms perform complex selective attention operations continuously and effortlessly. These operations allow them to quickly determine the motor actions to take in response to combinations of external stimuli and internal states, and to pay attention to subsets of sensory inputs suppressing non salient ones. Selective attention strategies are extremely effective in both natural and artificial systems which have to cope with large amounts of input data and have limited computation...
Real time unsupervised learning of visual stimuli in neuromorphic VLSI systems
Giulioni, Massimiliano; Corradi, Federico; Dante, Vittorio; Del Giudice, Paolo
2015-10-01
Neuromorphic chips embody computational principles operating in the nervous system, into microelectronic devices. In this domain it is important to identify computational primitives that theory and experiments suggest as generic and reusable cognitive elements. One such element is provided by attractor dynamics in recurrent networks. Point attractors are equilibrium states of the dynamics (up to fluctuations), determined by the synaptic structure of the network; a ‘basin’ of attraction comprises all initial states leading to a given attractor upon relaxation, hence making attractor dynamics suitable to implement robust associative memory. The initial network state is dictated by the stimulus, and relaxation to the attractor state implements the retrieval of the corresponding memorized prototypical pattern. In a previous work we demonstrated that a neuromorphic recurrent network of spiking neurons and suitably chosen, fixed synapses supports attractor dynamics. Here we focus on learning: activating on-chip synaptic plasticity and using a theory-driven strategy for choosing network parameters, we show that autonomous learning, following repeated presentation of simple visual stimuli, shapes a synaptic connectivity supporting stimulus-selective attractors. Associative memory develops on chip as the result of the coupled stimulus-driven neural activity and ensuing synaptic dynamics, with no artificial separation between learning and retrieval phases.
Directory of Open Access Journals (Sweden)
Giacomo Indiveri
2008-09-01
Full Text Available Biological organisms perform complex selective attention operations continuously and effortlessly. These operations allow them to quickly determine the motor actions to take in response to combinations of external stimuli and internal states, and to pay attention to subsets of sensory inputs suppressing non salient ones. Selective attention strategies are extremely effective in both natural and artificial systems which have to cope with large amounts of input data and have limited computational resources. One of the main computational primitives used to perform these selection operations is the Winner-Take-All (WTA network. These types of networks are formed by arrays of coupled computational nodes that selectively amplify the strongest input signals, and suppress the weaker ones. Neuromorphic circuits are an optimal medium for constructing WTA networks and for implementing efficient hardware models of selective attention systems. In this paper we present an overview of selective attention systems based on neuromorphic WTA circuits ranging from single-chip vision sensors for selecting and tracking the position of salient features, to multi-chip systems implement saliency-map based models of selective attention.
A VLSI Implementation of Four-Phase Lift Controller Using Verilog HDL
Kumar, Manish; Singh, Priyanka; Singh, Shesha
2017-08-01
With the advent of an era of staggering range of new technologies to provide ease of mobility and transportation elevators have become an essential component of all high rise buildings. An elevator is a type of vertical transportation that moves people between the floors of a high rise building. A four-Phase lift controller modeled on Verilog HDL code using Finite State Machine (FSM) has been presented in this paper. Verilog HDL helps in automated analysis and simulation of lift controller circuit. This design is based on synchronous input that operates on a fixed frequency. The Lift motion is controlled by means of accepting the destination floor level as input and generate control signal as output. In the proposed design a Verilog RTL code is developed and verified. Project Navigator of XILINX has been used as a code writing platform and results were simulated using Modelsim 5.4a simulator. This paper discusses the overall evolution of design and also discusses simulated results.
VLSI systems energy management from a software perspective – A literature survey
Directory of Open Access Journals (Sweden)
Prasada Kumari K.S.
2016-09-01
Full Text Available The increasing demand for ultra-low power electronic systems has motivated research in device technology and hardware design techniques. Experimental studies have proved that the hardware innovations for power reduction are fully exploited only with the proper design of upper layer software. Also, the software power and energy modelling and analysis – the first step towards energy reduction is complex due to the inter and intra dependencies of processors, operating systems, application software, programming languages and compilers. The subject is too vast; the paper aims to give a consolidated view to researchers in arriving at solutions to power optimization problems from a software perspective. The review emphasizes the fact that software design and implementation is to be viewed from system energy conservation angle rather than as an isolated process. After covering a global view of end to end software based power reduction techniques for micro sensor nodes to High Performance Computing systems, specific design aspects related to battery powered Embedded computing for mobile and portable systems are addressed in detail. The findings are consolidated into 2 major categories – those related to research directions and those related to existing industry practices. The emerging concept of Green Software with specific focus on mainframe computing is also discussed in brief. Empirical results on power saving are included wherever available. The paper concludes that only with the close co-ordination between hardware architect, software architect and system architect low energy systems can be realized.
Formation of shallow junctions for VLSI by ion implantation and rapid thermal annealing
International Nuclear Information System (INIS)
Oeztuerk, M.C.
1988-01-01
In this work, several techniques were studied to form shallow junctions in silicon by ion implantation. These include ion implantation through thin layers of silicon dioxide and ion implantation through a thick polycrystalline silicon layer. These techniques can be used to reduce the junction depth. Their main disadvantage is dopant loss in the surface layer. As an alternative, preamorphization of the Si substrate prior to boron implantation to reduce boron channeling was investigated. The disadvantage of preamorphization is the radiation damage introduced into the Si substrate using the implant. Preamorphization by silicon self-implantation has been studied before. The goal of this study was to test Ge as an alternative amorphizing agent. It was found that good-quality p + -n junctions can be formed by both boron and BF 2 ion implantation into Ge-preamorphized Si provided that the preamorphization conditions are optimized. If the amorphous crystalline interface is sufficiently close to the surface, it is possible to completely remove the end-of-range damage. If these defects are not removed and are left in the depletion region, they can result in poor-quality, leaky junctions
Electron beam effects on VLSI MOS conditions for testing and reconfiguration
International Nuclear Information System (INIS)
Girard, P.; Roche, F.M.; Pistoulet, B.
1986-01-01
Wafer scale integrated-MOS circuits problems related to test and reconfiguration by electron beams are analyzed. First of all the alterations in characteristics of MOS circuits submitted to an electron beam testing are considered. Then the capabilities of reconfiguration by an electron beam bombardment are discussed. The various phenomena involved are reviewed. Experimental data are reported and discussed on the light of data of the literature. (Auth.)
A VLSI front-end circuit for microstrip silicon detectors for medical imaging applications
International Nuclear Information System (INIS)
Beccherle, R.; Cisternino, A.; Guerra, A. Del; Folli, M.; Marchesini, R.; Bisogni, M.G.; Ceccopieri, A.; Rosso, V.; Stefanini, A.; Tripiccione, R.; Kipnis, I.
1999-01-01
An analog CMOS-Integrated Circuit has been developed as Front-End for a double-sided microstrip silicon detector. The IC processes and discriminates signals in the 5-30 keV energy range. Main features are low noise and precise timing information. Low noise is achieved by optimizing the cascoded integrator with the 8 pF detector capacitance and by using an inherently low noise 1.2 μm CMOS technology. Timing information is provided by a double discriminator architecture. The output of the circuit is a digital pulse. The leading edge is determined by a fixed threshold discriminator, while the trailing edge is provided by a zero crossing discriminator. In this paper we first describe the architecture of the Front-End chip. We then present the performance of the chip prototype in terms of noise, minimum discrimination threshold and time resolution
VLSI Implementation of Hybrid Wave-Pipelined 2D DWT Using Lifting Scheme
Directory of Open Access Journals (Sweden)
G. Seetharaman
2008-01-01
Full Text Available A novel approach is proposed in this paper for the implementation of 2D DWT using hybrid wave-pipelining (WP. A digital circuit may be operated at a higher frequency by using either pipelining or WP. Pipelining requires additional registers and it results in more area, power dissipation and clock routing complexity. Wave-pipelining does not have any of these disadvantages but requires complex trial and error procedure for tuning the clock period and clock skew between input and output registers. In this paper, a hybrid scheme is proposed to get the benefits of both pipelining and WP techniques. In this paper, two automation schemes are proposed for the implementation of 2D DWT using hybrid WP on both Xilinx, San Jose, CA, USA and Altera FPGAs. In the first scheme, Built-in self-test (BIST approach is used to choose the clock skew and clock period for I/O registers between the wave-pipelined blocks. In the second approach, an on-chip soft-core processor is used to choose the clock skew and clock period. The results for the hybrid WP are compared with nonpipelined and pipelined approaches. From the implementation results, the hybrid WP scheme requires the same area but faster than the nonpipelined scheme by a factor of 1.25–1.39. The pipelined scheme is faster than the hybrid scheme by a factor of 1.15–1.39 at the cost of an increase in the number of registers by a factor of 1.78–2.73, increase in the number of LEs by a factor of 1.11–1.32 and it increases the clock routing complexity.
The VLSI design of the sub-band filterbank in MP3 decoding
Liu, Jia-Xin; Luo, Li
2018-03-01
The sub-band filterbank is one of the most important modules which has the largest amount of calculation in MP3 decoding. In order to save CPU resources and integrate the sub-band filterbank part into MP3 IP core, the hardware circuit of the sub-band filterbank module is designed in this paper. A fast algorithm suit for hardware implementation is proposed and achieved on FPGA development board. The results show that the sub-band filterbank function is correct in the case of using very few registers and the amount of calculation and ROM resources are reduced greatly.
Reliability data collection on IC and VLSI devices tested under accelerated life conditions
International Nuclear Information System (INIS)
Barry, D.M.; Meniconi, M.
1986-01-01
As part of a more general investigation into the reliability and failure causes of semiconductor devices, statistical samples of integrated circuit devices (LM741C) and dynamic random access memory devices (TMS4116) were tested destructively to failure using elevated temperature as the accelerating stress. The devices were operated during the life test and the failure data generated were collected automatically using a multiple question-and-answer program and a process control computer. The failure data were modelled from the lognormal, inverse Gaussian and Weibull distribution using an Arrhenius reaction rate model. The failed devices were later decapsulated for failure cause determination. (orig./DG)
Greenwald, Elliot; Masters, Matthew R; Thakor, Nitish V
2016-01-01
A bidirectional neural interface is a device that transfers information into and out of the nervous system. This class of devices has potential to improve treatment and therapy in several patient populations. Progress in very large-scale integration has advanced the design of complex integrated circuits. System-on-chip devices are capable of recording neural electrical activity and altering natural activity with electrical stimulation. Often, these devices include wireless powering and telemetry functions. This review presents the state of the art of bidirectional circuits as applied to neuroprosthetic, neurorepair, and neurotherapeutic systems.
Lo, Yi-Chuan; Lee, Chih-Hsiung; Lin, Hsun-Peng; Peng, Chiou-Shian
1998-06-01
Several continuous splits for wafer alignment target topography conditions to improve epitaxy film alignment were applied. The alignment evaluation among former layer pad oxide thickness (250 angstrom - 500 angstrom), drive oxide thickness (6000 angstrom - 10000 angstrom), nitride film thickness (600 angstrom - 1500 angstrom), initial oxide etch (fully wet etch, fully dry etch and dry plus wet etch) will be split to this experiment. Also various epitaxy deposition recipe such as: epitaxy source (SiHCl2 or SiCHCl3) and growth rate (1.3 micrometer/min approximately 2.0 micrometer/min) will be used to optimize the process window for alignment issue. All the reflectance signal and cross section photography of alignment target during NIKON stepper alignment process will be examined. Experimental results show epitaxy recipe plays an important role to wafer alignment. Low growth rate with good performance conformity epitaxy lead to alignment target avoid washout, pattern shift and distortion. All the results (signal monitor and film character) combined with NIKON's stepper standard laser scanning alignment system will be discussed in this paper.
Ion distribution near a mask edge with arbitrary shape for VLSI IC applications
International Nuclear Information System (INIS)
Lutsch, A.G.K.; Oosthuizen, D.R.
1985-01-01
The profile of the mask edge during ion implantation determines the electrical field in the critical drain region of a MOS-transistor. Equal ion density lines are computed for various mask edges for the example of boron implanted into silicon at 70 keV. Four moments of the impurity depth distribution (without mask material are taken into consideration. Homogenisation and, therefore a higher noise immunity, can be obtained by the proper choice of the mask etching process. The influence of a too-thin mask material is also shown. (author)
Hardware Genetic Algorithm Optimization by Critical Path Analysis using a Custom VLSI Architecture
Directory of Open Access Journals (Sweden)
Farouk Smith
2015-07-01
Full Text Available This paper propose a Virtual-Field Programmable Gate Array (V-FPGA architecture that allows direct access to its configuration bits to facilitate hardware evolution, thereby allowing any combinational or sequential digital circuit to be realized. By using the V-FPGA, this paper investigates two possible ways of making evolutionary hardware systems more scalable: by optimizing the system’s genetic algorithm (GA; and by decomposing the solution circuit into smaller, evolvable sub-circuits. GA optimization is done by: omitting a canonical GA’s crossover operator (i.e. by using a 1+λ algorithm; applying evolution constraints; and optimizing the fitness function. A noteworthy contribution this research has made is the in-depth analysis of the phenotypes’ CPs. Through analyzing the CPs, it has been shown that a great amount of insight can be gained into a phenotype’s fitness. We found that as the number of columns in the Cartesian Genetic Programming array increases, so the likelihood of an external output being placed in the column decreases. Furthermore, the number of used LEs per column also substantially decreases per added column. Finally, we demonstrated the evolution of a state-decomposed control circuit. It was shown that the evolution of each state’s sub-circuit was possible, and suggest that modular evolution can be a successful tool when dealing with scalability.
Micromachined VLSI 3D electronics. Final report for period September 1, 2000 - March 31, 2001
Energy Technology Data Exchange (ETDEWEB)
Beetz, C.P.; Steinbeck, J.; Hsueh, K.L.
2001-03-31
The phase I program investigated the construction of electronic interconnections through the thickness of a silicon wafer. The novel aspects of the technology are that the length-to-width ratio of the channels is as high as 100:1, so that the minimum amount of real estate is used for contact area. Constructing a large array of these through-wafer interconnections will enable two circuit die to be coupled on opposite sides of a silicon circuit board providing high speed connection between the two.
Pin count-aware biochemical application compilation for mVLSI biochips
DEFF Research Database (Denmark)
Lander Raagaard, Michael; Pop, Paul
2015-01-01
Microfluidic biochips are replacing the conventional biochemical analyzers and are able to integrate the necessary functions for biochemical analysis on-chip. In this paper we are interested in flow-based biochips, in which the fluidic flow manipulated using integrated microvalves, which are cont...... a biochemical application. We focus on the compilation task, where the strategy is to delay operations, without missing their deadlines, such that the sharing of control signals is maximized. The evaluation shows a significant reduction in the number of control pins required....
A VLSI Implementation of Rank-Order Searching Circuit Employing a Time-Domain Technique
Directory of Open Access Journals (Sweden)
Trong-Tu Bui
2013-01-01
Full Text Available We present a compact and low-power rank-order searching (ROS circuit that can be used for building associative memories and rank-order filters (ROFs by employing time-domain computation and floating-gate MOS techniques. The architecture inherits the accuracy and programmability of digital implementations as well as the compactness and low-power consumption of analog ones. We aim to implement identification function as the first priority objective. Filtering function would be implemented once the location identification function has been carried out. The prototype circuit was designed and fabricated in a 0.18 μm CMOS technology. It consumes only 132.3 μW for an eight-input demonstration case.
MOD/R : A knowledge assisted approach towards top-down only CMOS VLSI design
Spaanenburg, L.; Beunder, M.; Beune, F.A.; Gerez, Sabih H.; Holstein, B.; Luchtmeyer, R.C.C.; Smit, Jaap; van der Werf, A.; Willems, H.
1985-01-01
MOD/R models all views on the design space in relations. This is achieved by eliminating the package constraints, as are apparent in PCB oriented hardware description languages. Assisted by knowledge engineering it allows for a top-down, mostly hierarchical decomposition, virtually eliminating the
A Silicon Hadron Calorimeter Module Operated in a Strong Magnetic Field with VLSI Readout for LHC
2002-01-01
% RD35 \\\\ \\\\ On the basis of a cost optimized Silicon production technology we proposed to build a hadron calorimeter active plane. \\\\ \\\\The production of detectors is closely followed and final quality control is performed according to specifications. \\\\ \\\\The technology designed for the cheap pad detector production is applied for the coarse strip detector manufacturing. These strip detectors will be used in the preshower of the electromagnetic calorimeter of CMS. \\footnote{Research & Prod. Assoc. ELMA, RSFSR} \\footnote{Byelorussian State Univ. Minsk} \\footnote{Research & Prod. Comp. SIAPS, RSFSR} \\footnote{Joffe Physical-Technical Inst. RSFSR} \\footnote{Ansaldo Richerche spa, Genoa} \\footnote{SGS-THOMSON, Castelletto, Milan}
A silicon pixel detector with routing for external VLSI read-out
International Nuclear Information System (INIS)
Thomas, S.L.; Seller, P.
1988-07-01
A silicon pixel detector with an array of 32 by 16 hexagonal pixels has been designed and is being built on high resistivity silicon. The detector elements are reverse biased diodes consisting of p-implants in an n-type substrate and are fully depleted from the front to the back of the wafer. They are intended to measure high energy ionising particles traversing the detector. The detailed design of the pixels, their layout and method of read-out are discussed. A number of test structures have been incorporated onto the wafer to enable measurements to be made on individual pixels together with a variety of active devices. The results will give a better understanding of the operation of the pixel array, and will allow testing of computer simulations of more elaborate structures for the future. (author)
Automatic computation of transfer functions
Atcitty, Stanley; Watson, Luke Dale
2015-04-14
Technologies pertaining to the automatic computation of transfer functions for a physical system are described herein. The physical system is one of an electrical system, a mechanical system, an electromechanical system, an electrochemical system, or an electromagnetic system. A netlist in the form of a matrix comprises data that is indicative of elements in the physical system, values for the elements in the physical system, and structure of the physical system. Transfer functions for the physical system are computed based upon the netlist.
Guenther, Richard H.; Sit, Tim L.; Gracz, Hanna S.; Dolan, Michael A.; Townsend, Hannah L.; Liu, Guihua; Newman, Winnell H.; Agris, Paul F.; Lommel, Steven A.
2004-01-01
The 34-nucleotide trans-activator (TA) located within the RNA-2 of Red clover necrotic mosaic virus folds into a simple hairpin. The eight-nucleotide TA loop base pairs with eight complementary nucleotides in the TA binding sequence (TABS) of the capsid protein subgenomic promoter on RNA-1 and trans-activates subgenomic RNA synthesis. Short synthetic oligoribonucleotide mimics of the RNA-1 TABS and the RNA-2 TA form a weak 1:1 bimolecular complex in vitro with a Ka of 5.3 × 104 M–1. Ka determ...
International Nuclear Information System (INIS)
Adesso, Gerardo; Ericsson, Marie; Illuminati, Fabrizio
2007-01-01
Quantum mechanics imposes 'monogamy' constraints on the sharing of entanglement. We show that, despite these limitations, entanglement can be fully 'promiscuous', i.e., simultaneously present in unlimited two-body and many-body forms in states living in an infinite-dimensional Hilbert space. Monogamy just bounds the divergence rate of the various entanglement contributions. This is demonstrated in simple families of N-mode (N≥4) Gaussian states of light fields or atomic ensembles, which therefore enable infinitely more freedom in the distribution of information, as opposed to systems of individual qubits. Such a finding is of importance for the quantification, understanding, and potential exploitation of shared quantum correlations in continuous variable systems. We discuss how promiscuity gradually arises when considering simple families of discrete variable states, with increasing Hilbert space dimension towards the continuous variable limit. Such models are somehow analogous to Gaussian states with asymptotically diverging, but finite, squeezing. In this respect, we find that non-Gaussian states (which in general are more entangled than Gaussian states) exhibit also the interesting feature that their entanglement is more shareable: in the non-Gaussian multipartite arena, unlimited promiscuity can be already achieved among three entangled parties, while this is impossible for Gaussian, even infinitely squeezed states
Dietzgen, Ralf G.; Kondo, Hideki; Goodin, Michael M.; Kurath, Gael; Vasilakis, Nikos
2016-01-01
The family Rhabdoviridae consists of mostly enveloped, bullet-shaped or bacilliform viruses with a negative-sense, single-stranded RNA genome that infect vertebrates, invertebrates or plants. This ecological diversity is reflected by the diversity and complexity of their genomes. Five canonical structural protein genes are conserved in all rhabdoviruses, but may be overprinted, overlapped or interspersed with several novel and diverse accessory genes. This review gives an overview of the char...
Management of begomovirus-incited diseases on tomatoes in Guatemala continues to be a challenge and there continues to be a need to better understand the genetics of resistance to begomoviruses. In this study, the resistant line, Gh13, was crossed with the susceptible line, HUJ-VF, that lacked the ...
Schulein, Ralf; Guye, Patrick; Rhomberg, Thomas A; Schmid, Michael C; Schröder, Gunnar; Vergunst, Annette C; Carena, Ilaria; Dehio, Christoph
2005-01-18
Bacterial type IV secretion (T4S) systems mediate the transfer of macromolecular substrates into various target cells, e.g., the conjugative transfer of DNA into bacteria or the transfer of virulence proteins into eukaryotic host cells. The T4S apparatus VirB of the vascular tumor-inducing pathogen Bartonella henselae causes subversion of human endothelial cell (HEC) function. Here we report the identification of multiple protein substrates of VirB, which, upon translocation into HEC, mediate all known VirB-dependent cellular changes. These Bartonella-translocated effector proteins (Beps) A-G are encoded together with the VirB system and the T4S coupling protein VirD4 on a Bartonella-specific pathogenicity island. The Beps display a modular architecture, suggesting an evolution by extensive domain duplication and reshuffling. The C terminus of each Bep harbors at least one copy of the Bep-intracellular delivery domain and a short positively charged tail sequence. This biparte C terminus constitutes a transfer signal that is sufficient to mediate VirB/VirD4-dependent intracellular delivery of reporter protein fusions. The Bep-intracellular delivery domain is also present in conjugative relaxases of bacterial conjugation systems. We exemplarily show that the C terminus of such a conjugative relaxase mediates protein transfer through the Bartonella henselae VirB/VirD4 system into HEC. Conjugative relaxases may thus represent the evolutionary origin of the here defined T4S signal for protein transfer into human cells.
Arndt, H.-D.; Rizzo, S.; Nöcker, Chr.; Wackchaure, V.N.; Milroy, L.G.; Bieker, V.; Calderon, A.; Tran, T.T.N.; Brand, S.; Dehmelt, L.; Waldmann, H.
2015-01-01
Macrocyclic natural products (NPs) and analogues thereof often show high affinity, selectivity, and metabolic stability, and methods for the synthesis of NP-like macrocycle collections are of major current interest. We report an efficient solid-phase/cyclorelease method for the synthesis of a
Astegiano, Julia; Altermatt, Florian; Massol, François
2017-11-13
Species establish different interactions (e.g. antagonistic, mutualistic) with multiple species, forming multilayer ecological networks. Disentangling network co-structure in multilayer networks is crucial to predict how biodiversity loss may affect the persistence of multispecies assemblages. Existing methods to analyse multilayer networks often fail to consider network co-structure. We present a new method to evaluate the modular co-structure of multilayer networks through the assessment of species degree co-distribution and network module composition. We focus on modular structure because of its high prevalence among ecological networks. We apply our method to two Lepidoptera-plant networks, one describing caterpillar-plant herbivory interactions and one representing adult Lepidoptera nectaring on flowers, thereby possibly pollinating them. More than 50% of the species established either herbivory or visitation interactions, but not both. These species were over-represented among plants and lepidopterans, and were present in most modules in both networks. Similarity in module composition between networks was high but not different from random expectations. Our method clearly delineates the importance of interpreting multilayer module composition similarity in the light of the constraints imposed by network structure to predict the potential indirect effects of species loss through interconnected modular networks.