A novel stream cipher based on the combination of FCSR and LFSR is proposed by Schneier, which is paid close attention by researchers. In this paper, the properties of this stream cipher are analyzed and the theoretical upper bound of period and that of linear complexity are presented. Then, how to select the parameters of FCSR and LFSR is discussed so that the output sequences can access the theory up bound as much as possible. Meanwhile, the pseudorandom properties of generated sequence are checked by eight tests in NIST STS package. According to the testing results, the generated sequences have good pseudorandom properties if the parameters are selected as the proposed rule. The stream cipher is realized in FPGA and compared with the implementation result of other stream ciphers, which proves this stream cipher is very efficient and can be employed in mobile equipment.

To improve the initivative and stability of Pan-Tilt-Zoom(PTZ) adjustment in visual system under constant illumination condition, Active Pan-Tilt-Zoom(APTZ) adjustment method based on Local particle Filtering Pre-Location(LFPL) under constant illumination condition is proposed. Target pre-location mehtod based on local particle filter is used to realize automatic estimation calibratiing for moving target. Initivative of PTZ adjusting is improved and nonlinear tracking problem can be settled. Dynamic selecting illumination-inviarants as filtering particles can overcome the affect of illumination varying and noise in target pre-location algorithm and robust of visual system is improved. Fuzzy control method is used to control pan and tilt to improve the stability of visual tracking system. The correctness and accuracy are tested by experiments. Long distance tracking for varying speed moving target using this method shows it is more stabile than the traditional method. Moving target racking under varying illumination and noise conditions shows ideal result.

In order to overcome the limitation of literal matching and lacking semantic concept of the traditional keyword extraction algorithm, this paper presents a Semantic-based Keyword Extraction(SKE) algorithm for Chinese text. It uses semantic feature in the keyword extraction process and constructs word semantic similarity network and uses betweenness centrality density. Experimental results show that compared with the statistic based keyword extraction algorithm, the keywords SKE algorithm extracted are more reasonable and can represent more information of the document’s topic, and the SKE algorithm has a better performance.

By taking advantages of the characteristic of Gray code that can extend or remain the block character of binary images, this paper proposes an improved Non-symmetry and Anti-packing Model with K-lines(NAMK) representation algorithm for color images, which is called NAMKG algorithm. The description of NAMKG algorithm is presented and the storage structure and the total data amount of the algorithm are analyzed. Theoretical and experimental results show that, compared with NAMK and Linear Quadtree(LQT), NAMKG can effectively reduce the number of subpatterns and reduce the storage room.

Dominance-based rough set approach (DRSA) is an extension of classical rough set theory (RST). Approximation of class unions is a very important approach in DRSA. Aiming at the disadvantage of the classical method, this paper presents a new methodology for approximation of class unions based on dominance-matrix. It only needs to calculate the dominance-matrix and does not need to consider the preference relations one by one. Thus it greatly simplifies the process and decreases the computing complex by k times(where k is the number of the decision classes). Besides it is intuitive and efficient. The example illustrates its feasibility and efficiency.

The characteristic of Grid and P2P systems is analyzed, and a four-layer model called UVSP for grid and P2P resource fusion is presented that has a good character in the resource representation, discovery, access and cooperation. In UVSP model, a Bootstrap based on DHT is added into grid and a peer service is implemented in every P2P node. The resource management architecture is discussed against UVSP. A prototype experiment is realized with BT tracker functionality. The UVSP model is helpful to integrate resources in grid and P2P systems, also available to heterogeneous P2P systems as a reference for resource share and cooperation.

The main part of high speed network content auditing system(HSNCAS) is introduced. The process model of HSNCAS is classified into pipelining model and multi-section model. An algorithm of multi-priority memory feedback (MPMF) for pipelining model is presented and system software architecture is designed based on it. The MPMF algorithm forecasts and sends feedback of different priorities to the load balancer by the memory usage of every part of the system. It can effectively use the hardware resources and improve the overall data processing rate. A solution for “half session” is also proposed.

With the vision of anytime anywhere computation, the availability measurement is playing an important role in pervasive computation. In the perspective of quantitative analysis, this paper presents an MRGP-based approach to address the user associated availability measurement of pervasive computation system. A bidirectional extended user model is developed for describing user behaviors. An MRGP model is established, and a stochastic process-based analysis is conducted. The transient and steady availability are provided for this model, and a novel availability metric, called request availability, is suggested. Numerical analysis is carried out and the results argue that the approach and availability metric can give reasonable evaluation for pervasive computation system.

