Abstract: Synchronization of chaotic oscillators in a generalized sense leads to richer behavior than identical chaotic oscillations in coupled systems. It may imply a more complicated connection between the synchronized trajectories in the state spaces of coupled systems. We suggest a method here that can be used to detect and study generalized synchronization in drive-response systems. This technique, the auxiliary system method, utilizes a second, identical response system to monitor the synchronized motions. The method can be implemented both numerically and experimentally and in some cases it leads to analytical results for generalized synchronization.

Abstract: An apparatus is disclosed for performing dynamic synchronization between data stored in a handheld computer and a host computer, each having a plurality of data sets including at least one common data set, each computer having a copy of the common data set. The handheld computer has a processor, a communication port, and a data synchronization engine. The data synchronization engine has a pseudo-cache and one or more tags connected to the pseudo cache. Data is synchronized whenever data is written to main memory and/or when the associated pseudo-cache tag is invalidated. By strict adherence to a set of protocols, data coherency is achieved because the system always knows who owns the data, who has a copy of the data, and who has modified the data. The data synchronization engine resolves any differences in the copies and allows the storage of identical copies of the common data set in the host computer and in the handheld computer.

Abstract: A method and apparatus are disclosed for synchronizing transactions in a disconnectable network. Each transaction includes operations that were performed on a database replica on one computer while that computer was disconnected from another computer and hence from that other computer's replica. Transaction synchronization, which occurs after the computers are reconnected, transfers information from each computer to the other computer and applies updates to both replicas as appropriate. Transaction logs and clash handling tools may be used with the invention.

Abstract: It is shown that synchronization in unidirectionally coupled chaotic systems develops in two stages as the coupling strength is increased. The first stage is characterized by a weak synchronization, i.e., a response system subjected to a driving system undergoes a transition and exhibits a behavior completely insensitive to initial conditions. Further increase of the coupling strength causes the dimension decrease of the overall dynamics and leads finally to a strong synchronization. In this stage, the dimension of the strange attractor in the full phase space of the two systems saturates to the dimension of the driving attractor.

Abstract: A system and method for incremental change synchronization among multiple copies of data is disclosed. To achieve the synchronization a genera synchronization model is used. The synchronization model establishes a one-way data flow path to allow incremental changes to be transferred from a copy of data that incorporates the incremental changes to a copy of data that does not yet incorporate the incremental changes. To achieve this one-way data flow path, the synchronization model uses an agent, a data collector, and a data synchronizer. The data collector collects incremental changes transferred to it and applies the incremental changes to a copy of data. A data synchronizer transfers incremental changes to a data collector. An agent controls the synchronization process by making a connection between a data collector and a data synchronizer and then directing the data synchronizer to transfer data to the data collector. If bidirectional data flow is necessary to achieve synchronization between two copies of data, a one-way data flow path is established first in one direction and after all incremental changes have been passed in that direction, a data flow path is established in the opposite direction to pass incremental changes in the opposite direction.

Abstract: We show that the synchronization of chaotic systems can be achieved by using the observer design techniques which are widely used in the control of dynamical systems. We show that local synchronization is possible under relatively mild conditions and global synchronization is possible if the chaotic system can be

Abstract: An experimental observation of phase synchronization is presented for two unidirectionally coupled chaotic R\"ossler systems. We show that in this case phase synchronization is connected with generalized synchronization which occurs when the coupling strength exceeds a critical value. \textcopyright{} 1996 The American Physical Society.

Abstract: Synchronization of oscillations underlies organized dynamical behavior of many physical, biological and other systems. Recent studies of the dynamics of coupled systems with complex behavior indicate that synchronization can occur not only in case of periodic oscillations, but also in regimes of chaotic oscillations. Using experimental observations of chaotic oscillations in coupled nonlinear circuits we discuss a few forms of cooperative behavior that are related to the regimes of synchronized chaos. This paper is prepared under the request of the editors of the special focus issue of Chaos and contains the materials for the lecture at the International School in Nonlinear Science, ‘‘Nonlinear Waves: Synchronization and Patterns,’’ Nizhniy Novgorod, Russia, 1995. The main goal of the paper is to outline the collection of examples that illustrate the state of the art of chaos synchronization.

