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

A kind of shape similarity measure methods and the performance evaluation

Journal of Computational information Systems 2007年第5期3卷 2057-2062页

作者： Hong, Zhiling Wang, Beizhan Jiang, Qingshan Wang, Shoujue Department of Computer Science Xiamen University Fujian 361005 China School of Software Xiamen University Fujian 361005 China Key Laboratory for Intelligent Information Technology Fujian 361005 China Lab. of Artificial Neural Networks Inst. of Semiconductors CAS Beijing 100083 China

Shape similarity measure is an important and difficult problem in computer vision and has been extensively studied for decades. In this paper, we propose a kind of shape similarity measure methods based on partition block statistic According to the difference of partition methods, we extend the idea into eight shape similarity measure methods. Zernike moments and Hu moments methods are also included for performance comparison. Shape retrieval experiments have been conducted on the MPEG-7 Core Experiment CE-Shape-1 database of 1400 images which illustrate the performance of the ten algorithms.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

One-way accumulators based group key agreement scheme for mobile ad hoc network

引用

Tongxin Xuebao/Journal on Communications 2007年第SUPPL.期28卷 103-106页

作者： Feng, Tao Ma, Jian-Feng School of Computer and Communication Lanzhou University of Technology Lanzhou 730050 China Key Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China

A security, efficient group key management scheme was presented and its security was proved. The scheme was based on one-way accumulators. The dynamic event that external nodes joined the team or internal nodes exited the team was supported. The protocol can provide perfect forward secrecy and backward secrecy. The related analysis shows new distributed group rekeying algorithms is efficient in the computation cost, storage cost, communication cost and feasibility.

关键词： Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Logical Mistakes in NTRU Compensation Algorithm and Improvement of Encryption Verification Algorithm

Logical Mistakes in NTRU Compensation Algorithm and Improvem...

引用

International Conference on Computational Intelligence and Security Workshops (CISW)

作者： Yining Quan Xinshe Li Yupu Hu Key Laboratory of Computer Networks & Information Security Ministry of Education Xidian University Xi'an China

The basic security of NTRU is based on the hardness of the shortest vector problem (SVP) of some lattice, named as CS lattice. Dealing with the decryption failure problem of NTRU is an important topic. The logical mistakes and defects of NTRU compensation algorithm which is used for dealing with the decryption failure problem of NTRU are analyzed. The compensation algorithm is proven to be incorrect in this paper. It seems that NTRU encryption verification algorithm can cope with the decryption failure problem of NTRU. But in fact, it is hard to get a satisfying result. An improvement scheme on NTRU encryption verification algorithm is also put forward and discussed, which can correctly resume the plaintext in high probability while the security is the same with NTRU.

关键词： information security Lattices Polynomials computer security Algorithm design and analysis Public key cryptography Wrapping Computational intelligence Laboratories computer networks

来源：评论

学校读者我要写书评

暂无评论

Hybrid Heuristic for Total Flowtime Minimization in No-wait Flow Shops

Hybrid Heuristic for Total Flowtime Minimization in No-wait ...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Xia Zhu Xiaoping Li Qian Wang School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China

ISBN: (纸本)1424409624

In this paper, no-wait flow shop scheduling problem with total flowtime minimization is considered. A hybrid heuristic is proposed, which is based on PHI (p) (presented by Aldowaisan and Allahverdi, OMEGA, 2004). A composite algorithm is adopted to generate the initial seed. Job insertion in PHI (p) is replaced with an existing constructive heuristic. Experimental results show that the proposal outperforms PHI (p), especially for large scale instances.

关键词： Job shop scheduling Large-scale systems Manufacturing Chemical technology Collaborative work Design engineering Laboratories computer networks Processor scheduling Proposals

来源：评论

学校读者我要写书评

暂无评论

Efficient traitor tracing DRM scheme

引用

Tongxin Xuebao/Journal on Communications 2007年第SUPPL.期28卷 78-81页

作者： Liu, Jing-Mei Zhao, Lin-Sen Wang, Xin-Mei Key Laboratory of Computer Networks and Information Security Xidian University Xi'an 710071 China Telecom Department Xi'an Institute of Post and Telecommunications Xi'an 710061 China

A new traitor tracing scheme with revocation capability was proposed which can be used in digital right management. Only one key was held by each receiver and when traitors were found, their private keys can be revoked without updating the private keys of other receivers. In particular, no revocation messages are broadcast and all receivers do nothing. It is conceptually simple and fully k-resilient, that is, all traitors can be found if the number of them is k or less. The encryption algorithm of our scheme is secure assuming that the discrete logarithm problem is hard.

关键词： Cryptography

来源：评论

学校读者我要写书评

暂无评论

Web Service Based Method for Large Scale Flow Shops with Flowtime Minimization

Web Service Based Method for Large Scale Flow Shops with Flo...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yi Zhang Xiaoping Li Qian Wang Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China Southeast University Nanjing Jiangsu CN

ISBN: (纸本)1424409624

In this paper, a Web Service based method is presented to conduct parallelized operations in an algorithm on multiple computers. Parallelizable operations in a constructive heuristic for flow shop scheduling problem with total flowtime minimization are analyzed. A parallel heuristic for the problem is described and its parameters are analyzed in theory. The proposed parallel heuristic is compared with the corresponding centralized one. Experimental results show that the proposed method can substantially increase efficiency.

