Synchronization Time Research Articles

NARA: Network-Aware Resource Allocation mechanism for minimizing quality-of-service impact while dealing with energy consumption in volunteer networks

A large-scale volunteer computing system is a type of distributed system in which contributors volunteer their computing resources, such as personal computers or mobile devices, to contribute to a larger computing effort. Volunteer resources are connected over the Internet and together form a powerful computing system capable of providing a service without depending on a service provider. Volunteer network resource allocation is the process of assigning computing tasks or services to a network of volunteer resources. The allocation process includes identifying the needed resources, selecting appropriate volunteers, and assigning tasks or services based on their capabilities. Volunteer computing systems consist of a large number of heterogeneous resources - in terms of processing power, storage, and availability - belonging to different authorities - users or organizations - and exhibiting uncertain behavior in terms of connection, disconnection, capacity, and failure. All of this makes resource allocation a challenging task in terms of ensuring a minimum quality of service, requiring complex algorithms and optimization techniques to ensure that services are efficiently allocated while respecting the constraints of the available resource. This paper introduces the Network-Aware Resource Allocation mechanism, which leverages the location, connectivity, and network latency of volunteer nodes to minimize the time a service runs with degraded quality of service and aims to deal with the energy consumption resulting from data replication requirements. This resource allocation mechanism applies to both the initial deployment of the service in the network and to the reallocation of nodes in the event that one of the allocated nodes fails or becomes unavailable. Our method has been validated in a simulation environment of a realistic volunteer system. The analysis of the results shows how our mechanism meets the quality requirements of users while minimizing the synchronization and replication times of service data replicas, as well as the time that services run with degraded quality of service, reducing the times by more than 70% in the service deployment phase and by more than 60% in the service execution phase. It also helps to reduce overall energy consumption.

Sliding mode control for finite-time projective synchronisation in distinct Caputo fractional-order delayed neural networks with inconsistent orders

This manuscript delves into the realm of projective synchronisation in delayed neural networks governed by Caputo fractional-order dynamics, addressing the intricate challenges of attaining finite-time synchronisation in networks with distinct structures, functions, and orders. To start, the integration of a compensation controller within the control architecture is examined, aiming to formulate the projection error dynamics. By leveraging projection error system analysis alongside output observation and sliding mode control, a meticulously crafted derivative-based sliding mode surface along with a sliding mode controller are devised, ensuring both convergence and seamless sliding motion. Afterwards, the accessibility of the surface is assessed through relevant lemmas, Caputo derivative characteristics and the Lyapunov direct approach. The subsequent stability of sliding path is corroborated, and indispensable prerequisites for achieving finite-time projective synchronisation are outlined. Furthermore, the establishment of an upper bound for synchronisation time of distinct Caputo fractional-order delayed neural networks (CFDNNs) with inconsistent orders is carried out. Ultimately, simulations on distinct CFDNNs with consistent and inconsistent orders are conducted to exemplify our approach, employing the continuous frequency distribution model.

Syntactic and semantic variations in negative interrogatives: Contracted vs. uncontracted forms

This study investigates the forms and uses of negative interrogatives with auxiliary verb contractions in English, focusing on syntactic and semantic differences. Data was drawn from conversations in an English class at a university in Lhokseumawe, Indonesia, between a lecturer and students and students and students. The aim was to examine three types of negative interrogatives: Yes-No questions, negative rhetorical questions, and both marked (n’t) and unmarked (not) forms. The research employs a descriptive method with a synchronic time frame, utilizing distributional analysis, including immediate constituent analysis and mark reading techniques, to categorize and analyze the data. The findings reveal that negative interrogatives involving auxiliary verbs exhibit positive and negative presuppositions, with adjectival negative interrogatives showing variations between contracted and uncontracted forms. Adverbial negative interrogatives were found across all three types, indicating their versatility in forming questions. The study highlights that the choice between ‘not’ and ‘n’t’ affects the tone and emphasis of negative interrogatives, influencing the interpretation of responses. Contracted forms often carry a rhetorical or presumptive tone, while uncontracted forms are more formal and explicit. These variations show the importance of auxiliary verbs and negative markers in shaping the structure and meaning of negative interrogatives. This research contributes to the understanding of how negative interrogatives function in English, revealing the nuanced ways in which they impact communication and interpretation.

