Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes

An identifying code is a subset of vertices of a graph with the property that each vertex is uniquely determined (identified) by its nonempty neighbourhood within the identifying code. When only vertices out of the code are asked to be identified, we get the related concept of a locating-dominating set. These notions are closely related to a number of similar and well-studied concepts such as the one of a test cover. In this paper, we study the decision problems Identifying Code and Locating-Dominating Set (which consist in deciding whether a given graph admits an identifying code or a locating-dominating set, respectively, with a given size) and their minimization variants Minimum Identifying Code and Minimum Locating-Dominating Set. These problems are known to be NP-hard, even when the input graph belongs to a number of specific graph classes such as planar bipartite graphs. Moreover, it is known that they are approximable within a logarithmic factor, but hard to approximate within any sub-logarithmic factor. We extend the latter result to the case where the input graph is bipartite, split or co-bipartite: both problems remain hard in these cases. Among other results, we also show that for bipartite graphs of bounded maximum degree (at least 3), the two problems are hard to approximate within some constant factor, a question which was open. We summarize all known results in the area, and we compare them to the ones for the related problem Dominating Set. In particular, our work exhibits important graph classes for which Dominating Set is efficiently solvable, but Identifying Code and Locating-Dominating Set are hard (whereas in all previous works, their complexity was the same). We also introduce graph classes for which the converse holds, and for which the complexities of Identifying Code and Locating-Dominating Set differ.     

基于粒子滤波的运动目标光电定位仿真研究

运动目标的光电定位不能像静止目标那样简单做均值滤波，鉴于此，引入粒子滤波算法，它不仅可以应用于线性系统，而且还适用于非线性系统。结合光电定位需求，详细推导了计算公式及初值和参数选取公式，对只含测量噪声以及含有测量和运动噪声等的海面运动目标光电无源定位算法进行了仿真计算，验证了算法的有效性，讨论了噪声强度对滤波效果的影响，滤波参数选择对滤波效果的影响，目标运动方式对滤波跟随性的影响，重采样算法对滤波效果的影响等。所得结论为:粒子滤波可用于运动目标光电定位过程，可有效降低定位误差；粒子滤波算法具有较强鲁棒性，适用于噪声较大、目标运动形态变化大等情况。     

不同材料弹体超声速侵彻钢筋混凝土靶的结构破坏对比实验

设计了超声速钻地结构弹,采用203 mm口径的火炮,开展了25 kg量级弹体在1100~1300 m/s速度范围内侵彻钢筋混凝土靶的实验研究,应用数值仿真对弹体侵彻钢筋混凝土靶的过程进行了模拟计算。基于实验和仿真结果,对超声速侵彻条件下两种金属材料弹体的结构响应、质量损失等问题进行了分析。结果表明:在超声速侵彻钢筋混凝土靶的过程中,两种金属材料的弹体结构变形破坏形式主要为头部侵蚀和侧壁磨蚀,头部侵蚀量的大小与弹体壳体材料有关,高强度G50钢材料更适合用于1200 m/s速度量级的超声速侵彻环境。对出现的“径缩”现象作了初步分析,并对今后工程应用的结构弹体设计提出了指导意见。     

激光惯性约束聚变靶制备技术研究进展

在实验室实现聚变反应释放的能量大于点燃聚变反应所需能量的阈值是当今世界ICF研究的主要目标,实现这一目标仍需要深入研究一系列的关键物理问题。在ICF研究中,制靶能力的发展与提升至关重要,靶的质量是实验成功的核心要素之一。本文介绍了国际ICF靶制备工作近年来在新型烧蚀层材料靶丸、新型靶丸支撑技术、优化黑腔材料与构型以及减小燃料填充管直径等方面取得的一系列进展,并结合ICF物理需求,简要阐述了ICF靶的发展趋势。     

载机平台光电转塔目标定位的仿真算法

