Abstract: Recently, it has been demonstrated that many large-scale complex dynamical networks display a collective synchronization motion. Here, we introduce a time-varying complex dynamical network model and further investigate its synchronization phenomenon. Based on this new complex network model, two network chaos synchronization theorems are proved. We show that the chaos synchronization of a time-varying complex network is determined by means of the inner coupled link matrix, the eigenvalues and the corresponding eigenvectors of the coupled configuration matrix, rather than the conventional eigenvalues of the coupled configuration matrix for a uniform network. Especially, we do not assume that the coupled configuration matrix is symmetric and its off-diagonal elements are nonnegative, which in a way generalizes the related results existing in the literature.

Abstract: In this work, we study the synchronization of coupled phase oscillators on the underlying topology of scale-free networks. In particular, we assume that each network's component is an oscillator and that each interacts with the others following the Kuramoto model. We then study the onset of global phase synchronization and fully characterize the system's dynamics. We also found that the resynchronization time of a perturbed node decays as a power law of its connectivity, providing a simple analytical explanation to this interesting behavior.

Abstract: We propose a technique to control coherent collective oscillations in ensembles of globally coupled units (self-sustained oscillators or maps). We demonstrate numerically and theoretically that a time delayed feedback in the mean field can, depending on the parameters, enhance or suppress the self-synchronization in the population. We discuss possible applications of the technique.

Abstract: Dynamical Order in Large Complex Systems Ensembles of Identical Phase Oscillators Heterogeneous Ensembles and Effects of Noise Oscillator Networks Arrays of Limit-Cycle Oscillators Chaos and Synchronization Synchronization in Populations of Chaotic Elements Clustering Dynamical Glasses Chemical Systems Biological Cells Neural Networks

Abstract: A system, method and program are disclosed for achieving rapid bit synchronization in low power medical device systems. Messages are transmitted via telemetry between a medical device and a communication device. The synchronization scheme uses a portion of a unique preamble bit pattern to identify the communication device allowing for economical communications with a minimum expenditure of energy. A special set of preamble bit patterns are utilized for their unique synchronization properties making them particularly suited for rapid bit synchronization. These unique preamble bit patterns further provide simplification to the preamble error detection logic.

Abstract: This paper deals with the chaotic oscillator synchronization. An approach to the synchronization of chaotic oscillators has been proposed. This approach is based on the analysis of different time scales in the time series generated by the coupled chaotic oscillators. It has been shown that complete synchronization, phase synchronization, lag synchronization, and generalized synchronization are the particular cases of the synchronized behavior called “time-scale synchronization.” The quantitative measure of chaotic oscillator synchronous behavior has been proposed. This approach has been applied for the coupled Rossler systems and two coupled Chua’s circuits.

Abstract: Methods, systems, and computer program products for synchronizing data stored at one or more message clients with data stored at a message server where the message clients may receive update notifications and may represent the data using different data structures than the message server uses to represent the same data. A token is associated with each data change that occurs at the message server. The message server sends each change and associated token to the message clients. When the message clients request a synchronization, the tokens they received are returned to the message server for comparison with the tokens the message server sent to the message clients. If the message clients do not return a particular token, the message server determines that the clients did not receive the corresponding change and resends the change to the message clients. Tokens may also be used to divide a change into one or more portions, with only one portion being provided initially. Then, in response to receiving the token associated with the portion, the message server may provide the remaining portion of the message to the message clients.

Abstract: Petri nets are a discrete event simulation approach developed for system representation, in particular for their concurrency and synchronization properties. Various extensions to the original theory of Petri nets have been used for modeling molecular biology systems and metabolic networks. These extensions are stochastic, colored, hybrid and functional. This paper carries out an initial review of the various modeling approaches based on Petri net found in the literature, and of the biological systems that have been successfully modeled with these approaches. Moreover, the modeling goals and possibilities of qualitative analysis and system simulation of each approach are discussed.