The interconnection network plays an important role in performance and energy consumption of a Network-on-chip(NoC) system. PRDT(2,1) is a promising solution for the interconnection network of NoC due to its smaller diameter and average distance, constant node degree and full scalability. In this paper, a binary routing algorithm for PRDT is presented in order to improve the performance of routing for PRDT with small size. In the case that PRDT consists of no more than 16 nodes, the binary algorithm is deadlock-free without the utilization of virtual channels. Based on the binary algorithm, it proposes a fully adaptive routing algorithm which is deadlock-free by using a few virtual channels. The comparison between the deterministic, adaptive binary algorithm and the original vector algorithm is conducted in a simulation. The results show that the binary algorithm is better in performance while its hardware cost is lower. So the algorithm is readily applicable to the small PRDT-based NoC systems.

The Local Binary Pattern(LBP) method does not consider the contrast value between neighbor pixels, so the feature representation ability of LBP method is limited. According to the problem, this paper proposes a Local Multi-layer Contrast Pattern(LMCP) method to overcome this disadvantage. It limits the illumination variation and divides the contrast value range between neighbor pixels in local area into several layers. Every contrast value is mapped into a certain layer. The statistic histogram for every contrast layer is constructed using the same idea as LBP method. In order to solve the problem of expanded feature dimension, it adopts statistics mapping method to reduce the histogram bins. Experimental result based on Outex_TC_00012 texture database proves that the LMCP method has good classification effect.

For mobile Ad Hoc networks vulnerable to wormhole attack problem, it proposes a routing protocol based on the best links——MSRP secure routing protocols, including the neighbor detection, authentication, key negotiation and communication process, to seek balance between security and performance in the case of the settlement agreement in OLSR security problems. MCPK-based security with routing protocols, OLSR neighbor detection stage by the introduction of secure authentication mechanisms to prevent wormhole attacks. Experimental results show that with the increase in the length of an encrypted channel, wormhole attack detection rate is significantly increased, the solution can better prevent and detect wormhole attacks.

Ontologies usually collaborate with each other. The standard OWL, only remains the owl:import interface, where anything can be imported completely. A clustering integrated collaboration is proposed for ontologies. It differs from current OWL which is extended (EOWL) by adding some new collaborative interfaces instead of using owl:import and so on. A clustered and layered collaborative management system is proposed for context track and reasoning for OWL-DL. It expands the OWL to EOWL and presents a solution of collaboration between ontologies and foreign ontologies in view of ontological language itself.

Test Vectors Applied by Circuit-under-test itself(TVAC) is a new Built-in Self-test(BIST) scheme. Two different TVAC structures for synchronous full scan sequential circuits are presented. Experimental results on ISCAS89 benchmark circuits demonstrate that, compared with the weighted-random-pattern test and Circular Self-test Path(CSTP) method, the TVAC scheme can reach higher fault coverage with smaller test vectors.

The heterogeneous surveillance sensor network energy consumption model which can balance the energy consumption and maximize the network lifetime is established. Based on the model and considering the factors of node energy restriction and data integrality, the network lifetime model of heterogeneous surveillance sensor network in hexagon coverage condition is presented. The optimal solution of the network lifetime model is obtained in hexagon coverage condition when the intra-cluster and inter-cluster key nodes almost run out of energy at the same time. Based on the network lifetime model, the minimum node density for satisfying a given lifetime constraint is gotten.

This paper proposes a formal description method of TCP protocol based on Timed Colored Petri Net(TCPN). Three parameters of sequence number, confirmation number and data unit are adopted to describe the packet more accurately. A time parameter is introduced to evaluate the performance of the protocol. The model is closer to the actual running order agreement because of timeout retransmission, flow control and validation data piggyback transmission. CPN Tools is used for modeling dynamic simulation, and its result proves the correctness of the model.

Transductive support vector machines (TSVM) classifies the new data vector based on the information only related to this data vector. This paper proposes an anomaly network traffic detection method based on TSVM. The KDD-99 intrusion detection competition data set is used to illustrate the performances of the TSVM. The performance-comparisons of TSVM and traditional inductive SVM are presented. The results show that TSVM can be used in intrusion detection practically.

