Physical Sciences and Mathematics Commons^™

Capturing Data Uncertainty In Highvolume Stream Processing, Yanlei Diao, Boduo Li, Anna Liu, Liping Peng, Charles Sutton, Thanh Tran, Michael Zink

Yanlei Diao

We present the design and development of a data stream system that captures data uncertainty from data collection to query processing to final result generation. Our system focuses on data that is naturally modeled as continuous random variables such as many types of sensor data. To provide an end-to-end solution, our system employs probabilistic modeling and inference to generate uncertainty description for raw data, and then a suite of statistical techniques to capture changes of uncertainty as data propagates through query operators. To cope with high-volume streams, we explore advanced approximation techniques for both space and time efficiency. We are …

Discrete Breathers At The Interface Between A Diatomic And A Monoatomic Granular Chain, C. Hoogeboom, G. Theocharis, Panos Kevrekidis

Panos Kevrekidis

In the present work, we develop a systematic examination of the existence, stability, and dynamical properties of a discrete breather at the interface between a diatomic and a monoatomic granular chain. We remarkably find that such an “interface breather” is more robust than its bulk diatomic counterpart throughout the gap of the linear spectrum. The latter linear spectral gap needs to exist for the breather state to arise and the relevant spectral conditions are discussed. We illustrate the minimal excitation conditions under which such an interface breather can be “nucleated” and analyze its apparently weak interaction with regular highly nonlinear …

Differential Geometry Based Solvation Model I: Eulerian Formulation, Zhan Chen, Nathan A. Baker, Guo-Wei Wei

Zhan Chen

This paper presents a differential geometry based model for the analysis and computation of the equilibrium property of solvation. Differential geometry theory of surfaces is utilized to define and construct smooth interfaces with good stability and differentiability for use in characterizing the solvent–solute boundaries and in generating continuous dielectric functions across the computational domain. A total free energy functional is constructed to couple polar and nonpolar contributions to the solvation process. Geometric measure theory is employed to rigorously convert a Lagrangian formulation of the surface energy into an Eulerian formulation so as to bring all energy terms into an equal …

Technology Integration In Secondary Mathematics Classrooms: Effect On Students’ Understanding, Megan Sheehan, Leah A. Nillas

Leah A. Nillas

Technology use in secondary mathematics courses has the potential to bring about broad changes in learning environment and teaching pedagogy, allowing students to communicate and collaborate in new ways and to conjecture, justify, and generalize findings. However, this potential is only realized when teachers use technology in ways encouraging these outcomes (Galbraith, 2006). The purpose of this study is to examine the integration of technology in secondary mathematics classrooms and to evaluate the effectiveness of its use in relation to students’ learning outcomes. This self study research was conducted in honors geometry and AP calculus classes. Data sources included transcripts …

Morphogrammatics Of Reflection, Rudolf Kaehr

Rudolf Kaehr

Turning back from the studies of morphogrammatics to some open questions of reflectional programming, the recountered problematics might be put into a different light and new methods of handling formal aspects of reflection and reflectionality shall be introduced. Albeit the use of light-metaphors, morphogrammatic reflection is not sketched along the paradigm of optical metaphors. Morphograms are presenting neither propositions nor perceptions able for mirroring (representation). Exercises in defining morphogrammatic retro-grade recursion and reflection schemata are continued from the paper “Sketches to Morphogrammatic Programming”.

The Positive Solutions Of The Matukuma Equation And The Problem Of Finite Radius And Finite Mass, Jurgen Batt, Yi Li

Yi Li

This work is an extensive study of the 3 different types of positive solutions of the Matukuma equation 1r2(r2ϕ′)′=−rλ−2(1+r2)λ/2ϕp,p>1,λ>0 : the E-solutions (regular at r = 0), the M-solutions (singular at r = 0) and the F-solutions (whose existence begins away from r = 0). An essential tool is a transformation of the equation into a 2-dimensional asymptotically autonomous system, whose limit sets (by a theorem of H. R. Thieme) are the limit sets of Emden–Fowler systems, and serve as to characterizate the different solutions. The emphasis lies on the study of the M-solutions. …

