Complexity plots

In this paper, we present a novel visualization technique for assisting in observation and analysis of algorithmic\ud complexity. In comparison with conventional line graphs, this new technique is not sensitive to the units of\ud measurement, allowing multivariate data series of different physical qualities (e.g., time, space and energy) to be juxtaposed together conveniently and consistently. It supports multivariate visualization as well as uncertainty visualization. It enables users to focus on algorithm categorization by complexity classes, while reducing visual impact caused by constants and algorithmic components that are insignificant to complexity analysis. It provides an effective means for observing the algorithmic complexity of programs with a mixture of algorithms and blackbox software through visualization. Through two case studies, we demonstrate the effectiveness of complexity plots in complexity analysis in research, education and application

Measurement of the LCG2 and glite file catalogue's performance

When the Large Hadron Collider (LHC) begins operation at CERN in 2007 it will produce data in volumes never before seen. Physicists around the world will manage, distribute and analyse petabytes of this data using the middleware provided by the LHC Computing Grid. One of the critical factors in the smooth running of this system is the performance of the file catalogues which allow users to access their files with a logical filename without knowing their physical location. This paper presents a detailed study comparing the performance and respective merits and shortcomings of two of the main catalogues: the LCG File Catalogue and the gLite FiReMan catalogue

Graph-Controlled Insertion-Deletion Systems

In this article, we consider the operations of insertion and deletion working in a graph-controlled manner. We show that like in the case of context-free productions, the computational power is strictly increased when using a control graph: computational completeness can be obtained by systems with insertion or deletion rules involving at most two symbols in a contextual or in a context-free manner and with the control graph having only four nodes.Comment: In Proceedings DCFS 2010, arXiv:1008.127

A matrix model for the latitude Wilson loop in ABJM theory

In ABJ(M) theory, we propose a matrix model for the exact evaluation of BPS Wilson loops on a latitude circular contour, so providing a new weak-strong interpolation tool. Intriguingly, the matrix model turns out to be a particular case of that computing torus knot invariants in $U(N_1|N_2)$ Chern-Simons theory. At weak coupling we check our proposal against a three-loop computation, performed for generic framing, winding number and representation. The matrix model is amenable of a Fermi gas formulation, which we use to systematically compute the strong coupling and genus expansions. For the fermionic Wilson loop the leading planar behavior agrees with a previous string theory prediction. For the bosonic operator our result provides a clue for finding the corresponding string dual configuration. Our matrix model is consistent with recent proposals for computing Bremsstrahlung functions exactly in terms of latitude Wilson loops. As a by-product, we extend the conjecture for the exact $B^{\theta}_{1/6}$ Bremsstrahlung function to generic representations and test it with a four-loop perturbative computation. Finally, we propose an exact prediction for $B_{1/2}$ at unequal gauge group ranks.Comment: 73 pages; v2: several improvements, JHEP published versio

Quantum Bounded Query Complexity

We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of decision problems. Under traditional complexity assumptions, we obtain an exponential speedup between the quantum and the classical query complexity of function classes. For decision problems and function classes we obtain the following results: o P_||^NP[2k] is included in EQP_||^NP[k] o P_||^NP[2^(k+1)-2] is included in EQP^NP[k] o FP_||^NP[2^(k+1)-2] is included in FEQP^NP[2k] o FP_||^NP is included in FEQP^NP[O(log n)] For sets A that are many-one complete for PSPACE or EXP we show that FP^A is included in FEQP^A[1]. Sets A that are many-one complete for PP have the property that FP_||^A is included in FEQP^A[1]. In general we prove that for any set A there is a set X such that FP^A is included in FEQP^X[1], establishing that no set is superterse in the quantum setting.Comment: 11 pages LaTeX2e, no figures, accepted for CoCo'9

Flexible Automatic Scheduling For Autonomous Telescopes: The MAJORDOME

We have developped a new method for the scheduling of astronomical automatic telescopes, in the framework of the autonomous TAROT instrument. The MAJORDOME software can handle a variety of observations, constrained, periodic, etc., and produces a timeline for the night, which may be modified at any time to take into account the specific conditions of the night. The MAJORDOME can also handle target of opportunity observations without delay.Comment: 16 pages, 6 figures, to appear in Experimental Astronom