Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "Graph" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-11 z 11
    Tytuł:
    Evolutionary approach to obtain graph covering by densely connected subgraphs
    Autorzy:
    Stańczak, J.
    Potrzebowski, H.
    Sęp, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/206170.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    graph
    clique
    graph clustering
    evolutionary algorithms
    Opis:
    This article describes two evolutionary methods for dividing a graph into densely connected structures. The first method deals with the clustering problem, where the element order plays an important role. This formulation is very useful for a wide range of Decision Support System (DSS) applications. The proposed clustering method consists of two stages. The first is the stage of data matrix reorganization, using a specialized evolutionary algorithm. The second stage is the final clustering step and is performed using a simple clustering method (SCM). The second described method deals with a completely new partitioning algorithm, based on the subgraph structure we call α-clique. The α-clique is a generalization of the clique concept with the introduction of parameter α, which imposes for all vertices of the subgraph the minimal percentage (α*100%) of vertices of this subgraph that must be connected with vertices of this α-clique. Traditional clique is an instance of α-clique with α = 1. Application of this parameter makes it possible to control the degree (or strength) of connections among vertices (nodes) of this subgraph structure. The evolutionary approach is proposed as a method that enables finding separate α-cliques that cover the set of graph vertices.
    Źródło:
    Control and Cybernetics; 2011, 40, 3; 849-875
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Solving Markov decision processes by d-graph algorithms
    Autorzy:
    Kátai, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/205688.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    Markov decision processes
    dynamic programming
    graph representation
    graph algorithms
    optimization problems
    Opis:
    Markov decision processes (MDPs) provide a mathematical model for sequential decisionmaking (sMDP/dMDP: stochastic/ deterministic MDP). We introduce the concept of generalized dMDP (g-dMDP) where each action may result in more than one next (parallel or clone) state. The common tools to represent dMDPs are digraphs, but these are inadequate for sMDPs and g-dMDPs. We introduce d-graphs as general tools to represent all the above mentioned processes (stationary versions). We also present a combined d-graph algorithm that implements dynamic programming strategies to find optimal policies for the finite/infinite horizon versions of these Markov processes. (The preliminary version of this paper was presented at the Conference MACRo 2011.)
    Źródło:
    Control and Cybernetics; 2012, 41, 3; 577-593
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An ant algorithm for the maximum number of 3-cliques in 3-partite graphs
    Autorzy:
    Schiff, Krzysztof
    Powiązania:
    https://bibliotekanauki.pl/articles/2183443.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    ant colony optimization
    three-partite graph
    3-clique
    combinatorial optimization
    graph theory
    Opis:
    The problem of finding the maximum number of d- vertices cliques (d = 3) in d-partite graph (d = 3) when graph density q is lower than 1 is an important problem in combinatorial optimization and it is one of many NP-complete problems. For this problem a meta-heuristic algorithm has been developed, namely an ant colony optimization algorithm. In this paper a new development of this ant algorithm and experimental results are presented. The problem of finding the maximum number of 3-vertices cliques can be encountered in computer image analysis, computer vision applications, automation and robotic vision systems. The optimal solution of this problem boils down to finding a set of 3-vertices cliques in a 3-partite graph and this set should have cardinality as high as possible. The elaborated ant colony algorithm can be easily modified for d-dimensional problems, that is for finding the maximum number of d-vertices cliques in a d-partite graph.
    Źródło:
    Control and Cybernetics; 2021, 50, 2; 347--358
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    The smallest hard-to-color graphs for the classical, total and strong colorings of vertices
    Autorzy:
    Kubale, M.
    Manuszewski, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/206254.pdf
    Data publikacji:
    1999
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    optymalizacja
    teoria grafów
    złożoność obliczeniowa
    benchmark
    chromatic number
    chromatic sum
    graph oring
    hard-to-color graph
    NP-completeness
    strong coloring
    Opis:
    : Let A(G) be the number of colors used by algorithm to color the vertices of graph G. A graph G is said to be hard-to-color (HC) (resp. slightly HC) if for every (resp. some) implementation of the algorithm A we have A(G) > chi(G), where chi(G) is the chromatic number of G. The study of HC graphs makes it possible design improved algorithms trying to avoid hard instances as far possible. Hard-to-color graphs are also good benchmarks for the evaluation of existing and future algorithms and provide an alternative way of assessing their quality. In this paper we demonstrate the smallest HC graphs for the best known coloring heuristics in classical applications, as well as when adapted to the chromatic sum coloring and strong coloring of vertices.
    Źródło:
    Control and Cybernetics; 1999, 28, 2; 355-365
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An efficient SQL-based querying method to RDF schemata
    Autorzy:
    Falkowski, M.
    Jędrzejek, Cz.
    Powiązania:
    https://bibliotekanauki.pl/articles/970821.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    semantic data
    graph query
    RDF
    relational database
    query rewriting
    Opis:
    Applications based on knowledge engineering require operations on semantic data. Modern systems have to deal with large data volumes and the challenge is to process and search these data effectively. One of the aspects of efficiency is the ability to query those data with respect to their semantics. In this area an RDF data model and a SPARQL query language gained the highest popularity and are de facto standards. The problem is that most data in modern systems are stored in relational databases and have no formal and precisely expressed semantics, although operations on those data are fast and scalable. Traditionally, in this area relational data are transformed to a form expected by reasoning and querying systems (usually RDF based). In this work a method of query rewriting is presented that translates a query to an RDF data structure (i.e. SPARQL query) to a SQL query executed by RDBMS. Transforming queries instead of data has many advantages and might lead to significant increase of data extraction efficiency.
    Źródło:
    Control and Cybernetics; 2009, 38, 1; 193-213
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Dynamic flows with supply and demand
    Autorzy:
    Ciurea, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/205598.pdf
    Data publikacji:
    2000
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    algorytm grafowy
    przepływ dynamiczny
    sieć
    dynamic flows
    graph algorithms
    networks
    Opis:
    We are given a network G = (N, A, h, c) with node set N, arc set A, time function h, capacity function c, and P the set of periods, s the source and s' the sink of the network G. Associated with s, there is a non-negative real number q(t) called the supply of source s at time t, and with s' - a nonnegative real number q'(t) called the demand of sink s' at time t, t [belongs to] P. The objective is to determine the existence of a dynamic flow in G for p periods, so that the demands at sink s' can be fulfilled from the supplies at the source s. A numerical example is presented.
    Źródło:
    Control and Cybernetics; 2000, 29, 4; 895-903
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Visualisation of concurrent processes
    Autorzy:
    Mikulski, Ł
    Piątkowski, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/205775.pdf
    Data publikacji:
    2013
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    concurrency
    partial order
    Hasse diagram
    directed acyclic graph
    linearisation
    Mazurkiewicz traces
    Opis:
    Mazurkiewicz traces are a widely used model for describing the languages of concurrent systems computations. The causal structure of atomic actions occurring in a process modeled as a trace generates a partial order. Hasse diagrams of such order are very common structures used for presentation and investigation in the concurrency theory, especially from the behavioural perspective. We present effective algorithms for Hasse diagrams construction and transformation. Later on, we use them for enumeration of all linearisations of the partial order that represents a concurrent process. Additionally, we attach the flexible visual implementation of all considered Algorithms.
    Źródło:
    Control and Cybernetics; 2013, 42, 3; 699-725
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    An MST cluster analysis method under hesitant fuzzy environment
    Autorzy:
    Zhang, X.
    Xu, Z.
    Powiązania:
    https://bibliotekanauki.pl/articles/205680.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    hesitant fuzzy set
    minimal spanning tree
    graph theory-based clustering algorithm
    hesitant fuzzy distance
    Opis:
    Hesitant fuzzy sets (HFSs) are useful means to describe and deal with uncertain data. In this article, a minimal spinning tree (MST) algorithm based clustering technique under hesitant fuzzy environment is proposed. We first introduce the concepts of graph, MST, HFS, and hesitant fuzzy distance. Then, we present a hesitant fuzzy MST clustering algorithm to perform clustering analysis of HFSs via some hesitant fuzzy distances, and finally illustrate the effectiveness of our algorithm through two numerical examples.
    Źródło:
    Control and Cybernetics; 2012, 41, 3; 645-666
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Time Petri nets state space reduction using dynamic programming
    Autorzy:
    Popova-Zeugmann, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/970865.pdf
    Data publikacji:
    2006
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    programowanie dynamiczne
    time Petri net
    dynamic programming
    state space reduction
    integer state
    reachability graph
    Opis:
    In this paper a parametric description for the state space of an arbitrary TPN is given. An enumerative procedure for reducing the state space is introduced. The reduction is defined as a truncated multistage decision problem and solved recursively. A reachability graph is denned in a discrete way by using the reachable integer-states of the TPN.
    Źródło:
    Control and Cybernetics; 2006, 35, 3; 721-748
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Learning causal theories with non-reversible MCMC methods
    Autorzy:
    Krajewska, Antonina
    Powiązania:
    https://bibliotekanauki.pl/articles/2183467.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    Bayesian inference
    causal systems
    directed acyclic graph
    MCMC
    non-reversible Markov processes
    search and score methods
    Opis:
    Causal laws are defined in terms of concepts and the causal relations between them. Following Kemp et al. (2010), we investigate the performance of the hierarchical Bayesian model, in which causal systems are represented by directed acyclic graphs (DAGs) with nodes divided into distinct categories. This paper presents two non-reversible search and score algorithms (Q1 and Q2) and their application to the causal learning system. The algorithms run through the pairs of class-assignment vectors and graph structures and choose the one which maximizes the probability of given observations. The model discovers latent classes in relational data and the number of these classes and predicts relations between objects belonging to them. We evaluate its performance on prediction tasks from the behavioural experiment about human cognition. Within the discussed approach, we solve a simplified prediction problem when object classification is known in advance. Finally, we describe the experimental procedure allowing in-depth analysis of the efficiency and scalability of both search and score algorithms.
    Źródło:
    Control and Cybernetics; 2021, 50, 3; 323--361
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Systematic analysis and review of video object retrieval techniques
    Autorzy:
    Ghuge, C. A.
    Prakash, V. Chandra
    Ruikar, Sachin D.
    Powiązania:
    https://bibliotekanauki.pl/articles/2050246.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    video object retrieval
    computer vision
    deep learning
    fuzzy-based techniques
    machine learning
    query-based techniques
    graph-based techniques
    Opis:
    Video object retrieval is a promising research direction, developing in the recent years, and the current video object retrieval strategies are used for visualizing, digitizing, modeling, and retrieving the objects especially in graphics and in architectural design. The research performed led to the design of proficient video object retrieval techniques. Yet, although, a number of algorithms had been devised for tracking objects, the problems persist in enhancing the performance, for instance – with regard to non-rigid objects. In this review article we provide a detailed survey of 50 research papers presenting the suggested video object retrieval methodologies, based on approaches such as deep learning techniques, graph-based techniques, query-based techniques, feature-based techniques, fuzzybased techniques, machine learning-based techniques, distance metric learning-based technique, and also other ones. Moreover, analysis and discussion are presented concerning the year of publication, employed methodology, evaluation metrics, accuracy range, adopted framework, datasets utilized, and the implementation tool. Finally, the research gaps and issues related to various proposed video object retrieval schemes are presented for guiding the researchers towards improved contributions to the video object retrieval methods.
    Źródło:
    Control and Cybernetics; 2020, 49, 4; 471-498
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-11 z 11

      Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies