Wyszukiwarka
Filtry
wszystkich: 4850
-
Katalog
- Publikacje 3598 wyników po odfiltrowaniu
- Czasopisma 16 wyników po odfiltrowaniu
- Konferencje 5 wyników po odfiltrowaniu
- Osoby 51 wyników po odfiltrowaniu
- Projekty 3 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Kursy Online 54 wyników po odfiltrowaniu
- Wydarzenia 3 wyników po odfiltrowaniu
- Dane Badawcze 1119 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: RESOLVING SETS
-
Solving Multi-Ship Encounter Situations by Evolutionary Sets of Cooperating Trajectories
PublikacjaAutor zaproponował nowe podejście do sytuacji kolizyjnych na morzu. Polega ono na zastąpieniu ewolucyjnej trajektorii własnej ewolucyjnym zbiorem trajektorii wszystkich obiektów. Podejście to umożliwia predykcję manewrowania obiektów obcych przy jednoczesnym zachowaniu efektywności algorytmów ewolucyjnych. Dodatkowo, opracowany już wstępnie przez autorów zbiór kryteriów, ograniczeń i operatorów specjalizowanych powinien zapewnić...
-
Neutrosophic Sets and Systems
Czasopisma -
Towards eddy-resolving models of the Arctic Ocean
Publikacja -
NOTES on INTUITIONISTIC FUZZY SETS
Czasopisma -
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Resolving conflicts in object tracking for automatic detection of events in video
PublikacjaW referacie przedstawiono algorytm rozwiązywania konfliktów w śledzeniu obiektów ruchomych. Proponowana metoda wykorzystuje predykcję stanu obiektu obliczaną przez filtry Kalmana oraz dopasowuje wykryte obiekty do struktur śledzących ich ruch na podstawie deskryptorów koloru i tekstury. Omówiono specyficzne sytuacje powodujące konflikty, takie jak rozdzielanie obiektów. Przedstawiono wyniki testów. Algorytm może być zastosowany...
-
Resolving conflicts in object tracking for automatic detection of events in video
PublikacjaAn algorithm for resolving conflicts in tracking of moving objects is presented. The proposed approach utilizes predicted states calculated by Kalman filters for estimation of trackers position, then it uses color and texture descriptors in order to match moving objects with trackers. Problematic situations, such as splitting objects, are addressed. Test results are presented and discussed. The algorithm may be used in the system...
-
Evolutionary Sets of Safe Ship Trajectories
Publikacja -
Mobile mutual-visibility sets in graphs
PublikacjaGiven a connected graph G, the mutual-visibility number of G is the cardinality of a largest set S such that for every pair of vertices x, y ∈ S there exists a shortest x, y-path whose interior vertices are not contained in S. Assume that a robot is assigned to each vertex of the set S. At each stage, one robot can move to a neighbouring vertex. Then S is a mobile mutual-visibility set of G if there exists a sequence of moves of...
-
Developing sets of experience knowledge structure
PublikacjaW pracy omówiono zasady tworzenia opisu zwanego zbiorem doświadczeń tworzonego w celu reprezentacji wiedzy
-
Minimal 2-dominating sets in Trees
PublikacjaWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3247^n). This leads to that every tree has at most 1.3247^n minimal 2-dominating sets. We also show that thisbound is tight.
-
Minimal double dominating sets in trees
PublikacjaWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
On proper (1,2)‐dominating sets in graphs
PublikacjaIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
Reconfiguring Minimum Dominating Sets in Trees
PublikacjaWe provide tight bounds on the diameter of γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. In particular, we prove that for any tree T of order n ≥ 3, the diameter of its γ-graph is at most n/2 in the single vertex replacement adjacency model, whereas in the slide adjacency model, it is at most 2(n − 1)/3. Our proof is constructive, leading to a simple linear-time algorithm for determining...
-
Resolving Selected Problems in Surface Topography Analysis by Application of the Autocorrelation Function
Publikacja -
Acoustic verification on onomatopoeic sets in contrastive approach
Publikacja -
Acoustic verification on onomatopoeic sets in contrastive approach
Publikacja -
Clothing sets with thermoregulation function for mine rescuers
Publikacja -
Accoustic verification of onomatopoeic sets in contrastive approach
PublikacjaPraca relacjonuje efekty prób wykorzystania technik cyfrowego przetwarzania sygnału mowy dla zaspokojenia specyficznych potrzeb nauk humanistycznych, które, ograniczając się wyłącznie do tra-dycyjnie stosowanego warsztatu badawczego, napotykają współcześnie na bariery znacznie blokują-ce oczekiwany postęp. Omówiono proces badawczy, który służyć ma językoznawcom dokonującym porównań wyrażeń dźwiękonaśladowczych odnajdywanych w odmiennych...
-
Analyzing sets of phylogenetic trees using metrics
PublikacjaThe reconstruction of evolutionary trees is one of the primary objectives in phylogenetics. Such a tree represents historical evolutionary relationships between different species or organisms. Tree comparisons are used for multiple purposes, from unveiling the history of species to deciphering evolutionary associations among organisms and geographical areas. In this paper, we describe a general method for comparing phylogenetictrees...
-
Trees having many minimal dominating sets
PublikacjaWe provide an algorithm for listing all minimal dominating sets of a tree of order n in time O(1.4656^n). This leads to that every tree has at most 1.4656^n minimal dominating sets. We also give an infinite family of trees of odd and even order for which the number of minimal dominating sets exceeds 1.4167^n, thus exceeding 2^{n/2}. This establishes a lower bound on the running time of an algorithm for listing all minimal dominating...
-
A remark on singular sets of vector bundle morphisms
PublikacjaIf characteristic classes for two vector bundles over the same base space do not coincide, then the bundles are not isomorphic. We give under rather common assumptions a lower bound on the topological dimension of the set of all points in the base over which a morphism between such bundles is not bijective. Moreover, we show that this set is topologically non-trivial.
-
Rough Sets Applied to Mood of Music Recognition
PublikacjaWith the growth of accessible digital music libraries over the past decade, there is a need for research into automated systems for searching, organizing and recommending music. Mood of music is considered as one of the most intuitive criteria for listeners, thus this work is focused on the emotional content of music and its automatic recognition. The research study presented in this work contains an attempt to music emotion recognition...
-
Generalized Dold sequences on partially-ordered sets
PublikacjaDold sequences constitute an important class of integer sequences that play an important role in combinatorics, number theory, topology and dynamical systems. We generalize the notion of Dold sequence for the case of partially ordered sets and describe their properties. In particular we give two alternative descriptions of generalized Dold sequences: by some class of elementary sequences as well as by different...
-
FUZZY SETS AND SYSTEMS
Czasopisma -
Resolving Conflicts in Object Tracking in Video Stream Employing Key Point Matching
PublikacjaA novel approach to resolving ambiguous situations in object tracking in video streams is presented. The proposed method combines standard tracking technique employing Kalman filters with global feature matching method. Object detection is performed using a background subtraction algorithm, then Kalman filters are used for object tracking. At the same time, SURF key points are detected only in image sections identified as moving...
-
Multi-armed jets: A subset of the blooming jets
Publikacja -
Journal of Problem Solving
Czasopisma -
Structural stability of invariant sets of vibro-impact systems
Publikacja -
Evolutionary Sets of Safe Ship Trajectories: development of the method
PublikacjaThe Evolutionary Sets of Safe Ship Trajectories is a method solving ship encounter situations. The method combines evolutionary approach to planning ship trajectory with some of the assumption of game theory. For given positions and motion parameters the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The version presented here is an updated one and its authors have tested extensively...
-
Evolutionary Sets of Safe Ship Trajectories: simulation results
PublikacjaThe Evolutionary Sets of Safe Ship Trajectories is a method solving multi-ship encounter situations. For given positions and motion parameters the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The paper briefly presents foundations of the method and focuses on simulation results for selected test cases based on the Baltic Basin. The computer simulations cover both open waters and restricted...
-
Evolutionary Sets of Cooperating Ship Trajectories: COLREGS Compliance
PublikacjaThe paper presents a newly designed improvement to the method of solving multi-ship encounter situations. In general, the method combines some of the assumptions of game theory with evolutionary programming and aims to find optimal set of cooperating trajectories of all ships involved in an encounter situation. The improvement presented here is a new way of modelling some of the COLREGS rules. Due to this change, the method is...
-
Customized crossover in evolutionary sets of safe ship trajectories
PublikacjaThe paper presents selected aspects of evolutionary sets of safe ship trajectories-a method which applies evolutionary algorithms and some of the assumptions of game theory to solving ship encounter situations. For given positions and motion parameters of the ships, the method finds a near optimal set of safe trajectories of all ships involved in an encounter. The method works in real time and the solutions must be returned within...
-
Evolutionary Sets of Safe Ship Trajectories: Evaluation of Individuals
PublikacjaThe paper presents a description of the evaluation phase of the Evolutionary Sets of Safe Ship Trajectories method. In general, the Evolutionary Sets of Safe Ship Trajectories method combines some of the assumptions of game theory with evolutionary programming and finds an optimal set of cooperating trajectories of all ships involved in an encounter situation. While developing a new version of this method, the authors decided to...
-
Evolutionary Sets of Safe Ship Trajectories: Evaluation of Individuals
PublikacjaThe paper presents a description of the evaluation phase of the Evolutionary Sets of Safe Ship Trajectories method. In general, the Evolutionary Sets of Safe Ship Trajectories method combines some of the assumptions of game theory with evolutionary programming and finds an optimal set of cooperating trajectories of all ships involved in an encounter situation. While developing a new version of this method, the au-thors decided...
-
COLREGS compliance in Evolutionary Sets of Cooperating Ship Trajectories
PublikacjaIn general, Evolutionary Sets of Cooperating Ship Trajectories combine some of the assumptions of game theory with evolutionary programming and aim to find optimal set of cooperating trajectoriesof all ships involved in an encounter situation. In a two-ship encounter situation the method enables the operator of an on-board collision-avoidance system to predict the most probable behaviour of atarget and to plan the own manoeuvres...
-
Application of Intuitionistic Fuzzy Sets to the assessment of technical university students
PublikacjaThe article proposes application of artificial intelligence methods to assess students of technical universities. The level of achieved educational goals can be assessed using measurements based on the idea of Fuzzy Intuitionistic Sets (IFS). A classification algorithm was developed and an exemplary distribution of the criteria values using IFS was presented. The application of the proposed approach in online education can enrich...
-
Computer animation system based on rough sets and fuzzy logic
PublikacjaA fuzzy logic inference system was created, based on the analysis of animated motion features. The objective of the system is to facilitate the creation of high quality animation by analyzing personalized styles contained in numerous animations. Sequences portraying a virtual character acting with a differentiating personalized style (natural or exaggerated) and various levels of fluidity were prepared and subjectively evaluated....
-
Reproducibility of Finding Enriched Gene Sets in Biological Data Analysis
Publikacja -
Two Approaches to Constructing Certified Dominating Sets in Social Networks
PublikacjaSocial networks are an important part of our community. In this context, certified dominating sets help to find in networks a group of people, referring as officials, such that 1) for each civilian, there is an official that can serve the civilian, and 2) no official is adjacent to exactly one civilian, to prevent potential abuses. To delve deeper into this topic, this study considers two approaches to the problem of finding certified...
-
Research on wave structures containing sets of metallized cylindrical objects
PublikacjaCel pracy obejmował opracowanie modelu matematycznego opartego na bezpośredniej interpretacji fizycznej rozpraszania fali elektromagnetycznej w zamkniętych i otwartych systemach zawierających różne konfiguracje złożonych obiektów cylindrycznych. Kolejnym celem było zastosowanie otrzymanego modelu do badania problemów otwartych i zamkniętych, oraz zaproponowanie przykładów ich aplikacji. Tezą pracy było stwierdzenie, że istnieje...
-
Automatic Singing Voice Recognition EmployingNeural Networks and Rough Sets
PublikacjaCelem badań jest automatyczne rozpoznawanie głosów śpiewaczych w kategorii rodzaju i jakości technicznej śpiewu. W artykule opisano stworzoną bazę danych głosów, która zawiera próbki głosu śpiewaków profesjonalnych i amatorskich. W dalszej części opisano parametry zdefiniowane w oparciu o zjawiska biomechaniczne w narządzie głosu podczas śpiewania. W oparciu o stworzone macierze parametrów wytrenowano i porównano automatyczne klasyfikatory...
-
An algorithm for listing all minimal double dominating sets of a tree
PublikacjaWe provide an algorithm for listing all minimal double dominating sets of a tree of order $n$ in time $\mathcal{O}(1.3248^n)$. This implies that every tree has at most $1.3248^n$ minimal double dominating sets. We also show that this bound is tight.
-
Evolutionary Sets of Safe Ship Trajectories: problem dedicated operators
PublikacjaThe paper presents the optimization process of the evolutionary sets of safe ship trajectories method, with a focus on its problem-dedicated operators. The method utilizes a customized evolutionary algorithm to solve a constrained optimization problem. This problem is defined as finding a set of cooperating trajectories (a set is an evolutionary individual) of all the ships involved in the encounter situation. The resulting trajectories...
-
Simulation of parallel similarity measure computations for large data sets
PublikacjaThe paper presents our approach to implementation of similarity measure for big data analysis in a parallel environment. We describe the algorithm for parallelisation of the computations. We provide results from a real MPI application for computations of similarity measures as well as results achieved with our simulation software. The simulation environment allows us to model parallel systems of various sizes with various components...
-
An Algorithm for Listing All Minimal 2-Dominating Sets of a Tree
PublikacjaWe provide an algorithm for listing all minimal 2-dominating sets of a tree of order n in time O(1.3248n) . This implies that every tree has at most 1.3248 n minimal 2-dominating sets. We also show that this bound is tigh.
-
Characterization of wave structures containing sets of bow-tie resonators
PublikacjaArtykuł opisuje metodę analizy rozpraszania fali elektromagnetycznej układzie rezonatorów motylkowych w strukturach otwartych i zamkniętych. W artykule zaprezentowano przykłady aplikacji układów mikrofalowych zawierające opisywane elementy.
-
Resolving the role of podoplanin in the motility of papillary thyroid carcinoma-derived cells using RNA sequencing
Publikacja -
Evolving Systems
Czasopisma