Related papers: A search method for thin positions of links
We study parameterized versions of classical algorithms for computing shortest-path trees. This is most easily expressed in terms of tropical geometry. Applications include shortest paths in traffic networks with variable link travel times.
We define and study slider-pinning rigidity, giving a complete combinatorial characterization. This is done via direction-slider networks, which are a generalization of Whiteley's direction networks.
Identifying and removing spurious links in complex networks is a meaningful problem for many real applications and is crucial for improving the reliability of network data, which in turn can lead to a better understanding of the highly…
The elucidation of the nature of dark matter is one of the challenging tasks in astroparticle physics. A brief overview on the different methods to search directly for dark matter in form of Weakly Interacting Massive Particles (WIMPs) is…
We apply the linking method for cones in normed spaces to p-Laplace equations with various nonlinear boundary conditions. Some existence results are obtained.
Given a polygon representing a transportation network together with a point p in its interior, we aim to extend the network by inserting a line segment, called a feed-link, which connects p to the boundary of the polygon. Once a feed link…
Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a…
Interstitial content is online content which grays out, or otherwise obscures the main page content. In this technical report, we discuss exploratory research into detecting the presence of interstitial content in web pages. We discuss the…
We give an explicit formula for the HOMFLY polynomial of a rational link (in particular, a knot) in terms of a special continued fraction for the rational number that defines the given link.
Versions of the following problem appear in several topics such as Gamma Knife radiosurgery, studying objects with the X-ray transform, the 3SUM problem, and the $k$-linear degeneracy testing. Suppose there are $n$ points on a plane whose…
A method is described to empower students to efficiently perform general and literature searches using online resources. The method was tested on undergraduate and graduate students with varying backgrounds with scientific literature.…
We give a simple and practical algorithm to compute the link polynomials, which are defined according to the skein relations. Our method is based on a new total order on the set of all braid representatives. As by-product a new complete…
In this paper, we present a short proof of Halin's grid theorem.
We present a subspace method based on neural networks for solving the partial differential equation in weak form with high accuracy. The basic idea of our method is to use some functions based on neural networks as base functions to span a…
In this short paper, we explore relationship between various models of complex networks with pinning controllers.
Most real-world networks are embedded in latent geometries. If a node in a network is found in the vicinity of another node in the latent geometry, the two nodes have a disproportionately high probability of being connected by a link. The…
Link prediction problem has increasingly become prominent in many domains such as social network analyses, bioinformatics experiments, transportation networks, criminal investigations and so forth. A variety of techniques has been developed…
Methods for measuring the weak value of non local variables are investigated. We analyze local (indirect) measurement methods for obtaining the weak values. We also describe some new (direct) methods (Non local weak measurements) for…
For a product of interest, we propose a search method to surface a set of reference products. The reference products can be used as candidates to support downstream modeling tasks and business applications. The search method consists of…
Twisted links are a generalization of virtual links. As virtual links correspond to abstract links on orientable surfaces, twisted links correspond to abstract links on (possibly non-orientable) surfaces. In this paper, we introduce the…