Abstract: A first synchronization request (1051) is communicated from the client-computing device (110) to the metadata server (123). In the present example, the client's update cache will not contain any updates, given that this is the first execution of the method. Thus, the first synchronization request 1051 does not contain an identifier for a cached update. In response to receiving a synchronization request, as shown in block (1052), the metadata server (123) determines if the synchronization request contains at least one update identifier. If it is determined that the synchronization request does not include an update identifier, the metadata server (123) responds by selecting first level updates for communication to the client computing device (110). As described above, first level updates may include any updates that do not have a prerequisite identifying other updates.

Abstract: Large cascades triggered by initial shocks are common in complex networks. Coupled map lattices have been widely used over the past decades as dynamical models of complex systems. Here we investigate cascading failures in coupled map lattices with different topologies. We find that cascading failures are much easier to occur in small-world and scale-free coupled map lattices than in globally coupled map lattices.

Abstract: Various embodiments of the present invention are directed to synchronization utilizing one or more optimizations through the utilization of metadata. For several embodiments of the present invention, one method for optimizing synchronization is to reduce the overhead required for said synchronization by having each peer only tracking changes for itself and other peers within its change community (or communities) (a.k.a., “Intra-Community-Only Change Tracking Optimization”). For certain embodiments of the present invention, another method for optimizing synchronization is to not create synchronization overhead until required. For numerous embodiments of the present invention, yet another method for optimizing synchronization is to minimize redundant use of a partner's unique global ID—a large and cumbersome number—and to instead maintain a table that cross-references each partner (and its unique global ID) with a smaller and much less cumbersome partner key.

Abstract: A system provides an information sharing architecture that allows physically separate healthcare information systems, called “deployments,” to share and exchange information. The collection of these participating deployments is referred to as the “Community,” and systems within the Community sometimes store records for patients in common. The system allows participants in the Community to share information on data changes to these patients, and to reconcile concurrent and conflicting updates to the patient's record.

Abstract: In this paper, adaptive synchronization of two uncertain chaotic systems is presented using adaptive backstepping approach. The master system is any smooth nonlinear chaotic system, while the slave system is a nonlinear chaotic system in the feedback form. Global stability and exponential synchronization between the master and slave systems can be achieved. The proposed approach offers a systematic design procedure for adaptive synchronization of a large class of continuous-time chaotic systems in the chaos research literature. Computer simulations are provided to verify the operation of the designed synchronization scheme.

Abstract: An intelligent synchronization tool ensures access to desired content in a manner that automatically keeps the content current on the portable media device. A variation threshold or user-specified degree of content variation may be introduced among content downloaded to a user's mobile device to prevent the user from becoming bored. Furthermore, intelligent synchronization may automatically populate the portable media device with popular content to save a user time and/or use passive monitoring techniques to ascertain a user's preferences for subsequent population.

Abstract: A system and method for unorchestrated determination of data sequences using “sticky byte” factoring to determine breakpoints in digital sequences such that common sequences can be identified. Sticky byte factoring provides an efficient method of dividing a data set into pieces that generally yields near optimal commonality. This is effectuated by employing a rolling hashsum and, in an exemplary embodiment disclosed herein, a threshold function to deterministically set divisions in a sequence of data. Both the rolling hash and the threshold function are designed to require minimal computation. This low overhead makes it possible to rapidly partition a data sequence for presentation to a factoring engine or other applications that prefer subsequent synchronization across the data set.

Abstract: Approaches described herein may be used for provisioning of databases that requires a bulk transfer of data within a distributed computing environment, such as a grid. The approaches do not require the manual intervention of a DBA to, for example, transfer a tablespace between the file systems of operating systems. Instead, the tablespaces may be provisioned automatically and dynamically by a grid computing system whenever it determines the need to dynamically provision a database. In addition, as copies of tablespaces are provisioned, synchronization mechanisms can also be automatically provisioned to keep the tablespaces and their copies in sync.

Abstract: This paper presents an adaptive control scheme for the synchronization of Chen chaotic system when the parameters of the drive system are fully unknown and different with those of the response system The sufficient condition for the synchronization has been analyzed theoretically Numerical simulations are shown to verify the result

Abstract: A system and method for behavior modification through dynamic identification of behavior patterns, assistance in finding and implementing healthy alternatives to undesirable behavior patterns, preparation of dynamically variable user-specific programs, monitoring of current user activities, and presenting feedback and information to the user. The system and method further support incorporation of professional and other information into a user-specific package from which the user-specific program is determined, and synchronization and data integrity across the platforms of the system.

