检索结果-南通市图书馆

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

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Restrictive mechanism of flow control among non-cooperative Internet users

引用

Science china(information Sciences) 2011年第1期54卷 12-22页

作者： TAO Jun1,2,ZHONG Xiao1,2 & LU YiFei1,2 1key laboratory of computer network and information integration,Southeast University, ministry of education,nanjing 210096,china 2School of computer Science and Engineering,Southeast University,nanjing 210096,china 1. key laboratory of computer network and information integration Southeast University Ministry of Education Nanjing 210096 China2. School of Computer Science and Engineering Southeast University Nanjing 210096 China

The flow and congestion control methods based on one-shot game model with non-cooperative game theory can explain the non-cooperative behavior of Internet ***,the low effciency of equilibrium solutions affects their *** the behavior of flow and congestion control based on infinitely repeated game models is addressed;the repeated and infinitely repeated flow and congestion control game model is presented; the existence and optimization of the Nash equilibrium point are proved;the discount factor in repeated game is discussed;the punishment and threat strategy to users'misbehavior is studied in N-users infinitely flow control game;the punishment restrictive method of users'behavior is designed in infinitely and finitely games;finally,a flow control algorithm based on repeated game,FCAR,is provided based on the conclusions of repeated game *** results of experiment and simulation show that FCAR algorithm could regularize and restrict users' misbehavior *** algorithm can also make non-cooperative Internet users achieve cooperation in order to optimize the utility of the whole flow and congestion control system.

关键词： Nash equilibrium utility infinitely and finitely repeated game flow and congestion control

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Non-blocking message total ordering protocol

引用

Science in china(Series F) 2008年第12期51卷 1919-1934页

作者： WANG Yun & WANG JunLing School of computer Science & Engineering, Southeast University key Lab of computer network & information integration, MOE, nanjing 210096, china 1. School of computer Science & Engineering Southeast University key Lab of computer network & information integration MOE Nanjing 210096 China

Message total ordering is a critical part in active replication in order to maintain consistency among members in a fault tolerant group. The paper proposes a non-blocking message total ordering protocol （NBTOP） for distributed systems. Non-blocking property refers to that the members in a fault tolerant group keep on running independently without waiting for installing the same group view when a fault tolerant group evolves even when decision messages collide. NBTOP takes advantage of token ring as its logical control way. Members adopt re-requesting mechanism （RR） to obtain their lost decisions. Forward acknowledgement mechanism （FA） is put forth to solve decision collisions. The paper further proves that NBTOP satisfies the properties of total order, agreement, and termination. NBTOP is implemented, and its performance test is done. Comparing with the performance of Totem, the results show that NBTOP has a better total ordering delay. It manifests that non-blocking property helps to improve protocol efficiency.

关键词： total ordering protocol non-blocking active replication fault tolerance token ring

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Fair Non-Repudiation for Web Services Transactions

引用

Wuhan University Journal of Natural Sciences 2010年第5期15卷 385-392页

作者： SU Ruidan,FU Shaofeng,ZHOU Lihua key laboratory of computer network and information Security of the ministry of education,Xidian University,Xi’an 710071,Shaanxi,china key laboratory of computer network and information Security of the ministry of education Xidian University Xi’an Shaanxi China

To safeguard the interests of transacting parties,non-repudiation mechanisms need to assure fairness and *** non-repudiation service currently implemented usually does not consider the requirement of fairness and the fair non-repudiation protocols to date can not be suitably applied in real environment due to its complex *** paper discusses the transaction-oriented non-repudiation requirement for Web services transaction,analyzes the constraints of the traditional model for the available fair non-repudiation protocols and designs a new Online-TTP fair non-repudiation *** new protocol provides a fair non-repudiation solution to secure Web services transactions and can be embedded into a single Web service *** protocol adopts evidence chained to decreasing the overhead of evidence verification and management and alleviates the overhead of certificate revocation checking and time-stamp generation for *** protocol has strong fairness,timeliness,efficiency and practicability.

关键词： fair non-repudiation Web services transaction evidence chaining timeliness

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Evolutionary cryptography theory based generating method for a secure Koblitz elliptic curve and its improvement by a hidden Markov models

引用

Science china(information Sciences) 2012年第4期55卷 911-920页

作者： WANG Chao 1,ZHANG HuanGuo 2,3 & LIU LiLi 4 1 key Lab of Specialty Fiber Optics and Optical Access network,ministry of education,Shanghai University,Shanghai 200072,china 2 computer School of Wuhan University,Wuhan 430072,china 3 key laboratory of Aerospace information Security and Trusted Computing ministry of education,Wuhan 430072,china 4 Huawei Technologies CO.LTD.,Shanghai 201206,china 1. key Lab of Specialty Fiber Optics and Optical Access network Ministry of Education Shanghai University Shanghai 200072 China2. Computer School of Wuhan University Wuhan 430072 China3. Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education Wuhan 430072 China4. Huawei Technologies CO. LTD. Shanghai 201206 China