An Urban Flood Model Development Coupling the 1D and 2D Model with Fixed-Time Synchronization

Due to climate change, the frequency and intensity of torrential rainfall in urban areas are increasing, leading to more frequent flood damage. Consequently, there is a need for a rapid and accurate analysis of urban flood response capabilities. The dual-drainage model has been widely used for accurate flood analysis, with minimum time step synchronization being commonly adopted. However, this method has limitations in terms of speed. This study applied the hyper-connected solution for an urban flood (HC-SURF) model with fixed-time step flow synchronization, validated its accuracy using laboratory observation data, and tested its effectiveness in real urban watersheds with various synchronization times. Excellent performance was achieved in simulating real phenomena. In actual urban watersheds, as the synchronization time increased, the errors in surcharge and discharge also increased due to the inability to accurately reflect water level changes within the synchronization time; however, overall, they remained minimal. Therefore, the HC-SURF model is demonstrated as a useful tool for urban flood management that can be used to advantage in real-time flood forecasting and decision-making.

Specified time dual-group synchronization of uncertain complex chaotic systems

Aiming at the specified time dual-group synchronization problem of multi-wing complex chaotic systems containing uncertain terms and external disturbances, a new specified-time sliding mode control scheme is proposed, which directly synchronizes the complex chaotic system without separating the real and imaginary parts of the complex chaotic system. First, a new specified time stability criterion is used to construct the integral sliding mode surface of the synchronous error system to ensure stable sliding motion within the specified time. Subsequently, a proximity controller is designed to drive the error system to reach and remain on the sliding surface within another specified time, thereby achieving specified-time synchronization. In order to realize the proposed stability concept, this paper introduces a new sliding surface and defines the corresponding control law and adaptive rate. The effectiveness of this scheme is proved through Lyapunov stability theory and specified time stability theory. Numerical simulation results show that the scheme has strong robustness to uncertainties and external disturbances, and the controller is not affected by internal uncertainties and external disturbances. Compared to other stabilization time control schemes, this scheme has a shorter synchronization time. In general, this study introduces complex variables and adopts a scheme in which sliding mode surface parameters and controller parameters can be preset to simultaneously achieve dual-group synchronization of two groups of complex chaotic systems within the complex domain. This study offers greater flexibility, presenting novel ideas and approaches for the synchronization control of complex systems. It holds significant theoretical and practical value, providing valuable references and insights for research and applications in related fields.

Finite-time passivity of multi-weighted coupled neural networks with directed topologies and time-varying delay

In this paper, the finite-time passivity (FTP) problem for multi-weighted coupled neural networks (MWCNNs) with directed topologies and time-varying delay is discussed. Firstly, by designing a new state feedback controller, several FTP criteria are given for the considered network. Then, some finite-time synchronization (FTS) criteria are established by employing the FTP results. Secondly, a hybrid impulsive and state feedback controller is first designed, under which different FTP and FTS criteria are presented and the synchronization time is successfully shortened compared to the non-hybrid controller without impulses. Finally, numerical simulations are given to show the effectiveness and superiority of the obtained results.

Research on picosecond synchronization control between synchrotron radiation X-ray pulse and femtosecond laser pulse on SSRF

The laser-pumped X-ray detection method is a crucial tool for investigating molecular dynamics, allowing researchers to study ultrafast structural changes within materials. This method demands extremely high precision in the synchronization and delay timing between the pump pulse and the probe pulse. In this study, we explored picosecond (ps)-level clock synchronization control between synchrotron radiation X-ray pulses and femtosecond (fs) laser pulses at the BL05U (d-Line) of the Shanghai Synchrotron Radiation Facility (SSRF). Utilizing the X-ray pulses generated by the 40 ps/0.3 mA electron beam bunch from the SSRF and femtosecond laser pulses with high repetition rates and high emission power, we conducted synchronization experiments. A custom-developed picosecond time synchronization control system and a high dynamic range X-ray streak camera with picosecond time resolution were used as detectors, enabling ultra-precise time synchronization monitoring of X-ray and laser pulses. This setup achieves higher time resolution without the need for photodiodes and oscilloscopes. Using the X-ray pulses as a stationary reference frame, we adjusted the clock synchronization control system to delay the laser pulses and measured their relative timing changes with the X-ray streak camera. The experiments demonstrated a time resolution better than 10 ps, providing a foundation for achieving 60 ps time resolution in laser-pumped X-ray detection experiments at the SSRF.

