Search

• This paper mainly involves three contributions compared to the previous relevant works. • First, an ETCS is adopted to improve the efficiency of data transmission when addressing the synchronization of MJNNs. • Second, the randomly occurring gain variations are fully considered. • Third, by utilizing some novel inequalities with mode-dependent matrices, some easy-to-check synchronization criteria are presented. Abstract This paper concentrates on the passive synchronization issue for Markov jump neural networks subject to randomly occurring gain variations, in which the event-triggered mechanism is employed to save the limited communication resource. Moreover, the gain variations of the controller are considered to occur in a random way, which is modeled by a Bernoulli parameter. The goal is to build a controller which ensures that the synchronization error system is stochastically stable and satisfies a passive property. By utilizing the stochastic analysis theory and convex optimization technique, some results with less conservatism are derived. Ultimately, the effectiveness and validity of the design method are illustrated by a numerical example. [ABSTRACT FROM AUTHOR]

Heterogeneous systems with CPU and GPGPU sharing the last level cache (LLC) provide viability and flexibility. However, the different programming models lead to conflicting memory layouts, which are required for best performance of different processors. Software converting that directly accesses target layout is subject to sub-optimal localities. Converting in GPGPU shared memory also incurs copying and synchronization overhead. In this paper, we analyze the memory layout requirement and propose to remap the memory layout in the shared LLC. A remap controller in LLC executes a simple program that calculates target requests from an LLC request in the source memory space. The LLC request is thus remapped to the target memory space with the generated requests. Consequently, all processors always access memory in their optimal data layouts. The locality is thus kept through all the private caches, and software remapping overhead is also eliminated. The tiled-matrix multiplication is discussed as a case study and benchmarks from Polybench/GPU and Rodinia are modified to take advantage of the LLC layout remapping. The experiment results show the average benchmark execution time is decreased to 69%. Compared with CPU software layout converting, the CPU time is decreased to 41%–73%. [ABSTRACT FROM AUTHOR]

Cluster analysis is often regarded as a pretreatment step in many data mining applications. It is an unsupervised learning method that tries to find some distributions and patterns in unlabeled data sets. Clustering algorithms have been studied for decades, but we think that none of them is all purpose. This paper presents three fast synchronization clustering algorithms based on spatial index structures, which are three improved versions of SynC algorithm in time complexity. In order to clearly describe these algorithms, it lists or introduces several concepts. After the theoretic analysis of the three FSynC algorithms, we find the time complexity can be decreased by using an R-tree index structure or by combining a multi-dimensional grid cell partitioning method with a Red-Black tree structure to construct the near neighbor point sets of all points. In the simulations, SynC algorithm is used as the comparative algorithm of three FSynC algorithms. From the simulated experiments of some artificial data sets, seven UCI data sets, and three picture data sets, we observe that the three FSynC algorithms need less time cost than SynC algorithm in many kinds of data sets. So we can say our three fast synchronization clustering algorithms can replace SynC algorithm with less time cost in many kinds of data sets. At last, it gives several solid and insightful future research suggestions. [ABSTRACT FROM AUTHOR]

State feedback control design to make the response Boolean network synchronize with the drive Boolean network is far from being solved in the literature. Motivated by this, this paper studies the feedback control design for the complete synchronization of two coupled Boolean networks with time delays. A necessary condition for the existence of a state feedback controller is derived first. Then the feedback control design procedure for the complete synchronization of two coupled Boolean networks is provided based on the necessary condition. Finally, an example is given to illustrate the proposed design procedure. [ABSTRACT FROM AUTHOR]

Data distribution via Content Delivery Networks (CDNs) is one of the most significant energy consuming sectors in the ICT area. A CDN system can be abstracted as a primary server housing the entire data set and several surrogate servers, each one caching a portion of the whole data set. We propose a new model to compute the total energy consumption of CDNs. The model is based on a hierarchical Internet representation, and includes the energy consumption needed to keep servers synchronized. We analyze the effect of synchronization and network topology on the total energy consumption of CDNs. Results reveal that increasing the number of surrogate servers reduces the transmission delay. However, this does not necessarily lead to a reduction of the total energy consumption. Furthermore, the effect of network topology and various caching strategies is described. Results show that CDN energy consumption strongly depends on the ratio between the number of content requests and content modifications, and considering a hierarchical network topology highlights slightly different energy consumption trends with respect to those of classical “flat” network representation. [ABSTRACT FROM AUTHOR]

