A new family of proximity graphs: Class cover catch digraphs

Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given.     

Modeling Language Evolution

We describe a model for the evolution of the languages used by the agents of a society. Our main result proves convergence of these languages to a common one under certain conditions. A few special cases are elaborated in more depth.     

具有两台专用机,两台通用机的Q4／／Cmax问题的近似算法

本文讨论具有两台专用机、两台通用机的两组工件的同种类平行机的Q4／／Cmax问题，对这类特殊的排序问题，提出一种启发式算法，得到了最差情况下性能指标的严格的界．     

SINGLE MACHINE SCHEDULING WITH CONTROLLABLE PROCESSING TIMES AND COMPRESSION COSTS （PART I：EQUAL TIMES AND COSTS）

Most papers in scheduling research have treated individual job processing times as fixed parameters. However, in many practical situations, a manager may control processing time by realloeating resources. In this paper, authors consider a machine scheduling problemwith controllable processing times. In the first part of this paper, a special case where the pro-cessing times and compression costs are uniform among jobs is discussed. Theoretical results are derived that aid in developing an O（n^2) algorithm to slove the problem optimally. In the second part of this paper, authors generalize the discussion to general case, An effective heuristic to the genera/ problem will be presented.     

交叉分段差分进化支持向量回归的气体超声 流量计测量方法

为了进一步提高全量程气体超声流量计的测量精度,基于多通道声波到时和实时温度,提出了一种交叉分段差分进化(Differential Evolution)支持向量回归(Support Vector Regression)DE-SVR模型。考虑到气体在不同流量条件下的流体状态不同,提出了交叉分段处理的方法,采用DE算法优化选取SVR参数。实验结果表明,对于16~1600m3/h全量程,交叉分段DE-SVR和传统积分方法计算气体流量的平均相对误差分别为0.00447和0.02781,前者较后者降低了83.93%;对于16~160m3/h小流量,交叉分段DE-SVR和无分段DE-SVR算法计算结果平均相对误差分别为0.00436和0.03214,前者较后者降低了86.43%。该方法有效避免了声道长度、探头角度以及管道直径等参数不确定性对流量计算的影响,为全量程气体流量的高精度测量提供了保障。     

MLIMC: Machine Learning-Based Implicit-Solvent Monte Carlo

Monte Carlo (MC) methods are important computational tools for molecular structure optimizations and predictions. When solvent effects are explicitly considered, MC methods become very expensive due to the large degree of freedom associated with the water molecules and mobile ions. Alternatively implicit-solvent MC can largely reduce the computational cost by applying a mean field approximation to solvent effects and meanwhile maintains the atomic detail of the target molecule. The two most popular implicit-solvent models are the Poisson-Boltzmann (PB) model and the Generalized Born (GB) model in a way such that the GB model is an approximation to the PB model but is much faster in simulation time. In this work, we develop a machine learning-based implicit-solvent Monte Carlo (MLIMC) method by combining the advantages of both implicit solvent models in accuracy and efficiency. Specifically, the MLIMC method uses a fast and accurate PB-based machine learning (PBML) scheme to compute the electrostatic solvation free energy at each step. We validate our MLIMC method by using a benzene-water system and a protein-water system. We show that the proposed MLIMC method has great advantages in speed and accuracy for molecular structure optimization and prediction.     

基于热图像的种蛋气室变化监测算法

种蛋气室的大小是监测种蛋孵化过程的重要指标之一。根据种蛋的热力学结构,种蛋在孵化过程中,包裹气室部分蛋壳会与其他部分蛋壳产生温差,从而可通过热红外图像进行观察。针对在种蛋孵化过程中,人工照蛋检测气室效率低的问题,探索设计了一种基于热图像的种蛋气室变化俯视监测算法。监测种蛋气室热图像的算法主要包括种蛋目标检测,种蛋图像分割和种蛋气室面积计算3个部分,其中种蛋的目标检测采用Faster-RCNN算法实现;种蛋图像分割采用BP神经网络算法实现;种蛋气室面积是在种蛋图像分割的基础上进行计算。使用孵化5天及以上的种蛋作为研究对象,并拍取种蛋的热图像进行试验。试验结果表明：种蛋热图像的目标检测的平均精度（mAP）为99.85%,拥有较好的检测效果。使用BP网络对种蛋进行图像分割。BP神经网络经过调参后,其网络最佳的结构为三层隐藏层,每个隐藏层拥有1 000个神经元,最优初始学习率为0.000 1,最优最大迭代次数为500。以F1-measure作为分割效果的评价指标,BP神经网络的图像分割总体结果为87.02%,Otsu算法的总体结果为65.25%。其中只有一个蛋的情况下,BP神经网络的分割结果为87.17%,Otsu算法的结果为68.86%。存在其他种蛋的干扰条件下,BP神经网络的分割结果为86.94%,Otsu算法的结果为61.64%,BP神经网络的分割效果优于Otsu分割算法,BP神经网络拥有更强的抗干扰能力。最后提取了孵化5～19 d种蛋的气室变化,通过观察种蛋气室大小曲线来监测种蛋的孵化情况,可看出随着天数的增加,气室有着明显变大的趋势。人工测量法与热红外测量法比较结果说明两者相关性为0.934 3,拥有较好的相关性。基于热图像的种蛋气室变化监测算法可在实际生产中实现种蛋的识别与气室大小的快速监测,为实现监测种蛋孵化的自动化提供了技术参考。     

Continuum versus discrete networks,graph Laplacians,and reproducing kernel Hilbert spaces

Motivated by applications to machine learning, we construct a reversible and irreducible Markov chain whose state space is a certain collection of measurable sets of a chosen l.c.h. space $\mathfrak{X}$. We study the resulting network (connected undirected graph), including transience, Royden and Riesz decompositions, and kernel factorization. We describe a construction for Hilbert spaces of signed measures which comes equipped with a new notion of reproducing kernels and there is a unique solution to a regularized optimization problem involving the approximation of $L^2$ functions by functions of finite energy. The latter has applications to machine learning (for Markov random fields, for example).