Chaos game representation (CGR) of DNA sequences and linked protein sequences from genomes was proposed by Jeffrey (1990) and Yu et al. (2004), respectively. In this paper, we consider the CGR of three kinds of sequen...Chaos game representation (CGR) of DNA sequences and linked protein sequences from genomes was proposed by Jeffrey (1990) and Yu et al. (2004), respectively. In this paper, we consider the CGR of three kinds of sequences from complete genomes: whole genome DNA sequences, linked coding DNA sequences and linked protein sequences. Some fractal patterns are found in these CGRs. A recurrent iterated function systems (RIFS) model is proposed to simulate the CGRs of these sequences from genomes and their induced measures. Numerical results on 50 genomes show that the RIFS model can simulate very well the CGRs and their induced measures. The parameters estimated in the RIFS model reflect information on species classification.展开更多
We propose a new approach to the investigation of deterministic self-similar networks by using contractive iterated multifunction systems (briefly IMSs). Our paper focuses on the generalized version of two graph model...We propose a new approach to the investigation of deterministic self-similar networks by using contractive iterated multifunction systems (briefly IMSs). Our paper focuses on the generalized version of two graph models introduced by Barabási, Ravasz and Vicsek ([1] [2]). We generalize the graph models using stars and cliques: both algorithm construct graph sequences such that the next iteration is always based on n replicas of the current iteration, where n is the size of the initial graph structure, being a star or a clique. We analyze these self-similar graph sequences using IMSs in function of the size of the initial star and clique, respectively. Our research uses the Cantor set for the description of the fixed set of these IMSs, which we interpret as the limit object of the analyzed self-similar networks.展开更多
A set of contraction maps of a metric space is called an iterated function systems. Iterated function systems with condensation, can be considered infinite iterated function systems. Infinite iterated function systems...A set of contraction maps of a metric space is called an iterated function systems. Iterated function systems with condensation, can be considered infinite iterated function systems. Infinite iterated function systems on compact metric spaces were studied. Using the properties of Banach limit and uniform contractiveness, it was proved that the random iterating algorithms for infinite iterated function systems on compact metric spaces-satisfy ergodicity. So the random iterating algorithms for iterated function systems with condensation satisfy ergodicity, too.展开更多
Random iterated function systems (IFSs) is discussed, which is one of the methods for fractal drawing. A certain figure can be reconstructed by a random IFS. One approach is presented to determine a new random IFS, th...Random iterated function systems (IFSs) is discussed, which is one of the methods for fractal drawing. A certain figure can be reconstructed by a random IFS. One approach is presented to determine a new random IFS, that the figure reconstructed by the new random IFS is the image of the origin figure reconstructed by old IFS under a given affine transformation. Two particular examples are used to show this approach.展开更多
Iterated function systems （IFS） were introduced by Hutchinson in 1981 as a natural generalization of the well-known Banach contraction principle. In 2010, D. R. Sahu and A. Chakraborty introduced K-Iterated Function...Iterated function systems （IFS） were introduced by Hutchinson in 1981 as a natural generalization of the well-known Banach contraction principle. In 2010, D. R. Sahu and A. Chakraborty introduced K-Iterated Function System using Kannan mapping which would cover a larger range of mappings. In this paper, following Hutchinson, D. R. Sahu and A. Chakraborty, we present some new iterated function systems by using the so-called generalized contractive mappings, which will also cover a large range of mappings. Our purpose is to prove the existence and uniqueness of attractors for such class of iterated function systems by virtue of a Banach-like fixed point theorem concerning generalized contractive mappings.展开更多
In this paper, we present some fixed point theorems of iterated function systems consisting of α-ψ-contractive type mappings in Fractal space constituted by the compact subset of metric space and iterated function s...In this paper, we present some fixed point theorems of iterated function systems consisting of α-ψ-contractive type mappings in Fractal space constituted by the compact subset of metric space and iterated function systems consisting of Banach contractive mappings in Fractal space constituted by the compact subset of generalized metric space, which is Mso extensively applied in topological dynamic system.展开更多
An iterated function system crossover (IFSX) operation for real-coded genetic algorithms (RCGAs) is presented in this paper. Iterated?function system (IFS) is one type of fractals that maintains a similarity character...An iterated function system crossover (IFSX) operation for real-coded genetic algorithms (RCGAs) is presented in this paper. Iterated?function system (IFS) is one type of fractals that maintains a similarity characteristic. By introducing the IFS into the crossover operation, the RCGA performs better searching solution with a faster convergence in a set of benchmark test functions.展开更多
植物作为自然景物中最常见的现象之一,模拟的方法是应用数学和图形学领域的一个重要课题。迭代函数系统IFS是分形理论的重要分支,由于植物结构的自相似性,利用IFS(Iterated Function System)可以逼真地模拟各植物形态,简述几种模拟植物...植物作为自然景物中最常见的现象之一,模拟的方法是应用数学和图形学领域的一个重要课题。迭代函数系统IFS是分形理论的重要分支,由于植物结构的自相似性,利用IFS(Iterated Function System)可以逼真地模拟各植物形态,简述几种模拟植物的方法,主要研究迭代函数系统IFS模型,并在VC++6.0环境下基于IFS模型构造出静态蕨叶和树木,详细讨论利用带参量的IFS随机系统实现动画的过程,并利用双缓冲技术,形象逼真地模拟随风摇摆的蕨叶和生长树木的动画效果。实验结果表明,带参数的IFS可使图像发生预期的变化,如果让参数在适当的范围保持连续变化,则动画效果良好。展开更多
文摘Chaos game representation (CGR) of DNA sequences and linked protein sequences from genomes was proposed by Jeffrey (1990) and Yu et al. (2004), respectively. In this paper, we consider the CGR of three kinds of sequences from complete genomes: whole genome DNA sequences, linked coding DNA sequences and linked protein sequences. Some fractal patterns are found in these CGRs. A recurrent iterated function systems (RIFS) model is proposed to simulate the CGRs of these sequences from genomes and their induced measures. Numerical results on 50 genomes show that the RIFS model can simulate very well the CGRs and their induced measures. The parameters estimated in the RIFS model reflect information on species classification.
文摘We propose a new approach to the investigation of deterministic self-similar networks by using contractive iterated multifunction systems (briefly IMSs). Our paper focuses on the generalized version of two graph models introduced by Barabási, Ravasz and Vicsek ([1] [2]). We generalize the graph models using stars and cliques: both algorithm construct graph sequences such that the next iteration is always based on n replicas of the current iteration, where n is the size of the initial graph structure, being a star or a clique. We analyze these self-similar graph sequences using IMSs in function of the size of the initial star and clique, respectively. Our research uses the Cantor set for the description of the fixed set of these IMSs, which we interpret as the limit object of the analyzed self-similar networks.
文摘A set of contraction maps of a metric space is called an iterated function systems. Iterated function systems with condensation, can be considered infinite iterated function systems. Infinite iterated function systems on compact metric spaces were studied. Using the properties of Banach limit and uniform contractiveness, it was proved that the random iterating algorithms for infinite iterated function systems on compact metric spaces-satisfy ergodicity. So the random iterating algorithms for iterated function systems with condensation satisfy ergodicity, too.
文摘Random iterated function systems (IFSs) is discussed, which is one of the methods for fractal drawing. A certain figure can be reconstructed by a random IFS. One approach is presented to determine a new random IFS, that the figure reconstructed by the new random IFS is the image of the origin figure reconstructed by old IFS under a given affine transformation. Two particular examples are used to show this approach.
基金Partially supported by National Natural Science Foundation of China (No. 10961003)
文摘Iterated function systems （IFS） were introduced by Hutchinson in 1981 as a natural generalization of the well-known Banach contraction principle. In 2010, D. R. Sahu and A. Chakraborty introduced K-Iterated Function System using Kannan mapping which would cover a larger range of mappings. In this paper, following Hutchinson, D. R. Sahu and A. Chakraborty, we present some new iterated function systems by using the so-called generalized contractive mappings, which will also cover a large range of mappings. Our purpose is to prove the existence and uniqueness of attractors for such class of iterated function systems by virtue of a Banach-like fixed point theorem concerning generalized contractive mappings.
基金The NSF(11271150)of ChinaChina Government Scholarship
文摘In this paper, we present some fixed point theorems of iterated function systems consisting of α-ψ-contractive type mappings in Fractal space constituted by the compact subset of metric space and iterated function systems consisting of Banach contractive mappings in Fractal space constituted by the compact subset of generalized metric space, which is Mso extensively applied in topological dynamic system.
文摘An iterated function system crossover (IFSX) operation for real-coded genetic algorithms (RCGAs) is presented in this paper. Iterated?function system (IFS) is one type of fractals that maintains a similarity characteristic. By introducing the IFS into the crossover operation, the RCGA performs better searching solution with a faster convergence in a set of benchmark test functions.
文摘植物作为自然景物中最常见的现象之一,模拟的方法是应用数学和图形学领域的一个重要课题。迭代函数系统IFS是分形理论的重要分支,由于植物结构的自相似性,利用IFS(Iterated Function System)可以逼真地模拟各植物形态,简述几种模拟植物的方法,主要研究迭代函数系统IFS模型,并在VC++6.0环境下基于IFS模型构造出静态蕨叶和树木,详细讨论利用带参量的IFS随机系统实现动画的过程,并利用双缓冲技术,形象逼真地模拟随风摇摆的蕨叶和生长树木的动画效果。实验结果表明,带参数的IFS可使图像发生预期的变化,如果让参数在适当的范围保持连续变化,则动画效果良好。
