A NOTE ON THE JULIA SETS OF ENTIRE SOLUTIONS TO DELAY DIFFERENTIAL EQUATIONS

Let f be an entire solution of the Tumura-Clunie type non-linear delay differential equation.We mainly investigate the dynamical properties of Julia sets of f,and the lower bound estimates of the measure of related limiting directions is verified.

基于Julia集的潮汕抽纱装饰纹样分形设计

分形普遍存在于自然环境的微观之中,在农业上常用于土壤特征与农作物结构等的分析。分形图案因其生于自然的特点,在解释自然结构的同时具有艺术性,与传统植物纹样搭配相适应。农作物作为潮汕抽纱纹样的主要题材,文章提出基于Julia集的潮汕抽纱植物装饰纹样分形设计模型,试图更好地实现潮汕抽纱数字化,提供符合当下审美的分形纹样设计,缓解自20世纪90年代工业化冲击后,抽纱从业人员凋零,缺乏从事其纹样设计人员的现状。通过对葡萄、麦穗、花卉等纹样进行归类与分形维度的计算,总结潮汕抽纱植物纹样的分形特征,应用分形艺术软件UF6完成分形纹样设计,与传统潮汕抽纱植物纹样遵循类别、形制进行组合。最后,针对青年群体进行模型输出结果的问卷调研,从民族性、创新性、艺术性、喜爱度验证分形引入潮汕抽纱的可行性,并邀请非遗工作者从生产角度做出评价。结果表明:潮汕抽纱可通过分形设计扩充新的纹样素材,青年群体希望潮汕抽纱能以局部装饰的形式融入日常应用的产品中。在生产上,根据应用于织品、印刷等不同需求,对分形纹样的复杂程度作出考量或简化,为刺绣织品图案的创新设计提供参考,展现分形通过农业所表现的艺术性。

基于Julia集和DNA编码的彩色图像加密算法

安全性在图像传输过程中至关重要,为了保证图像信息的安全传输,提出了一种基于Julia集和DNA编码的彩色图像加密算法,该算法使用边界具有混沌性的Julia集作为密钥,并使用幻方置乱对Julia集边界放大区域进行密钥转化,得到密钥图像,结合DNA随机编码对明文图像进行扩散,得到最终密文图像。Julia集密钥仅需要几个简单的参数生成,大大减少了密钥的存储空间。Julia集的混沌性使得密钥随参数的细微修改而发生明显变化,无法正常解密。DNA随机编码有效解决了单一编码方式易受明文攻击的问题。仿真结果表明,论文算法在密钥敏感性、信息熵、抗噪声和差分攻击等方面具有较高的安全性。

LIMITING DIRECTIONS OF JULIA SETS OF ENTIRE SOLUTIONS TO COMPLEX DIFFERENTIAL EQUATIONS

In this paper,we mainly investigate the dynamical properties of entire solutions of complex differential equations.With some conditions on coefficients,we prove that the set of common limiting directions of Julia sets of solutions,their derivatives and their primitives must have a definite range of measure.

Control and synchronization of second Julia sets

A visualization of Julia sets of the complex Henon map system with two complex variables is introduced in this paper. With this method, the optimal control function method is introduced to this system and the control and synchronization of its Julia sets are achieved. Control and synchronization of generalized Julia sets are also achieved with this optimal control method. The simulations illustrate the efficacy of this method.

Generalization of 3D Mandelbrot and Julia sets

In order to further enrich the form of 3D Mandelbrot and Julia sets, this paper first presents two methods of generating 3D fractal sets by utilizing discrete modifications of the standard quaternion algebra and analyzes the limitations in them. To overcome these limitations, a novel method for generating 3D fractal sets based on a 3D number system named ternary algebra is proposed. Both theoretical analyses and experimental results demonstrate that the ternary-algebra-based method is superior to any one of the quad-algebra-based methods, including the first two methods presented in this paper, because it is more intuitive, less time consuming and can completely control the geometric structure of the resulting sets. A ray-casting algorithm based on period checking is developed with the goal of obtaining high-quality fractal images and is used to render all the fractal sets generated in our experiments. It is hoped that the investigations conducted in this paper would result in new perspectives for the generalization of 3D Mandelbrot and Julia sets and for the generation of other deterministic 3D fractals as well.

Gradient control and synchronization of Julia sets

This paper firstly introduces the control methods to fractals and give the definition of synchronization of Julia sets between two different systems. Especially, the gradient control method is taken on the classic Julia sets of complex quadratic polynomial Zn＋1 = zn^2＋ c, which realizes its Julia sets control and synchronization. The simulations illustrate the effectiveness of the method.

HEAT KERNEL ESTIMATES ON JULIA SETS

We give heat kernel estimates on Julia sets J（f;） for quadratic polynomials f c（z） = z;+ c for c in the main cardioid or the ±1/k-bulbs where k ≥ 2. First we use external ray parametrization to construct a regular, strongly local and conservative Dirichlet form on Julia set. Then we show that this Dirichlet form is a resistance form and the corresponding resistance metric induces the same topology as Euclidean metric. Finally, we give heat kernel estimates under the resistance metric.

On the Continuity of Julia Sets and Hausdorff Dimension of N CP and Parabolic Maps

