城市雕塑的总平面布局

从城市设计的角度分析了城市雕塑的总平面布局特性以及在设置城市雕塑时应当遵循的原则．     

Bayesian variable sampling plan for the weibull distribution with type I censoring

In this article, we study a model of a single variable sampling plan with Type I censoring. Assume that the quality of an item in a batch is measured by a random variable which follows a Weibull distributionW (λ,m), with scale parameter λ and shape parameterm having a gamma-discrete prior distribution or σ=1/λ andm having an inverse gamma-uniform prior distribution. The decision function is based on the Kaplan-Meier estimator. Then, the explicit expressions of the Bayes risk are derived. In addition, an algorithm is suggested so that an optimal sampling plan can be determined approximately after a finite number of searching steps.     

几何分布时间序贯检验的贝叶斯推断

设有统计模型｛ｘ,Ｂｘ,Ｐθ｝,θ∈（０,１）,其中Ｐθ为几何分布：Ｐθ（Ｘ＝ｋ）＝（１－θ）θ＾ｋ－１ｋ＝１,２,…。考虑检验问题：θ＝θｏ ｖｓ． θ＝θ１（０〈θ０〈θ１〈１）本文对一种依次试验的时间序贯样本,给出了上述检验问题的贝叶斯停止判决法则,其中损失函数为试验费用和误判损失之和,贝叶斯停止判决法则由后验概率的两组界（上界和下界）所给出。     

封闭渔场收入优化的捕捞规划模型

运用定量的手段,对封闭渔场可获最大净收入现值的捕捞规划问题进行了分析,建立了制定捕捞规划的理论模型,并给出了模型中参数的具体计算方法。     

规划搜索与代数方程求根

规划搜索是从初始状态S。经过中间目标S1,S2……,S1达到目标状态S9=Sf+1的搜索方法,用于求n次代数方程的实根时S0是根模上,下界所划的区间,S0是宽度小于允许误差的有根区间。这样的有根区间上、下限的平均值是根的较准确的近似值。为了使搜索方法可靠,在预处理中用Sturm定理判     

Compact Metric Spaces and Weak Forms of the Axiom of Choice

It is shown that for compact metric spaces (X, d) the following statements are pairwise equivalent: “X is Loeb”, “X is separable”, “X has a we ordered dense subset”, “X is second countable”, and “X has a dense set G = ∪{G_n : n ∈ ω}, ∣G_n∣ < ω, with lim_n→∞ diam (G _n) = 0”. Further, it is shown that the statement: “Compact metric spaces are weakly Loeb” is not provable in ZF⁰ , the Zermelo‐Fraenkel set theory without the axiom of regularity, and that the countable axiom of choice for families of finite sets CAC_fin does not imply the statement “Compact metric spaces are separable”.     

格子玻尔兹曼法多块网格的交界结构优化研究

基于格子玻尔兹曼方法LBM(Lattice Boltzmann Method)对多块网格方法(Multi-Block)的粗细网格交界结构进行了研究,提出了一种新的优化处理方案。解决了原有网格交界结构存在的三个问题,即两套插值运算造成的程序结构复杂的问题,存储前几个时间步的节点流场数据以备插值运算造成内存浪费的问题和基于时间插值结果进行空间插值计算造成插值误差积累的问题。用一次多点二维空间插值的方式,将原方法的空间和时间双插值,简并成一次空间插值。通过对经典的非定常的圆柱绕流算例和定常的标准顶盖方腔驱动流算例的仿真模拟,验证了交界面处质量、动量及应力的连续性以及网格交界面数据过渡的流畅度,最终验证了改进方法的正确性。数值模拟结果表明,改进后多块算法可实现局部网格细化,进一步推动LBM方法在实际工程问题中的应用。     

基于文化距离视角的美国OFDI区位选择研究

基于Hofstede文化维度理论和世界价值观调查数据,测度了基于KSI、EDI、WVS的3种文化距离（cultural distance,CD）,结合美国对52个东道国（地区）的直接投资及各项控制指标数据,使用面板校正标准误差（panel correction standard error,PCSE）模型进行分析,结果显示,CD与美国对外直接投资（outward foreign direct investment,OFDI）并非呈现简单的正负向关系,而可能存在门槛效应。通过Hansen门槛回归模型进一步考察了二者的内在作用机制,结果显示,CD通过了单门槛检验,即CD对美国OFDI存在门槛效应;当CD小于门槛值时,其作为正向因子积极促进美国OFDI,一旦CD超过门槛值,美国OFDI将显著减少。同时对“外来者劣势”和“外来者收益”二者关系的解释说明,CD与美国OFDI呈倒U型关系;CD较大时对美国OFDI的阻碍作用远大于CD较小时对其的促进作用,体现了美国OFDI对CD的敏感性。     

On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs

It is well known that almost every graph in the random space G(n, p) has chromatic number of order O(np/log(np)), but it is not clear how we can recognize such graphs without eventually computing the chromatic numbers, which is NP‐hard. The first goal of this article is to show that the above‐mentioned upper bound on the chromatic number can be guaranteed by simple degree conditions, which are satisfied by G(n, p) almost surely for most values of p. It turns out that the same conditions imply a similar bound for the choice number of a graph. The proof implies a polynomial coloring algorithm for the case p is not too small. Our result has several applications. It can be used to determine the right order of magnitude of the choice number of random graphs and hypergraphs. It also leads to a general bound on the choice number of locally sparse graphs and to several interesting facts about finite fields. © 1999 John Wiley & Sons, Inc. J Graph Theory 31: 201–226, 1999