Abstract: Physical layer structures and related access schemes for unsynchronized communication networks are provided. Access channel information, preferably including a common synchronization code associated with all transceiver stations in a communication network and a cell-specific synchronization code uniquely associated with one of the transceiver stations, is modulated onto at least one set of time-continuous signal components of a communication signal. In order to access the communication network, communication terminals search for the access channel information in one or more sets of time-continuous signal components and synchronization parameters are then determined based on a location of the access channel information in the sets of time-continuous signal components. Some embodiments of the invention provide for joint frame synchronization and coarse timing synchronization. In further embodiments, the communication signal also includes a scattered pilot channel onto which a portion of the access channel information, preferably the cell-specific synchronization code, is modulated. The pilot channels may then be re-used for initial access operations in addition to its conventional uses for such operations as channel estimation.

Abstract: In recent years, backstepping method has been developed in the field of nonlinear control, such as controller, observer and output regulation. In this paper, an effective backstepping design is applied to chaos synchronization. There are some advantages in this method for synchronizing chaotic systems, such as (a) the synchronization error is exponential convergent; (b) only one variable information of the master system is needed; (c) it presents a systematic procedure for selecting a proper controller. Numerical simulations for the Chua's circuit and the Rossler system demonstrate that this method is very effective.

Abstract: De-synchronization appears as a new paradigm to automate the design of asynchronous circuits from synchronous netlists. This paper studies different protocols for de-synchronization and formally proves their correctness. Taxonomy of existing protocols for latch controllers is provided. In particular, four-phase handshake protocols devised for micro-pipelines are studied. A new controller with maximum concurrency for de-synchronization is also proposed. The applicability of de-synchronization on an implementation of the DLX microprocessor is also described and discussed.

Abstract: A communications method including the steps of: activating a plurality of signal sources, and transmitting a synchronization event to the plurality of signal sources to cause the plurality of signal sources to simultaneously transmit data in response to the synchronization event.

Abstract: In this article we review the application of the synchronization theory to the analysis of multivariate biological signals. We address the problem of phase estimation from data and detection and quantification of weak interaction, as well as quantification of the direction of coupling. We discuss the potentials as well as limitations and misinterpretations of the approach.

Abstract: This paper addresses a practical issue in chaos synchronization where there is a time-delay in the receiver as compared with the transmitter. A new synchronization scheme and a general criterion for global chaos synchronization are proposed and developed from the approach of unidirectional linear error feedback coupling with time-delay. The chaotic Chua’s circuit is used for illustration, where the coupling parameters are determined according to the criterion under which the global chaos synchronization of the time-delay coupled systems is achieved.

Abstract: We present numerical and experimental investigations of the synchronization of the coupling-induced instabilities in two distant mutually coupled semiconductor lasers. In our experiments, two similar Fabry–Perot lasers are coupled via their coherent optical fields. Our theoretical framework is based on a rate equation model obtained under weak coupling conditions. In both experiments and simulations, we find (achronal) synchronization of subnanosecond intensity fluctuations in concurrence with asymmetric physical roles between the lasers, even under symmetric operating conditions. We explore the synchronization of these instabilities with respect to the coupling strength and the injection current. We demonstrate the existence of a critical coupling strength, below which synchronization is lost; however, dynamical instabilities persist. Our model correctly reproduces the observed dynamical features over the entire investigated parameter space. We provide an intuitive explanation of the appearance of the achronal solution by analysing the dynamics of the injection phases of the optical fields.

Abstract: Methods for mechanically synthesizing concurrent programs from temporal logic specifications obviate the need to manually construct a program and compose a proof of its correctness A serious drawback of extant synthesis methods, however, is that they produce concurrent programs for models of computation that are often unrealistic In particular, these methods assume completely fault-free operation, that is, the programs they produce are fault-intolerant In this paper, we show how to mechanically synthesize fault-tolerant concurrent programs for various fault classes We illustrate our method by synthesizing fault-tolerant solutions to the mutual exclusion and barrier synchronization problems