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

Components Selection Methods for Enterprise Interoperability in Multi Domain Models

IFAC Proceedings Volumes 2008年第2期41卷 11919-11924页

作者： Ke FENG Xiaoping LI Qian WANG Jingjing SHAN School of Computer Science & Engineering Southeast University 210096 Nanjing P.R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education

Component-based development is gradually showing its advantages in building complex systems with shorter time and less cost than traditional methods. However, mismatching and semantic are key problems in component searching process. In this paper, a function description model is proposed to precisely and completely describe the user requirements and component function based on domain models. In the component selection process, a sophisticated matching algorithm is introduced for semantic problems in matching two activity profiles derived from different domain models. A component selection method is also presented to improve interoperability for multi domain models, followed by the implemented prototype of the proposed methods.

关键词：

来源：评论

学校读者我要写书评

暂无评论

An Improved Simple Power Attack against Camellia's key Schedule

引用

Wuhan University Journal of Natural Sciences 2008年第5期13卷 591-594页

作者： LIU Shuanggen NI Haiying HU Yupu LIAO Yunyan Key Laboratory of Computer Network and InformationSecurity of Ministry of Education Xidian University Xi＇an710071 Shaanxi China College of Computer Information Engineering JiangxiNormal University Nanchang 330022 Jiangxi China

This paper presents an improved simple power attack against the key schedule of Camellia. While the original attack required an exact determination of the Hamming weight of intermediate data values based on power measurements, in this paper, two types of the simple power attack are presented and shown to be tolerant of errors that might occur in the Hamming weight determinations. In practical applications of the attack, such errors are likely to occur due to noise and distortion in the power measurements and their mapping to the Hamming weights of the data. To resist these attacks, the required design rationale of key schedules and several practical countermeasures are suggested.

关键词： simple power attack Camellia key schedule Hamming weight attack

来源：评论

学校读者我要写书评

暂无评论

The research of web GIS based on Portal

The research of web GIS based on Portal

引用

Geoinformatics 2008 and Joint Conference on GIS and Built Environment: Geo-Simulation and Virtual GIS Environments

作者： Shen, Lei Duan, Weixi Ren, Yingchao Dong, Peng Wu, Lei Tan, Jian State Key Laboratory of Remote Sensing Information Sciences IRSA CAS Beijing 100101 China Super Computing Center Computer Network Information Center CAS Beijing 100190 China

ISBN: (纸本)9780819473851

With the rapid development of computer network technologies and distributed computing technologies, more and more enterprises begin to accept and use Web GIS. As a result of the thought that traditional Web GIS has focused on system, a number of existing Web GIS are isolated by each other, and facing the problems with data islands and function overlaps, which results in the waste of spatial data resources, the redundant construction of spatial information service, the difficulty of system integration and so on. All of these demands that the new generation Web GIS should focus on users, be service-oriented and be easily integrated systems. The introduction of Portal can solve difficulties above. This paper studies how to bring in Portal in the process of designing and developing Web GIS to solve the difficulties of resource integration and the personalized services of users. And the author has successfully implemented a Web GIS Portal based on JSR 168 Java Portlet Specification. The facts have proved that a Web GIS developed by Portal can provide users with better user experience and be easily integrated with other application systems. © 2008 SPIE.

关键词： Portals

来源：评论

学校读者我要写书评

暂无评论

Threshold proxy quantum signature scheme with threshold shared verification

引用

Science China(Physics,Mechanics & Astronomy) 2008年第8期51卷 1079-1088页

作者： YANG YuGuang1,3,4 & WEN QiaoYan2 1 College of computer Science and Technology,Beijing University of Technology,Beijing 100124,China 2 State key laboratory of networking and Switching Technology,Beijing University of Posts and Tele-communications,Beijing 100876,China 3 State key laboratory of Integrated Services network,Xidian University,Xi’an 710071,China 4 State key laboratory of information Security(Graduate University of Chinese Academy of Sciences) ,Beijing 100049,China 1. College of Computer Science and Technology Beijing University of Technology Beijing 100124 China 3. State Key Laboratory of Integrated Services Network Xidian University Xi’an 710071 China 4. State Key Laboratory of Information Security (Graduate University of Chinese Academy of Sciences) Beijing 100049 China 2. State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing 100876 China

