摘要：The feature extraction algorithm plays an important role in face recognition. However, the extracted features also have overlapping discriminant information. A property of the statistical uncorrelated criterion is that it eliminates the redundancy among the extracted discriminant features, while many algorithms generally ignore this property. In this paper, we introduce a novel feature extraction method called local uncorrelated local discriminant embedding(LULDE). The proposed approach can be seen as an extension of a local discriminant embedding(LDE)framework in three ways. First, a new local statistical uncorrelated criterion is proposed, which effectively captures the local information of interclass and intraclass. Second, we reconstruct the affinity matrices of an intrinsic graph and a penalty graph, which are mentioned in LDE to enhance the discriminant property. Finally, it overcomes the small-sample-size problem without using principal component analysis to preprocess the original data, which avoids losing some discriminant information. Experimental results on Yale, ORL, Extended Yale B, and FERET databases demonstrate that LULDE outperforms LDE and other representative uncorrelated feature extraction methods.

摘要：software testing coverage criteria play an important role in the whole testing *** current coverage criteria for web applications are based on program or *** are not suitable for black-box test or intuitional to *** paper defines a kind of test criteria based on page coverage sequences only navigated by web application,including Page_Single,Page_Post,Page_Pre,Page_Seq2,Page_*** test criteria based on page coverage sequences made by interactions between web application and browser are being under consideration after *** order to avoid ambiguity of natural language,these coverage criteria are depicted using Z formal *** empirical result shows that the criteria complement traditional coverage and fault detection capability criteria.

摘要：In order to evaluate the structural complexity of class diagrams systematically and deeply, a new guiding framework of structural complexity is presented. An index system of structural complexity for class diagrams is given. This article discusses the formal description of class diagrams, and presents the method of formally structural complexity metrics for class diagrams from associations, dependencies, aggregations, generalizations and so on. An applicable example proves the feasibility of the presented method.

摘要：As the hot line in NP-hard problems research in recent years, backbone analysis is crucial for phase transition, hardness, and algorithm design. Whereas theoretical analysis of backbone and its applications in algorithm design are still at a begin- ning state yet, this paper took the quadratic assignment problem （QAP） as a case study and proved by theoretical analysis that it is NP-hard to find the backbone, i.e., no algorithm exists to obtain the backbone of a QAP in polynomial time. Results of this paper showed that it is reasonable to acquire approximate backbone by inter- section of local optimal solutions. Furthermore, with the method of constructing biased instances, this paper proposed a new meta-heuristic -- biased instance based approximate backbone （BI-AB）, whose basic idea is as follows： firstly, construct a new biased instance for every QAP instance （the optimal solution of the new instance is also optimal for the original one）; secondly, the approximate backbone is obtained by intersection of multiple local optimal solutions computed by some existing algorithm; finally, search for the optimal solutions in the reduced space by fixing the approximate backbone. Work of the paper enhanced the research area of theoretical analysis of backbone. The meta-heuristic proposed in this paper provided a new way for general algorithm design of NP-hard problems as well.

摘要：XML data can be represented by a tree or graph and the query processing for XML data requires the structural information among nodes. Designing an efficient labeling scheme for the nodes of Order-Sensitive XML trees is one of the important methods to obtain the excellent management of XML data. Previous labeling schemes such as region and prefix often sacrifice updating performance and suffer increasing labeling space when inserting new nodes. To overcome these limitations, in this paper we propose a new labeling idea of separating structure from order. According to the proposed idea, a novel Prime-based Middle Fraction Labeling Scheme(PMFLS) is designed accordingly, in which a series of algorithms are proposed to obtain the structural relationships among nodes and to support updates. PMFLS combines the advantages of both prefix and region schemes in which the structural information and sequential information are separately expressed. PMFLS also supports Order-Sensitive updates without relabeling or recalculation, and its labeling space is stable. Experiments and analysis on several benchmarks are conducted and the results show that PMFLS is efficient in handling updates and also significantly improves the performance of the query processing with good scalability.

