63 resultados para Maximum Conservative Care
Resumo:
The paper deals with the approximate analysis of non-linear non-conservative systems oftwo degrees of freedom subjected to step-function excitation. The method of averaging of Krylov and Bogoliubov is used to arrive at the approximate equations for amplitude and phase. An example of a spring-mass-damper system is presented to illustrate the method and a comparison with numerical results brings out the validity of the approach.
Resumo:
This paper deals with an approximate method of analysis of non-linear, non-conservative systems of two degrees of freedom. The approximate equations for amplitude and phase are obtained by a generalized averaging technique based on the ultraspherical polynomial approximation. The method is illustrated by an example of a spring-mass-damper system.
Resumo:
Some improvements are suggested to Schroeder's scheme [J. Acoust. Soc. Am. 57, 149–150 (1975)] of achieving diffuse sound reflection in concert halls.Subject Classification
Resumo:
The transmitted signal is assumed to consist of a close succession of rectangular pulses of equal width. A matched filter scheme is employed and a theory is developed for a computer-aided optimization of the envelope of monotone compact signals for maximum rejection of dense clutter of any given distribution in range. Specific results are presented and indeterminate cases are discussed.
Resumo:
A d-dimensional box is a Cartesian product of d closed intervals on the real line. The boxicity of a graph is the minimum dimension d such that it is representable as the intersection graph of d-dimensional boxes. We give a short constructive proof that every graph with maximum degree D has boxicity at most 2D2. We also conjecture that the best upper bound is linear in D.
An approximate analysis of non-linear non-conservative systems subjected to step function excitation
Resumo:
This paper deals with the approximate analysis of the step response of non-linear nonconservative systems by the application of ultraspherical polynomials. From the differential equations for amplitude and phase, set up by the method of variation of parameters, the approximate solutions are obtained by a generalized averaging technique based on ultraspherical polynomial expansions. The Krylov-Bogoliubov results are given by a particular set of these polynomials. The method has been applied to study the step response of a cubic spring mass system in presence of viscous, material, quadratic, and mixed types of damping. The approximate results are compared with the digital and analogue computer solutions and a close agreement has been found between the analytical and the exact results.
Resumo:
A fast algorithm for the computation of maximum compatible classes (mcc) among the internal states of an incompletely specified sequential machine is presented in this paper. All the maximum compatible classes are determined by processing compatibility matrices of progressingly diminishing order, whose total number does not exceed (p + m), where p is the largest cardinality among these classes, and m is the number of such classes. Consequently the algorithm is specially suitable for the state minimization of very large sequential machines as encountered in vlsi circuits and systems.
Resumo:
It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.
Resumo:
A molecular dynamics study of model ions in water is reported. The van der Waals diameter of both the cations and anions is varied. We have carried out two sets of simulations-with and without dispersion interaction-between the ion and water. Self-diffusivity of the ions exhibits an anomalous maximum as a function of the van der Waals diameter for both these sets. This existence of a maximum in self-diffusivity when there is no dispersion interaction between the ion and the water is attributed to the attractive term from electrostatic interactions. Detailed analysis of this effect shows that the solvent shell is more strongly defined in the presence of dispersion interactions. A smaller ion exhibits biexponential decay while a single exponential decay is seen for the ion with maximum diffusivity in the self-part of the intermediate scattering function. The solvent structure around the ion appears to determine much of the dynamics of the ion. Interesting trends are seen in the activation energies and these can be understood in terms of the levitation effect. (C) 2010 American Institute of Physics. doi:10.1063/1.3481656]
Resumo:
The superconducting transition temperatures in Bi2Ca1−xLnxSr2Cu2O8+δ, TlCa1−xLnxSr2Cu2O6+δ, and Tl0.8Ca1−xLnxBa2Cu23O6+δ (Ln=Y or rare earth) vary with composition and show a maximum at a specific value of x or δ. This observation suggests that an optimal carrier concentration is required to attain maximum Tc in such cuprates which seem to be two‐band systems
Resumo:
Impedance matrix and transfer matrix methods are often used in the analysis of linear dynamical systems. In this paper, general relationships between these matrices are derived. The properties of the impedance matrix and the transfer matrix of symmetrical systems, reciprocal systems and conservative systems are investigated. In the process, the following observations are made: (a) symmetrical systems are not a subset of reciprocal systems, as is often misunderstood; (b) the cascading of reciprocal systems again results in a reciprocal system, whereas cascading of symmetrical systems does not necessarily result in a symmetrical system; (c) the determinant of the transfer matrix, being ±1, is a property of both symmetrical systems and reciprocal systems, but this condition, however, is not sufficient to establish either the reciprocity or the symmetry of the system; (d) the impedance matrix of a conservative system is skew-Hermitian.
Resumo:
A 4 A electron-density map of Pf1 filamentous bacterial virus has been calculated from x-ray fiber diffraction data by using the maximum-entropy method. This method produces a map that is free of features due to noise in the data and enables incomplete isomorphous-derivative phase information to be supplemented by information about the nature of the solution. The map shows gently curved (banana-shaped) rods of density about 70 A long, oriented roughly parallel to the virion axis but slewing by about 1/6th turn while running from a radius of 28 A to one of 13 A. Within these rods, there is a helical periodicity with a pitch of 5 to 6 A. We interpret these rods to be the helical subunits of the virion. The position of strongly diffracted intensity on the x-ray fiber pattern shows that the basic helix of the virion is right handed and that neighboring nearly parallel protein helices cross one another in an unusual negative sense.
Resumo:
A feedforward network composed of units of teams of parameterized learning automata is considered as a model of a reinforcement teaming system. The internal state vector of each learning automaton is updated using an algorithm consisting of a gradient following term and a random perturbation term. It is shown that the algorithm weakly converges to a solution of the Langevin equation implying that the algorithm globally maximizes an appropriate function. The algorithm is decentralized, and the units do not have any information exchange during updating. Simulation results on common payoff games and pattern recognition problems show that reasonable rates of convergence can be obtained.
Resumo:
Performance of space-time block codes can be improved using the coordinate interleaving of the input symbols from rotated M-ary phase shift keying (MPSK) and M-ary quadrature amplitude modulation (MQAM) constellations. This paper is on the performance analysis of coordinate-interleaved space-time codes, which are a subset of single-symbol maximum likelihood decodable linear space-time block codes, for wireless multiple antenna terminals. The analytical and simulation results show that full diversity is achievable. Using the equivalent single-input single-output model, simple expressions for the average bit error rates are derived over flat uncorrelated Rayleigh fading channels. Optimum rotation angles are found by finding the minimum of the average bit error rate curves.