914 resultados para Approximation diophantienne simultanée
Resumo:
The microregion approximation explicit finite difference method is used to simulate cyclic voltammetry of an electrochemical reversible system in a three-dimensional thin layer cell with minigrid platinum electrode. The simulated CV curve and potential scan-absorbance curve were in very good accordance with the experimental results, which differed from those at a plate electrode. The influences of sweep rate, thickness of the thin layer, and mesh size on the peak current and peak separation were also studied by numerical analysis, which give some instruction for choosing experimental conditions or designing a thin layer cell. The critical ratio (1.33) of the diffusion path inside the mesh hole and across the thin layer was also obtained. If the ratio is greater than 1.33 by means of reducing the thickness of a thin layer, the electrochemical property will be far away from the thin layer property.
Resumo:
The influence of muffin-tin approximation on energy band gap was studied using LMTO-ASA (Linear Muffin-Tin Orbital-Atomic Sphere Approximation) approach. Since the diverse data are available for LaX(X=N, P, As, Sb), they are presented in our research as an example in order to test the reliability of our results. Four groups of muffin-tin radii were chosen, they were the fitted muffin-tin radii based on the optical properties of the crystals (the first), 1 : 1 for La : X(the second), 1.5 : 1 for La : X(the third), and a group of radii derived by making the charge in the interstitial space to be zero(the fourth). The results show that the fitted muffin-tin radii (the first group) give the best results compared with experimental values, and the predicted energy band gaps are very sensitive to the choice of muffin-tin radius in comparison with the other groups. The second and the third delivered results somewhere in between, while the fourth provided the worst results compared with the other groups. For the same crystal, with the increase of muffin-tin radius of lanthanum, the calculated energy band gaps decreased, going from semi-conductor to semimetal. This again clearly indicated the sensitivity of energy band structure on muffin-tin approximation.
Resumo:
Based on the effective medium approximation theory of composites, the empirical model proposed by Pandey and Kakar is remedied to investigate the microwave emissivity of sea surface under wave breaking driven by strong wind. In the improved model, the effects of seawater bubbles, droplets and difference in temperature of air and sea interface (DTAS) on the emissivity of sea surface covered by whitecaps are discussed. The model results indicate that the effective emissivity of sea surface increases with DTAS increasing, and the impacts of bubble structures and thickness of whitecaps layer on the emissivity are included in the model by introducing the effective dielectric constant of whitecaps layer. Moreover, a good agreement is obtained by comparing the model results with the Rose's experimental data.
Resumo:
Learning an input-output mapping from a set of examples can be regarded as synthesizing an approximation of a multi-dimensional function. From this point of view, this form of learning is closely related to regularization theory. In this note, we extend the theory by introducing ways of dealing with two aspects of learning: learning in the presence of unreliable examples and learning from positive and negative examples. The first extension corresponds to dealing with outliers among the sparse data. The second one corresponds to exploiting information about points or regions in the range of the function that are forbidden.
Resumo:
We present a constant-factor approximation algorithm for computing an embedding of the shortest path metric of an unweighted graph into a tree, that minimizes the multiplicative distortion.
Resumo:
Q. Shen and R. Jensen, 'Approximation-based feature selection and application for algae population estimation,' Applied Intelligence, vol. 28, no. 2, pp. 167-181, 2008. Sponsorship: EPSRC RONO: EP/E058388/1
Resumo:
Plakhov, A.Y.; Cruz, P., (2004) 'A stochastic approximation algorithm with step size adaptation', Journal of Mathematical Science 120(1) pp.964-973 RAE2008
Resumo:
The performance of a randomized version of the subgraph-exclusion algorithm (called Ramsey) for CLIQUE by Boppana and Halldorsson is studied on very large graphs. We compare the performance of this algorithm with the performance of two common heuristic algorithms, the greedy heuristic and a version of simulated annealing. These algorithms are tested on graphs with up to 10,000 vertices on a workstation and graphs as large as 70,000 vertices on a Connection Machine. Our implementations establish the ability to run clique approximation algorithms on very large graphs. We test our implementations on a variety of different graphs. Our conclusions indicate that on randomly generated graphs minor changes to the distribution can cause dramatic changes in the performance of the heuristic algorithms. The Ramsey algorithm, while not as good as the others for the most common distributions, seems more robust and provides a more even overall performance. In general, and especially on deterministically generated graphs, a combination of simulated annealing with either the Ramsey algorithm or the greedy heuristic seems to perform best. This combined algorithm works particularly well on large Keller and Hamming graphs and has a competitive overall performance on the DIMACS benchmark graphs.
Resumo:
In many practical situations, batching of similar jobs to avoid setups is performed while constructing a schedule. This paper addresses the problem of non-preemptively scheduling independent jobs in a two-machine flow shop with the objective of minimizing the makespan. Jobs are grouped into batches. A sequence independent batch setup time on each machine is required before the first job is processed, and when a machine switches from processing a job in some batch to a job of another batch. Besides its practical interest, this problem is a direct generalization of the classical two-machine flow shop problem with no grouping of jobs, which can be solved optimally by Johnson's well-known algorithm. The problem under investigation is known to be NP-hard. We propose two O(n logn) time heuristic algorithms. The first heuristic, which creates a schedule with minimum total setup time by forcing all jobs in the same batch to be sequenced in adjacent positions, has a worst-case performance ratio of 3/2. By allowing each batch to be split into at most two sub-batches, a second heuristic is developed which has an improved worst-case performance ratio of 4/3. © 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.
Resumo:
In this paper, we present some early work concerned with the development of a simple solid fuel combustion model incorporated within a Computational Fluid Dynamics (CFD) framework. The model is intended for use in engineering applications of fire field modeling and represents an extension of this technique to situations involving the combustion of solid cellulosic fuels. A simple solid fuel combustion model consisting of a thermal pyrolysis model, a six flux radiation model and an eddy-dissipation model for gaseous combustion have been developed and implemented within the CFD code CFDS-FLOW3D. The model is briefly described and demonstrated through two applications involving fire spread in a compartment with a plywood lined ceiling. The two scenarios considered involve a fire in an open and closed compartment. The model is shown to be able to qualitatively predict behaviors similar to "flashover"—in the case of the open room—and "backdraft"— in the case of the initially closed room.
Resumo:
We consider a knapsack problem to minimize a symmetric quadratic function. We demonstrate that this symmetric quadratic knapsack problem is relevant to two problems of single machine scheduling: the problem of minimizing the weighted sum of the completion times with a single machine non-availability interval under the non-resumable scenario; and the problem of minimizing the total weighted earliness and tardiness with respect to a common small due date. We develop a polynomial-time approximation algorithm that delivers a constant worst-case performance ratio for a special form of the symmetric quadratic knapsack problem. We adapt that algorithm to our scheduling problems and achieve a better performance. For the problems under consideration no fixed-ratio approximation algorithms have been previously known.
Resumo:
We develop a fully polynomial-time approximation scheme (FPTAS) for minimizing the weighted total tardiness on a single machine, provided that all due dates are equal. The FPTAS is obtained by converting an especially designed pseudopolynomial dynamic programming algorithm.
Resumo:
We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a –approximation algorithm that outputs a two-shipment schedule. We design a –approximation algorithm that finds schedules with at most three shipments, and this ratio cannot be improved, unless schedules with more shipments are created. This improvement is achieved due to a thorough analysis of schedules with two and three shipments by means of linear programming. We formulate problems of finding an optimal schedule with two or three shipments as integer linear programs and develop strongly polynomial algorithms that find solutions to their continuous relaxations with a small number of fractional variables
Resumo:
We study the two-machine flow shop problem with an uncapacitated interstage transporter. The jobs have to be split into batches, and upon completion on the first machine, each batch has to be shipped to the second machine by a transporter. The best known heuristic for the problem is a –approximation algorithm that outputs a two-shipment schedule. We design a –approximation algorithm that finds schedules with at most three shipments, and this ratio cannot be improved, unless schedules with more shipments are created. This improvement is achieved due to a thorough analysis of schedules with two and three shipments by means of linear programming. We formulate problems of finding an optimal schedule with two or three shipments as integer linear programs and develop strongly polynomial algorithms that find solutions to their continuous relaxations with a small number of fractional variables.