检索结果-内蒙古大学图书馆

Turbulence mitigation scheme based on multiple-user detection in an orbital-angular-momentum multiplexed system

Chinese Physics B 2016年第11期25卷 316-323页

作者：邹丽王乐赵生妹陈汉武 Institute of Signal Processing and Transmission Nanjing University of Posts and Telecommunications School of Electronics and Information Nantong University Key Laboratory of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education Nanjing University of Posts and Telecommunications School of Computer Science and Engineering College of Software Engineering Southeast University

Atmospheric turbulence（AT） induced crosstalk can significantly impair the performance of a free-space optical（FSO）communication link using orbital angular momentum（OAM） *** this paper,we propose a multiple-user detection（MUD） turbulence mitigation scheme in an OAM-multiplexed FSO communication ***,we present a MUD equivalent communication model for an OAM-multiplexed FSO communication link under *** the equivalent model,each input bit stream represents one user＇s *** deformed OAM spatial modes caused by AT,instead of the pure OAM spatial modes,are used as information carriers,and the overlapping between the deformed OAM spatial modes are computed as the correlation coefficients between the ***,we present a turbulence mitigation scheme based on MUD idea to enhance AT tolerance of the OAM-multiplexed FSO communication *** the proposed scheme,the crosstalk caused by AT is used as a useful component to deduce users＇ *** numerical results show that the performance of the OAM-multiplexed communication link has greatly improved by the proposed *** the turbulence strength C_n^2 is 1 × 10^（-15） m^（-2/3）,the transmission distance is 1000 m and the channel signal-to-noise ratio（SNR）is 26 dB,the bit-error-rate（BER） performance of four spatial multiplexed OAM modes l_m = ＋ 1,＋2,＋3,＋4 are all close to 10-5,and there is a 2-3 fold increase in the BER performance in comparison with those results without the proposed *** addition,the proposed scheme is more effective for an OAM-multiplexed FSO communication link with a larger OAM mode topological charge *** proposed scheme is a promising direction for compensating the interference caused by AT in the OAM-multiplexed FSO communication link.

关键词： turbulence mitigation momentum angular deformed crosstalk topological multiplexing orbital turbulent

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of Not So Cooperative Caching System

引用

China Communications 2015年第7期12卷 31-46页

作者： HU Xiaoyan GONG Jian CHENG Guang ZHANG Weiwei Ahmad Jakalan School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education

Not So Cooperative Caching(NSCC) considers a network comprised of selfish nodes; each is with caching capability and an objective of reducing its own access cost by fetching data from its local cache or from neighboring caches. These nodes would cooperate in caching and share cached content if and only if they each benefit. The challenges are to determine what objects to cache at each node and to implement the system in the context of information Centric networking(ICN). This work includes both a solution for the NSCC problem and a design and implementation of an NSCC system in Named Data networking(NDN), a large effort that exemplifies ICN. Our design applies NDN synchronization protocol to facilitate the information exchange among nodes, adopts group key encryption to control data access within the NSCC group, and offers an error checker to detect error events in the system. Our approach is validated by deploying the system we developed on Planet Lab.

关键词： named data networking content caching selfish caches synchronization group rekeying error checker game theory

来源：评论

学校读者我要写书评

暂无评论

Progress in Command and Control Server Finding Schemes of Botnet

Progress in Command and Control Server Finding Schemes of Bo...

引用

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

作者： Xiaojun Guo Guang Cheng Yifei Hu Mian Dai Southeast University Nanjing Jiangsu CN Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China

ISBN: (纸本)9781509032068

Botnets have become one of the most serious threats to current Internet and future network security. Only finding and connecting command and control(C&C) servers can bots join and work for botnet, hence how to find C&C servers is critical to botnet management and running. In this paper, we preliminarily summarize and classify the currently typical C&C server finding schemes as three types: dedicated IP address, Internet infrastructure and third-party application/service from a new perspective. And we compare these three types on four aspects. It's seen that third type presents better than other two types on complexity, flexibility, traffic covertness and scale.

关键词： Servers IP networks Internet Complexity theory Malware Feature extraction Mobile communication

来源：评论

学校读者我要写书评

暂无评论

Global burden of 369 diseases and injuries in 204 countries and territories, 1990–2019: a systematic analysis for the Global Burden of Disease Study 2019

引用

The Lancet 2020年第10258期396卷 1204-1222页

