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

作者： Gao, Xianming Wang, Baosheng Wang, Xu An Zhang, Xiaozhe School of Computer National University of Defense Technology Changsha410073 China Key Laboratory of Network and Information Security Engineering University of CAPF Xi'an710086 China

In traditional router, it usually consists of forwarding element (FE) and control element (CE). However, there is a tight coupling between FE model and logical functions, thus restricting service innovation and user customized ability. In this context, we explore the insightful prospect of functional integration between logical function-based FE model and strategy-driven FE model to propose a new FE model. In this paper, we firstly propose an idea of FE-Brick model for next-generation router architecture, which includes two types of elements: logical function-based FE (LFFE) and strategy-driven FE (SFE). LFFE is a collection of logical functions, which is the same as FE model in traditional routers;and SFE uses flow-strategy to determine forwarding behavior of each packet. FE model can be regarded as a cluster of SFEs and LFFEs, where these elements are optionally interconnected in the similar way as the "building block" game. At last, we establish two demos on FE-Brick model and further evaluate their performance. © 2015 World Scientific Publishing Company.

关键词： Brick

来源：评论

学校读者我要写书评

暂无评论

Carriers Selection for Content Dissemination in Social Opportunistic networks

Carriers Selection for Content Dissemination in Social Oppor...

引用

International Conference on Collaborative Computing: networking, Applications and Worksharing (CollaborateCom)

作者： Yongqiang Dong Wang Yang Taieb Znati Key Laboratory of Computer Network and Information Integration Southeast University Nanjing China Department of Computer Science School of Arts and Sciences Pittsburgh PA USA

Content dissemination in social opportunistic networks has attracted great interests in the field. Most of the researches in literature focused on the data forwarding and routing mechanisms in such network scenarios. There were few studies on the assignment of content originators. This paper is concerned about how to identify a small subset of users as content carriers through which the content can be disseminated more efficiently. The problem is modeled as a dominating set problem in bipartite graph, in which a minimum number of carriers are selected to cover all the venues with required probability, by using available location affinity information. The NP-complete property of the problem is pointed out, along with an exact exponential exhaustive algorithm. Then three polynomial heuristic algorithms are presented to solve the venue coverage problem. Among them, the adaptive metric-based algorithm chooses carriers based on dynamically calculated metric values. Several user-centric and expected contribution based metrics are discussed and examined. The submodular algorithm selects carriers greedily based on the estimation of marginal coverage gain from each user. The reduced-union algorithm asks each venue to select a candidate set separately based on its own individual affinity information. Then the candidate union set is reduced gradually by reasonable greedy method. Synthetized data and real trace experiment results show that the submodular algorithm can be applied in scenarios where coverage threshold is low and small number of carriers is required. In most cases we can rely on metric-based algorithm to solve the carriers selection problem. Among all the metrics, total affinity and proportional contribution perform more valuable than other metrics. Meanwhile, the adaptive operation in metric-based algorithm plays more important role than the metrics in seeking the most qualified carriers. When complete affinity information is not available, the reduced-union algo

关键词： Bipartite graph Algorithm design and analysis Routing Heuristic algorithms Delays network topology

来源：评论

学校读者我要写书评

暂无评论

Semantic analysis and retrieval of spatial data based on the uncertain ontology model in Digital Earth

引用

International Journal of Digital Earth 2015年第1期8卷 3-16页

作者： Shengtao Sun Lizhe Wang Rajiv Ranjan Aizhi Wu The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and EngineeringYanshan UniversityQinhuangdaoChina Institute of Remote Sensing and Digital Earth Chinese Academy of SciencesBeijingChina Computational Informatics CSIROCanberraACTAustralia College of Vehicles and Energy Yanshan UniversityQinhuangdaoChina

Metadata are the information about and description of *** Digital Earth,metadata become variant and heterogeneous with many *** paper studies uncertain features in the generation and application of metadata,and two types of uncertainties(incomplete and imprecise)are described based on semantic quantitative measurement method semantic relationship quantitative measurement based on possibilistic logic and probability statistic(SRQ-PP).Moreover,in the case study,we apply two types of quantitative measurements based on SRQ-PP to describe incomplete(uncertain)knowledge and imprecise(vague)information separately in spatial data service retrieval,which in turn is helpful to identify additional potential data resources and provide a quantitative analysis of the results.

关键词： metadata semantic ontology uncertainty measurement spatial data digital earth

来源：评论

学校读者我要写书评

暂无评论

Gradient Compared lp-LMS Algorithms for Sparse System Identification

