Search results for "Quadrat"
showing 10 items of 344 documents
Applying fuzzy Particle Swarm Optimization to Multi-unit Double Auctions
2010
Abstract In the context of Quadratic Programming Problems, we use a fuzzy Particle Swarm Optimization (PSO) algorithm to analyze a Multi-unit Double Auction (MDA) market. We give also a Linear Programming (LP) based upper bound to help the decision maker in dealing with constraints in the mathematical model. In the computational study, we evaluate our algorithm and show that it is a feasible approach for processing bids and calculating assignments.
Relaxed Stability and Performance LMI Conditions for Takagi-Sugeno Fuzzy Systems With Polynomial Constraints on Membership Function Shapes
2008
Most linear matrix inequality (LMI) fuzzy control results in literature are valid for any membership function, i.e., independent of the actual membership shape. Hence, they are conservative (with respect to other nonlinear control approaches) when specific knowledge of the shapes is available. This paper presents relaxed LMI conditions for fuzzy control that incorporate such shape information in the form of polynomial constraints, generalizing previous works by the authors. Interesting particular cases are overlap (product) bounds and ellipsoidal regions. Numerical examples illustrate the achieved improvements, as well as the possibilities of solving some multiobjective problems. The result…
Efficient Redundancy Reduced Subgroup Discovery via Quadratic Programming
2012
Subgroup discovery is a task at the intersection of predictive and descriptive induction, aiming at identifying subgroups that have the most unusual statistical (distributional) characteristics with respect to a property of interest. Although a great deal of work has been devoted to the topic, one remaining problem concerns the redundancy of subgroup descriptions, which often effectively convey very similar information. In this paper, we propose a quadratic programming based approach to reduce the amount of redundancy in the subgroup rules. Experimental results on 12 datasets show that the resulting subgroups are in fact less redundant compared to standard methods. In addition, our experime…
A bilateral convergent bounding technique for plastic deformations
1990
For the class of elastic perfectly plastic discrete structures, subjected to a dynamic loading history, a bilateral bounding technique for plastic deformations has been studied. The computation of the bound is founded on the concept that to obtain it, any history of fictitious plastic deformations can be used, if only admissible. Such history is obtained by solving a sequence of linear programming problems (LPPs) with a multiple step compared to the step of the sequence of the quadratic programming problems (QPPs) adopting in the classic elasto-plastic analysis. The constraints of the LPPs coincide with the constraints of the QPPs, while the objective function is a linear combination of var…
A Memetic Algorithm for Binary Image Reconstruction
2008
This paper deals with a memetic algorithm for the reconstruction of binary images, by using their projections along four directions. The algorithm generates by network flows a set of initial images according to two of the input projections and lets them evolve toward a solution that can be optimal or close to the optimum. Switch and compactness operators improve the quality of the reconstructed images which belong to a given generation, while the selection of the best image addresses the evolution to an optimal output.
Branch-and-Bound
2010
We now turn to the discussion of how to solve the linear ordering problem to (proven) optimality. In this chapter we start with the branch-and-bound method which is a general procedure for solving combinatorial optimization problems. In the subsequent chapters this approach will be realized in a special way leading to the so-called branch-and-cut method. There are further possibilities for solving the LOP exactly, e.g. by formulating it as dynamic program or as quadratic assignment problem, but these approaches did not lead to the implementation of practical algorithms and we will not elaborate on them here.
Integral binary Hamiltonian forms and their waterworlds
2018
We give a graphical theory of integral indefinite binary Hamiltonian forms $f$ analogous to the one by Conway for binary quadratic forms and the one of Bestvina-Savin for binary Hermitian forms. Given a maximal order $\mathcal O$ in a definite quaternion algebra over $\mathbb Q$, we define the waterworld of $f$, analogous to Conway's river and Bestvina-Savin's ocean, and use it to give a combinatorial description of the values of $f$ on $\mathcal O\times\mathcal O$. We use an appropriate normalisation of Busemann distances to the cusps (with an algebraic description given in an independent appendix), and the $\operatorname{SL}_2(\mathcal O)$-equivariant Ford-Voronoi cellulation of the real …
ChemInform Abstract: LOCATION OF TRANSITION STATES AND STABLE INTERMEDIATES BY MINIMAX/MINIMI OPTIMIZATION OF SYNCHRONOUS TRANSIT PATHWAYS
1983
The MINIMAX/MINIMI concept for the location of transition states and/or stable intermediates of chemical reactions is introduced, based on the synchronous transit method. According to this strategy, minimization of quadratic synchronous transit path maxima or minima is achieved by constrained exhaustive optimization of internal coordinates. The method and its efficiency are demonstrated for two-dimensional model surfaces as well as for thermally allowed electrocyclic interconversions of cyclopropyl-/allyl-cation and cyclobutene-/butadiene (gauche) within the framework of MNDO-SCF calculations. Thus, in both cases a direct comparison with the exact solution determined by minimization of the …
Parameter optimization for amplify-and-forward relaying with imperfect channel estimation
2009
Cooperative diversity is a promising technology for future wireless networks. In this paper, we consider a cooperative communication system operating in an amplify-and-forward (AF) mode with an imperfectly-known relay fading channel. It is assumed that a pilot symbol assisted modulation (PSAM) scheme with linear minimum mean square estimator (LMMSE) is used for the channel estimation. A simple and easy-to-evaluate asymptotical upper bound (AUB) of the symbol-error-rate (SER) is derived for uncoded AF cooperative systems with quadrature amplitude modulation (QAM) constellations. Based on the AUB, we propose a criterion for the choice of parameters in the PSAM scheme, i.e., the pilot spacing …
Lower bounds for eigenvalues of a quadratic form relative to a positive quadratic form
1968
Abstract : A method is presented for the calculation of lower bounds to eigenvalues of operators that arise from variational problems for one quadratic form relative to a positive definite quadratic form. Eigenvalue problems of this kind occur, for example, in the theory of buckling of continuous linear elastic systems. The technique used is a modification of one introduced earlier, (1) sections II and IVB, for the determination of lower bounds to eigenvalues of semi-bounded self-adjoint operators. Other methods for the latter problem can be carried over without essential changes. The particular difficulty in the case we consider is that some operators which enter the calculation for the lo…