Applied Mechanics and Materials Vols. 543-547

Abstract: In order to reasonably organize production and to provide services, the use of computer simulation technology to research and analysis for a variety of discrete event system, the system can understand the dynamic operation rules to help people make decisions. This paper studies service completion event processing. First, research the queuing system based, according to the input process, queuing rules and service organizations, the establishment of a variety of models queuing system; then, research customer service time distribution, the mathematical model of exponential distribution and the use of a graphical representation of function curves; finally, research services completion event processing procedure through a flow chart describing the detailed design process, and the three main steps to achieve doing instructions. The research contents of this paper, to promote the application and development of computer simulation discipline is of great significance.

Abstract: Recommender systems have been proven to be valuable means for Web online users to cope with the information overload and have become one of the most powerful and popular tools in electronic commerce. We need a method to solve such as what items to buy, what music to listen, or what news to read. The diversification of user interests and untruthfulness of rating data are the important problems of recommendation. In this article, we propose to use two phase recommendation based on user interest and trust ratings that have been given by actors to items. In the paper, we deal with the uncertain user interests by clustering firstly. In the algorithm, we compute the between-class entropy of any two clusters and get the stable classes. Secondly, we construct trust based social networks, and work out the trust scoring, in the class. At last, we provide some evaluation of the algorithms and propose the more improve ideas in the future.

Abstract: In order to construct B-spline curves with local shape control parameters, a class of polynomial basis functions with two local shape parameters is presented. Properties of the proposed basis functions are analyzed and the corresponding piecewise polynomial curve is constructed with two local shape control parameters accordingly. In particular, the G¹ continuous and the shapes of other segments of the curve can remain unchangeably during the manipulation on the shape of each segment on the curve. Numerical examples illustrate that the constructed curve fit to the control polygon very well. Furthermore, its applications in curve design is discussed and an extend application on surface design is also presented. Modeling examples show that the new curve is very valuable for the design of curves and surfaces.

Abstract: Ant colony algorithm is a bionic algorithm which is used to optimize the shortest path in graph. But the traditional ant colony algorithm has some disadvantages, such as slow convergence speed, easy to fall into local optimum, high complexity and so on. In this paper, it focus on the problems of slow convergence speed and easily falling into local optimum and contribute the local pheromone updating strategy and global pheromone updating strategy, it also optimize the routing formula and local search method after analyzing the problems. It conducts some simulation experiments about our optimization scheme and the traditional ant colony algorithm in Matlab environment, by comparing the results of experiments, the optimization scheme proposed can get a better search path in different examples and the μ (t) function can effectively reduce iterations.

Abstract: Equalization technology is important in WBAN channels for resolving ISI problem. However, traditional algorithms, such as LMS and RBF are not suitable to be applied in WBAN channel, due to the fact that channels of WBAN are particularly time variable and have severe multipath effect. In this study, we proposed a novel hybrid algorithm by combining NFN and RBFN algorithms. Experimental results show better performance compared to both NFN and RBFN algorithms in prediction problem in WBAN Channels.

Abstract: This paper develops a discretization algorithm for non-uniform rational B-spline (NURBS) curves. The algorithm is used for CAM software which is developed for HNC-3000 five-axis woodworking NC milling machine. Functions from the CAM software divide the NURBS into dense segments with equal arc length by vertex set p1, p2pn. The algorithm simultaneously considers chord error δ and curvature of the NURBS curve to maximize the arc length of the segments to get vertex set p'1, p'2 pm'. The algorithm can be described as f (p1, p2pn, δ) = (p1', p2'pm'). The complexity of the algorithm is O (n).

Abstract: An expanded dynamic parameter model is introduced based on cellular automata. In this model friction is modeled quantitatively. The dynamic parameters including direction parameter and empty parameter are formulated to simplify tactically the process of making decisions for pedestrian evacuation. The pedestrian moving rule is modified by bringing in the conception of friction under high density, corresponding simulations of pedestrian evacuation is carried out. The improved model considers the impact of interactions among pedestrians on the evacuation process. Therefore, it is more accordance with actual circumstance than the original dynamic parameters model.

Abstract: This article introduces several interpolation algorithms, and analyze the characteristic and disadvantage of wavelet transformation and contourlet transformation. A Bi-cubic interpolation algorithm based on non-subsampled contourlet transformation is described. The experiments prove this algorithm can improve the quality of image reconstruction better than Bi-cubic interpolation, wavelet bi-cubic interpolation and contourlet interpolation.

Abstract: Vehicle Routing Problem with Time Windows (VRPTW) is a constrained NP-hard problem that designs the least cost routes from one depot to a set of geographically scattered points. Most of traditional techniques are difficult to solve this kind of problem. In this paper, we explored the validity of another swarm-intelligence-based model-Bacterial Foraging Optimization (BFO) for VRPTW solving. Original BFO, BFO with linear decreasing chemotaxis step (BFO-LDC) and BFO with non-linear decreasing chemotaxis step (BFO-NDC) are used to obtain the best solutions of a given VRPTW problem, respectively. The experimental results demonstrated that the proposed BFO algorithms have the potential to solve Vehicle Routing Problem with Time Windows (VRPTW) with rapid convergence rate and the good result accuracy.

Abstract: Bacterial foraging optimization is a relatively new bio-inspired swarm intelligence algorithm and has been successfully applied to solve many real-world problems. However, similar to other swarm intelligence algorithms, BFO also faces up to some challenging problems, such as low convergence speed and easily to be trapped into local minima. To deal with these issues, we incorporate the concept of neighbor topology and the idea of neighbor learning to improve the performance of BFO, called bacterial foraging optimization with neighborhood learning (BFO-NL). Simulation results demonstrated the good performance of our proposed BFO-NL when compared with original BFO.