Abstract: A method of synchronizing at least a first and a second database each containing dated records such as events, wherein the records of the first and second databases are synchronized across a narrow date range narrower than the date range of the records of at least one of the databases. A prior synchronization can be performed across a prior date range. The date range of the prior synchronization is stored, along with the history file containing information representative of the content of the databases following the prior synchronization. When a current synchronization is performed, it is performed across a date range that combines the prior date range with the current date range.

Abstract: The present invention, generally speaking, provides a powerful yet easy to use electronic publishing tool for information providers and online service operators. The electronic publishing tool allows information providers to manage the content they provide to online services. It also reduces the effort required by operations staff of online services to support a growing number of information providers. Finally, the electronic publishing tool allows content to be captured from information providers (and, by extension, subscribers) so that it can be published onto a variety of platforms with minimal additional effort. For example information, in addition to or in lieu of being published on an online service, may be published on CD through a facility such as AppleLink CD (AppleLink CD allows a portion of the "static" content of an online service such as AppleLink to be published and distributed in CD form, with the result that the content is infinitely reusable without incurring connect charges.) Furthermore, information previously published on one online service may be published on one or more other online services, or information may be published on several online services at the same time. A number of potentially "thorny" problems of distributed database systems are solved in an elegant and efficient manner. The first issue involves synchronizing different copies of an item on machines that are not continuously linked at which each copy may be changed independently. Rather than attempting to formulate a set of synchronization policies generally applicable to all items in all instances, synchronization policies are moved from the database engine to the items themselves. The second issue involves lifetime--knowing, given a complex set of interrelationship of items, when an item may be safely deleted. This problem is addressed by providing an interested party mechanism whereby items may "express interest" in each other. When no item is interested in a particular item, that item may safely "go away."

Abstract: A method and an apparatus for synchronization of a first set of mail with a second set of mail at the message/folder level. A memory stores a mail synchronizer for application independent e-mail synchronization. A pseudo unique identification is generated for each message or folder in the mail boxes to be synchronized. An event log is then generated for each mail box. The memory also has a synchronization mechanism for making the first set of data and the second set of data equivalent by using the information in a Change List. A processor runs the mail synchronizer.

Abstract: A method for data flow rate detection useful with data flow rate control is introduced into a TCP packet communication environment which does not have data rate supervision by computing presumed speed based on latency between packets during the initial interchange of synchronization (SYN) packet and the acknowledgement (ACK) packet, presuming to know the initial length of each. This information may be utilized to determine potential rate of data flow for further use in making bandwidth allocation and rate enforcement decisions.

Abstract: A method and an apparatus for scaling E-mail (electronic mail) address book databases for devices with limited storage capacity and synchronization of a first set of mail with a second set of mail at the message/folder level. A memory contains a mail subsetter for automatically generating a default personal address book and a mail synchronizer for application independent E-mail synchronization. A pseudo unique identification is generated for each message or folder in the mail boxes to be synchronized. An event log is then generated for each mail box. The memory also has a Synchronization mechanism for making the first set of data and the second set of data equivalent by using the information in the Change List generated by the Change Detection Mechanism. A processor runs the mail synchronizer.

Abstract: Publisher Summary A general approach for constructing chaotic synchronized dynamical systems is discussed that is based on a decomposition of given systems into active and passive parts. As a possible application the chapter considers an improved encoding method where the information signal is injected into the dynamical system of the transmitter. Furthermore, it highlights how to design in a systematic way high-dimensional synchronized systems that may be used for efficient hyperchaotic encoding of information. Synchronization of periodic signals is a well-known phenomenon in physics, engineering, and many other scientific disciplines.