The Politics Before The Politics: Census 2010, Reapportionment, And Redistricting, Karen Saxe, T. Ratliff

Karen Saxe

No abstract provided.

One-Dimensional Wave Equations Defined By Fractal Laplacians, John Fun-Choi Chan, Sze-Man Ngai, Alexander Teplyaev

Sze-Man Ngai

We study one-dimensional wave equations defined by a class of fractal Laplacians. These Laplacians are defined by fractal measures generated by iterated function systems with overlaps. We prove the existence and uniqueness of weak solutions. We also study numerical computations of the solutions and prove the convergence of the approximation scheme. This is a joint work with John F. Chan and Alexander Teplyaev.

The Geometry Of The Snail Ball, Stan Wagon

Stan Wagon, Retired

No abstract provided.

Characterizing Preservice Teachers’ Mathematical Understanding Of Algebraic Relationships, Leah A. Nillas

Leah A. Nillas

The Hamiltonian Index Of Graphs, Yi Hong, Jian-Liang Lin, Zhi-Sui Tao, Zhi-Hong Chen

Zhi-Hong Chen

The Hamiltonian index of a graph G is defined as h ( G ) = min { m : L m ( G ) is Hamiltonian } . In this paper, using the reduction method of Catlin [P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988) 29–44], we constructed a graph H ̃ ( m ) ( G ) from G and prove that if h ( G ) ≥ 2 , then h ( G ) = min{ m : H ̃ ( m ) ( G ) has a spanning Eulerian subgraph …

Wavelet-Based Bayesian Estimation Of Partially Linear Regression Models With Long Memory Errors, Kyungduk Ko, Leming Qu, Marina Vannucci

Kyungduk Ko

In this paper we focus on partially linear regression models with long memory errors, and propose a wavelet-based Bayesian procedure that allows the simultaneous estimation of the model parameters and the nonparametric part of the model. Employing discrete wavelet transforms is crucial in order to simplify the dense variance-covariance matrix of the long memory error. We achieve a fully Bayesian inference by adopting a Metropolis algorithm within a Gibbs sampler. We evaluate the performances of the proposed method on simulated data. In addition, we present an application to Northern hemisphere temperature data, a benchmark in the long memory literature.

Compactons In Nonlinear Schrödinger Lattices With Strong Nonlinearity Management, F. Kh. Abdullaev, Panos Kevrekidis, M. Salerno

Panos Kevrekidis

The existence of compactons in the discrete nonlinear Schr\"odinger equation in the presence of fast periodic time modulations of the nonlinearity is demonstrated. In the averaged DNLS equation the resulting effective inter-well tunneling depends on modulation parameters {\it and} on the field amplitude. This introduces nonlinear dispersion in the system and can lead to a prototypical realization of single- or multi-site stable discrete compactons in nonlinear optical waveguide and BEC arrays. These structures can dynamically arise out of Gaussian or compactly supported initial data.

Energetyka Niskoemisyjna, Wojciech M. Budzianowski

Wojciech Budzianowski

No abstract provided.

Torsion In The Cohomology Of Congruence Subgroups Of Sl (4. Z) And Galois Representations, Avner Ash, Paul E. Gunnells, Mark Mcconnell

Paul Gunnells

We report on the computation of torsion in certain homology theories of congruence subgroups of SL(4,Z). Among these are the usual group cohomology, the Tate–Farrell cohomology, and the homology of the sharbly complex. All of these theories yield Hecke modules. We conjecture that the Hecke eigenclasses in these theories have attached Galois representations. The interpretation of our computations at the torsion primes 2, 3, 5 is explained. We provide evidence for our conjecture in the 15 cases of odd torsion that we found in levels ⩽31.

Africa In The World Trade Network, Luca De Benedictis

Luca De Benedictis

Accuracy, Resolution And Stability Properties Of A Modified Chebyshev Method, Jodi Mead, Rosemary A. Renaut

Jodi Mead

While the Chebyshev pseudospectral method provides a spectrally accurate method, integration of partial differential equations with spatial derivatives of order M requires time steps of approximately O(N−2M) for stable explicit solvers. Theoretically, time steps may be increased to O(N−M) with the use of a parameter, α-dependent mapped method introduced by Kosloff and Tal-Ezer [ J. Comput. Phys., 104 (1993), pp. 457–469]. Our analysis focuses on the utilization of this method for reasonable practical choices for N, namely N ≲ 30, as may be needed for two- or three dimensional modeling. Results presented confirm that spectral accuracy with increasing N is …

Boundary Type Quadrature Formulas Over Axially Symmetric Regions, Tian-Xiao He

Tian-Xiao He

A boundary type quadrature formula (BTQF) is an approximate integration formula with all its of evaluation points lying on the Boundary of the integration domain. This type formulas are particularly useful for the cases when the values of the integrand functions and their derivatives inside the domain are not given or are not easily determined. In this paper, we will establish the BTQFs over sonic axially symmetric regions. We will discuss time following three questions in the construction of BTQFs: (i) What is the highest possible degree of algebraic precision of the BTQF if it exists? (ii) What is the …

Scalable Probabilistic Databases With Factor Graphs And Mcmc, Michael Wick, Andrew Mccallum, Gerome Miklau

Andrew McCallum

Probabilistic databases play a crucial role in the management and understanding of uncertain data. However, incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or restrict the class of relational algebra formula under which they are closed. We propose an alternative approach where the underlying relational database always represents a single world, and an external factor graph encodes a distribution over possible worlds; Markov chain Monte Carlo (MCMC) inference is then used to recover this uncertainty to a desired level of fidelity. Our approach allows the efficient evaluation of arbitrary …

The Hamiltonian Index Of Graphs, Zhi-Hong Chen, Yi Hong, Jian-Liang Lin, Zhi-Sui Tao

Zhi-Hong Chen

The Hamiltonian index of a graph GG is defined as h(G)=min{m:Lm(G) is Hamiltonian}.h(G)=min{m:Lm(G) is Hamiltonian}. In this paper, using the reduction method of Catlin [P.A. Catlin, A reduction method to find spanning Eulerian subgraphs, J. Graph Theory 12 (1988) 29–44], we constructed a graph sourceH̃^(m)(G) from GG and prove that if h(G)≥2h(G)≥2, then h(G) = min{m : H̃^(m)(G) has a spanning Eulerian subgraph}.

Spanning Eulerian Subgraphs In Claw-Free Graphs, Zhi-Hong Chen, Hong-Jian Lai, Weiqi Luo, Yehomg Shao

Zhi-Hong Chen

A graph is claw-free if it has no induced K 1,3, subgraph. A graph is essential 4-edge-connected if removing at most three edges, the resulting graph has at most one component having edges. In this note, we show that every essential 4-edge-connected claw free graph has a spanning Eulerian subgraph with maximum degree at most 4.

Spanning Trails Containing Given Edges, Weiqi Luo, Zhi-Hong Chen, Wei-Guo Chen

Zhi-Hong Chen

A graph G is Eulerian-connected if for any u and v in V ( G ) , G has a spanning ( u , v ) -trail. A graph G is edge-Eulerian-connected if for any e ′ and e ″ in E ( G ) , G has a spanning ( e ′ , e ″ ) -trail. For an integer r ⩾ 0 , a graph is called r -Eulerian-connected if for any X ⊆ E ( G ) with | X | ⩽ r , and for any u , v ∈ V ( G ) , G …

Collapsible Graphs And Reductions Of Line Graphs, Zhi-Hong Chen, Peter C.B. Lam, Wai-Chee Shiu

Zhi-Hong Chen

A graph G is collapsible if for every even subset X ⊆ V ( G ) , G has a subgraph such that G − E ( Γ ) is connected and the set of odd-degree vertices of Γ is X . A graph obtained by contracting all the non-trivial collapsible subgraphs of G is called the reduction of G . In this paper, we characterize graphs of diameter two in terms of collapsible subgraphs and investigate the relationship between the line graph of the reduction and the reduction of the line graph. Our results extend former results in [H.-J. …

The Shallow Water Equations In Lagrangian Coordinates, J. L. Mead

Jodi Mead

Recent advances in the collection of Lagrangian data from the ocean and results about the well-posedness of the primitive equations have led to a renewed interest in solving flow equations in Lagrangian coordinates. We do not take the view that solving in Lagrangian coordinates equates to solving on a moving grid that can become twisted or distorted. Rather, the grid in Lagrangian coordinates represents the initial position of particles, and it does not change with time. However, using Lagrangian coordinates results in solving a highly nonlinear partial differential equation. The nonlinearity is mainly due to the Jacobian of the coordinate …

Towards Regional Assimilation Of Lagrangian Data: The Lagrangian Form Of The Shallow Water Reduced Gravity Model And Its Inverse, J. L. Mead, A. F. Bennett

Jodi Mead

Variational data assimilation for Lagrangian geophysical fluid dynamics is introduced. Lagrangian coordinates add numerical difficulties into an already difficult subject, but also offer certain distinct advantages over Eulerian coordinates. First, float position and depth are defined by linear measurement functionals. Second, Lagrangian or ‘comoving’ open domains are conveniently expressed in Lagrangian coordinates. The attraction of such open domains is that they lead to well-posed prediction problems [Bennett and Chua (1999)] and hence efficient inversion algorithms. Eulerian and Lagrangian solutions of the inviscid forward problem in a doubly periodic domain, with North Atlantic mesoscales, are compared and found to be in …

An Iterated Pseudospectral Method For Functional Partial Differential Equations, J. Mead, B. Zubik-Kowal

Jodi Mead

Chebyshev pseudospectral spatial discretization preconditioned by the Kosloff and Tal-Ezer transformation [10] is applied to hyperbolic and parabolic functional equations. A Jacobi waveform relaxation method is then applied to the resulting semi-discrete functional systems, and the result is a simple system of ordinary differential equations d/dtUk+1(t) = MαUk+1(t)+f(t,U kt). Here Mα is a diagonal matrix, k is the index of waveform relaxation iterations, U kt is a functional argument computed from the previous iterate and the function f, like the matrix Mα, depends on the process of semi-discretization. This waveform relaxation splitting has the advantage of straight forward, direct application …

Assimilation Of Simulated Float Data In Lagrangian Coordinates, J. L. Mead

Jodi Mead

We implement an approach for the accurate assimilation of Lagrangian data into regional general ocean circulation models. The forward model is expressed in Lagrangian coordinates and simulated float data are incorporated into the model via four dimensional variational data assimilation. We show that forward solutions computed in Lagrangian coordinates are reliable for time periods of up to 100 days with phase speeds of 1 m/s and deformation radius of 35 km. The position and depth of simulated floats are assimilated into the viscous, Lagrangian shallow water equations. The weights for the errors in the model and data are varied and …

The 1905 Einstein Equation In A General Mathematical Analysis Model Of Quasars, Byron E. Bell

Byron E. Bell

Memristics: Memristors, Again? – Part Ii, How To Transform Wired ‘Translations’ Between Crossbars Into Interactions?, Rudolf Kaehr

Rudolf Kaehr

The idea behind this patchwork of conceptual interventions is to show the possibility of a “buffer-free” modeling of the crossbar architecture for memristive systems on the base of a purely difference-theoretical approach. It is considered that on a nano-electronic level principles of interpretation appears as mechanisms of complementarity. The most basic conceptual approach to such a complementarity is introduced as an interchangeability of operators and operands of an operation. Therefore, the architecture of crossbars gets an interpretation as complementarity between crossbar functionality and “buffering” translation functionality. That is, the same matter functions as operator and at once, as operand – …

Least Squares Problems With Inequality Constraints As Quadratic Constraints, Jodi Mead, Rosemary A. Renaut

Jodi Mead

Linear least squares problems with box constraints are commonly solved to find model parameters within bounds based on physical considerations. Common algorithms include Bounded Variable Least Squares (BVLS) and the Matlab function lsqlin. Here, the goal is to find solutions to ill-posed inverse problems that lie within box constraints. To do this, we formulate the box constraints as quadratic constraints, and solve the corresponding unconstrained regularized least squares problem. Using box constraints as quadratic constraints is an efficient approach because the optimization problem has a closed form solution.

The effectiveness of the proposed algorithm is investigated through solving three …