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

Constructions of two-output Bent functions

Journal of Computational information Systems 2011年第12期7卷 4178-4184页

作者： Zhang, Fengrong Hu, Yupu Zhao, Yongbin Xie, Min Key Laboratory of Computer Network and Information Security Ministry of Education Xidian University Xi'an 710071 China School of Information Science and Technology Shijiazhuang Tiedao University Shijiazhuang 050043 China

Bent functions, which have the highest nonlinearity, play an important role in coding theory, sequence design and cryptography. On the basis of a given 2n-variable Maiorana-McFarland (M-M) Bent function and the 2n × 2n Orthomorphic Latin Square, we put forward a method to construct Bent functions on 2n variables. Furthermore, it is shown that an arbitrary constructed 2n-variable Bent function and the given 2n-variable Bent function can compose a two-output Bent function on 2n variables. At last, we count the number of the constructed two-output Bent functions on 2n variables. Copyright © 2011 Binary information Press.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

A self-adaptive differential evolution algorithm for binary CSPs

A self-adaptive differential evolution algorithm for binary ...

引用

作者： Fu, Hongjie Ouyang, Dantong Xu, Jiaming Key Laboratory of Symbolic Computation and Knowledge Engineering Jilin University Ministry of Education Changchun 130012 China College of Computer Science and Technology Jilin Teachers Institute of Engineering and Technology Changchun 130052 China China Internet Network Information Center Beijing 100000 China

A novel self-adaptive differential evolution (SADE) algorithm is proposed in this paper. SADE adjusts the mutation rate F and the crossover rate CR adaptively, taking account of the different distribution of population. In order to balance an individual's exploration and exploitation capability for different evolving phases, F and CR are equal to two different self-adjusted nonlinear functions. Attention is concentrated on varying F and CR dynamically with each generation evolution. SADE maintains the diversity of population and improves the global convergence ability. It also improves the efficiency and success rate and avoids the premature convergence. Simulation and comparisons based on test-sets of CSPs demonstrate the effectiveness, efficiency and robustness of the proposed algorithm. © 2011 Elsevier Ltd. All rights reserved.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

A novel effective ICI self-cancellation method

A novel effective ICI self-cancellation method

引用

54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011

作者： Wen, Miao-Wen Cheng, Xiang Wei, Xing Ai, Bo Jiao, Bing-Li School of Electronics Engineering and Computer Science Peking University Beijing 100871 China State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing 100044 China Key Laboratory of Wireless Sensor Network and Communication Shanghai Institute of Microsystem and Information Technology Chinese Academy of Sciences 865 Changning Road Shanghai 200050 China School of Information and Electronics Beijing Institute of Technology Beijing 100081 China

ISBN: (纸本)9781424492688

Orthogonal Frequency Division Multiplexing (OFDM) systems may suffer from both carrier frequency offset (CFO) and in-phase/quadrature-phase (I/Q) imbalance at the receiver front end. In this paper, a novel type of intercarrier interference (ICI) self-cancellation method using mirror mapping is proposed to combat these impairment. Based on the proposed novel method and by adopting two widely used mapping operations, we altogether derive two different mirror mapping schemes. Analysis and simulation results verify that the proposed mirror mapping schemes not only inherit the efficiency of the existing self-cancellation schemes in suppressing ICI caused by CFO but also have the ability of compressing or even eliminating IQ imbalance. © 2011 IEEE.

关键词： Mirrors

来源：评论

学校读者我要写书评

暂无评论

Updatable key Management Scheme with Intrusion Tolerance for Unattended Wireless Sensor network

Updatable Key Management Scheme with Intrusion Tolerance for...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Liang-min Wang Tao Jiang Xiao-yan Zhu Department of Computer Science Jiangsu University Zhenjiang China Key Laboratory of Computer Network and Information Security of Education Ministry Xidian University Xi'an China

An Unattended Wireless Sensor network (UWSN) collects the sensing data by using mobile sinks (MSs). It differs from the traditional multi-hop wireless sensor networks in which unbalanced traffic makes the sensors close to the base station deplete their power earlier than others. An UWSN can save the battery power and prolong the network lifetime. Unfortunately, MSs would be given too much privilege when acting as the collecting base station, which will cause security concern if compromised. Besides, UWSNs are usually deployed in unreachable and hostile environments, where sensors can be easily compromised. Thus, their security issues should be carefully addressed to deal with node compromise. In this paper, we present a novel key management scheme to secure UWSNs. We employ the Blundo symmetric polynomial mechanism to guard against the newly compromised nodes in a period while utilizing the periodic key updating based on the reverse hash chain to block the compromised nodes and revoke the compromised MSs if failing the authentication. We show that our scheme is robust against node compromised attacks and carry out comparison analysis on the intrusion-tolerance ratio, communication and computing overhead.

关键词： Peer to peer computing Polynomials Sensors Security Wireless sensor networks Silicon Mobile communication

来源：评论

学校读者我要写书评

暂无评论

A New Digital Video Watermark Algorithm Based on the HVS

A New Digital Video Watermark Algorithm Based on the HVS

引用

2011 International Conference on Internet Computing and information Services （ICICIS 2011）

作者： Lufang Liao Xiaoshi Zheng Yanling Zhao Guangqi Liu Lufang Liao Shandong Computer Science Center Shandong Provincial Key Laboratory of Computer network technology School of Information Science and Technology Shandong Institute of Light IndustrySDILI

The algorithm applied to video watermark based on HVS is rare recently, but adaptively selecting the embedding position and the embedding strength according to the host(such as videos, images etc.) is necessary,which can make robustness and invisibility best balanced. This article gives a new algorithm about digital video watermarking based on HVS,which makes digital video watermark greatly improved.

