基于粘贴和删除系统的图着色问题分析

图着色问题是图与组合优化中的一个NP-完全问题．现有算法在求解图着色问题时,计算复杂性随着待解问题规模的增大呈指数增长．粘贴系统和删除系统是分别基于粘贴运算和删除运算的两种语言生成器．文中将图着色问题和图的坏边数结合起来,将图着色问题转化成搜索最长序列的问题,然后利用粘贴系统和删除系统的并行性,得到了图的色数及其所有色类．与已有求解图着色问题的DNA算法相比,新的算法具有较低的复杂性．     

Joint imputation of whole-genome sequence variants and large chromosomal deletions in cattle

Genotype imputation, often focused on SNP and small insertions and deletions (indels; size ≤50 bp), is a crucial step for association mapping and estimation of genomic breeding values. Here, we present strategies to impute genotypes for large chromosomal deletions (size >50 bp), along with SNP and indels in cattle. The pipelines include a strategy for extending the whole-genome sequence reference panel for large deletions, a 2-step genotype refinement approach using Beagle4 and SHAPEIT2 software, and finally, joint imputation of SNP, indels, and large deletions to the existing SNP array-typed population using Minimac3 software. Using these pipelines we achieved an imputation accuracy of the squared Pearson correlation (r²) > 0.6 at minor allele frequencies as low as 0.7% for SNP and indels, and 0.2% for large deletions. This highlights the potential of our approach to build a haplotype reference panel and impute different classes of sequence variants across a wide allele frequency spectrum with high accuracy.     

非服从性分布式系统中博弈分析法下的副本放置问题

为解决非服从性分布式系统中多数据、多节点、有容量限制的副本放置问题,建立了副本放置模型以及向博弈模型的映射,分析了在无容量限制及有容量限制下纳什均衡的存在性问题以及纳什均衡的优化程度。考虑到纳什均衡获取的时间不可行,提出了无删除副本放置局面的定义,设计了该局面的获取算法并分析算法的相关性质。模拟实验显示了无删除副本放置局面获取算法下系统平均副本数和总代价随节点的容量及放置代价变化的过程,同时在小节点规模下与最优副本放置结果进行比较,结果显示纳什均衡带来的系统总代价不会与最优系统总代价有大的差别,说明在保证个体利益最大化时,全局的效益并不会有大的损害。     

爬虫系统中标签删除功能的设计及优化

在用爬虫爬取到大型商品网站的大规模网页数据集后,要将网页数据集作进一步筛选以得到目标数据集,筛选之前要做的一项准备工作就是删除网页中多余的标签.为此,用递归算法的思想给出了标签删除的算法,提出了标签删除功能的软件设计思想,对设计进行了2次设计改进及性能优化,最终采用了1个缓冲区维系线程1个标签删除线程的双线程设计思想.实验表明,优化后的标签删除功能在单机上每1000个网页的平均处理时间只需19.7 s,处理20万个网页只需1.1小时.     

面向存储介质的数据安全删除

随着信息通信技术的快速发展,存储介质中的信息量显著增加,这些信息的长期存储容易导致隐私泄露,仅仅删除存储介质文件索引表无法达到彻底删除的目的,具有一定的安全隐患,如何保护存储介质中的信息隐私安全备受关注.针对上述问题,首先介绍安全删除相关的基础知识,包括存储介质的基本结构、存储原理和删除原理;然后分析主流的数据安全删除标准,并研究这些标准的特性;最后,设计与实现一种能够达到数据不可恢复的安全删除原型系统,并对现有数据删除软件进行测试与分析.结果表明所开发原型系统能够实现存储介质中的数据安全删除,有效保护数据安全与隐私.     

Efficient updating of discovered high-utility itemsets for transaction deletion in dynamic databases

Most algorithms related to association rule mining are designed to discover frequent itemsets from a binary database. Other factors such as profit, cost, or quantity are not concerned in binary databases. Utility mining was thus proposed to measure the utility values of purchased items for finding high-utility itemsets from a static database. In real-world applications, transactions are changed whether insertion or deletion in a dynamic database. An existing maintenance approach for handling high-utility itemsets in dynamic databases with transaction deletion must rescan the database when necessary. In this paper, an efficient algorithm, called PRE-HUI-DEL, for updating high-utility itemsets based on the pre-large concept for transaction deletion is proposed. The pre-large concept is used to partition transaction-weighted utilization itemsets into three sets with nine cases according to whether they have large (high), pre-large, or small transaction-weighted utilization in the original database and in the deleted transactions. Specific procedures are then applied to each case for maintaining and updating the discovered high-utility itemsets. Experimental results show that the proposed PRE-HUI-DEL algorithm outperforms a batch two-phase algorithm and a FUP2-based algorithm in maintaining high-utility itemsets.     

带不等式约束的线性回归模型中单个异常点的检验和影响度量

对带不等式约束的线性回归模型进行了异常点检验,通过数据删除模型找出一个数据点是否为异常点的度量依据,并且给出了单个数据点的影响度量.     

Bipartite organization of the Bacillus subtilis endo-{beta}-1,4-glucanase revealed by C-terminal mutations

The C-terminal boundary of primary sequence of the Bacillussubtilis PAP115 endo-ß-1,4-glucanase (EG) requiredfor stable catalytic activity has been mapped by site-directedmutagenesis using Escherichia coli as host. The 52 kDa cel geneproduct, EG₄₇₀ and a 33 kDa mutant (EG₃₀₀), lacking 170 residuesthrough a nonsense mutation at the leucine-330 codon of thegene, exhibited similar patterns of enzymatic activity and pHoptima using cellooligopentaose as substrate.CD spectra indicatedthat the bulk of the -helical secondary structure in EG₄₇₀ wascontained within EG₃₀₀. However, relative to EG₄₇₀, the specificactivity of EG₃₀₀ was 3- to 4-fold lower with amorphous celluloseas substrate and {small tilde}4-to5-fold higher with carboxymethylcellulose(soluble cellulose).These results along with data which showthat EG₄₇₀ binding capacity to mirocrystalline cellulose is{small tilde} 11 times more than that of EG₃₀₀, demonstratethe importance of residues 330–499 for non-catalytic bindingof cellulose. A construct of the cel gene carrying a deletionof codons 330–499 and an insertion of a nonsense codonat leucine-330, was further used to make mutants EG₂₉₆ and EG₂₉₁with nonsense codon substitutions at arginine and serine-321,respectively.Western analysis using EG-specific antiserum revealedthat relative losses in enzymatic activity of EG₂₉₆ (50%) andEG₂₉₁ (95%) could be accounted for by the extent of their proteolysis,signifying a marked destabilization of these enzymes by removalof only a few amino acids.     

LOD技术在地下水有限元后处理中的应用

地下水有限元后处理阶段的数据量较大,这对模型重现、网络快速传输和计算结果的实时可视化造成困难。为此,分析地下水有限元后处理中面临的主要问题和LOD技术,指出顶点元素删除法是一种适应地下水有限元后处理的有效数据模型简化方法,设计顶点删除和恢复过程中的主要数据结构,并应用DT方法对“空洞”进行局部三角剖分。实例证明该方法在地下水有限元后处理中应用的有效性。