To describe the dynamic propcrty of trust relationship, wt propose atime-related trust model and extend Joang's subjective logic to fit for time-related trust model.The extension includes prepositional conjunction...To describe the dynamic propcrty of trust relationship, wt propose atime-related trust model and extend Joang's subjective logic to fit for time-related trust model.The extension includes prepositional conjunction, disjunction and negation for traditional logic anddiscounting and consensus operators that are evidential operators specially designed for thepropagation and computation of trust relationships. With the extension of subjective logic fortime-related trust, our time-related trust modelis suitable to model the dynamic trust relationshipin practice. Finally an example of reputation assessment is offered to demonstrate the usage of ourtrust model.展开更多
The thinking of co evolution is applied to the optimization of retaining and protecting structure for deep foundation excavation, and the system of optimization of anchored row piles for deep foundation pit has been a...The thinking of co evolution is applied to the optimization of retaining and protecting structure for deep foundation excavation, and the system of optimization of anchored row piles for deep foundation pit has been already developed successfully. For the co evolution algorithm providing an evolutionary mechanism to simulate ever changing problem space, it is an optimization algorithm that has high performance, especially applying to the optimization of complicated system of retaining and protecting for deep foundation pit. It is shown by many engineering practices that the co evolution algorithm has obvious optimization effect, so it can be an important method of optimization of retaining and protecting for deep foundation pit. Here the authors discuss the co evolution model, object function, all kinds of constraint conditions and their disposal methods, and several key techniques of system realization.展开更多
A scheme to construct signatures automatically for Snort from the data captured by honeypots is presented. With this scheme intrusion detection systems can be quickly updated to detect new intrusions soon when happen....A scheme to construct signatures automatically for Snort from the data captured by honeypots is presented. With this scheme intrusion detection systems can be quickly updated to detect new intrusions soon when happen. The idea is based on the observation that any traffic to and from honeypots represents abnormal activities, so data patterns extracted from these packets can be used by misuse detection system to identify new attacks. The algorithm of constructing rules is discussed. Experiment illustrates the effectiveness of the scheme.展开更多
In this paper, H∞ optimal model reduction for singular fast subsystems will be inves-tigated. First, error system is established to measure the error magnitude between the original andreduced systems, and it is demon...In this paper, H∞ optimal model reduction for singular fast subsystems will be inves-tigated. First, error system is established to measure the error magnitude between the original andreduced systems, and it is demonstrated that the new feature for model reduction of singular systemsis to make H∞ norm of the error system finite and minimal. The necessary and su?cient conditionis derived for the existence of the H∞ suboptimal model reduction problem. Next, we give an exactand practicable algorithm to get the parameters of the reduced subsystems by applying the matrixtheory. Meanwhile, the reduced system may be also impulsive. The advantages of the proposedalgorithm are that it is more ?exible in a straight-forward way without much extra computation, andthe order of the reduced systems is as minimal as possible. Finally, one illustrative example is givento illustrate the e?ectiveness of the proposed model reduction approach.展开更多
A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's...A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's advantages, IQGA utilizes the characteristics and knowledge in the pending problems for restraining the repeated and ineffective operations during evolution, so as to improve the algorithm efficiency. The experimental results of the knapsack problem show that the performance of IQGA is superior to the Conventional Genetic Algorithm (CGA), the Immune Genetic Algorithm (IGA) and QGA.展开更多
XML is an important technology for Internet-based data exchange with far reaching capabilities be-yond for just data exchange. The paper describes the first results of a project that aims to explore the applicabil-ity...XML is an important technology for Internet-based data exchange with far reaching capabilities be-yond for just data exchange. The paper describes the first results of a project that aims to explore the applicabil-ity of XML technology for web-based software engineering with the emphasis on collaborative software testing in-volving the use of statechart. The paper presents the approach of building the statechart schema with XML Sche-ma. It also describes the use of the schema in a web-based collaborative software testing CASE environment.展开更多
More and more cryptographic protocols have been used to achieve various security requirements of distributed systems in the open network environment. However cryptographic protocols are very difficult to design and an...More and more cryptographic protocols have been used to achieve various security requirements of distributed systems in the open network environment. However cryptographic protocols are very difficult to design and analyze due to the complexity of the cryptographic protocol execution, and a large number of problems are unsolved that range from the theory framework to the concrete analysis technique. In this paper, we build a new algebra called cryptographic protocol algebra (CPA) for describing the message operations with many cryptographic primitives, and proposed a new algebra model for cryptographic protocols based on the CPA. In the model, expanding processes of the participants knowledge on the protocol runs are characterized with some algebraic notions such as subalgebra, free generator and polynomial algebra, and attack processes are modeled with a new notion similar to that of the exact sequence used in homological algebra. Then we develope a mathematical approach to the cryptographic protocol security analysis. By using algebraic techniques, we have shown that for those cryptographic protocols with some symmetric properties, the execution space generated by an arbitrary number of participants may boil down to a smaller space generated by several honest participants and attackers. Furthermore we discuss the composability problem of cryptographic protocols and give a sufficient condition under which the protocol composed of two correct cryptographic protocols is still correct, and we finally offer a counterexample to show that the statement may not be true when the condition is not met.展开更多
Degree, diameter and congestion are important measures of distributed hash table (DHT) schemes for peer-to-peer networks. Many proposed DHT schemes are based on some traditional interconnection topologies and the Kaut...Degree, diameter and congestion are important measures of distributed hash table (DHT) schemes for peer-to-peer networks. Many proposed DHT schemes are based on some traditional interconnection topologies and the Kautz graph is a topology with good properties such as optimal network diameter. In this paper, FissionE, a novel DHT scheme based on the Kautz graph, is proposed. FissionE is the first constant degree and O(logN) diameter DHT scheme with (1+o(1))-congestion. FissionE shows that the DHT scheme with constant degree and constant congestion can achieve O(logN) diameter, which is better than the lower bound ? (N1/d) conjectured before. The average degree of FissionE is 4 and the diameter is 2*log2N, and the average routing path length is about log2N. The average path length of FissionE is shorter than CAN or Koorde with the same degree when the P2P network is large scale.展开更多
In this era of VLSI circuits, testability is truly a very crucial issue.To generate a test set for a given circuit, choice of an algorithm from a number ofexisting test generation algorithms to apply is bound to vary ...In this era of VLSI circuits, testability is truly a very crucial issue.To generate a test set for a given circuit, choice of an algorithm from a number ofexisting test generation algorithms to apply is bound to vary from circuit to circuit.In this paper, the Genetic Algorithm is used in order to construct an accurate modelfor some existing test generation algorithms that are being used everywhere in theworld. Some objective quantitative measures are used as an effective tool in makingsuch choice. Such measures are so important to the analysis of algorithms that theybecome one of the subjects of this work.展开更多
Iris recognition is one of the most reliable personal identification methods. In iris recognition systems, image registration is an important component. Accurately registering iris images leads to higher recognition r...Iris recognition is one of the most reliable personal identification methods. In iris recognition systems, image registration is an important component. Accurately registering iris images leads to higher recognition rate for an iris recognition system. This paper proposes a phase correlation based method for iris image registration with sub-pixel accuracy. Compared with existing methods, it is insensitive to image intensity and can compensate to a certain extent the non-linear iris deformation caused by pupil movement. Experimental results show that the proposed algorithm has an encouraging performance.展开更多
Data cube computation is a well-known expensive operation and has been studied extensively. It is often not feasible to compute a complete data cube due to the huge storage requirement. Recently proposed quotient cube...Data cube computation is a well-known expensive operation and has been studied extensively. It is often not feasible to compute a complete data cube due to the huge storage requirement. Recently proposed quotient cube addressed this fundamental issue through a partitioning method that groups cube cells into equivalent partitions. The effectiveness and efficiency of the quotient cube for cube compression and computation have been proved. However, as changes are made to the data sources, to maintain such a quotient cube is non-trivial since the equivalent classes in it must be split or merged. In this paper, incremental algorithms are designed to update existing quotient cube efficiently based on Galois lattice. Performance study shows that these algorithms are efficient and scalable for large databases.展开更多
The rapid progress in mass storage technology has made it possible for designersto implement large data storage systems for a variety of applications. One of the efficient waysto build large storage systems is to use ...The rapid progress in mass storage technology has made it possible for designersto implement large data storage systems for a variety of applications. One of the efficient waysto build large storage systems is to use RAIDs as basic storage modules. In general, the datacan be recovered in RAIDs only when one error occurs. But in large RAIDs systems, the faultprobability will increase when the number of disks increases, and the use of disks with big storagecapacity will cause the recovering time to prolong, thus the probability of the second disk's faultwill increase. Therefore, it is necessary to develop methods to recover data when two or more errorshave occurred. In this paper, a fault tolerant scheme is proposed based on extended Reed-Solomoncode, a recovery procedure is designed to correct up to two errors which is implemented by softwareand hardware together, and the scheme is verified by computer simulation. In this scheme, only tworedundant disks are used to recover up to two disks' fault. The encoding and decoding methods,and the implementation based on software and hardware are described. The application of thescheme in software RAIDs that are built in cluster computers are also described. Compared withthe existing methods such as EVENODD and DH, the proposed scheme has distinct improvementin implementation and redundancy.展开更多
In mobile ad hoc networks (MANET), nodes move freely and the distribution of access requests changes dynamically. Replica allocation in such a dynamic environment is a significant challenge. In this paoer, a dynamic a...In mobile ad hoc networks (MANET), nodes move freely and the distribution of access requests changes dynamically. Replica allocation in such a dynamic environment is a significant challenge. In this paoer, a dynamic adaptive replica allocation algorithm that can adapt to the nodes motion is proposed to minimize the communication cost of object access. When changes occur in the access requests of the object or the network topology, each replica node collects access requests from its neighbors and makes decisions locally to expand replica to neighbors or to relinquish the replica. The algorithm dynamically adapts the replica allocation scheme to a local optimal one. Simulation results show that our algorithms efficiently reduce the communication cost of object access in MANET environment.展开更多
In secure multicast communication, packet source authentication is a bot-tleneck problem due to the dynamic property of the multicast group, unreliability of datatransmission and the large number of data packets. This...In secure multicast communication, packet source authentication is a bot-tleneck problem due to the dynamic property of the multicast group, unreliability of datatransmission and the large number of data packets. This paper proposes a novel authentica-tion scheme called B-MSAS (Balance Multicast Source Authentication Scheme) that can beused to solve this problem, in which a new message authentication technique is introduced.This scheme dramatically reduces the signature size overhead and raises the signature rate. Itprovides the non-repudiation service, high loss resistance, and can easily be scaled up to poten-tially millions of receivers, and hence has a sweeping applicability. It should have applicationsto many practical problems.展开更多
In this paper,a computationally effective algorithm based on tabu search for solving the satisfiability problem(TSSAT)is proposed.Some novel and efficient heuristic strategies for generating candidate neighborhood of ...In this paper,a computationally effective algorithm based on tabu search for solving the satisfiability problem(TSSAT)is proposed.Some novel and efficient heuristic strategies for generating candidate neighborhood of the curred assignment and selecting varibables to be flipped are presented. Especially,the aspiration criterion and tabu list tructure of TSSAT are different from those of traditional tabu search.Computational experiments on a class of problem insteances show that,TSSAT,in a reasonable amount of computer time ,yields better results than Novelty which is currently among the fastest known.Therefore TSSAT is feasible and effective.展开更多
文摘To describe the dynamic propcrty of trust relationship, wt propose atime-related trust model and extend Joang's subjective logic to fit for time-related trust model.The extension includes prepositional conjunction, disjunction and negation for traditional logic anddiscounting and consensus operators that are evidential operators specially designed for thepropagation and computation of trust relationships. With the extension of subjective logic fortime-related trust, our time-related trust modelis suitable to model the dynamic trust relationshipin practice. Finally an example of reputation assessment is offered to demonstrate the usage of ourtrust model.
基金National Natural Science Foundation of China( 5 986 80 0 1)
文摘The thinking of co evolution is applied to the optimization of retaining and protecting structure for deep foundation excavation, and the system of optimization of anchored row piles for deep foundation pit has been already developed successfully. For the co evolution algorithm providing an evolutionary mechanism to simulate ever changing problem space, it is an optimization algorithm that has high performance, especially applying to the optimization of complicated system of retaining and protecting for deep foundation pit. It is shown by many engineering practices that the co evolution algorithm has obvious optimization effect, so it can be an important method of optimization of retaining and protecting for deep foundation pit. Here the authors discuss the co evolution model, object function, all kinds of constraint conditions and their disposal methods, and several key techniques of system realization.
文摘A scheme to construct signatures automatically for Snort from the data captured by honeypots is presented. With this scheme intrusion detection systems can be quickly updated to detect new intrusions soon when happen. The idea is based on the observation that any traffic to and from honeypots represents abnormal activities, so data patterns extracted from these packets can be used by misuse detection system to identify new attacks. The algorithm of constructing rules is discussed. Experiment illustrates the effectiveness of the scheme.
文摘In this paper, H∞ optimal model reduction for singular fast subsystems will be inves-tigated. First, error system is established to measure the error magnitude between the original andreduced systems, and it is demonstrated that the new feature for model reduction of singular systemsis to make H∞ norm of the error system finite and minimal. The necessary and su?cient conditionis derived for the existence of the H∞ suboptimal model reduction problem. Next, we give an exactand practicable algorithm to get the parameters of the reduced subsystems by applying the matrixtheory. Meanwhile, the reduced system may be also impulsive. The advantages of the proposedalgorithm are that it is more ?exible in a straight-forward way without much extra computation, andthe order of the reduced systems is as minimal as possible. Finally, one illustrative example is givento illustrate the e?ectiveness of the proposed model reduction approach.
基金Supported by the National Natural Science Foundation of China (No.60133010 and No.60141002).
文摘A novel algorithm, the Immune Quantum-inspired Genetic Algorithm (IQGA), is proposed by introducing immune concepts and methods into Quantum-inspired Genetic Algorithm (QGA). With the condition of preserving QGA's advantages, IQGA utilizes the characteristics and knowledge in the pending problems for restraining the repeated and ineffective operations during evolution, so as to improve the algorithm efficiency. The experimental results of the knapsack problem show that the performance of IQGA is superior to the Conventional Genetic Algorithm (CGA), the Immune Genetic Algorithm (IGA) and QGA.
基金Sponsored by Guangxi Science Research Foundation (Grant No. 0141046)
文摘XML is an important technology for Internet-based data exchange with far reaching capabilities be-yond for just data exchange. The paper describes the first results of a project that aims to explore the applicabil-ity of XML technology for web-based software engineering with the emphasis on collaborative software testing in-volving the use of statechart. The paper presents the approach of building the statechart schema with XML Sche-ma. It also describes the use of the schema in a web-based collaborative software testing CASE environment.
文摘More and more cryptographic protocols have been used to achieve various security requirements of distributed systems in the open network environment. However cryptographic protocols are very difficult to design and analyze due to the complexity of the cryptographic protocol execution, and a large number of problems are unsolved that range from the theory framework to the concrete analysis technique. In this paper, we build a new algebra called cryptographic protocol algebra (CPA) for describing the message operations with many cryptographic primitives, and proposed a new algebra model for cryptographic protocols based on the CPA. In the model, expanding processes of the participants knowledge on the protocol runs are characterized with some algebraic notions such as subalgebra, free generator and polynomial algebra, and attack processes are modeled with a new notion similar to that of the exact sequence used in homological algebra. Then we develope a mathematical approach to the cryptographic protocol security analysis. By using algebraic techniques, we have shown that for those cryptographic protocols with some symmetric properties, the execution space generated by an arbitrary number of participants may boil down to a smaller space generated by several honest participants and attackers. Furthermore we discuss the composability problem of cryptographic protocols and give a sufficient condition under which the protocol composed of two correct cryptographic protocols is still correct, and we finally offer a counterexample to show that the statement may not be true when the condition is not met.
基金the National Natural Science Foundation of China(Grant Nos.90412011,90104001) the National Basic Research Program ofChina(Grant No.2005CB321801)
文摘Degree, diameter and congestion are important measures of distributed hash table (DHT) schemes for peer-to-peer networks. Many proposed DHT schemes are based on some traditional interconnection topologies and the Kautz graph is a topology with good properties such as optimal network diameter. In this paper, FissionE, a novel DHT scheme based on the Kautz graph, is proposed. FissionE is the first constant degree and O(logN) diameter DHT scheme with (1+o(1))-congestion. FissionE shows that the DHT scheme with constant degree and constant congestion can achieve O(logN) diameter, which is better than the lower bound ? (N1/d) conjectured before. The average degree of FissionE is 4 and the diameter is 2*log2N, and the average routing path length is about log2N. The average path length of FissionE is shorter than CAN or Koorde with the same degree when the P2P network is large scale.
文摘In this era of VLSI circuits, testability is truly a very crucial issue.To generate a test set for a given circuit, choice of an algorithm from a number ofexisting test generation algorithms to apply is bound to vary from circuit to circuit.In this paper, the Genetic Algorithm is used in order to construct an accurate modelfor some existing test generation algorithms that are being used everywhere in theworld. Some objective quantitative measures are used as an effective tool in makingsuch choice. Such measures are so important to the analysis of algorithms that theybecome one of the subjects of this work.
文摘Iris recognition is one of the most reliable personal identification methods. In iris recognition systems, image registration is an important component. Accurately registering iris images leads to higher recognition rate for an iris recognition system. This paper proposes a phase correlation based method for iris image registration with sub-pixel accuracy. Compared with existing methods, it is insensitive to image intensity and can compensate to a certain extent the non-linear iris deformation caused by pupil movement. Experimental results show that the proposed algorithm has an encouraging performance.
文摘Data cube computation is a well-known expensive operation and has been studied extensively. It is often not feasible to compute a complete data cube due to the huge storage requirement. Recently proposed quotient cube addressed this fundamental issue through a partitioning method that groups cube cells into equivalent partitions. The effectiveness and efficiency of the quotient cube for cube compression and computation have been proved. However, as changes are made to the data sources, to maintain such a quotient cube is non-trivial since the equivalent classes in it must be split or merged. In this paper, incremental algorithms are designed to update existing quotient cube efficiently based on Galois lattice. Performance study shows that these algorithms are efficient and scalable for large databases.
文摘The rapid progress in mass storage technology has made it possible for designersto implement large data storage systems for a variety of applications. One of the efficient waysto build large storage systems is to use RAIDs as basic storage modules. In general, the datacan be recovered in RAIDs only when one error occurs. But in large RAIDs systems, the faultprobability will increase when the number of disks increases, and the use of disks with big storagecapacity will cause the recovering time to prolong, thus the probability of the second disk's faultwill increase. Therefore, it is necessary to develop methods to recover data when two or more errorshave occurred. In this paper, a fault tolerant scheme is proposed based on extended Reed-Solomoncode, a recovery procedure is designed to correct up to two errors which is implemented by softwareand hardware together, and the scheme is verified by computer simulation. In this scheme, only tworedundant disks are used to recover up to two disks' fault. The encoding and decoding methods,and the implementation based on software and hardware are described. The application of thescheme in software RAIDs that are built in cluster computers are also described. Compared withthe existing methods such as EVENODD and DH, the proposed scheme has distinct improvementin implementation and redundancy.
文摘In mobile ad hoc networks (MANET), nodes move freely and the distribution of access requests changes dynamically. Replica allocation in such a dynamic environment is a significant challenge. In this paoer, a dynamic adaptive replica allocation algorithm that can adapt to the nodes motion is proposed to minimize the communication cost of object access. When changes occur in the access requests of the object or the network topology, each replica node collects access requests from its neighbors and makes decisions locally to expand replica to neighbors or to relinquish the replica. The algorithm dynamically adapts the replica allocation scheme to a local optimal one. Simulation results show that our algorithms efficiently reduce the communication cost of object access in MANET environment.
文摘In secure multicast communication, packet source authentication is a bot-tleneck problem due to the dynamic property of the multicast group, unreliability of datatransmission and the large number of data packets. This paper proposes a novel authentica-tion scheme called B-MSAS (Balance Multicast Source Authentication Scheme) that can beused to solve this problem, in which a new message authentication technique is introduced.This scheme dramatically reduces the signature size overhead and raises the signature rate. Itprovides the non-repudiation service, high loss resistance, and can easily be scaled up to poten-tially millions of receivers, and hence has a sweeping applicability. It should have applicationsto many practical problems.
文摘In this paper,a computationally effective algorithm based on tabu search for solving the satisfiability problem(TSSAT)is proposed.Some novel and efficient heuristic strategies for generating candidate neighborhood of the curred assignment and selecting varibables to be flipped are presented. Especially,the aspiration criterion and tabu list tructure of TSSAT are different from those of traditional tabu search.Computational experiments on a class of problem insteances show that,TSSAT,in a reasonable amount of computer time ,yields better results than Novelty which is currently among the fastest known.Therefore TSSAT is feasible and effective.