关键词： HVS DCT Brightness Texture

来源：评论

学校读者我要写书评

暂无评论

Knowledge Discovery from Noisy Datasets

Knowledge Discovery from Noisy Datasets

引用

The International Conference on Automation and Robotics(ICAR 2011)

作者： Hong Li Yu Zong Enhong Chen Key Laboratory of Network and Intelligent Information Processing Department of Computer Science and Technology Hefei University School of Computer Science and Technology University of Science and Technology of China

It is a significant challenges to deal with the noise data in data mining and knowledge discovery applications. Most of previous works on data cleansing and correction have been focused on addressing class noise or attribute noise for the benefit of the subsequent mining process. In this paper, we propose an error-sensitive(ES) data mining framework, which makes use of noise knowledge to restore original data distributions and accommodates noise knowledge to enhance data classification accuracy. We materialize our main idea by constructing Attribute-Decision tree and measureing correlation among attributes. Experimental results show that ES data mining procedure has ability to significantly improve the quality of data mining results.

关键词： Data mining Noisy datasets Noise handling Classification

来源：评论

学校读者我要写书评

暂无评论

A Block Gathering Based on Mobile Web Page Segmentation Algorithm

A Block Gathering Based on Mobile Web Page Segmentation Algo...

引用

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

作者： Libing Wu Yalin Ke Yanxiang He Nan Liu School of Computer Science Wuhan University Wuhan China Key Laboratory of Information Network Security Ministry of Public Security Shanghai China

Compared to html page, the mobile web page has different features. The mobile web page is arranged through some important tags such as ;N ;, which are called Gathering Node in this paper. Based on these Gathering Nodes, we proposed a Block Gathering Based Page Segmentation algorithm (BGBPS). The experiment shows that BGBPS algorithm has great effect on semantic segmentation of mobile web page.

关键词： Mobile communication Semantics Web pages Visualization Layout HTML Couplings

来源：评论

学校读者我要写书评

暂无评论

L-WMxD: Lexical based Webmail XSS Discoverer

L-WMxD: Lexical based Webmail XSS Discoverer

引用

IEEE Conference on computer Communications Workshops, INFOCOM Wksps

作者： Zhushou Tang Haojin Zhu Zhenfu Cao Shuai Zhao Department of Computer Science and Engineering Shanghai Jiaotong University China Key Laboratory of Information Network Security Ministry of Public Security China

ISBN: (纸本)9781457702495

XSS (Cross-Site Scripting) is a major security threat for web applications. Due to lack of source code of web application, fuzz technique has become a popular approach to discover XSS in web application except Webmail. This paper proposes a Webmail XSS fuzzer called L-WMxD (Lexical based Webmail XSS Discoverer). L-WMxD , which works on a lexical based mutation engine, is an active defense system to discover XSS before the Webmail application is online for service. The engine is initialized by normal JavaScript code called seed. Then, rules are applied to the sensitive strings in the seed which are picked out through a lexical parser. After that, the mutation engine issues multiple test cases. Newly-generated test cases are used for XSS test. Two prototype tools are realized by us to send the newly-generated test cases to various Webmail servers to discover XSS vulnerability. Experimental results of L-WMxD are quite encouraging. We have run L-WMxD over 26 real-world Webmail applications and found vulnerabilities in 21 Webmail services, including some of the most widely used Yahoo!Mail, Mirapoint Webmail and ORACLE' Collaboration Suite Mail.

关键词： Electronic mail Servers Transforms Encoding HTML Browsers Security

来源：评论

学校读者我要写书评

暂无评论

Parallel map matching algorithm based on multi-core and MPI

Parallel map matching algorithm based on multi-core and MPI

引用

International Conference on Remote Sensing, Environment and Transportation Engineering (RSETE)

作者： Xiaogang Han Yuefeng Liu Lei Yan Yiwei Gao Beijing Key Laboratory of Spatial Information Integration and Its Applications Peking University Beijing China Research Institute China United Network Communications Group Company Limited Beijing China

For the requirements of large-scale real-time vehicle GPS data map matching in application, this paper proposes a parallel algorithm for road matching based on multi-core and MPI(Massage Passing Interface). Several basic questions for road matching are discussed, such as maps storage structure, matching elements, and alternative road chain searching. Then, based on multi-core and MPI computing platform, the parallel algorithm for road matching is implemented, with actual road network and floating car data. The validation results show that the algorithm not only has high speedup rate and efficiency, but also the matching results are credible.

关键词： Global Positioning System Roads Vehicles Parallel algorithms Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A Privacy Preserving Handover Authentication Scheme for EAP-Based Wireless networks

A Privacy Preserving Handover Authentication Scheme for EAP-...

引用

2011 IEEE Global Telecommunications Conference - GLOBECOM 2011

作者： Qi Jing Yuqing Zhang Anmin Fu Xuefeng Liu Key Laboratory of Computer Networks and Information Security of Ministry of Education Xidian University Xi'an China National Computer Network Intrusion Protection Center GUCAS Beijing China

Extensible Authentication Protocol (EAP) is a framework which aims to provide a flexible authentication for wireless networks. Due to the involvement of an EAP server and several round trips between a mobile node (MN) and the EAP server, a full EAP authentication takes about 1000ms which is unacceptable in a handover process. This paper proposes a privacy preserving handover authentication scheme for EAP-based wireless networks. We use the proxy signature scheme to accomplish authentication between MN and an access point (AP) without involving the third party. The detailed security analysis shows that our scheme can achieve the privacy preserving and forward/backward security. In addition, we evaluate the latency performance of the proposed scheme by the analysis and simulation. The results demonstrate that our scheme is more efficient in terms of computation and communication overheads.

关键词： Manganese Authentication Privacy Servers Public key

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：