A Solution to the Generalized Cevian Problem Using Forest Polynomials

In this paper, we examine the effect of dissecting an n-dimensional simplex using cevians (cross-sections passing through n−1 of the vertices of the simplex). We describe a formula for the number of pieces the simplex is dissected into using a polynomial involving only the number of each type of cevian. The polynomial in question involves terms involving the edges of the simplex, but discarding those terms involving cycles of the underlying graph. Thus, we call such a polynomial a “forest polynomial.”     

The Condenser Problem

The condenser problem is studied in the potential-theoretic framework of balayage spaces. New proofs of existence and uniqueness are presented. Furthermore, a probabilistic interpretation is given.     

The Mean-Partition Problem

In mean-partition problems the goal is to partition a finite set of elements, each associated with a d-vector, into p disjoint parts so as to optimize an objective, which depends on the averages of the vectors that are assigned to each of the parts. Each partition is then associated with a d × p matrix whose columns are the corresponding averages and a useful approach in studying the problem is to explore the mean-partition polytope, defined as the convex hull of the set of matrices associated with feasible partitions.     

The Unmixing Problem

High-gain adaptive stabilization of minimum-phase linear systemsraises the so-called unmixing problem: finding a finite setA of matrices, with the property that for any M GL(n), (AM)C₊ for at least one A . First, some preliminary results will be given, leading up to a non-constructive proofof the existence of such finiteA's. For the cases n = 2 and3, a fairly satisfying solution is presented. In higher dimensions,the situation is more complicated, and negative results aregiven. Based on the Euler angles for O(n), an explicit solutionis given for arbitrary n.     

The Clustered Orienteering Problem

In this paper we study a generalization of the Orienteering Problem (OP) which we call the Clustered Orienteering Problem (COP). The OP, also known as the Selective Traveling Salesman Problem, is a problem where a set of potential customers is given and a profit is associated with the service of each customer. A single vehicle is available to serve the customers. The objective is to find the vehicle route that maximizes the total collected profit in such a way that the duration of the route does not exceed a given threshold. In the COP, customers are grouped in clusters. A profit is associated with each cluster and is gained only if all customers belonging to the cluster are served. We propose two solution approaches for the COP: an exact and a heuristic one. The exact approach is a branch-and-cut while the heuristic approach is a tabu search. Computational results on a set of randomly generated instances are provided to show the efficiency and effectiveness of both approaches.     

The bi-objective Pollution-Routing Problem

The bi-objective Pollution-Routing Problem is an extension of the Pollution-Routing Problem (PRP) which consists of routing a number of vehicles to serve a set of customers, and determining their speed on each route segment. The two objective functions pertaining to minimization of fuel consumption and driving time are conflicting and are thus considered separately. This paper presents an adaptive large neighborhood search algorithm (ALNS), combined with a speed optimization procedure, to solve the bi-objective PRP. Using the ALNS as the search engine, four a posteriori methods, namely the weighting method, the weighting method with normalization, the epsilon-constraint method and a new hybrid method (HM), are tested using a scalarization of the two objective functions. The HM combines adaptive weighting with the epsilon-constraint method. To evaluate the effectiveness of the algorithm, new sets of instances based on real geographic data are generated, and a library of bi-criteria PRP instances is compiled. Results of extensive computational experiments with the four methods are presented and compared with one another by means of the hypervolume and epsilon indicators. The results show that HM is highly effective in finding good-quality non-dominated solutions on PRP instances with 100 nodes.     

Hiding in plain sight: criminal network analysis

The United States is faced with an increasingly complex criminal enterprise. Advances in technology, communications, transport, and economies enable a highly adaptive criminal element to hide in plain site. These advances provide criminal organizations with the same global boundaries and opportunities as legitimate organizations.     

空中加油问题

对空中加油问题的前两个问题进行了深入系统的研究,发现并证明了与最优解相关的若干事实,对后续的问题求解具有重要的意义.利用得出的结论,加以推导得出求解rn的递推公式,并由此设计了类似于动态规划的循环递推算法.引入“虚拟基地”和“一次性加油”的概念,通过推导得到rn的上界和下界,得出rn与n的渐进关系是对数关系.最后,又提出将问题转化成为二维平面问题,建立一个二叉树模型,通过求解线性规划得到最优解.     

The k-free Divisor Problem

 Let be the number of k-free divisions of n, and let be the counting function of . We improve on the known estimates for the error term in the asymptotic formula for under the assumption of the Riemann Hypothesis. We also obtain an unconditional asymptotic formula for , for small y. (Received 15 March 1999; in revised form 17 September 1999)     

The Asymptotic Schottky Problem

Let ${\mathcal{M}_g}Let M_g{\mathcal{M}_g} denote the moduli space of compact Riemann surfaces of genus g and let A_g{\mathcal{A}_g} be the moduli space of principally polarized abelian varieties of dimension g. Let J : M_g ? A_g{J : \mathcal{M}_g \rightarrow \mathcal{A}_g} be the map which associates to a Riemann surface its Jacobian. The map J is injective, and the image J_g : = J(M_g){\mathcal{J}_g := J(\mathcal{M}_g)} is contained in a proper subvariety of A_g{\mathcal{A}_g} when g ≥  4. The classical and long-studied Schottky problem is to characterize the Jacobian locus J_g{\mathcal{J}_g} in A_g{\mathcal{A}_g}. In this paper we address a large scale version of this problem posed by Farb and called the coarse Schottky problem: What does J_g{\mathcal{J}_g} look like “from far away”, or how “dense” is J_g{\mathcal{J}_g} in the sense of coarse geometry? The large scale geometry of A_g{\mathcal{A}_g} is encoded in its asymptotic cone, Cone_￥(A_g){{\rm Cone}_\infty(\mathcal{A}_g)}, which is a Euclidean simplicial cone of real dimension g. Our main result asserts that the Jacobian locus J_g{\mathcal{J}_g} is “coarsely dense” in A_g{\mathcal{A}_g}, which implies that the subset of Cone_￥(A_g){{\rm Cone}_\infty(\mathcal{A}_g)} determined by J_g{\mathcal{J}_g} actually coincides with this cone. The proof shows that the Jacobian locus of hyperelliptic curves is coarsely dense in A_g{\mathcal{A}_g} as well. We also study the boundary points of the Jacobian locus J_g{\mathcal{J}_g} in A_g{\mathcal{A}_g} and in the Baily–Borel and the Borel–Serre compactification. We show that for large genus g the set of boundary points of J_g{\mathcal{J}_g} in these compactifications is “small”.