<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005">
<channel xmlns:cfi="http://www.microsoft.com/schemas/rss/core/2005/internal" cfi:lastdownloaderror="None">
<title cf:type="text"><![CDATA[Editorial department of the Journal of National University of Defense Technology -->Computer Science and Technology]]></title>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The System Architecture of an Intelligent Machine]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper puts forward the architecture and organization of a high performance prolog-oriented intelligent machine system，which comprises a conventional computer as its host. A powerfull prolog processor supported by a special hardware is its back-end machine. Although the architecture of the system is simple，the performance is very high. Simulation results show that the performance of the  system is about 500 KLIPS for logical inference and 17 MIPS for numerical calculations.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Pu, Zhang Chenxi and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Pu, Zhang Chenxi and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004001]]></guid><cfi:id>653</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Analysis of Utility Bandwidth of Memory with Multibank]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Using the queueing theory, the queue model of memory with multibank in tightly-coupled multiprocessor system is constructed. The   analyt1c expression of memory utility bandwidth is given by analysing the busy period of a bank. The relationship among the rate λ of  the accessing memory of processors，the serving rate μ of a bank and the number m of banks is studied under the condition of keeping  the memory utility bandwidth maximum.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wu Tao and Chen Fujie]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wu Tao and Chen Fujie</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004002]]></guid><cfi:id>652</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[KER: A Knowledge Acquisition Algorithm with Knowledge Evaluation and Knowledge Refinement]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper gives a decision-tree algorithm acquiring many kinds of knowledge. The algorithm depends on the given priority and type of   attributes to acquire the classified type of knowledge. In order to ensure the effectiveness of the acquired knowledge，a kind of  evidence support degree to evaluate knowledge is proP9sed according to Cohen's inductive probability，and a kind of knowledge refinement method is given correspondingly.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Li and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Li and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004003]]></guid><cfi:id>651</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Similarity Criterion and its Verification Method in Analogical Reasoning]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In artificial inte11igent，analogical reasoning is an important field of study，and similarity criterion is a significant concept of  analogical reasoning. The paper gives a descriptive framework of analogical reasoning, and a definition of similarity criterion. Based  on term rewriting technique，the paper proposes a verification method of the simi1arity criterion.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Shaoping, Wang Huaimin and Chen Huowang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Shaoping, Wang Huaimin and Chen Huowang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004004]]></guid><cfi:id>650</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Compiler Implementation of Parallel Programming Language on Serial Machine]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[At present the array-array (matrix-matrix) opreation has been introduced into parallel programming languages，such as Fortran 8x.    This makes compiler implementation on serial machine difficut. This paper proposes the concept of “serialization” and gives the  algorithm about serial opreating.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Guo Qiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Guo Qiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004005]]></guid><cfi:id>649</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Chebyshev Approximation of Tangent functions and the Accelerated Computional Method of the Coefficients of the Tangent Functions]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The rational and Chebyshev approximation polynomials of tangent are given. The acceleratd computational methods of the Chebyshev  coefficients are also presented. The experimental results on the YH-l super-computer show that using the coefficients with this   accelerated，method. the accuracy can be increased by 30% compared with the original confficients.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Li Xiaomei, Wang Hongbin and Zhao Zichun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Li Xiaomei, Wang Hongbin and Zhao Zichun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004006]]></guid><cfi:id>648</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Implementation of the Distributed Programming for the Multiprocessor System in a Robot Force-Feedback Compliance Controller]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper introduces a method of the realization of the distributed programming by combining programming language C with distributed library function in the robot force-feedback compliance controlling multiprocessor system. The form of the distributed library   function，the multiprocessor operating system function supporting the design of the distributed library function，and some problems   which have to be emphasized in the design process are described. A simple distributed program example is also given.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Xiao Renqing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Xiao Renqing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004007]]></guid><cfi:id>647</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Computer Architecture Used in Robot Force-Feedback Compliance Control]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A new computer architecture-MIMD multimicroprocessor parallel processing system used in robot force-feedback compliance control-is described from the views of system hardware and software. The system is designed for fulfiling a practical research project. It can    efficiently and parallelly process the multitask in the robot force/position mixed control. The realization of the system will make  the servo-control period shorten to 5 ms and meet various needs of robot control tasks.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zou Fengxing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zou Fengxing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004008]]></guid><cfi:id>646</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Performance Analysis of an Intelligent Machine]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Some techniques used to enhance the performance of an intelligent machine is described. The performance of the machine is simulated.  Simulation results show that the average inference speed of an intelligent machine is about 500 KLIPS，which is twice as fast as  Japan's PSI-Ⅱ and 2 times faster than PLM developed by Berkeleg College of California Univ. in U .S.A]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Pu, Zhang Chenxi and Zhu Haibin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Pu, Zhang Chenxi and Zhu Haibin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004009]]></guid><cfi:id>645</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[MT-l: A Tool for Microcomputer Management Information Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[MT-1 is a database management system based on dBASE-Ⅲ. It has a graphic language for data description and manipulation. It is a  useful tool for the development of MISS. It is superior to dBASE-Ⅲ in many aspects，such as graphic user interface，data dictionary，views，data integrity and security，etc. This paper describes the architecture of MT-l，and discusses some issues of its design and  implementation.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Qin Xiao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Qin Xiao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004010]]></guid><cfi:id>644</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Implementation of Vector Statements in YFT77]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A language extension method through the transformation from source language to intermediate language is presented in this paper.    This method has been used in the implementation of vector statements in YFT77 and it has been proved to be efficient and practical.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Kejun and Guo Kerong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Kejun and Guo Kerong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004011]]></guid><cfi:id>643</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Double Compression Method for Dot Matrix Graphics]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper describes a double compression method with characteristic block compression，and then Huffman block encoding for computer graphics in detail. The method has been implemented in the YHHT graphic software. It has been shown by applications that the method   is highly efficient.]]></description>
<pubDate>2015/7/4 9:18:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wan Liangjun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wan Liangjun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199004012]]></guid><cfi:id>642</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Application of the Transputer in Parallel Continuous System Simulation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199002014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The transputer is a new single chip computer developed by INMOS corporation in recent years. It has been widely used for its high-performance，f1exibility and low price. In this paper，the solutions for simulation of an aeroplane's flight with six degrees of  freedoom on various computers，such as transputer，YH-Fl，YH-l and etc.，are listed. The results show that the transputer multiprocessor  systems are of high cost-performance，one order of magnitude higher than a mainframe computer.]]></description>
<pubDate>2015/7/4 9:18:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Du Tieta and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Du Tieta and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199002014]]></guid><cfi:id>641</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Computer-Aided Instruction System of learning and Examination with the Continuous Systems Modeling]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199002015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper introduces the function and design principles of a computer-aided instruction system which can be used to aid a student's   learning and examination about the continuous systems modeling. The methods for system dynamics model knowledge representation and   modeling behavior validity measure are discussed in detail.]]></description>
<pubDate>2015/7/4 9:18:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Weiping]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Weiping</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199002015]]></guid><cfi:id>640</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Universal Simulation Language GASP/PC]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199002016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper describes the realization of GASP4 on a microcomputer IBM-PC，the form of GASP/PC simulation language，the organizational   structure and simulation method of the GASP/PC simulation language for discrete，continuous and combined simulation models.]]></description>
<pubDate>2015/7/4 9:18:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Lu Shiyu, Chen Yuan and Xu Zhanzhen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Lu Shiyu, Chen Yuan and Xu Zhanzhen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199002016]]></guid><cfi:id>639</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Architecture and Hardware Implementation Techniques of the Sequential PROLOG Machine: KD-PP]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199002017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper describes a sequential PROLOG inference processor: KD-PP which is based on compilation techniques. The processor has incorporated hardware mechanisms in it for logic programming language PROLOG execution. So it can execute PROLOG programs at high speed. The architecture of the processor，including data format，memory，machine states，instruction set，and the hardware  implementing techniques are described in detal.]]></description>
<pubDate>2015/7/4 9:18:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Liu Binhai, Wen Feng, Wang Jianqi and Zhang Chenxi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Liu Binhai, Wen Feng, Wang Jianqi and Zhang Chenxi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199002017]]></guid><cfi:id>638</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Technical Principles and Design Ideas of the Knowledge Base Debugging Tool]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The know1edge base debugging tool is used to solve the prob1em of correctness and efficiency of know1edge base caused by the uncomp1eteness and  noises，etc. This paper discusses the technical princip1es and design ideas of know1edge base debugging tool through the introduction of  imp1ementing method of know1edge base debugging tool KBDT in the know1edge base constructing tool GKD-KBST.]]></description>
<pubDate>2015/7/4 9:19:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Li and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Li and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104001]]></guid><cfi:id>637</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Precompilation-Based Interpretive Approach for the Integration of Logic Programming and Relational Database]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on two integrated methods (interpretation and compiling)of logic programming and relational database，this paper presents a new precompilation-based interpretive approach. This approach retains the advantages of the previous two methods and overcomes their drawbacks. A prototype of a corresponding integrated system based on this approach is introduced in the paper，and its chief imprementation techniques are  also discussed which include the coupling at the physical level，the compound of languages at the logical level，the source-level partial  evaluation and static optimization，and the fact scheduling and version management during the dynamic execution. At present，this prototype has been put into practical applications as the kernel of the Knowledge Base Management System GKBMS.]]></description>
<pubDate>2015/7/4 9:19:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Deng Tieqing, Wang Zhiying and Wu Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Deng Tieqing, Wang Zhiying and Wu Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104002]]></guid><cfi:id>636</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Microtasking Parallel on Multiprocessor Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Microtasking technique and its implementation on multiprocessor systems are discussed in this paper. The loops and statement blocks  of a program can be parallely executed on a multiprocessor system by microtasking technique. The distinctive features of microtasking are low overhead，high efficiency，and its applicability in fine grain parallel tasks.]]></description>
<pubDate>2015/7/4 9:19:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Shen Zhiyu and Liao Xiangke]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Shen Zhiyu and Liao Xiangke</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104003]]></guid><cfi:id>635</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Implementation of a Network File Transmission System in Ada]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper describes a Full-dup1ex File Transmission System which，with the support of NETBIOS，can transmit files between any two nodes in a network implemented by the task mechanism of Ada. During a transmission procedure，files are transmitted in the form of grouped datagrams. The management of receiving and sendíng processes，as well as the background full-duplex operation，are all imp1emented by the task features of Ada. The paper a1so briefly describes some techniques used in the imp1ementation.]]></description>
<pubDate>2015/7/4 9:19:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Lu Biao and Yao Tingbao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Lu Biao and Yao Tingbao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104004]]></guid><cfi:id>634</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Shifted Constant—— a Simple and Efficient Way for Speedup]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A way for speeding up fetching operands of super-computers without extra hardware support is described in this paper. It is based on the shifted constant of direct data instruction. The efficiency and expressible range are also analyzed.]]></description>
<pubDate>2015/7/4 9:19:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Taolan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Taolan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199104005]]></guid><cfi:id>633</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and Implementation of Software of an Intelligent Graphic Display Terminal]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper we discuss the design of a software interface of an intelligent graphic terminal according to CGI standard. Ideas and methods of the design and implementation are summarized.]]></description>
<pubDate>2015/7/4 9:19:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhou Shilin, Yu Lifu, Chen Zhenchu and Hao Jianxin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhou Shilin, Yu Lifu, Chen Zhenchu and Hao Jianxin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102010]]></guid><cfi:id>632</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[FMS Parallel Executing Scheme for Multi-way Nested Loops]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the classification of fine grain parallel structure，this paper proposes the concept of structure normal form. Based on the concept，the parallel executing problem for multi-way nested loops is investigated，father-mother-son process is discussed, and FMS processor scheduling scheme is presented for multi-way nested loops.]]></description>
<pubDate>2015/7/4 9:19:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Xuejun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Xuejun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102015]]></guid><cfi:id>631</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[On the Research of Some Issues in Object-Oriented Computer Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The classical von Neumann architecture has its limits and can not make the object-oriented programs run effectively. So it is necessary to develop a new kind of architecture to express this style's advantages. Some relations between the object-oriented programming style and the computer system are demonstrated after the idea of object-oriented programming is illustrated and defined.   From the relations，some problems are discussed and primary solutions about the problems are given.]]></description>
<pubDate>2015/7/4 9:19:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhu Haibin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhu Haibin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102016]]></guid><cfi:id>630</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A parallel FACR(L) Algorithm for the Solution of Separable Elliptic Equation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A parallel FACR(L) algorithm for solving Poisson's problem over a rectangular region with Dirichlet Condition is presented. Computation complexity and optimal parameter L for vector computer YH-1 are given. A numerical example performed on YH-1 is given.]]></description>
<pubDate>2015/7/4 9:19:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Xinfeng, Li Xiaomei and Zhang Weimin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Xinfeng, Li Xiaomei and Zhang Weimin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102017]]></guid><cfi:id>629</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Knowledge Base Inference and Maintenance System (KBIMS)]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[How to make the knowledge base have the functions of automatical inference and maintenance has been a key problem existing in the design of the knowledge base that needs to be practical. and effective. We propose an automatical knowledge base inference and  maintenance method based on default theory，and then we introduce a knowledge base inference and maintenanec system，which has been implemented on VAX-l1/780 machine in GKD-Prolog.]]></description>
<pubDate>2015/7/4 9:19:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Li and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Li and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102018]]></guid><cfi:id>628</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Prevention and Cure of Computer Virus]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This article approached comprehensively the conception，principle，prevention and cure of computer viruses，we analysed the mechanism  and propagation principle of Pakistani Virus, and discribed ways to prevent and cure this virus，including the elimination way and  the immunity way. In addition，this article illustrated that no thorough common way can be obtained to prevent and cure a11 the  viruses，and a concrete analysis of concrete virus must be made. The most effective measure is the virus prevention.]]></description>
<pubDate>2015/7/4 9:19:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Liu Binhai]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Liu Binhai</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102019]]></guid><cfi:id>627</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Software Development Automation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[What on earth is the software development process? Which tasks in this process can be automated? These are two key problems to software development automation. Taking them as the heart of matter this paper sttempts to advance some ideas so as to improve the past researches. It is worth pointing out that on the basis of these ideas a support system to develop Ada programs has been implemented. Experiments have shown that under the support of the system developers can semiautomatically implement the transformation  from description of problems in natural language to package specification in Ada with the least interference.]]></description>
<pubDate>2015/7/4 9:19:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yin Jianping, Chen Huowang and Zhang Kejun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yin Jianping, Chen Huowang and Zhang Kejun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102020]]></guid><cfi:id>626</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Study of Temporary Variable Allocation in Prolog Compiler]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper introduces a study of temporary variable allocation in prolog compiler. It gives a new allocation method without backtracking. The method is compared with the old one with backtracking and the advantages of the new method is introduced.]]></description>
<pubDate>2015/7/4 9:19:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Huang Zhiqiu<sup>1</sup> and Zhang Chenxi<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Huang Zhiqiu<sup>1</sup> and Zhang Chenxi<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199102021]]></guid><cfi:id>625</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and Implementation of a Prolog Object System GKD-POS/SUN]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199204007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An object-oriented Prolog interpreter GKD-POS/SUN is designed and implemented based on a modular prolog system. Some concepts such as module，communication between modules，exchanging，class，method，inheritance，message sending and receiving are introduced in and  directly supported by the interpreter. This paper describes the syntax，system organization and architecture，main implementing techniques and related object operation primitives of GKD-POS/SUN.]]></description>
<pubDate>2015/7/4 9:20:31</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yan Jingdong, Jin Zhi, Wu Quanyuan and Deng Tieqing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yan Jingdong, Jin Zhi, Wu Quanyuan and Deng Tieqing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199204007]]></guid><cfi:id>624</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Methods for Implementing Parallel System Program Under Multiprocessor Environment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199204008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The requirements to system program under multiprocessor environment are presented. The Problems encountered in developing system program parallelization are presented and their solutions are discussed. Three methods for implementing the mutual exclusion of critical section and their performance evaluation are given in it.]]></description>
<pubDate>2015/7/4 9:20:31</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yao Yiping, Jin Yuanchong and Yang Taolan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yao Yiping, Jin Yuanchong and Yang Taolan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199204008]]></guid><cfi:id>623</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design and Implemention of Communication Subsystem in Intelligence Tool Machine System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199204009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The ITM (Intelligence Too1 Machine) system includes a host computer (VAX) and a slave  processor (ITM). This paper describes the  design method of a communication subsystem，which transmits the information between two computers and contro1s ITM，and the  techniques of imp1ementing and debugging (out-1ine) the communication subsystem in VAX/VMS environment is a1so described.]]></description>
<pubDate>2015/7/4 9:20:31</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zou Peng, Qiao Shu1i, Wang Guangfang and Zhang Qiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zou Peng, Qiao Shu1i, Wang Guangfang and Zhang Qiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199204009]]></guid><cfi:id>622</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Specification and Structural Design of a Courseware Authoring System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199204010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The specification and structural design of a courseware authoring system，AutoCAI，have been discussed according to“Courseware Engineering”. The development phases and design strategy of the system have also been presented.]]></description>
<pubDate>2015/7/4 9:20:31</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Tan Dongfeng and Su Jianzhi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Tan Dongfeng and Su Jianzhi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199204010]]></guid><cfi:id>621</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[SCKE：A New Model for Combining Logic with Object-oriented Paradigm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Nowadays. the paradigms, namely the object-oriented language and the logic programming language, are two attractive knowledge programming languages. However, a generally accepted answer to the question “How to combine the logic-with the object-oriented paradigm for complex knowledge processing?” is still to be given. In this paper, a new model SCKE has been proposed towards combining the logic-with the object-oriented paradigm of computing. It is intended to introduce the concepts that are typical for the object-oriented systems in the logic-oriented paradigm, without losing its advantages as a declarative language. An extensive Herbrand interpretation for SCKE model has been defined to interpret uniformly the logic semantics and the object-oriented semantics. SCKE model has been implemented on SUN separately by the following three methods：precompiling-based meta-level extension, interpreting execution and compiling execution. Finally, the features of SCKE model  have been discussed.]]></description>
<pubDate>2015/7/4 9:20:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Jin Zhi and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Jin Zhi and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203001]]></guid><cfi:id>620</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Parallel Execution of Do-loops with Control Dependences]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper“merge”and“pos”functions which can be effectively implemented on modern vector machines are defined. By using the two functions the methods in which forward-if and search-if within do-loops are eliminated have been presented. The general method of vectorization for forward-loops is also discussed. Furthmore, an approach to simplify conditions (guards) of statements execution with the concept of Encapsulation Subgraph is proposed.]]></description>
<pubDate>2015/7/4 9:20:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wu Shaoyan and Wu Jianan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wu Shaoyan and Wu Jianan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203002]]></guid><cfi:id>619</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Study of Algorithms Supporting for Exploiting Operation Level Parallism Basad on SBM]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[SBM is a highly efficient synchronization mechanism supporting parallelism on operation level parallel. Based on SBM，we deeply studied the algorithms of node scheduling and barrier placement，and propose an efficient plan for exploiting parallism on operation level. We use a direct graph G(N，A) to describe the dependence among instructions, sort nodes with node's critical path as key words，describe an assignment algorithm that assign the nodes to each processor. Meanwhile，we describe a barrier placement algorithm that inserts the barrier instruction between two dependent instructions if necessary.]]></description>
<pubDate>2015/7/4 9:20:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wen Diping, Yang Xuejun and Chen Lijie]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wen Diping, Yang Xuejun and Chen Lijie</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203003]]></guid><cfi:id>618</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Supercomputer Common-Mathematical-Library-Software and Parallel Algorithms]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The concept and significance of the common-mathematical-library-software for supeccomputers are presented first，and then its developing ways and trends are pointed out，the key effects of parallel algorithms in its development are discussed in special，and  finally the design and implementation of parallel algorithms are analysed with some examples，methematical software]]></description>
<pubDate>2015/7/4 9:20:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Hu Qingfeng and Li Xiaomei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Hu Qingfeng and Li Xiaomei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203006]]></guid><cfi:id>617</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design of a Cross Assembler]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper，the author disscussed two key problems in the design of a cross assembler: the processing of“define after use”internal symbols and the communication among modules by external symbols. The author also presented and unified processing method-the  random file substitute algorithm. It is proven in practice that the method is simple and efficient.]]></description>
<pubDate>2015/7/4 9:20:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Qinwu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Qinwu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203007]]></guid><cfi:id>616</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Computer Speech-graphics System Based on Speech Recognition]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A model of computer speech-graphics system is proposed in this paper. The paper describes its principle and its design method，and a simple computer speech-graphics system based on this method is developed. It consists of a TI-SPEECH speech processing system，a KX-600 graphics display system and an IBM-PC/AT computer. The graphics software package is MGP 2D military graphics package which is implemented in KX-600 graphics display system. It possesses the Transparent keyboard ability to support speech input. Finally，the paper proposes an intelligent computer graphics display model which consists of speech input，and GKD-PROGKS graphics system. It provides some valuable recommendations for the development of intelligent computer graphics display system.]]></description>
<pubDate>2015/7/4 9:20:20</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Xue Xiaoyu, Liu Yuchang and Zhao Jinlong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Xue Xiaoyu, Liu Yuchang and Zhao Jinlong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199203013]]></guid><cfi:id>615</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Computer Aided Animation System (GKDCAS)]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199201010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[GKDCAS is a practical animation system designed in C-language and based on micro-computer environment. This paper is to present the software stracture of GKDCAS and its design methods and to introduce its functions. An example showing how to make animation with this system is also  given.]]></description>
<pubDate>2015/7/4 9:19:56</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Jun, Li Yan, Wan Liangjun, Tang Zhenchu and Hu Hengjiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Jun, Li Yan, Wan Liangjun, Tang Zhenchu and Hu Hengjiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199201010]]></guid><cfi:id>614</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Survey on the Development of Neurocomputer and its Study]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199201012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper，we firstly analyse and compare the relationship and the difference between neurocomputer and traditional computer. Secondly, we survey the international research progresses of the neurocomputer in the recent years in the points of view of software，virtual，and full hardware realizations respectively. Finally，we present our own view on the reason for the development and decay of neural networks and   suggest the research direction of the neurocomputer.]]></description>
<pubDate>2015/7/4 9:19:56</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Hu Dewen, Wang Zhengzhi and Zhang Liangqi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Hu Dewen, Wang Zhengzhi and Zhang Liangqi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199201012]]></guid><cfi:id>613</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[On Formal Semantics of Smalltalk-80]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199303013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Smalltalk-80 is the archetypal object-oriented programming language and environment. This paper briefly introduces the basic concepts and   abstract syntax of Smalltalk-80，and then，presents a formal model of Smalltalk-80. The static and dynamic denotational semantics of   Smalltalk-80 are described through the formal model.]]></description>
<pubDate>2015/1/23 11:00:21</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Li Zhoujun and Wang Bingshan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Li Zhoujun and Wang Bingshan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199303013]]></guid><cfi:id>612</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Two-way Broadcasting Computational Model of Evidential Reasoning Based on the Lattice-structural Hypothesis Space]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199303014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the 1attice-structura1 hypothesis space of expert systems，we approach a computationa1 mode1 of evidentia1 reasoning under  uncertainty: the Two-way Broadcasting Mode1 (TBM). In TBM，the measure of uncertainty of know1edge is represented as the certainty factor (CF) of the improved MYCIN model. This paper describes a efficient method which ca1cu1ates bpa functions from CF and prior probabilities. It a1so discusses the single node bpa's propagating mode1s，a extenting version of Shenoy-Shafer model.]]></description>
<pubDate>2015/1/23 11:00:21</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Liu Jiangning and Wu Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Liu Jiangning and Wu Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199303014]]></guid><cfi:id>611</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The problems about the Multi-frame System Simulation on Multiprocessor System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199303015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The principle of CPU allocation for the parallel multi-frame system simulation on multi-processor system is discussed. It is pointed out that  each sub-system of the multi-frame system should be allocated on different processor(s) to reduce the overhead of interprocessor communication. And the main control program of the multi-frame system is described in this paper.]]></description>
<pubDate>2015/1/23 11:00:21</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Du Tieta and Cao Jienan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Du Tieta and Cao Jienan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199303015]]></guid><cfi:id>610</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Auto-sorter of Simulation Language]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Continuous system simulation language is a non-procedural programming language. The written order of the statements bears no relation to the  execution order. The statements must be sorted (or re-arranged) automatically by the compiler so as to generate the object codes with correct executing order. Based on analysing the characteristics of the dynamic section of simulation programs, the algorithms of auto-sorter  implemented in the simulation language PARCSSL compiler of the software for parallel simulation PARSIM are given in this paper.]]></description>
<pubDate>2015/1/23 11:00:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Du Tieta and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Du Tieta and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301005]]></guid><cfi:id>609</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and Implementation of a Fast Transfer Syntax]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[ISO-proposed ASN.1 (Abstract Syntax Notation One) and ASN-BER (Basic Encoding Rules for ASN.1) proved to be highly powerful and flexible，but with low efficiency and large overheads in normal implementations. This paper first discusses general methods to improve the encoding efficiency   and speed, then describes the design and implementation techniques of a fast transfer syntax.]]></description>
<pubDate>2015/1/23 11:00:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Gong Zhenghu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Gong Zhenghu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301006]]></guid><cfi:id>608</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Reseach on BTD Algorithm of Data Conversion in Computer]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The binary-to-decimal (BTD) conversion is often used in computer.It is the key problem to calculate D first for converting the binary floating point number (BFPN) O.B<sub>1</sub>B<sub>2</sub>…B<sub>n</sub>*2<sup>B</sup> into the decimal 0.D<sub>1</sub>D<sub>2</sub>…D<sub>m</sub>*10<sup>D</sup>. In this paper，we comprehensively studied the  nature of BFPNand inferred an important conclusion for calculating D precisely. Based on the conclusion we constructed a high efficient formula which can not only calculate D but also keep the total error minimum in application.]]></description>
<pubDate>2015/1/23 11:00:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhong Zhixin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhong Zhixin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301007]]></guid><cfi:id>607</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Study on Supercomputer Branch Mechanism]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Branch-delay is one of the RISC (Reduced Instruction Set Computer)technology characters. According to our simulation to scalar programs on Cray-l-Like supercomputer，about 10～20%CPU time is occupied by branch inst. In this paper，the implementation method of branch-delay technology in i860 microprocessor is deeply analyzed. The method of introducing branch-delay technology into Cray-l-Like prototype is studied. Simulation results and theoretical analysis show that reducing one cp execute time for each branch inst will increase system pertormance by 4～5 percent.]]></description>
<pubDate>2015/1/23 11:00:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Xing Erbao,Gu Zhongjie and Li Zhongmin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Xing Erbao,Gu Zhongjie and Li Zhongmin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301008]]></guid><cfi:id>606</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The UNIX Logical Disk Implementation for Supercomputer Environment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The paper extends the concept of logical device of UNIX and introduces the supercomputer logical disk. The method for implementing the ligical disk is described according to the given architecture of supercomputer system then. The concept of logical disk makes it possible that the size of file system is independent of the capacity of the physical disk and that the logical disk supports the super file or super file system.]]></description>
<pubDate>2015/1/23 11:00:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Ni Jikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Ni Jikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301009]]></guid><cfi:id>605</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Krylov Subspace Methods to Solve Large Sparse Problems on Supercomputers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The most popular methods to solve large sparse problems are based on projection techniques on appropriate subspaces. The main attraction of these methods is that they only require using the matrix by vector multiplications. We give the implementations of PCG、GMRES、Lanczos's  method and Davidson's method on YH-1.We then compare their advantages and disadvantages. Finally we discuss the parallel implementations as possible as we can.]]></description>
<pubDate>2015/1/23 11:00:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Yuexiang and Li Xiaomei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Yuexiang and Li Xiaomei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301010]]></guid><cfi:id>604</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Gradient Coloring Used in Art Pictures]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper, a new type of coloring method of creating living picture is presented. It is different from the old single color or mode method. It's coloring method by gradually changing the color. Using this method to creatl computer Art picture which is living, it has been used in the creation of computer animation. In this paper, some program in C language have been given.]]></description>
<pubDate>2015/1/23 11:00:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Hu Hengjiang,Wan Liangjun and Li Yan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Hu Hengjiang,Wan Liangjun and Li Yan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199301011]]></guid><cfi:id>603</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Research and Implementation of Combining Logic with Object-Oriented Paradigm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199404008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper，we propose a new method to merge the logic with the object oriented paradigm, We intend to introduce the typical concepts of  object oriented systems in the logic paradigm，without losing its advantages as a declarative language. An extensive Herbrand interpretation  has been given to interpret thd logic semantics and the object oriented semantics uniformly. Based on this method, we design and implement an  object oriented logic system. In the end. the paper gives the object primitives of the system.]]></description>
<pubDate>2015/1/23 10:59:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhou Li and Wu Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhou Li and Wu Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199404008]]></guid><cfi:id>602</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A General-purpose Efficient Neural Network Mapping Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199404009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Neural network mapping algorithm is an important research content in the field of neural network virtual implementation. The efficiency of the  algorithm affects the virtual implementation of neural network. In this paper,the nature of neural network mapping，the neural network topology and the neurocomputing process have been analysised at first. Based on thorovgh consideration of load-balance and communication-cost，the thesis  gives a general-purpose efficient neural network mapping algorithm. introducing the idea of timestep. Finally, the experimenting results of  neural networks with different topologies are presented，which proves the generality and efficiency of the algorithm.]]></description>
<pubDate>2015/1/23 10:59:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Yijie,Dai Kui and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Yijie,Dai Kui and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199404009]]></guid><cfi:id>601</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Development of Simulation Computers and Simulation Softwares]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199404010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The high-performance computer has initiated profound revolution in system simulation Digital simulation was thus brought into existence.        The paper briefly disousses the development of the simulation computers and softwars. We investigate in detail the usage and future of digital simulation computer YHF1 and YHF2 in our country.]]></description>
<pubDate>2015/1/23 10:59:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Gui Xianzhou,Huang Kedi and Dai Jinhai]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Gui Xianzhou,Huang Kedi and Dai Jinhai</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199404010]]></guid><cfi:id>600</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Hierarchy of High Speed 3D Terrain Display]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[From viewpoint that the hardware and the software of special 3D terrain system must be designed by ourselves, we discuss the architecture，key  techniques and their realization of a typical high speed 3D terrain system in this paper. First of all we select high speed processor INTEL i860 as kernel of the system. Then we design a special unit called' allocating tree' to solve the contention and bottleneck problem caused by mutil-tunnel outputs. Thirdly，we realize the hardware Z-buffer algorithm,by which visible surface determination can be sped. Lastly，we use mutil-frame buffer technique to support high refresh of mutil tunnels and mutil drawing bodies.]]></description>
<pubDate>2015/1/23 10:59:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Hao Jianxin,Cai Xuanping and Sun Maoyin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Hao Jianxin,Cai Xuanping and Sun Maoyin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403003]]></guid><cfi:id>599</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Semantic Tableaux Method and Its Soundness and Completeness]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The semantic tableaux given in the book‘An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof’by Andrews is a refutation method which can be directly used for sentence sets. Nevertheless,the soundness and completeness theorem (3201) of the semantic tableaux method and the proving process are incorrect. In this paper, we illustrate and correct the mistake. In addition, we prove the revised  theorem of the soundness and completeness.]]></description>
<pubDate>2015/1/23 10:59:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Li Zhoujun and Wang Bingshan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Li Zhoujun and Wang Bingshan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403009]]></guid><cfi:id>598</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design Technology of High Performance Bus for Multi-Processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on YH-F2 simulation computer, the paper describes some aspects of bus design technology, such as the architecture of high performance bus，bus features，data transfermation on bus and protocol of multi-processor communication.]]></description>
<pubDate>2015/1/23 10:59:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Su Jinshu and Jin Shiyao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Su Jinshu and Jin Shiyao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403010]]></guid><cfi:id>597</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and Implementation of Cache Working Principle Teaching System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A very important trend in CAI development is to take advantage of vivid animation to illustrate the content of the course. In this paper，we  discuss an animate-based courseware we designed and implemented，the Cache working principle teaching system made up of four parts: Cache  working process module；address mapping module；LRU replacing algorithm module；and LRU hardware implementation. The details of design  methods，human-machine interface and implementation technology are presented in this paper.]]></description>
<pubDate>2015/1/23 10:59:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Shi yang,Zhang Chenxi and Zhang Chunyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Shi yang,Zhang Chenxi and Zhang Chunyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403011]]></guid><cfi:id>596</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Well-Designed Multi-Variable Function Generator]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The techniques of the optimized multi-variable function generator (MVFG) are introduced in this paper，including quick function interpolation，elimination of redundant search of break point，and the strategy of quich search of break point. Practice shows that the MVFG is much more  efficient than the other common MVFG. The time spent on multi-variable function generation is reduced by 50%.]]></description>
<pubDate>2015/1/23 10:59:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Du Tieta and Liu Mingliang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Du Tieta and Liu Mingliang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199403012]]></guid><cfi:id>595</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design and Implementation of Graphical Specification Language in GSEIB]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199402015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[SE information base is the kernel of an integrated SE environment. This paper presents a graphical software process and product specification language，a framework for SE project support，and the actual efforts at implementing the graphical specification subsystem. From the formal  specification of a given SE project，a customized SE information base can be generated，which truly reflects and benefits the SE project.]]></description>
<pubDate>2015/1/23 10:59:42</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Qi Zhichang,Liu Chunlin and Ning Hong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Qi Zhichang,Liu Chunlin and Ning Hong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199402015]]></guid><cfi:id>594</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Analysing the complexity of A NP-complete problem]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[We introduce a NP-complete problem named RHC and prove its NP-complete property in this paper. Secondly，we discuss the complexity any  algorithm solving RHC presents by counting the moving times of the tape head on turning machine. The conclution drawn from our analysis shows  at least that it is difficult to find an algorithm to solve RHC though the analysis is not a mathematical one, Hence，maybe it needs only time  we think，to confirm the analysis.]]></description>
<pubDate>2015/1/23 10:59:56</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Jiang Xinwen and Wang Bingshan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Jiang Xinwen and Wang Bingshan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401007]]></guid><cfi:id>593</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Techniques of PTL Prover]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the theory of [10], the propositional temporal logic (PTL) prover has been implemented in Turbo-Prolog and runs on 386 microcomputers. The PTL prover has some original features in dealing with the power of next, induction, resolution, ◇(xΛy), until，The prover's many full-screen facilities make it easy to use. The prover appears to be of reasonable efficiency for most current examples.]]></description>
<pubDate>2015/1/23 10:59:56</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Ben Kerong and Chen Huowang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Ben Kerong and Chen Huowang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401008]]></guid><cfi:id>592</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A New Parallel Algorithm for Matrix Inversion on Mesh]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Many parallel algorithms can be used to invert a non-singular matrix rapidly on mesh. Among them，the iterative method is very important. This paper presents a new parallel iterative algorithm for arbitrary non-singular matrix inverision on mesh. Meeting the requirement of the same  precision，new algorithm can reduce the running time for inversion by half in contrast to the typical Newton iterative algorithm on mesh.]]></description>
<pubDate>2015/1/23 10:59:57</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Mo Zeyao and Li Xiaomei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Mo Zeyao and Li Xiaomei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401009]]></guid><cfi:id>591</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Method of Recursive Divide for Task Partition and Processor Scheduling]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper，we present an efficient method for task partition and processor scheduling by the method we can divide a set of sequential tasks into many subsets，which can be performed parallel in its processor. Both the communication between the processors approaching to the low  critical of the problem，and the balance of the load in processor are good.]]></description>
<pubDate>2015/1/23 10:59:57</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Cao Jienan and Du Tieta]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Cao Jienan and Du Tieta</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401010]]></guid><cfi:id>590</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Cooporating Knowledge Model for Military Situation Assessment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper introduces the application of Distributed Artificial Intelligence (DAI) techniques in the assessment of the military situation. Distributed expert system workstation (DESW) is a problem-solving framework for the multi-agent intelligent system. In this paper, we describe  mainly the system organiration structure agent concept model and cooperative reasoning model of DESW for modeling the problem-solving behaviors  of the multi-agent.]]></description>
<pubDate>2015/1/23 10:59:57</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yao Li,Chen Wenwei and Wang Hao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yao Li,Chen Wenwei and Wang Hao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401011]]></guid><cfi:id>589</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design and Implementation of Record-Addressable，Random Access File]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The Record-addressable random access file (RARA) is a new-type file in FOR-TRAN. It combines the advantages of the sequential and direct files，and provides a more efficient means for the users in their record unequal in length in the random access file. In this paper，we not only  introduce the way to use RARA file，but also discuss the problems in implementation.]]></description>
<pubDate>2015/1/23 10:59:57</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhong Zhixin and Song Junqiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhong Zhixin and Song Junqiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401012]]></guid><cfi:id>588</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Efficient Implementation of a Library for Large Sparse Linear Algebraic Iterations]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper，we discuss the teration algorithms，acceleration methods，memory techniques and parallel algorithms for large sparse linear equation systems. Combining the features of vector machines, we adopt effective optimization measures and develop the vector library routine.]]></description>
<pubDate>2015/1/23 10:59:56</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[He Xinfang,Hu Qingfeng,Wang Liping and Tian Zerong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>He Xinfang,Hu Qingfeng,Wang Liping and Tian Zerong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199401013]]></guid><cfi:id>587</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Detecting Method of Skewing Angle of Document/Form Images]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199504009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the form processing and optical character recognize systems，it is an important technology to detect the skewing angle of binary document or  form image. Based on the line testing model，a highly precision and quickly method is approached in this paper.]]></description>
<pubDate>2015/1/23 16:03:28</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Liu Jiangning,Shi Chun,Zhang Jian and Wu Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Liu Jiangning,Shi Chun,Zhang Jian and Wu Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199504009]]></guid><cfi:id>586</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Scalability Analysis of Three Parallel Sort Algorithms]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199504010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper we use the Scaled Serial Fraction (SSF) analysis to study the scalaility of three parallel sort algorithms and that of the algorithms on a hypercube architecture. The scalability is a very important metric for predicting the performance of a parallel algorithm of a parallel system if we consider a massively parallel system with thousands of processors. The condition is given under which the three parallel sort algorithms are all scalable and explain the applicability range of each algorithm. We show that by scalability analysis one is able to  exhibit the essential properties of parallel sort algorithms in a massively parallel processing environment. Finally the computed results of  the scaled serial fraction, the scaled efficiency and the scaled speedup are given.]]></description>
<pubDate>2015/1/23 16:03:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Li,Zhu He and Zhou Xingming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Li,Zhu He and Zhou Xingming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199504010]]></guid><cfi:id>585</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Efficient programming Techniques for Vector Supercomputer]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199504012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper，the efficient programming techniques adapted for architecture of vector supercomputer are mainly studied; the ways of reducing the probability of instruction pipeline blocking, improving the parallelism of multifunction units，data scheduling and localization are fully discussed; and a series methods and techniques for efficient programming are presented.]]></description>
<pubDate>2015/1/23 16:03:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Minxuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Minxuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199504012]]></guid><cfi:id>584</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Technology and Economy Evaluation on Opposite Efficiency of Bank Office Automatic System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199504013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This artide has built the quantitative models of in-out in BOAS and out-index by comparing man's operation system in bank and BOAS. The out-index collection has been resolved into four indexes-systematic intensity of service; systematic work potentialities; systemtic degree of  accuracy and systematical reliability. The synthetical evaluate model can be seen from the paper on opposite efficiency of BOAS.]]></description>
<pubDate>2015/1/23 16:03:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Ou Yangjie<sup>1</sup> and Huang Luming<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Ou Yangjie<sup>1</sup> and Huang Luming<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199504013]]></guid><cfi:id>583</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[THE RESEARCH AND IMPLEMENTATION OF COMBINING LOGIC WITH OBJECT­ORIENTED PARADIGM]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199503010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An object-oriented Prolog interpreter GKD-OOPS based on a modular Prolog system is dseigned and implemented. It supports the concepts such as modularity，information encapsulation，data abstraction and message passing which are usually used in large knowledge processing systems. This  paper describes the conceptual structure，the language specification，the logic semantics，system organization and architecture and related  object primitives of GKD-OOPS.]]></description>
<pubDate>2015/1/23 16:03:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhou Li and Wu Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhou Li and Wu Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199503010]]></guid><cfi:id>582</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[ABOUT CASE]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199503011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Computer-aided software engineering (CASE) emerged at 1980s when SE could not meet the demands of software development. This paper discusses what CASE has achieved in the past and how many problems (old and new) of CASE exist at present. It also discusses the possible ways to solve these problems.]]></description>
<pubDate>2015/1/23 16:03:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Shuqiang,Wang Feng and Chen Huowang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Shuqiang,Wang Feng and Chen Huowang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199503011]]></guid><cfi:id>581</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[AN UNIFIED METHOD AND THEORY FOR GRAMMAR DESIGN OF A CLASS OF CONTEXT-SENSITIVE LANGUAGES]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199503012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[By means of a c1ass of recursive functions ? on I<sub>+</sub>，this paper defines a c1ass of context-sensitive languages ＆ over the alphabet ∑={a}，and then presents a context-sensitive grammar schema generating the language of ＆ by a structured analysis method. Furthermore，an unified method and theory for grammar design of ＆ is formed. The methods and techniques discussed here can be generalized to grammar design of all other context-sensitive languages.]]></description>
<pubDate>2015/1/23 16:03:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Li Zhoujun,Chen Huowang and Li Kan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Li Zhoujun,Chen Huowang and Li Kan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199503012]]></guid><cfi:id>580</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research of the Principle of the Load of COFF Files]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199502009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A speeding board or other extended board is often used in a practical system. Associated with the common object file format of COFF，the paper  deals with the principle of loading，running and controlling of executable files of system speeding board，and expounds the idea and  implementation of loading COFF file. Then the mechanism of the preload of file，which can improve system efficiency effectively，is also  designed. The law and the concrete implementation of the principles are discussed.]]></description>
<pubDate>2015/1/23 16:03:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhu Changren,Zhou Shilin and Luo Xiaorong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhu Changren,Zhou Shilin and Luo Xiaorong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199502009]]></guid><cfi:id>579</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Building Geomorphologic Information System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199502010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Geomorphologic information database, which is mainly used to memorize and manage the map and geomorphic objects, is an important section of X-2000 high-speed 3D terrain display system. Like other graphic objects,map and geomorphic objects' attributive value has the property of unfixed  length, hierarchy and multimedia. It is difficult to describe it with simple data type. On the basis of how to use traditional data model to describe and memorize complicate map and geomorphic objects, this paper makes use of commercial database manage system(ORACLE 5.1B), and full  related structure to design and build the Geomorphologic Information Database.]]></description>
<pubDate>2015/1/23 16:03:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Junbiao and Cai Xuanping]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Junbiao and Cai Xuanping</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199502010]]></guid><cfi:id>578</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Military Characteristics of the Programming Language and Its Support to Military Software]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199501009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper，the military characteristics of the programming language and the support of ADA and C to military software are discussed. The  direction of military language is pointed in the end.]]></description>
<pubDate>2014/6/11 15:46:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Guo Haozhi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Guo Haozhi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199501009]]></guid><cfi:id>577</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Diagnostic Maintenance System Combining Expert System with Testing Technology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199501010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper introduces a diagnostic maintenance system ITMDMS that combines expert system technology with the conventional testing technology.  The system includes two kinds of knowledge: one is heuristic shallow knowledge, the other is deep knowledge. They are represented by first-order predicate logic in hierarchy structure. The system takes three steps to accomplish the inference process: (1)shallow inference; (2) deep inference; (3) shallow inference. The knowledge maintenance methods perfect the knowledge of the system in applifìcation. The frame of the  system can be used in diagnostic maintenance of any digital system.]]></description>
<pubDate>2014/6/11 15:46:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang PU]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang PU</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199501010]]></guid><cfi:id>576</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[CSE: A Client/Server Computing Environment for Integration of AI Languages]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199501011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper introduces a Client/Server Computing Environment (CSE)，in which prolog and Clips are integrated as two type servers，providing services of Logic deduction on Horn clauses and problem solving on production rules，respectively. Client applications can request the services，using API of CSE with Prolog language and Clips Language. The paper describes the motivation for the design of CSE，and discusses the implementation techniques of CSE，especially，the technique of separating general communication framework with data-dependence services. The paper also shows the applications of CSE.]]></description>
<pubDate>2014/6/11 15:46:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Huaimin,Gao Hongkui,Tang Xinhuai and Jia Yan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Huaimin,Gao Hongkui,Tang Xinhuai and Jia Yan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199501011]]></guid><cfi:id>575</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Subpixel Techniques and Its Application in Grid Method]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The fault that the picture resolution of digital image system is much worse than film greatly limits the application of digital image processing techniques in mesurements. Subpixel techniques can mend this fault. In this paper，we introduce the common subpixel techniques and use them in grid mesurement. A new filter-the line search algorism is given to process the strongly curved grid line and the subpixel result-suare obtained.]]></description>
<pubDate>2014/6/11 15:43:35</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Lei Zhihui and Yu Qifeng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Lei Zhihui and Yu Qifeng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604004]]></guid><cfi:id>574</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Implementation of I<sup>2</sup>C Serial Communication by Software]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper discusses the implementation of I<sup>2</sup>C serial communication between 51 series microprocessor without I<sup>2</sup>C hardware interface and EEPROM 24C01A by software.]]></description>
<pubDate>2014/6/11 15:43:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Chen Haiyan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Chen Haiyan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604017]]></guid><cfi:id>573</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Method of Integer Division by Using Floating-point Division]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A method of integer division using floating-point division is introduced in this paper. The possible error produced by this method is  estimated and the revising method is given. an implementing example is described and the method is finally evaluated.]]></description>
<pubDate>2014/6/11 15:43:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Gong Xuechun,Sheng Yanji and Cheng Xuhua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Gong Xuechun,Sheng Yanji and Cheng Xuhua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604018]]></guid><cfi:id>572</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Nonmonotonic Reasoning of Context Logic]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the Logic of context，CL，defined in [l]，circumscription and default theory are introduced into context reasoning，its related definitions and theorems are a1so provided.]]></description>
<pubDate>2014/6/11 15:43:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Liu Haiyan,Chen Huowang and Liu Fengqi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Liu Haiyan,Chen Huowang and Liu Fengqi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604019]]></guid><cfi:id>571</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Technology of Designing the High Performance FDDI Network Controller]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the analysis of traditional implementation of network function and its overhead. some consideraton of high performance network controller is given. The hardware approaches of promoting network performance are described. And finally，FDDI features-orientied network controller design technology is also presented.]]></description>
<pubDate>2014/6/11 15:43:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Su Jinshu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Su Jinshu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604020]]></guid><cfi:id>570</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Program Evolver]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A programming approach by means of simulated evolution is investigated. A program evolver which uses a formal grammar as its genetic representaion is constructed and the corresponding algorithms in the evolver are presented. Finally，the evolver is applied to the artificial ant problem.]]></description>
<pubDate>2014/6/11 15:43:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wu Shaoyan and Chen Huowang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wu Shaoyan and Chen Huowang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604021]]></guid><cfi:id>569</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design and Realization of a Distributed Client/Server Intelligent Application System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper, according to the needs of formation damage protection for oil and gas. based on distributed Client/Server computer model，a  distributed intelligent application system (DIAS) has been developed. In this system，data and knowledge can be shared. This system has  yielded benefits to our country.]]></description>
<pubDate>2014/6/11 15:43:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Jia Yan,Wu Tingting,Zhu Jinning and Xu Li]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Jia Yan,Wu Tingting,Zhu Jinning and Xu Li</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604022]]></guid><cfi:id>568</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Synchronous Issues Between the Real-time I/O Language And the Simulation Language YFSIM]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper presents the synchronous relation between YFRIO language and YFSIM language，expounds their synchronous hardware and software mechanisms and the way of programing.]]></description>
<pubDate>2014/6/11 15:43:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Gui Xianzhou,Dai Jinhai and Gao Jianjun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Gui Xianzhou,Dai Jinhai and Gao Jianjun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604023]]></guid><cfi:id>567</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Object-oriented Model in System Fault Diagnosis]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper，an object-oriented model is presented for system fault diagnosis. We discuss the structure of the model，the strategy and  algorithm based on the model.]]></description>
<pubDate>2014/6/11 15:43:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Li Daqi,ZOU Fengxing and Qiang Jing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Li Daqi,ZOU Fengxing and Qiang Jing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604024]]></guid><cfi:id>566</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Topologic Relationships and Editing of Elementary Graphic Objects in Object-oriented Geographical Database]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604025]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This article proposes the logic data model of object-oriented geographic database. The topologic relationships between the elementary graphic object are analyzed in detail, and the editing operations to be performed on them are identified and analyzed. These editing operations ensure that topologic consistency in the database is preserved.]]></description>
<pubDate>2014/6/11 15:43:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Feng,Yang Shuqiang and Chen Huowang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Feng,Yang Shuqiang and Chen Huowang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199604025]]></guid><cfi:id>565</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Optimal Neural Network Mapping Algorithm —— Absorb Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199603020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper the important feature of artificial neural networks —— parallel distributed processing is discussed thoroughly，so the  essential features of neural computing are revealed，and the important conception of timestep is introduced. At the same time，two critical concepts of mapping algorithm —— balancing the working load of PEs and the communicatin overhead among PEs are explained more thoroughly，and the main allocation criterions are presented. Adopting the ideas of graph theory，an optimal neural network mapping algorithm —— Absorb Algorithm is advanced. This mapping algorithm shows remarkable efficiency. Some interesting experimental results are presented.]]></description>
<pubDate>2014/6/11 15:43:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Yijie and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Yijie and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199603020]]></guid><cfi:id>564</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Multilevel Context Logic]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199603022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper，the current state of researches on context is briefly introduced，a new Logic of Context，CL，is defined，some of its definitions and theorems are also provided.]]></description>
<pubDate>2014/6/11 15:43:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Liu Haiyan,Chen Huowang and Wang Bingshan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Liu Haiyan,Chen Huowang and Wang Bingshan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199603022]]></guid><cfi:id>563</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Implemented Schemse with Software-Hardware for Function Computations in Supercomputer]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199603023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper, the algorithms designs and error analysis on the y/x 、y/√ x、a<sup>x</sup> log<sub>a</sub><sup>x</sup>、x<sup>y</sup> functions in supercomputer are discussed.]]></description>
<pubDate>2014/6/11 15:43:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Minxuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Minxuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199603023]]></guid><cfi:id>562</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research and Analysis of Scan Ring Diagnostic Techniques]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199602019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The scan ring diagnostic techniques are advanced and popular in the world. In this paper，the principles and method of scan ring diagnosis are  presented，and the designs of hardware and software for scan ring diagnosis are discussed. Not only are the efficiency and ability analysed，but aslo an accelerating approach is proposed.]]></description>
<pubDate>2014/6/11 15:43:04</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Mu Changfu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Mu Changfu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199602019]]></guid><cfi:id>561</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[ELLPACK and Its Mechanism]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199602020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The problem solving environment aims at helping the users to the，greatest extent. ELLPACK is a problem solving environment for solving elliptic partial differential equation. This paper analyses its mechanism and adds a linear equation recognizer to it.]]></description>
<pubDate>2014/6/11 15:43:04</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wen Shangmen,Li Xiaomei and Zhou Xingming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wen Shangmen,Li Xiaomei and Zhou Xingming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199602020]]></guid><cfi:id>560</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design and Implementation of FKMS Approximate Knowledge Inference and Maintenance System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199602022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The paper gives a brief account of theoretical basis of the system of inference and maintenance，and the technology for implementation，of FKMS approximate knowledge base we implemented in PROLOG at the SUN work station. This paper also evaluates FKMS system.]]></description>
<pubDate>2014/6/11 15:43:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Cheng Hongsheng,Yang Li and Xue Xiaoyu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Cheng Hongsheng,Yang Li and Xue Xiaoyu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199602022]]></guid><cfi:id>559</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design and Analysis of an Algorithm for the Double-word Floating Point Multiplication]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199602023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This essay presents an algorithm for the double-words floating point multiplication used in computer，and discusses the computation formula，the steps of computing and error estimation. The principle of this algorithm can be used in the floating point multiplication of any length of  words in general computer system.]]></description>
<pubDate>2014/6/11 15:43:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Luo Zhigang<sup>1</sup> and Huang Xuhui<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Luo Zhigang<sup>1</sup> and Huang Xuhui<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199602023]]></guid><cfi:id>558</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Developing Connectionless-Mode Service Using TLI]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199601016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[TLI is a programming interface to the transport layer of ISO-OSI model，it supports the transfer of data between two user processes in network.   TLI provides two modes of service for application and development；connection mode and connectionless mode. The former is appropriate for  applications that requires relatively long-lived，datastream-oriented interactions; the latter is appropriate for application that involves short-term request/response interactions. In this paper，the auther discussed connetionless mode service of TLI and several problems that must be solved.]]></description>
<pubDate>2014/6/11 15:42:50</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Qinwu,Huang Ruifang and Zhang Weimin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Qinwu,Huang Ruifang and Zhang Weimin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199601016]]></guid><cfi:id>557</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Advanced Fault Tolerance Method for Nodes in SN-PDB]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199601019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Several commonly used fault tolerance methods for nodes in shared-nothing parallel database systems (SN-PDB) are presented in the paper. The  chained declustering method is focused，and the load balancing algorithm of it is given in the paper.]]></description>
<pubDate>2014/6/11 15:42:50</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Chang Yuelou,Yang Li and Yang Guogui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Chang Yuelou,Yang Li and Yang Guogui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199601019]]></guid><cfi:id>556</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Analysis and Research on the Communication for Massively Parallel Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199706017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper analyzes several important factors contributing to the communication latency in massively parallec processors. summarizes the  research background and prposes some schemes to improve the communication performance.]]></description>
<pubDate>2014/5/28 9:49:24</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[xiao Liquan,Zhang Minxuan and Zhou Xingming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>xiao Liquan,Zhang Minxuan and Zhou Xingming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199706017]]></guid><cfi:id>555</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Calculation the Number of Valid Assignments of the Formula Set in Probabilistic Logic]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199705007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper，based on the simple tree inference structure，has developed the relationship between some of the formulas. Since the inference tree has both of the features of the single clique and multiple cliques，a unique formula has given to calculate the number of valid assignments  of formula set.]]></description>
<pubDate>2014/5/28 9:49:13</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Chendong<sup>1</sup>,Chen Huowang<sup>1</sup>,Wang Bingshan<sup>1</sup> and Xu Guang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Chendong<sup>1</sup>,Chen Huowang<sup>1</sup>,Wang Bingshan<sup>1</sup> and Xu Guang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199705007]]></guid><cfi:id>554</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Comparison of Queue Length in Typical ATM Switch Buffering Systems under the Traffic Similar to C/S Model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199705009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The communication traffic in many cases can be expressed with a model similar to client-server (C/S) traffic. Therefore it is necessary to study  the buffer tactics for ATM switches under such kind of traffic. This paper evaluates the probability distribution of queue length for four kinds of typical buffer fabric with the help of computer simulation，and then compares the performance of several typical buffer systems for ATM  switches under the traffic similar to C/S model.]]></description>
<pubDate>2014/5/28 9:49:13</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Chen Yongguang,Lu Xicheng and Wu Jiazhu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Chen Yongguang,Lu Xicheng and Wu Jiazhu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199705009]]></guid><cfi:id>553</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Distributed Integrated Environment Based on Multi-agents]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199704014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[First, this paper promotes the framework architecture of DIEMA. Then, we discuss the mechanism and executive of the DIEMA, and promote the implementation framework of Service agent and Request agent and their design and implementation.]]></description>
<pubDate>2014/5/28 9:47:42</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Shi Dianxi,Wang Huaimin,Zhou Peng and Wu Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Shi Dianxi,Wang Huaimin,Zhou Peng and Wu Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199704014]]></guid><cfi:id>552</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Parallel System Based on an Object-oriented Model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199703011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A system based on object-oriented large-grain data flow model, called OOCPCS, is designed to facilitate parallelism in distributed system. Its underlying model of computation is an integrated object-oriented paradigm and large-grain data flow model, called OOLGDFM. It introduces persistent state object and object-oriented features into large-grain data flow model. Its graphs are constructed dynamically. The paper discusses the realization of the model in OOCPCS, the use of forward _ list, parallelizing compiler, POC programming language, object-oriented network file I/O, and the virtual OOLGDFM machine.]]></description>
<pubDate>2014/5/28 9:47:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Xiao Nong,Hu Shouren,Song Hui and Han Bing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Xiao Nong,Hu Shouren,Song Hui and Han Bing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199703011]]></guid><cfi:id>551</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[YHWG-Distributed Intelligent Management Information System for Iron&Steel Corporations]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199702015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[We have developed the distributed intelligent management information system YHWG for the iron&steel corporations. This system is composed of the steel-variety-aid-designing-expert system, the refractory-brick-monitoring and diagnostic expert system, and the low-alloy steel & refractory lining management information system. Now this system has been in use in Wuhan Iron&Steel Corporation, and has made big profit for it.]]></description>
<pubDate>2014/5/28 9:47:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhou Li,Zhou Bin,Zeng Rongren and Liu Bo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhou Li,Zhou Bin,Zeng Rongren and Liu Bo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199702015]]></guid><cfi:id>550</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Approach to Recognize On-line Handwritten Chinese Characters]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper introduces an approach to recognizing on-line handwritten Chinese characters, which gets ordered sequence of line segments based on the Dynamic Chinese Character Base-units. This approach has no restriction on writing order, and is adaptable to variants of handwritten Chinese character. As a result of testing, the recognizing rate of a system based on this approach is 97.1%.]]></description>
<pubDate>2014/5/28 9:46:38</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yao Danlin and Yin Jianping]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yao Danlin and Yin Jianping</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701008]]></guid><cfi:id>549</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Analysis on Fundamental Objects of Distributed Virtual Reality Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Having studied a few systems, we present a frame of the essential software architecture for distributed virtual reality systems. In this paper, we investigate the fundamental objects with object-oriented principles and discuss several concrete implementation problems of some objects.]]></description>
<pubDate>2014/5/28 9:46:38</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zheng Yuan and Li Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zheng Yuan and Li Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701009]]></guid><cfi:id>548</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Neural Network Model for Representation of Structured Knowledge]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Knowledge representation of normal neural networks is generally distributed, so it is difficult for them to process structured knowledge. In this paper, we research on and design a high-structured neural network HSNN for solving these problems. The process of designing a HSNN is shown and the applications of HSNN in inheritance, non-monotonous reason and information retrieval are discussed.]]></description>
<pubDate>2014/5/28 9:46:38</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Li Zhigang and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Li Zhigang and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701010]]></guid><cfi:id>547</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Performance Analysing of Parallel Computing on Networks of Workstations]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper, we describe a new criterion of the parallel computing performence of heterogenous networks of workstations. With the criterion we analyse the parallel computing performance of the shallow-water equations on four workstations.]]></description>
<pubDate>2014/5/28 9:46:39</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Sun Anxiang,Song Junqiang and Li Xiaomei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Sun Anxiang,Song Junqiang and Li Xiaomei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701013]]></guid><cfi:id>546</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[《国防科技大学学报》十年引文分析]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[《国防科技大学学报》(1986年—1995年) 作为引文统计源, 对该期间刊载的全部论文按论文著者、论文著者单位、论文发表卷期年、引文文献类型、引文发表年、引文语种等项建立了基于Foxbase 的统计数据库。从不同角度得出了《国防科技大学学报》论文著者单位分布、引文量、平均引文量的年度分布、引文类型分布、引文语种分布、论文发表年与引文量的关系、引文量与学科的关系、学报自引量等统计分析结果, 定量地揭示了本校教学科研人员利用科技文献的规律, 从文献保障方面提出了建议。]]></description>
<pubDate>2014/5/28 9:46:38</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[宋淑丽,刘玉明,文铁锋,刘慧慧]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>宋淑丽,刘玉明,文铁锋,刘慧慧</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199701024]]></guid><cfi:id>545</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Complex Behavior Modeling in YHVRP]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199806005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[we propose a language model of behavior to define complex behaviors relations and its time constraints. YHVML, the modeling language of distributed VR software development platform YHVRP, implements the model, whose run-time environment implements the VE Computing Model for complex behaviors and adopts LLF method to schedule behaviors dynamically so as to keep the real-time interactivity and fidelity of VR application.]]></description>
<pubDate>2014/1/3 16:01:52</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Yongjun,Li Sikun and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Yongjun,Li Sikun and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199806005]]></guid><cfi:id>544</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Universal Abstract Consistency Class and Universal Unifying Principle]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199806007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Consistency is one of the most fundamental syntactic concepts in mathematical logic. By treating consistency in an abstract way, Smullyan presented abstract consistency class, and proved the socalled Smullyan's unifying principle. In this paper, considering various properties possessed by the class of consistent sets of wffs in first-order logic system, we generalize the concept of abstract consistency class into the most general form-universal abstract consistency class, and further prove its universal unifying principle. This result can be used to prove the completeness theorems of first-order logic system and the universal refutation method proposed by us.]]></description>
<pubDate>2014/1/3 16:01:52</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Bingshan and Li zhoujun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Bingshan and Li zhoujun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199806007]]></guid><cfi:id>543</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Tracing and Replaying in Parallel Debugging Environments]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199806008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Executing result of parallel programs which communicate by passing messages, can be nondeterministic due to variations in process scheduling and message latencies. Such nondeterminacy can cause serious problems while debugging: subsequent executions of the program may not reproduce the original bug. Therefore, a tracing and replaying mechanism is introduced into parallel debugging environments. This paper discussed an advanced algorithm for tracing and replaying, and its implementation.]]></description>
<pubDate>2014/1/3 16:01:52</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Qinwu<sup>1</sup> and Zhang Liu<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Qinwu<sup>1</sup> and Zhang Liu<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199806008]]></guid><cfi:id>542</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Structures and Mechanisms of Flash Memory]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199806009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The paper discusses the typical cell structure of flash memory and its principle of information storage. In addition, the organizations and working mechanisms of the NOR and NAND flash memory matrices, which are widely applied at present, are detailed.]]></description>
<pubDate>2014/1/3 16:01:52</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Chang Chunxi and Wang Baoheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Chang Chunxi and Wang Baoheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199806009]]></guid><cfi:id>541</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[MPP Virtual Computer System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199805021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[MPP virtual multiple computer system is a particular pvm system. This paper discusses the architecture and techniques of MPP Virtual Computer system, and a simple test and analysis of the MPP Virtual Computer system are given.]]></description>
<pubDate>2014/1/3 16:01:38</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Qu Guoping,Yang aimin,Li Shenghong,Yang Qing and Zeng Bin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Qu Guoping,Yang aimin,Li Shenghong,Yang Qing and Zeng Bin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199805021]]></guid><cfi:id>540</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Algorithm to Allocate Processors among Bush Tree to Get Multiple Pipelined Parallel Execution on Hash Join]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199805022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An algorithm on how to allocate processors for bush query tree to get multiple pipelined parallel execution with hash join is presented in this paper. An example is given for further description.]]></description>
<pubDate>2014/1/3 16:01:38</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Chang Yuelou]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Chang Yuelou</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199805022]]></guid><cfi:id>539</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Composition of Video Image in Multimedia Conference]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In multipart multimedia conferences, each participant may desire to view all of the other participants and other contributed images and video streams or subset of them. And so video composing is an important research topic. This paper discusses combining modes and combining strategies and combining methods of video images. Combining algorithms of video images are given based on relay level of video images. The performance of three combining modes is analysed and compared as well.]]></description>
<pubDate>2014/1/3 16:01:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang　Pu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang　Pu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803006]]></guid><cfi:id>538</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Expert Rule Deduction System Based on Neural Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper, we present a method of training a feedforward neural network using supervised learning scheme to balance an inverted pendulum and cart system. The data used to train the neural network was obtained from a human expert doing the same task. The trained neural network uncovers a set of rules which could be very difficult to derive from the human expert. Comparison was made between the neural-network learned rule and a decision tree rule deducted by Quilan's ID3 induction algorithm using the same set of data. Experiment results showed that the neural network learned rule is more robust. At the same time, we find that the neural network learned rule can be modified to do a similar and more important task——the attitude control of a rocket.]]></description>
<pubDate>2014/1/3 16:01:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Bing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Bing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803008]]></guid><cfi:id>537</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Intention Theory of Multi-Agent System Computing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Intention is an important cognitive concept to specify multi-agent system. An intention theory is presented in this paper to support the research on the theory of multi-agent system computing. Based on the action modeling theory of multi-agent system computing, the new formal semantics of the intention is defined and some important properties are obtained.]]></description>
<pubDate>2014/1/3 16:01:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Mao Xinjun,Wang Huaimin and Cheng Huowang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Mao Xinjun,Wang Huaimin and Cheng Huowang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803009]]></guid><cfi:id>536</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A CPU Scheduling Model Supporting Multimedia Application]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The advent of multimedia application calls for new scheduling paradigms in operating system. The new paradigm should be able to handle the combination of hard real-time、soft real-time and conventional application present in many multimedia systems. This paper proposes a CPU scheduling model supporting the functions described above. The paper proposes two algorithms to implement this model: QoS-based CPU bandwidth partitioning algorithm and two-level priority algorithm.]]></description>
<pubDate>2014/1/3 16:01:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zhang Yongjun and Chen Fujie]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zhang Yongjun and Chen Fujie</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803011]]></guid><cfi:id>535</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Product Data Management Technique Based on Design Body Model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[According to the requirement of design of electronic system and device, this paper proposes an object oriented product data model-design body model. Based on the model, the paper presents the implementation strategies of configuration management and version management of product data.]]></description>
<pubDate>2014/1/3 16:01:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Guo Yang,Yang Jun,Chen Xucan and Li Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Guo Yang,Yang Jun,Chen Xucan and Li Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199803012]]></guid><cfi:id>534</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Model and Architecture of CAD Framework Based on Distributed Object Technology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199802009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Distributed object computing is the main-stream technology of enterprise application integration. This paper introduces the structure of the framework supporting platform based on distributed object technique. Then it proposes the architecture of a CAD framework for large-scale electronic device, and presents a framework model based on framework bus and soft component. Finally, the paper discusses the implementation methods and technologies of integrated framework.]]></description>
<pubDate>2014/1/3 16:01:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Yang Jun,Li Sikun and Guo Yang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Yang Jun,Li Sikun and Guo Yang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199802009]]></guid><cfi:id>533</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design of a Cooperative Supporting Platform GZ-PCCS for Police Command Center]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199801016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The main issue in designing CSCW system is how to provide efficient collaboration mechanisms. This paper originally introduces the concept of CSCW into the design of a modern police command center system. Then we discuss the design and implementation of a cooperative supporting
platform for the police command center system. During the design process，we propose a hierarchical cooperative mechanism based on task and  discuss several concrete cooperative methods. Finally we propose an implementation prototype GZ-PCCS based on the hierarchical cooperative mechanism and a “Centralized-Distributed” hybrid architecture.]]></description>
<pubDate>2014/1/3 16:00:53</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Feng Chenhua,Xu Jie,Chen Sheng,Wang Honggu and Zhuang Zhaowen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Feng Chenhua,Xu Jie,Chen Sheng,Wang Honggu and Zhuang Zhaowen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199801016]]></guid><cfi:id>532</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Behavior Models of Virtual Artifacts]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199801017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper addresses the behavior models of virtual artifacts. First we provide the results in our research on related work. Then we present a novel behavior model SCP，which is based on principles of cybernetics. for creating virtual artifacts that move and behave in simulated virtual environments. Finally，we also provide its user interface and characteristics.]]></description>
<pubDate>2014/1/3 16:00:53</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zheng Yuan,Li  Sikun,Hu Chengjun and Yan Laibin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zheng Yuan,Li  Sikun,Hu Chengjun and Yan Laibin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199801017]]></guid><cfi:id>531</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A High Speed BP Algorithm for the Feed-forward Multilayer Neural Network Using Limited Precision Calculation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199801019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The precision required for neural network algorithm is an important question for hard-ware architects. This paper gives an excellent high  speed BP algorithm for feed-forward muitilayer neural network using limited precision calculation. The experimental results show that the  algorithm improves convergence speed with reduced precision bits.]]></description>
<pubDate>2014/1/3 16:00:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Luo Li and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Luo Li and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199801019]]></guid><cfi:id>530</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[On Network Traffic Management of Unix System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199801020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Efficient performance and high throughput are the major goals of the network performance management. Standard UNIX system is short of efficient management of network traffic. This research thesis implements a network traffic query utility for users to monitor the network traffic  situations. The network users can also query the network/system status of their computer hosts. Having Realized the network traffic situation，manager and users can reconfigure the network configuration，or reallocate the network resources to improve the network performance and  throughput. The results show that techniques presented work very well.]]></description>
<pubDate>2014/1/3 16:00:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Su Jinshu and Liu Xueqing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Su Jinshu and Liu Xueqing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199801020]]></guid><cfi:id>529</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Research and Implementation of ICMIIP Based on Internet]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199906025]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The paper discusses the research and implementation of ICMIIP based on Internet, including the implementation of Java ORB complying with CORBA 2.0 specification, and the methods of how to use Java ORB to integrate the legacy application developed on relation data base system and lead them to Internet/Intranet.]]></description>
<pubDate>2013/11/18 15:33:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Liu Hui,Jia Yan and Dou Wen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Liu Hui,Jia Yan and Dou Wen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199906025]]></guid><cfi:id>528</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Data Placement in Parallel Object-Oriented Database]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199905021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper, according to the features of parallel object-oriented database and asynchronous parallel query execution strategy, a class-based hybrid data placement strategy is proposed, which consists of two parts: the hybrid data partition strategy and the class-based data allocation strategy.]]></description>
<pubDate>2013/11/18 15:32:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Wang Yijie and Hu Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Wang Yijie and Hu Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199905021]]></guid><cfi:id>527</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[DEC UNIX Real-Time Operation System Performance and Test]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199904017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Real-time operating system is one important component of complex real-time system. The operating system itself must be predictable. This paper first analyzes and describes the real-time functions of DEC UNIX 4.0. And then we secondly developed a effective test approach of real-time operation system performance. Finally we give the test process and results of DEC UNIX4.0B running on DEC Alpha series computers.]]></description>
<pubDate>2013/11/18 15:32:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Mao Yugang,Jin Shiyao and Ling Yunxiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Mao Yugang,Jin Shiyao and Ling Yunxiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199904017]]></guid><cfi:id>526</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Analysis of Parallel Scientific Application's Dynamic I/O]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199904018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[It is necessary to understand the mode of I/O mode before designing a parallel file system (PFS). The structure, interface and algorithm of cache/prefetch is closely related to application. Now, most analyses are based on static I/O model, but the dynamic mode is much more important to PFS. This paper analyses the dynamic I/O mode of parallel scientific application, and summarizes the characteristics of I/O size, interval, sequence and so on. The conclusion of what should be considered when designing a PFS is finally drawn.]]></description>
<pubDate>2013/11/18 15:32:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Lu Kai and Jin Shiyao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Lu Kai and Jin Shiyao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199904018]]></guid><cfi:id>525</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Basic Principles of Application System Design of Collocative Computing of Distributed Multi-computers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199904019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Base on a case of collocating computing system design, this paper discusses the principles of system partitioning, communication mechanism, and high-performance parallel computing of the distributed multi-computers system.]]></description>
<pubDate>2013/11/18 15:32:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Ling Yunxiang,Dang Gang,Shi Yang and Jin Shiyao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Ling Yunxiang,Dang Gang,Shi Yang and Jin Shiyao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199904019]]></guid><cfi:id>524</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Study and Implementation of Active Service Based on CORBA Event Service]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199904020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This article introduces the active service, discusses the system framework based on CORBA Event Service. And it presents the system's application to telecommunication.]]></description>
<pubDate>2013/11/18 15:32:47</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Guo Changguo,Liu Jiangning and Zou Peng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Guo Changguo,Liu Jiangning and Zou Peng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199904020]]></guid><cfi:id>523</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on the Performance Impacts of Memory Reference Behaviors in DSM Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199903019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper first abstracts several important parameters according to the memory reference behaviors of applications and then presents a model of processor efficiency for DSM systems. Based on the performance model this paper analyzes how the applications reference behaviors affect the processor efficiency. Several ways to improve processor efficiency are given at the end of this paper.]]></description>
<pubDate>2013/11/18 15:33:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Shi Yang,Jin Shiyao and Zhang Chenxi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Shi Yang,Jin Shiyao and Zhang Chenxi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199903019]]></guid><cfi:id>522</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Capability Theory of Agent in Multi-agent System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199903020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Capability is an important abstract concept to specify agent A capability theory of agent computing is presented in this paper.We present the concept of plan tree to describe how agent organizes its plans effectively to fulfill its tasks and maintain conditions in the dynamic, non-deterministic multi-agent system. Based on the concept of plan tree, the formal semantics of the capability is defined and some important properties are obtained.]]></description>
<pubDate>2013/11/18 15:33:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Mao Xinjun,Wang Huaimin and Chen Houwang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Mao Xinjun,Wang Huaimin and Chen Houwang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199903020]]></guid><cfi:id>521</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Building Technology of Real-Time Diagnose Expert System of the Center Computer System on Board the Ship for Fulfilling the Measuring Task on Sea]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199902020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The purpose of building real-time monitor expert system of the Center Computer System of the ship for fulfilling the measuring task on sea is to improve the real-timing and reliability. Around the real-time expert system's time-order, time-variable and timing, the kernel technology to design and build this system is discussed in the paper.]]></description>
<pubDate>2013/11/18 15:33:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Liu Jiangning,Wu Quanyuan,Wu Chunlong and Zhang Zhonghua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Liu Jiangning,Wu Quanyuan,Wu Chunlong and Zhang Zhonghua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199902020]]></guid><cfi:id>520</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Study and Implementation of Interface Repository in StarBus System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199902021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In compliance with the CORBA specification, the paper has elaborated the design of Interface Repository and the functions of the Interface Repository in Star Bus system, illustrated the contents and architecture of Interface Repository, introduced in detail the implementation of Interface Repository Service.]]></description>
<pubDate>2013/11/18 15:33:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Liu Hui,Zhou MingHui and Zhou Li]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Liu Hui,Zhou MingHui and Zhou Li</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199902021]]></guid><cfi:id>519</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and Implementation of the StarBus-Based Object Transaction Service]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199901019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the distributed computing environment, the Object Transaction Service (OTS) is useful to be really effective for devoloping the distributed system. The implementation design of the OTS is critical for the service to reduce network traffic jam. This paper focuses on a new implementation design on top of the object-oriented pass-by-value semantics which can deal with the problem so as to reduce network traffic jam and be applied to enterprise applications.]]></description>
<pubDate>2013/11/15 15:37:25</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Xu Haiyuan and Wu Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Xu Haiyuan and Wu Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199901019]]></guid><cfi:id>518</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Battlefield Information-Base and It's Information Management in Individual-Soldier System——The fourth of Series of Papers on Digitized Battlefield and Individual-Soldier Digitization System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199901021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A classification of Individual-Soldier System battlefield information and a structure of its informationbase system is discussed in this paper at fitst, and then the author analyses the functions, the design principles and the information processing procedures of individual-Soldier battlefield information-base system.]]></description>
<pubDate>2013/11/15 15:37:25</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zou Fengxing,Zou Chenlu and Xie Shiyan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zou Fengxing,Zou Chenlu and Xie Shiyan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199901021]]></guid><cfi:id>517</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Architecture of Individual-Soldier Computer System——The Third of Series of Papers on Digitized Battlefield and Individual-Soldier Digitization System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199901022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This article begins with an analysis of function, functional specification of Individual-Soldier Computer System and the types, performance, scales of it's external exchanging informance. Then the author gives an architecture of Individual-Soldier Computer System by using layered control fault-tolerant multiprocessor which is interconnected through two-level bus. Besides an explanation of the principle of the architecture is given by the author in hardware and software.]]></description>
<pubDate>2013/11/15 15:37:25</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[Zou Fengxing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>Zou Fengxing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/199901022]]></guid><cfi:id>516</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Formal Model of Mobile Agent]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200006010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Mobile agent receives much attention recently in the distributed computing field. But the research on its formal model is immature. The necessity of the formal research of mobile agent is analyzed firstly. Then we introduce several representative formal models, analyze their drawbacks, and present the prospects for the future work.]]></description>
<pubDate>2013/11/18 15:31:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU QuanYuan,WU Gang and WANG HuaiMin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU QuanYuan,WU Gang and WANG HuaiMin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200006010]]></guid><cfi:id>515</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Crossbar Scheduling Algorithm for DiffServ Routers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200006011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[High performance routers often use crossbar switch. It is important to a crossbar switch to support QoS (Quality of Service). This paper presents a new crossbar scheduling algorithm-OSP(Output Serial Polling) which supports the DiffServ (Differentiated Service) model purposed by IETF. OSP algorithm can deal with cells that have different priority while achieving high crossbar throughput at the same time. Comparing other algorithms, OSP can be implemented more easily in hardware.]]></description>
<pubDate>2013/11/18 15:31:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Zhigang and LU Xicheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Zhigang and LU Xicheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200006011]]></guid><cfi:id>514</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Towards the Architecture of Collaborative virtual prototyping Environment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200006013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Collaborative virtual prototyping is an integrated technology of applications, standards and relevant technologies supporting the co-design, M&S of a virtual prototype, with the on integrated, multi-discipline and analytical models. The concept of CVP is first introduced, then the concept and technology framework of CVPE is discussed. Based on the analysis of the typical CVPE architecture, the architecture of CVPE supporting virtual acquisition is given.]]></description>
<pubDate>2013/11/18 15:31:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Wen,WANG Weiping and ZHU Yifan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Wen,WANG Weiping and ZHU Yifan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200006013]]></guid><cfi:id>513</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Optimal Overlapping Boundaries Model for Distributed Memory Parallel Computing of Difference Discrete]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200005016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An optimal overlapping boundaries model is presented, aiming at the explicit difference schemes on distributed memory parallel computing, in accordance with the architecture of distributed memory multiprocessors. This model has been successfully utilized in the optimization of distributed parallel computing of the third generation ocean general circulation model of the Chinese Academy of Science.]]></description>
<pubDate>2013/11/18 15:30:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Lilun<sup>1</sup>,YE Hong<sup>2</sup>,SUN Anxiang<sup>1</sup> and LI Xiaomei<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Lilun<sup>1</sup>,YE Hong<sup>2</sup>,SUN Anxiang<sup>1</sup> and LI Xiaomei<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200005016]]></guid><cfi:id>512</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Reference Based on High Performance Joining Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200005017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the features of ORDM(Object-Relational Data Model) and the query language, a new reference based on join algorithm Sort-Loop is represented. Reference is not only one of the important modeling mechanism, but also beneficial to the design and implementation of joining algorithms, such as Hash-Loops. By overcoming the shortcomings of the Hash-Loops in the data access manner and the use of the main memory, Sort-Loop is of high performance. This is validated by the analysis in the paper.]]></description>
<pubDate>2013/11/18 15:30:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Guogui and WU Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Guogui and WU Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200005017]]></guid><cfi:id>511</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design and Implementation of Cube Theory-based MFTA Software]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200005023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The MFTA software provides a computer-aided tool for the reliability engineers to analyze multi-state system. Designed on the platform of Windows 95, it has friendly interface. The software used TreeView component to input the logic tree, used StringGrid component to input the judgment table directly. What is more, it can fulfil the conversion of logic models from typical structure function to judgment table automatically. Based on Standard Template Library of C+ + Builder, the library of cube class, upon which the Cube Theory-based MFTA algorithms and analysis methods are implemented, has been developed. The software can be used successfully in the multi-state system reliability analysis.]]></description>
<pubDate>2013/11/18 15:30:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIE Hongwei,XIA Jiahai and ZHANG Ming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIE Hongwei,XIA Jiahai and ZHANG Ming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200005023]]></guid><cfi:id>510</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Automatic Shot Clustering Method]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200005024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Shot clustering is an important aspect of video content analysis. The basic task of shot clustering is to classify shots based on their low-level features. This paper describes a novel shot-clustering technique. Beginning with an initial classification of the shot set, our algorithm proceeds with merging and splitting iteration alternatively to reduce the errors in the initial results. The main advantage of this algorithm is that it does not need any experiential parameters or thresholds, nor does it need any manual interaction. In this way, our algorithm overcomes shortcomings of tradi tional clustering algorithm and works well in practical systems.]]></description>
<pubDate>2013/11/18 15:30:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIONG Hua<sup>1</sup>,HU Xiaofeng<sup>2</sup> and LAO Songyang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIONG Hua<sup>1</sup>,HU Xiaofeng<sup>2</sup> and LAO Songyang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200005024]]></guid><cfi:id>509</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Realizing a Real-time 4-Channel Stereo Sound Environment for Virtual Battlefield]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200004012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Real-time algorithms are given to generate 4-channel stereo sound for virtual battlefield. For the special case of 4-channel stereo sound,  first we studied the speaker layout scheme of 4-channel stereo sound system. Based on the given speaker layout, we dealt with the attenuation of sound intensity and turned a mono sound into a stereo one. Then, a criterion for evaluating the effect of sound mixing is proposed. An algorithm based on this criterion is also given to mix sounds randomly in real-time. The algorithm has been successfully applied in one of our applications to realize a real-time 4-Channel Stereo Sound environment for virtual battlefield. The effect is quite good.]]></description>
<pubDate>2013/11/18 15:30:47</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZENG Liang and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZENG Liang and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200004012]]></guid><cfi:id>508</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Formula Discovery from Data Based on Operators Space]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200004013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the research of AI involved in FDD and data approach, The paper has presented a new algorithm for formula discovery from a large amount of experimental data. And then we build up the system by using the algorithm based on space of operators. The basic rules of operators are simplified, and the other three rules: derivative rule, inaccuracy rule and end rule, are introduced, which extend the knowledge lib and make it easy to use the rules in lib. Through the above improvement more forms and complexity of functional formulas are found than BACON and FDD system. In the end, the simulation result is given.]]></description>
<pubDate>2013/11/18 15:30:47</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Xinyu,CHEN Wenwei and HE Yi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Xinyu,CHEN Wenwei and HE Yi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200004013]]></guid><cfi:id>507</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Research and Design of the Dynamic Active Replication Fault-Tolerant Protocol]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200004014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[From the software fault-tolerance view, we introduce the group communication technology to the active replication technology, propose a new dynamically active replication protocol based on a coordinator. When the coordinator is crashed, the protocol can dynamically select a new coordinator process and ensure the state of all the backup service processes are consistent. The advantage of the protocol is the short response time and high efficiency.]]></description>
<pubDate>2013/11/18 15:30:47</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Dianxi,WU Quanyuan,WANG Huaimin and ZHOU Peng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Dianxi,WU Quanyuan,WANG Huaimin and ZHOU Peng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200004014]]></guid><cfi:id>506</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research of Stage-by-Stage Executing Strategy and Query Processing Technology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200004015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[According to the features of the object-oriented database and its query, the stage -by-stage executing strategy and the data operation parallel executing algorithm are proposed. The theoretical analysis and simulation results show that they are efficient and practical.]]></description>
<pubDate>2013/11/18 15:30:47</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG YiJie and HU ShouRen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG YiJie and HU ShouRen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200004015]]></guid><cfi:id>505</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Genetic Operators in Task Matching and Scheduling]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200003008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Task matching and scheduling by genetic-algorithm-based approaches have been attractive problems. Standard genetic operators are not always suitable for task matching and scheduling based on permutation representation. Genetic operators are important for genetic algorithms. Three genetic operators are proposed: improved crossover(IMCX), internal crossover(INCX), and migration which transfers a task from a processor to another within a schedule as a kind of mutation. Simulation results and analysis show that these genetic operators are effective for task matching and scheduling.]]></description>
<pubDate>2013/11/18 15:30:58</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHONG Qiuxi and CHEN Huowang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHONG Qiuxi and CHEN Huowang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200003008]]></guid><cfi:id>504</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Distributed Parallel Computation of the Global Atmospheric Data Objective Analysis System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200003009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[It is a difficult task to parallelize the existing sequential algorithm. A distributed parallelized algorithm is described by means of static data distribution after researching into the sequential algorithm of the global atmospheric data objective analysis system. We have achieved the parallelization by extracting the analysis boxes and model grid point latitude rows with leaped step and distributing data to different processors. The parallelization algorithm has a good load balance, a highly parallelization efficiency and a lower parallelization cost. Good scalability can be got from the algorithm.]]></description>
<pubDate>2013/11/18 15:30:58</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Jun,SONG Junqiang,ZHANG Lilun and ZHU Xiaoqian]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Jun,SONG Junqiang,ZHANG Lilun and ZHU Xiaoqian</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200003009]]></guid><cfi:id>503</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[IQoSM: A Framework Model for Supporting Quality of Service in Distributed Multimedia Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200002016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the development of multimedia applications, QoS guarantee technology becomes more important. There are different QoS strategies and arithmetic for different types of multimedia applications. It is useful to study how to make the QoS service adapt to the heterogeneous of distributed applications, how to make it easy to change the QoS strategies and arithmetic according to the types of applications. This paper puts forward a QoS manager object model called IQoSM. It provides an entirely QoS manage framework, every module can be developed independently, and work coordinated. With the IQoSM, people can easily change the QoS strategies and arithmetic without wholly reprogramming and redesigning. It is flexible and easy to be reconstructed. It can also work together with CORBA A/V STREAM mechanism.]]></description>
<pubDate>2013/11/18 15:32:04</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Xiaomei,LU Xichen and WANG Huaimin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Xiaomei,LU Xichen and WANG Huaimin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200002016]]></guid><cfi:id>502</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Secure Group Signature Scheme]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200002017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the discrete logarithm, this paper proposes a group signature schemes. The scheme preserves the main merits inherent in previously proposed schemes, and solves the anonymity problem. In the scheme, even though the group authority announces some additional information to provide the verifier with confirmation of the identity of the signer, the anonymity of this signer will be maintained in the other group signatures, and the group authority need not renew any of the keys of this signer. The reason is that announced information is only provided in order to identify the specific group signature.]]></description>
<pubDate>2013/11/18 15:32:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Ronghua and HU Xiangling]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Ronghua and HU Xiangling</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200002017]]></guid><cfi:id>501</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Window Mechanism in Computer Communication Network Technology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200002018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The window mechanism implemented in computer networks is analyzed, and the results are given for Data-Link-layer and network-layer respectively, The selection of parameters in window mechanism is also presented. A specified program flowchart of window mechanism is offered at the end of this paper.]]></description>
<pubDate>2013/11/18 15:32:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Dongyun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Dongyun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200002018]]></guid><cfi:id>500</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Triangulation Algorithm for General Plane Polygon]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200002019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Considering the triangulation algorithm based only on the determination of convex-concave vertices is restricted to simple polygons, this paper presents a triangulation algorithm for the general plane polygon GTP(General Triangulation of Polygons) based on determination of convex-concave vertices and connecting the outer border of a polygon with its inner borders. GTP is rapid and can be applied to any plane polygon. GTP has been implemented and acquired good effect in application.]]></description>
<pubDate>2013/11/18 15:32:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Chunlei and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Chunlei and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200002019]]></guid><cfi:id>499</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Researches on Join Index Technology in ORDB]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200001001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A new type of index structure called join predicate index (JPI) is described. The JPI can be used to improve the performance of joins in object relational data base systems. After the introduction of JPI, a join algorithm based on JPI is presented and the performance analysis formula is given. It is also proposed which should be the outer relation so as to decrease the expense of the join op-eration. Lastly, the basic JPI is extended to the join of n relations.]]></description>
<pubDate>2013/11/18 15:30:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Guogui and WU Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Guogui and WU Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200001001]]></guid><cfi:id>498</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Practical and Efficient Recovery Strategy WAL＿P]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200001002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In view of the system structure and transaction model of OODB,a practical and efficient recovery strategy—WAL＿P is proposed, which is implemented in the object-oriented database system KDOODB, and provide powerful support for the efficient implementation of the transaction management.]]></description>
<pubDate>2013/11/18 15:30:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Yijie and HU Shouren]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Yijie and HU Shouren</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200001002]]></guid><cfi:id>497</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research and Implementation of a Distributed Framework for Concurrent Design]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200001003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As the design of products is becoming more complex, and the time it takes for these products to go on the market becomes shorter, the concurrent design technique is widely used. This paper proposes a distributed framework-YC-bridge, which supports the concurrent design of multi-domain complex products. Based on Client/Server middleware, the framework realizes design datamanagement based on design body model,  tool encapsulation based on sementic model, design process management based on the extended net graph model. YC-bridge has been applied successfully in practical design work.]]></description>
<pubDate>2013/11/18 15:30:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Sikun,GUO Yang,PENG Yuxing and Yang Jun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Sikun,GUO Yang,PENG Yuxing and Yang Jun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200001003]]></guid><cfi:id>496</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Study on the Technology of Memory Locking in Realtime Applications]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200001005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Memory locking is a way to ensure that a process stays in main memory and is exempt from paging. In a realtime environment, a system must be able to guarantee that it will lock a process in memory to reduce latency for data access, instruction fetches, buffer passing between processes, and so forth. Locking a process's address space in memory helps ensure that the application's response time satisfies realtime requirements. As a general rule, time-critical processes should be locked into memory. This paper describes the items about “Memory Locking and Unlocking Functions”and“Memory Locking in multiprocesses environment”in a realtime environment.]]></description>
<pubDate>2013/11/18 15:30:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Chunqing and LI Gang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Chunqing and LI Gang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200001005]]></guid><cfi:id>495</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Shor-Preskill Method Is Inapplicable to B92 Protocol]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200106015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To ensure absolute security of key distribution, each key distribution scheme must be proved. While the security of most classical cipher schemes cannot be proved, the security of quantum cipher schemes is guaranteed by quantum mechanics and can be strictly proved. Shor-Preskill's method with which  the unconditional security of BB84 quantum key distribution scheme is proved is introduced first. Its techniques and features are summarized and the subtleties of using symmetrization and quantum entanglement purification (QEP) to reduce a QEP based BB84 to a CSS based BB84, and of using the property of CSS code to reduce the CSS based BB84 to standard BB84 protocol are revealed. Then it is proved that Shor-preskill's method cannot be applied to B92 protocol directly. A possible solution to prove the unconditional security of B92 using Shor-Preskill's method indirectly is proposed.]]></description>
<pubDate>2013/8/21 9:51:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Quan and XIE Xiaoxia]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Quan and XIE Xiaoxia</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200106015]]></guid><cfi:id>494</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Enhanced Personal Firewall]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200106018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[At the information age, more and more affansion is paid to PCs' information protection. Firstly the principles of Personal Firewall is introduced, and the disadvantages of some typical PFW products is analysed in IP filtering, port protection, exploit protection, and process protection. Hence, the concept of enhanced personal firewall is brought out. After that, the designation and technical methods of EPFW's IP filtering, port protection, exploit protection, virus protection and process protection are illustrated. All these show that EPFW is a reasonable way to solve the problem of PCs' information protection.]]></description>
<pubDate>2013/8/21 9:51:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Senqiang<sup>1</sup>,TANG Chaojing<sup>1</sup>,GAO Feng<sup>1</sup>,ZHANG Quan<sup>1</sup> and Yang Xiang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Senqiang<sup>1</sup>,TANG Chaojing<sup>1</sup>,GAO Feng<sup>1</sup>,ZHANG Quan<sup>1</sup> and Yang Xiang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200106018]]></guid><cfi:id>493</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[军队院校学报计量指标的比较与分析]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200106026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[利用CJCR的统计数据，对选取作为“中国科技论文统计源期刊”的部分学报进行了比较，分析了军队院校学报总体质量不高的原因，提出了提高质量的对策和建议。]]></description>
<pubDate>2013/8/21 9:51:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[王昌度,熊云]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>王昌度,熊云</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200106026]]></guid><cfi:id>492</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Distributed Intrusion Detection System (DIDS)]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200105022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The principle of intrusion detection system (DIDS) is introduced, and its advantages and disadvantages are analyzed. Hence, we bring out the concept of Distributed IDS, comparing the design goal with the performance of some IDS products. In the end, the designation of DIDS is discussed in detail in regard to the aspects of the functionality module designation, the retrieve and update of attack characteristics, the enhancing of the attack detection and reactivity, the correlated attack analysis, and the more active reaction policy.]]></description>
<pubDate>2013/8/21 9:51:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Quan,ZHANG Senqiang and GAO Feng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Quan,ZHANG Senqiang and GAO Feng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200105022]]></guid><cfi:id>491</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Study and Practice about Vector Graphics Animation Based on Compound Behavior]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200104016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[According to the designing methods, computer animations can be divided into three kinds: frame-by-frame animation, keyframe animation and actor animation. Actor animations may meet the demand for real-time and interactivity. The model of actor is the key for actor animation. This paper mainly presents the modeling method of the actor in Net_Anim system developed by the author, which includes: the object-oriented model of the actor and the control scheme based on the model; the algorithms for synthesizing compound behaviors and some key problems to be considered; an example to demonstrate the compound actor with compound behaviors; the characteristics of Net_Anim and some problems to be solved in the future.]]></description>
<pubDate>2013/8/21 9:51:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Shilin,WU Quanyuan and ZHANG Chenxi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Shilin,WU Quanyuan and ZHANG Chenxi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200104016]]></guid><cfi:id>490</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Auxiliary Decision and Designing System of the Design of Construction Project Organization]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200104017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The optimizing of the railway construction project organization variant, and the auxiliary designing system of picture format files are introduced. Relative calculation method used to optimize variant of the railway construction organization design with multi-level and multi-object decision making method is provided.]]></description>
<pubDate>2013/8/21 9:51:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Changyou and ZHOU Jizu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Changyou and ZHOU Jizu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200104017]]></guid><cfi:id>489</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[High-Performance Asynchronous Callback Model Based on Distributed Object]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200103018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Distributed object technology is a good solution of software development and integration, but traditional invocation models of distributed object restrict the application of distributed object technology in high-performance distributed computing field (eg. Distributed transaction processing, distributed interactive simulation and distributed parallel computing) due to their lack of asynchronism. So, this paper presents a new asynchronous callback model based on distributed object and mainly discusses the definition, key implementation technology, optimization strategy and performance test.]]></description>
<pubDate>2013/8/21 9:52:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Xiaoming,WU Quanyuan and JIA Yan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Xiaoming,WU Quanyuan and JIA Yan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200103018]]></guid><cfi:id>488</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research of Optimization Technology Based the Customization Mechanism in CORBA]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200103019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The expressiveness of current CORBA IDL is poor. Semantic properties of distributed objects can't be documented formally. The automation of the software development in CORBA is limited to the generation of the stub and skeleton that support basic functions. A kind of mechanism for customizing the dispatching and layering strategies of distributed objects is provided through extending the annotations used for describing objects behavior in IDL files. The mechanism not only improves time and space performance of applications, but also has no effect on portability and interoperability of applications. Moreover, a design pattern to resolve similar problems is presented by extending CORBA IDL.]]></description>
<pubDate>2013/8/21 9:52:04</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIANG Jun,WU Quanyuan and WANG Huaimin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIANG Jun,WU Quanyuan and WANG Huaimin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200103019]]></guid><cfi:id>487</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Application of IDEF0 Method in Analysis and Design of Military Integreted Information Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200103020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The applications of IDEF0 method in military integreted information systems analysis, design, updating, integration, and simulation are discussed in detail. For IDEF0 model is simple but comprehensive, and with powerful ability in system description, it is widely applied in various fields, especially in manufacturing. Military integreted information systems, based on information and supported by activity, are large and complex systems. With IDEF0 model, the common understanding of the systems both for the military commander and the technical engineers can be deepened. So it can improve the effectiveness and practicability of development of the military integreted information systems.]]></description>
<pubDate>2013/8/21 9:52:04</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LUO Xueshan,ZHU Decheng and SHEN Xueshi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LUO Xueshan,ZHU Decheng and SHEN Xueshi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200103020]]></guid><cfi:id>486</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[HESTool:An Expert System Tool Based on Hierarchical Knowledge Base]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200103027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper puts forward the concept of task, which essentially stands for an independent knowledge source.A knowledge base can be constructed with tasks organized by forward or backward links, which implements well-structure and visualization of knowledge bases and supports the reuse and share of knowledge components as well.In addition, HESTool, a practical expert system tool based on hierarchical knowledge base, is developed with visual and database technology. A modeling scheme is provided in HESTool.]]></description>
<pubDate>2013/8/21 9:52:04</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CAO ZeWen,ZHU Cheng and LIU Zhen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CAO ZeWen,ZHU Cheng and LIU Zhen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200103027]]></guid><cfi:id>485</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Description Model and Language of Virtual Prototype in Conceptual Design]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200102014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Considering the characteristics of conceptual design and the feature classification of virtual prototype, this paper presents a novel virtual prototype-based product model, V-desModel, and the description language, VPML, in conceptual design. It introduces virtual feature concept in the product's view models, and employs expandable 3D entity-constraint graph to describe the constraints between design objects. V-desModel and VPML language can effectively support the process of cooperative design and concurrent design, solve the insufficient information problems in constructing virtual prototype during the conceptual design of product. They provide coherent model description for cooperative design, concurrent design, and confederate simulation of multi-discipline systems.]]></description>
<pubDate>2013/8/21 9:52:17</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Qiang,LI Sikun,GUO Yang and PENG Yuxing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Qiang,LI Sikun,GUO Yang and PENG Yuxing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200102014]]></guid><cfi:id>484</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Algorithm for Performance-driven Timing-planning]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200102015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the architecture design stage of super computer, it is indispensable to perform timing planning to judge the physical realizibility of architecture alternative and performance metrics as early as possible. This paper presents a performance-driven timing-planning method. A timing performance model which is suitable to describe component performance is adopted, and the path delay slack is distributed according to net weight. The algorithm has advantages of high efficiency and rational delay distribution.]]></description>
<pubDate>2013/8/21 9:52:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUO Yang,LI Sikun and YANG Qiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUO Yang,LI Sikun and YANG Qiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200102015]]></guid><cfi:id>483</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Study of the Scalability Analysis for the Parallel Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200101014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Several existed models for scalability analysis are introduced. The time-constraint and memory-constraint speedup laws are analyzed from a new viewpoint. Based on these models, we extract the essential of this metric and give a generalized definition for it when the parallel system is composed of a parallel algorithm and an isomorphic architecture. From this definition, present three other models for scalability analysis: equal-average-I/O-requirements model, equal-average-communication-requirements model and equal-utilization model. Finally, We discuss the extension of these models to cluster of workstation systems.]]></description>
<pubDate>2013/8/21 9:52:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Jianping<sup>1</sup>,WANG Zhenghua<sup>1</sup> and LI Xiaomei<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Jianping<sup>1</sup>,WANG Zhenghua<sup>1</sup> and LI Xiaomei<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200101014]]></guid><cfi:id>482</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Serial and Parallel Strategies of Watershed Transform]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200206017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Watershed transform is a classical method of image segmentation in mathematical morphology, and its parallelism is an important problem. This paper starts with a mathematical model of watershed transform in topography, followed by its several formal definitions for digital case. Then some new serial watershed algorithms proposed in recent years are classified and analyzed, based on which their related parallel strategies are discussed in detail. Then we analyze some issues, which should be considered when designing parallel watershed algorithm, and give an evaluation of existing parallel algorithms, and draw some conclusions. Finally we point out the problems and challenges of future research.]]></description>
<pubDate>2013/8/21 9:49:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Haifang,JIANG Yanhuang and YANG Xuejun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Haifang,JIANG Yanhuang and YANG Xuejun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200206017]]></guid><cfi:id>481</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research and Implementation of Cache Scheme in a Proxy Firewall]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200206018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Proxy caching has been recognized as one of the effective schemes to minimize the user access latency and reduce the network traffic. This paper gives a deep research into the key techniques of a caching system, such as information filtering、stale page access and replacement algorithm,and finally presents a cache scheme based on the firewall log with little cost and a reasonable performance.]]></description>
<pubDate>2013/8/21 9:49:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAO Jing and ZHAO Long]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAO Jing and ZHAO Long</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200206018]]></guid><cfi:id>480</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Management and Maintenance of Data Warehouse Based on GMM]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200206019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Metadata management system is the core of construction and management and maintenance and use data warehouse system. The keys of metadata management lie in the construction a comprehensive and extended metadata model which describes all kinds of metadata. This paper presents a General Metadata Model(GMM) which can support management and maintenance of data warehouse effectively, such as management of the user view, personalized service, incremental refreshment, data lineage tracing, etc.]]></description>
<pubDate>2013/8/21 9:49:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DAI Chaofan,DENG Su,YANG Qiang,CHEN Wenwei and LIU Qingbao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DAI Chaofan,DENG Su,YANG Qiang,CHEN Wenwei and LIU Qingbao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200206019]]></guid><cfi:id>479</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Camera Calibration Method of Varying EffectiveFocal Length by Neural Network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The traditional calibration method is always imprecise, unstable and computed costly because of the nonlinear effect lead by lens distortion. A new camera calibration method of varying effective focal length by neural network model is presented. Both calibration result and 3D measurement result show that the new method achieves more precision and stable result than classical method does.]]></description>
<pubDate>2013/8/21 9:50:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[QIU Zhiqiang<sup>1</sup>,TANG Litie<sup>2</sup> and YU Qifeng<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>QIU Zhiqiang<sup>1</sup>,TANG Litie<sup>2</sup> and YU Qifeng<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205004]]></guid><cfi:id>478</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Study and Implemention of the Real-time Communication forthe Galaxy Simulation Workstation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The technology of the real-time communication between the Galaxy Simulation Workstation (GSW) and the shared-memory real-time network is first researched. Then the application program interface (API) of the real-time communication between them is introduced. And an example of real-time network communication, which is implemented in YHSIM simulation program, is described. Finally, the experimental result is given, which proves this technology can be effectively used for semi-physical simulation of large scale complex systems.]]></description>
<pubDate>2013/8/21 9:50:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[JIANG Zhiwen,YAN Laibin and YAO Yiping]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>JIANG Zhiwen,YAN Laibin and YAO Yiping</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205005]]></guid><cfi:id>477</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Study on the Evaluation Technology of theAttack Effect of Computer Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The evaluation technology of the Attack Effect of computer networks is an important and challenging subject of security evaluation in information systems. Nowadays, corresponding theory is not mature and correlative research reports are few. In this paper several currently primary evaluation techniques of information security are concisely analyzed. Then three evaluation models, i.e., the evaluation technique based on network information entropy, the security evaluation framework based on analytical hierarchy and the synthetical evaluation technique based on analytical indexes, are presented in order to conveniently measure and estimate the attack effect. Finally, some problems which must be paid attention to in practice are pointed out.]]></description>
<pubDate>2013/8/21 9:50:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Yirong,XIAN Ming,ZHAO Zhichao,XIAO Shunping and WANG Guoyu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Yirong,XIAN Ming,ZHAO Zhichao,XIAO Shunping and WANG Guoyu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205006]]></guid><cfi:id>476</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[On Survivabilty Techniques and Its Implementation Skeleton]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The method of implementing the network survivability design using the diversity dynamic drifting techniques is proposed here. The influence of this techniques on network security and survivability is analyzed. And an architecture skeleton of this technique is then presented. It is pointed out that the research has the features of prevision, completeness and realit]]></description>
<pubDate>2013/8/21 9:50:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HUANG Zunguo,LU Xicheng and WANG Huaimin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HUANG Zunguo,LU Xicheng and WANG Huaimin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205007]]></guid><cfi:id>475</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Powering Algorithm Based on Disparting Blocks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[RSA cryptosystem is the best one of the public key cryptosystems, and its enciphering or deciphering speed depends on a powering algorithm. This paper proposes a powering algorithm based on disparting blocks. By analyzing its complexity and comparing the complexity with other powering algorithms, it is proved that this is the fastest powering algorithm in Z/nZ.]]></description>
<pubDate>2013/8/21 9:50:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[NI Guyan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>NI Guyan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200205013]]></guid><cfi:id>474</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Data Redistribution of Parallel Computing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200204009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Data redistribution is necessary to enhance the algorithm performance in many parallel programs.Since data redistribution is performed at run-time,the cost of redistributing data among processors affects the performance of algorithm.High performance data redistribution is important for the parallel program.Butterfly algorithm for data redistribution of parallel computing is put forward in the paper.We have proved the correctness of the algorithm.Structured data transposition is designed.The performance is analyzed both theoretically and numerically.]]></description>
<pubDate>2013/8/21 9:50:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Anxiang,ZHANG Lilun and SONG Junqiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Anxiang,ZHANG Lilun and SONG Junqiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200204009]]></guid><cfi:id>473</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Immunity-Based Multi-agent Intrusion Detection System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200204011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on investigating immunological principles, the paper presents a multi-agent system for intrusion detection and response in networked computers. The immunity-based agents roam around the nodes, and monitor the situation in the network. These agents can mutually recognize each other's activities, coordinate in a hierarchical fashion, and take appropriate actions according to the underlying security policies. Mobile agents can learn and adapt to the environment dynamically and can detect both known and unknown intrusions. The multi-agent detection system can simultaneously monitor networked computer's activities at different levels, including the user level, system level, process level and packet level. The immunity-based multi-agent intrusion detection system is designed to be flexible, extendible, and adaptable that it can perform real-time monitoring in accordance with the needs and preferences of administrators.]]></description>
<pubDate>2013/8/21 9:50:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Zuoshun,DOU Wenhua and LIU Zhifeng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Zuoshun,DOU Wenhua and LIU Zhifeng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200204011]]></guid><cfi:id>472</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Efficient Multi-level Grids Based Relevance Filtering Method]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200204012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the distributed simulation system, lots of redundant data flowing on the net seriously restricts the system scalability. The relevance filtering base on even-grid reduces the redundant data while it is inaccurate in region matching. Because the sizes of all cells in even-grid are identical, it is difficult to fit all entities in the simulation. A relevance filtering method based on a multi-level grid is put forward which overcomes the above shortcomings and is characterized by agility and speediness.]]></description>
<pubDate>2013/8/21 9:50:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Chunlei,ZENG Liang and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Chunlei,ZENG Liang and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200204012]]></guid><cfi:id>471</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Multi-Level Configurable Embedded  Microprocessor Simulation Tool]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200204013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to meet the need of the embedded application specific microprocessors development and overcome some disadvantages of current microprocessor simulation tools, a new embedded microprocessor simulation tool — VCPU is introduced in the paper. Being different from other microprocessor simulation tools, VCPU is a flexible full-featured multi-level virtual prototyping. The designer can use VCPU to verify the embedded system, both hardware and software in the early design stage. Errors can be found and corrected before fabrication， thus the design cycle is reduced. VCPU has been used in embedded microprocessor development successfully.]]></description>
<pubDate>2013/8/21 9:50:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Lufeng,ZHAO Wenhui and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Lufeng,ZHAO Wenhui and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200204013]]></guid><cfi:id>470</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A User Modeling Method withoutNegative Examples for Personalized Services]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200203016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the exponential growth of World Wide Web, it becomes more and more time and energy consuming for users to find what they're interested in. It leads to a clear demand for personalized services, which can provide different users with different services User modeling is the key technology in implementing personalized services. Conventional user modeling methods with both positive and negative examples will either interfere users' normal browsing or bring in noises. A user modeling method without negative examples is presented. A hybrid of genetic algorithms and kNN classifier are utilized to search the words describing users' interests. The method is applied in personalized information filtering. The experiments show that the filtering ratio and precision can be 73.91% and 94.44% respectively, which demonstrates that our user modeling method is feasible and efficient.]]></description>
<pubDate>2013/8/21 9:50:35</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YING Xiaomin,LIU Ming and DOU Wenhua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YING Xiaomin,LIU Ming and DOU Wenhua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200203016]]></guid><cfi:id>469</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Exploiting the Bridge Linking HLA Federations and Two Examplesabout Time-Space Consistency]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200203017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Large-scaled distributed simulation system is urgently required in simulation community. The rapid evolution of HLA technology urges us to connect the different federations using gateway. The bridge federate can be adopted to maintain information transfer and system consistency Furthermore, we have discussed some introduced problems about the time-space consistency. The time advancement and ownership transfer are examined broadly as two examples.]]></description>
<pubDate>2013/8/21 9:50:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Zhaofu,LIU Xiaojian and JIN Shiyao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Zhaofu,LIU Xiaojian and JIN Shiyao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200203017]]></guid><cfi:id>468</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research of Maintaining Data Consistencyin Distributed Database Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200203018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Distributed database system is a main research direction in the database field. Maintaining the data consistency is a critical technical problem in the distributed database system. Based on analyzing in depth and comparing with many kinds of methods in data consistency maintenance, an effective method of maintaining the data consistency is presented. How to resolve the conflict caused by the parallel execution and how to maintain the consistency of all data copies by message queue are discussed in details.]]></description>
<pubDate>2013/8/21 9:50:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Min,YU Dandan and TU Guoqing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Min,YU Dandan and TU Guoqing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200203018]]></guid><cfi:id>467</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Novel Clustering-Based Method to Network Intrusion Detection]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200202014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Researchers have developed two general categories of intrusion detection, i.e. misuse detection and anomaly detection, which differ at model construction. Signature-based misuse detection, which can detect the well-known attacks, will do nothing when new attack comes. Even traditional anomaly detection can catch some new attacks, the learning process overly relying on the training data sets which contain either purely clean normal data or correctly labeled data makes it useless in most cases. To solve such a problem, a novel clustering based method, capable of proces sing training data sets without type label and/or containing unknown intrusion data, is presented in this paper. After the normalization of network connection data, cluster centroids which is null at first can be obtained gradually and automatically through comparing the distance between data instances and the predefined cluster width , and each data instance can be then classified into the cluster which has the minimum distance with it. To ensure that the clusters can best represent the data distribution, cluster centroids also can be dynamically adjusted according to data instances contained in this cluster. With the classified data instances, the anomaly data clusters can be easily identified using normal cluster ratio , therefore performing the real-time detecting of each real network connection datum. Experiment result shows that this method can not only detect some new attacks, from network connection data sets, with low false positive rate, but also tolerate more general data sets.]]></description>
<pubDate>2013/8/21 9:50:52</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIANG Tiezhu<sup>1,2</sup>,LI Jiancheng<sup>3</sup> and WANG Ye<sup>1,2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIANG Tiezhu<sup>1,2</sup>,LI Jiancheng<sup>3</sup> and WANG Ye<sup>1,2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200202014]]></guid><cfi:id>466</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on the Use of Genetic Algorithm in HW-SW Partition]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200202015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Hardware-software partitioning is a key problem in Hardware-software co-design of embedded system. This paper describes an approach based on genetic algorithm. Two methods, simulated annealing and selecting an individual in light of the probability, are used to enhance the algorithm's self-adaptability, efficiency and global optimization. It is validated via the partitioning results that the approach is stable, effective and efficient.]]></description>
<pubDate>2013/8/21 9:50:52</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Gongjie,ZHANG Lufeng and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Gongjie,ZHANG Lufeng and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200202015]]></guid><cfi:id>465</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Modified Preconditioners to Block Tridiagonal Matrices Based on Local Factorization]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200202017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A modified type of preconditioner is constructed with the help of local block factorization of block tridiagonal matrices. Then  the existence and the properties are analyzed. For the standard 5-point matrices, which are derived from the 2-D Laplace operator, the actual condition numbers of the preconditioned matrices are computed. The result shows that the condition number is proportioned to the square root of the order of the matrix. What's more, the longer the step of the local factorization, the smaller the coefficient is. Then efficient implementations of the preconditioners are focused on and three of them provided. Finally lots of experiments are performed for the constructed preconditioners and the well-known effective ones on the personal computer with main frequency of 550MHz and memory of 256M. The matrices in these experiments include the standard five point ones, and the ones derived from a 2-D elliptic operator with discontinuous coefficients. The results also show that the preconditioners are more efficient than the other tested ones.]]></description>
<pubDate>2013/8/21 9:50:52</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Jianping<sup>1</sup> and LI Xiaomei<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Jianping<sup>1</sup> and LI Xiaomei<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200202017]]></guid><cfi:id>464</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design of a Binocular Visual Positioning SystemBased on CMOS Chips]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A binocular visual relative positioning system based on CMOS vision camera chips is presented. The hardware structure of the system, selection of components and design of corresponding interface circuits are described. The hardware system includes: image collecting equipments, memories, a controller, a DSP and external interface circuits. An example is given. Being compact and highly integrated, the system has flexible interfaces, consumes low power and is of high precision. It can be easily installed in equipments, especially in embedded systems. So it have applications in many fields.]]></description>
<pubDate>2013/6/14 9:08:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHENG Zhiqiang,JI Xiucai and LIU Fei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHENG Zhiqiang,JI Xiucai and LIU Fei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306001]]></guid><cfi:id>463</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Automatic Circuit Extraction Using Program Slicing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The design extraction from HDL description has been greatly needed in modern VLSI design process,such as the design verification，low power analysis，test generation and so on.This paper presents a new circuit extraction method using program slicing technique,and develops an elegant theoretical basis, based on program slicing, for circuit extraction from Verilog description.  With the technique we can obtain a “chaining slice” for each given signal of interest.Our method has advantage in its fine grain,without writing-style limitation and in dealing with more Verilog components characteristics.The technique has been used in the design process and the results show its convenience，efficiency and good practicability.]]></description>
<pubDate>2013/6/14 9:08:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHU Dan,LI Tun,WAN Hai,GUO Yang and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHU Dan,LI Tun,WAN Hai,GUO Yang and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306003]]></guid><cfi:id>462</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Data Reduction in Network Based on the Intrusion Detection System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[NIDSs deal with the problem of data reduction before analyzing the events. Two important measures used in ANIDS are proposed: FSS and new feature construction. A novel algorithm named SRRW is put forward first, which can produce OFS by recognizing all strongly relevant features and restrict them in searching process. A feature construction method is used to get the OFS. The correlations between the original features can be analyzed by factor loading matrix.]]></description>
<pubDate>2013/6/14 9:08:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZOU Tao,SUN Hongwei,TIAN Xinguang and ZHANG Eryang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZOU Tao,SUN Hongwei,TIAN Xinguang and ZHANG Eryang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306004]]></guid><cfi:id>461</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Unlimited Blue-box Technique in Virtual Studio]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Virtual studio is a new application of virtual reality in TV program production. Unlimited blue-box technique is the way to cover the scenery out of blue-box with an external chroma-key signal. It extends the movement of the camera in virtual studio. A universal unlimited blue-box technique is proposed based on the perspective projection. It can be applied to all kinds of blue-box structures and varied camera movements. The experiment result demonstrates that this technique is accurate and robust, and is sufficient to the requirements of virtual studio.]]></description>
<pubDate>2013/6/14 9:08:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LU Min,KUANG Gangyao and YU Wenxian]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LU Min,KUANG Gangyao and YU Wenxian</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306005]]></guid><cfi:id>460</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Integer Transform and Its Application in H.263]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Great capacity of operations and truncation error are the shortcomings of DCT in video codec recommendation H.263. An integer transform that is suitable for H.263 is designed based on lifting scheme, float-point DCT being replaced by integer DCT,and the measure of quantization being modified. The structure and performance are compared among integer transform、float-point DCT and fixed-point DCT,showing that  integer transform is a nice transform with the advantage of perfect compression effect, free of float-point operations and fewer arithmetic operations.]]></description>
<pubDate>2013/6/14 9:08:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[OU Jianping,WANG Zhan and HUANGFU Kan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>OU Jianping,WANG Zhan and HUANGFU Kan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200306011]]></guid><cfi:id>459</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Research and Implementation of an Open Digital VideoManagement System: iView]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Our open digital video management system named iView is presented, which supports full content retrieval based on multimodal metadata extraction and fusion, and supports kinds of wireless access mode. Requirements of iView are discussed first, then the design of framework. We also describe the key ideas and technology involved. Finally, its future research trend is pointed out.]]></description>
<pubDate>2013/6/14 9:08:39</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Wei<sup>1</sup>,Michael R. Lyu<sup>2</sup>,WU Defeng<sup>1</sup>,ZHANG jun<sup>1</sup>,TANG Daquan<sup>1</sup> and LI Zhiqiang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Wei<sup>1</sup>,Michael R. Lyu<sup>2</sup>,WU Defeng<sup>1</sup>,ZHANG jun<sup>1</sup>,TANG Daquan<sup>1</sup> and LI Zhiqiang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305013]]></guid><cfi:id>458</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Anomaly Detection of the Program Behaviors for IDS Based onHidden Markov Models]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A new method for anomaly detection of the program behaviors based on hidden Markov models is presented. The method uses system calls to represent the behavior profiles of programs based on hidden Markov models.  The behavior patterns of programs are classified according to their frequency distributions, and the states of the hidden Markov models are associated with the classes of the behavior patterns. Because the collections of observations corresponding to different states are mutually disjoint, the models can be trained with a sequence matching algorithm which requires lower computational complexity and less computation time than the classical Baum-Welch algorithm. A decision rule based on the probabilities of short state sequences is adopted while the particularity of the model states is taken into account. The performance of the method is tested by computer simulation. The results show it maintains higher detection accuracy and efficiency than other alternative approaches.]]></description>
<pubDate>2013/6/14 9:08:39</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Hongwei,TIAN Xinguang,ZOU Tao and ZHANG Eryang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Hongwei,TIAN Xinguang,ZOU Tao and ZHANG Eryang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305015]]></guid><cfi:id>457</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Scalable Parallel Algorithm Implementation ofSemi-Lagrangian and Semi-implicit Time Integration Scheme]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Spectral models are still the mainstream in global operation NWP now. Based on global spectral model, we discuss two-time-level semi-Lagrangian and semi-implicit integration scheme and quasi-cubic spatial interpolation for the terms evaluated at the departure point. A on-demand massage-passing scalable parallel algorithm has been developed. The algorithm is examined in a 4 nodes dual-CPU SMP Linux cluster. The relative speedup of 4 tasks to 8 tasks is 1.65.]]></description>
<pubDate>2013/6/14 9:08:39</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Weimin,ZHU Xiaoqian and CAO Xiaolin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Weimin,ZHU Xiaoqian and CAO Xiaolin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305016]]></guid><cfi:id>456</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Forward Looking Object Tracking Algorithm Basedon Deformable Template]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The image guidance using image sequences analysis improves the shoot accuracy of missiles greatly. In this paper, we present a new  method of automatic object recognition and tracking based on deformable template and genetic annealing algorithm. After the constructing object template and defining energy function according to their features, we use genetic annealing algorithm to search for the optimal solution. Experiment results show  the method can be applied to detect and track the object efficiently and accurately.]]></description>
<pubDate>2013/6/14 9:08:39</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[NIU Yifeng,BO Xiaochen and SHEN Lincheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>NIU Yifeng,BO Xiaochen and SHEN Lincheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305019]]></guid><cfi:id>455</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Greatest Expression of High Dimensional Image]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A novel method is proposed by which a M×N dimensional image can be expressed with Mand N dimensional vectors. Therefore, the image can be processed in the lower dimension space and it is easy to calculate. In certain sense this expression is optimum. We prove that it is identical to the result in the literature when the hits go to infinite. At last the applications verify the theoretical result.]]></description>
<pubDate>2013/6/14 9:08:39</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAN Lu,WU Yi and LIU Zhuo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAN Lu,WU Yi and LIU Zhuo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305020]]></guid><cfi:id>454</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Construction of Boolean Permutations in Cryptosystems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Boolean permutations are in very important applications in cryptosystems. In the design of block cipher，those of high degree are needed. In this paper，a method of constructing boolean permutations of high degree by combining some boolean permutations of low degree is provided，and an example is given. The results are useful to the construction of boolean permutations.]]></description>
<pubDate>2013/6/14 9:08:39</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[JIN June,ZHU Huaan and XIE Duanqiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>JIN June,ZHU Huaan and XIE Duanqiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305021]]></guid><cfi:id>453</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Class of Nonlinear Sequence Generators Base on m Sequence]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A class of nonlinear sequence generators of long period and high linear complexity are constructed。It is shown that linear complexity and period can be determind。And they are safe if some conditions are given. So they can be used as the key sequence generators。]]></description>
<pubDate>2013/6/14 9:08:40</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HUANG Jianzhong,LI Chao and XIANG Panpan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HUANG Jianzhong,LI Chao and XIANG Panpan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200305024]]></guid><cfi:id>452</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Implementation Method of RTI Based on CORBAand Interoperability Protocol]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To solve the performance bottleneck of the existing RTI servers in the large-scale simulation, an implementation method based on CORBA and interoperability protocol of hierarchical RTI server is presented. The deployment of federates,local RTI servers and central RTI server is described.　The workflow of hierarchical RTI based on CORBA and interoperability protocol is introduced. This method not only solves the bottleneck problem of centralized and distributed RTI servers in the large-scale simulation, and decreases the latency of operation, but also ensures time and space consistency for all federates.]]></description>
<pubDate>2013/6/14 9:08:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YAO Yiping,GUO Min and LU Xicheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YAO Yiping,GUO Min and LU Xicheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303017]]></guid><cfi:id>451</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Error Control and Recovery Technology in Real-timeMedia Stream Transmission]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To provide quality guaranteed real-time video stream in Internet is one of the main contents of multimedia application. But packet loss often occurs in data transmission across Internet, if no recovery measure is adopted, a drop in video quality will occur. Current research focuses on how to improve the quality of video stream and guarantee its real-time character. This paper studied the influence of packet loss on video quality based on MPEG-4 stream, presents a retransmit-important-data-based error recovery method, in order to improve the quality of real-time video stream. And according to RTP protocol, proposes a new CR-RTP protocol to support the retransmission of video data.]]></description>
<pubDate>2013/6/14 9:08:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Yongjun<sup>1</sup>,ZHANG Yi<sup>1</sup>,PENG Yuxing<sup>1</sup> and ZENG Youchun<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Yongjun<sup>1</sup>,ZHANG Yi<sup>1</sup>,PENG Yuxing<sup>1</sup> and ZENG Youchun<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303018]]></guid><cfi:id>450</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Study and Effective Implementation of theInternet Key Exchange Protocol (IKE)]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The IKE protocol is one of the most important components of the Internet Security Protocol (IPSec), the high-efficientimplementation of IKE is a key part of IPSec. After the analysis of the basic mechanism of IKE， this paper put forward a designstructureand its realization， also the design performance issue is discussed. Test has proved that it is an effective implementation of IKE.]]></description>
<pubDate>2013/6/14 9:08:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZENG Yingzhi,SU Jinshu and RONG Ni]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZENG Yingzhi,SU Jinshu and RONG Ni</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303019]]></guid><cfi:id>449</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Pose-varied Face Representation Using the IndependentComponent Analysis]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Independence component analysis (ICA) is applied in Pose-varied face recognition. Discriminations between ICA and principal component analysis (PCA) in face recognition are analyzed, and independent component (IC) representation in pose-varied face is discussed in detail. Based on the method that selects a subset as the kernel for the representation by ordering the sources via the magnitude of the corresponding weights, a novel IC representation of pose-varied face based on the scale factor is proposed. Demonstration indicates that the proposed method is efficient.]]></description>
<pubDate>2013/6/14 9:08:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Gang,LIU Wei and FENG Guiyu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Gang,LIU Wei and FENG Guiyu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303020]]></guid><cfi:id>448</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Automatic Generation of Dubbing Video Slides forWireless Mobile Environment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the objective restriction of the current wireless mobile network, a practical video delivery solution based on the automatic generation of dubbing video slides is presented. We guarantee the continuity of the audio stream first, and then select important frames in the dynamic sampling frequency based on the visual content analysis according to the current network bandwidth. Those frames are transmitted and played in a synchronous mode with the corresponding audio track. Our solution can satisfy the user′s requirements for video content comprehension while remarkably reducing the quantity of data flow.]]></description>
<pubDate>2013/6/14 9:08:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Wei,ZHANG Jun and WU Defeng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Wei,ZHANG Jun and WU Defeng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200303021]]></guid><cfi:id>447</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Adjoint Model of 2-D Parallel Shallow Water Model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper discusses how to develop adjoint model(ADM) and tangent linear model(TLM) of the parallel model based on shallow water equation.The parallel strategy of TLM is the same as the original parallel model.Parallel strategy of ADM is different.The three adopt uniform domain decomposition in order to improve the parallel efficiency.One domain decomposition is adopted on cluster parallel computer system.The computing cost of TLM is about as double as the original model and ADM's is about 3 times as that.The communication cost of ADM is about as double as the original parallel model.The speed-up of TLM is the best among three models.]]></description>
<pubDate>2013/6/14 9:08:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CAO Xiaolin<sup>1</sup>,SONG Junqiang<sup>2</sup> and SUN Anxiang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CAO Xiaolin<sup>1</sup>,SONG Junqiang<sup>2</sup> and SUN Anxiang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302010]]></guid><cfi:id>446</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Detection and Tracking of Dim Targets Based on DynamicProgramming and Track Matching]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The observation of low-SNR moving targets has been a hot spot for a long time. A dynamic programming (DP) and track matching algorithm has been developed for the detection of subpixel-sized, low-SNR targets observed by mosaic imaging sensors. The primary advantages of this technique are its sensitivity to weak targets along with its robustness to target maneuvers and sensor instabilities. Enhancement is achieved by performing directional weight operation precede to DP and target data association. Experiments have been conducted and it is shown that low-SNR moving targets with maneuver and maximum speed of 1 pixel/frame can be detected with high probability.]]></description>
<pubDate>2013/6/14 9:08:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Shangfeng,CHEN Huaming and LU Huanzhang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Shangfeng,CHEN Huaming and LU Huanzhang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302011]]></guid><cfi:id>445</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on the Distributed Parallel Computation ofthe Mesoscale Numerical Weather Prediction Model MM5]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Mesoscale numerical weather prediction model is the efficient way to the weather forecast. MM5 model is the most popular mesoscale model in the world. It is necessary to implement by means of high performance distributed parallel computation because of the large amount of calculation. This paper analyzed the sequential algorithm, studied the implement of the parallel algorithm, discussed some improvements, and presented some results of the experiment of MM5 implemented on the distributed parallel computer.]]></description>
<pubDate>2013/6/14 9:08:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHU Xiaoqian,ZHANG Weimin and SONG Junqiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHU Xiaoqian,ZHANG Weimin and SONG Junqiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302013]]></guid><cfi:id>444</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Framework Model for the Dynamic Network Security]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A dynamic network security model to solve the limitations of classic static network security model is proposed. This security model makes use of all kinds of security components to construct a five-layer defense architecture whose defensive ability can upgrade dynamically.]]></description>
<pubDate>2013/6/14 9:08:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Haitao,HU Huaping,XU Chuanfu and GONG Zhenghu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Haitao,HU Huaping,XU Chuanfu and GONG Zhenghu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302014]]></guid><cfi:id>443</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on the Architecture of the Next GenerationHigh-performance Network Security Processor Based on IPSec]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[IPSec is the only security technology that can be used pervasively in the Internet. Through analyzing the process of IPSec, we point out that network security processor is the key component to implement IPSec protocol efficiently. The architecture and application of the security processor state-of-arts are introduced in detail. Because the  processing power of the network security processor of the shelf can not satisfy the requirement of the ports with OC-48 speed or higher,the  analysis and forecast of the next generation network security processor architecture is given at the end of the paper.]]></description>
<pubDate>2013/6/14 9:08:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Yi and SUN Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Yi and SUN Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302015]]></guid><cfi:id>442</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Evaluating the Availability on Network Performances Based on Rerouting Strategies]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A general framework is presented for evaluating the availability on the network performances in a logistics network. The evaluation is based on mission-oriented rerouting strategies. As a representative,the availability on the traffic delay of some logistics flow is studied with different rerouting strategies and the graph on traffic delay is made. In the graph, the delays are analyzed by comparison.]]></description>
<pubDate>2013/6/14 9:08:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Fenglin,GUO Bo and WANG Zhengming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Fenglin,GUO Bo and WANG Zhengming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200302016]]></guid><cfi:id>441</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Progress of Bioinformatics in Post-genome Era]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200301001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the rapid development of biotechnology and informatics, bioinformatics emerges. An introduction and overview of the current state of the field of bioinformatics are proposed and some representative studies are also introduced and analyzed. The characteristics of current and future research are summarized and a few of questions to be resolved urgently are proposed finally.]]></description>
<pubDate>2013/6/14 9:07:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Zhenghua and WANG Yongxian]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Zhenghua and WANG Yongxian</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200301001]]></guid><cfi:id>440</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Study of Large Scale Networks Intrusion Detectionand Warning System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200301005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[It is very important to study Large Scale Networks Intrusion Detection and Warning System(LSNIDWS), which can increase the network systems reaction ability to catastrophe, slow down the harm of the network attack, enhance system counterattack ability.The summarization of studying situation in the world is first presented. Then, the structure and its component of LSNIDWS are presented.Finally, the key technology and difficulties related to building LSNIDWS prototype are discussed.]]></description>
<pubDate>2013/6/14 9:07:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Huaping<sup>1</sup>,ZHANG Yi<sup>1</sup>,CHEN Haitao<sup>1</sup>,XUAN Lei<sup>1</sup> and SUN Peng<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Huaping<sup>1</sup>,ZHANG Yi<sup>1</sup>,CHEN Haitao<sup>1</sup>,XUAN Lei<sup>1</sup> and SUN Peng<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200301005]]></guid><cfi:id>439</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and Realization of the Secure CA-based Electronic Seal System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200301006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To solve the distributed hierarchical network security problems, a distributed simple strictly hierarchical (DSSH) PKI trust model is presented. This model provides effective network security services such as authentication, access control, integrity, confidentiality, non-repudiation and so on. On the basis of the trust model, the concept of the issue-seal certification is presented and established to ensure the security of the seal file in the CA domain. The system implements the digital signature and verification of the electronic documents by the electronic seal. The key, which encrypts and decrypts the electronic documents, is protected by the encryption certification. Finally, the system implements the management of printing seal files abilities through the authority server.]]></description>
<pubDate>2013/6/14 9:07:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Shidong<sup>1</sup>,YANG Lin<sup>2</sup>,HOU Bin<sup>2</sup> and WANG Jianxin<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Shidong<sup>1</sup>,YANG Lin<sup>2</sup>,HOU Bin<sup>2</sup> and WANG Jianxin<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200301006]]></guid><cfi:id>438</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[ER2MD：An Algorithm of the Transformation from ER Model to Multidimensional Model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200301007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Multidimensional modeling is one of the chief techniques in conceptual design of data warehouse. If ER models of traditional databases can be directly transformed into multidimensional models, it would efficiently shorten the life circle of data warehouse design. Based on the traditional databases, an algorithm of the transformation from ER models to multidimensional models is presented. Those ER models under some conditions can be transformed, and the resulting multidimensional models conform to the standard of the generalized multidimensional normal form, ensuring the validity of analytical computations on  multidimensional databases. Furthermore, the resulting multidimensional models favor an efficient physical database design.]]></description>
<pubDate>2013/6/14 9:07:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TANG Jiuyang,YANG Qiang,SHA Jichang,DENG Su and LU Changhui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TANG Jiuyang,YANG Qiang,SHA Jichang,DENG Su and LU Changhui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200301007]]></guid><cfi:id>437</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Automatic Audio Classification and Segmentation forSoccer Video Structuring]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200406011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Automatic classification and segmentation of the sound track is an effective approach for video structuring. We use this method to parse soccer video. Firstly, based on the characteristics of soccer video, the paper summarizes three audio classes for soccer video, namely game-audio, advertisement-audio and studio-audio. Then it proposes a framework of audio classification and segmentation using Hidden Markov Model and combining some smoothing rules. We develop a 26-coefficients feature stream for HMM model. And the experimental studies indicate that the proposed framework is effective and robust.]]></description>
<pubDate>2013/5/8 10:45:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Jianyun,LI Yunhao,WU Lingda,LAO Songyang and BAI Liang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Jianyun,LI Yunhao,WU Lingda,LAO Songyang and BAI Liang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200406011]]></guid><cfi:id>436</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[CGF Behavior Scheduling in Distributed VirtualBattlefield Environment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200406017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A CGF behavioral scheduling technique is presented. The method addresses the scheduling of behaviors generated by CGF of the local simulation node and the remote model in other nodes. All the behaviors are scheduled in a centralized way. The behavior priority and executive deadline of the remote model are decided by the interest domain of CGF in the local node, through the combination of all the CGF interest domain to reduce the number of remote models, and the cost of the simulation node computing. The method can effectively ensure the requirement of real-time and quality of the distributed virtual battlefield environment.]]></description>
<pubDate>2013/5/8 10:45:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZENG Liang,ZHENG Yi and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZENG Liang,ZHENG Yi and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200406017]]></guid><cfi:id>435</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Hierarchical Authorization System on Digital Video]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200406023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to solve the security problem of digital video, a hierarchical authorization scheme on digital video is presented，which utilizes modern strong cipher to protect digital video's transport and realize hierarchical authorization. Owing to the use of fully mature digital video broadcast technology, the scheme has high security, simple framework, and low cost.]]></description>
<pubDate>2013/5/8 10:45:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Sufeng,DAI Kui and HOU Fangyong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Sufeng,DAI Kui and HOU Fangyong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200406023]]></guid><cfi:id>434</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Optimization Design of TLB of High Performance Processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200404003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The virtual memory is a staple in modern processor system. In virtual addressing scheme, the translation from virtual address to physical address is one of the highest frequency core service in the pipe line, and tends to be on the critical path determining the clock cycle of the processor. In order to speed up the address translation, the most modern processors have designed a hardware unit called translation look-aside buffer(TLB). Based on analyzing the traditional address mapping mechanism of TLB, this paper has put forward the regions and Cache line tag pre-validation to optimize the translation, and removed the TLB delay bottleneck in the whole memory access.]]></description>
<pubDate>2013/4/27 3:07:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Haiyan,DENG Rangyu and XING Zuocheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Haiyan,DENG Rangyu and XING Zuocheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200404003]]></guid><cfi:id>433</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Data Model and Algebra for Capability ObjectIntegration in Heterogeneous Data Integration Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200404004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In heterogeneous data sources integration systems, there can be many special limited access patterns to access interface of data sources, i.e., binding patterns impose a restriction that one or more input attributes must have a binding, and also restrict the output attributes that are projected. Constrained by the expressiveness of the access interface, users often have difficulty in articulating a precise query over the data sources. In this paper, we propose a data model for data sources' capability object integration (COIM) to capture a rich variety of query-processing capabilities and present algebra to compute the set of mediator-supported queries based on the capability limitations of the sources they integrate. By computing mediator query capabilities and representing them in the same way as those of data sources, we enable mediators to be used by other mediators as well as other applications, and we also make it easier for end users to know in advance which mediator queries are feasible.]]></description>
<pubDate>2013/4/27 3:07:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TANG Jiuyang,ZHANG Weiming,Song Junfeng,XIU Baoxin and XIAO Weidong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TANG Jiuyang,ZHANG Weiming,Song Junfeng,XIU Baoxin and XIAO Weidong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200404004]]></guid><cfi:id>432</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Fingerprint Classification by Using Average Period]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200404005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A mean period based approach for fingerprint classification is presented. It computes the mean period of every fingerprint and sorts fingerprints according to their mean periods. This approach speeds up the searching of the fingerprint database efficiently. And perfect performance is possible if combining this method with the traditional fingerprint classification.]]></description>
<pubDate>2013/4/27 3:07:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHU En,YIN Jianping and ZHOU Jing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHU En,YIN Jianping and ZHOU Jing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200404005]]></guid><cfi:id>431</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Connectivity Preserved Edge Thinning Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200404011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The traditional image edge detectors can only get multiple-pixel-wide edges usually, thus it is difficult to operate by post-processing methods. The paper presents a novel edge thinning algorithm named as connectivity preserved edge thinning algorithm, which combines the detecting strategy of the connectivity critical point with the estimating method of the edge direction. It can preserve the origin edge information such as connection and direction. Moreover, it gets ideal or acceptable single-pixel-wide edges with lower computing cost.]]></description>
<pubDate>2013/4/27 3:07:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAN Yusong and ZHOU Xingming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAN Yusong and ZHOU Xingming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200404011]]></guid><cfi:id>430</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[DSOCC：DiffServ-Oriented Congestion Control]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200403007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[When using DiffServ AF to transfer TCP traffic, the bandwidth is not allocated in a fair way the previous work does not consider the three factors affecting TCP's throughput all together: subscribed bandwidth, packet size and RTT. The paper proposes DiffServ-Oriented Congestion Control (DSOCC) to resolve the problem on TCP fairness. The validity of the algorithm is verified using ns-2 simulations.]]></description>
<pubDate>2013/4/27 3:07:06</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Mingjie,ZHU Peidong and LU Xicheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Mingjie,ZHU Peidong and LU Xicheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200403007]]></guid><cfi:id>429</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Tornado-code-based Replication Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200403009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the Internet-based distributed storage system, the mass heterogeneous data are widely distributed. In order to improve the efficiency of data access, the Tornado-code-based replication algorithm is proposed. Compared with the traditional replication algorithms, the Tornado-code-based replication algorithm can provide better availability，durability and security, and has less storage cost and bandwidth cost.]]></description>
<pubDate>2013/4/27 3:07:06</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Yijie and LU Xicheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Yijie and LU Xicheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200403009]]></guid><cfi:id>428</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A New Linear Cryptanalysis of DES Cipher]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200403010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Firstly，generalize the definition of the linear bias of transformation, and then generalize the mathematical description of the linear bias of cipher, and present the relation between the linear bias of cipher and the linear bias of round function F. The upper bound of linear  bias of each round within 16 rounds in DES cipher is finally given.]]></description>
<pubDate>2013/4/27 3:07:06</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Chao<sup>1,2,3</sup>,QU Longjiang<sup>1</sup> and LI Qiang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Chao<sup>1,2,3</sup>,QU Longjiang<sup>1</sup> and LI Qiang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200403010]]></guid><cfi:id>427</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Security Task & Role-based Distributed Workflow Model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200403013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper introduces the concept of tasks, task instances and task context into traditionalrole-basedaccesscontrol model according to the weaknesses of the current role-based access control and the characteristics of distributedworkflowsystem. We propose a task & role-based access control model, whose  architecture is not user-role-permission but user-role-task-permission, and its formal definition. This model overcomes the weaknesses of the bad dynamicadaption and the fake constraint of the least privilege. It can enhance the security and practicability of the distributed workflow system.]]></description>
<pubDate>2013/4/27 3:07:06</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FU Songling and TAN Qingping]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FU Songling and TAN Qingping</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200403013]]></guid><cfi:id>426</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Hardware Counter-based Performance Characterizing forMPEG4 Video Applications]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200402011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[It is the current trend that microprocessors extend their instruction set to speedup the multimedia applications. Intel'sMMX, SSE and SSE2 are good example. But do the multimediaapplications favorthesearchitecturefeatures? And does thecurrentsoftwaresupporttheseinstruction sets and make full use of them? These questions are of muchconcerntothe researchers. Weinvestigate theperformancecharacteristics of 2MPEG4Videoplayers on an Intel P4 baseddesktop PC bymeans ofdynamicprofiling.BasedonIntelVtune, a hardwareperformancemonitoring tool, we obtainaccurateperformancedata. And we make indepthanalysis of the obtained data based on themachine'sarchitectureparameters andperformanceprofiles. We find that the 2applicationsmakegood use of 64-bit MMXinstructions. But theyrarely use SSE and SSE2instructions. Theperformancedegradation due to Cachemisses at tow levels of Caches is remarkable. Toenhance theperformance ofMPEG4 mediaapplications,improvingmemoryhierarchyperformance andoptimizing themediaplayers are moreeffective ways thanemploying moreadvancedmultimediainstruction sets.]]></description>
<pubDate>2013/4/22 10:35:42</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHE Yonggang<sup>1</sup>,WANG Zhenghua<sup>1</sup> and LI Xiaomei<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHE Yonggang<sup>1</sup>,WANG Zhenghua<sup>1</sup> and LI Xiaomei<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200402011]]></guid><cfi:id>425</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Research on Serial and Parallel Strategies of theAutomatic Image Registration for Remote Sensing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200402013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The amounts of remote sensing images of global coverage will grow exponentially. To study and achieve fast and effective automatic registration of these digital data with high accuracies has become a critical problem in remote sensing. The status of the research on automatic registration of remote sensing images is presented firstly, and some relevant key techniques are discussed. And then, the existing registration algorithms are classified and analyzed from the point of a novel view, and an integrative solution is given. At the same time, three new parallel strategies are proposed with the good experiment results. Because the proposed algorithms are based on the data parallel model of coarse grain, their salability and portability are good, which can be a valuable reference for practical applications in remote sensing. Finally, the problems and challenges of the future research are pointed out.]]></description>
<pubDate>2013/4/22 10:35:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU HaiFang,LIU Guangming,ZHENG MingLing and YANG XueJun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU HaiFang,LIU Guangming,ZHENG MingLing and YANG XueJun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200402013]]></guid><cfi:id>424</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Adaptive Motion Estimation on the Essential Manifold]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200402018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A novel formulation of the visual motion estimation problem is analyzed in terms of identification of the nonlinear implicit system with parameters on the so called “essential manifold”; and a new and unified implicit adaptive extended kalman filter (IAEKF) is proposed to perform the estimation in the local coordinates, for both discrete and continuous cases. The correctness of the algorithm is illustrated by numerical simulations.]]></description>
<pubDate>2013/4/22 10:35:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHU Liangjia,DONG Guohua,ZHOU Zongtan and WANG Zhengzhi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHU Liangjia,DONG Guohua,ZHOU Zongtan and WANG Zhengzhi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200402018]]></guid><cfi:id>423</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A New Approach of Guessing Logical Structures of Arrays]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200401008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Many powerful parallelizing compiling techniques rely on the logic structures of arrays. However, in real applications, lots of arrays are flat one-dimensional arrays and hence may disable some compiling optimizations. This paper presents a new framework and algorithms for guessing the logical multi-dimensional array structures from the flat one-dimensional arrays automatically, and makes powerful compiling optimizations possible. We first give a lemma that points out the basic property which the guessed multi-dimensional arrays should satisfy, then based on this lemma we give two basic rules that should be followed in guessing logic structures of arrays, and finally based on the two rules we present the algorithms for guessing logic structures of arrays. The experimental results show the algorithms for guessing the logical multi-dimensional array structures are effective.]]></description>
<pubDate>2013/4/22 10:35:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIA Jun,DAI Huadong and YANG Xuejun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIA Jun,DAI Huadong and YANG Xuejun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200401008]]></guid><cfi:id>422</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Study and Implementation of Network Security VulnerabilitiesAnalysis and Disposition System(NSVADS)]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200401009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[After analyzing the research situation and the shortcoming of vulnerabilities database system, the distributed computing technology, database technology and Web technology are used to implement NSVADS. Based on Web, it realizes the access and maintaining tool to vulnerabilities database. The solution to vulnerabilities and patches download can be disposed easily, and the cost of system maintainability can be reduced.  Patches pushed modular can realize long-range patches pull, vulnerabilities mend, and vulnerabilities detection.It can improve the system's automatical vulnerabilities mend, and provide helpful  tool for disposing the network security vulnerabilities.]]></description>
<pubDate>2013/4/22 10:35:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Huaping,LIU Bo,ZHONG Qiuxi and PANG Lihui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Huaping,LIU Bo,ZHONG Qiuxi and PANG Lihui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200401009]]></guid><cfi:id>421</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Merging Features of Multiple Template Fingerprints]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200506007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An automatic fingerprint identification system (AFIS) includes two stages,i.e. registration and authentication. At the atregistration stage, most AFISs store multiple template fingerprints of the same finger per user. When authenticating, the input fingerprint is compared with these multiple templates. This paper proposes merging features of multiple template fingerprints.Only the merged template is stored in the template database. When authenticating, the number of templates with which the input fingerprint is compared is decreased, thus the authentication is sped up. At the same time, it helps to improve the recognition accuracy so that the merged template contains more features than a single template. Experiments show that our method can achieve improved system performance.]]></description>
<pubDate>2013/4/10 9:23:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHU En,YIN Jianping,ZHANG Guomin and HU Chunfeng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHU En,YIN Jianping,ZHANG Guomin and HU Chunfeng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200506007]]></guid><cfi:id>420</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Utilizing Fault Containment to Construct a SurvivableNetwork Security Device Kernel]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200506008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Fault containment is proposed to construct a survivable kernel of the  network security device based on the IBM virtual machine. This is accomplished by setting up an efficient resource manager to supply physical resources to the virtual machine and to balance other performance requirements. Software and hardware fault containment technology is used to protect against system attacks, and avoid a system breakdown from a single fault. Model and tests prove this idea and the overheads are almost negligible.]]></description>
<pubDate>2013/4/10 9:23:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DU Jiao<sup>1,2</sup>,LI Guohui<sup>1</sup> and FENG Dengguo<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DU Jiao<sup>1,2</sup>,LI Guohui<sup>1</sup> and FENG Dengguo<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200506008]]></guid><cfi:id>419</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Efficient VLSI Architecture for Two-dimensional DWTBased on the Lifting Scheme]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200506011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An efficient VLSI architecture for two-dimension DWT is proposed and illustrated in detail for the CDF9/7 wavelet transform. The improved lifting scheme is adopted to reduce the critical path delay. Coefficients of the multipliers are transformed into CSD forms and then the multiplications are substituted by shift-add operations. The row transform and column transform are running simultaneously and pipeline design is used to optimize the architecture. This architecture is implemented through behavioral VHDL. The results are identical with those of the software simulation, and thus the validity of this architecture is proved. Compared with other architectures, this one has the advantages of faster computation time and almost 100% hardware utilization.]]></description>
<pubDate>2013/4/10 9:23:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[KANG Zhiwei<sup>1</sup>,YAN Fuquan<sup>1</sup> and HE Yigang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>KANG Zhiwei<sup>1</sup>,YAN Fuquan<sup>1</sup> and HE Yigang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200506011]]></guid><cfi:id>418</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Survey on High Performance Routing and Switching Technology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Scalability is one of the most important characteristics of next generation Internet. And it makes more rigid demands for high performance routers. Since high performance routing and switching technology is important for routers to provide this characteristic, we make comprehensive a survey on three aspects of the network processor design, routing lookup and high speed switching. Related works are also summarized. The future directions of development are analyzed.]]></description>
<pubDate>2013/4/8 11:10:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LU Xicheng and GUAN Jianbo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LU Xicheng and GUAN Jianbo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505001]]></guid><cfi:id>417</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design and Implementation of a New IPv6 ForwardingSystem Based on Network Processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[ForCES（Forwarding and Control Element Separation）and network processor play very important roles in the router design and implementation. IPv6, the emerging standard for Internet, whose framework has been widely accepted and deployed by the Internet community. In this paper，we design an efficient framework for implementing the Ipv6 router. The approach uses the ForCES protocol to establish communication between the control plane and the data plane. To implement a high performance data forwarding system, the data plane adopts network processor to handle dual IPv4/IPv6 stacks packet forwording, tunneling. We tested  the whole prototype system performance by AX4000,the result is excellent.]]></description>
<pubDate>2013/4/8 11:10:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SU Jinshu,SHI Xiangquan and WU Chunqing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SU Jinshu,SHI Xiangquan and WU Chunqing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505002]]></guid><cfi:id>416</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Aggregating Switching of Heterogeneous Routersfor Single POP Applications]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The fast development of Internet challenges the traditional POP network. SPR(Single POP Router) is considered as an effective approach to resolve this problem. A novel clustering technology called aggregating switching is proposed. It can aggregate several heterogeneous routers into one large scale SPR and outperform the traditional POP network in many aspects. Some open problems about aggregating switching are discussed.]]></description>
<pubDate>2013/4/8 11:10:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUAN Jianbo and SU Jinshu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUAN Jianbo and SU Jinshu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505003]]></guid><cfi:id>415</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An IPv6 Routing Lookup Algorithm for Large Route Tables Based on Range Representation B-tree]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The IPv6 routing lookup algorithms need to process huge route tables in the future owing to the huge address space of IPv6, and each lookup needs more memory accesses than IPv4 algorithms because of the 128 bits address. To solve these two difficult problems, this algorithm converts the prefix into ranges and stores them in a B-tree, then uses range fragment tree in the nodes to reduce the memory access and the storage requirement. Theoretical analysis and the experimental results indicate that the algorithm can support the high performance lookup for huge IPv6 route tables.]]></description>
<pubDate>2013/4/8 11:10:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAN Mingfeng,GONG Zhenghu and SUN Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAN Mingfeng,GONG Zhenghu and SUN Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505004]]></guid><cfi:id>414</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[TCP Friendly Design of Router]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Researching on the characteristic of TCP flow helps to cognize the complex structure of network and to make use of the resource of network effectively. Referring to the characteristic of TCP flow and analyzing TCP congestion control of additive increase multiplicative decrease and packet out-ordering, we present TCP friendly design of router which accelerates the processing of router.]]></description>
<pubDate>2013/4/8 11:10:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LU Gaofeng and HU Xiaofeng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LU Gaofeng and HU Xiaofeng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505005]]></guid><cfi:id>413</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Parallel Forwarding in High Performance Router]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[It is a great challenge to forward packets at line rate as the line rate grows rapidly. This paper proposes a distributed parallel forwarding engine to solve this problem based on parallel processing. Adaptive Hashing dispatch algorithm(AHDA) is proposed to dispatch the packets received, which compromises between load balance and packet ordering. Simulation results show that AHDA algorithm dispatches load in a balanced way, reorders packets at low rate, and scales well with the number of network processors.]]></description>
<pubDate>2013/4/8 11:10:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Xiaofeng and SUN Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Xiaofeng and SUN Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505006]]></guid><cfi:id>412</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Un-precise Packet Scheduling in High Performance Routers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Along with the continuing increase of network bandwidth, the time gaps between the arrived packets are decreasing. The changed situations demand the core router to improve the ability of packet processing. The traditional packet scheduling algorithms, such as WFQ, are difficult to implement in high performance core router because of the problems of performance and extensibility. The paper proposes a new un-precise packet scheduling scheme, which improves the performance of the scheduler by modifying the classical packet scheduling algorithms to simplify the design of hardware. The scheme doesn't affect the QoS quality of the algorithms. The delay performance of this scheme is analyzed and computer simulation results show that the delay performance of SLQF is consistent with that of LFQ on the whole.]]></description>
<pubDate>2013/4/8 11:10:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Yijiao and SUN Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Yijiao and SUN Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505007]]></guid><cfi:id>411</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Analytical Modeling Methodology for MPSoCBased Network Processors]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A parameterized analytical model of network processors is presented in terms of MPSoC design methodology, called NePlat. In this model, network applications are represented by Dataflow Process Network (DPN). Heterogeneous network processor resources are described by system parameters, and then the application model is mapped into the heterogeneous resources to analyze the performances of network processors.]]></description>
<pubDate>2013/4/8 11:10:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Xiaoming,SUN Zhigang and ZHANG Minxuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Xiaoming,SUN Zhigang and ZHANG Minxuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200505008]]></guid><cfi:id>410</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Research and Implementation of Real-time Digital SceneSimulator System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200504012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the advances in image-guided weapons, it is quite necessary to develop a real-time digital scene simulator system that can test in laboratory the guiding information processing machine. A real-time digital scene simulator system, composed of a high performance PC machine and a PCI card, is introduced in this paper. Especially, the work flow and structure of the simulator system, together with the principles and implementing methods of the system software and hardware, are described in detail. Finally, the experimental results indicate that the system can meet the requirements of practical applications.]]></description>
<pubDate>2013/4/8 11:10:21</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Zhiyong,LU Huanzhang,GUO Tiantian and Xiao Shanzhu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Zhiyong,LU Huanzhang,GUO Tiantian and Xiao Shanzhu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200504012]]></guid><cfi:id>409</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design and Implementation of the SimulationGrid Prototype System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200504018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The simulation grid is a distributed simulation platform built through grid technology. On the platform the distributed simulation applications can be executed by utilizing the powerful sharing resource. The research of the simulation grid prototype system is the basis of solving the key technology to build simulation grid. SGE is a tool to construct the local and cluster grids. This paper presents a recent research of building SGE-based distributed simulation grid prototype system. Specifically, its framework provides the dual channels of communication. One channel takes charge of communicating among components of the grid, and the other one takes among HLA federates. In particular, the grid supports three modes of HLA scheduling tasks, which are differentiated according to (1) processes, (2) federates and (3) federations. Results of this study demonstrate the technical feasibility of constructing SGE-based simulation grid, and simply build the prototype system to test the performance of three scheduling task modes.]]></description>
<pubDate>2013/4/8 11:10:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Chuanfu,LIU Yunsheng,ZHANG Tong,ZHA Yabing and HUANG Kedi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Chuanfu,LIU Yunsheng,ZHANG Tong,ZHA Yabing and HUANG Kedi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200504018]]></guid><cfi:id>408</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Simulation Scheduling Based on the Engine Federate]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200503023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The simulation engine (SE) is the most important federate among the federations based on HLA. This paper puts forward a simulation scheduling architecture including SE,federate vessel and entity.And then it raises a hiberarchy　simulation schedule arithmetic based on time sequence and event sequence.At last, we introduce the design and implementation of the federate framework of SE,which is applied in efficiency simulation and the evaluation system of C<sup>3</sup> I.]]></description>
<pubDate>2013/4/8 11:09:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LING Yunxiang<sup>1</sup>,QIU Dishan<sup>1</sup>,ZHANG Xiaolei<sup>2</sup> and GU Xirui<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LING Yunxiang<sup>1</sup>,QIU Dishan<sup>1</sup>,ZHANG Xiaolei<sup>2</sup> and GU Xirui<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200503023]]></guid><cfi:id>407</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Study on the Parameter Setting of PI Controller inActive Queue Management]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200503025]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Active Queue Management(AQM) is an effective method to improve the performance of end-to-end congestion control. PI controller is a popular AQM scheme having good steady-state properties. We present the guidelines for setting parameters of PI controller using the “second-order optimization model” instead of the margin of stability to improve transient behavior. The performance of PI controller with new parameters is verified and compared with that of default ns parameters using ns simulations. The results show that the dynamic behavior of PI controller is improved. We present several future directions in the end.]]></description>
<pubDate>2013/4/8 11:09:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Ming,DOU Wenhua,ZHANG Heying and ZHANG Meng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Ming,DOU Wenhua,ZHANG Heying and ZHANG Meng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200503025]]></guid><cfi:id>406</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Fast Adaptive Motion Estimation Algorithm Based on the Context]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200502009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The efficient motion estimation algorithms are the important research hotspot in the real-time video coding-decoding technology. In order to reduce the high computational complexity of motion estimation in the video-coding, a fast adaptive motion estimation algorithm based on the context is proposed. The novel algorithm uses a kind of parallelogram pattern to search directionally, and imports secondary minimum distortion point. The basic idea of the novel algorithm is: In the process of block-matching, this novel fast algorithm uses the former search step's motion vector and the relative location between the minimum distortion point and secondary minimum point to select adaptively one parallelogram model and decide the search direction of next step, and then keeps on searching for more accurate motion vector. Experimental results show that the proposed algorithm reduced the computational complexity of the motion estimation in video-coding effectively.]]></description>
<pubDate>2013/3/25 4:57:41</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TIAN Chuanyan,SHEN Chengdong and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TIAN Chuanyan,SHEN Chengdong and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200502009]]></guid><cfi:id>405</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Dynamic Elimination of Inference Channels in the DatabaseBased on Rough Set Theory]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200502012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper describes an approach to elimination of inference channels in the database based on rough set theory. The approach builds an incomplete decision table on all data in the database, then analyzes and discovers all the relations between non-sensitive and sensitive data with rough set theory. According to these relations, rules of inference control are generated and used to modify the data queried by generic users dynamically and most parsimoniously so as to eliminate inference channels. Experimental result shows that the approach is scalable and preserves security of inference control while improving availability of the data in the database.]]></description>
<pubDate>2013/3/25 4:57:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Zengjun,DAI Jiangshan and XIAO Junmo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Zengjun,DAI Jiangshan and XIAO Junmo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200502012]]></guid><cfi:id>404</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Real-time Simulation Technology Based on theGeneral Computer]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200502017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The general-purpose computer, supported by all kinds of compatible standard hardware and plenty of application softwares, has been most wildly used in the world. However, the operating system running on it is always the multi-tasks OSs, such as windows 9x/2000 and Linux, which cannot meet the need of the real-time simulation in a general way. Firstly ,the acquiring of high-resolution real-time clock is discussed. Secondly, the stability of frame time under the general-purpose OS environment is studied at length. Several methods used to carry out the real-time simulation on the general-purpose computer has been presented, and an actual general-purpose simulation system also established. The experiment results show that the real-time simulation based on the general computer is feasible.]]></description>
<pubDate>2013/3/25 4:57:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Xingwei,ZHANG Weihua,PAN YuLin and HUANG Kedi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Xingwei,ZHANG Weihua,PAN YuLin and HUANG Kedi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200502017]]></guid><cfi:id>403</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Power Optimization for Predicated Execution]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200501015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Predicated execution improves the performance by eliminating branches but wastes energy due to extra instructions. Nullifying FALSE predicted instruction earlier can save energy. Based on the Itanium 2 microprocessor, we modify the pipeline function; advance the read of predicate and present methods to stall the pipeline on predicates dependency. Simulation results show that the advanced predicate reading and FALSE predicated instruction nullifying can reduce energy waste and improve the efficiency of energy.]]></description>
<pubDate>2013/3/25 4:48:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Yongwen and ZHANG Minxuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Yongwen and ZHANG Minxuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200501015]]></guid><cfi:id>402</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Parallel Pipeline Forwarding Engine Design andPerformance Evaluation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200501016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the rapid development of communication technology, optical transmit technique demands higher requirement of the core router's forwarding performance. OC192 POS interfaces have made the core router's forwarding engine a new bottleneck. Further development of optical transmit technique has exceeded the maximum accessing ability of DRAM, which makes impossible the design of new forwarding engine with one chip of DRAM. New hardware parallel forwarding engine design is offered on the basis of Gupat's DIR 24 8 BASIC forwarding architecture, taking advantage of the parallel of multiplex DRAM chips. In order to get really performance of the parallel forwarding engine design, IP packet header trace and routing table's dump of Internet core router node are used as the input of the target system's simulator. The result shows that the parallel forwarding engine can achieve linear speedup with the increase of parallel basic forwarding tables.]]></description>
<pubDate>2013/3/25 4:48:35</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Xiaozhe,PENG Wei and ZHU Peidong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Xiaozhe,PENG Wei and ZHU Peidong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200501016]]></guid><cfi:id>401</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Image Enhancement Based on a New Complex-directionalWavelet Transform and the Visual Representation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A novel method for image enhancement, which exploits the properties of the double-density dual-tree DWT and the statistical characters of visual representation, is proposed. The double-density dual-tree DWT combines the characteristics and advantages of the double-density DWT and the complex dual-tree DWT. This allows the transform to provide approximate shift invariance and directional selectivity and is well suited for image enhancement. The algorithm corrects the global dynamic range (brightness) and adjusts local contrast in the new complex-directional wavelet transform domain. Comparisons with some popular image enhancement methods are made, showing the effectiveness of the proposed algorithm.]]></description>
<pubDate>2013/3/14 10:39:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YAN Fengxia and CHENG Lizhi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YAN Fengxia and CHENG Lizhi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606011]]></guid><cfi:id>400</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Hierarchical Architecture of Algorithms in Content-based Retrieval]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the content-based retrieval, the conventional approach to the retrieval algorithms is to conduct the feature extraction and similarity match on the basis of single feature and then to conduct multi-feature extraction under the condition of weighting the result of single feature extraction. Such an approach incurs large amount of calculation and lacks flexibility. Therefore, a new architecture to organize different retrieval algorithms in content-based retrieval is proposed. It appears as a hierarchical architecture, which is able to acquire a gradually accurate result. The transfer factor, priority factor and complexity factor are defined in this architecture, which can help to combine different feature-oriented retrieval algorithms flexibly. Experiment shows that this architecture improves the retrieval efficiency, resulting in a reduction of 40% of the retrieval time.]]></description>
<pubDate>2013/3/14 10:39:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TANG Bo,LIU Yu,SUN Maoyin and TANG Xiaoan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TANG Bo,LIU Yu,SUN Maoyin and TANG Xiaoan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606018]]></guid><cfi:id>399</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Three-dimensional Landform Data with Texture InformationHiding Technique Via Line-based Wavelet Code(LBWC)]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An information hiding technology is presented in this paper, in which the 3-D landform data is protected and the information of elevation is hidden in the texture. In keeping the terrain figure and hypsography, the terrain information is compressed in low bit ratio and least memory by using improved line-based code approach. A method to build the wavelet coefficient set which can be embedded into the hided information is provided. The strength of the embedding data is image-adaptive according to the wavelet quantization noise, achieving the maximum strength of Just Noticeable Distortion (JND) tolerance of Human Visual System (HVS). Since hiding process is accomplished by using Rijndael code to construct Hash one-way function, the proposed algorithm has very high safety and its arithmetic can be public.]]></description>
<pubDate>2013/3/14 10:39:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Yuexiang<sup>1</sup>,LUO Yong<sup>2</sup>,CHENG Lizhi<sup>2</sup> and LU Xicheng<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Yuexiang<sup>1</sup>,LUO Yong<sup>2</sup>,CHENG Lizhi<sup>2</sup> and LU Xicheng<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606019]]></guid><cfi:id>398</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Mining Frequent Trajectory Patterns of Moving Objectsfrom Surveillance Video]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[It is only a tentative attempt to analyze motion trajectory data in the data mining style. This paper proposes an algorithm based on Apriori, a conventional data mining method, for mining frequent trajectory patterns of moving objects from surveillance video. Firstly, feature points are extracted for presenting continuous trajectories. Then a trajectory similarity measure is designed to obtain the frequency of trajectories. Finally, based on the values, Apriori algorithm is applied to automatic finding of interesting patterns in 2D object trajectories. Experiments on real life and man-made trajectory data set show the validity of the algorithm.]]></description>
<pubDate>2013/3/14 10:39:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DAI Kexue,ZHANG Jun,LI Guohui and LAI Xu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DAI Kexue,ZHANG Jun,LI Guohui and LAI Xu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606022]]></guid><cfi:id>397</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[k-NN Query Processing for Multi-autonomous Spatial Data Sources]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[k-NN query based on multi-autonomous spatial data source is widely used in spatial information realm. In this paper, incorporating existing k-NN query algorithm, a new k-NN query framework for multi-autonomous spatial data sources and its implement algorithm, is proposed. The experiment results show that the method performs well both in data transmission volume and corresponding time of the k-NN query system.]]></description>
<pubDate>2013/3/14 10:39:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TANG Guifen,LIU Shulei,LIAO Wei,JING Ning and CHEN Luo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TANG Guifen,LIU Shulei,LIAO Wei,JING Ning and CHEN Luo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606023]]></guid><cfi:id>396</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research of Location-aware Overlay Construction Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606025]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An algorithm named Lanet whereby the overlay network construction is based on the location information of underlying physical topology is presented. Each peer is connected to a small subset of the other peers which are close in the physical network. The peers that are close in the logical network are also close in the physical network. As a result, the expected delay of each hop in the routing path is very low. This leads to low latency stretch of the overlay network. This algorithm is scalable and distributing for a fixed subset of nodes act as landmarks is not required. Simulation results indicate that the latency of data location in these location-aware systems that are constructed with Lanet can be significantly decreased.]]></description>
<pubDate>2013/3/14 10:39:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Xiaoming and WANG Yijie]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Xiaoming and WANG Yijie</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200606025]]></guid><cfi:id>395</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A VMN-based Fast Handoff Method for Mobile IP]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A VMN-based MIPv4 fast handoff method based on the basic MIP/AAA model was presented for satisfying the users' demands of security and low latency in MIP services and making up the existing insufficiency in the current MIPv4 handoff method. The method strengthens the basic MIP/AAA model, and sets up a novel data structure in the mobile agents. Through establishing a new bidirectional tunnel between NFA and OFA, it fast transforms the data packets of VMN between them, and realizes the fast low latency handoff under no data packets losing. Through distributing the new temporary security association and the authentication ticket, it enhances the security in the MIP's registration and handoff process, and effectively reduces the network loads between AAAH and the AAAF. The secure analysis and the simulation experiment for the presented method indicates that the method is more secure and effective.]]></description>
<pubDate>2013/3/14 10:39:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Donghai,ZHAO Lei and TANG Chaojing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Donghai,ZHAO Lei and TANG Chaojing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605008]]></guid><cfi:id>394</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[High Availability Data Objects Placement Algorithm with Mirroring]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Mirroring is a popular technique for enhancing data availability. Based on this technique, this paper proposes a high-availability data objects placement algorithm with mirroring, which groups objects into redundancy sets by using RAID at the algorithm level. The redundancy allows us to reconstruct any corruption or failure of the data objects and storage nodes, thus efficiently ensuring the high availability of storage system. We quantify the availability of storage system by using Markov reward model, and the computing results indicate that the algorithm is efficient.]]></description>
<pubDate>2013/3/14 10:39:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Zhong,REN Hao and ZHOU Xingming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Zhong,REN Hao and ZHOU Xingming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605009]]></guid><cfi:id>393</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[AQM Algorithms in Large-delay Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The study was made to research into the effect of the network delay upon the AQM mechanism and to analyze the properties of several typical AQM algorithms in delay networks, which was put forward recently. With a discussion of the advantage and disadvantage of the DC-AQM, this paper, according to the Ziegler-Nichols approach, in which PID controller may compensate for the time delay, proposed an AQM algorithm using Ziegler-Nichols Method that can reduce the negative impact caused by the large delay. Finally, the performance of AQM with Ziegler-Nichols Delay Compensation is evaluated through NS simulations. Results from the simulation reached the objective expected.]]></description>
<pubDate>2013/3/14 10:39:12</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Ming,DOU Wenhua and ZHANG Heying]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Ming,DOU Wenhua and ZHANG Heying</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605010]]></guid><cfi:id>392</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[I-TCP: An AIMD Algorithm for High-speed Long Distance Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To investigate the problem of the congestion control over high-speed long distance networks, this paper presents a new AIMD congestion control algorithm, I-TCP, which is based on a model of network of synchronous AIMD sources competing for a shared bandwidth under drop-tail queuing. With a reasonable design of a high-speed mode, a low-speed mode and the mode switch rule, I-TCP is suitable for deployment in the high-speed long distance networks as well as the traditional low speed networks. Simulation experiments show that the AIMD algorithm of I-TCP performs better than current TCP implementations in terms of efficiency, fairness and network responsiveness over high-speed long distance networks.]]></description>
<pubDate>2013/3/14 10:39:12</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Zheng and WU Lingda]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Zheng and WU Lingda</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605014]]></guid><cfi:id>391</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multitemporal Remote Sensing Images Change DetectionBased on Linear Feature]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Change information of linear objects can be detected based on linear feature in multi-temporal remote sensing images. A new linear feature change detection approach is proposed. In this paper, the changed edge points from multi-temporal remote sensing images are grouped into line support regions based on the difference of gradient information. Then, the regions are fitted based on least square and the changed lines are generated. This approach of linear features change detection uses the gradient information of multi-temporal images as the change detection element instead of match the line information, so it decrease the complexity of the change detection. The experimental results in multi-temporal remote sensing show the effective of the proposed approach.]]></description>
<pubDate>2013/3/14 10:39:12</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHONG Jiaqiang and WANG Runsheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHONG Jiaqiang and WANG Runsheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200605016]]></guid><cfi:id>390</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Implementation and Evaluating of a 2D Lagrange-Euler Method onMASA Stream Processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Modern semiconductor technology allows us to place hundreds of functional units on a single chip which provides limited global on-chip and off-chip bandwidths. General purpose processor architectures have not adapted to this change in the capabilities and constraints of the underlying technology, still relying on global on-chip structures for operating a small number of functional units. Stream processors, on the other hand, have a large number of functional units, and utilize multiple register hierarchies with high local bandwidth to match the bandwidth demands of the functional units with the limited available off-chip bandwidth. This paper describes the microarchitecture of MASA and presents the implementation of the application in fluid dynamics. We developed cycle-accurate simulator to evaluate the performance. The results show that the application on 500MHz MASA outperforms a 1.6G Itanium2 by a factor of 4. This research confirms that stream architecture has the potential to deliver high performance.]]></description>
<pubDate>2013/3/25 4:45:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Chunyuan,WEN Mei,WU Nan,XUN Changqing and WU Wei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Chunyuan,WEN Mei,WU Nan,XUN Changqing and WU Wei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604010]]></guid><cfi:id>389</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multi-robot Formation Control Using Potential Field for Mobile Ad-hoc Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Mobile ad-hoc networks are characterized by self-organization, rapid deployment and fault tolerance. A multi-robot formation supported by mobile ad-hoc networks is suitable to some special situations where the communication devices of mobile networks cannot be preinstalled. However, ad-hoc networks are of limited communication range and frequent topology change. If the communication distance of robot isn't taken into account, some robots will escape from the formation whenever it is not within the communication range of the networks. In order to ensure the integrality of the multi-robot formation, a potential field based approach was proposed, in which the special attractive force caused by inter-robot distance, together with the attractive force and the repulsive forces respectively caused by goal and obstacles, has been taken into account. The results in simulation demonstrate that the approach can effectively control the change of multi-robot formation in mobile ad-hoc networks.]]></description>
<pubDate>2013/3/25 4:46:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FAN Weihong,TANG Bo,CAI Xuanping and LIU Yunhui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FAN Weihong,TANG Bo,CAI Xuanping and LIU Yunhui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604011]]></guid><cfi:id>388</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Improve the Performance of Parallel Matrix Multiplication onClustered SMP Systems Through Hybrid Programming]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to give a full play of SMP clusters, this research studied the method to improve the performance of Fox algorithm for parallel matrix multiplication exploiting optimization on single processor, OpenMP and MPI, which involves the levels of instruction, shared memory and distributed memory respectively. Through invoking mathematic library and hybrid programming, the numerical results derived on DeepComp 6800 are satisfactory.]]></description>
<pubDate>2013/3/25 4:46:07</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Jianping<sup>1</sup>,WANG Zhenghua<sup>1</sup> and LI Xiaomei<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Jianping<sup>1</sup>,WANG Zhenghua<sup>1</sup> and LI Xiaomei<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604015]]></guid><cfi:id>387</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Differential Attack on Nonlinear Combined Sequences]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[By combining with the properties of coding and statistic of the plaintext, we discussed the differential properties of the ciphertext sequences which are generated by a nonlinear combined generator. A difference attack algorithm which attacks the nonlinear combined sequences was proposed. In the end of the paper, an attack example of the difference attack algorithm was supplied.]]></description>
<pubDate>2013/3/25 4:46:09</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Chao<sup>1,2</sup>,WANG Wenling<sup>1</sup> and HU Pengsong<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Chao<sup>1,2</sup>,WANG Wenling<sup>1</sup> and HU Pengsong<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604017]]></guid><cfi:id>386</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Question about Dimensional Summarizability and ItsCountermeasures]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In OLAP application, aggregation is the usual technique to improve the response speed of the users' query. However, there have been few attempts to completely characterize the ability to summarize measures along some dimensions. Based on this situation, this paper firstly gives some basic definitions about the dimension summarizability, and represents its taxonomy. Then it describes the technique of judging the summarizability in detail, and finally, its countermeasures are introduced.]]></description>
<pubDate>2013/3/25 4:46:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LU Changhui,LIU Qingbao,DENG Su and ZHANG Weiming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LU Changhui,LIU Qingbao,DENG Su and ZHANG Weiming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200604018]]></guid><cfi:id>385</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on the Architecture of Software-based Cluster Routers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[After analyzing the background of cluster routers, this paper proposes two cluster routing reference models: Software-based Cluster Router Reference Model (SCR-RM) and Parallel Cluster Routing Reference Model (PCR-RM). The detailed description of the two models is also made. These models will provide reference systems, experiment systems and IP flow processing scenarios for future studies.]]></description>
<pubDate>2013/3/14 10:38:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GONG Zhenghu,FU Bin and LU Zexin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GONG Zhenghu,FU Bin and LU Zexin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603010]]></guid><cfi:id>384</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research and Implementation of ForCES-based IPv6 Router]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[After analyzing the background of open network architecture, the paper proposes an OpenRouter model. The model consists of 4 logic layers, between which there are 3 standard APIs to separate the router into variant modular functions. Based on the OpenRouter model, an IPv6 router system is implemented and the key points of implementation are described within the paper.]]></description>
<pubDate>2013/3/14 10:38:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Baosheng,XIA Yi,CHEN Xiaomei and ZHAO Feng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Baosheng,XIA Yi,CHEN Xiaomei and ZHAO Feng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603011]]></guid><cfi:id>383</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on the Architecture of Inter-domain Traffic Engineering]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the rapid development of the Internet, for the benefit of improving the using rate of the entire network resources, the technique of inter-domain traffic engineering was proposed for the performance optimization of traffic that originates in one administrative domain and terminates in a different one. Based on the analysis and evaluation of current researches on the architecture of inter-domain traffic engineering, the RCP architecture for inter-domain traffic engineering was suggested. Finally, some main key problems were discussed for future researches.]]></description>
<pubDate>2013/3/14 10:38:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Yaping,GONG Zhenghu and LU Zexin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Yaping,GONG Zhenghu and LU Zexin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603012]]></guid><cfi:id>382</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Improving BGP Convergence through Advertisement Time Stamp]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper presents a new mechanism called BGP(border gateway protocol) with ATS (advertisement time stamp), which can greatly reduce routing convergence delay for BGP greatly. In the approach presented, when a BGP speaker sends a peer an advertisement packet, it marks the corresponding routing prefix/prefixes with the system time. When the next advertisement packet is ready, the BGP speaker decides whether the packet should be sent immediately or not via the corresponding time stamp checking. It shows that ATS takes advantage of the per-peer MRAI(min-route-advertisement-interval) Timer and per-peer per-destination MRAI Timer while overcoming their disadvantages. Theoretical analysis demonstrates that ATS can achieve a dramatic improvement in routing convergence for Tup, Tshort and Tlong events in comparison with BGP and other existing solutions.]]></description>
<pubDate>2013/3/14 10:38:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Feng,SU Jinshu and WANG Baosheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Feng,SU Jinshu and WANG Baosheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603013]]></guid><cfi:id>381</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Maximum Flow Based Model and Method of the Maximum LifetimeProblem of Sensor Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Maximizing the collective functional lifetime is clearly one of the biggest design objectives of any wireless sensor network. For this purpose, it is important to find out the value of maximum lifetime of a sensor network exactly. In this paper, the lifetime maximization was formalized for the multi-source multi-sink maximum flow problem of a directed graph with arc and vertex capacity powers. Then a method was proposed to solve this kind of maximum flow problem.]]></description>
<pubDate>2013/3/14 10:38:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[PAN Yantao,PENG Wei and LU Xicheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>PAN Yantao,PENG Wei and LU Xicheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603014]]></guid><cfi:id>380</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Maximally Reliable Pathset Selection for MultipathRouting in MANET]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The number and the quality of the paths dictate the performance of a multipath routing scheme, a problem which has not been sufficiently dealt with before. With an analysis of two current problems and a discussion of the routing reliability model and the virtual non-crossing multiple path routing model, a pathset selection algorithm called Maximal Reliability Pathset Selection for Multipath Routing is proposed in this paper, which selects the pathset according to the reliability of the paths and distributes traffic into multiple paths to optimize bandwidth usage and improve the throughput. By implementing this algorithm on the OPNET environment, the result shows that the scheme can balance the network load and improve the stability and reliability with minimal additional exchange overhead and with minimal additional storage requirements. Therefore it can be beneficial for mobile ad hoc networks.]]></description>
<pubDate>2013/3/14 10:38:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[AN Huiyao,PENG Wei and LU Xicheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>AN Huiyao,PENG Wei and LU Xicheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603015]]></guid><cfi:id>379</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Rule-based Approach to Anomaly Detection in Inter-domainRouting System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The behaviors of the Inter-domain Routing (IDR) System are becoming rather complicated with the rapid development of the Internet. Security incidents in IDR system have attracted extensive attention among people. This paper proposes a rule-based monitoring framework to secure IDR System, in which the rules can be used to effectively detect anomalous routes and possible attacks. Unlike GADRs, SADRs were defined according to some Internet models that are behavior-models represented by large numbers of normal routes. Furthermore the construction of the Internet Hierarchy Model and ISP Commercial Relationships Model were studied, and methods based on these models were developed to detect hidden route anomalies or attacks. ISP-Health, the prototype of such a monitoring system supported by the above-mentioned framework, was implemented, and its capabilities were exhibited at last.]]></description>
<pubDate>2013/3/14 10:38:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Xin<sup>1</sup>,ZHU Peidong<sup>1</sup>,MI Qiang<sup>2</sup> and YANG Mingjun<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Xin<sup>1</sup>,ZHU Peidong<sup>1</sup>,MI Qiang<sup>2</sup> and YANG Mingjun<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603016]]></guid><cfi:id>378</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Distributed BGP Architecture]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the Internet continuing its expansion in range and its increase of linking density, the BGP routing protocol, which works as the inter-domain route standard, has met serious challenge. The emergence of clustered router, which has the advantages of distributed storage, computation resources and high extensibility in system and structure, is helpful for people to meet the challenges. Considering that BGP protocol architecture is not suitable for clustered router, this paper proposes a new distributed BGP architecture, which can take advantage of distributed resources of clustered router greatly. Compared with traditional BGP architecture, the distributed BGP architecture can improve protocol reliability, lower administration costs, simplify BGP network topology and improve BGP scalability.]]></description>
<pubDate>2013/3/14 10:38:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Xiaozhe,LU Xicheng and SU Jinshu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Xiaozhe,LU Xicheng and SU Jinshu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200603017]]></guid><cfi:id>377</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A New DCT/IDCT Architecture Based on Wallace Trees]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200601015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper proposes a Wallace-tree based new DCT/IDCT architecture, which does not depend on ROM and multipliers any more, but utilizes low cost adders, shifts and 4-2 compressors to implement the multiplication-dense DCT/IDCT algorithm. Designed and synthesized by SMIC 0.18 μm technology, the architecture could achieve 100Mpixels/sec throughout with cost of only36 141transistors and 1024 bits transform memory. As a result, a far better performance of time series and space is obtained than that of the existing architecture.]]></description>
<pubDate>2013/3/25 4:43:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Tiejun,WANG Aiping and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Tiejun,WANG Aiping and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200601015]]></guid><cfi:id>376</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Open Framework for Video Management]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200601016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Video content is the basis for effective video management. As video is characterized by multi-modality and multi-level structure, this paper presents a 3-D model of video content. Furthermore, it proposes an open framework for video management, in which video data and the contents of video are stored and managed separately. The connection between video data and contents was maintained by
 an associating mechanism, through which multiple logical descriptions between video data and contents could be created. This framework is applicable to the management of different videos while users can search them with “multi-modal query” as well.]]></description>
<pubDate>2013/3/25 4:43:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Yuchi<sup>1</sup>,XIE Yuxiang<sup>1</sup>,WU Lingda<sup>1</sup>,LEI Zhen<sup>1</sup> and DAI Duanhui<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Yuchi<sup>1</sup>,XIE Yuxiang<sup>1</sup>,WU Lingda<sup>1</sup>,LEI Zhen<sup>1</sup> and DAI Duanhui<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200601016]]></guid><cfi:id>375</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Similarity Measurement in Multimedia Data Mining]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200601017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Clustering is one of the focused problems in multimedia data mining, and similarity measurement among data is fundamental to clustering. In multimedia data clustering, the corresponding vector features are always of high dimensionality. Most traditional measurement methods, however, are only efficient for low dimensional data. This paper, based on an analysis of general characteristics of data presented in high dimensional spaces, proposes a new similarity measurement for multimedia data mining. It used a special strategy to split the original data space before computing the similarity among data points, thus efficiently avoiding the influence of noisy data in high dimensional dimensional spaces. Experiments show that the new method presented is effective.]]></description>
<pubDate>2013/3/25 4:43:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HE Ling,WU Lingda,CAI Yichao,XIE Yuxiang and LEI Zhen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HE Ling,WU Lingda,CAI Yichao,XIE Yuxiang and LEI Zhen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200601017]]></guid><cfi:id>374</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A File Access Control Policy Based on User's Intention]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Access control is an important technique to protect computer files. Aiming at malwares that attack files, the paper proposes a quantified estimation method, and points out that the fragibility of prevalent access control policies lies in authorizing programs to access files what the user can access. The paper novelly proposes an access control policy based-on user's intention, which is able to defend unknown file attacks, and has extraordinarily  less risk than prevalent access control policies. Furthermore, the paper proves security properties of the policy presented, and its application is discussed.]]></description>
<pubDate>2013/2/28 5:09:21</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HE Hongjun,LUO Li,CAO Sihua,NING Jingxuan,LI Peng and DONG Liming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HE Hongjun,LUO Li,CAO Sihua,NING Jingxuan,LI Peng and DONG Liming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706013]]></guid><cfi:id>373</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Cocast: A Coordinate-fusion Based Distributed NetworkDistance Prediction Anycast Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[According to the network-coordinate based network distance estimation problem in an Internet-wide environment, an anycast algorithm named Cocast for cooperative network coordinate estimation is presented. All peers join a structured Peer-to-Peer overlay, and any peer in the overlay, i.e., a requestor, may send a network coordinated anycast message, then the anycast message is forwarded to a set of peers in charge of network coordinate estimation, and each of these peers makes responses from a network coordinate to the requestor, finally the requestor gets a synthetical network coordinate. Based on three novel mechanisms, i.e., an anycast service to select peers for network coordinate estimation, a hierarchical network embedding mechanism to compute the network coordinates, and a coordinate-fusion sensor approach to filter malicious peers' fake-coordinate effects, Cocast owns a fast convergence speed in network coordinate estimation and is more stable. Simulation results confirm that Cocast is scalable, fast-convergent, incrementally accurate and resilient.]]></description>
<pubDate>2013/2/28 5:09:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Yijie,FU Yongquan and ZHOU Jing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Yijie,FU Yongquan and ZHOU Jing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706014]]></guid><cfi:id>372</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Semi-supervised Text Classification Based on Self-trainingEM Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To improve computation efficiency, an enhanced EM algorithm based on self-training named STEM is proposed. In the E-step of each iteration, the unlabeled sample, whose class can be predicted by the current intermediate classifier with the most confidence, is moved to the labeled set and used in the M-step to train the next intermediate classifier. Therefore the mechanism of self-training by inter-result employing is introduced. Experimentation on text classification indicates that STEM outperforms EM in classification accuracy most of the time and improves the learning efficiency by reducing iterations.]]></description>
<pubDate>2013/2/28 5:09:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Bofeng,BAI Bing and SU Jinshu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Bofeng,BAI Bing and SU Jinshu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706015]]></guid><cfi:id>371</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Level Based Δ-Critical Links Routing Algorithm forInterference Minimizing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The critical link routing algorithm for interference minimizing has made a great success in optimizing the efficiency of network resources usage. Its method of critical links identification, however, is not very accurate in some circumstances, and it does not consider much about load balancing. This paper presents a new level based Δ-critical links routing algorithm for interference minimizing, of which the algorithm can identify critical links more precisely in some circumstances, and can perform load balancing better. Simulation results show that the algorithm proposed performs better in the resource utilization efficiency and load balancing.]]></description>
<pubDate>2013/2/28 5:09:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MENG Zhaowei,SU Jinshu,TU Rui and CAO Jijun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MENG Zhaowei,SU Jinshu,TU Rui and CAO Jijun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706016]]></guid><cfi:id>370</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Price-based QoS Model and Algorithm for NetworkResource Allocation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper proposes a pre-estimation based enhanced multidimensional resource allocation model (PE-EMRA) and its algorithm for network resource allocation. The PE-EMRA approach allocates both bandwidth and buffer resource for different traffic classes, balancing and limiting the arrival rate of traffic class and also maximizing the system utilization. The advantage of this approach is that it can maximize the system utilization and provide QoS guarantee while being flexible and easy to realize.]]></description>
<pubDate>2013/2/28 5:09:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Xiaomei,DANG Gang and SU Jinshu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Xiaomei,DANG Gang and SU Jinshu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200706017]]></guid><cfi:id>369</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multi-measurement Fusion for Visual Tracking by Particle Filter]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200705007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Visual tracking in a clutter background remains to be a challenging task by far. The particle filter based tracking algorithm proposed in this paper fuses color and texture information to build a robust measurement function. During the measurement step, the color information and texture information were represented by color histograms and gradient orientation vector respectively. Bhattacharyya coefficient and Euclidean distance were used to set up an effective connection between the estimated model parameters and the image likelihoods. Moreover, to overcome the problem of appearance changes, partial occlusions and significant clutter, an adaptive model update method was adopted. Experimental results show that the proposed method is robust and effective.]]></description>
<pubDate>2013/2/28 5:09:08</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI You,ZHANG Heng and LI Lichun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI You,ZHANG Heng and LI Lichun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200705007]]></guid><cfi:id>368</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Optimistic Data Consistency Algorithm for Update of Key-attributes]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200704009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In generally large-scale and strong distributed P2P systems, updates issued by replicas may be delayed, and then resource location performance on the Internet may be depressed. According to the characteristics of updates about key-attributes in P2P systems, an optimistic data consistency maintenance algorithm is proposed. The update about key-attributes was separated from user update request, and based on classifying key-update conflicts, a double-level mechanism including preprocessing buffer and key-update table were applied to detect and reconcile conflicts, and then conflicts were solved by policies as last-writer-win and divide-and-rule. Delaying key-attributes updates cannot occur by the optimistic disposal method, and then it cannot depress efficiency of resource location based on key-attributes, which adapts well to P2P systems for Internet. The simulation results show that it is an effective optimistic data consistency algorithm, achieving good consistency overhead, resource location and resource access overhead, and having strong robustness.]]></description>
<pubDate>2013/2/28 5:08:53</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Jing<sup>1</sup>,WANG Yijie<sup>1</sup>,LI Sikun<sup>1</sup> and WANG Yuanzhi<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Jing<sup>1</sup>,WANG Yijie<sup>1</sup>,LI Sikun<sup>1</sup> and WANG Yuanzhi<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200704009]]></guid><cfi:id>367</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Low Power Design of Router for LS-DSP]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200704011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[LS-DSP, of which the inner coprocessor is composed of process unit PE, is a Digital Signal Processor used for aerospace image processing. Router is a special unit which interlinks PE net array, and it is also the part most frequently used for operation. How to depress power of processor and elevate calculate efficiency is an important topic for research. Aimed at a low power improvement in the circuit of LS-DSP router, a design base on clock-gating was carried out, and the algorithm was taken as an example to make the power consumption analysis and comparison of the control and operation process. The experimental results show that the improved architecture can reduce the router power consumption by 76%.]]></description>
<pubDate>2013/2/28 5:08:53</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Jianchuan<sup>1,2</sup>,WANG Zhong<sup>1</sup> and CHE Deliang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Jianchuan<sup>1,2</sup>,WANG Zhong<sup>1</sup> and CHE Deliang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200704011]]></guid><cfi:id>366</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research of Data Replication Algorithm in P2P Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200703013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A comparative analysis of replication algorithms in P2P systems and a novel replication algorithm Dyre based on LDPC codes were presented. Dynamic replica placement was proposed. With this method, blocks are stored in predecessor and success nodes to improve the availability, and blocks are restored when the number of available blocks is small in this algorithm. Simulation results show that the algorithm can significantly enhance the data availability, even when the node reliability is low.]]></description>
<pubDate>2013/2/28 5:08:41</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Yijie,ZHANG Xiaoming and ZHOU Jing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Yijie,ZHANG Xiaoming and ZHOU Jing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200703013]]></guid><cfi:id>365</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research and Implementation of a New QoS Mechanismwith Effective Multicast Supporting in High Performance Routers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200702019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A new QoS mechanism with effective multicast supporting in high performance routers—QoS_RESM is presented and studied in this paper. Based on multi-threshold mechanism, it considers the congestion information of remote forward engines by introducing the mechanism of global control information feedback. It ends with a description of the implementation method of QoS_RESM in the core router on the basis of network processor.]]></description>
<pubDate>2013/2/28 5:08:28</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Chunqing and YANG Xuejun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Chunqing and YANG Xuejun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200702019]]></guid><cfi:id>364</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Decomposition/Composition-of-Tree Strategy-based Method for QoS Multicast Routing Problem]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200702026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In view of the fact that the multiple constrained QoS multicast routing is a NP-Complete problem, a controllable strategy for decomposing and composing multicast tree is introduced. Different trees of little cost will be gained under the strategy, so that the problem of local best can be solved effectively. An ant colony algorithm, which divides the ant colony into ant assembly according to the ends of multicast, is designed on the basis of the strategy. The pheromone updating mechanism is improved with the “dead-point” punishment and the encouragement and punishment to the multicast tree strategy, so that the algorithm can converge fast. Simulation results demonstrate that the  method can solve the QoS multicast routing problem effectively, and perform well as the size of network increases.]]></description>
<pubDate>2013/2/28 5:08:28</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Yan,YANG Huajiang,ZHU Huayong and SHEN Lincheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Yan,YANG Huajiang,ZHU Huayong and SHEN Lincheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200702026]]></guid><cfi:id>363</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Model for Dynamic Web Service Composition Process Modeling Basedon Extended Petri-net and the Describing Method with BPEL4WS]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200701015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To overcome the shortcoming of current web service  composition modeling methods, a new web services composition process/resource model(WSCP/R-net) was proposed on the basis of the extended petri-net. WSCP/R-net resolves the problems on uncertain activity option and dynamic variation of service in process modeling effectively. Furthermore, a description of the methods to translate WSCP/R-net into BPEL4WS was made. Finally, its application was illustrated in city emergency disposal.]]></description>
<pubDate>2013/2/28 5:08:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Shulei,TANG Guifen,LIU Yunxiang,CHEN Luo and JING Ning]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Shulei,TANG Guifen,LIU Yunxiang,CHEN Luo and JING Ning</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200701015]]></guid><cfi:id>362</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Key Techniques for System of Virtual SurgerySimulation with Knee Arthroscope]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200701016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Virtual surgery simulation system is one of the important tools for medical training. It can be widely applied in medical education. By the experiences in the development of the virtual surgery system for knee arthroscope, we introduce the key techniques about geometry modeling, deformation computing, mechanics feedback and special effect processing. The methods developed in this paper can be extended to other virtual surgery simulation.]]></description>
<pubDate>2013/2/28 5:08:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIONG Yueshan<sup>1</sup>,XU Kai<sup>1</sup>,WANG Yanzhen<sup>1</sup>,TAN Ke<sup>2</sup> and GUO Guangyou<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIONG Yueshan<sup>1</sup>,XU Kai<sup>1</sup>,WANG Yanzhen<sup>1</sup>,TAN Ke<sup>2</sup> and GUO Guangyou<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200701016]]></guid><cfi:id>361</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Efficient Verification Method of Cache CoherenceProtocol Based on Pseudo-cutoff]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Regarding the state space explosion problem in model checking Cache coherence protocol, the concept of pseudo-cutoff, a limit of the nodes which share the same memory block, is put forward in this paper. Based on the analysis of the inherent characteristics of parallel programs, the pseudo-cutoff value in relaxed consistency Cache coherent non-uniform memory access  system under certain conditions is deduced. The state space of the directory-based Cache protocol is optimized effectively using pseudo-cutoff, and a new scheme to small probability matter of wide sharing is presented. Experimental results show that, the method of protocol model optimization based on pseudo-cutoff  can effectively reduce the state space of Cache protocol, accelerate verification speed and improve the capability of verifying large scale Cache protocol.]]></description>
<pubDate>2012/12/7 2:58:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[QU Wanxia,GUO Yang,PANG Zhengbin and YANG Xiaodong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>QU Wanxia,GUO Yang,PANG Zhengbin and YANG Xiaodong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806011]]></guid><cfi:id>360</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Design for the Erasure Code Based SegmentedFile P2P Storage Structure]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In view of the characteristics of P2P storage, a novel Erasure Code based segmented file P2P storage strategy is designed, and the Chord protocol based P2P storage structure is constructed. The effective file storage, access and update function of the novel strategy overcome the deficiencies of the traditional Erasure Code P2P storage strategy, enabling the stored file to have a certain data revision capability and structure expansion-contraction capability. Theoretical analysis and experimental simulation verify that the novel strategy has reasonable feasibility and effectiveness.]]></description>
<pubDate>2012/12/7 2:58:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAO Jun,SHA Jichang and WANG Hui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAO Jun,SHA Jichang and WANG Hui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806013]]></guid><cfi:id>359</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[VLSI Implementation of Soft-output Sphere DetectorBased on ONPC Architecture]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The efficient high-speed VLSI implementations of sphere detector providing soft information for a subsequent error correcting decoder are not trivial due to their high computational complexity. Therefore, a VLSI solution for soft-output sphere detector based on depth-first tree search and ONPC architecture is presented. In a 0.13-μm CMOS process, the proposed detector solution can achieve 14 Mbps at a signal-to-noise ration of 17.7dB for 4×4 MIMO system with 64-QAM using only approximately 4.1mm<sup>2</sup>, and realize a better BER performance than K-best algorithm with 256 survivor paths based on depth-first search.]]></description>
<pubDate>2012/12/7 2:58:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FANG Xing and CHEN Shuming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FANG Xing and CHEN Shuming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806014]]></guid><cfi:id>358</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Analysis and Optimization of the Throughput of a Kind of Bufferless Optical Interconnection Network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the problem of implementing optical buffers in the present high performance computer optical interconnection, a bufferless optical interconnection, named BOIN, is put forward. Based on modeling and analyzing the network topology, the relationship between the network throughput and the offered loads as well as network sizes is studied. Then the condition of maximum throughput of the network in a fixed offered loads and total number of nodes is presented. Finally, the simulation results show that the correctness is confirmed.]]></description>
<pubDate>2012/12/7 2:58:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[QI Xingyun,DOU Qiang,CHEN Yongran,WEN Jun and DOU Wenhua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>QI Xingyun,DOU Qiang,CHEN Yongran,WEN Jun and DOU Wenhua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806015]]></guid><cfi:id>357</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[DL Wrapper Mechanism of EHDM with Applications on Z39.50]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Z39.50 is widely used for searching and retrieving information spread over a number of heterogeneous sources, but it is hard to construct the mapping relationships between Z39.50 and the data sources, since the semantics of the dynamic and autonomy data sources cannot be exactly derived so as to achieve an exact information retrieval operation. This paper proposes the  extend hyper graph data model based on HDM, which can be abstracted into levels, taking two kinds of nodes and edges of EHDM as access points ofZ39.50. It can solve the problems of badly supporting of querying on structured data sources and query failures by constructing the DL layer between EHDM and Z39.50, in which the concepts and derived concepts are mapped onto Z39.50 wrappers. Thus, defining three layers structure as in dataspace systems can realize the data integration strategy named “integrate when needed”.]]></description>
<pubDate>2012/12/7 2:58:05</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Bo and GUO Bo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Bo and GUO Bo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200806017]]></guid><cfi:id>356</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Protocol Identification Research Based on Content Analysis]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200804016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To solve the performance problem in Regular Expression matching of Protocol Identification, this paper introduces a Multi-pattern  FSM (MPFSM), which can use one FSM to match several Regular Expressions. Based on Thompson algorithm, an Epsilon Compressed NFA Construction Algorithm is also put forward and implemented. This algorithm enhances the performance of conversion from NFA to DFA by decreasing the epsilon edges and the corresponding states. A One-pass Multiple-pattern protocol identification system is also implemented using the Multi-pattern FSM and corresponding algorithms. Experiments based on actual traffic are employed to show that the compile speed would be 7 times faster than the usual transfer process, and the Matching speed would be 20 times faster than the L7-Filter.]]></description>
<pubDate>2012/12/7 2:57:38</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Shuhui and SU Jinshu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Shuhui and SU Jinshu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200804016]]></guid><cfi:id>355</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Review on Bioinformatics Analysis of Genome-scaleMetabolic Network Decomposition]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As the large-scale data on molecular interaction available increases, the study on biological networks has ignited more and more attention. As the execution level of cellular functions, the structural composition of metabolic networks not only reflects the execution of cellular functions step by step, but also influences the pathway analysis of metabolic engineering. Hence, as a key step, a sound decomposition of global metabolic networks is not only significant for further exploring the structure and function of genome-scale biological networks, but also necessary for favorably developing the pathway analysis of metabolic engineering. Having reviewed the fruitful study of the macro-structure and topological characteristics, and analyzed some available decomposition approaches, this paper concludes that the lack of reasonable and purposeful evaluation criterions is one urgent problem in the present study of metabolic network decomposition. Besides, the future trend is to develop more effective decomposition models with more information and by more advanced approaches, as well as expanding the application range of network decomposition.]]></description>
<pubDate>2012/12/7 2:57:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Zhenghua and ZHOU Tingting]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Zhenghua and ZHOU Tingting</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803010]]></guid><cfi:id>354</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research of Key Techniques for Parallel Router Based onDistributed Forwarding and Switching]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Continuing growth in link speeds and the number of advertised IP prefixes places increasing demands on the performance of Internet routers. In view of this fact, a parallel router architecture based on partial forwarding and pipelining switching is proposed. The architecture consists of multi-stage, lower speed nodes performing IP-lookups and switching independently, thus IP-lookups and switching for multiple packets have been pipelined. We investigate the key technologies of this architecture including the logical mapping from subtries to function components as well as the pipelining IP-lookup mechanism based on subtrie. Finally, future directions and possible open problems are discussed.]]></description>
<pubDate>2012/12/7 2:57:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DAI Yi,SUN Zhigang,SU Jinshu and GUAN Jianbo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DAI Yi,SUN Zhigang,SU Jinshu and GUAN Jianbo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803011]]></guid><cfi:id>353</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Low-memory Implementation of Generic Tree-structuredFilter Banks for PCT-based Image Coders]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the compact support property of popular multi-channel filter banks, a low-memory implementation of generic tree-structured filter banks (TSFBs), called the stripe-based tree-structured filter bank (SBFB), is presented by utilizing the first-in first-out (FIFO) buffer technique. The SBFB has two advantages: (1) It produces exactly the same sub-band coefficients as the conventional global implementation of TSFB does, while the memory budget is unrelated to the image height and only dependent on the image width and the TSFB adopted. As a result, the memory budget of SBFB is only a fraction of that of the global implementation; (2) It generates integral parent-children trees (PCTs), which are completely contained in its buffers. The SBFB lends itself to PCT-based coders in that no intermediate buffering is needed between the SBFB and the coder. By analyzing the dataflow of different levels of TSFB, the relation between the samples and the sub-band coefficients is also attained, by which the correctness of the SBFB is strictly proved.]]></description>
<pubDate>2012/12/7 2:57:24</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Xiongming<sup>1</sup>,LU Huanzhang<sup>1</sup> and CHENG Lizhi<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Xiongming<sup>1</sup>,LU Huanzhang<sup>1</sup> and CHENG Lizhi<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803012]]></guid><cfi:id>352</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Study on the Network Active Defense TechnologyBased on Deception]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A network active defense technology based on multi-layers deception in the distributed deception space is proposed to meet the needs of network countermeasure and network security. This technology simulates usual network service programs and forges vulnerabilities to lure the intruder. With operation control at kernel level, file system mirror and information deception, it creates the deceiving operating environment on the platform of Windows and Linux. Thus the process of intrusion is fully deceived, monitored and controlled. This technology breaks the limitation of a single layer deception used by other general honeypots, and obviously promotes the level of deception, interaction and ensures security.]]></description>
<pubDate>2012/12/7 2:57:24</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YAO Lan and WANG Xinmei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YAO Lan and WANG Xinmei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803013]]></guid><cfi:id>351</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Improved Event-driven System Infrastructure]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the presentation of the security vulnerability of the event-driven system, this paper points out the deep reasons for the vulnerability of system: (1) The system ignores the inherent correlation among events; (2) The system trusts events from any sources without condition. In view of these two reasons, this paper presents an analytical model for security of event sequence, and an evaluation model of trustworthiness based on event source. Furthermore, this paper constructs an improved event-driven system infrastructure based on the two models.]]></description>
<pubDate>2012/12/7 2:57:24</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HE Hongjun<sup>1</sup>,CAO Sihua<sup>1,2</sup>,CHU Zugao<sup>2</sup>,LUO Li<sup>1</sup>,NING Jingxuan<sup>1</sup>,DONG Liming<sup>1</sup> and LI Peng<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HE Hongjun<sup>1</sup>,CAO Sihua<sup>1,2</sup>,CHU Zugao<sup>2</sup>,LUO Li<sup>1</sup>,NING Jingxuan<sup>1</sup>,DONG Liming<sup>1</sup> and LI Peng<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200803014]]></guid><cfi:id>350</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[On-chip Trace: Effective Debug and OptimizationTechnique for Embedded Processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To overcome the shortcomings of traditional techniques for non-intrusive debug and optimization, the on-chip trace system was adopted to record run-time information of embedded processor with special hardware. To fill the vacancy of former study, this paper gives a deep view of the mechanism, characteristics and applications of on-chip trace technique with TraceDo, an on-chip trace system of a multi-core SoC. The functions and structures of TraceDo were introduced, the working process of path trace was explained and trace applications were also discussed.]]></description>
<pubDate>2012/12/7 2:57:07</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Xiao,CHEN Shuming,LI Jie and CHEN Lili]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Xiao,CHEN Shuming,LI Jie and CHEN Lili</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802010]]></guid><cfi:id>349</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Mechanism Improving the Forwarding Throughput ofApplication Layer Multicast]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the characteristics of packet forwarding in application layer multicast (ALM), this paper proposes a high performance multicast mechanism, in which a NIC-based multicast mechanism is used to send multiple replicas of an ALM packet to different destinations with less CPU intermediation in comparison to the traditional host-based multicast mechanism. By adopting the mechanism, the CPU overhead and the number of times data packets are copied from host memory to NIC buffer. Theoretical analysis indicates that the new mechanism can reduce the delay and improve the forwarding throughput in application multicast. We have modified the NIC driver and added some corresponding APIs to network protocol stack in order to implement the proposed mechanism. Experimental results also indicate the feasibility and validity of this mechanism.]]></description>
<pubDate>2012/12/7 2:57:07</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CAO Jijun,SU Jinshu and LU Gaofeng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CAO Jijun,SU Jinshu and LU Gaofeng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802011]]></guid><cfi:id>348</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Isolation and Characterization of NBS-LRR Resistance GeneHomology Sequences from Dongxiang Wild Rice]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The resistant gene of plants has conservative sequence. Probes were designed in terms of the sequences of known resistance gene. With the colony hybridization method, the genomic library of Dongxiang wild rice was screened and two candidate clones were obtained. The sequences were analyzed with the blast program to the GenBank database and a conservative NB-ARC domain was found in both of the sequences. The clones would be transferred into rice for a further analysis.]]></description>
<pubDate>2012/12/7 2:57:07</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Zhenghua<sup>1</sup>,GAO Xiujie<sup>1</sup> and CAO Mengliang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Zhenghua<sup>1</sup>,GAO Xiujie<sup>1</sup> and CAO Mengliang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802012]]></guid><cfi:id>347</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[ATIE: An Adaptive Tunable Inter-domain Egress Selection Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Although inter-domain egress is tunable by TIE, it is too complex to compute its parameters, and it is impossible to tune its egress on different traffic load. Accordingly, an adaptive tunable inter-domain egress selection algorithm (ATIE) is proposed. ATIE can satisfy traffic engineering and network robustness by tuning parameter T with current traffic load. Experiments demonstrate that our solution can achieve a good balance between control plane sensitivity and traffic engineering adapting to different network traffic load.]]></description>
<pubDate>2012/12/7 2:57:08</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Yaping,HE Junfeng and GONG Zhenghu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Yaping,HE Junfeng and GONG Zhenghu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802014]]></guid><cfi:id>346</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Context Based Arithmetic Coding of Lapped TransformBiorthogonal Coefficients]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A context based arithmetic coding of Lapped Biorthogonal Transform (LBT) coefficients is proposed. Aiming at the shortcut of precision and computation complexity of binary integer LBT in DSP implementation, a fixed point algorithm of LBT which fits parallel processing in DSP is proposed. There are 60 context models in the algorithm. The coder of entropy coding is MQ-coder. For the purpose of parallel processing, the MQ-coding is isolated from the bit plane scanning. Based on the characteristic of coding algorithm after isolated coding, a modified MQ-coder is designed. Meanwhile, the implementation in TMS320C6000 DSP of the algorithm is studied. Experiments show that the algorithm's coding performance is mostly the same as SPIHT and very competitive with JPEG2000. The tests on the hardware platform show that the algorithm is simple for parallel processing and the computation complexity is very low.]]></description>
<pubDate>2012/12/7 2:57:08</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LUO Wusheng and WANG Jidong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LUO Wusheng and WANG Jidong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802019]]></guid><cfi:id>345</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Study on Network Security Analysis Method Based on Graph]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As information technology security issues become more prominent, the network system security analysis is becoming increasingly important. The paper presents NEG-NSAM, a network security analysis method. Based on network parameters abstract and vulnerability correlation analysis, the network exploitation graph model was constructed, and the dynamic process of a gradual infiltration of the main threats to security objectives was characterized. For large-scale network environment, the simplified algorithm of network exploitation graph model was proposed. Finally, the NEG-NSAM was used to exemplify the network and verify the feasibility and effectiveness of the method.]]></description>
<pubDate>2012/12/7 2:57:08</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Weiming,MAO Handong and CHEN Feng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Weiming,MAO Handong and CHEN Feng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802020]]></guid><cfi:id>344</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Feature Extracting Based 3D Streamline Placement Algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Feature extraction and clarity expression are two main problems in 3D flow visualization research. To solve these problems, a feature extracting based 3D streamline placement algorithm is presented. The algorithm ensures that the feature structures around the critical points can be described correctly, and the output result shares good clarity. The algorithm is comprised of three processes. Firstly, based on the fast detection of critical points, the critical points are classified according to the eigenvalues of their Jacobian Matirx，and the match between the critical points and the seed templates is performed. Secondly, the seeds points are ordered in priority, and streamlines are generated in physical space. Finally, in image space, the distance between streamlines is controlled by the preset threshold value, and the nearest streamline to the observer is held according to the depth detection, thus the display clarity is ensured.]]></description>
<pubDate>2012/12/7 2:57:08</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Xiaoli,SHI Meiping and HE Hangen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Xiaoli,SHI Meiping and HE Hangen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802021]]></guid><cfi:id>343</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Improved Collaborative Optimization Based onMultidisciplinary Inconsistency]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Reasons that cause computational difficulties in collaborative optimization are analyzed and the COMI（Collaborative Optimization Based on Multidisciplinary Inconsistency） algorithm is presented．Relax constraints and system level penalty function are constructed based on inconsistency information between disciplinaries, and a GA optimizer is used to solve a typical MDO question．Simulation results show that the feasibility and the optimal value of COMI is more balanced than the standard CO algorithm and the relax CO algorithm．]]></description>
<pubDate>2012/12/7 2:57:08</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FENG Xiangjun and DAI Jinhai]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FENG Xiangjun and DAI Jinhai</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200802026]]></guid><cfi:id>342</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Novel VLIW Schedule Strategy for Distributed Register Files]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200801008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Newly-emerging high performance processors for intensive computing generally use distributed register files to support ALU array and to explore instruction level parallelism (ILP) by VLIW. Research of the VLIW compiler for distributed register file has been a hotspot. KernelC compiler ISCD developed by Stanford University was the first of its kind to deal with VLIW schedule for distributed register file and the only compiler actually applied as well. However, it limited the program for its weakness of scheduling the code with heavy workload. Based on ISCD, this paper presents a new VLIW schedule strategy. Experimental results show that it can deal with distributed register file allocation with heavy workload very well.]]></description>
<pubDate>2012/12/7 2:56:53</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Nan,WEN Mei and ZHANG Chunyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Nan,WEN Mei and ZHANG Chunyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200801008]]></guid><cfi:id>341</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Memory Consistency Model for Stream Programming]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200801009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A new programming model-the stream programming model is presented on the basis of the stream computing model. A new memory consistency model, named stream consistency for the stream programming model is proposed. In comparison with the traditional release consistency, the stream consistency is more relaxed. The requirements of the stream consistency for the program and system designs are discussed and a correct implementation is presented. The programmability and system overhead of the Stream Consistency is analyzed.]]></description>
<pubDate>2012/12/7 2:56:53</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DENG Yu<sup>1</sup>,YANG Xuejun<sup>1</sup>,DAI Huadong<sup>1</sup> and WANG Meng<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DENG Yu<sup>1</sup>,YANG Xuejun<sup>1</sup>,DAI Huadong<sup>1</sup> and WANG Meng<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200801009]]></guid><cfi:id>340</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Implement Mechanism, Technical Architecture, Reference Model of Dynamic GIS Web Service CompositionBased on Workflow]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200801011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the characteristic of GIS Web Service and dynamic Web Services Composition, this paper proposes the implementation mechanism of dynamic GIS Web Services Composition, which can effectively adapt to the dynamic characteristics of GIS Web Services and have vast data and CPU-intensive computing for the concept of Service Group(SG). According to the mechanism, the paper proposes the technical architecture of GIS Web Services composition, providing holistic framework and top-level guidance for studying dynamic GIS Web Services composition technology. Based on the results of workflow research, this paper puts forward Dynamic Service Composition Reference Model (DSCRM), which builds the framework for the development of dynamic services composition system and the development of dynamic services composition application. The ideas of this paper have been used in city emergency disposal project successfully.]]></description>
<pubDate>2012/12/7 2:56:53</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HE Kaitao<sup>1</sup>,TANG Yu<sup>1</sup> and LIU Shulei<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HE Kaitao<sup>1</sup>,TANG Yu<sup>1</sup> and LIU Shulei<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200801011]]></guid><cfi:id>339</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Construction and Screening of Genomic Library Based onTransformable Artificial Chromosome (TAC) Vector in Orazy.Minuta]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200801025]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A transformation-competent artificial chromosome (TAC) library was constructed from the genomic DNA of orazy.mimuta. This library is composed of 5,000 clones while the average insertion fragment size is 45 kb. Stability test indicated that genome DNA of Orazy.mimuta was stably existence in the pYLTAC27 carrier. A probe was designed according to the sequences of cloned resistance gene. With the colony hybridization method, the genome library was screened. The result shows that resistance gene can be screened in this library.]]></description>
<pubDate>2012/12/7 2:56:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Zhenghua<sup>1</sup>,CAO Zhurong<sup>1</sup> and CAO Mengliang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Zhenghua<sup>1</sup>,CAO Zhurong<sup>1</sup> and CAO Mengliang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200801025]]></guid><cfi:id>338</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Novel SEU/SET Hardened Phase Frequency Detector]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper, a novel SEU/SET hardened PFD is proposed in order to reduce the SEE sensitivity of traditional D flip-flop type PFD. SPICE simulation shows that this structure has very high accuracy. Compared with traditional PFD, the electrical properties of PLL with radiation harden PFD are not changed. Compared with the number of hit nodes which can cause PLL jitter both for D flip-flop type PFD and radiation harden PFD, the number of sensitive nodes is reduced by 80%, indicating that the anti-radiation of the proposed PFD is quite effective.]]></description>
<pubDate>2012/11/8 3:50:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Jihua,QIN Junrui,ZHAO Zhenyu and LIU Hengzhu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Jihua,QIN Junrui,ZHAO Zhenyu and LIU Hengzhu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906001]]></guid><cfi:id>337</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design of Cache Miss Pipelining in YHFT-DX High Performance DSP]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[YHFT-DX is a high performance DSP designed by national university of defense technology. This paper focuses on improving Cache performance, investigates optimization methods to reduce Cache miss stall penalties, designs and implements an optimization method focusing on one level data Cache controller in high frequency and high performance DSP-miss pipelining. Compared with traditional optimization methods, this method can deal with continual cache misses in pipeline, which overlaps multi Cache miss stalls, and then it can achieve the goal of reducing Cache miss stall penalties. Applying the method to the design and optimization in one level data Cache controller in YHFT-DX DSP, the Cache miss stall is reduced from 8 cycles to 2 cycles, and the system performance is evidently improved.]]></description>
<pubDate>2012/11/8 3:50:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUO Yang,FU Yihui,LIU Sheng and LI Yong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUO Yang,FU Yihui,LIU Sheng and LI Yong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906002]]></guid><cfi:id>336</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Radiation-hardened-by-design Differential Voltage-controlledOscillator Implemented in 0.18μm CMOS Process]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Applying the radiation-hardened-by-design (RHBD) technique to improve the bias generator and the ring oscillator of the differential     voltage-controlled oscillator (VCO) with symmetrical loads, a single-event transient (SET) hardened VCO was designed and implemented in 0.18 μm CMOS process based on the failure mechanisms. Simulation results indicate that the single-event susceptibility of the VCO is significantly reduced. Simultaneously, it also reduces the jitter sensitivity to supply noise. This new VCO topology results in a decrease in the frequency, but it can be figured out by adjusting the sizes of the delay buffer. Furthermore, the radiation hardened VCO leads to a decreased area requirement.]]></description>
<pubDate>2012/11/8 3:50:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Zhenyu,GUO Bin,ZHANG Minxuan and LIU Hengzhu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Zhenyu,GUO Bin,ZHANG Minxuan and LIU Hengzhu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906003]]></guid><cfi:id>335</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An LBDL Based VLSI Design Method to Counteract DPA Attacks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Dynamic and differential logic styles are proposed as a typical differential power analysis (DPA) resistant technology. Because of the constant transition rate of dynamic and differential logic gates, the correlation between power consumption and signal values is significantly reduced. In this paper, a novel look-up-table (LUT) based differential logic (LBDL) and the design method based on this logic are presented. Instead of a full custom design, this method combines some modification with a regular standard cell design flow. Thus, have a better practicability. Unlike WDDL (Wave Dynamic Differential Logic), which can also be implemented by standard cell design flow, the transition time of LBDL gates is independent of input values, hence power consumption of LBDL is more constant. Experimental results indicate that the LBDL-based design method can eliminates most of the power leakage.]]></description>
<pubDate>2012/11/8 3:50:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YUE Daheng,LI Shaoqing and ZHANG Minxuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YUE Daheng,LI Shaoqing and ZHANG Minxuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906004]]></guid><cfi:id>334</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research of Single Electron Transistors Operated inRoom-temperature]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The single electron transistor (SET) has become one of the most promising components in nanometer electronic functional devices because of its advantages of low power consumption, high speed and high integration. But due to the special features in structure, SET usually operates only in very low temperature, which prevents SET from being feasible devices. Therefore, it is very important to investigate SET which operates in   room-temperature. In this paper, based on the analysis of working mechanism of SET, we calculate the conditions in which SET can operate in room-temperature, then prepare SET samples in laboratory. The measurement results show that the prepared SET can operate normally in        room-temperature. The research findings will deliver a fine foundation for the practical application of SET.]]></description>
<pubDate>2012/11/8 3:50:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FANG Liang,CHI Yaqing,SUI Bingcai,ZHANG Chao and ZHONG Haiqin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FANG Liang,CHI Yaqing,SUI Bingcai,ZHANG Chao and ZHONG Haiqin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906005]]></guid><cfi:id>333</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[High Accuracy Current Sampling Circuit for PowerManagement without OPA in Multi-voltage Island SoC]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In multi-voltage island SoC, power management is one of the most important fields. The current of workload is the firsthand information of power dissipation, so, the current sampling is the first step in the cycle for high accuracy real-time power management. In this paper, we presented a kind of high accuracy current sampling technology. The circuit is based on current mirrors without operation amplifier, and the voltage of power supply can be ultra low. We designed this circuit with 0.18μm CMOS process. It is shown that the accuracy of this circuit can be 99.1% according to the Hspice simulation and power consumption is less than 4mW for workload in 60～1300mA.]]></description>
<pubDate>2012/11/8 3:50:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MA Zhuo,XIE Lunguo,ZHAO Zhenyu and LI Shaoqing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MA Zhuo,XIE Lunguo,ZHAO Zhenyu and LI Shaoqing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906006]]></guid><cfi:id>332</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Multi-standard Configurable Sub-pixel InterpolationArchitecture for Video Encoding]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Various sub-pixel interpolation technologies are adopted in video coding applications. A multi-standard configuration interpolation architecture is proposed. It consists of two independent 8-tap filters. It can also reduce about 46% interpolation computation by a two-step filter method. Each filter includes a filter parameter register, which stores different filter parameter for various video standards. As a pipeline architecture, filter can have three filter results in one cycle. In SMIC 0.13μm CMOS process, the frequency of this architecture is up to 400MHz, and the area is about 32.6k gates. The  experiment results show that, working on 250MHz, this architecture can satisfy  the interpolation computation requirements of encoding 1920×1080,30fps HD video sequences.]]></description>
<pubDate>2012/11/8 3:50:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GU Huitao,CHEN Shuming and SUN Shuwei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GU Huitao,CHEN Shuming and SUN Shuwei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906007]]></guid><cfi:id>331</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Analyzing Similarity of News Video Stories Based on “Scene Words”]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Analyzing similarity of news video stories is crucial for searching, retrieving, browsing and tracking news video stories. A method based on “scene words” is proposed for measuring the similarity of news stories. Each key frame is seen as a “word” and a news story is seen as a document  which is represented by a sequence of “scene words”. In light of this, the particularity of “scene words” is investigated. An effective method to describe  weight of words and calculating similarity of stories is presented. Experiment  results show that the method based on “scene words” is closer to the sensory  and requirement of users.]]></description>
<pubDate>2012/11/8 3:50:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WEN Jun<sup>1,2</sup>,WU LingDa<sup>1</sup>,ZENG Pu<sup>1</sup> and Xie Yuxiang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WEN Jun<sup>1,2</sup>,WU LingDa<sup>1</sup>,ZENG Pu<sup>1</sup> and Xie Yuxiang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906023]]></guid><cfi:id>330</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Application of the Fuzzy Fault Tree Analysis Method to AirportEnvironment Security]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[By means of fault tree analysis method, this paper gives a systemic analysis of the relevant factors which cause the fault of bird strike aircraft，and its fault tree is also established. Through qualitative analysis, 2580 minimum cut sets can be obtained. Expert estimation method, combined with fuzzy sets theory, is adopted to assess the happening probability of the base events. The calculating of “waste landfill attracting bird”—one of the base events of bird-strike-aircraft, is given as an example of this method. Through quantitative analysis, the happening probability of the top event is 0.00241, and the importance degree of all base events can be analyzed.]]></description>
<pubDate>2012/11/8 3:50:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHU Yunbin<sup>1</sup>,HUANG Xiaoming<sup>1</sup> and CHANG Qing<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHU Yunbin<sup>1</sup>,HUANG Xiaoming<sup>1</sup> and CHANG Qing<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906024]]></guid><cfi:id>329</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Standard Catalogue Service for Battlefield EnvironmentInformation Based on Ontology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906025]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Catalogue service is an important function of battlefield environment support system oriented service architecture, and it aims to introduce the    multi-source massive battlefield environment information into task oriented datasets for operators. To standardize catalogue service for battlefield environment information and realize intelligent search function, the OGC-CSW specification and ontology were introduced. The framework of the catalogue service for battlefield environment information was established, and the key techniques, such as metadata information model, task ontology model and semantic search mechanism, were researched. At last, the methods were validated by the experiment.]]></description>
<pubDate>2012/11/8 3:50:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GAN Zhe,TANG Xiaoan and SUN Maoyin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GAN Zhe,TANG Xiaoan and SUN Maoyin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200906025]]></guid><cfi:id>328</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Discussion on Evolution of Stream Architecture]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For epoch of more than one billion transistors and 1000 ALUs in one chip, stream architecture based on kernel-stream model has turned out to be a hotspot. In light of this, a discussion on evolution of stream architechture is made. Firstly, the background of stream computation is given and features of the representative stream architechitures are summaries. Then, the architecture, processing model, parallelism, on-chip memory, application of some stream architectures are presented. The current dramatic changes and ongoing development trends of hardware and software design in stream processor are discussed in this paper.]]></description>
<pubDate>2012/11/8 3:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Chunyuan,WEN Mei,WU Nan,REN Ju,GUAN Maolin and HE Yi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Chunyuan,WEN Mei,WU Nan,REN Ju,GUAN Maolin and HE Yi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905001]]></guid><cfi:id>327</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Software Defined Radio Digital Signal ProcessorArchitecture Research]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Software defined radio (SDR) has won much interest for being considered to be in line with the trend of wireless communication development. Now the digital signal processor (DSP) is the bottleneck of software defined radio. The advantages and disadvantages of diverse architecture of software defined radio digital signal processor are summarized, and then the trends of software defined radio digital signal processor are discussed.]]></description>
<pubDate>2012/11/8 3:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Hengzhu,MO Fangzheng,ZHANG Botao,ZHAO Heng,LIU Dongpei,CHEN Ting and ZHOU Li]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Hengzhu,MO Fangzheng,ZHANG Botao,ZHAO Heng,LIU Dongpei,CHEN Ting and ZHOU Li</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905002]]></guid><cfi:id>326</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design of Soft Error Immune Registers with Low Overhead]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Due to technology scaling, radiation-induced soft error has been increasing in VLSI systems. Designers have to consider the problem of reliability caused by soft errors. Selective hardening of vulnerable nodes in circuits using resilient registers is a prevalent solution, which can effectively reduce soft error rate of logic circuits. This paper gives a summary of some soft error immune registers, and then provides quantitative analysis and comparison in reliability of eight kinds of registers. The result concludes that temporal spatial dual modular redundancy structure shows better reliability. The existent reliable registers brings about great overhead that cannot be avoided, so this paper designs a timing shift-based Dynamic Master Temporal Spatial - Dual modular redundancy Register (DMTS-DR). The experiment results show that the proposed register is not only able to immunize SEUs in itself, but can also mask SETs propagated from combinational logic efficiently. Compared to other reliable registers, area overhead and delay penalty of DMTS-DR have been reduced greatly. DMTS-DR has better tradeoff among reliability, area and speed.]]></description>
<pubDate>2012/11/8 3:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Yan,GAO Changlei,LI Shaoqing and ZHANG Minxuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Yan,GAO Changlei,LI Shaoqing and ZHANG Minxuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905003]]></guid><cfi:id>325</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and Evaluation of a Data Streams TransmissionControl Engine Customized for Heterogeneous MC-DSPs]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper introduces a large-scale parallel MC-DSP prototype, PolyDSP constructed with heterogeneous super-nodes, and proposes a data speculation technique based on customized data streams transmission control engine (DSTCE). This technique implements high efficient data streams transmissions among different data ports within a super-node and transmissions between neighbor super-nodes. The superiority of this technique is that it can combine a data speculation solution with the programming model of PolyDSP, avoid complex cache coherence problems, thus improving the parallelism between data processing and memory accessing for MC-DSPs significantly. Our simulation results show that, the performance of single super-node of PolyDSP is improved by 22% on average, and the performance of PolyDSP based on DSTCE is 14% higher than that of PolyDSP based on CC-NUMA structure with two super-nodes.]]></description>
<pubDate>2012/11/8 3:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Dong and CHEN Shuming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Dong and CHEN Shuming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905004]]></guid><cfi:id>324</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[ADTA-1：An Embedded Heterogeneous Dual-core Microprocessor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to resolve the power problem, this paper presents the design and implementation of an embedded heterogeneous dual-core microprocessor (ADTA-1), taking advantage of the low power feature of asynchronous circuits and the Data Triggered Architecture. Through testing, the asynchronous microprocessor is validated with its low power feature in multicore microprocessor, which provides a useful trial for future design of low-power asynchronous multicore microprocessors.]]></description>
<pubDate>2012/11/8 3:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Fangyuan,SHI Wei,REN Hongguang,WANG Yourui,WANG Zhiying and LU Hongyi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Fangyuan,SHI Wei,REN Hongguang,WANG Yourui,WANG Zhiying and LU Hongyi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905005]]></guid><cfi:id>323</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[FPGA-based Smith-Waterman Algorithm Acceleratorwith Backtracking]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The Smith-Waterman algorithm accelerator with backtracking, which has not been implemented in hardware before, is designed and implemented on FPGA platform with systolic array by storing the path data into DRAM. The key techniques of backtracking design and the architecture of algorithm accelerator are discussed in detail. Compared with the conventional scheme, the FPGA-based accelerator with backtracking is more effective, with the acceleration reaching 161.]]></description>
<pubDate>2012/11/8 3:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZOU Dan,DOU Yong,XIA Fei and NI Shice]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZOU Dan,DOU Yong,XIA Fei and NI Shice</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905006]]></guid><cfi:id>322</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design of Asynchronous Pipelines for Low-powerMicroprocessor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As the CMOS technology enters the deep submicron design era, the richness of the computational resources brings about a lot of problems, such as clock distribution, clock skew and high power dissipation. Asynchronous circuit style is an efficient approach to solve the problems, and it is becoming significantly attractive to the designers. The design of asynchronous pipelines is a very important issue in the process of designing asynchronous microprocessors. In this paper, various pipeline structures are summarized and their asynchronous equivalents are presented, and then an asynchronous flow is proposed, aiming at speeding up the asynchronous circuit design. Finally, the flow is used to design several asynchronous pipelines. The experimental results show that the asynchronous technique can reduce the power consumption of microprocessor effectively.]]></description>
<pubDate>2012/11/8 3:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Wei,WANG Yourui,CHEN Fangyuan,REN Hongguang,LU Hongyi and WANG Zhiying]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Wei,WANG Yourui,CHEN Fangyuan,REN Hongguang,LU Hongyi and WANG Zhiying</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905007]]></guid><cfi:id>321</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Memory Hierarchy and Load Balance Strategyin Heterogeneous System Based on GPU]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Owing to the revolution of GPU architecture and improvement of developing platforms, GPU is widely used in scientific computing nowadays. Relationships among GPU architecture, programming model and memory hierarchy are illustrated by analyzing memory hierarchy and exploring key performance features of GPU. Three basic load balance strategies on mapping applications onto GPU are presented: Prefetch, stream computing, task division. The effective relationships among different factors and optimization efficiency are tested and exposed by experiments.]]></description>
<pubDate>2012/11/8 3:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MA Anguo,CHENG Yu,TANG Yuxing and XING Zuocheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MA Anguo,CHENG Yu,TANG Yuxing and XING Zuocheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905008]]></guid><cfi:id>320</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Application-specific Buffer Allocation Algorithmfor Network-on-chip]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The networks-on-chip(NOC) approach was proposed as a promising solution to on-chip communication problems, but it is by far more resource limited. The input buffers in a typical on-chip router take a significant portion of the silicon area of NOC, and the performance of a NOC is drastically affected by the amount of buffering resources. In this paper, an application-specific buffer planning algorithm that can be used to customize the router design in NOC is presented. More precisely, given the mapping of the target application and the traffic characteristics, the algorithm automatically assigns the buffer depth for each input channel, in different routers across the chip. The experimental results show that the system buffering resources can be utilized more effectively. In contrast with the uniform buffer allocation, about 50% saving in buffering resources can be achieved by automatic buffer allocation using our algorithm without any reduction in performance.]]></description>
<pubDate>2012/11/8 3:52:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YIN Yaming,CHEN Shuming,SUN Shuwei and WANG Yaohua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YIN Yaming,CHEN Shuming,SUN Shuwei and WANG Yaohua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905009]]></guid><cfi:id>319</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A New Framework for Semantic Shot Representation andEvent Query of Soccer Video]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In this paper, a semantic shot representation and event query framework for soccer video is proposed. In this framework, various semantic shots are defined and each shot can be described by five properties. In order to solve the problem in traditional event query, a user-defined event query method is also proposed, which utilizes the Semantic Shot Composite Petri-Nets. Based on the representation of the semantic shot, users can define their favorite events by Petri-Nets. The experiment conducted shows that the query method can greatly improve the query efficiency and adjust self-adaptive as the broadcaster varies, but this method requires users to have enough professional knowledge. Experiment data set includes Germany World Cup 2006, English Premier League and Spanish First Division.]]></description>
<pubDate>2012/11/8 3:52:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[BU Jiang,LAO Songyang,LIU Haitao and GUO Jinlin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>BU Jiang,LAO Songyang,LIU Haitao and GUO Jinlin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905010]]></guid><cfi:id>318</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Fast Directional Lapped Transform Based Image Compression]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Traditional discrete cosine transform (DCT) can only sparsely represent the horizontal and vertical edges in images, and the computation complexity of directional prediction DCT (DPDCT), which is of ability to represent more directions, is much higher. To overcome these shortcomings, the fast directional lapped transforms (FDLT) is proposed, in which the transform is performed on the predefined direction mode and the energy in edges lying across blocks is compacted further. In Comparison with DPDCT, FDLT needs no interpolation. So FDLT can sparsely represent the anisotropic edges in images much faster. Furthermore, special lifting algorithm is designed to ensure the perfect reconstruction. The computation of FDLT is no more than 2 times of DCT's. Coding with the same set partition method, PSNR of images compressed with FDLT is 0.5dB higher than that with DCT. FDLT based compression also achieves clearer edges and details in the reconstructed images.]]></description>
<pubDate>2012/11/8 3:52:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Bo,CHENG Lizhi and WANG Hongxia]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Bo,CHENG Lizhi and WANG Hongxia</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905011]]></guid><cfi:id>317</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Functional Dependencies with Built-in Predicates andIts Axiomatization]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The increasing demand for data quality technology has motivated revisions of classical dependencies to capture more inconsistencies in       real-life data. A class of integrity constraints, referred to as functional dependencies with built-in predicates (PFDs), is proposed for relational databases and their axiomatization is investigated. In contrast to traditional functional dependencies (FDs) developed mainly for schema design, PFDs generalize the notions of FDs to apply to subsets of relations specified by constraints in the context of interpreted data, and aim at capturing the consistency of data by enforcing bindings of ranges of semantically related values. For the implication analysis of PFDs, which is to decide whether or not a set of PFDs entails another PFD, we provide an inference system analogous to Armstrong's axioms for FDs, and prove the soundness and completeness of the inference system. This work is a step towards a practical constraint-based method for improving data quality since inconsistencies and errors in databases often emerge as violations of integrity constraints.]]></description>
<pubDate>2012/11/8 3:52:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Yanli,ZHANG Weiming,XIAO Weidong,TANG Daquan and TANG Jiuyang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Yanli,ZHANG Weiming,XIAO Weidong,TANG Daquan and TANG Jiuyang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200905012]]></guid><cfi:id>316</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A 0-1 Integer Programming Based Approach forGlobal Data Distribution]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200904013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Data distribution is one of the key factors that affect the performance of programs running on distributed memory multiprocessors. This paper presents a 0-1 integer programming based approach for effective data distribution using data transformation techniques. This approach uses data transformations to change memory layouts and hence makes effective data distribution possible. Moreover, it also uses data distribution graphs to describe how programs are parallelized and how arrays are accessed, and transforms global data distribution problems into the problems of finding optimal paths in data distribution graphs. Therefore, 0-1 integer programming can be used to solve optimal path problems. The approach can effectively distribute multidimensional arrays with affine subscripts accessed in multiple loop nests and can exploit the parallelisms of loop nests as much as possible. In addition, it can also solve offset alignment problems. Thus data communication overheads can be reduced as much as possible. The experimental results show that the approach presented in this paper is effective.]]></description>
<pubDate>2012/11/8 3:52:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIA Jun,PANG Zhengbin,ZHANG Jun and LI Yongjin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIA Jun,PANG Zhengbin,ZHANG Jun and LI Yongjin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200904013]]></guid><cfi:id>315</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Radix Cluster Join Optimization Based on Shared CacheChip Multi-processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200904014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on Chip Multi-Processor(CMP), this paper presents optimization of cluster join in Radix-Join algorithm. In order to solve the problem of serious cache may miss during the multithreaded cluster join execution, and to improve the performance of cache access, we adopt preload thread to read the clusters whose thread will access from memory to L2-Cache. Furthermore, based on the cost model of cluster join execution, the framework of cluster join execution and various thread parameters have been optimized. In the experiments, we implement the algorithm in EaseDB. The results show that cluster join performance is improved.]]></description>
<pubDate>2012/11/8 3:52:17</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DENG Yadan,JING Ning,XIONG Wei and WU Qiuyun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DENG Yadan,JING Ning,XIONG Wei and WU Qiuyun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200904014]]></guid><cfi:id>314</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Computer Network Attack Modeling Based onAttack Graph]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200904015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the development of the intrusion technology and the uncertainty, complexity and diversity character of the network attack, the next direction will be characterized as large scale, collaboration and multilayered. As a result, modeling of network attack has been the focus of attention. In the current study, firstly, the research background of modeling of network attack and the concept of attack graph are presented. Then the represented network attack graph generating method and its algorithmic complexity are discussed. Finally, the application of network attack graph is given. In conclusion, some major problems and research trends in this area are addressed.]]></description>
<pubDate>2012/11/8 3:52:17</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Guoyu,WANG Huimei,CHEN Zhijie and XIAN Ming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Guoyu,WANG Huimei,CHEN Zhijie and XIAN Ming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200904015]]></guid><cfi:id>313</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Review on Several Clustering Methods in Protein-proteinInteraction Network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200904016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Protein-protein interaction network is one of the research hotspot in post-genome era. Several representative methods of clustering in   protein-protein interaction network are reviewed.  The characteristics of the methods are summarized and the difficulties and challenge are discussed. Finally, the development prospect is proposed.]]></description>
<pubDate>2012/11/8 3:52:17</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Zhenghua,DONG Yunyuan and WANG Yongxian]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Zhenghua,DONG Yunyuan and WANG Yongxian</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200904016]]></guid><cfi:id>312</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Coverage-preserved Minimum Deployment in WirelessSensor Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Most sensor deployments so far scarcely consider the non-uniform energy consumption in wireless sensor networks. As a result, considerable energy is wasted and energy utilization is low when networks fail. Therefore minimum nodes deployment problem is raised, which is subject to coverage and networking lifetime threshold. Motivated by delivery characteristics in wireless sensor networks, two solutions, nodes decreasing placement and density decreasing deployment, are presented, aiming at high energy utilization and minimum residual energy. Compared with the existing deployments, the two novel schemes deploy less sensor nodes, maintain less energy when nodes fail. Simulations reveal that energy efficiency of two schemes nearly reaches    3～4 times of the existing solutions.]]></description>
<pubDate>2012/11/8 3:52:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WEN Jun<sup>1</sup>,DOU Qiang<sup>1</sup>,JIANG Jie<sup>1</sup>,SONG Lei<sup>1,2</sup> and DOU Wenhua<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WEN Jun<sup>1</sup>,DOU Qiang<sup>1</sup>,JIANG Jie<sup>1</sup>,SONG Lei<sup>1,2</sup> and DOU Wenhua<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903016]]></guid><cfi:id>311</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[UCDL—A Ubiquitous Component Definition Language for PervasiveComputing-oriented Applications]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Because of the requirement of software reuses determined by adaptability, the component model has become an ideal choice of software architecture in research of pervasive computing. To abstract the characteristics of components precisely in the pervasive computing-oriented environments, as a part of research in a self-adaptive pervasive computing-oriented software platform UbiStar, a component definition language UCDL is presented. The design of UCDL refers to the manner of using IDL3 and CIDL to abstract the characteristics of components in CORBA Component Model. In the end, an example of the application of UCDL is also presented.]]></description>
<pubDate>2012/11/8 3:52:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Hui<sup>1</sup>,DING Bo<sup>1</sup>,SHI Dianxi<sup>1</sup> and LIU Ming<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Hui<sup>1</sup>,DING Bo<sup>1</sup>,SHI Dianxi<sup>1</sup> and LIU Ming<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903017]]></guid><cfi:id>310</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Discriminative Feature Selection for Fast Face Recognition]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to speed up the face recognition algorithm under the condition of keeping high accuracy, a discriminative feature selection algorithm is proposed to handle multi-class face recognition problems. It is supported by vector machine to select features and employ total probability rule to integrate feature selection and multi-class classification into an integral frame. The experiment on the face databases of UMIST and FERET displays that the proposed algorithm can effectively select the features which have obvious physical meanings, thus speeding up the response of classifier without degrading the generalization performance.]]></description>
<pubDate>2012/11/8 3:52:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WEN Yimin<sup>1,2</sup> and FAN Zhigang<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WEN Yimin<sup>1,2</sup> and FAN Zhigang<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903018]]></guid><cfi:id>309</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Rule-based Approach for Maintenance of OWL-S Ontology Syntactic Consistency]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The maintenance of OWL-S ontology syntactic consistency is very important in the evolution of semantic web services. In this paper, the differences between OWL-S and domain ontology are analyzed, and a maintenance framework is proposed to guide engineers to maintain the syntactic consistency of   OWL-S. After the elementary changes of OWL-S are defined and abstracted, the change relation matrix is given to define the dependency between them, then, an algorithm to generate potential changes based on relation matrix is shown, and the time complexity of this algorithm is also analyzed. The syntactic consistency rules of OWL-S are divided into two types: mandate rules and optional rules while the descriptions and formal definitions of these rules are also given. In so doing, the agent can check these rules automatically, and help engineers to maintain the syntactic consistency of OWL-S ontology.]]></description>
<pubDate>2012/11/8 3:52:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[BAO Aihua,ZHANG Weiming,YUAN Jinping and YAO Li]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>BAO Aihua,ZHANG Weiming,YUAN Jinping and YAO Li</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903020]]></guid><cfi:id>308</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Multidimensional Indexing for Data Sets of Point andInterval Dimensions]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Data sets of point and interval dimensions are important in spatial database system and GIS. This paper proposes an index structure PI-tree for the data sets of point and interval dimensions, based on an analysis of R<sup>*</sup>-tree and SS-tree, of which the former is used to demarcade multidimensional space of data set using hyper-sphere with the aim of improving accessing and reducing the I/O times of inserting data. Furthermore, the algorithm of insertion, deletion and retrieval of PI-tree is also presented. Finally, the analysis and results of  experiment show that PI-tree outperforms R<sup>*</sup>-tree.]]></description>
<pubDate>2012/11/8 3:52:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Chong,TANG Jiuyang,DAI Changhua and XIAO Weidong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Chong,TANG Jiuyang,DAI Changhua and XIAO Weidong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903021]]></guid><cfi:id>307</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Properties of Preimage Distributions of Perfect Nonlinear Functions]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Perfect nonlinear functions are widely used in the  design and analyses of cryptosystem. Based on the method of algebraic number theory, the properties of preimage distributions of perfect nonlinear functions over finite abelian group are studied.  Necessary conditions for the existence of perfect nonlinear functions over finite abelian group are presented, which proves that there are no perfect nonlinear functions for some abelian groups. Finally, the preimage distributions of perfect nonlinear functions over some prime fields are presented.]]></description>
<pubDate>2012/11/8 3:52:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Qiang<sup>1</sup>,LI Chao<sup>1,2</sup> and FENG Keqin<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Qiang<sup>1</sup>,LI Chao<sup>1,2</sup> and FENG Keqin<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200903026]]></guid><cfi:id>306</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Design of Kylin Operating System's HierarchicalKernel Structure]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Kylin is a server operating system focusing on high performance and security. In this paper,  a hierarchical kernel structure for Kylin operating system is proposed. Under this structure, Kylin is organized into two layers. The basic kernel layer is responsible for initializing the hardware and providing basic memory management and task management while the system service layer is based on FreeBSD providing UFS2 file system and BSD network protocols. In terms of this conception, the motivation for this novel hierarchical operating system kernel model is discussed. Then the kernel's infrastructure is introduced. Last, the performance comparison of Kylin, Redhat 9.0 and FreeBSD 5.3 with standard benchmarks is presented. Finally, a discussion of the future directions of Kylin operating system is made.]]></description>
<pubDate>2013/1/31 4:04:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Qingbo,DAI Huadong and WU Quanyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Qingbo,DAI Huadong and WU Quanyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902016]]></guid><cfi:id>305</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Single-event Transients in DifferentialVoltage-controlled Oscillators]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The responses of voltage-controlled oscillators (VCOs) to single-event transients (SETs) were investigated. A classic differential VCO with symmetrical loads was implemented in a 180nm bulk CMOS process. Modeling the charge deposition and collection from ion strikes as a current source, the transient SET responses of this VCO were achieved by circuit-level simulation. Simulations and analysis indicated SET responses were not only dependent on incident energy and the frequency of oscillation, but also dependent on striking  time, which can increase the phase displacement by up to 300 degrees. Additionally, some nodes in the bias generation circuit are most sensitive to SET. Strikes in these nodes were amplified and resulted in an approximate 7 clock cycles distortion.]]></description>
<pubDate>2013/1/31 4:04:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Zhenyu,JIANG Renjie,ZHANG Minxuan,HU Jun and LI Shaoqing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Zhenyu,JIANG Renjie,ZHANG Minxuan,HU Jun and LI Shaoqing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902017]]></guid><cfi:id>304</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Constructions of High Degree Resilient S-boxes with High Nonlinearity]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The resilient S-boxes have applications in fault tolerant distributed computing, quantum cryptographic key distribution and random sequence generation for stream ciphers. Based on the use of linear error correcting codes together with highly nonlinear S-Boxes, a new construction of highly nonlinear resilient S-boxes with given degree is provided. A contribution of the construction is that the nonlinearity of the resilient S-boxes can be calculated with the parameter of the linear code. As a result, the construction provides currently the best results in  the aspect of nonlinearity.]]></description>
<pubDate>2013/1/31 4:04:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FU Shaojing,LI Chao and DONG Deshuai]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FU Shaojing,LI Chao and DONG Deshuai</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902018]]></guid><cfi:id>303</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Efficient Mixed-searching-based Algorithm forMining Top-K Most-frequent Patterns]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[It is significant to mine Top-K most-frequent patterns in dataset. The existing algorithms usually use the k-most frequent items as the initial items, and use the support of item with lowest frequency in initial items as the initial border support. In fact, since the number of items in Top-K most-frequent patterns is much less than k, the efficiency of the existing algorithms is restricted. To solve this problem, an efficient mixed-searching based algorithm for mining Top-K most-frequent patterns, MTKFP is presented. The algorithm firstly mines some short item sets by breadth-first searching, and uses short item sets to obtain the scope of the initial items (the number of initial items is less than k) and the higher initial border support; then it obtains all Top-K most-frequent patterns by depth-first searching. The experimental results show that the number of initial items of MTKFP is 70% lower than that of existing algorithms, and the initial border support of MTKFP is higher than that of existing algorithms. Hence the performance of MTKFP is superior to that of the best existing algorithm.]]></description>
<pubDate>2013/1/31 4:04:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[AO FuJiang<sup>1</sup>,DU Jing<sup>2</sup>,CHEN Bin<sup>1</sup> and HUANG KeDi<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>AO FuJiang<sup>1</sup>,DU Jing<sup>2</sup>,CHEN Bin<sup>1</sup> and HUANG KeDi<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902019]]></guid><cfi:id>302</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Theoretical and Experimental Proof That 2D ChaoticArrays Are Permutation Groups]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Group theory is a sort of strong mathematics tool for the researches of the symmetry property. Chaos is the internal randomicity put up by the definite non-linear dynamical system. It has several properties, including the limitary, the nonperiodic and the dependence on initial condition and parameters. The discrete sequences produced by chaos system are often used to encrypt data such as digital pictures. In former papers, the relationship of Group theory and Chaotic system has seldom been studied. In this paper, it proves the result that the scrambling transform of two-dimensional chaotic scrambling arrays will form permutation groups. It is proposed on the basic theory of Group and Chaos and is proved in theoretical and experiment ways. According to the result, it is demonstrated invalid to use two-dimensional chaotic scrambling arrays created by different chaotic system and different initial values to encrypt multimedia data such as digital images and videos.]]></description>
<pubDate>2013/1/31 4:04:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DING Wenxia,WANG Hao and LU Huanzhang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DING Wenxia,WANG Hao and LU Huanzhang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200902020]]></guid><cfi:id>301</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Energy-efficient Data Dissemination Algorithms for ANY-type Queries in Large-scale WSN]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Striking a better balance between the push and pull of the event data is the key factor to the energy saving for the data dissemination algorithms in wireless sensor networks(WSNs). Two typical structured and unstructured data dissemination algorithms (DCS and CN) are analyzed first. By incorporating the push-pull strategies of the two algorithms, two new algorithms(SDC1 and SDC2) are proposed for the ANY-type queries in the different application situation in WSNs. They have resolved the problems of the high load of the hotspot, the large number of the event data replicas and the low energy efficiency of queries on the premise that it may ensure the balance between the push and pull. Results from the analysis indicate that they are much more appropriate for the WSNs which are large-scale and have large volume of data to be dealt with, and they are two energy-efficient data dissemination algorithms.]]></description>
<pubDate>2012/11/8 3:52:58</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAO Zijin,LI Sudan,XU Jinyi and GONG Zhenghu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAO Zijin,LI Sudan,XU Jinyi and GONG Zhenghu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901013]]></guid><cfi:id>300</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Smooth Texture Mapping Based on Moving Least Squares for Image Deformation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper proposes a quadric fitting polynomial texture mapping model based on moving least squares. The proposed model is mainly applied in image deformation techniques using control meshes. The shape in the image is firstly embedded into a control mesh which is deformed. Then the deformed shape is rendered by using texture mapping on the control mesh. Displaces of the vertices in the control mesh are treated as known function values. The MLS method is used to compute the quadric function for texture mapping. Compared with texture mapping using linear function, the method proposed can greatly improve the smoothness of the texture mapping function, and the deformation result is more natural and physically plausible.]]></description>
<pubDate>2012/11/8 3:52:58</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Yanzhen<sup>1</sup>,PENG Ge<sup>2</sup> and XIONG Yueshan<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Yanzhen<sup>1</sup>,PENG Ge<sup>2</sup> and XIONG Yueshan<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901014]]></guid><cfi:id>299</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Iteratively Bargaining-based Strategy for OptimizingService Composition Execution Path]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Quality of service(QoS) is a critical research issue in optimizing service composition execution path. Unfortunately, the currently existing methods ignore the hidden competition pressure between service providers which can push them to dynamically change their initial QoS values in that the initial optimal execution path can be changed. To address this isssue, an iteratively bargaining-based constraint correction strategy is proposed. With this  method, an initial execution path for a service composition is firstly built by using the local optimization policy. Based on this path, the global QoS aggregating and checking models are used to determine all occurred QoS constraint violations. For all violations, the proposed bargaining strategy can be recursively used to correct such violations. Finally, an optimized path can be rebuilt to meet the overall end-to-end QoS requirements expressed by a user.]]></description>
<pubDate>2012/11/8 3:52:58</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[REN Kaijun,SONG Junqiang,XIAO Nong and ZHANG Weimin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>REN Kaijun,SONG Junqiang,XIAO Nong and ZHANG Weimin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901016]]></guid><cfi:id>298</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Verifiable Visual Cryptography Scheme]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Visual cryptography is a cryptographic technique to achieve visual secret sharing. Shares are distributed to several participants and overlapping a number of shares can recover the original secret without any cryptographic computation. A verifiable visual cryptography scheme is proposed to verify whether the share is authorized by introducing the Third Trusted Party (TTP) whose action is guaranteed and the public key cryptographic infrastructure based on message identification model. The scheme solves the problem of dishonest distribution center to improve the security of visual cryptography schemes.]]></description>
<pubDate>2012/11/8 3:52:58</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HAN Yanyan<sup>1</sup>,WANG Suying<sup>2</sup>,HU Yupu<sup>1</sup> and HE Wencai<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HAN Yanyan<sup>1</sup>,WANG Suying<sup>2</sup>,HU Yupu<sup>1</sup> and HE Wencai<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901017]]></guid><cfi:id>297</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A CABAC Parallel Encoding Method for Multithreading]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The context-based adaptive binary arithmetic coder (CABAC) is the preferred entropy encoding method in the main profile of H.264/AVC, for it can offer more bit rate saving than other entropy coding methods. However, high computational complexity and poor parallelism make it unsuitable for  chip multicore processors application. A new CABAC parallel encoding method is  proposed for the troubleshooting. Results from experiments show that the proposed method can indeed strike a near balanced workload partition while achieving a peak speedup of 1.78 when solely applied.]]></description>
<pubDate>2012/11/8 3:52:59</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Shenggang,SUN Shuwei and CHEN Shuming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Shenggang,SUN Shuwei and CHEN Shuming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/200901020]]></guid><cfi:id>296</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multi-scale Edge Detection with Dominating Opponent Inhibition]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201006010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Noise suppression conflicts with high accuracy in image edge detection. A multi-scale edge detection model with dominating opponent inhibition was proposed from physiological point of view. The presented model made extension of dominating opponent inhibition mechanism to processing at multiple scales. Image noise can be adaptively suppressed by dominating inhibition from the opponent path of lateral geniculate nucleus. Sharp edges were obtained through the non-linear combination of simple cell subfields. Finally multi-scale processing results were combined to obtain boundary contour. Theoretical analysis and experimental results indicate that the proposed model performs well in noise suppression and accurate edge detection through the combination of dominating opponent inhibition and multi-scale processing. Meanwhile, it is biologically plausible, simple and efficient.]]></description>
<pubDate>2012/8/28 16:33:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MENG Xianglin and WANG Zhengzhi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MENG Xianglin and WANG Zhengzhi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201006010]]></guid><cfi:id>295</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Innovative Implementation Method of P2P Tracker]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201006011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Streaming media accounts for the majority of Internet traffic. P2P is an important method for streaming media distribution on the Internet. This paper proposes an innovative implementation method of P2P Tracker named eTracker. Peer lists are reserved in the numerous distributed eTrackers which locate in the edge network. Our design not only eliminates performance bottleneck of traditional centralized Tracker, but also optimizes peer selection in P2P system through the recognition of local peers.]]></description>
<pubDate>2012/8/28 16:33:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HUANG Jinfeng,ZHANG Ziwen and CHENG Gaowei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HUANG Jinfeng,ZHANG Ziwen and CHENG Gaowei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201006011]]></guid><cfi:id>294</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Distributed Maximum Spectrum Allocation Algorithm forWireless Cognitive Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Wireless cognitive network is regarded as one of the fundamental architectures of next generation wireless network. It can solve the key problem of increasing demand for spectrum and low spectrum utilization. By opportunistically accessing the temporal available spectrum, the spectrum utility can be increased tremendously. As the spectrum utility is mainly determined by the spectrum allocation scheme, how to efficiently allocate the spectrum is always one of the fundamental aspects of wireless cognitive research domain. We have proved that the optimal spectrum allocation problem under heterogeneous spectrum availability is NP hard. To solve the spectrum allocation problem efficiently, a new spectrum access approach was proposed which is based on the distributed maximum weighted independent set algorithm——DMWIS. The time complexity of this algorithm is O(V<sup>2</sup>/2). By detailed simulation, the algorithm can be finished within 3 rounds under 90% of the random network scenarios. The performance of this algorithm can reach 90% performance of optimal algorithm.]]></description>
<pubDate>2012/8/28 16:45:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Gang,LIU Lixia,LI Hongjian and XU Ming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Gang,LIU Lixia,LI Hongjian and XU Ming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005011]]></guid><cfi:id>293</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Performance Prediction and Analysis of Multi-core Cluster Systems By Parallel Simulation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A parallel simulation model for message passing applications on multi-core cluster systems was presented, then a parallel simulator MCPSim (Multi-core Cluster Parallel Simulator) was designed and implemented. MCPSim adopted a three-layer (i.e., Intra-CMP, Inter-CMP, and Inter-Node) message passing model in its functional and timing model. Furthermore, MCPSim implemented a profiling module to obtain message distribution percentage in the three layers. The current research selected several benchmark applications including PRIME,Jacobi3D, NPB IS and HPL to validate MCPSim. Results show that MCPSim is more accurate than BigSim in performance prediction and can be used in the performance analysis of message passing applications on multi-core cluster systems.]]></description>
<pubDate>2012/8/28 16:45:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Chuanfu,CHE Yonggang and WANG Zhenghua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Chuanfu,CHE Yonggang and WANG Zhenghua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005012]]></guid><cfi:id>292</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Table-based Space-filling Curve Generation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Space-filling curves are classical ways to reduce the dimensions of data. This paper first presents the mapping rules of the diagonal      space-filling curve. Unique curve which exists under the rules and the number of grids on each dimensionality is not constrained. Then a new conception about equipotential surface was given, and the relationship between the number of grids on different equipotential surface was dirived. Table-based space-filling curve generation algorithms on the basis of the realtionship were presented. It is found that the algorithms have low running time and high scalability.]]></description>
<pubDate>2012/8/28 16:45:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Guofu,DOU Qiang and DOU Wenhua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Guofu,DOU Qiang and DOU Wenhua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005014]]></guid><cfi:id>291</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Discussion of Producing and Influencing Mechanism of PsychologicalSuggestion Information Based on Video Superimposing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to satisfy the potential demand of exerting a subtle psychological influence on the people of opponent country in psychological warfare, an idea of psychological suggestion based on video superimposing  (PSBOVS) was proposed in this paper. The producing and influencing mechanism of suggestive information was analyzed from the psychology support and video basic. The model of psychological suggestion effect process based on video superimposing was presented. The video modeling and parameter analysis were carried out for information producing while psychology factors were considered. Then, the contents and forms of suggestive information were analyzed from the point of information received, noticed, understood and accepted. PSBOVS can provide the theoretical guidance and decision support on how to encode suggestive information and influence the psychology of people effectively.]]></description>
<pubDate>2012/8/28 16:45:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUO Xiaoyi,LAO Songyang and ZHANG Guohua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUO Xiaoyi,LAO Songyang and ZHANG Guohua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005026]]></guid><cfi:id>290</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Multiple and Multimodal Interaction in C2]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[More natural, effective and collaborative human-computer interaction is the request of human-computer environment in C2. In this paper, the elements of human-computer interaction in C2 were analyzed, and the concept model and system model of multiple and multimodal HCI were proposed. Based on the models, a prototype system was designed to accomplish the tasks of situation or intelligence analysis by two interaction channels, which are speech and       two-handed gesture based on multi-touch. The improvements of naturalness, efficient and collaboration for the prototype system were proved with experiment and questionnaire, and the results show that the multiple and multimodal interaction in C2 is effective.]]></description>
<pubDate>2012/8/28 16:45:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Guohua,LAO Songyang,LING Yunxiang and YE Ting]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Guohua,LAO Songyang,LING Yunxiang and YE Ting</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005027]]></guid><cfi:id>289</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[ITSON: A Mechanism for Intelligent Search Based onTopology Evolution in Peer-to-Peer Network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005028]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Efficient search in decentralized peer-to-peer systems is a challenging problem. An intelligent search mechanism based on topology evolution, named ITSON, is proposed. Each peer clustered with peers in similar interests into a community and chose important communities as logical neighbors based on the past queries. For a new arriving query, the most possible communities that have the query answers were selected according to topology evolution to send the query. With queries done, overlay network topology can be adjusted automatically with little cost. Simulations reveal that ITSON greatly improves the search efficiency and guarantees the search effectiveness.]]></description>
<pubDate>2012/8/28 16:45:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TANG Jiuyang,GE Bin,ZHANG Chong and TANG Daquan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TANG Jiuyang,GE Bin,ZHANG Chong and TANG Daquan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201005028]]></guid><cfi:id>288</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and Performance Analysis of an InterconnectInterface for Multi-Core Microprocessor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Parallelism is the most important way to improve the performance of computer. With the development of the integrated circuits' manufacture process, besides integrating more processor cores into one processor chip, building multi-way parallelism system through high-speed interconnect interface is the main method to increase the parallelism of high-performance computer. A design scheme of an interconnect interface for    multi-core microprocessor was proposed. The proposed interface was based on a simplified PCI Express bus protocol and adopted the technology of high-speed serial data transferring. Cache coherence packet and large block data transfer packet were all supported. The interface can be used for connecting four processor nodes directly. Simulation results show that the max valid bandwidth per interface can reach 64Gbps and the minimum transfer delay is 120ns. The balance of the bandwidth and the transfer delay is reached, meeting the requirement of transferring different type of packets.]]></description>
<pubDate>2012/9/6 8:52:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Hongwei<sup>1,2</sup>,DENG Rangyu<sup>1</sup>,DOU Qiang<sup>1</sup>,QI Shubo<sup>1</sup> and SHEN Changyun<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Hongwei<sup>1,2</sup>,DENG Rangyu<sup>1</sup>,DOU Qiang<sup>1</sup>,QI Shubo<sup>1</sup> and SHEN Changyun<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004017]]></guid><cfi:id>287</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Ship Thermodynamic System RMS SimulationArgumentation Based on Feasible Using Schemes]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Because of complexity related to operation, maintenance, support and malfunction of ship steam power system, establishing math analytical model cannot satisfy the RMS argumentation demand. Based on the minimal equipment listing, Monte Carlo simulation method is not fit for system failure criterion either. The current research utilized feasible using schemes based on thermal model instead of minimal equipment listing based on logic relation. According to whether there were feasible using schemes when system partial equipment faulted, the research designed ship thermal system RMS simulation flow based on feasible using schemes. The ship thermal system RMS software was programmed based on improved simulation flow. Calculation examples demonstrated that the improved flow can satisfy the simulation precision, and the calculation efficiency is also improved.]]></description>
<pubDate>2012/9/6 8:52:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Rui,JIN Jiashan and LIU Longbo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Rui,JIN Jiashan and LIU Longbo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004018]]></guid><cfi:id>286</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Panoramic Unwrapping Interpolation Method of OmnidirectionalImages Based on Bidirectional Mapping]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Original omnidirectional images usually need to be unwrapped to cylindrical panoramic images according to human visual habits because of concentric annular distortion. According to the characteristics of catadioptric omnidirectional imaging, an interpolation method for panoramic unwrapping based on bidirectional mapping was proposed. The coordinate mapping relationships were obtained by tracking optical path. Firstly, each pixel in the target cylindrical panoramic image was projected backward onto the original omnidirectional image, and the neighboring pixels for interpolation were located. Then, all the neighboring pixels were projected forward onto the cylindrical panoramic image, and the color value of the target pixel was interpolated by using inverse distance weighted method or 3D-plane interpolation method due to the scattered distribution of the neighboring pixels in cylindrical panoramic images. The proposed method avoids the adverse effect on computing the interpolation weight of neighboring pixels caused by the nonlinear distortion, and the neighboring pixels for interpolation are also accurately located. The experimental results indicate that the proposed method is effective for enhancing the precision of interpolation and the image quality of unwrapped panoramic images.]]></description>
<pubDate>2012/9/6 8:52:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Lidong<sup>1</sup>,WANG Wei<sup>1</sup>,HE Lin<sup>2</sup> and CHEN Wang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Lidong<sup>1</sup>,WANG Wei<sup>1</sup>,HE Lin<sup>2</sup> and CHEN Wang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004019]]></guid><cfi:id>285</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research of CGF Agent Decision-making ModelingBased on Prospect Theory]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Prospect Theory (PT) describes the rules of individual's decision-making under uncertainty, which can well characterize decision-makers' risk preference. PT has certain valuable feasibility and applicability in operational decision-making modeling. Based on PT, a method of CGF Agent decision-making modeling was proposed. The Computer Generated Forces (CGF) Agent framework was presented. The detailed description of concrete process and algorithm for course of action (COA) selection in Agent decision-making was also given. The experiment shows that the proposed method has good performance and can improve the authenticity of CGF Agent's decision-making behavior.]]></description>
<pubDate>2012/9/6 8:52:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Jiwen,YIN Quanjun,FENG Lei,DENG Haijun and ZHA Yabin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Jiwen,YIN Quanjun,FENG Lei,DENG Haijun and ZHA Yabin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004024]]></guid><cfi:id>284</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Square Attack on Some Special Feistel Ciphers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004025]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Securities of two special Feistel ciphers with SP-structured round functions against Square attack were studied. By changing the position of P permutation of the round functions in an equivalent manner, some new cryptanalytic results of round-reduced SNAKE(2) and CLEFIA were presented. Time complexity of Square attack against 6-round SNAKE(2) was reduced from 2<sup>24</sup> to 2<sup>13.4</sup>, and for 6-round CLEFIA, time complexity of Square attack was reduced from 2<sup>34.4</sup>to 2<sup>12.4</sup>. The results show that, in designing Feistel ciphers with    SP-structured round functions, influence of equivalent structures and Square attack should be taken into consideration.]]></description>
<pubDate>2012/9/6 8:52:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Peng<sup>1</sup>,SUN Bing<sup>1</sup> and LI Chao<sup>1,2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Peng<sup>1</sup>,SUN Bing<sup>1</sup> and LI Chao<sup>1,2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004025]]></guid><cfi:id>283</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Algebraic Structure of Information and InformationSpace Based on Ontology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For achieving information resource service in the specific information field based on organizations of information, more appropriate and more formal description of information and information space is needed. The mathematic definition of information, information operations, relationship of information and information space based on ontology, and their algebraic structure were studied. So a theoretical support was provided for information resource service in the specific information field.]]></description>
<pubDate>2012/9/6 8:52:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Xiaorong<sup>1</sup>,LI Jianping<sup>1</sup>,HUANG Hongbin<sup>2</sup>,WU Qiang<sup>1</sup> and HUANG Jianhua<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Xiaorong<sup>1</sup>,LI Jianping<sup>1</sup>,HUANG Hongbin<sup>2</sup>,WU Qiang<sup>1</sup> and HUANG Jianhua<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004026]]></guid><cfi:id>282</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Information Resource Focusing Mathematical Model Besed onSaturation Information Dimension]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The increasing or decreasing technology of the saturated information dimension was applied to decompose and analyze the structure of information acquisition subspace one, and the acquisition of the value of saturated information dimension was divided into two parts—White and Grey. The saturation information dimension was used as the correlative order, applied to describe the grey correlative space, and the correlative oder was used to describe the correlative degree between information, thus obtaining a new mathematical model focusing on information resource.]]></description>
<pubDate>2012/9/6 8:52:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Qiang<sup>1</sup>,LI Jianping<sup>1</sup>,HUANG Hongbin<sup>2</sup>,HU Xiaorong<sup>1</sup> and HUANG Jianhua<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Qiang<sup>1</sup>,LI Jianping<sup>1</sup>,HUANG Hongbin<sup>2</sup>,HU Xiaorong<sup>1</sup> and HUANG Jianhua<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004027]]></guid><cfi:id>281</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Clustering Method for Gene Expression Data Based onLinear Manifold]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004028]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Conventional clustering methods fail to obtain good clustering performances for gene expression data due to the inherent sparsity of data and the existence of noise. A new linear manifold clustering method was proposed to address this problem. The basic idea of this method is to search the line manifold clusters hidden in datasets and then fuse some of the line manifold clusters to construct higher dimensional manifold clusters. The method considers the orthogonal distance and the tangent distance as the linear manifold distance metrics, utilizes spatial neighbor information and takes the real gene expression profile as the transition vector. The experimental results show the superiority of this method over other competing clustering methods in terms of clustering accuracy and the anti-noise capability of this method. Moreover, the proposed method is able to obtain some clusters with significant biological meaning for Hela gene expression data. All these demonstrate the method proposed is suitable and valid for the gene expression data clustering.]]></description>
<pubDate>2012/9/6 8:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Gangguo,WANG Zhengzhi,WANG Guangyun,NI Qingshan and QIANG Bo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Gangguo,WANG Zhengzhi,WANG Guangyun,NI Qingshan and QIANG Bo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004028]]></guid><cfi:id>280</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[WZ Factorization for a Kind of Special Structured Matrix]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The kind of WZ factorizations is the basic mathematics theory for a series of parallel algorithms in solving linear systems. For the symmetric          p-tridiagonal matrix, the WZ factorization and its properties were proposed and proved. Furthermore, it also shows that the W-factor of the WZ factorization owns the character that the elements in itare real numbers when the real matrix is symmetric positive definite, and the factorization is unique when the elements in diagonal are positive real numbers.]]></description>
<pubDate>2012/9/6 8:52:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHONG Yan,WU Feng and LUO Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHONG Yan,WU Feng and LUO Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201004029]]></guid><cfi:id>279</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A New Algorithm for Connection in NoC and Redundancy Correction]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Network on Chip (NoC) adopts the packages exchanging interconnection framework for communications on chip. The interconnection problem of NoC can be abstracted as a minimal spanning forest problem in Manhattan plane. A new algorithm based on obstacle avoiding rectilinear Steiner minimal tree by changing the edge weights is proposed for the connection, an optimization method for interconnection redundancies removing is also proposed. Experiments show that the total connection length for NoC is minimized. So the traditional bus communication framework's disadvantages, such as long global connect delay, weak signal integrity may be eliminated.]]></description>
<pubDate>2012/9/6 8:52:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Yi<sup>1,2</sup> and DUAN Chenghua<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Yi<sup>1,2</sup> and DUAN Chenghua<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003013]]></guid><cfi:id>278</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Efficient Data Transformation Technique for MixedData Visualization]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[There are abundant mixed data sets with various types of attributes in application fields. However, most multivariate data visualizations are only effective with simplex one data type. As for mixed data sets, the visualizations of them are usually dissatisfied. We present a data transformation technique for mixed data sets involving both numerical and categorical attributes. Firstly, every numerical attribute was categorized by clustering; then, all categorical attribute was quantified by Correspondence Analysis; finally, the transformed mixed data were presented in numerical data visualizations like Star Coordinates. Furthermore, aiming at those mixed data sets that have many attributes or the cardinality which is high, a set of cardinality reduction strategies were proposed to diminish the attributes number involved in computation to improve computational efficiency. Empirical studies show that the visualization of mixed data sets is easily-understandable and propitious for the user to discover the connotative information within; and that cardinality reduction strategies are highly memory-saving and time-efficient.]]></description>
<pubDate>2012/9/6 8:52:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Yang,FENG Xiaosheng,ZHOU Cheng,TANG Daquan and XIAO Weidong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Yang,FENG Xiaosheng,ZHOU Cheng,TANG Daquan and XIAO Weidong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003016]]></guid><cfi:id>277</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[SSI，a Worm Propagation Model Based on the Analysis of theTwo-stage Infection]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Logical worm propagation model can characterize how the worm-like malicious code spreads in network exactly, which contributes the analysis of worm propagation mechanism in depth to engaging in the study of worm defense, detection and containment. The significance of infection time is often neglected in worm propagation models based on classic epidemic model. By introducing and analyzing infection time, a worm propagation model called SSI is derived using deterministic modeling methods. This model reflects the possible state-transition of vulnerable hosts during worm propagation, and results in a better understanding and modeling of the propagation of Internet worms.]]></description>
<pubDate>2012/9/6 8:52:15</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Bo<sup>1</sup>,LIU Ming<sup>2</sup>,XIAO Fengtao<sup>1</sup> and PENG Lei<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Bo<sup>1</sup>,LIU Ming<sup>2</sup>,XIAO Fengtao<sup>1</sup> and PENG Lei<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003017]]></guid><cfi:id>276</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Integral Attack on PUFFIN and PUFFIN-like SPN Cipher]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[PUFFIN is a block cipher with 64-bit block size and 128-bit key size. For evaluating its security, the balance at bit-level was analyzed.       A 5-round integral distinguisher was constructed and then extended to a 6-round one based on the theory of higher order integral. By using the 6-round distinguisher, 8-round attack was performed. For 8-round attack, the data complexity, time complexity and space complexity were,  and respectively. The result shows that PUFFIN reduced to 8 rounds is not immune to the integral attack. Besides, the cipher with SPN-structure and permutation-linear layer which at least has 3-round integral distinguisher is proved. The result also indicates the method for finding the distinguisher.]]></description>
<pubDate>2012/9/6 8:52:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WEI Yuechuan<sup>1</sup>,SUN Bing<sup>2</sup> and LI Chao<sup>1,2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WEI Yuechuan<sup>1</sup>,SUN Bing<sup>2</sup> and LI Chao<sup>1,2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003026]]></guid><cfi:id>275</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Proof and Count of a Family of Perfect Nonlinear Functions]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A new class of perfect nonlinear binomials was just found by Helleseth et al, which are the first perfect nonlinear binomials composed with two inequivalent monomials. We transformed the class of perfect nonlinear binomials to another form, and gave a concise proof for their perfect nonlinearness. It shows that this family of binomials is equivalent to . Furthermore, the calculation of the count of this family of functions is presented as well.]]></description>
<pubDate>2012/9/6 8:52:16</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Ping,ZHOU Yue and LI Chao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Ping,ZHOU Yue and LI Chao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201003027]]></guid><cfi:id>274</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A High Performance Pipeline Architecture of 128bitFloating-point Fused Multiply-add Unit]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201002011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[FMA(Fused Multiply-Add) with high precision is required in high performance microprocessors. A new 10 stages pipelined architecture of 128bit FMA is proposed. In this architecture, multiply, adder, LZA(Leading Zero Anticipator) and normalization with large width data-paths were partitioned and optimized carefully to balance the latency at every pipeline stage. After designed and synthesized with SMIC 0.13μm technology, the frequency of the FMA can reach 465MHz, which is about 130% better than previous 128bit FMA. Furthermore, its frequency can reach 1.075GHz with TSMC 65nm technology, which basically meets the requirements of the high performance computation.]]></description>
<pubDate>2012/9/19 9:01:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Tiejun,LI Qiuliang and XU Weixia]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Tiejun,LI Qiuliang and XU Weixia</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201002011]]></guid><cfi:id>273</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The s-BiCR Algorithm to Solve Nonsymmetric Linear Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201002012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the BiCR algorithm, s-BiCR algorithm　is proposed to solve nonsymmetric linear systems. Firstly, the basic computation frame for the s-BiCR was given by introducing the fundamental principle　in the new method and the solution approach to the parameters. Next, according to the analysis of the characters of the sequences of residual vectors and direction vectors, an approach is deduced to reduce computational volume for the parameters so that a more effective advanceds-BiCR is designed. Finally, the　correctness ofs-BiCR is proved, that is, the ith approximate solution froms-BiCR is equal to the isth approximate solution from BiCR. In addition, by performance analysis, the number of both synchronous communication and accessing memory fors-BiCR is less than the one for BiCR so the algorithm here　has better parallel feature and data locality. The effectivity and validity ofs-BiCR have been confirmed by experiments.]]></description>
<pubDate>2012/9/19 9:01:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHONG Yan,LUO Zhigang and WU Feng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHONG Yan,LUO Zhigang and WU Feng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201002012]]></guid><cfi:id>272</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Estimating Parameters of Lorenz Chaotic System with MCMC Method]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201002013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on Bayesian theorem, a method is proposed to estimate the unknown parameters of Lorenz chaotic system using Markov Chain Monte Carlo (MCMC) method. Firstly，the posterior probability density function for unknown parameters is deduced. Secondly, taking the posterior probability as the invariant distribution, the Adaptive Metropolis algorithm is used to construct the Markov Chains. Thirdly, the converged samples are used to calculate the mathematic expectation of the unknown parameters. The results of numerical experiments show that the parameters estimated by the new method have high precision and the noise is filtered effectively from observations at the same time.]]></description>
<pubDate>2012/9/19 9:01:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CAO Xiaoqun<sup>1</sup>,SONG Junqiang<sup>1</sup>,ZHANG Weimin<sup>1</sup>,CAI Qifa<sup>2</sup> and ZHANG Lilun<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CAO Xiaoqun<sup>1</sup>,SONG Junqiang<sup>1</sup>,ZHANG Weimin<sup>1</sup>,CAI Qifa<sup>2</sup> and ZHANG Lilun<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201002013]]></guid><cfi:id>271</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Video Semantic Content Analysis Using Extensions to OWL]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201002015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Due to the rapid increase in the amount of available video data, there has been a growing demand for efficient methods to understand and manage the data at the semantic level. In this paper, the V-OWL is proposed with extensions to OWL, which can describe complex video content including temporal-spatial and uncertain relationships. The B-Graph description model based on Bayesian Net is proposed to map the concepts and relationships in V-OWL ontology into the nodes and edges in B-Graph. Video semantic content can be discovered automatically by using existing training and reasoning methods of Bayesian Net. Results from experiments show that V-OWL has achieved good description of complex video content, and satisfactory precision and recall of high level semantic content detections.]]></description>
<pubDate>2012/9/19 9:01:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[BAI Liang,LAO Songyang,LIU Haitao,BU Jiang and CHEN Jianyun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>BAI Liang,LAO Songyang,LIU Haitao,BU Jiang and CHEN Jianyun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201002015]]></guid><cfi:id>270</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A General Memory Consistency Model Included I/O Operations]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Memory consistency research, as one of the core issues of computer architecture, mainly focused on the CPU access memory，while the consistency issues of DMA operations is seldom studied. According to the idea of integrating the architecture design of I/O and memory, the paper defines the concept of general program included I/O operations, aimed at the consistency issues of DSM (distributed shared memory) systems with global DMA operations. The paper studies the general memory consistency model, and builds the general scope consistency model. Based on the general scope memory consistency model, the Cache-Memory-I/O consistency protocol and its implement technology are studied. All this may help the global shared parallel I/O system design for DSM system.]]></description>
<pubDate>2012/9/19 9:01:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Qiong,DENG Mingtang and YANG Xuejun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Qiong,DENG Mingtang and YANG Xuejun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001013]]></guid><cfi:id>269</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Investigation of Single-event Transients in Charge Pumps]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Towards single-event transients (SETs) in charge pumps (CPs) for phase-locked loops (PLLs), the effects brought about by different frequency SETs induced currents are analyzed. Based on frequency domain analyses, the relation between loop parameters and SET response is investigated with respect to gain and bandwidth. The results reveal that decreasing the loop filter resistance to decrease the gain can significantly mitigate the SET induced voltage perturbation of the voltage-controlled oscillator's (VCO) control voltage, and that increasing the damping ratio or the nature frequency to increase the bandwidth can filter out more SET currents in a wider frequency range and effectively reduce the PLL recovery time. Therefore, decreasing the loop filter resistance, increasing the damping ratio or the nature frequency are effective radiation-hardened-by-design techniques. Eventually, the conclusions are validated by transistor-level simulations for a 1GHz PLL.]]></description>
<pubDate>2012/9/19 9:01:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Zhenyu,ZHAO Xueqian,ZHANG Minxuan,CHEN Jihua and LI Shaoqing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Zhenyu,ZHAO Xueqian,ZHANG Minxuan,CHEN Jihua and LI Shaoqing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001015]]></guid><cfi:id>268</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Attribute Reduction Algorithm Based on ConditionalEntropy under Incomplete Information System]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Knowledge reduction is an important issue in data mining. This paper focuses on the problem of attribute reduction in incomplete decision tables. Three types of incomplete conditional entropy are introduced based on tolerance relation, such as H′conditional entropy, E′conditional entropy, and I′conditional entropy, which are proved to be an extension  of the concept of conditional entropy in incomplete decision tables. Compared with H′and I′conditional entropy, E′ conditional entropy decreases monotonously with the　amount of attributes. Based onE′conditional entropy, a new reduced definition is presented, which integrates the complete and incomplete information systems into the corresponding reduced algorithm. Finally, the experimental result shows that this algorithm can find the reduct of decision tables.]]></description>
<pubDate>2012/9/19 9:01:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TENG Shuhua,ZHOU Shilin,SUN Jixiang and Li Zhiyong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TENG Shuhua,ZHOU Shilin,SUN Jixiang and Li Zhiyong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001017]]></guid><cfi:id>267</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Generic Framework of Two-dimension Abstraction forParameterized Systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To address the state explosion problem in model checking parameterized systems, this paper proposes a generic framework of two-dimension abstraction (TDA), in which the size of the state transition graph for individual process is reduced independently at first, and the whole system composed of reduced processes is then abstracted based on the design method of parameterized systems, thus avoiding the construction of the unreduced model that might be too big to fit into memory. Formal model with true concurrency semantics for parameterized systems, more suitable for describing general concurrency systems, is introduced, which effectively solves the problem of verifying both homogeneous and heterogeneous systems. Results from the theoretical reasoning and the example given demonstrate that TDA is correct and feasible.]]></description>
<pubDate>2012/9/19 9:01:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[QU Wanxia,PANG Zhengbin,GUO Yang,LI Tun and YANG Xiaodong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>QU Wanxia,PANG Zhengbin,GUO Yang,LI Tun and YANG Xiaodong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001018]]></guid><cfi:id>266</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Malicious Code Detection and Prevention in VirtualBehavior Mechanism]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Cohen proved that there was no algorithm that can perfectly detect all possible viruses. Malicious Code Detection and Prevention Model (MCDPM) is a behavior-based malicious code detection mechanism, and its purpose is to get rid of the limitation of Cohen's findings. MCDPM disassembles program behaviors into virtual behavior parts and actual behavior parts, and monitors the virtual behaviors as well as the results of these behaviors. MCDPM determines whether an executable is malicious by analyzing the virtual behaviors of a program. Since the determination is made upon unchangeable program behaviors, it has a low false positive rate and a low false negative rate as well. To those non-malicious programs, MCDPM will perform their behavior results really taken place in the platform by the actual behavior function, so that the consistency of system is assured. MCDPM is effective in detecting unknown malicious codes, and it also supplies an accurate approach to clean the viruses in the system. MCDPM can also be used to provide the assurance to the transitive trust mechanism in trusted computing platform technology.]]></description>
<pubDate>2012/9/19 9:01:35</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Xiaoyong<sup>1</sup>,ZHOU Litao<sup>2</sup>,SHI Yong<sup>1</sup> and GUO Yu<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Xiaoyong<sup>1</sup>,ZHOU Litao<sup>2</sup>,SHI Yong<sup>1</sup> and GUO Yu<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001019]]></guid><cfi:id>265</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Bioinformatics for Macro-structural and TopologicalProperties of Metabolic Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the field of bioinformatics, recently more and more researches are launched on the studies of the structure and topology of metabolic networks. We first review the progress for metabolic network reconstruction and representation. Then we look into the macro-structural and topological properties of metabolic networks which are meaningful for uncovering how metabolic networks evolve and why they are robust. Finally we expound our viewpoints on the current issues and the prospective studies in this field.]]></description>
<pubDate>2012/9/19 9:01:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Zhenghua and ZHOU Tingting]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Zhenghua and ZHOU Tingting</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001020]]></guid><cfi:id>264</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Organizing News Video Database Based on Stories with “MultiThreads”]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to incarnate “multithreading” of news event reporting, the paper studies the validity of graph theory for managing news video database. Firstly, news stories similarity and graph theory are studied for digesting complicated relations of all stories reporting the same event. Then, a method based on minimal spanning tree is presented for predigesting the similarity graph into a simple tree with                “multithreads”. Experiments show that the method is a research issue with great theoretical and pratical significance for browsing, searching and abstracting in news video database.]]></description>
<pubDate>2012/9/19 9:01:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WEN Jun<sup>1</sup>,WU Lingda<sup>2</sup>,ZENG Pu<sup>2</sup> and Xie Yuxiang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WEN Jun<sup>1</sup>,WU Lingda<sup>2</sup>,ZENG Pu<sup>2</sup> and Xie Yuxiang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001022]]></guid><cfi:id>263</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on Natural Gesture Recognition Method Based on Multi-touch]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A set of interaction handed-gestures were defined for Human-Machine Interaction (HMI) in command post according to the requirement of command tasks. Based on the statistical analysis of coordination relationship between touch points in the course of accomplishing the touch gestures, the current research designed a recognition method which is independent of hardware for these interaction handed-gestures. Finally, aimed at the definition and identification of interaction handed-gestures, some experiments had been tested on infrared multi-point touch table to verify the stability, validity and expansibility of this method.]]></description>
<pubDate>2012/9/19 9:01:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LING Yunxiang,ZHANG Guohua,LI Rui and YE Ting]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LING Yunxiang,ZHANG Guohua,LI Rui and YE Ting</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001024]]></guid><cfi:id>262</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[University Science and Technology Innovation CapabilityEvaluation of Research Teams]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Science and technology innovation capability is a key index of universities. This paper studies the theories and methods of science and technology innovation capability evaluating in view of research teams. It also analyzes the constituents and its structure of science and technology innovation capability. Furthermore, it defines an extensible evaluation index system from five aspects. This paper also proposes the evaluation method for science and technology innovation capability, based on Multiple Attribute Decision Making (MADM).]]></description>
<pubDate>2012/9/19 9:01:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Shulei<sup>1</sup>,SHEN Xueshi<sup>1</sup>,LV Wei<sup>2</sup> and HAN Yan<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Shulei<sup>1</sup>,SHEN Xueshi<sup>1</sup>,LV Wei<sup>2</sup> and HAN Yan<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201001026]]></guid><cfi:id>261</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Researching Data Center Networking Topology for Cloud Computing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Nowadays, the research work about data center networking (DCN) mainly focuses on the improvement of the topological properties of DCN. Unfortunately, it has been ignored whether the topologies of DCN are suitable for the cloud computing mechanisms running on DCN. To address this problem, a novel DCN topology for cloud computing was proposed. The effective method of running a mainstream cloud computing mechanism on the new topology was researched. The size and diameter of the new topology was analyzed. Simulation results demonstrate that the new topology is feasible for cloud computing.]]></description>
<pubDate>2012/9/12 11:15:09</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DING Zeliu,GUO Deke,SHEN Jianwei,LUO Aimin and LUO Xueshan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DING Zeliu,GUO Deke,SHEN Jianwei,LUO Aimin and LUO Xueshan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106001]]></guid><cfi:id>260</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Energy-efficient Multi-core Real-time Scheduling Algorithm Based on Dynamic Slack Reclamation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In many embedded real-time systems, the actual execution time of tasks is usually less than their worst-case execution time (WCET), which produces lots of dynamic slack time. Based on this fact, we proposed an energy-efficient real-time scheduling algorithm LRE-DVFS-ALL for sporadic tasks deployed on multi-cores, which is based on optimal online scheduling algorithm LRE-TL. The main idea of the algorithm is to reclaim dynamic slack time, during which DVFS techniques can be used to reduce the execution frequency of future tasks to eliminate the energy consumption. Meanwhile, our algorithm also dynamically scales the voltage and frequency at the initial time of each TL plane and the release time of a sporadic task in each TL plane to guarantee the optimal schedulability of sporadic tasks. Systematic mathematical analysis and extensive simulation results show that LRE-DVFS-ALL can always save more energy than the existing algorithms when the total workload of the system exceeds a threshold, and it can also guarantees the optimal schedulability at the same time.]]></description>
<pubDate>2012/9/12 11:15:09</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Dongsong<sup>1</sup>,GUO Deke<sup>2</sup>,CHEN Fangyuan<sup>1</sup>,WU Tong<sup>3</sup>,Wu Fei<sup>4</sup> and JIN Shiyao<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Dongsong<sup>1</sup>,GUO Deke<sup>2</sup>,CHEN Fangyuan<sup>1</sup>,WU Tong<sup>3</sup>,Wu Fei<sup>4</sup> and JIN Shiyao<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106002]]></guid><cfi:id>259</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Dynamic Resizing: Adaptive Optimization for Cache Leakage Power]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The power leakage covers more and more of the consumption of power, especially when the production of highly integrated circuit has reached the level of very deep submicron, thus it becomes the main source of the power leakage of the microprocessor. Power leakage is closely related to voltage, leakage current and the amount of transistors. Cache is the sizable fraction of the total microprocessor, and its leakage power optimization must be firstly considered in low power microprocessor design. Besides process improvement, the leakage power of caches can be adaptively reduced by monitoring and controlling its operating states at architectural level. In light of this idea, a dynamic resizing policy based on cache replacement algorithm was proposed. The cache was dynamically resized on-so-called logical way granularity according to cache operating states. Simulation results show that dynamic resizing policy can reduce cache leakage power by 76.6% without obviously performance drop, especially for high associative caches.]]></description>
<pubDate>2012/9/12 11:15:09</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Chengyi,GUO Wei and ZHOU Hongwei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Chengyi,GUO Wei and ZHOU Hongwei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106003]]></guid><cfi:id>258</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[ET: An Energy-efficient Processor Architecture for Embedded Tera-scale Computing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As criterions and algorithms evolve and become more complex, high performance embedded application demands the high performance and energy efficiency. The challenge, however, is how to turn the VLSI capability into the actual computing performance. This research proposed an energy efficient processor architecture named ET (Embedded Tera-scale Computing), which is composed of many lightweight VLIW processor cores, also named small cores. Each core executes a thread with the mechanisms for explicitly managing the data and instructions. ET uses a hierarchical data registers to reduce the cost of delivering data, and the asymmetric and distributed instruction registers to deliver the instructions. In order to further reduce the energy, ET employs non-deep pipeline and simple control flow and optimizes the execution of loop body of applications. The primary result shows that ET can achieve the 1TOPS performance and the 100GOPS/W efficiency when scaled to 40nm.]]></description>
<pubDate>2012/9/12 11:15:09</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Qianming,WU Nan,GUAN Maolin,ZHANG Chunyuan,QUAN Wei and HUANG Dafei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Qianming,WU Nan,GUAN Maolin,ZHANG Chunyuan,QUAN Wei and HUANG Dafei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106004]]></guid><cfi:id>257</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Programmable Shuffle Unit with the Efficient ShufflePattern Memory]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[This paper presents a programmable shuffle unit with the efficient shuffle pattern memory for vector DSPs. The shuffle instructions can efficiently execute without occupying the system’s key resource such as the general registers or the memory bandwidth. We compress the switch-matrix by differentiating the shuffle granularity and indexing the elements. The memory efficiency of our scheme is higher than the state-of-art methods. Programmers can design the shuffle patterns ahead of time and load them into the shuffle pattern memory by the DMA or other ways. Experimental results show that our scheme can reduce the execution cycles by 7.4%～17.4% for the applications with the shuffle instruction requirement, at the cost of 0.6% additional chip area.]]></description>
<pubDate>2012/9/12 11:15:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WAN Jianghua,LIU Sheng,ZHOU Feng,WANG Yaohua and CHEN Shuming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WAN Jianghua,LIU Sheng,ZHOU Feng,WANG Yaohua and CHEN Shuming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106005]]></guid><cfi:id>256</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Throughput and Energy Model of Multicast Communication in Networks on Chip]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Networks-on-Chip (NoC) has become a promising interconnect solution between processor cores and cache banks in many-core-processor. Routers in the network should support multicast efficiently, due to the fact that the invalidation requests in the directory-based cache coherent protocols often cause multicasting packets. Throughput and energy model of multicast communication proposed in this paper can evaluate the network ideal throughput and energy under the different multicasting routing algorithms. Network can get higher throughput under Balanced Dimension order Routing algorithm (BDoR) and Minimal Path Dimension order Routing algorithm (MPDoR) proposed in the paper than the conventional multicast routing algorithms, because they can balance the link load between X direction and Y direction. Simulation results show that the throughput under MPDoR is 1.6 times than that under the XY multicasting routing algorithm under random broadcast traffic in the 4×4 mesh network; the link will not get saturated if the output speedup of the network is less than two; and the energy consumption under MPDoR is almost the same as that under OPT alogithm.]]></description>
<pubDate>2012/9/12 11:15:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[QI Shubo<sup>1</sup>,JIANG Jiang<sup>2</sup>,LI Jinwen<sup>1</sup> and ZHANG Minxuan<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>QI Shubo<sup>1</sup>,JIANG Jiang<sup>2</sup>,LI Jinwen<sup>1</sup> and ZHANG Minxuan<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106006]]></guid><cfi:id>255</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A 1-cycle 2GHz Bufferless Router for Network-on-chip]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Recently, bufferless router, which does not need buffers, has become a low-cost solution for Network-on-Chip. To improve the performance of the bufferless router, a 1-cycle high-performance bufferless router was proposed for Network-on-Chip. The router used a simple permutation network instead of the serialized switch allocator and the crossbar to achieve high performance. Compared with the virtual channel router and the baseline bufferless router, the proposed bufferless router can achieve the frequency of 2GHz with small area cost under TSMC 65nm technology. Simulation results under both synthetic and application workloads demonstrate that the proposed bufferless router achieves much less average packet latency than the virtual channel router and other bufferless routers.]]></description>
<pubDate>2012/9/12 11:15:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FENG Chaochao<sup>1</sup>,LU Zhonghai<sup>2</sup>,ZHANG Minxuan<sup>1</sup> and LI Jinwen<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FENG Chaochao<sup>1</sup>,LU Zhonghai<sup>2</sup>,ZHANG Minxuan<sup>1</sup> and LI Jinwen<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106007]]></guid><cfi:id>254</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and Implementation of a Modified Rolling CRC Scheme]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Rolling cyclic redundancy code (Rolling CRC) uses two generator polynomials for code generation. The degree of error detection capability provided by current implementations is not strong enough to check missing of a whole packet in a series of identical ones. A modified Rolling CRC, named MR-CRC, was presented for the data error checking, which adopted higher degree polynomials, chose the proper combination and revised the schemes used in original generator and detector. The result of FPGA implementation shows that this method has low logic complexity, can improve error detection and provide advanced reliability with little performance depression. Compared with the FPGA results of 16B rolling CRC and traditional 32B CRC, the former can improve the frequency by 25% with 10% less LUTs.]]></description>
<pubDate>2012/9/12 11:15:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Yongqing, and ZHANG Minxuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Yongqing, and ZHANG Minxuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106008]]></guid><cfi:id>253</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research and Design of Link Layer in Board-level High-speed Transportation Bus]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the development of the high performance servers and very large scale super computers, the requirement for board-level high-speed data transportation bus is higher than before. How to reduce the transfer delay between chips and improve the ratio of computation to communication is very important. In light of this, the characteristics of link layer in Hyper Transport and PCI Express buses which are very popular in recent years was studied. On the basis of this, link layer architecture for a 64-bit high-speed data transportation bus was proposed and some key technologies were researched. A 16-bit scrambler/descrambler, which can scramble or descramble a 16-bit data in one cycle, was designed. A lane-to-lane deskew logic, which can correct 5 cycles delay skews at most between two lanes, was also proposed. The verification results show that the function of our designs is correct.]]></description>
<pubDate>2012/9/12 11:15:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Hongwei<sup>1</sup>,CHEN Chao<sup>1</sup>,ZHANG Lixia<sup>2</sup>,ZHANG Ying<sup>1</sup> and LI YongJin<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Hongwei<sup>1</sup>,CHEN Chao<sup>1</sup>,ZHANG Lixia<sup>2</sup>,ZHANG Ying<sup>1</sup> and LI YongJin<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106009]]></guid><cfi:id>252</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Fast Timing-driven Routing Algorithm for FPGA High Fan-out Net]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For base timing-driven PathFinder router, it is found that the High-Fan-Out-Net routing spends around half of the time to insert the previous routed routing tree into routing resource node priority queue, but not all the nodes inserted are useful. In light of this finding, we proposed a pruning tree based priority queue initialization algorithm by just inserting the routing resource node which shares the same direction with next routing sink. For the High-Fan-out Net benchmark, results show our algorithm can shorten the initialization time by 5.23 times, and achieve 1.55 times speedup with almost the same quality of result.]]></description>
<pubDate>2012/9/12 11:15:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Xun<sup>1,2</sup> and ZHANG Minxuan<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Xun<sup>1,2</sup> and ZHANG Minxuan<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106010]]></guid><cfi:id>251</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Modeling Language for the Integration of Parallel Discrete Event Simulation Modeling and Parallel Model Checking]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The correctness and reliability of parallel discrete event simulation models play an important role in the development of PDES. Most of the existing PDES developing environments do not support model verification at present. The completeness and high effectiveness of parallel model checking helps it successful in making its way into industrial tools. While PDES and PMC are implemented in different modeling languages, in the current practice, to check whether or not a PDES model contains any errors, a prototype that is solely written for model checking purposes has to be built. This process is an onerous, time-consuming and error-prone task. The current research presented a modeling language, namely Extended Event Graph (EEG) to combine PDES and PMC, and it extended the classical event graph in aspect of synchronization. This modeling language makes it possible for users to achieve PDES and PMC with only one model via transformation mechanisms, thus saving both the time and effort of developers. The experimental results confirm the validity of this language and it can support both PDES and PMC.]]></description>
<pubDate>2012/9/12 11:15:09</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIA Wei<sup>1,2</sup>,YAO Yiping<sup>1</sup> and MU Xiaodong<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIA Wei<sup>1,2</sup>,YAO Yiping<sup>1</sup> and MU Xiaodong<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106011]]></guid><cfi:id>250</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Constant Acceleration Motion Blur Image Deblurring Based on Hybrid Coded Exposure]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Accurate PSF (Point Spread Function) estimation and image deconvolution are two key point problems during motion blur image deblurring. Aimed at these key problems, a motion deblurring framework based on hybrid coded exposure camera was proposed. The hybrid coded exposure camera is made up of a high-speed stereo camera and a high-resolution coded exposure camera. The coded exposure camera is the main camera which uses a kind of binary code to control the shutter during the exposure time. As a secondary motion sensor, the stereo camera can capture three image pairs in the beginning, middle and the end time of the coded exposure camera’s exposure time. An algorithm based on the binary code and the motion parameters was proposed to estimate the accurate PSFs of the coded exposure images. The motion parameters are obtained by a motion measurement algorithm based on the stereo vision. Direct deconvolution algorithm was used for deblurring the blur images. The experiment results show that the technique aforementioned can deblur constant acceleration motion blur images effectually and quickly.]]></description>
<pubDate>2012/9/12 11:15:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Shukui,ZHANG Jun,TU Dan and LI Guohui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Shukui,ZHANG Jun,TU Dan and LI Guohui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106013]]></guid><cfi:id>249</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Direction of Arrival Estimation from a Single Vector Hydrophone with Attitude Correction]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A far-field Direction-of-Arrival (DOA) estimation algorithm with attitude correction based on a single vector hydrophone was proposed. In practical application, both the direction finding and the signal-to-noise ratios (SNR) of three components in the acoustic particle velocity vector suffered from the attitude deflection of a vector hydrophone. Two components of a particle velocity vector combined with pressure signal could be used to estimate the two-dimensional bearing of a far-field target. Therefore, a far-field DOA estimation algorithm based on two properly chosen velocity components with attitude correction was proposed to increase the DOA estimation accuracies. Both the experiment data and numerical simulations were used to verify the feasibility and validity of the method.]]></description>
<pubDate>2012/9/12 11:15:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[NIU Siliang,ZHANG Zhenyu,HU Yongming and NI Ming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>NIU Siliang,ZHANG Zhenyu,HU Yongming and NI Ming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106018]]></guid><cfi:id>248</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Sea-sky-line Detection Based on Phase Grouping and Gray Statistics]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aimed at the problem of sea-sky-line detection in complicated sea-sky background image, a novel method, based on phase grouping and gray statistics, was presented. Firstly, a lot of line segments were obtained by using phase grouping method on edge image. Secondly, the line segments were classified according to two parameters, the slope angle and the distance to image origin. Several classes which have the largest sum of length of the line segments were selected, and edge points in each selected class were used to fit a straight line, thus several candidate sea-sky-lines could be gained. Finally, the correct sea-sky-line could be elected through comparing statistical gray values of the regions which correspond to the same horizontal pixel coordinates and take the points on the candidate sea-sky-lines as center points. Many experimental results show that the proposed method can detect the sea-sky-line under complicated sea-sky background effectively and has strong robustness.]]></description>
<pubDate>2012/9/12 11:15:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUI Yang,YANG Xia,ZHU Xianwei and ZHANG Xiaohu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUI Yang,YANG Xia,ZHU Xianwei and ZHANG Xiaohu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201106019]]></guid><cfi:id>247</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[News Video Event Topic Analysis Based on Stories]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[News videos contain huge amount of daily information, in which there is a great deal of redundancy and repetition content. Thus it is necessary to analyze news stories’ relationships and generate news topic effectively. This research proposes an approach for generating news video event topic based on stories. K-means cluster algorithm was used to group topic-evolving stories integrating textual and visual features. Based on the similarity and dependency between stories, an event topic was constructed automatically for the news video topic organization and threading. Finally, the generated event topic structure was visualized in event-time space. Experimental results show that the topic structure generated by the proposed approach can facilitate the fast navigation and understanding of the news topic.]]></description>
<pubDate>2012/8/28 11:51:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Haitao,LAO Songyang,BAI Liang and LIU Zhenya]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Haitao,LAO Songyang,BAI Liang and LIU Zhenya</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105018]]></guid><cfi:id>246</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Study and Realization on an Authorization Model Oriented Public Service of Over Domain and Application]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An authorization model of over domains based on RBAC is presented. The study described an RBAC authorization model based on policies for a single domain firstly, and then it built a network model by extending it to an authorization model for crossing the domains. So it resolved the problem of authorization integrating facing to many applications crossing the domains.]]></description>
<pubDate>2012/8/28 11:51:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHEN Weiwei<sup>1</sup>,WANG Baosheng<sup>2</sup> and HE Jianzhong<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHEN Weiwei<sup>1</sup>,WANG Baosheng<sup>2</sup> and HE Jianzhong<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105023]]></guid><cfi:id>245</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Low-memory Discrete Wavelet Transform with Optimization ofCausal Lifting Scheme and Subband Interleaving]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the optimization of causal implementation for the lifting schemes and the interleaving mode for sub-band coefficients, this research presents an enhanced low-memory implementation of discrete wavelet transform called the ELDWT (Enhanced Low-Memory Discrete Wavelet Transform). In comparison with the conventional global implementation of DWT, the ELDWT has the advantages that its memory budget is independent of the image height and different DWT filter banks cad be utilized in different decomposition/reconstruction levels. When the difference between the filters’ lengths is greater than two, the ELDWT has lower memory requirement and less system latency than those of the line-based DWT (LBWT). When a 5-level decomposition with the MPEG Default 9/3 filter bank is adopted, the overall memory is reduced by 22.7% in comparison with the LBWT.]]></description>
<pubDate>2012/8/28 11:51:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Jingxu<sup>1,2</sup> and ZHANG Xiongming<sup>3,4</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Jingxu<sup>1,2</sup> and ZHANG Xiongming<sup>3,4</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105029]]></guid><cfi:id>244</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An Improved Local Orientation Field Matching Method on Fingerprint Images]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105030]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Fingerprint orientation field describes the essential texture features in a fingerprint impression, including shape, structure and direction. A representation scheme is introduced to describe the local orientation field around a minutia, so as to describe and discriminate different minutiae based on the neighbor texture information. On poor-quality fingerprint images, especially when heavy nonlinear distortion exists, minutia direction is no longer reliable enough. As a result, it is not effective to align two local orientation field images with a minutiae pair as the reference. An improved alignment and matching method of local orientation field images is proposed, which can achieve much better performance and improve the matching accuracy more clearly. Experimental results show that the proposed method can evaluate the resemblance between two minutiae more effectively.]]></description>
<pubDate>2012/8/28 11:51:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Hui<sup>1</sup>,SHU Xin<sup>2</sup>,YIN Jianping<sup>1</sup> and ZHU En<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Hui<sup>1</sup>,SHU Xin<sup>2</sup>,YIN Jianping<sup>1</sup> and ZHU En<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105030]]></guid><cfi:id>243</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Quantum Secret Sharing Scheme Based on Polarized Single Photons and Quantum Computation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105031]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the help of quantum computation operator, a quantum secret sharing scheme based on polarized single photons is proposed. Efficiency analysis indicates that all qubits can be used in the secret sharing. With the permutation operator and quantum entanglement, the protocol can resist the middleman attack effectively. By using the auxiliary qubit, the protocol can detect the Trojan horse attack with high probability. The extension of the permutation operator shows the scheme which contains n pairs is feasible and applicable.]]></description>
<pubDate>2012/8/28 11:51:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Wei and LI Hongxin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Wei and LI Hongxin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105031]]></guid><cfi:id>242</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design of a Multi-sample Scheduling Tool for Two Classes of Analytic Simulations]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105032]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[When a large number of samples are being scheduled to run in dozens of computers, it is low in efficiency and easy to make mistakes for manual operation. Thus, an automatic tool for deploying and scheduling tasks can improve the analytic simulation’s execution efficiency. The Monte Carlo simulation and the Particle Swarm Optimization algorithm simulation are two kinds of classical analytic simulations. This research introduces the rationales and key techniques for the multi-sample scheduling tool based on both simulations, which can be generally and widely used in resolving varieties of problems about the automatically deploying and scheduling of simulation tasks.]]></description>
<pubDate>2012/8/28 11:51:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Buquan,JI Zhanlong,YAO Yiping and ZHAO Yuliang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Buquan,JI Zhanlong,YAO Yiping and ZHAO Yuliang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201105032]]></guid><cfi:id>241</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[MGR-SAT: A Multi-granularity Reconfigurable DSP Based on Stream Architecture Template]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Facing the varying demand for digital signal processing applications, the existing solution including general-purpose processor, DSP, ASIC and FPGA can not meet the requirements of cost, power consumption, performance and flexibility. To solve these problems, this study combined the technologies of stream processing, and reconfigurable platform, and proposed A Multi-Granularity Reconfigurable DSP based on Stream Architecture Template (MGR-SAT). MGR-SAT uses stream processing techniques to decouple the data on operations and memory access, offering a large-scale data parallel. Meanwhile it uses the reconfigurable technology to accelerate the key algorithms and uses the platform technology to provide fast reconfiguration as well. The experimental results show that MGR-SAT has a great potential to deliver high performance.]]></description>
<pubDate>2012/8/28 10:29:47</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Qianming,WEN Mei,WU Nan,SU Huayou,QUAN Wei and ZHANG Chunyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Qianming,WEN Mei,WU Nan,SU Huayou,QUAN Wei and ZHANG Chunyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104014]]></guid><cfi:id>240</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Virtual Sensor Formation with Non-cooperative Game forBarrier Information Coverage in WSN]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Neighboring sensors can collaborate with each other to form a virtual sensor based on cooperative sensing and data fusion, which may increase the length of information barrier. A distributed algorithm DVSF for virtual sensor formation based on non-cooperative games was devised. In order to increase the total length of information barrier of the networks, the DVSF chooses appropriate neighboring sensors to form virtual sensors, and it improves the performance of barrier information coverage of the networks. Simulations of the approach demonstrate the effectiveness and the convergence of DVSF.]]></description>
<pubDate>2012/8/28 10:29:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[BAN Dongsong,YANG Wei,SONG Lei,JIANG Jie and DOU Wenhua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>BAN Dongsong,YANG Wei,SONG Lei,JIANG Jie and DOU Wenhua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104015]]></guid><cfi:id>239</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Cross-verification Method Based on the Key DataRegion Monitoring]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Usually the intermediate results can hardly be obtained in the simulation process from the business architecture (ARC) simulator since its source is non-open. A method based on key data region monitoring was proposed to distill the value in the key region of ARC simulator automatically when it is running. In this way, the results from ARC simulator and RTL simulator can be cross-checked to help the verification engineer debugging the RTL codes quickly and efficiently. Compared with the traditional method, it can speed up the error checking by one order of magnitude according to the experiment and real chip design.]]></description>
<pubDate>2012/8/28 10:29:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Sheng<sup>1</sup>,YANG Huanrong<sup>1</sup>,CHEN Shuming<sup>1</sup>,LI Yong<sup>1</sup> and HOU Shen<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Sheng<sup>1</sup>,YANG Huanrong<sup>1</sup>,CHEN Shuming<sup>1</sup>,LI Yong<sup>1</sup> and HOU Shen<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104016]]></guid><cfi:id>238</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A High-performance Fetch Pipeline Based On the VLIWDSP Architecture]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For the drawbacks existent in single-thread fetch pipeline to improve the efficiency, a high-performance fetch pipeline structure is proposed in this paper based on the platform of the VLIW digital signal processor (DSP). It can support the detection and void for the invalid fetch, bypass for the missing fetch, which reduces the unnecessary cache access and fetch pipeline stall. The structure also inducts dedicated hardware which supports the software pipeline of scheduled compilation to improve the parallelism of instruction. It reduces the code memory space, and the idle cycles of released single-threaded pipeline is reached up to about 46.34%. Compared with the fetch pipeline before optimized, experiment results show that the code storage space is reduced about 11.93%, the average execution cycle is shortened about 8.67%, the cache access times is decreased about 12.84%, the suspension period of instruction cache is shortened about 7.86%, and the single-threaded instruction throughput of processor is increased by 11.7%.]]></description>
<pubDate>2012/8/28 10:29:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Hui,CHEN Shuming and WAN Jianghua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Hui,CHEN Shuming and WAN Jianghua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104020]]></guid><cfi:id>237</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Application Research on Touch-based Two-handed Natural Interaction Command Technology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In CPOF, two-handed interaction which can increase the communication bandwidth applies commanders' common skills to the interaction with computers for releasing their cognitive burden and improving command efficiency. The research proposed studied key technology of infrared   multi-touch recognition and position, analyzed the method of two-handed-touch-based interaction and its state model, and discussed the model of two-hand interaction process. Finally, a touch-based two-handed command and discussion system was designed, and the result proved the validity of the interaction methods.]]></description>
<pubDate>2012/8/28 10:29:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIAO Huxiong<sup>1</sup>,LAO Songyang<sup>1</sup>,SHAO Hongtao<sup>2</sup> and LIU Gang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIAO Huxiong<sup>1</sup>,LAO Songyang<sup>1</sup>,SHAO Hongtao<sup>2</sup> and LIU Gang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201104023]]></guid><cfi:id>236</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Review on Scientific Workflows]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Scientific Workflow Management Systems (SWfMS) has become an effective platform for representing and managing large-scale complex scientific computing processes, which glue together a large number of complex applications for data management, analysis, simulation, and visualization, and then assist the scientists for scientific discovery. In this paper, the current studies of Scientific Workflow (SWF) are reviewed firstly, including SWF models, presentations, languages, composition, validation, scheduling and provenance, as well as fault tolerance and system security. Then, the latest studies in recent years are also discussed. Based on the analysis of the key technologies and the latest development, the drawbacks in this domain are pointed out and some suggestions towards the future development are made. Finally, the recent research status quo in China is presented and some suggestions are given.]]></description>
<pubDate>2012/9/13 9:40:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Weimin,LIU Cancan and LUO Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Weimin,LIU Cancan and LUO Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103013]]></guid><cfi:id>235</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Data Level Parallel Method of Streaming H.264 Coding]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Stream processing model is a newly emerging parallel processing model, which is derived from media processing. However, as an important application of media processing, H.264 coding encounters problems during its streaming procedure. The main reason is that dependency limits the data level parallel exploitations. To solve this problem, data level parallel methods for different coding modules were developed by the analysis of coding algorithm. By adopting the method, key coding modules of H.264 can attain large data parallel granularity. Experiment results show that the data level parallel streaming inter/intra prediction, CAVLC, and the deblock filter can achieve outstanding acceleration.]]></description>
<pubDate>2012/9/13 9:40:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WEN Mei,REN Ju,WU Nan,SU Huayou,XUN Changqing and ZHANG Chunyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WEN Mei,REN Ju,WU Nan,SU Huayou,XUN Changqing and ZHANG Chunyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103014]]></guid><cfi:id>234</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Key Factors of Single Event Latch-up in 180nmCMOS Technologies]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The key factors that affect Single Event Latch-up  sensitivity were investigated. In view of 180nm bulk technology, based on calibrated CMOS inverter model, TCAD method was adopted to study the effects of particle incident position, temperature, and well / substrate contact position, NMOS and PMOS spacing and other factors on SEL sensitivity. Simulation and analysis shows that, SEL response varies greatly at different nodes, and the study identified the sensitive nodes of the CMOS inverter of SEL occurrence, and explored the relationship between temperature,      well / substrate contact position, NMOS and PMOS drain distance and LET threshold when SEL occurred, then analyzed theoretically and summarized the reinforcement for reducing SEL sensitivity. The results can provide effective guidance to the anti-SEL design.]]></description>
<pubDate>2012/9/13 9:40:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[QIN Junrui,CHEN Shuming,CHEN Jianjun,LIANG Bin and LIU Biwei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>QIN Junrui,CHEN Shuming,CHEN Jianjun,LIANG Bin and LIU Biwei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103015]]></guid><cfi:id>233</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Comparing of the Scaling Property of Carbon NanotubeField Effect Transistors]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Owing to the more obvious quantum tunneling effect, Carbon Nanotube Field Effect Transistors (CNFETs) take on different scaling property from that of silicon based Metal-Oxide-Semiconductor (MOS) transistors. The scaling properties of Conventional MOS-like Carbon Nanotube Field Effect Transistors (C-CNFETs), on the other hand, differ from those of Tunneling Carbon Nanotube Field Effect Transistors (T-CNFETs) due to different operating mechanism. As a result, study on the scaling property is one of the most important means of searching for the application potential of the device. The band-to-band tunneling, however, has not been taken into account in previous researches. A comparative study of the impact of band-to-band tunneling on the scaling property of C-CNFETs and T-CNFETs was carried out based on Non-Equilibrium Green's Function method. The research results reveal that these two kinds of CNFETs take on different or even opposite scaling properties. The research will offer a vigorous guidance for the device design to obtain a proper trade-off among area, speed and power in application.]]></description>
<pubDate>2012/9/13 9:40:50</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Hailiang<sup>1</sup>,ZHAO Tianlei<sup>1</sup>,ZHANG Minxuan<sup>1</sup> and HAO Yue<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Hailiang<sup>1</sup>,ZHAO Tianlei<sup>1</sup>,ZHANG Minxuan<sup>1</sup> and HAO Yue<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103016]]></guid><cfi:id>232</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Retinex Image Processing Framework Based on Estimation of Piecewise Smooth Illumination]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Retinex theory is a kind of technology for image enhancement, and its basic principle is to decompose the original image into the product of illumination and reflectance. Traditional Retinex theory generally assumes that illumination is smooth, while in actual scenes, because of effects of different reflection characteristics of targets and shadings, illumination is piecewise smooth, resulting in an edge blurred reflection image and generating halos. For the above problems, this paper proposes an improved image processing framework for Retinex theory. First, the illumination is estimated with piecewise smooth operator to eliminate the halo phenomenon. Second, illumination correction is introduced for adjusting the contrast of the image. Third, reflection correction is introduced for detail enhancement or denoising. In the end, this paper verifies the improved framework with image quality evaluating indicators for the validity and correctness. The experimental results show that the improved framework is effective.]]></description>
<pubDate>2012/9/13 9:40:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Zhuangzhi,QI Lina and LUO Pei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Zhuangzhi,QI Lina and LUO Pei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103017]]></guid><cfi:id>231</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A 8.2ppm/℃ Bandgap Voltage Reference with 1.8V PowerSupply in 0.18μm CMOS Process]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Bandgap reference is a fundamental component in modern analog/mixed signal integrated circuits. In CMOS process, because of the small β value, the base-emitter path of the bipolar junction transistor has a significant streaming effect on the collector current，which leads to a large drift on temperature for the bandgap reference. In this study, a current compensating technique is proposed to enhance the temperature stability of the bandgap reference, and the power supply rejection is improved with a noise feedback circuit. Experimental results in the 0.18μm CMOS process show that the temperature coefficient is 8.2ppm/℃ within the temperature range of -55℃～150℃ on the 1.8V power supply, and the power supply rejection is greatly improved, the DC power supply rejection ratio is -90dB.]]></description>
<pubDate>2012/9/13 9:40:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MA Zhuo,DUAN Zhikui,YANG Fangjie,GUO Yang and XIE Lunguo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MA Zhuo,DUAN Zhikui,YANG Fangjie,GUO Yang and XIE Lunguo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103018]]></guid><cfi:id>230</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Large-scale MANET Layered Share RoutingModel Based on P2P]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[MANET routing model based on P2P has become a hot topic recently，but the research results have been mainly applied to small or medium MANET, without fully using of the advantages of P2P distributed share theory. As a result, there exist detour and inefficient problems. In light of this, a large-scale MANET layered share routing model based on P2P is presented. It introduces layered mechanism based on network physical topology to enhance network scalability on the basis of cross-layer optimization, expands P2P distributed share strategy into MANET Routing layer, and can solve the detour problem in the previous algorithm. The simulation experiment shows that this new routing model can greatly increase the MANET routing efficiency.]]></description>
<pubDate>2012/9/13 9:40:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LUO Qiao,CHEN Jing,GUO Yichen and HUANG Conghui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LUO Qiao,CHEN Jing,GUO Yichen and HUANG Conghui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201103019]]></guid><cfi:id>229</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Object Tracking Using Bidirectional Spatio-temporal Continuity Tracklet Association]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An object tracking algorithm by associating tracklets with the best bidirectional spatio-temporal continuity was proposed. First,  reliable tracklets were generated by a primitive frame-by-frame association; then tracklet's motion, position and color features were computed and refined by applying Kalman filter and weighted mean method respectively; finally, the best spatio-temporal association of tracklets was achieved through an iterative association by computing spatio-temporal continuity between tracklets. Experimental results prove that multiple objects can be successfully tracked under occlusion both by other object and scene object.]]></description>
<pubDate>2012/8/28 10:30:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Jiangfeng,ZHANG Maojun,BAO Weidong and XIONG Zhihui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Jiangfeng,ZHANG Maojun,BAO Weidong and XIONG Zhihui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102011]]></guid><cfi:id>228</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[SAR Image Denoising Based on Adaptive Threshold Estimation Method]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An adaptive threshold estimation method for multiplicative speckle denoising in SAR images was proposed, based on wavelet domain merging with translation invariant denoising. The subband threshold was derived using bayesian estimation theory and a new probability density function. The method was applied for speckle SAR images by using logarithmic transformation. Theoretical analysis and experimental results demonstrate that the method is computationally more efficient, and displays better noise removal as well as better preservation of sharp features.]]></description>
<pubDate>2012/8/28 10:30:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Yi and CHENG Lizhi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Yi and CHENG Lizhi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102014]]></guid><cfi:id>227</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The Method of Automatic Building Height Extraction by Fusing Catadioptric Panoramas and Remote Sensing Images]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A method of automatic building height extraction by Fusing Catadioptric Panoramas and Remote Sensing Images was presented for solving the problem about building height extraction in 3D city reconstruction. The method has three steps. First, images between Catadioptric Panoramas and Remote Sensing were registered. Second, the building in the Catadioptric Panoramas were extracted by using the previous result of image registration, Finally, the building height with catadioptric projection model was calculated based on the information of the top and bottom borderlines. The whole processing of building height extraction was completed automatically. Experiments show that this method is feasible and can obtain a precise result, especially for dwelling houses, error reaches no more than 4%.]]></description>
<pubDate>2012/8/28 10:30:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Wei,GAO Hui,ZHANG Maojun and WANG Wei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Wei,GAO Hui,ZHANG Maojun and WANG Wei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102019]]></guid><cfi:id>226</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Parallel Processing Scheme for Large-sizeSliding-window Applications]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[There exists a large gap between the data input speed and processing speed in large-size sliding-window applications. To shorten this gap, a parallel processing scheme was proposed, which achieved high data reusability and parallelism with memory resources as few as possible and memory access control logics as simple as possible. The scheme combined the advantages of parallelism among different sliding-windows and parallelism among different data in a single window. For different windows, they were divided into groups and mapped into multiple processing elements. For the data in a single window, multi-module memory structure was introduced to buffer them, where module assignment and addressing scheme was designed for conflict-free parallel access. Experimental results on FPGA show that this approach can improve the processing speed significantly without incurring too much memory resources and too complicated memory access control logics.]]></description>
<pubDate>2012/8/28 10:30:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[PANG Zhengbin<sup>1</sup>,XU Jinbo<sup>1</sup>,DONG Yazhuo<sup>2</sup>,DOU Yong<sup>1</sup> and ZHANG Jun<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>PANG Zhengbin<sup>1</sup>,XU Jinbo<sup>1</sup>,DONG Yazhuo<sup>2</sup>,DOU Yong<sup>1</sup> and ZHANG Jun<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102029]]></guid><cfi:id>225</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A Novel Free-memory Communication Interface of ManyCores Processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102030]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[High-performance computing has witnessed a tremendous growth and acceptance over the last decade, primarily due to the availability of clusters. The performance of these clusters hinges upon the communication interface. User level communication based on storing address translation table in off-chip SRAM has deeply increased the design complex and cost of chip and system. The paper put forward and implemented a novel Free-Memory communication interface of many cores processor which differs from traditional HCA based on I/O bus, without local memory interface and reduced cost of address translation by efficient cache management method. Experimental results show the communication interface which we implemented not only can reduces the design complex and cost of chip and system, but also can achieve better bandwidth and latency than infiniband QDR HCA.]]></description>
<pubDate>2012/8/28 10:30:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUO Yufeng,LI Qiong,DOU Qiang,ZHANG Lei and LIU Lu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUO Yufeng,LI Qiong,DOU Qiang,ZHANG Lei and LIU Lu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102030]]></guid><cfi:id>224</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[High-quality Volume Rendering of Unstructured-grid  Cell-centered Data of Flow Fields Based on Upwind FVM]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102031]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the field of computational fluid dynamics, the upwind finite volume method (FVM) is widely applied to solve the complicated flows with unstructured grids as the volumetric representation. It produces unstructured-grid cell-centered data at the center of each cell（control volume）with the flow discontinuity constraint on the inner-face between face-adjacencies. For visualization, existing reconstruction approaches violate the discontinuity constraint. As a result, the image has low quality due to the lost information of the discontinuity. This research presented a method to reconstruct the discontinuous states at a sample based on the dual control volumes on the framework of multi-pass raycasting. It guarantees that the field on the inner-face is discontinuous between face-adjacencies, which is in accord with the solution of the numerical computation. We also designed a synthesizer for the discontinuous segments based on the reconstruction above, so that the discontinuity information can be transferred to rendering data. The experiments demonstrate that our approach can obviously improve the image quality and clearly visualize the features in the flows.]]></description>
<pubDate>2012/8/28 10:30:14</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MA Qianli<sup>1</sup>,LI Sikun<sup>1</sup>,BAI Xiaozheng<sup>2</sup>,ZENG Liang<sup>1</sup> and XU Huaxun<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MA Qianli<sup>1</sup>,LI Sikun<sup>1</sup>,BAI Xiaozheng<sup>2</sup>,ZENG Liang<sup>1</sup> and XU Huaxun<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201102031]]></guid><cfi:id>223</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[New Progress on Community Detection in Complex Networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201101011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Community structure is one of the common topological characteristics of complex networks. Community detection has become a fundamental problem in the research field of complex networks. The new progress of current algorithms for community detection was reviewed. The characteristics of these algorithms were discussesed. Finally, future direction of this active area was proposed.]]></description>
<pubDate>2012/8/29 10:50:39</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LUO Zhigang,DING Fan,JIANG Xiaozhou and SHI Jinlong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LUO Zhigang,DING Fan,JIANG Xiaozhou and SHI Jinlong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201101011]]></guid><cfi:id>222</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A fast location mechanism on memory data error 
for multi-core processors verification]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A fast fault location mechanism on memory data error, which is called FFLM for a self made CMP-16 multi-core processor’s functional validation, is proposed and realized. FFLM builds a multi-port golden memory model based on the hardware emulation accelerator. It monitors the packages of memory access between memory system and processor cores during the emulation, real-time compares the data from real memory system being tested and the data from golden memory model, judges whether they are consistent, and finds the errors once any wrong data is sent to processor core from memory system. Compared with traditional ways, FFLM has the advantages of fast emulation speed, low hardware cost and low fault Location time cost. Statistical results from the emulation for a self-made CMP-16 multi-processor show that FFLM improves the speed of date fault location in memory system by 6.5 times averagely.]]></description>
<pubDate>2013/1/11 4:19:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Hongwei,DENG Rangyu,LI Yongjin,YAN Xiaobo and DOU Qiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Hongwei,DENG Rangyu,LI Yongjin,YAN Xiaobo and DOU Qiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206001]]></guid><cfi:id>221</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A novel asynchronous on-chip router based 
on hierarchical bit-line buffer]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Buffer resources are key components of the on-chip router, and their structures exert significant influence on the performance and power consumption of the interconnection network. In general, asynchronous FIFO based on shift registers is adopted to implement on-chip buffer resources. Packets transmitted traverse the FIFO queue step by step, leading to higher propagation delay of packets and larger transition counts in the circuit. In this research, an asynchronous FIFO based on hierarchical bit-line buffer is proposed, and then a new asynchronous on-chip router is presented in detail. Compared with the traditional asynchronous router, the newly presented one has lower hardware complexity and power consumption. Experiments show that the new router can achieve 39.3% area saving and 41.1% power reduction when the depth of asynchronous FIFO is configured with 8.]]></description>
<pubDate>2013/1/11 4:19:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Wei,GUO Yufeng,WANG Lei,GONG Rui and DOU Qiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Wei,GUO Yufeng,WANG Lei,GONG Rui and DOU Qiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206002]]></guid><cfi:id>220</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Reducing the traffic of token protocol with predictors]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Coherence messages in token protocol are always broadcast, which creates heavy network traffic and limits its scalability. An efficient predictor technique was used to eliminate the useless message in token protocol, which employs a predictor to predict the data’s sharers and only sends coherence messages to the sharers to avoid broadcasting. Three predictor policies depending on the write miss and read miss ratio of application were proposed. The results show that: the owner predictor with 512 entries can reduce interconnect traffic by 3.8% on average, the sharer predictor and the hybrid reduce interconnect traffic by the average of 11% and 7% respectively. The method proposed efficiently reduces the traffic and improves the scalability of token protocol. ]]></description>
<pubDate>2013/1/11 4:19:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FU Guitao,ZHAO Tianlei,HUANG Ping,TANG Xiantuo and XING Zuocheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FU Guitao,ZHAO Tianlei,HUANG Ping,TANG Xiantuo and XING Zuocheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206003]]></guid><cfi:id>219</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A cache optimizing method based on graph coloring]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A graph coloring based management optimizing algorithm for cache, namely Cache Coloring, has been proposed. This algorithm first partitions the data into several data objects according to their memory accessing behaviors. Then it partitions the cache into a pseudo register file with alias according to the size of the data objects. Each pseudo register in this register file can hold one of the data objects. Finally, it uses an extended graph coloring register allocation algorithm to determine the position of each data object in the cache and their replacement relationship. The data object partitioning divides the management of cache into two levels, one for the coarse-granularity management of the data objects in the compile-time and the other for the fine-granularity management of the cache lines in the run-time. So the advantages of both compiler and hardware are exploited. Cache Coloring is implemented in GCC. A hardware simulation platform which supports Cache Coloring is built based on the Simplescalar processor simulator. The primary experimental results show that Cache Coloring can exploit the locality well and reduce the cache miss rate.]]></description>
<pubDate>2013/1/11 4:19:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DENG Yu,WANG Lei,ZHANG Ming,GONG Rui,GUO Yufeng and DOU Qiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DENG Yu,WANG Lei,ZHANG Ming,GONG Rui,GUO Yufeng and DOU Qiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206004]]></guid><cfi:id>218</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[VLIW scheduling for high performance embedded energy-efficient processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To reduce the power, the energy-efficient embedded microprocessor always adopts the distributed and hierarchical register file structure (DHRF). Many data need to be stored in the second level general register file (GRF) because of the small capacity of the tiny operand register file (TORF), and this challenges the design of compiler. A new VLIW scheduling algorithm is proposed to solve the problem through analyzing the program characteristics. The variables are detected while the compiling and virtual copy operations are inserted at the appropriate time. Through instruction scheduling and communication scheduling for the copy operations and constructing new data transfer route including GRF for the global variables and software pipelining variables, which have great demand for the register, the pressure on TORF is transferred to GRF. The experimental results show that the VLIW scheduling algorithm is consistent with the starting point of the energy-efficient microprocessor. On the condition of 8% program performance decline, the energy consumption on register accessing is reduced by about 51%, and the energy consumption of the processor is reduced by about 43%. At the same time, the burden of programmer is avoided.]]></description>
<pubDate>2013/1/11 4:19:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUAN Maolin,YANG Qianming,ZHANG Chunyuan and WEN Mei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUAN Maolin,YANG Qianming,ZHANG Chunyuan and WEN Mei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206005]]></guid><cfi:id>217</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Moveable bubble flow control in k-ary n-cube]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Bubble flow control is an efficient technique to avoid deadlock in torus networks without using virtual channels. If a flow control mechanism has knowledge of buffer utilization within a dimension, it can make resource allocation decisions based on global network conditions to improve network performance. The previous critical bubble scheme has a risk of blocking. To resolve this problem, a false packet protocol was presented, and a non-blocking moveable bubble scheme was designed, which is an improvement of critical bubble scheme with a requirement of one packet buffer at least, which halves the buffer requirement of two. Network simulation results show that this scheme is apparently better than the existing methods, avoids permanent blocking, displays a throughput improvement of more than 20% under distribute, hotregion and uniform traffic patterns, and maintains a steady throughput after network saturation without sharp drop.]]></description>
<pubDate>2013/1/11 4:19:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Yongqing and ZHANG Minxuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Yongqing and ZHANG Minxuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206006]]></guid><cfi:id>216</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An application specific instruction set reconfigurable architecture and the mapping of FFT on it]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To meet the stringent requirements on both high-throughput and high-flexibility for FFT computation in modern wireless communication applications, an application specific reconfigurable architecture called ASRA is presented. ASRA is a VLIW-like static multi-issue processor with custom multi-grained reconfigurable fabric as extensible function units. The run-time context manager in ASRA offers multi-grained Custom Instructions selection and is bound to the appropriate reconfigurable fabric while considering run-time changing scenarios. Mapping of the FFT algorithm on ASRA is studied and optimized. ASRA employs on-chip scratchpad as fast local memory. The read/write operation and butterfly operation is pipelined to support hardware pipeline execution of a loop kernel. Experiment results show that ASRA achieves a high performance improvement and a good trade-off between area and performance. ]]></description>
<pubDate>2013/1/11 4:19:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Lei,YANG Ziyu,SHEN Jianliang and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Lei,YANG Ziyu,SHEN Jianliang and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206007]]></guid><cfi:id>215</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Critical loop memory-aware mapping onto coarse-grained 
reconfigurable architecture]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Targeting at the mapping of key loops onto CGRA (Coarse-Grained Reconfigurable Architectures), this research proposes a novel approach called memory-aware kernel loop pipelining mapping (MALP). The RCP_CGRA model and the critical loop mapping formulation were shown first. Based on polyhedral model, then the array clustering and data domain partition were presented. An analysis of the critical loop storage requirement was described. Based on this analysis result, the MALP provided an efficient way for loop mapping under the resource constraints of CGRA. Experiment results show that MALP can improve the data throughput rate while costing less resource. MALP makes the loop mapping on CGRA more efficient.]]></description>
<pubDate>2013/1/11 4:19:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Ziyu,ZHAO Peng,WANG Dawei and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Ziyu,ZHAO Peng,WANG Dawei and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206008]]></guid><cfi:id>214</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Associated features accumulation and analysis for motion 
object detection in compressed domain]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A novel motion object detection method in H.264 compressed domain is proposed, based on multi-features accumulation and analysis, which can reflect the motion of object and change in the area of borders. Firstly, the MVs of macroblocks were accumulated and filtered. The Jacobian matrix was used to describe the relationship between parameters of global motion and MV in each macroblock, which makes the computation of global motion parameters easier than before. Then the motion areas were detected by the similarity of local motion and global motion. Secondly, the remarkable blocks of DCT energy were accumulated in temporal by the reliable motion around them. Then the border and texture area was found by the accumulations of DCT energy with the local self-adaptive threshold which selected by entropy. Finally, the results which had been detected by MV and DCT respectively were combined. The experiments shows that the method proposed can detect the motion object in compressed video accurately, and the result of can achieve good recall and precision simultaneously.]]></description>
<pubDate>2013/1/11 4:19:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Le<sup>1,2</sup>,ZHANG Maojun<sup>1</sup>,ZHANG Wenqi<sup>3</sup> and LI Yongle<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Le<sup>1,2</sup>,ZHANG Maojun<sup>1</sup>,ZHANG Wenqi<sup>3</sup> and LI Yongle<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206009]]></guid><cfi:id>213</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A task scheduling method for parallelization of complicated 
geospatial raster data processing algorithms]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As the parallel computing technologies are becoming mature, the research on parallelization of geospatial raster data processing algorithms has been a hot spot issue. Focusing on the complicated algorithms whose processing procedures consist of multiple computing steps, this research proposes a task scheduling method based on the theory of spatial computational domain with which the task scheduling solution is not static, but adjusts itself as the algorithmic procedure proceeding. Experiments have verified the effectiveness of our method. Because the method keeps adjusting the task scheduling solution at every computing step, the load-balancing effect is better, and thus the parallel running time is shorter compared with the conventional task scheduling method.]]></description>
<pubDate>2013/1/11 4:19:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHENG Guo,CHEN Luo,WU Qiuyun and JING Ning]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHENG Guo,CHEN Luo,WU Qiuyun and JING Ning</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206010]]></guid><cfi:id>212</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An energy efficient and balanced clustering data aggregation 
algorithm for wireless sensor networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In a wireless sensor network, some sensor nodes will consume their energy at a much higher rate and die much faster if the energy dissipation of nodes is unbalanced. Accordingly, the network will lose its ability prematurely. A novel clustering data aggregation algorithm is proposed to resolve the problem of unbalanced energy dissipation among nodes during data gathering in clustering wireless sensor networks. The algorithm divided the network into rectangular grids with unequal size and made cluster heads rotate among the nodes of each grid respectively in terms of residual energy. A grid whose cluster heads consumed more energy is bigger and has more nodes to take part in the cluster head rotation for sharing energy load. By this way, the algorithm is able to balance the energy dissipation of nodes. In addition, considering that wireless sensor networks are energy-restricted because the nodes are equipped with limited and non-rechargeable energy resources, the algorithm adopted a series of measures to save energy. The results of simulation show that the algorithm is able to achieve better performance in aspects of efficiency of energy usage, lifetime of network and balanced extent of energy dissipation.]]></description>
<pubDate>2013/1/11 4:19:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YUE Jun,ZHANG Weiming,XIAO Weidong and TANG Jiuyang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YUE Jun,ZHANG Weiming,XIAO Weidong and TANG Jiuyang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206011]]></guid><cfi:id>211</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Searching for the optimal code of coded exposure photography in 
the presence of CCD noise]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Coded exposure photography makes the ill-pose motion deblurring problem well-posed, and searching for the optimal code has been the key problem in coded exposure photography. For practical purpose, an optimal code searching method for coded exposure photography in the presence of CCD sensor noise is proposed. Firstly, the sensor noise in the process of imaging was systemically analyzed based on the affine noise model. Then, the basis of Raskar’s code was theoretically analyzed for the first time and based on the signal to noise ratio (SNR) gain of deblurred image, an analytic formulas between the photon noise and the structure of the optimal code was presented. Finally, based on the noise calibration of real coded exposure camera, the criteria for the optimal code was presented, a fitness function was designed and the optimal code using the genetic algorithm was obtained. Experimental results with synthetic and real data demonstrates the validity of the proposed method.]]></description>
<pubDate>2013/1/11 4:19:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HUANG Kuihua,ZHANG Jun,XU Shukui and LI Guohui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HUANG Kuihua,ZHANG Jun,XU Shukui and LI Guohui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206012]]></guid><cfi:id>210</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Improved guess-and -determine attack on sosemanuk]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Sosemanuk is one of the stream ciphers that have been selected into the final portfolio for the eSTREAM project. Sosemanuk from the view point of bit-level was described. By studying the S-box of Serpent1, the modular addition, and the linear feedback shift register, a kind of equation between the bits of the internal states was obtained, based on which an improved word-oriented guess-and-determine attack on Sosemanuk is proposed. This improved attack utilizes the Groebner basis method to solve the equation system and can determine the other 5 words of the internal state by guessing just 7 words, and thus the complexity is pvoved to be O(2192).]]></description>
<pubDate>2013/1/11 4:19:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIE Duanqiang<sup>1</sup>,LI Heng<sup>1</sup>,LI Ruilin<sup>2</sup> and DAI Qingping<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIE Duanqiang<sup>1</sup>,LI Heng<sup>1</sup>,LI Ruilin<sup>2</sup> and DAI Qingping<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201206013]]></guid><cfi:id>209</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An algorithm for extracting minimal first-order unsatisfiable subformulae 
on depth-first-search and incremental solving]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[While registering transfer level or even behavioral level, the hardware description language is widely used, and Satisfiability Modulo Theories(SMT) gradually replaces Boolean Satisfiability(SAT), and plays an important role in VLSI formal verification. A minimal unsatisfiable subformula can help automatic tools to rapidly locate the errors. A depth-first-search algorithm is proposed to extract minimal unsatisfiable subformulae in SMT to adopt depth-first searching and incremental solving strategy. The experimental results show that the depth-first-search algorithm effectively derived minimal unsatisfiable subformulae, and is more efficient than the breadth-first-search algorithm, which is the best method for computing the minimal unsatisfiable subformulae in SMT, with the number of variables and clauses in the original formulae increasing.]]></description>
<pubDate>2012/11/5 8:48:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Jianmin,LI Tiejun,ZHANG Jun,XU Weixia and LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Jianmin,LI Tiejun,ZHANG Jun,XU Weixia and LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205023]]></guid><cfi:id>208</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The dependence of process parameters on single 
event transient in 25 nm FinFET]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the help of Technology Computer-Aided Design (TCAD) 3-D simulation, the dependence of process parameters on single event transient (SET) in 25 nm raised source-drain FinFET (Fin Field Effect transistor) was studied. It is found that the fluctuation of some process parameters exert remarkable impact on the charge collection, thus affecting the SET pulse width propagated in circuits. For the best corner process parameters, the amount of charge collected can be reduced by 38%, whereas the charges will increase 79% for the worst corner process, which foumulates a new idea for the SET mitigation and radiation-harden design in FinFET.]]></description>
<pubDate>2012/11/5 8:48:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Dawei,QIN Junrui and CHEN Shuming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Dawei,QIN Junrui and CHEN Shuming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205024]]></guid><cfi:id>207</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[New impossible differential cryptanalysis of Zodiac]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205025]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The security of block cipher Zodiac against impossible differential cryptanalysis was re-evaluated. By analyzing the properties of diffusion layer P, two new 14-round impossible differentials of Zodiac were introduced. Based on the new impossible differential characteristics and combining with the Early-Abort technique, an effective attack was applied to the full 16-round Zodiac, and the data complexity was 285.6 chosen plaintexts and the time complexity is only 232.6 encryptions. Compared with the previous best result, the time complexity in this paper decreases with a factor of 233. The result shows that Zodiac is vulnerable to impossible differential cryptanalysis due to its poor diffusion.]]></description>
<pubDate>2012/11/5 8:48:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Chao<sup>1,2</sup> and WEI Yuechuan<sup>2,3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Chao<sup>1,2</sup> and WEI Yuechuan<sup>2,3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205025]]></guid><cfi:id>206</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Beltrami flow and its application in image denoising]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Partial differential equation (PDE) is one of the main methods for image processing and its significance is usually shown by the corresponding variable model, according to which the PDE can be optimized further to reach ideal results. Based on the classic Beltrami flow for image processing, a new metric tensor model on the image manifold is proposed for image denoising. The Beltrami flow with this metric tensor has clear geometrical significance, which induces the optimal selection method for parameters in the metric tensor. Meanwhile, this model provides a unified framework for the classic PDE based image denoising methods and the optimal selection method for its parameters makes the Beltrami flow have a better balance between smoothing the noise and preserving the edges. The experiment results show that the image denoising quality is greatly improved, especially for the images with abundant edges.]]></description>
<pubDate>2012/11/5 8:48:03</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Zelong and ZHU Jubo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Zelong and ZHU Jubo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205026]]></guid><cfi:id>205</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Property of preimage distribution of perfect nonlinear 
function with the form of power functions]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Perfect nonlinear function is the optimal function on finite fields with odd character that can resist differential cryptanalysis. All the six classes of the already known perfect functions currently are 2-1. This study proved that when is Dembowski-Ostrom function or Coulter-Matthews function on , the preimage distribution of the perfect nonlinear function  has just two kinds of values, one corresponds to all the elements of quadratic residual on , and the other kind corresponds to all the non quadratic residual on .]]></description>
<pubDate>2012/11/5 8:48:04</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HAI Xin,DAI Qingping and LI Chao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HAI Xin,DAI Qingping and LI Chao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205027]]></guid><cfi:id>204</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Recognition of mycobacterium tuberculosis in microscopic 
images based on color and gradient feature]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205028]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A color and gradient feature based image segmentation and recognition algorithm is proposed for Mycobacterium Tuberculosis (TB) objects in microscopic images. First, the input color image was pre-segmented based on the HSV color space using the threshold method according to the prior information. Then, the original image was transformed to the CIE L*a*b* color space, and the L component image was segmented using an adaptive threshold method to get finer segmentation result. In order to accommodate the complex variety of image background, all the suspected objects were verified according to the “hue consistence” assumption and the false objects were rejected. To identify the TB bacilli, the algorithm used five shape feature descriptors, including the area, the perimeter, the ratio of width to height, the compactness and the roughness, and two gradient feature descriptors, the gradient magnitude weighted average (GMWA) and the gradient magnitude variance average (GMVA) respectively, and makes the judgment through Bayes classifier. Experimental results show that the proposed algorithm can accommodate the complex variety of specimens and the image background, and a high recognition rate (91%) can been obtained.]]></description>
<pubDate>2012/11/5 8:48:04</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAI Yongping<sup>1</sup>,ZHOU Dongxiang<sup>1</sup> and LIU Yunhui<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAI Yongping<sup>1</sup>,ZHOU Dongxiang<sup>1</sup> and LIU Yunhui<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205028]]></guid><cfi:id>203</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Method of review spam detection]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For detecting review spam in the Internet automatically, an method based on resistance network is proposed. By treating the distance between two reviews as a resistance, we represent the given dataset as a resistance network and the resistance distance between two nodes is a measure of the semantic distance between them. Spam reviews are semantic outliers in this network. An electrical outlier factor (EOF) for each review based on its influence on the power dissipated of the network was used to detect the spam reviews. Experimental results testified that EOF is suitable for detecting review spam, and is efficient and effective．]]></description>
<pubDate>2012/11/5 8:48:04</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAN Wentang,ZHU Hong,GE Bin,LI Fangfang and XIAO Weidong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAN Wentang,ZHU Hong,GE Bin,LI Fangfang and XIAO Weidong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201205029]]></guid><cfi:id>202</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on the regularization parameter of image deblurring]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A method of determining the regularization parameter is proposed in order to solve the image deblurring problems. The main objective is to get the regularization parameter from the deblurring image. The method starts by considering the famous Total Variation methods and the Split Augmented Lagrangian Shrinkage Algorithm (SALSA), and then it deals with the effect of the regularization parameter on the result image. The proposed method proves that the parameter is determined by the noise and the gradient of the image. Results of the recovery of images were compared with different gradient and noise, and they help to reach a conclusion that the proposed method maximizes the improvement in Signal to Noise Ratio (ISNR). The method also removed noise and protected the details of the image in the processing of recovery as much as possible.]]></description>
<pubDate>2012/9/12 9:00:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Lingda<sup>1,2</sup> and HAO Hongxing<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Lingda<sup>1,2</sup> and HAO Hongxing<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204016]]></guid><cfi:id>201</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Rotation symmetric Boolean functions in even-variable with maximum algebraic immunity]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Algebraic immunity has been considered as one of significant properties for Boolean functions. Two constructions of rotation symmetric Boolean functions (RSBFs) in even-variable with maximum algebraic immunity(MAI) were proposed. Furthermore, the nonlinearity of constructed RSBFs were investigated under special cases of Construction 2. When n≥18, the constructed MAI RSBFs by using Construction 3 have higher nonlinearity than that of all known MAI RSBFs in even-variable.]]></description>
<pubDate>2012/9/12 9:00:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DONG Deshuai<sup>1</sup>,LI Chao<sup>1</sup>,QU Longjiang<sup>1</sup> and FU Shaojing<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DONG Deshuai<sup>1</sup>,LI Chao<sup>1</sup>,QU Longjiang<sup>1</sup> and FU Shaojing<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204017]]></guid><cfi:id>200</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A knowledge-assisted framework for video semantic concept detection]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Semantic concept detection in video is a challenge for video semantic content analysis. The performance of semantic concept detection methods depends on modeling and matching the video semantic content exactly. In this research, perception concept and semantic concept were defined to abstract and model video semantic content. Furthermore, the knowledge-assisted framework for semantic concept detection was proposed, in which the context knowledge was modeled using ontology, and the semantic concepts were detected by combining with low-level features and context information. Finally, the linear fusion strategy was used to fuse the matching results and detect the semantic concepts. The proposed method was demonstrated in a news video domain and shows promising results.]]></description>
<pubDate>2012/9/12 9:00:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[BAI Liang<sup>1</sup>,LAO Songyang<sup>1</sup>,HOU Xiaoqiang<sup>2</sup>,LIU Haitao<sup>1</sup> and BU Jiang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>BAI Liang<sup>1</sup>,LAO Songyang<sup>1</sup>,HOU Xiaoqiang<sup>2</sup>,LIU Haitao<sup>1</sup> and BU Jiang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204018]]></guid><cfi:id>199</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and implementation of software remote updating in a vehicle-mounted intelligent  terminal based on Kylin embedded operating system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to achieve the software remote updating of the vehicle-mounted intelligent terminal based on the Kylin operating system, a design is proposed. The GPRS technology, IAP method, response mechanism, technique of resume from transfer breakpoint and checkout mechanism were applied to the design to insure the real-time, veracity and reliability of during the updating process. A series of experiments were conducted to simulate the exception during the updating process. The results show that the software of remote updating of the terminal applying the design proposed can still complete exactly in all exceptional experiments.]]></description>
<pubDate>2012/9/12 9:00:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DU Liebo<sup>1</sup>,TU Qing<sup>1</sup>,LUO Wusheng<sup>1</sup> and RAN Zai<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DU Liebo<sup>1</sup>,TU Qing<sup>1</sup>,LUO Wusheng<sup>1</sup> and RAN Zai<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204019]]></guid><cfi:id>198</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An improved algorithm for computing observing angle of agile imaging satellite based on ellipsoid kinematic model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The problem of computing the observing angle of an agile imaging satellite was discussed. Considering the constrains of the earth rotation and the satellite moving on its orbit, the kinematic model based on ellipsoid was established by means of space reference frame transformation. Based on this model, the algorithm for computing observing angle at any given visible time was proposed. The results show the efficiency of our approach. The acquired observing angle supports the task scheduling of agile imaging satellite.]]></description>
<pubDate>2012/9/12 9:00:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUO Hao,WANG Hao and QIU Dishan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUO Hao,WANG Hao and QIU Dishan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204020]]></guid><cfi:id>197</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An efficient parallel PCA-SIFT algorithm for multi-core processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An efficient parallel PCA-SIFT algorithm for multi-core processor is proposed, which adopts data-level parallel method to implement parallel key points extraction and matching. The computing tasks were assigned to four DSP cores for parallel processing, which fully develops multi-level parallelism of multi-core processor. The experimental results show that the parallel PCA-SIFT algorithm has good adaptability for various distortion images and the image matching ability is close to the sequential algorithm with the average speedup 3.12.]]></description>
<pubDate>2012/9/12 9:00:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Zhong,XING Binchao and Chen Yueyue]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Zhong,XING Binchao and Chen Yueyue</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204021]]></guid><cfi:id>196</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A global schedule mechanism for PDES on multi-core environments]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The current trend in processor architecture design adopts the integration of multiple cores on a single processor. The tightly integrated processing cores in one chip with communication latencies substantially lower than those present in conventional clusters provide potential performance improvement especially for the fine-grained PDES. Thus, in the PDES domain, one of the research focuses is on modifying software platforms to efficiently utilize the computation resources of multi-core processors. The current dynamic load balancing technologies for PDES cannot reach the twin goals of good balance and low event-scheduling overhead. By taking advantage of multi-core architecture with shared memory address space and low communication, a global schedule mechanism based on a distributed event queue is proposed. Its specially designed data structures and algorithms reduced the cost of lock operations much. In comparison with the distributed event queue local schedule mechanism, the experiment results show that the distributed queue global schedule mechanism can effectively reduce the rollback rate and balance the workloads at a low event scheduling cost for Time Warp system on multi-core platforms.]]></description>
<pubDate>2012/9/12 9:00:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Lili<sup>1,2</sup>,YAO Yiping<sup>2</sup> and CAI Lu<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Lili<sup>1,2</sup>,YAO Yiping<sup>2</sup> and CAI Lu<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204022]]></guid><cfi:id>195</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Parallel optimization methods for raster data processing algorithms of neighborhood-scope]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As parallel computing has become mature and practical, data intensive raster data processing algorithms are desiderating parallel computing technologies to reduce the running time. The objectives of this research focuses on the parallelization of neighborhood-scope algorithms. the sequential/parallel temporal model was developed, the affecting factors of each component of the temporal model were analyzed, and two optimization methods were proposed, which can further promote the parallel performance of neighborhood-scope algorithms: the Parallel I/O method that can reduce the data I/O cost; and the Halo Prediction method that can reduce the data communication cost. Experiments verified the effectiveness and efficiency of the proposed optimization methods, which can further promote the parallel performance by making the parallel algorithmic program fully take advantage of parallel computing resources.]]></description>
<pubDate>2012/9/12 9:00:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHENG Guo,JING Ning,CHEN Luo,XIONG Wei and OUYANG Liu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHENG Guo,JING Ning,CHEN Luo,XIONG Wei and OUYANG Liu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201204023]]></guid><cfi:id>194</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and optimization of the vector memory applying for SDR]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To meet the high memory bandwidth of SDR-oriented SIMD DSPs, a novel Vector Memory(VM) architecture is proposed. The VM consists of 16-way Vector Memory  Blocks(VBs), and each VB contains two groups of multi-bank memory structure with low-order interleaved addressing. This structure aims at reducing the memory access conflicts, making best use of the bandwidth of the multi-bank memory, and realizing the parallel vector data access at the cost of low power consumption. Besides, a vector rearrangement unit is designed and implemented in the VM to support the 16-way unaligned SIMD vector access and share the VM space. Experimental results show that the proposed VM architecture can efficiently reduce or  eliminate the data shuffling operations and speed up SDR applications.]]></description>
<pubDate>2012/8/28 10:28:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Haiyan,LIU Sheng,LIU Zhong and CHEN Shuming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Haiyan,LIU Sheng,LIU Zhong and CHEN Shuming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203020]]></guid><cfi:id>193</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A semantic correctness oriented relational database access method]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Nowadays, organization faces the problem of acquiring correct information from data asset to support decision-making. To solve this problem, a semantic correctness oriented relational data access method, namely SCORDA, is proposed. Firstly, ontology was used to describe the concept view, which is used in data access task, and  description logic makes a suitable tradeoff between expressiveness and complexity. Secondly, a LAV+GAV mapping formalism was adopted to solve the schema heterogeneity and impedance mismatch problem. Furthermore, a special structure named dynamic ABox is provided to deal with the instance checking problem, and to ensure the semantic correctness of answers based on the model theory semantic of ontology. Finally, the feasibility of SCORDA method, through implementing a prototype system， was validated.]]></description>
<pubDate>2012/8/28 10:28:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TANG Funian,YAO Li,LI Jinyang and YAO Li]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TANG Funian,YAO Li,LI Jinyang and YAO Li</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203021]]></guid><cfi:id>192</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Alert correlation graph：a novel method for quantitative vulnerability assessment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As a model-based vulnerability analysis technology, attack graphs can identify network vulnerabilities and their interactions; they can also reveal all possible attack paths and potential threats. Based on the attack graphs, alert correlation graphs are proposed in the paper. An alert correlation graph maps real-time IDS alerts into attack paths using prior knowledge encoded in attack graph, and reveals attack progresses and attackers’ intention dynamically. A novel quantitative network vulnerability assessment method is presented based on the alert correlation graph, which analyzes network vulnerabilities by dynamically computing the weight of alert correlation edges. The research also demonstrates, by examples, that the proposed method combines static prior knowledge about network vulnerabilities with dynamic attackers’ intentions, and reveals the change of network vulnerability under real-time attacks.]]></description>
<pubDate>2012/8/28 10:28:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Yi,ZHAO Kai and LAI Ben]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Yi,ZHAO Kai and LAI Ben</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203022]]></guid><cfi:id>191</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An on-chip DC Signal Amplifier based on linear frequencymodulation and demodulation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To amplify the DC signal is a discommodious issue, because of the on-chip DC signal has such properties as little swing, less coherence and likeliness to be interfered. In light of this, a “voltage-frequency-voltage” mode DC signal amplifier is proposed, in which the frequency is the carrier signal. This amplifier is highly linear, and is equipped with a high linearity “voltage-frequency” modulator and a “frequency-voltage” de-modulator. The simulation experimental results show that the DC signal amplifier amplifies the input voltage signal efficiently while achieving stable high linearity, and the DC gain is 2.4.]]></description>
<pubDate>2012/8/28 10:28:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MA Zhuo,PAN Guoteng,GUO Yang and XIE Lunguo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MA Zhuo,PAN Guoteng,GUO Yang and XIE Lunguo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203027]]></guid><cfi:id>190</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on self-adaptive communication mechanism for high performance RTI]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To promote the execution efficiency of HLA system which executes on high performance computing (HPC) platform, a self-adaptive communication mechanism, named SACM, is proposed for the hierarchy communication environment of HPC. By this mechanism, the connection with lowest latency can be established from the network information of computing nodes. The shared memory, high speed IB network and Ethernet network can be selected by federates adaptively. Aiming at the demand of shared memory communication between federates within one node, a high speed shared memory communication algorithm based on distributed infrastructure is proposed, and the communication performance can be improved by this algorithm. Experiment result of object attributes value updating latency has shown that the communication performance of RTI executing on HPC platform has been greatly improved.]]></description>
<pubDate>2012/8/28 10:28:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIANG Hongbo<sup>1,2</sup>,LIU Lin<sup>3</sup>,YAO Yiping<sup>1</sup>,Liu Buquan<sup>1</sup>,MU Xiaodong<sup>2</sup> and Li Meng<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIANG Hongbo<sup>1,2</sup>,LIU Lin<sup>3</sup>,YAO Yiping<sup>1</sup>,Liu Buquan<sup>1</sup>,MU Xiaodong<sup>2</sup> and Li Meng<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203029]]></guid><cfi:id>189</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Self-healing circuit design inspired by prokaryotic cell]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203030]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Bio-inspired array is a new type of circuit based on the self-healing mechanism of organism. The current study presents a novel prokaryotic cell based bio-inspired array structure based on the gene structure of eukaryotic cell and prokaryotic cell. Simulation experiment on designing a self-healing DBPSK circuit is carried out and the result shows that the presented prokaryotic cell-based bio-inspired array structure is effective and consumes less memory storage than the traditional eukaryotic array structure.]]></description>
<pubDate>2012/8/28 10:28:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Yue,WANG Nantian and QIAN Yanling]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Yue,WANG Nantian and QIAN Yanling</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201203030]]></guid><cfi:id>188</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The number field sieve with three number fields]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The mathematical security of the RSA cryptosystem is based on the problem of factoring large integers. At present, the number field sieve is the most efficient algorithm known for factoring integers larger than 365 bits, while its time complexity is still sub-exponential. Integers larger than 1024 bits, which are widely used in RSA cryptosystem, cannot be factored by means of the number field sieve. So it is significant to study the number field sieve.Now, the general number field sieve often uses two number fields, while multiple number fields are seldom considered. The general number field sieve, through adaptation, can use three number fields, i.e. two algebraic number fields and one rational number field. Analysis shows that the time complexity of the modified number field sieve and the general number field sieve are at the same level. However, the modified number field sieve can combine more computation, so it can save more time in practice. Finally, the result is verified by two experiments.]]></description>
<pubDate>2012/8/28 10:27:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GU Haihua<sup>1,2</sup>,GU Dawu<sup>1</sup>,XIE Wenlu<sup>2</sup>,LI Sheng<sup>1</sup> and YAN Jiaju<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GU Haihua<sup>1,2</sup>,GU Dawu<sup>1</sup>,XIE Wenlu<sup>2</sup>,LI Sheng<sup>1</sup> and YAN Jiaju<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202001]]></guid><cfi:id>187</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Dual system encryption revisited: attaining fully secure identity-based encryption and its extensions]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Dual system encryption was first proposed by Waters as a powerful method to prove full security for identity-based encryption (IBE) schemes and its extensions. To construct fully secure schemes, the application of dual system encryption is considered and a generic construction of fully secure schemes is presented. The construction combines a dual system encryption IBE scheme with a normal secure scheme and produces a new scheme which can be proven secure by dual system encryption. Based on the proposed generic construction, an instantiation, which is a hierarchical identity-based encryption (HIBE) scheme with constant ciphertext size, is presented. This scheme is more efficient than Waters’ original dual system encryption HIBE scheme, and it is proven fully secure under the Decision BDH and Decision Linear assumptions.]]></description>
<pubDate>2012/8/28 10:27:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LUO Song<sup>1,2</sup>,CHEN Yu<sup>1,3</sup> and CHEN Zhong<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LUO Song<sup>1,2</sup>,CHEN Yu<sup>1,3</sup> and CHEN Zhong<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202002]]></guid><cfi:id>186</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Two quantum dialogue schemes based on Bell states and two-qutrit 
entangled states without information leakage]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Drawing on the idea of the quantum secure direct communication (QSDC), a novel quantum dialogue scheme based on Bell states is presented in this paper. The proposed scheme can realize authorized parties’ secure exchange of their respective secret messages simultaneously only through one communication. In this scheme, a random bit string and checking particles are used to ensure the security; the scheme is secure against eavesdropper's commonly used attacks, such as intercept/resend attack, Trojan horse attack and entanglement attack. A serious problem called “information leakage” or “classical correlation” is found in some quantum dialogue protocols, namely, any eavesdropper can elicit some information about the secret from the classical communication of the legal users. Fortunately, our protocol can discard the drawback “information leakage”. In addition, our protocol possesses high efficiency 66.7% and is feasible. Finally, the protocol is applied to the scheme based on two-qutrit entangled states with a secure communication.]]></description>
<pubDate>2012/8/28 10:27:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG He<sup>1,2</sup>,ZHANG Yuqing<sup>2</sup>,HU Yupu<sup>1</sup>,TIAN Yangli<sup>1,2</sup> and ZHU Zhenchao<sup>1,2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG He<sup>1,2</sup>,ZHANG Yuqing<sup>2</sup>,HU Yupu<sup>1</sup>,TIAN Yangli<sup>1,2</sup> and ZHU Zhenchao<sup>1,2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202003]]></guid><cfi:id>185</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The ANFs of the component functions of AES round transformation and its application]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The Algebraic Normal Form (ANF) of a Boolean function is unique, which is very important in the research of Boolean function. The 128 ANFs of the component functions of the round transformation (the composition of Sbox, ShiftRow and MixColumn)of the Advanced Encryption Standard(AES) were obtained by using the Mathematica software. Each component function is a 32-variable Boolean function. The number of terms is between 448 and 545, and the average number is 496, which is much smaller than 2<sup>31</sup>, the number of terms of a random 32-variable Boolean function. This shows a great deviation of the AES round transformation with a random permutation. The time complexity of getting the 128 ANFs of the AES round transformation is only a few minutes on a PC with a 2GHz CPU. The method is better than the classical one in computing the ANF from truth table, with total time complexity of obtaining the 128 ANFs O(128×32×2<sup>32</sup>) = O(2<sup>44</sup>). As an application, an equation system for 1-full round of AES was obtained by using the ANFs. The equation system was solved by using Cryptominisat 2.9.0. By the method of Guess-and-Determine, the 128 bits of keys can be recovered in less than 2<sup>33</sup>hours on a PC with one known plaintext.]]></description>
<pubDate>2012/8/28 10:27:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[PENG Changyong<sup>1,2</sup>,ZHU Yuefei<sup>1</sup>,KANG Fei<sup>1</sup> and MI Shunqiang<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>PENG Changyong<sup>1,2</sup>,ZHU Yuefei<sup>1</sup>,KANG Fei<sup>1</sup> and MI Shunqiang<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202004]]></guid><cfi:id>184</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A note on the Tu-Deng function]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In 2009, based on a combinatorial conjecture, Tu and Deng constructed a class of Boolean functions in even variables with optimal algebraic immunity, optimal algebraic degree and good nonlinearity. This class of functions is called the Tu-Deng function. Based on the same conjecture, they also proposed a class of resilient functions in even variables with suboptimal algebraic immunity, optimal algebraic degree and good nonlinearity. By studying the cryptographic properties of the concatenation of two Boolean functions derived from the Tu-Deng function, based on Tu-Deng's conjecture, a class of resilient Boolean functions in odd variables is proposed. This class of functions has suboptimal algebraic immunity, optimal algebraic degree and good nonlinearity.]]></description>
<pubDate>2012/8/28 10:27:54</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DU Yusong<sup>1,2</sup> and ZHANG Fangguo<sup>1,3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DU Yusong<sup>1,2</sup> and ZHANG Fangguo<sup>1,3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202005]]></guid><cfi:id>183</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Halving on binary Edwards curves]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The formulas of binary Edwards curves which can be halved are transformed from the doubling ones by using the symmetry of the formulas. Two situations are to be handled in the derivation by the parameters of the curves. In the case of d<sub>1</sub>≠d<sub>2</sub>, it is naturally to get a halving algorithm by using the relation of birational equivalence from the Weierstrass curves, the trace functions and the half-trace functions. In the case of d<sub>1</sub>＝d<sub>2</sub>, a theorem is given to prove it. It is not easy to get a halving algorithm, although the doubling formulas are simpler in this case. Then the efficiency of the halving algorithm is analyzed. The result shows that the efficiency of the halving algorithm cannot catch up with that of the doubling one. Using the ω-coordinate, the halving algorithm is simplified, and is further used to compute the scalar multiplication.]]></description>
<pubDate>2012/8/28 10:27:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIN Qiping<sup>1</sup> and ZHANG Fangguo<sup>1,2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIN Qiping<sup>1</sup> and ZHANG Fangguo<sup>1,2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202006]]></guid><cfi:id>182</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[4-dimensional GLV method on GLS elliptic curves with j-invariant 1728]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to obtain a fast multiplication on elliptic curves, the Gallant-Lambert-Vanstone(GLV) method is introduced to the general situation in dimension 4, one of the open problems in Galbraith, Lin and Scott's work(J. Cryptol. DOI: 10.1007/s00145-010-9065-y) is answered, that is, studying the performance of 4-dimensional GLV method for faster point multiplication on some GLS curves over Fp<sup>2</sup> with j-invariant 1728. Finally some results and examples are presented, showing that the 4-dimensional GLV method runs in between 70% and 73% the time of the 2-dimensional GLV method which Galbraith et al. did in their work.]]></description>
<pubDate>2012/8/28 10:27:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SONG Chenggen,XU Maozhi and ZHOU Zhenghua]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SONG Chenggen,XU Maozhi and ZHOU Zhenghua</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202007]]></guid><cfi:id>181</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Related-key amplified boomerang attack on 8-round MISTY1]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The key schedule algorithm plays a crucial role in the block cipher, thus many attacks pay more attention to it at present. Through analyzing the non-linear function FI and the key schedule algorithm of MISTY1, and observing the distribution of subkeys as well, a weak-key class of MISTY1 was found, which encompasses 2<sup>90</sup>weak keys that are vulnerable to related-key amplified boomerang attack. Based on the weak-key class, two related-key differential characteristics were found. Then, the research presented a 7-round related-key amplified boomerang distinguisher of MISTY1, which can accomplish an attack on the 8-round MISTY1 without the last FL lay. The attack requires 2<sup>63</sup>chosen plaintexts, and the time complexity of the attack is 2<sup>70</sup>. The attack is the first attack on MISTY1 without the last FL lay. Besides, compared with the similar attacks, the limit of the related-key of our attack is released.]]></description>
<pubDate>2012/8/28 10:27:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Shaozhen and DAI Yibin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Shaozhen and DAI Yibin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202008]]></guid><cfi:id>180</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Construction of rotation symmetric Boolean function with maximum algebraic immunity]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Algebraic Immunity has been considered as one of significant cryptographic properties for Boolean functions. In order to resist algebraic attack, high algebraic immunity is necessary for those Boolean functions used in symmetric cipher algorithms. Based on “orbit exchange” technique, this research presents a construction of rotation symmetric Boolean functions with the maximum algebraic immunity on even number of variables. These functions have strong resistance against algebraic attacks. These functions also have much better nonlinearity and optimal algebraic degree.]]></description>
<pubDate>2012/8/28 10:27:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Chao<sup>1,2</sup>,XUE Chaohong<sup>1</sup> and FU Shaojing<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Chao<sup>1,2</sup>,XUE Chaohong<sup>1</sup> and FU Shaojing<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202009]]></guid><cfi:id>179</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A note on a theorem of Carlitz]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The study of permutation polynomials over finite fields has been a hotspot research topic for a long time. In fact, it is equivalent to the study of one-to-one mapping between finite fields. Therefore, it has many important applications in coding theory, cryptography and algebraic curves, etc. Carlitz had a characterization of permutation polynomials. He proved that if f(x)is a polynomial with coefficients over finite field Fq satisfyingf(0)=f(1) and η(f(a)-f(b)=η(a-b)for every a,b∈Fq, where η is the quadratic character of Fq* . Then f(x)=x<sup>pj</sup>for some integer. In this note, we proved that the above result is also true for any multiplicative character of Fq*.]]></description>
<pubDate>2012/8/28 10:27:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CAO Xiwang<sup>1,2,3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CAO Xiwang<sup>1,2,3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202010]]></guid><cfi:id>178</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Analysis on the consistent degree of addition modulo 2<sup>n</sup> with XOR
for associative law]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Addition modulo 2<sup>n</sup>and XOR addition are two code links which are often used in cipher algorithms, the consistent degree of the two links means the difference degree when the computing sequence is changed in the equation including the two links. The difference function between addition modulo 2<sup>n</sup> and XOR addition corresponding to associative law is studied. When the computing sequence of ［(x⊕y)+z］mod 2<sup>n</sup> is changed, the computation formulae of the probability distribution of the difference function ξ(x,y,z)=［(x⊕y)+<sub>n</sub><sup>z</sup>］⊕［x⊕(y+<sub>n</sub><sup>z</sup>)］ is given, and the square sum of the probability is given too. The results presented are useful for some distinguishing attack.]]></description>
<pubDate>2012/8/28 10:27:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUAN jie,JIN Chenhui and CHANG Yaqin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUAN jie,JIN Chenhui and CHANG Yaqin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202011]]></guid><cfi:id>177</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on involutional linear transformations based on
rotation and XOR]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Linear transformation with good branch number plays a significant role in designing components of symmetric key primitives. Linear transformation based on XOR of several rotations can be efficiently implemented, and has been widely used in the block ciphers such as SMS4, HIGHT and the hash functions SHA-2, MD6. Besides, if the linear transformation is involutional, it will facilitate the decryption process. In view of this, a kind of involutional linear transformation based on the XOR of several rotations was studied, the numeration of this kind of linear transformation was given and the branch number was shown to be upper bounded by 4. Meanwhile, the relationship between the parameters of the rotations and the branch number was discussed, which provides a theoretical basis for the design. ]]></description>
<pubDate>2012/8/28 10:27:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Ruilin,XIONG Hai and LI Chao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Ruilin,XIONG Hai and LI Chao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201202012]]></guid><cfi:id>176</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Program characteristics analysis-based VLIW compression and decompression on stream processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Huge code cubage and poor code density have always been a serious problem in VLIW processors. Through analyzing the code characteristics of a series of typical applications on stream processor, a novel domain-divided VLIW code compression scheme to eliminate the nop operations in each domain, and a distributed instruction memory to decompress and execute of the codes are proposed. The experiments show that this scheme can reduce nearly 39% of the off-chip instruction memory accessing and about 65% of the on-chip instruction memory space demand. Meanwhile, it can also depress the area of on-chip instruction memory and MASA stream processor by 37% and 8.9% respectively.]]></description>
<pubDate>2012/8/27 9:46:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUAN Maolin<sup>1</sup>,HE Yi<sup>2</sup>,YANG Qianming<sup>1</sup> and ZHANG Chunyuan<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUAN Maolin<sup>1</sup>,HE Yi<sup>2</sup>,YANG Qianming<sup>1</sup> and ZHANG Chunyuan<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201027]]></guid><cfi:id>175</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[OLDA-based method for online topic evolution 
in network public opinion analysis]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The topic evolution was investigated for network public opinion analysis. The properties of network public opinion information were analyzed firstly. Based on the properties, the latent semantics of textual data for network public opinion was described by using the topic model, and the text streams are modeled with a consideration of time for online analysis. Furthermore, a topic evolution method based on OLDA was proposed by incorporating the correlation of topics among time slices. The proposed method was experimentally verified to be efficient for detecting topic evolution of network public opinion. ]]></description>
<pubDate>2012/8/27 9:46:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Yanli,BAI Liang and ZHANG Weiming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Yanli,BAI Liang and ZHANG Weiming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201029]]></guid><cfi:id>174</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A New uniform threshold function of wave-shrink]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201030]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A new uniform threshold function of wave-shrink for image denoising is proposed. The new function has the advantage of satisfying the shrinkage condition. By changing the parameter u,we can change the trend of this new function, which makes it possible to find an adaptive method whenever using the wavelet shrinkage method for image denoising. Finally, efficient formulas for computing mean , variance and risk of the new uniform threshold function are derived. Numerical experiments and comparative studies are performed, demonstrating the effectiveness of our threshold function. Additionally, the proposed new function can also give better performance in terms of both PSNR and in visual quality.]]></description>
<pubDate>2012/8/27 9:46:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Cailian<sup>1</sup>,LI Zhixian<sup>2</sup>,SUN Jixiang<sup>1</sup> and KANG Yaohong<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Cailian<sup>1</sup>,LI Zhixian<sup>2</sup>,SUN Jixiang<sup>1</sup> and KANG Yaohong<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201030]]></guid><cfi:id>173</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Key techniques for percutaneous coronary intervention virtual simulation system about coronary heart disease]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201031]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The percutaneous coronary intervention virtual simulation system about coronary heart disease is one of the important tools for medical intervention training. To satisfy the clinical training needs, the key techniques about geometry modeling, heartbeat simulation, liquid simulation and flexible instrument movement processing in systerm development were discussed. A blood vessel model based on NURBS surface and a heartbeat model based on a combined mass-spring were proposed. Contrast media injection and flexible instrument movement were realized by the particle systerm and the multi-branch tree method. A simulation platform and technology support was supplied for percutaneous coronary intervention training. ]]></description>
<pubDate>2012/8/27 9:46:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAN Ke<sup>1</sup>,PAN Xinhua<sup>1</sup>,XIONG Yueshan<sup>2</sup>,,WANG Yanzhen<sup>2</sup> and XU Kai<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAN Ke<sup>1</sup>,PAN Xinhua<sup>1</sup>,XIONG Yueshan<sup>2</sup>,,WANG Yanzhen<sup>2</sup> and XU Kai<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201031]]></guid><cfi:id>172</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A new study on fractal morphing method with fractal feature preserved]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201032]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[According to the appearance of fractal feature degeneration during fractal morphing, a new feature corresponding method based on local attractor’s approximate convex hull (LAA) and revolving matching method (RMM) is introduced. The local attractor, part of the whole IFS attractor, is indicated by an independent IFS code, whose internal contractive affine transformations have unique fixed points, and the LAA is constructed by contouring the convex hull of all the fixed points of the IFS. It is proved that the similarity between different IFS’s LAAs is equivalent to the similarity of its local attractors, so the feature corresponding can be built upon the LAAs. The matching between two LAAs is based on RMM and the matching order is restricted clockwise or anticlockwise. Then, the feature corresponding between two IFS’s local attractors is determined by searching for the most similar matching of the LAAs. Finally, the parameters of the iterated function are linearly interpolated to finish the morphing procedure of two IFS’s fractal attractors and to perform the fractal morphing with fractal feature preserved.]]></description>
<pubDate>2012/8/27 9:46:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHUANG Yixin and XIONG Yueshan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHUANG Yixin and XIONG Yueshan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201201032]]></guid><cfi:id>171</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multi-sensor image matching based on segmentation similarity]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201306020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Multi-sensor image matching is meritorious both in vision mechanism studies and vision engineering. Image segmenting is an effective method for abstracting image properties, but due to the features of images with different sources, the image segmenting method cannot guarantee agreeable image properties from different sources. With a view to this problem, a method is proposed by segmenting the multi-sensor images before the matching strategy is used. Two matching strategy, the segmentation similarity and the minimal edges, can detect the right match. Matching experiments between optic and infrared images demonstrate its effectiveness.]]></description>
<pubDate>2014/1/8 17:09:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Xiang<sup>1,2,3</sup>,LEI Zhihui<sup>1,3</sup>,ZHU Xianwei<sup>1,3</sup>,YUAN Yun<sup>1,3</sup> and YU Qifeng<sup>1,3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Xiang<sup>1,2,3</sup>,LEI Zhihui<sup>1,3</sup>,ZHU Xianwei<sup>1,3</sup>,YUAN Yun<sup>1,3</sup> and YU Qifeng<sup>1,3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201306020]]></guid><cfi:id>170</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The multi-donor kidney exchange problem]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201306023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The kidney for transplantation is in serious shortage. To alleviate this problem, more and more countries have started various kidney exchange programs. The kidney exchange problem (KE) is generally modeled as a cooperative game. Each player represents an incompatible patient-donor pair. A patient may have more than one incompatible donor in reality. In light of this, the multi-donor kidney exchange game (MDKE) was defined. The structures of MDKE's feasible solutions and stable solutions were studied. It was proved that donating multiple kidneys is useless in joining in a better stable solution. Furthermore, the TTC algorithm, the NP-hardness of a stable solution and the inapproximability of a maximum cover stable solution of KE were extended to MDKE. Experiments show the effectiveness of MDKE.]]></description>
<pubDate>2014/1/8 17:09:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Gang and LUO Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Gang and LUO Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201306023]]></guid><cfi:id>169</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Accelerating RNA secondary structure prediction 
applications based on CPU-GPU hybrid platforms]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201306024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Prediction of ribonucleic acid (RNA) secondary structure remains to be one of the most important research areas in bioinformatics. The Zuker algorithm is one of the most popular methods of free energy minimization for RNA secondary structure prediction. However, general-purpose computers including parallel computers or multi-core computers exhibit parallel efficiency of no more than 50% on Zuker. For this problem, a CPU-GPU hybrid computing system that accelerates the Zuker algorithm applications for RNA secondary structure prediction is proposed. The computing tasks were allocated between CPU and GPU for parallel cooperate execution. Performance differences between the CPU and the GPU in the task-allocation scheme were considered to obtain workload balance. To improve the hybrid system performance, the Zuker algorithm was optimally implemented with special methods for CPU and GPU architecture. A speedup of 15.93× over optimized multi-core SIMD CPU implementation and performance advantage of 16% over optimized GPU implementation were shown in the experimental results. More than 14% of the sequences were executed on CPU in the hybrid system. To the best of our knowledge, our implementation combining CPU and GPU is the only accelerator platform implementing the complete Zuker algorithm. Moreover, the hybrid computing system is proven to be promising and applicable to accelerate other bioinformatics applications.]]></description>
<pubDate>2014/1/8 17:09:36</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIA Fei,ZHU Qianghua and JIN Guoqing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIA Fei,ZHU Qianghua and JIN Guoqing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201306024]]></guid><cfi:id>168</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Parallel processing framework for huge 
geographic raster data]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201306026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the advance of technology, geographic raster data's amount increases continuouslly. Single process cannot process large raster data efficiency, so it is necessary to adopt parallel processing. Traditional development method mixes algorithm, processes scheduling, memory management and data I/O together, thus it presents higher requirements for programmers and the code quality is difficult to control. This study proposes a Huge Geographic Raster Data Parallel Processing Framework (HGRDPPF). With the use of core class's real read and virtual read method, framework can achieve a large raster data's fast loading and writing by steps or blocks, and can achieve parallel task scheduling, data transfer and specific algorithm stage into tasks; through this framework, the raster file is split into sub-tasks according to the ability of computer in the cluster, and separate the raster processing algorithm from MPI API, disk IO and logic, developers can concentrate onto the algorithm itself, and achieve higher program quality. Experiments show that this framework can significantly reduce the amount of code while improving software quality, and to achieve a better parallel performance.]]></description>
<pubDate>2014/1/8 17:09:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Dianhua<sup>1</sup> and PAN Xin<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Dianhua<sup>1</sup> and PAN Xin<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201306026]]></guid><cfi:id>167</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The tabletop collaboration method using 
territoriality-based pattern]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Territoriality-based collaboration is one of the ways to realize situation awareness in tabletop collaboration. Thus the implementation pattern of territoriality-based collaboration was proposed, and three territorialities i.e. storage territory, private territory, public territory, were described. The realization mechanism of territoriality-based collaboration was given afterwards, including multi-touch points management, display management and conflict processing mechanism. Finally, situation awareness platform using territoriality-based collaboration was implemented, whose performance was verified through user testing experiments. ]]></description>
<pubDate>2013/11/6 15:57:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YAN Houyi<sup>1</sup>,LING Yunxiang<sup>1</sup>,ZHANG Guohua<sup>1</sup> and SHAO Hongtao<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YAN Houyi<sup>1</sup>,LING Yunxiang<sup>1</sup>,ZHANG Guohua<sup>1</sup> and SHAO Hongtao<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305013]]></guid><cfi:id>166</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Discriminative and collaborative representation for 
visual classification based on compressive sensing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A low computation complexity, which is a very efficient representation of image for visual classification tasks, is presented. The collaborative representation was combined with discriminative ingredient in a unified framework, which is an extended version of collaborative representation-based classification. The coefficients of collaborative representation of test samples are sparse and robust to occlusion or other disguises based on redundant and over-complete dictionary. Besides, the discriminative information was exploited by minimizing the within-class scatter and maximizing the between-class scatter, which is very helpful for visual classification tasks. Experimental results on some widely used benchmark datasets indicate that the proposed method can achieve competitive performance with other existing works.]]></description>
<pubDate>2013/11/6 15:57:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIANG Fengtao,WANG Zhengzhi and YUAN Xingsheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIANG Fengtao,WANG Zhengzhi and YUAN Xingsheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305015]]></guid><cfi:id>165</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Herd behavior in the dissemination of public opinion on the internet 
based on evolutionary game model with incomplete information]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The spread of public opinion across the Internet in China was proposed by constructing a two-player symmetric evolutionary game model with incomplete information, since most of the players have limited knowledge about the spread and exact nature of public opinion. The two-player symmetric game model was presented to decide the strategic choice of players, and the replicated dynamic equation was built to explain the evolution directions of different strategic groups. The memory length of players, updates views and memory list were introduced according to the interaction rules. The simulation result shows that it is easy for players to follow trends under such circumstances, leading to herd behavior and a world in which most players adopt the same view. Furthermore, herd behavior is affected by a series of factors: most notably analysis-strategy based interactive interests, cost coefficients, and memory length. This research offers insights for practical application on how to analyze and guide the spread of public opinion on the internet.]]></description>
<pubDate>2013/11/6 15:57:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Jinde and LIU Yongmei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Jinde and LIU Yongmei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305016]]></guid><cfi:id>164</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Human action recognition based on pLSA model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A human action recognition method based on a probabilistic topic model is proposed. Firstly, the method extracts space-time interest points to describe human motion. Then the slow feature analysis algorithm was proposed to calculate the invariant optimal solution of the gradient information of space time points. Lastly human actions were recognized with the probabilistic latent semantic analysis(pLSA). The invariant optimal solution of the gradient information can express the inherent characteristics of STIP, and it can also reflect the space and time information of STIP discriminatively. For solving the problem of latent topics that are not guaranteed in pLSA, the topics obtained in supervised fashion correspond to action labels one by one. Action recognition results were presented on KTH human motion data set and Weizmann human action data set. Our results show that the action recognition rates of the tow dataset are respectively more than 91.50% and 97%. ]]></description>
<pubDate>2013/11/6 15:57:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAN Lunzheng<sup>1</sup>,XIA Limin<sup>1</sup>,HUANG Jinxia<sup>1</sup> and XIA ShengPing<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAN Lunzheng<sup>1</sup>,XIA Limin<sup>1</sup>,HUANG Jinxia<sup>1</sup> and XIA ShengPing<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305017]]></guid><cfi:id>163</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A global dynamic routing strategy based on capacity 
utilization ratio on scale-free networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[How to improve the transmission efficiency is one of the most important problems in complex networks. Thus the traffic dynamic for scale-free networks with heterogeneous node capacity is studied, and a global dynamic routing strategy based on capacity utilization ratio (CUR routing) is proposed to improve the networks' transportation performance. The CUR routing strategy chooses the route according to the minimum value of the cost function which is based on the utilization ratio of node capacity. Simulation results show that, compared with the classic shortest path routing strategy, the CUR routing strategy can enhance the network capacity several times than the at the cost of a slightly growth in the average path-length. Moreover, the comparison with the efficient routing strategy also reveals the prominent performance of the CUR routing strategy.]]></description>
<pubDate>2013/11/6 15:57:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Pengcheng and HONG Chen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Pengcheng and HONG Chen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305018]]></guid><cfi:id>162</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The simulation on the delay jitter of spacewire]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[SpaceWire is the new space bus standard proposed by ESA, which has been successfully applied in many projects. Delay jitter is the key parameter to reflect the network transmission performance, which measures the difference between the maximum transmission delay and the minimum transmission delay from end to end. Through theoretical calculations and modeling simulations, a quantitative analysis and research for the delay jitter of the SpaceWire under specific application scenarios was carried out. Theoretical calculations obtained the delay jitter under particular scenarios by theoretical derivation. Modeling simulations, on the other hand, established simulation model by Opnet, and obtained the maximum transmission delay and minimum transmission delay by simulation. In this way, the delay jitter was calculated both qualitatively and quantitatively, and the parameters which have key impact on delay jitter were obtained. Recommendations and methods to improve the delay jitter were given by analyzing the conclusions. The research results of this article can provide a reference for the SpaceWire design to build a low delay jitter SpaceWire network.]]></description>
<pubDate>2013/11/6 15:57:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HOU Jianru and CHEN Xiaomin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HOU Jianru and CHEN Xiaomin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305019]]></guid><cfi:id>161</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An authentication scheme based on fair equality-determination 
protocol in cloud computing]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Mutual authentication between the user and the cloud is an essential requirement for the user to access the public cloud in cloud computing. In order to solve the problems of password-based identity authentication scheme in the cloud computing environment and to improve the efficiency of authentication in the environments of mass users, a fair equality-determination protocol was presented by developing an equality-determination protocol of constant complexity. The protocol proposed can compare the passwords between the user and the cloud fairly and secretly. Based on the protocol, a two-party privacy-protected identity authentication scheme based on semantically secure algorithm-Bresson algorithm was further presented. Finally, the correctness of the scheme was proved and its security was analyzed.]]></description>
<pubDate>2013/11/6 15:57:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Tingting<sup>1</sup> and WANG Wenbin<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Tingting<sup>1</sup> and WANG Wenbin<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201305020]]></guid><cfi:id>160</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A comparative topic model for words burstiness]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201304026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[State-of-the-art cross collections topic models suffer from the serious flaw that it cannot capture the tendency of words to appear in bursts. Based on LDA (Latent Dirichlet Allocation)，a topic model CDCMLDA(Cross-collection Dirichlet compound multinomial Latent Dirichlet Allocation), which models the burstiness phenomena of words using Dirichlet compound multinomial (DCM) distribution, was proposed. A Monte Carlo Expectation Maximization algorithm for model inference was presented. A variety of qualitative and quantitative evaluations of CDCMLDA were performed, which shows that CDCMLDA not only discovers the common and unique aspects on topics, but also improves the model perplexity compared with the two cross-collection topic models. ]]></description>
<pubDate>2013/8/22 16:54:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAN Wentang,WANG Zhenwen,YIN Fengjing,GE Bin and XIAO Weidong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAN Wentang,WANG Zhenwen,YIN Fengjing,GE Bin and XIAO Weidong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201304026]]></guid><cfi:id>159</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A customized multi-grain matrix register file for SIMD processors]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201304027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Mapping matrix operations on SIMD processors brings a large amount of data rearrangement that lowers the system performance. In this study, a customized Multi-Grain Matrix Register File (MMRF), which supports multi-grained parallel row-wise and column-wise access, was proposed to eliminate these data rearrangement and increase the performance of matrix operations. The MMRF could be configured into different parallel access modes, in which one or several sub-matrices can be accessed in parallel. Experimental results show that, compared with the traditional Vector Register File (VRF) and the MRF, the MMRF can respectively achieve about 2.21x and 1.6x average performance improvement, where the area of MMRF increases by 14.3% and 3.7% respectively, and the power of MMRF increases by 14.6% and 2.2% respectively. Compared with TMS320C64x+, the SIMD processor of FT-Matrix can achieve about 5.65x to 7.71x performance improvement by employing the MMRF. By hierarchical customized design technology, the area and critical-path delay of MMRF can be reduced by 17.9% and 39.1% respectively.]]></description>
<pubDate>2013/8/22 16:54:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Kai,CHEN Shuming,WANG Yaohua,CHEN Haiyan and LI Zhentao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Kai,CHEN Shuming,WANG Yaohua,CHEN Haiyan and LI Zhentao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201304027]]></guid><cfi:id>158</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Modeling news event evolution]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201304029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A new method is proposed for modeling the news event evolution to precisely present the relationships between events. This method utilized the events timestamp, events content similarity, and events dependence between features to build a new event evolution model, and defined five different event evolution patterns to identify the seminal events, the intermediary and ending events. Ultimately, an event evolution graph model was constructed to present the underlying events relationship. Experiments were conducted, confirming that the proposed method is efficient for detecting event evolution, and improves performance of system.]]></description>
<pubDate>2013/8/22 16:54:29</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Hui,LI Guohui,SUN Boliang and JIA Li]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Hui,LI Guohui,SUN Boliang and JIA Li</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201304029]]></guid><cfi:id>157</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An adaptive buffer regulating scheme for on-chip routers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the traditional Network-on-Chip routers, packets from different directions are temporarily stored in different buffer regions, and these buffering resources are independent from each other. Under non-uniform traffic patterns, buffers in some input channel will be crammed by the coming packets quickly, while the others are still in idle state. As a result, the buffers are utilized inefficiently, and it has a negative influence on the overall network performance. In the method proposed, an adaptive buffer regulating scheme that can be used to achieve similar performance by using less buffering resources was introduced. The VLSI implementation of a router with the buffer regulating scheme was completed under 90nm CMOS process. The experimental results show that the proposed router can bring significant performance improvement and power reduction under non-uniform traffic patterns, 20.3% area saving of the proposed router and 41% power reduction of the buffers can be achieved compared to the traditional one.]]></description>
<pubDate>2013/7/4 10:40:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Wei,GUO Yufeng,DOU Qiang,ZHANG Ming and REN Ju]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Wei,GUO Yufeng,DOU Qiang,ZHANG Ming and REN Ju</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303009]]></guid><cfi:id>156</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[On-line news event detection based on TF·IEF model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[According to the characters of web news stream, an on-line news event detection (ONED) method, based on the two-stage clustering, is proposed to solve the problem of repeated matching. A novel incremental event model was established by calculating terms weighting of events directly. Two stages are involved in our method. In the first stage, the similar reports collected in a certain period were clustered into micro-clusters. In the second, the micro-clusters were matched with existed events, and then this method updated the event model. Experiment shows that the proposed method improves the efficiency and accuracy of ONED with lower complexity and less feature information loss. ]]></description>
<pubDate>2013/7/4 10:40:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Hui,LI Guohui,JIA Li and SUN Boliang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Hui,LI Guohui,JIA Li and SUN Boliang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303010]]></guid><cfi:id>155</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Time and cost trade-off heuristics for workflow scheduling 
based on bottom level]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to manage the trade-off between the workflow execution time and the workflow execution cost on utility grids, the task was divided into several groups by using the workflow synchronization properties, and three real-time heuristics were proposed: the bottom level based sufferage (BLSuff), the bottom level based min-min (BLMin) and the bottom level based min-max (BLMax). A metric was designed in these heuristics to optimize the execution time and the execution cost simultaneously based on the trade-off factor, and the expected finish time was set for the task trying to make most of the cost optimization space to save the workflow execution cost. The experimental results  demonstrate that these heuristics can optimize the execution time and execution cost simultaneously with various trade-off factors.]]></description>
<pubDate>2013/7/4 10:40:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Cancan<sup>1</sup>,ZHANG Weimin<sup>2</sup> and LUO Zhigang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Cancan<sup>1</sup>,ZHANG Weimin<sup>2</sup> and LUO Zhigang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303011]]></guid><cfi:id>154</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An efficient and balanced load allocation model 
based on non-uniform balls-into-bins]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In balanced load allocation problem in complex systems like large-scale data center and P2P overlay network, the various load allocation methods is proposed. In order to achieve better balanced load index, many methods, however, are in pursuit of more and more complicated algorithms, which makes the time and algorithm complexity hard to control. Based on the study of the original balls-into-bins model, Azar balls-into-bins model and balls into non-uniform bins model, the paper brings forward an efficient and balanced non-uniform balls-into-bins load allocation model, which is provided with heterogeneous balls, heterogeneous bins and different bin selection probabilities. The model can achieve rational largest load with high probabilities, at the cost of little time and algorithm complexity. The model is extensible and can be applied in many domains.]]></description>
<pubDate>2013/7/4 10:40:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HUANGFU Xianpeng and LUO Xueshan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HUANGFU Xianpeng and LUO Xueshan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303012]]></guid><cfi:id>153</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Structural recognition of sketched irregular 
military marking symbols]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Sketch-based military marking diagrams consist of many linear and regional symbols. Typically, these symbols are irregularly shaped because they are drawn according to specific terrain or battle scenario with freehand. Therefore, they are also called irregular symbols. Traditional appearance-based methods are not appropriate for recognizing these symbols. A structural recognition method for sketched irregular military marking symbols was proposed. Symbols were decomposed and represented by 9 types of primitives together with 4 types of spatial relationships among them. By matching the primitive counting vector and the primitive relationship matrix of the unknown symbol with those of the templates, the class label was recognized, and their primitive correspondences were also estimated. Experimental results demonstrate that the proposed method is effective and efficient for recognizing sketched irregular military marking symbols.]]></description>
<pubDate>2013/7/4 10:40:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Yougen<sup>1</sup>,WU Lingda<sup>1,2</sup>,SONG Hanchen<sup>1</sup> and DENG Wei<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Yougen<sup>1</sup>,WU Lingda<sup>1,2</sup>,SONG Hanchen<sup>1</sup> and DENG Wei<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303013]]></guid><cfi:id>152</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A method of specific image scene detection based 
on local invariant features]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Automatic image scene detection is very important to image annotation and semantic retrieval. According to the requirement of application, eight specific image scenes such as meeting, mass, beach, etc. were focused on. First, to extract the local features of images, the local key points were detected and reduced, and then the SIFT feature descriptors were calculated. Second, a multi-classifier based on support vector machine was constructed and the features for training were selected to achieve relatively accurate detection results. The experiments were designed to mainly focus on two problems, namely the decision of kernel function of classifier and the strategy of feature selection. Experimental results show that the method can achieve relatively accurate and robust results by using radial basis kernel function to construct classifier and the feature extraction strategy of selecting the top n key points by the scale size order. This method is simple and fast, and can satisfy the actual requirements of application for relatively high precision.]]></description>
<pubDate>2013/7/4 10:40:11</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIE Yuxiang<sup>1</sup>,LUAN Xidao<sup>2</sup>,CHEN Danwen<sup>1</sup> and ZHANG Xin<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIE Yuxiang<sup>1</sup>,LUAN Xidao<sup>2</sup>,CHEN Danwen<sup>1</sup> and ZHANG Xin<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303014]]></guid><cfi:id>151</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A parallel region matching algorithm for large scale HLA simulation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In HLA simulation, data distribution management (DDM) service provides data filtering capability, which can effectively reduce the transmission and reception of redundant data. During the advancing of large-scale HLA simulation system, much region matching calculation is needed. However, in most of the existing regional matching algorithms, all regions are calculated in every matching calculation process, which results in a waste of computing resources. Meanwhile, the current matching algorithms are mostly based on serial region matching, and the advantage of multi-core cannot be fully taken. Aiming at the limitation of existing algorithms, a parallel region matching algorithm for large-scale HLA simulation is proposed. By this algorithm, the matching process of multiple regions which changes in the same simulation advancing can be calculated in parallel, the advantage of parallel computing environment can be taken. During the process of matching calculation, a method which is based on intersecting information was used. By the history of moving regions, matching calculation only happened within a limited range, and the redundant calculation could be avoided. Theoretical analysis and experimental results showed that the algorithm is particularly suitable for large-scale distributed simulation applications which execute on multi-core computing platform.]]></description>
<pubDate>2013/7/4 10:40:10</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIANG Hongbo<sup>1,2</sup>,ZHU Weiguo<sup>1</sup>,YAO Yiping<sup>2</sup>,Liu Buquan<sup>2</sup>,MU Xiaodong<sup>3</sup> and YANG Yong<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIANG Hongbo<sup>1,2</sup>,ZHU Weiguo<sup>1</sup>,YAO Yiping<sup>2</sup>,Liu Buquan<sup>2</sup>,MU Xiaodong<sup>3</sup> and YANG Yong<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201303015]]></guid><cfi:id>150</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An expert finding method based on topic model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201302023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Expert finding is an important part of entity retrieval. Classical expert finding 
models rest upon the conditional independence assumption between the candidate and term-given document. 
However, this assumption is usually invalid in real world applications, which makes the performances of 
classical expert finding models not ideal. In this research, an expert finding method is proposed based on the 
topic model (EFTM). This method discards the conditional independence assumption in classical models and is 
more maneuverable. In addition, a ranking truncation approach which largely decreases the computational 
complexity of the model was used. Finally, the performances of the new model were evaluated using the CSIRO 
Enterprise Research Collection. The results shows that the EFTM model outperformed the classical model 
significantly on all the metrics and can effectively improve the performances of the expert finding system. ]]></description>
<pubDate>2013/5/21 9:27:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Jian,LI Qi,LIU Baohong and ZHANG Yun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Jian,LI Qi,LIU Baohong and ZHANG Yun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201302023]]></guid><cfi:id>149</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Learning to rank based on user relevance feedback]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201302024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Many information retrieval applications have to present their results in the form 
of ranked lists, in which documents must be sorted in a descending order according to their relevance to a 
given query. This has led the interest of the information retrieval community in methods that automatically 
learn effective ranking models, and recently machine learning techniques have also been applied to model 
construction. Most of the existing methods do not take into consideration the fact that significant 
homogeneity exists between query-document pairs related to user’s feedback. In this research, a novel method 
which clusters patterns in the training data with their relevance from the user, and then uses the discovered 
rules to rank documents at query-time. A systematic evaluation of the proposed method using the LETOR 
benchmark dataset is posposed. The experimental results show that the proposed method outperforms the state-of-the-art methods with no need of time-consuming and laborious pre-processing.]]></description>
<pubDate>2013/5/21 9:27:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CAI Fei,CHEN Honghui and SHU Zhen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CAI Fei,CHEN Honghui and SHU Zhen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201302024]]></guid><cfi:id>148</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[PMESI：optimizing memory performance by selectively deactivating 
cache coherence for private pages]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Parallel program has significant percentage of memory requests that target only private data, which does not need to resolve cache coherence conflicts. Yet traditional coherence protocol does not distinguish between shared and private blocks, which leaves much optimization space. An optimized cache coherence protocol, called PMESI, which dynamically deactivates coherence maintenance for private memory space, was suggested. PMESI achieves two distinguishing features: the reduction of memory access latency and system power consumption. Simulation results on the cycle accurate simulator show that 54% memory references can be efficiently optimized and the program execution time is reduced 9% on average.]]></description>
<pubDate>2013/3/13 9:54:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Shaogang,XU Weixia,PANG Zhengbin,WU Dan,DAI Yi and LU Pingjing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Shaogang,XU Weixia,PANG Zhengbin,WU Dan,DAI Yi and LU Pingjing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301018]]></guid><cfi:id>147</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The development and application of full custom EDA 
techniques in YHFT-DX]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Several full custom EDA techniques were developed during the design of YHFT-DX processor. Hierarchical functional model extraction, which can convert a transistor-level netlist into an equivalent RTL netlist, were developed for the functional verification of full custom circuits. Hybrid timing analysis was researched for the transistor-level timing analysis. 10x run-time improvements were achieved by the multi-thread parallel optimization. A measurement was developed to get delays from the simulation waveforms, which improves the efficiency of simulation results analysis. Two signal integrity verification tools, PNVisual and NoiseSpy, were developed for IR-Drop and noise analysis of full custom circuits. These techniques have been widely used in the design of YHFT-DX, which greatly improves the efficiency and quality of full custom design.]]></description>
<pubDate>2013/3/13 9:54:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Zhentao,LIU Yao,CHEN Shuming,XU Qingguang and FU Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Zhentao,LIU Yao,CHEN Shuming,XU Qingguang and FU Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301027]]></guid><cfi:id>146</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A multimodal interaction framework for command post]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301028]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The construction of command post under informationization condition and the change of command behavior and command art are important parts of accelerating the transformation of combat effectiveness model. Command post already has a variety of new interactive devices and interactive tools, but between the “fragmented” sections, not in a unified framework of coordinated use. As a result, a lot of equipment and technology have to be shelved, and it is difficult to integrate into the command and control system. To solve this problem, a command post oriented multimodal interaction framework was put forward. The framework describes in detail the multimodall interactive command space software architecture, the architecture describes various models (command space conceptual model, hierarchical model, process model, component model, integration model) and their mutual relations, while the framework involves some key technical issues in depth. Finally, a comprehensive case studies on the subject were implemented which fully validate the research results.]]></description>
<pubDate>2013/3/13 9:54:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIAO Huxiong<sup>1</sup>,LAO Songyang<sup>1</sup>,LING Yunxiang<sup>1</sup> and SHAO Hongtao<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIAO Huxiong<sup>1</sup>,LAO Songyang<sup>1</sup>,LING Yunxiang<sup>1</sup> and SHAO Hongtao<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301028]]></guid><cfi:id>145</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Friendship prediction in recommender system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As the fast development of the Internet scale, “data overload” has become one of the most critical problems in computer network analysis. Recommender system has been regarded as the most effective method to solve the problem. But most of existing methods just consider the independent feedback of users without considering the relationship between users, which will inevitably decrease the performance of recommender system. Thus, a friendship prediction algorithm for recommender system was proposed to predict the relationship between different users. Firstly the topological and historical interaction information was taken as the features to judge the existence and relationship type of links. Then the feature combination process based on linear regression algorithm and logistic regression algorithm was implemented. Finally, the experiments based on the real data sets of Epinions and Slashdot were implemented. The experiment results show that our approaches perform very well in link prediction problem.]]></description>
<pubDate>2013/3/13 9:54:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MA Jianwei,XU Hao and CHEN Honghui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MA Jianwei,XU Hao and CHEN Honghui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301029]]></guid><cfi:id>144</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on open identity authentication model for PKI]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301030]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Some problems about the traditional identity authentication model for PKI(Public Key Infrastructure) were analyzed. For example, because certificate status verification service and key verification service depend on different service providers who have not enough trust degree in open network environment, the trust degree of the traditional model decreases and its risk increases. Additionally, there are other problems about cross-CAs and incomplete authentication service in the traditional model. Thus a new open identity authentication model was put forward for PKI, which can solve the above problems. In this model, the above two verification services were both provided by CA, and the service result was applied by providing identity certification file instead of OCSP answer. The trust degree of the traditional model and our model by using the cloud trust model presented by other researchers was calculated. The result of the calculating test shows that our model can improve the trust degree obviously. Finally, the prototype system of our model was completed, and especially the performance of the model was optimized. The test shows that the model has good practical value.]]></description>
<pubDate>2013/3/13 9:54:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Xiaobin,XU Yong and ZHANG Ling]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Xiaobin,XU Yong and ZHANG Ling</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201301030]]></guid><cfi:id>143</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A recognition algorithm for online sketched symbols 
with continuous feedback]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201406001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[At present, clicking on the button and waiting for a period of time after completing the sketch fully is the most common recognition method for online sketched symbols. To achieve the continuous feedback, a primitive-based partial sketches recognition algorithm was proposed. In the stage of feature representation, the input strokes were segmented as primitives and then a new feature which presents the spatial relationship between a pair of primitives was come up with. Based on the model of assignment problem, symbols were recognized through the similarity of this feature finally. The proposed method is so easy that one can master it without training and it has nothing with the order of stroke, the number of stroke and the size of graph. Its validity was testified by experiment.]]></description>
<pubDate>2015/1/22 16:38:31</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DENG Wei<sup>1</sup>,WU Lingda<sup>1</sup>,ZHANG Yougen<sup>2</sup> and PAN Guoqiang<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DENG Wei<sup>1</sup>,WU Lingda<sup>1</sup>,ZHANG Yougen<sup>2</sup> and PAN Guoqiang<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201406001]]></guid><cfi:id>142</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Efficient vectorization method of triangular matrix multiplication 
supporting in-place calculation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201406002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The vectorization of algorithm mapping for vector processors is a critical issue. An efficient vectorization method of triangular matrix multiplication which supports the in-place calculation was presented. L1D was configured as SRAM and the ping pong pattern with double buffering was designed to smooth the data transfers of multilevel storage structure, which made the kernel computation overlap the DMA data transfer fully and run with peak speed throughout, so then the optimal computation efficiency was achieved. Irregular triangular matrix multiplication computation was evenly distributed to all vector processing elements to fully exploit multiple levels of parallelism for vector processor. Result matrix was stored in multiplier matrix, thus, the in-place calculation was achieved and the memory space was saved. Experimental results  show that the performance of triangular matrix multiplication attained from the presented vectorization method achieves 1053.7 GFLOPS and the efficiency of that reaches to 91.47%.]]></description>
<pubDate>2015/1/22 16:38:31</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Zhong,TIAN Xi and CHEN Lei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Zhong,TIAN Xi and CHEN Lei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201406002]]></guid><cfi:id>141</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A line matching algorithm combining local description with topological constraint]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201406005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In view of the matching problem of low texture objects, a line matching algorithm based on local neighboring gradient information and global structural information was proposed. The mean standard deviation line descriptor was redesigned to get the initial matching; the global topological structure between lines was used to get rid of wrong matches; more matches were achieved by utilizing the iterative topological filter. Moreover, global angle constrains were implemented to make the algorithm more efficient and to further remove wrong matches. Experiments show that the proposed algorithm is highly robust under various image changes including heavy illumination change, image rotation, image blur, scale change as well as viewpoint change and is much better than the other two popular methods in terms of matching accuracy and efficiency.]]></description>
<pubDate>2015/1/22 16:38:31</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Yueqiang,SU Ang,ZHU Zunshang,LIU Haibo and SHANG Yang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Yueqiang,SU Ang,ZHU Zunshang,LIU Haibo and SHANG Yang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201406005]]></guid><cfi:id>140</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Accelerating rendering of the forest scene in 
the near-ground visual navigation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201406006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[As the typical ground objects in near-ground visual navigation application, the three-dimensional geometrical models of trees can improve the visual precision and the reality of virtual scene. However, it may lead to the decrease in rendering efficiency of a wide forest scene and result in the loss of navigation precision. In order to boost the rendering efficiency to ensure the navigation precision and maintain the sense of reality, billboard clouds algorithm was employed to establish the multi-resolution tree models based on view distance and its disadvantages existing in near-ground visual navigation application were improved. To improve the visual navigation precision with high dynamic viewpoint in the near-ground especially the nap-of-the-earth flight further, an accelerating rendering algorithm based on high dynamic viewpoint was proposed in accordance with the characteristics of limited horizon, threatened area and redundant vision. The contrast analysis of experiments testifies that the proposed algorithm improves the rendering efficiency, enhances the vision quality of the scene and raises the navigation precision of virtual scene.]]></description>
<pubDate>2015/1/22 16:38:31</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[BIAN Yanshan<sup>1</sup>,ZOU Peng<sup>2</sup>,YU Ronghuan<sup>2</sup> and LYU Yashuai<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>BIAN Yanshan<sup>1</sup>,ZOU Peng<sup>2</sup>,YU Ronghuan<sup>2</sup> and LYU Yashuai<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201406006]]></guid><cfi:id>139</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A label constraint reachability computation method 
on recursive partition]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201405017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Many of the real-world graphs are edge-labeled or node-labeled. A foundational operation on these labeled graphs is how to answer reachability queries fast. For the label-constraint reachability computation problem, a computation method called RP-Hop based on recursive partition was proposed. RP-Hop first utilized the hierarchical structure and independent set property to partition the origin large graph recursively, while keeping reachability and labels on paths between node pairs simultaneously. Combined with greedy and recursive labeling strategies, RP-Hop produced a compressed index for label-constraint reachability queries. Experiments on synthetic and real-world graph data sets demonstrate that RP-Hop can reduce index size and construction time, and guarantee the query efficiency.]]></description>
<pubDate>2014/11/25 10:16:02</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Ye,ZHONG Zhinong,XIONG Wei and JING Ning]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Ye,ZHONG Zhinong,XIONG Wei and JING Ning</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201405017]]></guid><cfi:id>138</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Modeling association of news events on term network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201404029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[There are many news events reported daily on the Internet. An innovative method is proposed to mine event-relations between news. Following an adjacent term-combining strategy, this method primarily utilized a so-called term frequency & inverse event frequency (TF-IEF) model to extract key phrases from the corresponding reports set as to a particular event. Then term co-occurrence windows were employed to calculate the associating degree of every single term pair. This degree is indicative in building event key phrase-networks. Further, two matters were correlated to shape the event relation-network model: (I) common key phrases as mediators within event key phrase-network, and (II) the degree of commonness of key phrases within different observed events. An experiment was conducted to examine the performance of proposed method. The results show that the method can accurately extract key phrases and comprehensively mine associations between events.]]></description>
<pubDate>2014/9/4 17:19:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Hui<sup>1,3</sup>,LI Guohui<sup>1</sup>,XU Xinwen<sup>2</sup>,JIA Li<sup>1</sup> and SUN Boliang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Hui<sup>1,3</sup>,LI Guohui<sup>1</sup>,XU Xinwen<sup>2</sup>,JIA Li<sup>1</sup> and SUN Boliang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201404029]]></guid><cfi:id>137</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An online learning algorithmic framework with forgetting property]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201404032]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the notion of duality in convex optimization, a novel online learning algorithmic framework with forgetting property is proposed. The Fenchel conjugate of hinge functions is a key to transfer the basic learning problem from batch to online. New online learning algorithms were derived by different dual ascending procedures: (1) gradient ascent; (2) greedy ascent. Earlier researches were reviewed. Detailed experiments on synthetic and real-world datasets verified the effectiveness of the approaches. An important conclusion is that our derived online learning algorithms can handle the settings where the target hypothesis is not fixed but drifts with the sequence of examples, which paves a way to the design and analysis of online learning algorithms.]]></description>
<pubDate>2014/9/4 17:19:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Boliang and LI Guohui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Boliang and LI Guohui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201404032]]></guid><cfi:id>136</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Suppressing IR image noise saliently with the heavy fixed pattern]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A saliency based heavy fixed pattern noise suppression algorithm for IR image which is captured by infrared focal-plane-array sensors in remote observation is proposed. The properties of the typical IR images characterized with small targets and heavy fixed pattern noise were analyzed, and it was found that the target regions are more salient than the background for observer in IR image. Using the saliency detection algorithm to detect target regions, the proposed algorithm processes different regions separately and suppresses the heavy fixed pattern noise effectively. Experiments indicate that our algorithm can detect the target regions accurately and suppress the heavy fixed pattern noise effectively.]]></description>
<pubDate>2014/7/17 17:22:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Xiaoliang<sup>1,2</sup>,ZHU Zunshang<sup>1,2</sup>,SHANG Yang<sup>1,2</sup> and ZHANG Xiaohu<sup>1,2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Xiaoliang<sup>1,2</sup>,ZHU Zunshang<sup>1,2</sup>,SHANG Yang<sup>1,2</sup> and ZHANG Xiaohu<sup>1,2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403008]]></guid><cfi:id>135</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Fine-grained distributed localization-oriented adjustment 
approach for wireless sensor network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The non-localizable WSN in the initial deployment is focused upon, and a fine-grained distributed localization-oriented adjustment approach, named as LODA, is proposed. LODA decides the strategy of the node based on the path information to achieve the network localizability in an initially non-localizable network. Compared with the current network adjustment approaches, the approach proposed merely adjusts less than 11% nodes in a sparse network to achieve localizability, which is about 40% better than the current best approach. Besides, the algorithm in a distributed manner is designed to balance the communication load caused by the adjustment. Therefore, the scalability limitation in the previous centralized approaches is overcome. Extensive simulation results show that our approach outperforms the previous method in adjustment efficiency.]]></description>
<pubDate>2014/7/17 17:22:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Xiaolei<sup>1</sup>,CHEN Tao<sup>1</sup>,GONG Xudong<sup>1</sup>,HONG Feng<sup>2</sup> and LUO Xueshan<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Xiaolei<sup>1</sup>,CHEN Tao<sup>1</sup>,GONG Xudong<sup>1</sup>,HONG Feng<sup>2</sup> and LUO Xueshan<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403018]]></guid><cfi:id>134</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[The programming model and language for constructing socio technical systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Software systems situated in open environment like the Internet are increasingly characterized as socio technical systems that evolve dynamically various variations and changing requirements. To construct such complex software system has become an open issue in the literature of software engineering. This research takes socio technical systems as multiple agent organizations and presents an organization-based program model ORAP that introduces organization metaphors like organization, agent, role and position to construct complex socio technical systems. A series of programming mechanisms like role binding and composition, role-based interaction and self-management of organization were designed to tackle the dynamics issues of socio technical systems by categorizing the organization dynamics at different organization levels. Furthermore, an organization-based programming language called OragentL for implementing social technical systems were proposed, which involves its syntax formal definition at organization, role and composition levels respectively. The OragentL’s compiler and running environment called OragentBurg were introduced and a sample was studied to illustrate our approach and show its effectiveness.  ]]></description>
<pubDate>2014/7/17 17:22:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MAO Xinjun,CHEN Yin and ZHANG Tingting]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MAO Xinjun,CHEN Yin and ZHANG Tingting</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403019]]></guid><cfi:id>133</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Applying semantic relations to construct sentiment lexicon automaticlly]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Researches on constructing English sentiment lexicon is relatively mature, and there are abundant and reliable lexical resources. Whereas for Chinese studies, the research history is short, and there are only a few Chinese sentiment lexicon resources. With reliable English sentiment lexicon as reference, an automatic constructing approach was proposed, based on semantic relationships. Firstly the Chinese sememe and words were extracted from the defination of concepts in HowNet and the semantic analysis was carried out upon them; secondly the sentimental value of each sememe and word was retrieved from the English sentiment lexicon SentiWordNet according to the DEF attributes of concepts in HowNet, and the final sentimental value of each word was calculated on the semantic relations of the sememe and words. The ready English lexicon was used without manual labeling in the method, and diverse information of words was recorded in the final lexicon, including semantic relations and sentimental values, which remedy the lack of other lexicons. The experimental results show that the resulted sentiment lexicon can achieve better performance in the recall and F value measurements under the condition of approaching other lexicons on the precision measurements.]]></description>
<pubDate>2014/7/17 17:22:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIE Songxian,LIU Bo and WANG Ting]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIE Songxian,LIU Bo and WANG Ting</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403020]]></guid><cfi:id>132</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Unified identity management method for large organizations]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to solve the problems of unified identity management in large organizations’ information systems, a new identity management alliance for large organizations is proposed. Through consulting the Liberty Framework raised by the Liberty Alliance Organization, as well as reforming its structure and its pattern of building trust relationships among IDPs, the new identity management alliance is more suitable than the Liberty Framework for large organizations, which are distributed, autonomous, globally unified, and coordinated. In terms of physical structure, the new identity management alliance can be regarded as a tree consisting of multiple IDP nodes while each node must and can only develop trust relationships with its father node and child nodes. This is totally in line with the tree-like hierarchy of every large organization in the real world. In the system realization, based on the tree-like structure of the new identity management alliance, a hierarchical storage of the authentication data is achieved by adopting LDAP. In addition, the user access control was conducted by a security authentication gateway at the network layer, which consequently makes it possible to support B/S and C/S application systems at the same time.]]></description>
<pubDate>2014/7/17 17:22:23</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Chao<sup>1</sup>,GUO Changguo<sup>1</sup>,LIU Donghong<sup>1</sup>,LI Anqi<sup>2</sup> and WANG Huaimin<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Chao<sup>1</sup>,GUO Changguo<sup>1</sup>,LIU Donghong<sup>1</sup>,LI Anqi<sup>2</sup> and WANG Huaimin<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201403022]]></guid><cfi:id>131</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research advances in SAT-based error localization 
methods on circuits]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201402014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the growing complexity of VLSI designs, functional verification and debugging has become a resource-intensive bottleneck in modern CAD flows, consuming as much as 60% of the total design cycle. Error localization in circuits is difficult and time-consuming. Therefore an efficient error debugging and localization method is necessary for hardware design. Recently there are many different contributions to research on error localization in circuits. Firstly, the categories and workflow of error debugging method were introduced. The fundamental principles of SAT-based error localization method were described. Then the existing algorithms were introduced and analyzed. Furthermore, the research results about extract unsatisfiable subformulae, which can strongly improve the efficiency and accuracy of error localization, were presented. Finally, the current challenges were discussed, and the future research directions of error localization in circuits were outlined.]]></description>
<pubDate>2014/5/14 17:10:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Jianmin, LI Tiejun, ZHANG Jun, LI Sikun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Jianmin, LI Tiejun, ZHANG Jun, LI Sikun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201402014]]></guid><cfi:id>130</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A real-time video stabilization algorithm based on 
homography trajectory]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201402017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Motivated by the demands of real-time video stabilization, a real-time video stabilization algorithm based on homography trajectory is proposed. For each input frame, our approach regenerates four short homography trajectories by applying inter-frame homography transformations to the four corners of image rectangle. An associate Kalman filter is then performed to smooth these transformational trajectories. Finally, at the stage of image composition, constraints of inclusion and similarity are considered for selecting a visually plausible stabilized video. The proposed method can offer real-time video stabilization and it can remove the delays for caching coming images. In addition, our method does not rely on sophisticated 3D reconstruction or long-range feature tracking and it can effectively relieve the errors introduced by using homography to model the video motion. Experiments show that our approach can offer real-time stabilizing for videos with 2D scenes or the 3D scenes with moderate depth variation. ]]></description>
<pubDate>2014/5/14 17:10:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DONG Jing, YANG Xia, YU Qifeng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DONG Jing, YANG Xia, YU Qifeng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201402017]]></guid><cfi:id>129</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[CERep: A credibility enhanced reputation mechanism]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201402018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Enhancing reputation mechanism’s capability of aggregating reputation information effectively is the foundation of a successful reputation system. Current reputation systems based on localized reputation information cannot process such strategic recommendations as correlative and collusive ratings. Furthermore there exists unfairness to blameless peers in these models. Therefore, a Credibility Enhanced Reputation mechanism CERep is presented. In CERep, a peer uses its experiences to compute the direct trust valuation which contains direct trust value and level of confidence about this value, then a reputation-based trust valuation scheme and recommendation credibility computation model is proposed. Moreover, the strategies used for implementing the reputation mechanism are also discussed. Theoretical analysis and simulation show that CERep reputation mechanism proposed can help peers effectively detect dishonest recommendations in a variety of scenarios where more complex malicious strategies are introduced, and achieve a more accurate trust valuation and fair evaluation of recommendations.]]></description>
<pubDate>2014/5/14 17:10:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHANG Junsheng, PANG Zhengbin, XU Weixia, XIA Jun, YIN Gang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHANG Junsheng, PANG Zhengbin, XU Weixia, XIA Jun, YIN Gang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201402018]]></guid><cfi:id>128</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A detection-based person tracking algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201402019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The traditional object tracking algorithms require manually annotated tracking area, and suffer from the problem of drift. To address these difficulties, the problem of person tracking was focused on, and a new detection-based tracking algorithm was proposed. To reduce failure in tracking, multiple detectors to locate multiple body parts were employed, and then their detection results were mapped to a common body area. To adapt for the quickly moving objects, the KLT tracker and agglomerative clustering for linking the detection windows to form person body trajectories was employed. The experimental results reveal that using multiple detectors improves the tracking performance significantly, and the KLT tracker is adaptable for quickly moving objects. This algorithm is nearly real-time. ]]></description>
<pubDate>2014/5/14 17:10:48</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Jianzhai, CHEN Fanglin, HU Dewen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Jianzhai, CHEN Fanglin, HU Dewen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201402019]]></guid><cfi:id>127</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[THO-MAC: a low-latency and energy-efficient MAC 
protocol with two-hop optimization in WSNs]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201401028]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Energy consumption and latency are two major problems that are primarily considered in the design of medium access control (MAC) protocols in wireless sensor networks (WSNs). A new low-latency, energy-efficient and receiver-initiated asynchronous MAC protocol in WSNs is proposed. By precisely predicting the receiver’s wakeup time, THO-MAC protocol can schedule the sender to listen to the channel, such that it can reduce the sender’s energy waste of idle listening. On the other hand, in order to reduce packet delivery latency, THO-MAC protocol chooses the forwarders in the sender’s two-hop forwarders set to minimize the two-hop forwarding latency. The performance of THO-MAC protocol in terms of detailed NS2 simulation is evaluated. The simulation results show that the THO-MAC protocol reduces 35.5% and 18% packet delivery latency, while saving 23.5% and 15.5% sensor energy consumption, compared with RI-MAC and Any-MAC, the two state-of-the-art MAC protocols.]]></description>
<pubDate>2014/3/12 14:49:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TANG Hongwei,XU Ming and SUN Caixia]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TANG Hongwei,XU Ming and SUN Caixia</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201401028]]></guid><cfi:id>126</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Confidentiality and integrity dynamic union model 
based on pre-authorization mechanisms]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201401029]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the current access control model, a reasonable unified control over confidentiality, integrity and availability cannot be achieved; especially the dynamic random access request control is far from perfect, not only always leaving some weak points open to possible attacks, but also bringing some unavoidable security problems caused by user errors in practical applications. A kind of confidentiality and integrity access control model based on the pre-authorization mechanisms is put forward. By combining BLP model and Biba model, and introducing the pre-authorization mechanisms, the reasonable control can be achieved over the dynamic random accesses activities. By making use of the condition control, the authority of subject performing the task is monitored timely, and granted or canceled dynamically. So the system’s confidentiality and integrity can both be realized, while guaranteeing its high availability, which is advantageous to the two-way flow of information. Finally, the application example of the model is given and its security is proved. ]]></description>
<pubDate>2014/3/12 14:49:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Jun,XU Luwei,MENG Qingde and FENG Changlin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Jun,XU Luwei,MENG Qingde and FENG Changlin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201401029]]></guid><cfi:id>125</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A scheduling algorithm for multi-core based on critical path 
and task duplication]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201401030]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the problem of current scheduling algorithm for multi-core which fails to consider that the nodes on the critical path have a major impact on the ending time of tasks, leading to the delay of the task completion time; a scheduling algorithm based on critical path and task duplication (CPTD) is proposed. Firstly, the fork-nodes were duplicated to change the task graph into products processing tree, then the critical path in the processing tree were found, and the father nodes of the nodes on critical path were made to work at the earliest time. These operations can advance the start time of nodes on critical path. The purpose of the above operation is to shorten the implementation of the mandate of the total time. Theoretical analysis shows that the algorithm can achieve a single task fully parallel processing on multi-core, and also can shorten the completion time of the tasks.]]></description>
<pubDate>2014/3/12 14:49:32</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIE Zhiqiang<sup>1</sup>,HAN Yingjie<sup>1</sup>,QI Yonghong<sup>1</sup> and YANG Jing<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIE Zhiqiang<sup>1</sup>,HAN Yingjie<sup>1</sup>,QI Yonghong<sup>1</sup> and YANG Jing<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201401030]]></guid><cfi:id>124</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Programming model and resource management of distributed stream architecture]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201506021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[While providing big data computing services using Internet resources, there remains a big challenge to researchers, including heterogeneity of Internet resources, dynamics of Internet resources and long latency of Internet communication. Current influent distributed computing models still have some shortage.  A novel distributed stream computing model was  proposed based on the traditional stream computing model, including the distributed stream programming model and resource management can efficiently support multiple parallel execution modes. The prototype system  implemented on the 10 CPU-GPU heterogeneous nodes. Seven different benchmarks  used in the simulation experiment. The experimental result shows that the distributed stream architecture can achieve the speedup of at least on average over the local serial computing, with significant potential for applications.]]></description>
<pubDate>2015/12/31 10:11:24</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Xin<sup>1,2,3</sup>, YANG Xuejun<sup>1,2</sup> and XU Xinhai<sup>1,2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Xin<sup>1,2,3</sup>, YANG Xuejun<sup>1,2</sup> and XU Xinhai<sup>1,2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201506021]]></guid><cfi:id>123</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Adaptive estimation of noise scale in feature localization for multiview triangulation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201506022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Robust multi-view triangulation algorithms usually rely on an empirical reprojection error threshold to identify and remove the  outliers. The selection of such threshold is critical to both the quantity of successfully reconstructed scene point and its accuracy. Based on the analysis of the noise in feature point localization and the geometry of epipolar transfer, the uncertainty propagation model in epipolar transfer was derived. A novel noise scale estimation approach based on kernel density estimation was proposed and the estimated noise scale was further incorporated into robust state-of-the-art multi-view triangulation algorithm. Experimental results demonstrate that the proposed method is able to obtain accurate estimation of noise scale and to improve the 3D reconstruction quality of multi-view triangulation algorithm significantly.]]></description>
<pubDate>2015/12/31 10:11:25</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WEI Yingmei<sup>1</sup> and KANG Lai<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WEI Yingmei<sup>1</sup> and KANG Lai<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201506022]]></guid><cfi:id>122</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Integral cryptanalysis on reduced-round PUFFIN]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201506024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[PUFFIN is a lightweight block cipher, in  which the block length is 64 bit while the key size is 128 bit. The integral cryptanalysis resistance ability of PUFFIN was analyzed. The existence of 5 and 6 round integral distinguisher in PUFFIN was constructed and proved. An integral attack on 8 round PUFFIN was mounted by 6 round integral distinguisher to recover 2 round 100 bit round cipher. The data complexity of the attack is 2<sup>20</sup> chosen plaintexts, the time complexity is about 2<sup>33</sup> 8 round encryptions, and the space complexity is 2<sup>20</sup>. This  has been the best integral attack on PUFFIN up to now.]]></description>
<pubDate>2015/12/31 10:11:27</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Guangyao<sup>1</sup>, CHENG Lei<sup>2</sup>, LI Ruilin<sup>3</sup>, LI Chao<sup>1,2</sup> and SUN Bing<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Guangyao<sup>1</sup>, CHENG Lei<sup>2</sup>, LI Ruilin<sup>3</sup>, LI Chao<sup>1,2</sup> and SUN Bing<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201506024]]></guid><cfi:id>121</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Location recommendation on location-based social networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Location-based social networks, which add geo-information into traditional social networks, link people’s virtual and real world lives. As an important application of location-based social networks, location recommendation can recommend places that people may be interested in, provide choices for people’s out-going and make people’s lives much more convenient. Against this background, the relevant concepts of location recommendation, the methods it usually uses, data sets it deals with, evaluation methods for recommendation effectiveness and the problems it faces were delved and the future possible research directions were forecasted, hoping to provide more useful reference for researches in relevant fields.]]></description>
<pubDate>2015/11/9 16:21:57</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[JING Ning, WANG Yuehua, ZHONG Zhinong and WU Ye]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>JING Ning, WANG Yuehua, ZHONG Zhinong and WU Ye</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505001]]></guid><cfi:id>120</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Parallel geo-raster data conversion engine]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Large scale  geo-raster data have been accumulated all over the world in different departments and organizations during the past decades, but quite often in a variety of data formats, resulting in geospatial data sharing as an everlasting headache. Despite of various methodologies created, geospatial data conversion has always been a fundamental and efficient way for geospatial data sharing. However, as the size of data tends to be larger and larger, the methodology which was bounded by limited disk data transfer rate and bandwidth, needs a re-write and up-grade. A parallel geo-raster data conversion engine (PGRCE) was proposed to deal with massive geo-raster data sharing efficiently by utilizing high performance computing technologies. PGRCE was designed in an extendable and flexible framework, and was capable of customizing the way of reading and writing of particular spatial data formats. An experiment, in which georaster data in the CNSDTF-DEM format (Raster spatial data defined in Chinese Geospatial Data Transfer Format Standard) were transferred using PGRCE in a parallel file system (Lustre), were conducted to validate the engine framework and its performance. Results show that PGRCE can achieve a 7.54 speedup on a Luster cluster of 8 nodes.]]></description>
<pubDate>2015/11/9 16:21:57</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Shuai<sup>1,2,3,4</sup>, LI Manchun<sup>1,2</sup>, CHEN Zhenjie<sup>1,2</sup>, HUANG Tao<sup>1,2</sup> and JIANG Xiaohui<sup>5</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Shuai<sup>1,2,3,4</sup>, LI Manchun<sup>1,2</sup>, CHEN Zhenjie<sup>1,2</sup>, HUANG Tao<sup>1,2</sup> and JIANG Xiaohui<sup>5</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505002]]></guid><cfi:id>119</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Unsupervised feature learning for human activity recognition]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To solve the problems that human limitations may cause the loss of important information, thus affecting the classification results, a feature extraction method based on unsupervised feature learning techniques was proposed. Unsupervised feature learning method to learn multiple feature maps was used and concatenated together. This method can avoid the loss of important information, and also can significantly reduce the scale of unsupervised feature learning model used. To evaluate the proposed method, experiments on a public human activity recognition dataset were performed, using three commonly used unsupervised feature learning models, and finally using support vector machines to classify activities. The results show that the proposed feature extraction method achieves good results, and has certain advantages compared with other methods. ]]></description>
<pubDate>2015/11/9 16:21:58</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Dianxi, LI Yongmou and DING Bo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Dianxi, LI Yongmou and DING Bo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505020]]></guid><cfi:id>118</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Adaptive artificial bee colony optimization for parameter estimation of chaotic systems]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to accurately estimate the unknown parameters for chaotic systems, the artificial bee colony optimization algorithm was improved, and an adaptive artificial bee colony optimization algorithm was proposed. The proposed method formatted the problem of parameter estimation for chaotic systems to a multidimensional variable optimization problem, and used the artificial bee colony optimization algorithm to search the unknown parameters in a guided random manner. During the search process, the method adaptively adjusted the step size and the solution trial limits based on the optimum degree of the population and the quality of the solutions. The numerical simulation on the classic Lorenz chaotic system demonstrates that the proposed method is robust and can obtain accurate estimation for chaotic systems without noise or with intensive noise.]]></description>
<pubDate>2015/11/9 16:21:58</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[REN Kaijun, DENG Kefeng, LIU Shaowei and SONG Junqiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>REN Kaijun, DENG Kefeng, LIU Shaowei and SONG Junqiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505021]]></guid><cfi:id>117</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Vulnerable spots localization methods for software vulnerability analysis]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the difficulty in analysis of binary program vulnerabilities, an approach for software vulnerable spots localization based on taint analysis was proposed, and a corresponding tool named SwordChecker was implemented. This method is based on dynamic taint tracing. Software vulnerable spots were localized by character matching according to vulnerability patterns, and sensitive bytes  which affected the vulnerable spots were localized by binary-search. Experiment results show that SwordChecker can accurately identify and localize three types of software vulnerable spots fast, has successfully analyzed the causes of multiple open vulnerabilities, and has assisted mining several undisclosed vulnerabilities.]]></description>
<pubDate>2015/11/9 16:21:58</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CAI Jun<sup>1</sup>, ZOU Peng<sup>1</sup>, YANG Shangfei<sup>2</sup> and HE Jun<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CAI Jun<sup>1</sup>, ZOU Peng<sup>1</sup>, YANG Shangfei<sup>2</sup> and HE Jun<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201505022]]></guid><cfi:id>116</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A parallel algorithm of FastICA dimensionality reduction for hyperspectral image on GPU]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201504011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Fast independent component analysis dimensionality reduction for hyperspectral image needs a large amount of matrix and iterative computation. By analyzing hotspots of the fast independent component analysis algorithm, such as covariance matrix calculation, white processing, ICA iteration and IC transformation, a GPU-oriented mapping scheme and the optimization strategy based on GPU-oriented algorithm on memory accessing and computationcommunication overlapping were proposed. The performance impact of thread-block size was also investigated. Experimental results show that better performance was obtained when dealing with the hyperspectral image dimensionality reduction problem: the GPU-oriented fast independent component analysis algorithm can reach a speedup of 72 times than the sequential code on CPU, and it runs 4～6.5 times faster than the case when using a 16-core CPU. ]]></description>
<pubDate>2015/9/1 15:03:07</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FANG Minquan, ZHOU Haifang, ZHANG Weimin and SHEN Xiaolong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FANG Minquan, ZHOU Haifang, ZHANG Weimin and SHEN Xiaolong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201504011]]></guid><cfi:id>115</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[SPH parallel schemes and its application in free surface flow simulation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201504012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For the main computation of smoothed particle hydrodynamics was finite nearest particle search, a novel scheme to parallelize the smoothed particle hydrodynamics method based on the concept of particle decomposition was proposed. Any serial smoothed particle hydrodynamics code could be easily parallelized by using the proposed scheme. The amount of information, which was transformed in each time step, depended only on the total number of particles, but not on the spatial distribution of particles. Therefore, the proposed scheme was particularly useful for the parallel simulation of cases involved violent free surface movements. From the simulation results of a 3D dam break case with a total number of 0.4 million, the proposed scheme can achieve a speedup ratio about 16, which proves that the proposed scheme maybe is better than the domain decomposition scheme(without considering dynamic load balance).]]></description>
<pubDate>2015/9/1 15:03:07</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Hao<sup>1</sup>, XU Zhihong<sup>1</sup>, ZOU Shun<sup>2</sup> and TANG Wenhui<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Hao<sup>1</sup>, XU Zhihong<sup>1</sup>, ZOU Shun<sup>2</sup> and TANG Wenhui<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201504012]]></guid><cfi:id>114</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Cooperative task allocation of multi-UAVs with mixed DPSO-GT algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201504027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A general mathematics model for cooperative task allocation of multi-UAVs with time windows constrains was proposed which incorporating task gains and execution time directly, and simplifing the model formulation and algorithm designing. By defining a suitable particle structure, an algorithm based on the principles of discrete particle swarm optimization and Guo Tao algorithm was designed. The Inver-over Operator was directed by the swarm, the local and global optimal. Variable learning selection probability is introduced into the algorithm to select the learning particles, and the Inver-Over operator was modified. Simulation verifies the proposed task planning methodology for complex missions.]]></description>
<pubDate>2015/9/1 15:03:08</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YAN Ji<sup>1</sup>, LI Xiangmin<sup>1,2</sup> and LIU Bo<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YAN Ji<sup>1</sup>, LI Xiangmin<sup>1,2</sup> and LIU Bo<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201504027]]></guid><cfi:id>113</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Performance analysis of color descriptors for aerial 
Bayer real-color image]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201502013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[It is unclear that what color descriptors best fits feature matching of aerial remote sensing Bayer real-color image. To analyze variation of imaging of the aerial image and algorithm characteristics of color descriptors, a theoretical analysis of invariant properties of color descriptors was presented. The effect and applicability of descriptors were verified and analyzed by three experimental methods which are evaluations of simulation data, different categories images and general applicability of task. The theoretical and experimental results show that RGBSIFT has best applicability for the feature matching of aerial Bayer real-color image. The usefulness of color descriptor is category-specific.]]></description>
<pubDate>2015/5/16 9:33:24</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[QU Xinyuan<sup>1,2,3</sup>, DUAN Fuzhou<sup>1,2,3</sup>, ZHAO Wenji<sup>1,2,3</sup> and TIAN Jinyan<sup>1,2,3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>QU Xinyuan<sup>1,2,3</sup>, DUAN Fuzhou<sup>1,2,3</sup>, ZHAO Wenji<sup>1,2,3</sup> and TIAN Jinyan<sup>1,2,3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201502013]]></guid><cfi:id>112</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Vectorization of accelerating fast Fourier transform computation 
based on fused multiply-add instruction]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201502015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A vectorization of accelerating fast Fourier transform  computation based on fused multiply-add instruction was presented. Separate multiplication and addition operations in conventional computation were manipulated into less fused multiply-add operations by transforming process of fast Fourier transform butterfly computation, which decreased the real floating-point operations of radix-2 decimation in time fast Fourier transform butterfly computation from 10 multiplication (addition) operations to 6 multiply-add operations and decreased the real floating-point operations of radix-4 decimation in time fast Fourier transform butterfly computation from 34 multiplication (addition) operations to 24 multiply-add operations. Vector data access on twiddle factors was optimized to reduce memory cost. Experimental results show that the presented method can greatly accelerate fast Fourier transform computation and achieve efficient performance and efficiency.]]></description>
<pubDate>2015/5/16 9:33:24</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Zhong, CHEN Haiyan and XIANG Hongwei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Zhong, CHEN Haiyan and XIANG Hongwei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201502015]]></guid><cfi:id>111</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Optimization method for multi-core last level Cache
considering the memory access modes]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201502016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Multi-core architectures have been broadly utilized in current processors. Meanwhile, the diversity of memory access modes in applications brings challenges to the last level Cache in multi-core processors. An optimization method for the last level Cache based on the access modes is proposed. This method includes three coordinated and progressive levels:the configurable share/private Cache partition, the configurable bypass Cache policy, and the priority replace policy. Using this method, programmers can neatly alter the behavior of the last level Cache to effectively adapt the variety of memory access modes in applications. Experiment results show that the proposed method can observably decrease the miss rate of the last level Cache and increase the system performance of the processor.]]></description>
<pubDate>2015/5/16 9:33:24</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Sheng, CHEN Haiyan, GE Leilei and LIU Zhong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Sheng, CHEN Haiyan, GE Leilei and LIU Zhong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201502016]]></guid><cfi:id>110</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Enhancement and application of cube attack with quadratic test]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201502020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The algorithm of extracting quadratic expressions in the pre-processing phase of cube attack with quadratic test was enhanced to optimize the attack efficiency. The variation of secret keys was introduced into cube attack, which makes the model much more flexible. At the same time, with the help of the trade-off between time and space, the complexity of extracting quadratic terms was reduced by storing the results of the constant and linear terms. The improved method was applied to the simplified PRESENT and Trivium algorithms and it turns out that the attack efficiency is enhanced obviously.]]></description>
<pubDate>2015/5/16 9:33:25</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Yongjuan<sup>1</sup>, DING Liren<sup>1</sup>, REN Quanyu<sup>1</sup> and YANG Cheng<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Yongjuan<sup>1</sup>, DING Liren<sup>1</sup>, REN Quanyu<sup>1</sup> and YANG Cheng<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201502020]]></guid><cfi:id>109</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An online access pattern identification method based on
the stack characteristic in the on-chip last-level-cache]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Many methods optimizing the on-chip cache utilization are dependent on the profile or identification of the access sequence characteristics, for instance, prefetcher or bypass etc. How to identify these characteristics is still an open problem. Through a detailed theoretical analysis of typical access patterns, it is shown that the frequency of stack distance has obvious features. Furthermore, according to the results of the Simics simulation, these features present persistent and stable to a certain extent, therefore, they are feasible to be identified and predicted. An online method based on the peak value of the collected stack histogram attaching to each core is provided. In addition, the storage and time overhead is small. The experimental results based on 15 benchmarks from SPEC CPU2000/2006 show that it identifies all correctly.]]></description>
<pubDate>2015/3/19 11:35:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HUANG Zhibin<sup>1,2</sup>,ZHOU Feng<sup>1</sup>,MA Huadong<sup>1</sup>,ZHU Mingfa<sup>2</sup> and TAO Yuan<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HUANG Zhibin<sup>1,2</sup>,ZHOU Feng<sup>1</sup>,MA Huadong<sup>1</sup>,ZHU Mingfa<sup>2</sup> and TAO Yuan<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501001]]></guid><cfi:id>108</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A reconfigurable redundant arrays of inexpensive 
disks mechanism of NAND Flash]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Building storage array based on the low latency, low power consumption, and high reliability NAND Flash is an efficient way to implement high-performance storage system. However, adopting traditional redundant arrays of inexpensive disks (RAID) techniques to build storage array based on NAND Flash bring several problems such as wear leveling and decreasing lifecycle of storage array caused by updating parity code frequently. A cache-based reconfigurable RAID mechanism that dynamically constructs a new data stripe based on the non-volatile SCM is proposed. Experimental results show that this mechanism can reduce the garbage collection overhead, improve the performance and lifecycle of storage array based on NAND Flash efficiently.]]></description>
<pubDate>2015/3/19 11:35:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SONG Zhenlong,FANG Jian,WEI Dengping and ZHANG Xiaoming]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SONG Zhenlong,FANG Jian,WEI Dengping and ZHANG Xiaoming</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501002]]></guid><cfi:id>107</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A resolution-based Boolean unsatisfiable subformulas 
computing algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Computing unsatisfiable subformulas of Boolean formulas has practical applications in VLSI design and verification. The unsatisfiable subformulas can help electronic design automation tools to rapidly locate the errors and inconsistency. The definitions of resolution refutation and refutation parsing tree, and a heuristic local search algorithm to extract unsatisfiable subformulas from the resolution refutation of a formula are presented. The approach directly constructs the refutation parsing tree for proving unsatisfiability with a local search procedure, and then recursively derives unsatisfiable subformulas. The algorithm combines with reasoning heuristics, dynamic pruning and subsumption elimination method to improve the efficiency. The experimental results show that our algorithm outperforms the similar algorithms on the random benchmarks.]]></description>
<pubDate>2015/3/19 11:35:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Jianmin<sup>1</sup>,LI Tiejun<sup>1</sup>,XU Weixia<sup>2</sup>,PANG Zhengbin<sup>2</sup> and LI Sikun<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Jianmin<sup>1</sup>,LI Tiejun<sup>1</sup>,XU Weixia<sup>2</sup>,PANG Zhengbin<sup>2</sup> and LI Sikun<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501004]]></guid><cfi:id>106</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An approach to accessing unified memory address space 
of heterogeneous kilo-cores system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to access independent memory space of CPU and GPU directly from opposite directions, an effective approach to accessing unified memory address space of heterogeneous kilo-cores system is proposed, which is implemented by building a unified 3-level Cache and tagging blocks in Cache, and optimizing the algorithms of modifying the states of blocks. Therefore, the heterogeneous kilo-cores system avoids significant overhead of accessing memory instead of that in current discrete hybrid computer system equipped with GPUs by PCI-E. According to the results of experiments from partial programs of Rodinia benchmarks, a maximal speedup by 9.8x and maximal decrease of load/store instructions by 90% are gained. In conclusion, it’s certified that our solution is effective to decrease overhead of transferring data among computing units in heterogeneous system and significantly enhance the whole system computing performance. ]]></description>
<pubDate>2015/3/19 11:35:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[PEI Songwen<sup>1,2,3</sup>,WU Xiaodong<sup>1</sup>,TANG Zuoqi<sup>4</sup> and XIONG Naixue<sup>5</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>PEI Songwen<sup>1,2,3</sup>,WU Xiaodong<sup>1</sup>,TANG Zuoqi<sup>4</sup> and XIONG Naixue<sup>5</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501005]]></guid><cfi:id>105</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Optical characteristics for thin-film gated SOI lateral PIN photodetector]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Thin-film gated silicon-on-insulator (SOI) lateral PIN photodetector is a novel photodetector, based on standard SOI technology and CMOS process, combining the conventional bipolar and field effect photosensitive device structure. The basic structure of this novel photodetector is described and the operation principle is analyzed. Applying physical equations of semiconductor device, the gate voltage and photocurrent models can be built. Two-dimensional numerical simulations are performed in SILVACO software. In the middle-short wavelength operation period, the output photocurrent increases with gate voltage, with the obvious gated-control characteristics. Under fully depleted condition, the internal quantum efficiency can yield over 96%, even near 100% for the varied wavelengths(400nm, 450nm, 530nm, 600nm). For short wavelengths(280nm, 350nm), the internal quantum efficiency is relatively lower, the maximum is approximately 80%. And the dark current of this photodetector is low, leading to a high ratio of more than 10<sup>6</sup> between illuminated to dark current, achieving high sensitivity.]]></description>
<pubDate>2015/3/19 11:35:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Guoli,ZENG Yun,XIA Yu and XU Hui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Guoli,ZENG Yun,XIA Yu and XU Hui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501006]]></guid><cfi:id>104</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[High-speed channel design and simulation of 
high density storage server]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Comprehensive signal integrity simulation was introduced in the design of PCI-E3.0 and SAS3.0 channels of high density storage server, which are characterized by complicated structures, high signal speed and long and dense traces. The optimized cost-effective design was obtained by simulating the key items of high-speed PCB design such as topology, material and high-speed via structure. The system performances were then evaluated by full channel active simulation to ensure the stability of the system and reduce the manufacture risks. The signal quality of storage server system totally meets the requirement of PCI-E3.0 and SAS3.0 specifications, verifying the effectiveness and reliability of signal integrity simulation.]]></description>
<pubDate>2015/3/19 11:35:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHA Chaoqun,REN Xueyu,HU Changjun,NIE Hua and CHEN Jin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHA Chaoqun,REN Xueyu,HU Changjun,NIE Hua and CHEN Jin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501007]]></guid><cfi:id>103</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Research on optimization towards hybrid and hierarchy storage architecture]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Today’s advancing modern science is generating and analyzing increasing scale of datasets and makes HPC storage system facing new challenges both on architecture and software approach. In order to exploit potential benefits of emerging hybrid and hierarchy storage architecture on Milky-2 system, a I/O middleware approach named application coupled burst buffer, is introduced to make full use of the solid state disk based in-system storage resources. Application coupled burst buffer aggregates distributed in-system storage close to running tasks into single namespace during application runtime and manages it as cooperative persistent burst buffer tightly coupled with its host application. To take full advantage of cooperative burst buffer, application coupled burst buffer uses an unified shadow namespace to map application data into physical in system storage based on its real namespace of the host application. Besides that, application coupled burst buffer organizes data with locality aware layout and leverages application intent based replacement policy to fully exploit spatial and temporal locality. Furthermore, application coupled burst buffer employs concurrency aware policies to optimize data movement between different storage tiers. Evaluations on Milky-2 system show that application coupled burst buffer can improve the performance of typical data-intensive applications dramatically. It can achieve scalable burst I/O bandwidth and smooth sustained I/O bandwidth with high throughput solid state disk deployed and can be taken as an appropriate candidate for storage solution on emerging leadership supercomputer systems.]]></description>
<pubDate>2015/3/19 11:35:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Enqiang,ZHANG Wei,DONG Yong and LU Yutong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Enqiang,ZHANG Wei,DONG Yong and LU Yutong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501008]]></guid><cfi:id>102</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multimodal image registration based on orientation-moment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501026]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Multimodal image registration between visible, infrared and SAR images is the key technology to all-weather high-precision navigation and guidance. Based on an invariant feature designed at the pixel level, the orientation-moment, which describes the similarity of a pixel with its neighbors in different orientation, a multimodal image registration algorithm, that matches multisensor images by analyzing such similarities, is proposed. In matching tests, including visible, infrared and SAR images, it has reached a success rate of more than 90%. Comparing with traditional multimodal image registration algorithms, this method greatly improved the success rate, and had broad application prospects in navigation and guidance.]]></description>
<pubDate>2015/3/19 11:35:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Xiang<sup>1，2</sup>,ZHU Zunshang<sup>1</sup>,SHANG Yang<sup>1</sup> and YU Qifeng<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Xiang<sup>1，2</sup>,ZHU Zunshang<sup>1</sup>,SHANG Yang<sup>1</sup> and YU Qifeng<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201501026]]></guid><cfi:id>101</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Online fault diagnosis method of segment-powered  switch control sensor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201606005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Segment-powered switch control sensor is an important component for the segmented linear motor control system. For the problems of fault diagnosis and location, an online fault diagnosis method of switch control sensor was proposed. Sensor signal data were compressed to improve computational efficiency; the law of switch control sensor signals changing with shuttle movement was studied, and a set of standard signals were defined; a calculating method for the sensor signal difference which is considered as a quantitative indicator of similarity analysis of signal was given; this problem was represented as the search problem of directed graph and the search was narrowed to a smaller area according to the characteristics of the problem; the search algorithm was given for estimating the process of system state transition according to the metrical data of sensor signals; the fault location process was proposed on the basis of the standard signal set，then the faults were located with the estimated results of the algorithm. Three propositions were given and proved to discuss the consistency between the algorithm and the expected result. The fault diagnosis method was validated through the fault data analysis of actual prototype.]]></description>
<pubDate>2016/12/31 18:39:26</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Xinghua, MA Weiming, CUI Xiaopeng, ZHANG Mingyuan and LI Wenlu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Xinghua, MA Weiming, CUI Xiaopeng, ZHANG Mingyuan and LI Wenlu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201606005]]></guid><cfi:id>100</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Numerical simulation of dynamic launching in electromagnetic rail launcher]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201606007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For the numerical simulation method of the dynamic launching in electromagnetic rail launcher, a discrete formulation of three dimensional transient eddy problem for electromagnetic rail launcher considering dynamic launching was established, based on the magnetic vector A and the time integrated electrical scalar potential V, combined by using nodal element method and the moving coordinate frame to deal with the motion.  The corresponding three dimensional magneticthermal coupled model was formed finally by using the governing equation for thermal field. The dynamic launching process of an electromagnetic rail launcher was simulated by the finite element model. Numerical analysis results of FEM (finite element method) code and the experiment results were compared and analyzed. The characteristic of thermal field distribution for launcher and the variation of inductance gradient with time were obtained by the model. Results show that the magnitudes of the pulsed current, muzzle current, and muzzle velocity have good correspondence with measure dates respectively, which has verified the correctness of the FEM code.]]></description>
<pubDate>2016/12/31 18:39:26</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAN Sai, LU Junyong, ZHANG Xiao and LONG Xinlin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAN Sai, LU Junyong, ZHANG Xiao and LONG Xinlin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201606007]]></guid><cfi:id>99</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Electric field prediction method  for ships at sea]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201606027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To weaken the strength of the signals, a prediction method was presented. The electric field signal was decomposed into a low frequency signal and several high frequency signals. The high frequency part was predicted with auto regressive prediction model and the low frequency part was predicted with GM(1，1) model. The prediction result was the superimposition of the respective prediction. Based on the measurement at sea, the simulation results show that the prediction error of the electric field can be controlled within 20% of the amplitude of the signal.]]></description>
<pubDate>2016/12/31 18:39:28</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TAN Hao, CHEN Cong and JIANG Zhiguo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TAN Hao, CHEN Cong and JIANG Zhiguo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201606027]]></guid><cfi:id>98</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Optimization method of decoding circuits′ synthesis using unsatisfiable subformulas]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Explaining the causes of unsatisfiability of the Boolean formulas has many real applications in various fields. The minimum unsatisfiable subformulas can provide most accurate explanations for the causes of infeasibility in many application fields such as the automatic circuits' synthesis. Therefore, two best algorithms of extracting the minimum unsatisfiable subformulas, respectively called the branch-and-bound algorithm and greedy genetic algorithm, were integrated into the automatic synthesis tool of decoding circuits. Adopting the standard encoding circuits in communication fields as the benchmarks,  the study compared and analyzed the two algorithms. The experimental results show that the greedy genetic algorithm outperforms the branch-and-bound algorithm on runtime and removed clauses per second. The results also show that the unsatisfiable subformulas play an important role in the process of synthesizing automatically the decoding circuits.]]></description>
<pubDate>2016/11/8 9:36:35</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Jianmin, LI Tiejun, MA Kefan and XIAO Liquan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Jianmin, LI Tiejun, MA Kefan and XIAO Liquan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605001]]></guid><cfi:id>97</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Counters based performance analysis and optimization of an out-of-order superscalar processor core]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the ever-increasing design complexity in the processor micro-architecture, performance analysis becomes more and more important in the research and design of processors. Performance models are used widely in the performance analysis, which are more suitable for the design space exploration in the early stage. When  used in microarchitecture optimizations, the accuracy and the speed of performance models are the limiting factors. Therefore, a performance analysis method based on counters was proposed. In this method, the RTL register transfer level code of a processor core was used as a baseline, and a specialized performance monitor unit was added to collect the events needed by the micro-architecture analysis and optimization. Then the collected events were sent to a result analyzer, where the factors affecting the performance were obtained. By a dopting the method, we analyzed what affects the performance in running SPEC CPU2000 benchmarks on FPGA(field-programmable gate array) prototyping, and optimized the micro-architecture of processor core according to the analysis results. The performance of the optimized processor core is improved obviously.]]></description>
<pubDate>2016/11/8 9:36:37</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Caixia, SUI Bingcai, WANG Lei, WANG Yongwen, HUANG Libo, LI Wenzhe and WANG Junhui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Caixia, SUI Bingcai, WANG Lei, WANG Yongwen, HUANG Libo, LI Wenzhe and WANG Junhui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605003]]></guid><cfi:id>96</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Soft error analysis and evaluation of dual-layer 3D SRAM based on 65 nm technology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The 3D SRAM (three-dimensional static random access memory) will take the place of 2D SRAM (two-dimensional static random access memory), and will be widely used in high performance microprocessor. However, 3D SRAM still suffers from the dangers of soft error. A novel 3D SRAM soft error analysis platform was designed for studying the soft error characteristic of 3D SRAM. The soft error characteristic of the designed 3D SRAM and the original 2D SRAM were analyzed by using our designed platform. It is found that 3D SRAM and 2D SRAM have the same upset cross section, but the soft error of 3D SRAM is more serious than that of 2D SRAM, which makes it difficult to harden 3D SRAM by using error correction codes technologies. At the static test mode, the upset sensitive nodes were only distributed in the memory array of both 3D SRAM and 2D SRAM. It indicates that the logic circuit can’t induce soft error at static test mode.]]></description>
<pubDate>2016/11/8 9:36:38</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Peng<sup>1</sup>, GUO Wei<sup>1</sup>, ZHAO Zhenyu<sup>1</sup>, ZHANG Minxuan<sup>1,2</sup>, DENG Quan<sup>1</sup> and ZHOU Hongwei<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Peng<sup>1</sup>, GUO Wei<sup>1</sup>, ZHAO Zhenyu<sup>1</sup>, ZHANG Minxuan<sup>1,2</sup>, DENG Quan<sup>1</sup> and ZHOU Hongwei<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605004]]></guid><cfi:id>95</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Thread affinity for buffer management mechanism based on multi-core network packet processing system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The packet processing performance of the general multi-core architecture is plagued by many factors, including high packet IO cost, multi-core share memory and process scheduling competition, TLB entries failure rate, etc. Therefore, a TABM (thread affinity for buffer management mechanism) based on multi-core network packet processing system, which is oriented to high-speed packet forwarding application was proposed and completed on network dedicated co-processing engine. The TABM adopts thread affinity scheduling strategy with no interrupt, sends each packet data and descriptor which contains control and buffer address information to several successive shared buffers according to the corresponding thread ID, and organizes the packets and descriptors which processed in the same thread in the form of a chain. The packet forwarding performance was tested on the basis of general multi-core and field-programmable gate array platform. The experimental data show that the average packet forwarding performance is promoted by about 12.4% and the IO cost and the TLB entries failure rate are reduced by adopting the TABM.  ]]></description>
<pubDate>2016/11/8 9:36:39</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Hui<sup>1</sup>, CHEN Yijiao<sup>1</sup>, LI Tao<sup>1</sup>, LI Shixing<sup>1</sup> and DAI Huanyao<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Hui<sup>1</sup>, CHEN Yijiao<sup>1</sup>, LI Tao<sup>1</sup>, LI Shixing<sup>1</sup> and DAI Huanyao<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605005]]></guid><cfi:id>94</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Shared Cache management scheme with location information and eviction probability in multi-core system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[LLC (last level Cache) plays an important role in multi-core systems. A shared LLC management scheme with fine granularity, low latency and simple hardware complexity was proposed. The performance goal was translated into eviction probabilities of each core. Then, a victim core, which was near  the current core and had higher eviction probability was chosen to provide the victim block for replacement. In this way, LLC was dynamically partitioned among all cores at finer granularity of Cache blocks. This proposal is more flexible than traditional way-partitioning scheme. In addition, the combination of location information and eviction probability improves the locality between Cache resources and the corresponding cores, which can reduce the Cache access latency. The proposed scheme requires only little additional hardware changes to traditional Cache structure. Results on M5 simulator suggest that the performance can improve from 6.8% to 22.7% when comparing with the related works. ]]></description>
<pubDate>2016/11/8 9:36:40</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Jinbo<sup>1</sup>, PANG Zhengbin<sup>1,2</sup> and LI Yan<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Jinbo<sup>1</sup>, PANG Zhengbin<sup>1,2</sup> and LI Yan<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605006]]></guid><cfi:id>93</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multi-level arbitration in optical network-on-chip based on resource reservation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A multi-level arbitration based on resource reservation in optical network-on-chip was proposed. The fast and high efficiency arbitration scheme divided the network into multi-stages. With the design of multi priority queues in every node, arbiters provided differential transmissions for different kinds of flows. The arbiter also presented the transmit bund resource reservation scheme to fairly reserve time slots for all nodes, thus achieving the throughput of 100%. The fast arbitration channels were proposed and designed to degrade the arbitration period, and the packet transmitting delay was reduced. The simulation results show that, with the multi-level arbitration based on resource reservation, all nodes are allocated with almost equal service under various patterns. This scheme improves throughput by 17% when compared with FeatherWeight under the self-similar traffic pattern, and eliminats arbitration delay by 15% to 2-pass arbitration, incurring total power overhead by 5%.]]></description>
<pubDate>2016/11/8 9:36:40</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[JIAN Jie, LAI Mingche and XIAO Liquan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>JIAN Jie, LAI Mingche and XIAO Liquan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605007]]></guid><cfi:id>92</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Memory resources reservation method for virtual machine in cloud computing system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to reduce the consumers’ costs of renting resources in cloud computing system, a random integer linear programming model and a method for memory reservation were presented on the basis of cost constraints. Combined with the memory resource price of the reservation plan and the on-demand plan, the random cost function which consists of costs and total amount of resources constraints was designed. Aimed at minimizing the expected value of the cost function, the optimal amount of memory reserved was obtained on the basis of the probability distribution of memory consumption. The experiments show that the cost of renting recourses by utilizing this method is less than the cost of renting recourses by adopting reservation plan, on-demand plan and other similar methods.]]></description>
<pubDate>2016/11/8 9:36:41</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[KAN Yunqi<sup>1,2</sup>, LIU Hongwei<sup>1</sup>, ZUO Decheng<sup>1</sup> and ZHANG Zhan<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>KAN Yunqi<sup>1,2</sup>, LIU Hongwei<sup>1</sup>, ZUO Decheng<sup>1</sup> and ZHANG Zhan<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605008]]></guid><cfi:id>91</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[CacheFI: micro-architectural-level fault injection based fault-tolerant evaluation tool for on-chip Caches]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Architectural solutions of on-chip Cache fault tolerance are considered as effective means for high persistent failure probabilities. However, less fault injection tools for on-chip Caches are available. Therefore, the CacheFI, a fault injection tool based on the full-system simulator Simics was proposed. A separate mechanism of the fault generation and injection was employed. Fault generation consists of stochastic distribution control, failure patterns and explosive timing. Fault injection was designed to focus on the requirement of repeatability and modularity. According to the experiments based on Simics and 15 benchmarks from SPEC CPU2000, it evaluates typical micro-architectural fault mechanisms, such as Buddy, MAEP(matching access and error pattern) etc. by injecting Cache faults with CacheFI. Consequently, it presents the weakness and issues of these typical mechanisms.]]></description>
<pubDate>2016/11/8 9:36:42</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HUANG Zhibin<sup>1,2</sup>, ZHOU Feng<sup>1</sup>, MA Huadong<sup>1</sup> and HE Ruoyu<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HUANG Zhibin<sup>1,2</sup>, ZHOU Feng<sup>1</sup>, MA Huadong<sup>1</sup> and HE Ruoyu<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605009]]></guid><cfi:id>90</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Helper thread pre-fetching model based on learning gradients of control parameters]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To the applications with irregular accessing memory, if the overhead of accessing memory for a given application is much greater than that of computation, it will make the helper thread lag behind the main thread. Hereby, an improved helper thread prefetching model by adding control parameters was proposed. The gradient descent algorithm is one of the most popular machine learning algorithms, which was adopted to determine the optimal control parameters. The amount of the memory access tasks was controlled by the control parameters effectively, which makes the helper thread be finished ahead of the main thread. The experiment results show that the speedup of system performance is achieved by 1.1 times to 1.5 times.]]></description>
<pubDate>2016/11/8 9:36:43</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[PEI Songwen<sup>1,2</sup>, ZHANG Junge<sup>1</sup> and NING Jing<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>PEI Songwen<sup>1,2</sup>, ZHANG Junge<sup>1</sup> and NING Jing<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605010]]></guid><cfi:id>89</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Incremental clustering algorithm of neural network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Neural network model is powerful in problem modelling. But the traditional back propagating algorithm can only execute batch supervised learning, and its time expense is very high. According to these problems, a novel incremental neural network model and the corresponding clustering algorithm were put forward. This model was supported by biological evidences, and it was built on the foundation of novel neuron’s activation function and the synapse adjusting function. Based on this, an adaptive incremental clustering algorithm was put forward, in which mechanisms such as “winner-take-all” were introduced. As a result, “catastrophic forgetting” problem was successfully solved in the incremental clustering process. Experiment results on classic datasets show that this algorithm’s performance is comparable with traditional clustering models such as K-means. Especially, its time and space expenses on incremental tasks are much lower than traditional clustering models.]]></description>
<pubDate>2016/11/8 9:36:51</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Peilei<sup>1,2</sup>, TANG Jintao<sup>1</sup>, XIE Songxian<sup>1</sup> and WANG Ting<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Peilei<sup>1,2</sup>, TANG Jintao<sup>1</sup>, XIE Songxian<sup>1</sup> and WANG Ting<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201605021]]></guid><cfi:id>88</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[New method for transferring flow information among meshes based on mesh deformation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201604004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[According to the data interpolation problems between the old and new grid in the mesh reconstruction, a flow field information transmission algorithm based on the lattice format supported finite volume method was proposed. In order to realize information transfer between the two sets of the grid, the old cells were moved to the new grid cells by using the unstructured dynamic grid technology and the control equation was solved in time domain, then the datum was assigned to the new grid cells. Result shows that the interpolation error is not introduced in the process of information transmission, the theory precision of the method is equal to the precision of information transmission, and the verification results show that the proposed method is significantly better than that of the second order interpolation method.]]></description>
<pubDate>2016/9/13 11:24:52</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[DONG Haibo, XU Chunguang and LIU Jun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>DONG Haibo, XU Chunguang and LIU Jun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201604004]]></guid><cfi:id>87</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Accelerated rendering for electromagnetic environment under single device restriction]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201604011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Electromagnetic environment with a high efficiency based on single device supports has wide range of applications. But the efficiency of parallel ray-casting for rendering electromagnetic environment is restricted by the device. Based on researching the restriction of device for parallel ray-casting, a pixel interpolation method focusing on the restriction was presented. The number of rays was reduced when the parallel ray-casting rendering under device restriction couldn’t  be completed immediately, namely, a part of pixels in the rendering image were generated by ray-casting and the rest pixels through interpolation. Pixel interpolation got rendering efficiency at the cost of image quality, so when image update paused, the interpolated pixels were regenerated to recover image quality. The experiments show that pixel interpolation obviously improves rendering efficiency when implemented on a low device. Compared with the rendering images of some volume data and the errors in these images, the electromagnetic environment data has the best rendering result, which proves that pixels interpolation is useable especially for rendering electromagnetic environment on a low device.]]></description>
<pubDate>2016/9/13 11:24:53</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FENG Xiaomeng<sup>1</sup>, WU Lingda<sup>1,2</sup>, YU Ronghuan<sup>1</sup> and YANG Chao<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FENG Xiaomeng<sup>1</sup>, WU Lingda<sup>1,2</sup>, YU Ronghuan<sup>1</sup> and YANG Chao<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201604011]]></guid><cfi:id>86</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multicast routing algorithm with minimizing channel collision and resource consumption in cognitive wireless Mesh networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201604012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In cognitive wireless Mesh networks, the  multiple-objective optimization problem with quality of service constraints is more complicated than the single objective optimization problem. To obtain the optimal multicast routing solution which satisfies the quality of service constraints and is aimed at minimizing the channel collision and the resource consumption, a problem solving framework which contains problem description, particle encoding, particle initialization, fitness function, particle flight, particle mutation, particle elimination circle, was proposed on the basis of particle swarm optimization. Adjacency matrix which shows the connection relation between nodes was used to represent particle. Three operation rules, particle flight operation and particle mutation operation were redefined. Simulation results show that the proposed algorithm can achieve the expected goal. It can achieve the effect of a lower resource consumption and a smaller channel collision value.]]></description>
<pubDate>2016/9/13 11:24:53</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Yiqing and CHEN Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Yiqing and CHEN Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201604012]]></guid><cfi:id>85</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Router-level topology generation research for Internet backbone networks under multiple constraints]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201603028]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The backbone network is the main part of the Internet traffic transfer system, and the router-level topology of backbone network is of great significance for the research on network survivability. Due to various reasons, it is difficult to get real Internet backbone router level topology. By analyzing the forming driving factors of backbone network,  the geographical constraints, the exchanging strength of nodes, infrastructure cost and robustness, etc. were combined; the router-level topology generation method for Internet backbone networks under multiple constraints was proposed. The method can generate router level topology for network which cannot be inferred from publicly accessible measurement data, and can generate topology set that consists of realistic alternatives for a backbone network. Finally, the effectiveness of the method is verified by two real Internet backbone networks. ]]></description>
<pubDate>2016/7/7 11:14:30</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WU Yuanli<sup>1,2,3</sup>, SI Guangya<sup>1</sup> and LUO Pi<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WU Yuanli<sup>1,2,3</sup>, SI Guangya<sup>1</sup> and LUO Pi<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201603028]]></guid><cfi:id>84</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Vision-based landing method using structured line features of runway surface for fixed-wing unmanned aerial vehicles]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201603030]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For the estimation problem of pose and attitude of fixed-wing unmanned aerial vehicles in the terminal landing stage, a vision-based landing method using structured line features was proposed. One forward looking camera equipped in the fixed-wing unmanned aerial vehicles was used to capture multiple pictures of the structured line features and these features were extracted automatically. 6 degrees of freedom pose and attitude parameters (pitch angle, yaw angle, roll angle, longitudinal position, lateral position and altitude) were calculated by using geometric constraint of full configuration structured line features in the earlier stage of the landing, the key parameters (pitch angle, yaw angle, lateral position and altitude) were calculated by using degenerate configuration structured line features (only the runway edges) in the final stage of the landing. In the 3D stimulation experiment, the accuracy of distance is less than 0.5 m, the accuracy of angle is less than 0.1°when the fixed-wing unmanned aerial vehicle is 200 m distant from the airport. ]]></description>
<pubDate>2016/7/7 11:14:33</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Langming, ZHONG Qing, ZHANG Yueqiang, LEI Zhihui and ZHANG Xiaohu]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Langming, ZHONG Qing, ZHANG Yueqiang, LEI Zhihui and ZHANG Xiaohu</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201603030]]></guid><cfi:id>83</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Simplified method for integration of heterogeneous database application system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201602011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The existing integrated methods are mainly aimed at the layer of database system. In view of the shortage of those methods, the integration method in the application layer was focused on. According to a new perspective of access control for the database application system, the access control layer was separated from the application layer. A new method called as “fusion” access control was put forward. Based on the method, a simplified integration method of heterogeneous database application system was proposed. An example was  shown about how to apply the simplified integration method to achieve the integration of heterogeneous database application system, and the advantages of the new method were verified by a comparison analysis.]]></description>
<pubDate>2016/5/6 16:32:20</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Chunqiang<sup>1,2</sup>, CHAI Weiyan<sup>1</sup>, LIU Jian<sup>2</sup> and CHEN Linan<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Chunqiang<sup>1,2</sup>, CHAI Weiyan<sup>1</sup>, LIU Jian<sup>2</sup> and CHEN Linan<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201602011]]></guid><cfi:id>82</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A distributed graph pattern matching algorithm using partial evaluation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201602013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to execute graph pattern matching quickly in distributed large-scale graphs, an effective distributed algorithm using partial evaluation, namely disGPM-PE was proposed. Firstly, partial matching was performed locally at each computer nodes in parallel. Secondly, a coordinator node assembled the partial matching results, evaluated and sent the matching conditions of boundary nodes to corresponding computer nodes. Thirdly, each computer nodes determines the matching conditions of the nodes connected to the boundary nodes. Finally, the maximum matching set was collected at the coordinator node. Experiment results show that the disGPM-PE algorithm can avoid the impact of the dependent relations between data fragments on the execution time. Compared with the previous distributed graph pattern matching algorithms, the disGPM-PE algorithm can reduce the execution time of graph pattern matching while do not increase the network traffic obviously. ]]></description>
<pubDate>2016/5/6 16:32:20</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Lixia<sup>1,2</sup>, WANG Weiping<sup>1</sup>, GAO Jianliang<sup>1</sup> and WANG Jianxin<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Lixia<sup>1,2</sup>, WANG Weiping<sup>1</sup>, GAO Jianliang<sup>1</sup> and WANG Jianxin<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201602013]]></guid><cfi:id>81</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Parameterized multi-standard high-throughput radix-4 Viterbi decoder  on field-programmable gate array]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201601015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To achieve the goal of high performance and flexibility, a parameterized multi-standard adaptive radix-4 Viterbi decoder based on the field-programmable gate array was presented. This decoder adopts constraint lengths ranging from 3 to 9, code rates of 1/2 or 1/3 and supports error-correcting decoding of arbitrary truncation lengths. The unsigned quantization, add-compare-select unit optimization and normalization judgment logic separation strategies were used to optimize the design of critical path, so that it can improve system throughput. Experiment results show that: the decoder can change the structures according to the parameters set by users and achieve dynamic switching in multiple communication standards; the throughput can reach up to 541 Mbps, apparently superior to the related works; the decoder achieves low bit error ratio in multiple standards such as GPRS, WiMax, LTE, CDMA and 3G and satisfies the decoding requirements of multiple communication standards. ]]></description>
<pubDate>2016/3/7 9:21:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XIA Fei<sup>1</sup>, NIE Jing<sup>1</sup>, LI Rongchun<sup>2</sup> and WANG Wentao<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XIA Fei<sup>1</sup>, NIE Jing<sup>1</sup>, LI Rongchun<sup>2</sup> and WANG Wentao<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201601015]]></guid><cfi:id>80</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Data collection for failure prediction toward exascale supercomputers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201601016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aimed at an exascale supercomputer, an FPDC (failure prediction data collection framework) was introduced to fully collect the data related to the state of compute nodes’ health. An adaptive multi-layer data aggregation method was presented for data aggregation with less overhead. Extensive experiments, by implementing FPDC on TH-1A，indicate that the FPDC has the advantage of high efficiency and good scalability.]]></description>
<pubDate>2016/3/7 9:21:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Wei<sup>1,2</sup>, JIANG Yanhuang<sup>1</sup>, LIU Guangming<sup>1,2</sup>, DONG Wenrui<sup>1,2</sup> and CUI Xinwu<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Wei<sup>1,2</sup>, JIANG Yanhuang<sup>1</sup>, LIU Guangming<sup>1,2</sup>, DONG Wenrui<sup>1,2</sup> and CUI Xinwu<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201601016]]></guid><cfi:id>79</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and mechanism of the fault tolerance of solid state recorder]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201601017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The satellite data transmission system is faced with various threats such as single event upset in semiconductor devices, the transmission noise and so on. The key component of the design and implementation of high-capacity SSR (Solid State Recorder) of the transmission system was introduced, and based on the SSR, a fault tolerance mechanism was proposed to protect management information, data bit stream, satellite-to-ground link and file delivery. The mechanism improved the fault tolerance ability of the management information of SSR, the data in store and the transmission channel with the hamming code, the RS code and the LDPC (Low Density Parity Check Code) encoding. Advanced research of one automatic repeat request method with CFDP (CCSDS File Delivery Protocol) was also proposed based on the SSR of one actual space mission to improve the transmission reliability in file-level. The SSR used 4-pipeline writing and bus expansion techniques to achieve the throughput rate of almost 900Mbps theoretically and the capacity of 256Gb.]]></description>
<pubDate>2016/3/7 9:21:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SONG Qi<sup>1,2</sup>, ZOU Yenan<sup>1,2</sup>, LI Shan<sup>1,2</sup>, AN Junshe<sup>1</sup> and ZHU Yan<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SONG Qi<sup>1,2</sup>, ZOU Yenan<sup>1,2</sup>, LI Shan<sup>1,2</sup>, AN Junshe<sup>1</sup> and ZHU Yan<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201601017]]></guid><cfi:id>78</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Model analysis and design optimization for automatic gain control circuits in satellite navigation antijamming receivers]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To support strong interference signal input under “navigation warfare” scenarios, navigation receivers are requested for increasing dynamic range in analog channels. Under the given constraint condition of signal to noise ratio deterioration, a two-dimensional curve model to offer a method for dynamic range optimizing and stage gain design was put forward by the legacy analysis method. However, this method was only applicable for the AGC(automatic gain control) circuits that the output power was basically stable. A solving model involving the three-dimensional curve based on the extra parameter called the rollback value of the AGC output power was put forward. The model revealed the relationship between the circuit parameters and the dynamic range of analog channel and it is suitable for the AGC circuits with variable output power, which can achieve a larger dynamic range. To reduce the complexity of the parameter calculation in the three-dimensional model, the complex numerical solution to linear equation solution according to the features of pure attenuation network was simplified. This simplification can substantially reduce the design complexity. Test results of dynamic range are in good consistence with the expectation in practical designs, which proves the accuracy of the analysis model.]]></description>
<pubDate>2018/1/16 17:02:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Baiyu, TANG Xiaomei, NIE Junwei and LIU Zhe]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Baiyu, TANG Xiaomei, NIE Junwei and LIU Zhe</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706005]]></guid><cfi:id>77</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Linear feature detection algorithm combined with pixel local contrast]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Robust and efficient line extraction algorithm has been widely used in space photogrammetry field such as target pose detection, tracking and skeleton reconstruction. A line segment detector based on local contrast of pixels and global false detection control was proposed. The method consists of four steps. Firstly, the gradient and local contrast of each pixel was calculated. Secondly, the pixels with  similar orientations were clustered into the line support region which was approximated by a rectangle. After that the line support region was fitted into a line segment with the above one pixel width and the line parameters were estimated. Finally, the line segment candidates were validated and the false detection was controlled. The experimental results show that the proposed method is much more robust and efficient than the traditional methods in hash conditions, especially in complex illumination.]]></description>
<pubDate>2018/1/16 17:02:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Junfeng<sup>1,2</sup>, DING Shaowen<sup>1</sup>, ZHANG Xiaohu<sup>1</sup> and ZHANG Yueqiang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Junfeng<sup>1,2</sup>, DING Shaowen<sup>1</sup>, ZHANG Xiaohu<sup>1</sup> and ZHANG Yueqiang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706006]]></guid><cfi:id>76</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[DDR3 data buffering for memory access optimization]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to improve the memory access efficiency of the DDR3 memory controller, a data buffering mechanism based on DDR3 memory access burst length was proposed. The application requests were guided into three different queues. The data buffering mechanism can make use of the additional data obtained from DRAM(dynamic random access memory) in one of the former request,  thus reducing the actual external DRAM access needed. Experiments on several image and video application show that the proposed mechanism can improve the memory controller by an average 21.3% and a peak by 51.3% at an acceptable hardware cost when compared with the FCFS (first-come-first-serve) baseline DDR3 memory controller.]]></description>
<pubDate>2018/1/16 17:02:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Shenggang<sup>1</sup>, FU Xingfei<sup>1</sup>, ZENG Si<sup>1</sup> and LIU Sheng<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Shenggang<sup>1</sup>, FU Xingfei<sup>1</sup>, ZENG Si<sup>1</sup> and LIU Sheng<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706007]]></guid><cfi:id>75</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Cervical cell recognition based on hierarchical method and principal component analysis feature transformation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to recognize multi-class cervical cells automatically, a hierarchical method with PCA (principal component analysis) feature transformation was proposed and this cell recognition could provide the evidence for cervical cancer diagnosis. The cervical cell recognition was treated as a 4-class classification problem. There were two levels in this hierarchical method. First, one-versus-one strategy was used to train 6 SVM (support vector machine) classifiers to do a 3-class classification. Second, abnormal cells in one type of 3 categories were classified by a 2-class SVM. To optimize the feature combination and reduce the  running time, a feature transformation method named PCA was adopted to transform the original feature vector into lowdimension feature space. The experiments show that the proposed hierarchical PCA recognition method is faster than the common hierarchical method at a ratio of 21.31%, and can distinguish 4 cervical cell categories better than 6 other traditional methods and achieve above 90% accuracy.]]></description>
<pubDate>2018/1/16 17:02:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Lili<sup>1</sup>, SUN Liaoyuan<sup>2</sup>, YIN Jianping<sup>2</sup>, LI Kuan<sup>2</sup>, YIN Wanpeng<sup>2</sup> and ZHU En<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Lili<sup>1</sup>, SUN Liaoyuan<sup>2</sup>, YIN Jianping<sup>2</sup>, LI Kuan<sup>2</sup>, YIN Wanpeng<sup>2</sup> and ZHU En<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706008]]></guid><cfi:id>74</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Storage strategy of raster data under the distributed computing environment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Traditional storage strategy of raster data cannot meet the demands of coarse-grained data processing under the distributed computing environment and has low efficiency when dealing with calculations for gigantic raster data. A storage strategy of raster tile data was presented on the basis of the storage characteristics of distributed file system. It also took the calculation characteristics of spatial analysis operators of map algebra into consideration, which uses raster tile as processing unit during map and reduce stage. The storage strategy was implemented by the following steps. Firstly raster data were divided into raster tiles. Then these tiles were compressed and organized by a special sequence in order to be transferred to Hadoop distributed file system. Finally input and output file interfaces were re-implemented to meet the data access requirements of map and reduce stage. The strategy was tested and verified by the distributed calculation process of local map algebra operators. Theoretical analysis and experimental results show that this strategy can significantly improve the processing speed of space analysis operators.]]></description>
<pubDate>2018/1/16 17:02:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Jianbo, XIA Dengcheng, ZHAO Jiaao, LI Xieqing, CUI Yongjian and YUAN Guobin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Jianbo, XIA Dengcheng, ZHAO Jiaao, LI Xieqing, CUI Yongjian and YUAN Guobin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706009]]></guid><cfi:id>73</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Parallel algorithm for extending Merkle-Damgård Hash construction]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Relaxed encryption framework which extends hash functions of Merkle-Damg?rd construction to a parallel construction can improve Hash performance by multi-core processor. A proving process was given to show that relaxed encryption framework has no property of collision resistance when processing messages of different size. A new parallel extending algorithm was proposed base on the design of relaxed encryption framework, which remedies the security flaws of the relaxed encryption framework, and the security of the new parallel Hash construction was also discussed. The cryptanalysis shows that the property of collision resistance of the new parallel construction is not weaker than the hash function of Merkle-Damg?rd construction. Experimental results indicate that the new Hash construction performs better when processing messages of large size.]]></description>
<pubDate>2018/1/16 17:02:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Jinsong<sup>1,2</sup>, ZHANG Minxuan<sup>2</sup>, CHEN Shiwei<sup>1</sup> and DAI Zibin<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Jinsong<sup>1,2</sup>, ZHANG Minxuan<sup>2</sup>, CHEN Shiwei<sup>1</sup> and DAI Zibin<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201706010]]></guid><cfi:id>72</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Self-optimizing iterative classification method of high-resolution remote sensing images]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201704012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A self-optimizing iterative classification method based on image segments which classifies high-resolution remote sensing images by acquiring training samples through semi-supervised fuzzy Cmeans and designing the self-optimizing iterative classifier based on support vector machine was proposed. Image segments could be obtained by fractal net evolution approach and a few labeled samples were selected; based on labeled samples, image segments were clustered by semi-supervised fuzzy C-means clustering method and then training samples could be obtained by intensity filtration from clustering results; the self-optimizing iterative support vector machine was designed to carry on classification iteratively until the classification requirements were met and during the classification process, training samples were updated and optimized to improve the performance of the classifier by statistical analyses of the two adjacent classifications. QuickBird and WorldView images of Wuhan City were classified by the method proposed by this paper and the overall accuracy achieved 94.67% and 92%. In comparison with the overall accuracy of the classification with training samples selected by manual work, the regular support vector machine classification method and the least squares support vector machine classification method, the accuracy of the suggested method is obviously higher and the classification effect is better.]]></description>
<pubDate>2017/9/12 10:09:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Lei, WAN Youchuan, LI Gang and JIANG Ying]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Lei, WAN Youchuan, LI Gang and JIANG Ying</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201704012]]></guid><cfi:id>71</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Quantitative evaluation metric and methodology for microprocessor soft error tolerance design]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at highly reliable microprocessor soft error tolerance design, a new metric, eMWTF (enhanced mean work to failure), was proposed to capture the trade-off among reliability, performance, area and power. A quantitative approach for evaluating eMWTF was also presented. Two control flow checking techniques were quantitatively evaluated in reliability. The experimental results indicate that the control flow checking by compiler signatures and hardware checking achieves better trade-off among reliability, performance, area and power. Because the eMWTF metric takes into consideration performance, area and power overheads, the quantitative reliability evaluation can be more accurate by using this metric and corresponding methodology. Finally, the evaluation results can effectively guild the design exploring and optimization.]]></description>
<pubDate>2017/7/9 11:57:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GONG Rui, GUO Yufeng, DENG Yu, SHI Wei and DOU Qiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GONG Rui, GUO Yufeng, DENG Yu, SHI Wei and DOU Qiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703011]]></guid><cfi:id>70</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Online evolution of the digital system on bitstream relocation and discrepancy configuration]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To break through the limitations of huge memory space and low evolution speed for complex circuits′ evolution, the bitstream relocation and the discrepancy configuration were adopted to improve the efficiency of the evolvable hardware implementation approach based on dynamic partial reconfiguration. Firstly, an evolvable IP core capable of bitstream relocation was customized by using the technology of early stage accession to partial reconfiguration provided by Xilinx. Then the original bitstream files were presynthesized to form a partial bitstreams library stored in the CF memory for the system to call. Next, a self-evolving system based on a programmable chip system was built, in which the soft processor, MicroBlaze, was utilized as the evolution controller. And the discrepancy configuration was adopted for the real-time adjustment of the circuit topology of the evolvable IP core. Finally, the system structure and the self-evolving mechanisms were verified by the online evolution of digital image filters implemented on the Xilinx Virtex-5 FPGA(field programmable gate array) development board ML507. Experimental results show that the proposed evolutionary mechanisms can reduce the storage space of bitstream files and can accelerate the speed of evolution significantly.]]></description>
<pubDate>2017/7/9 11:57:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YAO Rui, HE Kun, ZHU Ping, LI Zengwu and YANG Yuzhong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YAO Rui, HE Kun, ZHU Ping, LI Zengwu and YANG Yuzhong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703012]]></guid><cfi:id>69</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Measuring method for friend relationship strength in daily communication]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The FRSHV(friend relationship strength hierarchy vote), a hierarchical model, was proposed to measure the friend relationship strength by user′s daily moving track, semantic positions and the corresponding semantic labels. The daily track similarity was measured by dynamic time warping model using the spatial distance between friends, and the results were then weighed by the entropy of track series. The similarities of friend′s behavior patterns were inferred by latent Dirichlet allocation topic model, respectively using semantic positions and the corresponding semantic labels. Finally, these three similarity results were voted for the ultimate relationship strength. The FRSHV was evaluated by using an open dataset and the results proved the validity of the model in inferring friend′s relationship strength.]]></description>
<pubDate>2017/7/9 11:57:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Dianxi, YANG Ruosong, MO Xiaoyun, LI Han and ZHAO Banghui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Dianxi, YANG Ruosong, MO Xiaoyun, LI Han and ZHAO Banghui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703013]]></guid><cfi:id>68</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[News topic discovery model of multi feature fusion text clustering]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The news topic discovery model based on multi feature fusion text clustering was proposed fusing multi features of news, such as named entities, news headlines, important paragraphs, text semantics and so on. Based on the multi feature influence of news, a multi feature fusion text clustering method was put forward in this model. In this way, vector space model and similarity algorithm based on feature words, news headlines, important paragraphs were constructed, subject space model and similarity algorithm based on latent Dirichlet allocation were constructed, named entity model and similarity algorithm based on named entities were constructed, and those three similarity algorithms were fused optimally. Based on multi feature fusion text clustering method, the Single-Pass algorithm used in the news topic discovery was improved. Experiments were carried out on the real news data set, and the experimental results show that the model can improve the accuracy rate, recall rate and comprehensive evaluation index of the news topic discovery, and have some ability of self-adaption.]]></description>
<pubDate>2017/7/9 11:57:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHE Lei<sup>1,2</sup> and YANG Xiaoping<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHE Lei<sup>1,2</sup> and YANG Xiaoping<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703014]]></guid><cfi:id>67</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Scene Chinese text localization by convolutional neural network classifying maximum stable extremal regions]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Firstly, the MSERs (maximum stable extremal regions) which corresponded to Chinese strokes was extracted. The morphological close operation was used to connect the nearby MSERs. The fused MSER corresponded to Chinese characters. Gray level co-occurrence matric was used to describe the textural characteristics of the fused MSER rectangle. They were the input of CNN (convolutional neural network). The MSER rectangles were classified by CNN in order to filter none Chinese character rectangle. Then, Chinese text candidates were constructed by clustering MSER rectangles based on the features such as the color histogram Bhattacharyya distance of MSER rectangles. CNN was reused to classify Chinese text candidates to filter none Chinese text clusters. Finally, the rectangle of the remaining clusters was the Chinese text regions of natural scene image. Experiment shows that the proposed algorithm is desirable in localizing the Chinese text in natural scene images.]]></description>
<pubDate>2017/7/9 11:57:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Pengwei and ZHANG Weiwei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Pengwei and ZHANG Weiwei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703015]]></guid><cfi:id>66</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Directed acyclic graph application scheduling strategy based on critical path cut on cloud platform]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To address the problems that the resource is surplus, the resource utilization rate is low and the cost is unreasonably high for virtual machines in the scientific application of DAG(directed acyclic graph), a novel DAG scientific workflow scheduling algorithm based on CPC(critical path cut) was proposed. In the algorithm, the CPC technology was adopted to circularly find the unallocated task which is finished at last; the biggest connected subgraph was found from the graph constructed by the whole unallocated tasks; the critical path of this subgraph was calculated and the task set on the critical path was scheduled to the performance-matched virtual machine to execute. Meanwhile, the isolated tasks were used to fill in the idle slots of the virtual machines, such that the resource utilization could be improved. Experimental results demonstrate that, the proposed CPC algorithm can effectively reduce the execution cost of the scientific workflows while satisfying the deadline constraint in mean time. ]]></description>
<pubDate>2017/7/9 11:57:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Shaowei<sup>1</sup>, REN Kaijun<sup>2</sup>, DENG Kefeng<sup>2</sup> and SONG Junqiang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Shaowei<sup>1</sup>, REN Kaijun<sup>2</sup>, DENG Kefeng<sup>2</sup> and SONG Junqiang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201703016]]></guid><cfi:id>65</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Image capture and compression system for sounding rocket]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201702010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The image system design for sounding rockets faced many difficulties, such as the limited telemetry bandwidth, multiple camera channels and a limited size, therefore an appropriate image capture and compression system based on ADV212 was proposed. The images were compressed as JPEG2000 standard which support both lossless and high ratio compression, so acceptable quality images can be transmitted through the limited-bandwidth telemetry channel. An effective channel switching and interrupt processing method  suitable for on-board design was proposed. The image data was transmitted by assembly line based on pingpong operation and sent to the telemetry module on sounding rocket via two real-time channels and one buffering channel. The images compression scheme, which support both dynamic frame frequency and dynamic compression ratio, was proposed to deal with the limited telemetry bandwidth. The whole system was controlled by a Virtex-4 FPGA(field programmable gate array), and images were decoded by ADV7182 and compressed by ADV212. The realtime data transfer was approached by SRAM(static random access memory), while the buffering data transfer was approached by SDRAM(synchronous dynamic random access memory). The suitable choices of compression filter and wavelet transformation level for CCD(change-coupled device) images were analyzed through experiments by comparing PSNR(peak signal to noise ratio) between images. This image compression system fully satisfies the image monitor mission of space environment vertical exploration sounding rocket.]]></description>
<pubDate>2017/5/11 16:56:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Dawei<sup>1,2</sup>, LIU Cheng<sup>1</sup>, ZHENG Jianhua<sup>1</sup> and LIU Yiteng<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Dawei<sup>1,2</sup>, LIU Cheng<sup>1</sup>, ZHENG Jianhua<sup>1</sup> and LIU Yiteng<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201702010]]></guid><cfi:id>64</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Adaptive reception reports sending mechanism in inter-session network coding]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201702018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The existing intersession network coding mechanisms almost unanimously adopt “τ-interval-notification”, which is used to determine the coding opportunities, and its overhead has not been analyzed. In the current study, its communication overhead and its impacts on coding opportunity and throughput were analyzed, and an adaptive reception report sending mechanism called AR<sup>2</sup>SM (Adaptive Reception Reports Sending Mechanism) was proposed. In AR<sup>2</sup>SM, the interval of broadcasting reception reports is determined adaptively according to the traffic of local network, and the reception reports carry the packets overheard in the last 2 intervals. As a result, the size of reception report and the frequency of sending reception report were both reduced on the condition of guaranteeing the coding opportunity. According to the simulator results in network simulator, the proposed mechanism reduces the overhead of transmitting the reception reports, and achieves higher throughput than the “τ-interval-notification” mechanism.]]></description>
<pubDate>2017/5/11 16:56:55</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Xiang<sup>1,2</sup>, WANG Weiping<sup>1</sup> and WANG Jianxin<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Xiang<sup>1,2</sup>, WANG Weiping<sup>1</sup> and WANG Jianxin<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201702018]]></guid><cfi:id>63</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Modeling of schedule-aware synchronous dataflow]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201702019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To analyze the throughput of streaming application systems, it is  necessary to model the periodic static order schedule into the synchronous dataflow graph. The throughput analysis efficiency depends on the size of the dataflow graph and the modeling time. To improve the throughput analysis efficiency, a schedule-aware dataflow model and its modeling method were proposed on the basis of the homogeneous synchronous dataflow graph. By exploiting the structure of the application model and the periodic static order schedule, the task number, edge number and initial token number were reduced. Besides, the throughput of the model can be analyzed using available analyzing methods. Experimental results show that the proposed modeling method outperforms the available methods, with the throughput analysis being optimized efficiently.]]></description>
<pubDate>2017/5/11 16:56:56</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[TANG Qi, WU Shangfeng, SHI Junwu and WEI Jibo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>TANG Qi, WU Shangfeng, SHI Junwu and WEI Jibo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201702019]]></guid><cfi:id>62</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Service model and performance analysis of ternary optical computer based on complex queuing system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201702021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The request processing of ternary optical computer lacked reasonable systematic standard and system for performance evaluation. Therefore, a four-stage service model was built based on complex queuing systems includingM/M/1、M/M/n、M<sup>X</sup>/M/1和M/M<sup>B</sup>/1. Meanwhile, strategy and algorithm of instant-scheduling and end-scheduling were proposed in detail. Based on different queuing systems, the calculation method of receiving time, preprocessing time, operating time and transmitting time of the request were discussed, and the final response time was obtained. Finally, the models of two strategies were verified by simulation experiments. Results show that the end-scheduling strategy is superior to the instant-scheduling strategy.]]></description>
<pubDate>2017/5/11 16:56:56</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XU Qun<sup>1</sup> and WANG Xianchao<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XU Qun<sup>1</sup> and WANG Xianchao<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201702021]]></guid><cfi:id>61</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design and physical implementation of non-blocking ring on a multicore processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201701011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A bi-directional non-blocking ring architecture was proposed for the multicore processor with relative less amount of high-performance cores. The architecture consists of five ring layers of three different types for commands, huge data and small data transportation, respectively. The source routing strategy was employed and an equipment state control interconnection was designed for congestion management. The router has a bufferless and contention-free structure and each hop only takes one clock cycle, thus minimizing the transmission delay and realizing deterministic routing. Considering the long links and high bandwidth of the ring, experiments were carried out to find a proper repeater insertion method, and the crosstalk optimizing methods, such as inverter insertion crosswise between two neighborhood lines and arranging neighborhood lines in signal transport direction, were studied to conduct physical design for the ring and delay optimization for the long links. Implementation results show that the designed ring′s bandwidth is 256 GByte/s @1 GHz, which can fulfill the data communication demands of the digital signal processing applications.]]></description>
<pubDate>2017/3/7 11:55:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Shenggang, LIU Biwei, QI Juan, HUA Yingzhao, XING Sufang and DING Yanping]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Shenggang, LIU Biwei, QI Juan, HUA Yingzhao, XING Sufang and DING Yanping</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201701011]]></guid><cfi:id>60</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Mining user frequent behavior patterns in daily life]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201701012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Research focused on how to mine frequent daily behavior patterns of users on smartphones feasibly and efficiently was started. Firstly, a frequent behavior patterns mining framework based on smartphones was proposed. Secondly, a dynamic sliding window algorithm DSW(dynamic slide window) to decrease the context baskets in quantity and improve mining efficiency was proposed. Furthermore, a frequent patterns mining algorithm WePM(weighted pattern mining) which takes both frequency and duration of context occurrence into consideration was developed. On the basis of the above preparation, the mining framework and algorithm were verified experimentally with the context data from 21 users over 6 weeks. Results indicate that the proposed framework and frequent patterns mining algorithm can feasibly and efficiently run on resources limited smartphones to mine daily behavior patterns, and then to reflect users’ lifestyles. Finally, the patterns from two perspectives, namely behavior patterns in different locations and time periods are visualized, which benefits the users to realize their daily behavior patterns at any time.]]></description>
<pubDate>2017/3/7 11:55:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Dianxi, LI Han, YANG Ruosong, MO Xiaoyun and WEI Jing]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Dianxi, LI Han, YANG Ruosong, MO Xiaoyun and WEI Jing</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201701012]]></guid><cfi:id>59</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Performance evaluation method for dual-route unit based on SpaceWire bus]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201701014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The performance evaluation system of SpaceWire bus based on dual-route unit was studied. The definition of dual-route unit was given and the computation method of data transmission time and resource consumption of the route system based on dual-route unit was derived during the study. The performance evaluation system of multi-route topological system based on dual-route unit was derived; the simulation platform of dual-route unit system was built by using the Monte-Carlo method, and the performances of route unit with different interface configurations were simulated. Study results show that the performance of SpaceWire bus can be evaluated through using the transmission time and resource consumption indexes based on dual-route units, and also that an aimed configuration exists such that the system performance can be optimized to the best when different interface configurations are considered.]]></description>
<pubDate>2017/3/7 11:55:44</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YAN Mengting<sup>1,2</sup>, AN Junshe<sup>1</sup> and GONG Quanming<sup>1,2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YAN Mengting<sup>1,2</sup>, AN Junshe<sup>1</sup> and GONG Quanming<sup>1,2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201701014]]></guid><cfi:id>58</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Active computing method in network edge for user intention]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The internet principle of “end-end” cannot distinguish host-network interface, so the intent of the user cannot be aware by the network, which decreases the efficiency of the transmission. The novel edge computing-based active network especially for user intent, i-ECAN, was proposed, and the concept of the user forwarding intent was designed, which was utilized to inform the network the intent directly by the end system and was executed on the basis of the resource of edge computing. The i-ECAN can embody the user′s intention in the forwarding decision of network nodes and be used in mobile communication, video broadcast, and data fusion in internet of things. In the wireless network based on CORE simulator, the switching time of normal wireless network and wireless network based on i-ECAN was compared, which proves the rationality and the feasibility of i-ECAN. The i-ECAN extends the interface between the end system and the network, which enforces the collaboration between machines and networks.]]></description>
<pubDate>2019/1/17 15:43:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LYU Gaofeng, SUN Zhigang and LI Tao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LYU Gaofeng, SUN Zhigang and LI Tao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806010]]></guid><cfi:id>57</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Dual threshold elephant flow detection algorithm combined flow size with transmission rate]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A novel algorithm which is based on both the flows′ size and transmission rate was proposed for elephant flow detection. In order to meet the performance requirement of high speed networks, the data structure of elephant flow detection was indexed by Hash table, which combines the Hash conflict resolution with the eviction of cached flow entry to identify the elephant flow efficiently. A theoretical analysis was conducted to demonstrate the accuracy, performance and memory overhead of the detection algorithm. Experimental results on real data sets show that the proposed algorithm outperforms least recently used detection algorithm, its derivations and compact space saving detection algorithm in terms of accuracy and performance with similar memory overhead.]]></description>
<pubDate>2019/1/17 15:43:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Chunqiang<sup>1</sup>, DONG Yongqiang<sup>1,2</sup> and WU Guoxin<sup>1,2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Chunqiang<sup>1</sup>, DONG Yongqiang<sup>1,2</sup> and WU Guoxin<sup>1,2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806011]]></guid><cfi:id>56</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Network latency equalization-oriented switch allocation strategy for networks-on-chip]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[According to the problem of switch allocation, a network latency equalization-oriented switch allocation strategy was proposed to improve system performance by designing a more fairness switch allocation strategy and improving the degree of network latency equalization. The evaluation of the design with SPEC CPU2006 benchmarks was performed in a full-system simulator. Compared with the canonical separable switch allocator and the TS-Router (recently proposed switch allocator), the experiments show that the approach decreases LSD (latency standard deviation) by 13.8% and 3.9% respectively, as well as ML (maximum latency) by 45.6% and 15.1% respectively. The approach improves system throughput by 0.8% over that of TS-Router. Finally, the design is implemented based on the separable switch allocator, and it can perform the evaluation in speed, area and power.]]></description>
<pubDate>2019/1/17 15:43:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Zicong, CHEN Xiaowen and GUO Yang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Zicong, CHEN Xiaowen and GUO Yang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806012]]></guid><cfi:id>55</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Towards a flow based resource scheduling algorithm in center control hybrid network]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In the hybrid center control networks, the flows of isomerization networks have its own regularity and characteristic. While ignoring the regularity of the flows in isomerization networks, the original single and stateless network resource scheduling algorithms which discretely maximize value can cause the problems such as the low utilization, easier to concuss, some delayed network traffic.   The topological architecture of the hybrid network which combines normal network with centered intelligent controllable network was analyzed, specially aimed to the common problems such as the flow burst，unpredictable flow，path jam/connection shocking scene. Then the resource scheduling algorithm named POS and POS-FME based on expectation and status were proposed. The algorithms consider the running status of hybrid network, evaluate the available resources of the system, and match available resources for various flows in the system, and have a certain prediction effect. The algorithms avoid the scenes of low running efficiency in the hybrid network, improve the utilization rate by about 10%~30% im comparison with the traditional algorithm, and also reduce the concussion and average delay through experiments.]]></description>
<pubDate>2019/1/17 15:43:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WAN Kao, JIANG Yong and XU Ke]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WAN Kao, JIANG Yong and XU Ke</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806013]]></guid><cfi:id>54</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Hardware Boolean satisfiability solver with enhanced constraint]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Taking advantage of parallelism and flexibility of field-programmable gate array, a novel Boolean satisfiability solver based on an improved local search algorithm on the reconfigurable hardware platform was proposed to solve largescale Boolean satisfiability problems. In comparison with the past solver, the preprocessing technology can strongly improve the efficiency of solver; the strategy of strengthening the variable selection can avoid the same variable flipped continuously and repeatedly. It can reduce the possibility of search falling into local optimum. The experimental results indicate that the solver can solve problems of up to 32k variables/128k clauses, and has better performance than previous works.]]></description>
<pubDate>2019/1/17 15:43:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MA Kefan, XIAO Liquan, ZHANG Jianmin, LI Tiejun and ZHOU Shanxiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MA Kefan, XIAO Liquan, ZHANG Jianmin, LI Tiejun and ZHOU Shanxiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806014]]></guid><cfi:id>53</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[S-Tag based DMA optimization for on-chip memory in M-DSP]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The S-Tag (Shadow Tag) mechanism of SRAM(static random access memory) data consistency maintaining for DMA(direct memory access) accessing was proposed for the independent design of MDSP(multi-core digital signal processor). The pipelining implementation can efficiently support DMA nonblocking data transfer, and release the CPU. Experimental results and tests in real chips show that the proposed mechanism outperforms the state-of-art ones with respect to bandwidth and bandwidth utilization while keeping relatively lower hardware cost.]]></description>
<pubDate>2019/1/17 15:43:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LU Jianzhuang<sup>1</sup>, SUN Shuwei<sup>1</sup>, CHEN Shenggang<sup>1</sup> and LU Wenyuan<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LU Jianzhuang<sup>1</sup>, SUN Shuwei<sup>1</sup>, CHEN Shenggang<sup>1</sup> and LU Wenyuan<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806015]]></guid><cfi:id>52</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multiobjective ant colony optimization for stable feature selection]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To improve the feature selection stability of evolutionary algorithms, a new method for stable feature selection based on multiobjective ant colony optimization was developed. Feature selection results of three feature ranking methods by resampling policy were combined to provide stable features′ information for multiobjective ant colony optimization; the feature′s Fisher discriminant value and maximal information coefficient value were integrated as heuristic information; the classification correctness rate and value of extensions of Kuncheva similarity measure were taken as two optimization objectives to balance algorithm′s classification performance and its stability. Some comparisons and experiments were carried out on four benchmark data sets, and results show that the proposed method has a better tradeoff between classification performance and feature selection stability.]]></description>
<pubDate>2019/1/17 15:43:45</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Yi<sup>1</sup>, CAO Jianjun<sup>2</sup>, DIAO Xingchun<sup>1</sup> and ZHANG Lei<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Yi<sup>1</sup>, CAO Jianjun<sup>2</sup>, DIAO Xingchun<sup>1</sup> and ZHANG Lei<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806016]]></guid><cfi:id>51</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Multi-level network steganography carrying decoy message]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806018]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to improve the security of covert information transmission in network steganography, a decoy method of multi-level steganography based on vertical multiprotocol collaboration was proposed. The proposed method consisted of 2 levels. The upper level  was used to carry the decoy message to deceive the detector. The lower level  used the vertical relationship of multiprotocol to encode steganogram. Experimental results show that the proposed method is more undetectable than others due to the usage of decoy message and multilevel steganography.]]></description>
<pubDate>2019/1/17 15:43:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[XUE Pengfei, HU Jingsong, HU Ronggui and WANG Yourui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>XUE Pengfei, HU Jingsong, HU Ronggui and WANG Yourui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806018]]></guid><cfi:id>50</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A progressive update extended Kalman filter for ship tracking with static electric field]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to track the ship with static electric field, aiming at the problem of traditional Kalman filters, a new nonlinear filter was designed. Ship state space model was established, and the problem of traditional Kalman filtering algorithm in ship tracking was analyzed; according to the relationship of noise covariance between the continuous white noise and discrete white noise sequence, a new progressive update extended Kalman filter was proposed on progressive Bayes theory. Simulation results show that the new method can effectively reduce the filtering performance degradation and filtering divergence caused by large initial error, thus can effectively be used to track the ship, and has high practical value.]]></description>
<pubDate>2019/1/17 15:43:46</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Baoquan, YAN Bing, JIANG Runxiang and ZHANG Jiawei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Baoquan, YAN Bing, JIANG Runxiang and ZHANG Jiawei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201806019]]></guid><cfi:id>49</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Force-deformation model validation system for flexible objects in haptic rendering]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201805010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to verify the rationality of flexible object deformable model, the force-deformation model validation system was established, which consists of wireless data transceiver platform based CC2531, force sensor measuring platform, and displacement measurement platform based FALCON hand controller. The relationship between interactive force and deformation in the elastic deformation experiment and impaling experiment with the experimental object of fresh pig liver was studied. Based on the data of force and deformation, the parameters were confirmed and amended. The simulation results show that the characteristic of force and deformation is consistent with actual measurement. The proposed system can be utilized for verifying general deformable models, which will lead to more applications in haptic based medical simulation.]]></description>
<pubDate>2018/11/15 16:12:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LU Xiong, SUN Haohao, WAN Wenzhang and CHEN Xiaoli]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LU Xiong, SUN Haohao, WAN Wenzhang and CHEN Xiaoli</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201805010]]></guid><cfi:id>48</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Reducing wrong labels in distant supervision for relation extraction]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201803023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Distant supervision has been widely used for relation extraction recently. In the distant supervision, many labels may to wrongly marked, which exerts a bad impact on relation extraction. A method to reduce wrong labels was introduced by using the semantic Jaccard to measure semantic similarity between the relation phrases and the dependency terms. The training data after reducing wrong labels was used to train the relation extractors. The experimental results show that the proposed method can effectively reduce wrong labels and improve the relation extraction performance compared with the state-of-art methods.]]></description>
<pubDate>2018/7/11 12:40:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[RU Chengsen, TANG Jintao, XIE Songxian, LI Shasha and WANG Ting]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>RU Chengsen, TANG Jintao, XIE Songxian, LI Shasha and WANG Ting</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201803023]]></guid><cfi:id>47</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Improved generic formula of time complexity on impossible differential attacks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201803024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The previous formulas of the time complexity of impossible differential cryptanalysis proposed by Boura et al. and Derbez were researched respectively. By studying the filtration of round subkeys during the attacking procedure carefully, an improved formula estimated the real time complexity of impossible differential cryptanalysis was proposed. On this basis, the impossible differential attacks were mounted on two models of block ciphers and the time complexities by three formulas were calculated. The results show that the time complexity computed by Boura′s formula can be higher or lower than the real time complexity, and the real time complexity is 2<sup>-1.2</sup> times as big as the time complexity calculated by Derbez′s formula if the round subkeys are independent of each other.]]></description>
<pubDate>2018/7/11 12:40:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Ya<sup>1,2,3</sup>, DIAO Qianqian<sup>1</sup>, LI Wei<sup>4</sup>, LIU Zhiqiang<sup>3</sup> and ZENG Zhiqiang<sup>5</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Ya<sup>1,2,3</sup>, DIAO Qianqian<sup>1</sup>, LI Wei<sup>4</sup>, LIU Zhiqiang<sup>3</sup> and ZENG Zhiqiang<sup>5</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201803024]]></guid><cfi:id>46</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[FPGA verification  for memory link interface of many-core processor]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201803027]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An FPGA(field-programmable gate array) verification platform for memory link interface of manycore processor was proposed to test the function and reliability of the main components of the processor′s memory access link. Three key technologies, the on-chip read-write requests automatic generation and result checking mechanism, the hardware UDP(user datagram protocol) protocol stack in Ethernet interface and the multi-lane parallel link between FPGA chips were proposed and implemented. Experiments on the platform show that the proposed technologies are correct, they not only enrich the ways of the random request generation and result checking for functional verification, but also can test and evaluate the logics of link errors detection and lanetolane deskew. The proposed platform has been used to verify a real many-core processor in which the function of memory link interface is correct, so the validity of the verification is proved.]]></description>
<pubDate>2018/7/11 12:40:22</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Hongwei<sup>1</sup>, XU Shi<sup>2</sup>, WANG Zhongyi<sup>1</sup>, YANG Qianming<sup>1</sup>, FENG Quanyou<sup>1</sup>, DENG Rangyu<sup>1</sup> and DOU Qiang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Hongwei<sup>1</sup>, XU Shi<sup>2</sup>, WANG Zhongyi<sup>1</sup>, YANG Qianming<sup>1</sup>, FENG Quanyou<sup>1</sup>, DENG Rangyu<sup>1</sup> and DOU Qiang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201803027]]></guid><cfi:id>45</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Energy-saving method in low earth orbit satellite networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201802010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Solar power is normally the only persistent power for satellites, so the energy supply problem of onboard devices is more difficult than that of the terrestrial networks. To fit the special architecture of satellite networks, the capacitated multi-commodity minimum cost flow model with constrained link capacity was modified and extended. Meanwhile, based on the multi-coverage scheme and traffic distribution patents in satellite networks, the existing heuristic algorithms were improved to turn off the unnecessary satellites, up-down links and inter-satellite links for energy saving. Under the constraints of link utilization and routing hops increasing ratio, the closing ratios of the three parameters are  up to 59%, 61% and 72% respectively, and the total energy saving ratio can be up to 65% in simulation.]]></description>
<pubDate>2018/5/11 16:33:57</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Bo, TANG Zhu and LIU Puguang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Bo, TANG Zhu and LIU Puguang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201802010]]></guid><cfi:id>44</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Timing-driven method for detailed placement]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201801010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To cope with the timing problem of placement in the very large integrated circuit,  a timing-driven optimization method for placement was proposed. Firstly, the design was analyzed by a timing evaluation tool and the timing violation paths were collected. A rough placement method was used on the moved cells between any two successive fixed cells in those paths to smooth the nets. After that, a detailed placement based on quadratic timing model was used to optimize the timing characteristics. For the given benchmarks and the evaluation method in ICCAD 2015 contest, the experimental results show that both the worst negative slack and the total negative slack are improved, and the overall timing performance is improved by 45~350 min.]]></description>
<pubDate>2018/3/23 11:05:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Chang<sup>1</sup>, GUO Zehui<sup>1</sup>, HE Xu<sup>1,2</sup> and GUO Yang<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Chang<sup>1</sup>, GUO Zehui<sup>1</sup>, HE Xu<sup>1,2</sup> and GUO Yang<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201801010]]></guid><cfi:id>43</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design of hybrid routing mechanism for SpaceWire networks]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201801012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aimed at the bottleneck of the non-uniform interface and protocol of spaceborne network caused by multiple bus standards, the time-triggered static routing and event-triggered dynamical routing based on the SpaceWire bus protocol were combined to make control data and payload data share the same network. The static routing mechanism was fully abided by the SpaceWire-D protocol to ensure deterministic data delivery, in which the heuristic scheduling algorithm was adopted to realize the multi-slot schedule for the first time, and the time-slot was designed by using the greatest common divisor to improve the throughput. And the dynamical routing mechanism can insure that the critical random event be processed by allocating priority levels to random event and payload data preferentially when the transmission routes conflict with each other. In addition, a simulation model for the network system was set up in OPNET to evaluate the proposed routing mechanism. Results show that the throughput of the network is improved significantly during static routing time as compared with the existing scheduling algorithm, and different transactions can be processed according to their priority during the dynamical routing time as expected.]]></description>
<pubDate>2018/3/23 11:05:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YAO Rui<sup>1</sup>, YANG Yuzhong<sup>1</sup> and WU Jun<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YAO Rui<sup>1</sup>, YANG Yuzhong<sup>1</sup> and WU Jun<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201801012]]></guid><cfi:id>42</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Cross-media retrieval based on locality-sensitive hashing and neural network algorithms]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201801014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To efficiently retrieve in multimodal data, it is essential to reduce the proportion of irrelevant documents. The image data were projected to the Hamming space by using the localitysensitive hashing algorithm, the text data were mapped on the hashing function of Hamming space by employing the neural network learning, and then a novel crossmedia retrieval approach was proposed to reduce the proportion of irrelevant documents. The experiment shows that the proportion of the relevant documents can be much improved in the proposed method. Assessments on the two public datasets also demonstrate the efficacy and the accuracy of the proposed retrieval method when compared to the baselines.]]></description>
<pubDate>2018/3/23 11:05:19</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[BAI Liang, JIA Yuhua, WANG Haoran, XIE Yuxiang and YU Tianyuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>BAI Liang, JIA Yuhua, WANG Haoran, XIE Yuxiang and YU Tianyuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201801014]]></guid><cfi:id>41</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[An active contour segmentation model combining global and local region-based information]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201801015]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aimed at the problem of the traditional region-based active contour model, which was difficult to segment the noisy images and intensity inhomogeneous images, an active contour model, including global term, local term and regularization term, was proposed. Global term was derived from the data fidelity items of ChanVese model. Meanwhile, the construction of local term took the local intensity information into account and the image local entropy that reflected the grey characteristics was introduced. According to the characteristics of different images, the reasonable parameters of global item and local item were selected. The regularization term was added to ensure the smoothness of curve evolution and to guarantee the reliability of segmentation. A variable level set was used to minimize the energy function to get the gradient descent flow. Experimental results of synthetic images and real images demonstrate that the proposed approach is efficient in segmenting the noisy images and inhomogeneity images.]]></description>
<pubDate>2018/3/23 11:05:20</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHAO Like<sup>1</sup>, ZHENG Shunyi<sup>1,2</sup>, WEI Haitao<sup>1</sup> and GUI Li<sup>1,2,3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHAO Like<sup>1</sup>, ZHENG Shunyi<sup>1,2</sup>, WEI Haitao<sup>1</sup> and GUI Li<sup>1,2,3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201801015]]></guid><cfi:id>40</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Passive safety analysis of close relative hovering for spacecraft]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The passive safety features for spacecraft in close relative hovering with respect to circular reference orbit were analyzed by solving the minimum relative distance during the free motion with zero initial velocity. The passive safety features of spacecraft relative hovering can be described as the state of empty intersection between the relative motion trajectory and the target′s no-fly zone after the disappearance of the control force. This problem can be by transformed into the problem of minimum relative distance with zero initial velocity. The minimum relative distance varies with the initial position, and may be located in the integer period minimum value or the non-integer period minimum value point. The existence conditions of two kinds of minimum value points were analyzed. Then the calculation method of critical passive safe hovering area was obtained by solving the boundary condition in two cases. For the typical relative hovering scenario, the critical safe hovering area under the constraint of plane circle and three-dimensional spherical no-fly zone was simulated and analyzed. The effects of model error and J<sub>2</sub> perturbation on hovering passive safety features were evaluated. This analysis method can provide consultation for hovering mission design with passive safety features.]]></description>
<pubDate>2019/12/9 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Bin, ZHANG Hongbo and ZHENG Wei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Bin, ZHANG Hongbo and ZHENG Wei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906001]]></guid><cfi:id>39</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Characterization of plasma synthetic jet actuator with cavity pressurization]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To increase its authority in rarefied air and improve its environmental suitability in near space flow control, the characteristics of plasma synthetic jet actuator with cavity pressurization were investigated. A simplified model was proposed to analyze the cavity pressurization performance. The calculation showed that the chamber pressure is effectively improved by the high pressure air supply. Besides, the chamber pressure shows good following characteristics, which provide a novel method to control plasma synthetic jet intensity. The experimental system of plasma synthetic jet actuator with cavity pressurization was built. The measured chamber pressure was in good agreement with the calculated result, with a maximum error of 2.6 %. The high-speed schlieren visualization showed that the jet front velocity is significantly improved with cavity pressurization. The peak velocity increases from 256 m/s to 507 m/s.]]></description>
<pubDate>2019/12/9 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHOU Yan, XIA Zhixun, LUO Zhenbing, PENG Wenqiang, DENG Xiong and WANG Lin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHOU Yan, XIA Zhixun, LUO Zhenbing, PENG Wenqiang, DENG Xiong and WANG Lin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906002]]></guid><cfi:id>38</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Functional sequence planning method based on improved co-evolutionary genetic algorithm for payload system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the low search efficiency of the traditional backtracking algorithm when planning the function sequence of the payload system based on the knowledge model, an improved algorithm named as WIM-CGA for CGA (co-evolutionary genetic algorithm) was proposed, which was based on the WIM (worst individual mutation) strategy. The algorithm adopted a dual-route evolution scheme in the genetic process, which was “the better individuals perform standard genetic processes, and the worse individuals perform mutation operation”, to improve the solution accuracy and search efficiency. Simulation results show that under the same test conditions, when the function scale is 50 and the constraint density is 1.0, the average accuracy of the optimal solution of WIM-CGA within the limited time is 54.15% higher than that of GAC-BS (BS based on generalized arc consistency) and 6.18% higher than CGA, and when optimal solution accuracy reaches 90%, the iteration times of WIM-CGA is 65.79% lower than that of CGA, and the time consumed is reduced by 48.97%. The efficiency of functional sequence planning is improved significantly.]]></description>
<pubDate>2019/12/9 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Jing, WANG Chunmei and YAO Xiujuan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Jing, WANG Chunmei and YAO Xiujuan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906003]]></guid><cfi:id>37</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Method of vision/inertial relative navigation for non-cooperative target and sensors self-calibration]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In using the combination system with visual and IMU (inertial measurement unit) to estimate the relative pose of non-cooperative target in space, the external parameters of the system have a great influence on the estimation accuracy. Considering the complex and time-consuming calibration of the external parameters, a method to estimate the relative pose and calibrate the external parameters simultaneously by using visual and IMU combination system was presented. This method takes the external parameters as the state variables and forms the system state equation together with the relative orbital kinematics equation, the relative attitude equation and the IMU model. Then, the relative pose, IMU biases and external parameters of the visual and IMU were estimated by using the extended Kalman filter designed with the state equation and the observation of the monocular vision. The validity of the method was verified by mathematical simulation. The simulation results show that this method can estimate the relative pose and IMU biases effectively and calibrate the external parameters, when the deviation of external parameters existed.]]></description>
<pubDate>2019/12/9 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Shijie, NING Mingfeng and CHEN Jian]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Shijie, NING Mingfeng and CHEN Jian</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906004]]></guid><cfi:id>36</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Uncertainty-based design optimization of terminal guidance initial parameters]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to quantify the influence of uncertainties in the terminal guidance initial parameters for unpowered gliding vehicle, an uncertainty-based design optimization method of terminal guidance initial parameters was developed to improve the accuracy of impact point. The sliding-mode variable structure control was used to predict trajectory of vehicle in real time to meet the requirements of high dynamic strike in the terminal stage of flight vehicle. In consideration of the uncertainties in the terminal guidance initial parameters, the optimization model of uncertainty-based terminal guidance initial parameters and guidance law parameters was built. The circular error probability and the probability of impact points in the effective damage radius were considered into the multiple-objective function. Effective global optimization and Monte Carlos method were used to obtain the optimum of initial parameters and guidance law parameters efficiently. It was shown that the accuracy of impact point is improved significantly, which can further provide decision support for the connection point of terminal guidance in the stage of vehicle conceptual design.]]></description>
<pubDate>2019/12/9 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Hairui, WANG Hao, WANG Yao, HONG Dongpao and BU Kuichen]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Hairui, WANG Hao, WANG Yao, HONG Dongpao and BU Kuichen</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906005]]></guid><cfi:id>35</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Method of trajectory design and optimization for fast reentry arrival]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906006]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A method of trajectory design and optimization for fast reentry arrival was proposed for the applications of large reentry velocity and strictly constrained flight time. The proposed method quickly decreased trajectory inclination and flattened trajectory on the initial reentry stage using large attack-angle, and the attack-angle and bank-angle variation rules on the later reentry stage and glide stage were jointly designed and optimized to significantly decrease terminal velocity and satisfy the constraints of terminal height, terminal heading and maximal dynamic pressure, maximal heat, etc. The proposed method can increase the ability of fast arrival for traditional lifting body vehicle and expand its application. Simulation results demonstrate that the terminal velocity is less than 7Ma and the lateral maneuver capacity is greater than 800 kilometers in the 12 minutes of flight time under the condition of typical vehicle parameter and large reentry velocity.]]></description>
<pubDate>2019/12/9 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHUANG Xuebin, ZHANG Yaolei, XIE Zebing and WANG Yulin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHUANG Xuebin, ZHANG Yaolei, XIE Zebing and WANG Yulin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906006]]></guid><cfi:id>34</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Influence of webbing subsystem of survival parachute on the dynamic load of the dummy]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To improve the safety of the webbing subsystem of the survival parachute, the dynamic model of parachute-webbing-dummy system was developed, and the load of the center of mass of dummy was analyzed for the varied parameters of webbing and detachment lock. For the airdrop test of dummy in the high speed, the fifteen degree of freedom dynamic model for the parachute, detachment lock and dummy was developed by using the multi-body dynamic method. The webbing was modeled by semi-mass-damping model to join the parachute, detachment lock and dummy. The parachute opening force was calculated by using the load of test. The dynamic process of dummy and the webbing for the typical condition was simulated by using the proposed model, and the reasonableness of the model was verified. The effect of the load of the dummy mass center was analyzed for the position of detachment lock, the length of webbing, and the property of the webbing material. The results of the analysis can be used for the design of the webbing and the determination of the position of the detachment lock.]]></description>
<pubDate>2019/12/9 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FENG Zhiwei, ZHANG Guobin, ZHANG Qingbin, WANG Lu and ZHOU Xisheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FENG Zhiwei, ZHANG Guobin, ZHANG Qingbin, WANG Lu and ZHOU Xisheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906007]]></guid><cfi:id>33</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Experimental and numerical simulation on failure of bolted flange connection structure between stages of rocket(missile) under impact load]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Based on the bolted flange connection structure between stages of rocket(missile), multiple experimental specimens were designed and manufactured, and four impact failure experiments of drop hammer were designed and carried out, which refers to the finite element model established by using the ABAQUS software. These experiments include axial and transverse two working conditions, and some structural characteristics of the specimen were different, such as the uniform and non-uniform distribution condition of the bolt group, the diameter of bolt and the gap between the bolt and bolt hole. In the process of experiments, the time history response data of bolts force, the time history response data of strain at key point of column section, impact force and impact velocity were collected. According to the experimental results and the measured data, the failure mechanism of the connection structure under impact load was analyzed, and it was verified that the numerical simulation results were in good agreement with the experimental results. The results in this research can be used as a reference for the load bearing capacity design of connection structure between stages of rocket(missile) under impact load.]]></description>
<pubDate>2019/12/9 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YUAN Jiehong, TIAN Tonghui, WANG Qingwen, LI Daokui and CHEN Baisheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YUAN Jiehong, TIAN Tonghui, WANG Qingwen, LI Daokui and CHEN Baisheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906008]]></guid><cfi:id>32</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Analysis of the influence and calibration of tri-axial magnetometer shaking on measurement]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The main errors of tri-axial magnetometer include scale deviation error, sensitivity error and tri-axial non-orthogonal error. The non-orthogonal error of the sensor was analyzed under tri-axial orthogonal coordinate system. The sensor error model was established, and the influence of error on the shaking of the sensor was analyzed. Shake 1° to produce the error up to 109.5 nT, the error increases with the increase of the shaking angle. To control the shaking error, the calibration model was established, and through the nonlinear curve fitting to estimate the model parameters of the calibration model accurately. After compensation, the sensor output error was greatly reduced, and the shaking error can be controlled below 0.03 nT, which shows that this method can effectively reduce the influence of shaking on sensor output.]]></description>
<pubDate>2019/12/9 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIN Pengfei, LIN Chunsheng, ZHANG Ning and JIA Wendou]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIN Pengfei, LIN Chunsheng, ZHANG Ning and JIA Wendou</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201906009]]></guid><cfi:id>31</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Correlation knowledge discovery method for  satellite telemetry data]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201905011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To discover correlations in massive telemetry data efficiently, a novel correlation knowledge discovery method based on the improved MIC (maximal information coefficient) was proposed. The Mini Batch K-Means clustering algorithm was used to discretize data in the precursor process; the mutual information between two variables under this partition was calculated and normalized by information entropy instead of maximal entropy to obtain the information coefficient; the MIC was selected as the measure of variable correlation. Aflerwards, the method was applied to the correlation analysis of the quantum satellite telemetry data, and the results show that the proposed method can effectively solve the problem of MIC measure bias to multivalued variables compared with the method based on dynamic programming algorithm, the time complexity dropped from O(n<sup>2.4</sup>)to O(n<sup>1.6</sup>), and it is an effective method for large-scale telemetry data correlation analysis.]]></description>
<pubDate>2019/9/30 15:58:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Jiasen<sup>1,2</sup>, MENG Xin<sup>1</sup> and WANG Chunmei<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Jiasen<sup>1,2</sup>, MENG Xin<sup>1</sup> and WANG Chunmei<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201905011]]></guid><cfi:id>30</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Virtual proof shooting  for naval gun considering reliability of simulation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201905012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To estimate the compensation value reasonably with simulation model under the situation of limited data of proof shooting, the virtual proof shooting method for naval gun considering the reliability of simulation was studied. The adapted weighted Bayesian estimation considering the reliability of simulation was studied. On the one hand, the method for calculating reliability of simulation was analyzed; on the other hand, the adapted weighted Bayesian estimation algorithm considering reliability of simulation was studied. On the basis, considering the principle and requirement of virtual proof shooting, the model for estimating error of firing parameters based on the adapted weighted Bayesian estimation considering reliability of simulation was built. The results from simulation shows that: the adapted weighted Bayesian estimation considering reliability of simulation can verify the reliability of the simulation model efficiently with the test data, thus estimating the target distribution efficiently; the proof shooting method can use the advantages of simulation model and shooting specimen, and realize the reasonably estimation for error of firing parameters, and then, achieve the goal of effectively improving the accuracy of proof shooting.]]></description>
<pubDate>2019/9/30 15:58:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHENG Han<sup>1</sup>, CHEN Weiyi<sup>1</sup>, LIU Guoqiang<sup>1</sup> and QIAN Fu<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHENG Han<sup>1</sup>, CHEN Weiyi<sup>1</sup>, LIU Guoqiang<sup>1</sup> and QIAN Fu<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201905012]]></guid><cfi:id>29</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Ship target tracking based on shaft-rate electric field]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201905024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aimed at the problem of lack of prior information in the shaft-rate electric field envelope tracking, the basic requirement of ship shaft-rate electric field tracking on the sensor array was studied and a multi initial progressive update extended Kalman filter algorithm based on maximum likelihood selection was introduced. The state space model of ship shaft-rate electric field envelope tracking was established, and the horizontal electric dipole was used to model the ship′s shaft-rate electric field envelope; a multiple initial value model based on maximum likelihood selection was established. Next based on the signal characteristics of the envelope of shaftrate electric field, the requirement of sensor array arrangement was studied. Simulation results show that it is feasible to track ship by the envelope of shaftrate electric field. And it is required that the sensor array must be made up of at least three sensors, which are not in a straight line. Under the condition that the sensor array meets the requirements, the proposed algorithm can effectively solve the lack of prior information in the shaft-rate electric field envelope tracking, and it has a high practical value.]]></description>
<pubDate>2019/9/30 15:58:01</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Baoquan, YAN Bing, ZHANG Jiawei and JIANG Runxiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Baoquan, YAN Bing, ZHANG Jiawei and JIANG Runxiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201905024]]></guid><cfi:id>28</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Application of variational autoencoder combined with clustering algorithm in air combat situation assessment]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201904021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aimed at the problems of traditional assessment methods, such as the subjectivity of determining the weights, the weak ability of processing big data and the lack of feature extraction ability, an improved air combat situation assessment method based on VAE (variational autoencoder) and clustering algorithm was proposed. Firstly, according to the characteristic of continuity of situation changes, a situation classification method based on time period data was proposed, and the situation of both sides was divided into four categories. Then, on the basis of VAE, a VAE-WRBM-MDN feature extraction model was proposed, which used the MDN (mixed density network) to optimize VAE feature extraction capability as well as the similarity of generated data, and to optimize initial weights of the network with WRBM (weighted uncertainty restricted Boltzmann machines). Finally, the extracted features were input into two typical clustering algorithms for clustering, and then the situational function and actual battlefield conditions were used to modify the clustering results, so as to forming a correct situation classification criteria. In the process of experiments,  the optimal parameters adjustment, key feature extraction, clustering and correction were performed. Experimental results show that the model classification accuracy rate and the model runtime both meet the application requirements. In addition, the assessment results of the example are consistent with the actual situation. Therefore, the proposed method is of practical value.]]></description>
<pubDate>2019/7/18 15:28:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Rennong<sup>1</sup>, FANG Yuhuan<sup>2</sup>, ZHANG Zhenxing<sup>1</sup>, ZUO Jialiang<sup>1</sup>, HUANG Zhenyu<sup>1</sup> and ZHANG Ying<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Rennong<sup>1</sup>, FANG Yuhuan<sup>2</sup>, ZHANG Zhenxing<sup>1</sup>, ZUO Jialiang<sup>1</sup>, HUANG Zhenyu<sup>1</sup> and ZHANG Ying<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201904021]]></guid><cfi:id>27</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Packet segment offloading and sending mechanism based on multi-core packet processing system]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201903007]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The packet segment offloading and sending mechanism was proposed and the prototype system was implemented. This mechanism, based on the multi-core packet processing system with lightweight input/output, was aimed to reduce the cost of large packet segmentation, copy overhead, hardware and software complexity. It offloaded the complex parts of hardware implementation to the drive including packet segmentation, packet head encapsulation. It reduced the whole data copy cost to the copy cost of the new packets header, combined the chain direct memory access technology to provide an effective solution of packet forwarding on the multicore system. The packet sending performance based on domestic general multi-core and field-programmable gate array platform was tested. The experimental data shows that the packet segment offloading and sending mechanism can significantly enhance the performance, and effectively solve the problem of the large packet sending on the multicore network processing system.]]></description>
<pubDate>2019/6/13 15:22:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Hui<sup>1</sup>, LI Tao<sup>1</sup>, LYU Gaofeng<sup>1</sup>, QUAN Wei<sup>1</sup> and DAI Huanyao<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Hui<sup>1</sup>, LI Tao<sup>1</sup>, LYU Gaofeng<sup>1</sup>, QUAN Wei<sup>1</sup> and DAI Huanyao<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201903007]]></guid><cfi:id>26</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Correctness verification of clock synchronization protocol via extended labeled transition system models]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201903008]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Clock synchronization protocol, as an important component of the time-triggered networks, is the key to the instantaneity and certainty of the time-triggered networks. The modeling and verification of clock synchronization protocol were studied. The protocol′s behaviors were modeled by the extended labeled transition systems, and its correctness was verified by model checking technique. The verification results certified the correctness of this protocol even under different startup scenarios. Experimental results also show the effectiveness of extended labeled transition systems in protocol verification.]]></description>
<pubDate>2019/6/13 15:22:18</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[QU Guoyuan<sup>1</sup>, XU Xiaofei<sup>1</sup>, LIU Weiting<sup>2,3,4</sup>, WANG Qinyu<sup>2,3,4</sup> and HE Fei<sup>2,3,4</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>QU Guoyuan<sup>1</sup>, XU Xiaofei<sup>1</sup>, LIU Weiting<sup>2,3,4</sup>, WANG Qinyu<sup>2,3,4</sup> and HE Fei<sup>2,3,4</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201903008]]></guid><cfi:id>25</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Method of capturing task allocation based on energy balance]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201902016]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[With the deepening of the research on anti-encirclement strategy of underwater vehicles, the encirclement of underwater vehicles has been more and more difficult. For this reason, a multi-layer annular ambush capture model was constructed and a task assignment method based on the capture task was designed, so that the underwater vehicle can make full use of its own characteristics to complete the task better. At the same time, considering that the energy consumption in the system is uneven with the passage of time in the capture process, an energy balance method was proposed to balance the energy consumption of the system. Experiments show that the proposed task allocation method based on the energy balance strategy of multi-layer annular capture model can effectively improve the success rate of capture and prolong the life of the system.]]></description>
<pubDate>2019/4/24 14:24:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHANG Ziying, LYU Jun, XU Dong, MENG Yulong, FENG Guangsheng and ZHANG Mengmeng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHANG Ziying, LYU Jun, XU Dong, MENG Yulong, FENG Guangsheng and ZHANG Mengmeng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201902016]]></guid><cfi:id>24</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Remote sensing data user request merging technology]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201902017]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Remote sensing data, as national fundamental and strategic resources, plays an important role in economy, state security, environment protection and ecology. Since remote sensing data have been widely used in various industries, there is a large amount of data requests from different users, demanding a lot of valuable EOS (earth observation resources). On one hand, users′ data requests increase constantly. On the other hand, EOS resources are always limited. Our objective is to ease the contradiction between a large amount of users′ requests and limited EOS resources. The key idea is to merge identical or similar users′ requests in order to reduce the total number of requests, and then to use requirement forecasting and requirement mining technology to improve requirement fusion efficiency. It is high likely that different users may share identical or similar data requests, since users may show concerns about the same area of the earth over the same time range.]]></description>
<pubDate>2019/4/24 14:24:49</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[ZHENG Zhonggang<sup>1</sup>, FU Kun<sup>2</sup>, XU Chongyan<sup>1</sup>, WU Zhenyu<sup>1</sup> and ZHOU Changfei<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>ZHENG Zhonggang<sup>1</sup>, FU Kun<sup>2</sup>, XU Chongyan<sup>1</sup>, WU Zhenyu<sup>1</sup> and ZHOU Changfei<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201902017]]></guid><cfi:id>23</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Foreground estimation in video surveillance by blind source extraction]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901019]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In video surveillance, one scene image/frame can be modeled as a superimposition or linear mixture of foreground visual contents and background contents. In the real world, however, the background and foreground are correlated to each other. Therefore, the foreground extraction cannot be well solved by the PCA (principle component analysis) and the ICA (independent component analysis) algorithms. The foreground extraction was modeled as a BSE (blind source extraction) problem. The MSCPE (mean square cross prediction error), one solution of BSE, was generalized to extract desired source signal which was correlated with other source signals. Then MSCPE BSE method was applied to the background subtraction schemes by using the basic model and eigen backgrounds method. Experimental results on artificial video shows the feasibility of MSCPE, and the realworld video experiments demonstrate its effectiveness.]]></description>
<pubDate>2019/3/15 11:33:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Qun<sup>1</sup>, XUE Rui<sup>1</sup> and SUN Zhenjiang<sup>2</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Qun<sup>1</sup>, XUE Rui<sup>1</sup> and SUN Zhenjiang<sup>2</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901019]]></guid><cfi:id>22</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Network control technology for large-scale container clusters]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aimed at solving the lack of control of container technology at the network level, a network control architecture for large-scale container clusters was designed. The architecture was researched respectively from three aspects (flexible networking, intelligent adaptation and security isolation) in container cluster network, mainly to solve the key issues of large-scale container clusters deployment in the network adapter and isolation control, etc.. The experimental results show that the designed network control architecture can achieve intelligent network adaptation, network node migration, and accurate isolation control of node-to-node communication in virtual local area network.]]></description>
<pubDate>2019/3/15 11:33:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Baosheng, ZHANG Weiqi and DENG Wenping]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Baosheng, ZHANG Weiqi and DENG Wenping</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901020]]></guid><cfi:id>21</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Cache location selected algorithm for information-centric networking]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The cache ubiquity feature in ICN (information-centric networking) causes many problems such as higher data duplication rate, underutilization of cache space, etc. To solve such problems, the benefits of multiple network roles were considered. From the views of user-service provider and network operator, two single-objective optimization models were established respectively, aiming at minimizing the network traffic and the network expense, which  were merged into the Pareto model. The proposed cache location selected algorithm was described based on the mathematical programming method of Pareto. Simulation results show that the proposed algorithm outperforms the default cache mechanism of ICN in terms of traffic cost-effective. In terms of network expense, the proposed algorithm is more applicable to ICN when there are a few popular contents. However, when all contents are popular, the default mechanism of “cache everywhere” in ICN is more applicable.]]></description>
<pubDate>2019/3/15 11:33:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Xingwei<sup>1</sup>, WANG Zijian<sup>1</sup>, LI Fuliang<sup>2</sup> and HUANG Min<sup>3</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Xingwei<sup>1</sup>, WANG Zijian<sup>1</sup>, LI Fuliang<sup>2</sup> and HUANG Min<sup>3</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901021]]></guid><cfi:id>20</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design of wireless sensor network based on 6LoWPAN and MQTT]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For the problem that  6LoWPAN(IPv6 low power wireless personal area network) wireless sensor network has poor scalability in design and application and is incompatible with IPv4 environment, a wireless sensor network based on 6LoWPAN and MQTT(message queuing telemetry transport) was designed and implemented. Among them, the wireless sensor network node works as MQTT client to communicate with MQTT server, and the border router implements communication between wireless sensor network node and IPv4 network through NAT64(network address translation IPv6 to IPv4). Finally, the designed wireless sensor network was applied to the smart home scenario, the performance of wireless sensor network and border router was evaluated, and the implementation of the system function was tested. Results show that the wireless sensor network has good connectivity and stability, the data uploading and command receiving of the wireless sensor node is stable and reliable, the border router works stably, and the system has good performance.]]></description>
<pubDate>2019/3/15 11:33:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[YANG Wang, FAN Zhenyu and WU Fan]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>YANG Wang, FAN Zhenyu and WU Fan</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901022]]></guid><cfi:id>19</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Routing algorithm for high-speed data transmission of nearly polar micro-satellite constellation]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[According to the operational characteristics of the high-speed network model of nearly polar constellation of micro-satellite, the definition of the high-speed network of constellation was given. The routing protocol adapted to the transmission model was analyzed, its deficiency under the model was illustrated and the calculation method of protocol overhead was deduced. Then the optimized protocol was provided. The high-speed network model of microsatellite constellation was established by using the NS3 network simulation platform, and the key performance indexes of the routing protocol were simulated before and after adopting the optimization strategy. The results show that the optimized routing algorithm reduces the overhead significantly, meanwhile it improves the throughput and packet arrival rate in the high-speed network. The performance of the high-speed network of nano-satellite constellation is optimized.]]></description>
<pubDate>2019/3/15 11:33:34</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHI Yilong<sup>1,2</sup>, JIANG Xiujie<sup>1</sup>, XIONG Weiming<sup>1</sup> and XUE Changbin<sup>1</sup>]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHI Yilong<sup>1,2</sup>, JIANG Xiujie<sup>1</sup>, XIONG Weiming<sup>1</sup> and XUE Changbin<sup>1</sup></atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901023]]></guid><cfi:id>18</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Overlapping community detection algorithm by label propagation using PageRank and node clustering coefficients]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901025]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Considering the fact that the community detection algorithm based on label propagation can detect overlapping community structures of complex networks, an overlapping community detection algorithm COPRAPC (community overlap propagation algorithm based on PageRank and clustering coefficient) was proposed. The algorithm used PageRank algorithm to rank the influence of nodes, which can stabilize the community finding results. The parameter of node clustering coefficient was a noderelated parameter, which can be used to modify the parameters of the algorithm and limit the maximum number of labels each node, so as to improve the quality of community mining. Experiments on artificial networks and real-world networks show that the algorithm can effectively detect overlapping communities, and the algorithm has acceptable time efficiency and algorithm complexity.]]></description>
<pubDate>2019/3/15 11:33:35</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[MA Jian, LIU Feng, LI Honghui and FAN Jianping]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>MA Jian, LIU Feng, LI Honghui and FAN Jianping</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/201901025]]></guid><cfi:id>17</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[GSVM:a vector memory to support Gather/Scatter]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003001]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[The very wide SIMD (single instruction multiple data) digital signal processor often supports vector memory access mode of regular applications with contiguous or equal address strides, but its access bandwidth utilization is usually very low for the irregular application accesses that exist widely in scientific and engineering computations. It reduces the overall computing performance of digital signal processor. In order to improve the vector access performance for the irregular applications, the vector memory called GSVM to support the Gather/Scatter access was designed on the basis of the architecture of a SIMD digital signal processor. The vector address generation unit and the conflict buffer array matching the SIMD width were designed to realize the full pipeline operations of Gather/Scatter instruction. The experimental results show that compared with the vector memory without Gather/Scatter, the GSVM obtains 2~8 times speedup for sparse-matrix vector multiplication test programs with the 22% hardware overhead.]]></description>
<pubDate>2020/7/6 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHEN Haiyan, LIU Sheng, WU Jianguo]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHEN Haiyan, LIU Sheng, WU Jianguo</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003001]]></guid><cfi:id>16</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[A novel remote zero-copy file system based on non-volatile memory]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003002]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In order to enhance data access efficiency between front-end nodes of Internet of things and edge computing applications, a novel RZCFS(remote zero-copy file system) was proposed. The zero-copy data transmission framework based on generic network interface card was realized without special hardware. The random-access character of non-volatile memory was fully utilized by RZCFS to reduce data caches and copies, which yields a significant throughput improvement for data access. A buffer pool was implemented, the traditional network stack and storage stack were simplified and converged to shorten the file access path, which can eliminate software overhead and reduce data access latency. As a result, RZCFS provides the low-latency and high-bandwidth remote data access. Simulation results show that it achieves 42.26%~99.19% latency reductions for traditional NFS (network file system). The throughput of fine-grained access can reach 1297 times faster than those of NFS. The RZCFS significantly reduces the processor cycles and cache misses.]]></description>
<pubDate>2020/7/6 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HAN Wenbing, CHEN Xiaogang, LI Shunfen, LI Dagang, CHEN Shiyan, DUAN Youkang, SONG Zhitang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HAN Wenbing, CHEN Xiaogang, LI Shunfen, LI Dagang, CHEN Shiyan, DUAN Youkang, SONG Zhitang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003002]]></guid><cfi:id>15</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Design of radiation-tolerant controller chip in 130 nm hardened SOI process]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003003]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aimed at the anti-radiation requirements of the aerospace electronic system control module for integrated circuits, a controller chip based on the proportion, integral and differential algorithms was designed on a 130 nm partially depleted SOI (silicon-on-insulator) process platform. The TID (total ionizing dose) radiation reinforcement was investigated in terms of SOI wafer, fabrication process and layout design, respectively. The test results of the chip show that the adjustment accuracy of the chip reaches 5×10-12, which is equivalent to the imported radiation-tolerant FPGA (field programmable gate array); the chip is superior to the foreign anti-radiation FPGA in terms of long-term frequency stability. TID experiments were carried out and the results show that the chip can function normally under the total dose of 300 krad (Si).]]></description>
<pubDate>2020/7/6 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[CHANG Yongwei, YU Chao, LIU Haijing, WANG Zheng, DONG Yemin]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>CHANG Yongwei, YU Chao, LIU Haijing, WANG Zheng, DONG Yemin</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003003]]></guid><cfi:id>14</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Automatic fragmented layout for multi-module ROP]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003004]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[ROP (return-oriented programming) is a technique which is able to bypass the protection of the DEP (data execution prevention). The ROP can constitute a program that performs a specific function by searching for an appropriate assembly instruction fragment in the memory code area. Previous methods for automatic generation of ROP do not consider the limitation of the layout of ROP caused by the program memory requirement, which leads to poor practicability of ROP. In order to solve this problem, a new method for automatic fragmented layout of multi-module ROP based on symbolic execution was proposed. The ROP chain was divided into different modules on the basis of automatic ROP generation framework Q; the controllability of memory was dynamically analyzed by using symbolic execution tool S2E; the controllable memory areas for each ROP module was found, and the fragmented layout ROP was automatically constructed. Experiments show that, compared with the previous methods, the ROP chain generated by the proposed method can effectively reduce the requirements for the program memory controllability.]]></description>
<pubDate>2020/7/6 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HUANG Ning, HUANG Shuguang, PAN Zulie, CHANG Chao]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HUANG Ning, HUANG Shuguang, PAN Zulie, CHANG Chao</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003004]]></guid><cfi:id>13</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Light robust optimization approach for vehicle routing problem under uncertainty]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003005]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming to reduce conservatism of the optimal solution with regard to robust optimization model, a light robust optimization approach was proposed to solve the open vehicle routing problem with travel time uncertainty. This approach yields routes that minimize the weighted sum of the number of defaulted vehicles and the total penalty cost. For each realizations of the uncertain data set, the optimal solution of the approach can ensure that its optimal value never exceeds a certain value, thus improving the conservatism of the optimal solution. To improve the probability of finding the optimal solution, the automatic design of genetic algorithms was proposed to solve the model. Its main idea is to use the particle swarm optimization algorithm to search components of genetic algorithm which can expectedly enable the genetic algorithm to generate the optimal solution and then to combine these components to generate a new genetic algorithm to solve the model. The new genetic algorithm was used to solve the model continuously and give rise to a new optimal solution. Calculation results show that the conservatism of the optimal solution solved by the proposed light robust optimization approach is significantly reduced comparing with the past robust optimization method.]]></description>
<pubDate>2020/7/6 10:23:20</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SUN Liang, WANG Bing, GUO Dong, XU Yi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SUN Liang, WANG Bing, GUO Dong, XU Yi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202003005]]></guid><cfi:id>12</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[3D path planning method for underwater vehicles based on real terrain]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406009]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the problem of poor applicability of current path planning results for underwater vehicles, a three-dimensional path planning algorithm for underwater vehicles based on improved particle swarm optimization algorithm was proposed. A Voronoi map based on the real terrain data of sea area was built, and the Dijkstra algorithm was used to generate the initial path set that meets the requirements of navigation safety as the initial particles of particle swarm optimization algorithm, so the generation efficiency of initial particles was improved. At the same time, the particles′ position update method was improved to guide the particle position change according to the position of adjacent nodes on the route, which makes the planned route smoother and more suitable for the navigation of underwater vehicles. Simulation results show that the proposed algorithm is more robust and has better applicability than the traditional particle swarm optimization algorithm in path planning.]]></description>
<pubDate>2024/12/2 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GENG Zhenglin, CHENG Xinghua, BAO Changchun]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GENG Zhenglin, CHENG Xinghua, BAO Changchun</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406009]]></guid><cfi:id>11</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Fast software implementation of the block cipher uBlock algorithm]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406010]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[To optimize the software implementation of the domestic block cipher uBlock algorithm, the AVX2 instruction set supporting 256 bit data width was implemented, the automatic optimization level of the compiler was increased, optimizing the calling process of functions, and the methods of data storage structure optimization, high-level parallelism and low latency instruction logic optimization were used in order to implement parallel computing under the single-thread condition. Using this efficient combination method, the speed of single key short message encryption of uBlock-128/128 algorithm, uBlock-128/256 algorithm and uBlock-256/256 algorithm are 269%, 182% and 49% higher than the original code. Based on these optimization methods,the implementation of single-key scenario and multi-key scenario are given for three algorithm versions of uBlock-128/128, uBlock-128/256 and uBlock-256/256.]]></description>
<pubDate>2024/12/2 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GAO Ying, WANG Longxin, TIAN Lei, HU Yang, ZHANG Yupeng, YAN Yu, WU Qianhong]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GAO Ying, WANG Longxin, TIAN Lei, HU Yang, ZHANG Yupeng, YAN Yu, WU Qianhong</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406010]]></guid><cfi:id>10</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Particle swarm optimization based data imputation method for mixed features]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406011]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the deficiency of traditional data imputation methods in effectively using the label information and random characteristics of missing data, a particle swarm optimization based imputation method for mixed features was proposed. The value of continuous feature was modeled as Gaussian distribution, and the mean and standard deviation were used as optimization parameters. The value probability of categorical features was optimized as a parameter. The classification accuracy rate was used as the optimization target to make full use of random information of label information and missing data. Four statistical methods and two evolutionary algorithm based imputation methods were used to compare the results on six typical classification datasets. The results show that the proposed method significantly outperforms other comparison algorithms in terms of classification accuracy indicator, and has better time overhead at the same time, which can effectively solve the data missing problems of mixed features.]]></description>
<pubDate>2024/12/2 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Yi, QIN Wei, LI Gengsong, LIU Kun, WANG Qiang, ZHENG Qibin, REN Xiaoguang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Yi, QIN Wei, LI Gengsong, LIU Kun, WANG Qiang, ZHENG Qibin, REN Xiaoguang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406011]]></guid><cfi:id>9</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Comparison and evaluation of BeiDou PPP-B2b and CNES real-time products′ performance]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406012]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For analyzing PPP-B2b actual service performance, PPP-B2b data and International GNSS(global navigation satellite system)service data for a period of 30 days as well as offshore shipborne dynamic data on 16 December 2021 were used for evaluating orbit and clock offset accuracy and testing real-time PPP(precise point positioning)positioning performance. And compared with the corresponding results of CNT—archived products of CNES(centre national d′etudes spatiales,CNES). Results show that the radial accuracy of BDS-3 (BeiDou navigation satellite system phase Ⅲ) and GPS (global positioning system) track of PPP-B2b service are 0.07 m and 0.089 m respectively, which are below CNT 0.041 m and 0.025 m. The clock offset accuracy of BDS-3 is 0.029 m, close to GPS clock offset, better than 0.057m of CNES product accuracy. In the static positioning test based on PPP-B2b, BDS and BDS-3+GPS average convergence time is less than 20 minutes, better than that of GPS, and the convergence accuracy is higher than GPS. In the dynamic test, the RMS value of BDS-3 and BDS-3+GPS in the NEU(north, east and up)directions are better than 11 cm, GPS is better than 26 cm. In offshore positioning testing, the RMS value of BDS-3+GPS of PPP-B2b in the NEU directions are 0.028 m, 0.074 m, 0.081 m, and the convergence time is 12.4 min.]]></description>
<pubDate>2024/12/2 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[JI Shengyue, ZHENG Qianli, WANG Zhenjie, HE Kaifei]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>JI Shengyue, ZHENG Qianli, WANG Zhenjie, HE Kaifei</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406012]]></guid><cfi:id>8</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Application of improved YOLOv5s algorithm in traffic sign detection and recognition]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406013]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[Aiming at the problem of low detection and recognition accuracy of traffic signs in complex traffic scenes, a target detection and recognition method based on improved YOLOv5s algorithm was proposed. Iterative self-organizing data analysis techniques algorithm was used for clustering analysis of TT100K data set to select the prior frame which was more suitable for the size of traffic signs. The new prior frame could cover the size of traffic signs more comprehensively and improve the detection accuracy of the model. The feature map was upsampled to obtain a larger scale feature map, and then contacted with the feature map of the backbone network to obtain a new feature map with more abundant feature information. The new feature map was used for small target detection and recognition, which improved the accuracy of small target detection and recognition. And the difference of the width ratio and height ratio between the real frame and the prior frame was used to replace the difference of the aspect ratio between the real frame and the prior frame to improve the positioning loss function, which solved the problem of penalty disappearing when the width ratio was the same but the actual size was different. Experimental results show that compared with the original YOLOv5s algorithm, the improved algorithm can improve the mean average precision by 9.55%, and has better performance in detecting and recognizing small targets.]]></description>
<pubDate>2024/12/2 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[GUO Junbin, YU Lin, YU Chuanqiang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>GUO Junbin, YU Lin, YU Chuanqiang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406013]]></guid><cfi:id>7</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Simulation method of high-power microwave effect for UAV′s SAR]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406014]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[In terms of the problem that SAR(synthetic aperture radar) in UAV(unmanned aerial vehicle) is easy to be attacked by HPM(high-power microwave) weapons in the complex electromagnetic environment of the battlefield, the field-circuit joint simulation of high-power microwave front-gate coupling of UAV′s SAR was carried out. Model of the SAR′s antenna was established in the CST(computer simulation technology) software. Model of antenna was irradiated with a pulse-modulated sinusoidal signal to simulate the HPM signal, and the antenna port coupling voltage waveform was collected. Antenna port coupling voltage signal obtained in the CST software was injected into the RF(radio frequency) front-end circuit model of SAR, which fully simulated the coupling process of high-power microwave signal from field to circuit. Simulation results show that the low noise amplifier in the RF front-end circuit of SAR is the main target of HPM signal damage, and the spike leakage power of the limiter will threaten the low-noise amplifier of the post-stage circuit. Through simulation, the evaluation diagram of the coupling effect of high-power microwave front door of UAV on-board SAR is obtained.]]></description>
<pubDate>2024/12/2 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[SHEN Yan, 王玉明, 陈亚洲]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>SHEN Yan, 王玉明, 陈亚洲</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202406014]]></guid><cfi:id>6</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Precise analysis and measurement method for delay composition of time-sensitive networking]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405020]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[When estimating the maximum transmission delay Δ<i>t</i> between adjacent nodes according to TSN (time-sensitive networking) standards, it was inevitable to introduce additional ineffective waiting time, which was referred to as “bubble delay”. The negative effect of bubble delay on increasing the end-to-end delay and decreasing the planning success rate was analyzed, and the precise measurement method of Δ<i>t</i> was proposed for the first time based on analyzing the delay composition of Δ<i>t</i> in fine granularity. Based on the exact Δ<i>t</i>, the bubble delay caused by TSN planning was eliminated. A real test environment was built based on two customized TSN switching devices. The test results show that the bubble delay accounted for 26.4% of the end-to-end delay at least, and the planning success rate increased by 8.9% to 39.1% after eliminating the bubble delay.]]></description>
<pubDate>2024/9/29 15:02:41</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[FU Wenwen, QUAN Wei, JIANG Xuyan, SUN Yinhan, SUN Zhigang]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>FU Wenwen, QUAN Wei, JIANG Xuyan, SUN Yinhan, SUN Zhigang</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405020]]></guid><cfi:id>5</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Network slice programmable data plane model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405021]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[RMT (reconfigurable match table) is a programmable pipeline architecture for packet processing. In order to enable the programmable data plane to support more different network protocols, the deparser based on RMT was extended. A protocol-independent network slicing programmable data plane model was formed by using the extended deparser and two RMT pipelines. Since reduced instruction set was used in RMT architecture and complex instruction set was used in the extended deparser, the extended architecture was called HiRMT(hybrid-instruction RMT). HiRMT can support segment routing IPv6, multiple semantics for SID(segment ID), micro SID, multi-protocol label switching and virtual extensible local area network. This architecture has broad application prospects. The performance of the deparser module was tested on the Corundum prototype platform, and the results show that the extended deparser can process the packet size up to 512 B with a throughput of 100 Gbit/s with fewer resources.]]></description>
<pubDate>2024/9/29 15:02:41</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LIU Zhongpei, LYU Gaofeng, WANG Jichang, YANG Xiangrui]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LIU Zhongpei, LYU Gaofeng, WANG Jichang, YANG Xiangrui</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405021]]></guid><cfi:id>4</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[High efficient training method of MiniGo on large-scale heterogeneous computing platform]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405022]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[An efficient multi-level parallel training method suitable for training MiniGo agents on large-scale heterogeneous computing platforms was proposed, including task level parallelism between nodes, CPU-DSP(central processing unit-digital signal process) heterogeneous parallelism and DSP core parallelism. Efficient input/output deployment and eliminated the bottleneck of network communication were realized. A heterogeneous computing memory management oriented to CPU-DSP shared memory structure was proposed to reduce the data handling between heterogeneous devices. Shared memory programming optimization was realized, and the dense convolution calculation operator acceleration optimization was realized by DSP. Results show that compared with 16 core CPU calculation, the maximum acceleration ratio of single core DSP operator acceleration is 16.44. In this method, the scale of computing nodes is expanded from 1 067 to 4 139, the time required to reach the given termination condition is reduced from 43.02 h to 16.05 h, and the expansion efficiency is 69.1%. Evaluation shows that this method can realize the efficient parallel training of MiniGo on large-scale heterogeneous computing platforms.]]></description>
<pubDate>2024/9/29 15:02:41</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[LI Rongchun, HE Zhouyu, QIAO Peng, JIANG Jingfei, DOU Yong, LI Dongsheng]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>LI Rongchun, HE Zhouyu, QIAO Peng, JIANG Jingfei, DOU Yong, LI Dongsheng</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405022]]></guid><cfi:id>3</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Parallel rendering algorithm for large-scale particles by wrapping surface reconstruction]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405023]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[A parallel rendering algorithm based on wrapping surface reconstruction was proposed for large-scale particles in distributed environments so as to visualize the particles in high quality. In the algorithm, particle clusters were represented and then rendered in the form of a series of continuous surfaces, where the distribution of the physical variable was also shown. The algorithm was parallelized in distributed environments, thus more than a hundred million particles can be visualized using a lot of processing cores. In terms of algorithm implementation, the issue of inter-block cracks during parallel computation was be solved, and the method for rapidly finding adjacent particles was presented. Meanwhile, based on visibility culling, the particle data was filtered and thus the rendering efficiency was improved. As a result, smooth surfaces with lighting can be used to expressively exhibit inner structures and physical variable distributions of particle clusters for large-scale particles. Experiment results demonstrate that using the proposed algorithm, the rendering of more than 100 million particles is realized in 5 seconds on 512 processing cores with about 60% parallel efficiency. The proposed algorithm has been successfully applied to practical simulation applications such as massively parallel non-equilibrium molecular dynamics simulations.]]></description>
<pubDate>2024/9/29 15:02:41</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[WANG Huawei, AI Zhiwei, CAO Yi]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>WANG Huawei, AI Zhiwei, CAO Yi</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405023]]></guid><cfi:id>2</cfi:id><cfi:read>true</cfi:read></item>
<item>
<title xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="text"><![CDATA[Workflows scheduling powered by execution time prediction model]]></title>
<link><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405024]]></link>
<description xmlns:cf="http://www.microsoft.com/schemas/rss/core/2005" cf:type="html"><![CDATA[For the problem of workflow job scheduling, the critical path method was proposed to predict the execution time of the workflow and allocate resources. The parallel application directed acyclic graph was used to describe the relationships among the sub-jobs of a workflow in the workflow execution time prediction algorithm. Based on this order, the system resources were logically allocated to the sub-jobs. According to the characteristics and resource allocation information of sub-jobs, the gradient boosting decision tree-based algorithm was used to predict the execution time of sub-jobs, and the critical path of workflow was calculated. The sum of the completion time of all sub-jobs on the critical path is the execution time of the workflow. If the predicted workflow execution time satisfies the user′s requirements, job scheduling was executed according to the sub-job execution sequence and resource allocation scheme, and the workflow was executed. Comparative experiments show that the prediction errors of the execution time of two workflows are 5.72% and 1.57%, respectively. Compared with the default scheduling algorithm of Spark, the workflow scheduling algorithm reduces the completion time of the two workflows by 15.71% and 15.44%, respectively.]]></description>
<pubDate>2024/9/29 0:00:00</pubDate>
<category><![CDATA[Computer Science and Technology]]></category>
<author><![CDATA[HU Yahong, QIU Yuanyuan, MAO Jiafa]]></author>
<atom:author xmlns:atom="http://www.w3.org/2005/Atom">
<atom:name>HU Yahong, QIU Yuanyuan, MAO Jiafa</atom:name>
</atom:author>
<guid><![CDATA[http://journal.nudt.edu.cn/gfkjdxxben/article/abstract/202405024]]></guid><cfi:id>1</cfi:id><cfi:read>true</cfi:read></item>
</channel>
</rss>