Existence Theorem of Upper Bound Constant of Multiplier for ELSP and An Improved Algorithm

In this paper we prove existence theorem of upper bound constant of multiplier for ELSP and propose an easily programmable algorithm for solving the problem of determining lot size for n items to be produced on a single machine based on the existence theorem. We give some interesting examples to show the bound constant is useful. In some cases we can find optimal solution immediately with the bound constant and it is difficult to find a feasible solution without this bound constant.     

Segmentation of Color Image Based on Feature Divergence and Fuzzy Theory

In order to improve general adaptive capability of algorithm,the new color image segmentation algorithm based on feature divergence and fuzzy theory(FDCIS) is proposed.The algorithm introduces feature divergence and fuzzy dissimilarity function into calculation in order to measure the dissimilarity of feature vector,clusters data by means of feature divergence,and accomplishes the merge of image region.The experimental results demonstrate that the color image segmentation result of the proposed approach reduce calculation on large sample of color image,simply and effectively solve over-segmentation of color image,avoid the dependence of the algorithm on initial condition,and hold favorable consistency in terms of human perception.     

A time-varying signal processing method for Coriolis mass flowmeter

The mass flowrate of Coriolis mass flowmeter in practical application has slow changes with time. To solve the problem, an improved time-varying signal model whose frequency, amplitude and phase are time-varying based on the random walk model is established firstly. A new algorithm of adaptive notch filter with the capability of tracking frequency variation is applied to filter the sensor output signal of Coriolis mass flowmeter and its frequency is calculated next. An adaptive line enhancer based on the mentioned notch filter extracts fundamental frequency signal from noisy data. Then, by short window intercepting, the revised sliding DTFT recursive algorithm is introduced to calculate the real-time phase difference between two enhanced signals. With the frequency and phase difference obtained, the time interval between the two signals is calculated and then the mass flowrate is derived. The simulations and field test results show that the proposed method can not only track the change of frequency and phase, but also ensure the calculation accuracy when measuring small phase difference. The computational load of the algorithm is simple so that it can be applied to real-time signal processing for Coriolis mass flowmeter.     

K近邻的自适应谱聚类快速算法

利用时域递归展开算法对墙体内热湿耦合传递方程进行求解。以木板为例,应用该算法进行了热湿耦合传递的分析计算,在时间域和空间域上分别运用递归展开法和控制容积法进行离散,从而得到递归形式的线性方程组,运用MATLAB软件对这一过程进行求解。计算结果与有限差分算法、解析解计算结果以及实验数据吻合良好,表明该算法能够用于求解多孔介质热湿耦合传递模型。时间步长的改变对计算结果影响较小,可通过增加时间步长方法来减少工作量。     

Avoiding Obstacle Planning for Robots on Molecular Optimization Algorithm

Interest in DNA computing has increased overwhelmingly since Adleman successfully demonstrated its capability to solve Hamiltonian Path Problem. This article introduces the improving method in virtue of the biological thery of DNA technology, a new molecular algorithm is advanced. After a numerical simulation, the result shows that it avoids the prematurely and lower convergent speed of the classic genetic algorithm, and inherits global search capability, the validity and the speed of the genetic algorithm have been increased. The best result can be obtained in few iterative times. It is fit for solving path planning problem.     

Logistics Scheduling Modle of Region Distribution Center

In order to solve the scheduling problem of frequent distribution of a little goods in one batch between regions in logistics system, We use time slices to manage orders, thus disassembling, combining orders and optimizing the planning to cut the cost. A product-scheduling model in region distribution is presented based on the retailing chain system. A method is presented which spends little cost on logistics plans under constraint conditions (time constraint conditions and space constraint conditions) by using combination and optimizing based on the three layers framework of distribution center, region distribution center and retail shop. The simulation result shows that the model and algorithm is indeed effective to solve the supply problems in multicommodity or multi-shop.     

Repeated game theory intrusion detection model for the Internet of Things

The existing security methods cannot be applied to the Internet of Things due to the defects of communication nodes. To solve this problem, an intrusion detection model based on repeated game theory is presented. A repeated game model algorithm for detecting malicious nodes is built, and the algorithm of Quantal Response Equilibrium (QRE) is used for optimizing the model and making results reach the Nash equilibrium. Moreover, a common punishment strategy is introduced to improve the success of transfer data in this model. The results of the simulation represent that this model can restrain malicious nodes attacking effectively and improve the efficiency of network.     

Fuzzy Transportation Problem and Its Hybrid Intelligent Algorithm

