No Arabic abstract
Two chaotic systems which interact by mutually exchanging a signal built from their delayed internal variables, can synchronize. A third unit may be able to record and to manipulate the exchanged signal. Can the third unit synchronize to the common chaotic trajectory, as well? If all parameters of the system are public, a proof is given that the recording system can synchronize as well. However, if the two interacting systems use private commutative filters to generate the exchanged signal, a driven system cannot synchronize. It is shown that with dynamic private filters the chaotic trajectory even cannot be calculated. Hence two way (interaction) is more than one way (drive). The implication of this general result to secret communication with chaos synchronization is discussed.
Dark matter interacting with the Standard Model fermions through new scalars or pseudoscalars with flavour-diagonal couplings proportional to fermion mass are well motivated theoretically, and provide a useful phenomenological model with which to interpret experimental results. Two modes of dark matter production from these models have been considered in the existing literature: pairs of dark matter produced through top quark loops with an associated monojet in the event, and pair production of dark matter with pairs of heavy flavoured quarks (tops or bottoms). In this paper, we demonstrate that a third, previously overlooked channel yields a non-negligible contribution to LHC dark matter searches in these models. In spite of a generally lower production cross section at LHC when compared to the associated top-pair channel, non-flavour violating single top quark processes are kinematically favored and can significantly increase the sensitivity to these models. Including dark matter production in association with a single top quark through scalar or pseudoscalar mediators, the exclusion limit set by the LHC searches for dark matter can be improved by $30$--$90%$, depending on the mass assumed for the mediator particle.
Small networks of chaotic units which are coupled by their time-delayed variables, are investigated. In spite of the time delay, the units can synchronize isochronally, i.e. without time shift. Moreover, networks can not only synchronize completely, but can also split into different synchronized sublattices. These synchronization patterns are stable attractors of the network dynamics. Different networks with their associated behaviors and synchronization patterns are presented. In particular, we investigate sublattice synchronization, symmetry breaking, spreading chaotic motifs, synchronization by restoring symmetry and cooperative pairwise synchronization of a bipartite tree.
Networks of chaotic units with static couplings can synchronize to a common chaotic trajectory. The effect of dynamic adaptive couplings on the cooperative behavior of chaotic networks is investigated. The couplings adjust to the activities of its two units by two competing mechanisms: An exponential decrease of the coupling strength is compensated by an increase due to de-synchronized activity. This mechanism prevents the network from reaching a steady state. Numerical simulations of a coupled map lattice show chaotic trajectories of de-synchronized units interrupted by pulses of mutually synchronized clusters. These pulses occur on all scales, sometimes extending to the entire network. Clusters of synchronized units can be triggered by a small group of synchronized units.
As an essential ingredient of modern deep learning, attention mechanism, especially self-attention, plays a vital role in the global correlation discovery. However, is hand-crafted attention irreplaceable when modeling the global context? Our intriguing finding is that self-attention is not better than the matrix decomposition (MD) model developed 20 years ago regarding the performance and computational cost for encoding the long-distance dependencies. We model the global context issue as a low-rank recovery problem and show that its optimization algorithms can help design global information blocks. This paper then proposes a series of Hamburgers, in which we employ the optimization algorithms for solving MDs to factorize the input representations into sub-matrices and reconstruct a low-rank embedding. Hamburgers with different MDs can perform favorably against the popular global context module self-attention when carefully coping with gradients back-propagated through MDs. Comprehensive experiments are conducted in the vision tasks where it is crucial to learn the global context, including semantic segmentation and image generation, demonstrating significant improvements over self-attention and its variants.
We extend the concept of generalized synchronization of chaos, a phenomenon that occurs in driven dynamical systems, to the context of autonomous spatiotemporal systems. It means a situation where the chaotic state variables in an autonomous system can be synchronized to each other but not to a coupling function defined from them. The form of the coupling function is not crucial; it may not depend on all the state variables nor it needs to be active for all times for achieving generalized synchronization. The procedure is based on the analogy between a response map subject to an external drive acting with a probability p and an autonomous system of coupled maps where a global interaction between the maps takes place with this same probability. It is shown that, under some circumstances, the conditions for stability of generalized synchronized states are equivalent in both types of systems. Our results reveal the existence of similar minimal conditions for the emergence of generalized synchronization of chaos in driven and in autonomous spatiotemporal systems.