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

Recursive constructions and counting of orthomorphic permutations

Tongxin Xuebao/Journal on Communications 2011年第11 A期32卷 204-208页

作者： Zhang, Feng-Rong Hu, Yu-Pu Ma, Hua Xie, Min Gao, Jun-Tao Key Laboratory of Computer Network and Information Security Ministry of Education Xidian University Xi'an 710071 China School of Science Xidian University Xi'an 710071 China State Key Laboratory of Information Security Graduate University of Chinese Acad. of Sci. Beijing 100049 China

The properties and known constructions of orthomorphic permutations were investigated. On this basis, a new recursive method to construct an n-variable orthomorphic permutations from two (n-2)-variable ones is presented. Furthermore, the new constructed orthomorphic permutations are different from the known ones. In addition, the constructed orthomorphic permutations are pair-wise different. Finally, combining the known orthomorphic permutations and a special class of orthomorphic permutations, the number of the new constructed orthomorphic permuta-tions is proposed.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Quantum broadcast communication with authentication

引用

Chinese Physics B 2010年第7期19卷 63-67页

作者：杨宇光王叶红温巧燕 College of Computer Science and Technology Beijing University of Technology State Key Laboratory of Information Security (Graduate University of Chinese Academy of Sciences) State Key Laboratory of Integrated Services Network Xidian University State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications

Two simple quantum broadcast communication schemes are proposed. A central party can broadcast his secret message to all the legitimate receivers simultaneously. Compared with the three schemes proposed recently （Wang et al. 2007 Chin. Phys. 16 1868）, the proposed schemes have the advantages of consuming fewer quantum and classical resources, lessening the difficulty and intensity of necessary operations, and having higher efficiency.

关键词： quantum broadcast communication authentication quantum secure direct communication

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

An effective heuristic for on-line tenant placement problem in SaaS

An effective heuristic for on-line tenant placement problem ...

引用

2010 IEEE 8th International Conference on Web Services, ICWS 2010

作者： Zhang, Yi Wang, Zhihu Gao, Bo Guo, Changjie Sun, Wei Li, Xiaoping School of Computer Science and Engineering Southeast University 210096 Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education China IBM Research-China 100096 Beijing China

ISBN: (纸本)9780769541280

As one of the key characteristics of Software as a Service (SaaS), multi-tenancy aims to support massive customers by sharing application instances and databases. To achieve the high economies of scale, one of the most issues needing to be solved in the real industry is that, given a fixed number of nodes, how to optimally place on-boarding tenants to maximize the total supported number of tenants without violating their SLA requirements. This paper focuses on this problem, which is called On-line Tenant Placement Problem (OTPP). In order to calculate the resource consumption of onboarding tenants, a novel resource consumption estimation model for multi-tenant pattern is proposed in this paper. Based on this model, we explore the complexity of OTPP. A robust heuristic is proposed for the OTPP. The simulation experimental results show the high effectiveness and the good efficiency of our algorithm. © 2010 IEEE.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Scalable Arbitrated Quantum Signature of Classical Messages with Multi-Signers

引用

Communications in Theoretical Physics 2010年第7期54卷 84-88页

作者：杨宇光王园腾义伟柴海平温巧燕 College of Computer Science and Technology Beijing University of Technology State Key Laboratory of Information Security Graduate University of Chinese Academy of Sciences State Key Laboratory of Integrated Services Network Xidian University State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications

Unconditionally secure signature is an important part of quantum cryptography. Usually, a signature scheme only provides an environment for a single signer. Nevertheless, in real applications, many signers may collaboratively send a message to the verifier and convince the verifier that the message is actually transmitted by them. In this paper, we give a scalable arbitrated signature protocol of classical proved to be secure even with a compromised arbitrator. messages with multi-signers. Its security is analyzed and proved to be secure even with a compromised arbitrator.

关键词： arbitrated signature quantum signature quantum cryptography

来源：评论

学校读者我要写书评

暂无评论

Video steganography using motion vector and linear block codes

Video steganography using motion vector and linear block cod...

引用

2010 IEEE International Conference on Software Engineering and Service Sciences, ICSESS 2010

作者： Pan, Feng Xiang, Li Yang, Xiao-Yuan Guo, Yao Key Laboratory of Network and Information Security of APF Engineering College of the Armed Police Force Xi'an China Key Laboratory of Computer Network and Information Security of the Ministry of Education Xidian University Xi'an China

ISBN: (纸本)9781424460526

A novel video steganography scheme based on motion vectors and linear block codes has been proposed in this paper. Our method embed secret messages in the motion vectors of cover media during the process of H.264 compressing. Linear block codes has been used to reducing the modification rate of the motion vectors. The proposed steganographic scheme is not only has lowly computational complexity, but also has highly imperceptible to human being. Furthermore, the secret information can be extracted directly without using the original video sequences. Experiments are designed to prove the feasibility of the proposed method. Experimental results show that our proposed scheme can embed large amounts of information and can maintain good video quality as well. © 2010 IEEE.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Distance estimation by constructing the virtual ruler in anisotropic sensor networks