The authors investigate a more practical transportation problem under fuzzy environment, that is , capacities of supplies and demands in the transportation problem are fuzzy variables. To obtain a directive decision, the authors construct a mathematical model for the fuzzy transportation problem based chance constrained programming and dependent chance programming in fuzzy environment. In addition, since there are many complex fuzzy variables in the mathematical model, the authors design the genetic algorithm to solve the model based on fuzzy simulation. Finally, they give a numerical example to show the efficiency of the algorithm.     

基于因子聚类分析的区域农产品物流能力评价——以河北省为例

本文应用因子分析和聚类分析法,结合统计数据,以河北省11市的统计数据为样本数据,通过SPSS16.0软件对电子商务环境下区域农产品物流能力进行实证研究,得出了各市的农产品物流能力得分排名,并依此进行了聚类分析,提出了河北省农产品物流中心规划建议。结果表明,在分析区域农产品物流能力过程中运用因子聚类分析法,所得结论客观、可信、较有说服力,为区域物流规划提供了重要参考和依据。该方法对其他区域物流规划也有较好的借鉴作用。     

A contour extraction algorithm for digital images based on water balloons snake model

Due to weak edges and low contrast areas in digital images, such as a left ventricle in Magnetic Resonance Imaging (MRI) images, a deformation curve may leak from the outer boundary when images are segmented using the traditional snake model. An improved algorithm based on the water balloons snake model is introduced to solve this problem. Firstly, the barycenter and the boundary shape area of the left ventricle in a digital MRI image are obtained through mathematical morphology. The left ventricular watershed line is obtained next using a watershed transform algorithm, which is taken as the initial deformation curve in a balloon snake model to capture the contour. Different snake models are tested to digitally tagged MRI images of left ventricles of small pigs. Contrast results indicate that the water balloons snake model can solve the leakage problem in traditional snake and balloon snake models. In addition, the processing speed is improved significantly.     

The predictive control of an incremental model based on tracking error

An algorithm of incremental model predictive control is proposed to solve a class of industrial production process real-time tracking problems. The basic idea is to establish a predictive model by adopting speed response on the basis of tracking error, and realize the optimization of the second time performance by using the soft constraint of the increment of control quantity and the online rolling optimization method. The theoretical analysis and Matlab simulation results show that the control algorithm can obtain good tracking performance, smooth dynamic response of the controlled object and strong robustness of the closed-loop system.     

基于行人动力学模型的人桥竖向动力相互作用

基于行人动力学模型,研究了人桥竖向动力相互作用。行人动力学模型采用以行人步频和体重表示的刚度质量阻尼（SMD）模型,人行桥假定为Euler-Bernoulli梁模型,建立人桥竖向动力相互作用控制方程。采用状态空间法进行非比例阻尼系统瞬时模态的求解,得到系统的时变频率和阻尼比;利用变步长四阶五级Runge-Kutta-Felhberg算法求解时变控制方程,对比分析考虑人桥竖向动力相互作用和只在人行荷载作用下人行桥的动力响应。结果表明：考虑人桥动力相互作用,人行桥自振频率略有降低,阻尼有显著增大;当行人以人行桥的频率行走时,考虑人桥竖向动力相互作用结构的动力响应比不考虑人桥相互作用显著降低。     

Numerical Study of FLow and Heat Transfer in Rectangular CHannel with Dimpled SUrface

This authors uses a physical model of the rectangular channel with dimpled surface to simulate the flow and heat transfer situation. On the basis of actual flow and heat transfer in the channel, it made the interrelated hypothesizes and built up the math model. They adopted the turbulent model, appliy the algorithm to resolve the pressure-velocity coupling and use the experimental data model to check up the feasibility of the model. By the study, the thesis shows the principle of the flow and heat transfer in narrow channel with a dimple surface and gets the factors and the conditions that affect the flow and heat transfer. The results show that the geometry structure and rank distributing of dimple affect the capability of heat transfer evidently. When Reynolds number is low, the capability of heat transfer becomes better as the number increases, and when Reynolds number is bigger than a critical point, there is a little influence.     

Job-Shop scheduling based on improved immune cloning algorithm

Parallel immune clone algorithm is proposed based on population coevolution theory and parallel computing affinity of individual at multiple compute nodes. Introducing the immune memory mechanism, the evolution processes of antibody population and memory units are conducted simultaneously, meanwhile, it improves mutual cooperation among antibodies, and ensures solution set approaching optimal solution from the inside of feasible region or infeasible region border. Clone proliferation, high frequency variation and operation of crossover operators increase the chance that better individuals gain affinity maturation by the operation of clone expansion, improve diversity of antibody population distribution, achieve the balance of optimization between depth and range, and ensure the convergence of the algorithm and the diversity of the search range. A computational study for a standard data set is carried out to test the validity of the algorithm, and the effect of algorithm parameters on the results is analyzed. The simulation results show that the global search capability, local search capability, algorithm stability and computing speed of the algorithm are all superior to conventional optimization algorithms such as normal immune clone optimization algorithm, genetic algorithm, etc.     