目标定位是光电转塔典型功能和任务之一，对其定位精度的考量也是转塔作战技术指标之一，针对该问题，从理论和仿真角度进行了分析。分析目标定位中用到的坐标系及其相互转换关系，给出光电转塔视轴反演、有源目标定位、无源目标定位的算法流程，通过仿真实验加以验证，考虑了定位过程中可能的随机误差来源，并分析是否采用均值滤波及其对定位结果的影响，最后通过Monte-Carlo分析计算了定位精度。分析结果表明:1）有源定位比无源定位的精度高，在仿真假设条件下，精度约提高1倍；2）均值滤波后，定位精度有较大提升（约提高15倍）；3）18 km距离时典型无源定位精度在80%置信度条件下约为39.4 m；4）统计直方图反映出80%置信度CEP半径及最大误差距离随载机位置、姿态、转塔视轴等（体现在目标载机距离上）不同参数的变化结果。     

空中目标多波段红外辐射特性描述与仿真分析

针对空中目标在复杂背景下的探测需求,根据实际目标的运动特性,分析目标在飞行高度、飞行姿态角改变时的辐射特点,基于MODTRAN计算得到大气辐射和衰减数据,建立目标的三维模型、热辐射和反射模型,搭建空中目标的红外成像仿真系统.分析和仿真结果表明:在中波波段,目标尾焰的红外辐射比蒙皮强很多,在长波波段,蒙皮的红外辐射比较强,仿真图像的细节比较多,尾焰的红外辐射虽然有所减弱,红外成像效果依旧很好;相同探测条件下,由于位置越高大气越稀薄,探测器的可探测距离会变得比较远.目标红外辐射特性的分析和红外仿真系统的搭建对缩短红外探测器的研制周期和进一步确定探测器波段和系统分辨率等指标提供了参考依据.     

Diffusive search with spatially dependent resetting

We consider a stochastic search model with resetting for an unknown stationary target $a\in \mathbb{R}$ with known distribution $\mu$. The searcher begins at the origin and performs Brownian motion with diffusion constant $D$. The searcher is also armed with an exponential clock with spatially dependent rate $r=r\left(\cdot \right)$, so that if it has failed to locate the target by the time the clock rings, then its position is reset to the origin and it continues its search anew from there. Denote the position of the searcher at time $t$ by $X\left(t\right)$. Let $E_0^{\left(r\right)}$ denote expectations for the process $X\left(\cdot \right)$. The search ends at time $T_a=inf\{t\ge 0:X\left(t\right)=a\}$. The expected time of the search is then ${\int }_{\mathbb{R}}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$. Ideally, one would like to minimize this over all resetting rates $r$. We obtain quantitative growth rates for $E_0^{\left(r\right)}{T}_a$ as a function of $a$ in terms of the asymptotic behavior of the rate function $r$, and also a rather precise dichotomy on the asymptotic behavior of the resetting function $r$ to determine whether $E_0^{\left(r\right)}{T}_a$ is finite or infinite. We show generically that if $r\left(x\right)$ is of the order ${\left|x\right|}^{2l}$, with $l>-1$, then $log{E}_0^{\left(r\right)}{T}_a$ is of the order ${\left|a\right|}^{l+1}$; in particular, the smaller the asymptotic size of $r$, the smaller the asymptotic growth rate of $E_0^{\left(r\right)}{T}_a$. The asymptotic growth rate of $E_0^{\left(r\right)}{T}_a$ continues to decrease when $r\left(x\right)\sim \frac{D\lambda }{x^2}$ with $\lambda >1$; now the growth rate of $E_0^{\left(r\right)}{T}_a$ is more or less of the order ${\left|a\right|}^{\frac{1+\sqrt{1+8\lambda }}{2}}$. Note that this exponent increases to $\infty$ when $\lambda$ increases to $\infty$ and decreases to 2 when $\lambda$ decreases to 1. However, if $\lambda =1$, then $E_0^{\left(r\right)}{T}_a=\infty$, for $a\ne 0$. Our results suggest that for many distributions $\mu$ supported on all of $\mathbb{R}$, a near optimal (or optimal) choice of resetting function $r$ in order to minimize ${\int }_{{\mathbb{R}}^d}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$ will be one which decays quadratically as $\frac{D\lambda }{x^2}$ for some $\lambda >1$. We also give explicit, albeit rather complicated, variational formulas for ${inf}_{r\gneqq 0}{\int }_{{\mathbb{R}}^d}\left(E_0^{\left(r\right)}{T}_a\right)\mu \left(da\right)$. For distributions $\mu$ with compact support, one should set $r=\infty$ off of the support. We also discuss this case.     

