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

AN IDENTITY-BASED key AGREEMENT SCHEME FOR LARGE SCALE SENSOR networkS

Journal of Electronics(China) 2013年第6期30卷 574-586页

作者： Yang Lijun Wu Meng Ding Chao College of Computer Science & Technology Nanjing University of Posts and Telecommunications College of Telecommunication & Information Engineering Nanjing University of Posts and Telecommunications Key Laboratory of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education

To solve the problems of high memory occupation, low connectivity and poor resiliency against node capture, which existing in the random key pre-distribution techniques while applying to the large scale Wireless Sensor networks （WSNs）, an Identity-Based key Agreement Scheme （IBKAS） is proposed based on identity-based encryption and Elliptic Curve Diffie-Hellman （ECDH）. IBKAS can resist man-in-the-middle attacks and node-capture attacks through encrypting the key agreement parameters using identity-based encryption. Theoretical analysis indicates that comparing to the random key pre-distribution techniques, IBKAS achieves significant improvement in key connectivity, communication overhead, memory occupation, and security strength, and also enables efficient secure rekcying and network expansion. Furthermore, we implement IBKAS for TinyOS-2.1.2 based on the MICA2 motes, and the experiment results demonstrate that IBKAS is feasible for infrequent key distribution and rekeying for large scale sensor networks.

关键词： Large scale Wireless Sensor networks （WSNs） network security key agreement Iden-tity-based cryptography

来源：评论

学校读者我要写书评

暂无评论

Iterative algorithms for no-wait flowshop problems with sequence-dependent setup times 25th

Iterative algorithms for no-wait flowshop problems with sequ...

引用

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

作者： Xia Zhu Xiaoping Li Jatinder N.D.Gupta School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University College of Business Administration University of Alabama in Huntsville

ISBN: (纸本)9781467355339

In this paper, the m-machine no-wait flowshop scheduling problem with sequence-dependent setup times is considered to minimize the makespan. According to the problem characteristics, the increment properties of some fundamental operators of algorithms are analyzed. Two increment-based methods FSP (fittest swap points) and FMP (fittest move points) are constructed for fast evaluation on all algorithms. Four iterative algorithms on the basis of job insert, move and swap operators are proposed for the considered problem. In IMS (heuristic with insert, move and swap operators) algorithm, the current solution is constructed step by step by inserting a job at a time and is improved by conducting jobs move within a certain range. FR-IMS (full-range IMS) algorithm is a full-range IMS algorithm. Both IA (iterative algorithm) and IALS (iterative algorithm with local search) algorithms consist of two phases: solution initialization according to a certain rule and solution enhancement by iteratively conducting perturbation and move-based techniques. The main difference between IA and IALS lies in the fact that, instead of using FMP method in the enhancement phase like IA, a local search process which is based on moves under a first-improvement type of pivoting rule as well as a restart mechanism is adopted in IALS. Experimental results show that the proposed algorithms outperform the best existing approaches, among which IALS is the most effective one.

关键词： No-wait flowshops, Sequence-dependent setup times, Makespan, Iterative algorithms

来源：评论

学校读者我要写书评

暂无评论

HilAnchor:Location Privacy Protection in the Presence of Users' Preferences

引用

Journal of computer Science & Technology 2012年第2期27卷 413-427页

作者：倪巍伟郑锦旺崇志宏 School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration in Southeast University Ministry of Education

Location privacy receives considerable attentions in emerging location based *** current practices however either ignore users＇ preferences or incompletely fulfill privacy *** this paper,we propose a privacy protection solution to allow users＇ preferences in the fundamental query of k nearest neighbors （kNN）.Particularly,users are permitted to choose privacy preferences by specifying minimum inferred *** Hilbert curve based transformation,the additional workload from users＇ preferences is ***,this transformation reduces time-expensive region queries in 2-D space to range the ones in 1-D ***,the time efficiency,as well as communication efficiency,is greatly improved due to clustering properties of Hilbert ***,details of choosing anchor points are theoretically *** empirical studies demonstrate that our implementation delivers both flexibility for users＇ preferences and scalability for time and communication costs.

关键词： location privacy kNN query minimum inferred region users＇ privacy preferences

来源：评论

学校读者我要写书评

暂无评论

The Intelligent Terminal Design for Integrated Substation Auxiliary System

引用

Journal of Software Engineering and Applications 2013年第5期6卷 11-15页

作者： Enliang Pang Sanfeng Zhang Yi Ji College of Computer Science & Engineering Southeast University Nanjing China College of Software Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing China