This paper situates itself in the theory of variable length codes and of finite automata where the concepts of completeness and synchronization play a central role. In this theoretical setting, we investigate the problem of finding upper bounds to the minimal length of synchronizing words and incompletable words of a finite language X in terms of the length of the words of X . This problem is related to two well-known conjectures formulated by Černý and Restivo, respectively. In particular, if Restivo's conjecture is true, our main result provides a quadratic bound for the minimal length of a synchronizing pair of any finite synchronizing complete code with respect to the maximal length of its words. [ABSTRACT FROM AUTHOR]

This paper firstly treats of the anti-synchronization of a class of memristor-based neural networks with mixed time delays and reaction–diffusion terms. An adaptive controller is designed such that the response system can be synchronized with the drive system by utilizing Lyapunov stability theory. Furthermore, the synchronization criteria derived in this paper are associated with the time switching. In addition, the H ∞ anti-synchronization of memristive neural networks has been studied as well. Therefore, the results obtained in this paper are more general and extend the previous work. Finally, two numerical examples and their simulations are given to show the effectiveness of the obtained results. [ABSTRACT FROM AUTHOR]

With the increase of connected devices being introduced into the market each day, the Internet of Things (IoT) vision is progressively becoming a reality. This phenomenon however increases key security risks flagged by the scientific and research community and industry professionals. Devices featuring limited security capabilities are of particular concern in IoT adoption, including passive Radio Frequency Identification (RFID) tags. In response to such security limitations, several ultra-lightweight authentication protocols have been proposed, although, most of them exhibit various vulnerabilities. In this study, we evaluate the security level of recent ultra-lightweight mutual authentication protocols and show their susceptibility to replay and desynchronization attacks. Through this research, we also show that these protocols can be grouped into a generalized version of ultra-lightweight mutual authentication protocols (GUMAPs) and classify them into two categories: (i) GUMAP1, where both parties (tag and reader) maintain a history of old parameters; and (ii) GUMAP2, where only one party maintains a history of old parameters. We then establish that both groups are vulnerable to replay and desynchronization attacks. To eliminate these vulnerabilities, we propose a more secure generalized improved mutual authentication protocol (GIMAP). To address the security issues, we present a new message authentication code (MAC) function for GIMAP and prove that the new protocol can satisfy the security requirement involved in lightweight protocols. The security analysis of GIMAP is also supported by the formal security analysis, using two widely accepted approaches, namely BAN logic and the Scyther tool. [ABSTRACT FROM AUTHOR]

Abstract: This letter studies complete synchronization of two temporal Boolean networks coupled in the drive-response configuration. Necessary and sufficient conditions are provided based on the algebraic representation of Boolean networks. Moreover, the upper bound to check the criterion is given. Finally, an illustrative example shows the efficiency of the proposed results. [Copyright &y& Elsevier]

Abstract: This note addresses a controlled synchronization problem for chaotic systems involving a communication network with data packet dropout. A chaotic master system and its slave system are connected with a controller via a limited channel and data packet dropout is modeled as Bernoulli process. Then, a coder–decoder pair is designed with the controller such that the master system and the slave system are completely synchronized, not necessarily bounded for synchronization. Necessary data capacity of a channel is explicitly stated. Finally, a numerical example for the 3-double-scroll chaotic system is applied to illustrate the effectiveness of the obtained result. [Copyright &y& Elsevier]

