共查询到20条相似文献,搜索用时 31 毫秒
1.
Chatchawit Aporntewan Prabhas Chongstitvatana 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(6):541-548
This paper presents a study of building blocks (BBs) in the context of genetic algorithms (GAs). In GAs literature, the BBs
are common structures of high-quality solutions. The aim is to identify and maintain the BBs while performing solution recombination.
To identify the BBs, we construct an
simultaneity matrix according to a set of
-bit solutions. The matrix element in row i and column j denoted by m
ij
is the degree of dependency between bit i and bit j. We search for a partition of
for the matrix. The main idea of partitioning is to put i and j of which m
ij
is significantly high in the same partition subset. The partition represents the bit positions of BBs. The partition is exploited
in solution recombination so that the bits governed by the same partition subset are passed together. It can be shown that
by exploiting the simultaneity matrix the additively decomposable functions can be solved in a polynomial relationship between
the number of function evaluations required to reach the optimum and the problem size. A comparison to the Bayesian optimization
algorithm (BOA) is made. Empirical results show that the BOA uses less number of function evaluations than that of our algorithm.
However, computing the matrix is ten times faster than constructing the Bayesian network. 相似文献
2.
This paper deals with multidimensional systems, for example, systems described by linear, constant coefficient partial differential/difference
equations. In the behavioral approach, the notion of interconnection is the basis of control. In this setting, feedback interconnection
of systems is based on the still more fundamental concept of regular interconnection, which has been introduced by J.C. Willems.
The dual problem of regular interconnection is the one of direct sum decomposition. The following two problems are addressed:
given a behavior and one of its sub-behaviors , under what conditions does there exist another sub-behavior such that has finite dimension and has finite codimension with respect to i.e. we treat the direct sum decomposition of up to finite-dimensional behaviors, which, in this context, are considered negligible. The second related problem concerns
regular interconnections and reads as follows: given a plant behavior together with a desired behavior, find, if possible,
another behavior (a controller) such that the interconnection is regular and has finite codimension with respect to the given
desired behavior. A constructive solution to the problems is provided for two-dimensional behaviors. 相似文献
3.
Xueling Ma Jianming Zhan Yang Xu 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2007,11(11):1079-1087
In this paper, we introduce the notions of interval valued -fuzzy filters and interval valued -fuzzy Boolean (implicative) filters in R
0-algebras and investigate some of their related properties. Some characterization theorems of these generalized fuzzy filters
are derived. In particular, we prove that an interval valued fuzzy set F in R
0-algebras is an interval valued -fuzzy Boolean filter if and only if it is an interval valued -fuzzy implicative filter. 相似文献
4.
Jiří Močkoř 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(6):591-596
We investigate interpretations of formulas ψ in a first order fuzzy logic in models which are based on objects of a category SetR(Ω) which consists of Ω-sets, i.e. sets with similarity relations with values in a complete MV-algebra Ω and with morphisms
defined as special fuzzy relations between Ω-sets. The interpretations are then morphisms in a category SetR(Ω) from some Ω-set to the object . We define homomorphisms between models in a category SetR(Ω) and we prove that if is a (special) homomorphism of models in a category SetR(Ω) then there is a relation between interpretations of a formula ψ in models .
Supported by MSM6198898701, grant 201/07/0191 of GAČR and grant 1M0572. 相似文献
5.
The dynamics of Unmanned Aerial Vehicles (UAVs) is nonlinear and subject to external disturbances. The scope of this paper is the test of an \({\mathcal{L}_1}\) adaptive controller as autopilot inner loop controller candidate. The selected controller is based on piecewise constant adaptive laws and is applied to a mini-UAV. Navigation outer loop parameters are regulated via PID control. The main contribution of this paper is to demonstrate that the proposed control design can stabilize the nonlinear system, even if the controller parameters are selected starting from a decoupled linear model. The main advantages of this technique are: (1) the controller can be implemented for both linear and nonlinear systems without parameter adjustment or tuning procedure, (2) the controller is robust to unmodeled dynamics and parametric model uncertainties. The design scheme of a customized autopilot is illustrated and different configurations (in terms of mass, inertia and airspeed variations) are analyzed to validate the presented approach. 相似文献
6.
Sylvia Pulmannová 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(11):1081-1087
An MV-pair is a BG-pair (B; G) (where B is a Boolean algebra and G is a subgroup of the automorphism group of B) satisfying certain conditions. Recently, it was proved by Jenca that, given an MV-pair (B; G), the quotient where is an equivalence relation naturally associated with G, is an MV-algebra, and conversely, to every MV-algebra there corresponds an MV-pair. In this paper, we introduce a new definition
of so called MV*-pair, and we show that is an effect algebra iff the first of the defining properties of the MV*-pair is satisfied, while the second property guarantees
the MV-algebra structure of . We also study some relations between states on MV-algebras and the corresponding R-generated Boolean algebras.
This work was supported by Science and Technology Assistance Agency under the contract no. LPP-0199-07 and no. APVV-0071-06,
grant VEGA 2/6088/26 and Center of excellence SAS CEPI–Physics of Information–I/2/2005. 相似文献
7.
Radomír Halaš Michal Botur 《Soft Computing - A Fusion of Foundations, Methodologies and Applications》2009,13(11):1063-1072
Hájek introduced the logic enriching the logic BL by a unary connective vt which is a formalization of Zadeh’s fuzzy truth value “very true”. algebras, i.e., BL-algebras with unary operations, called vt-operators, which are among others subdiagonal, are an algebraic counterpart of Partially ordered commutative integral residuated monoids (pocrims) are common generalizations of both BL-algebras and Heyting
algebras. The aim of our paper is to introduce and study algebraic properties of pocrims endowed by “very-true” and “very-false”-like
operators.
Research is supported by the Research and Development Council of Czech Government via project MSN 6198959214. 相似文献
8.
Yvon Maday 《Journal of scientific computing》2006,28(2-3):451-458
In this paper, we propose a numerical approach for the derivation of a stable approximation in L -norm of a solution to div(Y) = f for in two dimensions. The derivation of this result is based on preliminary stability results in Fourier approximationtheory that are interesting by themselves. Numerical simulation sustain the proof of the theorem. 相似文献
9.
In this paper we deepen Mundici's analysis on reducibility of the decision problem from infinite-valued ukasiewicz logic
to a suitable m-valued ukasiewicz logic
m , where m only depends on the length of the formulas to be proved. Using geometrical arguments we find a better upper bound for the least integer m such that a formula is valid in
if and only if it is also valid in
m. We also reduce the notion of logical consequence in
to the same notion in a suitable finite set of finite-valued ukasiewicz logics. Finally, we define an analytic and internal sequent calculus for infinite-valued ukasiewicz logic. 相似文献
10.
11.
We consider robust adaptive control designs for relative degree one, minimum phase linear systems of known high frequency gain. The designs are based on the dead-zone and projection modifications, and we compare their performance w.r.t. a worst case transient cost functional with a penalty on the
∞ norm of the output, control and control derivative. We establish two qualitative results. If a bound on the
∞ norm of the disturbance is known and the known a priori bound on the uncertainty level is sufficiently conservative, then it is shown that a dead-zone controller outperforms a projection controller. The complementary result shows that the projection controller is superior to the dead-zone controller when the a priori information on the disturbance level is sufficiently conservative. 相似文献
12.
The sample path constructability problem for Discrete Event Systems (DES) involves the observation of a sample path under a particular parameter value
of the system with the requirement to concurrently construct multiple sample paths of the DES under different values using only information available along the given sample path. This allows the on-line estimation of performance measures
, not available in closed form, over a range of values of
. We present a sample path coupling approach that solves the problem without imposing any restrictions on the event processes in the system. A specific time warping algorithm is described and its performance is analyzed in terms of computational cost. Our approach is illustrated through a number of simulation results. 相似文献
13.
Remco Duits Michael Felsberg Gösta Granlund Bart ter Haar Romeny 《International Journal of Computer Vision》2007,72(1):79-102
Inspired by the early visual system of many mammalians we consider the construction of-and reconstruction from- an orientation
score
as a local orientation representation of an image,
. The mapping
is a wavelet transform
corresponding to a reducible representation of the Euclidean motion group onto
and oriented wavelet
. This wavelet transform is a special case of a recently developed generalization of the standard wavelet theory and has the
practical advantage over the usual wavelet approaches in image analysis (constructed by irreducible representations of the
similitude group) that it allows a stable reconstruction from one (single scale) orientation score. Since our wavelet transform
is a unitary mapping with stable inverse, we directly relate operations on orientation scores to operations on images in a
robust manner.
Furthermore, by geometrical examination of the Euclidean motion group
, which is the domain of our orientation scores, we deduce that an operator Φ on orientation scores must be left invariant
to ensure that the corresponding operator
on images is Euclidean invariant. As an example we consider all linear second order left invariant evolutions on orientation
scores corresponding to stochastic processes on G. As an application we detect elongated structures in (medical) images and automatically close the gaps between them.
Finally, we consider robust orientation estimates by means of channel representations, where we combine robust orientation
estimation and learning of wavelets resulting in an auto-associative processing of orientation features. Here linear averaging
of the channel representation is equivalent to robust orientation estimation and an adaptation of the wavelet to the statistics
of the considered image class leads to an auto-associative behavior of the system.
The Netherlands Organization for Scientific Research is gratefully acknowledged for financial support. This work has been
supported by EC Grant IST-2003-004176 COSPAL. 相似文献
14.
G. E. Stavroulakis M. A. Tzaferopoulos 《Structural and Multidisciplinary Optimization》1994,7(3):160-169
The theory of optimal plastic design of structures via optimality criteria (W. Prager approach) transforms the optimal design problem into a certain nonlinear elastic structural analysis problem with appropriate stress-strain laws, which are derived by the adopted specific cost function for the members of the structure and which generally have complete vertical branches. Moreover, the concept of structural universe (introduced by G.I.N. Rozvany) permits us to tackle complicated optimal layout problems.On the other hand, a significant effort in the field of nonsmooth mechanics has recently been devoted to the solution of structural analysis problems with complete material and boundary laws, e.g. stress-strain laws or reaction-displacement laws with vertical branches.In this paper, the problem of optimal plastic design and layout of structures following the approach of Prager-Rozvany is revised within the framework of recent progress in the area of nonsmooth structural analysis and it is treated by means of techniques primarily developed for the solution of inequality mechanics problems. The problem of the optimal layout of trusses is used here as a model problem. The introduction of general convex, continuous and piecewise linear specific cost functions for the structural members leads to the formulation of linear variational inequalities or equivalent piecewise linear, convex but nonsmooth optimization problems. An algorithm exploiting the particular structure of the minimization problem is then described for the numerical solution. Thus, practical structural optimization problems of large size can be treated. Finally, numerical examples illustrate the applicability and the advantages of the method.On leave from the Institute of Applied Mechanics, Department of Engineering Sciences, Technical University of Crete, GR-73100 Chania, Greece 相似文献
15.
In this work, we consider the problem of solving , , where b
(k+1) = f(x
(k)). We show that when A is a full matrix and , where depends on the specific software and hardware setup, it is faster to solve for by explicitly evaluating the inverse matrix A
−1 rather than through the LU decomposition of A. We also show that the forward error is comparable in both methods, regardless of the condition number of A. 相似文献
16.
Fully discrete potential-based finite element methods called methods are used to solve a transient eddy current problem in a three-dimensional convex bounded polyhedron. Using methods, fully discrete coupled and decoupled numerical schemes are developed. The existence and uniqueness of solutions
for these schemes together with the energy-norm error estimates are provided. To verify the validity of both schemes, some
computer simulations are performed for the model from TEAM Workshop Problem 7.
This work was supported by Postech BSRI Research Fund-2009, National Basic Research Program of China (2008CB425701), NSFC
under the grant 10671025 and the Key Project of Chinese Ministry of Education (No. 107018). 相似文献
17.
In multi-objective design optimization, it is quite desirable to obtain solutions that are multi-objectively optimum and insensitive to uncontrollable (noisy) parameter variations. We call such solutions robust Pareto solutions. In this paper we present a method to measure the multi-objective sensitivity of a design alternative, and an approach to use such a measure to obtain multi-objectively robust Pareto optimum solutions. Our sensitivity measure does not require a presumed probability distribution of uncontrollable parameters and does not utilize gradient information; therefore, it is applicable to multi-objective optimization problems that have non-differentiable and/or discontinuous objective functions, and also to problems with large parameter variations. As a demonstration, we apply our robust optimization method to an engineering example, the design of a vibrating platform. We show that the solutions obtained for this example are indeed robust. 相似文献
18.
DNA self-assembly is a promising paradigm for nanotechnology. In this paper we study the problem of finding tile systems of
minimum size that assemble a given shape in the Tile Assembly Model, defined by Rothemund and Winfree (Proceedings of the
thirty-second annual ACM symposium on theory of computing, 2000). We present a tile system that assembles an rectangle in asymptotically optimal time. This tile system has only 7 tiles. Earlier constructions need at least 8 tiles (Chen et al. Proceedings of symposium
on discrete algorithms, 2004). We managed to reduce the number of tiles without increasing the assembly time. The new tile
system works at temperature 3. The new construction was found by the combination of exhaustive computerized search of the
design space and manual adjustment of the search output. 相似文献
19.
Optimization of rotor blades for combined structural,dynamic, and aerodynamic properties 总被引:1,自引:1,他引:0
A helicopter is intrinsically interdisciplinary due to the close coupling among aerodynamics, dynamics, and the blade structural details. Therefore a design optimization with proper interactions among appropriate disciplines (such as structure, dynamics, and aerodynamics) can offer significant benefit to improve rotor performance. This paper studies the integration of structure, dynamics, and aerodynamics in design optimization of helicopter rotor blades. The optimization is performed to minimize the rotor power required and to satisfy design requirements from structure (minimum blade weight and safe stress margin and fatigue life) and dynamics (proper placement of blade natural frequencies and free of flutter). An effort is made to formulate an effective strategy for combining these various requirements in the optimization process. The paper also presents a way for an intelligent phasing of this interdisciplinary optimization to overcome the hurdles due to conflicting demands on the design variables which arise from different disciplines.Notation
nondimensional leading edge mass size, = a/R
-
C
T
rotor thrust coefficient
-
C
P
rotor power coefficient
-
nondimensional chord,
=c/R
-
nondimensional lumped mass size,
=d/R
-
F(x)
objective function
-
G
j
(x)
j-th inequality constraint function
-
H
j
(x)
j-th equality constraint function
-
R
blade radius, meters
-
nondimensional blade radial coordinate,
=r/R
-
nondimensional web thickness,
=s
1/R
-
nondimensional web thickness,
=s
2/R
-
t
nondimensional flange thickness,
=t/R
- x
vector of design variables
-
x
i
i-th component of vector of design variables
-
blade pitch angle 相似文献
20.
We consider the problem of computing Byzantine Agreement in a synchronous network with n processors, each with a private random string, where each pair of processors is connected by a private communication line.
The adversary is malicious and non-adaptive, i.e., it must choose the processors to corrupt at the start of the algorithm.
Byzantine Agreement is known to be computable in this model in an expected constant number of rounds. We consider a scalable
model where in each round each uncorrupt processor can send to any set of log n other processors and listen to any set of log n processors. We define the loss of an execution to be the number of uncorrupt processors whose output does not agree with the output of the majority of uncorrupt
processors. We show that if there are t corrupt processors, then any randomised protocol which has probability at least 1/2 + 1/ logn of loss less than requires at least f rounds. This also shows that lossless protocols require both rounds, and for at least one uncorrupt processor to send messages during the protocol. 相似文献