In view of the defect and shortage in cutting path automatic optimization of 2D pattern pieces in current garment automatic cutter, a new optimization method of computer is explored. If there is no cutting path optimi...
详细信息
ISBN:
(纸本)9780878492435
In view of the defect and shortage in cutting path automatic optimization of 2D pattern pieces in current garment automatic cutter, a new optimization method of computer is explored. If there is no cutting path optimization implemented by garment automatic cutter before cutting, some problems will be caused, such as too much unless travel and too long processing time. At present, both at home and abroad, the studies on automatic optimization in cutting preprocessing are relatively weak. According to the "segment cutting from left to right" feature of automatic cutter in cutting process, an algorithm which can be summarized as "segment and reducing point" was proposed. This algorithm combined with the solution of shortest path problem, its purpose is to seek for the approximate optimal solution of cutting path. The algorithm implemented through Visual C++ 6.0 programming. Used in production by enterprise shows that the program is simple to operate, and has a high compute speed. A veragely, unless travel in cutting process reduced more than 10%. It proves that the algorithm is feasible and efficient. Using this algorithm achieved the purpose of reducing unless travel, improving cutting efficiency and lowering the cost.
Various approaches for incorporating prior system knowledge into adaptive filtering algorithms exist, e. g., using constrained adaptation. Moreover, also the basic setup of the adaptation problem, e. g., whether it is...
详细信息
ISBN:
(纸本)9781424497218
Various approaches for incorporating prior system knowledge into adaptive filtering algorithms exist, e. g., using constrained adaptation. Moreover, also the basic setup of the adaptation problem, e. g., whether it is supervised or blind, can be considered as prior system knowledge. In this paper, we consider a systematic approach to incorporate such deterministic prior knowledge in broadband adaptive MIMO systems by optimizing the coefficients in arbitrary partly smooth manifolds. The resulting generic set of update equations explicitly shows all the available degrees of freedom for a top-down algorithm design. Using practically relevant examples, we show how both well-known and novel algorithms for various applications can be derived using the framework.
Every Boolean function can be presented as a logical formula in conjunctive normal form. Fast algorithm for conjunction plays significant role in overall algorithm for computing arbitrary Boolean function. First, we p...
详细信息
ISBN:
(纸本)9783642135224
Every Boolean function can be presented as a logical formula in conjunctive normal form. Fast algorithm for conjunction plays significant role in overall algorithm for computing arbitrary Boolean function. First, we present a quantum query algorithm for conjunction of two bits. Our algorithm uses one quantum query and correct result is obtained with a probability p = 4/5, that improves the previous result. Then, we present the main result - generalization of our approach to design efficient quantum algorithms for computing conjunction of two Boolean functions. Finally, we demonstrate another kind of an algorithm for conjunction of two bits, that has a correct answer probability p = 9/10. This algorithm improves success probability by 10%, but stands aside and cannot be extended to compute conjunction of Boolean functions.
In this paper we address the problem of symbolic control design of nonlinear control systems with infinite states specifications, modelled by differential equations. An algorithm for the design of symbolic controllers...
详细信息
ISBN:
(纸本)9781424477456
In this paper we address the problem of symbolic control design of nonlinear control systems with infinite states specifications, modelled by differential equations. An algorithm for the design of symbolic controllers is presented, which integrates the construction of the discrete abstractions of the plant and of the specification with the design of the controller. This integrated algorithm reduces the space complexity of the control design computations, as formally discussed in the paper and further illustrated through an illustrative example.
University of Minnesota M.S. thesis. December ***: Aerospace Engineering and mechanics. Advisor:DemozGebre-Egziabher. 1 computer file (PDF); ix, 74pages.%%%%Personal navigation concerns the tracking of humanbeings via...
详细信息
University of Minnesota M.S. thesis. December ***: Aerospace Engineering and mechanics. Advisor:DemozGebre-Egziabher. 1 computer file (PDF); ix, 74pages.%%%%Personal navigation concerns the tracking of humanbeings via devices carried or worn by individuals and presents aunique set of challenges in regards to navigation system andalgorithm design. Many conventional position ˉxing and deadreckoning approaches tend to perform poorly given the requirementsfor personal navigation, which may consider GNSS-deniedenvironments, a wide, highly dynamic range of motion, and low-costand small form-factor sensor limitations. A novel approach toassisting or augmenting other navigation algorithms by employing akinetic model of human gait is presented in this thesis. Thekinetic model in concert with a single-axis accelerometer is shownhere to comprise a virtual sensor capable of providing step sizeestimates in-situ for straight forward walking. Furthermore, thecombination of the kinetic model and accelerometer yields anavigation solution of comparable or better performance whencompared to a step counting dead reckoning approach. The derivationof this model is discussed, details of the experiments are given,and results are shown
This paper provide new developments in the design of observers for a class of nonlinear systems with unknown inputs whose nonlinear functions satisfy Lipschitz condition. The proposed methods guarantee the error syste...
详细信息
ISBN:
(纸本)9781627481199
This paper provide new developments in the design of observers for a class of nonlinear systems with unknown inputs whose nonlinear functions satisfy Lipschitz condition. The proposed methods guarantee the error system stability without requiring the rank condition and also yield many additional degrees of freedom available to the designer. The algorithms for designing a nonlinear observer for the nonlinear systems with unknown inputs is precisely derived. The proposed observers may be used for the state estimation and fault diagnosis. A nonlinear mass-spring-damper model is given in order to highlight the efficiency of the proposed method.
The paper addresses a problem of design of distributed robust filters using the recent vector dissipativity theory. The main result is a sufficient condition which guarantees a suboptimal H_(infinity) level of disagre...
详细信息
ISBN:
(纸本)9781424474264
The paper addresses a problem of design of distributed robust filters using the recent vector dissipativity theory. The main result is a sufficient condition which guarantees a suboptimal H_(infinity) level of disagreement of estimates in a network of filters. The condition is formulated in terms of feasibility of certain linear matrix inequalities (LMIs). It provides a tractable algorithm for the design of interconnection gains for a network of distributed robust observers. The proposed approach is applied to the problem of observer-based robust synchronization of a nonlinear network to an isolated node.
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system is optimized. This problem is difficu...
详细信息
ISBN:
(纸本)9780982657119
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system is optimized. This problem is difficult because the search space is very large: the number of possible coalition structures increases exponentially with the number of agents. Although several algorithms have been proposed to tackle this Coalition Structure Generation (CSG) problem, all of them suffer from being inherently centralized, which leads to the existence of a performance bottleneck and a single point of failure. In this paper, we develop the first decentralized algorithm for solving the CSG problem optimally. In our algorithm, the necessary calculations are distributed among the agents, instead of being carried out centrally by a single agent (as is the case in all the available algorithms in the literature). In this way, the search can be carried out in a much faster and more robust way, and the agents can share the burden of the calculations. The algorithm combines, and improves upon, techniques from two existing algorithms in the literature, namely DCVC [5] and IP [9], and applies novel techniques for filtering the input and reducing the inter-agent communication load.
A multi-objective genetic algorithm for the design of biorthogonal filter banks for embedded image coding application is presented. To be effective, the filter bank would satisfy multiple requirements related to such ...
详细信息
ISBN:
(纸本)9781424456499
A multi-objective genetic algorithm for the design of biorthogonal filter banks for embedded image coding application is presented. To be effective, the filter bank would satisfy multiple requirements related to such application. Flexibility in the design is introduced by imposing Near Perfect Reconstruction (N-PR) condition instead of entire PR condition as in conventional designs. Especially for embedded coding purposes, the filter banks are designed to be near-orthogonal. This can only be made possible by minimizing the deviation from the orthogonality in the optimization process. The optimization problem is formulated as a constrained multi-objective problem and solved using a constrained Non-dominated sorting genetic algorithm (C-NSGA) by searching solutions that achieve the best compromise between the different objective criteria, these solutions are known as Pareto Optimal Solutions. Experiment results show that our designed filter banks lead to improved performances of image coding compared to those achieved by the 9/7 filter bank of JPEG2000.
We consider a waveform-agile sensing algorithm for designing transmitted waveforms in rapidly-varying radar scenes to improve target detection performance. Specifically, we first track the scattering function of rapid...
详细信息
ISBN:
(纸本)9781424429707
We consider a waveform-agile sensing algorithm for designing transmitted waveforms in rapidly-varying radar scenes to improve target detection performance. Specifically, we first track the scattering function of rapidly-varying sea clutter in low signal-to-clutter ratios (SCRs) at each burst by estimating the clutter's space-time covariance matrix. Simultaneously, we schedule the waveform to be transmitted in the next burst by minimizing the sea clutter influence based on the estimated clutter statistics. The effectiveness of our waveform-agile sensing approach is demonstrated by detecting a moving target in heavy sea clutter using configured waveforms, and then comparing the resulting performance to that of detecting the target using fixed-parameter linear frequency-modulated waveforms.
暂无评论