作者: Zhi Qiang Xie, Jing Yang, Yu Jing He, Guang Jie Ye

摘要: Aiming at the dynamic integrated scheduling problem of complex multi-products with different arriving time and identical machines, an algorithm is presented by this paper that complex multi-products can be built a virtual manufacturing tree. And the tree will be divided into many subtrees according to the subsection idea. Then these subtrees will be divided into dependent operations and independent operations. Corresponding scheduling strategy is put forward according to the features of operations and the complementarities of identical machines. For dependent operations, forward greedy rule is mainly adopted. For the independent operations, this paper mainly adopts the optimum scheduling rule. Example shows that favorable results can be obtained according to scheduling strategy adopted by this paper.

897

作者: Rui Ping Chen, Zhong Xun Wang, Xin Qiao Yu

摘要: Decoding algorithms with strong practical value not only have good decoding performance, but also have the computation complexity as low as possible. For this purpose, the paper points out the modified min-sum decoding algorithm(M-MSA). On the condition of no increasing in the decoding complexity, it makes the error-correcting performance improved by adding the appropriate scaling factor based on the min-sum algorithm(MSA), and it is very suitable for hardware implementation. Simulation results show that this algorithm has good BER performance, low complexity and low hardware resource utilization, and it would be well applied in the future.

458

作者: Zong Hui Wang, Shu Su Shi, Li Cheng Yu, Wen Zhi Chen

摘要: FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of the key techniques of a traffic navigation system. Since classical Dijkstra algorithm and heuristic A* algorithm cannot support some constrained conditions in practice, and existing algorithms supporting constraints require the road network to be modified ahead and have low efficiency. The paper studies the model of road network, and analyzes two types of constraints, one-way street and intersection turning prohibitions, then proposes the constrained A* algorithm and gives the Heuristic function. Finally, the paper tests and analyzes the algorithm, and evaluation performance of the prototype system which employs it. The result shows that the algorithm’s efficiency is fairly good.

2880

作者: Gang Zhu Qiao, Jian Chao Zeng

摘要: The path loss exponent shows the effect of space environment on the RF signals in wireless communication model. In most RSSI based location method the path loss exponent is assigned a fixed empirical value which can not reflect the actual environmental impact of the wireless signal, which lead to low position accuracy and considerable positioning error. Aiming at some complex and rapidly changing environment a path loss exponent dynamic acquired algorithm is proposed, which can calculate the actual path loss exponent with the distance and the RSSI value information between adjacent beacon nodes. On basis of the path loss exponent dynamic acquired algorithm a path loss exponent dynamic acquired based localization algorithm is proposed which can estimate the blind node position with the actual path loss exponent, and can improve the adaptability to the environment of the RSSI location algorithm. The simulation shows that the positioning accuracy of proposed method is significantly improved and the effect of proposed method is more precise than the common RSSI method under the same environment.

4530

作者: Jiun Huei Ho, Hong Chi Shih, Bin Yih Liao, Jeng Shyang Pan

摘要: In this paper, a grade diffusion algorithm is proposed to solve the sensor node’s transmission problem and the sensor node’s loading problem in wireless sensor networks by to arrange the sensor node’s routing. In addition to them, the sensor node also can save some backup nodes to reduce the energy consumption for the re-looking routing by our proposed algorithm in case the sensor node’s routing is broken. In the simulation, the grade diffusion algorithm can save 28.66% energy and increase 76.39% lift time than the tradition algorithms for sensor node. Moreover, our proposed algorithm has the less data package transmission loss and the hop count than the tradition algorithms in our simulate setting. Hence, in addition to balance the sensor node’s loading and reduce the energy consumption, our algorithm can send the data package to destination node quickly and correctly.

2064