Filtry
wszystkich: 12363
wybranych: 10689
-
Katalog
- Publikacje 10689 wyników po odfiltrowaniu
- Czasopisma 42 wyników po odfiltrowaniu
- Konferencje 64 wyników po odfiltrowaniu
- Osoby 133 wyników po odfiltrowaniu
- Wynalazki 1 wyników po odfiltrowaniu
- Projekty 5 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 81 wyników po odfiltrowaniu
- Wydarzenia 13 wyników po odfiltrowaniu
- Dane Badawcze 1334 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: CHAN ALGORITHM
-
An Agent-Based Simulated Annealing Algorithm for Data Reduction
Publikacja -
Data Reduction Algorithm for Machine Learning and Data Mining
Publikacja -
A New Heuristic Algorithm for Effective Preemption in MPLS Networks
PublikacjaW 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...
-
Parameters of evolutionary algorithm in problem of collision avoidance at sea
Publikacja...
-
A polynomial algorithm for finding T-span of generalized cacti.
PublikacjaW pracy opisano wielomianowy algorytm wyznaczający optymalne T-pokolorowania dla uogólnionych kaktusów.
-
Genetic algorithm for fatique crack detection in Timoshenko beam.
PublikacjaW 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 ALGORITHM FOR PORTAL HYPERTENSIVE GASTROPATHY RECOGNITION ON THE ENDOSCOPIC RECORDINGS
PublikacjaSymptoms 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....
-
Impact of Initial Population on Evolutionary Path Planning Algorithm
PublikacjaIn 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....
-
An efficient algorithm for the longest tandem scattered subsequence problem.
PublikacjaReferat 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
PublikacjaLogika 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.
PublikacjaCelem 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...
-
A linear time algorithm for edge coloring of binomial trees
Publikacja -
A polynomial algorithm for finding T-span of generalized cacti
Publikacja -
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
Publikacja -
APPLICATION OF APRIORI ALGORITHM IN THE LAMINATION PROCESS IN YACHT PRODUCTION
PublikacjaThe 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
PublikacjaAn 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...
-
A Backtracking Search Algorithm for Distribution Network Reconfiguration Problem
Publikacja -
Novel 5.1 Downmix Algorithm with Improved Dialogue Intelligibility
PublikacjaA 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
PublikacjaThis 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...
-
COMPARISON OF SOFTWARE AND HARDWARE REALIZATION OF AES CRYPTOGRAPHIC ALGORITHM
PublikacjaIn 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
PublikacjaA 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
PublikacjaThe 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...
-
The algorithm of building the hierarchical contextual framework of textual corpora
PublikacjaThis 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
PublikacjaThe 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...
-
On the EM algorithm for the estimation of speech AR parameters in noise
Publikacja -
Comparison of new position estimation algorithm for indoor environment
PublikacjaIn 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
PublikacjaThis 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
PublikacjaIn 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....
-
Interactive Query Expansion with the Use of Clustering by Directions Algorithm
PublikacjaThis 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
PublikacjaIn 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
PublikacjaIn 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...
-
Voice command recognition using hybrid genetic algorithm
PublikacjaAbstract: 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...
-
Lexicon Based Algorithm for Domain Ontology Merging and Alignment
PublikacjaMore 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....
-
an intelligent image processing sensor - the algorithm and the hardware implementation
PublikacjaW 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
PublikacjaArtykuł 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.
-
An approximation algorithm for maximum P3-packing in subcubic graphs
PublikacjaW 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
PublikacjaW 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 new optimal algorithm for a time-dependent scheduling problem
PublikacjaIn 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
PublikacjaThis 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...
-
Evolutionary Algorithm for Selecting Dynamic Signatures Partitioning Approach
PublikacjaIn 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
PublikacjaDominating 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...
-
Proximal primal–dual best approximation algorithm with memory
PublikacjaWe propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...
-
Comparative Analysis of microRNA-Target Gene Interaction Prediction Algorithms - The Attempt to Compare the Results of Three Algorithms
Publikacja -
Prototype selection algorithms for distributed learning
Publikacja -
Iterative Algorithms for Multilayer Optimizing Control
PublikacjaMonografia przedstawia struktury, koncepcje i algorytmy dla wielowarstwowego sterowania optymalizującego procesami przemysłowymi będące w przeważającym stopniu wynikiem badań prowadzonych przez jej autorów. Metodologie i algorytmy sterowania są starannie ilustrowane wynikami symulacji dla wybranych przykładowych systemów. Oprócz tego przedstawione są zastosowania do realnych obiektów przemysłowych: kolumny destylacyjnej etyliny,...
-
Comparison and Analysis of Service Selection Algorithms
PublikacjaIn Service Oriented Architecture, applications are developed by integration of existing services in order to reduce development cost and time. The approach, however, requires algorithms that select appropriate services out of available, alternative ones. The selection process may consider both optimalization requirements, such as maximalization of performance, and constraint requirements, such minimal security or maximum development...
-
New Algorithms for Adaptive Notch Smoothing
PublikacjaThe problem of extraction/elimination of a nonstationary complex sinusoidal signal buried in noise is considered. This problem is usually solved using adaptive notch filtering (ANF)algorithms. It is shown that accuracy of signal estimation can be increased if the results obtained from ANF are further processed using a cascade of appropriately designed filters. The resulting adaptive notch smoothing (ANS) algorithms can be employed...
-
Extinction Event Concepts for the Evolutionary Algorithms
PublikacjaThe main goal of this present paper is to propose a structure for a tool helping to determine how algorithm would react in a real live application, by checking it's adaptive capabilities in an extreme situation. Also a different idea of an additional genetic operator is being presented. As Genetic Algorithms are directly inspired by evolution, extinction events, which are elementary in our planet's development history, became...
-
Interoperability Constraints in Service Selection Algorithms
PublikacjaIn Service Oriented Architecture, composite applications are developed by integration of existing, atomic services that may be available in alternative versions realizing the same functionality but having different Quality of Service (QoS) attributes. The development process requires effective service selection algorithms that balance profits and constraints of QoS attributes. Additionally, services operate in a heterogeneous environment,...
-
Evolutionary Algorithms in MPLS network designing
PublikacjaMPLS technology become more and more popular especially in core networks giving great flexibility and compatibility with existing Internet protocols. There is a need to optimal design such networks and optimal bandwidth allocation. Linear Programming is not time efficient and does not solve nonlinear problems. Heuristic algorithms are believed to deal with these disadvantages and the most promising of them are Evolutionary Algorithms....