TL;DR: This work focuses on an unsupervised method based on self-organizing maps (SOM) that is applied to a set of nonparametric variability estimators that can be applied to any time-sampled light curve.
Abstract: Machine-learning (ML) algorithms will play a crucial role in studying the large data sets delivered by new facilities over the next decade and beyond. Here, we investigate the capabilities and limits of such methods in finding galaxies with brightness-variable active galactic nuclei (AGNs). Specifically, we focus on an unsupervised method based on self-organizing maps (SOM) that we apply to a set of nonparametric variability estimators. This technique allows us to maintain domain knowledge and systematics control while using all the advantages of ML. Using simulated light curves that match the noise properties of observations, we verify the potential of this algorithm in identifying variable light curves. We then apply our method to a sample of ~8300 WISE color-selected AGN candidates in Stripe 82, in which we have identified variable light curves by visual inspection. We find that with ML we can identify these variable classified AGN with a purity of 86% and a completeness of 66%, a performance that is comparable to that of more commonly used supervised deep-learning neural networks. The advantage of the SOM framework is that it enables not only a robust identification of variable light curves in a given data set, but it is also a tool to investigate correlations between physical parameters in multidimensional space—such as the link between AGN variability and the properties of their host galaxies. Finally, we note that our method can be applied to any time-sampled light curve (e.g., supernovae, exoplanets, pulsars, and other transient events).
TL;DR: Results of experiments show that the method not only has the capability of identifying variable scale communities but also can obtain an equivalent result of community identification of topological potential method.
Abstract: Topological potential theory is a novel community identification theory on complex networks.Aiming at some inadequacies of the theory and its method,such as ambiguous application scope and excessively sparse overlapping nodes,a variable scale network overlapping community identification method based on identity uncertainty is proposed.On the basis of proving the existence of the minimum point of topological potential entropy,the method identifies communities effectively by proposing an identity uncertainty measure of overlapping nodes and an idea of variable scale community.The effectiveness and reasonableness of the measure are verified in experiments.The results of experiments show that the method not only has the capability of identifying variable scale communities but also can obtain an equivalent result of community identification of topological potential method.
TL;DR: This extended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality with overall motivation to have a calculus which simultaneously has invariance under order of rule application.
Abstract: This extended abstract motivates and presents techniques for identifying variable independence in free variable calculi for classical logic without equality. Two variables are called independent when it is sound to instantiate them differently. The goal of the uniform variable splitting technique, first presented in [14], is to label variables differently (modulo a set of equations) exactly when they are variable independent. The overall motivation is to have a calculus which simultaneously has: (1) invariance under order of rule application (to enable goal-directed search, since rules then can be applied in any order), (2) introduction of free variables instead of arbitrary terms (to reduce the instantiation problem to a unification problem), and (3) a branchwise restriction of the search space (to allow branchwise termination criteria and early termination in cases of unprovability). Following the notation of Smullyan [11], both formulae and inferences will have type , , or . A -inference always has a principal formula of type ; atomic formulae have no type.
TL;DR: In this article, the authors present a system and method for identifying variable walk speed, which includes several sensors arranged in different locations of some building to provide speed and location signals of some one, and one processor-based device to receive the speed and/or location signals.
Abstract: The present invention provides one kind of system and method for identifying variable walk speed. The system includes several sensors arranged in different locations of some building to provide speed and/or location signals of some one, and one processor-based device to receive the speed and/or location signals, to determine the walking time of some one to pass through some path and to store the walking time data.
TL;DR: In this paper, a system of one or more processors, method, and computer readable storage medium, by which a source program having at least one inner scope is processed by identifying variable names in the source program that are upward referencing and storing the upward referencing variable names with an identifier for the associated scope.
Abstract: A system of one or more processors, method, and computer readable storage medium, by which a source program having at least one inner scope is processed by identifying variable names in the source program that are upward referencing and storing the upward referencing variable names with an identifier for the associated scope. A candidate shadow variable in a current scope of the source program is determined from variable names that are not among the identified upward referencing variable names. The determined candidate shadow variable is renamed to a variable name that is in an outer scope relative to the current scope. The source program is stored with the renamed variable. The stored source program can be compressed to a size smaller than the original source program in order to require less bandwidth during transmission over a network.