Wyszukiwarka
Filtry
wszystkich: 6988
-
Katalog
- Publikacje 5150 wyników po odfiltrowaniu
- Czasopisma 53 wyników po odfiltrowaniu
- Konferencje 70 wyników po odfiltrowaniu
- Osoby 94 wyników po odfiltrowaniu
- Projekty 7 wyników po odfiltrowaniu
- Laboratoria 1 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 206 wyników po odfiltrowaniu
- Wydarzenia 37 wyników po odfiltrowaniu
- Dane Badawcze 1369 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: PARTIAL GRID,CONNECTED SEARCH NUMBER,ON-LINE SEARCHING,PURSUIT-EVASION,DISTRIBUTED SEARCHING
-
On-line Search in Two-Dimensional Environment
PublikacjaWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. As a way of modeling two-dimensional shapes, we restrict our attention to networks that are embedded into partial grids:...
-
On-line Search in Two-Dimensional Environment
PublikacjaWe consider the following on-line pursuit-evasion problem. A team of mobile agents called searchers starts at an arbitrary node of an unknown network. Their goal is to execute a search strategy that guarantees capturing a fast and invisible intruder regardless of its movements using as few searchers as possible. We require that the strategy is connected and monotone, that is, at each point of the execution the part of the graph...
-
Searching by Heterogeneous Agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
Multi-agent graph searching and exploration algorithms
PublikacjaA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
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...
-
Distributed graph searching with a sense of direction
PublikacjaIn 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...
-
Searching by heterogeneous agents
PublikacjaIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
Scanning networks with cactus topology
PublikacjaThe family of Pursuit and Evasion problems is widelystudied because of its numerous practical applications,ranging from communication protocols to cybernetic andphysical security. Calculating the search number of a graphis one of most commonly analyzed members of this problemfamily. The search number is the smallest number of mobileagents required to capture an invisible and arbitrarily fastfugitive, for instance piece of malicious...
-
The complexity of bicriteria tree-depth
PublikacjaThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
Connected searching of weighted trees
PublikacjaW artykule rozważamy problem spójnego przeszukiwania drzew obciążonych. Autorzy w [L. Barriere i inni, Capture of an intruder by mobile agents, SPAA'02 (2002) 200-209] twierdzą, że istnieje wielomianowy algorytm dla problemu obliczania optymalnej strategii przeszukiwania obciążonego drzewa. W niniejszej pracy pokazano, że problem ten jest obliczeniowo trudny nawet dla wierzchołkowo-obciążonych drzew (wagi krawędzi równe 1) oraz...
-
Connected searching of weighted trees
PublikacjaW pracy pokazano, że problem spójnego przeszukiwania drzew ważonych jest silnie NP-zupełny. Problem pozostaje trudnym dla drzew z jednym wierzchołkiem o stopniu większym niż 2. Ponadto, przedstawiony został wielomianowy optymalny algorytm dla klasy drzew z ograniczonym stopniem.
-
Edge ranking and searching in partial orders
PublikacjaArtykuł jest poświęcony problemowi konstrukcji optymalnej (wymagającej minimalnej ilości porównań/zapytań) strategii wyszukiwania elementu w częściowym porządku. W pracy wskazano związki pomiędzy tym problemem oraz uporządkowanym kolorowaniem krawędzi grafów, co implikuje liniowy algorytm dla częściowych porządków o strukturze drzewa. Pokazano również, że znalezienie optymalnej strategii jest problemem obliczeniowo trudnym dla...
-
On minimum cost edge searching
PublikacjaWe consider the problem of finding edge search strategies of minimum cost. The cost of a search strategy is the sum of searchers used in the clearing steps of the search. One of the natural questions is whether it is possible to find a search strategy that minimizes both the cost and the number of searchers used to clear a given graph G. We call such a strategy ideal. We prove, by an example, that ideal search strategies do not...
-
A Framework for Searching in Graphs in the Presence of Errors
PublikacjaWe consider a problem of searching for an unknown target vertex t in a (possibly edge-weighted) graph. Each vertex-query points to a vertex v and the response either admits that v is the target or provides any neighbor s of v that lies on a shortest path from v to t. This model has been introduced for trees by Onak and Parys [FOCS 2006] and for general graphs by Emamjomeh-Zadeh et al. [STOC 2016]. In the latter, the authors provide...
-
Non-monotone graph searching models
PublikacjaGraph searching encompasses a variety of different models, many of which share a property that in optimal strategies fugitive can never access once searched regions. Monotonicity, as it is called, is vital in many established results in the field however its absence significantly impedes the analysis of a given problem. This survey attempts to gather non-monotone models, that are less researched in effort of summarizing the results...
-
Induction Generator with Direct Control and a Limited Number of Measurements on the Side of the Converter Connected to the Power Grid
PublikacjaThe article presents an induction generator connected to the power grid using the AC/DC/AC converter and LCL coupling filter. Three-level inverters were used in the converter, both from the generator side and the power grid side. The algorithm realizing Pulse Width Modulation (PWM) in inverters has been simplified to the maximum. Control of the induction generator was based on the Direct Field-Oriented Control (DFOC) method. At...
-
Blackout initial disturbances in electric Power System searching
PublikacjaThe paper contains short survey of the blackouts that took place in the last few years. The sources and initial disturbances are discussed. The typical scenario of the disturbance, leading to blackout in the electrical power system are presented.Next, models of a power system eligible to considered topic are discussed. Finally the algorithm of the blackout initial disturbances in power system searching is presented.The consideration...
-
Estimation of the Maximum Permissible PV Power to be Connected to the MV Grid
PublikacjaIn recent decades, a significant increase in the share of renewable energy sources in power grids at various voltage levels has been observed. A number of articles have been published highlighting emerging problems in low-voltage grids with a large share of prosumers and in medium- and high-voltage grids to which photovoltaic (PV) plants are connected. The article analyzes the medium-voltage grid in terms of the possibility of...
-
Searching of the buried objects in the sea bottom by means of noninvasive methods
PublikacjaSearching of objects on the seabed or under its surface currently is a challenge for a number of researchers interested in the sea bottom. The problem relates to the objects on the depths of up to several tens of meters from the surface of the seabed. Finding the objects is the subject of interest for a wide group of users starting from archaeologists, and ending on groups interested in marine safety, as well as in military application...
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
Searching the growth factors.
PublikacjaW części literaturowej przedstawiono dotychczasową wiedzę na temat dotych-czasowych czynników wzrostu małych przedsiębiorstw, tworząc model badawczy. W części literaturowej opisano wyniki badań przeprowadzonych na próbie 28 właścicieli małych firm w regionie Gdańskim w latach 1996 i 2003.
-
Voltage Conditions in Low Voltage Grid with Connected Mictogeneration
PublikacjaThe introduction of distributed generation into a low voltage grid may cause voltage problems in it. The paper discusses the effect of microgeneration on voltage levels in a low voltage grid. A real low voltage grid of considerable length was selected for the analysis. The grid primarily supplies residential buildings in a rural area. Results of tests that consider potential measures which could be applied in this grid to improve...
-
Comprehensive distortion compensation of grid-connected inverter currents
PublikacjaThe paper presents a comprehensive approach to the compensation of phase current distortion of grid-connected power inverters. Four different sources of current distortion are addressed: imperfect grid synchronization caused by the distortion in the grid voltages, voltage fluctuations in the dc link, time delays in the estimation of grid voltages, and the distortion of inverter output voltages due to dead-time effects and related...
-
Comparison of reproduction strategies in genetic algorithm approach to graph searching
Publikacjagenetic algorithms (ga) are a well-known tool used to obtain approximate solutions to optimization problems. successful application of genetic algorithm in solving given problem is largely dependant on selecting appropriate genetic operators. selection, mutation and crossover techniques play a fundamental role in both time needed to obtain results and their accuracy. in this paper we focus on applying genetic algorithms in calculating...
-
Searching for innovation knowledge: insight into KIBS companies
PublikacjaThe paper analyses the activity of research for “innovation knowledge”—here defined as knowledge that can lead to the introduction of service innovations—by Knowledge-Intensive Business Services (KIBS) companies. It proposes a classification of the possible search approaches adopted by those companies based on two dimensions: the pro-activity of search efforts and the source primarily used. Such classification is then discussed...
-
Searching for innovation knowledge: insight into KIBS companies
PublikacjaPurpose – The paper analyzes the patterns of research of “innovation knowledge” (i.e. knowledge that can result in introducing innovations in the company that can be observed in KIBS (Knowledge-Intensive Business Services) companies. Particularly, it identifies and classifies the possible approaches adopted by companies on the basis of two dimensions: the intensity/proactivity of search efforts, and the source primarily used. Design/methodology/approach...
-
Usage of parametric echosounder with emphasis on buried object searching.
PublikacjaThe purpose of this article is to present the results of investigation to search for buried objects. The paper will contain echograms and other means of visualization from buried pipe placed between area of W?adys?awowo and gas platform and interesting in terms of the number of small and medium-sized unidentified objects found in the muddy bottom at different depths localized in the Gulf of Puck - results will be presented also...
-
Improving flexibility and performance of PVM applications by distributed partial evaluation
PublikacjaA new framework for developing both flexible and efficient PVM applications is described. We propose Architecture Templates Interface (ATI) that allows to control application granularity and parallelism. To ensure high application efficiency we extend partial evaluation strategy into domain of distributed applications obtaining Distributed Partial Evaluation (DPE). Both ATI and DPE were implemented using a new distributed programming...
-
Image Processing Techniques for Distributed Grid Applications
PublikacjaParallel approaches to 2D and 3D convolution processing of series of images have been presented. A distributed, practically oriented, 2D spatial convolution scheme has been elaborated and extended into the temporal domain. Complexity of the scheme has been determined and analysed with respect to coefficients in convolution kernels. Possibilities of parallelisation of the convolution operations have been analysed and the results...
-
Searching for metric structure of musical files
PublikacjaCelem opisywanych prac jest porównanie efektywności wybranych metod sztucznej inteligencji w wyznaczaniu rytmu dla zapisu symbolicznego muzyki. Opisano sposób wykorzystania sztucznych sieci neuronowych i zbiorów przybliżonych do poszukiwania właściwej struktury rytmicznej utworu. Analizowane są fizyczne atrybuty dźwięku, które są najbardziej znaczące dla określenia położenia dźwięku na pozycji akcentowanej lub nieakcentowanej....
-
Searching for new development in areas of the city
Publikacja -
Hearing and stomatognathic system: Searching for a link
Publikacja -
Searching for a new therapeutic target in sepsis
Publikacja -
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublikacjaA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
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....
-
Computations of the least number of periodic points of smooth boundary-preserving self-maps of simply-connected manifolds
PublikacjaLet $r$ be an odd natural number, $M$ a compact simply-connected smooth manifold, $\dim M\geq 4$, such that its boundary $\partial M$ is also simply-connected. We consider $f$, a $C^1$ self-maps of $M$, preserving $\partial M$. In [G. Graff and J. Jezierski, Geom. Dedicata 187 (2017), 241-258] the smooth Nielsen type periodic number $D_r(f;M,\partial M)$ was defined and proved to be equal to the minimal number of $r$-periodic points...
-
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number
PublikacjaGiven two types of graph theoretical parameters ρ and σ, we say that a graph G is (σ, ρ)- perfect if σ(H) = ρ(H) for every non-trivial connected induced subgraph H of G. In this work we characterize (γw, τ )-perfect graphs, (γw, α′)-perfect graphs, and (α′, τ )-perfect graphs, where γw(G), τ (G) and α′(G) denote the weakly connected domination number, the vertex cover number and the matching number of G, respectively. Moreover,...
-
Searching for smart solutions:Comparative study of Gdansk and Glasgow
PublikacjaThis chapter is the executive summary of undertaken comparative study between Gdansk and Glasgow.
-
Distributed Detection of Selected Features in Data Streams Using Grid-class Systems
PublikacjaThis chapter describes basic methodology of distributed digital signal processing. A choice of distributed methods of detection of selected features in data streams using grid-class systems is discussed. Problems related to distribution of data for processing are addressed. A mitigating method for data distribution and result merging is described.
-
Analysis of electromagnetic disturbances in DC network of grid connected building-integrated photovoltaic system
PublikacjaThis paper focuses on conducted electromagnetic interference (EMI) emissions and propagation in the DC network of grid connected building integrated photovoltaic (PV) system. The investigated PV system, consists of ten solar panels, cabling and the grid-connected one phase inverter. The EMI simulation model of the real PV system has been developed with the aid of impedance analyzer measurements of solar panels and the DC network...
-
Landscape of the Vistula Estuary - searching for traces of ingenium embodied
PublikacjaArtykuł podaje skrótowe informacje o dawnym i współczesnym znaczeniu obiektów inżynieryjnych w krajobrazie delty Wisły, które znalazły się na trasie objazdu konserwatorskiego w dniu 5 maja w ramach realizacji programu konferencji HOT-GO 4 wraz z kalendarium ich dziejów: Most Lisewski przez Wisłę w Tczewie, wielki przekop Wisły w Świbnie, śluzy w Przegalinie, Gdańskiej Głowie i Białej Górze, relikty kanału w Piekle.
-
Searching for Critical Conditions During Lifeboat Launching – Simulations
PublikacjaThe article describes numerical simulations of the process of lifeboat launching at the ship’s side. The research is aimed at finding the values of ship motion parameters which appear to be most dangerous for people in the lowered lifeboat due to the generated accelerations. The simplified model of ship hull motion adopted at this research stage bases on a superposition of harmonic motions with given amplitudes and periods in six...
-
Searching for road deformations using mobile laser scanning
PublikacjaMillions of people use roads every day all over the world. Roads, like many other structures, have an estimated durability. In Poland a lot of the roads were built at the turn of the 20th and 21st c., especially for light cars. Many of these roads carry traffic and heavy goods vehicles which were not predicted when the traffic was first estimated. It creates a lot of problems with technical conditions and the infrastructure must...
-
The outer-connected domination number of a graph
PublikacjaW pracy została zdefiniowana liczba dominowania zewnętrznie spójnego i przedstawiono jej podstawowe własności.
-
On the doubly connected domination number of a graph
PublikacjaW pracy została zdefiniowana liczba dominowania podwójnie spójnego i przedstawiono jej podstawowe własności.
-
Mersenne Number Finding and Collatz Hypothesis Verification in the Comcute Grid System
PublikacjaIn this chapter, some mathematic applications have been described to test scalability of the Comcute grid system. Especially, a verification of the Collatz hypothesis and finding Mersenne numbers were applied to prove the scalability and high performance of this grid system. Results were compared with outcomes obtained by the other grid systems.
-
A Point Set Connection Problem for Autonomous Mobile Robots in a Grid
PublikacjaConsider an orthogonal grid of streets and avenues in a Manhattan-like city populated by stationary sensor modules at some intersections and mobile robots that can serve as relays of information that the modules exchange, where both module-module and module-robot communication is limited to a straight line of sight within the grid. The robots are oblivious and move asynchronously. We present a distributed algorithm that, given...
-
Porównanie wydajności modyfikacji algorytmu Proof-number search uwzględniających wartości remisowe
PublikacjaProof-number search to znana rodzina algorytmów służących do wyznaczania wartości pozycji w nielosowych grach dwóch graczy z pełną informacją. W wersji podstawowej pn-search doskonale radzi sobie z wyszukiwaniem strategii wygrywającej jednego z graczy. Jednak istnieje wiele znanych gier, w których obydwaj gracze posiadają jedynie strategię remisującą (Młynek, Awari, Warcaby). W niniejszej pracy porównano wydajność dwóch modyfikacji...
-
Searching for objects under the sea bed bythe acoustic method
PublikacjaOpisano metodykę poszukiwania przedmiotów zamulonych w morzu z zastosowaniem metod akustycznych.
-
Overheating of underground power cable line due to its partial exposition to solar radiation
PublikacjaCurrent-carrying capacity of underground power cable lines depends, among others, on thermal resistivity of the soil and cables layout: trefoil formation, flat formation with or without spacing. If conditions for heat transfer in the ground are favorable, the current-carrying capacity is relatively high. Therefore, it generates risk of the power cables overheating, if part of the cable line is located vertically in the air, to...