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ę "directed graph" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-3 z 3
    Tytuł:
    Control flow graphs and code coverage
    Autorzy:
    Gold, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/908136.pdf
    Data publikacji:
    2010
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    graf skierowany
    graf przepływowy
    testowanie oprogramowania
    directed graph
    control flow graph
    graph reduction
    software testing
    statement coverage
    branch coverage
    Opis:
    The control flow of programs can be represented by directed graphs. In this paper we provide a uniform and detailed formal basis for control flow graphs combining known definitions and results with new aspects. Two graph reductions are defined using only syntactical information about the graphs, but no semantical information about the represented programs. We prove some properties of reduced graphs and also about the paths in reduced graphs. Based on graphs, we define statement coverage and branch coverage such that coverage notions correspond to node coverage, and edge coverage, respectively.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2010, 20, 4; 739-749
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A method of constructing the frame of a directed graph
    Autorzy:
    Hofuku, I.
    Oshima, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/331224.pdf
    Data publikacji:
    2013
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    directed graph
    node clustering
    Perron-Frobenius theorem
    information retrieval
    graf skierowany
    węzeł grafu
    twierdzenie Perrona-Frobeniusa
    wyszukiwanie informacji
    Opis:
    In web search engines, such as Google, the ranking of a particular keyword is determined by mathematical tools, e.g., Pagerank or Hits. However, as the size of the network increases, it becomes increasingly difficult to use keyword ranking to quickly find the information required by an individual user. One reason for this phenomenon is the interference of superfluous information with the link structure. The World Wide Web can be expressed as an enormous directed graph. The purpose of the present study is to provide tools for studying the web as a directed graph in order to find clues to the solution of the problem of interference from superfluous information, and to reform the directed graph to clarify the relationships between the nodes.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2013, 23, 4; 823-837
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Signed directed graph based modeling and its validation from process knowledge and process data
    Autorzy:
    Yang, F.
    Shah, S. L.
    Xiao, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/331384.pdf
    Data publikacji:
    2012
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    graf skierowany
    diagnostyka uszkodzeń
    system oceny zagrożeń
    signed directed graph
    transfer entropy
    process topology
    fault diagnosis
    process hazard assessment
    Opis:
    This paper is concerned with the fusion of information from process data and process connectivity and its subsequent use in fault diagnosis and process hazard assessment. The Signed Directed Graph (SDG), as a graphical model for capturing process topology and connectivity to show the causal relationships between process variables by material and information paths, has been widely used in root cause and hazard propagation analysis. An SDG is usually built based on process knowledge as described by piping and instrumentation diagrams. This is a complex and experience-dependent task, and therefore the resulting SDG should be validated by process data before being used for analysis. This paper introduces two validation methods. One is based on cross-correlation analysis of process data with assumed time delays, while the other is based on transfer entropy, where the correlation coefficient between two variables or the information transfer from one variable to another can be computed to validate the corresponding paths in SDGs. In addition to this, the relationship captured by data-based methods should also be validated by process knowledge to confirm its causality. This knowledge can be realized by checking the reachability or the influence of one variable on another based on the corresponding SDG which is the basis of causality. A case study of an industrial process is presented to illustrate the application of the proposed methods.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2012, 22, 1; 41-53
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-3 z 3

      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