The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
According to the premature convergence and low searching efficiency of the standard simulated annealing algorithm in workshop planning applications, this paper proposes a factory planning model of aircraft engine transmission parts based on improved genetic algorithm optimized simulated annealing. First, the mechanism floating-point coding is referenced to arithmetic crossover operation for crossover...
We research the cooperation optimization problem of assigning locomotives and scheduling trains in single-track railway system. To solve the considered problem, we develop a high-efficient cooperation optimization approach which includes a well-designed locomotive assignment algorithm. We conduct extensive case studies to demonstrate the effectiveness of the proposed cooperation optimization approach...
It is important for the management of seeds tracing which includes the collection and calculation of seeds sale. In the paper, firstly, we designed and implemented the seeds Hadoop-based trace data processing model, through the processing of the crawl data of seed, such as ETL process, parallel computing, distributed storage. Secondly, we studied the Consistent Hash Algorithm to optimize the database...
It is possible to calculate if there is a path or several paths between two vertices in a graph by the calculation of adjacency matrix, however, the paths themselves cannot be recorded by the calculation of adjacency matrix. This paper proposes an accurate method of calculation by showing the paths of matrices. The operations on path matrices to calculate and record path between two vertices can be...
The workers' number of a specific topology is fixed once it starts in Storm. This causes unnecessary waste of resources when workload shrinks down. In this paper, we propose an approach called DBalancer to dynamically increase or decrease the number of workers according to statistics of real-time data rate. DBalancer consists of three components: (1) Collector is used to collect data information about...
More and more companies are migrating applications to the cloud nowadays. It is important to develop a migration strategy to determine what applications should be migrated and in which order. In this paper, we research from the perspective of data exchange, define the cost of data exchange and build a comprehensive data exchange model, which takes the cost of data exchange and network delay into consideration...
Focusing on the issue that formula retrieval could not be realized with traditional full-text retrieval technology because of the spatial features of formulae, this paper proposed a formulae retrieval method with the full considerations of the hierarchical structures of formulae. The index was constructed according to the clusters of formulae with their baseline level structures. Based on the index,...
With the explosive growth number of services in cloud computing environment, how to accurately and rapidly discover the services that can meet user's functional and nonfunctional requirements is a challenging subject. Aiming at issues of service inefficiencies and low precision in the existing service discovery methods, a model for service discovery based on functions and QoS clustering is proposed...
In Data Structures, sorting is a technique which is used for arranging data in a particular order either ascending or descending. Sorting techniques like Bubble sort, Insertion sort and Selection sort are comparison based. Our proposed technique is a combination of both comparison and counting based techniques. We are finding the exact position of an element and placing it in its corresponding position...
Based on the analysis of the sparse problem and the cold start problem in the traditional collaborative filtering recommendation, a new collaborative filtering recommendation algorithm based on adaptive nearest neighbor selection is proposed. The algorithm considers the influence factors of user characteristics and item attributes, and then calculates the nearest neighbor sets of target users and...
An optimized algorithm according to a variety of population genetic-variable neighborhood search was proposed to solve the problem of flexible job shop scheduling. The new algorithm aims at minimizing the makespan, obtaining the smallest machine maximum load and the smallest total machine minimum loads. At the same time, the new algorithm improves the inherent defects of poor local search ability,...
Job shop scheduling problem, due to its discrete, dynamic, multi-machine, multi-variables, constraining and other typical NP-hard resistance natures, is bound to play an important role in NP studies. This paper proposes a new improved genetic algorithm, the isolation niche algorithm and adaptive genetic algorithm, for the sake of improving quality of solutions. Based on numerous examples and data...
In this paper, a T-LET planes measure is applied to manage the task scheduling for multiprocessors. First, a novel scheduling algorithm on T-LET planes is proposed, and it is based on the strategy that the biggest M tasks, within the current remaining execution time, are first selected. Secondly, the algorithm has proved as an optimal multiprocessor scheduling algorithm for assigning tasks and currently...
To improve the accuracy of prediction of sub-cellular location, a new method using kernel linear discriminant analysis with combinational kernel function which is made up of the Gauss kernel function and the polynomial kernel function is used to the predict the sub-cellular location. In order to confirm the reliability of the research, the data used in this paper are from the standard data set included...
Starting from influential factors of fixed traffic bottleneck and choosing appropriate identifying indices for fixed transportation bottleneck, we get MapReduce parallelized processing method of K-means clustering algorithm after full investigations on parallel programming pattern and clustering algorithm; Finally, the recognition approach for fixed traffic bottleneck is proposed based on K-clustering...
This article takes the multi-weapon formation coordination attack ground target as the background. We have established the mathematical model of the ground maneuvering target with the constraint space factor. We design an anytime algorithm for solving this kind of optimization problem based on the idea of distributed cooperative auction algorithm and give the method to optimize the auction algorithm...
A new solution for the construction of 3D Runway based on PSO algorithm and Unity 3D game engine is presented in this paper. Compared with the traditional runway construction, this solution can build rich scene interface with less scene resources by the application of PSO algorithm and the construction of Unity3D engine. Experiment has proved that the scheme can generate the scene reasonably which...
The problem of association rule mining is one of the most frequently studied and popular KDD tasks. Association rule mining is an important sub-branch of data mining. Based on the known current existence of association rule mining algorithms, this paper emphasizes the research work of deleting redundant association rules. It is a problem to mine quantitative association rules because the existing...
Nowadays, more and more people are getting engaged in the construction of the Internet, consciously or not, by posting their individual comments on it. In today's big data era, opinion mining on customer's opinions has become one of the most effective ways to roundly use the great amount of information. Opinion mining, a brand new section of unstructured information mining, is mainly related to emotional...
Model-based object clustering is a very challenging unsupervised learning problem in computer vision, which involves both high dimensionality and hidden variables inference issues. In this paper, we will study object pattern clustering problem by using the Active basis model, which is a sparse representation model for object patterns. We fit a mixture of active basis models, which leads to an object...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.