A threshold proxy quantum signature scheme with threshold shared verification is proposed. An original signer could authorize a group as its proxy signers. Then only t or more of n persons in the proxy group can generate the proxy signature on behalf of the original signer and any t-1 or fewer ones cannot do that. When the proxy signature needs to be verified,any t or more of n persons belonging to the verification group can verify the message and any t-1 or fewer ones cannot verify the validity of the proxy signature.

关键词： quantum signature threshold proxy quantum group signature threshold shared verification

来源：评论

学校读者我要写书评

暂无评论

A New Ranging Method for Anisotropic Wireless Sensor networks

A New Ranging Method for Anisotropic Wireless Sensor Network...

引用

International Conference on Pervasive Computing and Applications (ICPCA)

作者： Kai Li Yun Wang Department of Computer Science & Engineering Laboratory of Computer Network and Information Integration South East University Nanjing China

Sensor localization is used by many position dependent applications in wireless sensor networks (WSNs), where ranging from sensor nodes to beacon nodes plays a fundamental role. Most ranging methods rely on the assumption that the deployed WSNs are isotropic, so that adjustment on measured distance is equal in all directions. However, this assumption does not stands in practice. In order to obtain more accurate distance estimation in anisotropic WSNs, we identify turning nodes in error-sensitive region, and propose a new metric of Round-route Node Correlation (RNC) to find these turning nodes. Further adjustment algorithms are proposed which captures local features of topology. Simulation results show that the proposed method outperforms PDM and DV-distance especially when beacon nodes are not deployed uniformly.

关键词： Anisotropic magnetoresistance Wireless sensor networks Turning Euclidean distance computer science computer networks Application software network topology Sensor phenomena and characterization Noise measurement

来源：评论

学校读者我要写书评

暂无评论

A collaboration scheme for making peer-to-peer anonymous routing resilient

A collaboration scheme for making peer-to-peer anonymous rou...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xiaogang Wang Junzhou Luo Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China Southeast University Nanjing Jiangsu CN

ISBN: (纸本)9781424416509

Node churn is one hurdle to using peer-to-peer (P2P) networks as anonymous networks, which makes the anonymous path fragile and results in message loss and communication failures. A collaboration scheme including friendly neighbor-based incentive (FNI) and re-encryption mechanism is proposed to deal with the high node churn (changes in system membership) characteristic of unstructured P2P networks. The simple FNI mechanism is presented to encourage peers to forward other peers' queries, and establish more connections to improve the performance of P2P overlay network where only stable and well-behaved nodes can be chosen as relay nodes to prolong single path durability. The re-encryption mechanism is designed to replace those failed relay nodes and achieve routing resilience upon different node availabilities in real- world systems. The results from our security analysis and simulation show that the collaboration scheme greatly improves routing resilience and maintains low latencies and low communication overhead.

关键词： Collaboration Peer to peer computing Routing Relays Multicast protocols Resilience Bandwidth Public key Mesons computer science

来源：评论

学校读者我要写书评

暂无评论

A new approach for UC security concurrent deniable authentication

引用

Science in China(Series F) 2008年第4期51卷 352-367页

作者： FENG Tao LI FengHua MA JianFeng SangJae MOON Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University Xi'an 710071 China School of Computer and Communications Lanzhou University of Technology Lanzhou 730050 China Mobile Network Security Technology Research Center Kyungpook National University Sankyuk-dong Buk-ku Daeyu 702-701 Korea

Deniable authentication protocols allow a sender to authenticate a message for a receiver, in a way which the receiver cannot convince a third party that such authentication ever took place. When we consider an asynchronous multi-party network with open communications and an adversary that can adaptively corrupt as many parties as it wishes, we present a new approach to solve the problem of concurrent deniable authentication within the framework of universally composable （UC） security. We formulate a definition of an ideal functionality for deniable authentication. Our constructions rely on a modification of the verifiably smooth projective hashing （VSPH） with projection key function by trapdoor commitment. Our protocols are forward deniable and UC security against adaptive adversaries in the common reference string model. A new approach implies that security is preserved under concurrent composition of an unbounded number of protocol executions; it implies non-malleability with respect to arbitrary protocols and more. The novelty of our schemes is the use of witness indistinguishable protocols and the security is based on the decisional composite residuosity （DCR） assumption. This new approach is practically relevant as it leads to more efficient protocols and security reductions.

