>The revolution of biotechnology has pushed forward life sciences into the Big Data era.Particularly,high-throughput bio-techniques have greatly accelerated the integration of biology,computing and informatics,and hence substantially pushed forward the development of bioinformatics and computational biology.According to the latest report of data deposition within National Centre for Biotechnology Information(NCBI),the genome sequencing projects have increased 49.94%,the sequence reads generated from next generation sequencing have increased 44.37%and the protein sequences have increased 39.85%,compared with the

The design of efficient dynamic task scheduling and fault‐tolerant mechanism is an issue of crucial importance in high‐performance computing field .Most existing methods ,however ,can hardly achieve good scalability on large‐scale system .In this paper , we propose a scalable dynamic task scheduling model via N‐level queuing theory ,which dramatically reduces the programming burden by providing programmer with concise parallel programming framework .On one hand ,we utilize the Poisson process theory to analyze the average wait time of tasks ,and then decide the task layers according to threshold .On the other hand ,we reduce the fault tolerance overhead using region‐aware light‐weight degradation model .Experimental results with Micro Benchmark on Bluelight system with 32 768 cores show that our method achieves good scalability when the tasks take 3.4 s on average and the overhead is just 7 .2% of traditional model .Running on 16 384 cores ,pharmacological application DOCK achieves performance improvement by 34.3% with our scheduling .Moreover ,the results of DOCK show our fault‐tolerant model achieves 3.75% ~ 5.13% performance improvements over traditional mechanism .

Lattice reduction algorithms play an important role in the field of cryptanalysis. In this paper, based on the strategies of genetic algorithm, a new lattice reduction algorithm is proposed through the transformation of the initial lattice basis. The new algorithm always can obtain a shorter vector and a higher quality basis compared with the original algorithms. By the new algorithm, some lattice bases of the Shortest Vector Problem (SVP) challenge are experienced and the outputs of the new algorithm can always reach or break the records on the internet which illustrates that the new algorithm behaves well.

Lattice basis reduction algorithms are important tools in the area of cryptanalysis. LLL algorithm is one the most famous algorithms and the parallelization of LLL algorithm has been received increasing attentions. In this paper, the traditional block-based LLL algorithm is implemented in a parallel system and the efficiency is analyzed. With the analysis result, we indicate the bottleneck of the traditional block-based algorithm and give a new parallel implementation scheme of block-based LLL algorithm. The experimental results show that the new scheme behaves much better comparing to the old one.

Most available identity-based authenticated key agreement protocols require that both protocol participants are from the same PKG(Private Key Generator) environment.However,safe communication is requisite between protocol participants that are from different PKG environment in practice.In this paper,a new identity-based AKA(Authenticated Key Agreement) protocol is proposed in multiple PKG environment,which makes use of a new technique called twin Diffie-Hellman problem.Moreover,the security of the proposed protocol can be reduced to the standard CDH and BDH assumption in the eCK model,which makes use of the trapdoor test technology proposed by Cash et al in Eurocrypt 2008.

The password-based security mechanism is often used to encrypt user log-on, personal e-account, document data and other information systems, and thus to protect e-account security and user information security. A secure password generator is designed and implemented through the method of "selection, extension and transform of characters" in this paper. It is guaranteed that the password is easy to be remembered while enough secure, thus enhancing the security of the information system password authentication scheme.