改进麻雀搜索算法求解作业车间调度问题

针对最小化完工时间的作业车间调度问题(JSP),提出改进麻雀搜索算法(ISSA).首先设计有效的编码转换方式,形成JSP离散决策空间与麻雀搜索算法(SSA)连续搜索空间的对应关系.然后,针对SSA在求解后期易陷入局部最优,利用量子计算、正余弦搜索和警戒者数量递减策略对SSA进行改进,同时引入多邻域搜索和高斯扰动策略以弥补SSA在求解离散问题时深度发掘能力不足的弊端.最后,进行FT、LA系列10个测试问题、6种算法和2个应用实例的对比实验.结果表明,ISSA在求解JSP时,能获得更好的最小值、平均值和寻优成功率,验证了ISSA求解JSP的有效性.     

融合结构-属性交互二部图随机游走的社区搜索方法

属性图中的社区搜索是一种局部社区发现方法,本质是基于用户提供的查询节点返回包含查询节点且在结构内聚的同时属性与查询属性相似的个性化子图.该任务有助于用户更好地理解社区是如何形成的以及社区形成的原因.提出了一种融合结构-属性交互二部图随机游走机制,有效地支持属性图中的社区搜索.具体地,首先基于网络拓扑结构构建结构概率转移...     

基于离散混合多宇宙算法求解折扣{0-1}背包问题

为了利用多宇宙算法(MVO)求解折扣{0-1}背包问题(D{0-1}KP),基于模运算建立了离散型隧道模型和离散虫洞模型,引入具有反向搜索与突变特性的局部搜索策略,提出了第一个具有四进制编码的离散混合多宇宙算法DHMVO.在利用修复与优化算法消除不可行解的基础上,基于DHMVO提出了求解D{0-1}KP的一个新方法.为...     

区块链与可搜索加密结合的电子病历共享方案

电子病历（Electronic Medical Record,EMR）数据的共享被认为是提高医疗服务质量和降低医疗成本的关键方法。然而,EMR分散存储在各个医疗机构中,这阻碍了数据共享,并使患者的隐私面临风险。为了解决这些问题,提出了一个基于区块链的EMR隐私保护数据共享方案。将原始EMR安全地存储在私有链中,而将关键词索引保存在联盟链中,从而有效降低医疗数据泄露的风险,并保证EMR的不可篡改性。利用布尔函数改进基于密文策略属性的关键字搜索算法,用属性上的布尔公式指定表达性访问策略,有效优化了带宽和通信消耗,并引入了门限签名机制,有效地缩短了密文长度。使用私有链服务器执行配对操作,使得搜索速度更快。通过公共验证者检查搜索结果,保证了数据安全并降低了计算开销。安全性和性能分析的结果表明,该方案是实现EMR数据共享的一种安全有效的方法,可减轻用户设备的额外计算负担,最小化带宽和通信消耗。     

混合策略改进的麻雀搜索算法

针对麻雀搜索算法存在的迭代过程中种群多样性减少且容易陷入局部最优以及收敛速度慢等问题,提出混合策略改进的麻雀搜索算法（MSSSA）。利用Circle映射初始化麻雀个体位置,增加初始种群的多样性。结合蝴蝶优化算法（BOA）中蝴蝶飞行方式,改进发现者的位置更新策略,增强算法全局探索能力。采用逐维变异方法对个体位置进行扰动,提升算法跳出局部最优的能力。在仿真实验中与4种基本算法和5种改进算法基于10个基准测试函数进行比较并进行Wilcoxon秩和检验,结果表明所提算法具有更好的收敛性和求解精度,全局寻优能力得到大幅提升。     

A Simultaneous Search Problem

We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x,y ∈ [0,1] with as little uncertainty as possible, using some given number k of probes. Each probe is specified by a real number r∈ [0,1] . After a probe at r , we are told whether x≤ r or x \geq r , and whether y≤ r or y\geq r . We derive the optimal strategy and prove that the asymptotic behavior of the total uncertainty after k probes is 13/7 2 ^-(k+1)/2 for odd k and 13/10 2 ^-k/2 for even k . Received November 11, 1996; revised October 2, 1997, and July 13, 1998.     

Asymmetric Rendezvous Search on the Circle

The rendezvous search problem asks how two blind searchers in a known search region, having maximum speed one, can minimize the expected time needed to meet. Suppose that two players are placed an arc-distance x [ 0,1/2] apart on a circle of circumference 1, and faced in random directions. If x has a continuous density function h which is either decreasing and satisfies ht( 1/2) h(0)/2,or increasing, we determine an optimal rendezvous strategy. Furthermore if h is strictly monotone, this strategy (which depends in a simple manner on h) is uniquely optimal. This work extends that of J. V. Howard, who showed for the uniform density h(x) = 2 that search and wait is optimal , with expected search time 1/2. We also show that the uniform density is the only counterexample on the circle to S. Gal's conjecture (which he proved for the line) on the nonoptimality of search and wait.     

Similarity-based ranking and query processing in multimedia databases

Since media-based evaluation yields similarity values, results to a multimedia database query, Q(Y₁,…,Y_n), is defined as an ordered list S_Q of n-tuples of the form X₁,…,X_n. The query Q itself is composed of a set of fuzzy and crisp predicates, constants, variables, and conjunction, disjunction, and negation operators. Since many multimedia applications require partial matches, S_Q includes results which do not satisfy all predicates. Due to the ranking and partial match requirements, traditional query processing techniques do not apply to multimedia databases. In this paper, we first focus on the problem of “given a multimedia query which consists of multiple fuzzy and crisp predicates, providing the user with a meaningful final ranking”. More specifically, we study the problem of merging similarity values in queries with multiple fuzzy predicates. We describe the essential multimedia retrieval semantics, compare these with the known approaches, and propose a semantics which captures the requirements of multimedia retrieval problem. We then build on these results in answering the related problem of “given a multimedia query which consists of multiple fuzzy and crisp predicates, finding an efficient way to process the query.” We develop an algorithm to efficiently process queries with unordered fuzzy predicates (sub-queries). Although this algorithm can work with different fuzzy semantics, it benefits from the statistical properties of the semantics proposed in this paper. We also present experimental results for evaluating the proposed algorithm in terms of quality of results and search space reduction.     

选煤厂信息物理系统任务调度研究

建立了选煤厂信息物理系统模型,将动态联盟思想引入选煤厂信息物理系统任务调度中,并提出了一种基于改进离散粒子群优化算法的选煤厂信息物理系统任务调度算法。该算法首先采用离散粒子群优化算法进行全局寻优,然后采用禁忌搜索算法进行局部搜索,求得全局最优解。仿真结果表明,该算法提高了任务调度的收敛速度、精度以及处理器的平均利用率。     

自适应人工蜂群算法的盲源分离

盲源分离(BSS)是传感器信号处理领域研究热点,针对传统盲源分离算法大多存在收敛速度慢、分离精度低、适用场合窄的缺点,提出了一种基于自适应人工蜂群算法的盲源分离.利用Givens旋转变换降低计算量,搜索策略引入自适应全局指导项动态调节最优解导向作用,选择策略采用自适应Boltz-mann轮盘赌作改进平衡迭代各阶段选择压力集中程度.实验表明:基于自适应人工蜂群算法的盲源分离,能够加快收敛速度并显著提高分离精度至约3个数量级.