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ę "topological network" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Optimising pedestrian flow in a topological network using various pairwise speed-density models
    Autorzy:
    Khalid, Ruzelan
    Nawawi, Mohd Kamal Mohd
    Ishak, Nurhanis
    Baten, Md Azizul
    Powiązania:
    https://bibliotekanauki.pl/articles/29127975.pdf
    Data publikacji:
    2023
    Wydawca:
    Politechnika Wrocławska. Oficyna Wydawnicza Politechniki Wrocławskiej
    Tematy:
    topological network
    speed-density model
    optimal arrival rate
    network flow model
    pedestrian flow
    Opis:
    A speed-density model can be utilised to efficiently flow pedestrians in a network. However, how each model measures and optimises the performance of the network is rarely reported. Thus, this paper analyses and optimises the flow in a topological network using various speed-density models. Each model was first used to obtain the optimal arrival rates to all individual networks. The optimal value of each network was then set as a flow constraint in a network flow model. The network flow model was solved to find the optimal arrival rates to the source networks. The optimal values were then used to measure their effects on the performance of each available network. The performance results of the model were then compared with that of other speed-density models. The analysis of the results can help decision-makers understand how arrival rates propagate through traffic and determine the level of the network throughputs.
    Źródło:
    Operations Research and Decisions; 2023, 33, 4; 53--69
    2081-8858
    2391-6060
    Pojawia się w:
    Operations Research and Decisions
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the topological properties of the certain neural networks
    Autorzy:
    Liu, J.-B.
    Zhao, J.
    Wang, S.
    Javaid, M.
    Cao, J.
    Powiązania:
    https://bibliotekanauki.pl/articles/91804.pdf
    Data publikacji:
    2018
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    neural network
    topological indices
    graph theory
    Opis:
    A topological index is a numeric quantity associated with a network or a graph that characterizes its whole structural properties. In [Javaid and Cao, Neural Computing and Applications, DOI 10.1007/s00521-017-2972-1], the various degree-based topological indices for the probabilistic neural networks are studied. We extend this study by considering the calculations of the other topological indices, and derive the analytical closed formulas for these new topological indices of the probabilistic neural network. Moreover, a comparative study using computer-based graphs has been carried out first time to clarify the nature of the computed topological descriptors for the probabilistic neural networks. Our results extend some known conclusions.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 4; 257-268
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Topological properties of four-layered neural networks
    Autorzy:
    Javaid, M.
    Abbas, M.
    Liu, Jia-Bao
    Teh, W. C.
    Cao, Jinde
    Powiązania:
    https://bibliotekanauki.pl/articles/91541.pdf
    Data publikacji:
    2019
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    degree of node
    topological properties
    neural network
    probabilistic neural
    network
    Opis:
    A topological property or index of a network is a numeric number which characterises the whole structure of the underlying network. It is used to predict the certain changes in the bio, chemical and physical activities of the networks. The 4-layered probabilistic neural networks are more general than the 3-layered probabilistic neural networks. Javaid and Cao [Neural Comput. and Applic., DOI 10.1007/s00521-017-2972-1] and Liu et al. [Journal of Artificial Intelligence and Soft Computing Research, 8(2018), 225-266] studied the certain degree and distance based topological indices (TI’s) of the 3-layered probabilistic neural networks. In this paper, we extend this study to the 4-layered probabilistic neural networks and compute the certain degree-based TI’s. In the end, a comparison between all the computed indices is included and it is also proved that the TI’s of the 4-layered probabilistic neural networks are better being strictly greater than the 3-layered probabilistic neural networks.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 2; 111-122
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On the influence of topological characteristics on robustness of complex networks
    Autorzy:
    Kasthurirathna, D.
    Piraveenan, M.
    Thedchanamoorthy, G.
    Powiązania:
    https://bibliotekanauki.pl/articles/91836.pdf
    Data publikacji:
    2013
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    topological characteristics
    complex network
    random networks
    robustness
    Opis:
    In this paper, we explore the relationship between the topological characteristics of a complex network and its robustness to sustained targeted attacks. Using synthesised scale-free, small-world and random networks, we look at a number of network measures, including assortativity, modularity, average path length, clustering coefficient, rich club profiles and scale-free exponent (where applicable) of a network, and how each of these influence the robustness of a network under targeted attacks. We use an established robustness coefficient to measure topological robustness, and consider sustained targeted attacks by order of node degree. With respect to scale-free networks, we show that assortativity, modularity and average path length have a positive correlation with network robustness, whereas clustering coefficient has a negative correlation. We did not find any correlation between scale-free exponent and robustness, or rich-club profiles and robustness. The robustness of small-world networks on the other hand, show substantial positive correlations with assortativity, modularity, clustering coefficient and average path length. In comparison, the robustness of Erdos-Renyi random networks did not have any significant correlation with any of the network properties considered. A significant observation is that high clustering decreases topological robustness in scale-free networks, yet it increases topological robustness in small-world networks. Our results highlight the importance of topological characteristics in influencing network robustness, and illustrate design strategies network designers can use to increase the robustness of scale-free and small-world networks under sustained targeted attacks.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2013, 3, 2; 89-100
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Heuristic algorithms in topological design of telecommunication networks
    Autorzy:
    Karaś, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/307692.pdf
    Data publikacji:
    2003
    Wydawca:
    Instytut Łączności - Państwowy Instytut Badawczy
    Tematy:
    topological design
    network optimisation
    heuristic algorithms
    genetic algorithms
    Opis:
    The paper addresses the generic topological network design problem and considers the use of various heuristic algorithms for solving the problem. The target of the optimisation is to determine a network structure and demand allocation pattern that would minimise the cost of the network, which is given by fixed installation costs of nodes and links and variable link capacity costs described bv linear or concave functions. Input data for the optimisation consists of a list of potential node and link locations and their costs and a set of demands defined between the nodes. Since the problem is known to be NP-hard. The use of specialised heuristic algorithms is proposed. The presented approaches encompass original ideas as well as selected methods described in literature and their enhancements. The algorithms are based on the following ideas and methods: shifting of individual flows, local and global restoration of flows from chosen links or nodes, Yaged algorithm for finding local minima, Minoux greedy algorithm, simulated allocation and genetic algorithms. Efficiency of each of the proposed methods is tested on a set of numerical examples.
    Źródło:
    Journal of Telecommunications and Information Technology; 2003, 3; 73-82
    1509-4553
    1899-8852
    Pojawia się w:
    Journal of Telecommunications and Information Technology
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    On knowledge discovery and representations of molecular structures using topological indices
    Autorzy:
    Alsaadi, Fawaz E.
    Bokhary, Syed Ahtsham Ul Haq
    Shah, Aqsa
    Ali, Usman
    Cao, Jinde
    Alassafi, Madini Obad
    Rehman, Masood Ur
    Rahman, Jamshaid Ul
    Powiązania:
    https://bibliotekanauki.pl/articles/2031152.pdf
    Data publikacji:
    2021
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    graph network
    sheet
    topological index
    cheminformatics
    knowledge discovery
    Opis:
    The main purpose of a topological index is to encode a chemical structure by a number. A topological index is a graph invariant, which decribes the topology of the graph and remains constant under a graph automorphism. Topological indices play a wide role in the study of QSAR (quantitative structure-activity relationship) and QSPR (quantitative structure-property relationship). Topological indices are implemented to judge the bioactivity of chemical compounds. In this article, we compute the ABC (atom-bond connectivity); ABC4 (fourth version of ABC), GA(geometric arithmetic) and GA5(fifth version of GA) indices of some networks sheet. These networks include: octonano window sheet; equilateral triangular tetra sheet; rectangular sheet; and rectangular tetra sheet networks.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2021, 11, 1; 21-32
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Analysis of selected transportation network structures based on graph measures
    Autorzy:
    Żochowska, R.
    Soczówka, P.
    Powiązania:
    https://bibliotekanauki.pl/articles/197600.pdf
    Data publikacji:
    2018
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    transportation network
    graph theory
    graph measures
    topological measure
    sieć transportowa
    teoria grafów
    wykres miar
    miara topologiczna
    Opis:
    The structure of transportation networks has been the subject of analysis for many years, due to the important role that it plays in assessing the efficiency of transportation systems. One of the most common approaches to representing this structure is to use graph theory, in which elements of transportation infrastructure are depicted by a set of vertices and edges. An approach based on graph theory allows us to assess the structure of a transportation network in terms of connectivity, accessibility, density or complexity. In the paper, different transportation network structures are assessed and compared, based on graph measures.
    Źródło:
    Zeszyty Naukowe. Transport / Politechnika Śląska; 2018, 98; 223-233
    0209-3324
    2450-1549
    Pojawia się w:
    Zeszyty Naukowe. Transport / Politechnika Śląska
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Evolutionary stable strategies in networked games: the influence of topology
    Autorzy:
    Kasthurirathna, D.
    Piraveenan, M.
    Uddin, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/91531.pdf
    Data publikacji:
    2015
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    evolutionary game theory
    competing strategy
    evolutionary stability
    network topology
    Zero-determinant strategy
    Pavlov strategy
    players population
    topological stability
    cooperator strategy
    ewolucyjna teoria gier
    strategia współzawodnictwa
    stabilność ewolucyjna
    topologia sieci
    strategia Pavlova
    populacja graczy
    stabilność topologiczna
    strategia współpracy
    Opis:
    Evolutionary game theory is used to model the evolution of competing strategies in a population of players. Evolutionary stability of a strategy is a dynamic equilibrium, in which any competing mutated strategy would be wiped out from a population. If a strategy is weak evolutionarily stable, the competing strategy may manage to survive within the network. Understanding the network-related factors that affect the evolutionary stability of a strategy would be critical in making accurate predictions about the behaviour of a strategy in a real-world strategic decision making environment. In this work, we evaluate the effect of network topology on the evolutionary stability of a strategy. We focus on two well-known strategies known as the Zero-determinant strategy and the Pavlov strategy. Zero-determinant strategies have been shown to be evolutionarily unstable in a well-mixed population of players. We identify that the Zero-determinant strategy may survive, and may even dominate in a population of players connected through a non-homogeneous network. We introduce the concept of ‘topological stability’ to denote this phenomenon. We argue that not only the network topology, but also the evolutionary process applied and the initial distribution of strategies are critical in determining the evolutionary stability of strategies. Further, we observe that topological stability could affect other well-known strategies as well, such as the general cooperator strategy and the cooperator strategy. Our observations suggest that the variation of evolutionary stability due to topological stability of strategies may be more prevalent in the social context of strategic evolution, in comparison to the biological context.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2015, 5, 2; 83-95
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      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