An optimal approach for maximizing the number of adjacencies in multi floor layout problem

Multi-floor facility layout problem concerns the arrangement of departments on the different floors. In this paper, a new mathematical model is proposed for multi-floor layout with unequal department area. Maximising the number of useful adjacencies among departments is considered as the objective function. The adjacencies are divided into two major categories: horizontal and vertical adjacencies. The horizontal adjacency may be occurred between the departments assigned to same floors while the vertical can be happened between departments assigned to any consecutive floors. A minimum common boundary length (surface area) between any two horizontal (vertical) adjacent departments is specified. The efficiency of the model is demonstrated by six illustrative examples. The proposed model is practical in multi-floor plant where the existence of adjacencies between departments is useful or essential due to possible establishment of conveyor, transferring pipes, lift truck route, etc.     

Distant Melodies: Statistical Learning of Nonadjacent Dependencies in Tone Sequences.

Human listeners can keep track of statistical regularities among temporally adjacent elements in both speech and musical streams. However, for speech streams, when statistical regularities occur among nonadjacent elements, only certain types of patterns are acquired. Here, using musical tone sequences, the authors investigate nonadjacent learning. When the elements were all similar in pitch range and timbre, learners acquired moderate regularities among adjacent tones but did not acquire highly consistent regularities among nonadjacent tones. However, when elements differed in pitch range or timbre, learners acquired statistical regularities among the similar, but temporally nonadjacent, elements. Finally, with a moderate grouping cue, both adjacent and nonadjacent statistics were learned, indicating that statistical learning is governed not only by temporal adjacency but also by Gestalt principles of similarity. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

支持BPR的解释结构建模(ISM)探讨

运用业务流程图、IDEFO图、PERT模型法识别和改造流程，不能深刻揭示业务流程的内部结构特征和规律；复杂业务流程有向图易成为一个相互交叉、混乱的网络，不利于分析流程的特征。为弥补其不足，本文利用图论中的关联矩阵对业务流程进行结构化的建模，通过测试和运算提供业务流程重组的优化(去掉冗余环节)。     

平面运动链同构识别的距离和序列法

对平面机构运动链结构组成进行探讨后,研究了运动链中的结构不变量,并基于缩杆邻接矩阵提出了4个新的运动链结构恒量序列,这些恒量序列将杆的级别、运动副数目以及各杆的连接关系考虑在内。以此为基础,提出了对运动链进行同构识别的距离和序列法。该方法实质上是对运动链进行分类同构识别,因此具有操作简单、可靠性好、识别效率高等特点,已成功应用于12杆以下机构运动链型综合时的同构识别     

核稀疏保持投影及生物特征识别应用

稀疏表示系数包含较强的鉴别信息,稀疏保持投影(Sparsity Preserving Projections,SPP)利用稀疏表示系数进行特征提取.本文通过核方法获取高维特征空间的核稀疏表示系数,并利用核稀疏表示系数构造邻接矩阵,提出核稀疏保持投影(Kernel Sparsity Preserving Projections,KSPP).核稀疏表示系数比稀疏表示系数包含更强的鉴别信息,因此KSPP可以比SPP提取更有效的鉴别特征.在多个数据库上的生物特征识别实验,KSPP都取得了不错的实验结果.     

铸件毛坯模型生成方法研究

设计模型向制造模型的转换是实现CAD/CAPP/CAM集成的关键技术,而依据设计模型生成毛坯模型是其中关键环节,提出一种针对先铸造后机加零件的铸造毛坯模型生成方法。根据制造要求对模型表面进行分类;构造改进的扩展邻接属性图进行简单特征识别,依据铸造方法、铸件材质以及生产批量构造可铸造性判定算法,进行简单特征过滤;通过构造最小包络辅助面,并引入人工干预机加面分类机制,实现对包含非正交的表面加工边界面的零件模型的体加工特征包络,最终生成铸造毛坯模型。实例分析验证了算法的有效性与正确性。     

一种求解配电网多阶段规划的改进遗传膜算法*

对于中长期的配电网规划问题,为动态地考虑负荷在规划水平年内的变化情况和DG的大量接入,采用多阶段方法对含DG的配电网进行DG的选址定容和网架的扩展规划。结合电力系统全寿命周期管理理论,建立了以全寿命周期成本现值和最小为目标函数的配电网多阶段规划模型。针对上述模型求解的复杂性,提出了一种基于膜间交流重组、反余切-指数自适应交叉换位以及反正切-指数自适应变异改写等进化规则的改进遗传膜算法。采用有向图的邻接矩阵表示方法进行解对象编码,使得优化过程中无需解码,并提出一种通过操作节点入度来快速产生可行初始解和一次性修复所有不可行情况(即孤点、孤链和环)的方法。IEEE 54节点算例结果表明改进遗传膜算法具有收敛速度快、全局搜索能力强以及稳定性好等优点。     

电力通信设备检修影响业务分析的研究及应用

设备检修是电力通信的日常运维工作,设备检修对整个电力生产运营业务的影响是运维人员重点关注的问题.文章为了分析电力通信设备检修影响的业务,提出一种基于图和邻接矩阵的SDH线路保护分析方法.通过对电力通信保护机制的分析,介绍了检修影响业务分析的一般步骤,实现了电力通信检修影响业务分析系统,并得到应用.     

一种新的城市交通路径搜索算法

针对我国城市交通道路实际情况,提出一种新的基于邻接矩阵的交通路径搜索算法,算法利用邻接矩阵的特点及其相乘原理,在[n]阶[An]-矩阵中找出交通中的“途径线路”,结合道路上网络节点的相关权值,计算得出一条最佳交通路径。通过算法分析和仿真实验,结果表明,算法运行效率高,设计简单,实用性强。