Terry Adams Research

AI-Powered Social Bots

This paper gives an overview of impersonation bots that generate output in one or possibly, multiple modalities. We also discuss rapidly advancing areas of machine learning and artificial intelligence that could lead to frighteningly powerful new social bots. Our main conclusion is that most commonly known bots are one dimensional (i.e., chatterbot), and far from deceiving serious interrogators. However, using recent advances in machine learning, it might soon be possible to unleash incredibly powerful, human-like armies of social bots, in potentially well coordinated campaigns of deception and influence.


Constructive symbolic presentations of rank one systems

(joint with Sebastien Ferenczi and Karl Petersen) Given a rank one measure-preserving system defined by cutting and stacking with spacers, we produce a rank one binary sequence such that its orbit closure under the shift transformation, with its unique {nonatomic} invariant probability, is isomorphic to the given system. In particular, the classical dyadic odometer is presented in terms of a recursive sequence of blocks on the two-symbol alphabet {0, 1}.


Rigidity Sequences of Power Rationally Weakly Mixing Transformations

We prove that a class of infinite measure preserving transformations, satisfying a "strong" weak mixing condition, generates all rigidity sequences of all conservative ergodic invertible measure preserving transformations defined on a Lebesgue sigma-finite measure space. This result generalizes results in this publication by the same author: Tower Multiplexing and Slow Weak Mixing


Infinite transformations with maximal control of ergodic two-fold product powers

(with Cesar Silva) A family of infinite measure preserving transformations are constructed such that for any subset R of rationals contained in (0,1), there exists a transformation T in the family such that T^p x T^q is ergodic precisely when p/q is in R.


Development of a Big Data Framework for Connectomic Research

This paper outlines research and development of a new Hadoop-based architecture for distributed processing and analysis of electron microscopy of brains. We show development of a new C++ library for implementation of 3D image analysis techniques, and deployment in a distributed map/reduce framework. We demonstrate our new framework on a subset of the Kasthuri11 dataset from the Open Connectome Project.

Ganita means mathematics in Sanskrit and Hindi.

Probability, statistical learning theory and nonparametric estimation

Research in this area has focused on questions concerning estimation from dependent processes, uniform convergence of the strong law of large numbers for families of sets or functions, uniform weak convergence, and uniform mixing classes. More recent unpublished research is looking at time series analysis of real-world observations.read more>>

Ergodic theory and dynamical systems research

Research is focused on mixing properties, construction of examples through cutting-and-stacking, and generalization of cutting-and-stacking to generic measure preserving actions.read more>>

Topic By Collaborators Updated
Ergodic theory questions concerning coboundaries (with Joe Rosenblatt) Ganita 1 1-4-2014 00:04 AM
Social Bots Ganita 1 1-4-2014 00:03 AM
Ergodicity and Conservativity of Rank-1 Infinite Transformations (with Cesar Silva) Ganita 1 1-4-2014 00:02 AM
Weak Mixing Rigid Transformations Ganita 1 1-4-2014 00:01 AM
Connectomic Research Ganita 1 1-4-2014 00:00 AM