Clock synchronization state graphs based on clock precision difference

Consistent and stable global states of clock synchronization are very important in distributed and parallel systems. This paper presents an innovative strategy and method to obtain stable global clock synchronization state graphs in asynchronous Internet environments. Our model will introduce the concept of clock precision difference as a means to evaluate running states of all clocks in this system and make this system  self-adaptive well. Finally, we introduce the concept of clock precision difference into global states analysis of clock synchronization and construct clock synchronization state graphs in order to evaluate distributed clock synchronization states. We also present detailed simulations of the strategy and mathematical analysis used on real Internet environments.

Self-adaptive clock synchronization for computational grid

This paper presents an innovative method to synchronize physical clocks for a computational grid, in particular for a computational grid linked through the asynchronous Intranet or Internet environments. The method discussed is an asynchronous self-adaptive clock synchronization mechanism. Two strategies for clock synchronisation are introduced. (1) Use continuous time intervals to calculate the precision of clocks, which can reduce the effect of network delay efficiently. (2) Every node synchronizes its clock with its leader actively. In addition, a node self-adaptive model is presented, and the relationship between the clock precision and synchronization time is induced, hence a node can predict when it should begin the synchronization process. Detailed simulation and extension of this issue are provided at the end of the paper. The presented model is both practical and feasible.

Self-adaptive clock synchronization for computational grid

Abstract This paper presents an innovative method to synchronize physical clocks for a computational grid, in particular for a computational grid linked through the asynchronous Intranet or Internet environments. The method discussed is an asynchronous self-adaptive clock synchronization mechanism. Two strategies for clock synchronization are introduced. (1), Use continuous time intervals to calculate the precision of clocks, which can reduce the effect of network delay efficiently. (2) Every node synchronizes its clock, with its leader actively. In addition, a node self-adaptive model is presented, and the relationship between the clock precision and synchronization time is induced, hence a node can predict when it should begin the synchronization process. Detailed simulation and extension of this issue are provided at the end of the paper. The presented model is both practical and feasible

Self-adaptive clock synchronisation based on clock precision difference

This paper presents an innovative strategy to synchronize all virtual clocks in asynchronous Internet environments. Our model is based on the architecture of one reference clock and many slave clocks communicating with each other over the Internet. The paper makes three major contributions to this research area. Firstly, one-way information transmission is applied to reduce traffic overhead on the Internet for the purpose of clock synchronization. Secondly, the slave nodes use local virtual time and the arrival timestamp, from the reference node, to create linear mathematical trend models and to retrieve the clock precision differences between reference clock and slave clocks. Finally, a fault-tolerant and self-adaptive model executed by each slave node based on the above linear trend model is created in order to ensure that the virtual clock is running normally, even when the link between the reference node and this slave node has crashed. We also present detailed simulations of this strategy and mathematical analysis on real Internet environments.

Motor unit synchronization measured by cross-correlation is not influenced by short-term strength training of a hand muscle

The purpose of the study was to quantify the strength of motor unit synchronization and coherence from pairs of concurrently active motor units before and after short-term (4–8 weeks) strength training of the left first dorsal interosseous (FDI) muscle. Five subjects (age 24.8 ± 4.3 years) performed a training protocol three times/week that consisted of six sets of ten maximal isometric index finger abductions, whereas three subjects (age 27.3 ± 6.7 years) acted as controls. Motor unit activity was recorded from pairs of intramuscular electrodes in the FDI muscle with two separate motor unit recording sessions obtained before and after strength training (trained group) or after 4 weeks of normal daily activities that did not involve training (control group). The training intervention resulted in a 54% (45.2 ± 8.3 to 69.5 ± 13.8 N, P = 0.001) increase in maximal index finger abduction force, whereas there was no change in strength in the control group. A total of 163 motor unit pairs (198 single motor units) were examined in both subject groups, with 52 motor unit pairs obtained from 10 recording sessions before training and 51 motor unit pairs from 10 recording sessions after training. Using the cross-correlation procedure, there was no change in the strength of motor unit synchronization following strength training (common input strength index; 0.71 ± 0.41 to 0.67 ± 0.43 pulses/s). Furthermore, motor unit coherence z scores at low (0–10 Hz; 3.9 ± 0.3 before to 4.4 ± 0.4 after) or high (10–30 Hz; 1.7 ± 0.1 before to 1.9 ± 0.1 after) frequencies were not influenced by strength training. These motor unit data indicate that increases in strength following several weeks of training a hand muscle are not accompanied by changes in motor unit synchronization or coherence, suggesting that these features of correlated motor unit activity are not important in the expression of muscle strength.

Algebraic attacks on clock-controlled stream ciphers

