Filters
total: 1779
-
Catalog
- Publications 1244 available results
- Journals 169 available results
- Conferences 176 available results
- Publishing Houses 1 available results
- People 40 available results
- Projects 7 available results
- e-Learning Courses 13 available results
- Events 1 available results
- Open Research Data 128 available results
displaying 1000 best results Help
Search results for: MOBILE EDGE COMPUTING
-
Real-Time Basic Principles Nuclear Reactor Simulator Based on Client-Server Network Architecture with WebBrowser as User Interface
PublicationThe real-time simulator of nuclear reactor basic processes (neutron kinetics, heat generation and its exchange, poisoning and burn- ing up fuel) build in a network environment is presented in this paper. The client-server architecture was introduced, where the server is a pow- erful computing unit and the web browser application is a client for user interface purposes. The challenge was to develop an application running under the...
-
Krzysztof Gierłowski dr inż.
PeopleKrzysztof Gierłowski received his Ph.D. degree in telecommunications from the Faculty of Electronics, Gdańsk University of Technology (GUT), Poland, in 2018. He is author or co-author of more than 80 scientific papers and reviewer for a number of conferences and journals. Krzysztof Gierłowski took part in major IT-oriented projects, including: EU-funded Polish Future Internet Engineering initiative, PL-LAB2020 Infrastructural...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Open Research DataFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Open Research DataFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Tomasz Gierszewski dr inż.
People -
Paweł Rościszewski dr inż.
PeoplePaweł Rościszewski received his PhD in Computer Science at Gdańsk University of Technology in 2018 based on PhD thesis entitled: "Optimization of hybrid parallel application execution in heterogeneous high performance computing systems considering execution time and power consumption". Currently, he is an Assistant Professor at the Faculty of Electronics, Telecommunications and Informatics, Gdańsk University of Technology, Poland....
-
PPAM 2022
EventsThe PPAM 2022 conference, will cover topics in parallel and distributed computing, including theory and applications, as well as applied mathematics.
-
INTERNATIONAL JOURNAL OF AUTOMATION AND COMPUTING
Journals -
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Journals -
SIAM JOURNAL ON SCIENTIFIC COMPUTING
Journals -
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Open Research DataFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Multiclass AdaBoost Classifier Parameter Adaptation for Pattern Recognition
PublicationThe article presents the problem of parameter value selection of the multiclass ``one against all'' approach of an AdaBoost algorithm in tasks of object recognition based on two-dimensional graphical images. AdaBoost classifier with Haar features is still used in mobile devices due to the processing speed in contrast to other methods like deep learning or SVM but its main drawback is the need to assembly the results of binary...
-
Andrzej Chybicki dr inż.
PeopleA graduate of the Faculty of Electronics, Telecommunications and Informatics at the Gdańsk University of Technology, PhD in technical sciences in the field of IT specializing in distributed data processing in IT . Aimed at exploiting the achievements and knowledge in the field of industrial research. He cooperated with a number of companies including OpeGieka Elbląg, Reson Inc., Powel Sp. z o. o., Wasat, Better Solutions, the European...
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Open Research DataFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Robust procedure for flow coefficient calculation. W: Recent advances in simulation, computational methods and soft computing. Ed. W. Nikos, E. Ma-torakis. New York: WSEAS Press**2002 s. 152-155, 5 rys. bibliogr. 7 poz. Krzepka procedura obliczania współczynnika przepływu.
PublicationW pracy przedstawiono efektywne i szybkie metody obliczania współczynnikaprzepływu powietrza na podstawie znanych: stosunku ciśnień statycznych i oporności dźwiekowej (patrz norma ISO6358).
-
International Conference on Mobile Business
Conferences -
Mobile and Ubiquitous Multimedia (ACM)
Conferences -
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Open Research DataFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Open Research DataFor K4 graph, a coloring type (K4,K4;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...
-
Algorytmy wykrywania krawędzi w obrazie
PublicationWykrywanie krawędzi jest pierwszym etapem w cyfrowym przetwarzaniu obrazów. Operacja ta polega na usunięciu informacji takich jak kolor czy też jasność, a pozostawieniu jedynie krawędzi. Efektem tej operacji jest znaczna redukcja ilości danych do dalszej analizy. Pozwala to na zastosowanie w następnych etapach bardziej złożonych algorytmów rozpoznawania obiektów na podstawie kształtu. W artykule zaprezentowano zastosowanie algorytmów...
-
Searching by Heterogeneous Agents
PublicationIn 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...
-
Future Generation Computer Systems-The International Journal of Grid Computing-Theory Methods and Applications
Journals -
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Open Research DataFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
Alternative Modeling of Volunteer Based Systems
PublicationThe canonical approach to model a flow of a voluntary based computing, as presented in Chapter 7 may tax the capacity of the simulator, especially when a more complex model of Voluntary Computing, proposed in [1], is used which would imply that, for typical heterogeneous groups of volunteers, several thousands of threads would have to be run inside the simulator, to mimic closely the behaviour of every volunteer. This chapter presents...
-
A CNN based coronavirus disease prediction system for chest X-rays
PublicationCoronavirus disease (COVID-19) proliferated globally in early 2020, causing existential dread in the whole world. Radiography is crucial in the clinical staging and diagnosis of COVID-19 and offers high potential to improve healthcare plans for tackling the pandemic. However high variations in infection characteristics and low contrast between normal and infected regions pose great challenges in preparing radiological reports....
-
Terrestrial Survey Images - Multispectral Exterior Model - Gdansk Church Pw. Św. Wojciecha - Micasense Dual
Open Research DataDataset description: Raw images from photogrammetric survey. Object: Kościół Rzymskokatolicki Pw. Św. WojciechaLocation: Gdansk, Pomerania, PolandDrone type: N/A (terrestrial images)Flight plan: Free - walk around the object with camera. 3 images taken at the point.Target Product: 3D Model - Multispectral ModelDate: 24.04.2022Direct georeferencing:...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Open Research DataFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
Searching by heterogeneous agents
PublicationIn 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...
-
Modeling Volunteer Based Systems
PublicationThere are two main approaches to processing tasks requiring high amounts of computational power. One approach is using clusters of mostly identical hardware, placed in dedicated locations [1, 2, 3]. The other approach is outsourcing computing resources from large numbers of volunteers connected to the Internet [7]. This chapter presents an application of a mathematical model of the volunteer computing presented in Volume 1 of this...
-
Mieczysław Brdyś prof. dr hab. inż.
People -
Tomasz Wąsowicz dr hab.
PeopleTomasz Wąsowicz's research was first related to high-resolution atomic spectroscopy and focused on measurements and analysis of the transition probabilities of the forbidden lines, the hyperfine and isotopic structure of spectral lines of heavy elements, Stark effect in the helium atom. Tomasz Wąsowicz currently studies physicochemical processes occurring during interactions of various forms of radiation with atoms and molecules...
-
International Conference on Mobile Data Management
Conferences -
International Workshop on Mobile Commerce and Services
Conferences -
European Workshop on Advanced Mobile Robots
Conferences -
Developing Methods for Building Intelligent Systems of Information Resources Processing Using an Ontological Approach
PublicationThe problem of developing methods of information resource processing is investigated. A formal procedure description of processing text content is developed. A new ontological approach to the implementation of business processes is proposed. Consider that the aim of our work is to develop methods and tools for building intelligent systems of information resource processing, the core of knowledge bases of which are ontology’s, and...
-
Data obtained by computation for X-ray imaging of grating without magnification using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by computation for X-ray imaging of grating with magnification factor equal 2 using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by computation for X-ray imaging of grating with magnification factor equal 4 using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Data obtained by computation for X-ray imaging of grating with magnification factor equal 8 using oriented Gaussian beams
Open Research DataThe propagation of X-ray waves through an optical system consisting of grating and X-ray refractive lenses is considered. In this approach, the propagating wave is represented as a superposition of the oriented Gaussian beams. The direction of wave propagation in each Gaussian beam is consistent with the local propagation direction of the X-ray wavefront.
-
Evolution of Edges and Porosity of Urban Blue Spaces: A Case Study of Gdańsk
PublicationCurrent waterfront studies focus mainly on a land-based perspective, failing to include the water side. Water is, however, not just a resource for port and industrial purposes and an edge to the waterfront; it is also a feature of the waterfront and the complex relation between water and city. Thus, the article suggests that water-land edges need to be re-contextualised, taking into consideration also their shape, functionality,...
-
Karol Zdzisław Zalewski mgr inż.
People -
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Open Research DataFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Analysis of the Surface Stereometry of Alloyed Austenitic Steel after Fibre Laser Cutting using Confocal Microscopy
PublicationThe paper extends the concept of cut edge quality and examines the fibre laser cutting process. A Prima Power Platino Fiber Evo device with a reference speed (RS) of 3500 mm/min was used for laser cutting. In order to analyse the influence of the laser cutting speed on the cut edge quality of X5CrNi18-10 stainless steel sheets, macroscopic studies were conducted on a stereoscopic microscope and surface stereometry on a confocal...
-
Number of individual clients who have signed an agreement enabling the use of internet banking (2017)
Open Research DataThe data show that at the end of 2017, 32.5 million people in Poland had the opportunity to use internet banking, i.e. signed an agreement enabling the use of internet banking. It is worth noting, however, that the so-called passive users - people who have access, but do not have to log into their account via an internet connection.
-
Konsultacje on-line dr Anny Baj-Rogowskiej
e-Learning CoursesZapraszam państwa na konsultacje on-line, które odbywać się będą w semestrze zimowym 2020/2021 w każdą środę w godz. 10:45 - 11:30 na platformie MS Teams. Zalecana przeglądarka to najnowsza wersja Microsoft EDGE lub Google Chrome.
-
International Conference on 3G Mobile Communication Technologies
Conferences -
Workshop on Data Engineering for Wireless and Mobile Access
Conferences -
International Conference on Wireless Networks and Mobile Communications
Conferences -
Iwona Kochańska dr hab. inż.
PeopleIwona Kochańska is a graduate of Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology. She received M.Sc. degree in Automation Control and Robotics, specializing in the mobile objects control. In 2012 she received Ph.D. degree in hydroacoustics. In the same year she started working as an assistant professor in the Department of Marine Electronic Systems. The main area of interest is hydroacoustis, ...
-
Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) -> N+ such that |c(u)-c(v)| >= 2 for each edge uv \in E(H) and |c(u)-c(v)| >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.