The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we propose a new synchronization-inspired co-clustering algorithm by dynamic simulation, called CoSync, which aims to discover biologically relevant subgroups embedding in a given gene expression data matrix. The basic idea is to view a gene expression data matrix as a dynamical system, and the weighted two-sided interactions are imposed on each element of the matrix from both aspects...
Large scale graph processing represents an interesting challenge due to the characteristics of the graph structure. Generally, a distributed graph processing framework is a better choice for large graphs with billions of edges. However, traditional iterative computation models like BSP under-perform due to large communication overheads and slow iterative convergence in a distributed environment. Here,...
A digital communications receiver requires precise symbol synchronization before the transmitted information can be recovered. Gardner's algorithm is a synchronizer that can acquire and track timing with only two samples per symbol, and it does not require prior carrier synchronization. In this paper, a feed-forward, all-digital version of Gardner's algorithm is presented. It is shown that this synchronizer...
This paper represents the heuristic algorithms for optimizing communications in parallel PGAS-programs and minimizes of its execution time. This is achieved by taking into account of hierarchical structure of computer systems while reduction. Developed algorithms are implemented for PGAS-language Cray Chapel.
Using solely the information retrieved by audio finger-printing techniques, we propose methods to treat a possibly large dataset of user-generated audio content, that (1) enable the grouping of several audio files that contain a common audio excerpt (i.e. are relative to the same event), and (2) give information about how those files are correlated in terms of time and quality inside each event. Furthermore,...
Most applications of underwater acoustic sensor networks (UASNs) rely upon accurate location information of target. However, the asynchronous clock and noise measurement characteristics of underwater environment make target localization more challenging as compared to the terrestrial sensor networks. In this paper, we design an asynchronous localization algorithm for UASNs, where the synchronous clock...
The prevalence of camera-equipped smartphones and optoelectronic displays opens up a novel framework for wireless communication-optical camera communication. With displays as transmitters and cameras as receivers, a reliable optical communication link is established. In practice, the frame synchronization between transmitters and receivers is an inevitable challenge confronted in this new communication...
In the multi-robot applications, the maintained and desired network may be destroyed by failed robots. The existing self-healing algorithms only handle with the case of single robot failure, however, multiple robot failures may cause several challenges, such as disconnected network and conflicts among repair paths. This paper presents a distributed self-healing algorithm based on 2-hop neighbor infomation...
The scale of data used in graph analytics grows at an unprecedented rate. More than ever, domain experts require efficient and parallel algorithms for tasks in graph analytics. One such task is the truss decomposition, which is a hierarchical decomposition of the edges of a graph and is closely related to the task of triangle enumeration. As evidenced by the recent GraphChallenge, existing algorithms...
The Maximal Independent Set (MIS) graph problem arises in many applications such as computer vision, information theory, molecular biology, and process scheduling. The growing scale of MIS problems suggests the use of distributed-memory hardware as a cost-effective approach to providing necessary compute and memory resources. Luby proposed four randomized algorithms to solve the MIS problem. All those...
The time and probability parameters of the two-stage synchronization algorithm for the autocompensation quantum key distribution (QKD) systems and the analogous algorithm, implying the division of the time frame into time windows, are investigated. A comparative analysis of the parameters of synchronization algorithms is carried out and recommendations for their application for short and long fiber-optic...
The increase of the quantity of user-generated content experienced in social media has boosted the importance of analysing and organising the content by its quality. Here, we propose a method that uses audio fingerprinting to organise and infer the quality of user-generated audio content. The proposed method detects the overlapping segments between different audio clips to organise and cluster the...
Real-Time VQA (Video Quality Assessment) is very important for the tracking antenna system on an analog television in the decision making related to the direction of the antenna. This paper proposes VQA system based on FIS (Fuzzy Inference System) that works in real-time to process information from analog signals on AV-Out television. The VQA system can be said to work well if the output results show...
Clock ensembles are at the core of many applications in which precise time or frequency is required. The widely used time scale algorithms need cumbersome modifications when clocks can be potentially faulty. Fault-tolerant clock synchronization algorithms from distributed systems allow to build time scales without the need of special detection systems for anomalous behavior of the clocks. We present...
Dance is an art consisting of sequences of movements. Its beauty comes from geometrically clean linearity, symmetry in movement phrasing, and balance in the rhythm. To make an industrial robot dance, synchronization of music with the dance is studied and simulated. Four basic patterns of movements are established using a modified Laban notation designed for an industrial robot. The beats of the music...
Negotiation diagrams are a model of concurrent computation akin to workflow Petri nets. Deterministic negotiation diagrams, equivalent to the much studied and used free-choice workflow Petri nets, are surprisingly amenable to verification. Soundness (a property close to deadlock-freedom) can be decided in PTIME. Further, other fundamental questions like computing summaries or the expected cost, can...
With the increasing popularity of serving and storing data in multiple data centers, we investigate the efficiency of majority quorum-based data consistency algorithms under this scenario. Because of the failure-prone nature of distributed storage systems, majority quorum-based data consistency algorithms become one of the most widely adopted approaches. In this paper, we propose the MeteorShower...
Parallel programming is becoming more and more prevalent in this era of concurrent programming. Because of the nondeterministic nature of parallel programming, it is notoriously difficult to debug concurrency bugs, moreover attempt to fix one bug may result in deadlock or other concurrency bugs. Though many static and dynamic data race detection tool is proposed in recent years, none of them is interactive...
This paper studies frame synchronization for use with the advanced communication link transmission unit format that was recently proposed for updating the telecommand synchronization and channel coding standard for space applications. With a view to improving the robustness against jamming, future satellite telecommand systems are planning to adopt direct-sequence spread spectrum modulation and advanced...
Massive co-located devices require new paradigms to allow proper network connectivity. Internet of things (IoT) is the paradigm that offers a solution for the inter-connectivity of devices, but in dense IoT networks time synchronization is a critical aspect. Further, the scalability is another crucial aspect. This paper focuses on synchronization for uncoordinated dense networks without any external...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.