Searcharxiv⌕ Search

arXiv subjects

Nan Li

Publications and source records attributed to Nan Li.

At least 379 records · Page 21Linked to original sources
arXiv2013

An Algorithm for Constructing a Smallest Register with Non-Linear Update Generating a Given Binary Sequence

Registers with Non-Linear Update (RNLUs) are a generalization of Non-Linear Feedback Shift Registers (NLFSRs) in which both, feedback and feedforward, connections are allowed and no chain connection between the stages is required. In this paper, a new algorithm for constructing RNLUs generating a given binary sequence is presented. Expected size of RNLUs constructed by the presented algorithm is proved to be O(n/log(n/p)), where n is the sequence length and p is the degree of parallelization. This is asymptotically smaller than the expected size of RNLUs constructed by previous algorithms and the expected size of LFSRs and NLFSRs generating the same sequence. The presented algorithm can potentially be useful for many applications, including testing, wireless communications, and cryptography.

cs.IT↗
arXiv2013

A survey of CO and its isotope lines for possible cloud-cloud collision candidates

In the 12CO (J=1-0) survey for the 1331 cold IRAS sources 214 sources show profiles with multiple-peak profiles and are selected as cloud-cloud collision candidates. In January 2005, 201 sources are detected with 12CO(1-0), 13CO(1-0), and C18O(1-0) emission by the 13.7m telescope at Purple Mount Observatory. This is the first CO and its isotope lines directed toward possible cloud-cloud collision regions. According to the statistics of the 201 sources in Galactic distribution, the 201 sources show a similar distribution to the parent sample (1331 cold IRAS sources). These sources are located over a wide range of the Galactocentric distances, and are partly associated with the star formation region. Based on preliminary criteria which describe the spectrum properties of the possible cloud-cloud collision region, the 201 sources are classified into four types by the fit of the spectral profiles between the optically thick and thin lines toward each source. The survey is focused on the possible cloud-cloud collision regions, and gives some evidences to help us with selecting the target region. Then we will carry on the mapping and multi-wavelength study for the selected region in future.

astro-ph.SR↗
arXiv2013

Bounding geometry of loops in Alexandrov spaces

For a path in a compact finite dimensional Alexandrov space $X$ with curv $\ge κ$, the two basic geometric invariants are the length and the turning angle (which measures the closeness from being a geodesic). We show that the sum of the two invariants of any loop is bounded from below in terms of $κ$, the dimension, diameter and Hausdorff measure of $X$. This generalizes a basic estimate of Cheeger on the length of a closed geodesic in closed Riemannian manifold ([Ch], [GP1,2]). To see that the above result also generalizes and improves an analogous of the Cheeger type estimate in Alexandrov geometry in [BGP], we show that for a class of subsets of $X$, the $n$-dimensional Hausdorff measure and rough volume are proportional by a constant depending on $n=\dim(X)$.

math.DG↗
arXiv2013

Apollonian Equilateral Triangles

Given an equilateral triangle with $a$ the square of its side length and a point in its plane with $b$, $c$, $d$ the squares of the distances from the point to the vertices of the triangle, it can be computed that $a$, $b$, $c$, $d$ satisfy $3(a^2+b^2+c^2+d^2)=(a+b+c+d)^2$. This paper derives properties of quadruples of nonnegative integers $(a,\, b,\, c,\, d)$, called triangle quadruples, satisfying this equation. It is easy to verify that the operation generating $(a,\, b,\, c,\, a+b+c-d)$ from $(a,\, b,\, c,\, d)$ preserves this feature and that it and analogous ones for the other elements can be represented by four matrices. We examine in detail the triangle group, the group with these operations as generators, and completely classify the orbits of quadruples with respect to the triangle group action. We also compute the number of triangle quadruples generated after a certain number of operations and approximate the number of quadruples bounded by characteristics such as the maximal element. Finally, we prove that the triangle group is a hyperbolic Coxeter group and derive information about the elements of triangle quadruples by invoking Lie groups. We also generalize the problem to higher dimensions.

math.NT↗
arXiv2013

Embedding of Deterministic Test Data for In-Field Testing

This paper presents a new feedback shift register-based method for embedding deterministic test patterns on-chip suitable for complementing conventional BIST techniques for in-field testing. Our experimental results on 8 real designs show that the presented approach outperforms the bit-flipping approach by 24.7% on average. We also show that it is possible to exploit the uneven distribution of don't care bits in test patterns in order to reduce the area required for storing deterministic test patterns more than 3 times with less than 2% fault coverage drop.

cs.OH↗
arXiv2012

Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems

