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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-4 z 4
    Tytuł:
    Novel accessibility metrics based on hierarchical decomposition of transport networks
    Autorzy:
    Kwatra, Divya
    Rao, Kalaga Ramachandra
    Bhatnagar, Vasudha
    Powiązania:
    https://bibliotekanauki.pl/articles/27311337.pdf
    Data publikacji:
    2023
    Wydawca:
    Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
    Tematy:
    integral accessibility
    network topology
    weighted network
    k-core decomposition
    eigenvector centralit
    airlines network
    integralna dostępność
    topologia sieci
    sieć ważona
    dekompozycja k-rdzeniowa
    centralność wektora własnego
    sieć linii lotniczych
    Opis:
    Scientific analysis of public transport systems at the urban, regional, and national levels is vital in this contemporary, highly connected world. Quantifying the accessibility of nodes (locations) in a transport network is considered a holistic measure of transportation and land use and an important research area. In recent years, complex networks have been employed for modeling and analyzing the topology of transport systems and services networks. However, the design of network hierarchy-based accessibility measures has not been fully explored in transport research. Thus, we propose a set of three novel accessibility metrics based on the k-core decomposition of the transport network. Core-based accessibility metrics leverage the network topology by eliciting the hierarchy while accommodating variations like travel cost, travel time, distance, and frequency of service as edge weights. The proposed metrics quantify the accessibility of nodes at different geographical scales, ranging from local to global. We use these metrics to compute the accessibility of geographical locations connected by air transport services in India. Finally, we show that the measures are responsive to changes in the topology of the transport network by analyzing the changes in accessibility for the domestic air services network for both pre-covid and post-covid times.
    Źródło:
    Zeszyty Naukowe. Transport / Politechnika Śląska; 2023, 118; 139--160
    0209-3324
    2450-1549
    Pojawia się w:
    Zeszyty Naukowe. Transport / Politechnika Śląska
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A weighted wrapper approach to feature selection
    Autorzy:
    Kusy, Maciej
    Zajdel, Roman
    Powiązania:
    https://bibliotekanauki.pl/articles/2055180.pdf
    Data publikacji:
    2021
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    feature selection
    wrapper approach
    feature significance
    weighted combined ranking
    convolutional neural network
    classification accuracy
    selekcja cech
    sieć neuronowa konwolucyjna
    dokładność klasyfikacji
    Opis:
    This paper considers feature selection as a problem of an aggregation of three state-of-the-art filtration methods: Pearson’s linear correlation coefficient, the ReliefF algorithm and decision trees. A new wrapper method is proposed which, on the basis of a fusion of the above approaches and the performance of a classifier, is capable of creating a distinct, ordered subset of attributes that is optimal based on the criterion of the highest classification accuracy obtainable by a convolutional neural network. The introduced feature selection uses a weighted ranking criterion. In order to evaluate the effectiveness of the solution, the idea is compared with sequential feature selection methods that are widely known and used wrapper approaches. Additionally, to emphasize the need for dimensionality reduction, the results obtained on all attributes are shown. The verification of the outcomes is presented in the classification tasks of repository data sets that are characterized by a high dimensionality. The presented conclusions confirm that it is worth seeking new solutions that are able to provide a better classification result while reducing the number of input features.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2021, 31, 4; 685--696
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Design of Network Traffic Congestion Controller with PI AQM Based on ITAE Index
    Autorzy:
    Fajri, Misbahul
    Ramli, Kalamullah
    Powiązania:
    https://bibliotekanauki.pl/articles/1844457.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    network congestion control
    active queue management (AQM)
    proportional integral controller
    Nelder-Mead simplex method
    integral of time-weighted absolute error (ITAE)
    Opis:
    Establishing the proper values of controller parameters is the most important thing to design in active queue management (AQM) for achieving excellent performance in handling network congestion. For example, the first well known AQM, the random early detection (RED) method, has a lack of proper parameter values to perform under most the network conditions. This paper applies a Nelder-Mead simplex method based on the integral of time-weighted absolute error (ITAE) for a proportional integral (PI) controller using active queue management (AQM). A TCP flow and PI AQM system were analyzed with a control theory approach. A numerical optimization algorithm based on the ITAE index was run with Matlab/Simulink tools to find the controller parameters with PI tuned by Hollot (PI) as initial parameter input. Compared with PI and PI tuned by Ustebay (PIU) via experimental simulation in Network Simulator Version 2 (NS2) in five scenario network conditions, our proposed method was more robust. It provided stable performance to handle congestion in a dynamic network.
    Źródło:
    International Journal of Electronics and Telecommunications; 2020, 66, 4; 715-721
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Frames and factorization of graph Laplacians
    Autorzy:
    Jorgensen, P.
    Tian, F.
    Powiązania:
    https://bibliotekanauki.pl/articles/255936.pdf
    Data publikacji:
    2015
    Wydawca:
    Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
    Tematy:
    unbounded operators
    deficiency-indices
    Hilbert space
    boundary values
    weighted graph
    reproducing kernel
    Dirichlet form
    graph Laplacian
    resistance network
    harmonic analysis
    frame
    Parseval frame
    Friedrichs extension
    reversible random walk
    resistance distance
    energy Hilbert space
    Opis:
    Using functions from electrical networks (graphs with resistors assigned to edges), we prove existence (with explicit formulas) of a canonical Parseval frame in the energy Hilbert space [formula] of a prescribed infinite (or finite) network. Outside degenerate cases, our Parseval frame is not an orthonormal basis. We apply our frame to prove a number of explicit results: With our Parseval frame and related closable operators in [formula] we characterize the Priedrichs extension of the [formula]-graph Laplacian. We consider infinite connected network-graphs G = (V, E), V for vertices, and E for edges. To every conductance function c on the edges E of G, there is an associated pair [formula] where [formula] in an energy Hilbert space, and Δ (=Δc) is the c-graph Laplacian; both depending on the choice of conductance function c. When a conductance function is given, there is a current-induced orientation on the set of edges and an associated natural Parseval frame in [formula] consisting of dipoles. Now Δ is a well-defined semibounded Hermitian operator in both of the Hilbert [formula] and [formula]. It is known to automatically be essentially selfadjoint as an [formula]-operator, but generally not as an [formula] operator. Hence as an [formula] operator it has a Friedrichs extension. In this paper we offer two results for the Priedrichs extension: a characterization and a factorization. The latter is via [formula].
    Źródło:
    Opuscula Mathematica; 2015, 35, 3; 293-332
    1232-9274
    2300-6919
    Pojawia się w:
    Opuscula Mathematica
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-4 z 4

      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