A branch-and-bound method for the minimum k−enclosing ball problem

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.     

The character and the wave front set correspondence in the stable range

We relate the distribution characters and the wave front sets of unitary representation for real reductive dual pairs of type I in the stable range.     

On generalized perfect difference sets constructed from Sidon sets

Let $\mathbb{N}$ be the set of positive integers. For a nonempty set A of integers and every integer u, denote by $d_A(u)$ the number of $(a,a^{\prime })$ with $a,a^{\prime }\in A$ such that $u=a-a^{\prime }$. For a sequence S of positive integers, let $S(x)$ be the counting function of S. The set $A\subseteq \mathbb{N}$ is called a perfect difference set if $d_A(u)=1$ for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let $f:\mathbb{N}\to \mathbb{N}$ be an increasing function satisfying $f(n)\ge 2$ for any positive integer n, then for every Sidon set B and every function $\omega (x)\to \infty$, there exists a set $A\subseteq \mathbb{N}$ such that $d_A(u)=f(u)$ for every positive integer u and $B(x/3)-\omega (x)\le A(x)\le B(x/3)+\omega (x)$ for all $x\ge C_{f,B,\omega }$.     

基于串联两阶段网络DEA模型的供应链规模收益分析

数据包络分析(DEA)是评价供应链系统(Supply chain system)间相对有效性的一种重要的工具,但是传统的DEA不考虑供应链的内部结构,对系统效率评价偏高;而本文所研究两阶段串联供应链系统,考虑把部分中间产品作为最终产品输出,增加额外中间投入的情形.基于所提出的供应链系统结构,本文建立相应的串联结构下的网络DEA模型,并针对所建立模型进行相关理论的研究,给出了串联结构下的生产可能集和规模收益情况判定方法.最后,进行数值实验,以验证我们提出的结论.     

Definition and detection of data-based uniqueness in evaluating bilinear (two-way) chemical measurements

Multivariate curve resolution methods, frequently used in analyzing bilinear data sets, result in ambiguous decomposition in general. Implementing the adequate constraints may lead to reduce the so-called rotational ambiguity drastically, and in the most favorable cases to the unique solution. However, in some special cases, non-negativity constraint as minimal information of the system is a sufficient condition to resolve profiles uniquely. Although, several studies on exploring the uniqueness of the bilinear non-negatively constrained multivariate curve resolution methods have been made in the literature, it has still remained a mysterious question. In 1995, Manne published his profile-based theorems giving the necessary and sufficient conditions of the unique resolution. In this study, a new term, i.e., data-based uniqueness is defined and investigated in details, and a general procedure is suggested for detection of uniquely recovered profile(s) on the basis of data set structure in the abstract space. Close inspection of Borgen plots of these data sets leads to realize the comprehensive information of local rank, and these argumentations furnish a basis for data-based uniqueness theorem. The reported phenomenon and its exploration is a new stage (it can be said fundament) in understanding and describing the bilinear (matrix-type) chemical data in general.     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.     

The push-out region of an immersed manifold

We consider immersions: and construct a subspace of which corresponds to a set of embedded manifolds which are either parallel to f, tubes around f or, in general, partial tubes around f. This space is invariant under the action of the normal holonomy group, We investigate the case where is non-trivial and obtain some results on the number of connected components of . Received 24 March 2000.     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008