Distribution of trust model in P2P network based on equilibrium theory

There are a large number of malicious attack nodes and collusion groups in P2P(peer to peer) network, and the existing trust models improve the P2P network environment to some extent, but the emphasis of the models are different, which are unable to fully solve large-scale malicious attacks and deception. Therefore, a P2P trust model based on equilibrium theory is presented. The model consists of the construction of the trust structure, the malicious node detection and trust speculation. It constructs trust network according to the equilibrium theory, uses the equilibrium theory to define nodes balance factor, detects balance malicious nodes by calculating the impact of malicious behavior on the network, and adopts trust inference algorithm to estimate trust nodes to prevent distrust network nodes being added. Experimental results show that the model is reliable, and the algorithm is efficient and robust.     

基于混合蚁群算法的粮食物流中心选址优化

粮食物流中心是粮食物流系统的枢纽,粮食物流中心地址的确定是粮食物流系统分析的核心内容.根据粮食物流中心选址问题的特点和要求,在运输成本最低的基础上,构造了选址问题的数学模型,并且针对该模型引入一种混合蚁群算法,将遗传算法与蚂蚁聚类算法融合,采用遗传算法生成信息素分布,利用蚂蚁聚类算法求精确解.从而有效地避免算法的早熟现象,可防止其很快收敛到局部最优解,实例求解表明,该算法可以有效、快速地求得粮食物流中心选址问题的全局最优解.     

Markov Logic Networks with its application in De duplication

In order to solve the limitation that the traditional De duplications are mostly used for a specific field and only address one aspect of a problem,a scheme based on Markov Logic Networks (MLNs)is proposed, which is a new Statistical Relational Learning (SRL) model. With its advantage of computing the probability distribution of worlds to serve for the inference, the De duplication is formalized. Discriminative learning algorithm is adopted for Markov Logic Networks weights, MC SAT algorithm is adopted for inference. It shows how to capture the essential features of different aspects in De duplication with a small number of predicate rules and also combines these rules together to compose all kinds of model. The experiment results prove that the method based on Markov Logic Networks not only covers the original Fellegi Sunter model, but also achieves a better result than the traditional methods based on Clustering Algorithms and Similarity Measures in De duplication. It reveals that the Markov Logic Networks can play an important part in practical application.     

Sky luminance distribution model by ant colony systems

The sky luminance distribution model is developed by information analysis methods with ant colony system. A new arithmetic is given to solve complex optimization heuristic algorithm. The coefficient values of sky luminance distribution function are obtained by optimization analysis with ant colony system and on which a set of practical software is developed. It can provide an intuitive and easy calculation. The model has higher precision, which can provide valuable results on high precision and standard daylighting design.     

DHT的分层结构多出口选择问题研究

为了提高系统可靠性和查询效率,提出了具有多管理节点（出口节点）的DHT分层模型,并给出了3种查询算法：最短路径选择算法、基于热土豆模型的最小化组内流量算法和出口节点负载均衡选择算法。通过仿真实验对3种算法在查询效率、流量分析和负载均衡3个维度进行了分析比较,基于热土豆模型的最小化组内流量算法具有最高的查询效率,但是负载均衡性能最差,出口节点负载均衡选择算法具有最好的负载平衡性,但查询效率最低,最短路径算法性能则介于上述两种算法之间。同时对传统分层结构所采用的随机查询算法与基于热土豆模型的最小化组内流量和最短路径查询算法进行了性能对比。     

A borrowed address based on efficient distributed address assignment algorithm in ZigBee networks

The borrowed address algorithm can solve the orphan problem made by the restriction of threshold of children when DAAM(distributed address assignment mechanism) assigns the addresses for the nodes in ZigBee networks. The exited borrowed algorithms only can increase the success ratio of address assignment, but their overhead and times spend on founding net cost much. To address the problem, we propose an efficient borrowed address assignment algorithm EDAA BA (efficient distributed address assignment algorithm based on borrowed address). To control the overhead and time spend on founding net, it borrows addresses firstly from the descent nodes in same branch for the orphan router nodes, adds the mechanism of immediate reply of borrowed message, and assigns the remainder addresses unused by DAAM in the 16 bits addresses for the orphan end devices. Theoretical and simulation analyses show that our algorithm outperforms DAAM and two of its present improvement algorithms in terms of the overhead and time spent on forming network, under the premise of better success rate of address assignment.