Multicategory Purchase Incidence Models for Partitions of Product Categories

We analyze multicategory purchases of households by means of heterogeneous multivariate probit models that relate to partitions formed from a total of 25 product categories. We investigate both prior and post hoc partitions. We search model structures by a stochastic algorithm and estimate models by Markov chain Monte Carlo simulation. The best model in terms of cross‐validated log‐likelihood refers to a post hoc partition with two groups; the second‐best model considers all categories as one group. Among prior partitions with at least two category groups a five‐group model performs best. Effects on average basket value differ for the model with five prior category groups from those for the best‐performing model in 40% and 24% of the investigated categories for features and displays, respectively. In addition, the model with five prior category groups also underestimates total sales revenue across all categories by about 28%. Copyright © 2016 John Wiley & Sons, Ltd.     

基于联想一体机构建OPAC检索机的研究与实现

联想一体机以其网络同传、硬盘保护等功能,以及美观、节约空间等优势广泛应用于图书馆领域。OPAC检索机是高校图书馆面向读者的主要窗口,通过构建基于联想一体机的图书馆OPAC检索机,运用组策略管理、注册表管理以及BIOS管理等计算机技术,形成了一套完整的检索机安全配置方案,经过一学期的运行,证明了此方案是切实可行的,实现了OPAC检索机的无人值守与零维护。     

Network Motif Detection： Algorithms, Parallel and Cloud Computing,and Related Tools

Network motif is defined as a frequent and unique subgraph pattern in a network, and the search involves counting all the possible instances or listing all patterns, testing isomorphism known as NP-hard and large amounts of repeated processes for statistical evaluation. Although many efficient algorithms have been introduced, exhaustive search methods are still infeasible and feasible approximation methods are yet implausible.Additionally, the fast and continual growth of biological networks makes the problem more challenging. As a consequence, parallel algorithms have been developed and distributed computing has been tested in the cloud computing environment as well. In this paper, we survey current algorithms for network motif detection and existing software tools. Then, we show that some methods have been utilized for parallel network motif search algorithms with static or dynamic load balancing techniques. With the advent of cloud computing services, network motif search has been implemented with MapReduce in Hadoop Distributed File System(HDFS), and with Storm, but without statistical testing. In this paper, we survey network motif search algorithms in general, including existing parallel methods as well as cloud computing based search, and show the promising potentials for the cloud computing based motif search methods.     

基于吸引度搜索的汽车滚装码头堆场车位分配优化

为加快滚装运输过程中汽车装卸滚装船舶的周转率,促进滚装码头堆场车位资源的高效利用,研究了滚装码头堆场车位分配问题.按照成组集中分配原则,以提高成组汽车停放集中度为目标,建立了衡量成组汽车停放集中度的混合整数规划模型.进而设计吸引度搜索算法对模型进行了求解.与分支定界法相比,吸引度搜索算法在高效求解规模化算例的同时可实现解的质量较优.以上海海通汽车滚装码头堆场的车位实际布局及作业情况为背景,验证了所提模型与算法的合理性及有效性,拓展了汽车滚装码头堆场车位分配管理的理论研究.     

大型二维装箱问题及其禁忌算法研究

对大型二维装箱问题进行描述,提出求解该问题的禁忌算法.算法基于自然数编码,设计了货物的摆放规则和序列生成方式,采用二种邻域,根据邻域的不同,构造了两种禁忌表.算法采用惩罚函‘数处理空间利用率约束.介绍算法的原理,给出了具有代表性算例试验结果并且进行了分析.试验结果表明了提出的禁忌算法对优化大型二维装箱问题的有效性.     

基于A*改进算法的机械臂避障路径规划

为解决机械臂在运行时可能与工作空间中的障碍物发生碰撞,提出圆柱体包络碰撞检测法和基于A*算法的变步长分段搜索法.运用圆柱体包络碰撞检测法,将碰撞检测问题转化为计算圆柱体间的位置关系.变步长分段搜索法解决了应用传统A*算法可能出现的搜索数据量大甚至搜索死循环等问题.分别在基于OpenGL的三维仿真实验平台和实际系统中验证了该方法的有效性和可行性.     

任务可拆分项目调度问题

经典资源受限的项目调度问题的前提之一是任务不可拆分,即每个任务只能被一次执行,中间不能停顿.但是在企业实际的项目调度中,许多任务是允许被拆分成若干次执行的.针对任务可拆分的项目调度问题提出了总项目工期最短的数学模型,该模型在任务较多、任务工期较长或时间粒度小时解空间很大,不利于精确求解.提出了一种结合邻域搜索方法的混合遗传算法求解该模型.给出了算法的编码方案、解码规则、适值函数、选择方法、交叉算子和变异算子的实现方法.最后通过算例验证了算法的有效性,列出了任务不能拆分和任务可拆分两种情况下算例最优解的甘特图.     

基于改进蚁群算法和共用航段的搜索救援通道规划

针对战斗搜救任务场景中,空中搜索救援等待区至跳伞区之间的往返路径规划问题,提出一种基于改进蚁群算法和共用航段的搜索救援通道规划方法。首先,针对基本蚁群算法易出现局部极值及收敛速度慢等缺点,对启发函数、状态转移策略、信息素更新策略进行了改进。然后,针对单起点多目标点的路径规划问题,提出了设置分航点以生成共用航段的搜索救援通道规划方法,并以总路径长度表征任务准备负荷量与分别规划航路进行对比。实验结果表明,在本文测试环境下,改进蚁群算法规划的路径长度分别缩减15.4%和14.2%,搜索救援通道的任务准备负荷量减少25.4%。所提出的搜索救援通道规划方法有一定的理论和应用价值。     

索引查找最佳分块方法研究

分析索引查找算法中块内、块间查找方法的选择与时间复杂度的关系,给出具有最小渐近时间复杂度的最佳分块方法.     

搜索3个目标的最优方法

研究如下搜索模型:原始搜索空间G含有n个外观相同的硬币,其中n-3个是具有相同重量的好币(好元),其余3个是重量相同且重于好元的较重硬币(搜索目标),最终目的是找到一个最优算法,它能够借助两臂天平用尽可能少的试验次数从搜索空间中识别出全部3个搜索目标.文章通过建立有效的搜索方法,证明了最小试验次数或者等于信息论下界或者超过信息论下界1次并且对于无穷多个区间,信息论下界均是可以达到的.