关键词： information security concurrent deniable authentication universally composable verifiably smooth projective hashing the decisional composite residuosity assumption

来源：评论

学校读者我要写书评

暂无评论

Maximizing Universal Streaming Rate in Peer-to-Peer Streaming networks

Maximizing Universal Streaming Rate in Peer-to-Peer Streamin...

引用

International Conference on Grid and Cooperative Computing (GCC)

作者： Jiagao Wu Jun Tao Zhiqiang Zou Institute of Computer Technology College of Computer Nanjing University of Posts and Telecommunications Nanjing China Key Laboratory of Computer Network and Information Integration of Ministry of Education South-East University Nanjing China

ISBN: (纸本)9781424432806

Although a large number of different proposals have emerged in recent years, a fundamental problem of P2P streaming networks concerned about is to establish an optimal routing structure with achieving certain optimization metric. In this paper, we focus on the problem of maximizing universal streaming rate in P2P streaming networks with constrained neighborhood. Firstly, we extend the fluid-based model and propose a new P2P streaming network model taking the neighborhood constraint into account. Second, we formulate the problem of maximizing the universal streaming rate in the new model. After proving its NP-hardness, we propose a heuristic multiple trees packing algorithm and corresponding optimum strategies. The simulation results show that the algorithm can achieve the theoretical upper bound of the universal streaming rate in fluid-based model without constrained neighborhood. While neighborhood constraint is considered, in addition, the universal streaming rate will have different decline according to various intensity of neighborhood constraint.

关键词： Peer to peer computing Streaming media computer networks Grid computing Telecommunication computing Bandwidth Routing Educational technology Educational institutions Proposals

来源：评论

学校读者我要写书评

暂无评论

Real-time feature selection in traffic classification

引用

Journal of China Universities of Posts and Telecommunications 2008年第SUPPL.期15卷 68-72页

作者： ZHAO, Jing-jing HUANG, Xiao-hong SUN, Qiong MA, Yan Information Network Center Beijing University of Posts and Telecommunications Beijing 100876 China School of Computer Science and Technology Beijing University of Posts and Telecommunications Beijing 100876 China Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing 100876 China

Classification of network traffic using port-based or payload-based analysis is becoming increasingly difficult since many P2P applications are using port hopping and encryption to avoid detection. As a result, the attention of research has diverted to the application of machine learning (ML) techniques on traffic classification. Feature selection plays an important role in machine learning-based traffic classification scheme. However, most of the feature selection algorithms proposed so far are not effective in online traffic classification, in which the feature subsets selected cannot be used online. In this paper, different types of features used in traffic classification are presented, and meanwhile, the accuracy of different feature selection algorithms is analyzed and compared when they are used in traffic classification, especially in P2P traffic classification. In order to realize the online traffic classification, we propose a real-time feature subset. As the results show, very good performance will be achieved when the real-time feature subset is used in decision tree based ML algorithm. Meanwhile, the build time of real-time feature subset is shorter than that of other feature subsets, which makes it a good candidate for online traffic classification. © 2008 The Journal of China Universities of Posts and Telecommunications.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

Fast Access Control Algorithm in Wireless network

Fast Access Control Algorithm in Wireless Network

引用

International Conference on Grid and Pervasive Computing Workshops, GPC

作者： Kun Wang Zhixin Ma Key Laboratory of Computer Network and Information Security of the Ministry of Education Xidian University Xi'an China

This paper presents an access control algorithm which bases on artificial neural network (ANN). It uses selected roles as input vectors. Then, considering role inheritance, the matching roles that may mutual exclude are picked as the output vectors to train the role-role ANN. After that, it removes all conflicts from the output of the former ANN and makes them as the new input vectors. And it employs users' final permissions as the output vectors to train the role- permission ANN according to users' current sessions. This algorithm has high efficiency and can assign users various permissions in different session. It need not re-compute trained ANN if we add or delete users in the system without changing the mapping between the roles and permissions. It exploits bit strings to express roles and permissions, which reduces the data transmission and fits for low bandwidth networks.

关键词： Access control Wireless networks Permission Artificial neural networks Laboratories computer networks information security computer science education Data communication Bandwidth

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：