A heuristic 0–1 integer programming method

Summary In this paper, we present a novel relaxation method for the integer programming problem:Ax=b,A {–1,0,+1}^m×N,x {0,1}^N, N>m. The report includes experimental results of problems with up tom=100 equations andN=400 variables.     

Pt-Au二元双金属/氧化石墨烯电化学传感器同时检测尿酸及多巴胺的应用研究

尿酸(UA)是人体最基础的代谢产物,多巴胺(DA)是一种重要的神经递质。二者同时存在于体液当中,其含量对于人体的健康有着极大的影响,因此实现快速、高效、准确的同时检测具有非常重要的意义。该文研制了一种基于Pt-Au二元双金属负载石墨烯的电化学传感器用于尿酸和多巴胺的测定,结果表明Pt-Au和石墨烯的纳米复合物对尿酸和多巴胺具有非常好的催化氧化作用,并且能实现峰的分离(ΔE>200mV),为尿酸和多巴胺的同时测定提供了有力条件。该传感器对尿酸和多巴胺同时测定的检测下限分别为1.996μmol/L和0.999μmol/L,线性范围分别为17.417μmol/L～1259.357μmol/L和2.486μmol/L～260.141μmol/L。基于Pt-Au二元双金属和石墨烯的电化学传感器具有制作简单方便,成本低廉且具有良好的重现性,用于实际样品的同时测定也得到较好的效果。     

Parallel depth first search. Part II. Analysis

This paper presents the analysis of a parallel formulation of depth-first search. At the heart of this parallel formulation is a dynamic work-distribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the work-distribution scheme and the target architecture. We introduce the concept of isoefficiency function to characterize the effectiveness of different architectures and work-distribution schemes. Many researchers considered the ring architecture to be quite suitable for parallel depth-first search. Our analytical and experimental results show that hypercube and shared-memory architectures are significantly better. The analysis of previously known work-distribution schemes motivated the design of substantially improved schemes for ring and shared-memory architectures. In particular, we present a work-distribution algorithm that guarantees close to optimal performance on a shared-memory/-network-with-message-combining architecture (e.g. RP3). Much of the analysis presented in this paper is applicable to other parallel algorithms in which work is dynamically shared between different processors (e.g., parallel divide-and-conquer algorithms). The concept of isoefficiency is useful in characterizing the scalability of a variety of parallel algorithms.This work was supported by Army Research Office Grant No. DAAG29-84-K-0060 to the Artificial Intelligence Laboratory, and Office of Naval Research Grant N00014-86-K-0763 to the Computer Science Department at the University of Texas at Austin.     

基于绿色证书交易机制的含风电场电力系统动态环境经济调度

为了促进风电消纳以及提高电力系统的经济性,构建基于绿色证书交易机制的含风电场电力系统多目标动态环境经济调度（DEED）模型,提出一种基于反向学习混沌搜索的OLCS-MOEA/D算法的DEED调度求解方法。首先,采用广义反向学习初始化种群提高种群多样性,并引入基于Logistic映射的混沌搜索算法以增强算法局部搜索能力。然后,为了验证算法的性能,采用标准测试函数F1—F7进行测试,同时将该算法对模型进行求解,获得了比其他算法范围更广和分布均匀的Pareto解集前沿。最后,对基于绿色证书交易机制的动态环境经济调度与传统动态环境经济调度进行结果对比分析,通过仿真算例验证该模型和算法的有效性和优越性。     

The Importance of Therapeutically Targeting the Binary Toxin from Clostridioides difficile

