An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem

We present a new Immune Algorithm, IMMALG, that incorporates a Stochastic Aging operator and a simple local search procedure to improve the overall performances in tackling the chromatic number problem (CNP) instances. We characterize the algorithm and set its parameters in terms of Kullback Entropy. Experiments will show that the IA we propose is very competitive with the state-of-art evolutionary algorithms.     

Estimating population size with truncated sampling

Let X₁, X₂,…,X_n be independent, indentically distributed random variables with density f(x,θ) with respect to a σ-finite measure μ. Let R be a measurable set in the sample space X. The value of X is observable if X ? (X?R) and not otherwise. The number J of observable X’s is binomial, N, Q, Q = 1?P(X ? R). On the basis of J observations, it is desired to estimate N and θ. Estimators considered are conditional and unconditional maximum likelihood and modified maximum likelihood using a prior weight function to modify the likelihood before maximizing. Asymptotic expansions are developed for the [Ncirc]’s of the form [Ncirc] = N + α√N + β + o_p(1), where α and β are random variables. All estimators have the same α, which has mean 0, variance σ² (a function of θ) and is asymptotically normal. Hence all are asymptotically equivalent by the usual limit distributional theory. The β’s differ and Eβ can be considered an “asymptotic bias”. Formulas are developed to compare the asymptotic biases of the various estimators. For a scale parameter family of absolutely continuous distributions with X = (0,∞) and R = (T,∞), special formuli are developed and a best estimator is found.     

Kernel estimation of a distribution function

A distribution function is estimated by a kernel method with

a poinrwise mean squared error criterion at a point x. Relation- ships between the mean squared error, the point x, the sample size and the required kernel smoothing parazeter are investigated for several distributions treated by Azzaiini (1981). In particular it is noted that at a centre of symmetry or near a mode of the distribution the kernei method breaks down. Point- wise estimation of a distribution function is motivated as a more useful technique than a reference range for preliminary medical diagnosis.     

局部环上典型群的非双曲型

引入域上典型群的生成问题所得的成果；对局部环R上典型群生成问题研究，构造度量函数及一平延，为局部环R上典型群向域F上的典型群导入，给出典型群的非双曲型．     

基于Visual Studio的串口通信

介绍了一种基于Visual Studio的PC对单片机的串口通信方案,该方案提供了PC和单片机端的通信系统模型,该模型从网络的OSI层次系统结构中演化而来。研究了该模块的接口、结构、数据结构和相互调度。     

大数幂剩余的二进制冗余数Montgomery算法

介绍了大数幂剩余的Montgomery算法,提出了基于二进制冗余数的大数幂剩余Montgomery算法模型。理论分析表明,采用二进制冗余数可减少乘法的进位传播,同时使算法的迭代步数减少17.2%。进一步提高了大数幂剩余的运算速度。     

聚并苯和氯代聚并苯同系分子的总能量与同系序数的相关性研究

聚并苯和氯代聚并苯同系分子的总能量与同系序数之间满足下列相关方程ET=aN b,N =2n 1 ,R≈ 1 ,N为同系序数 ,n是苯环的结构单元数 .本文的计算值与文献值吻合 .     

Proof of Toft's Conjecture: Every Graph Containing No Fully Odd K4 is 3-Colorable

A fully odd K₄ is a subdivision of K₄ such that each of the six edges of the K₄ is subdivided into a path of odd length. In 1974, Toft conjectured that every graph containing no fully odd K₄ can be vertex-colored with three colors. The purpose of this paper is to prove Toft's conjecture.     

“动＋个＋……”中“个”的句法语义分析

“个”是使用频率最高的量词,与词类的搭配相当自由。“动 个 ……”中“个”后面的成分既可能是一般的可个称的体词性词语,也可能是抽象的不可个称的体词性词语,还可能是表示动作行为和性质状态的谓词性词语。如果“个”后是一般的可个称的体词性词语,大家一致同意“个”为量词,这时的“个”与其他位置上的“个”无异。可是,如果“个”后是抽象的不可个称的体词性词语或谓词性词语,人们的观点不太一致。作者用普通话、方言和古语相结合、印证的办法,得出“动 个 ……”中“个”后无论是体词性词语还是谓词性词语,“个”都是量词,同时也指出这一位置上的“个”在表意上有别于其他位置上的“个”。     

Measuring the complexity of generalized linear hierarchical models

Measuring a statistical model's complexity is important for model criticism and comparison. However, it is unclear how to do this for hierarchical models due to uncertainty about how to count the random effects. The authors develop a complexity measure for generalized linear hierarchical models based on linear model theory. They demonstrate the new measure for binomial and Poisson observables modeled using various hierarchical structures, including a longitudinal model and an areal‐data model having both spatial clustering and pure heterogeneity random effects. They compare their new measure to a Bayesian index of model complexity, the effective number p_D of parameters (Spiegelhalter, Best, Carlin & van der Linde 2002); the comparisons are made in the binomial and Poisson cases via simulation and two real data examples. The two measures are usually close, but differ markedly in some instances where p_D is arguably inappropriate. Finally, the authors show how the new measure can be used to approach the difficult task of specifying prior distributions for variance components, and in the process cast further doubt on the commonly‐used vague inverse gamma prior.