Denote by HD（J（f）） the Hausdorff dimension of the Julia set J（f） of a rational function f. Our first result asserts that if f is an NCP map, and fn → f horocyclically,preserving sub-critical relations, then fn is an NCP map for all n ≥≥ 0 and J（fn） →J（f） in the Hausdorff topology. We also prove that if f is a parabolic map and fn is an NCP map for all n ≥≥ 0 such that fn→4 f horocyclically, then J（fn） → J（f） in the Hausdorff topology, and HD（J（fn）） →4 HD（J（f））.

CONTINUITY AND HAUSDORFF DIMENSION OF JULIA SET CONCERNING YANG-LEE ZEROS

Considering the Julia set J（Tλ） of the Yang-Lee zeros of the Potts model on the diamond hierarchical Lattice on the complex plane, the authors proved that HDJ（Tλ） 〉 1 and discussed the continuity of J（Tλ） in Hausdorff topology for λ∈R.

A new identification control for generalized Julia sets

In this paper, we propose a new method to realize drive-response system synchronization control and parameter identification for a class of generalized Julia sets. By means of this method, the zero asymptotic sliding variables are applied to control the fractal identification. Furthermore, the problems of synchronization control are solved in the case of a drive system with unknown parameters, and the unknown parameters of the drive system can be identified in the asymptotic synchronization process. The results of simulation examples demonstrate the effectiveness of this new method. Particularly, the basic Julia set is also discussed.

BURIED COMPONENTS OF A JULIA SET

In this note,it is shown that if a rational function f of degree≥2 has a nonempty set of buried points,then for a generic choice of the point z in the Julia set, z is a buried point,and if the Julia set is disconnected,it has uncountably many buried components.

CONTINUITY OF JULIA SET FOR A FAMILY OF ENTIRE FUNCTIONS

Based on the work of McMullen about the continuity of Julia set for rational functions, in this paper, we discuss the continuity of Julia set and its Hausdorff dimension for a family of entire functions which satisfy some conditions.

ON THE DISTRIBUTION OF JULIA SETS OF HOLOMORPHIC MAPS

In 1965 Baker first considered the distribution of Julia sets of transcendental entire maps and proved that the Julia set of an entire map cannot be contained in any finite set of straight lines.In this paper we shall consider the distribution problem of Julia sets of meromorphic maps.We shall show that the Julia set of a transcendental meromorphic map with at most finitely many poles cannot be contained in any finite set of straight lines.Meanwhile,examples show that the Julia sets of meromorphic maps with infinitely many poles may indeed be contained in straight lines.Moreover,we shall show that the Julia set of a transcendental analytic self-map of C*can neither contain a free Jordan arc nor be contained in any finite set of straight lines.

On the Local Connected and Jordanian Julia Sets

In this article, we investigate the dynamical properties of fλ（z） =λzke2, for λ（≠0） ∈Cand k≥2. We will show that the boundaries of some （or all ） Fatou components are Jordan curves and the Julia sets are Sierpinski carpet, and they are locally connected for some certain λ.

Julia sets of semi-conjugated transcendental entire functions

Suppose that f and g are two transcendental entire functions, and h is a non-constant periodic entire function. We denote the Julia set and Fatou set off by J（f） and F（f）, respectively, lffand g are semiconjugated, that is, h · f = g · h, in this paper, we will show that z ∈ J（f） if and only if h（z） ∈ J（g） （ similarly, z F（f） if and only ifh（z） ∈ F（g））, and this extends a result of Bergweiler.

A new escape time algorithm of constructing Julia set

Escape time algorithm is an effective theoretical algorithm of constructing fractal graphics. The key of this algorithm lies in the construction of escape time function. A new escape time function is presented based on the research of escape time algorithm. An accelerated escape time algorithm is carried out in this paper. The experiments have demonstrated that the new algorithm is not only as precise as the old, but also faster when it is used to construct Julia set.

Conditions Where the Chaotic Set Has a Non-Empty Residual Julia Set for Two Classes of Meromorphic Functions

We define the Fatou and Julia sets for two classes of meromorphic functions. The Julia set is the chaotic set where the fractals appear. The chaotic set can have points and components which are buried. The set of these points and components is called the residual Julia set, denoted by , and is defined to be the subset of those points of the Julia set, chaotic set, which do not belong to the boundary of any component of the Fatou set (stable set). The points of are called buried points and the components of are called buried components. In this paper we extend some results related with the residual Julia set of transcendental meromorphic functions to functions which are meromorphic outside a compact countable set of essential singularities. We give some conditions where .

The Lebesgue Measure of the Julia Sets of Permutable Transcendental Entire Functions

In 1958, Baker posed the question that if f and g are two permutable transcendental entire functions, must their Julia sets be the same? In order to study this problem of permutable transcendental entire functions, by the properties of permutable transcendental entire functions, we prove that if f and g are permutable transcendental entire functions, then mes (J(f)) = mes (J(g)). Moreover, we give some results about the zero measure of the Julia sets of the permutable transcendental entire functions family.

基于广义Julia集的印花图案设计

根据纺织印花图案特点,运用非线性科学可视化方法,对部分高次幂、三角函数形式的广义Julia集图形的生成原理以及通过参数控制广义Julia集图形变化的方法进行初步研究,在此基础上,运用计算机图形技术,借助电子(喷)印花手段,对应用广义Julia集图形进行纺织印花图案设计的方法与途径进行探讨,发现借助计算机可视化技术,基于广义Julia集的图形生成原理进行图案设计,并通过印花将可视化信息展现在织物上是可行的,此方法适合于丝巾等印花图案的艺术设计与表现。