Novel therapeutics are needed to treat pathologies associated with the Clostridioides difficile binary toxin (CDT), particularly when C. difficile infection (CDI) occurs in the elderly or in hospitalized patients having illnesses, in addition to CDI, such as cancer. While therapies are available to block toxicities associated with the large clostridial toxins (TcdA and TcdB) in this nosocomial disease, nothing is available yet to treat toxicities arising from strains of CDI having the binary toxin. Like other binary toxins, the active CDTa catalytic subunit of CDT is delivered into host cells together with an oligomeric assembly of CDTb subunits via host cell receptor-mediated endocytosis. Once CDT arrives in the host cell’s cytoplasm, CDTa catalyzes the ADP-ribosylation of G-actin leading to degradation of the cytoskeleton and rapid cell death. Although a detailed molecular mechanism for CDT entry and host cell toxicity is not yet fully established, structural and functional resemblances to other binary toxins are described. Additionally, unique conformational assemblies of individual CDT components are highlighted herein to refine our mechanistic understanding of this deadly toxin as is needed to develop effective new therapeutic strategies for treating some of the most hypervirulent and lethal strains of CDT-containing strains of CDI.     

基于改进狮群算法和BP神经网络模型的房价预测

将狮群算法(lion swarm optimization, LSO)与海鸥算法的迁徙机制和螺旋搜索机制结合,增强算法的局部搜索能力;同时增加监督机制,提高算法的全局搜索能力。与粒子群算法和狮群算法对比,在常用的测试函数上验证改进狮群算法的优越性。采用改进后的狮群算法优化BP神经网络模型,对房屋价格预测问题进行研究,通过房屋的户型、面积等相关指标有效地对青岛市的二手房价格进行预测。改进后的狮群算法对BP神经网络的权值和偏置进行优化,提高BP神经网络的收敛速度和训练精度。试验结果表明,提出的螺旋搜索狮群和BP结合算法(spiral search lion swarm optimization-BP, SLSO-BP)模型在房价预测问题上预测效果更好。     

FBMC-OQAM系统中一种改进的OPTS算法

针对采用重叠部分传输序列(overlapping partial transmit sequence, OPTS)算法来抑制滤波器组多载波-偏移正交幅度调制(filter bank multicarrier-offset quadrature amplitude modulation, FBMC-OQAM)信号的峰均比(peak-to-average power ratio, PAPR)时会导致计算量过高的问题,在对现有的禁忌搜索算法进行改进后提出一种基于并行禁忌搜索的OPTS(parallel tabu search overlapping partial transmit sequence algorithm, parallel-TS-OPTS)算法,通过将h路传统禁忌搜索算法得出的各自最优解进行遗传交叉操作来优化传统禁忌搜索算法的初始解,从而进一步增大算法搜索到最佳相位因子向量的概率。理论分析与仿真结果表明,本研究的算法可以在获得接近于OPTS算法PAPR抑制效果的同时显著降低算法的计算复杂度,进一步提高FBMC-OQAM系统应用在5G场景中的鲁棒性。     

基于语义分析的设计实体智能搜索

本文提出了在设计联盟组织过程中实现互联网上设计实体智能搜索的方法。根据对互联网上设计实体搜索问题的分析建立了设计实体智能搜索策略；定义了提取设计实体查询向量和描述向量的语义分析规则；提出了基于语义分析的设计实体智能搜索算法；最后编程实现了各项功能。     

搜索引擎页面排序算法研究综述*

系统地分析了现有的页面排序算法,指出了它们各自的优势和存在的不足,并指出不同算法在不同领域和场合所具有的优势。建立专业搜索引擎是提高搜索准确性和性能的有效途径。通过网格技术将各种专业搜索引擎集成在一起,形成一个基于网格的搜索引擎,从而更好地满足不同背景不同偏好的用户需求。     

快速的层次树集合分划编码算法*

设计了一个改进算法,它仅需对小波分解矩阵进行一遍扫描即可确定层次树集合分划编码(SPIHT)算法所需的所有D(i,j)和L(i,j)重要性并完成对所有(i,j)子系数的编码,使得按照SPIHT的排序方法编码时只需查找存放D(i,j)和L(i,j)的重要性及(i,j)子系数的编码表,从而大大提高了SPIHT的编码速度.