Research and implementation of a large-bandwidth real-time radar jamming simulator.

The electromagnetic environment faced by modern radar is becoming increasingly complex. One effective means to improve the performance of radar systems is testing in an anti-jamming ability test chamber, where the increased complexity has also led to higher performance requirements for radar jamming simulators. Based on the requirements for modern radar system testing, this paper presents a study of a large-bandwidth real-time radar jamming simulator and describes its overall design architecture; the simulator covers the L-Ku and Ka frequency bands and the instantaneous bandwidth is ≥2GHz, which means that the system is able to simulate 11 interference patterns. Synchronous control of the system is realized in 1ms through use of the reflection memory interrupt mechanism, the synchronous pulse signal mechanism, synchronous timing design, and a real-time control software architecture. An overall design scheme for real-time simulation of a radar target jamming echo is given and baseband signal processing resources are saved through information preprocessing, a large-capacity high-speed storage board is designed to improve the data reading speed, a multiphase filtering structure is used to achieve high sampling rates and save hardware resources, and a high-speed parallel computing method is used to improve computing efficiency; the actual measured baseband signal processing time is less than 500ns. Finally, a measurement platform is built, and the main interference patterns are verified through experimental measurements.

A new fixed-time sliding mode control scheme for synchronization of chaotic systems

Chaotic synchronization is crucial in the field of secure communication, and fixed-time synchronization has realistic application prospects and demands. Aiming at the traditional sliding mode synchronization control method with chattering problem, based on the Lyapunov stability theory and incorporating the continuous time fixed time stability theorem, this paper proposed a new fixed-time sliding mode control scheme for synchronization of chaotic systems. The traditional finite-time sliding mode synchronization is compared with the proposed fixed-time sliding mode synchronization scheme and the results are discussed. The efficacy of the controller is validated using MATLAB simulations, which eliminates the chatter problem in the traditional sliding mode synchronization scheme and has the advantage of short synchronization time. In addition, the parameters of the controller can be set flexibly, which is an advantage of the fixed-time synchronous control scheme.

Quenches in the Sherrington–Kirkpatrick model

The Sherrington–Kirkpatrick model is a prototype of a complex non-convex energy landscape. Dynamical processes evolving on such landscapes and locally aiming to reach minima are generally poorly understood. Here, we study quenches, i.e. dynamics that locally aim to decrease energy. We analyse the energy at convergence for two distinct algorithmic classes, single-spin flip and synchronous dynamics, focusing on greedy and reluctant strategies. We provide precise numerical analysis of the finite size effects and conclude that, perhaps counter-intuitively, the reluctant algorithm is compatible with converging to the ground state energy density, while the greedy strategy is not. Inspired by the single-spin reluctant and greedy algorithms, we investigate two synchronous time algorithms, the sync-greedy and sync-reluctant algorithms. These synchronous processes can be analysed using dynamical mean field theory (DMFT), and a new backtracking version of DMFT. Notably, this is the first time the backtracking DMFT is applied to study dynamical convergence properties in fully connected disordered models. The analysis suggests that the sync-greedy algorithm can also achieve energies compatible with the ground state, and that it undergoes a dynamical phase transition.

Internal/Boundary Control-Based Fixed-Time Synchronization for Spatiotemporal Networks.

This article is concerned about fixed-time (FT) synchronization of spatiotemporal networks (STNs) with the Robin boundary condition. Above all, a switching-type FT stability theorem and an integral inequality are established, which provide a novel theoretical tool for the rigorous analysis of FT control in STNs. Subsequently, three kinds of nontrivial power-law controllers are developed which are separately acted on the interior, the boundary, and the whole of the spatial domain. Based on these control schemes and Lyapunov-like method, several flexible criteria are obtained to achieve FT synchronization of STNs, and the upper bound of the synchronization time is explicitly estimated. Note that, the derived results here are also perfectly applicable to STNs with Neumann or Dirichlet boundary condition. Several illustrate examples are presented at final to confirm the developed controllers and criteria.

