Abstract: In previous work [J D Skufca and E Bollt, Mathematical Biosciences and Engineering, 1 (2004), pp 347-359], empirical evidence indicated that a time-varying network could propagate sufficient in

Abstract: We show that isochronous synchronization between two delay-coupled oscillators can be achieved by relaying the dynamics via a third mediating element, which surprisingly lags behind the synchronized outer elements. The zero-lag synchronization thus obtained is robust over a considerable parameter range. We substantiate our claims with experimental and numerical evidence of such synchronization solutions in a chain of three coupled semiconductor lasers with long interelement coupling delays. The generality of the mechanism is validated in a neuronal model with the same coupling architecture. Thus, our results show that zero-lag synchronized chaotic dynamical states can occur over long distances through relaying, without restriction by the amount of delay.

Abstract: Chaos synchronization of two identical Chua systems with the same fractional order is studied by utilizing the Pecora–Carroll (PC) method, the active–passive decomposition (PAD) method, the one-way coupling method and the bidirectional coupling one. The sufficient conditions for achieving synchronization between these two systems are derived via the Laplace transformation theory. Numerical simulations show the effectiveness of the theoretical analyses.

Abstract: Accurate and synchronized time is crucial in many sensor network applications due to the need for consistent distributed sensing and coordination. In hostile environments where an adversary may attack the networks and/or the applications through external or compromised nodes, time synchronization becomes an attractive target due to its importance. This paper describes the design, implementation, and evaluation of TinySeRSync, a secure and resilient time synchronization subsystem for wireless sensor networks running TinyOS. This paper makes three contributions: First, it develops a secure single-hop pairwise time synchronization technique using hardware-assisted, authenticated medium access control (MAC) layer timestamping. Unlike the previous attempts, this technique can handle high data rate such as those produced by MICAz motes (in contrast to those by MICA2 motes). Second, this paper develops a secure and resilient global time synchronization protocol based on a novel use of the μTESLA broadcast authentication protocol for local authenticated broadcast, resolving the conflict between the goal of achieving time synchronization with μTESLA-based broadcast authentication and the fact that μTESLA requires loose time synchronization. The resulting protocol is secure against external attacks and resilient against compromised nodes. The third contribution consists of an implementation of the proposed techniques on MICAz motes running TinyOS and a thorough evaluation through field experiments in a network of 60 MICAz motes.

Abstract: Systems, methods, computer-readable mediums, user interfaces and other implementations are disclosed for synchronizing widgets and dashboards.

Abstract: Sufficient condition for the generalized lag-synchronization of continuous chaotic system with a kind of nonlinear transformation and a constant lag time is derived. The method is illustrated by applications to Lorenz system and Duffing system, respectively and the simulation results demonstrate the effectiveness of the proposed theorem.

Abstract: Methods and related computer program products, systems, and devices for providing feedback to a user based on audio input associated with a user reading a passage from a physical text are disclosed.

Abstract: A system for synchronizing data for use in a navigation comprises a computing device and a vehicle onboard computer system. The computing device comprises an associated communication subsystem adapted for wireless communications, a user interface permitting entry of address data, and memory adapted to store the address data. The onboard computer comprises a communication subsystem for wireless communications with the computing device, memory to locally store address data, and a navigation system having a user interface that allows for selection of stored address data. The navigation system calculates a route based upon the selected address, displays the route on the user interface, and synchronizes address data using an information synchronization protocol. Changes or additions to the address data in the computing device are synchronized with local address data of the onboard computer, facilitating selection of addresses for route calculation.

