Quantifying the similarity of 2D images using edge pixels: an application to the forensic comparison of footwear impressions

We propose a novel method to quantify the similarity between an impression (Q) from an unknown source and a test impression (K) from a known source. Using the property of geometrical congruence in the impressions, the degree of correspondence is quantified using ideas from graph theory and maximum clique (MC). The algorithm uses the x and y coordinates of the edges in the images as the data. We focus on local areas in Q and the corresponding regions in K and extract features for comparison. Using pairs of images with known origin, we train a random forest to classify pairs into mates and non-mates. We collected impressions from 60 pairs of shoes of the same brand and model, worn over six months. Using a different set of very similar shoes, we evaluated the performance of the algorithm in terms of the accuracy with which it correctly classified images into source classes. Using classification error rates and ROC curves, we compare the proposed method to other algorithms in the literature and show that for these data, our method shows good classification performance relative to other methods. The algorithm can be implemented with the R package shoeprintr.     

高维大数据基因网络中的社区发现——以NC方法为例

从大量基因中识别出致病基因是大数据下的一个十分重要的高维统计问题。基因间网络结构的存在使得对于致病基因的识别已从单个基因识别扩展到基因模块识别。从基因网络中挖掘出基因模块就是所谓的社区发现（或节点聚类）问题。绝大多数社区发现方法仅利用网络结构信息,而忽略节点本身的信息。Newman和Clauset于2016年提出了一个将二者有机结合的基于统计推断的社区发现方法（简称为NC方法）。本文以NC方法为案例,介绍统计方法在实际基因网络中的应用和取得的成果,并从统计学角度提出了改进措施。通过对NC方法的分析可以看出对于以基因网络为代表的非结构化数据,统计思想和原理在数据分析中仍然处于核心地位。而相应的统计方法则需要针对数据的特点及关心的问题进行相应的调整和优化。     

一类新的广义变分包含系统及其迭代算法

在Banach空间中介绍了一类新的广义变分包含系统.利用松弛增生映象及预解算子,证明了该广义变分包含系统解的存在性和唯一性,同时也建立了收敛于该唯一解的迭代算法,并给出相应的迭代收敛定理.     

多车场集送一体化车辆调度问题及其遗传算法研究

针对物流配送中的多车场一体化车辆调度问题提出了智能处理方法,采用了基于自然数的一体化配送对路径表示方式,用里程约束来控制车场的插入,以增加惩罚的方式加入时间窗约束。并且根据具体约束情况设计了改进的遗传算法,采用了动态染色体、改进的交叉和变异法、内部扰动和外部扰动等技术,提高了遗传算法的优化效率和优化效果。介绍了此算法的原理,给出了具有一个代表性算例试验结果和结果分析。试验结果表明了此方法对优化有里程和时间窗约束的多车场一体化车辆调度问题的有效性。     

遗传算法在入侵检测中的应用

介绍了基于模型推理和基于模型两种入侵检测系统,提出了一种新的基于智能体技术的入侵检测系统体系结构,解决了传统集中式入侵检测系统的弊病,将任务处理和数据分布到网络各个结点上,充分利用网络资源协同完成入侵检测任务;介绍了遗传算法在该系统中的应用,因系统安全的先验知识体现在对原始数据中有价值特征属性变量集的选择上,故利用遗传算法对特征属性变量子集的选择进行优化,找到相对最优的由特征向量表示的特征属性变量集,以降低入侵检测系统的负荷。     

浆细胞膜糖蛋白基因K121Q变异与老年人2型糖尿病的关联研究

目的探讨浆细胞膜糖蛋白基因(PC-1)4号外显子K121Q变异与老年人2型糖尿病的相关性。方法自2006年北京市社区2型糖尿病调查资料中选出有糖尿病家族史,且相互间无亲缘关系的老年2型糖尿病患者228例,同时选择非糖尿病健康老年对照人群308例。所有受试者均签署知情同意书,所有受试者均为汉族。应用聚合酶链反应-限制性片段长度多态性(PCR-RFLP)方法,检测PC-1基因K121Q的多态性分布情况。结果老年2型糖尿病患者中KK基因型177例(77.6%),KQ基因型46例(20.2%),QQ基因型5例(2.2%),K、Q等位基因频率分别是87.7%和12.3%;正常老年对照组中KK基因型239例(77.6%),KQ基因型63例(20.5%),QQ基因型6例(1.9%),K、Q等位基因频率分别是87.8%和12.2%;PC-1基因K121Q变异的基因型频率和等位基因频率在两组中的分布差异无显著性(P>0.05);PC-1基因K121Q变异的基因型频率和等位基因频率在男性和女性中的分布差异也无显著性(P>0.05);PC-1基因K121Q变异的KK基因型组与KQ QQ基因型组中的肥胖指标的特征差异也无显著性(P>0.05)。结论PC-1基因K121Q变异可能与老年人2型糖尿病的易感性无关联。     

