Engineering Papers⌕ Search

Engineering topics

Weinstein, Marvin

Publications and source records attributed to Weinstein, Marvin.

Systems and methods for determining optimal parameters for dynamic quantum clustering analyses

In the present work, quantum clustering is extended to provide a dynamical approach for data clustering using a time-dependent Schrodinger equation. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering. Additionally, the parameters of the analysis can be modified in order to improve the efficiency of the dynamic quantum clustering processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Using Dynamic Quantum Clustering to Analyze Hierarchically Heterogeneous Samples on the Nanoscale

Dynamic Quantum Clustering (DQC) is an unsupervised, high visual data mining technique. DQC was tested as an analysis method for X-ray Absorption Near Edge Structure (XANES) data from the Transmission X-ray Microscopy (TXM) group. The TXM group images hierarchically heterogeneous materials with nanoscale resolution and large field of view. XANES data consists of energy spectra for each pixel of an image. It was determined that DQC successfully identifies structure in data of this type without prior knowledge of the components in the sample. Clusters and sub-clusters clearly reflected features of the spectra that identified chemical component, chemical environment, and density in the image. DQC can also be used in conjunction with the established data analysis technique, which does require knowledge of components present.

99 GENERAL AND MISCELLANEOUS↗

A Different Look at Dark Energy and the Time Variation of Fundamental Constants

This paper makes the simple observation that a fundamental length, or cutoff, in the context of Friedmann-Lemaitre-Robertson-Walker (FRW) cosmology implies very different things than for a static universe. It is argued that it is reasonable to assume that this cutoff is implemented by fixing the number of quantum degrees of freedom per co-moving volume (as opposed to a Planck volume) and the relationship of the vacuum-energy of all of the fields in the theory to the cosmological constant (or dark energy) is re-examined. The restrictions that need to be satisfied by a generic theory to avoid conflicts with current experiments are discussed, and it is shown that in any theory satisfying these constraints knowing the difference between w and minus one allows one to predict w. It is argued that this is a robust result and if this prediction fails the idea of a fundamental cutoff of the type being discussed can be ruled out. Finally, it is observed that, within the context of a specific theory, a co-moving cutoff implies a predictable time variation of fundamental constants. This is accompanied by a general discussion of why this is so, what are the strongest phenomenological limits upon this predicted variation, and which limits are in tension with the idea of a co-moving cutoff. It is pointed out, however, that a careful comparison of the predicted time variation of fundamental constants is not possible without restricting to a particular model field-theory and that is not done in this paper.

79 ASTRONOMY AND ASTROPHYSICS↗

Massive Degeneracy and Goldstone Bosons: A Challenge for the Light Cone

Wherein it is argued that the light front formalism has problems dealing with Goldstone symmetries. It is further argued that the notion that in hadron condensates can explain Goldstone phenomena is false. This talk can be summarized as follows: (1) Exact symmetries can be realized in Wigner or Goldstone mode. (2) When a symmetry is realized in Wigner mode the states of the theory form degenerate irreducible representations of the symmetry group and the lowest energy state is unique. (3) When a symmetry is realized in Goldstone mode the lowest energy state of the theory is infinitely degenerate, the states of the theory do not form irreducible representations of the symmetry group and there are massless particles coupled by the conserved currents to any one of the possible ground states. (4) In finite volume the signal of a Goldstone realization of a symmetry is that the number of nearly degenerate states grows rapidly with increasing volume and the gap between these states shrinks exponentially with the volume. (5) The existence of a condensate such as the magnetization, for a ferromagnet, or the staggered magnetization for an anti-ferromagnet, signals a Goldstone symmetry. This is because this condensate transforms non-trivially under the symmetry transformations and so its existence implies the ground state isn't unique. (6) PCAC means that the pion, kaon and eta are would be Goldstone bosons of the theory where the quark masses are set to zero. This interpretation is overwhelmingly supported by experimental data. This means that these particles are really the wiggling of the order parameter or condensate. (7) Finally, in order for the Goldstone particle to exist there has to be something to wiggle every place where the particle can exist. This means that the condensate that is the order parameter for this Goldstone symmetry cannot be confined to the interior of hadrons. Thus, to reiterate, the challenge for the Light Front is to show how the formalism gives rise to this sort of pattern of degeneracy when the physical volume of space becomes large.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Strange Bedfellows: Quantum Mechanics and Data Mining

Last year, in 2008, I gave a talk titled Quantum Calisthenics. This year I am going to tell you about how the work I described then has spun off into a most unlikely direction. What I am going to talk about is how one maps the problem of finding clusters in a given data set into a problem in quantum mechanics. I will then use the tricks I described to let quantum evolution lets the clusters come together on their own.

99 GENERAL AND MISCELLANEOUS↗

Dynamic quantum clustering: a tool for visual exploration of structures in data

A given set of data-points in some feature space may be associated with a Schroedinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged dynamical scheme using a time-dependent Schroedinger equation. Moreover, we approximate this Hamiltonian formalism by a truncated calculation within a set of Gaussian wave functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Quantum Calisthenics: Gaussians, The Path Integral and Guided Numerical Approximations

It is apparent to anyone who thinks about it that, to a large degree, the basic concepts of Newtonian physics are quite intuitive, but quantum mechanics is not. My purpose in this talk is to introduce you to a new, much more intuitive way to understand how quantum mechanics works. I begin with an incredibly easy way to derive the time evolution of a Gaussian wave-packet for the case free and harmonic motion without any need to know the eigenstates of the Hamiltonian. This discussion is completely analytic and I will later use it to relate the solution for the behavior of the Gaussian packet to the Feynman path-integral and stationary phase approximation. It will be clear that using the information about the evolution of the Gaussian in this way goes far beyond what the stationary phase approximation tells us. Next, I introduce the concept of the bucket brigade approach to dealing with problems that cannot be handled totally analytically. This approach combines the intuition obtained in the initial discussion, as well as the intuition obtained from the path-integral, with simple numerical tools. My goal is to show that, for any specific process, there is a simple Hilbert space interpretation of the stationary phase approximation. I will then argue that, from the point of view of numerical approximations, the trajectory obtained from my generalization of the stationary phase approximation specifies that subspace of the full Hilbert space that is needed to compute the time evolution of the particular state under the full Hamiltonian. The prescription I will give is totally non-perturbative and we will see, by the grace of Maple animations computed for the case of the anharmonic oscillator Hamiltonian, that this approach allows surprisingly accurate computations to be performed with very little work. I think of this approach to the path-integral as defining what I call a guided numerical approximation scheme. After the discussion of the anharmonic oscillator I will turn to tunneling problems and show that the instanton can also be though of in the same way. I will do this for the classic problem of a double well potential in the extreme limit when the splitting between the two lowest levels is extremely small and the tunneling rate from one well to another is also very small.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Dynamic Quantum Clustering: A Tool for Unsupervised Exploration of Structures in Data

A given set of data-points in some feature space may be associated with a Schroedinger equation whose potential is determined by the data. This is known to lead to good clustering solutions. Here we extend this approach into a full-fledged dynamical scheme using a time-dependent Schroedinger equation with a small diffusion component. Moreover, we approximate this Hamiltonian formalism by a truncated calculation within a set of Gaussian wave functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition or feature filtering.

97 MATHEMATICS AND COMPUTING↗