摘要：In this paper a new theory referred to as the decrease-radix design （DRD） is proposed, which is found in the research of logic units of ternary （tri-valued） optical computer. Based on the theory proposed, the principles and the regulations of the DRD for making operation units of multi-valued operation with carrying/borrowing free are also presented. The research work has come to the following important conclusion： let D be a special state contained in n physical informative states, then one may figure out any multi-valued processors within n^（n×n） carrying/borrowing free n-valued units by the composition some of n×n×（n-1） simplest basic operating units according to the regulations of DRD proposed in this paper. The detailed systematic way of our design regulations is highlighted step by step in the paper with an example of design of a tri-valued logic optical operating unit. The real architecture, the procedure, and the experimental results of our sample in tri-valued logic operating unit are given. Finally, a re-constructible model of ternary logical optical processor is introduced. The theory proposed in the paper has laid down a solid foundation for the design of re-constructible carrying/borrowing free operating units in ternary optical computers and can be widely used as the designing reference in a variety of multi-valued logic operating units.

摘要：A method was presented to implement the detecting and tracking of moving targets through omnidirec-tional vision. The method combined optical flow with particle filter arithmetic, in which optical flow field was used to detect and locate moving targets and particle filter was used to track the detected moving objects. According to the circular image character of omnidirectional vision, the calculation equation of optical flow field and the tracking arithmetic of particle filter were improved based on the polar coordinates at the omnidirectional center. The edge of a randomly moving object could be detected by optical flow field and was surrounded by a reference region in the particle filter. A dynamic motion model was established to predict particle state. Histograms were used as the fea-tures in the reference region and candidate regions. The mutual information (MI) and Gaussian function were com-bined to calculate particle weights. Finally, the state of tracked object was computed by the total particle states with weights. Experiment results show that the proposed method could detect and track moving objects with better real-time performance and accuracy.

摘要：Physical unclonable function （PUF） makes use of the uncontrollable process variations during the production of IC to generate a unique signature for each IC. It has a wide application in security such as FPGA intellectual property （IP） protection, key generation and digital rights management. Ring oscillator （RO） PUF and Arbiter PUF are the most popular PUFs, but they are not specially designed for FPGA. RO PUF incurs high resource overhead while obtaining less challenge-response pairs, and requires ＂hard macros＂ to implement on FPGAs. The arbiter PUF brings low resource overhead, but its structure has big bias when it is mapped on FPGAs. Anderson PUF can address these weaknesses of current Arbiter and RO PUFs implemented on FPGAs. However, it cannot be directly implemented on the new generation 28 nm FPGAs. In order to address these problems, this paper designs and implements a delay-based PUF that uses two LUTs in an SLICEM to implement two 16-bit shift registers of the PUF, 2-to-1 multiplexers in the carry chain to implement the multiplexers of the PUF, and any one of the 8 flip-flops to latch 1-bit PUF signatures. The proposed delay-based PUF is completely realized on 28 nm commercial FPGAs, and the experimental results show its high uniqueness, reliability and reconfigurability. Moreover, we test the impact of aging on it, and the results show that the effect of aging on the proposed PUF is insignificant, with only 6% bit-flips. Finally, the prospects of the proposed PUF in the FPGA binding and volatile key generation are discussed.

摘要：软件系统是一种典型类型人造复杂系统。理解他们的进化能导致更好的软件工程惯例。在这份报纸，作者把复杂网络理论用作一个工具分析进化面向对象(OO ) 从一个 multigranularity 观点的软件。首先，网络建模的一个多颗粒度软件被建议从颗粒度的三个层次代表一个多版本软件系统的拓扑的结构。然后，广泛地在复杂网络理论使用的一些参数被使用描绘软件网络。由在连续软件系统跟踪参数值，我们关于软件进化有更好的理解。案例研究在一个开放源代码 OO 工程上被进行， Azureus 当说明我们的途径的一个例子，和位于进化特征下面的一些被揭开。这些结果提供一种不同尺寸给我们软件进化并且也的理解为 OO 软件系统的设计和发展是很有用的。

摘要：A new multi-species particle swarm optimization with a two-level hierarchical topology and the orthogonal learning strategy(OMSPSO) is proposed, which enhances the global search ability of particles and increases their convergence rates. The numerical results on 10 benchmark functions demonstrated the effectiveness of our proposed algorithm. Then, the proposed algorithm is presented to design a butterfly-shaped microstrip patch antenna. Combined with the HFSS solver, a butterfly-shaped patch antenna with a bandwidth of about 40.1% is designed by using the proposed OMSPSO. The return loss of the butterfly-shaped antenna is greater than 10 d B between 4.15 and 6.36 GHz. The antenna can serve simultaneously for the high-speed wireless computer networks(5.15–5.35 GHz) and the RFID systems(5.8 GHz).