Search results for "Complex."
showing 10 items of 5824 documents
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.
Special issue on the occasion of the International Workshop on Complex Networks and their Applications
2014
Effective strategies for targeted attacks to the network of Cosa Nostra affiliates
2022
AbstractNetwork dismantling has recently gained interest in the fields of intelligence agencies, anti-corruption analysts and criminal investigators due to its efficiency in disrupting the activity of malicious agents. Here, we apply this approach to detect effective strategies for targeted attacks to Cosa Nostra by analysing the collaboration network of affiliates that participate to the same crimes. We preliminarily detect statistically significant homophily patterns induced by being member of the same mafia syndicate. We also find that links between members belonging to different mafia syndicates play a crucial role in connecting the network into a unique component, confirming the releva…
From magnetic to nonlinear optical switches in spin-crossover complexes
2013
ISI Document Delivery No.: 109TF Times Cited: 0 Cited Reference Count: 173 Lacroix, Pascal G. Malfant, Isabelle Real, Jose-Antonio Rodriguez, Vincent Wiley-v c h verlag gmbh Weinheim Si; Various attempts to combine magnetic and nonlinear optical (NLO) properties in a molecule are reviewed, with a special focus on the possibility of interplay between the magnetic component and the quadratic (proportional to E-2) NLO response. This multidisciplinary research leads to the idea of spin-crossover-induced (SCO-induced) NLO switching and is evaluated at the synthetic level, with insights provided by computational chemistry. The need for nontraditional experimental setups to record NLO properties i…
On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets
2000
We investigate the computational properties of finite binary- and analog-state discrete-time symmetric Hopfield nets. For binary networks, we obtain a simulation of convergent asymmetric networks by symmetric networks with only a linear increase in network size and computation time. Then we analyze the convergence time of Hopfield nets in terms of the length of their bit representations. Here we construct an analog symmetric network whose convergence time exceeds the convergence time of any binary Hopfield net with the same representation length. Further, we prove that the MIN ENERGY problem for analog Hopfield nets is NP-hard and provide a polynomial time approximation algorithm for this p…
Descriptive Complexity, Lower Bounds and Linear Time
1999
This paper surveys two related lines of research: Logical characterizations of (non-deterministic) linear time complexity classes, and non-expressibility results concerning sublogics of existential second-order logic. Starting from Fagin’s fundamental work there has been steady progress in both fields with the effect that the weakest logics that are used in characterizations of linear time complexity classes are closely related to the strongest logics for which inexpressibility proofs for concrete problems have been obtained. The paper sketches these developments and highlights their connections as well as the obstacles that prevent us from closing the remaining gap between both kinds of lo…
Efficient and accurate methodology for solving multiserver retrial systems
2005
Proposed is a novel methodology for solving retrial systems which is based on the aggregation of levels of the Markov model beyond a given one. Its evaluation concludes that it is more accurate than previous approximations while requiring a low computational cost.