This paper presents an online adjusting method of Proportion Integration Differentiation(PID) parameters based on Quantum Neural Networks(QNNs). By designing a controlled quantum rotation gate, a quantum neuron model is constructed, including two kinds of design parameters: rotation angle of qubits phase and its control range. A quantum neural networks model based on quantum neuron is proposed. By using gradient descent algorithm, a learning algorithm of the model is designed. Experimental results show that both the adjusting ability and the stability of QNNs model are superior to that of the Back Propagation(BP) networks.

A new algorithm is put forward in Dynamic Equilibrium of Multipath Traffic(DEMT) for the purpose of solving the shortcomings of the load distributing multipath algorithm. According to topological structure of putting vector weight, a mathematical model of distributing multipath is set up on network traffic. In this algorithm, the probability coefficient is constructed and it is regarded as the standards of select path, and the load rate variable and the least hop variable on QoS attribute is injected to deduce a optimizing algorithm of more reasonable equilibrium of the network resource. The simulation results show that the new method can avoid network congestion. Network traffic rate is controlled less than 70% and total delay time is reduced to 56% correspondingly.

Large-scale storage system based on P2P architecture is proposed to provide reliable and effective storage service. In these systems, the replica of data object is used to improve performance, availability and reliability. When data object changes in one of the replicas, data must be transferred to other replicas. This paper proposes a application layer multicast protocol——PBMB. Node in the system is grouped by BID. Messages are transferred by PBMB using a novel method. PBMB is self-organized, and can be used in WAN environment. Simulation shows that the algorithm is stable even in large-scale system. Messages are transferred effectively while using less node resources. PBMB is suitable for real systems in the Internet.

Aiming at the organizational problem of metadata harvested by the service provider, this paper proposes Open Archives Initiative Protocol for Metadata Harvesting(OAI-PMH) service provider framework based on Frequent Itemset-based Hierarchical Clustering(FIHC). It utilizes FIHC module to cluster the metadata and generate a cluster tree. Experimental result shows that this framework can reasonably organize metadata, improve metadata search speed and be convenient for user to browse metadata by category.

In order to figure out how memory faults affect high-performance servers, this paper presents a multi-layer fault injection method for Itanium architecture computers. HMFI(Hierarchical Memory Fault Injector) is designed and developed to inject memory faults in physical level, operating system kernel level and process level. Experimental results demonstrate the effectiveness of HMFI in evaluating the fault-tolerant properties of complex computer system.

The paper proposes a novel decentralized trust evaluation model for grid, called GTruMod. In GTruMod, a formula is proposed to evaluate direct trust by referring to the theory of posteriori probabilities of binary events. Referred to characteristics of the society model about trust relationship, methods are presented to discount feedbacks, compose recommendations, and evaluate the trust value. In decentralize network environments, based on GTruMod, a practical graph–based search algorithm and some optimization methods are proposed to evaluate trust, furthermore its complexity is analyzed. The comprehensive experimental results prove that the model has ability to prevent the malicious recommendation.

Most Web page classification methods are based on Vector Space Model(VSM), but it is not suitable for large scale application background with bad computation complexity. A new automated text classification method based on RSOM neural net tree and Bayes method is proposed, RSOM neural net tree is used in Web page index and Bayes method is used in automated Web page classification. The excellent performance of this method has been tested in feature dimension, performance, capacity and accuracy.

In order to optimize the process execution and reduce the actual cost for operation, optimization of workflow is analyzed in the form of Weighted Direct Acyclic Graph(WDAG). By mapping the nodes, arcs, weights of the WDAG to the events, operations, cost of workflow model correspondingly, this paper constructs a workflow model based on WDAG. It proposes an optimization algorithm that involved two strategies, consolidation optimization and parallel optimization to aim at the sequence process which happens most frequently in workflow. Simulation experimental result proves the validity of the algorithm.

Behavior evolution is main method for Continuous Petri Net(CPN) model. However, it can not offer all analysis for CPN. To analyze Interval Continuous Petri Net(ICPN) by timed automata, the state evolution graph for ICPN is developed, and the timed automata for ICPN is proposed based on a state evolution graph. Through case study, the effectiveness and necessity of the proposed method are illustrated.

