Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "A* algorithm" wg kryterium: Wszystkie pola


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ł:
AH Method: a Novel Routine for Vicinity Examination of the Optimum Found with a Genetic Algorithm
Autorzy:
Piętak, Daniel Andrzej
Bilski, Piotr
Napiorkowski, Paweł Jan
Powiązania:
https://bibliotekanauki.pl/articles/2200688.pdf
Data publikacji:
2022
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
heuristics
evolutionary computations
genetic algorithms
uncertainty estimation
parameter study
Opis:
The paper presents a novel heuristic procedure (further called the AH Method) to investigate function shape in the direct vicinity of the found optimum solution. The survey is conducted using only the space sampling collected during the optimization process with an evolutionary algorithm. For this purpose the finite model of point-set is considered. The statistical analysis of the sampling quality based upon the coverage of the points in question over the entire attraction region is exploited. The tolerance boundaries of the parameters are determined for the user-specified increase of the objective function value above the found minimum. The presented test-case data prove that the proposed approach is comparable to other optimum neighborhood examination algorithms. Also, the AH Method requires noticeably shorter computational time than its counterparts. This is achieved by a repeated, second use of points from optimization without additional objective function calls, as well as significant repository size reduction during preprocessing.
Źródło:
International Journal of Electronics and Telecommunications; 2022, 68, 4; 695--708
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Smart Substation Network Fault Classification Based on a Hybrid Optimization Algorithm
Autorzy:
Xia, Xin
Liu, Xiaofeng
Lou, Jichao
Powiązania:
https://bibliotekanauki.pl/articles/227220.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
smart substation
network fault classification
improved separation interval method (ISIM)
support vector
machine (SVM)
Anti-noise processing (ANP)
Opis:
Accurate network fault diagnosis in smart substations is key to strengthening grid security. To solve fault classification problems and enhance classification accuracy, we propose a hybrid optimization algorithm consisting of three parts: anti-noise processing (ANP), an improved separation interval method (ISIM), and a genetic algorithm-particle swarm optimization (GA-PSO) method. ANP cleans out the outliers and noise in the dataset. ISIM uses a support vector machine (SVM) architecture to optimize SVM kernel parameters. Finally, we propose the GA-PSO algorithm, which combines the advantages of both genetic and particle swarm optimization algorithms to optimize the penalty parameter. The experimental results show that our proposed hybrid optimization algorithm enhances the classification accuracy of smart substation network faults and shows stronger performance compared with existing methods.
Źródło:
International Journal of Electronics and Telecommunications; 2019, 65, 4; 657-663
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A reactive algorithm for deducing nodal forwarding behavior in a multihop ad-hoc wireless network in the presence of errors
Autorzy:
Rydzewski, Karol
Konorski, Jerzy
Powiązania:
https://bibliotekanauki.pl/articles/225979.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
ad hoc
networks
reputation
errors
Opis:
A novel algorithm is presented to deduce individual nodal forwarding behavior from standard end-to-end acknowledgments. The algorithm is based on a well-established mathematical method and is robust to network related errors and nodal behavior changes. The proposed solution was verified in a network simulation, during which it achieved sound results in a challenging multihop ad-hoc network environment.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 1; 193-199
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Audio Compression using a Modified Vector Quantization algorithm for Mastering Applications
Autorzy:
Prince, Shajin
D, Bini
Kirubaraj, Alfred A.
Immanuel, Samson J.
M, Surya
Powiązania:
https://bibliotekanauki.pl/articles/27311916.pdf
Data publikacji:
2023
Wydawca:
Polska Akademia Nauk. Czasopisma i Monografie PAN
Tematy:
vector quantization
scalable
perceptual coder
audio mastering
bit stream
Opis:
Audio data compression is used to reduce the transmission bandwidth and storage requirements of audio data. It is the second stage in the audio mastering process with audio equalization being the first stage. Compression algorithms such as BSAC, MP3 and AAC are used as standards in this paper. The challenge faced in audio compression is compressing the signal at low bit rates. The previous algorithms which work well at low bit rates cannot be dominant at higher bit rates and vice-versa. This paper proposes an altered form of vector quantization algorithm which produces a scalable bit stream which has a number of fine layers of audio fidelity. This modified form of the vector quantization algorithm is used to generate a perceptually audio coder which is scalable and uses the quantization and encoding stages which are responsible for the psychoacoustic and arithmetical terminations that are actually detached as practically all the data detached during the prediction phases at the encoder side is supplemented towards the audio signal at decoder stage. Therefore, clearly the quantization phase which is modified to produce a bit stream which is scalable. This modified algorithm works well at both lower and higher bit rates. Subjective evaluations were done by audio professionals using the MUSHRA test and the mean normalized scores at various bit rates was noted and compared with the previous algorithms.
Źródło:
International Journal of Electronics and Telecommunications; 2023, 69, 2; 287--292
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A New Downlink Scheduling Algorithm Proposed for Real Time Traffic in LTE System
Autorzy:
Mahfoudi, M.
EL Bekkali, M.
Najid, S.
Mazer, S.
EL Ghazi, M.
Powiązania:
https://bibliotekanauki.pl/articles/227115.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
QoS
real-time traffic
scheduling strategies
Opis:
The Third Generation Partnership Project (3GPP) has developed a new cellular standard based packet switching allowing high data rate, 100 Mbps in Downlink and 50 Mbps in Uplink, and having the flexibility to be used in different bandwidths ranging from 1.4 MHz up to 20 MHz, this standard is termed LTE (Long Term Evolution). Radio Resource Management (RRM) procedure is one of the key design roles for improving LTE system performance, Packet scheduling is one of the RRM mechanisms and it is responsible for radio resources allocation, However, Scheduling algorithms are not defined in 3GPP specifications. Therefore, it gets a track interests for researchers. In this paper we proposed a new LTE scheduling algorithm and we compared its performances with other well known algorithms such as Proportional Fairness (PF), Modified Largest Weighted Delay First (MLWDF), and Exponential Proportional Fairness (EXPPF) in downlink direction. The simulation results shows that the proposed scheduler satisfies the quality of service (QoS) requirements of the real-time traffic in terms of packet loss ratio (PLR), average throughput and packet delay. This paper also discusses the key issues of scheduling algorithms to be considered in future traffic requirements.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 4; 409-414
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Spectral Subtraction Based Algorithm for Real-time Noise Cancellation with Application to Gunshot Acoustics
Autorzy:
Ramos, A. L. L.
Holm, S.
Gudvangen, S.
Otterlei, R.
Powiązania:
https://bibliotekanauki.pl/articles/226624.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
gunshot acoustics
noise cancellation
spectral suppression
counter sniper systems
Opis:
This paper introduces an improved spectral subtraction based algorithm for real-time noise cancellation, applied to gunshot acoustical signals. The derivation is based on the fact that, in practice, relatively long periods without gunshot signals occur and the background noise can be modeled as being short-time stationary and uncorrelated to the impulsive gunshot signals. Moreover, gunshot signals, in general, have a spiky autocorrelation while typical vehicle noise, or related, is periodic and exhibits a wider autocorrelation. The Spectral Suppression algorithm is applied using the pre-filtering approach, as opposed to post-filtering which requires a priori knowledge of the direction of arrival of the signals of interest, namely, the Muzzle blast and the Shockwave. The results presented in this work are based on a dataset generated by combining signals from real gunshots and real vehicle noise.
Źródło:
International Journal of Electronics and Telecommunications; 2013, 59, 1; 93-98
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Minimum-Spanning-Tree-Inspired Algorithm for Channel Assignment in 802.11 Networks
Autorzy:
Dolińska, I.
Jakubowski, M.
Masiukiewicz, A.
Rządkowski, G.
Piórczyński, K.
Powiązania:
https://bibliotekanauki.pl/articles/226434.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
channel selection
channel assignment
802.11 home networks
greedy algorithm
Opis:
Channel assignment in 2.4 GHz band of 802.11 standard is still important issue as a lot of 2.4 GHz devices are in use. This band offers only three non-overlapping channels, so in crowded environment users can suffer from high interference level. In this paper, a greedy algorithm inspired by the Prim’s algorithm for finding minimum spanning trees (MSTs) in undirected graphs is considered for channel assignment in this type of networks. The proposed solution tested for example network distributions achieves results close to the exhaustive approach and is, in many cases, several orders of magnitude faster.
Źródło:
International Journal of Electronics and Telecommunications; 2016, 62, 4; 379-388
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Novel Tracing Algorithm vs Remcom Wireless InSite
Autorzy:
Gotszald, Ł.
Powiązania:
https://bibliotekanauki.pl/articles/963894.pdf
Data publikacji:
2015
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
Ray Tracing
radio wave propagation modelling
Opis:
Results of comparison between a popular commercial software for radio wave propagation modeling versus prototype implementation of a novel algorithm proposed by the author of this paper is discussed. It is shown that both algorithms lead to very similar results while the new one is faster by a few orders of magnitude.
Źródło:
International Journal of Electronics and Telecommunications; 2015, 61, 3; 273-279
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Algorithm for Target Tracking Using Passive Radar
Autorzy:
Malanowski, M.
Powiązania:
https://bibliotekanauki.pl/articles/226412.pdf
Data publikacji:
2012
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
passive coherent location
passive bistatic radar
target tracking
Opis:
In the paper the problem of target tracking in passive radar is addressed. Passive radar measures bistatic parameters of a target: bistatic range and bistatic velocity. The aim of the tracking algorithm is to convert the bistatic measurements into Cartesian coordinates. In the paper a two-stage tracking algorithm is presented, using bistatic and Cartesian tracking. In addition, a target localization algorithm is applied to initialize Cartesian tracks from bistatic measurements. The tracking algorithm is tested using simulated and real data. The real data were obtained from an FM-based passive radar called PaRaDe, developed at Warsaw University of Technology.
Źródło:
International Journal of Electronics and Telecommunications; 2012, 58, 4; 345-350
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Development and Analysis of Symmetric Encryption Algorithm Qamal Based on a Substitution-permutation Network
Autorzy:
Biyashev, Rustem G.
Kapalova, Nursulu A.
Dyusenbayev, Dilmuhanbet S.
Algazy, Kunbolat T.
Wojcik, Waldemar
Smolarz, Andrzej
Powiązania:
https://bibliotekanauki.pl/articles/1844594.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
encryption
cryptanalysis
S-box
SP-network
avalanche effect
statistical property
Opis:
This paper represents a developed cryptographic information protection algorithm based on a substitution permutation network. We describe the cryptographic transformations used in the developed algorithm. One of the features of the algorithm is the simplicity of its modification with regard to different security levels. The algorithm uses a predeveloped S-box tested against differential and linear cryptanalysis. The S-box is consistent with one of the known standards AES and GOST R 34.12-2015. We provide the findings of an avalanche-effect investigation and statistical properties of ciphertexts. The algorithm actually meets the avalanche-effect criterion even after the first round.
Źródło:
International Journal of Electronics and Telecommunications; 2021, 67, 1; 127-132
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ł:
Numerical Implementation of the Fictitious Domain Method for Elliptic Equations
Autorzy:
Temirbekov, A. N.
Wójcik, W.
Powiązania:
https://bibliotekanauki.pl/articles/226820.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
elliptic equation
Dirichlet problem
equation with rapidly varying coefficients
computational algorithm
iterative process
fictitious domain method
boundary conditions
Opis:
In this paper, we consider an elliptic equation with strongly varying coefficients. Interest in the study of these equations is connected with the fact that this type of equation is obtained when using the fictitious domain method. In this paper, we propose a special method for the numerical solution of elliptic equations with strongly varying coefficients. A theorem is proved for the rate of convergence of the iterative process developed. A computational algorithm and numerical calculations are developed to illustrate the effectiveness of the proposed method.
Źródło:
International Journal of Electronics and Telecommunications; 2014, 60, 3; 219-223
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Available Bandwidth and RSRP Based Handover Algorithm for LTE/LTE-Advanced Networks Tested in LTE-Sim Simulator
Autorzy:
Angri, Ismail
Najid, Abdellah
Mahfoudi, Mohammed
Powiązania:
https://bibliotekanauki.pl/articles/226002.pdf
Data publikacji:
2019
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
mobility management
handover
LTE
lte-sim
available bandwidth
RSRP
Opis:
In this paper, we propose a new algorithm that improves the performance of the operation of Handover (HO) in LTE-Advanced (LTE-A) networks. As recognized, Mobility Management (MM) is an important pillar in LTE/LTE-A systems to provide high quality of service to users on the move. The handover algorithms define the method and the steps to follow to ensure a reliable transfer of the UEs from one cell to another without interruption or degradation of the services offered by the network. In this paper, the authors proposed a new handover algorithm for LTE/LTE-A networks based on the measurement and calculation of two important parameters, namely the available bandwidth and the Received Power (RSRP) at the level of eNodeBs. The proposed scheme named LTE Available Bandwidth and RSRP Based Handover Algorithm (LABRBHA) was tested in comparison with well-known algorithms in the literature as the LHHA, LHHAARC and the INTEGRATOR scheme using the open source simulator LTE-Sim. Finally, the network performances were investigated via three indicators: the number of lost packets during the handover operation, the latency as well as the maximum system throughput. The results reported that our algorithm shows remarkable improvements over other transfer schemes.
Źródło:
International Journal of Electronics and Telecommunications; 2019, 65, 1; 85-93
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Ɵ(1) Time Algorithm for Master Selection in Ad-hoc Wireless Networks
Autorzy:
Khattabi, Mohammed
Elmesbahi, Jelloul
Khaldoun, Mohammed
Errami, Ahmed
Bouattane, Omar
Powiązania:
https://bibliotekanauki.pl/articles/226674.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
cluster-based networks
cluster head selection
ad-hoc networks
wireless sensors networks
SDR
USRP
simulink
Opis:
This paper details a hardware implementation of a distributed Ɵ(1) time algorithm allows to select dynamically the master device in ad-hoc or cluster-based networks in a constant time regardless the number of devices in the same cluster. The algorithm allows each device to automatically detect its own status; master or slave; based on identifier without adding extra overheads or exchanging packets that slow down the network. We propose a baseband design that implements algorithm functions and we detail the hardware implementation using Matlab/Simulink and Ettus B210 USRP. Tests held in laboratory prove that algorithm works as expected.
Źródło:
International Journal of Electronics and Telecommunications; 2020, 66, 3; 521-527
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł

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