Search results for "TheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITY"
showing 10 items of 122 documents
Fast Algorithms for Pseudoarboricity
2015
The densest subgraph problem, which asks for a subgraph with the maximum edges-to-vertices ratio d∗, is solvable in polynomial time. We discuss algorithms for this problem and the computation of a graph orientation with the lowest maximum indegree, which is equal to ⌈d∗⌉. This value also equals the pseudoarboricity of the graph. We show that it can be computed in O(|E| √ log log d∗) time, and that better estimates can be given for graph classes where d∗ satisfies certain asymptotic bounds. These runtimes are achieved by accelerating a binary search with an approximation scheme, and a runtime analysis of Dinitz’s algorithm on flow networks where all arcs, except the source and sink arcs, hav…
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
2006
There remains today an open problem whether the rotation distance between binary trees or equivalently the diagonal-flip distance between triangulations can be computed in polynomial time. We present an efficient algorithm for computing lower and upper bounds of this distance between a pair of triangulations.
An efficient upper bound of the rotation distance of binary trees
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons triangulations. Ordinal tools are used.
Search for CP violation using T-odd correlations in D-0 -> K+K-pi(+)pi(-) decays
2014
A search for $CP$ violation using $T$-odd correlations is performed using the four-body $D^0 \to K^+K^-\pi^+\pi^-$ decay, selected from semileptonic $B$ decays. The data sample corresponds to integrated luminosities of $1.0\,\text{fb}^{-1}$ and $2.0\,\text{fb}^{-1}$ recorded at the centre-of-mass energies of 7 TeV and 8 TeV, respectively. The $CP$-violating asymmetry $a_{CP}^{T\text{-odd}}$ is measured to be $(0.18\pm 0.29\text{(stat)}\pm 0.04\text{(syst)})\%$. Searches for $CP$ violation in different regions of phase space of the four-body decay, and as a function of the $D^0$ decay time, are also presented. No significant deviation from the $CP$ conservation hypothesis is found.
Electroosmotic effects in the determination of ion mobilities of carrier-free radionuclides in free aqueous electrolyte solutions
2001
A device for on-line electromigration studies of radio-elements in free electrolytes has been tested by measuring the absolute individual ion mobilities of no-carrier-added single charged anions [99mTc]TcO4 - and [18F]F- and differently charged cations [137Cs]Cs+, [57Co]Co2+ and [241Am]Am3+ in inert aqueous electrolytes at 298.1 K. The observed ion mobilities were found to be influenced by electroosmosis in the migration tube. A relation to correct this effect is proposed. In addition, it was shown that the effect of electroosmosis may be suppressed by chemical treatment of the surface of the migration tube.
Calcification is not the Achilles' heel of cold-water corals in an acidifying ocean
2015
Ocean acidification is thought to be a major threat to coral reefs: laboratory evidence and CO2 seep research has shown adverse effects on many coral species, although a few are resilient. There are concerns that cold-water corals are even more vulnerable as they live in areas where aragonite saturation (?ara) is lower than in the tropics and is falling rapidly due to CO2 emissions. Here, we provide laboratory evidence that net (gross calcification minus dissolution) and gross calcification rates of three common cold-water corals, Caryophyllia smithii, Dendrophyllia cornigera, and Desmophyllum dianthus, are not affected by pCO2 levels expected for 2100 (pCO2 1058 ?atm, ?ara 1.29), and nor a…
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].
Cryptanalysis of Knapsack Cipher Using Ant Colony Optimization
2018
Ant Colony Optimization is a search metaheuristic inspired by the behavior of real ant colonies and shown their effectiveness, robustness to solve a wide variety of complex problems. In this paper, we present a novel Ant Colony Optimization (ACO) based attack for cryptanalysis of knapsack cipher algorithm. A Cipher-text only attack is used to discover the plaintext from the cipher-text. Moreover, our approach allows us to break knapsack cryptosystem in a minimum search space when compared with other techniques. Experimental results prove that ACO can be used as an effective tool to attack knapsack cipher.
An abstract inf-sup problem inspired by limit analysis in perfect plasticity and related applications
2021
This paper is concerned with an abstract inf-sup problem generated by a bilinear Lagrangian and convex constraints. We study the conditions that guarantee no gap between the inf-sup and related sup-inf problems. The key assumption introduced in the paper generalizes the well-known Babuška–Brezzi condition. It is based on an inf-sup condition defined for convex cones in function spaces. We also apply a regularization method convenient for solving the inf-sup problem and derive a computable majorant of the critical (inf-sup) value, which can be used in a posteriori error analysis of numerical results. Results obtained for the abstract problem are applied to continuum mechanics. In particular…
R Code for Hausdorff and Simplex Dispersion Orderings in the 2D Case
2010
This paper proposes a software implementation using R of the Hausdorff and simplex dispersion orderings. A copy can be downloaded from http://www.uv.es/~ayala/software/fun-disp.R . The paper provides some examples using the functions exactHausdorff for the Hausdorff dispersion ordering and the function simplex for the simplex dispersion orderings. Some auxiliary functions are commented too.