In this paper, we generalize the algorithm described by Rump and Graillat, as well as our previous work on certifying breadth-one singular solutions of polynomial systems, to compute verified and narrow error bounds such that a slightly perturbed system is guaranteed to possess an isolated singular solution within the computed bounds. Our new verification method is based on deflation techniques using smoothing parameters. We demonstrate the performance of the algorithm for systems with singular solutions of multiplicity up to hundreds.

math.NA↗
arXiv2012

Relative information entropy and Weyl curvature of the inhomogeneous Universe

Penrose conjectured a connection between entropy and Weyl curvature of the Universe. This is plausible, as the almost homogeneous and isotropic Universe at the onset of structure formation has negligible Weyl curvature, which then grows (relative to the Ricci curvature) due to the formation of large-scale structure and thus reminds us of the second law of thermodynamics. We study two scalar measures to quantify the deviations from a homogeneous and isotropic space-time, the relative information entropy and a Weyl tensor invariant, and show their relation to the averaging problem. We calculate these two quantities up to second order in standard cosmological perturbation theory and find that they are correlated and can be linked via the kinematic backreaction of a spatially averaged universe model.

gr-qc↗
arXiv2012

Chain polytopes and algebras with straightening laws

It will be shown that the toric ring of the chain polytope of a finite partially ordered set is an algebra with straightening laws on a finite distributive lattice. Thus in particular every chain polytope possesses a regular unimodular triangulation arising from a flag complex.

math.AC↗
arXiv2012

A Multi-Criteria Framework with Voxel-Dependent Parameters for Radiotherapy Treatment Plan Optimization

In a treatment plan optimization problem for radiotherapy, a clinically acceptable plan is usually generated by an optimization process with weighting factors or reference doses adjusted for organs. Recent discoveries indicate that adjusting parameters associated with each voxel may lead to better plan quality. However, it is still unclear regarding the mathematical reasons behind it. To answer questions related to this problem, we establish in this work a new mathematical framework equipped with two theorems. The new framework clarifies the different consequences of adjusting organ-dependent and voxel-dependent parameters for the treatment plan optimization of radiation therapy, as well as the different effects of adjusting weighting factors versus reference doses in the optimization process. The main discoveries are threefold: 1) While in the organ-based model the selection of the objective function has an impact on the quality of the optimized plans, this is no longer an issue for the voxel-based model since the entire Pareto surface could be generated regardless the specific form of the objective function as long as it satisfies certain mathematical conditions; 2) A larger Pareto surface is explored by adjusting voxel-dependent parameters than by adjusting organ-dependent parameters, possibly allowing for the generation of plans with better trade-offs among different clinical objectives; 3) Adjusting voxel weighting factors is preferred to adjusting the voxel reference doses since the Pareto optimality can be maintained.

physics.med-ph↗
arXiv2012

An Eulerian permutation statistic and generalizations

Recently, the second author studied an Eulerian statistic (called cover) in the context of convex polytopes, and proved an equal joint distribution of (cover,des) with (des,exc). In this paper, we present several direct bijective proofs that cover is Eulerian, and examine its generalizations and their Mahonian partners. We also present a quasi-symmetric function proof (suggested by Michelle Wachs) of the above equal joint distribution.

math.CO↗
arXiv2012

A canonical expansion of the product of two Stanley symmetric functions

We study the problem of expanding the product of two Stanley symmetric functions $F_w\cdot F_u$ into Stanley symmetric functions in some natural way. Our approach is to consider a Stanley symmetric function as a stabilized Schubert polynomial $F_{w}=\lim_{n\to \infty}\mathfrak{S}_{1^{n}\times w}$, and study the behavior of the expansion of $\s_{1^n\times w}\cdot\s_{1^n\times u}$ into Schubert polynomials, as $n$ increases. We prove that this expansion stabilizes and thus we get a natural expansion for the product of two Stanley symmetric functions. In the case when one permutation is Grassmannian, we have a better understanding of this stability. We then study some other related stable properties, which provides a second proof of the main result.

math.CO↗
arXiv2012

Ehrhart $h^*$-vectors of hypersimplices

We consider the Ehrhart $h^*$-vector for the hypersimplex. It is well-known that the sum of the $h_i^*$ is the normalized volume which equals an Eulerian numbers. The main result is a proof of a conjecture by R. Stanley which gives an interpretation of the $h^*_i$ coefficients in terms of descents and excedances. Our proof is geometric using a careful book-keeping of a shelling of a unimodular triangulation. We generalize this result to other closely related polytopes.

math.CO↗
arXiv2012

Separating hyperplanes of edge polytopes

