Search
Filters
total: 3681
-
Catalog
displaying 1000 best results Help
Search results for: FIREFLY ALGORITHM
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
Marking the Allophones Boundaries Based on the DTW Algorithm
PublicationThe paper presents an approach to marking the boundaries of allophones in the speech signal based on the Dynamic Time Warping (DTW) algorithm. Setting and marking of allophones boundaries in continuous speech is a difficult issue due to the mutual influence of adjacent phonemes on each other. It is this neighborhood on the one hand that creates variants of phonemes that is allophones, and on the other hand it affects that the border...
-
Complementary oriented allocation algorithm for cloud computing
PublicationNowadays cloud computing is one of the most popular processing models. More and more different kinds of workloads have been migrated to clouds. This trend obliges the community to design algorithms which could optimize the usage of cloud resources and be more effiient and effective. The paper proposes a new model of workload allocation which bases on the complementarity relation and analyzes it. An example of a case of use is shown...
-
New Indoor Positioning Algorithm for Distance Measurements
PublicationIn the paper a new indoor positioning algorithm is presented. This algorithm takes into account selected features of radio wave propagation in indoor environment. This results in improvement in accuracy of calculated position estimates. A comparative analysis of this new algorithm with Chan and Foy algorithms was made and described in the paper. This comparative analysis was made with utilization of real radio distance measurements.
-
Distributed largest-first algorithm for graph coloring.
PublicationW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
Self-stabilizing algorithm for edge-coloring of graphs
PublicationReferat ten poświęcony jest kolorowaniu grafów w modelu rozproszonym.Podano samostabilizujący się algorytm kolorowania krawędzi grafu wraz z dowodem poprawności oraz oszacowaniem jego czasu działania.
-
Finite-window RLS algorithms
PublicationTwo recursive least-squares (RLS) adaptive filtering algorithms are most often used in practice, the exponential and sliding (rectangular) window RLS algorithms. This popularity is mainly due to existence of low-complexity versions of these algorithms. However, these two windows are not always the best choice for identification of fast time-varying systems, when the identification performance is most important. In this paper, we...
-
Subspace Algorithms for Face Verification
PublicationW rzeczywistych zastosowaniach problem weryfikacji wydaje się ważniejszy od klasyfikacji. Na ogół dysponujemy jedynie niewielkim zbiorem obrazów uczących reprezentujących daną osobę, a naszym zadaniem jest podjęcie decyzji odnośnie tego, czy nowo pozyskana fotografia jest do nich wystarczająco podobna - bez użycia oddzielnego zbioru przykładów negatywnych. W takim przypadku uzasadnione wydaje się zastosowanie metody podprzestrzeni,...
-
Algorithms for testing security in graphs
PublicationIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
A study of nighttime vehicle detection algorithms
Open Research DataThis dataset is from my master's thesis "A study of nighttime vehicle detection algorithms". It contains both raw data and preprocessed dataset ready to use. In the pictures below you can see how images were annotated.
-
An Agent-Based Simulated Annealing Algorithm for Data Reduction
Publication -
Data Reduction Algorithm for Machine Learning and Data Mining
Publication -
A New Heuristic Algorithm for Effective Preemption in MPLS Networks
PublicationW artykule opisano nowy algorytm wywłaszczania przeznaczony dla sieci MPLS. Umożliwia on alokację zasobów sieci dla nowej ścieżki uwzględniając koszt usuniętych jednej lub wielu istniejących już ścieżek. Proponowany heurystyczny algorytm wybiera ścieżki do wywłaszczenia wykorzystując informację o topologii sieci. Używa funkcji optymalizacji minimalizującej stratę pasma na poziomie sieci. Przedstawiono i omówiono wyniki badań symulacyjnych...
-
An approximation algorithm for maximum P3-packing in subcubic graphs
PublicationW pracy podano algorytm 4/3-przyliżony dla trudnego obliczeniowo problemu umieszczania wierzchołkowo rozłącznych dwukrawędziowych ścieżek w grafach o stopniu maksymalnym 3 i stopniu minimalnym 2. Poprawiono tym samym wcześniejsze wyniki dla grafów kubicznych (A. Kelmans, D. Mubayi, Journal of Graph Theory 45, 2004).
-
An efficient algorithm for mobile guarded guards in simple grids
PublicationW pracy rozważono problem strzeżenia ortogonalnych krat dwuwymiarowych przez mobilne straże strzeżone. Podano algorytmy wielomianowe m.in. dla przypadku krat prostych i dla przypadku krat bez przeszkód w kierunku poziomym (pionowym).
-
A linear time algorithm for edge coloring of binomial trees
Publication -
A polynomial algorithm for finding T-span of generalized cacti
Publication -
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
Publication -
A new optimal algorithm for a time-dependent scheduling problem
PublicationIn this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs j_1, ..., j_n and the processing time pi of the i-th job is given by p_i = 1 + b_is_i, where si is the starting time of the i-th job, i = 1, ..., n. If all jobs have different and non-zero deterioration rates and bi > bj => bi >= (b_min+1)/(b_min) b_j + 1/b_min, where b_min = min{b_i}, then...
-
Ontology clustering by directions algorithm to expand ontology queries
PublicationThis paper concerns formulating ontology queries. It describes existing languages in which ontologies can be queried. It focuses on languages which are intended to be easily understood by users who are willing to retrieve information from ontologies. Such a language can be, for example, a type of controlled natural language (CNL). In this paper a novel algorithm called Ontology Clustering by Directions is presented. The algorithm...
-
A Backtracking Search Algorithm for Distribution Network Reconfiguration Problem
Publication -
On the EM algorithm for the estimation of speech AR parameters in noise
Publication -
Evolutionary Algorithm for Selecting Dynamic Signatures Partitioning Approach
PublicationIn the verification of identity, the aim is to increase effectiveness and reduce involvement of verified users. A good compromise between these issues is ensured by dynamic signature verification. The dynamic signature is represented by signals describing the position of the stylus in time. They can be used to determine the velocity or acceleration signal. Values of these signals can be analyzed, interpreted, selected, and compared....
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Parameters of evolutionary algorithm in problem of collision avoidance at sea
Publication...
-
A polynomial algorithm for finding T-span of generalized cacti.
PublicationW pracy opisano wielomianowy algorytm wyznaczający optymalne T-pokolorowania dla uogólnionych kaktusów.
-
an intelligent image processing sensor - the algorithm and the hardware implementation
PublicationW artykule przedstawiono algorytm przeznaczony do rozpoznawania obiektów ruchomych w obrazie do celu analizy ruchu pojazdów. Algorytm został zrealizowany w układzie FPGA.Ang.: This paper describes the idea and theimplementation of the robust algorithm dedicated toextraction of moving vehicles from real-time cameraimages for the evaluation of traffic parameters, suchas the number of vehicles, their direction of movementand their...
-
Implementation of matrix-type FDTD algorithm on a graphics accelerator
PublicationArtykuł prezetuje implementację algorytmu FDTD w postaci macierzowej przeznaczonej dla kart graficznych. Wykazany został wzrost efektywności obliczeń numerycznych w odniesieniu do implementacji przeznaczonej dla procesora komputerowego.
-
Lexicon Based Algorithm for Domain Ontology Merging and Alignment
PublicationMore and more systems contain some kind of knowledge describing their field of operation. Such knowledge in many cases is stored as an ontology. A need arises for ability to quickly match those ontologies to enable interoperability of such systems. The paper presents a lexicon based algorithm for merging and aligning of OWL ontologies. The proposed similarity levels are being presented and the proposed algorithm is being described....
-
Comparison of new position estimation algorithm for indoor environment
PublicationIn the paper a new position estimation algorithm based on distance measurements is presented. This algorithm is dedicated for indoor environments. In the paper the new algorithm is compared with Chan algorithm. For the comparison were used real measurements conducted inside a building.
-
Information Retrieval with the Use of Music Clustering by Directions Algorithm
PublicationThis paper introduces the Music Clustering by Directions (MCBD) algorithm. The algorithm is designed to support users of query by humming systems in formulating queries. This kind of systems makes it possible to retrieve songs and tunes on the basis of a melody recorded by the user. The Music Clustering by Directions algorithm is a kind of an interactive query expansion method. On the basis of query, the algorithm provides suggestions...
-
Impact of Initial Population on Evolutionary Path Planning Algorithm
PublicationIn this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal ship paths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Four tests are performed....
-
AN ALGORITHM FOR PORTAL HYPERTENSIVE GASTROPATHY RECOGNITION ON THE ENDOSCOPIC RECORDINGS
PublicationSymptoms recognition of portal hypertensive gastropathy (PHG) can be done by analysing endoscopic recordings, but manual analysis done by physician may take a long time. This increases probability of missing some symptoms and automated methods may be applied to prevent that. In this paper a novel hybrid algorithm for recognition of early stage of portal hypertensive gastropathy is proposed. First image preprocessing is described....
-
COMPARISON OF SOFTWARE AND HARDWARE REALIZATION OF AES CRYPTOGRAPHIC ALGORITHM
PublicationIn this paper hardware and software realization of direct and inverse AES cryptographic algorithm is presented. Both implementations were made using the Virtex-II FPGA and were practically tested. As the criteria of comparison, the resource utilization, achieved performance and power dissipation were chosen. Hardware realization increases throughput of conversion about 190 times over software implementation and decreases the energy...
-
Complex Root Finding Algorithm Based on Delaunay Triangulation
PublicationA simple and flexible algorithm for finding zeros of a complex function is presented. An arbitrary-shaped search region can be considered and a very wide class of functions can be analyzed, including those containing singular points or even branch cuts. The proposed technique is based on sampling the function at nodes of a regular or a self-adaptive mesh and on the analysis of the function sign changes. As a result, a set of candidate points...
-
Novel 5.1 Downmix Algorithm with Improved Dialogue Intelligibility
PublicationA new algorithm for 5.1 to stereo downmix is introduced, which addresses the problem of dialogue intelligibility. The algorithm utilizes proposed signal processing algorithms to enhance the intelligibility of movie dialogues, especially in difficult listening conditions or in compromised speaker setup. To account for the latter, a playback configuration utilizing a portable device, i.e. an ultrabook, is examined. The experiments...
-
Distributed Evolutionary Algorithm for Path Planning in Navigation Situation
PublicationThis article presents the use of a multi-population distributed evolutionary algorithm for path planning in navigation situation. The algorithm used is with partially exchanged population and migration between independently evolving populations. In this paper a comparison between a multi-population and a classic single-population algorithm takes place. The impact on the ultimate solution has been researched. It was shown that using...
-
Robust unsupervised georeferencing algorithm for aerial and satellite imagery
PublicationIn order to eliminate a human factor and fully automate the process of embedding the spatial localization information in a remote sensed image the integrated georeferencing method was proposed. The paper presents this unsupervised and robust approach which is comprised of pattern recognition, using SIFT-based detector, and RANSAC based outlier removal with matching algorithm.
-
Interactive Query Expansion with the Use of Clustering by Directions Algorithm
PublicationThis paper concerns Clustering by Directions algorithm. The algorithm introduces a novel approach to interactive query expansion. It is designed to support users of search engines in forming web search queries. When a user executes a query, the algorithm shows potential directions in which the search can be continued. This paper describes the algorithm and it presents an enhancement which reduces the computational complexity of...
-
Voice command recognition using hybrid genetic algorithm
PublicationAbstract: Speech recognition is a process of converting the acoustic signal into a set of words, whereas voice command recognition consists in the correct identification of voice commands, usually single words. Voice command recognition systems are widely used in the military, control systems, electronic devices, such as cellular phones, or by people with disabilities (e.g., for controlling a wheelchair or operating a computer...
-
FFT spectrum based matching algorithm for activedynamic thermography
PublicationIn Active Dynamic thermography (ADT) sequences of consecutive temperature distributions are analyzed. In biomedical applications of ADT, the problems of a patient's movements in front of a thermal camera should be eliminated before data analysis. Complete mechanical stabilization of the patients is impossible due to natural voluntary and involuntary moves caused by pulse breathing, etc. This paper presents a simple and efficient...
-
Robust algorithm for active feedback control of narrowband noise
PublicationThe problem of active control of narrowband acoustic noise is considered. It is shown that the proposed earlier feedback control algorithm called SONIC (self-optimizing narrowband interference canceller), based on minimization of the L2-norm performance measure, can be re-derived using the L1 approach. The resulting robust SONIC algorithm is more robust to heavy-tailed measurement noise, such as the αlpha-stable noise, than the...
-
Impact of Initial Population on Evolutionary Path Planning Algorithm
PublicationIn this paper an impact of initial population on evolutionary path planning algorithm is presented. Tested algorithm is used to determine close to optimal shippaths in collision avoidance situation. For this purpose a path planning problem is defined. A specific structure of the individual path and fitness function is presented. For the simulation purposes a close to real tested environment is created. Four tests are performed....
-
APPLICATION OF APRIORI ALGORITHM IN THE LAMINATION PROCESS IN YACHT PRODUCTION
PublicationThe article specifies the dependence of defects occurring in the lamination process in the production of yachts. Despite great knowledge about their genesis, they cannot be completely eliminated. Authentic data obtained through cooperation with one of the Polish yacht shipyards during the years 2013–2017 were used for the analysis. To perform a simulation, the sample size was observed in 1450 samples, consisting of 6 models of...
-
A comparative study of English viseme recognition methods and algorithm
PublicationAn elementary visual unit – the viseme is concerned in the paper in the context of preparing the feature vector as a main visual input component of Audio-Visual Speech Recognition systems. The aim of the presented research is a review of various approaches to the problem, the implementation of algorithms proposed in the literature and a comparative research on their effectiveness. In the course of the study an optimal feature vector...
-
The algorithm of building the hierarchical contextual framework of textual corpora
PublicationThis paper presents an approach for Modeling the Latent Semantic Relations. The approach is based on advantages of two computational approaches: Latent Semantic Analysis and Latent Dirichlet Allocation. The scientific question about the possibility of reducing the influence of these Methods limitation on the Quality of the Latent Semantic Relations Analysis Results is raised. The case study for building the Two-level Hierarchical Contextual...
-
DEVELOPMENT OF THE ALGORITHM OF POLISH LANGUAGE FILM REVIEWS PREPROCESSING
PublicationThe algorithm and the software for conducting the procedure of Preprocessing of the reviews of films in the Polish language were developed. This algorithm contains the following steps: Text Adaptation Procedure; Procedure of Tokenization; Procedure of Transforming Words into the Byte Format; Part-of-Speech Tagging; Stemming / Lemmatization Procedure; Presentation of Documents in the Vector Form (Vector Space Model) Procedure; Forming...
-
Genetic algorithm for fatique crack detection in Timoshenko beam.
PublicationW pracy przedstawiono metodę detekcji peknięć zmęczeniowych w początkowej fazie ich rozwoju. Algorytm detekcji wykorzystuje metodę algorytmów genetycznych połączoną z metodą gradientową. Funkcja celu oparta została o zmiany w propagujacej fali sprężystej.
-
An efficient algorithm for the longest tandem scattered subsequence problem.
PublicationReferat dotyczy zagadnienia wyznaczania najdłuższego podciągu podwójnego (typu x1,x2,...,xk,x1,x2,...,xk) dla zadanego ciągu znaków (y1,y2,...,yn). Podano algorytm o złożoności obliczeniowej O(n^2) i pamięciowej O(n) znajdujący optymalne rozwiązanie postawionego problemu.
-
The cartographer algorithm for processing and querying description logics ontologies
PublicationLogika opisowa jest jednym z najbardziej popularnych formalizmów opisu wiedzy. Jej popularność jeszcze wzrosła kiedy pojawił się standard języka OWL. W artykule zaprezentowano nowy algorytm wnioskowania - algorytm kartograficzny - umożliwiający wnioskowanie niejawnie podanej wiedzy z terminologii (TBox) i opisu świata (ABox). Opisano sposób przetwarzania ontologii w terminach sygnatur binarnych i efektywny sposób odpytywania ontologii...