A comparison of nonparametric priors in hierarchical mixture modelling for AFT regression

We will pursue a Bayesian nonparametric approach in the hierarchical mixture modelling of lifetime data in two situations: density estimation, when the distribution is a mixture of parametric densities with a nonparametric mixing measure, and accelerated failure time (AFT) regression modelling, when the same type of mixture is used for the distribution of the error term. The Dirichlet process is a popular choice for the mixing measure, yielding a Dirichlet process mixture model for the error; as an alternative, we also allow the mixing measure to be equal to a normalized inverse-Gaussian prior, built from normalized inverse-Gaussian finite dimensional distributions, as recently proposed in the literature. Markov chain Monte Carlo techniques will be used to estimate the predictive distribution of the survival time, along with the posterior distribution of the regression parameters. A comparison between the two models will be carried out on the grounds of their predictive power and their ability to identify the number of components in a given mixture density.     

On the computation of the noncentral <Emphasis Type="Italic">F</Emphasis> and noncentral beta distribution

Unfortunately many of the numerous algorithms for computing the comulative distribution function (cdf) and noncentrality parameter of the noncentral F and beta distributions can produce completely incorrect results as demonstrated in the paper by examples. Existing algorithms are scrutinized and those parts that involve numerical difficulties are identified. As a result, a pseudo code is presented in which all the known numerical problems are resolved. This pseudo code can be easily implemented in programming language C or FORTRAN without understanding the complicated mathematical background. Symbolic evaluation of a finite and closed formula is proposed to compute exact cdf values. This approach makes it possible to check quickly and reliably the values returned by professional statistical packages over an extraordinarily wide parameter range without any programming knowledge. This research was motivated by the fact that a very useful table for calculating the size of detectable effects for ANOVA tables contains suspect values in the region of large noncentrality parameter values compared to the values obtained by Patnaik’s 2-moment central-F approximation. The cause is identified and the corrected form of the table for ANOVA purposes is given. The accuracy of the approximations to the noncentral-F distribution is also discussed. The authors wish to thank Mr. Richárd Király for his preliminary work. The authors are grateful to the Editor and Associate Editor of STCO and the unknown reviewers for their helpful suggestions.     

An upper bound on the minimal total cost of the transportation problem with varying demands and supplies

In general cases, to find the exact upper bound on the minimal total cost of the transportation problem with varying demands and supplies is an NP-hard problem. In literature, there are only two approaches with several shortcomings to solve the problem. In this paper, the problem is formulated as a bi-level programming model, and proven to be solvable in a polynomial time if the sum of the lower bounds for all the supplies is no less than the sum of the upper bounds for all the demands; and a heuristic algorithm named TPVDS-A based on genetic algorithm is developed as an efficient and robust solution method of the model. Computational experiments on benchmark and new randomly generated instances show that the TPVDS-A algorithm outperforms the two existing approaches.     

Evaluation of multi-objective optimization approaches for solving green supply chain design problems

This paper evaluates the applicability of different multi-objective optimization methods for environmentally conscious supply chain design. We analyze a case study with three objectives: costs, CO₂ and fine dust (also known as PM – Particulate Matters) emissions. We approximate the Pareto front using the weighted sum and epsilon constraint scalarization methods with pre-defined or adaptively selected parameters, two popular evolutionary algorithms, SPEA2 and NSGA-II, with different selection strategies, and their interactive counterparts that incorporate Decision Maker׳s (DM׳s) indirect preferences into the search process. Within this case study, the CO₂ emissions could be lowered significantly by accepting a marginal increase of costs over their global minimum. NSGA-II and SPEA2 enabled faster estimation of the Pareto front, but produced significantly worse solutions than the exact optimization methods. The interactive methods outperformed their a posteriori counterparts, and could discover solutions corresponding better to the DM preferences. In addition, by adjusting appropriately the elicitation interval and starting generation of the elicitation, the number of pairwise comparisons needed by the interactive evolutionary methods to construct a satisfactory solution could be decreased.