Let $G$ be a finite connected simple graph with $d$ vertices and let $\Pc_G \subset \RR^d$ be the edge polytope of $G$. We call $\Pc_G$ \emph{decomposable} if $\Pc_G$ decomposes into integral polytopes $\Pc_{G^+}$ and $\Pc_{G^-}$ via a hyperplane. In this paper, we explore various aspects of decomposition of $\Pc_G$: we give an algorithm deciding the decomposability of $\Pc_G$, we prove that $\Pc_G$ is normal if and only if both $\Pc_{G^+}$ and $\Pc_{G^-}$ are normal, and we also study how a condition on the toric ideal of $\Pc_G$ (namely, the ideal being generated by quadratic binomials) behaves under decomposition.

math.CO↗
arXiv2012

Efficient Optimization of Performance Measures by Classifier Adaptation

In practical applications, machine learning algorithms are often needed to learn classifiers that optimize domain specific performance measures. Previously, the research has focused on learning the needed classifier in isolation, yet learning nonlinear classifier for nonlinear and nonsmooth performance measures is still hard. In this paper, rather than learning the needed classifier by optimizing specific performance measure directly, we circumvent this problem by proposing a novel two-step approach called as CAPO, namely to first train nonlinear auxiliary classifiers with existing learning methods, and then to adapt auxiliary classifiers for specific performance measures. In the first step, auxiliary classifiers can be obtained efficiently by taking off-the-shelf learning algorithms. For the second step, we show that the classifier adaptation problem can be reduced to a quadratic program problem, which is similar to linear SVMperf and can be efficiently solved. By exploiting nonlinear auxiliary classifiers, CAPO can generate nonlinear classifier which optimizes a large variety of performance measures including all the performance measure based on the contingency table and AUC, whilst keeping high computational efficiency. Empirical studies show that CAPO is effective and of high computational efficiency, and even it is more efficient than linear SVMperf.

cs.LG↗
arXiv2012

Verified Error Bounds for Isolated Singular Solutions of Polynomial Systems: Case of Breadth One

In this paper we describe how to improve the performance of the symbolic-numeric method in (Li and Zhi,2009, 2011) for computing the multiplicity structure and refining approximate isolated singular solutions in the breadth one case. By introducing a parameterized and deflated system with smoothing parameters, we generalize the algorithm in (Rump and Graillat, 2009) to compute verified error bounds such that a slightly perturbed polynomial system is guaranteed to have a breadth-one multiple root within the computed bounds.

math.NA↗
arXiv2011

Relatively maximum volume rigidity in Alexandrov geometry

Given a compact Alexadrov $n$-space $Z$ with curvature curv $\ge κ$, and let $f: Z\to X$ be a distance non-increasing onto map to another Alexandrov $n$-space with curv $\ge κ$. The relative volume rigidity conjecture says that if $X$ achieves the relative maximal volume i.e. $vol(Z)=vol(X)$, then $X$ is isometric to $Z/\sim$, where $z, z'\in\partial Z$ and $z\sim z'$ if only if $f(z)=f(z')$. We will partially verify this conjecture, and give a classification for compact Alexandrov $n$-spaces with relatively maximal volume. We will also give an elementary proof for a pointed version of Bishop-Gromov relative volume comparison with rigidity in Alexandrov geometry.

math.DG↗
arXiv2011

Effects of supermassive binary black holes on gravitational lenses

Recent observations indicate that many if not all galaxies host massive central black holes (BHs). In this paper we explore the influence of supermassive binary black holes (SMBBHs) on their actions as gravitational lenses. When lenses are modelled as singular isothermal ellipsoids, binary black holes change the critical curves and caustics differently as a function of distance. Each black hole can in principle create at least one additional image, which, if observed, provides evidence of black holes. By studying how SMBBHs affect the cumulative distribution of magnification for images created by black holes, we find that the cross section for at least one such additional image to have a magnification larger than $10^{-5}$ is comparable to the cross section for producing multiple-images in singular isothermal lenses. Such additional images may be detectable with high-resolution and large dynamic range maps of multiply-imaged systems from future facilities, such as the SKA. The probability of detecting at least one image (two images) with magnification above $10^{-3}$ is $\sim 0.2 \fBH$ ($\sim 0.05 \fBH$) in a multiply-imaged lens system, where $\fBH$ is the fraction of galaxies housing binary black holes. We also study the effects of SMBBHs on the core images when galaxies have shallower central density profiles (modelled as non-singular isothermal ellipsoids). We find that the cross section of the usually faint core images is further suppressed by SMBBHs. Thus their presence should also be taken into account when one constrains the core radius from the lack of central images in gravitational lenses.

astro-ph.CO↗