Research on a Distributed Cooperative Guidance Law for Obstacle Avoidance and Synchronized Arrival in UAV Swarms

In response to the issue where the original synchronization time becomes inapplicable for UAV swarms after temporal consistency convergence due to obstacle avoidance, a new distributed consultative temporal consistency guidance law that takes into account threat avoidance has been proposed. Firstly, a six-degree-of-freedom dynamic model and a guidance control model for unmanned aerial vehicles (UAVs) are established, and the guidance commands are decomposed into control signals for the pitch and yaw planes. Secondly, based on the theory of dynamic inversion control, a temporal consistency guidance law for a single UAV is constructed. On the other hand, an improved artificial potential field theory is used and integrated with a predictive correction network to generate guidance commands for threat avoidance. A threshold smoothing method is employed to integrate the two guidance systems, and a cluster consultation mechanism is introduced to design a two-layer temporal synchronization architecture, which negotiates to change the synchronization time of the swarm to achieve the convergence of consistency once again. Finally, in typical application scenarios, simulation verification demonstrates the effectiveness of the control method proposed in this paper. The proposed control method achieves the guidance of UAV formations to synchronize their arrival at the target location under complex threat conditions.

Ultra-Low-Power Sensor Nodes for Real-Time Synchronous and High-Accuracy Timing Wireless Data Acquisition.

This paper presents an energy-efficient and high-accuracy sampling synchronization approach for real-time synchronous data acquisition in wireless sensor networks (saWSNs). A proprietary protocol based on time-division multiple access (TDMA) and deep energy-efficient coding in sensor firmware is proposed. A real saWSN model based on 2.4 GHz nRF52832 system-on-chip (SoC) sensors was designed and experimentally tested. The obtained results confirmed significant improvements in data synchronization accuracy (even by several times) and power consumption (even by a hundred times) compared to other recently reported studies. The results demonstrated a sampling synchronization accuracy of 0.8 μs and ultra-low power consumption of 15 μW per 1 kb/s throughput for data. The protocol was well designed, stable, and importantly, lightweight. The complexity and computational performance of the proposed scheme were small. The CPU load for the proposed solution was <2% for a sampling event handler below 200 Hz. Furthermore, the transmission reliability was high with a packet error rate (PER) not exceeding 0.18% for TXPWR ≥ -4 dBm and 0.03% for TXPWR ≥ 3 dBm. The efficiency of the proposed protocol was compared with other solutions presented in the manuscript. While the number of new proposals is large, the technical advantage of our solution is significant.

A low-storage synchronization framework for blockchain systems

The advent of blockchain technology has brought major changes to traditional centralized storage. Therefore, various fields have begun to study the application and development of blockchain. However, blockchain technology has a serious shortcoming of data bloating. The reason is that blockchain technology achieves decentralization by storing complete blockchain data at each node, incurring a significant amount of blockchain data. Therefore, each node must spend significant amount of storage space and initialization synchronization time. To solve the above problems, in this research, we propose a secure and agile synchronization framework for low storage blockchains. First, we design a K-extreme segment algorithm, which reduces the synchronization time by returning only the first and last k blocks of each block segment at once to the local storage. Next, we decentrally store the block data of the blockchain by IPFS and establish a backup mechanism by IPFS-cluster. Finally, due to use of distributed storage, the nodes must request un-stored block data from IPFS, causing an increase in the throughput of the blockchain network. To avoid network congestion, we propose the working set algorithm to improve the hit ratio of the local storage and reduce the number of requests to decrease throughput. In summary, our experiments demonstrate that the ratio of full nodes to low storage nodes is significantly lower for nodes with higher storage limits compared to those with lower storage limits. In other words, a higher storage limit results in more low storage nodes which can be permitted to ensure that the blockchain network is robust and reliable. Therefore, our proposed framework can provide reliable low storage nodes for the blockchain. The node can reduce the local storage pressure and can still maintain the full functionality of blockchains.

Fixed-time synchronization of multilayered complex dynamic networks via quantized variable-gain saturated control

