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

2012 International Conference on Innovations in information Technology, IIT 2012

作者： Zhao, Wei Wang, Yi Li, Renfa Embedded System and Network Laboratory Hunan University Changsha Hunan 410082 China Hunan Province Key Laboratory of Network and Information Security Hunan University Changsha Hunan 410082 China College of Information Science and Engineering Hunan University Changsha Hunan 410082 China Department of Electrical and Computer Engineering National University of Singapore Singapore 117576 Singapore

ISBN: (纸本)9781467311014

Recently, there is a new kinds of cryptographic algorithms are proposed to meet the requirements of "lightweight" applications. PRESENT is one of them, which is built based on 4-bit substitution transformation (S-box) and suitable for low cost hardware implementations. Usually, there needs two 4-bit S-boxes, Sp, ISp, for PRESENT encryption and decryption, in which ISp can be computed from Sp. Therefore, we proposed a unified architecture to supporting the operations of PRESENT encryption and decryption. There also exists a kind of power analysis attacks pose a serious threat on hardware based PRESENT. In order to resist against DPA, we proposed a new masking scheme for PRESENT, in which the nonlinear substitution needs to be carefully masked. In order to reduce the hardware resources for the proposed masking scheme, we reuse the masked Sp to generate masked ISp. The experimental results show that our proposed unified masked PRESENT takes up only one time larger than the unmasked existing design. But, it is obvious that our proposed design has the ability to defend against DPA. © 2012 IEEE.

关键词： computer architecture

来源：评论

学校读者我要写书评

暂无评论

The method for constructing block sparse measurement matrix based on orthogonal vectors

The method for constructing block sparse measurement matrix ...

引用

13th Pacific-Rim Conference on Multimedia, PCM 2012

作者： Zhao, Ruizhen Qin, Zhou Tang, Jinhui Institute of Information Science Beijing Jiaotong University Beijing 100044 China Key Laboratory of Advanced Information Science and Network Technology of Beijing Beijing 100044 China School of Computer Science Nanjing University of Science and Technology Nanjing 210094 China

ISBN: (纸本)9783642347771

Compressive sensing is a new way of information processing which recover the original signal through acquiring much fewer measurements with a measurement matrix. The measurement matrix has an important effect in signal sampling and reconstruction algorithm. However, there are two main problems in currently existing matrices: the difficulty of hardware implementation and high computation complexity. In this paper, we proposed a class of highly sparse and deterministic scrambled block measurement matrices based on orthogonal vectors (SBOV). It could improve sensing efficiency and reduce computation complexity. Those matrices constructed by the proposed method only need very little memory space and they could be easily implemented in hardware due to their simple entries. Some experiments show the better imaging performance comparable to scrambled block Hadamard matrix (SBH) and dense partial Hadamard matrix. SBOV matrices are simpler and sparser than SBH matrix. © 2012 Springer-Verlag.

关键词： Compressed sensing

来源：评论

学校读者我要写书评

暂无评论

Large scale temporal RDFS reasoning using MapReduce 26

Large scale temporal RDFS reasoning using MapReduce

引用

26th AAAI Conference on Artificial Intelligence and the 24th Innovative Applications of Artificial Intelligence Conference, AAAI-12 / IAAI-12

作者： Liu, Chang Qi, Guilin Yu, Yong Shanghai Jiao Tong University China Key Laboratory of Computer Network and Information Integration of State Education Ministry School of Computer Science and Engineering Southeast University China 311 Yifu Building 800 Dongchuan Road Shanghai 200240 China

ISBN: (纸本)9781577355687

In this work, we build a large scale reasoning engine under temporal RDFS semantics using MapReduce. We identify the major challenges of applying MapReduce framework to reason over temporal information, and present our solutions to tackle them. Copyright © 2012, Association for the Advancement of Artificial Intelligence. All rights reserved.

关键词： MapReduce

来源：评论

学校读者我要写书评

暂无评论

