共查询到20条相似文献,搜索用时 31 毫秒
1.
Cheetham R.P. Oommen B.J. Ng D.T.H. 《Knowledge and Data Engineering, IEEE Transactions on》1993,5(4):695-704
Consider a set A ={A 1,A 2 ,. . ., A n} of records, where each record is identified by a unique key. The records are accessed based on a set of access probabilities S =[s 1,s 2 ,. . ., s N] and are to be arranged lexicographically using a binary search tree (BST). If S is known a priori, it is well known that an optimal BST may be constructed using A and S . The case when S is not known a priori is considered. A new restructuring heuristic is introduced that requires three extra integer memory locations per record. In this scheme, the restructuring is performed only if it decreases the weighted path length (WPL) of the overall resultant tree. An optimized version of the latter method, which requires only one extra integer field per record has, is presented. Initial simulation results comparing this algorithm with various other static and dynamic schemes indicates that this scheme asymptotically produces trees which are an order of magnitude closer to the optimal one than those produced by many of the other BST schemes reported in the literature 相似文献
2.
A necessary and sufficient condition is presented for the solution of the row-by-row decoupling problem (known as Morgan's problem) in the general case, that is, without any restrictive assumption added to the system to the feedback law u =Fx +Gy (G may be noninvertible). This is a structural condition in terms of invariant lists of integers which are easily computable from a given state realization of the system. These integers are the infinite zero orders (Morse's list I 4) and the essential orders of the system, which only depend on the input-output behavior, and Morse's list I 2 of the system, which depends on the choice of a particular state realization 相似文献
3.
Considers the polynomial P (s )=t 0 S n+t 1 S n-1 +···+t n where 0<a j⩽t j⩽b j. Recently, V.L. Kharitonov (1978) derived a necessary and sufficient condition for this polynomial to have only zeros in the open left-half plane. Two lemmas are derived to investigate the existence of theorems similar to the theorem of Kharitonov. Using these lemmas, the theorem of Kharitonov is generalized for P(s) to have only zeros within a sector in the complex plane. The aperiodic case is also considered 相似文献
4.
A method is presented for the decomposition of the frequency domain of 2-D linear systems into two equivalent 1-D systems having dynamics in different directions and connected by a feedback system. It is shown that under some assumptions the decomposition problem can be reduced to finding a realizable solution to the matrix polynomial equation X (z 1)P (z 2 )+Q (z 1)Y (z 2 )=D (z 1, z 2). A procedure for finding a realizable solution X (z 1 ), Y (z 2) to the equation is given 相似文献
5.
The problem of tightly bounding and shaping the frequency responses of two objective functions T i(s )( i =1,2) associated with a closed-loop system is considered. It is proposed that an effective way of doing this is to minimize (or bound) the function max {∥T 1(s )∥ ∞, ∥T 2(s)∥∞} subject to internal stability of the closed-loop system. The problem is formulated as an H ∞ control problem, and an iterative solution is given 相似文献
6.
The problem of finding an internally stabilizing controller that minimizes a mixed H 2/H ∞ performance measure subject to an inequality constraint on the H ∞ norm of another closed-loop transfer function is considered. This problem can be interpreted and motivated as a problem of optimal nominal performance subject to a robust stability constraint. Both the state-feedback and output-feedback problems are considered. It is shown that in the state-feedback case one can come arbitrarily close to the optimal (even over full information controllers) mixed H 2/H ∞ performance measure using constant gain state feedback. Moreover, the state-feedback problem can be converted into a convex optimization problem over a bounded subset of (n ×n and n ×q , where n and q are, respectively, the state and input dimensions) real matrices. Using the central H ∞ estimator, it is shown that the output feedback problem can be reduced to a state-feedback problem. In this case, the dimension of the resulting controller does not exceed the dimension of the generalized plant 相似文献
7.
Frankl P.G. Weyuker E.J. 《IEEE transactions on pattern analysis and machine intelligence》1993,19(3):202-213
Several relationships between software testing criteria, each induced by a relation between the corresponding multisets of subdomains, are examined. The authors discuss whether for each relation R and each pair of criteria, C 1 and C 2 , R (C 1, C 2) guarantees that C 1 is better at detecting faults than C 2 according to various probabilistic measures of fault-detecting ability. It is shown that the fact that C 1 subsumes C 2 does not guarantee that C 1 is better at detecting faults. Relations that strengthen the subsumption relation and that have more bearing on fault-detecting ability are introduced 相似文献
8.
Let a family of polynomials be P (s )=t 0S n+t 1s n-1 . . .+t n where O <α j⩽t j⩽β. Recently, C.B. Soh and C.S. Berger have shown that a necessary and sufficient condition for this equation to have a damping ratio of φ is that the 2n+1 polynomials in it which have t k=αk or t k=βk have a damping ratio of φ. The authors derive a more powerful result requiring only eight polynomials to be Hurwitz for the equation to have a damping ratio of φ using Kharitonov's theorem for complex polynomials 相似文献
9.
Tang Z.-B. Pattipati K.R. Kleinman D.L. 《Automatic Control, IEEE Transactions on》1992,37(7):1042-1046
The distributed M -ary hypothesis testing problem of detecting one of M 0 events by an (N +1)-person hierarchical team, when the observations are correlated, is examined. In this problem, each of the N subordinate decision makers (DMs) transmits one of a prespecified set of messages based on their data to a primary decision maker who, in turn, combines the messages with his or her own data to make the final team decision. The necessary conditions for the optimal decision rules of the DMs are derived. A nonlinear Gauss-Seidel iterative algorithm is developed for the person-by-person optimal decision rules, and its monotonic convergence to the person-by-person optimum is established. A fast approximation algorithm is proposed for computing certain conditional probabilities arising in the person-by-person optimal decision rules. The algorithms are illustrated with several examples, and implications for distributed organizational designs are pointed out 相似文献
10.
Simultaneous controller design for linear time-invariant systems 总被引:1,自引:0,他引:1
The use of generalized sampled-data hold functions (GSHF) in the problem of simultaneous controller design for linear time-invariant plants is discussed. This problem can be stated as follows: given plants P 1, P 2, . . ., P N , find a controller C which achieves not only simultaneous stability, but also simultaneous optimal performance in the N given systems. By this, it is meant that C must optimize an overall cost function reflecting the closed-loop performance of each plant when it is regulated by C . The problem is solved in three aspects: simultaneous stabilization, simultaneous optimal quadratic performance, and simultaneous pole assignment in combination with simultaneous intersampling performance 相似文献
11.
The L 1 optimal control problem with rational controllers for continuous-time systems is considered in which it is shown that the optimal L 1 performance index with rational controllers is equal to that of irrational controllers. A sequence of rational controllers that approximates the optimal index is constructed. Convergence properties of such a sequence are studied. That the corresponding sequence of objective transfer functions is shown to converge in weak-* topology in BV (R +) in the time domain and uniformly in a wider sense in the frequency domain 相似文献
12.
It is proved that placing the poles of a linear time-invariant system arbitrarily far to the left of the imaginary axis is not possible if small perturbations in the model coefficients are taken into account. Given a nominal controllable system (A 0, B 0) with one input and at least two states and an open ball around B 0 (no matter how small), there exists a real number γ and a perturbation B within that ball such that for any feedback matrix K placing the eigenvalues of A 0+B 0K to the left of Res=γ, there is an eigenvalue of A 0+BK with real part not less than γ 相似文献
13.
Jau-Hsiung Huang Kleinrock L. 《Parallel and Distributed Systems, IEEE Transactions on》1993,4(3):306-317
The performance of job scheduling is studied in a large parallel processing system where a job is modeled as a concatenation of two stages which must be processed in sequence. P i is the number of processors required by stage P as the total number of processors in the system. A large parallel computing system is considered where Max(P 1, P 2)⩾P ≫1 and Max(P 1 , P 2)≫Min(P 1, P 2). For such systems, exact expressions for the mean system delay are obtained for various job models and disciplines. The results show that the priority should be given to jobs working on the stage which requires fewer processors. The large parallel system (i.e. P ≫1) condition is then relaxed to obtain the mean system time for two job models when the priority is given to the second stage. Moreover, a scale-up rule is introduced to obtain the approximated delay performance when the system provides more processors than the maximum number of processors required by both stages (i.e. P >Max(P 1, P 2)). An approximation model is given for jobs with more than two stages 相似文献
14.
The H 2-optimal control of continuous-time linear time-invariant systems by sampled-data controllers is discussed. Two different solutions, state space and operator theoretic, are given. In both cases, the H 2 sampled-data problem is shown to be equivalent to a certain discrete-time H 2 problem. Other topics discussed include input-output stability of sampled-data systems, performance recovery in digital implementation of analog controllers, and sampled-data control of systems with the possibility of multiple-time delays 相似文献
15.
The theorem states that every block square matrix satisfies its own m -D (m -dimensional, m ⩾1) matrix characteristic polynomial. The exact statement and a simple proof of this theorem are given. The theorem refers to a matrix A subdivided into m blocks, and hence having dimension at least m . The conclusion is that every square matrix A with dimension M satisfies several m -D characteristic matrix polynomials with degrees N 1 . . ., N m, such that N 1+ . . . +N m ⩽M 相似文献
16.
It is shown that H ∞ optimization is equivalent to weighted H 2 optimization in the sense that the solution of the latter problem also solves the former. The weighting rational matrix that achieves this equivalence is explicitly computed in terms of a state-space realization. The authors do not suggest transforming H ∞ optimization problems to H 2 optimization problems as a computational approach. Rather, their results reveal an interesting connection between H ∞ and H 2 optimization problems which is expected to offer additional insight. For example, H 2 optimal controllers are known to have an optimal observer-full state feedback structure. The result obtained shows that the minimum entropy solution of H ∞ optimal control problems can be obtained as an H 2 optimal solution. Therefore, it can be expected that the corresponding H ∞ optimal controller has an optimal observer-full state feedback structure 相似文献
17.
Let φ(s ,a )=φ0(s ,a )+ a 1φ1(s )+a 2 φ2(s )+ . . .+a kφ k(s )=φ0(s )-q(s , a ) be a family of real polynomials in s , with coefficients that depend linearly on parameters a i which are confined in a k -dimensional hypercube Ωa . Let φ0(s ) be stable of degree n and the φi(s ) polynomials (i ⩾1) of degree less than n . A Nyquist argument shows that the family φ(s ) is stable if and only if the complex number φ0(j ω) lies outside the set of complex points -q (j ω,Ωa) for every real ω. In a previous paper (Automat. Contr. Conf., Atlanta, GA, 1988) the authors have shown that -q (j ω,Ωa ), the so-called `-q locus', is a 2k convex parpolygon. The regularity of this figure simplifies the stability test. In the present paper they again exploit this shape and show that to test for stability only a finite number of frequency checks need to be done; this number is polynomial in k , 0(k 3), and these critical frequencies correspond to the real nonnegative roots of some polynomials 相似文献
18.
The problem of the stabilizing linear control synthesis in the presence of state and input bounds for systems with additive unknown disturbances is considered. The only information required about the disturbances is a finite convex polyhedral bound. Discrete- and continuous-time systems are considered. The property of positive D -invariance of a region is introduced, and it is proved that a solution of the problem is achieved by the selection of a polyhedral set S and the computation of a feedback matrix K such that S is positively D -invariant for the closed-loop system. It is shown that if polyhedral sets are considered, the solution involves simple linear programming algorithms. However, the procedure suggested requires a great amount of computational work offline if the state-space dimension is large, because the feedback matrix K is obtained as a solution of a large set of linear inequalities. All of the vertices of S are required 相似文献
19.
The worst-case effect of a disturbance system on the H 2 norm of the system is analyzed. An explicit expression is given for the worst-case H 2 norm when the disturbance system is allowed to vary over all nonlinear, time-varying and possibly noncausal systems with bounded L 2-induced operator norm. An upper bound for this measure, which is equal to the worst-case H 2 norm if the exogeneous input is scalar, is defined. Some further analysis of this upper bound is done, and a method to design controllers which minimize this upper bound over all robustly stabilizing controllers is given. The latter is done by relating this upper bound to a parameterized version of the auxiliary cost function studied in the literature 相似文献
20.
The solution of the l 1 sensitivity minimization problem is shown to have two properties which contrast markedly with properties of the solutions to the better-known H ∞ sensitivity minimization problem or the LQG (linear quadratic Gaussian) problem is given of a one-parameter family of first-order plants where the order of the l 1-optimal compensator can be arbitrarily large, and thus it is impossible to bound the order of an l 1-optimal compensator in terms of the order of the plant. A plant is considered which has a continuous one-parameter family of l 1-optimal compensators, and thus l 1-optimal compensators need not be unique. The author's two examples are considered to answer two questions left open by M.A. Daleh and J.B. Pearson (ibid., vol.32, p.314-23, 1987) 相似文献