首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 134 毫秒
1.
In this paper, positive-real systems under lossless positive-real transformations are investigated. Let G(s) be the transfer function matrix of a continuous-time positive-real system of order n and F(s) a lossless transfer function of order nF. We prove here that the lossless positive-real transformed system, i.e. G(F(s)), is also positive-real. Furthermore, the stochastic balanced representation of positive-real systems under lossless positive-real transformations is considered. In particular, it is proved that the positive-real characteristic values πj of G(F(s)) are the same of G(s) each with multiplicity nF, independently from the choice of F(s). This property is exploited in the design of reduced order models based on stochastic balancing. Finally, the proposed technique is a passivity preserving model order reduction method, since it is proven that the reduced order model of G(F(s)) is still positive-real. An error bound for truncation related to the invariants πj is also derived.  相似文献   

2.
An algorithm for constructing a black box model of the sinusoidal input/steady-state response behavior of nonlinear time-invariant systems over a set of frequencies and amplitudes is presented. It is assumed that the steady-state response is periodic of the same fundamental frequency as the excitation, and that the Fourier coefficients are continuous functions of amplitude and square-integrable functions of frequency. The algorithm converges, in a mean-square sense, to an exact representation of the first N harmonics of the steady-state response minus its d.c. component. The model constructed by the algorithm admits a relatively simple physical realization characterized by 2NM+1 linear dynamic elements, and N(2M+1)+1 nonlinear static elements. The underlying mathematical structure of the model is an orthogonal series expansion relative to time whose coefficients are themselves truncated orthogonal expansions relative to frequency. Here M, the number of harmonics used for frequency interpolation, is determined by the algorithm. Of the N(2M+1)+1 memoryless nonlinearities which characterize the model, N of these are specified ahead of time (Tchebysheff polynomials), and 2NM+1 are parameters which mold the representation to the specific system being modeled. Each of these functions of a single variable can be obtained in a pointwise manner directly from steady-state measurements. The algorithm was implemented on a digital computer, and forced versions of the classic equations of van der Pol and Duffing were run as examples. An additional analytic example of a frequency multiplier of prescribed bandwidth was also presented.  相似文献   

3.
An interpolation theorem for the p-norm model, 1⩽p⩽∞, of Salton, Fox, and Wu for extended Boolean document retrieval is stated and proven. This result asserts roughly that whenever two or more documents are similarly ranked at any two points along the p-continuum with respect to this model for either an AND or an OR query containing exactly two terms, then they are similarly ranked at all points in between. An analogous result can fail for queries with more than two terms and an example is given to show this.  相似文献   

4.
In this paper, we provide closed-form expressions for the symbol error probability of decode and forward cooperative diversity systems, when operating over independent but not necessarily identically distributed Nakagami-m fading channels. The results hold for arbitrary number of relays, and refer to the M-ary QAM and M-ary PSK modulations.  相似文献   

5.
For the linear statistical model y = Xb + e, X of full column rank estimates of b of the form (C + X′X)+X′y are studied, where C commutes with X′X and Q+ is the Moore-Penrose inverse of Q. Such estimators may have smaller mean square error, component by component than does the least squares estimator. It is shown that this class of estimators is equivalent to two apparently different classes considered by other authors. It is also shown that there is no C such that (C + X′X)+X′Y = My, in which My has the smallest mean square error, component by component. Two criteria, other than tmse, are suggested for selecting C. Each leads to an estimator independent of the unknown b and σ2. Subsequently, comparisons are made between estimators in which the C matrices are functions of a parameter k. Finally, it is shown for the no intercept model that standardizing, using a biased estimate for the transformed parameter vector, and retransforming to the original units yields an estimator with larger tmse than the least squares estimator.  相似文献   

6.
  相似文献   

7.
Determining an input matrix, i.e., locating predefined number of nodes (named “key nodes”) connected to external control sources that provide control signals, so as to minimize the cost of controlling a preselected subset of nodes (named “target nodes”) in directed networks is an outstanding issue. This problem arises especially in large natural and technological networks. To address this issue, we focus on directed networks with linear dynamics and propose an iterative method, termed as “L0-norm constraint based projected gradient method” (LPGM) in which the input matrix B is involved as a matrix variable. By introducing a chain rule for matrix differentiation, the gradient of the cost function with respect to B can be derived. This allows us to search B by applying probabilistic projection operator between two spaces, i.e., a real valued matrix space RN?×?M and a L0 norm matrix space RL0N×M by restricting the L0 norm of B as a fixed value of M. Then, the nodes that correspond to the M nonzero elements of the obtained input matrix (denoted as BL0) are selected as M key nodes, and each external control source is connected to a single key node. Simulation examples in real-life networks are presented to verify the potential of the proposed method. An interesting phenomenon we uncovered is that generally the control cost of scale free (SF) networks is higher than Erdos-Renyi (ER) networks using the same number of external control sources to control the same size of target nodes of networks with the same network size and mean degree. This work will deepen the understanding of optimal target control problems and provide new insights to locate key nodes for achieving minimum-cost control of target nodes in directed networks.  相似文献   