作者： Abbafati, Cristiana Abbas, Kaja M. Abbasi, Mohammad Abbasifard, Mitra Abbasi-Kangevari, Mohsen Abbastabar, Hedayat Abd-Allah, Foad Abdelalim, Ahmed Abdollahi, Mohammad Abdollahpour, Ibrahim Abedi, Aidin Abedi, Parisa Abegaz, Kedir Hussein Abolhassani, Hassan Abosetugn, Akine Eshete Aboyans, Victor Abrams, Elissa M. Abreu, Lucas Guimarães Abrigo, Michael R.M. Abu Haimed, Abdulaziz Khalid Abualhasan, Ahmed Abu-Gharbieh, Eman Abu-Raddad, Laith Jamal Abushouk, Abdelrahman I. Acebedo, Alyssa Ackerman, Ilana N. Adabi, Maryam Adair, Tim Adamu, Abdu A. Adebayo, Oladimeji M. Adedeji, Isaac Akinkunmi Adekanmbi, Victor Adelson, Jaimie D. Adeoye, Abiodun Moshood Adetokunboh, Olatunji O. Adham, Davoud Advani, Shailesh M. Afarideh, Mohsen Afshari, Mahdi Afshin, Ashkan Agardh, Emilie E. Agarwal, Gina Agasthi, Pradyumna Agesa, Kareha M. Aghaali, Mohammad Aghamir, Seyed Mohammad Kazem Agrawal, Anurag Ahmad, Tauseef Ahmadi, Alireza Ahmadi, Keivan Ahmadi, Mehdi Ahmadieh, Hamid Ahmadpour, Ehsan Ahmed, Muktar Beshir Aji, Budi Akalu, Temesgen Yihunie Akinyemi, Rufus Olusola Akinyemiju, Tomi Akombi, Blessing Akunna, Chisom Joyqueenet Alahdab, Fares Al-Aly, Ziyad Alam, Khurshid Alam, Noore Alam, Samiah Alam, Tahiya Alanezi, Fahad Mashhour Alanzi, Turki M. Albertson, Samuel B. Alcalde-Rabanal, Jacqueline Elizabeth Alema, Niguse Meles Alemu, Biresaw Wassihun Alemu, Yihun Mulugeta Alhabib, Khalid F. Alhassan, Robert Kaba Ali, Muhammad Ali, Saqib Alicandro, Gianfranco Alijanzadeh, Mehran Alinia, Cyrus Alipour, Vahid Alizade, Hesam Aljunid, Syed Mohamed Alla, François Allebeck, Peter Almadi, Majid Abdulrahman Hamad Almasi, Ali Almasi-Hashiani, Amir Almasri, Nihad A. Al-Mekhlafi, Hesham M. Almulhim, Abdulaziz M. Alonso, Jordi Al-Raddadi, Rajaa M. Altirkawi, Khalid A. Alumran, Arwa Khalid Alvis-Guzman, Nelson Alvis-Zakzuk, Nelson J. Amare, Azmeraw T. Amare, Bekalu Amini, Saeed Amini-Rarani, Mostafa Aminorroaya, Arya Amiri, Fatemeh Amit, Arianna Maever L. Amugsi, Dickson A. Amul, Gianna Gayle Herrera Anbesu, Etsay Woldu Ancuceanu, Robert Anderl Department of Juridical and Economic Studies La Sapienza University Rome Italy Department of Infectious Disease Epidemiology London School of Hygiene and Tropical Medicine London United Kingdom Social Determinants of Health Research Center Tehran Iran Department of Neurology Cairo University Cairo Egypt School of Pharmacy Tehran Iran The Institute of Pharmaceutical Sciences (TIPS) Tehran Iran Neuroscience Research Center Isfahan University of Medical Sciences Isfahan Iran Biostatistics Department Near East University Nicosia Cyprus Biostatistics and Health Informatics Madda Walabu University Bale Robe Ethiopia Research Center for Immunodeficiencies Tehran Iran Karolinska University Hospital Huddinge Sweden Department of Cardiology Dupuytren University Hospital Limoges France University of Limoges Limoges France Department of Pediatric Dentistry Federal University of Minas Gerais Belo Horizonte Brazil Department of Research Philippine Institute for Development Studies Quezon City Philippines Department of Healthcare Policy and Research Weill Cornell Medical College in Qatar Doha Qatar Harvard Medical School Boston MA United States Department of Medicine Ain Shams University Cairo Egypt Hamadan University of Medical Sciences Hamadan Iran School of Medicine Cardiff University Cardiff United Kingdom School of Laboratory Medicine and Science University College Hospital Ibadan Ibadan Nigeria Institute of Cardiovascular Diseases University of Ibadan Ibadan Nigeria Centre of Excellence for Epidemiological Modelling and Analysis Stellenbosch University Cape Town South Africa Department of Global Health Stellenbosch University Cape Town South Africa School of Health Ardabil University of Medical Science Ardabil Iran Social Behavioral Research Branch National Institute of Health Bethesda MD United States Department of Oncology Georgetown University Washington DC DC United States Department of Health Metrics Sciences School of Medicine Seattle WA