This paper constructs a system structure which is used for conceptual design on the basis of FCBR and AHP. The structure combines the fuzzy set theory with CBR to solve the problem that most design requirements described by users are uncertain and nonstandard. After retrieving the competent evaluation cases set, the system uses AHP method to evaluate the function and economy indexes of the cases set, attains the most appropriate design candidate, and achieves the final optimized scheme by transfering the adaptation rules of the function adaptation cases to modify the design candidate. The application result shows that the hybrid mechanism can provide the designers with effective design decision during conceptual design.

Because of the special environment of the mobile Ad Hoc, the management of it becomes very difficult. Aiming at this, by using the new zone generating algorithm, this paper proposes IZRP based on ZRP, which reduces the zones’ number and lessens the nodes’ overlap attach. The hierarchical network management based on IZRP shortens the time of routing transmit and enhances the management efficiency of the whole Ad Hoc network.

This paper presents a framework of multi-user roam system based on B/S architecture. The scene can be dynamically controlled by using Java script authoring interface of VRML. With messages transferred between the server and clients from the users and the scene itself, the communication and interaction among multiple users in the same virtual scene on the web are implemented. This system is also a general ideal model for other multi-user roam systems. An example of this application is showed, and the result shows this system is effective.

This paper points out the shortage of the lack of unified semantic foundation among UML multi-views, and presents an object-oriented Petri net (OOPN) based approach, executable object structural model (EOSM), to deal with it. This method represents both the aspects of objects’ structure and behaviors in the form of sub-net of OOPN, so that behaviors belonging to different objects can be coupled dynamically upon ESOM models. Simulation of an example shows that EOSM can unify the structural and behavioral models successfully.

For supply chain performance evaluation, an algorithm is proposed based on the Improved Harmony Search Algorithm(IHSA) combined with the Least Square Support Vector Machine(LSSVM). Studying the principle of Harmony Search Algorithm(HSA), an improved harmony search algorithm uses dynamic adjustment of pitch adjusted probability and pitch adjustment step. The global search ability of the algorithm is used to select LSSVM penalty factor and Gaussian kernel function radius. Combined with a supply chain performance evaluation example, it builds supply chain assessment model. Simulation results show that with the existing BP neural network algorithm and LSSVM peer evaluation to quantify, it is shown that IHS_LSSVM has a smaller prediction error and higher prediction accuracy.

Because most avionic equipments have abnormal states and its failure behaviors are always characterized in uncertainty, it is very difficult to analyze its reliability by Fault Tree Analysis(FTA) model which is based on probability theory. To solve this problem, the failure behaviors of bottom events are represented by triangle Vague sets, and the AND/OR fuzzy operators are built based on arithmetic operations of triangle Vague sets, and sequentially the Vague Fault Tree Analysis(VFTA) model is proposed. Three FTA models are adopted respectively to analyze the reliability of a DC system, and the comparisons show that the proposed VFTA model is more flexible and more effective than the other fuzzy FTA models.

This paper presents a data exchange model of Electronic Flight Bag System(EFBS). This model uses star-type logic structure to implement data transfer, and exchanges the message through data exchange components and central content management elements, then implements EFBS message exchange through a data exchange procedure designed with XML. A data integrity exchange procedure and an integrity check mechanism of EFBS are presented. In this mechanism, the sender generates digital signatures with DSA algorithm and the text summary is calculated by SHA-1 algorithm. At the receiver, the data integrity checking operation is conducted through digital signature verification consequently. Experimental results demonstrate the effectiveness and feasibility of this EFBS data integrity checking mechanism.

Aiming at detecting the design faults at early development stage and reducing the overhead that N-version Programming(NVP) fault tolerance strategy may bring into a system, this paper proposes an aspect-oriented modeling method based on Hierarchical Colored Petri Net(HCPN). NVP is modularized into an aspect sub-module and woven into a final executable HCPN. An aspect-oriented NVP model is built through a case study of searching system using this method. Analysis result verifies the correctness and effectiveness of this NVP model.

