Recommendation algorithm is a kind of method in information filtering and has been widely applied on Internet. Collaborative filtering is widely used in the recommendation systems and has turned out to be successful. ...
详细信息
Background: Previous attempts to characterise the burden of chronic respiratory diseases have focused only on specific disease conditions, such as chronic obstructive pulmonary disease (COPD) or asthma. In this study,...
Background: Previous attempts to characterise the burden of chronic respiratory diseases have focused only on specific disease conditions, such as chronic obstructive pulmonary disease (COPD) or asthma. In this study, we aimed to characterise the burden of chronic respiratory diseases globally, providing a comprehensive and up-to-date analysis on geographical and time trends from 1990 to 2017. Methods: Using data from the Global Burden of Diseases, Injuries, and Risk Factors Study (GBD) 2017, we estimated the prevalence, morbidity, and mortality attributable to chronic respiratory diseases through an analysis of deaths, disability-adjusted life-years (DALYs), and years of life lost (YLL) by GBD super-region, from 1990 to 2017, stratified by age and sex. Specific diseases analysed included asthma, COPD, interstitial lung disease and pulmonary sarcoidosis, pneumoconiosis, and other chronic respiratory diseases. We also assessed the contribution of risk factors (smoking, second-hand smoke, ambient particulate matter and ozone pollution, household air pollution from solid fuels, and occupational risks) to chronic respiratory disease-attributable DALYs. Findings: In 2017, 544·9 million people (95% uncertainty interval [UI] 506·9–584·8) worldwide had a chronic respiratory disease, representing an increase of 39·8% compared with 1990. Chronic respiratory disease prevalence showed wide variability across GBD super-regions, with the highest prevalence among both males and females in high-income regions, and the lowest prevalence in sub-Saharan Africa and south Asia. The age-sex-specific prevalence of each chronic respiratory disease in 2017 was also highly variable geographically. Chronic respiratory diseases were the third leading cause of death in 2017 (7·0% [95% UI 6·8–7·2] of all deaths), behind cardiovascular diseases and neoplasms. Deaths due to chronic respiratory diseases numbered 3 914 196 (95% UI 3 790 578–4 044 819) in 2017, an increase of 18·0% since 1990, while
networks-on-Chip (NoC) has been applied widely in Chip Multi-processors (CMPs). With the development of multi processors systems, multicast communications have been commonly used in these systems. Current multicast al...
networks-on-Chip (NoC) has been applied widely in Chip Multi-processors (CMPs). With the development of multi processors systems, multicast communications have been commonly used in these systems. Current multicast algorithms may cause deadlock and suffer from long latency and low throughput. In this paper, we proposed a new multicast algorithm for mesh-based on-chip networks. This new multicast routing method reduces the latency and increases the saturation point. This routing scheme can dynamically make routing decisions based on the network conditions and the distribution of destination nodes. The simulation result, implemented under OPNET, shows that the saturation point of the proposed algorithm is higher than the efficient partition-based routing scheme LADPM [1]. The latency of our routing algorithm is about 21% and 42% smaller than LADPM when the number of the destination nodes is 8 and 4 respectively under high injection rates.
networks-on-Chip(NoC) has been applied widely in Chip Multi-processors(CMPs).With the development of multi processors systems,multicast communications have been commonly used in these *** multicast algorithms may ...
networks-on-Chip(NoC) has been applied widely in Chip Multi-processors(CMPs).With the development of multi processors systems,multicast communications have been commonly used in these *** multicast algorithms may cause deadlock and suffer from long latency and low *** this paper,we proposed a new multicast algorithm for mesh-based on-chip *** new multicast routing method reduces the latency and increases the saturation *** routing scheme can dynamically make routing decisions based on the network conditions and the distribution of destination *** simulation result,implemented under OPNET,shows that the saturation point of the proposed algorithm is higher than the efficient partition-based routing scheme LADPM[1].The latency of our routing algorithm is about 21%and 42%smaller than LADPM when the number of the destination nodes is 8 and 4 respectively under high injection rates.
BATS code is a low-complexity random linear networkcoding scheme that can achieve asymptotic bandwidth optimality for many types of networks with packet loss. In this paper, we propose a BATS code based network proto...
详细信息
ISBN:
(纸本)9781479980109
BATS code is a low-complexity random linear networkcoding scheme that can achieve asymptotic bandwidth optimality for many types of networks with packet loss. In this paper, we propose a BATS code based network protocol and evaluate the performance by real-device experiments. Our results demonstrate significant ready-to-implement gain of networkcoding over forwarding in multi-hop network transmission with packet loss. We also propose an improved protocol to handle the practical issues observed in the experiments.
Broadcast is one of the most fundamental services provided by the communication protocol for wireless sensor networks. In this paper, we design an energy-aware reliable deterministic broadcast scheduling protocol by u...
详细信息
ISBN:
(纸本)9781479974719
Broadcast is one of the most fundamental services provided by the communication protocol for wireless sensor networks. In this paper, we design an energy-aware reliable deterministic broadcast scheduling protocol by using user-irrepressible (UI) protocol sequences. Each user transmits a packet in a time slot if and only if the sequence value is equal to one. A collision occurs if two or more users transmit at the same slot. UI sequences ensure that each user can receive at least one packet error-free from each other within the sequence period. Moreover, it does not require any time synchronization among the users. In the protocol, a new construction of UI sequences is presented and a sleeping mechanism is proposed. Simulation results show that the new protocol has a significant energy saving compared with traditional UI-sequences-based schemes. In addition, the delay can in fact be reduced by employing new UI sequences instead.
Proving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an information inequality involving many random variables is difficult to be proved manually. In [1...
详细信息
Proving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an information inequality involving many random variables is difficult to be proved manually. In [1], Yeung developed a framework that uses linear programming for verifying linear information inequalities. Under this framework, this paper considers a few other problems that can be solved by using Lagrange duality and convex approximation. We will demonstrate how linear programming can be used to find an analytic proof of an information inequality. The way to find a shortest proof is explored. When a given information inequality cannot be proved, the sufficient conditions for a counterexample to disprove the information inequality are found by linear programming.
We present a new family of maximal-distance separable (MDS) array codes which can tolerate five disk failures. The encoding is based on bit-wise exclusive OR (XOR) and bit-wise cyclic shifts, and hence is amenable to ...
详细信息
ISBN:
(纸本)9781479935130
We present a new family of maximal-distance separable (MDS) array codes which can tolerate five disk failures. The encoding is based on bit-wise exclusive OR (XOR) and bit-wise cyclic shifts, and hence is amenable to practical implementation. Efficient repair method for correcting up to two disk failures is also given. The proposed coding scheme provides a larger spectrum of parameters, with comparable encoding and repairing complexities in compare with existing MDS array codes, such as the row-diagonal parity (RDP) code and the EVENODD code.
Scanning acquires status information regarding target hosts. In networks, attackers often conduct coordinated scans of the target host or network segment because such scans are efficient and stealthy. However, an algo...
详细信息
ISBN:
(纸本)9781479978731
Scanning acquires status information regarding target hosts. In networks, attackers often conduct coordinated scans of the target host or network segment because such scans are efficient and stealthy. However, an algorithm that effectively detects coordinated scans has not yet been developed. In this study, we identify a coordinated scan under a single controller during a clustering analysis of the scan sequence. This scan sequence was determined through time sequence, and the clustering analysis was based on the global characteristics of the time sequence. Simulation and test results demonstrated that the proposed algorithm can detect scans more frequently and more accurately than existing algorithms.
In this paper, Universal Kriging (UK) technology combined with Model Predictive Control (MPC) algorithm is exploited to estimate the unknown situation of oil dispersion for just one unmanned aerial vehicle (UAV) to pr...
详细信息
In this paper, Universal Kriging (UK) technology combined with Model Predictive Control (MPC) algorithm is exploited to estimate the unknown situation of oil dispersion for just one unmanned aerial vehicle (UAV) to predict and track the objective boundary automatically. The advantage of the Kriging method is that it is an optimal interpolator in the sense that the estimates are unbiased and the minimum variance is known, so that it can relatively accurately construct the environment map. In addition, the advantage of the MPC is its constraint handling capacity. These two uncorrelated technologies, however, can be combined to realize some special functions. The simulation based on an advection diffusion equation demonstrates the proposed method is feasible and effective.
暂无评论