Rare Flavor Processes in Maximally Natural Supersymmetry

We study CP-conserving rare flavor violating processes in the recently proposed theory of Maximally Natural Supersymmetry (MNSUSY). MNSUSY is an unusual supersymmetric (SUSY) extension of the Standard Model (SM) which, remarkably, is un-tuned at present LHC limits. It employs Scherk-Schwarz breaking of SUSY by boundary conditions upon compactifying an underlying 5-dimensional (5D) theory down to 4D, and is not well-described by softly-broken $\mathcal{N}=1$ SUSY, with much different phenomenology than the Minimal Supersymmetric Standard Model (MSSM) and its variants. The usual CP-conserving SUSY-flavor problem is automatically solved in MNSUSY due to a residual almost exact $U(1)_R$ symmetry, naturally heavy and highly degenerate 1st- and 2nd-generation sfermions, and heavy gauginos and Higgsinos. Depending on the exact implementation of MNSUSY there exist important new sources of flavor violation involving gauge boson Kaluza-Klein (KK) excitations. The spatial localization properties of the matter multiplets, in particular the brane localization of the 3rd generation states, imply KK-parity is broken and {\it tree-level} contributions to flavor changing neutral currents are present in general. Nevertheless, we show that simple variants of the basic MNSUSY model are safe from present flavor constraints arising from kaon and $B$-meson oscillations, the rare decays $B_{s,d} \to \mu^+ \mu^-$, $\mu \to {\bar e}ee$ and $\mu$-$e$ conversion in nuclei. We also briefly discuss some special features of the radiative decays $\mu \to e \gamma$ and ${\bar B}\to X_s \gamma$. Future experiments, especially those concerned with lepton flavor violation, should see deviations from SM predictions unless one of the MNSUSY variants with enhanced flavor symmetries is realized.Comment: 28 pages, 19 figures; references added, typos correcte

Consensus stabilizability and exact consensus controllability of multi-agent linear systems

A goal in engineering systems is to try to control them. Control theory offers mathematical tools for steering engineered systems towards a desired state. Stabilizability and controllability can be studied under different points of view, in particular, we focus on measure of controllability in the sense of the minimum set of controls that need for to steer the multiagent system toward any desired state. In this paper, we study the consensus stabilizability and exact consensus controllability of multi-agent linear systems, in which all agents have a same linear dynamic mode that can be in any orderPostprint (published version

Analyzing controllability of neural networks

In recent years, due to the relation between cognitive control and mathematical concept of control dynamical systems, there has been growing interest in the descriptive analysis of complex networks with linear dynamics, permeating many aspects from everyday life, obtaining considerable advances in the description of their structural and dynamical properties. Nevertheless, much less effort has been devoted to studying the controllability of the dynamics taking place on them. Concretely, for complex systems is of interest to study the exact controllability, this measure is defined as the minimum set of controls that are needed to steer the whole system toward any desired state. In this paper, a revision of controllability concepts is presented and provides conditions for exact controllability for the multiagent systemsPostprint (author's final draft

Complete intersections in simplicial toric varieties

Given a set $\mathcal A = \{a_1,\ldots,a_n\} \subset \mathbb{N}^m$ of nonzero vectors defining a simplicial toric ideal $I_{\mathcal A} \subset k[x_1,...,x_n]$, where $k$ is an arbitrary field, we provide an algorithm for checking whether $I_{\mathcal A}$ is a complete intersection. This algorithm does not require the explicit computation of a minimal set of generators of $I_{\mathcal A}$. The algorithm is based on the application of some new results concerning toric ideals to the simplicial case. For homogenous simplicial toric ideals, we provide a simpler version of this algorithm. Moreover, when $k$ is an algebraically closed field, we list all ideal-theoretic complete intersection simplicial projective toric varieties that are either smooth or have one singular point.Comment: 28 pages, 2 tables. To appear in Journal of Symbolic Computatio

A new method for the identification of the parameters of the Dahl model

Postprint (author's final draft

Wind profile prediction using linear Markov chains: A linear algebra approach

To predict the future wind speed and wind direction is of relevance to the wind industry to maximize the power generation. In this regards, this article describes a methodology for the construction of predictive models based on linear Markov chains under linear algebra point of view. The model analyzes the direction and speed of the wind obtained from a meteorological station. This Model allows making a precise study of wind direction and speeding data; figure out the stability, the most common direction or speed, its behaviour depending on the hours or seasons.Peer ReviewedPostprint (author's final draft

On stability and controllability of multi-agent linear systems

Recent advances in communication and computing have made the control and coordination of dynamic network agents to become an area of multidisciplinary research at the intersection of the theory of control systems, communication and linear algebra. The advances of the research in multi-agent systems are strongly supported by their critical applications in different areas as for example in consensus problem of communication networks, or formation control of mobile robots. Mainly, the consensus problem has been studied from the point of view of stability. Nevertheless, recently some researchers have started to analyze the controllability problems. The study of controllability is motivated by the fact that the architecture of communication network in engineering multi-agent systems is usually adjustable. Therefore, it is meaningful to analyze how to improve the controllability of a multi-agent system. In this work we analyze the stability and controllability of multiagent systems consisting of k + 1 agents with dynamics x¿i = Aixi + Biui, i = 0, 1, . . . , kPostprint (published version

Fair value on commons-based intellectual property assets: Lessons of an estimation over Linux kernel.

Open source describes practices in production and development that promote access to the end product's source materials, spreading development burden amongst individuals and companies. This model has resulted in a large and efficient ecosystem and unheralded software innovation, freely available to society. Open source methods are also increasingly being applied in other fields of endeavour, such as biotechnology or cultural production. But under financial reporting framework, general volunteer activity is not reflected on financial statements. As a result, there is not value of volunteer contributions and there is also no single source for cost estimates of how much it has taken to develop an open source technology. This volunteer activity encloses not only individuals but corporations developing and contributing open source products. Standard methodology for reporting open source asset valuation is needed and must include value creation from the perspective of the different stakeholders.FLOSS, commons, accounting standards, financial reporting