Background: In an era of shifting global agendas and expanded emphasis on non-communicable diseases and injuries along with communicable diseases, sound evidence on trends by cause at the national level is essential. The Global Burden of Diseases, Injuries, and Risk Factors Study (GBD) provides a systematic scientific assessment of published, publicly available, and contributed data on incidence, prevalence, and mortality for a mutually exclusive and collectively exhaustive list of diseases and injuries. Methods: GBD estimates incidence, prevalence, mortality, years of life lost (YLLs), years lived with disability (YLDs), and disability-adjusted life-years (DALYs) due to 369 diseases and injuries, for two sexes, and for 204 countries and territories. Input data were extracted from censuses, household surveys, civil registration and vital statistics, disease registries, health service use, air pollution monitors, satellite imaging, disease notifications, and other sources. Cause-specific death rates and cause fractions were calculated using the Cause of Death Ensemble model and spatiotemporal Gaussian process regression. Cause-specific deaths were adjusted to match the total all-cause deaths calculated as part of the GBD population, fertility, and mortality estimates. Deaths were multiplied by standard life expectancy at each age to calculate YLLs. A Bayesian meta-regression modelling tool, DisMod-MR 2.1, was used to ensure consistency between incidence, prevalence, remission, excess mortality, and cause-specific mortality for most causes. Prevalence estimates were multiplied by disability weights for mutually exclusive sequelae of diseases and injuries to calculate YLDs. We considered results in the context of the Socio-demographic Index (SDI), a composite indicator of income per capita, years of schooling, and fertility rate in females younger than 25 years. Uncertainty intervals (UIs) were generated for every metric using the 25th and 975th ordered 1000 draw value

关键词：

来源：评论

学校读者我要写书评

暂无评论

引用

International Journal of Communications, network and System Sciences 2016年第5期9卷 168-176页

作者： Yongdong Hu Guoxin Wu School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China College of Information Science and Technology Nanjing Forestry University Nanjing China

Modelling WiMAX network traffic based on the self-similarity character is better than the traditional model based on the Poisson process, because the former can provide more accurate calculation for effective bandwidth. In this paper we propose a WiMAX network traffic model based on M/Pareto model to describe its self-similarity character. Then we deduce the average transmission rate and the variance coefficient for the FBM traffic model by the M/Pareto model, and get the Hurst parameter of the FBM traffic model by statistical analysis method. By the FBM traffic model we get a formula for calculating the effective bandwidth. Accordingly, we propose a modified self-similar call admission control algorithm (SS-CAC). SS-CAC can avoid measuring the parameter values of FBM traffic flow to do call admission control. Simulation results show that SS-CAC greatly reduces the call blocking rate and improves the bandwidth utilization.

关键词： WiMAX CAC Self-Similar Effective Bandwidth QoS

来源：评论

学校读者我要写书评

暂无评论

network-Interconnection-Oriented: a Scalable Routing Service Model

Network-Interconnection-Oriented: a Scalable Routing Service...

引用

IEEE International Conference on High Performance Computing and Communications

作者： Yi Wan Jun Shen Tao Han Zu-Qin Ji MOE Key Laboratory of Computer Network and Information Integration School of Computer Science and Engineering Southeast University Nanjing 210096 China

ISBN: (纸本)9781509042982

Aimed at improving poor performance of current network routing service in the way of scalability, a new scalable routing service model (SRSM) is proposed based on the core of network interconnection and principles of modern packet switching. Three basic elements, which are addressing mode, routing table and routing algorithm, are abstracted to establish Meta model (SRSM) of routing service and realize typification of routing service models. Thus enhancing the abstraction level of routing service model can make it more flexible and scalable. Furthermore, the scalability of SRSM is resolving through contrasting routing service model instances of IP network, CDN (Content Delivery network) and NDN (Named Data networking). Finally, the related experiments of named routing service model instances and IP routing service model instances based on SRSM are provided to verify the feasibility and scalability of SRSM.

关键词： New network service model network routing service Scalability of service network interconnection network architecture

来源：评论

学校读者我要写书评

暂无评论

Deep Age Distribution Learning for Apparent Age Estimation

Deep Age Distribution Learning for Apparent Age Estimation

引用

IEEE computer Society Conference on computer Vision and Pattern Recognition Workshops (CVPRW)

作者： Zengwei Huo Xu Yang Chao Xing Ying Zhou Peng Hou Jiaqi Lv Xin Geng Key Lab of Computer Network and Information Integration (Ministry of Education) Southeast University Nanjing China

