Search results for "complex"
showing 10 items of 5889 documents
Porphyrines et tétraazamacrocycles dérivés du DOTA : association de deux ligands pour la chélation de métaux d'intérêt en imagerie médicale multimoda…
2012
The goal of my PhD thesis was to synthesize new molecules, which give access to heterobimetallic complexes with interesting properties for multimodal imaging. In this manuscript, several main points have been studied. The first part of this work concerns the synthesis and characterization of ligands. We describe here the synthesis of five new ligands based on the association of one porphyrin and one or several cyclen derivatives. Those ligands are water-soluble. During the synthesis, we have targeted improvements to our work and developed a new synthetic pathway, which allowed us to obtain one ligand incorporating a porphyrin, a cyclen derivative and a free amine function. This function cou…
A simple method to fabricate high-performance nanostructured WO3 photocatalysts with adjusted morphology in the presence of complexing agents
2017
[EN] The rich and complex chemistry of tungsten was employed to synthesize innovative WO3 nanoplatelets/nanosheets by simple anodization in acidic electrolytes containing different concentrations of complexing agents or ligands, namely F- and H2O2. The morphological and photoelectrochemical properties of these nanostructures were characterized. The best of these nanostructures generated stable photocurrent densities of ca. 1.8 mA cm(-2) at relatively low bias potentials (for WO3) of 0.7 V-Ag/AgCl under simulated solar irradiation, which can be attributed to a very high active surface area. This work demonstrates that the morphology and dimensions of these nanostructures, as well as their ph…
Editorial Note The path of complexity science: from theory to managerial practice
2012
The application of complexity science to business has always been a diicult task because it is not easy to demonstrate the relevance of complexity theories to practicing managers. We accepted this challenge with this Special Issue, and I think we are giving a good con- tribution in this sense.
Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms
2005
The complexity of quantum query algorithms computing Boolean functions is strongly related to the degree of the algebraic polynomial representing this Boolean function. There are two related difficult open problems. First, Boolean functions are sought for which the complexity of exact quantum query algorithms is essentially less than the complexity of deterministic query algorithms for the same function. Second, Boolean functions are sought for which the degree of the representing polynomial is essentially less than the complexity of deterministic query algorithms. We present in this paper new techniques to solve the second problem.
Counting by Statistics on Search Trees: Application to Constraint Satisfaction Problems
1997
In 1975, Knuth proposed a simple statistical method for investigating search trees. We use this technique for estimating the number of solutions of constraint satisfaction problem CSP and boolean satisfiability problem SAT instances. We show that, depending on domain reductions, tree-based estimates have a lower variance than estimates based on uniform sampling from the search space. Nevertheless, because the variance remains extremely high in the general case, a confidence interval cannot be derived, but a lower bound of the number of solutions. These results are confirmed by many experiments.
Codification schemes and finite automata
2000
This paper is a note on how Information Theory and Codification Theory are helpful in the computational design both of communication protocols and strategy sets in the framework of finitely repeated games played by boundedly rational agents. More precisely, we show the usefulness of both theories to improve the existing automata bounds of Neyman¿s (1998) work on finitely repeated games played by finite automata.
The impact of organic amendments on soil hydrology, structure and microbial respiration in semiarid lands
2016
Abstract Few studies have considered the effect of organic amendments on soil microbial activity and its contributions to hydraulic conductivity under field conditions in semiarid region soils with different textures and degrees of aggregate stability. This study was performed to investigate the relationship between selected soil properties and hydraulic conductivity in response to different types and application rates of organic amendments. For this purpose, urban municipal solid waste (MSW) compost and alfalfa residue (AR) were applied at different rates of 0 (control), 10 Mg ha− 1 and 30 Mg ha− 1 to clay loam and loamy sand soils under field conditions. Results show that after two years,…
A Guaranteed performance of a green data center based on the contribution of vital nodes
2016
International audience; In order to satisfy the need for the critical computing resources, many data center architectures proposed to house a huge number of network devices. These devices are used to achieve the highest performance in case of full utilization of the network. However, the peak capacity of the network is rarely reached. Consequently, many devices are set into idle state and cause a huge energy waste leading to a non-proportionality between the network load and the energy consumed. In this paper, we propose a power-aware routing algorithm that saves energy consumption with a negligible trade-off on the performance of the network. The idea is to keep active only the source and …
Approximation of functions over manifolds : A Moving Least-Squares approach
2021
We present an algorithm for approximating a function defined over a $d$-dimensional manifold utilizing only noisy function values at locations sampled from the manifold with noise. To produce the approximation we do not require any knowledge regarding the manifold other than its dimension $d$. We use the Manifold Moving Least-Squares approach of (Sober and Levin 2016) to reconstruct the atlas of charts and the approximation is built on-top of those charts. The resulting approximant is shown to be a function defined over a neighborhood of a manifold, approximating the originally sampled manifold. In other words, given a new point, located near the manifold, the approximation can be evaluated…
Optimal rates of convergence for persistence diagrams in Topological Data Analysis
2013
Computational topology has recently known an important development toward data analysis, giving birth to the field of topological data analysis. Topological persistence, or persistent homology, appears as a fundamental tool in this field. In this paper, we study topological persistence in general metric spaces, with a statistical approach. We show that the use of persistent homology can be naturally considered in general statistical frameworks and persistence diagrams can be used as statistics with interesting convergence properties. Some numerical experiments are performed in various contexts to illustrate our results.