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

3rd International Conference on Swarm Intelligence, ICSI 2012

作者： Li, Hong Zong, Yu Wang, Kunlun Wu, Buxiao Key Laboratory of Network and Intelligent Information Processing Department of Computer Science and Technology Hefei University 230001 China Department of Information and Engineering West Anhui University 237012 China

ISBN: (纸本)9783642310195

It is a significant challenge to discover knowledge from noise data. Most of previous works have focused on the data cleansing and the correction for the benefit of the subsequent mining process. When the training data contains noise, the classification accuracy was being affected dramatically. In this paper, we present a novel classification algorithm named ESC (Error-Sensitive Classification) to cover this problem. We materialize our main idea by constructing Attribute-Decision tree and measuring correlation among attributes. Experimental results show that our algorithm has ability to significantly improve the quality of data mining results. © 2012 Springer-Verlag.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

An optimal stopping strategy for opportunistic broadcast channel access

An optimal stopping strategy for opportunistic broadcast cha...

引用

IEEE International Conference on Communications (ICC)

作者： Shun Cai Sanfeng Zhang Yongqiang Dong Guoxin Wu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education South East University Nanjing China

Opportunistic routing with network coding (NCOR) has recently emerged as a promising unicast paradigm in lossy wireless multihop networks. By combining the multi-user diversity advantage of the broadcast links and the erasure-codes property of random network coding, it raises an interesting question on the broadcast channel access control algorithm, since the reliability is guaranteed by upper-layer coding and thus it is not necessary to wait for all the receivers to be ready. In this paper, we formalize it as the opportunistic broadcast channel access control problem. By appealing to the theory of optimal stopping, we develop a strategy which can balance between the access delay and instantaneous delivery ability of the broadcast link. This strategy turns out to be a threshold-based policy, which allowing fully distributed implementation. Simulation results show that the proposed strategy outperforms existing schemes significantly in terms of end to end throughput under various traffic loads.

关键词： Receivers IEEE 802.11 Standards Throughput Media Access Protocol Probes Routing

来源：评论

学校读者我要写书评

暂无评论

Estimation Packet Loss Ratios for the Two Segments of End-to-End Path on the Monitor

Estimation Packet Loss Ratios for the Two Segments of End-to...

引用

International Conference on computer Science and Service System (CSSS)

作者： Guang Cheng Zhongyao Gao School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education China

ISBN: (纸本)9781467307215

Packet loss may cause the degradation of network and application performance. This paper proposes a passive measurement method called LTS to estimate end-to-end path packet loss ratio for the two segments of the path divided by the monitor node. This method can estimate the packet loss ration of each segment and infer loss ratios based on IP headers identification field, TCP headers sequence number and packets interval. The segment estimation packet loss method can be useful to evaluate the performance of core network or internet work if the monitor is put in the border of a network. The algorithm is evaluated to use a test bed simulation measurement, and is analyzed reordering ratios and loss ratios based on the traces collected from the CERNET backbone links.

关键词： Time measurement IP networks Accuracy Monitoring

来源：评论

学校读者我要写书评

暂无评论

A memory and variable neighborhood structure based complete local search for the no-wait job shop problem

A memory and variable neighborhood structure based complete ...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Minmin Li Jie Zhu Xiaoping Li Key Laboratory of Computer Network and Information Integration of Ministry of Education School of Computer Science and Engineering South East University Nanjing China

In this paper, an effective metaheuristic is developed for the no-wait job shop problem with the objective of makespam minimization, which is strongly NP-hard. The problem is usually decomposed into a sequencing sub-problem and a timetabling one. A partial delay timetabling method is constructed by combining the "as early as possible" strategy with the "as late as possible" rule. By integratiiig the variable neighborhood structure, a new Local Search method CLMVN (Complete Local Search with Memory and Variable Neighborhood structure) is presented for the sequencing problem. Experimental results show that CLMVN outperforms CLLM (the best algorithm for the considered problem so far) on average with less computation time.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Estimating the number of active flows from sampled packets

Estimating the number of active flows from sampled packets

引用

IEEE Symposium on network Operations and Management

作者： Guang Cheng School of Computer Science and Engineering South East University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education China

A flow is active during a measurement period if it sends at least one packet. It is essential to control resource consumption in network monitoring by traffic sampling, so most high-end routers provide sampling network traffic function. The number of original flow is an important metrics to many network applications such as congestion control and network security. In this paper, we present a EUF algorithm that can accurately infer the number of original flow from the sampled packet traffic. Using the EUF algorithm, the number of unsampled flows can be estimated by an iteration method based on random sampling, and then the number of original flows can be precisely estimated according to both the number of the sampled flows and the unsampled flow. The EUF algorithm is also compared with the EM algorithm using multiple traffic traces collected from a Tier-1 ISP backbone networks. The result shows that the EUF algorithm is superior to EM and can provide highly accurate estimation on the number of the original flow.

关键词： Estimation IP networks Computational complexity Algorithm design and analysis Educational institutions Monitoring Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Extending interface automata with Z notation

Extending interface automata with Z notation

引用

4th IPM International Conference on Fundamentals of Software Engineering, FSEN 2011

作者： Cao, Zining Wang, Hui National Key Laboratory of Science and Technology on Avionics System Integration Shanghai 200233 China Department of Computer Science and Technology Nanjing University of Aero. and Astro. Nanjing 210016 China Provincial Key Laboratory for Computer Information Processing Technology Soochow University Suzhou 215006 China

