Sticker DNA computer model ——Part Ⅰ: Theory

Sticker model is one of the basic models in the DNA computer models. This model is coded with single-double stranded DNA molecules. It has the following advantages that the operations require no strands extension and use no enzymes; What‘s more, the materials are reusable.Therefore it arouses attention and interest of scientists in many fields. In this paper, we will systematically analyze the theories and applications of the model, summarize other scientists‘ contributions in this field, and propose our research results. This paper is the theoretical portion of the sticker model on DNA computer, which includes the introduction of the basic model of sticker computing. Firstly, we systematically introduce the basic theories of classic models about sticker computing; Secondly, we discuss the sticker system which is an abstract computing model based on the sticker model and formal languages; Finally, extend and perfect the model, and present two types of models that are more extensive in the applications and more perfect in the theory than the past models: one is the so-called k-bit sticker model, the other is full-message sticker DNA computing model.     

Car-following models of vehicular traffic

The Car-following model is a kind of microscopic simulation model for vehicular traffic, which describe the one-by-one following behaviors of vehides in the same traffic lane. As a common traffic phenomenon, following behavior is of great importance in the micro-study of intelligent traffic control.Compared with other traffic-flow models, car-following model embodies the human factors and feflects the real traffic sit-uation in a better way. This paper gives a systematic review of the development and actuality of car-following models by introducing and analyzing in detail the advantages and disavantages of GHR model, OV model,CA model and fuzzy-logic model. In addition, local stability and asymptotic stability of car-following models are discussed in this paper.     

Plausible cloth animation using dynamic bending model

Simulating the mechanical behavior of a cloth is a very challenging and important problem in computer animation. The models of bending in most existing cloth simulation approaches are taking the assumption that the cloth is little deformed from a plate shape. Therefore, based on the thin-plate theory, these bending models do not consider the condition that the current shape of the cloth under large deformations cannot be regarded as the approximation to that before deformation, which leads to an unreal static bending. [This paper introduces a dynamic bending model which is appropriate to describe large out-plane deformations such as cloth buckling and bending, and develops a compact implementation of the new model on spring-mass systems. Experimental results show that wrinkles and folds generated using this technique in cloth simulation, can appear and vanish in a more natural way than other approaches.]     

Solve the partitioning problem by sticker model in DNA computing

The aim of this work is to solve the partitioning problem, the most canonical NP-complete problem containing numerical parameters, within the sticker model of DNA computing. We firstly design a parallel program for addition, and then give a program to calculate the subset sums of a set. At last, a program for partitioning is given, which contains the former programs. Furthermore, the correctness of each program is proved in this paper.     

DNA computing model based on lab-on-a-chip and its application on solving the timetabling problem

The essential characteristic of DNA computation is its massive parallelism in obtaining and managing information. With the develop- ment of molecular biology technique, the field of DNA computation has made a great progress. By using an advanced biochip technique, laboratory-on-a-chip, a new DNA computing model is presented in the paper to solve a simple timetabling problem, which is a special version of the optimization problems. It also plays an important role in education and other industries. With a simulated biological experiment, the result snggested that DNA comnutation with lab-on-a-chin has the notential to solve a real comtplex timetabling problem.     

Efficient hierarchical identity based signature scheme in the standard model

Hierarchical identity based cryptography is a generalization of identity based encryption that mirrors an organizational hierarchy. It allows a root public key generator to distribute the workload by delegating public key generation and identity authentication to lower-level public key generators. Most hierarchical identity based signature schemes are provably secure in the random oracle model or the weak models without random oracles such as gauntlet-ID model. Currently, there is no hierarchical identity based signature scheme that is fully secure in the standard model, with short public parameters and a tight reduction. In this paper, a hierarchical identity based signature scheme based on the q-SDH problem that is fully secure in the standard model is proposed. The signature size is independent of the level of the hierarchy. Moreover, our scheme has short public parameters, high efficiency and a tight reduction.     

URMG: Enhanced CBMG-Based Method for Automatically Testing Web Applications in the Cloud简

