Filters
total: 3778
-
Catalog
displaying 1000 best results Help
Search results for: SEPARABLE ALGORITHM
-
Adaptive Algorithm for Interactive Question-based Search
PublicationPopular web search engines tend to improve the relevanceof their result pages, but the search is still keyword-oriented and far from "understanding" the queries' meaning. In the article we propose an interactive question-based search algorithm that might come up helpful for identifying users' intents. We describe the algorithm implemented in a form of a questions game. The stress is put mainly on the most critical aspect of this...
-
Interactive Information Retrieval Algorithm for Wikipedia Articels
PublicationThe article presents an algorithm for retrieving textual information in documents collection. The algorithm employs a category system that organizers the repository and using interaction with user improves search precision. The algorithm was implemented for simple English Wikipedia and the first evaluation results indicates the proposed method can help to retrieve information from large document repositories.
-
Hardware realization of shadow detection algorithm in FPGA
PublicationW referacie opisano problem detekcji cieni w sekwencjach wideo. Na podstawie metod znanych z literatury opracowano algorytm detekcji cieni, działający w czasie rzeczywistym i przeznaczony do realizacji sprzętowej w układzie FPGA. Algorytmy zostały przetestowane i porównane w środowisku MATLAB. Za pomocą języka VHDL zrealizowano system detekcji cieni wykorzystujący opracowany algorytm i zaimplementowano go w układzie Virtex-4. Został...
-
An EIT reconstruction algorithm based on noisy data.
PublicationPraca przedstawia algorytm rekonstrukcji oparty o zmodyfikowany algorytm Gaussa - Newtona. Algorytm uwzględnia istnienie elektrod pomiarowych w tomografii elektroimpedancyjnej. Elektrody charakteryzują się rozmiarem i impedancją. Dodatkowo algorytm zakłada istnienie szumu w sygnale mierzonym. Zostało pokazane, że dobór optymalnego wzorca pobudzenia znacząco poprawia odporność algorytmu rekonstrukcyjnego na szum w danych. Dwie...
-
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.
-
Measuring Tilt with an IMU Using the Taylor Algorithm
PublicationThis article addresses the important problem of tilt measurement and stabilization. This is particularly important in the case of drone stabilization and navigation in underwater environments, multibeam sonar mapping, aerial photogrammetry in densely urbanized areas, etc. The tilt measurement process involves the fusion of information from at least two different sensors. Inertial sensors (IMUs) are unique in this context because...
-
Adversarial attack algorithm for traffic sign recognition
PublicationDeep learning suffers from the threat of adversarial attacks, and its defense methods have become a research hotspot. In all applications of deep learning, intelligent driving is an important and promising one, facing serious threat of adversarial attack in the meanwhile. To address the adversarial attack, this paper takes the traffic sign recognition as a typical object, for it is the core function of intelligent driving. Considering...
-
Multicriteria Evolutionary Weather Routing Algorithm in Practice
PublicationThe Multicriteria Evolutionary Weather Routing Algorithm (MEWRA) has already been introduced by the author on earlier TransNav 2009 and 2011 conferences with a focus on theoretical application to a hybrid-propulsion or motor-driven ship. This paper addresses the topic of possible practical weather routing applications of MEWRA. In the paper some practical advantages of utilizing Pareto front as a result of multicriteria optimization...
-
A New Cluster-based Instance Selection Algorithm
Publication -
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.
-
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...
-
Implementation of power transformer controlled switching algorithm
PublicationThe article presents two new algorithms of controlled switching the power transformer. The main aim of the paper is to obtain formulas that determine the moments of closing of the circuit breaker poles. The study contains projects of control systems for both algorithms. Mathematical formulas for the time instants of the breaker poles closing were developed on the basis of electric circuit theory and magnetic circuit theory. The...
-
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...
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our 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.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
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.
-
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...
-
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...
-
Enhanced removal of hexavalent chromium from aqueous media using a highly stable and magnetically separable rosin-biochar-coated TiO2@C nanocomposite
Publication -
A Compact Circularly Polarized Antenna With Directional Pattern for Wearable Off-Body Communications
PublicationThis letter presents a geometrically simple and compact circularly polarized (CP) antenna with unidirectional radiation characteristics for off-body communications. The proposed antenna is based on a microstrip line monopole extension from a coplanar waveguide (CPW) and a protruded stub from one side of the coplanar ground plane along the length of the monopole. The orthogonal components of equal amplitudes required for circular...
-
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 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).
-
On the EM algorithm for the estimation of speech AR parameters in noise
Publication -
A Backtracking Search Algorithm for Distribution Network Reconfiguration Problem
Publication -
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 -
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...
-
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...
-
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....
-
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...
-
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...
-
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.
-
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...
-
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...
-
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...
-
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...
-
Octave Error Immune and Instantaneous Pitch Detection Algorithm.
PublicationCelem publikacji jest prezentacja odpornego na błędy oktawowe, bazującego na analizie widmowej algorytmu detekcji częstotliwości podstawowej. Zaproponowana metoda dobrze sobie radzi z sygnałami o dużej zawartości sygnałów harmonicznych, jak i z prawie sinusoidalnymi przebiegami. Eksperymenty przeprowadzonno na 567 dzwiękach instrumentów muzycznych. Dźwięki grane były z różnymi artykulacjami, dynamiką i reprezentowałe były w całej...
-
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.
-
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.