Search
Filters
total: 3517
filtered: 3306
-
Catalog
- Publications 3306 available results
- Journals 6 available results
- Conferences 1 available results
- People 37 available results
- Inventions 2 available results
- Projects 1 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 56 available results
- Events 6 available results
- Open Research Data 100 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: PROBLEM KOLOROWANIA MAP
-
Application of road map of operating condition for estimation of fuel and electric energy consumption from city transport
PublicationThe paper presents procedure of data collecting and generation of road map of operating condition in the selected urban area. This map allows forecasting the selected vehicle operating parameters for the assumed road. The main parameters calculated using the road maps of operating conditions are: total energy spent to drive the selected vehicle, consumed fuel, travel time, average speed of travel, CO2 emissions. Presented example...
-
High Speed Milling vibration surveillance with optimal spindle speed based on optimal speeds map
PublicationThe paper presents the method of the surveillance of the self-excited chatter vibration. At first, the workpiece modal parameters are estimated based on experimental data which leads to verification of computational model. Then, for selected surface points optimal spindle speeds are calculated. By considering sufficient amount of points it is possible to build a map of optimal spindle speeds. Experimental results show that this...
-
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.
-
On the hat problem on a graph
PublicationThe topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning....
-
Fashion Games, Fashion in Games and Gamification in Fashion. A First Map
PublicationFashion companies have been using different forms of entertainment such as film and television, sport, music, museums, and photography as inspiration sources and as communication and marketing channels for decades. However, in recent years, they have also started to consider the gaming world. While gaming offers a potential revenue stream from sales of physical and digital clothing, change in it is also the gateway to access new...
-
A modified hat problem
PublicationThe topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many...
-
A more colorful hat problem
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. We consider a generalized hat...
-
Hat problem on the cycle C4
PublicationThe topic of our paper is the hat problem. In that problem, each of n people is randomly tted with a blue or red hat. Then everybody can try to guess simultanously his own hat color looking at the hat colors of the other people. The team wins if at least one person guesses his hat color correctly and no one guesses his hat color wrong, otherwise the team loses. The aim is to maximize the probability of win. In this version every...
-
Hat problem on odd cycles
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. In this version every player can...
-
Inducing a map on homology from a correspondence
Publication -
Shadowing is generic---a continuous map case
Publication -
E-learning in tourism and hospitality: A map
PublicationThe impact of information and communication technologies (ICT) on tourism and hospitality industries has been widely recognized and investigated as a one of the major changes within the domains in the last decade: new ways of communicating with prospective tourists and new ways of purchasing products arisen are now part of the industries’ everyday life. Poor attention has been paid so far to the role played by new media in education...
-
Multibeam Echosounder and LiDAR in Process of 360-Degree Numerical Map Production for Restricted Waters with HydroDron
PublicationIn order to increase the safety of inland navigation and facilitate the monitoring of the coastal zone of restricted waters, a model of multi-sensory fusion of data from hydroacoustic and optoelectronic systems mounted on the autonomous survey vessel HydroDron will be developed. In the research will be used the LiDAR laser scanner and multibeam echosounder. To increase the visual quality and map accuracy, additionally side scan...
-
Metodyka tworzenia dynamicznych map hałasu w środowisku aglomeracji miejskiej z zastosowaniem gridu superkomputerowego
PublicationW rozprawie przedstawiono i zweryfikowano opracowaną przez autora metodę sporządzania aktualizowanych dynamicznie map hałasu. Oryginalnym podejściem jest zastosowanie potencjału gridu superkomputerowego jako środowiska do przeprowadzania obliczeń numerycznych w procesie modelowania źródeł i propagacji dźwięku. Dzięki temu możliwe stało się przeliczanie mapy hałasu obszaru wielkości dużego miasta w krótkich odstępach czasu. Autor...
-
On the Hat Problem on the Cycle C7
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. In this version every player can...
-
The Use of an Autoencoder in the Problem of Shepherding
PublicationThis paper refers to the problem of shepherding clusters of passive agents consisting of a large number of objects by a team of active agents. The problem of shepherding and the difficulties that arise with the increasing number of data describing the location of agents have been described. Several methods for reducing the dimensionality of data are presented. Selected autoencoding method using a Restricted Boltzmann Machine is...
-
Firing map for periodically and almost-periodically driven integrate-and-fire models: a dynamical systems approach
PublicationWe consider the Leaky Integrate-and-Fire and Perfect Integrator models of neuron’s dynamics with the input function being periodic and almost-periodic (in the sense of Stepanov). In particular we analyze properties and dynamics of the so-called firing map, which iterations give timings of consecutive spikes of a neuron. In case of a periodic input function we provide a detailed description of the sequence of interspike-intervals,...
-
Cross-cultural problem of quality
PublicationThe paper, by presenting issues such as variability of reality, quality of life, quality and environmental management systems, emphasizes the opportunities of taking the socially important problem under control by utilization of efficient quality engineering analytical methods.
-
Evaluation of open drone map toolkit for geodetic grade aerial drone mapping – case study
PublicationAn open source tool’s popularity has increased considerably, as well as micro aerial vehicles (MAV) technologies based on open source hardware. An open source software and hardware delivers a wide variety of applications and technology. The world’s most successful open source projects have their roots in the academy, and now its participation includes a wide variety of academic programs and research. Based on open source technology,...
-
Decisional DNA and Optimization Problem
PublicationMany researchers have proved that Decisional DNA (DDNA) and Set of Experience Knowledge Structure (SOEKS or SOE) is a technology capable of gathering information and converting it into knowledge to help decision-makers to make precise decisions in many ways. These techniques have a feature to combine with different tools, such as data mining techniques and web crawlers, helping organization collect information from different sources...
-
On the hat problem, its variations, and their applications
PublicationThe topic of our paper is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of a win. There are known many...
-
The hat problem on a union of disjoint graphs
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Problem awarii nowobudowanej kanalizacji
PublicationAwaria nowobudowanej i odebranej kanalizacji. Rzetelność projektanta, kierownika budowy i inspektora nadzoru. Ocena zagrożeń dla procesu budowlanego. Błędy działań naprawczych. Szczególny problem projektanta i wykonawcy wywodzących się zer środowiska "melioracji rolnych". Zagrożenia finansowe w sytuacji braku trwałego efektu inwestycji.
-
noise map validation by continuous noise monitoring
PublicationArtykuł dotyczy porównania dwóch rodzajów oceny hałasu w aglomeracjigdańskiej. Pierwsza ocena została przygotowana na podstawie prognozy hałasu w oparciu o mapy stworzone metodami obliczeniowymi w roku 2007. Druga ocena bazuje na rzeczywistych danych pomiarowych zarejestrowanych przez system ciągłego monitoringu działającego w aglomeracji od 2008 roku. W artykule zaprezentowano i przeprowadzono analizy występujących różnic pomiędzy...
-
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublicationArtykuł poświęcony jest nowym modelom konsensusowego kolorowania grafów. Artykuł zawiera omówienie trzech takich modeli, analizę ich złożoności obliczeniowej oraz wielomianowy algorytm dla częściowych k-drzew, dla tzw. modelu addytywnego.
-
The Backbone Coloring Problem for Small Graphs
PublicationIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...
-
Generowanie sąsiedztwa w algorytmach lokalnych poszukiwań uporządkowanego kolorowania grafów
PublicationPrzedstawienie rozwiązań problemów kombinatorycznych w postacipermutacji daje podstawy do konstrukcji algorytmów lokalnychposzukiwań. Uporządkowane pokolorowanie grafu można zapisać w postaci permutacji wierzchołków grafu. Podstawowe operacje prowadzącedo generowania sąsiedztwa rozwiązania to zamiana dwóch elementówlub przesunięcie elementu permutacji. W artykule wskazujemy metodępozwalającą na wykonanie takich operacji w czasie...
-
Planowanie rozmieszczenia strażników w galeriach sztuki metodą kolorowania grafów
PublicationW niniejszym rozdziale zaprezentujemy podejście chromatyczne do wyznaczenialiczby straży w galeriach dowolnego kształtu bez dziur oraz w galeriach or-togonalnych z dziurami, a także bez dziur. Rozważane tu problemy są NP-trud-ne pod względem złożoności obliczeniowej.
-
Selecting wells for an optimal design of groundwater monitoring network based on monitoring priority map: A Kish Island case study
PublicationThis paper presents a novel approach, i.e. a combination of gamma test and monitoring priority map, for optimal design of groundwater monitoring network (GMN) by considering the cumulative effects of industries, human activities, and natural factors on the groundwater quality. The proposed method was successfully applied to design an optimal network for groundwater salinity monitoring on Kish Island, Persian Gulf. The priority...
-
Asymmetric Renyi Problem and > PATRICIA Tries
PublicationIn 1960 R´enyi asked for the number of random queries necessary to recover a hidden bijective labeling of n distinct objects. In each query one selects a random subset of labels and asks, what is the set of objects that have theselabels? Weconsider here anasymmetric version of the problem in which in every query an object is chosenwith probability p > 1/2 and we ignore “inconclusive” queries. We study the number of queries needed...
-
Tworzenie miasta przyjaznego wszystkim
PublicationTworzenie miasta przyjaznego wszystkim, to zadnie, które jest prawdopodobnie celem wszystkich włodarzy miejskich. Czy nie jest tak, że każdy chciałby w takim mieście zamiesz-kać? Jednak zadanie to jest dość trudne, bo wymaga pogodzenia wielu aspektów życia mieszkańców. Obecnie do zagadnień środowiskowych związanych z szeroko rozumianą ekologią dochodzi zagadnienie dostosowania przestrzeni zgodnie z zasadami projektowania uniwersalnego....
-
The hat problem on cycles on at least nine vertices
PublicationThe topic is the hat problem in which each of n players is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to maximize the probability of winning. In this version every player...
-
Usability attributes revisited: a time-framed knowledge map
Publication -
Chatter surveillance with the creation of a map of optimal spindle speeds
PublicationW pracy przedstawiono metodę nadzorowania drgań samowzbudnych typu chatter. Wyznaczono wartości optymalnych prędkości obrotowych wrzeciona dla poszczególnych punktów na powierzchni przedmiotu obrabianego, wykorzystując rożne techniki analizy modalnej. Badania eksperymentalne wykazały, że otrzymana w ten sposób mapa optymalnych prędkości obrotowych wrzeciona jest skutecznym narzędziem do eliminacji drgań chatter w procesie obróbki...
-
An adaptive approach to the problem of collision avoiding at sea
PublicationW referacie przedstawiono koncepcję podejścia adaptacyjnego do unikania kolizji na morzu. Omawiany problem został sklasyfikowany jako problem uczenia się ze wzmocnieniem. Zamieszczono opis podstawowych technik uczenia się ze wzmocnieniem, ich ograniczeń i sposobu w jaki można zapewnić efektywne uczenie się, mimo wspomnianych ograniczeń. Zaprezentowana metoda została zilustrowana przykładowym procesem konstrukcji modelu i algorytmami...
-
Minimalizacja szerokości pasma w sieciach radiowych metodami szkieletowego kolorowania grafów
PublicationArtykuł poświęcony jest szkieletowemu kolorowaniu grafów, które jest matematycznym modelem dla problemu minimalizacji szerokości pasma w sieciach radiowych. Badamy w nim zależność szkieletowej liczby chromatycznej od parametrów zagadnienia. Dowodzimy, że dla dużych wartości parametrów ta zależność jest liniowa.
-
Can we really solve an arch stability problem?
PublicationWe bring attention to the problem of solving nonlinear boundary-value problems for elastic structures such as arches and shells. Here we discuss a classical problem of a shear-deformable arch postbuckling. Considering a postbuckling behaviour of a circular arch we discuss the possibility to find numerically a solution for highly nonlinear regimes. The main attention is paid to the problem of determination of all solutions. The...
-
Wpływ nadmiarowych danych wejściowych na jakość map rozbieżności pozyskanych za pomocą układu pięciu kamer w konfiguracji EBMCS
PublicationArtykuł dotyczy zastosowania układu kamer typu EBMCS (Equal Baseline Multiple Camera Set) składającego się z kamery centralnej oraz kamer bocznych. Na podstawie zdjęć wykonanych za pomocą tego układu można otrzymać mapy rozbieżności (ang. disparity map), które pozwalają na określenie odległości od kamer do obiektów znajdujących się w ich polu widzenia. Mapy te są wyższej jakości niż mapy otrzymane za pomocą kamery stereoskopowej....
-
Selection Pressure in the Evolutionary Path Planning Problem
PublicationThis article compares an impact of using various post-selection methods on the selection pressure and the quality of the solution for the problem of planning the path for a moving object using the evolutionary method. The concept of selection pressure and different methods of post-selection are presented. Article analyses behaviour of post-selection for four options of evolutionary algorithms. Based on the results achieved, waveform...
-
The searchlight problem for road networks
PublicationWe consider the problem of searching for a mobile intruder hiding in a road network given as the union of two or more lines, or two or more line segments, in the plane. Some of the intersections of the road network are occupied by stationary guards equipped with a number of searchlights, each of which can emit a single ray of light in any direction along the lines (or line segments) it is on. The goal is to detect the intruder,...
-
Application of genetic algorithms in graph searching problem
PublicationGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
Self–Organizing Map representation for clustering Wikipedia search results
PublicationThe article presents an approach to automated organization of textual data. The experiments have been performed on selected sub-set of Wikipedia. The Vector Space Model representation based on terms has been used to build groups of similar articles extracted from Kohonen Self-Organizing Maps with DBSCAN clustering. To warrant efficiency of the data processing, we performed linear dimensionality reduction of raw data using Principal...
-
Comparison of Indian and Nepalese media on “Nepal's New Political Map”
Publication -
Self-normalized density map (SNDM) for counting microbiological objects
Publication -
Self-Organizing Map representation for clustering Wikipedia search results
PublicationThe article presents an approach to automated organization of textual data. The experiments have been performed on selected sub-set of Wikipedia. The Vector Space Model representation based on terms has been used to build groups of similar articles extracted from Kohonen Self-Organizing Maps with DBSCAN clustering. To warrant efficiency of the data processing, we performed linear dimensionality reduction of raw data using Principal...
-
The Backbone Coloring Problem for Bipartite Backbones
PublicationLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ -backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that |c(u)−c(v)|≥1 for each edge uv∈E(G) and |c(u)−c(v)|≥λ for each edge uv∈E(H) . The λ -backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ -backbone coloring c of G with backbone H satisfying...
-
Reducing the number of periodic points in the smooth homotopy class of a self-map of a simply-connected manifold with periodic sequence of Lefschetz numbers
PublicationLet f be a smooth self-map of an m-dimensional (m >3) closed connected and simply-connected manifold such that the sequence of the Lefschetz num- bers of its iterations is periodic. For a fixed natural r we wish to minimize, in the smooth homotopy class, the number of periodic points with periods less than or equal to r. The resulting number is given by a topological invariant J[f] which is defned in combinatorial terms and is...
-
CLASSIFICATION OF RESTRAINTS IN THE OPTIMIZATION PROBLEM OF A COLD-FORMED PROFILE
PublicationThis work describes the restraints in the optimization problem. This is an important and complicated issue because it requires taking into account a vast range of information related to the design and production. In order to describe the relations of a specific optimization problem, it is essential to adopt appropriate criteria and to collect information on all kinds of restraints, i.e. boundary conditions. The following paper...
-
The Snow Team Problem
PublicationWe study several problems of clearing subgraphs by mobile agents in digraphs. The agents can move only along directed walks of a digraph and, depending on the variant, their initial positions may be pre-specified. In general, for a given subset~$\cS$ of vertices of a digraph $D$ and a positive integer $k$, the objective is to determine whether there is a subgraph $H=(\cV_H,\cA_H)$ of $D$ such that (a) $\cS \subseteq \cV_H$, (b)...
-
Problem powodzi miejskich
PublicationZagadnienia związane z powtarzającym się w Polsce zjawiskiem powodzi miejskiej pochodzącej od opadu. Problemy ocen ilościowych. Zagadnienie nadmiernego wpływu przeszłości na podejmowane działania, w efekcie niewłaściwa identyfikacja problemów. Przykład działań podjętych w Gdańsku. Inicjatywa bydgoska.