We present an algebraic attack approach to a family of irregularly clock-controlled bit-based linear feedback shift register systems. In the general set-up, we assume that the output bit of one shift register controls the clocking of other registers in the system and produces a family of equations relating the output bits to the internal state bits. We then apply this general theory to four specific stream ciphers: the (strengthened) stop-and-go generator, the alternating step generator, the self-decimated generator and the step1/step2 generator. In the case of the strengthened stop-and-go generator and of the self-decimated generator, we obtain the initial state of the registers in a significantly faster time than any other known attack. In the other two situations, we do better than or as well as all attacks but the correlation attack. In all cases, we demonstrate that the degree of a functional relationship between the registers can be bounded by two. Finally, we determine the effective key length of all four systems.

Algebraic attacks on clock-controlled cascade ciphers

In this paper, we mount the first algebraic attacks against clock controlled cascade stream ciphers. We first show how to obtain relations between the internal state bits and the output bits of the Gollmann clock controlled cascade stream ciphers. We demonstrate that the initial states of the last two shift registers can be determined by the initial states of the others. An alternative attack on the Gollmann cascade is also described, which requires solving quadratic equations. We then present an algebraic analysis of Pomaranch, one of the phase two proposals to eSTREAM. A system of equations of maximum degree four that describes the full cipher is derived. We also present weaknesses in the filter functions of Pomaranch by successfully computing annihilators and low degree multiples of the functions.

Learning online, clock time and network time? How students use and perceive time when studying online.

Though technology has increased opportunities for students to study online, many students continue to complain of lack of time to study and learn. Using the concepts of clock time and network time, the project combines interview, survey and Australian Bureau of Statistics time diary results to investigate student use and perceptions of their available time to study and how the technologies used in online learning affect this. We concentrate on the amount of time students think they have when studying online, how much time they really use, and what affects this perception of time. Deakin University has specialised in distance education/online learning since its inception in 1974 and long time use of technologies and pedagogies allows widespread and diverse experiences for our students, both on campus and off campus. We study student cohorts of up to 1700 students studying in a single subject online learning space, and note that students in much smaller subject cohorts have similar complaints about time.

Mutually clock-controlled feedback shift registers provide resistance to algebraic attacks

Algebraic attacks have been applied to several types of clock-controlled stream ciphers. However, to date there are no such attacks in the literature on mutually clock-controlled ciphers. In this paper, we present a preliminary step in this direction by giving the first algebraic analysis of mutually clock-controlled feedback shift register stream ciphers: the bilateral stop-and-go generator, A5/1, Alpha 1 and the MICKEY cipher. We show that, if there are no regularly clocked shift registers included in the system, mutually clock-controlled feedback shift register ciphers appear to be highly resistant to algebraic attacks. As a demonstration of the weakness inherent in the presence of a regularly clocked shift register, we present a simple algebraic attack on Alpha 1 based on only 29 keystream bits.

Cache and replica lookup, indexing and synchronization in P2P environments

The major outcomes of this research project were the development of a set of decentralized algorithms to index, locate and synchronize replicated information in a networked environment. This study exploits the application specific design constraints of networked systems to improve performance, instead of relying on data structures and algorithms best suited to centralized systems.

Non-retinal light stimulation and the human biological clock

Since 1998, debate has occurred over whether light synchronises the human biological clock through the visual system only, or if the light penetrating our skin is also influential. This thesis provides definitive, debate ending, evidence that skin exposure to even intensely bright light has no impact on circadian timing. The portfolio presents a review of the literature regarding the efficacy of dialectical behavior therapy as a treatment for borderline personality disorder, a summary of the proposed mechanisms of action on the various treatment components, and a description of the clinical application of the four 'skills training modules' via the use of four case study examples.

Patchwork-based stereo audio watermarking against de-synchronization attack

Audio watermarking schemes using patchworkbased algorithm have good robustness against majority of the watermarking attacks. However, these watermarking schemes are vulnerable to de-synchronization attack. This paper proposes a patchwork-based watermarking scheme for stereo audio signals to address this problem. To improve the robustness, the proposed method exploits the similarities of both channels in the stereo audio signals. Given a stereo audio signal, we first compute the discrete cosine transform (DCT) of both channels, which gives two sets of DCT coefficients. Then DCT segments are formed form DCT coefficients belong to a certain frequency range. The DCT segment formation is determined by a pseudonoise (PN) sequence which acts as a secret key. Then watermark bits are embedded into DCT segments by modifying the DCT coefficients. In the decoding process the secret key is used to extract the watermark bits embedded in the DCT segments. Simulation results illustrate the effectiveness of the proposed method against de-synchronization attack, compared to latest patchwork-based audio watermarking scheme. Besides, the proposed algorithm also gives better robustness against other conventional attacks.