Efficient iterated greedy algorithm to minimize makespan for the no-wait flowshop with sequence dependent setup times

Efficient iterated greedy algorithm to minimize makespan for...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Tao Xu Xia Zhu Xiaoping Li Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

In this paper, an efficient iterated greedy algorithm is proposed for the SDST (Sequence Dependent Setup Time) no-wait flowshop with makespan minimization, which is known to be NP-hard. By introducing effective operators, the Iterated Greedy algorithm is adapted to the considered problem. To improve the quality of solutions, Local Search is incorporated into the modified Iterated Greedy algorithm. The proposed algorithm is compared with BIH, GAPH1-GAPH4, and IG_Ruiz on Taillard's instances of ssd10, ssd50, ssd100, and ssdl25. Experimental results demonstrate that the proposal outperforms BIH and GAPH1-GAPH4. As well, the proposal is more effective than IG_Ruiz under the same computation-time criterion.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Application of SS-MVPN technology in mobile network

Application of SS-MVPN technology in mobile network

引用

2012 International Conference on Electrical Insulating Materials and Electrical Engineering, EIMEE 2012

作者： Hang, Qiangwei Chen, Bing Hou, Qiang Key Laboratory of Information Network Security Ministry of Public Securitythe 3rd research institute of ministry of public security Shanghai China Dept. of computer engineering of Tongji University Shanghai China

ISBN: (纸本)9783037854518

More and more people are using mobile equipments to access business resources from the organization's internal network, how to ensure the data security in the data transport process of mobile intelligent terminals is becoming an urgent need to address issues. This paper proposes a new solution of mobile VPN which using the SSL to protect the data flow and SOCKS5 proxy technology to redirect flow, and gives the analysis of its performance improvement principles. © (2012) Trans Tech Publications, Switzerland.

关键词： Wireless networks

来源：评论

学校读者我要写书评

暂无评论

BAsplice: Bi-direction alignment for detecting splice junctions

BAsplice: Bi-direction alignment for detecting splice juncti...

引用

2012 IEEE 6th International Conference on Systems Biology, ISB 2012

作者： Bu, Jingde Wu, Jiayan Chen, Meili Xiao, Jingfa Yu, Jun Chi, Xuebin Jin, Zhong Supercomputing Center Computer Network Information Center Chinese Academy of Sciences Beijing China CAS Key Laboratory of Genome Sciences and Information Beijing Institute of Genomics Chinese Academy of Sciences Beijing China Graduate University Chinese Academy of Sciences Beijing China

ISBN: (纸本)9781467343985

RNA-Seq is a revolutionary whole transcriptome shotgun sequencing technology performed by high-throughput sequencers, which provide more comprehensive information on differential expression of genes and benefit on novel splice variants identification. RNA-Seq reads is so short that it's a great challenge on mapping reads back to the reference effectively, especially when they span two or more exons. To improve the mapping efficiency, we introduce here a bi-direction alignment tool - BAsplice, which use RNA-Seq data to detect splice junctions without any additional information. Compare with another splice junction mapping software, SOAPsplice, BAsplice performs better in call rate and running time, but a little worse in accuracy. BAsplice is a free open-source software written in C language. It is available at https://***/vlcc/basplice. © 2012 IEEE.

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

Deadline partitioning for periodic messages transmission over Switched Ethernet with non-preemptive EDF

引用

Journal of Computational information Systems 2012年第17期8卷 7171-7180页

作者： Tan, Ming Wei, Zhen Hefei University Key Laboratory of Network and Intelligent Information Processing Hefei China Hefei University of Technology School of Computer and Information Hefei China

