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

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    Tytuł:
    On Network Models and the Symbolic Solution of Network Equations
    Autorzy:
    Reinschke, K. J.
    Powiązania:
    https://bibliotekanauki.pl/articles/908328.pdf
    Data publikacji:
    2001
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    sieć wielowymiarowa
    teoria grafów
    history of network theory
    network graphs
    network equations
    modified nodal analysis
    admittance representation of multi-ports
    multidimensional networks
    Opis:
    This paper gives an overview of the formulation and solution of network equations, with emphasis on the historical development of this area. Networks are mathematical models. The three ingredients of network descriptions are discussed. It is shown how the network equations of one-dimensional multi-port networks can be formulated and solved symbolically. If necessary, the network graph is modified so as to obtain an admittance representation for all kinds of multi-ports. N-dimensional networks are defined as graphs with the algebraic structure of N-dimensional vectors. In civil engineering, framed structures in two and three spatial dimensions can be modeled as 3-dimensional or 6-dimensional networks. The separation of geometry from topology is a characteristic feature of such networks.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2001, 11, 1; 237-269
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A smart amalgamation of spectral neural algorithm for nonlinear Lane-Emden equations with simulated annealing
    Autorzy:
    Khan, N. A.
    Shaikh, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/91814.pdf
    Data publikacji:
    2017
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    Lane-Emden equations
    simulated annealing
    legendre polynomials
    neural network
    Opis:
    The actual motivation of this paper is to develop a functional link between artificial neural network (ANN) with Legendre polynomials and simulated annealing termed as Legendre simulated annealing neural network (LSANN). To demonstrate the applicability, it is employed to study the nonlinear Lane-Emden singular initial value problem that governs the polytropic and isothermal gas spheres. In LSANN, minimization of error is performed by simulated annealing method while Legendre polynomials are used in hidden layer to control the singularity problem. Many illustrative examples of Lane-Emden type are discussed and results are compared with the formerly used algorithms. As well as with accuracy of results and tranquil implementation it provides the numerical solution over the entire finite domain.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2017, 7, 3; 215-224
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Score level and rank level fusion for KINECT-based multi-modal biometric system
    Autorzy:
    Rahman, Md Wasiur
    Zohra, Guellati Fatma
    Gavrilova, Marina L.
    Powiązania:
    https://bibliotekanauki.pl/articles/91778.pdf
    Data publikacji:
    2019
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    Lane-Emden equations
    simulated annealing
    legendre polynomials
    neural network
    Opis:
    Computational intelligence firmly made its way into the areas of consumer applications, banking, education, social networks, and security. Among all the applications, biometric systems play a significant role in ensuring an uncompromised and secure access to resources and facilities. This article presents a first multimodal biometric system that combines KINECT gait modality with KINECT face modality utilizing the rank level and the score level fusion. For the KINECT gait modality, a new approach is proposed based on the skeletal information processing. The gait cycle is calculated using three consecutive local minima computed for the distance between left and right ankles. The feature distance vectors are calculated for each person’s gait cycle, which allows extracting the biometric features such as the mean and the variance of the feature distance vector. For Kinect face recognition, a novel method based on HOG features has been developed. Then, K-nearest neighbors feature matching algorithm is applied as feature classification for both gait and face biometrics. Two fusion algorithms are implemented. The combination of Borda count and logistic regression approaches are used in the rank level fusion. The weighted sum method is used for score level fusion. The recognition accuracy obtained for multi-modal biometric recognition system tested on KINECT Gait and KINECT Eurocom Face datasets is 93.33% for Borda count rank level fusion, 96.67% for logistic regression rank-level fusion and 96.6% for score level fusion.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2019, 9, 3; 167-176
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Distributed certificate authority in cluster-based manet using multi secret sharing scheme
    Autorzy:
    Azza, M
    Hacene, S B
    Powiązania:
    https://bibliotekanauki.pl/articles/101930.pdf
    Data publikacji:
    2015
    Wydawca:
    Stowarzyszenie Inżynierów i Techników Mechaników Polskich
    Tematy:
    secret sharing scheme
    clustering
    mobile ad hoc network
    overdetermined system
    linear equations
    Galois fields
    certificate authority
    Opis:
    Providing secure communications in mobile ad hoc networks (MANET) is an important and difficult problem, due to a lack of a key management infrastructure. The authentication is an important security service in (MANETs). To provide a node authentication service we use a fully distributed certificate authorities (FDCA) based on the threshold cryptography. In this paper we propose an efficient and verifiable multi secret sharing scheme in cluster-based MANET with a low computation system. Our scheme is based on the overdetermined linear system equation in Galois fields GF(2r). We have analyzed our scheme based on security and performance criteria, and compared with existing approaches. The efficiency of our proposed schemes was verified and evaluated by simulation. Simulation results show that this approach is scalable.
    Źródło:
    Advances in Science and Technology. Research Journal; 2015, 9, 28; 1-9
    2299-8624
    Pojawia się w:
    Advances in Science and Technology. Research Journal
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Transient flow in gas networks: Traveling waves
    Autorzy:
    Gugat, M.
    Wintergerst, D.
    Powiązania:
    https://bibliotekanauki.pl/articles/331492.pdf
    Data publikacji:
    2018
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    traveling wave
    isothermal Euler equations
    compressibility factor
    gas network
    blow-up
    optimal control
    fala wędrująca
    równania Eulera
    współczynnik ściśliwości
    sieć gazowa
    sterowanie optymalne
    Opis:
    In the context of gas transportation, analytical solutions are helpful for the understanding of the underlying dynamics governed by a system of partial differential equations. We derive traveling wave solutions for the one-dimensional isothermal Euler equations, where an affine linear compressibility factor is used to describe the correlation between density and pressure. We show that, for this compressibility factor model, traveling wave solutions blow up in finite time. We then extend our analysis to networks under appropriate coupling conditions and derive compatibility conditions for the network nodes such that the traveling waves can travel through the nodes. Our result allows us to obtain an explicit solution for a certain optimal boundary control problem for the pipeline flow.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2018, 28, 2; 341-348
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Nonstationary analysis of a queueing network with positive and negative messages
    Autorzy:
    Matalytski, M.
    Naumenko, V.
    Powiązania:
    https://bibliotekanauki.pl/articles/122613.pdf
    Data publikacji:
    2013
    Wydawca:
    Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej
    Tematy:
    information systems
    telecommunications systems
    information networks
    telecommunications networks
    virus
    open G-network with negative messages
    transient behavior
    system of difference-differential equations
    probability states
    generating function
    Opis:
    This paper contains an investigation of an open queueing network with positive and negative messages that can be used to model the behavior of viruses in information and telecommunication systems and networks. The purpose of research is investigation of such a network at the transient behavior. We consider the case when the intensity of the incoming flow of positive and negative messages and service intensity of messages do not depend on time. It is assumed that all queueing systems of network are one-line. We obtained a system difference-differential equations for the state probabilities of the network. To find the state probabilities of the network in the transitional behavior applied a methodology based on the use of the apparatus of multidimensional generating functions. We obtained an expression for generating function. An example is calculated.
    Źródło:
    Journal of Applied Mathematics and Computational Mechanics; 2013, 12, 2; 61-71
    2299-9965
    Pojawia się w:
    Journal of Applied Mathematics and Computational Mechanics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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