Search results for "Complexity"
showing 10 items of 1094 documents
WarpDrive: Massively Parallel Hashing on Multi-GPU Nodes
2018
Hash maps are among the most versatile data structures in computer science because of their compact data layout and expected constant time complexity for insertion and querying. However, associated memory access patterns during the probing phase are highly irregular resulting in strongly memory-bound implementations. Massively parallel accelerators such as CUDA-enabled GPUs may overcome this limitation by virtue of their fast video memory featuring almost one TB/s bandwidth in comparison to main memory modules of state-of-the-art CPUs with less than 100 GB/s. Unfortunately, the size of hash maps supported by existing single-GPU hashing implementations is restricted by the limited amount of …
Torus Topology based Fault-Tolerant Network-on-Chip Design with Flexible Spare Core Placement
2018
The increase in the density of the IP cores being fabricated on a chip poses on-chip communication challenges and heat dissipation. To overcome these issues, Network-onChip (NoC) based communication architecture is introduced. In the nanoscale era NoCs are prone to faults which results in performance degradation and un-reliability. Hence efficient fault-tolerant methods are required to make the system reliable in contrast to diverse component failures. This paper presents a flexible spare core placement in torus topology based faulttolerant NoC design. The communications related to the failed core is taken care by selecting the best position for a spare core in the torus network. By conside…
A validity and reliability study of Conditional Entropy Measures of Pulse Rate Variability
2019
In this work, we present the feasibility to use a simpler methodological approach for the assessment of the short-term complexity of Heart Rate Variability (HRV). Specifically, we propose to exploit Pulse Rate Variability (PRV) recorded through photoplethysmography in place of HRV measured from the ECG, and to compute complexity via a linear Gaussian approximation in place of the standard model-free methods (e.g., nearest neighbor entropy estimates) usually applied to HRV. Linear PRV-based and model-free HRV-based complexity measures were compared via statistical tests, correlation analysis and Bland-Altman plots, demonstrating an overall good agreement. These results support the applicabil…
Language complexity in on-line health information retrieval
2020
The number of people searching for on-line health information has been steadily growing over the years so it is crucial to understand their specific requirements in order to help them finding easily and quickly the specific in-formation they are looking for. Although generic search engines are typically used by health information seekers as the starting point for searching information, they have been shown to be limited and unsatisfactory because they make generic searches, often overloading the user with the provided amount of results. Moreover, they are not able to provide specific information to different types of users. At the same time, specific search engines mostly work on medical li…
District heating networks: enhancement of the efficiency
2019
International audience; During the decades the district heating's (DH) advantages (more cost-efficient heat generation and reduced air pollution) overcompensated the additional costs of transmission and distribution of the centrally produced thermal energy to consumers. Rapid increase in the efficiency of low-power heaters, development of separated low heat density areas in cities reduce the competitiveness of the large centralized DH systems in comparison with the distributed cluster-size networks and even local heating. Reduction of transmission costs, enhancement of the network efficiency by optimization of the design of the DH networks become a critical issue. The methodology for determ…
Distributed Adaptive Consensus Tracking Control of Uncertain High-order Nonlinear Systems under Directed Graph Condition
2018
In this paper, we investigate the output consensus tracking problem for a class of high-order nonlinear systems subjected to unknown parameters and uncertain external disturbances. A novel backstepping based distributed adaptive control scheme is presented under the directed communication status. For the subsystems without direct access to time-varying desired trajectory, local estimators are introduced and the corresponding adaptive laws are designed in a totally distributed fashion. With the presented scheme, the assumption on linearly parameterized reference signal and the information exchange operation of subsystem inputs in the existing results are no longer needed. It is shown that al…
Reducing the observation error in a WSN through a consensus-based subspace projection
2013
An essential process in a Wireless Sensor Network is the noise mitigation of the measured data, by exploiting their spatial correlation. A widely used technique to achieve this reduction is to project the measured data into a proper subspace. We present a low complexity and distributed algorithm to perform this projection. Unlike other algorithms existing in the literature, which require the number of connections at every node to be larger than the dimension of the involved subspace, our algorithm does not require such dense network topologies for its applicability, making it suitable for a larger number of scenarios. Our proposed algorithm is based on the execution of several consensus pro…
Distributed adaptive leader–follower and leaderless consensus control of a class of strict-feedback nonlinear systems : a unified approach
2020
In this paper, distributed adaptive consensus for a class of strict-feedback nonlinear systems under directed topology condition is investigated. Both leader–follower and leaderless cases are considered in a unified framework. To design distributed controller for each subsystem, a local compensatory variable is generated based on the signals collected from its neighbors. Such a technique enables us to solve the leader–follower consensus and leaderless consensus problems in a unified framework. And it further allows us to treat the leaderless consensus as a special case of the leader–follower consensus. For leader–follower consensus, the assumption that the leader trajectory is linearly para…
A novel clustering-based algorithm for solving spatially-constrained robotic task sequencing problems
2021
The robotic task sequencing problem (RTSP) appears in various forms across many industrial applications and consists of developing an optimal sequence of motions to visit a set of target points defined in a task space. Developing solutions to problems involving complex spatial constraints remains challenging due to the existence of multiple inverse kinematic solutions and the requirements for collision avoidance. So far existing studies have been limited to relaxed RTSPs involving a small number of target points and relatively uncluttered environments. When extending existing methods to problems involving greater spatial constraints and large sets of target points, they either require subst…
Numerical Study about the Influence of Wall Angle about Main Strains, Thickness Reduction and Forces on Single Point Incremental Forming Process
2016
Abstract The current paper aims to study, using numerical simulation, the influence of the wall angle on the single point incremental forming process. For the analysis there has been used the LS-Dyna software and three explicit dynamic analyses were run for three parts with wall angles of 450, 550 and 650. The factors taken into account are the main strains, the thickness reduction and the forces on three directions. The material data introduced into the simulation were determined based on an uniaxial traction test on an Instron 5587 testing machine and the Aramis system was used as optical extensometer.