In order to solve the fairness problem in 802.11e networks, a method called DTAF(Dynamic TXOP Allocation for Fairness) is proposed, which utilizes the collision times to estimate contention degree before transmission, turns TXOP, and at the same time, solves the unfairness problem in the networks employing the multi-rate scheme. Theoretic analysis and simulaiton results show that DTAF has better performance in retransmission times, packets average transmission delay and fairness among stations employing varying data rates.

This paper proposes a Group Key Management Scheme Based on Threshold(GKMT). The idea of dynamic threshold secret sharing scheme to encrypt multicast streams is used in GKMT. When a user wants to join or leave a multicast group, it is need not to redistribute group key. It can greatly enhance the effectiveness of the scheme. Meanwhile, to enhance the scalability of the scheme, the original scheme is improved to LGKMT using the hierarchical control. Performance analysis result shows that GKMT and LGKMT schemes are superior to existing group key management scheme on key communication cost, suitable for the group communication network which group state often changes.

Aiming at the problem of the poor reconstruction accuracy and the limited sparsity of the signal available of the DFT correlation detection algorithm in the compressed sampling using chirp matrix,this paper proposes a Discrete Chirp-Fourier Transform(DCFT) based reconstruction algorithm.It increases the number of measurements according to the signal sparsity k so that the sampling matrix has the ability of reconstructing accurately the signal having a large value of k.And it selects the atom indexes corresponding to the k largest DCFT amplitude of the sampling signal to hit the nonzero positions to reduce the incorrect detection of the best atoms caused by cross interference in the DFT correlation algorithm.It uses the Least Square method to estimate the amplitudes of nonzero elements to further reduce the reconstruction error.Results of sampling and reconstruction experiments of one-dimensional signal with length N of 1 681 show that the DCFT reconstruction algorithm can reconstruct accurately the signal whose sparsity k increases to 4 times as that of the DFT correlation detection algorithm,and has a considerable computational complexity O(kN).

Traditional weighted fair queue algorithms have the main drawback: the calculation of the weight parameters according to each packet. The paper proposes a new weighted fair queueing algorithm(SPFQ), which uses service probability to schedule packets and a random number to decide which packet to be served next. In addition, a novel adaptive service probability parameter calculation method is used to solve the unfair problem induced by the variable packet length and an adaptive queue management technology to improve the utilization of the server’s queue buffer and reduce the delay burstiness. Simulation results demonstrate the validity and practicability of SPFQ.

There is data redundancy temporal database and the quantities of temporal database are increasing fleetly, aiming at these problems, this paper puts forward compressed storage tactics based on improved genetic algorithm for temporal data which combine compress technology in existence in order to settle data redundancy in the course of temporal data storage. Temporal relation data at any moment is decomposed into least granularity data and be coded meanwhile. Optimized storage data are figured out by using improved genetic algorithm, and the ratio of compression is enhanced. Celerity astringency of the algorithm can heighten speed of removing data redundancy largely.

A more security analysis on the ID-based Authenticated Group Key Agreement(ID-AGKA) is given and it is found that the ID-based AGKA does not resist outsider attack, that is, an adversary can make a group session key inconsistent, which can not be detected by the users in the group however. An improvement of the AGKA scheme is proposed. Security analysis shows the scheme can resist outside attack.

This paper constructs a new group blind signature scheme on the basis of ACJT group signature scheme. The security of the new scheme is based on the strong RSA assumption and the decisional Diffie-Hellman assumption, of which is different from the scheme of LR98. In the mean time, the efficiency of the user to blind the content of the signer is improved. To blind the group signature of ACJT, this paper only adds the computation of modular exponentiation and modular addition; while the scheme in LR98 adds the computation of double discrete logarithm, root of the discrete logarithm and random permutation in order to blind the group signature of CS97. As a result, the scheme proposed by this paper is much lower than the one in LR98 with respect to computation complexity and higher with respect to efficiency.

On the basis of the analysis of SMTP protocol and SMTP proxy server principle, a SMTP transparent proxy for security detection is developed under Linux environment. Some key techniques are designed and implemented, such as redirecting port, concurrent mail service, getting the address and port of the server, handling annex. System test shows that the SMTP proxy is transparent to users, and can deputize for multiple e-mail services, prevent virus intrusion and leakage of internal content efficiently.