This paper studies fixed-time (FxT) quantitative synchronization of multilayered complex dynamic networks (CDNs). First, a new FxT stability theorem is established and two new estimations of the settling time of stability are acquired, which are more accurate than the existing ones. Then, by using the improved theorem, several sufficient conditions ensuring FxT synchronization of a multilayered CDN are derived via two classes of innovative quantized variable-gain saturated controllers, and some high-precision estimates of the synchronous settling time (SST) are attained. In general, the saturation function used to replace the signum function is nonlinear and even includes the odd-even requirement on the exponent, and no quantization is involved in the developed FxT controllers. However, in our design, the classical linear saturation function is employed and the input signals of the controllers are also quantized. Therefore, our proposed strategies are more practical and easier to implement. Besides, different from the traditional 2-norm/1-norm-based approaches, a novel nonsmooth Lyapunov function is constructed so that the resultant estimates of the SST are unrelated to either the network size or the node's dimension, which are less conservative and closer to the actual synchronized time. Lastly, some numerical examples are given to validate the theoretical results.

Chaos synchronization of two coupled map lattice systems using safe reinforcement learning

When synchronizing two continuous typical chaotic systems, the state variables of the response system are usually bounded and satisfy the Lipschitz condition. This permits a universal synchronization method. In the synchronization of two high-dimensional discrete chaotic systems such as the coupled map lattice systems, the state variables of the response system often diverge, which makes it difficult to seek a universal synchronization method. To overcome this difficulty, bounded and hard constraints, which correspond to the concept of safety level III in reinforcement learning terms, on the state variables must be imposed, when the discrete response system is perturbed. We propose a universal method for synchronizing two discrete systems based on safe reinforcement learning (RL). In this method, the RL agent’s policy is used to reach the goal of synchronization and a safety layer added directly on top of the policy is used to satisfy safety level III. The safety layer consists of a one-step predictor for the perturbed response system and an action correction formulation. The one-step predictor, based on a next generation reservoir computing, is used to identify whether the next state of the perturbed system is within the chaotic domain, and if not, the action correction formula is activated to modify the corresponding perturbing force component to zero. In this way, the state of the perturbed system will remain in the bounded chaotic domain. We demonstrate that the proposed method succeeds in synchronization without divergence through a numerical example with two coupled map lattice systems, and the average synchronization time is 12.66 iteration steps over 1000 different initial conditions. The method works even when parameter mismatches and disturbances exist in the system. We compare the performance in both cases with and without the safety layer and find that successful synchronization is only possible in the former case, emphasizing the significance of the safety layer. The performance of the algorithm with optimal hyper-parameters obtained by Bayesian optimization is robust and stable.

Temporal relationship between sarcoidosis and malignancies in a nationwide cohort of 1942 patients.

