快速排序一个低效问题的完善处理

为了改善含有大量重复数据时快速排序效率低下的问题，提出了简便有效的拟3路划分算法，即每次划分时并不单独分离出等值元素以形成等值区，而是划分后及时排除基准处自然形成的等值区，从而避免了3路划分的困难，仅需对原算法做极少的修改，数值结果表明效果优于其它同类算法。     

基于客户关系管理的企业市场细分化

在阐述客户关系管理内涵的基础上,分析了利用客户关系管理进行市场细分的意义,即能够提高市场细分的效率,拓展企业的资源和提高企业核心竞争力,进而从客户知识管理过程层面分析了基于客户关系管理进行企业市场细分变量的搜寻、挖掘和整合的方法。     

Recent progress in mathematics and engineering on optimal graph labellings with distance conditions

The problem of radio channel assignments with multiple levels of interference can be modelled using graph theory. The theory of integer vertex-labellings of graphs with distance conditions has been investigated for several years now, and the authors recently introduced a new model of real number labellings that is giving deeper insight into the problems. Here we present an overview of the recent outpouring of papers in the engineering literature on such channel assignment problems, with the goal of strengthening connections to applications. Secondly, we present a new contribution to the theory, the formulas for the optimal span of labellings with conditions at distance two for finite complete bipartite graphs. Dedicated to Professor Frank K. Hwang on the occasion of his 65th birthday. Research supported in part by NSF grants DMS-0072187 and DMS-0302307. An early version of this paper was presented at the CTS Conference on Combinatorics and its Applications in May, 2005, at Chiao Tung University, HsinChu, Taiwan. The first author is grateful to the CTS for its support of his travel.     

Cluster‐Specific Variable Selection for Product Partition Models

We propose a random partition model that implements prediction with many candidate covariates and interactions. The model is based on a modified product partition model that includes a regression on covariates by favouring homogeneous clusters in terms of these covariates. Additionally, the model allows for a cluster‐specific choice of the covariates that are included in this evaluation of homogeneity. The variable selection is implemented by introducing a set of cluster‐specific latent indicators that include or exclude covariates. The proposed model is motivated by an application to predicting mortality in an intensive care unit in Lisboa, Portugal.     

An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution

This paper discusses the relation among four problems: graph testing, DNA complex screening, superimposed codes and secure key distribution. We prove a surprising equivalence relation among these four problems, and use this equivalence to improve current results on graph testing. In the rest of this paper, we give a lower bound for the minimum number of tests on DNA complex screening model. The first and second author would like to dedicate this paper to professor Frank K. Hwang on the occasion of his 65th birthday. This research is partially supported by Republic of China, National Science Council grant NSC 92-2115-M-009-014.     

Le débat sur la flexibilité du marché du travail en Inde: une contribution théorique

Le débat sur la flexibilisation du marché du travail indien porte notamment sur l'autorisation administrative de licenciement pour les entreprises de plus de 100 salariés. Le plaidoyer en faveur de sa suppression (ou de l'élévation du seuil) est étayé par Basu, Fields et Debgupta (2009). L'auteur conteste leur argumentation théorique en faveur de l'embauche et du licenciement au gré de l'employeur, avec libre signature d'un contrat, et démontre que leur conclusion politique est logiquement insoutenable, même dans le cadre de leur modèle. Le plaidoyer pour la flexibilisation du marché du travail et la liberté contractuelle s'en trouve infondé.     

中国教育收益率偏低新解

与国际标准模型相比 ,中国的教育收益率仍然很低。本文认为 ,教育影响收入分配的主要机制在于它能提高受教育者的配置能力 ,但配置能力的发挥又取决于经济的非均衡程度和市场半径的大小。中国的市场特别是劳动力市场存在着严重的分割 ,这抑制了教育配置能力的发挥 ,因此 ,教育的收益率要比其他国家低     

A statistical approach to social network monitoring

Social network monitoring consists of monitoring changes in networks with the aim of detecting significant ones and attempting to identify assignable cause(s) contributing to the occurrence of a change. This paper proposes a method that helps to overcome some of the weaknesses of the existing methods. A Poisson regression model for the probability of the number of communications between network members as a function of vertex attributes is constructed. Multivariate exponentially weighted moving average (MEWMA) and multivariate cumulative sum (MCUSUM) control charts are used to monitor the network formation process. The results indicate more efficient performance for the MEWMA chart in identifying significant changes.     

基于中文文本主题提取的分词方法研究

中文文本主题提取有助于用户对海量信息进行浓缩和提炼。而主题提取是以中文分词作为第一步,分词质量直接影响到文献主题提取的质量。本文提出了一种基于中文文本主题提取的分词方法,该方法以概念语义网络为分词词典,采用改进的最大匹配算法对文本进行切词,并同步完成主题词的规范工作。     

The use of sparsest cuts to reveal the hierarchical community structure of social networks

We show that good community structures can be obtained by partitioning a social network in a succession of divisive sparsest cuts. A network flow algorithm based on fundamental principles of graph theory is introduced to identify the sparsest cuts and an underlying hierarchical community structure of the network via maximum concurrent flow. Matula [Matula, David W., 1985. Concurrent flow and concurrent connectivity in graphs. In: Alavi, Y., et al. (Eds.), Graph Theory and its Applications to Algorithms and Computer Science. Wiley, New York, NY, pp. 543–559.] established the maximum concurrent flow problem (MCFP), and papers on divisive vs. agglomerative average-linkage hierarchical clustering [e.g., Matula, David W., 1983. Cluster validity by concurrent chaining. In: Felsenstein, J. (Ed.), Numerical Taxonomy: Proc. of the NATO Adv. Study Inst., vol. 1. Springer-Verlag, New York, pp. 156–166 (Proceedings of NATO ASI Series G); Matula, David W., 1986. Divisive vs. agglomerative average linkage hierarchical clustering. In: Gaul, W., and Schader, M. (Eds.), Classification as a Tool of Research. Elsevier, North-Holland, Amsterdam, pp. 289–301; Thompson, Byron J., 1985. A flow rerouting algorithm for the maximum concurrent flow problem with variable capacities and demands, and its application to cluster analysis. Master Thesis. School of Engineering and Applied Science, Southern Methodist University] provide the basis for partitioning a social network by way of sparsest cuts and/or maximum concurrent flow.