Mutually connected phase-locked loop networks: dynamical models and design parameters

Distribution of timing signals is an essential factor for the development of digital systems for telecommunication networks, integrated circuits and manufacturing automation. Originally, this distribution was implemented by using the master-slave architecture with a precise master clock generator sending signals to phase-locked loops (PLL) working as slave oscillators. Nowadays, wireless networks with dynamical connectivity and the increase in size and operation frequency of the integrated circuits suggest that the distribution of clock signals could be more efficient if mutually connected architectures were used. Here, mutually connected PLL networks are studied and conditions for synchronous states existence are analytically derived, depending on individual node parameters and network connectivity, considering that the nodes are nonlinear oscillators with nonlinear coupling conditions. An expression for the network synchronisation frequency is obtained. The lock-in range and the transmission error bounds are analysed providing hints to the design of this kind of clock distribution system.

Chaotic Synchronization in Discrete-Time Systems Connected by Bandlimited Channels

Due to the broadband characteristic of chaotic signals, many of the methods that have been proposed for synchronizing chaotic systems do not usually present a satisfactory performance when applied to bandlimited communication channels. Here, the effects of bandwidth limitations imposed by the channel on the synchronous solution of a discrete-time chaotic master-slave network are investigated. The discrete-time system considered in this study is the Henon map. It is analytically shown that synchronism can be achieved in such a network by introducing a digital filter in the feedback loop responsible for generating the chaotic signal that will be sent to the slave node. Numerical simulations relating the filter parameters, such as its order and cut-off frequency, to the maximum Lyapunov exponent of the master node, which determines if the transmitted signal is chaotic or not, are also presented. These results can be useful for practical communication schemes based on chaos.

Multiple synchronous states in static delay-free mutually connected PLL networks

In many engineering applications, the time coordination of geographically separated events is of fundamental importance, as in digital telecommunications and integrated digital circuits. Mutually connected (MC) networks are very good candidates for some new types of application, such as wireless sensor networks. This paper presents a study on the behavior of MC networks of digital phase-locked loops (DPLLs). Analytical results are derived showing that, even for static networks without delays, different synchronous states may exist for the network. An upper bound for the number of such states is also presented. Numerical simulations are used to show the following results: (i) the synchronization precision in MC DPLLs networks; (ii) the existence of synchronous states for the network does not guarantee its achievement and (iii) different synchronous states may be achieved for different initial conditions. These results are important in the neural computation context. as in this case, each synchronous state may be associated to a different analog memory information. (C) 2010 Elsevier B.V. All rights reserved.

Distinct conformational properties determined by implicit and explicit representation of protein-solvent interactions. An analytical and computer simulation study

In the protein folding problem, solvent-mediated forces are commonly represented by intra-chain pairwise contact energy. Although this approximation has proven to be useful in several circumstances, it is limited in some other aspects of the problem. Here we show that it is possible to achieve two models to represent the chain-solvent system. one of them with implicit and other with explicit solvent, such that both reproduce the same thermodynamic results. Firstly, lattice models treated by analytical methods, were used to show that the implicit and explicitly representation of solvent effects can be energetically equivalent only if local solvent properties are time and spatially invariant. Following, applying the same reasoning Used for the lattice models, two inter-consistent Monte Carlo off-lattice models for implicit and explicit solvent are constructed, being that now in the latter the solvent properties are allowed to fluctuate. Then, it is shown that the chain configurational evolution as well as the globule equilibrium conformation are significantly distinct for implicit and explicit solvent systems. Actually, strongly contrasting with the implicit solvent version, the explicit solvent model predicts: (i) a malleable globule, in agreement with the estimated large protein-volume fluctuations; (ii) thermal conformational stability, resembling the conformational hear resistance of globular proteins, in which radii of gyration are practically insensitive to thermal effects over a relatively wide range of temperatures; and (iii) smaller radii of gyration at higher temperatures, indicating that the chain conformational entropy in the unfolded state is significantly smaller than that estimated from random coil configurations. Finally, we comment on the meaning of these results with respect to the understanding of the folding process. (C) 2009 Elsevier B.V. All rights reserved.

EOPAS, the EthnoER online representation of interlinear text

One of the goals of the ARC funded Eresearch project called Sharing access and analytical tools for ethnographic digital media using high speed networks, or simply EthnoER is to take outputs of normal linguistic analytical processes and present them online in a system we have called the EthnoER online presentation and annotation system, or EOPAS.

Level-one highest weight representation of U-q[sl((N)over-cap vertical bar 1)] and Bosonization of the multicomponent Super t-J model

We study the level-one irreducible highest weight representations of the quantum affine superalgebra U-q[sl((N) over cap\1)], and calculate their characters and supercharacters. We obtain bosonized q-vertex operators acting on the irreducible U-q[sl((N) over cap\1)] modules and derive the exchange relations satisfied by the vertex operators. We give the bosonization of the multicomponent super t-J model by using the bosonized vertex operators. (C) 2000 American Institute of Physics. [S0022- 2488(00)00508-9].

Credit assignment: The memory representation of dynamic task events

The experiment examined the influence of memory for prior instances on aircraft conflict detection. Participants saw pairs of similar aircraft repeatedly conflict with each other. Performance improvements suggest that participants credited the conflict status of familiar aircraft pairs to repeated static features such as speed, and dynamic features such as aircraft relative position. Participants missed conflicts when a conflict pair resembled a pair that had repeatedly passed safely. Participants either did not attend to, or interpret, the bearing of aircraft correctly as a result of false memory-based expectations. Implications for instance models and situational awareness in dynamic systems are discussed.

The formal representation of process system modelling assumptions and their implications

In order to analyse the effect of modelling assumptions in a formal, rigorous way, a syntax of modelling assumptions has been defined. The syntax of modelling assumptions enables us to represent modelling assumptions as transformations acting on the set of model equations. The notion of syntactical correctness and semantical consistency of sets of modelling assumptions is defined and methods for checking them are described. It is shown on a simple example how different modelling assumptions act on the model equations and their effect on the differential index of the resulted model is also indicated.

A Graphical Representation Model for Telemedicine and Telehealth Center Sustainability

This study shows the creation of a graphical representation after the application of a questionnaire to evaluate the indicative factors of a sustainable telemedicine and telehealth center in Sao Paulo, Brazil. We categorized the factors into seven domain areas: institutional, functional, economic-financial, renewal, academic-scientific, partnerships, and social welfare, which were plotted into a graphical representation. The developed graph was shown to be useful when used in the same institution over a long period and complemented with secondary information from publications, archives, and administrative documents to support the numerical indicators. Its use may contribute toward monitoring the factors that define telemedicine and telehealth center sustainability. When systematically applied, it may also be useful for identifying the specific characteristics of the telemedicine and telehealth center, to support its organizational development.