To satisfy the rapid growth of cloud technologies, a large number of web applications have been developed and deployed, and these applications are being run in clouds. Due to the scalability provided by clouds, a single web application may be concurrently visited by several millions or billions of users. Thus, the testing and performance evaluations of these applications are increasingly important. User model based evaluations can significantly reduce the manual work required, and can enable us to determine the performance of applications under real runtime environments. Hence, it has become one of the most popular evaluation methods in both industry and academia. Significant efforts have focused on building different kinds of models using mining web access logs, such as Markov models and Customer Behavior Model Graph （CBMG）. This paper proposes a new kind of model, named the User Representation Model Graph （URMG）, which is built based on CBMG. It uses an algorithm to refine CBMG and optimizes the evaluations execution process. Based on this model, an automatic testing and evaluation system for web applications is designed, implemented, and deployed in our test cloud, which is able to execute all of the analysis and testing operations using only web access logs. In our system, the error rate caused by random access to applications in the execution phase is also reduced, and the results show that the error rate of the evaluation that depends on URMG is 50% less than that which depends on CBMG.     

A Formal Method to Model Early Requirement of Multi-Agent System

A formal specification language iFL based on i framework is presented in this paper to formally specify and analyze the early requirement of multi-agent system. It is a branching temporal logic which defines the concepts and models in i framework in a rigorous way. The method to transform the i models to iFL formal specification is also put forward.     

SARS epidemical forecast research in mathematical model

The SLJR model, simplified from the SEIJR model, is adopted to analyze the important parameters of the model of SARS epidemic such as the transmission rate, basic reproductive number. And some important parameters are obtained such as the transmission rate by applying this model to analyzing the situation in Hong Kong, Singapore and Canada at the outbreak of SARS. Then forecast of the transmission of SARS is drawn out here by the adjustment of parameters (such as quarantined rate) in the model. It is obvious that inflexion lies on the crunode of the graph, which indicates the big difference in transmission characteristics between the epidemic under control and not under control.This model can also be used in the comparison of the control effectiveness among different regions. The results from this model match well with the actual data in Hong Kong, Singapore and Canada and as a by-product, the index of the effectiveness of control in the later period can be acquired. It offers some quantitative indexes, which may help the further research in epidemic diseases.     

Multi-Dimensional Piece-Wise Self-Affine Fractal Interpolation Model

Iterated function system (IFS) models have been used to represent discrete sequences where the attractor of the IFS is piece-wise self-affine in R 2 or R 3 (R is the set of real numbers). In this paper, the piece-wise self-affine IFS model is extended from R 3 to Rn (n is an integer greater than 3), which is called the multi-dimensional piece-wise self-affine fractal interpolation model. This model uses a "mapping partial derivative" , and a constrained inverse algorithm to identify the model parameters. The model values depend continuously on all the model parameters, and represent most data which are not multi-dimensional self-affine in Rn . Therefore, the result is very general. The class of functions obtained is much more diverse because their values depend continuously on all of the variables, with all the coefficients of the possible multi-dimensional affine maps determining the functions.     

A New Segmentation Model—Combined Mumford-Shah Model with Narrow Band

A segmentation model that combines the Mumford-Shah (M-S) model and narrow band scheme of level set is presented. The M-S model is a desirable model for image segmentation, but computationally time-consuming. This paper introduces a fast segmentation model, which combines the M-S model and narrow band scheme using new initialization method. The new initialization method is based on fastmarching method, and the computing time is O (n). In each iteration step, the new segmentation model only deals with the data in narrow band instead of the whole image. Comparing M-S model and new narrow band M-S, experiments show that the two models can obtain almost the same segmentation result, but the computing time of new narrow band M-S model is much less than M-S model.     

A membrane evolutionary algorithm for DNA sequence design in DNA computing

DNA sequence design has a crucial role in successful DNA computation,which has been proved to be an NP-hard(non-deterministic polynomial-time hard) problem.In this paper,a membrane evolutionary algorithm is proposed for the DNA sequence design problem.The results of computer experiments are reported,in which the new algorithm is validated and out-performs certain known evolutionary algorithms for the DNA sequence design problem.     

A new DNA algorithm to solve graph coloring problem

