English
Related papers

Related papers: Modified strip projection method

200 papers

Let $C$ be a smooth, projective and geometrically connected curve defined over a finite field $\mathbb{F}_q(C)$. Given a semisimple $C-S$-group scheme $\underline{G}$ where $S$ is a finite set of closed points of $C$, we describe the set of…

Algebraic Geometry · Mathematics 2021-05-26 Rony A. Bitan , Ralf Kohl , Claudia Schoemann

An approximate but straight forward projection method to molecular many alpha-particle states is proposed and the overlap to the shell model space is determined. The resulting space is in accordance with the shell model, but still contains…

Nuclear Theory · Physics 2021-10-13 J. R. M. Berriel-Aguayo , P. O. Hess

The AlPdMn quasicrystal approximants xi, xi', and xi'_n of the 1.6 nm decagonal phase and R, T, and T_n of the 1.2 nm decagonal phase can be viewed as arrangements of cluster columns on two-dimensional tilings. We substitute the tiles by…

Materials Science · Physics 2007-05-23 Michael Engel , Hans-Rainer Trebin

Let $1 \to K \longrightarrow G \stackrel{\pi}\longrightarrow Q$ be an exact sequence of hyperbolic groups. Let $Q_1 < Q$ be a quasiconvex subgroup and let $G_1=\pi^{-1}(Q_1)$. Under relatively mild conditions (e.g. if $K$ is a closed…

Geometric Topology · Mathematics 2021-03-05 Mahan Mj , Pranab Sardar

This paper studies clustering algorithms for dynamically evolving graphs $\{G_t\}$, in which new edges (and potential new vertices) are added into a graph, and the underlying cluster structure of the graph can gradually change. The paper…

Data Structures and Algorithms · Computer Science 2024-06-06 Steinar Laenen , He Sun

In this paper, we propose a randomly projected convex clustering model for clustering a collection of $n$ high dimensional data points in $\mathbb{R}^d$ with $K$ hidden clusters. Compared to the convex clustering model for clustering…

Machine Learning · Computer Science 2023-03-30 Ziwen Wang , Yancheng Yuan , Jiaming Ma , Tieyong Zeng , Defeng Sun

This paper introduces hierarchical quasi-clustering methods, a generalization of hierarchical clustering for asymmetric networks where the output structure preserves the asymmetry of the input data. We show that this output structure is…

Machine Learning · Computer Science 2014-04-21 Gunnar Carlsson , Facundo Mémoli , Alejandro Ribeiro , Santiago Segarra

We introduce a construction to embed a quasiperiodic lattice of obstacles into a single unit cell of a higher-dimensional space, with periodic boundary conditions. This construction transparently shows the existence of channels in these…

Chaotic Dynamics · Physics 2012-06-12 Atahualpa S. Kraemer , David P. Sanders

We present a semi-analytic method to calculate the dispersion curves and the group velocity of photonic crystal waveguide modes in two-dimensional geometries. We model the waveguide as a homogenous strip, surrounded by photonic crystal…

This paper discusses the topic of dimensionality reduction for $k$-means clustering. We prove that any set of $n$ points in $d$ dimensions (rows in a matrix $A \in \RR^{n \times d}$) can be projected into $t = \Omega(k / \eps^2)$…

Artificial Intelligence · Computer Science 2011-05-05 Christos Boutsidis , Anastasios Zouzias , Petros Drineas

We introduce the notion of strip complex. A strip complex is a special type of complex obtained by gluing "strips" along their natural boundaries according to a given graph structure. The most familiar example is the one dimensional complex…

Probability · Mathematics 2012-12-04 Alexander Bendikov , Laurent Saloff-Coste , Maura Salvatori , Wolfgang Woess

We describe and test a method to quantitatively classify clusters of galaxies according to their projected morphologies. This method will be subsequently used to place constraints on cosmological parameters ($\Omega$ and the power spectrum…

Astrophysics · Physics 2009-10-28 David A. Buote , John C. Tsai

A general method of deprojecting two-dimensional images to reconstruct the three dimensional structure of the projected object --specifically X-ray, Sunyaev-Zel'dovich (SZ) and gravitational lensing maps of rich clusters of galaxies --…

Astrophysics · Physics 2009-10-31 S. Zaroubi , G. Squires , G. de Gasperis , A. Evrard , Y. Hoffman , J. Silk

Quasicrystals are unique materials characterized by long-range order without periodicity. They are observed in systems such as metallic alloys, soft matter, and particle simulations. Unlike periodic crystals, which are invariant under…

Computational Physics · Physics 2024-11-14 Nydia Roxana Varela-Rosales , Michael Engel

Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix…

Data Structures and Algorithms · Computer Science 2016-05-24 Nicolas Tremblay , Gilles Puy , Remi Gribonval , Pierre Vandergheynst

Ghost projection is the reversed process of computational classical ghost imaging that allows any desired image to be synthesized using a linear combination of illuminating patterns. Typically, physical attenuating masks are used to produce…

Optics · Physics 2025-12-01 James A. Monro , Andrew M. Kingston , David M. Paganin

A Bose gas under the effect of Raman Spin-Orbit Coupling (SOC) is analyzed using the Discrete Spin T-moves Diffusion Monte Carlo method. By computing the energy as well as the static structure factor and the superfluid fraction of the…

Quantum Gases · Physics 2020-04-17 Juan Sánchez-Baena , Jordi Boronat Medico , Ferran Mazzanti Castrillejo

Quasiperiodic systems serve as fertile ground for studying localisation, due to their propensity already in one dimension to exhibit rich phase diagrams with mobility edges. The deterministic and strongly-correlated nature of the…

Disordered Systems and Neural Networks · Physics 2021-08-11 Alexander Duthie , Sthitadhi Roy , David E. Logan

Traditional k-means clustering underperforms on non-convex shapes and requires the number of clusters k to be specified in advance. We propose a simple geometric enhancement: after standard k-means, each cluster center is assigned a radius…

Machine Learning · Computer Science 2025-04-30 Stefan Kober

This paper deals with a modified iterative projection method for approximating a solution of the hierarchical fixed point problem for a sequene of nearly nonexpansive mappings with respect to a nonexpansive mapping. It is shown that under…

Functional Analysis · Mathematics 2014-03-14 Ibrahim Karahan , Murat Ozdemir