ﻻ يوجد ملخص باللغة العربية
Independent of the technology, it is generally expected that future nanoscale devices will be built from vast numbers of densely arranged devices that exhibit high failure rates. Other than that, there is little consensus on what type of technology and computing architecture holds most promises to go far beyond todays top-down engineered silicon devices. Cellular automata (CA) have been proposed in the past as a possible class of architectures to the von Neumann computing architecture, which is not generally well suited for future parallel and fine-grained nanoscale electronics. While the top-down engineered semi-conducting technology favors regular and locally interconnected structures, future bottom-up self-assembled devices tend to have irregular structures because of the current lack precise control over these processes. In this paper, we will assess random dynamical networks, namely Random Boolean Networks (RBNs) and Random Threshold Networks (RTNs), as alternative computing architectures and models for future information processing devices. We will illustrate that--from a theoretical perspective--they offer superior properties over classical CA-based architectures, such as inherent robustness as the system scales up, more efficient information processing capabilities, and manufacturing benefits for bottom-up designed devices, which motivates this investigation. We will present recent results on the dynamic behavior and robustness of such random dynamical networks while also including manufacturing issues in the assessment.
Cancer invasion and metastasis depend on angiogenesis. The cellular processes (growth, migration, and apoptosis) that occur during angiogenesis are tightly regulated by signaling molecules. Thus, understanding how cells synthesize multiple biochemica
With the scaling of technology and higher requirements on performance and functionality, power dissipation is becoming one of the major design considerations in the development of network processors. In this paper, we use an assertion-based methodolo
We systematically study and compare damage spreading at the sparse percolation (SP) limit for random boolean and threshold networks with perturbations that are independent of the network size $N$. This limit is relevant to information and damage prop
This paper describes the architecture, the development and the implementation of Janus II, a new generation application-driven number cruncher optimized for Monte Carlo simulations of spin systems (mainly spin glasses). This domain of computational p
Earthquake network is known to be complex in the sense that it is scale-free, small-world, hierarchically organized and assortatively mixed. Here, the time evolution of earthquake network is analyzed around main shocks in the context of the community