164 resultados para Successive linear programming
Resumo:
Non-linear natural vibration characteristics and the dynamic response of hingeless and fully articulated rotors of rectangular cross-section are studied by using the finite element method. In the formulation of response problems, the global variables are augmented with appropriate additional variables, facilitating direct determination of sub-harmonic response. Numerical results are given showing the effect of the geometric non-linearity on the first three natural frequencies. Response analysis of typical rotors indicates a possibility of substantial sub-harmonic response especially in the fully articulated rotors widely adopted in helicopters.
Resumo:
A novel thermistor-based temperature indicator using an RC oscillator and an up/down counter has been developed and described. The indicator provides linear performance over a wide dynamic temperature range of 0-100°C. This indicator is free from the error due to lead resistances of the thermistor and gives a maximum error of ±0 · 1°C in the range 0-100°C. Test results are given to support the theory.
Resumo:
Galerkin representations and integral representations are obtained for the linearized system of coupled differential equations governing steady incompressible flow of a micropolar fluid. The special case of 2-dimensional Stokes flows is then examined and further representation formulae as well as asymptotic expressions, are generated for both the microrotation and velocity vectors. With the aid of these formulae, the Stokes Paradox for micropolar fluids is established.
Resumo:
A model of root water extraction is proposed, in which a linear variation of extraction rate with depth is assumed. Five crops are chosen for simulation studies of the model, and soil moisture depletion under optimal conditions from different layers for each crop is calculated. Similar calculations are also made using the constant extraction rate model. Rooting depth is assumed to vary linearly with potential evapotranspiration for each crop during the vegetative phase. The calculated depletion patterns are compared with measured mean depletion patterns for each crop. It is shown that the constant extraction rate model results in large errors in the prediction of soil moisture depletion, while the proposed linear extraction rate model gives satisfactory results. Hypothetical depletion patterns predicted by the model in combination with a moisture tension-dependent sink term developed elsewhere are indicated.
Resumo:
The StreamIt programming model has been proposed to exploit parallelism in streaming applications oil general purpose multicore architectures. The StreamIt graphs describe task, data and pipeline parallelism which can be exploited on accelerators such as Graphics Processing Units (GPUs) or CellBE which support abundant parallelism in hardware. In this paper, we describe a novel method to orchestrate the execution of if StreamIt program oil a multicore platform equipped with an accelerator. The proposed approach identifies, using profiling, the relative benefits of executing a task oil the superscalar CPU cores and the accelerator. We formulate the problem of partitioning the work between the CPU cores and the GPU, taking into account the latencies for data transfers and the required buffer layout transformations associated with the partitioning, as all integrated Integer Linear Program (ILP) which can then be solved by an ILP solver. We also propose an efficient heuristic algorithm for the work-partitioning between the CPU and the GPU, which provides solutions which are within 9.05% of the optimal solution on an average across the benchmark Suite. The partitioned tasks are then software pipelined to execute oil the multiple CPU cores and the Streaming Multiprocessors (SMs) of the GPU. The software pipelining algorithm orchestrates the execution between CPU cores and the GPU by emitting the code for the CPU and the GPU, and the code for the required data transfers. Our experiments on a platform with 8 CPU cores and a GeForce 8800 GTS 512 GPU show a geometric mean speedup of 6.94X with it maximum of 51.96X over it single threaded CPU execution across the StreamIt benchmarks. This is a 18.9% improvement over it partitioning strategy that maps only the filters that cannot be executed oil the GPU - the filters with state that is persistent across firings - onto the CPU.
Resumo:
Plywood manufacture includes two fundamental stages. The first is to peel or separate logs into veneer sheets of different thicknesses. The second is to assemble veneer sheets into finished plywood products. At the first stage a decision must be made as to the number of different veneer thicknesses to be peeled and what these thicknesses should be. At the second stage, choices must be made as to how these veneers will be assembled into final products to meet certain constraints while minimizing wood loss. These decisions present a fundamental management dilemma. Costs of peeling, drying, storage, handling, etc. can be reduced by decreasing the number of veneer thicknesses peeled. However, a reduced set of thickness options may make it infeasible to produce the variety of products demanded by the market or increase wood loss by requiring less efficient selection of thicknesses for assembly. In this paper the joint problem of veneer choice and plywood construction is formulated as a nonlinear integer programming problem. A relatively simple optimal solution procedure is developed that exploits special problem structure. This procedure is examined on data from a British Columbia plywood mill. Restricted to the existing set of veneer thicknesses and plywood designs used by that mill, the procedure generated a solution that reduced wood loss by 79 percent, thereby increasing net revenue by 6.86 percent. Additional experiments were performed that examined the consequences of changing the number of veneer thicknesses used. Extensions are discussed that permit the consideration of more than one wood species.
Resumo:
Estimation of secondary structure in polypeptides is important for studying their structure, folding and dynamics. In NMR spectroscopy, such information is generally obtained after sequence specific resonance assignments are completed. We present here a new methodology for assignment of secondary structure type to spin systems in proteins directly from NMR spectra, without prior knowledge of resonance assignments. The methodology, named Combination of Shifts for Secondary Structure Identification in Proteins (CSSI-PRO), involves detection of specific linear combination of backbone H-1(alpha) and C-13' chemical shifts in a two-dimensional (2D) NMR experiment based on G-matrix Fourier transform (GFT) NMR spectroscopy. Such linear combinations of shifts facilitate editing of residues belonging to alpha-helical/beta-strand regions into distinct spectral regions nearly independent of the amino acid type, thereby allowing the estimation of overall secondary structure content of the protein. Comparison of the predicted secondary structure content with those estimated based on their respective 3D structures and/or the method of Chemical Shift Index for 237 proteins gives a correlation of more than 90% and an overall rmsd of 7.0%, which is comparable to other biophysical techniques used for structural characterization of proteins. Taken together, this methodology has a wide range of applications in NMR spectroscopy such as rapid protein structure determination, monitoring conformational changes in protein-folding/ligand-binding studies and automated resonance assignment.
Resumo:
State and parameter estimations of non-linear dynamical systems, based on incomplete and noisy measurements, are considered using Monte Carlo simulations. Given the measurements. the proposed method obtains the marginalized posterior distribution of an appropriately chosen (ideally small) subset of the state vector using a particle filter. Samples (particles) of the marginalized states are then used to construct a family of conditionally linearized system of equations and thus obtain the posterior distribution of the states using a bank of Kalman filters. Discrete process equations for the marginalized states are derived through truncated Ito-Taylor expansions. Increased analyticity and reduced dispersion of weights computed over a smaller sample space of marginalized states are the key features of the filter that help achieve smaller sample variance of the estimates. Numerical illustrations are provided for state/parameter estimations of a Duffing oscillator and a 3-DOF non-linear oscillator. Performance of the filter in parameter estimation is also assessed using measurements obtained through experiments on simple models in the laboratory. Despite an added computational cost, the results verify that the proposed filter generally produces estimates with lower sample variance over the standard sequential importance sampling (SIS) filter.
Resumo:
The non-linear equations of motion of a rotating blade undergoing extensional and flapwise bending vibration are derived, including non-linearities up to O (ε3). The strain-displacement relationship derived is compared with expressions derived by earlier investigators and the errors and the approximations made in some of those are brought out. The equations of motion are solved under the inextensionality condition to obtain the influence of the amplitude on the fundamental flapwise natural frequency of the rotating blade. It is found that large finite amplitudes have a softening effect on the flapwise frequency and that this influence becomes stronger at higher speeds of rotation.
Resumo:
A simple linear ramp control circuit, suitable for use with force-commutated thyrister circuits is discussed here. The circuit is based on only two IM 558 dual timer iCs, operating from a single 15 V supply. The reset terminals facilitate inhibition of the output of any stage. The use of this circuit in a thyristor chopper operating at 400 Hz 13 described.
Resumo:
A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.
Resumo:
The application of Gaussian Quadrature (GQ) procedures to the evaluation of i—E curves in linear sweep voltammetry is advocated. It is shown that a high degree of precision is achieved with these methods and the values obtained through GQ are in good agreement with (and even better than) the values reported in literature by Nicholson-Shain, for example. Another welcome feature with GQ is its ability to be interpreted as an elegant, efficient analytic approximation scheme too. A comparison of the values obtained by this approach and by a recent scheme based on series approximation proposed by Oldham is made and excellent agreement is shown to exist.
Resumo:
Self-tuning is applied to the minimum variance control of non-linear multivariable systems which can be characterized by a ' multivariable Hammerstein model '. It is also shown that such systems are not amenable to self-tuning control if control costing is to be included in the performance criterion.
Resumo:
This paper presents a constructive solution to the problem of designing a reduced-order Luenberger observer for linear systems subject to arbitrary unknown inputs.