249 resultados para Pareto-optimal solutions
Resumo:
The structure of time dependent jets in rotating fluids using similarity transformations is studied theoretically for which exact solutions are discussed. Approximate solution using a modified yon Mises transformation is also explored.
Resumo:
Exact multinomial solutions of the beach equation for shallow water waves on a uniformly sloping beach are found and related to solution of the same equation found earlier by other investigators, using integral transform techniques. The use of these solutions for a general initialvalue problem for the equation under investigation is briefly discussed.
Resumo:
We consider the problem of estimating the optimal parameter trajectory over a finite time interval in a parameterized stochastic differential equation (SDE), and propose a simulation-based algorithm for this purpose. Towards this end, we consider a discretization of the SDE over finite time instants and reformulate the problem as one of finding an optimal parameter at each of these instants. A stochastic approximation algorithm based on the smoothed functional technique is adapted to this setting for finding the optimal parameter trajectory. A proof of convergence of the algorithm is presented and results of numerical experiments over two different settings are shown. The algorithm is seen to exhibit good performance. We also present extensions of our framework to the case of finding optimal parameterized feedback policies for controlled SDE and present numerical results in this scenario as well.
Resumo:
Tie-lines between the corundum and spinel solid solutions have been determined experimentally at 1823 K. Next, activities of FeCr2O4 and FeAl2O4 in the spinel solid solution were determined by combining the tie-line data with literature values for the activities of Cr2O3 and Al2O3 in the corundum phase. Activities and the Gibbs energy of mixing for the spinel solid solution were also obtained from a model based on cation distribution between nonequivalent crystallographic sites in the oxide lattice. The difference between the Gibbs energy of mixing obtained experimentally and from the model has been attributed to a strain enthalpy term which is relatively unchanged in magnitude from the reported at 1373 K. The integral enthalpy of mixing obtained from experimental data at 1373 and 1823 K using the second law is compared with the model result.
Resumo:
The unsteady pseudo plane motions have been investigated in which each point of the parallel planes is subjected to non-torsional oscillations in their own plane and at any given instant the streamlines are concentric circles. Exact solutions are obtained and the form of the curve , the locus of the centers of these concentric circles, is discussed. The existence of three infinite sets of exact solutions, for the flow in the geometry of an orthogonal rheometer in which the above non-torsional oscillations are superposed on the disks, is established. Three cases arise according to whether is greater than, equal to or less than , where is angular velocity of the basic rotation and is the frequency of the superposed oscillations. For a symmetric solution of the flow these solutions reduce to a single unique solution. The nature of the curve is illustrated graphically by considering an example of the flow between coaxial rotating disks.
Resumo:
The flow of a micropolar fluid in an orthogonal rheometer is considered. It is shown that an infinite number of exact solutions characterizing asymmetric motions are possible. The expressions for pressure in the fluid, the components of the forces and couples acting on the plates are obtained. The effect of microrotation on the flow is brought out by considering numerical results for the case of coaxially rotating disks.
Resumo:
In this paper, we consider the bi-criteria single machine scheduling problem of n jobs with a learning effect. The two objectives considered are the total completion time (TC) and total absolute differences in completion times (TADC). The objective is to find a sequence that performs well with respect to both the objectives: the total completion time and the total absolute differences in completion times. In an earlier study, a method of solving bi-criteria transportation problem is presented. In this paper, we use the methodology of solvin bi-criteria transportation problem, to our bi-criteria single machine scheduling problem with a learning effect, and obtain the set of optimal sequences,. Numerical examples are presented for illustrating the applicability and ease of understanding.
Resumo:
The coefficients of thermal expansion reported by Worlton et al. [6] in the case of zircon are given in Table II along with the present data. Although Oql > or• in both cases, the anisotropy is more marked in the case of DyV04. From Table II, it is clear that the coefficient of volume expansion (,6) is almost the same for both compounds.
Resumo:
In a letter RauA proposed a new method for designing statefeedback controllers using eigenvalue sensitivity matrices. However, there appears to be a conceptual mistake in the procedure, or else it is unduly restricted in its applicability. In particular the equation — BR~lBTK = A/.I, in which K is a positive-definite symmetric matrix.
Resumo:
Cooperative relay communication in a fading channel environment under the orthogonal amplify-and-forward (OAF), nonorthogonal and orthogonal selection decode-and-forward (NSDF and OSDF) protocols is considered here. The diversity-multiplexing gain tradeoff (DMT) of the three protocols is determined and DMT-optimal distributed space-time (ST) code constructions are provided. The codes constructed are sphere decodable and in some instances incur minimum possible delay. Included in our results is the perhaps surprising finding that the orthogonal and the nonorthogonal amplify-and-forward (NAF) protocols have identical DMT when the time durations of the broadcast and cooperative phases are optimally chosen to suit the respective protocol. Moreover our code construction for the OAF protocol incurs less delay. Two variants of the NSDF protocol are considered: fixed-NSDF and variable-NSDF protocol. In the variable-NSDF protocol, the fraction of time occupied by the broadcast phase is allowed to vary with multiplexing gain. The variable-NSDF protocol is shown to improve on the DMT of the best previously known static protocol when the number of relays is greater than two. Also included is a DMT optimal code construction for the NAF protocol.
Resumo:
The problem of learning correct decision rules to minimize the probability of misclassification is a long-standing problem of supervised learning in pattern recognition. The problem of learning such optimal discriminant functions is considered for the class of problems where the statistical properties of the pattern classes are completely unknown. The problem is posed as a game with common payoff played by a team of mutually cooperating learning automata. This essentially results in a probabilistic search through the space of classifiers. The approach is inherently capable of learning discriminant functions that are nonlinear in their parameters also. A learning algorithm is presented for the team and convergence is established. It is proved that the team can obtain the optimal classifier to an arbitrary approximation. Simulation results with a few examples are presented where the team learns the optimal classifier.
Resumo:
A closed-loop steering logic based on an optimal (2-guidance is developed here. The guidance system drives the satellite launch vehicle along a two- or three- dimensional trajectory for placing the payload into a specified circular orbit. The modified g-guidance algorithm makes use of the optimal required velocity vector, which minimizes the total impulse needed for an equivalent two-impluse transfer from the present state to the final orbit. The required velocity vector is defined as velocity of the vehicle on the hypothetical transfer orbit immediately after the application of the first impulse. For this optimal transfer orbit, a simple and elegant expression for the Q-matrix is derived. A working principle for the guidance algorithm in terms of the major and minor cycles, and also for the generation of the steering command, is outlined.
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:
This paper proposes a novel application of differential evolution to solve a difficult dynamic optimisation or optimal control problem. The miss distance in a missile-target engagement is minimised using differential evolution. The difficulty of solving it by existing conventional techniques in optimal control theory is caused by the nonlinearity of the dynamic constraint equation, inequality constraint on the control input and inequality constraint on another parameter that enters problem indirectly. The optimal control problem of finding the minimum miss distance has an analytical solution subject to several simplifying assumptions. In the approach proposed in this paper, the initial population is generated around the seed value given by this analytical solution. Thereafter, the algorithm progresses to an acceptable final solution within a few generations, satisfying the constraints at every iteration. Since this solution or the control input has to be obtained in real time to be of any use in practice, the feasibility of online implementation is also illustrated.
Resumo:
A new class of exact solutions of plane gasdynamic equations is found which describes piston-driven shocks into non-uniform media. The governing equations of these flows are taken in the coordinate system used earlier by Ustinov, and their similarity form is determined by the method of infinitesimal transformations. The solutions give shocks with velocities which either decay or grown in a finite or infinite time depending on the density distribution in the ambient medium, although their strength remains constant. The results of the present study are related to earlier investigations describing the propagation of shocks of constant strength into non-uniform media.