Gradient Compared lp-LMS Algorithms for Sparse System Identi...

引用

第27届中国控制与决策会议

作者： Yong Feng Jiasong Wu Rui Zeng Limin Luo Huazhong Shu School of Biological Science and Medical Engineering Southeast University Laboratory of Image Science and Technology the Key Laboratory of Computer Network and Information IntegrationSoutheast University

ISBN: (纸本)9781479970186

In this paper,we propose two novel p-norm penalty least mean square（l-LMS） algorithms as supplements of the conventional l-LMS algorithm established for sparse adaptive filtering recently.A gradient comparator is employed to selectively apply the zero attractor of p-norm constraint for only those taps that have the same polarity as that of the gradient of the squared instantaneous error,which leads to the new proposed gradient compared p-norm constraint LMS algorithm（lGC-LMS）.We explain that the lGC-LMS can achieve lower mean square error than the standard l-LMS algorithm theoretically and *** further improve the performance of the filter,the lNGC-LMS algorithm is derived using a new gradient comparator which takes the sign-smoothed version of the previous *** performance of the l NGC-LMS is superior to that of the lGC-LMS in theory and in ***,these two comparators can be easily applied to other norm constraint LMS algorithms to derive some new approaches for sparse adaptive *** numerical simulation results show that the two proposed algorithms achieve better performance than the standard LMS algorithm and l-LMS algorithm in terms of convergence rate and steady-state behavior in sparse system identification settings.

关键词： Least Mean Square Algorithm p Norm Constraint Sparse System Identification New Gradient Comparator

来源：评论

学校读者我要写书评

暂无评论

Critical node measuring method improved based on pagerank and betweenness

引用

ICIC Express Letters, Part B: Applications 2016年第11期7卷 2381-2387页

作者： Wang, Lei Dong, Jun Ren, Jiadong College of Information Science and Engineering Yanshan University No. 438 Hebei Ave. Qinhuangdao066004 China The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province No. 438 Hebei Ave. Qinhuangdao066004 China E&A College Hebei Normal University of Science and Technology No. 360 Hebei Ave. Qinhuangdao066004 China

In software execution network, PageRank and betweenness methods are used to determine the importance of nodes. The experiment results show that the differences between nodes are not strong and cannot reflect the software nodes’ importance degree. In order to solve this problem, this paper adds the entropy weight method to the calculation of node weights, and puts the weights of nodes into the computing of two measuring methods above. Finally, we get the ranking result of nodes’ importance which means we can find out the critical nodes from top ones. Experimental results indicate that the method is efficient for critical node measuring. © 2016 ICIC International.

关键词： Surveying

来源：评论

学校读者我要写书评

暂无评论

Virtual brain surgery simulation system based on haptic interaction

引用

High Technology Letters 2015年第2期21卷 185-191页

作者：张小瑞 Zhu Jiandong Sun Wei Norman I.Badler Song Aiguo Niu Jianwei Liu Jia School of Computer and Software Nanjing University of Information Science & Technology Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology School of Information and Control Nanjing University of Information Science & Technology School of Engineering and Applied Science University of Pennsylvania School of Instrument Science and Engineering Southeast University State key Laboratory of Virtual Reality Technology and Systems Beihang University

To improve the accuracy and interactivity of soft tissue delormatlon simulation, a new plate spring model based on physics is proposed. The model is parameterized and thus can be adapted to simulate different organs. Different soft tissues are modeled by changing the width, number of pieces, thickness, and length of a single plate spring. In this paper, the structural design, calcula- tion of soft tissue deformation and real-time feedback operations of our system are also introduced. To evaluate the feasibility of the system and validate the model, an experimental system of haptic in- teraction, in which users can use virtual hands to pull virtual brain tissues, is built using PHANTOM OMNI devices. Experimental results show that the proposed system is stable, accurate and promising for modeling instantaneous soft tissue deformation.

关键词： haptic feedback human-computer interaction surgery simulation soft tissue deformation

来源：评论

学校读者我要写书评

暂无评论

Research on privacy protection of WHOIS information in DNS 6

Research on privacy protection of WHOIS information in DNS

引用

6th FTRA International Conference on computer Science and its Applications, CSA 2014

作者： Zhang, Wei Wang, Wei Zhang, Xinchang Shi, Huiling Shandong Provincial Key Laboratory of Computer Networks Shandong Computer Science Center National Supercomputer Center in Jinan Jinan250000 China DNSLAB China Internet Network Information Center Beijing100190 China

ISBN: (纸本)9783662454015

