A security patch for a three-party key exchange protocol

The CLC protocol (proposed by Tzung-Her Chen, Wei-Bin Lee and Hsing-Bai Chen, CLC, for short) is a new three-party password-authenticated key exchange (3PAKE) protocol. This CLC protocol provides a superior round efficiency (only three rounds), and its resources required for computation are relatively few. However, we find that the leakage of values A _V and B _V in the CLC protocol will make a man-in-the-middle attack feasible in practice, where A _V and B _V are the authentication information chosen by the server for the participants A and B. In this paper, we describe our attack on the CLC protocol and further present a modified 3PAKE protocol, which is essentially an improved CLC protocol. Our protocol can resist attacks available, including man-in-the-middle attack we mount on the initial CLC protocol. Meanwhile, we allow that the participants choose their own passwords by themselves, thus avoiding the danger that the server is controlled in the initialization phase. Also, the computational cost of our protocol is lower than that of the CLC protocol.     

Pre-processing for time domain image formation in SS-BSAR system

A pre-processing procedure is designed for a space-surface bistatic synthetic aperture radar (SS-BSAR) system when a time domain image formation algorithm is employed. Three crucial technical issues relating to the procedure are fully discussed. Firstly, unlike image formation algorithms operating in the frequency domain, a time domain algorithm requires the accurate global navigation satellite system (GNSS) time and position. This paper proposes acquisition of this information using a time-and-spatial transfer with precise ephemeris and interpolation. Secondly, synchronization errors and compensation methods in SS-BSAR are analyzed. Finally, taking the non-ideal factors in the echo and the compatibility of image formation algorithms into account, a matched filter based on the minimum delay is constructed. Experimental result using real data suggest the pre-processing is functioning properly.     

Dynamic domain decomposition method and its application on nonlinear problem

In this paper,domain decomposition method(DDM) for numerical solutions of mathematical physics equations is improved into dynamic domain decomposition method(DDDM) . The main feature of the DDDM is that the number,shape and volume of the sub-domains are all flexibly changeable during the iterations,so it suits well to be implemented on a reconfigurable parallel computing system. Convergence analysis of the DDDM is given,while an application approach to a weak nonlinear elliptic boundary value problem and a ...     

Regularization strategy for the Cauchy problem of Laplace’s equation from the viewpoint of regularization theory

Within the framework of the regularization theory, a spectral regularization method is introduced and analyzed. The convergence estimate under an appropriate choice of regularization parameter is obtained. A numerical implementation is described. Numerical examples show that the proposed method is effective and stable.     

40-Gb/s all-optical digital 4-bit priority encoder employing cross-gain modulation in semiconductor optical amplifiers

High-speed all-optical logic circuits have attracted much attention because of their important roles in signal processing in next-generation optical networks.The digital encoder is widely used in binary calculation,multiplexing,demultiplexing,address recognition and data encryption.A priority encoder allows the existence of multiple valid inputs simultaneously,identifies the priority of the request signals and encodes the priority.We propose and experimentally demonstrate an all-optical 4-bit priority encoder for return-to-zero signals at 40 Gbit/s based on cross-gain modulation in semiconductor optical amplifiers.Detuning fil-ters after semiconductor optical amplifiers are employed to improve the output performance.Correct logic bit sequences and clear open eye patterns with extinction ratios exceeding 10 dB are achieved.     

MJH-200/415E机载锚杆机的试验与应用

通过与传统机掘支护工艺的比较得出,在巷道掘进中,运用机载锚杆钻机,不仅能提高掘进速度,还能减少人工投入,降低员工的劳动强度,有利于提高单进水平,实现掘锚一体化.     

Genome-wide association studies of 14 agronomic traits in rice landraces

Uncovering the genetic basis of agronomic traits in crop landraces that have adapted to various agro-climatic conditions is important to world food security. Here we have identified ～ 3.6 million SNPs by sequencing 517 rice landraces and constructed a high-density haplotype map of the rice genome using a novel data-imputation method. We performed genome-wide association studies (GWAS) for 14 agronomic traits in the population of Oryza sativa indica subspecies. The loci identified through GWAS explained ～ 36% of the phenotypic variance, on average. The peak signals at six loci were tied closely to previously identified genes. This study provides a fundamental resource for rice genetics research and breeding, and demonstrates that an approach integrating second-generation genome sequencing and GWAS can be used as a powerful complementary strategy to classical biparental cross-mapping for dissecting complex traits in rice.     

A new approach of available transfer capability incorporating wind generation

The approach of available transfer capability (denoted as ATC) incorporating wind generation has been paid very high attention since the development of wind generation. Based on the maximum function, this paper presents an ATC model. The characteristic of the new model is twofold. First, it considers wind turbines connected to power system and static security of power system simultaneously. Second, it is a system of semismooth equations and can be solved easily. By using the smoothing strategy, a smoothing Newton method is adopted for solving the proposed new ATC model. Numerical simulation results of the IEEE 30-bus and 118-bus system show that the new model and algorithm are feasible and effective. The impact of wind turbines connected to power system on ATC is also analyzed.     

基于批分离实验的最大独立集问题DNA算法

根据解决最大独立集问题的需要,讨论了简化的粘贴模型,该模型只由单链DNA的存储链和分离板组成.以分离实验为基础提出了批分离实验和生化操作过程,该实验可以快速分离存储链.基于批分离实验设计了最大独立集问题的DNA算法,并给出其生化实现过程:先形成所有顶点子集的初始解空间;接着用批分离实验对每个顶点进行检测,筛选全部满足不相邻要求的顶点子集,从而得到全部独立集;然后通过电泳实验得到全部最大独立集;最后通过检测实验输出实验结果.讨论并证明了算法的正确性和复杂性,算法的操作次数是线性的,通过仿真实验说明了算法的有效性和可行性.     

Accurate localization and excision of genomic islands in four strains of <Emphasis Type="Italic">Pseudomonas aeruginosa</Emphasis> and <Emphasis Type="Italic">Pseudomonas fluorescens</Emphasis>

Mobile genomic islands (GIs) can be excised from the chromosome, then form a circular intermediate and be reintegrated into the chromosome by the GI internal integrase. Some mobile GIs can also be transferred into a new receptor cell by transformation, conjugation, or transduction. The action sites of the integrase are usually flanked direct repeats (DRs) of the GIs. Accurate localization of the flanking sequences is a precondition for determining the mobility of the GI. Mobile GIs are generally associated with transfer RNAs (tRNAs). Based on the correlation between flanking sequences and tRNA sequences, the flanking sequences of 11 putative mobile GIs in Pseudomonas aeruginosa PAO1, P. aeruginosa PA14, P. fluorescens Pf-5 and P. fluorescens Pf0-1 were identified. Among the 11 GIs, Pf0-1GI-1 is responsible for benzoate degradation. PAO1GI-1, Pf5GI-2, Pf5GI-3, and Pf5GI-4 were confirmed experimentally to be excised from a chromosome to form a circular intermediate. The action sites of the integrases are these GIs direct repeats. Due to distinct DRs, cutting sites for the internal integrase of PAO1GI-1, Pf5GI-2, Pf5GI-3 and Pf5GI-4 were determined outside the T-loop of the tRNA^Gly gene, outside the anticodon loop of the tRNA^Ser gene and tRNA^Lys gene, and at the asymmetric 3′-end of the tRNA^Leu gene, respectively. PAO1GI-1 and other mobile GIs may be transferred into many different strains that belong to different phyla because of the clear flanking sequences. This study describes basic information about the action sites of the integrases, assesses the mobility of GIs, and can help design and transfer mobile GIs to candidate strains.