Abstract: Recent advances in micro-electromechanical (MEMS) technology have led to the development of small, low-cost, and low-power sensors Wireless sensor networks (WSNs) are large-scale networks of such sensors, dedicated to observing and monitoring various aspects of the physical world In such networks, data from each sensor is agglomerated using data fusion to form a single meaningful result, which makes time synchronization between sensors highly desirable This paper surveys and evaluates existing clock synchronization protocols based on a palette of factors like precision, accuracy, cost, and complexity The design considerations presented here can help developers either in choosing an existing synchronization protocol or in defining a new protocol that is best suited to the specific needs of a sensor-network application Finally, the survey provides a valuable framework by which designers can compare new and existing synchronization protocols

Abstract: We describe a simple yet general method to analyze networks of coupled identical nonlinear oscillators and study applications to fast synchronization, locomotion, and schooling. Specifically, we use nonlinear contraction theory to derive exact and global (rather than linearized) results on synchronization, antisynchronization, and oscillator death. The method can be applied to coupled networks of various structures and arbitrary size. For oscillators with positive definite diffusion coupling, it can be shown that synchronization always occurs globally for strong enough coupling strengths, and an explicit upper bound on the corresponding threshold can be computed through eigenvalue analysis. The discussion also extends to the case when network structure varies abruptly and asynchronously, as in "flocks" of oscillators or dynamic elements.

Abstract: A system and method for providing a peer-to-peer photo-sharing environment. The system includes: manual and automatic photo annotation at the client; periodic client-server synchronization; an index of client photos on a central server or a photo database that is resident on the central server, which is updated by the client-server synchronization function; end-user search functionality to search the centralized index or photo database; and transmission of the relevant photos to the client via an on-line image cache. In one embodiment, one client's new photos are automatically displayed on another client's computer (e.g., via screen saver or another mechanism).

Abstract: Chaos synchronization of the fractional Lu system is theoretically and numerically studied by two methods. The suitable conditions for achieving synchronization of this fractional differential system are derived by using the Laplace transform theory. Numerical simulations coincide with the theoretical analysis.

Abstract: This work presents chaos synchronization between two different chaotic systems by using active control. This technique is applied to achieve chaos synchronization for each pair of the dynamical systems Lorenz, Lu and Chen. Numerical simulations are shown to verify the results.

Abstract: In this paper, we analyze attacks on existing time synchronization protocols for wireless sensor networks. We propose a secure time synchronization toolbox to counter these attacks. This toolbox includes protocols for secure pairwise and group synchronization of nodes that lie in each other's power ranges and of nodes that are separated by multiple hops. We provide an in-depth analysis of security and energy overhead of the proposed protocols.

Abstract: In this chapter, we review time synchronization and calibration for wireless sensor networks. We will first consider time synchronization in Sections 1.1–1.6, before turning to calibration in Section 1.7. We will show that time synchronization can be considered as a calibration problem and many observations about time synchronization can be transferred to calibration. In Section 1.1, we discuss applications of synchronized time in sensor networks, present challenges of sensor networks, and discuss why traditional synchronization approaches fail to meet these challenges. Section 1.2 presents models of sensor nodes, of hardware clocks, and of communication. Section 1.3 gives an overview of the various classes of synchronization. In Section 1.4, we present common synchronization techniques. Section 1.5 examines current synchronization algorithms. Section 1.6 presents common techniques for evaluating synchronization algorithms and selected evaluation results.

Abstract: Provided are an initial synchronization acquiring device and method in a parallel processed DS-CDMA UWB system and a DS-CDMA UWB system's receiver using the same. The initial synchronization acquiring device is constructed to include a correlator for correlating input signals and outputting correlation result values and an initial synchronizer for tuning initial symbol synchronization and frame synchronization by using the correlation result values received from the correlator and then storing combining mark values and a synchronization position value in a register, thereby making it possible to greatly decrease a system's complexity, compared to the existing method of separately designing respective modules for acquiring packet synchronization and symbol synchronization in the existing CDMA system. Also, the initial synchronization acquiring device and method additionally compensates a synchronization error caused by a frequency offset generated between clocks used by a transmitter and a receiver and thereby can be efficiently used in the high-speed and parallel-processed DS-CDMA UWB system.

Abstract: In one example, a synchronization server includes logic operable to engage in a first synchronization session with a client device, wherein client modifications and server modifications may be exchanged based, at least in part, on synchronization data stored locally. The synchronization server further includes logic operable to initiate a query of a remote database (e.g., having data associated with the synchronization data) to determine differences between the synchronization data stored locally and associated data stored remotely. The synchronization server is further operable to initiate an exchange of further server modifications based on the differences between the synchronization data stored locally and the associated data stored remotely. In one example, the server may engage in a second synchronization session with the client device to update the client device with differences to the synchronization data stored locally and the remote database.

