Wyszukiwarka
Filtry
wszystkich: 3483
-
Katalog
- Publikacje 3309 wyników po odfiltrowaniu
- Czasopisma 3 wyników po odfiltrowaniu
- Konferencje 1 wyników po odfiltrowaniu
- Osoby 29 wyników po odfiltrowaniu
- Wynalazki 2 wyników po odfiltrowaniu
- Projekty 1 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Kursy Online 56 wyników po odfiltrowaniu
- Wydarzenia 6 wyników po odfiltrowaniu
- Dane Badawcze 75 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: SHORTEST PATH PROBLEM
-
Performance of Watermarking-based DTD Algorithm Under Time-varying Echo Path Conditions
PublikacjaA novel double-talk detection (DTD) algorithm based on techniques similar to those used for audio signal watermarking was introduced by the authors. The application of the described DTD algorithm within acoustic echo cancellation system is presented. The problem of DTD robustness to time-varying conditions of acoustic echo path is discussed and explanation as to why such conditions occur in practical situations is provided. The...
-
On the Usefulness of the Generalised Additive Model for Mean Path Loss Estimation in Body Area Networks
PublikacjaIn this article, the usefulness of the Generalised Additive Model for mean path loss estimation in Body Area Networks is investigated. The research concerns a narrow-band indoor off-body network operating at 2.45 GHz, being based on measurements performed with four different users. The mean path loss is modelled as a sum of four components that depend on path length, antenna orientation angle, absolute difference between transmitting...
-
LLA : A New Anypath Routing Scheme Providing Long Path Lifetime in VANETs
PublikacjaVehicular ad-hoc networks (VANETs) are a promising solution to improve the road traffic safety, reduce the environmental pollution, or simply provide the on-board infotainment services. However, these actions are often not possible due to high mobility of vehicles causing frequent failures of VANET links. In this paper, we focus on anypath routing to improve the reliability of multihop VANET communications. In particular, the paper...
-
Hat problem on a graph
PublikacjaThe topic of our paper is the hat problem. In that problem, each of n people is randomly fitted with a blue or red hat. Then everybody can try to guess simultaneously 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...
-
Mean Crossover in evolutionary path planning method for maritime collision avoidance
PublikacjaAbstract: This paper presents the use of mean crossover genetic operator for path planning using evolutionary algorithm for collision avoidance on sea. Mean crossover ensures widening of the possible solutions' set that can be achieved in comparison to exchange crossover variant. The research shown, that the mean crossover allows to achieve results independent from the initial generation and quicker transition of thealgorithm from...
-
On the hat problem on a graph
PublikacjaThe 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....
-
Path Loss Analysis for the IoT Applications in the Urban and Indoor Environments
PublikacjaThe Internet of Things (IoT) networks concept implies their presence in a various and untypical locations, usually with a disturbed radio signals propagation. In the presented paper an investigation of an additional path loss observed in an underground environment was described. The proposed measurement locations correspond to the operation areas of rapidly growing narrowband IoT (NBIoT) networks, the ones using the Long Term Evolution...
-
A modified hat problem
PublikacjaThe 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 Centralized Reputation System for MANETs Based on Observed Path Performance
PublikacjaA reputation system for MANETs is described that attempts to deduce nodal trustworthiness (forwarding behaviour) from observed end-to-end path performance. The trustworthiness deduction algorithm produces interval estimates and works well if node misbehaviour is not selec-tive with respect to traversing paths. Nodal reputation levels are next calculated in the spirit of generous tit-for-tat so as to best reflect momentary nodal...
-
Path Coloring and Routing in Graphs.
PublikacjaW rozdziale omówione zostały problemy kolorowania ścieżek i routingu w grafach. Podano podstawowe definicje związane z tymi problemami, znane wyniki wraz z dyskusją złożoności obliczeniowej dla grafów ogólnych i dla kilku podstawowych klas grafów oraz zastosowania.
-
A more colorful hat problem
PublikacjaThe 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 odd cycles
PublikacjaThe 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...
-
Hat problem on the cycle C4
PublikacjaThe 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...
-
High load capacity spur gears with conchoidal path of contact
PublikacjaThe present study is devoted to investigation of spur gears with a conchoidal path of contact and a convex-convex contact between teeth. The load capacity and energy efficiency were evaluated using both theoretical and experimental approaches. The theoretical analysis showed that the conchoidal gear pairs are 5–21% stronger in terms of contact stress and have similar energy efficiency as compared to the involute gear pairs of the...
-
Specialization and inequality along the development path: an interindustry analysis.
PublikacjaCelem niniejszej rozprawy doktorskiej jest przeprowadzenie empirycznej analizy procesów zwišzanych ze zmianami w strukturze specjalizacyjnej państw w procesie rozwoju ekonpmicznego oraz zwišzanych z nimi efektami dystrybucyjnymi dotyczšcymi rozkładu płac i dochodu. Rozprawa składa się z czterech częci: I. Employment and export specialization patterns versus GDP per capita performance - unifying approach; II.Determinants of export...
-
Study of the Operation of Synchronous Generator Voltage Regulator During the Creation of Post Blackout Start-up Path
PublikacjaThis paper presents the influence of automatic voltage regulator (AVR) of synchronous generator on the process of creation of post black-out start-up path. Two elements of AVR have a significant impact on this process: underexcitation limiter (UEL) and load compensation (LC). The authors present a theoretical investigation and simulation results that illustrate how the mentioned elements of AVR affect voltage levels in a power...
-
Employment and export specialisation along the development path: some robust evidence
PublikacjaThis paper contributes to the literature on the evolution of overall specialisation along the process of economic development by simultaneously estimating 'specialisation curves' emerging from fully comparable employment and export statistics in a sample of 32 economies (1980-2000). We apply semiparametric estimation methods, which allow us to combine the flexibility of the estimation with the inclusion of country-specific effects,...
-
Performance Evaluation of GAM in Off-Body Path Loss Modelling for Body Area Networks
PublikacjaThis paper addresses the performance evaluation of an off-body path loss model, based on measurements at 2.45 GHz, which has been developed with the use of the Generalised Additive Model, allowing to model a non-linear dependence on different predictor variables. The model formulates path loss as a function of distance, antennas’ heights, antenna orientation angle and polarisation, results showing that performance is very sensitive...
-
On the Hat Problem on the Cycle C7
PublikacjaThe 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
PublikacjaThis 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...
-
Evaluation of Vehicle Routing Problem Algorithms for Transport Logistics Using Dedicated GIS System
PublikacjaThe development and research related to optimization of fleet management is of high interest among many industrial and scientific entities related to logistics and transport. Optimal distribution of transportation resources leads to significant cost reduction. In this context, scientific research related to so called Vehicle Routing Problem (VRP) which relies on determining the shortest transport routes for a strictly limited number...
-
Modification of Selected Propagation Models in Terms of Path Loss Estimation in Container Terminal
PublikacjaIt is particularly important to look for any propagation model that could be useful for designing mobile radio networks in container terminal environment. Selected propagation models have been investigated. Firstly - basing on measurements results - they have been evaluated in this scope and the analysis has shown, that the adjustment is needed. This modification improved significantly the accuracy of path loss modelling. For the...
-
Cross-cultural problem of quality
PublikacjaThe 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.
-
Decisional DNA and Optimization Problem
PublikacjaMany 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...
-
The hat problem on a union of disjoint graphs
PublikacjaThe 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...
-
On the hat problem, its variations, and their applications
PublikacjaThe 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...
-
Problem awarii nowobudowanej kanalizacji
PublikacjaAwaria 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.
-
The Backbone Coloring Problem for Small Graphs
PublikacjaIn 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...
-
Asymmetric Renyi Problem and > PATRICIA Tries
PublikacjaIn 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...
-
The hat problem on cycles on at least nine vertices
PublikacjaThe 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...
-
International Journal of Creativity and Problem Solving
Czasopisma -
Interdisciplinary Journal of Problem-Based Learning
Czasopisma -
An adaptive approach to the problem of collision avoiding at sea
PublikacjaW 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...
-
A New Method of the Load Compensation Use During Creation of Post Blackout Start-up Path in Power System
PublikacjaIn the paper a new method of effective use of load compensation during creation of post blackout start-up path is proposed. Theoretical assumptions and simulation results of an investigation are presented. An experiment performed in the Polish Power System is also described. This experiment proved that the method proposed by the authors is advisable. The method may be utilized by power system operators for power system restoration...
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 194
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 194, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 192
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 192, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 191
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 191, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 193
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 193, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Sea surface temperature in the Baltic Sea derived from Landsat 8 satellite data - path 190
Dane BadawczeThe data set contains high resolution sea surface temperature (SST) maps estimated from Landsat 8 Level 1 Thermal Infrared Sensor (TIRS) data using NLSST algorithm. SST was calculated only for granules (185 x 180 km) from satellite path number 190, that covered at least 2000 km2 of the cloud-free area of the Baltic Sea.
-
Can we really solve an arch stability problem?
PublikacjaWe 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...
-
k-Penalty: A Novel Approach to Find k-Disjoint Paths with Differentiated Path Costs
PublikacjaW artykule rozpatrywany jest problem ochrony dedykowanej na wypadek awarii wielokrotnej elementów sieci teleinformatycznej. Wspomniana ochrona jest możliwa do zapewnienia poprzez wyznaczenie i zainstalowanie zbioru k rozłącznych ścieżek dla każdego żądania. W szczególności rozpatrywany jest problem wyznaczenia k rozłącznych ścieżek w sieciach typu ''multi-cost'', w przypadku których koszt dowolnego łącza może być różny dla każdej...
-
The searchlight problem for road networks
PublikacjaWe 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
PublikacjaGraph 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...
-
Propagation Path Loss Modelling in Container Terminal Environment
Publikacja -
Theory vs. practice. Searching for a path of practical education
PublikacjaThe introduction of a three-tier model of higher education (the Bologna model) has led to considerable changes in the 1st- and 2nd-tier technical courses at universities. At present, a student with a bachelor’s degree can be employed in his / her profession after completing only 7 semesters of study. A search is under way for methods of combining theoretical knowledge taught at universities with practical knowledge gained afterwards....
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet 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...
-
Parallel tabu search for graph coloring problem
PublikacjaTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
CLASSIFICATION OF RESTRAINTS IN THE OPTIMIZATION PROBLEM OF A COLD-FORMED PROFILE
PublikacjaThis 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...
-
Two-criteria optimisation problem for ventral hernia repair
PublikacjaTwo-criteria optimisation problem related to laparoscopic ventral hernia repair is formulated in this paper. An optimal implant from a given set and its orientation is sought. The implant is subjected to kinematic extortions due to a patient’s body movement and intra-abdominal pressure. The first criterion of the optimisation problem deals with the reaction force in the implant fastener, while the deflection of the implant constitutes...
-
The Protein Folding Problem
Publikacja