980 resultados para boolean polynomial


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A method is given for solving an optimal H2 approximation problem for SISO linear time-invariant stable systems. The method, based on constructive algebra, guarantees that the global optimum is found; it does not involve any gradient-based search, and hence avoids the usual problems of local minima. We examine mostly the case when the model order is reduced by one, and when the original system has distinct poles. This case exhibits special structure which allows us to provide a complete solution. The problem is converted into linear algebra by exhibiting a finite-dimensional basis for a certain space, and can then be solved by eigenvalue calculations, following the methods developed by Stetter and Moeller. The use of Buchberger's algorithm is avoided by writing the first-order optimality conditions in a special form, from which a Groebner basis is immediately available. Compared with our previous work the method presented here has much smaller time and memory requirements, and can therefore be applied to systems of significantly higher McMillan degree. In addition, some hypotheses which were required in the previous work have been removed. Some examples are included.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Computational Fluid Dynamics CFD can be used as a powerful tool supporting engineers throughout the steps of the design. The combination of CFD with response surface methodology can play an important role in such cases. During the conceptual engineering design phase, a quick response is always a matter of urgency. During this phase even a sketch of the geometrical model is rare. Therefore, the utilisation of typical response surface developed for congested and confined environment rather than CFD can be an important tool to help the decision making process, when the geometrical model is not available, provided that similarities can be considered when taking into account the characteristic of the geometry in which the response surface was developed. The present work investigates how three different types of response surfaces behave when predicting overpressure in accidental scenarios based on CFD input. First order, partial second order and complete second order polynomial expressions are investigated. The predicted results are compared with CFD findings for a classical offshore experiment conducted by British Gas on behalf of Mobil and good agreement is observed for higher order response surfaces. The higher order response surface calculations are also compared with CFD calculations for a typical offshore module and good agreement is also observed. © 2011 Elsevier Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a novel way to speed up the evaluation time of a boosting classifier. We make a shallow (flat) network deep (hierarchical) by growing a tree from decision regions of a given boosting classifier. The tree provides many short paths for speeding up while preserving the reasonably smooth decision regions of the boosting classifier for good generalisation. For converting a boosting classifier into a decision tree, we formulate a Boolean optimization problem, which has been previously studied for circuit design but limited to a small number of binary variables. In this work, a novel optimisation method is proposed for, firstly, several tens of variables i.e. weak-learners of a boosting classifier, and then any larger number of weak-learners by using a two-stage cascade. Experiments on the synthetic and face image data sets show that the obtained tree achieves a significant speed up both over a standard boosting classifier and the Fast-exit-a previously described method for speeding-up boosting classification, at the same accuracy. The proposed method as a general meta-algorithm is also useful for a boosting cascade, where it speeds up individual stage classifiers by different gains. The proposed method is further demonstrated for fast-moving object tracking and segmentation problems. © 2011 Springer Science+Business Media, LLC.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents an efficient algorithm for robust network reconstruction of Linear Time-Invariant (LTI) systems in the presence of noise, estimation errors and unmodelled nonlinearities. The method here builds on previous work [1] on robust reconstruction to provide a practical implementation with polynomial computational complexity. Following the same experimental protocol, the algorithm obtains a set of structurally-related candidate solutions spanning every level of sparsity. We prove the existence of a magnitude bound on the noise, which if satisfied, guarantees that one of these structures is the correct solution. A problem-specific model-selection procedure then selects a single solution from this set and provides a measure of confidence in that solution. Extensive simulations quantify the expected performance for different levels of noise and show that significantly more noise can be tolerated in comparison to the original method. © 2012 IEEE.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

© 2014 by ASME. Two types of foldable rings are designed using polynomial continuation. The first type of ring, when deployed, forms regular polygons with an even number of sides and is designed by specifying a sequence of orientations which each bar must attain at various stages throughout deployment. A design criterion is that these foldable rings must fold with all bars parallel in the stowed position. At first, all three Euler angles are used to specify bar orientations, but elimination is also used to reduce the number of specified Euler angles to two, allowing greater freedom in the design process. The second type of ring, when deployed, forms doubly plane-symmetric (irregular) polygons. The doubly symmetric rings are designed using polynomial continuation, but in this example a series of bar end locations (in the stowed position) is used as the design criterion with focus restricted to those rings possessing eight bars.