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

Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments

Science in China(Series F) 2008年第7期51卷 896-909页

作者： LI XiaoPing1,2 & WU Cheng3 1 School of computer Science & Engineering, Southeast University, Nanjing 210096, China 2 key laboratory of computer network and information Integration (Southeast University), Ministry of Education, Nanjing 210096, China 3 Department of Automation, Tsinghua University, Beijing 100084, China 1. School of Computer Science & Engineering Southeast University Nanjing 210096 China 2. Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing 210096 China 3. Department of Automation Tsinghua University Beijing 100084 China

No-wait flow shops with makespan minimization are classified as NP-hard. In this paper, the optimization objective is equivalently transformed to total idle-time minimization. The independence relationship between tasks is analyzed, and objective increment properties are established for the fundamental operators of the heuristics. The quality of the new schedules generated during a heuristic is judged only by objective increments and not by the traditional method, which computes and compares the objective of a whole schedule. Based on objective increments, the time complexity of the heuristic can be decreased by one order. A seed phase is presented to generate an initial solution according to the transformed objective. Construction and improvement phases are introduced by experimental analysis. The FCH （fast composite heuristic） is proposed and compared with the most effective algorithms currently available for the considered problem. Experimental results show that the effectiveness of the FCH is similar to that of the best methods but requires far less computation time. The FCH can also be efficient in real time scheduling and rescheduling for no-wait flow shops.

关键词： no-wait flow shops heuristic makespan Tabu search

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Resource allocation model based on non-cooperative bidding game in P2P network

Resource allocation model based on non-cooperative bidding g...

引用

International Symposium on Advances in computer and Sensor networks and Systems, 2008

作者： Jun, Tao Hang, Chen JiaGao, Wu School of Computer Science and Engineering Southeast University Nanjing 210096 China Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing 210096 China College of Computer Nanjing University of Posts and Telecommunications Nanjing 210003 China

ISBN: (纸本)9781427629807

Game theory is applied to studying the P2P resource allocation technologies further in this paper. The mechanism of P2P resource pricing, which shows the relation of supply and demand, was presented based on bidding. Subsequently, we designed the utility function of end system and proved the existence and uniqueness of Nash Equilibrium in P2P resource allocation game. At last, we present a P2P resource allocation algorithm (PRANG) based on the resource allocation game model. The results of experiment and simulation show that PRANG algorithm can provide references for the quantity of resource that users demand and regularize the users' bids. Consequently, the allocation of the whole P2P resource tends to be more reasonable.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fair Exchange Signature Schemes

Fair Exchange Signature Schemes

引用

International Conference on Advanced information networking and Applications Workshops (AINAW)

作者： Jingwei Liu Rong Sun Wenping Ma Ying Li Xinmei Wang Key Laboratory of Computer Network and Information Security Ministry of Education Xidian University Xi'an China

In this paper we propose an efficient Fair Exchange Signature Scheme(FESS) that allows two players to exchange digital signatures in a fair way. It may be considered as an interesting extension of concurrent signature presented in EURO CRYPT 2004 that is constructed from ring signatures. In our scheme, two unwakened signatures signed separately by two participants can be verified easily by the other player, but it would not go into effect until an extra piece of commitment keystone is released by one of the players. Once the keystone revealed, two signatures are both aroused and become effective. A key feature of the proposed scheme is that two players can exchange digital signatures simultaneously through a secret commitment keystone without involvement of any Trusted Third Party. Moreover, the efficiency of our signature scheme is higher than that of concurrent signature.

关键词： Protocols Digital signatures computer networks Application software Laboratories information security computer science education Electronic commerce Internet computer crashes

来源：评论

学校读者我要写书评

暂无评论

A Benefits-centric Multi-participant Trust Architecture for DRM-Enabling Digital Contents Value Chain Ecosystem

A Benefits-centric Multi-participant Trust Architecture for ...

引用

International Seminar on Business and information Management, ISBIM

作者： Zhiyong Zhang Qingqi Pei Jianfeng Ma Lin Yang Ministry of Education Key Laboratory of Computer Network & Information Security Xidian University Xi'an China

A multi-participant trust relationship is essential to implement a successful business transaction in DRM (digital rights management)-enabling digital contents industry. The simple adoption of several increasingly enhanced security policies does not necessarily establish the mutual trust relationship ultimately, and even has a negative effect on the usability and acceptability of DRM system. Therefore, various participantspsila benefits should be emphasized in the contents value chain. First, a general DRM contents value chain ecosystem was presented without a loss of generality. Then, a benefits-centric multi-participant trust architecture (abbr. MPTA), which is based on game-theoretic rational adoptions of security policies for participants, was proposed through an anatomy of existing value chain ecosystems. Finally, we formalized the definitions of the security component and service, the security policy and its utility, as well as the Nash equilibriums of the multi-participant game under pure and mixed security policy profile. Due to the introduction to game theory, MPTA enables participants to acquire optimal benefits balance when fundamental security requirements are met, and Nash equilibrium of the game is the chosen security policies combinations from the participantspsila perspectives.

关键词： Ecosystems Nash equilibrium Game theory computer network management information security Intellectual property Application software Seminars information management computer architecture

来源：评论

学校读者我要写书评

暂无评论

Storage requirements for key distribution in sensor networks

Storage requirements for key distribution in sensor networks

引用

2nd International Conference on Sensor Technologies and Applications, SENSORCOMM 2008

作者： Liu, Zhihong Jianfeng, Ma Huang, Qiping Moon, SangJae Key Laboratory of Computer Networks and Information Security Ministry of Education Xidian University China School of Communication Engineering Xidian University China Mobile Network Security Technology Research Center Kyungpook National University Korea Republic of

ISBN: (纸本)9780769533308

Sensor networks are resource-constrained, which makes developing efficient key distribution scheme a challenging problem. In general, many key distribution techniques are designed to address the trade-off between limited resources and security, no key distribution technique is ideal to all the scenarios where sensor networks are used. In this paper, we primarily focus on storage requirements of several key distribution schemes in sensor networks, and obtain their lower bounds on the amount of information each user has to keep secret by modeling the key distribution schemes with an information theoretic framework. © 2008 IEEE.

关键词： Sensor networks

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：