Applied Mechanics and Materials Vols. 556-562

Abstract: Fundamental to the IMP, is the requirement to provide a harmonized data model and represent it appropriately, including geometric tolerances information that can be understood well by computers and users. In this paper, we propose a layered conformance level geometric tolerances representation model. This model uses the widely applied ASME Y14.5M-1994 as its foundation layer by abstracting most information from this standard. Thus, different application domains in an enterprise can use this data model to exchange product information. This model is further transformed with XML Schema that can be used to generate XML instance file to satisfy geometric tolerances representation requirements in IMP. Fig.1 A typical feature control frame and its possible symbols. Fig.2. Example part.

Abstract: Quantum-behaved particle swarm optimization (QPSO) has shown excellent performance in solving optimization problems which inspired by analysis from particle swarm optimization (PSO) and quantum mechanics. In QPSO, the only parameter contraction-expansion coefficient β is vital to the performance of algorithm. This paper employs Q-Learning strategy and presents a novel parameter control method to improve QPSO performance. Then the empirical studies on a suite of well-known benchmark functions are to be performed to test performance. Finally, a further performance comparison between the proposed algorithm and other parameter control methods of QPSO are listed and the simulation results show the efficiency of the proposed QPSO with novel adaptive strategies.

Abstract: As plug-in hybrid electric vehicles and battery electric vehicle ownership is expanding, there is a growing need for widely distributed publicly accessible charging stations. Building a charging station cost too much. Therefore, optimal location of charging stations has to be dealt with. The main purpose of this paper is to investigate the optimal location of charging stations using fuzzy C-means clustering method. Preliminary of fuzzy C-means clustering method is introduced first followed by the procedure of charging station optimal location using Fuzzy C-means Clustering. Finally, simulation results show the validity of proposed method.

Abstract: Software testing is important to ensure the quality and reliability of the software.The improvement on the automation of test case generation is the entire key to improve the automation of the testing process.It helps a lot in the generation of test cases to construct multi-path model.It is based on genetic algorithm with three parts which are the test environment construction, the genetic algorithms and the operating environment.It’s feasibility and efficiency is verified by triangle classification procedures.

Abstract: The paper proposes a large-scale route search method based on bidirectional ant-colony microcanonical annealing algorithm, which adopts double search. The underlying idea is to verify the proposed path search method under the real road network of Changchun city. The paper uses matlab to encode algorithm and adopts Mapinfo software mapping network for contrastive analyzing the proposed path search method and classical algorithm. The results demonstrate that the proposed method is larger advantage in running time and the global optimal solution, which has a good practicability.

Abstract: . Particle swarm optimization algorithm has the defects of easy to fall into local optimum and low convergence accuracy used in reactive power optimization. To solve the problems, this paper proposed an improved particle swarm optimization algorithm based on dynamic learning factors. The two accelerations are changed with searching stage, so as to enhance the early globle search ability and the late local search ability, then to avoid local optimum; minimum particle angle method and crowded distance method are uesd to determine the global extremum in instalments, so as to improve the convergence speed and accuracy of multi-objective pareto solutions. Take the IEEE 30 bus system IEEE 118 bus system as example, the proposed method is compared with adaptive chaos particle swarm optimization (ACPSO) and NSGA-II, simulation results show that the method put forward in this paper has better convergence accuracy.

Abstract: . To meet the needs of voice, video and other large multimedia data transmission services, a new multi-path routing protocol, which is named MP-QAODV, with QoS guarantees for MANET was proposed. The Routing method based on disjoint nodes and backup multiple paths was used in the protocol. Through introducing two weights constraints based on single-source and single-path network model, a non-deterministic optimal constraints algorithm was proposed. After introducing and instantiating the path stability factor and the path length factor, mathematical model of their relationship was built. The mathematical model was used to improve AODV protocol and the improved protocol has QoS guarantee. Simulation results showed that MP-QAODV is better than AODV, AOMDV in the aspects such as average end to end delay, packet delivery ratio and route control overhead. The experiment demonstrated the effectiveness of MP-QAODV protocol.

Abstract: Mobile devices equipped with multiple network interfaces can increase their throughput by making use of parallel transmissions over multiple paths and bandwidth aggregation, enabled by the multipath Transport Control Protocol (MPTCP). However, the existing MPTCP congestion control algorithm adopt a relatively strict definition of the fairness, although to some extent could ensure the fairness of traditional TCP connections, but the total throughput of MPTCP will be limited, which can not make full use of network resources. To solve this problem, this paper propose a congestion control algorithm (FBCC) based on the fairness of bottleneck. The core idea of FBCC is to set up individual fairness factor for each shared bottleneck. NS3 simulation results show that FBCC algorithm not only solves the problem of fairness, but also effectively improve the total throughput of MPTCP connection.

Abstract: In ad-hoc networks, MSWCA is a typical algorithm in clustering algorithms with consideration on motion-correlativity. Aiming at MSWCA’s problem that “it only considers on intra-cluster stability, and neglects the inter-cluster stability”, a new clustering algorithm (NCA) was proposed. Firstly, NCA clustering algorithm and its cluster maintenance scheme were designed. Secondly, the theoretical quantitative analyses on average variation frequency of clusters and clustering overheads were conducted. The results show that NCA can improve cluster stability and reduce clustering overheads.

Abstract: With the development of the market economy, the logistics industry has been developed rapidly.It is easy to understand that good vehicle travel path planning has very important significance in the logistics company,especially in the general production enterprises. This paper mainly studies the microcosmic traffic system in the type of vehicle routing problems: capacity-constrained vehicle routing problem. We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem, treated as nodes in a spatial network. For the networks where the nodes are concentrated, the use of hybrid heuristic optimization can greatly improve the efficiency of the solution. The algorithm produces high-quality solutions for the capacity-constrained vehicle routing problem.