Thermodynamics-inspired inverse halftoning viamultiple halftone images

Based on an analogy between thermodynamics and Bayesian inference,inverse halftoning was formulated using multiple halftone images based on Bayesian inference using the maximizer of the posterior marginal(MPM) estimate.Applying Monte Carlo simulation to a set of snapshots of the Q-Ising model,it was demonstrated that optimal performance is achieved around the Bayes-optimal condition within statistical uncertainty and that the performance of the Bayes-optimal solution is superior to that of the maximum-a-posteriori(MAP) estimation which is a deterministic limit of the MPM estimate.These properties were qualitatively confirmed by the mean-field theory using an infinite-range model established in statistical mechanics.Additionally,a practical and useful method was constructed using the statistical mechanical iterative method via the Bethe approximation.Numerical simulations for a 256-grayscale standard image show that Bethe approximation works as good as the MPM estimation if the parameters are set appropriately.     

制丝线加香加料系统的问题及改进方法

针对目前卷烟企业制丝线加香、加料系统普遍存在的问题,从设备选型、控制算法进行分析,提出改进方法。     

绥高#2线线路保护2动作分析

对高岭站2009年6月15日绥高#2线线路保护动作的原因进行深入分析,介绍处理措施。     

计算机网络信息管理及其安全防护策略

文章以计算机网络信息管理工作为研究对象,从计算机网络信息管理内容的分类、计算机网络信息管理工作中的安全问题分析以及计算机网络信息安全防护策略分析这三个方面入手,对其进行了较为详细的分析与阐述,并据此论证了做好这一工作在进一步提升计算机网络信息管理质量与管理效率的过程中所起到的至关重要的作用与意义。     

带平衡约束矩形布局优化问题的深度强化学习算法

带平衡约束的矩形布局问题源于卫星舱设备布局设计,属于组合优化问题。深度强化学习利用奖赏机制,通过数据训练实现高性能决策优化。针对布局优化问题,提出一种基于深度强化学习的新算法DAR及其扩展算法IDAR。DAR用指针网络输出定位顺序,再利用定位机制给出布局结果,算法的时间复杂度是O（n³）;IDAR算法在DAR的基础上引入迭代机制,算法时间复杂度是O（n⁴）,但能给出更好的结果。测试表明DAR算法具有较好的学习能力,用小型布局问题进行求解训练所获得的模型,能有效应用在大型问题上。在两个大规模典型算例的对照实验中,提出算法分别超出和接近目前最优解,具有时间和质量上的优势。     

电力工程中的地质灾害危险性评估

我国幅员辽阔,地质环境条件多样且复杂,导致了地质灾害发育强烈,种类繁多、危害较大。地质灾害与工程建设活动密切相关,既相互作用,相互依存,又相互影响[1]。电力工程项目遍布全国,特别是输电线路大多为人烟稀少的山区分布,线路长,跨越的地质地貌区域复杂,存在的地质灾害多种多样,或多或少面临着各种地质灾害的严重威胁[2]。通过电力工程地质灾害危险性评估工作的现状及评估工作流程的介绍,进一步分析电力工程地质灾害的危险性评估工作中存在的问题并提出了相应的看法。     

An implicit enthalpy scheme for one-phase Stefan problems

A compact finite-difference scheme to solve one-phase Stefan problems in one dimension is described. Numerical experiments indicate that the moving interface is obtained withO(t) accuracy when 3–4 iterations per time step are used to solve the nonlinear implicit scheme. The scheme can be adapted to ADI methods in higher dimensions.     

结构化对等网络特性及关键技术分析

本文简述了对等网络的概念及分类,分析了结构化对等网络特性、存在问题和关键技术,指出结构化对等网络的发展前景。     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

Nodal ant colony optimization for solving profit based unit commitment problem for GENCOs

This paper proposes a nodal ant colony optimization (NACO) technique to solve profit based unit commitment problem (PBUCP). Generation companies (GENCOs) in a competitive restructured power market, schedule their generators with an objective to maximize their own profit without any regard for system social benefit. Power and reserve prices become important factors in decision process. Ant colony optimization that mimics the behavior of ants foraging activities is suitably implemented to search the UCP search space. Here a search space consisting of optimal combination of binary nodes for unit ON/OFF status is represented for the movement of the ants to maintain good exploration and exploitation search capabilities. The proposed model help GENCOs to make decisions on the quantity of power and reserve that must be put up for sale in the markets and also to schedule generators in order to receive the maximum profit. The effectiveness of the proposed technique for PBUCP is validated on 10 and 36 generating unit systems available in the literature. NACO yields an increase of profit, greater than 1.5%, in comparison with the basic ACO, Muller method and hybrid LR-GA.