Network partitioning using harmony search and equivalencing for distributed computing

Power system has a highly interconnected network that requires intense computational effort and resources for centralized control. Distributed computing needs the systems to be partitioned optimally into clusters. The network partitioning is an optimization problem whose objective is to minimize the number of nodes in a cluster and the tie lines between the clusters. Harmony Search(HS) Algorithm is one of the recently developed meta heuristic algorithms that can be applied to optimization problems. In this work, the HS algorithm is applied to the network partitioning problem and power flow based equivalencing is done to represent the external system. Simulation is done on IEEE Standard Test Systems. The algorithm is found to be very effective in partitioning the system hierarchically and the equivalencing method gives accurate results in comparison to the centralized control.     

Invariants for the computation of intransitive and transitive Galois groups

One hard step in the computation of Galois groups by Stauduhar’s method is the construction of relative invariants. In this note, a representation-theoretic approach is given for the construction in the case of an intransitive group.In the second part of the article, it is shown that the construction can be used for groups that have a suitable intransitive subgroup. The construction solves an open question of Fieker and Klüners.     

Solving multiple processor and multiple resource constrained scheduling problems using a genetic algorithm approach

We consider the multiprocessor scheduling of unit time tasks with precedence constraints and finite set of limited resources. Each task demands some amount of resources for its execution and the total demand for each kind of resources must not exceed a certain limit at any instant of time. Our objective is to find out the minimum time schedule which satisfies the partial orders and the resource usage constraints. We have applied Genetic Algorithm for the present problem. We have shown that the Genetic Algorithm is quite superior to the First Fit Decreasing method.     

Development of 2D computer program to determine geometry of rock mass blocks简

Due to various geological processes such as tectonic activities fractures might be created in rock mass body which causes creation of blocks with different shapes and sizes in the rock body. Exact understanding of these blocks geometry is an essential issue concerned in different domains of rock engineering such as support system of underground spaces built in jointed rock masses, design of blasting pattern, optimization of fragmentation, determination of cube blocks in quarry mines, blocks stability, etc. The aim of this paper is to develop a computer program to determine geometry of rock mass blocks in two dimensional spaces. In this article, the geometry of jointed rock mass is programmed in MATLAB™.     

逆演绎学习算法在智能通信网中的应用

在智能通信网的学习过程中,针对传统归纳演绎学习的困难,提出一种逆演绎的学习算法。从学习任务和逻辑程序角度出发,研究逆演绎学习算法的规则、霍恩状态函子和激励信息等问题,并利用逆演绎的学习算法实现了智能通信网的学习推理系统。测试结果表明,该算法能高效地归纳出逻辑程序。     

一种新的基于统计的航迹关联算法

多源航迹融合一直是信息融合领域的研究热点。在对最近邻数据关联算法的研究基础上,提出一种新的"筒状"最近邻数据关联算法,对该算法进行仿真分析,与最近邻数据关联算法相比,新算法在密集环境下关联性能明显更优,易于工程实现。     

决策树分类算法在个性化图书推荐中的应用

采用数据挖掘中的决策树方法,对图书馆的图书借阅数据进行研究和分析,提出了基于读者阅读兴趣的个性化图书推荐模型。实验表明,该模型能够为新老读者有针对性地推荐新书,较好地实现了图书馆的个性化的创新服务。     

WiMAX下LDPC编译码器仿真实现的研究

WiMAX下的编码方式是当今通讯技术研究的热门。介绍一种最受关注的纠错编码:低密度奇偶校验码(Low Density Parity Check,LDPC),讨论LDPC码在WiMAX条件下的基本原理和编译码设计;提出运用Visual C++特点构建LDPC码仿真平台,研究仿真设计过程;分析不同实现方法下对LDPC码性能的影响,通过对仿真结果的分析和思考,说明了Visual C++语言应用于LDPC编译码仿真的可行性、实用性和扩展性。