作者：
Adams, Alyssa M.Univ Wisconsin
Dept Bacteriol Algorithm Nat Grp Madison WI 53706 USA Univ Wisconsin
Computat & Informat Biol & Med Program Algorithm Nat Grp Madison WI 53706 USA
Biological systems are notorious for complex behavior within short timescales (e.g., metabolic activity) and longer timescales (e.g., evolutionary selection), along with their complex spatial organization. Because of ...
详细信息
Biological systems are notorious for complex behavior within short timescales (e.g., metabolic activity) and longer timescales (e.g., evolutionary selection), along with their complex spatial organization. Because of their complexity and their ability to innovate with respect to their environment, living systems are considered to be open-ended. Historically, it has been difficult to model open-ended evolution and innovation. As a result, our understanding of the exact mechanisms that distinguish open-ended living systems from nonliving ones is limited. One of the biggest barriers is understanding how multiple, complex parts within a single system interact and contribute to the complex, emergent behavior of the system as a whole. How do interactions between parts of a system lead to more complex behavior of the system as a whole? This paper presents two interacting cellular automata (CAs) as an abstract model to address the effects of complex interactions between two individual entities embedded within a larger system. Unlike elementary CAs, each cellular automaton (CA) changes its update rules as a function of the system's state as a whole. The resulting behavior of the two-CA system suggests that complex interaction functions between the two CAs have little to no effect on the complexity of each individual CA's behavior and structure. However, having an interaction function that is random results in open-ended evolution regardless of the specific type of state-dependency.
In this paper we investigate the Monte-Carlo method for estimation of the unknown probability of a random event on the ground of relative frequencies and under the condition that random sampling is replaced by a deter...
详细信息
In this paper we investigate the Monte-Carlo method for estimation of the unknown probability of a random event on the ground of relative frequencies and under the condition that random sampling is replaced by a deterministic side input producing binary sequences of high algorithmic complexity. Itis proved that if this complexity exceeds a treshold value, the sequences may be used in the Monte-Carlo methods instead of random samples as the obtained estimates converge to the estimated probability when the length of these binary sequences increases.
We study quantum annealing for combinatorial optimization with Hamiltonian H=H0+zHf where Hf is diagonal, H0=-|phi⟩⟨phi| is the equal superposition state projector and z the annealing parameter. We analytically comput...
详细信息
We study quantum annealing for combinatorial optimization with Hamiltonian H=H0+zHf where Hf is diagonal, H0=-|phi⟩⟨phi| is the equal superposition state projector and z the annealing parameter. We analytically compute the minimal spectral gap, which is O1/N with N the total number of states, and its location z* . We show that quantum speed-up requires an annealing schedule which demands a precise knowledge of z* , which can be computed only if the density of states of the optimization problem is known. However, in general the density of states is intractable to compute, making quadratic speed-up unfeasible for any practical combinatorial optimization problems. We conjecture that it is likely that this negative result also applies for any other instance independent transverse Hamiltonians such as H0=- n-ary sumation i=1n sigma ix .
This paper provides an initial introduction to, and definition of, the 'Dynamically Powered Relays for a Flexible Optical Network' (DPR-FON) problem for opto-electro-optical (OEO) regenerators used in optical ...
详细信息
This paper provides an initial introduction to, and definition of, the 'Dynamically Powered Relays for a Flexible Optical Network' (DPR-FON) problem for opto-electro-optical (OEO) regenerators used in optical networks. In such networks, optical transmission parameters can be varied dynamically as traffic patterns change. This will provide different bandwidths, but also change the regeneration limits as a result. To support this flexibility, OEOs ('relays') may be switched on and off as required, thus saving power. DPR-FON is shown to be NP-complete;consequently, solving such a dynamic problem in real-time requires a fast heuristic capable of delivering an acceptable approximation to the optimal configuration with low complexity. In this paper, just such an algorithm is developed, implemented, and evaluated against more computationally-demanding alternatives for two known cases. A number of real-world extensions are considered as the paper develops, combining to produce the 'Generalised Dynamically Powered Relays for a Flexible Optical Network' (GDPR-FON) problem. This, too, is analysed and an associated fast heuristic proposed, along with an exploration of the further research that is required.
作者：
Longo, SavinoUniv Bari Aldo Moro
Dipartimento Chim Via Orabona 4 I-70125 Bari Italy CNR
Bari Sect Ist Sci & Tecnol Plasmi Via Amendola 122-D I-70125 Bari Italy
Simple rewriting rules are used to produce alphanumeric strings that embed fractal number sequences and are directly translatable into descriptions of hydrocarbon structures of considerable complexity, featuring hiera...
详细信息
Simple rewriting rules are used to produce alphanumeric strings that embed fractal number sequences and are directly translatable into descriptions of hydrocarbon structures of considerable complexity, featuring hierarchical schemes. Rotations of the alphanumeric strings lead to radical rearrangements of the corresponding structures, which lose their initial schemes and become much less predictable, featuring different topologies of polygonal cycles. This shows that a complex and not necessarily ordered molecular structure may nevertheless have a relatively low algorithmic complexity. The variety and versatility of reorganization in chemical topology, due to the nonlocal representation of bonds in the coding string, may have played a role in prebiotic chemistry.
This paper evaluates the performance of closed loop multiple input multiple output power line communication (CL MIMO PLC) system based on enhanced zero-forcing (ZF) equalizer. In this work, the two-sided Jacobi (TSJ) ...
详细信息
This paper evaluates the performance of closed loop multiple input multiple output power line communication (CL MIMO PLC) system based on enhanced zero-forcing (ZF) equalizer. In this work, the two-sided Jacobi (TSJ) algorithm has been investigated for the computation of singular value decomposition of the channel matrix. Quantized parameters are feedback from the receiver to the transmitter for precoding process. Numerous simplifications are introduced for the reduction of the algorithm complexity. The performance of the CL MIMO PLC is evaluated in terms of bit error rate (BER), constellation error vector magnitude (EVM), and mean square error (MSE) between the constructed SVD matrices and Matlab computed ones.
Maximum power tracking control is indispensable for Photovoltaic system to gain higher output power. For nonlinear system as photovoltaic system, extremum seeking control algorithm can reach good control effect. In vi...
详细信息
ISBN:
(纸本)9781728114552
Maximum power tracking control is indispensable for Photovoltaic system to gain higher output power. For nonlinear system as photovoltaic system, extremum seeking control algorithm can reach good control effect. In view of the contradiction between tracking performance and algorithm complexity, and the problem of misjudgment when environment changes, a fusion optimization method based on observation tracking and extremum seeking is proposed in this paper, the fuses step based on the output power difference. The experimental results show that the optimized algorithm can further improve the conversion efficiency and performance compared with other algorithms while maintaining low complexity and implementation cost.
We review the basics of classical algorithmic complexity theory and two of its quantum extensions that have been promoted by the foreseeable existence of quantum computing devices. In particular, we will examine the r...
详细信息
We review the basics of classical algorithmic complexity theory and two of its quantum extensions that have been promoted by the foreseeable existence of quantum computing devices. In particular, we will examine the relations between these extensions and the von Neumann entropy rate of generic quantum information sources of ergodic type.
Modern digital signal processing applications have an increasing demand for computational power while needing to preserve low power dissipation and high flexibility. For many applications, the growth of algorithmic co...
详细信息
ISBN:
(纸本)9783981080131
Modern digital signal processing applications have an increasing demand for computational power while needing to preserve low power dissipation and high flexibility. For many applications, the growth of algorithmic complexity is already faster than the growth of computational power provided by discrete general purpose processors [1]. A typical approach to address this problem is the combination of a processor core with dedicated accelerators. Since changes in standards or algorithms can change the demands on the accelerators, an attractive alternative to highly customised VLSI-macros is the use of reconfigurable embedded FPGAs (eFPGAs). First commercial products combining a general purpose processor core and an embedded FPGA recently emerged (e.g. Stretch S6000 [2], Menta eFPGA-augmented CPUs [3]). For many digital signal processing applications, a significantly improved efficiency in terms of power dissipation, throughput and chip area can be achieved by tailoring both the processor core and the reconfigurable accelerator to the given application domain [4]. In this work, a methodology to design highly customisable eFPGA-architectures starting from a high level description is presented. The design framework elaborated during this work enables a physically optimised VLSI-design of the specified eFPGA and aims to support simulation of the according eFPGA-macros both on a functional and netlist-level by providing an elementary configuration tool based on the same high level description as the eFPGA-architecture.
In this paper, optimization method of two-dimensional higher-order (2,4) (H(2,4)) finite-difference time-domain method is developed to achieve isotropic dispersion for the lossless material case. Two variables are use...
详细信息
ISBN:
(纸本)9781467321877
In this paper, optimization method of two-dimensional higher-order (2,4) (H(2,4)) finite-difference time-domain method is developed to achieve isotropic dispersion for the lossless material case. Two variables are used. One makes isotropic dispersion and the other reduces numerical dispersion error near the operating frequency. Computation quantity and algorithm complexity of the proposed scheme are equal to those of H(2,4) scheme. And the proposed method is verified by calculating electrically large problem.
暂无评论