Distance estimation by constructing the virtual ruler in ani...

引用

IEEE INFOCOM 2010

作者： Wang, Yun Li, Kai Wu, Jie School of Computer Science and Engineering Southeast University Key Lab. of Computer Network and Information Integration Nanjing 210096 China Department of Computer and Information Sciences Temple University Philadelphia PA 119122 United States

ISBN: (纸本)9781424458363

Distance estimation is fundamental for many functionalities of wireless sensor networks and has been studied intensively in recent years. A critical challenge in distance estimation is handling anisotropic problems in sensor networks. Compared with isotropic networks, anisotropic networks are more intractable in that their properties vary according to the directions of measurement. Anisotropic properties result from various factors, such as geographic shapes, irregular radio patterns, node densities, and impacts from obstacles. In this paper, we study the problem of measuring irregularity of sensor networks and evaluating its impact on distance estimation. In particular, we establish a new metric to measure irregularity along a path in sensor networks, and identify turning nodes where a considered path is inflected. Furthermore, we develop an approach to construct a virtual ruler for distance estimation between any pair of sensor nodes. The construction of a virtual ruler is carried out according to distance measurements among beacon nodes. However, it does not require beacon nodes to be deployed uniformly throughout sensor networks. Compared with existing methods, our approach neither assumes global knowledge of boundary recognition nor relies on uniform distribution of beacon nodes. Therefore, this approach is robust and applicable in practical environments. Simulation results show that our approach outperforms some previous methods, such as DV-Distance and PDM. ©2010 IEEE.

关键词： Anisotropy

来源：评论

学校读者我要写书评

暂无评论

Animating 2D moving deformable objects based on complex barycentric coordinates

引用

Journal of information and Computational Science 2011年第9期8卷 1533-1540页

作者： Deng, Zhengjie Li, Zheng Liang, Yun Su, Zhuo School of Information Science and Technology Sun Yat-sen University Guangzhou 510006 China Shenzhen Key Laboratory of Digital Living Network and Content Service Shenzhen Guangdong 518057 China Research Institute of Sun Yat-sen University in Shenzhen Shenzhen Guangdong 518057 China Faculty of Computer Guangdong University of Technology Guangzhou 510006 China College of Informatics South China Agricultural University Guangzhou 510642 China

In 2D animation processes, many simulated the movement and the deformation of a moving deformable object simultaneously. The binding of the movement and the deformation increased the complexity and restricted user's freedoms, to implement the animations. In our approach, an object's motion is decomposed into a moving component and a deforming component. The moving component can be any pre-configure rigid motion. Driven by the moving component, a static object becomes a moving object. The deforming component is a space deformation for the moving object. To full the deforming component, a novel method is derived from the space deformation method-complex barycentric coordinates. At last, the moving object driven by the deforming component is animated as the user's desire. In this way, the movement and the deformation are handled separately, which reduces the complexity and gives users more freedoms. Experimental results show that users can easily animate many kinds of moving deformable objects with our method. Copyright © 2011 Binary information Press.

关键词： Deformation

来源：评论

学校读者我要写书评

暂无评论

A cooperative method for supervised learning in Spiking neural networks

A cooperative method for supervised learning in Spiking neur...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Hong, Shen Ning, Liu Xiaoping, Li Qian, Wang School of Computer Science and Engineering Southeast University Nanjing China School of Golden Audit Nanjing Audit University Nanjing China Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University Nanjing China

ISBN: (纸本)9781424467631

In Spiking neural networks, information is encoded in separate spike times. The traditional gradient descent based learning algorithm (SpikeProp) trends to be trapped in local optima and cannot converge if the negative synaptic weights are allowed. In this paper, a cooperative PSO (Particle Swarm Optimization) method is proposed for its supervised learning. A simplified neural network structure is suggested. The CPSO-based learning method can improve both the weights of the spike neurons and the delays between the neurons. Both the positive and negative weights can be preserved by the biological neurons. Experiments on benchmark problems show the proposal is reliable and efficient for learning spike patterns. © 2010 IEEE.

关键词： Neural networks

来源：评论

学校读者我要写书评

暂无评论

Achieving fair non-repudiation for web services transaction

Achieving fair non-repudiation for web services transaction

引用

2010 2nd International Conference on Education Technology and computer, ICETC 2010

作者： Su, Rui-Dan Fu, Shao-Feng Zhou, Li-Hua Key Laboratory of Computer Network and Information Security Ministry of Education Xidian University 710071 Xian Shaanxi China

ISBN: (纸本)9781424463688

For safeguarding the interests of web services transaction parties, non-repudiation mechanism need assure fairness and timeliness. The non-repudiation service implemented currently mostly 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 complexity of interaction. This 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 protocol which provides a fair non-repudiation solution to secure web services transactions and can be embedded into single web service call. Evidence chaining is exploited to decrease the overhead of evidence verification and management and alleviates the overhead of certificate revocation checking and time-stamp generation for signatures. The protocol owns properties of strong fairness, timeliness, efficiency and practicability. © 2010 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：