浅谈P3软件在电力基建工程中的应用

P3软件是一套体现了现代化项目管理理念的项目管理工具，在建设管理上推广应用P3工程管理软件，可以提高各参建单位的工作效率、加快工程信息交流、数据共享和工程进度管理水平，在管理上尽快与国际接轨，本文就P3软件在电力基建工程中的应用做以简单介绍。     

Discovering small-world in association link networks for association learning

Association Link Network (ALN) is a kind of Semantic Link Network built by mining the association relations among multimedia Web resources for effectively supporting Web intelligent application such as Web-based learning, and semantic search. This paper explores the Small-World properties of ALN to provide theoretical support for association learning (i.e., a simple idea of “learning from Web resources”). First, a filtering algorithm of ALN is proposed to generate the filtered status of ALN, aiming to observe the Small-World properties of ALN at given network size and filtering parameter. Comparison of the Small-World properties between ALN and random graph shows that ALN reveals prominent Small-World characteristic. Then, we investigate the evolution of Small-World properties over time at several incremental network sizes. The average path length of ALN scales with the network size, while clustering coefficient of ALN is independent of the network size. And we find that ALN has smaller average path length and higher clustering coefficient than WWW at the same network size and network average degree. After that, based on the Small-World characteristic of ALN, we present an Association Learning Model (ALM), which can efficiently provide association learning of Web resources in breadth or depth for learners.     

The min-dist location selection and facility replacement queries

We propose and study a new type of location optimization problem, the min-dist location selection problem: given a set of clients and a set of existing facilities, we select a location from a given set of potential locations for establishing a new facility, so that the average distance between a client and her nearest facility is minimized. The problem has a wide range of applications in urban development simulation, massively multiplayer online games, and decision support systems. We also investigate a variant of the problem, where we consider replacing (instead of adding) a facility while achieving the same optimization goal. We call this variant the min-dist facility replacement problem. We explore two common approaches to location optimization problems and present methods based on those approaches for solving the min-dist location selection problem. However, those methods either need to maintain an extra index or fall short in efficiency. To address their drawbacks, we propose a novel method (named MND), which has very close performance to the fastest method but does not need an extra index. We then utilize the key idea behind MND to approach the min-dist facility replacement problem, which results in two algorithms names MSND and RID. We provide a detailed comparative cost analysis and conduct extensive experiments on the various algorithms. The results show that MND and RID outperform their competitors by orders of magnitude.     

An interval programming approach for the bilevel linear programming problem under fuzzy random environments

In this paper, we address a class of bilevel linear programming problems with fuzzy random variable coefficients in objective functions. To deal with such problems, we apply an interval programming approach based on the $\alpha $ -level set to construct a pair of bilevel mathematical programming models called the best and worst optimal models. Through expectation optimization model, the best and worst optimal problems are transformed into the deterministic problems. By means of the Kth best algorithm, we obtain the best and worst optimal solutions as well as the corresponding range of the objective function values. In this way, more information can be provided to the decision makers under fuzzy random circumstances. Finally, experiments on two examples are carried out, and the comparisons with two existing approaches are made. The results indicate the proposed approaches can get not only the best optimal solution (ideal solution) but also the worst optimal solution, and is more reasonable than the existing approaches which can only get a single solution (ideal solution).     

The topological basis realization and the corresponding Heisenberg model of spin-1 chain

In this paper, it is shown that the Heisenberg model of spin-1 chain can be constructed from the Birman–Wenzl algebra generator while we have got that the Heisenberg model of spin- $\frac{1}{2}$ chain can be constructed from the Temperley–Lieb algebra generator in our previous work (Sun et al. in EPL 94:50001, 2011). Here, we investigate the topological space, we find that the number of topological basis states raise from the previous two to three, and they are also the three eigenstates of a closed four-qubit Heisenberg model of spin-1 chain. Specifically, all the topological basis states are also the spin single states and one of them is the energy single state of the system. It is worth noting that all conclusions we get in this paper are consistent with our previous work (Sun et al. in EPL 94:50001, 2011). These just indicate that the topological basis states have particular properties in the system.     

Three schemes of remote information concentration based on ancilla-free phase-covariant telecloning

In this paper, remote information concentration is investigated which is the reverse process of the $1\rightarrow 3$ optimal asymmetric economical phase-covariant telecloning (OAEPCT). The OAEPCT is different from the reverse process of optimal universal telecloning. It is shown that the quantum information via $1\rightarrow 3$ OAEPCT procedure can be remotely concentrated back to a single qubit with a certain probability via several quantum channels. In these schemes, we adopt Bell measurement to measure the joint systems and use projected measurement and positive operator-valued measure to recover the original quantum state. The results shows non-maximally entangled quantum resource can be applied to information concentration.     

一种关于目标罚参数的精确罚函数法

罚函数法是一种将约束优化问题转化为无约束问题的重要方法.对于一般的约束优化问题,通过加入新参数,给出了一种改进的精确罚函数和这种罚函数的精确罚定理证明,提出了求解这种罚函数的算法.实验表明该算法是有效的.     

淤浆鼓泡床中固体粒子的悬浮特性

研究了三相鼓泡床中的临界固含率,以空气作气相,水、乙醇-水、丙酮-水、萜松醇-二甲苯作液相,石英砂、煤、雷奈镍作为固相。分析了鼓泡柱的高径比、气体速度、固体粒子的大小和比重、液体的粘度对临界固含率的影响,提出了含有这些参数的无因次数群的关联式,讨论了本文提出的关联式和文献报导的差别。     

基于规则的汉语名名组合的自动释义研究

该文以现代汉语(特别是网络搜索词)中的名名组合为主要研究对象,探索一种基于规则的汉语名名组合的自动释义方法。其研究步骤为: (1)利用《现代汉语语义词典》中名词的语义类别,来建立名名组合的语义类组合模式;(2)在“生成词库论”中物性角色思想的指导下,用名名组合中某个名词的施成角色或功能角色作为释义动词,来揭示这两个名词之间的语义关系;(3)以语义类组合模式为单位构建名名组合的释义模板,并汇集成名名搭配数据库;(4)利用《知网》资源,来获取具体名词的施成角色和功能角色,建立汉语名词知识库。在这两个数据库的基础上,我们初步实现了一个汉语名名组合的自动释义程序。     

复合形退火的随机聚类算法

为了解决传统聚类算法易陷入局部最优解的问题,提出了一种复合形退火的随机聚类算法。该方法通过在聚类过程中设置退火准则,并且将退火过程中的生成复合形部分引入随机化的复合形节点,从而在加速收敛的过程中实现了较低的算法复杂度。理论分析及仿真实验证明,该方法的聚类效果好于传统的K-均值聚类方法,并且计算复杂度比目前基于人工智能的方法低。