Abstract: In this paper time-delay effects on the master–slave synchronization scheme are studied by a time-delay feedback control technique. Several new delay-independent and delay-dependent sufficient conditions are presented for master–slave synchronization of Lur’e systems based upon Lyapunov method and linear matrix inequalities (LMI’s) approaches. These new synchronization criteria are easily verifiable and offer some fairly adjustable real parameters, which are of important significance in the design and applications of such chaos synchronization systems, and the proposed results improve and generalize the earlier works.

Abstract: A system for transactionally deploying content across multiple machines in a network environment automates and synchronizes secure (107) and reliable distribution of digital assets to multiple network locations, allowing controlled provisioning and synchronization of code and content updates to live applications. A distributed architecture includes at least one receiver (102)- a secure listener configured to process incoming distribution jobs-and at least one base server- a sender (101) that may also act as a receiver. An administration interface (103) allows administrative and reporting services and deployment management. Using the administrative interface, users are enabled to launch, simulate, schedule and monitor activities for any network location at any time. The system provides fan-out and multi-tiered deployment topologies expandable to hundreds of servers. Each deployment is fully transactional, permitting rollback (108) of the system to it 'last known good' state in the case of failure.

Abstract: This paper is devoted to study the problem of controlling chaos for new chaotic dynamical system (four-scroll dynamical system). Linear feedback control is used to suppress chaos to unstable equilibria and to achieve chaos synchronization of two identical four-scroll systems. Routh–Hurwitz criteria is used to study the conditions of the asymptotic stability of the equilibrium points of the controlled system. The sufficient conditions for achieving synchronization of two identical four-scroll systems are derived by using Lyapunov stability theorem. Numerical simulations are presented to demonstrate the effectiveness of the proposed chaos control and synchronization schemes.

Abstract: A system generally for personalizing and synchronizing fob data in the context of a distributed transaction system is disclosed. A dynamic fob synchronization system may comprise point of service (POS) devices configured with transponder-readers to initiate transaction in conjunction with a fob, an enterprise data collection unit, and a fob object database update system An exemplary dynamic synchronization system (DSS) may comprise various fob POS devices, a secure support client server, a fob object database update system (FODUS), one or more enterprise data synchronization interfaces (EDSI), an update logic system, one or more enterprise data collection units (EDCUs), and one or more fob POS devices configured to interoperably accept and interface with fobs. In an exemplary embodiment, DSS may comprise a personalization system and an account maintenance system configured to communicate with FODUS. Personalization of multi-function fobs may be accomplished using a security server configured to generate and/or retrieve cryptographic key information from multiple enterprise key systems during the final phase of the fob issuance process.

Abstract: Co-array Fortran (CAF) and Unified Parallel C (UPC) are two emerging languages for single-program, multiple-data global address space programming. These languages boost programmer productivity by providing shared variables for inter-process communication instead of message passing. However, the performance of these emerging languages still has room for improvement. In this paper, we study the performance of variants of the NAS MG, CG, SP, and BT benchmarks on several modern architectures to identify challenges that must be met to deliver top performance. We compare CAF and UPC variants of these programs with the original Fortran+MPI code. Today, CAF and UPC programs deliver scalable performance on clusters only when written to use bulk communication. However, our experiments uncovered some significant performance bottlenecks of UPC codes on all platforms. We account for the root causes limiting UPC performance such as the synchronization model, the communication efficiency of strided data, and source-to-source translation issues. We show that they can be remedied with language extensions, new synchronization constructs, and, finally, adequate optimizations by the back-end C compilers.

Abstract: A system, method and article of manufacture are provided for affording synchronization in an automated scripting framework. First, script data is received utilizing a language-driven interface. Then, reports having user readable sentences are created based on the received script data. The received script data is then translated into automation code. Finally, automated testing is provided utilizing the automation code.

Abstract: Systems and methods are disclosed for time synchronization of operations in a control system. Synchronization networks and devices are provided for transferring synchronization information between controllers in a distributed or localized control system, which is employed in order to allow operation of such controllers to be synchronized with respect to time. Also disclosed are synchronization protocols and hardware apparatus employed in synchronizing control operations in a control system.

Abstract: Providing a framework for developing, deploying and managing sophisticated mobile solutions, with a simple Web-like programming model that integrates with existing enterprise components. Mobile applications may consist of a data model definition, user interface templates, a client side controller, which includes scripts that define actions, and, on the server side, a collection of conduits, which describe how to mediate between the data model and the enterprise. In one embodiment, the occasionally-connected application server assumes that data used by mobile applications is persistently stored and managed by external systems. The occasionally-connected data model can be a metadata description of the mobile application's anticipated usage of this data, and be optimized to enable the efficient traversal and synchronization of this data between occasionally connected devices and external systems.

