This paper carries out a further cryptanalysis of two Lorenz-based masking secure communication systems, which have been recently attacked by a high-pass filter. As demonstrated with our simulations, high-pass filter ...
详细信息
This paper carries out a further cryptanalysis of two Lorenz-based masking secure communication systems, which have been recently attacked by a high-pass filter. As demonstrated with our simulations, high-pass filter attack works well only when the covered information signal is monotonic. However, with an adaptive observer, it is still possible to coarsely obtain the information signal and correctly identify the system user-defined parameters if a multitonic information signal is transmitted,, making the security of these two systems questionable.
In this paper, a class of fuzzy finite automata corresponding to the Mealy type of ordinary automata is formulated, and also two types of statewise equivalence relations are introduced. From the equivalence relations,...
详细信息
In this paper, a class of fuzzy finite automata corresponding to the Mealy type of ordinary automata is formulated, and also two types of statewise equivalence relations are introduced. From the equivalence relations, a minimal form is defined and a minimization algorithm of the Mealy type of fuzzy finite automata is obtained. (C) 2003 Elsevier B.V. All rights reserved.
In this study, we consider a concept of complete L-fuzzy matrix, define complete lattice-valued finite automata (CLFAs) and study their properties. The definitions of statewise equivalence relations and automata equiv...
详细信息
In this study, we consider a concept of complete L-fuzzy matrix, define complete lattice-valued finite automata (CLFAs) and study their properties. The definitions of statewise equivalence relations and automata equivalence relations of a CLFA are given, two algorithms are aimed at the minimization of states of a CLFA. (c) 2006 Elsevier Inc. All rights reserved.
The estimation of a concentration-dependent diffusion coefficient in a drying process is known as an inverse coefficient problem. The solution is sought wherein the space-average concentration is known as function of ...
详细信息
The estimation of a concentration-dependent diffusion coefficient in a drying process is known as an inverse coefficient problem. The solution is sought wherein the space-average concentration is known as function of time (mass loss monitoring). The problem is stated as the minimization of a functional and gradient-based algorithms are used to solve it. Many numerical and experimental examples that demonstrate the effectiveness of the proposed approach are presented. Thin slab drying was carried out in an isothermal drying chamber built in our laboratory. The diffusion coefficients of fructose obtained with the present method are compared with existing literature results. (c) 2006 Elsevier Ltd. All rights reserved.
In an attempt to find a novel catalyst system for atom transfer radical polymerization (ATRP), a parameter estimation method based on nonlinear regression was developed to evaluate various catalyst systems by determin...
详细信息
In an attempt to find a novel catalyst system for atom transfer radical polymerization (ATRP), a parameter estimation method based on nonlinear regression was developed to evaluate various catalyst systems by determining kinetic parameters of polymerization. From our model system considering small molecular atom transfer addition reaction, we found that equilibrium constant of atom transfer reaction could be successfully determined using our parameter estimation method. However, the each value of activation rate constant and deactivation reaction constant is hard to be determined ubiquitously because of the poor sensitivities of them and the local minima trapping. By applying second minimization algorithm, the parameter estimation algorithm achieves higher propensity to reach global minimum, yet not all the time. The simulation results using kinetic rate constants determined by our method shows better agreement with the experimental data than that using literature values. This is because the current method uses fewer assumptions than other literature methods in determining rate constants. We also demonstrated the determination of kinetic constants in the polymerization of styrene and MMA using various metal catalysts, and the simulations using these kinetic constants agree well with the experimental data.
It is shown that the static output feedback stabilization problem for linear multi-input single-output (MISO) systems can be posed as a concave-convex programming problem. This allows the potential design of minimizat...
详细信息
ISBN:
(纸本)0780383354
It is shown that the static output feedback stabilization problem for linear multi-input single-output (MISO) systems can be posed as a concave-convex programming problem. This allows the potential design of minimization algorithms yielding a stabilizing static output feedback gain, if it exists, or showing that the problem is not solvable at all.
This paper proposes a new method for systematic construction of dynamic pre-compensators to achieve better diagonal dominance. Curve fitting is used to construct a dynamic pre-compensator element-by-element, meaning u...
详细信息
ISBN:
(纸本)0780383354
This paper proposes a new method for systematic construction of dynamic pre-compensators to achieve better diagonal dominance. Curve fitting is used to construct a dynamic pre-compensator element-by-element, meaning unlike most minimization algorithms, there is no restriction on the structure of each element. To demonstrate its effectiveness, the method is applied to the Rolls-Royce Spey gas-turbine engine, which is a highly interacting and multivariable system.
We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the com...
详细信息
We investigate well-structured graph-driven parity-FBDDs, which strictly generalize the two well-known models parity OBDDs and well-structured graph-driven FBDDs. The first main result is a characterization of the complexity of Boolean functions represented by well-structured graph-driven parity-FBDDs in terms of invariants of the function represented and the graph-ordering used. As a consequence, we derive a lower bound criterion and prove an exponential lower bound for certain linear code functions. The second main result of this paper is a polynomial time algorithm that minimizes the number of nodes in a graph-driven parity-FBDD.
Variational principles with nonlinear complementarity and finite-dimensional nonlinear complementarity models for three-dimensional frictional contact problems are established. The existence and uniqueness of the solu...
详细信息
Variational principles with nonlinear complementarity and finite-dimensional nonlinear complementarity models for three-dimensional frictional contact problems are established. The existence and uniqueness of the solutions to the finite-dimensional models are proved. A minimum principle is developed and a minimization algorithm is presented. Numerical calculation shows that the algorithm is highly efficient, reliable and promising.
暂无评论