258 research outputs found
How good are your fits? Unbinned multivariate goodness-of-fit tests in high energy physics
Multivariate analyses play an important role in high energy physics. Such
analyses often involve performing an unbinned maximum likelihood fit of a
probability density function (p.d.f.) to the data. This paper explores a
variety of unbinned methods for determining the goodness of fit of the p.d.f.
to the data. The application and performance of each method is discussed in the
context of a real-life high energy physics analysis (a Dalitz-plot analysis).
Several of the methods presented in this paper can also be used for the
non-parametric determination of whether two samples originate from the same
parent p.d.f. This can be used, e.g., to determine the quality of a detector
Monte Carlo simulation without the need for a parametric expression of the
efficiency.Comment: 32 pages, 12 figure
Thermo-visual feature fusion for object tracking using multiple spatiogram trackers
In this paper, we propose a framework that can efficiently combine features for robust tracking based on fusing the outputs of multiple spatiogram trackers. This is achieved without the exponential increase in storage and processing that other multimodal tracking approaches suffer from. The framework allows the features to be split arbitrarily between the trackers, as well as providing the flexibility to add, remove or dynamically weight features. We derive a mean-shift type algorithm for the framework that allows efficient object tracking with very low computational overhead. We especially target the fusion of thermal infrared and visible spectrum features as the most useful features for automated surveillance applications. Results are shown on multimodal video sequences clearly illustrating the benefits of combining multiple features using our framework
The parti-game algorithm for variable resolution reinforcement learning in multidimensional state-spaces
SimSearch: A new variant of dynamic programming based on distance series for optimal and near-optimal similarity discovery in biological sequences
http://www.informatik.uni-trier.de/%7Eley/db/conf/iwpacbb/iwpacbb2008.htmlIn this paper, we propose SimSearch, an algorithm implementing a new variant of dynamic programming based on distance series for optimal and near-optimal similarity discovery in biological sequences. The initial phase of SimSearch is devoted to fulfil the binary similarity matrices by signalling the distances between occurrences of the same symbol. The scoring scheme is further applied, when analysed the maximal extension of the pattern. Employing bit parallelism to analyse the global similarity matrix’s upper triangle, the new methodology searches the sequence(s) for all the exact and approximate patterns in regular or reverse order. The algorithm accepts parameterization to work with greater seeds for near-optimal results. Performance tests show significant efficiency improvement over traditional optimal methods based on dynamic programming. Comparing the new algorithm’s efficiency against heuristic based methods, equalizing the required sensitivity, the proposed algorithm remains acceptable.This work has been partially supported by PRODEP
A dimensionally continued Poisson summation formula
We generalize the standard Poisson summation formula for lattices so that it
operates on the level of theta series, allowing us to introduce noninteger
dimension parameters (using the dimensionally continued Fourier transform).
When combined with one of the proofs of the Jacobi imaginary transformation of
theta functions that does not use the Poisson summation formula, our proof of
this generalized Poisson summation formula also provides a new proof of the
standard Poisson summation formula for dimensions greater than 2 (with
appropriate hypotheses on the function being summed). In general, our methods
work to establish the (Voronoi) summation formulae associated with functions
satisfying (modular) transformations of the Jacobi imaginary type by means of a
density argument (as opposed to the usual Mellin transform approach). In
particular, we construct a family of generalized theta series from Jacobi theta
functions from which these summation formulae can be obtained. This family
contains several families of modular forms, but is significantly more general
than any of them. Our result also relaxes several of the hypotheses in the
standard statements of these summation formulae. The density result we prove
for Gaussians in the Schwartz space may be of independent interest.Comment: 12 pages, version accepted by JFAA, with various additions and
improvement
Branch-and-lift algorithm for deterministic global optimization in nonlinear optimal control
This paper presents a branch-and-lift algorithm for solving optimal control problems with smooth nonlinear dynamics and potentially nonconvex objective and constraint functionals to guaranteed global optimality. This algorithm features a direct sequential method and builds upon a generic, spatial branch-and-bound algorithm. A new operation, called lifting, is introduced, which refines the control parameterization via a Gram-Schmidt orthogonalization process, while simultaneously eliminating control subregions that are either infeasible or that provably cannot contain any global optima. Conditions are given under which the image of the control parameterization error in the state space contracts exponentially as the parameterization order is increased, thereby making the lifting operation efficient. A computational technique based on ellipsoidal calculus is also developed that satisfies these conditions. The practical applicability of branch-and-lift is illustrated in a numerical example. © 2013 Springer Science+Business Media New York
A Differential Quadrature Procedure with Direct Projection of the Heaviside Function for Numerical Solution of Moving Load Problem
Running Agents in Mobile Devices
This paper presents a deliberative architecture based on the concept of CBP-BDI agent. A CBP-BDI agent is a BDI agent that incorporates a CBP reasoning engine. The work here presented focuses in the development of a multiagent system that has been constructed for the management of some aspects of a shopping mall, specially the interaction with clients, so the aim is to get the portability of a CBP-BDI agent to mobile devices. The system has been tested and this paper presents the results obtained
- …