Geometry and combinatorics of Julia sets of real quadratic maps

For real a correspondence is made between the Julia setB forz(z–)², in the hyperbolic case, and the set of-chains±(±(±..., with the aid of Cremer's theorem. It is shown how a number of features ofB can be understood in terms of-chains. The structure ofB is determined by certain equivalence classes of-chains, fixed by orders of visitation of certain real cycles; and the bifurcation history of a given cycle can be conveniently computed via the combinatorics of-chains. The functional equations obeyed by attractive cycles are investigated, and their relation to-chains is given. The first cascade of period-doubling bifurcations is described from the point of view of the associated Julia sets and-chains. Certain Julia sets associated with the Feigenbaum function and some theorems of Lanford are discussed.Supported by NSF grant No. MCS-8104862.Supported by NSF grant No. MCS-8203325.     

Phenomenology of nonlocal cellular automata

Dynamical systems with nonlocal connections have potential applications to economic and biological systems. This paper studies the dynamics of nonlocal cellular automata. In particular, all two-state, three-input nonlocal cellular automata are classified according to the dynamical behavior starting from random initial configurations and random wirings, although it is observed that sometimes a rule can have different dynamical behaviors with different wirings. The nonlocal cellular automata rule space is studied using a mean-field parametrization which is ideal for the situation of random wiring. Nonlocal cellular automata can be considered as computers carrying out computation at the level of each component. Their computational abilities are studied from the point of view of whether they contain many basic logical gates. In particular, I ask the question of whether a three-input cellular automaton rule contains the three fundamental logical gates: two-input rules AND and OR, and one-input rule NOT. A particularly interesting edge-of-chaos nonlocal cellular automaton, the rule 184, is studied in detail. It is a system of coupled selectors or multiplexers. It is also part of the Fredkin's gate—a proposed fundamental gate for conservative computations. This rule exhibits irregular fluctuations of density, large coherent structures, and long transient times.     

一种新型通用化图像处理系统的设计

提出了一种基于FPGA+DSP的通用化嵌入式图像处理模块,可以用于不同的项目,只需要针对不同的项目设计不同的AD、DA和接口就可以了。该处理模块具有高性能、低功耗、低成本、可扩展、可重构、灵活性强等优点,可以大大降低开发成本和设计周期。     

Harmonic operation of high gain harmonic generation free electron laser

In high gain harmonic generation (HGHG) free electron laser (FEL), with the right choice of parameters of the modulator undulator, the dispersive section and the seed laser, one may make the spatial bunching of the electron beam density distribution correspond to one of the harmonic frequencies of the radiator radiation, instead of the fundamental frequency of the radiator radiation in conventional HGHG, thus the radiator undulator is in harmonic operation (HO) mode. In this paper, we investigate HO of HGHG FEL.Theoretical analyses with universal method are derived and numerical simulations in ultraviolet and deep ultraviolet spectral regions are given. It shows that the power of the 3rd harmonic radiation in the HO of HGHG may be as high as 18.5% of the fundamental power level. Thus HO of HGHG FEL may obtain short wavelength by using lower beam energy.     

应用于碱卤化物固体的通用状态方程

提出一种能精确考虑固体结合能的通用状态方程,并且在高压和膨胀区域都具有正确的行为,不会出现物理上不正确的振荡现象.将新方程与文献中的典型方程应用于15种碱金属卤化物和一种碱土金属氧化物,结果表明新方程在给出正确结合能数据的同时,能够很好地拟合实验压缩数据.由Vinet方程和Morse方程定出的参数随数据范围变化很明显,新方程定出的参数随数据范围变化不明显.新方程的通用性优于Vinet方程和Morse方程. 关键词： 固体 通用状态方程 结合能 碱金属卤化物     

尊严与必然性：康德伦理思想的伍德式阐释

在伍德看来,奠基于人性尊严之上的道德自律和目的王国乃是康德伦理学的核心要义,是联结康德道德法则诸公式的枢纽,也是阐明康德整个实践哲学体系的根本价值前提。尽管存在一些疑难之处,但是伍德的创造性解读为从社会政治、自然历史以及情感欲求等实践人类学视角理解康德伦理学拓展了思想空间,这一阐释模式不仅区别于罗尔斯式的建构主义进路,更在反思批判种种误读与诘难中捍卫康德的启蒙精神和共同体理想。     

Physical Dimensions/Units and Universal Constants: Their Invariance in Special and General Relativity

The theory of physical dimensions and units in physics is outlined. This includes a discussion of the universal applicability and superiority of quantity equations. The International System of Units (SI) is one example thereof. By analyzing mechanics and electrodynamics, it naturally leads one, besides the dimensions of length and time, to the fundamental units of action $\mathfrak{h}$, electric charge q, and magnetic flux ?. Also, $q\times ?=\text{action}$ and $q/?=1/\text{resistance}$ are known. These results of classical physics suggests to look into the corresponding quantum aspects of q and ? (and also of $\mathfrak{h}$): The electric charge occurs exclusively in elementary charges e, whereas the magnetic flux can have any value; in specific situations, however, in superconductors of type II at very low temperatures, ? appears quantized in the form of fluxons (Abrikosov vortices). And $\mathfrak{h}$ leads, of course, to the Planck quantum h. Thus, one is directed to superconductivity and, because of the resistance, to the quantum Hall effect. In this way, the Josephson and the quantum Hall effects come into focus quite naturally. One goal is to determine the behavior of the fundamental constants in special and in general relativity.     

Dependency distance: A new perspective on syntactic patterns in natural languages

Dependency distance, measured by the linear distance between two syntactically related words in a sentence, is generally held as an important index of memory burden and an indicator of syntactic difficulty. Since this constraint of memory is common for all human beings, there may well be a universal preference for dependency distance minimization (DDM) for the sake of reducing memory burden. This human-driven language universal is supported by big data analyses of various corpora that consistently report shorter overall dependency distance in natural languages than in artificial random languages and long-tailed distributions featuring a majority of short dependencies and a minority of long ones. Human languages, as complex systems, seem to have evolved to come up with diverse syntactic patterns under the universal pressure for dependency distance minimization. However, there always exist a small number of long-distance dependencies in natural languages, which may reflect some other biological or functional constraints. Language system may adapt itself to these sporadic long-distance dependencies. It is these universal constraints that have shaped such a rich diversity of syntactic patterns in human languages.     

Universal C*-algebras defined by completely bounded unital homomorphisms

Suppose A is a unital C*-algebra and r 1.In this paper,we define a unital C*-algebra C_(cb)*(A,r) and a completely bounded unital homomorphism α_r:A → C_(cb)*(A,r)with the property that C_(cb)*(A,r)=C*(α_r(A))and,for every unital C*-algebra B and every unital completely bounded homomorphism φ:A→ B,there is a(unique)unital *-homomorphism π:C_(cb)*(A,r)→B such thatφ=πoα_r.We prove that,if A is generated by a normal set {t_λ:λ∈Λ},then C_(cb)*(A,r)is generated by the set {α_r(t_λ):λ∈Λ}.By proving an equation of the norms of elements in a dense subset of C_(cb)*(A,r)we obtain that,if Β is a unital C*-algebra that can be embedded into A,then C_(cb)*(B,r)can be naturally embedded into C(cb)*(A,r).We give characterizations of C_(cb)*(A,r)for some special situations and we conclude that C_(cb)*(A,r)will be "nice" when dim(A)≤ 2 and "quite complicated" when dim(A)≥ 3.We give a characterization of the relation between K-groups of A and K-groups of C_(cb)*(A,r).We also define and study some analogous of C_(cb)*(A,r).