Order-preserving pattern matching was first studied surprisingly recently but has already attracted much attention. For this problem we propose a space-efficient index that works well in practice despite its lack of g...
详细信息
ISBN:
(纸本)9781509067213
Order-preserving pattern matching was first studied surprisingly recently but has already attracted much attention. For this problem we propose a space-efficient index that works well in practice despite its lack of good worst-case time bounds. Our solution is based on the new approach of decomposing the indexed sequence into an order component, containing ordering information, and ad component, containing information on the absolute values. Experiments show that this approach is viable and it is the first one offering simultaneously small space usage and fast retrieval.
Atrial Fibrillation (AF) is the most common arrhythmia and it is estimated to affect 33.5 million people worldwide. AF is associated with an increased risk of mortality and morbidity, such as heart failure and stroke ...
详细信息
ISBN:
(纸本)9781509028092
Atrial Fibrillation (AF) is the most common arrhythmia and it is estimated to affect 33.5 million people worldwide. AF is associated with an increased risk of mortality and morbidity, such as heart failure and stroke and affects mostly older persons and persons with other conditions (e.g. heart failure and coronary artery disease). In order to prevent such life threatening and life quality reducing conditions it is essential to provide better algorithms, capable of being integrated in low-cost personalized health systems. This paper presents a new algorithm for AF detection, which is based on the analysis of the three physiological characteristics of AF: 1) Irregularity of heart rate and;2) Absence of P-waves and 3) Presence of fibrillatory waves. Based on these characteristics several features were extracted from 12-lead electrocardiograms (ECG) and selected according to their discrimination ability. The classification between AF and non-AF episodes was performed using a Support Vector Machine (SVM) classification model. Our results show that the identification of the fibrillatory patterns, using the proposed features, extracted from the analysis of 12-lead ECG improves the performance of the algorithm to a sensitivity of 88.5% and specificity 92.9%, when compared to our previous single-channel approach, in the same database.
In response to the current challenges of end-of-Moore scaling, a systematic analysis of the data information flows in the design-to-Manufacturing pipeline highlights opportunities for the introduction of (big) data an...
详细信息
ISBN:
(纸本)9781509066940
In response to the current challenges of end-of-Moore scaling, a systematic analysis of the data information flows in the design-to-Manufacturing pipeline highlights opportunities for the introduction of (big) data analytics and machine learning solutions. In this paper we review the eco-system components and describe the fundamental data-flows in the IC design-to-Manufacturing chain, highlighting both the well-established and functioning sub-systems, as well as the critical bottlenecks. A quantitative defmition of physical design space coverage is proposed, as the unifying abstraction available for all components of the design-to-Manufacturing flow, allowing for the construction of a computational framework where Data Analytics and Machine Learning methodologies and tools can be successfully applied. The juxtaposition of design-Technology-Co-Optimization (DTCO) with the novel paradigm of DFM-as-Search and their necessary integration in the DFM computational toolkit, clearly exemplify how the all the advanced IC nodes (14, 10, 7 and 5nm) definitely require the adoption of a new class of correlation extraction algorithms for heterogeneous data sets.
We consider how asynchronous networks of agents who imitate their highest-earning neighbors can be efficiently driven towards a desired strategy by offering payoff incentives, either uniformly or targeted to individua...
详细信息
ISBN:
(纸本)9781509028733
We consider how asynchronous networks of agents who imitate their highest-earning neighbors can be efficiently driven towards a desired strategy by offering payoff incentives, either uniformly or targeted to individuals. In particular, if for each available strategy, agents playing that strategy receive maximum payoff when their neighbors play that same strategy, we show that providing incentives to agents in a network that is at equilibrium will result in convergence to a unique equilibrium. When a uniform incentive can be offered to all agents, one can compute the optimal incentive using a binary search algorithm. When incentives can be targeted to individuals, we propose an algorithm to select which agents should be chosen based on iteratively maximizing a ratio of the number of agents who adopt the desired strategy to the payoff incentive required to get those agents to do so. Simulations demonstrate that this algorithm computes near-optimal targeted payoff incentives for a range of networks and payoff distributions in coordination games.
Over the past few years, Wireless Sensor Networks (WSNs) has grabbed a lot of attention because of their extensive variety of budding applications. The lifetime of the WSN depends on battery life of the sensor node. D...
详细信息
ISBN:
(纸本)9781509048908
Over the past few years, Wireless Sensor Networks (WSNs) has grabbed a lot of attention because of their extensive variety of budding applications. The lifetime of the WSN depends on battery life of the sensor node. Due to the limited capacity of the battery, the WSN is not able to meet present day's demands. Thus, Wireless Power Transfer (WPT) is a promising technique for charging the sensor nodes using algorithms based on Branch and Bound (B&B),having minimum computational complexity. In this paper, a hybrid algorithm is developed to facilitate WPT, combination of a Branch and Bound (B&B) and Beam Selection (BS) algorithm. In the proposed algorithm, energy is transferred to sensor nodes through dedicated energy transmitters and selected sector antenna. The developed algorithm has been simulated using 4 energy transmitters and 100 sensor nodes. Moreover the developed algorithm is compared with Power Efficient Advanced Node Clustering Hierarchical (PEANCH) Protocol. Results show that, energy utilization is linearly proportional to number of sensors in the WSN. When compared to PEANCH protocol, the lifetime of the network is increased by 33.33%. However energy consumption is decreased by 3 times, since energy is transmitted from a selected sector antenna of the scheduled energy transmitter, rather than Omni-directional antenna.
We consider a control problem in wireless multi-hop networks in which source-destination pairs desire to secure communication. Specifically, a control algorithm is proposed based on the stochastic network optimization...
详细信息
ISBN:
(纸本)9781509059355
We consider a control problem in wireless multi-hop networks in which source-destination pairs desire to secure communication. Specifically, a control algorithm is proposed based on the stochastic network optimization to maximize a global utility function, subject to end-to-end secrecy transmission and network stability. To achieve secure communication, we firstly exploit an independent randomization encoding strategy to guarantee the multi-hops secrecy transmission. Then, the control algorithm is decomposed into flow control, routing and resource allocation. Based on the control algorithm, each node makes decisions on the arrival confidential data as well as the users and links. The numerical analysis illustrates that the proposed algorithm can achieve a utility result, arbitrarily close to optimal value.
This paper presents the formulation and analysis of an output feedback dynamic average consensus algorithm, where each agent measures an output of a dynamical system subject to an unknown bounded disturbance. The obje...
详细信息
ISBN:
(纸本)9781509028733
This paper presents the formulation and analysis of an output feedback dynamic average consensus algorithm, where each agent measures an output of a dynamical system subject to an unknown bounded disturbance. The objective is to estimate the average of the states of the dynamical systems based on the local measurements and local interactions between the agents. The proposed algorithm consists of an exponentially stable local observer and a robust dynamic average consensus estimator connected in a cascade fashion. Asymptotic stability of the combined system is theoretically proved and numerically illustrated. The proposed approach is robust to initialization errors and yields zero average-consensus error without assuming known reference signal dynamics or requiring access to the time derivatives of the reference signals. Moreover, the present model assumes heterogeneous local dynamical systems and local bounds on the unknown disturbance-term.
Efficient global optimization is a popular algorithm for the optimization of expensive multimodal black-box functions. One important reason for its popularity is its theoretical foundation of global convergence. Howev...
详细信息
ISBN:
(纸本)9781538637340
Efficient global optimization is a popular algorithm for the optimization of expensive multimodal black-box functions. One important reason for its popularity is its theoretical foundation of global convergence. However, as the budgets in expensive optimization are very small, the asymptotic properties only play a minor role and the algorithm sometimes comes off badly in experimental comparisons. Many alternative variants have therefore been proposed over the years. In this work, we show experimentally that the algorithm instead has its strength in a setting where multiple optima are to be identified.
As average user load in wireless local area network (WLAN) becomes heavy, the fundamental CSMA/CA mechanism based on binary exponential backoff (BEB) in the 802.11 protocol is under stress. When a large number of user...
详细信息
ISBN:
(纸本)9781509041831
As average user load in wireless local area network (WLAN) becomes heavy, the fundamental CSMA/CA mechanism based on binary exponential backoff (BEB) in the 802.11 protocol is under stress. When a large number of users associate with WLAN, the network suffers from severe throughput deterioration and poor short-term fairness due to the inappropriate BEB algorithm. In this paper, we provide an enhanced backoff (EBO) algorithm to improve the performance of WLANs. Our main motivation is based on the observation that disjointing backoff intervals in different backoff stage can greatly reduce the collision probability. In EBO, the size of backoff interval increases by the initial value of contention window after an unsuccessful transmission, and backoff intervals in different backoff stage are disjoint. Meanwhile, to improve the short-term fairness, we slow down the decrement of contention window by resetting the contention window to initial value after.. consecutive successful transmissions. Simulation results show that EBO improves the throughput and short-term fairness effectively comparing with BEB in heavy user loaded WLANs.
We consider space transformation operators for the outer approximation of the intersection of an ellipsoid and two half-spaces by an ellipsoid of smaller volume (2d-ellipsoid). We illustrate the connection between the...
详细信息
ISBN:
(纸本)9781509062607
We consider space transformation operators for the outer approximation of the intersection of an ellipsoid and two half-spaces by an ellipsoid of smaller volume (2d-ellipsoid). We illustrate the connection between the space transformation and the anti-ravine technique in the Shor's r-algorithms. The results of computational experiments are presented.
暂无评论