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.     

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).     

基于ARM和nRF905组网的智能家居系统设计

针对家居中电器种类和数目繁多且分散于各室造成控制不便,提出了一种利用nRF905射频模块实现无线通信的智能家居控制系统。系统对射频数据传输协议进行了设计,给出了室内多个微控制器的组网方案。用户通过手机短信或万能遥控器把对家电的控制信号发送至基于ARM平台搭建的主控中心,再由主控中心发送至若干个通信节点或智能插座,万能遥控器通过射频信号实现对家电的近距离遥控,手机通过GSM通信实现对家电的远程遥控。通信节点基于STC89C52RC单片机设计,能够实现对多种红外家电的控制并具备安防报警功能,智能插座则用于控制非遥控家电。实验表明,该系统可使网络中各节点、插座得到有效的控制,数据传输稳定、功能丰富、可扩展性强,具备较高的应用价值。     

Enzyme-free and DNA-based universal platform for the construction of various logic devices based on graphene oxide and G-quadruplex

In the fields of biocomputing and biomolecular, DNA molecules are applicable to be regarded as data of logical computing platform that uses elaborate logic gates to perform a variety of tasks. Graphene oxide (GO) is a type of novel nanomaterial, which brings new research focus to materials science and biosensors due to its special selectivity and excellent quenching ability. G-quadruplex as a unique DNA structure stimulates the intelligent application of DNA assembly on the strength of its exceptional binding activity. In this paper, we report a universal logic device assisted with GO and G-quadruplex under an enzyme-free condition. Integrated with the quenching ability of GO to the TAMRA (fluorophore, Carboxytetramethylrhodamine) and the enhancement of fluorescence intensity produced by the peculiar binding of G-quadruplex to the NMM (N-methylmesoporphyrin IX), a series of basic binary logic gates (AND. OR. INHIBIT. XOR) have been designed and verified through biological experiments. Given the modularity and programmability of this strategy, two advanced logic gates (half adder and half subtractor) were realized on the basis of the same work platform. The fluorescence signals generated from different input combinations possessed satisfactory results, which provided proof of feasibility. We believe that the proposed universal logical platform that operates at the nanoscale is expected to be utilized for future applications in molecular computing as well as disease diagnosis.     

4种等温物态方程适用性的比较研究

 通过分析现有文献,认为4种两参数的物态方程在高压物理研究中较为流行,它们是Vinet、Baonza、Morse和Born-Meyer（BM）方程。将这4种方程用于拟合50种材料的实验压缩数据,得出了零压下压缩模量及其一阶压力导数的优化取值,并计算了4种方程的平均压力误差。结果表明,Morse方程的精度最高,对50种材料的平均拟合误差为0.557 6%;BM方程次之,平均误差为0.615 1%;Vinet和Baonza方程的误差大一些,分别为0.788 9%和0.833 3%。对8种典型材料计算了压力误差随压强变化的曲线,所得结果与平均误差的趋势一致,也是Morse方程的精度最高。在宽广压力范围的高压物态方程研究中,推荐使用Morse方程。     

含双萘环通用染料的合成与染色性质

含双萘环通用染料的合成与染色性质;通用染料;双萘环;合成;染色