Univariate marginal distribution algorithm dynamics for a class of parametric functions with unitation constraints

In this paper, we introduce a mathematical model for analyzing the dynamics of the univariate marginal distribution algorithm (UMDA) for a class of parametric functions with isolated global optima. We prove a number of results that are used to model the evolution of UMDA probability distributions for this class of functions. We show that a theoretical analysis can assess the effect of the function parameters on the convergence and rate of convergence of UMDA. We also introduce for the first time a long string limit analysis of UMDA. Finally, we relate the results to ongoing research on the application of the estimation of distribution algorithms for problems with unitation constraints.     

Application of fuzzy sets to manufacturing/distribution planning decisions in supply chains

In the real-world manufacturing/distribution planning decision (MDPD) integration problems in supply chains, the environmental coefficients and parameters are normally imprecise due to incomplete and/or unavailable information. This work presents a fuzzy linear programming approach based on the possibility theory. It applies this approach to solve multi-product and multi-time period MDPD problems with imprecise goals and forecast demand by considering the time value of money of related operating cost categories. The proposed approach attempts to minimize the total manufacturing and distribution costs by considering the levels of inventory, subcontracting and backordering, the available machine capacity and labor levels at each source, forecast demand and available warehouse space at each destination. This study utilizes an industrial case study to demonstrate the feasibility of applying the proposed approach to practical MDPD problems. The primary contribution of this paper is a fuzzy mathematical programming methodology for solving the MDPD integration problems in uncertain environments.     

Function point measurement from Web application source code based on screen transitions and database accesses

A function point (FP) is a unit of measurement that expresses the degree of functionality that an information system provides to a user. Many software organizations use FPs to estimate the effort required for software development. However, it is essential that the definition of 1 FP be based on the software development experience of the organization. In the present study, we propose a method by which to automatically extract data and transaction functions from Web applications under several conditions using static analysis. The proposed method is based on the International Function Point Users Group (IFPUG) method and has been developed as an FP measurement tool. We applied the proposed method to several Web applications and examined the difference between FP counts obtained by the tool and those obtained by a certified FP specialist (CFPS). The results reveal that the numbers of data and transaction functions extracted by the tool is approximately the same as the numbers of data and transaction functions extracted by the specialist.     

The thin plate spline robust point matching (TPS-RPM) algorithm: A revisit

This paper reviews the TPS-RPM algorithm (Chui and Rangarajan, 2003) for robustly registering two sets of points and demonstrates from a theoretical point of view its inherent limited performance when outliers are present in both point sets simultaneously. A double-sided outlier handling approach is proposed to overcome this limitation with a rigorous mathematical proof as the underlying theoretical support. This double-sided outlier handling approach is proved to be equivalent to the original formulation of the point matching problem. For a practical application, we also extend the TPS-RPM algorithms to non-rigid image registration by registering two sets of sparse features extracted from images. The intensity information of the extracted features are incorporated into feature matching in order to reduce the impact from outliers. Our experiments demonstrate the double-sided outlier handling approach and the efficiency of intensity information in assisting outlier detection.     

蒙特卡罗法及其在射弹散布仿真中的应用

作战仿真的真实性需要对抗双方火力射击效果的真实体现。文中提出了一种利用蒙特卡罗法进行射弹散布仿真的方法 ,并将结果与实际情况进行了比较。该方法已用于装甲兵数字化作战仿真实验室的作战仿真中     

基于PC104的某型测试设备的设计实现

该文介绍了一种基于PC104总线的某型测试设备的硬件设计和软件设计方案,提出了主要问题的解决方案。该系统结构紧凑,可靠性高,已在实际生产中得到应用。     

BP神经网络在剩余油分布预测中的应用研究

我国多数油田经过一次、二次采油后,仅能采出地下总储量的30%左右,这意味着有60%～70%的剩余石油仍然残留在地下成为剩余油。加强剩余油分布规律研究、提高石油采收率不仅有着可观的经济效应,而且关系到国家石油战略的安全。本研究应用神经网络的原理,基于BP网络使用MATLAB语言建立一个剩余油分布的预测系统。该系统通过学习在地理坐标和孔隙度之间建立一个非线性函数关系,以此来预测任何区域的孔隙度,再通过孔隙度与剩余油饱和度之间的关系达到剩余油分布预测的目的。     

Analyzing the structure of a class of linear automata over a ring $$ Z_{p^k } $$

Basic finite-automaton characteristics are established for the class of all linear automata and information-lossless automata over a ring. The complexities of solving problems of parametric identification and initial-state identification are analyzed. The sets of fixed points for mappings realized by initial automata are characterized. Canonical forms are proposed for linear automata over the ring. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 3, pp. 60–74, May–June 2008.     

Efficient multitasking in a dual-core CPU system

The paper offers an associative-neural-net method to optimize resource allocation between independent tasks in a multiprocessor system. In the case of a dual-core CPU the method allows the task to be fully solved in O(M) operations. The text was submitted by the authors in English.     

Distributed key management for dynamic groups in MANETs

Most existing solutions to group security in Mobile Ad Hoc Networks (MANETs) rely on a multicast Core Based Tree (CBT) for key distribution. Such solutions, although suitable for systems with low mobility and static characteristics, are unsuitable for dynamic and sparse groups with changing neighborhoods. In this paper, we propose an entirely decentralized key generation mechanism, employing a central trusted entity only during initialization. Using our approach, keys can be established between group members with absolutely no prior communication. The solution relies on threshold cryptography and introduces a novel concept of Node-Group-Key (NGK) mapping. We have provided an extensive analytical model for the computations involved and communication costs and have also provided a lie detection mechanism. Simulation results show appreciable performance improvement and enhanced robustness.