Search results for " Minimization"
showing 10 items of 107 documents
[MoO2(SCPh2CO2)2]2− and [MoO(SCPh2CO2)2]− anion complexes. A theoretical structure characterization
1995
Abstract Geometry optimization of [MoO 2 (SCH 2 CO 2 ) 2 ] 2− and [MoO(SCH 2 CO 2 ) 2 ] − systems as models of [MoO 2 (SCPh 2 CO 2 ) 2 ] 2− and [MoO(SCPh 2 CO 2 ) 2 ] − anion complexes have been carried out at STO-3G, 3-21G, LANL1MB and LANL2DZ basis set levels. A comparison of the theoretical results and X-ray experimental data has been performed. STO-3G minimal basis set produces the best geometrical agreement, in particular the distances and orientations of the different ligands linked to molybdenum transition metal. A large structural overlap with STO-3G optimized geometry and X-ray data has been found for the [MoO 2 (SCPh 2 CO 2 ) 2 ] 2− and [MoO(SCPh 2 CO 2 ) 2 ] − anion complexes.
Experimental investigation on high efficiency real-time control algorithms for IPMSMs
2014
This paper describes an experimental investigation on the power losses variations occurring in an Interior Permanent Magnet Synchronous Motor (IPMSM) with respect to the direct axis current component. Such investigation can be useful to determine a mathematical model accounting for copper, iron and mechanical friction losses, and for the arrangement of a speed control drive system equipped with a real-time power losses minimization algorithm. In particular, a test bench has been set up in order to carry out all measurements and the final power loss identification. The test bed is composed by a IPMSM drive with a field oriented control (FOC) strategy, a power analyzer, a dynamometric brake a…
Epichristoffel Words and Minimization of Moore Automata
2014
This paper is focused on the connection between the combinatorics of words and minimization of automata. The three main ingredients are the epichristoffel words, Moore automata and a variant of Hopcroft’s algorithm for their minimization. Epichristoffel words defined in [14] generalize some properties of circular sturmian words. Here we prove a factorization property and the existence of the reduction tree, that uniquely identifies the structure of the word. Furthermore, in the paper we investigate the problem of the minimization of Moore automata by defining a variant of Hopcroft’s minimization algorithm. The use of this variant makes simpler the computation of the running time and consequ…
Energy minimization of single input orbit transfer by averaging and continuation
2006
AbstractThis article deals with the transfer between Keplerian coplanar orbits using low propulsion. We focus on the energy minimization problem and compute the averaged system, proving integrability and relating the corresponding trajectories to a three-dimensional Riemannian problem that is analyzed in details. The geodesics provide approximations of the extremals of the energy minimization problem and can be used in order to evaluate the optimal trajectories of the time optimal and the minimization of the consumption problems with continuation methods. In particular, minimizing trajectories for transfer towards the geostationary orbit can be approximated in suitable coordinates by straig…
Comparison of three control drive systems for interior permanent magnet synchronous motors
2017
In a previous paper, we proposed a control strategy for interior permanent synchronous motors, which takes into account also the reduction of the motor power losses. The novelty of the suggested approach is that it takes into consideration the variations of all the motor parameters that have an influence on its efficiency. In order to verifyon the field the effectiveness of this new method, we implemented the proposed loss model algorithm in a control drive system and compared its performances, in terms of energy losses with respect to other conventional techniques.
Combination of the OSA process with thermal treatment at moderate temperature for excess sludge minimization
2019
Abstract This study investigated the chance to couple the conventional Oxic Settling Anaerobic (OSA) process with a thermic treatment at moderate temperature (35 °C). The maximum excess sludge reduction rate (80%) was achieved when the plant was operated under 3 h of hydraulic retention time (HRT). Compared with the conventional OSA system, the thermic treatment enabled a further improvement in excess sludge minimization of 35%. The observed yield coefficient decreased from 0.25 gTSS gCOD−1 to 0.10 gTSS gCOD−1 when the temperature in the anaerobic reactor was increased to 35 °C, despite the lower HRT (3 h vs 6 h). Moreover, the thermic treatment enabled the decrease of filamentous bacteria,…
Extremal minimality conditions on automata
2012
AbstractIn this paper we investigate the minimality problem of DFAs by varying the set of final states. In other words, we are interested on how the choice of the final states can affect the minimality of the automata. The state-pair graph is a useful tool to investigate such a problem. The choice of a set of final states for the automaton A defines a coloring of the closed components of the state-pair graph and the minimality of A corresponds to a property of these colored components. A particular attention is devoted to the analysis of some extremal cases such as, for example, the automata that are minimal for any choice of the subset of final states F from the state set Q of the automato…
Optimality results in orbit transfer
2007
Abstract The objective of this Note is to present optimality results in orbital transfer. Averaging of the energy minimization problem is considered, and properties of the associated Riemannian metric are discussed. To cite this article: B. Bonnard, J.-B. Caillau, C. R. Acad. Sci. Paris, Ser. I 345 (2007).
Helmholtz equation in unbounded domains: some convergence results for a constrained optimization problem
2016
We consider a constrained optimization problem arising from the study of the Helmholtz equation in unbounded domains. The optimization problem provides an approximation of the solution in a bounded computational domain. In this paper we prove some estimates on the rate of convergence to the exact solution.
Postselection Finite Quantum Automata
2010
Postselection for quantum computing devices was introduced by S. Aaronson[2] as an excitingly efficient tool to solve long standing problems of computational complexity related to classical computing devices only. This was a surprising usage of notions of quantum computation. We introduce Aaronson's type postselection in quantum finite automata. There are several nonequivalent definitions of quantumfinite automata. Nearly all of them recognize only regular languages but not all regular languages. We prove that PALINDROMES can be recognized by MM-quantum finite automata with postselection. At first we prove by a direct construction that the complement of this language can be recognized this …