Abstract: In this letter, we study the use of adaptive controllers to maintain the synchronization of two Chua's oscillators when the channel and circuit parameters are time-varying. We present both computer simulation results and physical experimental results to verify the operation of the designs.

Abstract: A predictor circuit permits advanced execution of instructions depending for their data on previous instructions by predicting such dependencies based on previous mis-speculations detected at the final stages of processing. Synchronization of dependent instructions is provided by a table creating entries for each instance of potential dependency. Table entries are created and deleted dynamically to limit total memory requirements.

Abstract: The Mariposa distributed data manager uses an economic model for managing the allocation of both storage objects and queries to servers. We present extensions to the economic model which support replica management, as well as our mechanisms for propagating updates among replicas. We show how our replica control mechanism can be used to provide consistent, although potentially stale, views of data across many machines without expensive per-transaction synchronization. We present a rule-based conflict resolution mechanism, which can be used to enhance traditional time-stamp serialization. We discuss the effects of our replica system on query processing for both read-only and read-write queries. We further demonstrate how the replication model and mechanisms naturally support name service in Mariposa.

Abstract: By reading, you can know the knowledge and things more, not only about what you get from people to people. Book will be more trusted. As this coordinating distributed objects actor based approach to synchronization, it will really give you the good idea to be successful. It is not only for you to be success in certain life you can be successful in everything. The success can be started by knowing the basic knowledge and do actions.

Abstract: The synchronization problem for audio/visual reproduction has consumed engineers time since the advent of recorded audio and images and the first multimedia productions. As computers have evolved to support programmed reproduction of multimedia information, the complexity but not the character or interest have changed. In the digital domain, synchronization problems exist due to data distribution and communications, random events caused by human-computer interaction, and general computer and communications performance limitations. This rich research domain has led to numerous approaches to the modeling and execution of multimedia synchronization scenarios. Unfortunately, these approaches are difficult to compare and evaluate due to their varied theoretical bases and modeling techniques. We develop a uniform, theoretical foundation for discussing multimedia synchronization and temporal specification. We propose a temporal reference framework and use it to compare existing temporal specification schemes and their relationships to multimedia synchronization. The ensuing comparison of existing specification and synchronization techniques demonstrates the utility of the framework.

Abstract: Data structures which are shared among concurrent processes require some sort of synchronization in order to avoid becoming corrupted by conflicting updates and to ensure that the processes see correct results. This can be accomplished through mutual exclusion; guaranteeing a process exclusive access while performing critical operations on the data structure. While well understood, this approach can have detrimental effects on performance in an asynchronous environment where processes can suffer unpredictable delays. An alternative approach is to avoid the use of mutual exclusion through the use of simple synchronization primitives such as Compare-and-Swap. Such lock-free data structures can be immune from performance degradation due to slow processes. Universal methods for constructing lock-free data structures for any abstract data type are known, but the resulting implementations are much less efficient than using conventional techniques for mutual exclusion such as spin locks. In this thesis, we present lock-free data structures, algorithms, and memory management techniques for several common abstract data types. Our techniques result in implementations that are as efficient, if not more so, than conventional approaches, and thus provide a practical alternative to using spin locks. We demonstrate the efficiency of our techniques experimentally, and we also show how standard axiomatic formal proof methods can be adapted for the verification of our algorithms.

Abstract: This article describes an approach to discrete event simulation modeling that appears to be effective for developing portable and efficient parallel execution of models of large distributed systems and communication networks. In this approach, the modeler develops submodels with an existing sequential simulation modeling tool, using the full expressive power of the tool. A set of modeling language extensions permits automatically sychronized communication between submodels; however, the automation requires that any such communication must take a nonzero amount of simulation time. Within this modeling paradigm, a variety of conservative synchronization protocols can transparently support conservative execution of submodels on potentially different processors. A specific implementation of this approach, U.P.S. (Utilitarian Parallel Simulator), is described, along with performance results on the Intel Paragon and on the IBM SP2.

