Harmonic Algebraic Curves and Noncrossing Partitions

Motivated by Gauss's first proof of the Fundamental Theorem of Algebra, we study the topology of harmonic algebraic curves. By the maximum principle, a harmonic curve has no bounded components; its topology is determined by the combinatorial data of a noncrossing matching. Similarly, every complex polynomial gives rise to a related combinatorial object that we call a basketball, consisting of a pair of noncrossing matchings satisfying one additional constraint. We prove that every noncrossing matching arises from some harmonic curve, and deduce from this that every basketball arises from some polynomial.     

At Least n – 1 Intersection Points in a Connected Family of n Unit Circles in the Plane

Let C be a family of n different unit circles in the plane. We show that C determines at least n - c intersection points, where c is the number of connected components in ∪_{C ∈ C}C. This proves a conjecture of A. Bezdek.     

Discrete-time GI/Geo/1 queue with multiple working vacations

Consider the discrete time GI/Geo/1 queue with working vacations under EAS and LAS schemes. The server takes the original work at the lower rate rather than completely stopping during the vacation period. Using the matrix-geometric solution method, we obtain the steady-state distribution of the number of customers in the system and present the stochastic decomposition property of the queue length. Furthermore, we find and verify the closed property of conditional probability for negative binomial distributions. Using such property, we obtain the specific expression for the steady-state distribution of the waiting time and explain its two conditional stochastic decomposition structures. Finally, two special models are presented.      

Optimal asset allocation for pension funds under mortality risk during the accumulation and decumulation phases

In a financial market with one riskless asset and n risky assets whose prices are lognormal, we solve in a closed form the problem of a pension fund maximizing the expected CRRA utility of its surplus till the (stochastic) death time of a representative agent. We consider a unique asset allocation problem for both accumulation and decumulation phases. The optimal investment in the risky assets must decrease during the first phase and increase during the second one. We accordingly suggest it is not optimal to manage the two phases separately, and outsourcing of allocation decisions should be avoided in both phases. JEL: G23, G11 MSC 2000: 62P05, 91B28, 91B30, 91B70, 93E20     

A rule-based risk decision-making approach and its application in China's customs inspection decision

This paper addresses a kind of risk decision-making problem existing widely in public administration and business management, which is characterized by (1) occurrence probabilities of states of nature can be estimated by analysing historical observations, but historical observations of different objects are unhomogeneous, (2) the relation between observations and occurrence probabilities of states of nature are affected by some qualitative and quantitative indicators, (3) it is a real-time decision-making problem, that is, there are many decisions for different objects to be made in a limited time, (4) considering decision's execution, impact of resource constrains is an important issue in decision-making process. In this paper, we develop a rule-based approach to address the problem. In the proposed approach, a two-step clustering method is employed to classify objects into categories, and observations in each category can be approximately viewed as homogeneous. For objects in each category, occurrence probabilities of states of nature are estimated by logistic regression, and the decision rule is obtained through solving an optimization model, which is to minimize the total decision risks while satisfying resource constrains. Effect and efficacy of our approach are illustrated through its application to China's customs inspection decision.     

An Enhancement of the Drezner—Wesolowsky Algorithm for Single-Facility Location with Maximin of Rectilinear Distance

In this note, we examine the algorithm of Drezner and Wesolowsky for locating a facility with maximin rectilinear distance to a given set of demand points. The concept of the closest-point constraint is introduced as a technique for increasing the efficiency of the algorithm. This potential increase in efficiency is demonstrated by an example.     

Model and empirical study on some collaboration networks

In this paper we present an empirical study of a few practical systems described by cooperation networks, and propose a model to understand the results obtained. We study four non-social systems, which are the Bus Route Networks of Beijing and Yangzhou, the Travel Route Network of China, Huai-Yang recipes of Chinese cooked food, and a social system, which is the Collaboration Network of Hollywood Actors. In order to explain the results related to the degree distribution, act-degree distribution and act-size distribution (especially about the degree distribution, which may be better fitted using a stretched exponential distribution (SED)), we suggest a simple model to show a possible evolutionary mechanism for the emergence of such networks. The analytic and numerical results obtained from the model are in good agreement with the empirical results.     

In situ preparation of Bi-Sr-Ca-Cu-O superconducting films by laser sputtering

Superconducting films of Bi-Sr-Ca-Cu-O on (100) MgO substrates have been fabricated by XeCl-excimer-laser sputtering from ceramic targets of Bi_2.5Sr₂Ca₂Cu₃O_y in O₂ atmosphere. The films were polycrystalline with the c-axis (30.80±0.02Å) preferably oriented normal to the substrate surface. Without post-annealing the films showed metallic resistance behavior with zero resistance temperatures of up to T_c(0) }- 79 K. The critical current density of the films had values of up to j_c(50K)}- 10⁴ A/cm².     

A note on the acyclicity of the Koszul complex of a module

We prove the vanishing of the Koszul homology group H _μ(Kos(M)_μ), where μ is the minimal number of generators of M. We give a counterexample that the Koszul complex of a module is not always acyclic and show its relationship with the homology of commutative rings.