Abstract: Wireless sensor networks have received a lot of attention recently due to its wide applications. An accurate and synchronized clock time is crucial in many sensor network applications. Several clock synchronization schemes have been proposed for wireless sensor networks recently to address the resource constraints in such networks. However, most of these techniques assume benign environments, but cannot survive malicious attacks in hostile environments, especially when there are compromised nodes. As an exception, a recent work attempts to detect malicious attacks against clock synchronization, and aborts when an attack is detected. Though this approach can prevent incorrect clock synchronization due to attacks, it will lead to denial of clock synchronization in such situations. This paper adopts a model where all the sensor nodes synchronize their clocks to a common source, which is assumed to be well synchronized to the external clock. This paper seeks techniques to provide redundant ways for each node to synchronize its clock with the common source, so that it can tolerate partially missing or false synchronization information provided by compromised nodes. Two types of techniques are developed using this general method: level-based clock synchronization and diffusion-based clock synchronization. Targeted at static sensor networks, the level-based clock synchronization constructs a level hierarchy initially, and uses (or reuses) this level hierarchy for multiple rounds of clock synchronization. The diffusion-based clock synchronization attempts to synchronize all the clocks without relying on any structure assumptions and, thus, can be used for dynamic sensor networks. This paper further investigates how to use multiple clock sources for both approaches to increase the resilience against compromise of source nodes. The analysis in this paper indicates that both level-based and diffusion-based approaches can tolerate up to s colluding malicious source nodes and t colluding malicious nodes among the neighbors of each normal node, where s and t are two system parameters. This paper also presents the results of simulation studies performed to evaluate the proposed techniques. These results demonstrate that the level-based approach has less overhead and higher precision, but less coverage, than the diffusion-based approach.

Abstract: The invention allows any number of connected computing devices to synchronization data with each other without being wired directly to each other. The invention provides for generic data handling in addition to type-specific data handling to allow plug-in support for additional data types without altering the basic infrastructure of the system.

Abstract: The study of the collective dynamics of synchronization among genetic oscillators is essential for the understanding of the rhythmic phenomena of living organisms at both molecular and cellular levels. Genetic oscillators are biochemical networks, which can generally be modelled as nonlinear dynamic systems. We show in this paper that many genetic oscillators can be transformed into Lur'e form by exploiting the special structure of biological systems. By using a control theory approach, we provide a theoretical method for analysing the synchronization of coupled nonidentical genetic oscillators. Sufficient conditions for the synchronization as well as the estimation of the bound of the synchronization error are also obtained. To demonstrate the effectiveness of our theoretical results, a population of genetic oscillators based on the Goodwin model are adopted as numerical examples.

Abstract: The present invention provides software developers with the capability to create applications that can access information online and offline without having to program such capabilities into their applications. An application can gather information from various remote data sources via a network or other communication means, and still have access to all or a portion of that information when the computing device running the application is no longer connected to the network. In one embodiment, a client manages information access, caching and synchronization for the application. When connected, information accessed is stored in a local data store on (or near) the computing device. When disconnected, requests are run against the local data store instead of the remote data source. When reconnected, information is synchronized between the local data store and the remote data source.

Abstract: Graphical models applying partial coherence to multivariate time series are a powerful tool to distinguish direct and indirect interdependencies in multivariate linear systems. We carry over the concept of graphical models and partialization analysis to phase signals of nonlinear synchronizing systems. This procedure leads to the partial phase synchronization index which generalizes a bivariate phase synchronization index to the multivariate case and reveals the coupling structure in multivariate synchronizing systems by differentiating direct and indirect interactions. This ensures that no false positive conclusions are drawn concerning the interaction structure in multivariate synchronizing systems. By application to the paradigmatic model of a coupled chaotic Roessler system, the power of the partial phase synchronization index is demonstrated.

Abstract: A user of multiple client devices (clients) makes application configuration changes on the clients from time to time. The configuration changes are stored in a local event log on each client, as well as in a synchronization server. When one of the clients connects to the synchronization server, for example when the user logs into the synchronization server while using a respective client, the configuration information in the server and client is synchronized. Conflicts, if any, in the configuration changes for a respective application are resolved in accordance with a conflict resolution procedure or conflict resolution rules associated with that application.

Abstract: In the present paper, two kinds of dynamical complex networks are considered. The first is that elements of every node have different time delays but all nodes in such networks have the same time-delay vector. The second is that different nodes have different time-delay vectors, and the elements of each node also have different time delays. Corresponding synchronization theorems are established. Numerical examples show the efficiency of the derived theorems.