Using a small quantity of DNA molecules and little experimental time to solve complex problems successfully is a goal of DNA computing. Some NP-hard problems have been solved by DNA computing with lower time complexity than conventional computing. However, this advantage often brings higher space complexity and needs a large number of DNA encoding molecules. One example is graph coloring problem. Current DNA algorithms need exponentially increasing DNA encoding strands with the growing of problem size. Here we propose a new DNA algorithm of graph coloring problem based on the proof of four-color theorem. This algorithm has good properties of needing a relatively small number of operations in polynomial time and needing a small number of DNA encoding molecules (we need only 6R DNA encoding molecules if the number of regions in a graph is R).     

A new DNA algorithm to solve graph coloring problem

Using a small quantity of DNA molecules and little experimental time to solve complex problems successfully is a goal of DNA computing. Some NP-hard problems have been solved by DNA computing with lower time complexity than conventional computing. However, this advantage often brings higher space complexity and needs a large number of DNA encoding molecules. One example is graph coloring problem. Current DNA algorithms need exponentially increasing DNA encoding strands with the growing of problem size. Here we propose a new DNA algorithm of graph coloring problem based on the proof of four-color theorem. This algorithm has good properties of needing a relatively small number of operations in polynomial time and needing a small number of DNA encoding molecules (we need only 6R DNA encoding molecules if the number of regions in a graph is R).     

Solving Topological and Geometrical Constraints in Bridge Feature Model

The capacity that computer can solve more complex design problem was gradually increased. Bridge designs need a breakthrough in the current development limitations, and then become more intelligent and integrated. This paper proposes a new parametric and feature-based computer aided design (CAD) models which can represent families of bridge objects, includes knowledge representation, three-dimensional geometric topology relationships. The realization of a family member is found by solving first the geometric constraints, and then the topological constraints. From the geometric solution, constraint equations are constructed. Topology solution is developed by feature dependencies graph between bridge objects. Finally, feature parameters are proposed to drive bridge design with feature parameters. Results from our implementation show that the method can help to facilitate bridge design.     

Analysis and Application for Integrity Model on Trusted Platform

To build a trusted platform based on Trusted Computing Platform Alliance (TCPA)‘s recommendation, we analyze the integrity mechanism for such a PC platform in this paper. By combinning access control model with information flow model, we put forward a combined process-based lattice model to enforce security. This model creates a trust chain by which we can manage a series of processes from a core root of trust module to some other application modules. In the model,once the trust chain is created and managed correctly,the integrity of the computer‘s hardware and sofware has been mainfained, so does the confidentiality and authenticity. Moreover, a relevant implementation of the model is explained.     

Cost of Multicast Logical Key Tree Based on Hierarchical Data Processing

How to design a multicast key management system with high performance is a hot issue now. This paper will apply the idea of hierarchical data processing to construct a common analytic model based on directed logical key tree and supply two important metrics to this problem： re-keying cost and key storage cost. The paper gives the basic theory to the hierarchical data processing and the analyzing model to multieast key management based on logical key tree. It has been proved that the 4-ray tree has the best performance in using these metrics. The key management problem is also investigated based on user probability model, and gives two evaluating parameters to re-keying and key storage cost.     

Graph rigidity and localization of multi-robot formations

This paper provides theoretical foundation tor the problem ot localization in multi-robot formations. Sufficient and necessary conditions for completely localizing a formation of mobile robots/vehicles in SE(2) based on distributed sensor networks and graph rigidity are proposed. A method for estimating the quality of localizations via a linearized weighted least-squares algorithm is presented, which considers incomplete and noisy sensory information. The approach in this paper had been implemented in a multi-robot system of five car-like robots equipped with omni-directional cameras and IEEE 802.11b wireless network.     

A new provably-secure key agreement protocol for roaming in mobile networks

Protocols for authentication and key establishment have special requirements in a wireless environment. This paper presents a new key agreement protocol HAKA （home server aided key agreement） for roaming scenario. It is carried out by a mobile user and a foreign server with the aid of a home server, which provides all necessary authentications of the three parties. The session key can be obtained by no one except for the mobile user and the foreign server. HAKA is based on Diffie-Hellman key exchange and a secure hash function without using any asymmetric encryption. The protocol is proved secure in Canetti-Krawczyk （CK） model.