A chemical genetic algorithm (CGA) in which several types of molecules (information units) react with each other in a cell is proposed. Not only the information in DNA, but also smaller molecules responsible for the t...
详细信息
A chemical genetic algorithm (CGA) in which several types of molecules (information units) react with each other in a cell is proposed. Not only the information in DNA, but also smaller molecules responsible for the transcription and translation of DNA into amino acids, are adaptively changed during evolution, which optimizes the fundamental mapping from binary substrings in DNA (genotype) to real values for a parameter set (phenotype). Through the struggle between cells containing a DNA unit and small molecular units, the codes (DNA) and the interpreter (the small molecular units) coevolve, and a specific output function, from which a cell's fitness is evaluated, is optimized. To demonstrate the effectiveness of the CGA, it is applied to a set of variable-separable and variable-inseparable problems, and it is shown that the CGA can robustly solve a wide range of optimization problems regardless of their fitness characteristics. To ascertain the optimization of the genotype-to-phenotype mapping by the CGA, we also conduct analytical experiments for some problems while observing the basin size of a global optimum solution in the binary genotype space. The results show that the CGA effectively augments the basin size, makes it easier for evolution to find a path to the global optimum solution, and enhances the GA's evolvability during evolution.
Whereas the value of the work of Hinshelwood is well acknowledged in physical chemistry (Laidler 1993), his contributions to modern biology are more controversed. He is credited with having been the first to propose t...
详细信息
Whereas the value of the work of Hinshelwood is well acknowledged in physical chemistry (Laidler 1993), his contributions to modern biology are more controversed. He is credited with having been the first to propose that the sequence of nucleotides is responsible for the determination of the sequence of amino acids in proteins, in an article published in the Journal of the Chemical Society in 1950 (Caldwell and Hinshelwood 1950b): the polypeptide chain is progressively elongated on a polynucleotide matrix of RNA by a process similar to crystallization. A strong argument in favour of the existence of such a process was the similar value (3.4 Angstroms) separating nucleotides in an elongated chain and amino acids in proteins, revealed by the X-ray diffraction studies performed by William Astbury in Leeds (Astbury and Bell 1938).
A coding problem, over a slotted system, is introduced where the sender has to transmit one out of several packets to the receiver, but learns the request only at the beginning of each slot with prior statistical info...
详细信息
ISBN:
(纸本)9781457705953
A coding problem, over a slotted system, is introduced where the sender has to transmit one out of several packets to the receiver, but learns the request only at the beginning of each slot with prior statistical information about which packet is needed at the receiver. There is an associated cost of sending bits at each slot, and the goal is to minimize the expected cost of the communication. A proactive coding scheme is proposed, where the source proactively communicates with the receiver before the receiver requests the message. This way, by designing a cost optimal side information at the receiver, the scheme is able to minimize the expected cost of the communication. Numerical results are provided demonstrating the gains obtained by proactive coding over the conventional coding technique.
We prove that a trace monoid embeds into the queue monoid if and only if it embeds into the direct product of two free monoids. We also give a decidable characterization of these trace monoids.
ISBN:
(纸本)9783662531327;9783662531310
We prove that a trace monoid embeds into the queue monoid if and only if it embeds into the direct product of two free monoids. We also give a decidable characterization of these trace monoids.
We consider the question of the capacity of the deletion channel when multiple copies of the codeword are sent independently through the channel. This type of coding problem is straightforward for standard erasure and...
详细信息
ISBN:
(纸本)9781479959990
We consider the question of the capacity of the deletion channel when multiple copies of the codeword are sent independently through the channel. This type of coding problem is straightforward for standard erasure and error channels, but is more challenging in the deletion channel setting. Our results show that when the same codeword is sent k times through the channel, each time with independent deletions with probability d, the optimal communication rate under a random codebook is 1-alpha H (d(k)) + O (d(k)) for an explicitly given constant alpha.
暂无评论