Search results for " minimization"
showing 10 items of 107 documents
The Dialectics of Free Energy Minimization
2019
Karl Friston’s free energy minimization has been received with great enthusiasm. With good reason: it not only makes the bold claim to a unifying theory of the brain, but it is presented as an a priori principle applicable to living systems in general. In this article, we set out to show how the breadth of scope of Friston’s framework converges with the dialectics of Georg Hegel. Through an appeal to the work of Catherine Malabou, we aim to demonstrate how Friston not only reinvigorates Hegelian dialectics from the perspective of neuroscience, but that the implicit alignment with Hegel necessitates a reading of free energy minimization from the perspective of Hegel’s speculative philosophy.…
Quantum Query Complexity of Boolean Functions with Small On-Sets
2008
The main objective of this paper is to show that the quantum query complexity Q(f) of an N-bit Boolean function f is bounded by a function of a simple and natural parameter, i.e., M = |{x|f(x) = 1}| or the size of f's on-set. We prove that: (i) For $poly(N)\le M\le 2^{N^d}$ for some constant 0 < d < 1, the upper bound of Q(f) is $O(\sqrt{N\log M / \log N})$. This bound is tight, namely there is a Boolean function f such that $Q(f) = \Omega(\sqrt{N\log M / \log N})$. (ii) For the same range of M, the (also tight) lower bound of Q(f) is $\Omega(\sqrt{N})$. (iii) The average value of Q(f) is bounded from above and below by $Q(f) = O(\log M +\sqrt{N})$ and $Q(f) = \Omega (\log M/\log N+ \sqrt{N…
Hamming, Permutations and Automata
2007
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than superexponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We prove that there is an infinite sequence of distinct int…
Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States
2008
Quantum finite automata with mixed states are proved to be super-exponentially more concise rather than quantum finite automata with pure states. It was proved earlier by A.Ambainis and R.Freivalds that quantum finite automata with pure states can have exponentially smaller number of states than deterministic finite automata recognizing the same language. There was a never published "folk theorem" proving that quantum finite automata with mixed states are no more than super-exponentially more concise than deterministic finite automata. It was not known whether the super-exponential advantage of quantum automata is really achievable. We use a novel proof technique based on Kolmogorov complex…
Fuzzy Logic based model for self-optimizing energy consumption in IoT environment
2021
Energy optimization is essential in IoT environments due to energy constraints for some IoT components. In fact, energy consumption has a direct impact on IoT system lifetime, which represents an important Quality of Service (QoS) parameter for IoT environments. In order to extend the IoT system lifetime, energy consumption optimization should be considered in several IoT components. In this paper, we specify an energy self-optimizing mechanism allowing to minimize data transmission energy consumption of IoT objects. This mechanism enables selecting specific objects to send the desired data while minimizing the energy consumed for the corresponding communication. Our proposal is made of a M…
High-spin states in tetrahedral X4 clusters (X = H, Li, Na, K)
2010
The high-spin electronic states for lithium, sodium, and potassium four-atom clusters were studied. In particular, we performed coupled cluster geometry optimization of the quintet state in tetrahedral geometry. The quintet state of these systems is characterized by having all the valence electron Unpaired, giving rise to the so-called no-pair bonding. Single-point full configuration interaction computations on the equilibrium geometries for the various Clusters are also presented. The analysis of the valence orbitals in a localized representation confirms the importance of the p atomic orbitals to explain this unusual type of bond. (C) 2009 Wiley Periodicals, Inc. Int J Quantum Chem 110: 8…
A General and Accurate Measurement Procedure for the Detection of Power Losses Variations in Permanent Magnet Synchronous Motor Drives
2020
The research of innovative solutions to improve the efficiency of electric drives is of considerable interest to challenges related to energy savings and sustainable development. In order to successfully validate the adoption of new and innovative software or hardware solutions in the field of electric drives, accurate measurement procedures for either efficiency or power losses are needed. Moreover, high accuracy and expensive measurement equipment are required to satisfy international standard prescriptions. In this scenario, this paper describes an accurate measurement procedure, which is independent of the accuracy of the adopted instrumentation, for the power losses variations involved…
Analysis a DSP Implementation and Experimental Validation of a Loss Minimization Algorithm Applied to Permanent Magnet Synchronous Motor Drives
2004
In this paper a new loss minimization control algorithm for inverter-fed permanent-magnet synchronous motors (PMSM), which allows to reduce the power losses of the electric drive without penalty on its dynamic performances, is analyzed, experimentally realized and validated. In particular, after a brief recall of two loss minimization control strategies (the "search control" and the "loss-model control"), both a modified dynamic model of the PMSM, which takes into account the iron losses, and a "loss-model" control strategy, are treated. Experimental tests on a specific PMSM drive employing the proposed loss minimization algorithm were performed aiming to validate the actual implementation.…
Graph cut-based method for segmenting the left ventricle from MRI or echocardiographic images
2017
International audience; In this paper, we present a fast and interactive graph cut method for 3D segmentation of the endocardial wall of the left ventricle (LV) adapted to work on two of the most widely used modalities: magnetic resonance imaging (MRI) and echocardiography. Our method accounts for the fundamentally different nature of both modalities: 3D echocardiographic images have a low contrast, a poor signal-to-noise ratio and frequent signal drop, while MR images are more detailed but also cluttered and contain highly anisotropic voxels. The main characteristic of our method is to work in a 3D Bezier coordinate system instead of the original Euclidean space. This comes with several ad…
Simulated annealing with restrained molecular dynamics using a flexible restraint potential: Theory and evaluation with simulated NMR constraints
1996
A new functional representation of NMR-derived distance constraints, the flexible restraint potential, has been implemented in the program CONGEN (Bruccoleri RE, Karplus M, 1987, Biopolymers 26:137-168) for molecular structure generation. In addition, flat-bottomed restraint potentials for representing dihedral angle and vicinal scalar coupling constraints have been introduced into CONGEN. An effective simulated annealing (SA) protocol that combines both weight annealing and temperature annealing is described. Calculations have been performed using ideal simulated NMR constraints, in order to evaluate the use of restrained molecular dynamics (MD) with these target functions as implemented i…