框架核酸高通量检测芯片

构建了一种基于框架核酸的高通量生物检测芯片.利用超微量移液自动化平台,将包含框架核酸探针的液滴按照预设命令固定至生物芯片微阵列上,在探针捕获核酸靶标后利用集成的基因芯片扫描仪对芯片进行成像,通过分析荧光强度定量化分析靶标浓度.结果表明,此框架核酸芯片能够实现框架核酸探针的高通量制备, 24 h即可制备具有15万个点的微阵列,且点间距离的相对偏差W≤10%、荧光强度的变异系数CV=3.30%,具有较高的稳定性,远高于国家标准.此外,该芯片具备高灵敏度、可寻址的高通量生物分析能力,对核酸靶标的检测限可达100 pmol/L.随着多种探针技术的发展,生物检测微阵列技术在高通量生物分析领域展示出巨大的潜力.     

活性导向的化学探针在氨基酸反应活性表征中的应用进展

原创药物的研制得益于蛋白质新靶标的发现,而新靶标的发现依赖于高可信度、高通量的药物-蛋白质相互作用分析方法。蛋白质作为生命功能的执行者,其表达量、空间定位与结构差异直接影响药效的发挥。目前,超过85%的蛋白质尚被认为是无法成药的,主要原因是缺少药物分子靶向的空腔以及相应的反应活性位点。因此,基于蛋白质组学层次实现对氨基酸反应活性位点的表征成为原创共价靶向药物设计的关键,也是克服难以成药靶标蛋白问题的关键。近年来,质谱技术的飞速发展极大地推动了基于蛋白质组学技术的药物-靶蛋白相互作用研究。其中基于活性的蛋白质组分析(ABPP)策略是利用活性位点导向的化学探针分子在复杂样品中实现功能状态酶和药物靶标等蛋白质的检测。基于化学探针的开发和质谱定量技术的发展,ABPP技术在氨基酸反应活性表征研究中展现出重要的应用潜力,将助力于药物新靶标的发现和药物先导化合物的开发。ABPP策略主要基于蛋白质的活性特征进行富集,活性探针作为ABPP策略的核心,近年来取得了飞速进展。该文回顾了ABPP策略的发展历程,重点介绍基于广谱活性探针的ABPP技术在多种氨基酸反应活性筛选领域的研究进展,并对其在药物靶点发现中...     

Identification strategies for flame retardants employing time‐of‐flight mass spectrometric detectors along with spectral and spectra‐less databases

In the past, the preferred strategy for the identification of unknown compounds was to search in an appropriate mass spectral database for spectra obtained using either electron ionisation (GC‐MS analyses) or collision‐induced dissociation (LC‐MS/MS analyses). Recently, an increase has been seen in the use of accurate mass instruments and spectra‐less databases, based on monoisotopic accurate mass alone. In this article, we describe a systematic workflow for the screening and identification of new flame retardants. This approach utilises LC‐quadrupole‐time‐of‐flight MS and spectra‐less databases based only on monoisotopic accurate mass for the identification of ‘unknowns’. An in‐house database was built, and the input parameters used in the data analysis process were optimised for flame retardant chemicals, so that it can be easily transferred to other laboratories. The procedure was successfully applied to dust, foam and textiles from car interiors and indoor consumer products. The developed method was demonstrated for the main new flame retardant present in Antiblaze V6 and for the three unreported reaction by‐products/impurities present in the same technical mixture. Copyright © 2015 John Wiley & Sons, Ltd.