4,814 research outputs found
Fast implementation of the Tukey depth
Tukey depth function is one of the most famous multivariate tools serving
robust purposes. It is also very well known for its computability problems in
dimensions . In this paper, we address this computing issue by
presenting two combinatorial algorithms. The first is naive and calculates the
Tukey depth of a single point with complexity ,
while the second further utilizes the quasiconcave of the Tukey depth function
and hence is more efficient than the first. Both require very minimal memory
and run much faster than the existing ones. All experiments indicate that they
compute the exact Tukey depth.Comment: 16 pages, 13 figure
QED Contribution to the Color-Singlet \jpsi Production in Decay Near the Endpoint
A recent study indicates that the order QED processes of
\Upsilon \to \jpsi + X decay are compatible with those of QCD processes.
However, in the endpoint region, the Non-relativistic QED (NRQED) calculation
breaks down since the collinear degrees of freedom are missing under the
framework of this effective theory.
In this paper we apply the soft collinear effective theory (SCET) to study
the color-singlet QED process at the kinematic limit. Within this approach we
are able to sum the kinematic logarithms by running operators using the
renormalization group equations of SCET, which will lead to a dramatic change
in the momentum distribution near the endpoint and the spectrum shape
consistent with the experimental results.Comment: 9 pages, 2 figure
A test problem for visual investigation of high-dimensional multi-objective search
An inherent problem in multiobjective optimization is that the visual observation of solution vectors with four or more objectives is infeasible, which brings major difficulties for algorithmic design, examination, and development. This paper presents a test problem, called the Rectangle problem, to aid the visual investigation of high-dimensional multiobjective search. Key features of the Rectangle problem are that the Pareto optimal solutions 1) lie in a rectangle in the two-variable decision space and 2) are similar (in the sense of Euclidean geometry) to their images in the four-dimensional objective space. In this case, it is easy to examine the behavior of objective vectors in terms of both convergence and diversity, by observing their proximity to the optimal rectangle and their distribution in the rectangle, respectively, in the decision space. Fifteen algorithms are investigated. Underperformance of Pareto-based algorithms as well as most state-of-the-art many-objective algorithms indicates that the proposed problem not only is a good tool to help visually understand the behavior of multiobjective search in a high-dimensional objective space but also can be used as a challenging benchmark function to test algorithms' ability in balancing the convergence and diversity of solutions
Asymptotic stability for neural networks with mixed time-delays: The discrete-time case
This is the post print version of the article. The official published version can be obtained from the link - Copyright 2009 Elsevier LtdThis paper is concerned with the stability analysis problem for a new class of discrete-time recurrent neural networks with mixed time-delays. The mixed time-delays that consist of both the discrete and distributed time-delays are addressed, for the first time, when analyzing the asymptotic stability for discrete-time neural networks. The activation functions are not required to be differentiable or strictly monotonic. The existence of the equilibrium point is first proved under mild conditions. By constructing a new Lyapnuov–Krasovskii functional, a linear matrix inequality (LMI) approach is developed to establish sufficient conditions for the discrete-time neural networks to be globally asymptotically stable. As an extension, we further consider the stability analysis problem for the same class of neural networks but with state-dependent stochastic disturbances. All the conditions obtained are expressed in terms of LMIs whose feasibility can be easily checked by using the numerically efficient Matlab LMI Toolbox. A simulation example is presented to show the usefulness of the derived LMI-based stability condition.This work was supported in part by the Biotechnology and Biological Sciences Research Council (BBSRC) of the UK under Grants BB/C506264/1 and 100/EGM17735, the Engineering and Physical Sciences Research Council (EPSRC) of the UK under Grants GR/S27658/01 and EP/C524586/1, an International Joint Project sponsored by the Royal Society of the UK, the Natural Science Foundation of Jiangsu Province of China under Grant BK2007075, the National Natural Science Foundation of China under Grant 60774073, and the Alexander von Humboldt Foundation of Germany
- …