Applied Mechanics and Materials Vols. 182-183

Abstract: In this paper, the coding for multicast packet network call, the network utility maximiza- tion problem, when multicast call, given coding subgraph case modeling, Coded packet networks set up to maximize the effectiveness of modeling .Then use the duality theory, the distributed gradient projection algorithm that can solve the problem of modeling the network utility maximization

Abstract: As bus passengers often spend substantial amounts of time waiting for buses, many hope for access to real-time transit information to fulfill passenger demands for routes, station location, transit duration, and bus frequency information. This study develops a “Smart Bus Dynamic Transit System” using cellular phones to combine internet, XML documents, GPS positioning and transit path planning models to allow the inquiry of real-time bus and station locations. Users will be able to rapidly obtain knowledge of optimal transit locations and times, as well as estimated arrival times as reflected on Google Map; thus reducing passenger transit time and improving public transportation system efficiency.

Abstract: This paper proposes a specialized genetic algorithm (GA) based on an expended relational representation named weight-based encoding for solving one-dimensional bin packing problem (BPP-1). The encoding provides a totally constraint-handling scheme to address general and specific constraints, while naturally eliminates redundancy and infeasibility of previous representations for BPP-1. The current study performs experiments for solving some problem instances from a benchmark data set by our specific coded genetic algorithm with one-point, two-point and grouping crossovers. Experimental results show that the proposed methodology works well for solving BPP-1 and performs well on experimented benchmark instances. In addition, the results also show that two-point and grouping crossovers work better than one-point crossover in our experiments.

Abstract: This paper discusses the application of random network coding safety problems , when transfering files, and Puts forward an algorithm that targets eavesdropping adversaries By means of this algorithm,an eavesdropper is unable to get any meaningful information about the source,which we call weak security.We show that if we give up a small amount of over all capacity, then a random code achieves the weak security condition at a much higher probability. Besides, when there is a secret channel or apublic encryption scheme between the source and destination,an algorithm that not only achieves the max-flow but also the weak security condition is proposed.The probability of the coding scheme to be security is 1,when random codingscheme is used.

Abstract: Word sense disambiguation (WSD) is a critical and difficult issue in natural language processing(NLP), as well as WSD is great significance in large area of research areas of NLP. This paper presents a method of multi-word sense disambiguation strategy. The method combines the method based on match word corpus and the method based on the similarity and relevance very well. While the calculation of similarity and relevance are make full use of the sememe-tree information from HowNet. The experiments show that the proposed WSD method can obtain better results.

Abstract: Considering the mosaic result of the lunar DOM (Digital Orthophoto Map) produced by China's “CE-1” satellite, there usually exists a sharp gray jump beside the joining line. As to a strip image, the gray distribution may be uneven because of the light changing or position difference during photographing. To solve these matters, a method was proposed which is based on dynamic rules to detect the best joining line, and then stretch image according to its gray histogram. By making the pixels around boundary to change gradually, the joining line will finally be invisible. In order to solve the uneven gray distribution problems causing by imaging angle, light condition and other factors, a homogenization technology based on statistics of gray distribution was proposed. Using statistical information of the bands’ longitudinal changes to united the gray level to a defaulted range. The experimental results show that the method of this paper can make the integral gray level become even, the transition become more gently, and visual effect become more natural.

Abstract: A hybrid algorithm for solving the vehicle routing problem is proposed based upon the combination of Ant Colony Optimization and quantum computing. The algorithm takes the advantage of the principles in quantum computing, such as the qubit, quantum gate, and the quantum superposition of states. It can search the best solution by quantum walk and can further improve the search capability of the algorithm for the best solution. Numerical examples are tested and verified, that show the good performances.

Abstract: Database provides users with various applications via materialized views. The trouble of the update of materialized views is that there are many changing data sources, and in turn, it is difficult to maintain the consistency of materialized views and data sources. This method, a algorithm to change the execution order of things to be updated in materialized views appropriately, is based on maintaining the consistency of materialized views and data sources in distributed environment using the time stamp method, which reduce the maintenance costs of materialized views theoretically.

Abstract: MapReduce is a kind of model of program that is use in the parallel computing about large scale data muster in the Cloud Computing[1] , it mainly consist of map and reduce . MapReduce is tremendously convenient for the programmer who can’t familiar with the parallel program .These people use the MapReduce to run their program on the distribute system. This paper mainly research the model and process and theory of MapReduce .

Abstract: In this paper, an in-depth research has been done on the physical meaning and value features of the QoS attribute values under the definition of the functional attributes and non-functional attributes of Web services, giving the computation formulae and matching method expressing QoS composition as interval numbers, providing a more comprehensive and objective information matrix for fuzzy multi-attribute decision making. For multi-attributes fuzzy decision-making matrix with weight information known and the preference information of composition solution given in the form of interval numbers, calculating the overall attribute values, and sorting solutions by using the formula of probability degree, a QoS-driven multi-level composition Web Service selection algorithm is proposed, and simulation runs indicate the feasibility and effectiveness of the algorithm.