Healthcare practitioners agree that good oral health is a critical indicator of general health and wellness of a population. The lack of access to mandatory coverage for common issues such as cavities and non-surgical...
详细信息
ISBN:
(纸本)9781538614174
Healthcare practitioners agree that good oral health is a critical indicator of general health and wellness of a population. The lack of access to mandatory coverage for common issues such as cavities and non-surgical periodontal care often lead not only to medical problems, but also to loss of productivity. This trend is especially evident for older individuals and lower-income families. This paper discusses the results of our exploration of the annual Canadian Community Health Survey (CCHS), in order to further study the interplay between socio-economic factors and oral and dental health. To this end, we present the results when applying a number of machine learning algorithms to a CCHS data mart. Our results reaffirm that individuals' levels and sources of income are strong indicators of the number of dental visits per year. In addition, we found that younger adults and youth, who usually live in larger households, visit the dentist less frequently than all other survey respondents.
Given a set of files that show a certain degree of similarity, we consider a novel problem of performing data redundancy elimination across a set of distributed worker nodes in a shared-nothing in-memory big data anal...
详细信息
ISBN:
(纸本)9781467389990
Given a set of files that show a certain degree of similarity, we consider a novel problem of performing data redundancy elimination across a set of distributed worker nodes in a shared-nothing in-memory big data analytic system. The redundancy elimination scheme is designed in a manner that is: (i) space-efficient: the total space needed to store the files is minimized and, (ii) access-isolation: data shuffling among server is also minimized. In this paper, we first show that finding an access-efficient and space optimal solution is an NP-Hard problem. Following this, we present the file partitioning algorithms that locate access-efficient solutions in an incremental manner with minimal algorithm time complexity (polynomial time). Our experimental verification on multiple data sets confirms that the proposed file partitioning solution is able to achieve compression ratio close to the optimal compression performance achieved by a centralized solution.
Many problems of interest for cyber-physical network systems can be formulated as Mixed Integer Linear Programs in which the constraints are distributed among the agents. In this paper we propose a distributed algorit...
详细信息
ISBN:
(纸本)9781509028733
Many problems of interest for cyber-physical network systems can be formulated as Mixed Integer Linear Programs in which the constraints are distributed among the agents. In this paper we propose a distributed algorithm to solve this class of optimization problems in a peer-to-peer network with no coordinator and with limited computation and communication capabilities. In the proposed algorithm, at each communication round, agents solve locally a small LP, generate suitable cutting planes, namely intersection cuts and cost-based cuts, and communicate a fixed number of active constraints, i.e., a candidate optimal basis. We prove that, if the cost is integer, the algorithm converges to the lexicographically minimal optimal solution in a finite number of communication rounds. Finally, through numerical computations, we analyze the algorithm convergence as a function of the network size.
One of the commonly known issues that contribute to performance degradation in on-chip communication is congestion, by stalling data packets and increasing average latency. The most efficient way to limit its effect i...
详细信息
ISBN:
(纸本)9781538637258
One of the commonly known issues that contribute to performance degradation in on-chip communication is congestion, by stalling data packets and increasing average latency. The most efficient way to limit its effect is through the implementation of a reliable congestion aware routing scheme, that helps select the less congested routes for packet transmission. In this paper, a novel weighted minimal fully adaptive congestion aware routing algorithm for network on chip is presented. Instead of leveraging congestion-related information along each dimension separately, the proposed scheme investigates congestion along both dimensions at once, and offers a compromise between locally and globally aware routing in mesh-based NoC. Experimental results show that the proposed algorithm outperforms its peers with regard to average network latency and throughput.
The Cardinalized probability hypothesis density(CPHD) filter based on box-particle(BP) technology can effectively enhance the tracking accuracy of numbers of the multi-target tracking. And it also solved the tracking ...
详细信息
ISBN:
(纸本)9781538635247
The Cardinalized probability hypothesis density(CPHD) filter based on box-particle(BP) technology can effectively enhance the tracking accuracy of numbers of the multi-target tracking. And it also solved the tracking problem with unknown number of targets and missing targets. Point the problems of lack of tracking accuracy and missing tracking targets in the BP-CPHD algorithm, this paper presents some detailed measures about improving tracking. Based on the particle filter theory, we found that in the process of resampling, the particle size distribution cannot be oplimized. So, in this paper, we replaced the traditional random sub sampling resampling method with the partition resampling method to improve the method of box-particle filter. Then we simulate and experiment the improved algorithm combined with CPHD filtering. The experimental results demonstrate that the improved method of tracking multi-target with the box-particle CPHD filter is more accurate than the original algorithm and the OSPA distance is smaller, so the effect of the improved tracking method is better.
Using the matrix product state (MPS) representation of the recently proposed tensor ring (TR) decompositions, in this paper we propose a TR completion algorithm, which is an alternating minimization algorithm that alt...
详细信息
ISBN:
(纸本)9781538610329
Using the matrix product state (MPS) representation of the recently proposed tensor ring (TR) decompositions, in this paper we propose a TR completion algorithm, which is an alternating minimization algorithm that alternates over the factors in the MPS representation. This development is motivated in part by the success of matrix completion algorithms that alternate over the (low-rank) factors. We propose a novel initialization method and analyze the computational complexity of the TR completion algorithm. The numerical comparison between the TR completion algorithm and the existing algorithms that employ a low rank tensor train (TT) approximation for data completion shows that our method outperforms the existing ones for a variety of real computer vision settings, and thus demonstrates the improved expressive power of tensor ring as compared to tensor train.
Matrix low rank approximation including the classical PCA and the robust PCA (RPCA) method have been applied to solve the background modeling problem in video analysis. Recently, it has been demonstrated that a specia...
详细信息
ISBN:
(纸本)9784901122160
Matrix low rank approximation including the classical PCA and the robust PCA (RPCA) method have been applied to solve the background modeling problem in video analysis. Recently, it has been demonstrated that a special weighted low rank approximation of matrices can be made robust to the outliers similar to the l(1)-norm in RPCA method. In this work, we propose a new algorithm that can speed up the existing algorithm for solving the special weighted low rank approximation and demonstrate its use in background estimation problem.
Distributed multi-hop cooperative network is a new network architecture that can solve the last mile bottleneck problem, with larger network coverage, higher reliability, higher utilization, self-conf
ISBN:
(纸本)9781467389808
Distributed multi-hop cooperative network is a new network architecture that can solve the last mile bottleneck problem, with larger network coverage, higher reliability, higher utilization, self-conf
We propose a novel F-0 estimation algorithm that initially estimates the glottal closure instants (GCIs) or pitch and then computes the corresponding fundamental frequency (F0). The proposed method eliminates the assu...
详细信息
ISBN:
(纸本)9781538615423
We propose a novel F-0 estimation algorithm that initially estimates the glottal closure instants (GCIs) or pitch and then computes the corresponding fundamental frequency (F0). The proposed method eliminates the assumption that F-0 is constant over a segment of short duration (i.e., 20-30 ms). We use our previously proposed novel filtering-based approach for GCI estimation. As the proposed method directly operates on the entire speech signal, it does not require to set the window length and thus, it is free from the problem of spectral leakage. Measuring the effectiveness of proposed F-0 estimation algorithm w.r.t. three state-of-the-art methods, namely, Yet Another algorithm for Pitch tracking (YAAPT), Speech Transformation and Representation using Adaptive Interpolation of weiGHT spectrum (STRAIGHT) and Pitch Detection algorithm (PDA), is challenging in the absence of the ground truth. Since accurate estimation of F-0 will impact the quality of converted voice in Voice Conversion (VC) task. Hence, we measure the effectiveness F-0 estimation algorithm in the application of VC task. The quality and speaker similarity of the converted voice have been evaluated using two subjective measures, namely, Mean Opinion Scores (MOS) and ABX test, respectively.
In opportunistic networks,forwarding based protocols lead to a large amount of data flow to the highly connected nodes and unfairness of the nodes’ traffic load,finally,it makes the highly connected n
ISBN:
(纸本)9781509053643;9781509053636
In opportunistic networks,forwarding based protocols lead to a large amount of data flow to the highly connected nodes and unfairness of the nodes’ traffic load,finally,it makes the highly connected n
暂无评论