To investigate the phenotype of sarcoidosis according to the time when a malignancy is diagnosed (preexisting to the diagnosis of sarcoidosis, concomitant, or sequential) and to identify prognostic factors associated with malignancies in a large cohort of patients with sarcoidosis. We searched for malignancies in the SARCOGEAS cohort, a multicenter nationwide database of consecutive patients diagnosed with sarcoidosis according to the ATS/ESC/WASOG criteria. Solid malignancies were classified using the International Statistical Classification of Diseases and Related Health Problems 10th Revision (ICD-10) nomenclature, and hematological malignancies using the 2016 WHO classification. We excluded patients with a biopsy-proven diagnosis of sarcoidosis based exclusively on demonstrating granulomas in tissues also involved by malignant cells. Out of 1942 patients with sarcoidosis, 233 (12%) developed 250 malignancies, including solid (n= 173), hematological (n= 57), and both types of malignancies (n= 3). Concerning the time interval between the diagnoses of both conditions, 83 (36%) patients were diagnosed with malignancy at least 1 year before sarcoidosis diagnosis, 22 (9%) had s synchronous diagnosis of both diseases, and 118 (51%) developed malignancies at least 1 year after the diagnosis of sarcoidosis (the remaining cases developed malignancies in different time intervals). The multivariate-adjusted model showed that individuals with sarcoidosis who developed a malignancy had an hazard ratio (HR) of 2.27 [95% confidence interval (CI), 1.62-3.17] for having an asymptomatic clinical phenotype at diagnosis of sarcoidosis and that spleen (presence vs. absence: HR = 2.06; 95% CI, 1.21-3.51) and bone marrow (presence vs. absence: HR = 3.04; 95% CI, 1.77-5.24) involvements were independent predictors for the development of all-type malignancies. No predictive factors were identified when the analysis was restricted to the development of solid malignancies. The analysis limited to the development of hematological malignancies confirmed the presence of involvement in the spleen (HR = 3.73; 95% CI, 1.38-10.06) and bone marrow (presence vs. absence: HR = 8.00; 95% CI, 3.15-20.35) at the time of sarcoidosis diagnosis as predictive factors. It is essential to consider the synchronous or metachronous timing of the diagnosis of malignancies in people with sarcoidosis. We found that half of the malignancies were diagnosed after a diagnosis of sarcoidosis, with spleen and bone marrow involvement associated with a four to eight times higher risk of developing hematological malignancies. Key messages What is already known on this topic Malignancies are one of the comorbidities more frequently encountered in people with sarcoidosis What this study adds Malignancies occur in 12% of patients with sarcoidosis Malignancy may precede, coincide with, or follow the diagnosis of sarcoidosis One-third were identified before sarcoidosis, and half were diagnosed after Spleen and bone marrow involvement are risk factors for developing hematological malignancies How this study might affect research, practice or policy Patients with sarcoidosis should be regularly monitored for neoplasms, informed of the increased risk, and educated on early detection. Those with spleen or bone marrow involvement must be closely followed.

Perspectives of the Technological Pedagogical Environment and Teaching Adaptation in Times of Pandemic in Ecuador. Retrospective Study

The purpose of this research is to know the perspectives of the technological pedagogical environment and teaching adaptation in times of pandemic in Ecuador regarding online education within the framework of the health emergency within Ecuadorian middle-level institutions; since, current education represents a methodological challenge characterized by digital tools during teaching, and processes that have abruptly modified the space and forms of teaching. Therefore, the retrospective level study assisted by case study methodology used as data collection techniques, questionnaires applied to the selected sample, made up of volunteer high school teachers, whose responses were stored through the Google Forms platform, in categories that detected quantitative and qualitative perception indicators. In this sense, teachers consider that, in this modality, the workload entails greater dedication time and the speed of content advancement is affected by the short synchronous interaction times. Consequently, teacher perception indicates a drastic change and little flexibility for the development of their digital skills or accessibility to resources that provide an adequate space for virtual education, thus highlighting their preference for in-person work.

Об опыте разработки адаптивного гибридного фильтра ЭЭГ сигнала с адаптивностью по расширенной информации

&lt;p&gt;This article discusses the development of a hybrid EEG signal filter based on independent component analysis (ICA) and wavelet transform. The purpose of the filter is to remove artifacts from EEG signals caused by physiological processes that can be identified by synchronous time series data. The article describes the algorithm and justifies the suitability of the method for the task. Empirical results from real experimental studies are also presented.&lt;/p&gt;

Analysis of Double-Ended Guillotine Break Accident of Surge Line in ACP100 Based on Coupling Method: Development and Validation of the Coupling Method

The ACP100 is a small modular reactor (SMR) designed and built in China, featuring an integrated primary loop and passive safety systems. In SMRs, the interaction between the reactor coolant system, containment vessel, and other systems is highly interdependent. Therefore, it is necessary to use high-precision analysis codes, which can be achieved by coupling multiple codes. This paper is the first part of a study which investigates the LOCA in the ACP100 using a coupled platform. In this paper, a coupling platform was developed for transient analysis of SMR accidents, based on the system code NUSOL-SYS and the Integrated Severe Accident Analysis (ISAA) code. An inter-process communication module was developed adopting shared memory and event objects to exchange data between the two codes. A coupling interface defining the data to be exchanged was proposed. Both NUSOL-SYS and ISAA were modified to perform synchronous time step control. The coupling platform were validated through a hypothetical scenario and Edwards’ pipe blowdown experiment, demonstrating exact consistency and high accuracy. This coupling platform offers a new method for SMR accident analysis, providing a foundation for future work.