This paper discusses the design of the queue for DNA-based computer on the point view of data structure. The nucleotide encodings for all components of the queue are given out formally. The linear double-stranded DNA ...This paper discusses the design of the queue for DNA-based computer on the point view of data structure. The nucleotide encodings for all components of the queue are given out formally. The linear double-stranded DNA molecules are used as the storage structure of the queue, and the basic bio-operations over the queue are described. Furthermore, the comparison between the queue of the electronic computer and that of DNA-based computer are elucidated. To prove the feasibility of our work, nucleotide encodings for an instance of queue are given out. All the biological technology mentioned in this paper can be practically implemented in the laboratory. Based on this work, other data structures could be developed in DNA-based computer.展开更多
Data structure and semantics of the traditional data model cannot effectively represent the data warehouse, it is difficult to effectively support online analytical processing （referred to as OLAP）. This paper is pr...Data structure and semantics of the traditional data model cannot effectively represent the data warehouse, it is difficult to effectively support online analytical processing （referred to as OLAP）. This paper is propose a new multidimensional data model based on the partial ordering and mapping. The data model can fully express the complex data structure and semantics of data warehouse, and provide an OLAP operation as the core of the operation of algebra, support structure in levels of complex aggregation operation sequence, which can effectively support the application of OLAE The data model supports the concept of aggregation function constraint, and provides constraint mechanism of the hierarchy aggregation function.展开更多
For any prime power q and any dimension s≥1, a new construction of (t, s)-sequences in base q using global function fields is presented. The construction yields an analog of Halton sequences for global function field...For any prime power q and any dimension s≥1, a new construction of (t, s)-sequences in base q using global function fields is presented. The construction yields an analog of Halton sequences for global function fields. It is the first general construction of (t, s)-sequences that is not directly based on the digital method. The construction can also be put into the framework of the theory of (u, e, s)-sequences that was recently introduced by Tezuka and leads in this way to better discrepancy bounds for the constructed sequences.展开更多
Locating arrays are of interest in generating software test suites to cover all t-way component interactions and locate interaction faults in component-based systems.Recently,Tang,Colbourn and Yin made an investigatio...Locating arrays are of interest in generating software test suites to cover all t-way component interactions and locate interaction faults in component-based systems.Recently,Tang,Colbourn and Yin made an investigation into optimal locating arrays in the case where a single fault is to be located.They pointed out that when two or more faults were considered,matters would become rather complicated.To handle those cases generally seems challenging,but is well worth further research.In this paper,we establish a lower bound on the size of locating arrays with at most two faults,and then prove that optimal locating arrays meeting this bound can be equivalently characterized in terms of orthogonal arrays with prescribed properties.Using this characterization,we develop a number of constructions of optimal locating arrays.Two infinite series of optimal locating arrays are then obtained.展开更多
In this paper,we propose a derivative-free trust region algorithm for constrained minimization problems with separable structure,where derivatives of the objective function are not available and cannot be directly app...In this paper,we propose a derivative-free trust region algorithm for constrained minimization problems with separable structure,where derivatives of the objective function are not available and cannot be directly approximated.At each iteration,we construct a quadratic interpolation model of the objective function around the current iterate.The new iterates are generated by minimizing the augmented Lagrangian function of this model over the trust region.The filter technique is used to ensure the feasibility and optimality of the iterative sequence.Global convergence of the proposed algorithm is proved under some suitable assumptions.展开更多
基金This work was supportedin part by the National Nature Science Foundation of China (No.60474037and60004006) Programfor NewCentury Excellent Talents in University (NCET04 415) +1 种基金Specialized Research Fund for the Doctoral Programof Higher Educationfrom Educational Committee of China (No.20030255009) the Youth Foundation fromEducational Committee of Anhui Province(No.2005jql043) .
文摘This paper discusses the design of the queue for DNA-based computer on the point view of data structure. The nucleotide encodings for all components of the queue are given out formally. The linear double-stranded DNA molecules are used as the storage structure of the queue, and the basic bio-operations over the queue are described. Furthermore, the comparison between the queue of the electronic computer and that of DNA-based computer are elucidated. To prove the feasibility of our work, nucleotide encodings for an instance of queue are given out. All the biological technology mentioned in this paper can be practically implemented in the laboratory. Based on this work, other data structures could be developed in DNA-based computer.
文摘Data structure and semantics of the traditional data model cannot effectively represent the data warehouse, it is difficult to effectively support online analytical processing （referred to as OLAP）. This paper is propose a new multidimensional data model based on the partial ordering and mapping. The data model can fully express the complex data structure and semantics of data warehouse, and provide an OLAP operation as the core of the operation of algebra, support structure in levels of complex aggregation operation sequence, which can effectively support the application of OLAE The data model supports the concept of aggregation function constraint, and provides constraint mechanism of the hierarchy aggregation function.
文摘For any prime power q and any dimension s≥1, a new construction of (t, s)-sequences in base q using global function fields is presented. The construction yields an analog of Halton sequences for global function fields. It is the first general construction of (t, s)-sequences that is not directly based on the digital method. The construction can also be put into the framework of the theory of (u, e, s)-sequences that was recently introduced by Tezuka and leads in this way to better discrepancy bounds for the constructed sequences.
基金supported by National Natural Science Foundation of China (Grant Nos.10831002,10801104)the Graduate Student Research and Innovation Program of Jiangsu Province (GrantNo.CXZZ11-0084)
文摘Locating arrays are of interest in generating software test suites to cover all t-way component interactions and locate interaction faults in component-based systems.Recently,Tang,Colbourn and Yin made an investigation into optimal locating arrays in the case where a single fault is to be located.They pointed out that when two or more faults were considered,matters would become rather complicated.To handle those cases generally seems challenging,but is well worth further research.In this paper,we establish a lower bound on the size of locating arrays with at most two faults,and then prove that optimal locating arrays meeting this bound can be equivalently characterized in terms of orthogonal arrays with prescribed properties.Using this characterization,we develop a number of constructions of optimal locating arrays.Two infinite series of optimal locating arrays are then obtained.
基金supported by National Natural Science Foundation of China (Grant Nos. 11071122 and 11171159)the Specialized Research Fund of Doctoral Program of Higher Education of China (Grant No. 20103207110002)
文摘In this paper,we propose a derivative-free trust region algorithm for constrained minimization problems with separable structure,where derivatives of the objective function are not available and cannot be directly approximated.At each iteration,we construct a quadratic interpolation model of the objective function around the current iterate.The new iterates are generated by minimizing the augmented Lagrangian function of this model over the trust region.The filter technique is used to ensure the feasibility and optimality of the iterative sequence.Global convergence of the proposed algorithm is proved under some suitable assumptions.