Abstract: A Central Data Management (CDM) system based on electronic data capture (EDC) software and study specific databases is an essential component for assessment and management of large data volumes in epidemiologic studies. Conventional CDM systems using web applications for data capture depend on permanent access to a network. However, in many study settings permanent network access cannot be guaranteed, e.g. when participants/patients are visited in their homes. In such cases a different concept for data capture is needed. The utilized EDC software must be able to ensure data capture as stand-alone instance and to synchronize captured data with the server at a later point in time. This article describes the design of the mobile information capture (MInCa) system an EDC software meeting these requirements. In particular, we focus on client and server design, data synchronization, and data privacy as well as data security measures. The MInCa software has already proven its efficiency in epidemiologic studies revealing strengths and weaknesses concerning both concept and practical application which will be addressed in this article. [Copyright &y& Elsevier]

Abstract: Correlation based Minimum Spanning Tree (MST) networks are instrumental in capturing the basic workings of a system and have been accepted for use in the analysis of stock and currency exchange markets. Research in network analysis of financial markets shows that although correlations underlying MST networks capture essential information, they do not faithfully capture dynamic behavior embedded in the time series data of financial systems. We present a new Phase Synchronization (PS) based method for establishing correlations between nonlinear time series data, prior to constructing the MST. In this method, time series data generated by each entity in a system is transformed to a recurrence plot and the recurrence plots are further transformed to trajectories in phase space. For each pair of trajectories, phase synchronization (PS) is quantified based on the degree of phase locking observed. Distances for the MST are then computed as a function of the PS between each entity pair. We demonstrate the method using Thailand Baht exchange rates with 82 countries from 2004 to 2012. We further analyze and compare networks constructed using the PS method (PS-MST) and the existing cross-correlation method (CC-MST), to study the differences in market dynamics captured by these methods. [Copyright &y& Elsevier]

Abstract: Partitioned global address space (PGAS) languages combine the convenient abstraction of shared memory with the notion of affinity, extending multi-threaded programming to large-scale systems with physically distributed memory. However, in spite of their obvious advantages, PGAS languages still lack appropriate tool support for performance analysis, one of the reasons why their adoption is still in its infancy. Some of the performance problems for which tool support is needed occur at the level of the underlying one-sided communication substrate, such as the Aggregate Remote Memory Copy Interface (ARMCI). One such example is the waiting time in situations where asynchronous data transfers cannot be completed without software intervention at the target side. This is not uncommon on systems with reduced operating-system kernels such as IBM Blue Gene/P where the use of progress threads would double the number of cores necessary to run an application. In this paper, we present an extension of the Scalasca trace-analysis infrastructure aimed at the identification and quantification of progress-related waiting times at larger scales. We demonstrate its utility and scalability using a benchmark running with up to 32,768 processes. [Copyright &y& Elsevier]

• Analyze the resource management needs from the aspect of industrial development. • Proposed a new mode of S-PnSS toward the contemporary production development stage. • PnSS-CSRH gives synchronization soft & smart hardware-based solutions in PnSS mode. The rapidly changing market demands entail a modern production system to cope with ever more diversified production orders. Not only the parameters and flow of the production process, sometimes the production resources and the corresponding application systems which make production decision and control even need to be reconfigurable. Due to the inability to provide dynamically reconfigurable manufacturing resources, systems and application systems, enterprises have to sacrifice profits to narrow their business scope or take risks to purchase a large number of production resources. In any case, it has brought operational burden to enterprises. This paper systematically analyses the production management requirements of a large-scale production system in terms of both hardware (production equipment) and software (application system) which is oriented to dynamic production demands, and then proposes a production service system enabled by cloud-based smart resource hierarchy (PnSS-CSRH). The platform is based on an open resource management system and inherits the general cloud structure and the AUTOM framework. PnSS-CSRH provides industrial users with integrated and synchronization services for the software and hardware resources involved in the production process in the PnSS mode. Using the integrated service mode, PnSS-CSRH not only helps resource providers to increase the frequency of resource leases, provides customers with targeted and systemic hardware and software overall solutions, and increases the platform usage rate, which brings more benefits to the stakeholders of PnSS-CSRH. At last, the PnSS-CSRH is used to provide services to the case company to validate the effectiveness. [ABSTRACT FROM AUTHOR]