WHOIS service allows people to ask the current registrant some Internet resources. WHOIS service has become an indispensable information service in the DNS. Unfortunately, WHOIS information is often available by the malicious third party. In this paper, we first analyzed the whole process of the WHOIS protocol. And then the process of the WHOIS privacy collection is analyzed through the clustering method. Several methods of protection of the WHOIS privacy are proposed in this paper. Through the experimental results it can be seen that the protection method can better protect the privacy of WHOIS information in DNS. © Springer-Verlag Berlin Heidelberg 2015.

关键词： information services

来源：评论

学校读者我要写书评

暂无评论

Conditional privacy-protection remote user authentication mechanism for WBAN

引用

Tongxin Xuebao/Journal on Communications 2016年 37卷 63-71页

作者： Cao, Jin Zheng, Yi-Qing Li, Hui State Key Laboratory of Integrated Services Networks School of Cyber Engineering Xidian University Xi'an710126 China Shaanxi Key Laboratory of Computer Network School of Electronic and Information Engineering Xi'an Jiaotong University Xi'an710049 China

A conditional privacy-protection remote user authentication scheme based on a certificateless group signature was proposed, which can accomplish the anonymous mutual authentication between the user and the remote doctors. In addition, when the doctors perceived that users were in case of an emergency, the mechanism enabled the only group manager (GM) to expose the real identity information of users and given users timely assistance. The scheme can provide the anonymity, traceability, mutual authentication, non-reputation and some other security features. The performance analysis results show the scheme is more suitable for WBAN. © 2016, Editorial Board of Journal on Communications. All right reserved.

关键词： Wireless local area networks (WLAN)

来源：评论

学校读者我要写书评

暂无评论

Enhancing binary relevance for multi-label learning with controlled label correlations exploitation

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2014年 8862卷 91-103页

作者： Li, Yu-Kun Zhang, Min-Ling School of Computer Science and Engineering Southeast University China Key Laboratory of Computer Network and Information Integration Southeast University China

Binary relevance (BR) is regarded as the most intuitive solution to learn from multi-label data, which decomposes the multi-label learning task into a number of independent binary learning tasks (one per class label). To amend its potential weakness of ignoring label correlations, many correlation-enabling extensions to BR have been proposed based on two major strategies, i.e. assuming random correlations with chaining structure or taking full-order correlations with stacking structure. However, in both strategies label correlations are only exploited in an uncontrolled manner, which may be problematic when error-prone and uncorrelated class labels arise. In this paper, to fulfill controlled label correlations exploitation, a novel enhancement to BR is proposed based on a two-stage filtering procedure. In the first stage, error-prone class labels are pruned from the label space based on holdout validation. In the second stage, closely-related class labels are identified based on supervised feature selection by viewing unpruned labels as features. Extensive experiments across fourteen multi-label data sets confirm the superiority of controlled label correlations exploitation, especially when large number class labels exist in the label space. © Springer International Publishing Switzerland 2014.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Soft information assisted phase noise estimation in vector OFDM using linear MMSE receivers 19

Soft information assisted phase noise estimation in vector O...

引用

19th International ITG Workshop on Smart Antennas, WSA 2015

作者： Ngebani, Ibo Li, Yabo Xia, Xiang-Gen Zhao, Minjian Chuma, Joseph Cai, Yunlong Department of Information Science and Electrical Engineering Zhejiang Provincial Key Laboratory of Information Network Technology Zhejiang University Hangzhou Zhejiang China Department of Electrical and Computer Engineering University of Delaware NewarkDE19716 United States

ISBN: (纸本)9783800736621

Vector orthogonal frequency division multiplexing (V-OFDM) for single transmit antenna systems is a generalization of OFDM where single-carrier frequency domain equalization (SC-FDE) and OFDM are just two special cases. Phase noise in a V-OFDM system leads to a common vector block phase error (CVBPE) as well as an inter vector block carrier interference (IVBCI) effect. Severe performance degradation results if these two effects are not estimated and compensated for. In this paper blind and semi-blind phase noise estimation and compensation in a V-OFDM system is investigated by using the expectation maximization (EM) algorithm. This is motivated by the fact that conventional frequency domain phase noise suppression schemes based on pilot-aided CVBPE estimation and compensation are not spectrally efficient as the vector block size is increased. Two novel algorithms are proposed, one estimates the CVBPE only and the other estimates the entire phase noise sequence in the time-domain. Simulations show that with the proposed algorithms V-OFDM can outperform OFDM system with conventional data aided or soft information aided phase noise CPE correction. © VDE Verlag GMBH · Berlin · Offenbach, Germany.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：