Advanced Materials Research Vols. 760-762

Abstract: With the widespread use of watermark in video, audio and image, propose a relational database based watermark embedding and extraction method. The algorithm utilizes the singlemultiple mapping approach to plug in watermark, which scatter the distribution of watermark information and enhance the anti-attack ability of the algorithm. The experiments show that the method enjoys strong robustness to such attacks as tuples resorting, subset selection and so on.

Abstract: We consider a nonlinear system of two equations, describing the evolution of a stem cell population and the resulting white blood cell population. Two delays appear in this model to describe the cell cycle duration of the stem cell population and the time required to produce white blood cells. We establish sufficient conditions for the asymptotic stability of the unique nontrivial positive steady state of the model by analyzing roots of a second degree exponential polynomial characteristic equation with delay-dependent coefficients. We also prove the existence of Hopf bifurcations which leads to periodic solutions.

Abstract: Medical researchers seek to identify and predict profit (or effectiveness) potential in a new medicine B against a specified disease by comparing it to an existing medicine A, which has been used to treat the disease for many years, called medicine assessment. Applying traditional data mining techniques to the medicine assessment, one can discover patterns, such as A.X=a à B.Y=b, which are identified at the attribute-value level. These patterns are useful in predicting associated behaviors at the attribute-value level. However, to evaluate B against A, we have to obtain globally useful relations between B and A at an attribute level. Therefore, this paper proposes a group interaction approach for multiple data source discovery. Group interactions include, such as rules, differences, and links between datasets. These group interactions are discovered at the attribute level. For example, R(A.X, B.Y), where R is a relationship, or a predication. Some examples are presented for illustrating the use of the group interaction approach.

Abstract: We introduce basic theory of genetic algorithms in this paper, Build one hybrid genetic algorithms model base on genetic algorithms in solving product optimization problem. And we realize the model by software. The disposal result of real data tells us that the model has good practicability and accuracy to the problem of product optimization problem.

Abstract: Time Synchronization is a key technique which synchronizes the LPs (Logic processes) of PDES (Parallel and Discrete Event Simulation). After having described shortcomings of the existing algorithms for Time Synchronization, this thesis mainly proposes a new approach based on time dams. It introduces the concept of Time Dams Algorithm and presents its realization. Moreover, the performance of TD (Time Dams) Algorithm is compared with the one of TW (Time Warp) Algorithm through the use of PHOLD model in experiments. Finally, the experiment results state that TD performs better than TW under most conditions.

Abstract: The conversion between Tetrad Notation and other notational systems has attracted peoples attention; addition conjecture: if the maximum digit of base-N notation is (N-1), then (N-1)+(N-1) is a binary digit, whose most significant digit is 1 and least significant digit is (N-2); multiplication conjecture: if the maximum digit of base-N notation is (N-1), then (N-1)*(N-1) is a binary digit, whose most significant digit is (N-2) and least significant digit is 1; simple conversion conjecture: given, the radix of two sorts of number system N₁,N₂ are R₁ ,R₂ respectively_, i is an integer greater than 2 or equals to 2, so if R₁ = R₂ ⁱ , then some relatively simple relationship of conversion exists between these two number systems.

Abstract: The inertial navigation system error caused by sea current and log error greatly oscillates. In order to evaluate the effectiveness of damping attitude, the vehicles movement should be detected in real-time. For this reason, a novel adaptive level damped algorithm was presented in this paper. According to the characteristics of the movement of the ship, this algorithm has determined when to turn into the damp loop according to the change of acceleration. Theoretical analysis and Simulations results show that the adaptive level damped algorithm could damp most of the Schuler and Foucault oscillations period, and efficiently improve the precision of the PINS on ships.

Abstract: In this paper, a comprehensive evaluation model to human factors is presented for information systems. The model can be used in the evaluation that the number of evaluation expert for every evaluated object or target is different. By introducing the concept of Gini coefficients, the coordinated and balance degree of evaluated targets can also be reflected in the evaluation. The proposed model can be widely used because it contains the process of different types of index such as quantitative, qualitative, cost and benefit targets. The reliability and universality are validated by experiment results.

Abstract: The attribute weights determined is a key issue in the decision-making. Attribute weights given in the form of distribution of the attribute value to language assessment and rating their trust completely unknown or partially unknown circumstances, the proposed method of weight determination of the two based on objective evidence of differences between rights. Method one calculated based on the evidence of conflict between the coefficient weights; method to calculate the mean and variance of the research evidence weights. Finally, through the application of specific cases to verify the effectiveness of the method.

Abstract: The widely used routing algorithm performance metric of adaptiveness cannot precisely measure performance of routing algorithm. In this paper, we propose a new metric of routing pressure for measuring routing algorithm performance. It has higher precision of measuring routing algorithm performance than degree of adaptiveness. Performance of routing algorithm can be evaluated through routing pressure without simulation. It can explain why congestion takes place in network. In addition, where and when congestion takes place can be pointed out without simulation.