8.
  相似文献   

9.
A computer-aided method for simplification and identification of linear discrete systems via step-response matching is presented. Golub's algorithm for solving least-squares problem is used to find the optimum coefficients of the reduced model. The advantages of this method are (1) for model reduction, both the time response and frequency response within the bandwidth region of the reduced model are very close to those of the original system; and (2) for system identification, the identified model is very close to the original system. In the illustrative examples considered in this paper the results of the proposed method appear to be better than those of other methods in the current literature.  相似文献   

10.
Egghe’s three papers regarding the universal IR surface (2004, 2007, 2008) clearly represent an original and significant contribution to the IR evaluation literature. However, Egghe’s attempt to find a complete set of universal IR evaluation points (P,R,F,M) fell short of his goal: his universal IR surface equation did not suffice in and of itself, and his continuous extension argument was insufficient to find all the remaining points (quadruples). Egghe found only two extra universal IR evaluation points, (1,1,0,0) and (0,0,1,1), but it turns out that a total of 15 additional, valid, universal IR evaluation points exist. The gap first appeared in Egghe’s earliest paper and was carried into subsequent papers. The mathematical method used here for finding the additional universal IR evaluation points involves defining the relevance metrics P,R,F,M in terms of the Swets variables a,b,c,d. Then the maximum possible number of additional quadruples is deduced, and finally, all the invalid quadruples are eliminated so that only the valid, universal IR points remain. Six of these points may be interpreted as being continuous extensions of the universal IR surface, while the other nine points may be interpreted as being “off the universal IR surface.” This completely solves the problem of finding the maximum range possible of universal IR evaluation points.  相似文献   

11.
The rate of evaporation of electrons, νe, from a thoriated tungsten filament depends on the temperature T and on θ, the fraction of the surface covered by thorium atoms. The relation of νe to θ and T has been given by Brattain and Becker. From νe the change in contact potential V of the filament surface produced by the adsorbed thorium can be calculated by the Boltzmann equation. Knowing σ the number of thorium atoms per cm.3, the dipole moment M of each is given by V = 2τσM. By an equation already used for Cs films on tungsten, the 2-dimensional equation of state of the adsorbed film can be calculated from M. Then by Gibbs' adsorption equation the relation of the atom evaporation rate νa to θ and T can be determined. It is thus calculated that in the range from θ = 0.2 to θ = 0.6, νa varies in proportion to ?Hθ where H = 8.1 in good agreement with the value H = 7.8 given by Brattain and Becker's measurements. A recalculation of the data of numerous experiments in 1921–1923, using the new relations of νe to θ1 gives data on νa as a function of T and θ in good agreement with the values of νa calculated from νe.The diffusion coefficients of Th through tungsten crystals, along grain boundaries and over the free filament surface, are calculated. A theory is given for the cause of the variation in the surface diffusion coefficient with σ. The probable mechanism of the production of the metallic thorium within the filament is discussed. At 2400° the thorium which arrives at the surface along grain boundaries, for some unknown reason, does not spread out over the surface as it does at lower temperatures (1900–2100°).  相似文献   

12.
The work reported in Ref. (1), carried out on n-heptane from 273·16K to the critical point (under moderate pressures), is extended to five n-alkanes, benzene, mercury and water under saturation pressures and extended to much lower temperatures.Forty calculations of various thermodynamic quantities pertaining to the liquids here studied (648 points) are presented in Tables II-IV. All parameters and physical constants involved are presented in Table V. The Standard Percentage Errors (SPE) for all the calculations and the temperature ranges are given in Table VI. The grand average SPE for the 648 points is about one-third of 1%. Only one calculation (the temperature of water from 393·16 to 563·16 K) had an error greater than 1% (18 points).  相似文献   

13.
A new method for the calculation of time responses of lumped time invariant networks is presented. It is based on the numerical inversion of the Laplace transform and involves the computation of the frequency domain function at pre-assigned complex points and forming a weighted sum. The method exactly inverts a certain number of terms of the Taylor expansion of the time response and is thus equivalent to the methods used for the integration of differential equations. This equivalence is established on two examples. The order of integration can be changed between 1 and 46 without any difficulty. Additional properties resulting from the application of the numerical Laplace transform inversion are also discussed and some novel applications indicated.  相似文献   

14.
In this paper, a Generalized Cluster Centroid based Classifier (GCCC) and its variants for text categorization are proposed by utilizing a clustering algorithm to integrate two well-known classifiers, i.e., the K-nearest-neighbor (KNN) classifier and the Rocchio classifier. KNN, a lazy learning method, suffers from inefficiency in online categorization while achieving remarkable effectiveness. Rocchio, which has efficient categorization performance, fails to obtain an expressive categorization model due to its inherent linear separability assumption. Our proposed method mainly focuses on two points: one point is that we use a clustering algorithm to strengthen the expressiveness of the Rocchio model; another one is that we employ the improved Rocchio model to speed up the categorization process of KNN. Extensive experiments conducted on both English and Chinese corpora show that GCCC and its variants have better categorization ability than some state-of-the-art classifiers, i.e., Rocchio, KNN and Support Vector Machine (SVM).  相似文献   