The integrated substation auxiliary system is a project composed by software and hardware to help operators of a substation carry daily maintain works. The intelligent terminal is the key part of the system and it provides important UI and communication functions for the user. Smart phones can achieve higher bandwidth data communication, and at the same time can carry Bluetooth communication, video call, multimedia display and other functions. Smart phone is a potential common platform, suitable for the deployment of substation integrated auxiliary system terminal. Based on the Android Smart phone platform, this paper develops intelligent client-side software for the integrated substation auxiliary system and it can realize the operation ticket control, the video call, the substation map display and other functions. This client-side software has been applied in practice, and has gained good effects.

关键词： Integrated Substation Auxiliary System Android Intelligent Terminal Substation

来源：评论

学校读者我要写书评

暂无评论

DMAT: A new network and computer attack classification

引用

Journal of Engineering Science and Technology Review 2013年第5期6卷 101-106页

作者： Jiang, Wei Tian, Zhi-Hong Cui, Xiang College of Computer Science Beijing University of Technology Beijing 100124 China School of Computer National University of Defense Technology Changsha 410073 China Key Laboratory of Information and Network Security Ministry of Public Security Shanghai 201204 China School of Computer Science and Technology Harbin Institute of Technology Haerbin 150001 China The Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China

With the rapid development of computer network and information technology, the Internet has been suffering from a variety of security attacks over the past few years. Attacks have become both numerous and complex, and the defender can not understand. In order to understand and defend against cyber attacks, it is necessary to understand the kind of attack. In this paper, we study computer and network attacks, and introduce a classification of them and propose a cyber attack classification called DMAT (Defense-oriented Multidimensional Attack Taxonomy). We use nine categories to describe the characteristic of the attack, which are attack target, attack impact, attack purpose, attack cost, attack exploiting, attack source, attack automation, attack loss and defense. The ninth category in the DMAT, classification by defense, is used to provide the defender with instructions of how to defense an attack. Compared to the existing taxonomies, our taxonomy efficiently classifies complex attacks and guide the defender to defense the possible attack. © 2013 Kavala Institute of Technology. All rights reserved.

关键词： network security

来源：评论

学校读者我要写书评

暂无评论

A New Method of Finding All Justifications in OWL 2 EL

A New Method of Finding All Justifications in OWL 2 EL

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Zhangquan Zhou Guilin Qi Boontawee Suntisrivaraporn Key Laboratory of Computer Network and Information Integration of State Education Ministry Southeast University China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Thammasat University Bangkok TH

Finding justifications for an entailment in an OWL ontology is an important reasoning service in the development and maintenance of OWL ontologies. In this paper, we consider the problem of finding all the justifications of an entailment in description logic EL+, which underpins OWL 2 EL. Our method for computing all the justifications utilizes the classification result of an EL+ ontology by an OWL EL reasoner. We first give an algorithm for finding all the justifications of an entailment by constructing an explanation dependency graph from the entailment and the classification result. We then propose some pruning strategies to optimize this algorithm. We implement a prototype system by using the multi-core technology. The experimental results show that in many cases, our optimized algorithm outperforms an existing algorithm for finding all the justifications for an entailment in EL+ that is optimized with the module extraction technology.

关键词： Ontologies OWL Cognition Educational institutions Maintenance engineering Syntactics Semantics

来源：评论

学校读者我要写书评

暂无评论

Compressed sensing based on best wavelet packet basis for image processing

引用

Journal of computers (Finland) 2013年第8期8卷 1947-1950页

作者： Li, Zhe Tao Xie, Jing Xiong Yu, Zu Guo Tu, Deng Biao Choi, Young June The College of Information Engineering Xiangtan University Hunan 411105 China School of Computer National University of Defense Technology Hunan 410073 China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Hunan 411105 China School of Mathematics and Computational Science Xiangtan University Hunan 411105 China National Computer Network Emergency Response Technical Team/Coordination Center of China Beijing 100029 China Department of Information and Computer Engineering Ajou University Suwon 443749 Korea Republic of

In this paper, an algorithm named best wavelet packet tree decomposition (BWPTD) is proposed for image compression. In order to obtain better sparse representation of image, best wavelet packet basis is introduced to decompose image signal in the algorithm. Experimental results show that BWPTD is better than single layer wavelet decompression (SLWD) and original compressed sensing (OCS) in peak signal to noise ratio (PSNR) by 2db and 8db, respectively. In addition, the reconstruction time of BWPTD is only half as that of SLWD and OCS. © 2013 ACADEMY PUBLISHER.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Image Hiding Algorithm in Discrete Cosine Transform Domain Based on Grey Prediction and Grey Relational Analysis

引用

China Communications 2013年第7期10卷 57-70页