Abstract: A system, method and program product for determining and displaying the status of client application programs executing on a multiprocessing server. Server process control blocks and synchronization object descriptors are created in the shared memory of the server. Application program interfaces APIs are linked to the control blocks and descriptors during the execution of the various multiprocessing application programs. A status utility related to the service process monitor selectively accesses information from the control blocks and descriptors to determine the status of the individual multiple processes executing on the server workstation. In a preferred form, the status information is conveyed to and displayed on a video display associated with the service process monitor. In contrast to operating system monitors which disclose the status of all processes as a whole, the present server process monitor particularizes the information to the specific client process. Thereby, the information is of a granularity to identify processes which are hung up on semaphores, message queues, or the like. The information is at the level used by a system administrator or software developer.

Abstract: Parallel systems supporting multithreading, or message passing in general, have typically used either polling or interrupts to handle incoming messages. Neither approach is ideal; either may lead to excessive overheads or message-handling latencies, depending on the application. This paper investigates a combined approach---Polling Watchdog, where both are used depending on the circumstances. The Polling Watchdog is a simple hardware extension that limits the generation of interrupts to the cases where explicit polling fails to handle the message quickly. As an added benefit, this mechanism also has the potential to simplify the interaction between interrupts and the network accesses performed by the program.We present the resulting performance for the EARTH-MANNA-S system, an implementation of the EARTH (Efficient Architecture for Running THreads) execution model on the MANNA multiprocessor. In contrast to the original EARTH-MANNA system, this system does not use a dedicated communication processor. Rather, synchronization and communication tasks are performed on the same processor as the regular computations. Therefore, an efficient message-handling mechanism is essential to good performance. Simulation results and performance measurements show that the Polling Watchdog indeed performs better than either polling or interrupts alone. In fact, this mechanism allows the EARTH-MANNA-S system to achieve the same level of performance as the original EARTH-MANNA multithreaded system.

Abstract: In this letter we show that the monotone synchronization is possible for chaotic systems and can be easily obtained using the method of continuous chaos control We also discuss possible applications of this type of synchronization for secure communications

Abstract: Synchronous firing of biological oscillators is explained by a mathematical model developed by Mirollo and Strogatz [SIAM J. Appl. Math., 50 (1990), pp. 1645–1662]. Exactly the same principles may be carried over to achieve decentral synchronization in time-division multiple access systems. However, some extensions of the basic model are necessary in view of technical implementations. This paper deals with synchronization in finite time for two oscillators and convergence to synchrony except on a set of initial conditions of measure zero for cliques of oscillators, particularly for nondifferentiable (e.g., piecewise linear) state functions. Moreover, for oscillator pairs we prove synchronization even if there is a certain delay between transmission and reception of pulses. A simulation tool, named ImDeSy, is developed to investigate general networks of oscillators with arbitrary topologies and more refined reaction strategies. This is demonstrated in two extensive examples.

Abstract: Mentat is an object-oriented parallel processing system designed to simplify the task of writing portable parallel programs for parallel machines and workstation networks. The Mentat compiler and run-time system work together to automatically manage the communication and synchronization between objects. The run-time system marshals member function arguments, schedules objects on processors, and dynamically constructs and executes large-grain data dependence graphs. In this article we present the Mentat run-time system. We focus on three aspects—the software architecture, including the interface to the compiler and the structure and interaction of the principle components of the run-time system; the run-time overhead on a component-by-component basis for two platforms, a Sun SparcStation 2 and an Intel Paragon; and an analysis of the minimum granularity required for application programs to overcome the run-time overhead.

Abstract: A method for synchronizing base stations (104, 106, 108, 110) or radio ports in a communication system (100) such as a cordless or cellular telephone system uses a mobile station (114) or handset for synchronizing unsynchronized base stations. The mobile station (114) is first synchronized to a reference base station. The mobile station (114) then initiates communication with the unsynchronized base station and calculates a synchronization adjustment. The mobile station (114) transmits the synchronization adjustment to the unsynchronized base station which uses the synchronization adjustment to adjust its time base.