Apparent age estimation has attracted more and more researchers since its potential applications in the real world. Apparent age estimation differs from chronological age estimation that in apparent age estimation each facial image is labelled by multiple individuals, the mean age is the ground truth age and the uncertainty is introduced by the standard deviation. In this paper, we propose a novel method called Deep Age Distribution Learning(DADL) to deal with such situation. According to the given mean age and the standard deviation, we generate a Gaussian age distribution for each facial image as the training target instead of the single age. DADL first detects the facial region in image and aligns the facial image. Then, it uses deep Convolutional Neural network(CNN) pre-trained based on the VGGFace and fine-tuned on the age dataset to extract the predicted age distribution. Finally it uses ensemble method to get the result. Our DADL method got a good performance in ChaLearn Looking at People 2016-Track 1: Age Estimation and ranked the 2nd place among 105 registered participants.

关键词： Estimation Training Standards Face Predictive models Uncertainty Correlation

来源：评论

学校读者我要写书评

暂无评论

A Description Method for network Architecture

A Description Method for Network Architecture

引用

IEEE International Conference on High Performance Computing and Communications

作者： Jun Shen Zuqin Ji Wen Gao Yi Wan Key Laboratory of Computer Network & Information Integration of Ministry of Education School of Computer Science & Engineering Southeast University Nanjing 210096 China

ISBN: (纸本)9781509042982

Due to lack of desired model for traditional network architecture, services which are newly deployed can't be analyzed and verified quickly or efficiently. To address this problem, this paper puts forward a description method for network architectures which includes two parts: the modeling method and the formal model. First of all, we give a modeling method from the essence of the service interactions for network architecture;secondly, on the base of the modeling method, the formal model which is a description method for network architecture is provided;finally, we provide an application case with the description method. It is verified that the description method does well in the description of the network architectures and it can satisfy the need of analyzing the deploying of new services.

关键词： Architecture Modeling Formal Method network Architecture

来源：评论

学校读者我要写书评

暂无评论

Flow Scheduling Strategies for Minimizing Flow Completion Times in information-agnostic Data Center networks

Flow Scheduling Strategies for Minimizing Flow Completion Ti...

引用

作者： Peiyi Yu Chao Hu Bo Liu Changyou Xing College of Command Information Systems PLA University of Science and Technology Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education

Minimizing the flow completion time（FCT） is widely considered as an important optimization goal in designing data center networks. However, existing schemes either rely on the precondition that the size and deadline of each flow is known in advance, or require modifying the switch hardware, which is hard to implement in practice. In this paper, we present MCPF, a flexible and dynamic flow scheduling strategy to reduce the FCT. This strategy is based on the estimated probabilities of each flow to finish the transmission in a period time, and these flows which have higher completion probabilities are assigned with higher priority. Meanwhile, switches perform flow scheduling according to these priorities. We employ a queueing theory based mathematical model to analyze the average FCT of MCPF, and compare it with other two flow scheduling strategies. We also introduce the challenges and the solutions to implement MCPF in realistic networks. Finally, we evaluate the performance of MCPF in Mininet. The analysis and experimental results show that MCPF could effectively reduce the FCT.

关键词： completion time scheduling strategy data center networks information agnostic

来源：评论

学校读者我要写书评

暂无评论

Logistic Boosting Regression for Label Distribution Learning

Logistic Boosting Regression for Label Distribution Learning

引用

IEEE Conference on computer Vision and Pattern Recognition

作者： Chao Xing Xin Geng Hui Xue Key Lab of Computer Network and Information Integration (Ministry of Education) School of Computer Science and Engineering Southeast University

ISBN: (纸本)9781467388528

Label Distribution Learning (LDL) is a general learning framework which includes both single label and multi-label learning as its special cases. One of the main assumptions made in traditional LDL algorithms is the derivation of the parametric model as the maximum entropy model. While it is a reasonable assumption without additional information, there is no particular evidence supporting it in the problem of LDL. Alternatively, using a general LDL model family to approximate this parametric model can avoid the potential influence of the specific model. In order to learn this general model family, this paper uses a method called Logistic Boosting Regression (LogitBoost) which can be seen as an additive weighted function regression from the statistical viewpoint. For each step, we can fit individual weighted regression function (base learner) to realize the optimization gradually. The base learners are chosen as weighted regression tree and vector tree, which constitute two algorithms named LDLogitBoost and AOSO-LDLogitBoost in this paper. Experiments on facial expression recognition, crowd opinion prediction on movies and apparent age estimation show that LDLogitBoost and AOSO-LDLogitBoost can achieve better performance than traditional LDL algorithms as well as other LogitBoost algorithms.

关键词： Low-Density Lipoproteins Maximum entropy Regression (Psychology) Accelerated aging Cinema Boost Parametric statistics derivation extra message

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：