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ę "search" wg kryterium: Wszystkie pola

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-13 z 13
    Tytuł:
    Tabu Search Against Permutation Based Stream Ciphers
    Autorzy:
    Polak, I.
    Boryczka, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/227111.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    tabu search
    TS
    cryptanalysis
    RC4
    VMPC
    stream cipher
    state recovery attack
    Opis:
    Encryption is one of the most effective methods of securing data confidentiality, whether stored on hard drives or transferred (e.g. by e-mail or phone call). In this paper a new state recovery attack with tabu search is introduced. Based on research and theoretical approximation it is shown that the internal state can be recovered after checking 2⁵² internal states for RC4 and 2¹⁸⁰ for VMPC.
    Źródło:
    International Journal of Electronics and Telecommunications; 2018, 64, 2; 137-145
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows
    Autorzy:
    Gładysz, J.
    Walkowiak, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/226174.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    anycast
    network design
    tabu search
    survivability
    Opis:
    In this work we focus on the problem of survivable network design for simultaneous unicast and anycast flows. This problem follows from the growing popularity of network services applying the anycast paradigm. The anycasting is defined as one-to-one-of-many transmission and is applied in Domain Name Service (DNS), peer-to-peer (P2P) systems, Content Delivery Networks (CDN). In this work we formulate two models that enables joint optimization of network capacity, working and backup connections for both unicast and anycast flows. The goal is to minimize the network cost required to protect the network against failures using the single backup path approach. In the first model we consider modular link cost, in the second we are given a set of link proposal and we must select only one of them. Because these problems are NP-hard, therefore optimal solutions of branch-and-bounds or branch-and-cut methods can be generated for relatively small networks. Consequently, we propose a new heuristic algorithm based on Tabu Search method. We present results showing the effectiveness the proposed heuristic compared against optimal results. Moreover, we report results showing that the use of anycast paradigm can reduce the network cost.
    Źródło:
    International Journal of Electronics and Telecommunications; 2010, 56, 1; 41-47
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Finding Differential Paths in ARX Ciphers through Nested Monte-Carlo Search
    Autorzy:
    Dwivedi, A. D.
    Morawiecki, P.
    Wójtowicz, S.
    Powiązania:
    https://bibliotekanauki.pl/articles/226721.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    ARX ciphers
    SPECK Cipher
    Nested Monte-Carlo Search
    differential cryptanalysis
    Opis:
    We propose the adaptation of Nested Monte-Carlo Search algorithm for finding differential trails in the class of ARX ciphers. The practical application of the algorithm is demonstrated on round-reduced variants of block ciphers from the SPECK family. More specifically, we report the best differential trails, up to 9 rounds, for SPECK32.
    Źródło:
    International Journal of Electronics and Telecommunications; 2018, 64, 2; 147-150
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Cluster Based Optimization of Routing in Distributed Sensor Networks Using Bayesian Networks with Tabu Search
    Autorzy:
    Bhajantri, L. B.
    Nalini, N.
    Powiązania:
    https://bibliotekanauki.pl/articles/226310.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Distributed Sensor Networks
    routing
    cluster head
    Bayesian Network
    tabu search
    Opis:
    Distributed Sensor Networks (DSNs) have attracted significant attention over the past few years. A growing list of many applications can employ DSNs for increased effectiveness especially in hostile and remote are as. In all application salargen umber of sensors are expected and requiring careful architecture and management of the net work. Grouping nodes in toclusters has been the most popular approach for support scalability in DSN. This paper proposes acluster based optimization of routing in DSN by employing a Bayesi an network (BN) with Tabu search (TS) approach. BN based approach is used to select efficient cluster head sand construction of BN for the proposed scheme. This approach in corporates energy level of each node, band width and link efficiency. The optimization of routing is considered as a design issue in DSN due to lack of energy consumption, delay and maximum time required for data transmission between source nodes (cluster heads) to sink node. In this work optimization of routing takes place through cluster head nodes by using TS. Simulations have been conducted to compare the performance of the proposed approach with LEACH protocol. The objective of the proposed work is to improve the performance of network in terms of energy consumption, through put, packet delivery ratio, and time efficiency of optimization of routing. The results hows that the proposed approach perform better than LEACH protocol that utilizes minimum energy, latency for cluster formation and reduce over head of the protocol.
    Źródło:
    International Journal of Electronics and Telecommunications; 2014, 60, 2; 199-208
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Detection of Obstructive Sleep Apnea from ECG Signal Using SVM Based Grid Search
    Autorzy:
    Valavan, K. K.
    Manoj, S.
    Abishek, S.
    Gokull Vijay, T. G.
    Vojaswwin, P.
    Rolant Gini, J.
    Ramachandran, K. I.
    Powiązania:
    https://bibliotekanauki.pl/articles/1844601.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    ECG signal
    grid search
    RR interval
    sleep apnea
    support vector machine
    Opis:
    Obstructive Sleep Apnea is one common form of sleep apnea and is now tested by means of a process called Polysomnography which is time-consuming, expensive and also requires a human observer throughout the study of the subject which makes it inconvenient and new detection techniques are now being developed to overcome these difficulties. Heart rate variability has proven to be related to sleep apnea episodes and thus the features from the ECG signal can be used in the detection of sleep apnea. The proposed detection technique uses Support Vector Machines using Grid search algorithm and the classifier is trained using features based on heart rate variability derived from the ECG signal. The developed system is tested using the dataset and the results show that this classification system can recognize the disorder with an accuracy rate of 89%. Further, the use of the grid search algorithm has made this system a reliable and an accurate means for the classification of sleep apnea and can serve as a basis for the future development of its screening.
    Źródło:
    International Journal of Electronics and Telecommunications; 2021, 67, 1; 5-12
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Problem-Independent Approach to Multiprocessor Dependent Task Scheduling
    Autorzy:
    Król, D.
    Zydek, D.
    Koszałka, L.
    Powiązania:
    https://bibliotekanauki.pl/articles/226364.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    tasks scheduling
    DAG
    genetic algorithm
    tabu search
    makespan
    Opis:
    This paper concerns Directed Acyclic Graph task scheduling on parallel executors. The problem is solved using two new implementations of Tabu Search and genetic algorithm presented in the paper. A new approach to solution coding is also introduced and implemented in both metaheuristics algorithms. Results given by the algorithms are compared to those generated by greedy LPT and SS-FF algorithms; and HAR algorithm. The analysis of the obtained results of multistage simulation experiments confirms the conclusion that the proposed and implemented algorithms are characterized by very good performance and characteristics.
    Źródło:
    International Journal of Electronics and Telecommunications; 2012, 58, 4; 369-379
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Cryptographically Strong Elliptic Curves of Prime Order
    Autorzy:
    Barański, Marcin
    Gliwa, Rafał
    Szmidt, Janusz
    Powiązania:
    https://bibliotekanauki.pl/articles/1844627.pdf
    Data publikacji:
    2021
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    Mersenne primes
    elliptic curves
    security requirements
    search algorithm
    Magma
    Opis:
    The purpose of this paper is to generate cryptographically strong elliptic curves over prime fields Fp, where p is a Mersenne prime, one of the special primes or a random prime. We search for elliptic curves which orders are also prime numbers. The cryptographically strong elliptic curves are those for which the discrete logarithm problem is computationally hard. The required mathematical conditions are formulated in terms of parameters characterizing the elliptic curves. We present an algorithm to generate such curves. Examples of elliptic curves of prime order are generated with Magma.
    Źródło:
    International Journal of Electronics and Telecommunications; 2021, 67, 2; 207-212
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Real-Time Cloud-based Game Management System via Cuckoo Search Algorithm
    Autorzy:
    Połap, D.
    Woźniak, M.
    Napoli, C.
    Tramontana, E.
    Powiązania:
    https://bibliotekanauki.pl/articles/226816.pdf
    Data publikacji:
    2015
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    computational intelligence
    heuristic algorithm
    Opis:
    This paper analyses the idea of applying Swarm Intelligence in the process of managing the entire 2D board game in a real-time environment. For the proposed solution Game Management System is used as a cloud resource with a dedicated intelligent control agent. The described approach has been analysed on the basis of board games like mazes. The model and the control algorithm of the system is described and examined. The results of the experiments are presented and discussed to show possible advantages and isadvantages of the proposed method.
    Źródło:
    International Journal of Electronics and Telecommunications; 2015, 61, 4; 333-338
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Search for Ultimate Throughput in Ultra-Broadband Photonic Internet
    Autorzy:
    Romaniuk, R. S.
    Powiązania:
    https://bibliotekanauki.pl/articles/227176.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    optical networks
    Internet
    global network
    photonic Internet
    Future Internet
    optoelectronic networks
    Opis:
    A review of our today’s understanding of the ultimately broadband photonic Internet is presented. A simple calculation is presented showing the estimate of the throughput of the core photonic network branches. Optoelectronic components, circuits, systems and signals, together with analogous electronic entities and common software layers, are building blocks of the contemporary Internet. Participation of photonics in development of the physical layer in the future Internet will probably increase. The photonics leads now to a better usage of the available bandwidth (increase of the spectral efficiency measured in Bit/s/Hz), increase in the transmission rate (from Gbps, via Tbps up to probably Pbps), increase in the transmission distance without signal regeneration (in distortion compensated active optical cables), increase in energy/power efficiency measured in W/Gbps, etc. Photonics may lead, in the future, to fully transparent optical networks and, thus, to essential increase in bandwidth and network reliability. It is expected that photonics (with biochemistry, electronics and mechatronics) may build psychological and physiological interface for humans to the future global network. The following optical signal multiplexing methods were considered, which are possible without O/E/O conversion: TDM-OTDM, FDM-CO-OFDM, OCDM-OCDMA, WDM-DWDM. The Polish perspective closes the review.
    Źródło:
    International Journal of Electronics and Telecommunications; 2011, 57, 4; 523-538
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Reduced Complexity by Combining Norm Based Ordering MMSE-BSIDE Detection in MIMO Systems
    Autorzy:
    Jothikumar, R.
    Rangaswamy, N.
    Powiązania:
    https://bibliotekanauki.pl/articles/226286.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    MIMO
    MMSE
    SD
    ML
    BSIDE
    breadth first search
    Opis:
    The breadth first signal decoder (BSIDE) is well known for its optimal maximum likelihood (ML) performance with lesser complexity. In this paper, we analyze a multiple-input multiple-output (MIMO) detection scheme that combines; column norm based ordering minimum mean square error (MMSE) and BSIDE detection methods. The investigation is carried out with a breadth first tree traversal technique, where the computational complexity encountered at the lower layers of the tree is high. This can be eliminated by carrying detection in the lower half of the tree structure using MMSE and upper half using BSIDE, after rearranging the column of the channel using norm calculation. The simulation results show that this approach achieves 22% of complexity reduction for 2x2 and 50% for 4x4 MIMO systems without any degradation in the performance.
    Źródło:
    International Journal of Electronics and Telecommunications; 2017, 63, 3; 305-308
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Minimizing Delay Using Dynamic Blocking Expanding Ring Search Technique for Ad Hoc Networks
    Autorzy:
    Mhatre, Kavita
    Khot, Uday
    Powiązania:
    https://bibliotekanauki.pl/articles/1844446.pdf
    Data publikacji:
    2020
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    AODV
    BERS
    ERS
    BERS+
    DBERS
    MANET
    latency
    energy efficiency
    routes discovery
    Opis:
    Energy and latency are the significant Quality of Service parameters of ad hoc networks. Lower latency and limited energy expenditure of nodes in the ad hoc network contributes to a prolonged lifetime of the network. Reactive protocols determine the route to the destination using a route discovery process which results in increased delay and increased energy expenditure. This paper proposes a new technique of route discovery, Dynamic Blocking Expanded Ring Search (DBERS) which minimizes time delay and energy required for route discovery process. DBERS reduces energy expenditure and time delay occurring in the existing route discovery techniques of reactive protocols. The performance of DBERS is simulated with various network topologies by considering a different number of hop lengths. The analytical results of DBERS are validated through conduction of extensive experiments by simulations that consider topologies with varying hop lengths. The analytical and simulated results of DBERS are evaluated and compared with widely used route discovery techniques such as BERS, BERS+. The comparison of results demonstrates that DBERS provides substantial improvement in time efficiency and also minimizes energy consumption.
    Źródło:
    International Journal of Electronics and Telecommunications; 2020, 66, 4; 723-728
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A New Algorithm for Phased Array Radar Search Function Improvement in Overload Situations
    Autorzy:
    Fatemi Mofrad, R. F.
    Sadeghzadeh, R. A.
    Powiązania:
    https://bibliotekanauki.pl/articles/226581.pdf
    Data publikacji:
    2011
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    phased array radar
    radar resource allocation
    radar modeling
    radar simulation
    radar performance evaluation
    Opis:
    A new algorithm is proposed for phased array radar search function resource allocation. The proposed algorithm adaptively priorities radar search regions and in overload situations, based on available resources, radar characteristics, maximum range and search regions, optimally allocates radar resources in order to maximize probability of detection. The performance of new algorithm is evaluated by the multifunction phased array radar simulation test bed. This simulation test bed provides capability to design and evaluate the performance of different radar resource management, target tracking and beam forming algorithms. Some results are presented that show capabilities of this simulation software for multifunction radar algorithms design and performance evaluation.
    Źródło:
    International Journal of Electronics and Telecommunications; 2011, 57, 1; 55-63
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Design of Grover’s Algorithm over 2, 3 and 4- Qubit Systems in Quantum Programming Studio
    Autorzy:
    Diana, Jingle
    Shylu, Sam
    Mano, Mano
    Ananth, Jude
    Selvaraj, Daniel
    Powiązania:
    https://bibliotekanauki.pl/articles/2055247.pdf
    Data publikacji:
    2022
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    quantum search
    Oracle
    Qubit
    Hadamard
    transform
    phase shift
    Opis:
    In this paper, we design and analyse the Circuit for Grover’s Quantum Search Algorithm on 2, 3 and 4-qubit systems, in terms of number of gates, representation of state vectors and measurement probability for the state vectors. We designed, examined and simulated the quantum circuit on IBM Q platform using Quantum Programming Studio. We present the theoretical implementation of the search algorithm on different qubit systems. We observe that our circuit design for 2 and 4-qubit systems are precise and do not introduce any error while experiencing a small error to our design of 3-qubit quantum system.
    Źródło:
    International Journal of Electronics and Telecommunications; 2022, 68, 1; 77--82
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-13 z 13

      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