Considering potential attacks from cloud-computing and quantum-computing,it is becoming nec-essary to provide higher security elliptic *** hidden Markov models are introduced for designing the trace-vector computation algorithm to accelerate the search for elliptic curve (EC) *** present a new algorithm for secure Koblitz EC generation based on evolutionary cryptography *** algorithm is tested by selecting a secure Koblitz EC over the field F(2 2000),with experiments showing that both the base field and base point of the secure curve generated exceed the parameter range for Koblitz curves recommended by *** base fields generated go beyond 1900 bits,which is higher than the 571 bits recommended by *** also find new secure curves in the range F(2 163)-F(2 571) recommended by *** perform a detailed security analysis of those secure curves,showing that those we propose satisfy the same security criteria as NIST.

关键词： secure EC selection evolutionary cryptography theory ant colony algorithm Koblitz EC HMM

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

基于粒子群优化的ad hoc网络最小能耗多播路由算法

引用

通信学报 2012年第3期33卷 52-58页

作者：朱晓建沈军东南大学计算机科学与工程学院江苏南京211189 东南大学计算机网络和信息集成教育部重点实验室江苏南京211189

在无线ad hoc网络中,设备使用电池提供能量,随着多播应用日益广泛,如何构造最小能耗多播树是一个重要问题。针对选择不同的中继节点集对构造最小能耗多播树的影响,提出了一种优化最小能耗多播树构造的离散粒子群算法。为了避免离散粒子... 详细信息

在无线ad hoc网络中,设备使用电池提供能量,随着多播应用日益广泛,如何构造最小能耗多播树是一个重要问题。针对选择不同的中继节点集对构造最小能耗多播树的影响,提出了一种优化最小能耗多播树构造的离散粒子群算法。为了避免离散粒子群算法早熟收敛,引入惯性权重策略,以平衡算法的全局搜索能力和局部搜索能力。模拟实验结果表明改进后的离散粒子群算法具有较强的优化能力,有效地优化了最小能耗多播树的构造。

关键词：无线adhoc网络多播路由最小能耗粒子群优化

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

无线/移动网络中自适应的接纳控制算法及性能分析

引用

通信学报 2004年第6期25卷 147-156页

作者：姜爱全赵阿群东南大学计算机科学与工程系江苏南京210096 教育部计算机网络和信息集成支撑技术重点实验室江苏南京210096

无线/移动网络中重要的连接级QoS性能指标包括新连接请求阻塞率(CBP)、切换连接请求丢弃率(HDP)等。其中,更不希望因切换连接请求的丢弃而导致服务的终止。为降低HDP,通常采用资源预留方案。但这种方案导致CBP较高、资源利用率低。本文... 详细信息

无线/移动网络中重要的连接级QoS性能指标包括新连接请求阻塞率(CBP)、切换连接请求丢弃率(HDP)等。其中,更不希望因切换连接请求的丢弃而导致服务的终止。为降低HDP,通常采用资源预留方案。但这种方案导致CBP较高、资源利用率低。本文针对自适应的多媒体应用带宽可以动态调整的特点,研究无线/移动网络中多优先级服务自适应的接纳控制机制,提出一个自适应的接纳控制算法,对其QoS性能进行分析。

关键词：无线/移动网络自适应的接纳控制连接级QoS 资源预留降级率 Markov模型

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Quantum threshold group signature

引用

Science china(Physics,Mechanics & Astronomy) 2008年第10期51卷 1505-1514页

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

In most situations, the signer is generally a single person. However, when the message is written on behalf of an organization, a valid message may require the approval or consent of several persons. Threshold signature is a solution to this problem. Generally speaking, as an authority which can be trusted by all members does not exist, a threshold signature scheme without a trusted party appears more attractive. Following some ideas of the classical Shamir’s threshold signature scheme, a quantum threshold group signature one is proposed. In the proposed scheme, only t or more of n persons in the group can generate the group signature and any t-1 or fewer ones cannot do that. In the verification phase, any t or more of n signature receivers can verify the message and any t-1 or fewer receivers cannot verify the validity of the signature.

关键词： threshold quantum signature trusted party quantum cryptography

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Threshold quantum secret sharing between multi-party and multi-party

引用

Science china(Physics,Mechanics & Astronomy) 2008年第9期51卷 1308-1315页

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

A threshold quantum secret sharing (TQSS) scheme between multi-party and multi-party was proposed using a sequence of single photons,which is useful and efficient when the parties of communication are not all present. We described the process of this TQSS scheme and discussed its security. It was shown that entan-glement is not necessary for quantum secret sharing. Moreover,the theoretic effi-ciency was improved to approach 100% as almost all the instances can be used for generating the private key,and each photon can carry one bit of information. This protocol is feasible with the present-day technique.

关键词： threshold quantum secret sharing quantum cryptography single photon multi-party and multi-party

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

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

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：