Playing Stackelberg Opinion Optimization with Randomized Algorithms for Combinatorial Strategies

From a perspective of designing or engineering for opinion formation games in social networks, the "opinion maximization (or minimization)" problem has been studied mainly for designing subset selecting algorithms. We furthermore define a two-player zero-sum Stackelberg game of competitive opinion optimization by letting the player under study as the first-mover minimize the sum of expressed opinions by doing so-called "internal opinion design", knowing that the other adversarial player as the follower is to maximize the same objective by also conducting her own internal opinion design. We propose for the min player to play the "follow-the-perturbed-leader" algorithm in such Stackelberg game, obtaining losses depending on the other adversarial player's play. Since our strategy of subset selection is combinatorial in nature, the probabilities in a distribution over all the strategies would be too many to be enumerated one by one. Thus, we design a randomized algorithm to produce a (randomized) pure strategy. We show that the strategy output by the randomized algorithm for the min player is essentially an approximate equilibrium strategy against the other adversarial player

Extraction of Various Five-Quark Components of the Nucleons

We have generalized the approach of Brodsky {\it et al.} for the intrinsic charm quark distribution in the nucleons to the light-quark sector involving intrinsic $\bar u, \bar d, s$ and $\bar s$ sea quarks. We compare the calculations with the existing $\bar d - \bar u$, $s + \bar s$, and $\bar u + \bar d - s -\bar s$ data. The good agreement between the theory and the data allows the extraction of the probabilities for the $|uudu\bar{u}>$, $|uudd\bar{d}>$, and $|uuds\bar{s}>$ five-quark Fock states in the proton. We also calculate the $x$-dependence of the intrinsic charm after taking into consideration the QCD evolution of the intrinsic quark distribution.Comment: 4 pages, 4 figures; version published; Wrong page number of Ref. [3] is correcte

The anomalous antiferromagnetic topological phase in pressurized SmB6

Antiferromagnetic materials, whose time-reversal symmetry is broken, can be classified into the Z2 topology if they respect some specific symmetry. Since the theoretical proposal, however, no materials have been found to host the antiferromagnetic topological (AFT) phase to date. Here, for the first time, we demonstrate that the topological Kondo insulator SmB6 can be an AFT system when pressurized to undergo an antiferromagnetic phase transition. In addition to propose the possible candidate for an AFT material, in this work we also illustrate the anomalous topological surface states of the AFT phase which has not been discussed before. Originating from the interplay between the topological properties and the antiferromagnetic surface magnetization, the topological surface states of the AFT phase behave differently as compared with those of a topological insulator. Besides, the AFT insulators are also found promising in the generation of tunable spin currents, which is an important application in spintronics

A GPU Poisson-Fermi Solver for Ion Channel Simulations

The Poisson-Fermi model is an extension of the classical Poisson-Boltzmann model to include the steric and correlation effects of ions and water treated as nonuniform spheres in aqueous solutions. Poisson-Boltzmann electrostatic calculations are essential but computationally very demanding for molecular dynamics or continuum simulations of complex systems in molecular biophysics and electrochemistry. The graphic processing unit (GPU) with enormous arithmetic capability and streaming memory bandwidth is now a powerful engine for scientific as well as industrial computing. We propose two parallel GPU algorithms, one for linear solver and the other for nonlinear solver, for solving the Poisson-Fermi equation approximated by the standard finite difference method in 3D to study biological ion channels with crystallized structures from the Protein Data Bank, for example. Numerical methods for both linear and nonlinear solvers in the parallel algorithms are given in detail to illustrate the salient features of the CUDA (compute unified device architecture) software platform of GPU in implementation. It is shown that the parallel algorithms on GPU over the sequential algorithms on CPU (central processing unit) can achieve 22.8x and 16.9x speedups for the linear solver time and total runtime, respectively.Comment: 21 pages, 5 figure

Estimating Markov-Switching ARMA Models with Extended Algorithms of Hamilton