Abstract: Systems and methods of power management provide for controlling the idleness of a processor based on an operating system schedule. The idleness of at least one device is synchronized with the idleness of the processor. Idleness synchronization may involve deferring bus transactions, suspending memory refresh, turning off power to clock sources and turning off power to combinatorial logic during an idle window in the OS schedule.

Abstract: A system and method for retrieving media data from a portable media device for storage on a client computer during synchronization between the portable media device and the client computer. A media player application (MPA) identifies media data on the portable media device that has been modified since a last synchronization process, and automatically or selectively retrieves the modified and/or unmodified media data from the portable media device for storage on the client computer.

Abstract: The claimed subject matter provides a system and/or a method that facilitates synchronizing data within a data storage system. An interface component can leverage a synchronization technique within the data storage system. A sync component can provide a secure peer to peer data synchronization based at least in part upon the synchronization technique to allow a tiered access to the synchronized data.

Abstract: Methods and apparatus for providing content and services to an Internet-enabled device in synchronization with media content presented on a television, radio or other separate device are described. In various embodiments, information suitable for identifying the media content being presented on a television or radio is detected by an audio or video receiver such as a microphone, video camera or optical receiver built into or connected to a PC or laptop. Corresponding content is then fetched from Internet servers or local memory or storage and displayed on the PC or laptop. Also, a program module-based framework that provides for the delivery of such media-coordinated content across multiple programs and advertisements and multiple content providers is described.

Abstract: Recent research has revealed that complex networks with a smaller average distance and more homogeneous degree distribution are more synchronizable. We find, however, that synchronization in complex, clustered networks tends to obey a different set of rules. In particular, the synchronizability of such a network is determined by the interplay between intercluster and intracluster links. The network is most synchronizable when the numbers of the two types of links are approximately equal. In the presence of a mismatch, increasing the number of intracluster links, while making the network distance smaller, can counterintuitively suppress or even destroy the synchronization. We provide theory and numerical evidence to establish this phenomenon.

Abstract: We present an efficient and robust multiscale DTW (MsDTW) approach to music synchronization for time-aligning CD recordings of different interpretations of the same piece. The general strategy is to recursively project an alignment path computed at a coarse resolution level to the next higher level and then to refine the projected path. As main contributions, we address several crucial issues including the design and specification of robust and scalable audio features, suitable local cost measures, MsDTW levels, constraint regions, as well as sampling rate adaptation and structural enhancement strategies. Extensive experiments on Western classical music show that our MsDTW-based algorithm yields the same alignment result as the classical DTW-based strategy while significantly reducing the running time and memory requirements. Even for pieces of a duration of 10 to 15minutes, the alignment (based on previously extracted feature sequences) can be computed in less than a second.

Abstract: Improved techniques that facilitate use of podcasts are disclosed. The improved techniques can pertain to creating, publishing, hosting, accessing, subscribing, managing, transferring, and/or playing podcasts. According to one aspect, a client application can facilitate discovery of a podcast of interest from a plurality of podcasts, subscribe to the podcast of interest, and provide subsequent management of the podcast of interest. The management of the podcast of interest can include acquiring updated podcast data with little or no user interaction required. According to another aspect, some or all podcasts locally available to a client application can be copied (e.g., synchronized) with a portable media device so that the podcasts can be conveniently available and played by either the client application or the portable media device.

Abstract: A multi-channel music reproducing apparatus and method using a wired and/or wireless communication system are provided. The method includes confirming neighboring devices capable of wired and/or wireless communication; allocating audio channel information to confirmed neighboring devices; encoding the channel information and reproduction synchronization information as index information; transmitting the index information together with a music data file; receiving the encoded index information and music data; decoding the allocated channel information and the synchronization information; and outputting music data corresponding to the allocated channel.

Abstract: The problem of time synchronization in dense wireless networks is considered. Well-established synchronization techniques suffer from an inherent scalability problem in that synchronization errors grow with an increasing number of hops across the network. In this work, a model for communication in wireless networks is first developed, and then the model is used to define a new time synchronization mechanism. A salient feature of the proposed method is that, in the regime of asymptotically dense networks, it can average out all random errors and maintain global synchronization in the sense that all nodes in the multihop network can see identical timing signals. This is irrespective of the distance separating any two nodes.