Filters
total: 4893
filtered: 3924
-
Catalog
Chosen catalog filters
displaying 1000 best results Help
Search results for: BISECTION ALGORITHM
-
Pareto Ranking Bisection Algorithm for Expedited Multi-Objective Optimization of Antenna Structures
PublicationThe purpose of this letter is introduction of a novel methodology for expedited multi-objective design of antenna structures. The key component of the presented approach is fast identification of the initial representation of the Pareto front (i.e., a set of design representing the best possible trade-offs between conflicting objectives) using a Pareto-ranking bisection algorithm. The algorithm finds a discrete set of Pareto-optimal...
-
EM-Driven Multi-Objective Design of Impedance Transformers By Pareto Ranking Bisection Algorithm
PublicationIn the paper, the problem of fast multi-objective optimization of compact impedance matching transformers is addressed by utilizing a novel Pareto ranking bisection algorithm. It approximates the Pareto front by dividing line segments connecting the designs found in the previous iterations, and refining the obtained candidate solutions by means of poll-type search involving Pareto ranking. The final Pareto set is obtained using...
-
Low-Cost Multi-Objective Optimization of Antennas By Means Of Generalized Pareto Ranking Bisection Algorithm
PublicationThis paper introduces a generalized Pareto ranking bisection algorithm for low-cost multi-objective design optimization of antenna structures. The algorithm allows for identifying a set of Pareto optimal sets of parameters (that represent the best trade-offs between considered objectives) by iterative partitioning of the intervals connecting previously found designs and executing a Pareto-ranking-based poll search. The initial...
-
Pareto Ranking Bisection Algorithm for EM-Driven Multi-Objective Design of Antennas in Highly-Dimensional Parameter Spaces
PublicationA deterministic technique for fast surrogate-assisted multi-objective design optimization of antennas in highly-dimensional parameters spaces has been discussed. In this two-stage approach, the initial approximation of the Pareto set representing the best compromise between conflicting objectives is obtained using a bisection algorithm which finds new Pareto-optimal designs by dividing the line segments interconnecting previously...
-
Performance comparison of new modified gradient algorithm and Foy algorithm for iterative position calculation
PublicationIn the paper a new position calculation algorithm is presented. It is proposed for indoor environments and is called modified gradient algorithm. This algorithm is compared with well-known Foy algorithm. The comparative analysis is based on real distance measurements conducted in indoor environment.
-
Evolutional algorithm in stock control
Publication -
Superresolution algorithm to video surveillance system
PublicationAn application of a multiframe SR (superresolution) algorithm applied to video monitoring is described. The video signal generated by various types of video cameras with different parameters and signal distortions which may be very problematic for superresolution algorithms. The paper focuses on disadvantages in video signal which occur in video surveillance systems. Especially motion estimation and its influence on superresolution...
-
Homology algorithm based on acyclic subspace
Publication -
An efficient algorithm for finding ideal schedules
PublicationPodejmujemy problem szeregowania zadań jednostkowych z zadanymi czasamy przybycia i zależnościami kolejnościowymi. Uszeregowanie jest idealne jeśli jednocześnie minimalizuje maksymalny oraz średni czas zakończenia zadania. Podajemy przyklad pokazujący, że uszeregowania idealne nie istnieją dla relacji zależności zadań będącej drzewem, gdy dopuścimy możliwość wystąpienia przerwań. Z drugiej strony podajemy algorytm o złożoności...
-
Clonal selection algorithm for vehicle routing
PublicationOver the years several successful computing techniques have been inspired by biological mechanisms. Studies of the mechanisms that allow the immune systems of vertebratesto adapt and learn have resulted in a class of algorithms called artificial immune systems. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents...
-
On Algorithm Details in Multibeam Seafloor Classification
PublicationRemote sensing of the seafloor constitutes an important topic in exploration, management, protection and other investigations of the marine environment. In the paper, a combined approach to seafloor characterisation is presented. It relies on calculation of several descriptors related to seabed type using three different types of multibeam sonar data obtained during seafloor sensing, viz.: 1) the grey-level sonar images (echograms)...
-
Point cloud unification with optimization algorithm
PublicationTerrestrial laser scanning is a technology that enables to obtain three-dimensional data – an accurate representation of reality. During scanning not only desired objects are measured, but also a lot of additional elements. Therefore, unnecessary data is being removed, what has an impact on efficiency of point cloud processing. It can happen while single point clouds are displayed – user decides what he wants...
-
An efficient incremental DFA minimization algorithm
PublicationW tym artykule przedstawiamy nowy algorytm minimalizacji deterministycznego automatu skończonego. Algorytm jest przyrostowy - może być zatrzymany w dowolnym momencie, dając częściowo zminimalizowany automat. Wszystkie inne (znane) algorytmy minimalizacji dają wyniki pośrednie nieprzydatne dla częściowej minimalizacji. Ponieważ pierwszy algorytm jest łatwo zrozumiały ale mało wydajny, rozważamy trzy praktyczne, znaczące usprawnienia....
-
Backprojection algorithm for current mode EIT.
PublicationW pracy przedstawiono algorytm rekonstrukcyjny dla TEI wykorzystujący informację o rozpływie prądu pomiędzy elektrody pomiarowe zwarte do potencjału wspólnego. Pokazano, że algorytm jest analogiczny do znanego wcześniej algorytmu określanego jako Backprojection. Przedstawiono przykładowe wyniki rekonstrukcji dla obiektu kołowego.
-
Flow Control Algorithm for UMTS HSDPA
PublicationHSDPA (High Speed Downlink Packet Access) jest istotnym etapem ewolucji systemu UMTS. Pozwala na transmisję do użytkownika z prędkością dochodzącą do 14.4 Mbit/s; aby to umożliwić, wprowadzono w wersji 5 UMTS szereg nowych mechanizmów w warstwie fizycznej oraz MAC. W tej pracy przedstawiono szczegółową analizę jednego z nowych mechanizmów - algorytmu kontroli natężenia ruchu między MAC-hs i MAC-d. Zaproponowano nowy, efektywny...
-
Simplified algorithm for location service for the UMTS
PublicationPrzedstawiono uproszczony algorytm lokalizowania terminala ruchomego w systemie UMTS. Algorytm ten umożliwia wyznaczanie pozycji geograficznej terminala ruchomego bez znajomości różnic czasowych w synchronizacji stacji bazowych RTD (Relative Time Differences). Opisany został model symulacyjny oraz przedstawiono wyniki efektywności lokalizowania terminala ruchomego w środowisku tzw. złym miejskim. otrzymane rezultaty dowodzą, że...
-
Million dollar algorithn?
PublicationArtykuł w sposób popularnonaukowy porusza następujące problemy:- 2300 lat algorytmiki- 7 problemów milenijnych- rodzaje problemów pod kątem złożoności obliczeniowej- planowanie optymalne- banki i grafy- czy P=NP?
-
Continuous Optimisation Algorithms
PublicationKsiążka poświęcona jest zagadnieniom optymalizacji ciągłej. Oprócz klasycznych algorytmów gradientowych omawiane są w współczesne algorytmy bezgradientowe, które stosowane są z powodzeniem w optymalizacji globalnej. Większość prezentowanych algorytmów określona może być mianem metaheurystycznych. Zaliczyć do nich można metody optymalizacji inspirowane procesami zachodzącymi w przyrodzie, które dalej można dzielić na inspirowane...
-
Generalized Pareto ranking bisection for computationally feasible multi-objective antenna optimization
PublicationMulti-objective optimization (MO) allows for obtaining comprehensive information about possible design trade-offs of a given antenna structure. Yet, executing MO using the most popular class of techniques, population-based metaheuristics, may be computationally prohibitive when full-wave EM analysis is utilized for antenna evaluation. In this work, a low-cost and fully deterministic MO methodology is introduced. The proposed generalized...
-
A better practical algorithm for distributed graph coloring
Publication -
The smallest hard-to-color graph for algorithm DSATUR
Publication -
The smallest hard-to-color graph for the SL algorithm
Publication -
Efficient Algorithm for Microarray Probes Re-annotation
Publication -
An Efficient Algorithm for Microarray Probes Re-annotation
Publication -
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ł...
-
Evaluation of the separation algorithm performance employing ANNs
PublicationCelem niniejszego rozdziału jest przedstawienie metodyki separacji dźwięków muzycznych bez informacji a priori o dźwiękach zawartych w muzycznym miksie. W pracy pokazano, że prawidłowo wytrenowana sztuczna sieć neuronowa (SNN)jest w stanie w sposób automatyczny poprawnie sklasyfikować dźwięki zawarte w zmiksowanym sygnale. Skuteczność klasyfikacji SNN jest porównywalna z oceną subiektywną ekspertów.
-
Termination functions for evolutionary path planning algorithm
PublicationIn this paper a study of termination functions (stop criterion) for 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. Five...
-
An Improved Genetic Algorithm for Island Route Planning
Publication -
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...
-
Context Search Algorithm for Lexical Knowledge Acquisition
PublicationA Context Search algorithm used for lexical knowledge acquisition is presented. Knowledge representation based on psycholinguistic theories of cognitive processes allows for implementation of a computational model of semantic memory in the form of semantic network. A knowledge acquisition using supervised dialog templates have been performed in a word game designed to guess the concept a human user is thinking about. The game,...
-
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.
-
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.
-
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...
-
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...
-
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.
-
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.
-
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...
-
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.
-
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.
-
Distributed graph searching with a sense of direction
PublicationIn this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function w provides for each vertex v the minimum number of searchers required to guard v, i.e., the fugitive may not pass through v without being detected only if at least w(v) searchers are present at v. This problem is a generalization of the classical edge searching problem, in which one has...
-
Measurements of electron scattering in the backward direction
PublicationPrzedstawiono wyniki badań rozproszenia elektronów na atomach i cząsteczkach przeprowadzonych w zakresie dużych kątów rozproszenia do 180o.
-
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,...
-
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...
-
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...
-
Regarding to functional outcomes after extracapsular dissection with partial facial nerve dissection for small and large parotid neoplasms
Publication