卤代哒嗪酮氟代反应的研究

前文^[1,2]报道了氟代哒嗪二酮化合物的合成及生理活性,其合成路线较长,收率较低。     

A universal unfolding of the Lorenz system

A universal unfolding of the Lorenz system is derived and studied in this paper. Both rigorous theoretical analysis and numerical simulations show that the Lorenz system, the Chen system, and the Lü system belong to the same universal unfolding. Therefore, they all have similar dynamical behaviors in the sense that if the Lorenz system has limit cycles produced from a Hopf bifurcation for a certain set of parameter values, then the other two systems also have limit cycles from the same set of parameter values; and if the Lorenz, Chen, and Lü systems are chaotic for some parameter values (for example, some typical parameter values), respectively, then the homotopic system for the Lorenz system and the Chen system, and the homotopic system for these three systems, are all chaotic within the entire domain of these homotopic parameters.     

A fast algorithm for scalar Nevanlinna-Pick interpolation

Summary In this paper, we derive a fast algorithm for the scalar Nevanlinna-Pick interpolation. Givenn distinct pointsz _i in the unit disk |z|<1 andn complex numbersw _i satisfying the Pick condition for 1in, the new Nevanlinna-Pick interpolation algorithm requires onlyO(n) arithmetic operations to evaluate the interpolatory rational function at a particular value ofz, in contrast to the classical algorithm which requiresO(n ²) arithmetic operations to compute the so-called Fenyves array (which is inherent in the classical algorithm). The new algorithm bypasses the generation of the Fenyves array to speed up the computation, and also yields a parallel scheme requiring onlyO(logn) arithmetic operations on a concurrent-read, exclusive-write parallel random access machine withn processors. We must remark that the rational functionf(z) computed by the new algorithm is one degree higher than the function computed by the classical algorithm.Supported in part by the US Army Research Office Grant No. DAAL03-91-G-0106     

Synchronization of weighted networks and complex synchronized regions

Since the Laplacian matrices of weighted networks usually have complex eigenvalues, the problem of complex synchronized regions should be investigated carefully. The present Letter addresses this important problem by converting it to a matrix stability problem with respect to a complex parameter, which gives rise to several types of complex synchronized regions, including bounded, unbounded, disconnected, and empty regions. Because of the existence of disconnected synchronized regions, the convexity characteristic of stability for matrix pencils is further discussed. Then, some efficient methods for designing local feedback controllers and inner-linking matrices to enlarge the synchronized regions are developed and analyzed. Finally, a weighted network of smooth Chua's circuits is presented as an example for illustration.     

Modelling of weighted evolving networks with community structures

Many social and biological networks consist of communities–groups of nodes within which links are dense but among which links are sparse. It turns out that most of these networks are best described by weighted networks, whose properties and dynamics depend not only on their structures but also on the link weights among their nodes. Recently, there are considerable interests in the study of properties as well as modelling of such networks with community structures. To our knowledge, however, no study of any weighted network model with such a community structure has been presented in the literature to date. In this paper, we propose a weighted evolving network model with a community structure. The new network model is based on the inner-community and inter-community preferential attachments and preferential strengthening mechanism. Simulation results indicate that this network model indeed reflect the intrinsic community structure, with various power-law distributions of the node degrees, link weights, and node strengths.     

Discrete chaos in Banach spaces

This paper is concerned with chaos in discrete dynamical systems governed by continuously Frech@t differentiable maps in Banach spaces. A criterion of chaos induced by a regular nondegenerate homoclinic orbit is established. Chaos of discrete dynamical systems in the n-dimensional real space is also discussed, with two criteria derived for chaos induced by nondegenerate snap-back repellers, one of which is a modified version of Marotto's theorem. In particular, a necessary and sufficient condition is obtained for an expanding fixed point of a differentiate map in a general Banach space and in an n-dimensional real space, respectively. It completely solves a long-standing puzzle about the relationship between the expansion of a continuously differentiable map near a fixed point in an n-dimensional real space and the eigenvalues of the Jacobi matrix of the map at the fixed point.     

A very fast algorithm for detecting community structures in complex networks

In this paper, a new algorithm is proposed, which uses only local information to analyze community structures in complex networks. The algorithm is based on a table that describes a network and a virtual cache similar to the cache in the computer structure. When being tested on some typical computer-generated and real-world networks, this algorithm demonstrates excellent detection results and very fast processing performance, much faster than the existing comparable algorithms of the same kind.     

Naming Game with Multiple Hearers

A new model called Naming Game with Multiple Hearers (NGMH) is proposed in this paper. A naming game over a population of individuals aims to reach consensus on the name of an object through pair-wise local interactions among all the individuals. The proposed NGMH model describes the learning process of a new word, in a population with one speaker and multiple hearers, at each interaction towards convergence. The characteristics of NGMH are examined on three types of network topologies, namely ER random-graph network, WS small-world network, and BA scale-free network. Comparative analysis on the convergence time is performed, revealing that the topology with a larger average (node) degree can reach consensus faster than the others over the same population. It is found that, for a homogeneous network, the average degree is the limiting value of the number of hearers, which reduces the individual ability of learning new words, consequently decreasing the convergence time; for a scale-free network, this limiting value is the deviation of the average degree. It is also found that a network with a larger clustering coefficient takes longer time to converge; especially a small-word network with smallest rewiring possibility takes longest time to reach convergence. As more new nodes are being added to scale-free networks with different degree distributions, their convergence time appears to be robust against the network-size variation. Most new findings reported in this paper are different from that of the single-speaker/single-hearer naming games documented in the literature.     

Multifolded torus chaotic attractors: design and implementation

This paper proposes a systematic methodology for creating multifolded torus chaotic attractors from a simple three-dimensional piecewise-linear system. Theoretical analysis shows that the multifolded torus chaotic attractors can be generated via alternative switchings between two basic linear systems. The theoretical design principle and the underlying dynamic mechanism are then further investigated by analyzing the emerging bifurcation and the stable and unstable subspaces of the two basic linear systems. A novel block circuit diagram is also designed for hardware implementation of 3-, 5-, 7-, 9-folded torus chaotic attractors via switching the corresponding switches. This is the first time a 9-folded torus chaotic attractor generated by an analog circuit has been verified experimentally. Furthermore, some recursive formulas of system parameters are rigorously derived, which is useful for improving hardware implementation.     

Li-Yorke chaos in 2D discrete systems

This paper is concerned with chaos of 2D discrete systems of the form $$x_{m+1,n}=f(x_{m,n},x_{m,n+1}),$$ where f:I ²→I is a function on a bounded subset I of R and m,n∈N ₀={0,1,2,…}. A new and illustrative example, different from the coupled map lattice, is shown for such a system to be chaotic in the sense of Li-Yorke.