Abstract: The universal mechanism resulting in the generalized synchronization regime arising in the chaotic oscillators with the dissipative coupling has been described. The reasons for the generalized synchronization occurrence may be clarified by means of a modified system approach. The main results are illustrated by unidirectionally coupled Rossler systems, Rossler and Lorenz systems, and logistic maps.

Abstract: An information management and synchronous communications system and method facilitates database equilibrium and synchronization with wired, wireless and Web-based systems, user-friendly and efficient generation of computerized menus and reservations with handwritten/voice modifications for restaurants and other applications that utilize equipment with nonstandard graphical formats, display sizes and/or applications for use in remote data entry, information management and communication with host computer, digital input device or remote pager via standard hardwired connection, the internet, a wireless link, printer or the like.

Abstract: Disclosed are a method and an apparatus for synchronizing data from a synchronization module or application to one or more associated synchronization modules or applications. According to some embodiments of the present invention, a data item may be created in response to an action executed on a data unit. The data item may be associated with a unique or a substantially unique identifier. The unique identifier associated with the data item may be included in an activity log which may be created in response to an action executed on the data unit. The activity log may further include an ascending log number. The activity log may be propagated to one or more of the associated synchronization applications or modules.

Abstract: PROBLEM TO BE SOLVED: To easily and surely specify an area suspected of an abnormal tissue on a normal color endoscopic picture. SOLUTION: When judging an abnormal pixel, an abnormality judgment circuit 51 outputs an abnormality judgment signal, takes pictures in a synchronization memory F24d, a synchronization memory G24e and a synchronization memory R24f at the time into a temporary memory 53, and controls an abnormal position display circuit 52. Thus, the abnormal position display circuit 52 superimposes and displays a mark showing a position of the abnormal pixel on the picture taken into the temporary memory 53, and outputs still picture data of a normal picture superimposed with the mark and stored in the temporary memory 53 to D/A conversion circuits 27a to 27c to thumbnail-display it on a monitor 4. COPYRIGHT: (C)2006,JPO&NCIPI

Abstract: We investigate the problem of synchronization in oscillator networks when the delay inherent in such systems is taken into account. We first investigate a general Kuramoto- type model with heterogeneous time delays, both with a complete network as well as a nearest neighbor interaction, for which we propose conditions for synchronization around a rotating frequency. Then, we turn our attention to the problem of synchronization when the topologies are allowed to change. We show that synchronization is possible in the presence of delay, using a common Lyapunov functional argument.

Abstract: A technique and mechanism to effect cross-pollination synchronization of PIM (personal information manager) data to multiple sources. Additionally, a novel feature of the subject invention is the ability to effect cross-pollination synchronization with any number of devices and sources in a network. The invention provides for a user to employ a mobile device or set of devices as a central repository for PIM data (e.g., calendar, contacts and tasks) synchronized from multiple sources (e.g., multiple PC's (personal computers), an exchange server). The invention provides for synchronization of PIM data from multiple types of server sources to multiple devices regardless of the synchronization protocol versions and different schemas.

Abstract: A MAC protocol for Ultra Wide Band (UWB) radio networks named (UWB)2 is proposed. The algorithm exploits typical features of impulse radio such as large processing gain, and is conceived in conjunction with a synchronization strategy which foresees the presence of a synchronization sequence in each transmitted packet. (UWB)2 adopts a pure Aloha approach; Performance analysis of the synchronization tracking mechanism showed in fact that under the preliminary simplistic hypothesis of an AWGN channel, and for a sufficient number of pulses in the synchronization sequence, a fairly high probability of successful synchronization can be achieved, even in the presence of several users and Multi User Interference (MUI). The multiple access scheme is based on the combination of a common control channel provided by a common Time Hopping (TH) code with dedicated data channels associated to transmitter specific TH codes.Results obtained by simulation indicate that (UWB)2 can be successfully applied when the number of users spans from a few tens to about one hundred, for data rates ranging from a few thousands to a few hundreds of bits per second. Network throughput was above 99.8% in all considered simulation settings. Such achievement confirms that (UWB)2 is a suitable and straightforward solution for large networks of terminals using impulse radio for transmission at low bit rates.

Abstract: Cellular Neural/Nonlinear Networks Multi-Scroll Chaotic and Hyperchaotic Attractors Synchronization of Chaotic Lur'e Systems Engineering Applications.