Search
Filters
total: 3155
-
Catalog
- Publications 3037 available results
- Journals 3 available results
- Conferences 1 available results
- People 23 available results
- Inventions 2 available results
- Projects 1 available results
- Laboratories 1 available results
- e-Learning Courses 52 available results
- Events 6 available results
- Open Research Data 29 available results
displaying 1000 best results Help
Search results for: PROBLEM BRZEGOWY Z IMPULSAMI
-
Three positive solutions to second-order three-point impulsive differential equations with deviating arguments
PublicationStosując tw. Leggetta-Williamsa, pokazano że rozpatrywany trzypunktowy problem brzegowy z impulsami ma dodatnie rozwiązania (trzy). Otrzymane twierdzenia dotyczą przypadku opóźnionego oraz wyprzedzonego. W pracy podano przykład i pokazano, że przyjęte założenia są spełnione.
-
The maximum edge-disjoint paths problem in complete graphs
PublicationRozważono problem ścieżek krawędziowo rozłącznych w grafach pełnych. Zaproponowano wielomianowe algorytmy: 3.75-przybliżony (off-line) oraz 6.47-przybliżony (on-line), poprawiając tym samym wyniki wcześniej znane z literatury [P. Carmi, T. Erlebach, Y. Okamoto, Greedy edge-disjoint paths in complete graphs, in: Proc. 29th Workshop on Graph Theoretic Concepts in Computer Science, in: LNCS, vol. 2880, 2003, pp. 143-155]. Ponadto...
-
Degree of entaglement as a physically ill-posted problem: The case of entaglement with vacuum
PublicationAnalizujemy przypadek fotonu w superpozycji różnych modów i zadajemy pytanie o stopień ich splątania z próżnią. Problem okazuje się być źle postawiony, gdyż nie wiemy którą reprezentację algebry CCR wybrać dla kwantowania pola. Gdy dokonamy wyboru jednoznacznie możemy rozwiązać zagadnienie splątania. Tak więc trudność nie leży w matematyce lecz w fizyce problemu.
-
First-order impulsive functional differential equations
PublicationPraca dotyczy problemów istnienia rozwiązań i kwazi-rozwiązań dla równań różniczkowych rzędu pierwszego z impulsami i nieliniowymi warunkami brzegowymi. Operator występujący w zagadnieniu jest typu opóźnionego. Badano również nierówności różniczkowe z impulsami związane z zagadnieniem wyjściowym. Otrzymane wyniki zilustrowano na przykładach.
-
Existence of solutions for second order impulsive differential equations with deviating arguments
PublicationPraca dotyczy równań różniczkowych z impulsami i odchylonymi argumentami. Badano problem istnienia rozwiązań stosując metodę iteracji monotonicznych opartą na dolnych i górnych rozwiązaniach. Praca uogólnia szereg znanych wyników.
-
Bifurcation in von Karman problem for rectangular, thin, elastic plate resting on elastic foundation of Winkler type
PublicationPraca poświęcona jest utracie stateczności prostokątnej, cienkiej płyty sprężystej spoczywającej na podłożu liniowo sprężystym typu Winklera. Płyta jest ściskana równomiernie rozłożonymi obciążeniami na dwóch równoległych brzegach. Wyznaczono obciążenia krytyczne, formy utraty stateczności płyty oraz początkowe zachowanie pokrytyczne. Analizę prowadzono za pomocą analizy funkcjonalnej przy zachowaniu precyzyjnego matematycznego...
-
Badania wykrywalności wad sztucznych w rurach impulsami akustycznymi, wzbudzanymi metodą magnetostrykcyjną
PublicationW artykule opisano wyniki badań nad oryginalną metodą detekcji wad w rurach, wykorzystującą efekty magnetosprężyste. Stanowi to kolejny etap badań rozwijania metody generacji impulsów magnetostrykcyjnych. W pracy przedstawiliśmy wyniki prac badawczych nad układem defektoskopu wykorzystującego metodę generacji akustycznych impulsów magnetostrykcyjnych. W badaniach wykorzystano trzy sztuczne wadyw rurze w kształcie otworów oraz nacięcia...
-
First-order impulsive ordinary differential equations with advanced arguments
PublicationPraca dotyczy problemów istnienia rozwiązań dla równań różniczkowych z impulsami i nieliniowymi warunkami brzegowymi. Są to równania z argumentami wyprzedzonymi. Podano warunki dostateczne na istnienie rozwiązań. W pracy są również dyskutowane nierówności różniczkowe z impulsami. Podano też przykłady ilustrujące otrzymane wyniki.
-
Journal of Problem Solving
Journals -
Positive solutions of three-point boundary value problems for second order impulsive differential equations with advanced arguments
PublicationW pracy dyskutowano problem istnienia dodatnich rozwiązań dla równań różniczkowych z impulsami rzędu drugiego i z argumentami typu wyprzedzonego. Podano warunki dostateczne na istnienie jednego lub dwóch rozwiązań dodatnich takich zagadnień.
-
Density functional approaches to the many-body problem
e-Learning Courses -
Hat problem on a graph
PublicationThe 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...
-
Boundary value problems for first-order impulsive ordinary differential equations with delay arguments
PublicationPraca dotyczy problemów istnienia rozwiązań dla pierwszego rzędu równań różniczkowych typu opóźnionego z impulsami. Podano warunki dostateczne na istnienie ekstremalnych kwazi-rozwiązań. Podano też warunki przy których powyższe zagadnienie ma jedyne rozwiązanie. Praca zawiera też przykład ilustrujący otrzymane wyniki teoretyczne.
-
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....
-
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...
-
Positive solutions to second order four-point boundary value problems for impulsive differential equations
PublicationPraca dotyczy problemów brzegowych dla równań różniczkowych drugiego rzędu z impulsami. Podane zostały warunki dostateczne na istnienie trzech dodatnich rozwiązań takich problemów z czteropunktowymi warunkami brzegowymi. W badaniach korzystano z twierdzenia Leggetta-Williamsa.
-
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 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...
-
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...
-
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...
-
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.
-
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...
-
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...
-
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...
-
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.
-
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...
-
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...
-
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...
-
International Journal of Creativity and Problem Solving
Journals -
Interdisciplinary Journal of Problem-Based Learning
Journals -
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...
-
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...
-
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...
-
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...
-
Parallel tabu search for graph coloring problem
PublicationTabu 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
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...
-
Two-criteria optimisation problem for ventral hernia repair
PublicationTwo-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
Publication -
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.
-
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)...
-
Evolutionary Sets of Safe Ship Trajectories: problem dedicated operators
PublicationThe 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...
-
A construction for the hat problem on a directed graph
PublicationA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
Density smoothness estimation problem using a wavelet approach
PublicationIn this paper we consider a smoothness parameter estimation problem for a density function. The smoothness parameter of a function is defined in terms of Besov spaces. This paper is an extension of recent results (K. Dziedziul, M. Kucharska, B. Wolnik, Estimation of the smoothness parameter ). The construction of the estimator is based on wavelets coefficients. Although we believe that the effective estimation of the smoothness...
-
GreedyMAX-type Algorithms for the Maximum Independent Set Problem
PublicationA maximum independent set problem for a simple graph G = (V,E) is to find the largest subset of pairwise nonadjacent vertices. The problem is known to be NP-hard and it is also hard to approximate. Within this article we introduce a non-negative integer valued functionp defined on the vertex set V(G) and called a potential function of agraph G, while P(G) = max{vinV(G)| p(v)} is called a potential of G. For any graph P(G) <= D(G),...
-
Normal-form preemption sequences for an open problem in scheduling theory
PublicationStructural properties of optimal preemptive schedules have been studied in a number of recent papers with a primary focus on two structural parameters: the minimum number of preemptions necessary, and a tight lower bound on shifts, i.e., the sizes of intervals bounded by the times created by preemptions, job starts, or completions. These two parameters have been investigated for a large class of preemptive scheduling problems,...
-
Problem hałasu drogowego na przykładzie Gdyni
PublicationGłównym zagrożeniem dla klimatu akustycznego w Polsce jak i pozostałych krajów Unii Europejskiej jest hałas drogowy, który dotyka głównie duże aglomeracje miejskie. Oddziałuje on negatywnie na samopoczucie i zdrowie osób narażonych na jago działanie. Artykuł przedstawia ten problem na przykładzie pomiarów hałasu drogowego w Gdyni. W celu wykonania pomiarów równoważnego poziomu dźwięku wybrano dwa punkty pomiarowe zlokalizowane...
-
Mikroplastik – wielki problem?
EventsPolitechnika Otwarta zaprasza na pierwsze spotkanie z cyklu #CiekawiNauki. O mikroplastikach, zagrożeniach z nimi związanych oraz o jakości wody i sposobach jej poprawy opowiedzą eksperci.