15.
The paper is concerned with similarity search at large scale, which efficiently and effectively finds similar data points for a query data point. An efficient way to accelerate similarity search is to learn hash functions. The existing approaches for learning hash functions aim to obtain low values of Hamming distances for the similar pairs. However, these methods ignore the ranking order of these Hamming distances. This leads to the poor accuracy about finding similar items for a query data point. In this paper, an algorithm is proposed, referred to top k RHS (Rank Hash Similarity), in which a ranking loss function is designed for learning a hash function. The hash function is hypothesized to be made up of l binary classifiers. The issue of learning a hash function can be formulated as a task of learning l binary classifiers. The algorithm runs l rounds and learns a binary classifier at each round. Compared with the existing approaches, the proposed method has the same order of computational complexity. Nevertheless, experiment results on three text datasets show that the proposed method obtains higher accuracy than the baselines.  相似文献   

16.
Multi-label classification (MLC) has attracted many researchers in the field of machine learning as it has a straightforward problem statement with varied solution approaches. Multi-label classifiers predict multiple labels for a single instance. The problem becomes challenging with the increasing number of features, especially when there are many features and labels which depend on each other. It requires dimensionality reduction before applying any multi-label learning method. This paper introduces a method named FS-MLC (Feature Selection forMulti-Label classification using Clustering in feature-space). It is a wrapper feature selection method that uses clustering to find the similarity among features and example-based precision and recall as the metrics for feature rankings to improve the performance of the associated classifier in terms of sample-based measures. First, clusters are created for features considering them as instances then features from different clusters are selected as the representative of all the features for that cluster. It reduces the number of features as a single feature represents multiple features within a cluster. It neither requires any parameter tuning nor the user threshold for the number of features selected. Extensive experimentation is performed to evaluate the efficacy of these reduced features using nine benchmark MLC datasets on twelve performance measures. The results show an impressive improvement in terms of sample-based precision, recall, and f1-score with up to 23%-93% discarded features.  相似文献   

17.
This paper addresses the flow control design of a connection-oriented communication network from the robust control theory perspective. Network is modelled as a nth order discrete system whose first order model is obtained using the two-time scale property associated with the process. The proposed scheme is characterised by an equivalent control based discrete sliding mode design for the first order model which is applied to nth order systems through aggregation. Besides its design simplicity, the proposed method exhibits finite time convergence property for the states while applied to the full order system emulating the characteristics of terminal sliding mode in a certain way. Simulation results via Matlab and ns-2 validate the efficacy of the proposed algorithm as an effective flow controller for connection-oriented networks.  相似文献   

18.
Fast and catalyst-free cross-linking strategy is of great significance for construction of covalently cross-linked hydrogels. Here, we report the condensation reaction between o-phthalaldehyde (OPA) and N-nucleophiles (primary amine, hydrazide and aminooxy) for hydrogel formation for the first time. When four-arm poly(ethylene glycol) (4aPEG) capped with OPA was mixed with various N-nucleophile-terminated 4aPEG as building blocks, hydrogels were formed with superfast gelation rate, higher mechanical strength and markedly lower critical gelation concentrations, compared to benzaldehyde-based counterparts. Small molecule model reactions indicate the key to these cross-links is the fast formation of heterocycle phthalimidine product or isoindole (bis)hemiaminal intermediates, depending on the N-nucleophiles. The second-order rate constant for the formation of phthalimidine linkage (4.3 M−1 s−1) is over 3000 times and 200 times higher than those for acylhydrazone and oxime formation from benzaldehyde, respectively, and comparable to many cycloaddition click reactions. Based on the versatile OPA chemistry, various hydrogels can be readily prepared from naturally derived polysaccharides, proteins or synthetic polymers without complicated chemical modification. Moreover, biofunctionality is facilely imparted to the hydrogels by introducing amine-bearing peptides via the reaction between OPA and amino group.  相似文献   

19.
This paper presents a simple and efficient design method for cosine-modulated filter banks with prescribed stopband attenuation, passband ripple, and channel overlap. The method casts the design problem as a linear minimization of filter coefficients such that their value at ω=π/2M is 0.707, which results in a simpler, more direct design procedure. The weighted constrained least squares technique is exploited for designing the prototype filter for cosine modulation (CM) filter banks. Several design examples are included to show the increased efficiency and flexibility of the proposed method over the exiting methods. An application of the proposed method is considered in the area of sub-band coding of the ECG and speech signals.  相似文献   

20.
This paper investigates the effects of a magnetic field on the free convective flow of a viscous, incompressible, dissipative fluid through a porous medium, occupying a semi-infinite region of the space bounded by an infinite vertical and porous plate. The plate is subjected to a normal suction velocity and the heat flux at the plate is constant. The magnetic field is of uniform strength and is applied perpendicular to the plate. An analytical solution to the problem is obtained. The influence of the magnetic parameter (M) and permeability parameter (K) is discussed for the case of air (P = 0.71) when the plate is subjected to a constant suction velocity and is being cooled by free convection currents.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号