粮食产量时间序列的单分形检验及R/S预测

为探讨中国粮食产量的变化规律及趋势预测问题,采用配分函数方法,判定了1949年以来粮食总产量时间序列的单分形特征,并利用分析方法确定一个代表粮食产量变化趋势的时间序列的幂,从而得到预测粮食产量变化趋势的分形方法。根据历史资料,用此方法对中国粮食产量的变化趋势进行了短期预测,得到了变化方向上的一个估计结果。     

Z_P群中N维广义正方体上的哈密顿回路

设Z_P={1,2,…,P-1,0},在模P的加法运算下,Z_P是一个群。Z_P上定义n维广义正方体,其顶点集为{(x_1,x_2,…,x_n):x_i∈Z_P.i=1,2,…,n},两个顶点x和y之间有一条棱,当且仅当sum from i=1 to n丨x_i-y_i丨=1 mod(P)。在这个定义下,本文证明了对任意P≥2和n≥2,Z_P中n维广义正方体上存在一个经过所有顶点的哈密顿回路。文中给出了一些例子作为应用。     

Significance of the Dermal Route of Exposure to Risk Assessment

The skin is a route of exposure that needs to be considered when conducting a risk assessment. It is necessary to identify the potential for dermal penetration by a chemical as well as to determine the overall importance of the dermal route of exposure as compared with inhalation or oral routes of exposure. The physical state of the chemical, vapor or liquid, the concentration, neat or dilute, and the vehicle, lipid or aqueous, is also important. Dermal risk is related to the product of the amounts of penetration and toxicity. Toxicity involves local effects on the skin itself and the potential for systemic effects. Dermal penetration is described in large part by the permeability constant. When permeability constants are not known, partition coefficients can be used to estimate a chemical's potential to permeate the skin. With these concepts in mind, a tiered approach is proposed for dermal risk assessment. A key first step is the determination of a skin-to-air or skin-to-medium partition coefficient to estimate a potential for dermal absorption. Building a physiologically-based pharmacokinetic (PBPK) model is another step in the tiered approach and is useful prior to classical in vivo toxicity tests. A PBPK model can be used to determine a permeability constant for a chemical as well as to show the distribution of the chemical systemically. A detailed understanding of species differences in the structure and function of the skin and how they relate to differences in penetration rates is necessary in order to extrapolate animal data from PBPK models to the human. A study is in progress to examine anatomical differences for four species.     

Minimum power assignment in wireless ad hoc networks with spanner property

Power assignment for wireless ad hoc networks is to assign a power for each wireless node such that the induced communication graph has some required properties. Recently research efforts have focused on finding the minimum power assignment to guarantee the connectivity or fault-tolerance of the network. In this paper, we study a new problem of finding the power assignment such that the induced communication graph is a spanner for the original communication graph when all nodes have the maximum power. Here, a spanner means that the length of the shortest path in the induced communication graph is at most a constant times of the length of the shortest path in the original communication graph. Polynomial time algorithm is given to minimize the maximum assigned power with spanner property. The algorithm also works for any other property that can be tested in polynomial time and is monotone. We then give a polynomial time approximation method to minimize the total transmission radius of all nodes. Finally, we propose two heuristics and conduct extensive simulations to study their performance when we aim to minimize the total assigned power of all nodes. The author is partially supported by NSF CCR-0311174.     

One-dimensional optimal bounded-shape partitions for Schur convex sum objective functions

Consider the problem of partitioning n nonnegative numbers into p parts, where part i can be assigned n_i numbers with n_i lying in a given range. The goal is to maximize a Schur convex function F whose ith argument is the sum of numbers assigned to part i. The shape of a partition is the vector consisting of the sizes of its parts, further, a shape (without referring to a particular partition) is a vector of nonnegative integers (n₁,..., n_p) which sum to n. A partition is called size-consecutive if there is a ranking of the parts which is consistent with their sizes, and all elements in a higher-ranked part exceed all elements in the lower-ranked part. We demonstrate that one can restrict attention to size-consecutive partitions with shapes that are nonmajorized, we study these shapes, bound their numbers and develop algorithms to enumerate them. Our study extends the analysis of a previous paper by Hwang and Rothblum which discussed the above problem assuming the existence of a majorizing shape. This research is partially supported by ROC National Science grant NSC 92-2115-M-009-014.     

冲突视角下运输订单商业竞争战略研究

运用图模型理论研究冲突视角下中欧班列运营过程中运输订单商业竞争战略,构建“渝新欧”班列运营商、“苏满欧”班列运营商和昆山IT企业之间的商业竞争冲突模型。利用TOPSIS法评估班列的运输效率,确定决策者偏好,通过计算均衡解获得符合各决策者利益的理性对策。借助灵敏度分析研究决策者偏好改变对模型冲突结果的影响。研究表明:在竞争中,运输效率较低的一方可以通过降低价格弥补自身劣势而获得订单;运输效率较高的一方只有通过降价才能获得订单。该研究为班列运营商提供利益冲突中的商业竞争战略,能为顾客企业选择高效合理的运输线路提供有效的战略决策,同时亦能为宏观调控者规范市场、提高市场运输效率提供有效的政策启示。     

Multi-objective optimization in partitioning the healthcare system of Parana State in Brazil

Motivated by a proposal of the local authority for improving the existing healthcare system in the Parana State in Brazil, this article presents an optimization-based model for developing a better system for patients by aggregating various health services offered in the municipalities of Parana into some microregions. The problem is formulated as a multi-objective partitioning of the nodes of an undirected graph (or network) with the municipalities as the nodes and the roads connecting them as the edges of the graph. Maximizing the population homogeneity in the microregions, maximizing the variety of medical procedures offered in the microregions, and minimizing the inter-microregion distances to be traveled by patients are considered as three objective functions of the problem. An integer-coded multi-objective genetic algorithm is adopted as the optimization tool, which yields a significant improvement to the existing healthcare system map of the Parana State. The results obtained may have a strong impact on the healthcare system management in Parana. The model proposed here could be a useful tool to aid the decision-making in health management, as well as for better organization of any healthcare system, including those of other Brazilian States.     

DCT域分形图像压缩编码方法

首先研究了一般分形图像压缩方法存在的缺陷，然后对它进行改进。最后在ＤＣＩ域做进一步的改进。实验结果表明，和原来方法相比较，ＤＣＴ域分形图像压缩编码方法具有明显的优越性。     

Convexity-based clustering criteria: theory,algorithms, and applications in statistics

This paper deals with the construction of optimum partitions of for a clustering criterion which is based on a convex function of the class centroids as a generalization of the classical SSQ clustering criterion for n data points. We formulate a dual optimality problem involving two sets of variables and derive a maximum-support-plane (MSP) algorithm for constructing a (sub-)optimum partition as a generalized k-means algorithm. We present various modifications of the basic criterion and describe the corresponding MSP algorithm. It is shown that the method can also be used for solving optimality problems in classical statistics (maximizing Csiszárs -divergence) and for simultaneous classification of the rows and columns of a contingency table.     

Upper Bounds for the SPOT 5 Daily Photograph Scheduling Problem

This paper introduces tight upper bounds for the daily photograph scheduling problem of earth observation satellites. These bounds, which were unavailable until now, allow us to assess the quality of the heuristic solutions obtained previously. These bounds are obtained with a partition-based approach following the divide and pas conquer principle. Dynamic programming and tabu search are conjointly used in this approach. We present also simplex-based linear programming relaxation and a relaxed knapsack approach for the problem.