Search results for "complexi"

Fast and Simple Approximation of the Diameter and Radius of a Graph

2006

The increasing amount of data to be processed by computers has led to the need for highly efficient algorithms for various computational problems. Moreover, the algorithms should be as simple as possible to be practically applicable. In this paper we propose a very simple approximation algorithm for finding the diameter and the radius of an undirected graph. The algorithm runs in $O(m\sqrt{n})$ time and gives an additive error of $O(\sqrt{n})$ for a graph with n vertices and m edges. Practical experiments show that the results of our algorithm are close to the optimum and compare favorably to the 2/3-approximation algorithm for the diameter problem by Aingworth et al [1].

TERMITE: AnRscript for fast reduction of laser ablation inductively coupled plasma mass spectrometry data and its application to trace element measur…

2017

RATIONALE High spatial resolution Laser Ablation Inductively Coupled Plasma Mass Spectrometry (LA-ICPMS) determination of trace element concentrations is of great interest for geological and environmental studies. Data reduction is a very important aspect of LA-ICP-MS, and several commercial programs for handling LA-ICPMS trace element data are available. Each of these software packages has its specific advantages and disadvantages. METHODS Here we present TERMITE, an R script for the reduction of LA-ICPMS data, which can reduce both spot and line scan measurements. Several parameters can be adjusted by the user, who does not necessarily need prior knowledge in R. Currently, ten reference m…

The reconstitution of human C1, the first complement component Binding of C1r and C1s to C1q influences the C1q conformation

1981

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.

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 …

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…