4,841 research outputs found

    The Ellis semigroup of a nonautonomous discrete dynamical system

    Full text link
    We introduce the {\it Ellis semigroup} of a nonautonomous discrete dynamical system (X,f1,)(X,f_{1,\infty}) when XX is a metric compact space. The underlying set of this semigroup is the pointwise closure of \{f\sp{n}_1 \, |\, n\in \mathbb{N}\} in the space X\sp{X}. By using the convergence of a sequence of points with respect to an ultrafilter it is possible to give a precise description of the semigroup and its operation. This notion extends the classical Ellis semigroup of a discrete dynamical system. We show several properties that connect this semigroup and the topological properties of the nonautonomous discrete dynamical system

    Searching for BcB_c mesons in the ATLAS experiment at LHC

    Get PDF
    We discuss the feasibility of the observation of the signal from BcB_c mesons in the ATLAS experiment of the LHC collider at a luminosity of ${\approx}\ 10^{33}cmcm^{-2}ss^{-1}.Inparticularweaddressthedecaymode. In particular we address the decay mode B_c{\rightarrow}J/\psi \pifollowedbytheleptonicdecay followed by the leptonic decay J/\psi{\rightarrow}\mu^+\mu^-,whichshouldpermitanaccuratemeasurementofthe, which should permit an accurate measurement of the B_cmass.WeperformedaMonteCarlostudyofthesignalandbackgroundconcludingthataprecisionof mass. We performed a Monte Carlo study of the signal and background concluding that a precision of 40MeVforthe MeV for the B_c$ mass could be achieved after one year of running.Comment: Latex,7 pages including 3 uuencoded Postscript figures appended at the end of the latex fil

    Studying the capacity of cellular encoding to generate feedforward neural network topologies

    Get PDF
    Proceeding of: IEEE International Joint Conference on Neural Networks, IJCNN 2004, Budapest, 25-29 July 2004Many methods to codify artificial neural networks have been developed to avoid the disadvantages of direct encoding schema, improving the search into the solution's space. A method to analyse how the search space is covered and how are the movements along search process applying genetic operators is needed in order to evaluate the different encoding strategies for multilayer perceptrons (MLP). In this paper, the generative capacity, this is how the search space is covered for a indirect scheme based on cellular systems, is studied. The capacity of the methods to cover the search space (topologies of MLP space) is compared with the direct encoding scheme.Publicad

    Grammars and cellular automata for evolving neural networks architectures

    Get PDF
    IEEE International Conference on Systems, Man, and Cybernetics. Nashville, TN, 8-11 October 2000The class of feedforward neural networks trained with back-propagation admits a large variety of specific architectures applicable to approximation pattern tasks. Unfortunately, the architecture design is still a human expert job. In recent years, the interest to develop automatic methods to determine the architecture of the feedforward neural network has increased, most of them based on the evolutionary computation paradigm. From this approach, some perspectives can be considered: at one extreme, every connection and node of architecture can be specified in the chromosome representation using binary bits. This kind of representation scheme is called the direct encoding scheme. In order to reduce the length of the genotype and the search space, and to make the problem more scalable, indirect encoding schemes have been introduced. An indirect scheme under a constructive algorithm, on the other hand, starts with a minimal architecture and new levels, neurons and connections are added, step by step, via some sets of rules. The rules and/or some initial conditions are codified into a chromosome of a genetic algorithm. In this work, two indirect constructive encoding schemes based on grammars and cellular automata, respectively, are proposed to find the optimal architecture of a feedforward neural network

    Bethe-Salpeter equation for doubly heavy baryons in the covariant instantaneous approximation

    Get PDF
    In the heavy quark limit, a doubly heavy baryon is regarded as composed of a heavy diquark and a light quark. We establish the Bethe-Salpeter (BS) equations for the heavy diquarks and the doubly heavy baryons, respectively, to leading order in a 1/mQ1/m_{Q} expansion. The BS equations are solved numerically under the covariant instantaneous approximation with the kernels containing scalar confinement and one-gluon-exchange terms. The masses for the heavy diquarks and the doubly heavy baryons are obtained and the non-leptonic decay widths for the doubly heavy baryons emitting a pseudo-scalar meson are calculated within the model.Comment: Corrections to the text, two references added, version accepted for publication in Physical Review

    Neural Network architectures design by Cellular Automata evolution

    Get PDF
    4th Conference of Systemics Cybernetics and Informatics. Orlando, 23-26 July 2000The design of the architecture is a crucial step in the successful application of a neural network. However, the architecture design is basically, in most cases, a human experts job. The design depends heavily on both, the expert experience and on a tedious trial-and-error process. Therefore, the development of automatic methods to determine the architecture of feedforward neural networks is a field of interest in the neural network community. These methods are generally based on search techniques, as genetic algorithms, simulated annealing or evolutionary strategies. Most of the designed methods are based on direct representation of the parameters of the network. This representation does not allow scalability, so to represent large architectures very large structures are required. In this work, an indirect constructive encoding scheme is proposed to find optimal architectures of feed-forward neural networks. This scheme is based on cellular automata representations in order to increase the scalability of the method.Publicad

    Dynamical Aspects of Generalized Palatini Theories of Gravity

    Get PDF
    We study the field equations of modified theories of gravity in which the lagrangian is a general function of the Ricci scalar and Ricci-squared terms in Palatini formalism. We show that the independent connection can be expressed as the Levi-Civita connection of an auxiliary metric which, in particular cases of interest, is related with the physical metric by means of a disformal transformation. This relation between physical and auxiliary metric boils down to a conformal transformation in the case of f(R) theories. We also show with explicit models that the inclusion of Ricci squared terms in the action can impose upper bounds on the accessible values of pressure and density, which might have important consequences for the early time cosmology and black hole formation scenarios. Our results indicate that the phenomenology of f(R_{ab}R^{ab}) theories is much richer than that of f(R) and f(R_{ab}R^{ab}) theories and that they also share some similarities with Bekenstein's relativistic theory of MOND.Comment: 8 pages, no figure
    corecore