Design and Testing of Nanotechnology Based Sequential Circuits Using MX-CQCA Logic in VHDL

This paper impart the design and testing of Nanotechnology based sequential circuits using multiplexer conservative QCA (MX-CQCA) logic gates, which is easily testable using only two vectors. This method has great prospective in the design of sequential circuits based on reversible conservative logic gates and also smashes the sequential circuits implemented in traditional gates in terms of testability. Reversible circuits are similar to usual logic circuits except that they are built from reversible gates. Designs of multiplexer conservative QCA logic based two vectors testable double edge triggered (DET) sequential circuits in VHDL language are also accessible here; it will also diminish intricacy in testing side. Also other types of sequential circuits such as D, SR, JK latches are designed using this MX-CQCA logic gate. The objective behind the proposed design methodologies is to amalgamate arithmetic and logic functional units optimizing key metrics such as garbage outputs, delay, area and power. The projected MX-CQCA gate outshines other reversible gates in terms of the intricacy, delay.

A DMB-TCA Simulation Method for On-Road Traffic Travel Demand Impact Analysis

Travel Demands influence micro-level traffic behavior, furthermore traffic states. In order to evaluate the effect of travel demands on traffic states, this paper introduces the Demand- Motivation-Behaviors (DMB) micro traffic behavior analysis model which denotes that vehicles behaviors are determines by motivations that relies on traffic demands from the perspective of behavior science. For vehicles, there are two kinds of travel demands: reaching travel destinations from orientations and meeting expectations of travel speed. To satisfy travel demands, the micro traffic behaviors are delivered such as car following behavior, optional and mandatory lane changing behaviors. Especially, mandatory lane changing behaviors depending on travel demands take strong impact on traffic states. In this paper, we define the DMB-based cellular automate traffic simulation model to evaluate the effect of travel demands on traffic states under the different δ values that reflect the ratio of mandatory lane-change vehicles.

Mimicking Morphogenesis for Robust Behaviour of Cellular Architectures

Morphogenesis is the process that underpins the selforganised development and regeneration of biological systems. The ability to mimick morphogenesis in artificial systems has great potential for many engineering applications, including production of biological tissue, design of robust electronic systems and the co-ordination of parallel computing. Previous attempts to mimick these complex dynamics within artificial systems have relied upon the use of evolutionary algorithms that have limited their size and complexity. This paper will present some insight into the underlying dynamics of morphogenesis, then show how to, without the assistance of evolutionary algorithms, design cellular architectures that converge to complex patterns.

A Cheating Model for Cellular Automata-Based Secret Sharing Schemes

Cellular automata have been used for design of cryptosystems. Recently some secret sharing schemes based on linear memory cellular automata have been introduced which are used for both text and image. In this paper, we illustrate that these secret sharing schemes are vulnerable to dishonest participants- collusion. We propose a cheating model for the secret sharing schemes based on linear memory cellular automata. For this purpose we present a novel uniform model for representation of all secret sharing schemes based on cellular automata. Participants can cheat by means of sending bogus shares or bogus transition rules. Cheaters can cooperate to corrupt a shared secret and compute a cheating value added to it. Honest participants are not aware of cheating and suppose the incorrect secret as the valid one. We prove that cheaters can recover valid secret by removing the cheating value form the corrupted secret. We provide methods of calculating the cheating value.