Applied Mechanics and Materials
Vol. 526
Vol. 526
Applied Mechanics and Materials
Vol. 525
Vol. 525
Applied Mechanics and Materials
Vols. 522-524
Vols. 522-524
Applied Mechanics and Materials
Vol. 521
Vol. 521
Applied Mechanics and Materials
Vols. 519-520
Vols. 519-520
Applied Mechanics and Materials
Vol. 518
Vol. 518
Applied Mechanics and Materials
Vols. 513-517
Vols. 513-517
Applied Mechanics and Materials
Vols. 511-512
Vols. 511-512
Applied Mechanics and Materials
Vol. 510
Vol. 510
Applied Mechanics and Materials
Vol. 509
Vol. 509
Applied Mechanics and Materials
Vol. 508
Vol. 508
Applied Mechanics and Materials
Vol. 507
Vol. 507
Applied Mechanics and Materials
Vols. 505-506
Vols. 505-506
Applied Mechanics and Materials Vols. 513-517
Paper Title Page
Abstract: An algorithm based on fuzzy ART neural network which can deal with online-learning and recognition of the known and unknown faces at the same time was designed and realized. Based on structure and learning rule of the fuzzy ART system, face recognition algorithm was designed. The simulation experiment results show that average recognition rate of not fast learning is better than fast learning. Not fast learning is accepted to get 89.83% online and 99.42% offline recognition rate.
1783
Abstract: Ant colony algorithm as an intelligent bionic optimization algorithm, Because of its use of positive feedback mechanism, the result will be prone to premature, stagnation and slow speed of solving the problem etc. For this shortcoming is proposed based on chaos theory adaptive dynamic parameters ant colony algorithm (PDSACA Dynamic Parameters Self-adaptive Ant Colony Algorithm).In the process of the dynamic algorithm solving, introducing chaotic disturbance technique, the parameters of the algorithm design of dynamic changes to affect the algorithm quality and global parameters are adjusted adaptively to improve the global search capability. By using the TSPLABs reference example to test the algorithm. Experimental results show that the convergence of the algorithm, robustness and efficiency have been improved to Compare with the basic ant colony algorithm.
1787
Abstract: Software test is a reliable technological means of guaranteeing software quality. General testing methods divide testing input values into a number of sectors according to certain rules, and then they choose a figure from each sector as testing data. However, if inappropriately divided, the probability of at least one error is lower than that of random testing which uses the equivalent number of cases. In light of the problem, the article puts forward a measurement method of describing ideal testing division via testing interdependency. By means of reasonable testing division, the testing effect on software models can get improved.
1793
Abstract: To reduce the congestion of trunk network caused by P2P transmission, a P2P transmission optimizing scheme is introduced in metropolitan area network (MAN) in this paper. In this scheme distance vectors such as Huffman Code are used to represent topology relations of nodes in MAN, and distance vectors of nodes which store nodes in topology server are built. According to the distance vectors, physical distances of each node are calculated, and most transmission flow is controlled on the edge of MAN, thus transmission optimizing is realized.
1797
Abstract: This paper makes a brief introduction on the current development trend of software radio and digital down converter status. The basic theoretical knowledge: Band-pass sampling theorem, digital signal orthogonal transformation theory, multi-rate signal processing theory. Based on these theories, use MATLAB complete the design and verification of mixing module, the extraction module (CIC filter, half-band filter and FIR filters), finally verify the correctness of the design, and implement DDC.
1803
Abstract: Network utility maximization model with random link failures was presented in this paper. We provide a distributed algorithm based on the dual decomposition and investigate the impacts of link failures on the network utility. Numerical results validated the convergence of the proposed algorithm and our conclusions.
1807
Abstract: A lack of centralized administrator has made communications in mobile ad hoc networks relied on cooperation of mobile nodes. Apparently, their limited energy cannot provide a sustained supply for consumption on operations, such as relaying, forwarding, etc. This may cause the self-ish behaviors of non-cooperative nodes, resulting in degradation on the stability or reliability of routing. The self-ishness worsens because of node mobility. Most existing works were considering external profits and inner motivations. In this paper, we analyzed three kinds of incentive mechanisms based on virtual currency, reputation and game theory, respectively. We compared application scenarios and performance of these mechanisms, and discussed their limitations. Finally we proposed possible directions for the future research on the incentive mechanisms in mobile ad hoc networks.
1811
Abstract: This paper presents an ant colony algorithm and BP algorithm together to complete the learning algorithm for neural networks ACO-BP algorithm. The algorithm adopts the ant colony algorithm for global optimization of the network weights, overcome the disadvantage of BP algorithm that is easy to fall into local optimum; then, the optimal weights found by BP algorithm as the initial value, further optimization. Finally, the simulation experiments show that, if the network structure is determined by the condition, this algorithm not only speeds up the convergence speed of the improved ant colony algorithm of optimal solution, but also can avoid falling into local optimal path. It will increase the reliability.
1819
Abstract: Typical shortest path is Dijkstra algorithm, its time complexity is O (n2). A map of the citys road network has many nodes, if we use the Dijkstra algorithm, the time complexity of the algorithm is too high and the speed of resolution this problem is slow. In order to change this situation, we are discussed from the aspects of algorithm design, puts forward the improved bidirectional search algorithm. Practice has proved that, the improved algorithm can improve the search speed and it suitable for intelligent transportation system.
1822
Abstract: Logging is widely used in storing systems internal state, and also the interaction or operations between systems. With the logging, we can assess the systems running status and the operation procedures of personnel. In this paper, we proposed a storage solution called tape-type instead of the original one in a ship. In order to improve the usability and scalability of the solution, we take Object-Oriented Method to replace the original Structured Method. According to the actual test, the new solution has 50% improvement compared to the original one in storage efficiency, so it can better meet the real-time demand of VxWorks.
1826