关键词： Web services Large-scale systems Minimization methods Concurrent computing Job shop scheduling Processor scheduling Registers Collaborative work Design engineering Laboratories

来源：评论

学校读者我要写书评

暂无评论

Cost Optimization Method for Workflows with Deadline Constraints in Grids

Cost Optimization Method for Workflows with Deadline Constra...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Yingchun Yuan Xiaoping Li Qian Wang Xia Zhu School of Computer Science and Engineering South-East University Nanjing China Faculty of Information Science Agricultural University of Hebei Baoding China Key Laboratory of Computer Network and Information Integration Ministry of Education South-East University Nanjing China School of Computer Science and Engineering Southeast University Nanjing 210096 P.R. China Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing 210096 P.R. China. qwang@*** Key Laboratory of Computer Network and Information Integration (Southeast University) Ministry of Education Nanjing 210096 P.R. China

ISBN: (纸本)1424409624

Cost optimization for workflow applications with deadline constraints is fundamental and intractable in grids. In this paper, early tree is introduced to find an early feasible schedule for a workflow application. According to the early tree, a cost optimization algorithm is proposed. Taking into account the workflow total float, the workflow deadline is segmented to activity deadlines while keeping precedence constraints. Costs of all activities are locally optimized, so does the workflow cost. Experimental results show that the proposal that this approach can dramatically decrease workflow cost with different deadlines. Moreover, it outperforms other two leveling algorithms in performance on average.

关键词： Cost function Optimization methods Quality of service Delay Partitioning algorithms Constraint optimization Grid computing Collaborative work Design methodology computer science

来源：评论

学校读者我要写书评

暂无评论

MULTI-AGENT BASED FRAMEWORK FOR DYNAMIC SCHEDULING SYSTEM

MULTI-AGENT BASED FRAMEWORK FOR DYNAMIC SCHEDULING SYSTEM

引用

2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)

作者： XIAO-DONG ZHANG QIAN WANG XIAO-PING LI 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

Communication burden and security are important for agent-based scheduling architectures in uncertain and dynamic scheduling environments, which have not yet been fully solved in traditional *** this paper, a multi-agent based framework is *** Network Protocol is combined with Marked-based negotiation protocol to get a trade-off between effectiveness and efficiency.A registration mechanism is given to reduce the communication *** Signature is adopted to enhance the *** well, XML is integrated with KQML to improve the *** with the existing methods, the proposed one is not only securer in data exchanging but also more effective for dynamic scheduling problems.

关键词： Multi-Agent Contract Net Protocol Digital Signature Scheduling

来源：评论

学校读者我要写书评

暂无评论

Efficient Mediated Certificates Public-key Encryption Scheme without Pairings

Efficient Mediated Certificates Public-Key Encryption Scheme...

引用

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

作者： Chen Yang Furong Wang Xinmei Wang Ministry of Education Key Laboratory of Computer Networks and Information Security Xi'an China Department of Electronics & Information Engineering Zhong University of Science and Technology Wuhan China

It has always been a critical issue to find efficient methods for fast revocation of a user's identity in traditional ID-based crypto systems. In this paper, we present an efficient mediated certificateless public-key encryption scheme (MCL-PKE for short) without using bilinear pairing. The proposed MCL-PKE scheme solves the inherent key escrow problem of traditional identity-based cryptosystems and provides instantaneous revocation property simultaneously. In addition, our scheme is IND-CCA secure against two types of adversaries in random oracle based on the hardness of the computational Diffie-Hellman problem.

关键词： Public key Identity-based encryption Public key cryptography Internet computer science education computer networks information security Data structures Authentication Identity management systems

来源：评论

学校读者我要写书评

暂无评论

Design and Analysis of a Multiscale Active Queue Management Scheme

引用

Journal of computer Science & Technology 2006年第6期21卷 1022-1030页

作者：纪其进董永强 School of Computer Science and Engineering Southeast University Nanjing 210096 P.R. China Key Laboratory of Computer Network and Information Integration of Ministry of Education Southeast University Nanjing 210096 P.R China

Since Internet is dominated by TCP-based applications, active queue management （AQM） is considered as an effective way for congestion control. However, most AQM schemes suffer obvious performance degradation with dynamic traffic. Extensive measurements found that Internet traffic is extremely bursty and possibly self-similar. We propose in this paper a new AQM scheme called multiscale controller （MSC） based on the understanding of traffic burstiness in multiple time scale. Different from most of other AQM schemes, MSC combines rate-based and queue-based control in two time scales. While the rate-based dropping on burst level （large time scales） determines the packet drop aggressiveness and is responsible for low and stable queuing delay, good robustness and responsiveness, the queue-based modulation of the packet drop probability on packet level （small time scales） will bring low loss and high throughput. Stability analysis is performed based on a fluid-flow model of the TCP/MSC congestion control system and simulation results show that MSC outperforms many of the current AQM schemes.

关键词： active queue management multiscale traffic burstiness fluid-flow model stability analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：