作者：黄海平黄世超陈九天王汝传 College of Computer Nanjing University of Posts and Telecommunications Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks Key Laboratory of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education Nanjing University of Posts and Telecommunications Jiangsu Provincial Key Laboratory for Computer Information Processing Technology Soochow University

Traditional information hiding algorithms cannot maintain a good balance of capacity,invisibility and *** this paper,a novel blind colour image information hiding algorithm based on grey prediction and grey relational analysis in the Discrete Cosine Transform(DCT) domain is ***,this algorithm compresses the secret image losslessly based on the improved grey prediction GM(1,1)(IGM) *** then chooses the blocks of rich texture in the cover image as the embedding regions using Double-dimension Grey Relational Analysis(DGRA).Finally,it adaptively embeds the compressed secret bits stream into the DCT domain mid-frequency coefficients,which are decided by those blocks' Double-Dimension Grey Correlation Degree(DGCD) and Human Visual System(HVS).This method can ensure an adequate balance between invisibility,capacity and *** results show that the proposed algorithm is robust against JPEG compression(46.724 6 dB when the compression quality factor is 90%),Gaussian noise(45.531 3 dB when the parameter is(0,0.000 5)) etc.,and it is a blind information hiding algorithm that can be extracted without an original carrier.

关键词： image information hiding IGM DGRA blind information hiding DCT

来源：评论

学校读者我要写书评

暂无评论

Cryptanalysis of 2-layer nonlinear piece in hand method

Cryptanalysis of 2-layer nonlinear piece in hand method

引用

CD-ARES 2013 Workshops: 2nd International Workshop on Modern Cryptography and Security Engineering, MoCrySEn 2013 and 3rd International Workshop on Security and Cognitive Informatics for Homeland Defense, SeCIHD 2013

作者： Nie, Xuyun Petzoldt, Albrecht Buchmann, Johannes School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu 611731 China Technische Universität Darmstadt Department of Computer Science Hochschulstraße 10 64289 Darmstadt Germany State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China Network and Data Security Key Laboratory of Sichuan Province China

ISBN: (纸本)9783642405877

Piece in Hand method is a security enhancement method for Multivariate Public key Cryptosystems (MPKCs). Since 2004, many types of this method have been proposed. In this paper, we consider the 2-layer nonlinear Piece in Hand method as proposed by Tsuji et al. in 2009. The key point of this method is to introduce an invertible quadratic polynomial map on the plaintext variables to construct perturbation of the original MPKC. Through our analysis, we find that the security of the enhanced scheme is mainly relying on the quadratic polynomials of this auxiliary map. The two examples proposed by Tsuji et al. for this map can not resist the Linearization Equation attack. Given a valid ciphertext, we can easily get a public key which is equivalent to the original MPKC. If there is an algorithm that can recover the plaintext corresponding to a valid ciphertext of the original MPKC, we can construct an algorithm that can recover the plaintext corresponding to a valid ciphertext of the enhanced MPKC. © IFIP International Federation for information Processing 2013.

关键词： Linearization

来源：评论

学校读者我要写书评

暂无评论

A Logic Programming Approach to Aspect Extraction in Opinion Mining

A Logic Programming Approach to Aspect Extraction in Opinion...

引用

IEEE WIC ACM International Conference on Web Intelligence (WI)

作者： Qian Liu Zhiqiang Gao Bing Liu Yuanlin Zhang Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing China Department of Computer Science University of Illinois at Chicago Chicago IL Department of Computer Science Texas Tech University Lubbock Texas

Aspect extraction aims to extract fine-grained opinion targets from opinion texts. Recent work has shown that the syntactical approach performs well. In this paper, we show that Logic Programming, particularly Answer Set Programming (ASP), can be used to elegantly and efficiently implement the key components of syntax based aspect extraction. Specifically, the well known double propagation (DP) method is implemented using 8 ASP rules that naturally model all key ideas in the DP method. Our experiment on a widely used data set also shows that the ASP implementation is much faster than a Java-based implementation. Syntactical approach has its limitation too. To further improve the performance of syntactical approach, we identify a set of general words from Word Net that have little chance to be an aspect and prune them when extracting aspects. The concept of general words and their pruning are concisely captured by 10 new ASP rules, and a natural extension of the 8 rules for the original DP method. Experimental results show a major improvement in precision with almost no drop in recall compared with those reported in the existing work on a typical benchmark data set. Logic Programming provides a convenient and effective tool to encode and thus test knowledge needed to improve the aspect extraction methods so that the researchers can focus on the identification and discovery of new knowledge to improve aspect extraction.

关键词： Logic programming Data mining Syntactics Semantics Educational institutions Cameras

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：