When applying Switched Ethernet in real-time communications, the switch and the end-nodes schedule the real-time messages using Earliest Deadline First (EDF) algorithm. The problem we are facing is how to divide deadlines of real-time messages between the transmission link (from source-node to switch) and the reception link (from switch to destination-node), which is referred to as the problem of deadline partitioning. In this paper, an improved feasibility check method for periodic real-time messages scheduled under non-preemptive EDF was presented. In addition, the feasibility analysis of real-time periodic messages when Instances of messages are early released was given and proved by using real-time scheduling theory. Particularly, we proposed an algorithm for calculating the minimum non-preemptive EDF-feasible deadline of real-time messages. Moreover, a novel deadline partitioning scheme called MDPS (Deadline Partitioning Scheme based Deadline Minimization) was developed. By computing the minimum non-preemptive EDF-feasible deadlines and balancing the slack deadline of real-time messages on the transmission link and the reception link, MDPS can optimize deadline partitioning of real-time messages. The simulation results show that the MDPS performs better than the currently used deadline partitioning scheme referred to as ADPS in terms of using the aggregated switch throughput and the message missing ratio. © 2012 Binary information Press.

关键词： Scheduling algorithms

来源：评论

学校读者我要写书评

暂无评论

Localization in 3D Sensor networks Using Stochastic Particle Swarm Optimization

引用

Wuhan University Journal of Natural Sciences 2012年第6期17卷 544-548页

作者： ZHANG Zhangxue CUI Huanqing Fujian Institute of Scientific and Technology Information Fuzhou 350003FujianChina Fujian Strait Information Technology Co.Ltd.Fuzhou 350003 FujianChina Shandong Computer Science Center Shandong Provincial Key Laboratory of Computer NetworkJinan 250014ShandongChina College of Information Science and Engineering Shandong University of Science and TechnologyQingdao 266590ShandongChina

Localization is one of the key technologies in wireless sensor networks,and the existing PSO-based localization methods are based on standard PSO,which cannot guarantee the global *** the sensor network deployed in a three-dimensional region,this paper proposes a localization method using stochastic particle swarm *** measuring the distances between sensor nodes,the sensor nodes estimate their locations using stochastic particle swarm optimization,which guarantees the global convergence of the *** simulation results show that the localization error of the proposed method is almost 40% of that of multilateration,and it uses about 120 iterations to reach the optimizing value,which is 80 less than the standard particle swarm optimization.

关键词： wireless sensor network localization stochasticparticle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

A hybrid genetic algorithm for resource-constrained multi-project scheduling problem with resource transfer time

A hybrid genetic algorithm for resource-constrained multi-pr...

引用

IEEE International Conference on Automation Science and Engineering (CASE)

作者： Zhicheng Cai Xiaoping Li School of Computer Science & Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Nanjing PR China

The RCMPSPTT (resource-constrained multi-project scheduling problem with resource transfer time) problem usually exists in distributed collaborative manufacturing systems, in which scarce resources are shared by different projects dispersed in distributed physical places. Resources are needed to be transferred among different projects with non-neglectable time. In this paper, a hybrid genetic algorithm is proposed for the considered problem. Besides standard operators, EPS (Elite population based dual Population Structure) and VNS (Variable Neighborhood Search) operators are introduced for both diversification and intensification consideration to improve effectiveness. The EPS keeps the elite solutions found during the search and they are updated using a similarity strategy. The VNS generates new solutions by a proposed local search strategy. Experiments show that 26.1% has been improved on solutions by DGAVNS compared with an existing priority rule based heuristic algorithm.

关键词： Genetic algorithms Biological cells Sociology Statistics Schedules Search problems Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

An improved harmony search algorithm for blocking job shop to minimize makespan

An improved harmony search algorithm for blocking job shop t...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Peiying Hou Dandan Wang Xiaoping Li School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration South East University Nanjing China

In this paper, Harmony Search is applied to the blocking job shop problem with makespan minimization. According to the characteristics of the considered problem, a decoding method is introduced to generate feasible solutions. A rule is proposed to improvise new harmonies. Some approaches are developed to determine the harmony search considering rate, the pitch adjusting rate, the dynamic harmony memory. A local search is investigated to further improve quality of the solutions. Results of numerical experiments on classical benchmark instances show that the proposed algorithm can improve makespan 16.50% on average.

关键词： Educational institutions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：