Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
In open environments, deciding if an individual is trustworthy, based on his past behavior, is fundamentally important. To accomplish this, centrality in a so-called feedback graph is often used as a trust measure. The nodes of this graph represent the individuals, and an edge represents feedback that evaluates a past interaction. In the open environments envisioned where individuals can specify for...
In order to solve the problem of generating and optimizing the assembly sequences of a complex assembly, the oriented-mating graph model of the assembly and the related mating matrix are created. Then an improved ant colony optimization is used to solve the ASP problem. In the algorithm, the local and global pheromones are updated to help the ant colony find the global optimizations more quickly....
In many areas of pattern recognition and machine learning, subspace selection is an essential step. Fisher's linear discriminant analysis (LDA) is one of the most well-known linear subspace selection methods. However, LDA suffers from the class separation problem. The projection to a subspace tends to merge close class pairs. A recent result, named maximizing the geometric mean of Kullback-Leibler...
The design of telecommunication network concerns the selection of arcs in a graph with involved cost as low as possible, but satisfies constraints such as point-to-point demands routed across the network, arc capacity, hop constraints and so on. Such a design must allocate enough flows and diverse routing paths through the network to ensure that feasible information flows continue to exist, even when...
Currently, community detection has led to a huge interest in data analysis on real-world networks. However, the high computationally demanding of most community detection algorithms limits their applications. In this paper, we propose a heuristic algorithm to extract the community structure in large networks based on local community attractive force optimization whose time complexity is near linear...
Recently, a growing number of researches have focused on the issues raised by the knowledge discovery of online information, particularly the problems of tracking topics, ideas, and users' spreading influence across the Web. In this paper, the search-engine query logs on Topic Detection and Tracking (TDT) is analyzed other than study of the quality of the search result or query recommendation. By...
In this paper we provide a framework of detection and localization of multiple similar shapes or object instances from an image based on shape matching. There are three challenges about the problem. The first is the basic shape matching problem about how to find the correspondence and transformation between two shapes; second how to match shapes under occlusion; and last how to recognize and locate...
Graph matching plays a central role in different problems for structural pattern recognition. Examples of applications include matching 3D CAD models, shape matching and medical imaging, to name but a few. In this paper, we present a new integer linear formulation for the problem and employ a combinatorial optimization technique, called “column generation”, in order to solve instances of the problem...
This paper proposes a hybrid feature selection algorithm based on dynamic weighted ant colony algorithm. Features are treated as graph nodes to construct graph model. Ant colony algorithm is used to select features while support vector machine classifier is applied to evaluate the performance of feature subsets, and then feature pheromone is computed and updated based on the evaluation results. At...
An efficient solution for a single-source problem called Thorup's algorithm has been proposed, whose computational complexity, O(N), is smaller than that of Dijkstra's algorithm, O(N log N). In this paper, we compare the performance of Dijkstra's algorithm and Thorup's algorithm for large-scale network simulation. Through extensive experiments, we show that Thorup's algorithm is slightly faster with...
The goal of a map coloring problem is to color a map so that regions sharing a common border have different colors, map-coloring problem is a classic NP-complete graph optimization problem, which has many real-world applications. From analyzing the characters of greedy algorithm, we proposed a new map coloring approach, which includes sorting the coloring regions based on the touch number among each...
In this paper, we present a means to fold amino acid interaction networks. This is a graph whose vertices are the proteins amino acids and whose edges are the interactions between them. Our approach consists in exploiting the parallel between topological and structural properties. Thus, we establish a relation between the sequence and the structure relying on topological criteria. To fold this type...
Service modeling and composition is a fundamental method for offering advanced functionality by combining a set of primitive services provided by the system. Unlike in the case of web services for which there is an abundance of reliable resources, in sensor networks, the resources are constrained and communication among nodes is error-prone and unreliable. Such a dynamic environment requires a continuous...
Based on the analysis that H.Agrawal's slicing algorithm produced imprecise result for Circular program, from which a conclusion was drawn that the reason for the imprecision was that the dependence relation of the relied graph was defined too coarsely. Upon which, dynamic program slice algorithm of optimizing dependence was proposed, the connection of the states in a program can be denoted by arrival...
The previous study of pattern discovery in storage systems focus on sequential pattern (SP) mining in lower level traces, but they don't scale well to the application level. For patterns in application level are mostly composed of Contiguous Item Sequential Patterns (CISP) which are much simpler than SP, so it's inefficient for the previous studies to mine CISP with clumsy SP mining algorithms. We...
Advanced planning and scheduling (APS) refers to a manufacturing management process by which raw materials and production capacity are optimally allocated to meet demand. How to formulate the complex problems of APS and find satisfactory solutions play an important role in manufacturing systems. In this paper, we propose a scheduling formulation method by combining the graph theory and combinatorial...
Recently, a lot of applications depend on data modeled by graphs. Efficient query processing over graph databases serves these applications. Having a graph query q, super-graph query processing finds all the graphs g in a database of graphs D where g is contained in q (gsubeq). Because graph databases contain a lot of graphs and because sub-graph isomorphic tests are NP-complete, an indexing-based...
In this paper, we study the link scheduling problem in wireless networks under M-hop interference model. In wireless networks, a scheduling algorithm is required to choose a subset of links at each time slot such that the packets do not corrupt due to interference. To deal with the interference in such a radio network different models have been introduced in the literature. In M-hop interference model...
Network optimization design in industrial network can be defined as a multi-constraint optimization problem. To solve this optimization problem, 0-1 programming strategy is proposed to model the problem. The model is then solved using NEOS server, a common optimization solver available over the Internet. The network designs obtained by 0-1 programming strategy are compared with those obtained by graph...
We investigate different formulations of the multi item, multi period capacitated lot sizing problem with inclusions of backorders, setup times and setup costs into it. The problem is closer to the realistic situations and is abbreviated as CLSP_BS in this work. Apart from the classical formulation, we give two variants of the transportation formulation of CLSP_BS. Objective values of these three...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.