In this paper, we propose a specification approach combining interface automata and Z language. This approach can be used to describe behavioural properties and data properties of software components. We also study th... 详细信息

ISBN: (纸本)9783642293191

关键词： Automata theory

来源：评论

学校读者我要写书评

暂无评论

Security Analysis of an Electronic Commerce Protocol Using Casper/FDR2

引用

Wuhan University Journal of Natural Sciences 2012年第6期17卷 499-503页

作者： CHANG Yinlong HU Huaping Department of Mathematics and Computer Science/Key Laboratory of Information Security of Network System Fuzhou UniversityFuzhou 350108FujianChina School of Computer Science National University of Defense TechnologyChangsha 410073HunanChina

Researchers have proposed several security protocols to protect the electronic commerce security in these years;however,not all of them are secure *** article extends model checking method with Casper/FDR2 to model and analyze a new electronic *** are found in the protocol and their mechanisms are discussed.A variety of solutions are given to different security *** improved protocol is proven to be robust and secure.

关键词： Casper FDR2 electronic commerce model checking formal analysis

来源：评论

学校读者我要写书评

暂无评论

Efficient and random oracle-free conditionally anonymous ring signature

Efficient and random oracle-free conditionally anonymous rin...

引用

6th International Conference on Provable Security, ProvSec 2012

作者： Zeng, Shengke Qin, Zhiguang Lu, Qing Li, Qinyi School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Network and Data Security Key Laboratory of Sichuan Province China Shanghai Key Laboratory of Integrate Administration Technologies for Information Security China

ISBN: (纸本)9783642332715

Compared to conventional ring signature schemes, conditionally anonymous ring signatures allow to revoke the anonymity of actual signer without the group manager's help if necessary. When the actual signer intends to confirm his role, it can be proved by a confirmation algorithm. In addition, any user, who is in a ring but not signer, can claim this through a disavowal algorithm. There were several proposals which were proved secure in random oracles. In other words, the security of such schemes depends on the randomness of hash functions. Recently, Zeng et al. proposed a generic construction of conditionally anonymous ring signature scheme without random oracles. Their scheme relies on NIZKs and pseudorandom functions, which render it to be inefficient. This paper proposes a practical ring signature scheme with traceability without random oracles in the common reference string model. © 2012 Springer-Verlag.

关键词： Hash functions

来源：评论

学校读者我要写书评

暂无评论

An improved clustering algorithm based on intersecting circle structure

An improved clustering algorithm based on intersecting circl...

引用

2012 IEEE 16th International Conference on computer Supported Cooperative Work in Design, CSCWD 2012

作者： Yang, Ze-Jun Wang, Ying-Long Zhao, Fu-Meng Huang, Tai-Bo Shandong Province Key Network Laboratory Shandong Computer Science Center Jinan 250014 China School of Information Science and Engineering Shandong Normal University Jinan 250014 China

ISBN: (纸本)9781467312127

A good clustering algorithm can provide the basis for forming a good network topology and target location, improve routing efficiency and greatly reduce energy consumption. For the lack of GAF algorithm, an improved algorithm is putted forward. First of all, the monitored area is divided into many sections according to the intersecting circle structure. Then the nodes which meet specific criteria will be elected as cluster heads. Finally, some nodes in overlapping area of intersecting circles will be elected as the Mid Nodes to achieve multi-hops routing. As is shown in the experiment, the improved algorithm can greatly save energy consumption of nodes, and extend the lifetime of wireless sensor networks. © 2012 IEEE.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Intrusion-resilient identity-based signature: Security definition and construction

Intrusion-resilient identity-based signature: Security defin...

引用

作者： Yu, Jia Kong, Fanyu Cheng, Xiangguo Hao, Rong Fan, Jianxi College of Information Engineering Qingdao University 266071 Qingdao China Shandong Provincial Key Laboratory of Computer Network 250014 Jinan China Institute of Network Security Shandong University 250100 Jinan China School of Computer Science and Technology Soochow University 215006 Suzhou China

Traditional identity-based signatures depend on the assumption that secret keys are absolutely secure. Once a secret key is exposed, all signatures associated with this secret key have to be reissued. Therefore, limiting the impact of key exposure in identity-based signature is an important task. In this paper, we propose to integrate the intrusion-resilient security into identity-based signatures to deal with their key exposure problem. Compared with forward-secure identity-based signatures and key-insulated identity-based signatures, our proposal can achieve higher security. The proposed scheme satisfies that signatures in any other time periods are secure even after arbitrarily many compromises of base and signer, as long as the compromises do not happen simultaneously. Furthermore, the intruder cannot generate signatures pertaining to previous time periods, even if she compromises base and signer simultaneously to get all their secret information. The scheme enjoys nice average performance. There are no cost parameters including key setup time, key extract time, base (signer) key update time, base (signer) key refresh time, signing time, verifying time, and signature size, public parameter size, base (signer) storage size having complexity more than O(log T) in terms of the total number of time periods T in this scheme. We also give the security definition of intrusion-resilient identity-based signature scheme and prove that our scheme is secure based on this security definition in the random oracle model assuming CDH problem is hard. © 2011 Elsevier Inc.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：