This paper proposes a thought of Reconfigurable Test Unit Adapter(RTUA). RTUA can be configured in real-time with programmable interface to satisfy the test requirements of different UUTs or signals. A kind of matching function is presented to describe the matching degree between test point and instrument port. Matching function integrates signal properties of test point, capability parameters of instrument and instrument’s price and so on. Hardware architecture of RTUA is put forward. Control module is implemented with SOPC and can be configured with different configuration files. Software design method of RTUA is given, test and control computer realizes the configuration management of RTUA with COM.

In order to solve this problem that the number of character classes is unknown, and the large number of data in process of children using computer-education system, this paper presents a kind of method based on K-means Hierarchical Clustering(KMHC) algorithm to dig the children’s roles of the interaction. This method preprocess the data by using data cleaning with constraints and data changes with rules. After preprocess, this method uses K-means clustering method of interactive children in supplementary roles in the process of initial clustering, and uses the hierarchical clustering method to classify the initial results. Experimental results show that the classification of this method is better, and has good efficiency.

A new modeling and Digital Pre-distortion(DPD) method named as Parallel GMP-SCT-CIMT(PGSC) is proposed because of the strong memory effect characteristics of broadband power amplifier. The new behavioral model of power amplifier and pre-distorter are constructed of Generalized Memory Polynomial(GMP), Specific Cross Terms(SCT) and Cross Items between Memory Times(CIMT). A test platform is built to verify the accuracy and linear effect of the method. Experimental results show that compared with the PMEC method, the PGSC method shows an average Normalized Mean Square Error(NMSE) improvement of 2.1 dB in behavioral modeling, and reduces the third-order ACPR of output signal by 4.94/2.03 dB in DPD application. Compared with the GMP method, the PGSC method achieves higher model accuracy and better linear effect just using approximately 73% of coefficients.

This paper presents a Reverse Nearest Neighbor Queries(RNNQ) algorithm based on Auto-Selection Grid Index(ASGI). ASGI divides the space into an equal size network, and each cell stores moving objects as a bucket. RNNQ algorithm uses the strategy of the bucket’s object number and the grid geometry characteristic to reduce the access node the RNNQ must visit. ASGI will repeat the previous action to decrease the cost again if objects around the query point are too many. Experimental results show that RNNQ algorithm based on ASGI has good query performance and outperforms RNNQ algorithm based on TPR tree.

Kullback-Leibler distance of information can be used to measure the difference degree between the random variables. This paper presents the concept of extended Kullback-Leibler distance. A new reduction algorithm based on extended Kullback-Leibler distance for knowledge is put forward, and the complexity of the algorithm is analyzed simply. The experimental results show that this algorithm can find out the relative minimal reduction for most decision tables.

Aiming at the deficiencies in applying traditional safety analysis technologies, this paper presents a safety analysis method based on Process Control Event Diagram(PCED) for control logic in Computer Process Control Systems(CPCS). The PCED of its control logic is set up according to the characteristics of the system, the influencing path of “Action-Component-Variable” is erected, and the safety of the control logic is analyzed by the algorithm. The method is illustrated by a case study of the computer-controlled chemical process system.

ACPH(Acyclic Continuous Phase-type) distribution inherits the better characteristic form Phase-type(PH) distribution. The difficulty in fitting data with ACPH distribution is lower than that with PH one. To solve the numerical instability problem existed in the current ACPH data fitting methods, a new ACPH data fit method based on EM algorithm is proposed. The theoretical analysis process of the new method is given. The effectiveness of the new method is verified by three examples.

For fast computation of scalar multiplication of the elliptic curve over GF(p), with the utilization of the endomorphism whose characteristic polynomial is , -NAF expansion of the integer k is proposed by Ciet in order to speed up the computation of scalar multiplication kP. In this paper, a window technic is applied to the -NAF representation, which gets the -NAF decomposition of k and can obtain better result than -NAF representation with the cost of some quantities of storages. The length and the density of the expansion is accurately estimated.

This paper proposes an improved Directional Transmission and Reception Algorithm(DTRA) named SDTRA protocol based on slot schedule. In the process of neighbor discovery stage, the protocol decreases the collision through sending time random delay. In the process of slot schedule stage, it adopts greedy edge coloring algorithm to control the time the node can use. The protocol can assure the QoS support through synchronous slot schedule algorithm. Simulation results show that the improved DTRA protocol is much better than DTRA protocol in neighbor discovery, time utility and throughput.