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 86
Tytuł:
Minimal Decision Rules Based on the Apriori Algorithm
Autorzy:
Fernandez, M. C.
Menasalvas, E.
Marban, O.
Pena, J. M.
Millan, S.
Powiązania:
https://bibliotekanauki.pl/articles/908364.pdf
Data publikacji:
2001
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
baza danych
algorytmy
rough sets
rough dependencies
association rules
a priori algorithm
minimal decision rules
Opis:
Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more comprehensible (minimal) rule. Most of the algorithms that have been proposed to calculate minimal rules are based on rough set theory or machine learning. In our approach, in a post-processing stage, we apply the Apriori algorithm to reduce the decision rules obtained through rough sets. The set of dependencies thus obtained will help us discover irrelevant attribute values.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 691-704
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Combined classifier based on feature space partitioning
Autorzy:
Woźniak, M.
Krawczyk, B.
Powiązania:
https://bibliotekanauki.pl/articles/331294.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
rozpoznawanie wzorców
system klasyfikujący wielokrotny
algorytm grupowania
algorytm selekcji
algorytm ewolucyjny
pattern recognition
combined classifier
multiple classifier system
clustering algorithm
selection algorithm
evolutionary algorithm
Opis:
This paper presents a significant modification to the AdaSS (Adaptive Splitting and Selection) algorithm, which was developed several years ago. The method is based on the simultaneous partitioning of the feature space and an assignment of a compound classifier to each of the subsets. The original version of the algorithm uses a classifier committee and a majority voting rule to arrive at a decision. The proposed modification replaces the fairly simple fusion method with a combined classifier, which makes a decision based on a weighted combination of the discriminant functions of the individual classifiers selected for the committee. The weights mentioned above are dependent not only on the classifier identifier, but also on the class number. The proposed approach is based on the results of previous works, where it was proven that such a combined classifier method could achieve significantly better results than simple voting systems. The proposed modification was evaluated through computer experiments, carried out on diverse benchmark datasets. The results are very promising in that they show that, for most of the datasets, the proposed method outperforms similar techniques based on the clustering and selection approach.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 855-866
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The branch and bound algorithm for a backup virtual path assignment in survivable atm networks
Autorzy:
Walkowiak, K.
Powiązania:
https://bibliotekanauki.pl/articles/907991.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
automatyka
survivable networks
ATM
branch and bound algorithm
Opis:
Issues of network survivability are important, since users of computer networks should be provided with some guarantees of data delivery. A large amount of data may be lost in high-speed Asynchronous Transfer Mode (ATM) due to a network failure and cause significant economic loses. This paper addresses problems of network survivability. The characteristics of virtual paths and their influence on network restoration are examined. A new problem of Backup Virtual Path Routing is presented for the local-destination rerouting strategy. The function of the flow lost due to a failure of a single link is chosen as the performance index. The problem of finding the optimal virtual path assignment is NP-complete. Therefore we develop an exact algorithm based on the branch and bound approach. Moreover, two heuristic algorithms are proposed. Numerical results are presented.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 2; 257-267
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A modified K3M thinning algorithm
Autorzy:
Tabedzki, M.
Saeed, K.
Szczepański, A.
Powiązania:
https://bibliotekanauki.pl/articles/331149.pdf
Data publikacji:
2016
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
skeletonization
thinning algorithm
K3M algorithm
digital image processing
szkieletyzacja
pocienianie
algorytm K3M
cyfrowe przetwarzanie obrazu
Opis:
The K3M thinning algorithm is a general method for image data reduction by skeletonization. It had proved its feasibility in most cases as a reliable and robust solution in typical applications of thinning, particularly in preprocessing for optical character recognition. However, the algorithm had still some weak points. Since then K3M has been revised, addressing the best known drawbacks. This paper presents a modified version of the algorithm. A comparison is made with the original one and two other thinning approaches. The proposed modification, among other things, solves the main drawback of K3M, namely, the results of thinning an image after rotation with various angles.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2016, 26, 2; 439-450
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Genetic and combinatorial algorithms for optimal sizing and placement of active power filters
Autorzy:
Maciążek, M.
Grabowski, D.
Pasko, M.
Powiązania:
https://bibliotekanauki.pl/articles/330809.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
power quality
optimization
active power filter
harmonics
genetic algorithm
combinatorial algorithm
jakość energii
energetyczny filtr aktywny
algorytm genetyczny
algorytm kombinatoryczny
Opis:
The paper deals with cost effective compensator placement and sizing. It becomes one of the most important problems in contemporary electrical networks, in which voltage and current waveform distortions increase year-by-year reaching or even exceeding limit values. The suppression of distortions could be carried out by means of three types of compensators, i.e., passive filters, active power filters and hybrid filters. So far, passive filters have been more popular mainly because of economic reasons, but active and hybrid filters have some advantages which should cause their wider application in the near future. Active power filter placement and sizing could be regarded as an optimization problem. A few objective functions have been proposed for this problem. In this paper we compare solutions obtained by means of combinatorial and genetic approaches. The theoretical discussion is followed by examples of active power filter placement and sizing.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 2; 269-279
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A factor graph based genetic algorithm
Autorzy:
Helmi, B. H.
Rahmani, A. T.
Pelikan, M.
Powiązania:
https://bibliotekanauki.pl/articles/330811.pdf
Data publikacji:
2014
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
optimization problem
genetic algorithm
estimation
distribution algorithm
factor graph
matrix factorization
problem optymalizacji
algorytm genetyczny
algorytm estymacji rozkładu
faktoryzacja macierzy
Opis:
We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable problems are provided as support for the mathematical analysis of the approach. The experiments show that FGGA is capable of learning linkages and solving the optimization problems in polynomial time with a polynomial number of evaluations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 621-633
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An ANN-based scalable hashing algorithm for computational clouds with schedulers
Autorzy:
Tchórzewski, Jacek
Jakóbik, Agnieszka
Iacono, Mauro
Powiązania:
https://bibliotekanauki.pl/articles/2055176.pdf
Data publikacji:
2021
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
hashing algorithm
artificial neural network
scalable cryptography algorithm
computational cloud
task scheduler
algorytm haszowania
sztuczna sieć neuronowa
algorytm kryptograficzny
chmura obliczeniowa
Opis:
The significant benefits of cloud computing (CC) resulted in an explosion of their usage in the last several years. From the security perspective, CC systems have to offer solutions that fulfil international standards and regulations. In this paper, we propose a model for a hash function having a scalable output. The model is based on an artificial neural network trained to mimic the chaotic behaviour of the Mackey–Glass time series. This hashing method can be used for data integrity checking and digital signature generation. It enables constructing cryptographic services according to the user requirements and time constraints due to scalable output. Extensive simulation experiments are conduced to prove its cryptographic strength, including three tests: a bit prediction test, a series test, and a Hamming distance test. Additionally, flexible hashing function performance tests are run using the CloudSim simulator mimicking a cloud with a global scheduler to investigate the possibility of idle time consumption of virtual machines that may be spent on the scalable hashing protocol. The results obtained show that the proposed hashing method can be used for building light cryptographic protocols. It also enables incorporating the integrity checking algorithm that lowers the idle time of virtual machines during batch task processing.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2021, 31, 4; 697--712
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Recommendation systems with the quantum k-NN and Grover algorithms for data processing
Autorzy:
Sawerwain, Marek
Wróblewski, Marek
Powiązania:
https://bibliotekanauki.pl/articles/330538.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
quantum k-NN algorithm
recommendation system
Grover algorithm
big data
kwantowy algorytm k-NN
system rekomendujący
algorytm Grovera
duży zbiór danych
Opis:
In this article, we discuss the implementation of a quantum recommendation system that uses a quantum variant of the k-nearest neighbours algorithm and the Grover algorithm to search for a specific element in an unstructured database. In addition to the presentation of the recommendation system as an algorithm, the article also shows the main steps in construction of a suitable quantum circuit for realisation of a given recommendation system. The computational complexity of individual calculation steps in the recommendation system is also indicated. The verification of the correctness of the proposed system is analysed as well, indicating an algebraic equation describing the probability of success of the recommendation. The article also shows numerical examples presenting the behaviour of the recommendation system for two selected cases.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2019, 29, 1; 139-150
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards a linguistic description of dependencies in data
Autorzy:
Batyrshin, I.
Wagenknecht, M.
Powiązania:
https://bibliotekanauki.pl/articles/908041.pdf
Data publikacji:
2002
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
informatyka
fuzzy approximation
linguistic term
fuzzy rule
genetic algorithm
Opis:
The problem of a linguistic description of dependencies in data by a set of rules Rk: "If X is Tk then Y is Sk" is considered, where Tk's are linguistic terms like SMALL, BETWEEN 5 AND 7 describing some fuzzy intervals Ak. Sk's are linguistic terms like DECREASING and QUICKLY INCREASING describing the slopes pk of linear functions yk=pkx +qk approximating data on Ak. The decision of this problem is obtained as a result of a fuzzy partition of the domain X on fuzzy intervals Ak, approximation of given data {xi,yi}, i=1,...,n by linear functions yk=pkx+qk on these intervals and by re-translation of the obtained results into linguistic form. The properties of the genetic algorithm used for construction of the optimal partition and several methods of data re-translation are described. The methods are illustrated by examples, and potential applications of the proposed methods are discussed.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2002, 12, 3; 391-401
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Selected multicriteria shortest path problems: An analysis of complexity, models and adaptation of standard algorithms
Autorzy:
Tarapata, Z.
Powiązania:
https://bibliotekanauki.pl/articles/929638.pdf
Data publikacji:
2007
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
problem najkrótszej ścieżki
złożoność algorytmu
algorytm aproksymacji
multiobjective shortest path
stochastic shortest path
algorithm complexity
routing problem
terrain-based modeling
approximation algorithm
Opis:
The paper presents selected multicriteria (multiobjective) approaches to shortest path problems. A classification of multiobjective shortest path (MOSP) problems is given. Different models of MOSP problems are discussed in detail. Methods of solving the formulated optimization problems are presented. An analysis of the complexity of the presented methods and ways of adapting of classical algorithms for solving multiobjective shortest path problems are described. A comparison of the effectiveness of solving selected MOSP problems defined as mathematical programming problems (using the CPLEX 7.0 solver) and multi-weighted graph problems (using modified Dijkstra’s algorithm) is given. Experimental results of using the presented methods for multicriteria path selection in a terrain-based grid network are given.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2007, 17, 2; 269-287
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Exact approaches to late work scheduling on unrelated machines
Autorzy:
Liu, Xinbo
Wang, Wen
Chen, Xin
Sterna, Malgorzata
Blazewicz, Jacek
Powiązania:
https://bibliotekanauki.pl/articles/11542692.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
late work scheduling
unrelated machine
mathematical model
branch algorithm
bound algorithm
dynamic programming
planowanie pracy
model matematyczny
algorytm podziału
algorytm ograniczeń
programowanie dynamiczne
Opis:
We consider the scheduling problem on unrelated parallel machines in order to minimize the total late work. Since the problem is NP-hard, we propose a mathematical model and two dedicated exact approaches for solving it, based on the branching and bounding strategy and on enumerating combined with a dynamic programming algorithm. The time efficiencies of all three approaches are evaluated through computational experiments.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 2; 285--295
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A study on meme propagation in multimemetic algorithms
Autorzy:
Nogueras, R.
Cotta, C.
Powiązania:
https://bibliotekanauki.pl/articles/329698.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
memetic algorithm
spatial structure
meme propagation
algorytm memetyczny
struktura przestrzenna
Opis:
Multimemetic algorithms (MMAs) are a subclass of memetic algorithms in which memes are explicitly attached to genotypes and evolve alongside them. We analyze the propagation of memes in MMAs with a spatial structure. For this purpose we propose an idealized selecto-Lamarckian model that only features selection and local improvement, and study under which conditions good, high-potential memes can proliferate. We compare population models with panmictic and toroidal grid topologies. We show that the increased takeover time induced by the latter is essential for improving the chances for good memes to express themselves in the population by improving their hosts, hence enhancing their survival rates. Experiments realized with an actual MMA on three different complex pseudo-Boolean functions are consistent with these findings, indicating that memes are more successful in a spatially structured MMA, rather than in a panmictic MMA, and that the performance of the former is significantly better than that of its panmictic counterpart.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2015, 25, 3; 499-512
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Robust Dynamic Input Reconstruction for Delay Systems
Autorzy:
Kappel, F.
Maksimov, V.
Powiązania:
https://bibliotekanauki.pl/articles/911173.pdf
Data publikacji:
2000
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system opóźniania
obserwacja
delay system
input reconstruction
observation
robust algorithm
Opis:
A problem of reconstruction of a non-observable control input for a system with a time delay is analyzed within the framework of the dynamical input reconstruction approach (see Kryazhimskii and Osipov, 1987; Osipov and Kryazhimskii, 1995; Osipov et al., 1991). In (Maksimov, 1987; 1988) methods of dynamical input reconstruction were described for delay systems with fully observable states. The present paper provides an input reconstruction algorithm for partially observable systems. The algorithm is robust to the observation perturbations.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2000, 10, 2; 283-307
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
GrDBSCAN: A granular density-based clustering algorithm
Autorzy:
Suchy, Dawid
Siminski, Krzysztof
Powiązania:
https://bibliotekanauki.pl/articles/15548018.pdf
Data publikacji:
2023
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
granular computing
DBSCAN
clustering algorithm
GrDBSCAN
przetwarzanie ziarniste
algorytm grupowania
Opis:
Density-based spatial clustering of applications with noise (DBSCAN) is a commonly known and used algorithm for data clustering. It applies a density-based approach and can produce clusters of any shape. However, it has a drawback-its worst-case computational complexity is O(n2) with regard to the number of data items n. The paper presents GrDBSCAN: a granular modification of DBSCAN with reduced complexity. The proposed GrDBSCAN first granulates data into fuzzy granules and then runs density-based clustering on the resulting granules. The complexity of GrDBSCAN is linear with regard to the input data size and higher only for the number of granules. That number is, however, a parameter of the GrDBSCAN algorithm and is (significantly) lower than that of input data items. This results in shorter clustering time than in the case of DBSCAN. The paper is accompanied by numerical experiments. The implementation of GrDBSCAN is freely available from a public repository.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2023, 33, 2; 297--312
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Derivation of physically motivated constraints for efficient interval simulations applied to the analysis of uncertain dynamical systems
Autorzy:
Freihold, M.
Hofer, E. P.
Powiązania:
https://bibliotekanauki.pl/articles/930126.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
system Hamiltona
algorytm rozgałęzienia
system dynamiczny
VALENCIA-IVP
consistency tests for the reduction of overestimation
identification of dynamical constraints
Hamiltonian systems
branch algorithm
prune algorithm
Opis:
Interval arithmetic techniques such as VALENCIA-IVP allow calculating guaranteed enclosures of all reachable states of continuous-time dynamical systems with bounded uncertainties of both initial conditions and system parameters. Considering the fact that, in naive implementations of interval algorithms, overestimation might lead to unnecessarily conservative results, suitable consistency tests are essential to obtain the tightest possible enclosures. In this contribution, a general framework for the use of constraints based on physically motivated conservation properties is presented. The use of these constraints in verified simulations of dynamical systems provides a computationally efficient procedure which restricts the state enclosures to regions that are physically eaningful. A branch and prune algorithm is modified to a consistency test, which is based on these constraints. Two application scenarios are studied in detail. First, the total energy is employed as a conservation property for the analysis of mechanical systems. It is shown that conservation properties, such as the energy, are applicable to any Hamiltonian system. The second scenario is based on constraints that are derived from decoupling properties, which are considered for a high-dimensional compartment model of granulopoiesis in human blood cell dynamics.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 3; 485-499
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-15 z 86

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