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ę "A* algorithm" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-15 z 41
Tytuł:
On Some Aspects of Genetic and Evolutionary Methods for Optimization Purposes
Autorzy:
Woźniak, M.
Połap, D.
Powiązania:
https://bibliotekanauki.pl/articles/227353.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational intelligence
genetic algorithm
heuristic algorithm
optimization
Opis:
In this paper, the idea of applying some hybrid genetic algorithms with gradient local search and evolutionary optimization techniques is formulated. For two different test functions the proposed versions of the algorithms have been examined. Research results are presented and discussed to show potential efficiency in optimization purposes.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 1; 7-16
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Community Clustering on Fraud Transactions Applied the Louvain-Coloring Algorithm
Autorzy:
Mardiansyah, Heru
Suwilo, Saib
Nababan, Erna Budiarti
Efendi, Syahril
Powiązania:
https://bibliotekanauki.pl/articles/27311927.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
fraud Money Transfer
Louvain Coloring algorithm
Louvain Algorithm
Opis:
The contribution main from this research is modularity and better processing time in detecting community by using K-1 coloring. Testing performed on transaction datasets remittance on P2P platforms where the Louvain Coloring algorithm is better in comparison to Louvain Algorithm Data used is data transfer transactions made by customers on the P2P Online platform. The data is the User data that has information transfer transactions, Card data that has information card, IP data that has IP information, and Device data that has information device. Every user owns unique 128-bit identification, and other nodes representing card, device, and IP are assigned a random UUID. The Device node has the guide, and device properties. IP nodes only have property guide and node User has property fraud Money Transfer, guide, money Transfer Error Cancel Amount, first Charge back Date. Each node has a unique 128-bit guide, with the amount whole of as many as 789,856 nodes. Application technique K-1 staining on Louvain algorithm shows enhancement value modularity and better processing time for detecting community on the network large scale. Through a series of exercises and tests carried out in various scenarios, it shows that the experiments carried out in this paper, namely the Louvain Coloring algorithm, are more effective and efficient than the Louvain algorithm in scenario 1,3, and 5 meanwhile For Scenarios 2 and 4 Louvain Algorithm is better.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 3; 593-598
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Combinatorial Properties and Defragmentation Algorithms in WSW1 Switching Fabrics
Autorzy:
Rajewski, Remigiusz
Kabaciński, Wojciech
Al-Tameemi, Atyaf
Powiązania:
https://bibliotekanauki.pl/articles/227184.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
elastic optical network
switching networks
rearrenging algorithm
defragmentation algorithm
Opis:
A spectrum defragmentation problem in elastic optical networks was considered under the assumption that all connections can be realized in switching nodes. But this assumption is true only when the switching fabric has appropriate combinatorial properties. In this paper, we consider a defragmentation problem in one architecture of wavelength-space-wavelength switching fabrics. First, we discuss the requirements for this switching fabric, below which defragmentation does not always end with success. Then, we propose defragmentation algorithms and evaluate them by simulation. The results show that proposed algorithms can increase the number of connections realized in the switching fabric and reduce the loss probability.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 1; 99-105
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Improved Method of Searching the Associative Rules while Developing the Software
Autorzy:
Savchuk, Tamara O.
Pryimak, Natalia V.
Slyusarenko, Nina V.
Smolarz, Andrzej
Smailova, Saule
Amirgaliyev, Yedilkhan
Powiązania:
https://bibliotekanauki.pl/articles/226118.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
software development
classification
C4.5 algorithm
associated rules
FPG-algorithm
Opis:
As the delivery of good quality software in time is a very important part of the software development process, it's a very important task to organize this process very accurately. For this, a new method of the searching associative rules were proposed. It is based on the classification of all tasks on three different groups, depending on their difficulty, and after this, searching associative rules among them, which will help to define the time necessary to perform a specific task by the specific developer.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 3; 425-430
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Is Swarm Intelligence Able to Create Mazes?
Autorzy:
Połap, D.
Woźniak, M.
Napoli, C.
Tramontana, E.
Powiązania:
https://bibliotekanauki.pl/articles/226726.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
computational intelligence
heuristic algorithm
Opis:
In this paper, the idea of applying Computational Intelligence in the process of creation board games, in particular mazes, is presented. For two different algorithms the proposed idea has been examined. The results of the experiments are shown and discussed to present advantages and disadvantages.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 4; 305-310
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ł:
Particle Swarm Optimization Algorithm for Leakage Power Reduction in VLSI Circuits
Autorzy:
Leela Rani, V.
Madhavi Latha, M.
Powiązania:
https://bibliotekanauki.pl/articles/225990.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
leakage power
PSO algorithm
genetic algorithm
minimum leakage vector
Verilog-HDL implementation
Opis:
Leakage power is the dominant source of power dissipation in nanometer technology. As per the International Technology Roadmap for Semiconductors (ITRS) static power dominates dynamic power with the advancement in technology. One of the well-known techniques used for leakage reduction is Input Vector Control (IVC). Due to stacking effect in IVC, it gives less leakage for the Minimum Leakage Vector (MLV) applied at inputs of test circuit. This paper introduces Particle Swarm Optimization (PSO) algorithm to the field of VLSI to find minimum leakage vector. Another optimization algorithm called Genetic algorithm (GA) is also implemented to search MLV and compared with PSO in terms of number of iterations. The proposed approach is validated by simulating few test circuits. Both GA and PSO algorithms are implemented in Verilog HDL and the simulations are carried out using Xilinx 9.2i. From the simulation results it is found that PSO based approach is best in finding MLV compared to Genetic based implementation as PSO technique uses less runtime compared to GA. To the best of the author’s knowledge PSO algorithm is used in IVC technique to optimize power for the first time and it is quite successful in searching MLV.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 2; 179-186
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An analysis of Chosen Image Formation Algorithms for Synthetic Aperture Radar with FMCW
Autorzy:
Okoń-Fąfara, M.
Serafin, P.
Kawalec, A.
Powiązania:
https://bibliotekanauki.pl/articles/227061.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
signal processing
synthetic aperture radar
time domain correlation
range-Doppler algorithm
range migration algorithm
Opis:
The modelling of FMCW SAR systems, due to long signal duration time, commonly used start-stop approximation for pulsed radars causes errors in the image. Continuous motion of the radar platform results in additional range-azimuth couplings and range walk term that should be considered in processing of signal from this type of radar. The paper presents an analysis of the following algorithms: Time Domain Correlation (TDC), Range Doppler Algorithm (RDA), and Range Migration Algorithm (RMA). The comparison of the algorithms is based on theoretical estimation of their computation complexity and the quality of images obtained on the basis of real signals of FMCW SAR systems.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 4; 323-328
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Automated Tablet Quality Assurance and Identification for Hospital Pharmacies
Autorzy:
Chaczko, Z.
Kale, A.
Powiązania:
https://bibliotekanauki.pl/articles/226463.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
hospital pharmacy
content error
genetic algorithm
Opis:
The tablet quality checking and identification in hospital pharmacies is done manually and does not use any automated solution. Manual sorting and handling makes this activity laborious and error-prone. This paper describes a low cost solution that is characterised by a small size of the infrastructure involved. Discussed are design and implementation details of Tablet Inspection System based on Machine Vision. The described process uses a dedicated sequence of operation to perform dispensing, scanning and sorting using mini factory setup. Machine Vision System uses a novel Genetic Evolution algorithm. The algorithm provides robust and scalable output. Due to its versatile nature and easy shape recognition ability the approach can be easily adapted to a large variety of medical tablets. The proposed solution attempts to follow the concept of single objective with multiple optima in GA that is designed to scan multiple number of tablets in one cycle of operation.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 2; 153-158
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
SIDH Hybrid Schemes with Classical Component Based on the Discrete Logarithm Problem over Finite Field Extension
Autorzy:
Wroński, Michał
Burek, Elżbieta
Dzierzkowski, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/226917.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
SIDH
Diffie-Hellman algorithm
hybrid schemes
Opis:
The concept of a hybrid scheme with connection of SIDH and ECDH is nowadays very popular. In hardware implementations it is convenient to use a classical key exchange algorithm, which is based on the same finite field as SIDH. Most frequently used hybrid scheme is SIDH-ECDH. On the other hand, using the same field as in SIDH, one can construct schemes over Fpn, like Diffie-Hellman or XTR scheme, whose security is based on the discrete logarithm problem. In this paper, idea of such schemes will be presented. The security of schemes, which are based on the discrete logarithm problem over fields Fp; Fp2 ; Fp4 ; Fp6 and Fp8 , for primes p used in SIDH, will be analyzed. At the end, the propositions of practical applications of these schemes will be presented.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 3; 431-441
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithm Based New Tone Reservation Method for Mitigating PAPR in OFDM Systems
Autorzy:
Saha, S.
Chakrabarty, S.
Bhattacharjee, S.
Sil, S.
Powiązania:
https://bibliotekanauki.pl/articles/963815.pdf
Data publikacji:
2017
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
BER
CCDF
OFDM
PAPR
tone reservation algorithm
Opis:
There are abundant methods to mitigate PAPR in OFDM signals among which algorithm based tone reservation is of great popularity owing to its low complexity as well as decent BER. Here we have put forward a new distinct algorithm based Tone Reservation technique which is not only less complex and calculates its own threshold as well as PRT signal (unlike other algorithms requiring predetermined threshold and PRT) but also aptly modifies the data by bit by bit comparison with a modified copy of itself (algorithm modified) thus scaling the peaks as and providing a decent BER and good PAPR reduction.
Źródło:
International Journal of Electronics and Telecommunications; 2017, 63, 3; 293-298
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Performance of Routing Algorithm Remote Operation in Cloud Environment for IoT Devices
Autorzy:
Faychuk, Valentyn
Lavriv, Orest
Strykhalyuk, Bohdan
Shpur, Olga
Demydov, Ivan
Bak, Roman
Powiązania:
https://bibliotekanauki.pl/articles/226643.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
routing algorithm
IoT
IoT device
cloud environment
Opis:
This paper proposes an advanced routing method in the purpose of increasing IoT routing device’s power-efficiency, which allows to centralize routing tables computing as well as to push loading, related to routing tables computation, towards the Cloud environment at all. We introduced a phased solution for the formulated task. Generally, next steps were performed: stated requirements for the system with Cloud routing, proposed possible solution, and developed the whole system’s structure. For a proper study of the efficiency, the experiment was conducted using the developed system’s prototype for real-life cases, each represents own cluster size (several topologies by each size), used sizes are: 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27 and 29. Expectable results for this research – decrease the time of cluster’s reaction on topology changes (delay, needed to renew routing tables), which improves system’s adaptivity.
Źródło:
International Journal of Electronics and Telecommunications; 2019, 65, 3; 367-373
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ł:
Embryonic Architecture with Built-in Self-test and GA Evolved Configuration Data
Autorzy:
Malhotra, Gayatri
Duraiswamy, Punithavathi
Kishore, J.K.
Powiązania:
https://bibliotekanauki.pl/articles/27311869.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
embryonic
BIST
Self-test
Genetic Algorithm
Cartesian Genetic Programming
Opis:
The embryonic architecture, which draws inspiration from the biological process of ontogeny, has built-in mechanisms for self-repair. The entire genome is stored in the embryonic cells, allowing the data to be replicated in healthy cells in the event of a single cell failure in the embryonic fabric. A specially designed genetic algorithm (GA) is used to evolve the configuration information for embryonic cells. Any failed embryonic cell must be indicated via the proposed Built-in Selftest (BIST) the module of the embryonic fabric. This paper recommends an effective centralized BIST design for a novel embryonic fabric. Every embryonic cell is scanned by the proposed BIST in case the self-test mode is activated. The centralized BIST design uses less hardware than if it were integrated into each embryonic cell. To reduce the size of the data, the genome or configuration data of each embryonic cell is decoded using Cartesian Genetic Programming (CGP). The GA is tested for the 1-bit adder and 2-bit comparator circuits that are implemented in the embryonic cell. Fault detection is possible at every function of the cell due to the BIST module’s design. The CGP format can also offer gate-level fault detection. Customized GA and BIST are combined with the novel embryonic architecture. In the embryonic cell, self-repair is accomplished via data scrubbing for transient errors.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 2; 211--217
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
K-Means and Fuzzy based Hybrid Clustering Algorithm for WSN
Autorzy:
Angadi, Basavaraj M.
Kakkasageri, Mahabaleshwar S.
Powiązania:
https://bibliotekanauki.pl/articles/27311955.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
wireless sensor networks
cluster
K-Means algorithm
fuzzy logic
Opis:
Wireless Sensor Networks (WSN) acquired a lot of attention due to their widespread use in monitoring hostile environments, critical surveillance and security applications. In these applications, usage of wireless terminals also has grown significantly. Grouping of Sensor Nodes (SN) is called clustering and these sensor nodes are burdened by the exchange of messages caused due to successive and recurring re-clustering, which results in power loss. Since most of the SNs are fitted with nonrechargeable batteries, currently researchers have been concentrating their efforts on enhancing the longevity of these nodes. For battery constrained WSN concerns, the clustering mechanism has emerged as a desirable subject since it is predominantly good at conserving the resources especially energy for network activities. This proposed work addresses the problem of load balancing and Cluster Head (CH) selection in cluster with minimum energy expenditure. So here, we propose hybrid method in which cluster formation is done using unsupervised machine learning based kmeans algorithm and Fuzzy-logic approach for CH selection.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 4; 793--801
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 41

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