This paper proposes two innovative algorithms to estimate a general class of N-state Markov-switching autoregressive moving-average (MS-ARMA) models with a sample of size T. To resolve the problem of NT possible routes induced by the presence of MA parameters, the first algorithm is built on Hamilton’s (1989) method and Gray’s (1996) idea of replacing the lagged error terms with their corresponding conditional expectations. We thus name it as the Hamilton-Gray (HG) algorithm. The second method refines the HG algorithm by recursively updating the conditional expectations of these errors and is named as the extended Hamilton-Gray (EHG) algorithm. The computational cost of both algorithms is very mild, because the implementation of these algorithms is very much similar to that of Hamilton (1989). The simulations show that the finite sample performance of the EHG algorithm is very satisfactory and is much better than that of the HG counterpart. We also apply the EHG algorithm to the issues of dating U.S. business cycles with the same real GNP data employed in Hamilton (1989). The turning points identified with the EHG algorithm resemble closely to those of the NBER’s Business Cycle Dating Committee and confirm the robustness of the findings in Hamilton (1989) about the effectiveness of Markov-switching models in dating U.S. business cycles.Markov-switching, ARMA process

Projection filters for modal parameter estimate for flexible structures

Single-mode projection filters are developed for eigensystem parameter estimates from both analytical results and test data. Explicit formulations of these projection filters are derived using the pseudoinverse matrices of the controllability and observability matrices in general use. A global minimum optimization algorithm is developed to update the filter parameters by using interval analysis method. Modal parameters can be attracted and updated in the global sense within a specific region by passing the experimental data through the projection filters. For illustration of this method, a numerical example is shown by using a one-dimensional global optimization algorithm to estimate model frequencies and dampings

The program FANS-3D (finite analytic numerical simulation 3-dimensional) and its applications

In this study, the program named FANS-3D (Finite Analytic Numerical Simulation-3 Dimensional) is presented. FANS-3D was designed to solve problems of incompressible fluid flow and combined modes of heat transfer. It solves problems with conduction and convection modes of heat transfer in laminar flow, with provisions for radiation and turbulent flows. It can solve singular or conjugate modes of heat transfer. It also solves problems in natural convection, using the Boussinesq approximation. FANS-3D was designed to solve heat transfer problems inside one, two and three dimensional geometries that can be represented by orthogonal planes in a Cartesian coordinate system. It can solve internal and external flows using appropriate boundary conditions such as symmetric, periodic and user specified

Kinematic Basis of Emergent Energetics of Complex Dynamics

Stochastic kinematic description of a complex dynamics is shown to dictate an energetic and thermodynamic structure. An energy function $\varphi(x)$ emerges as the limit of the generalized, nonequilibrium free energy of a Markovian dynamics with vanishing fluctuations. In terms of the $\nabla\varphi$ and its orthogonal field $\gamma(x)\perp\nabla\varphi$, a general vector field $b(x)$ can be decomposed into $-D(x)\nabla\varphi+\gamma$, where $\nabla\cdot\big(\omega(x)\gamma(x)\big)=$ $-\nabla\omega D(x)\nabla\varphi$. The matrix $D(x)$ and scalar $\omega(x)$, two additional characteristics to the $b(x)$ alone, represent the local geometry and density of states intrinsic to the statistical motion in the state space at $x$. $\varphi(x)$ and $\omega(x)$ are interpreted as the emergent energy and degeneracy of the motion, with an energy balance equation $d\varphi(x(t))/dt=\gamma D^{-1}\gamma-bD^{-1}b$, reflecting the geometrical $\|D\nabla\varphi\|^2+\|\gamma\|^2=\|b\|^2$. The partition function employed in statistical mechanics and J. W. Gibbs' method of ensemble change naturally arise; a fluctuation-dissipation theorem is established via the two leading-order asymptotics of entropy production as $\epsilon\to 0$. The present theory provides a mathematical basis for P. W. Anderson's emergent behavior in the hierarchical structure of complexity science.Comment: 7 page

Flavor Asymmetry of the Nucleon Sea and the Five-Quark Components of the Nucleons

The existence of the five-quark Fock states for the intrinsic charm quark in the nucleons was suggested some time ago, but conclusive evidence is still lacking. We generalize the previous theoretical approach to the light-quark sector and study possible experimental signatures for such five-quark states. In particular, we compare the $\bar d - \bar u$ and $\bar u + \bar d - s -\bar s$ data with the calculations based on the five-quark Fock states. The qualitative agreement between the data and the calculations is interpreted as evidence for the existence of the intrinsic light-quark sea in the nucleons. The probabilities for the $|uudu\bar{u}>$ and $|uudd\bar{d}>$ Fock states are also extracted.Comment: 4 pages, 3 figure