Search
Filters
total: 1772
-
Catalog
- Publications 1239 available results
- Journals 169 available results
- Conferences 176 available results
- Publishing Houses 1 available results
- People 38 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
-
Optical Sensor Based Gestures Inference Using Recurrent Neural Network in Mobile Conditions
PublicationIn this paper the implementation of recurrent neural network models for hand gesture recognition on edge devices was performed. The models were trained with 27 hand gestures recorded with the use of a linear optical sensor consisting of 8 photodiodes and 4 LEDs. Different models, trained off-line, were tested in terms of different network topologies (different number of neurons and layers) and different effective sampling frequency...
-
Adaptacyjny system oświetlania dróg oraz inteligentnych miast
PublicationPrzedmiotem rozprawy jest zbadanie praktycznej możliwości wykrywania w czasie rzeczywistym anomalii w systemie oświetlenia drogowego w oparciu o analizę danych ze inteligentnych liczników energii. Zastosowanie inteligentnych liczników energii elektrycznej (Smart Meter) w systemach oświetlenia drogowego stwarza nowe możliwości w zakresie automatycznej diagnostyki takich niepożądanych zjawisk jak awarie lamp, odstępstwa od harmonogramu...
-
Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
PublicationOne of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...
-
A collection of directed graphs for the minimum cycle mean weight computation
Open Research DataThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
Model otwartej architektury rozproszonych dokumentów elektronicznych wspierającej proces podejmowania decyzji w trybie obliczeń zespołowych
PublicationModel otwartej architektury mobilnych dokumentów interaktywnych MIND, został opracowany w celu efektywnego zarządzania informacją w procesach podejmowanych przez organizacje oparte na wiedzy. Architektura ta stanowi całościowy opis struktury i funkcjonalności dokumentu, zaprojektowanego w celu realizacji rozproszonego przetwarzania zespołowego i pracy grupowej. Umożliwia automatyczne przejście od statycznej postaci dokumentów...
-
Gossiping by energy-constrained mobile agents in tree networks
PublicationEvery node of an edge-weighted tree network contains a data packet. At some nodes are placed mobile agents, each one possessing an amount of energy (not necessarily the same for all agents). While walking along the network, the agents spend the energy proportionally to the distance traveled and collect copies of the data packets present at the visited network nodes. An agent visiting a node deposits there copies of all currently...
-
Practical Approach to IP Scheduled Throughput Measurements in Dual Connectivity Systems
PublicationIP scheduled throughput defined according to 3GPP TS 36.314 reflects user throughput regardless of traffic characteristics, and therefore has become one of the most important indicators for monitoring Quality of Service (QoS) of the end user in Evolved Universal Terrestrial Radio Access Network (E-UTRAN). However, networks built on a distributed architecture make the above definition impossible to be applied directly due to the...
-
Co stymuluje rozwój współczesnej teleinformatyki i jakie są istotne kierunki tego rozwoju?
PublicationCorocznie dokonuje się oceny stanu sztuki i tendencji w rozwoju światowej telekomunikacji i (tele)informatyki przywołując „mierzalne” i „niemierzalne” zmiany. W artykule przedstawiono charakter tych zmian oraz wskazano wyzwania badawcze i wdrożeniowe istotne dla rozwoju tych dyscyplin. Zaprezentowano i scharakteryzowano ewolucję infrastruktury sieciowej prowadzącą do sieci programowalnych SDN (Software Defined Network) oraz wykorzystania...
-
Automated Classifier Development Process for Recognizing Book Pages from Video Frames
PublicationOne of the latest developments made by publishing companies is introducing mixed and augmented reality to their printed media (e.g. to produce augmented books). An important computer vision problem that they are facing is classification of book pages from video frames. The problem is non-trivial, especially considering that typical training data is limited to only one digital original per book page, while the trained classifier...
-
A Review of Emotion Recognition Methods Based on Data Acquired via Smartphone Sensors
PublicationIn recent years, emotion recognition algorithms have achieved high efficiency, allowing the development of various affective and affect-aware applications. This advancement has taken place mainly in the environment of personal computers offering the appropriate hardware and sufficient power to process complex data from video, audio, and other channels. However, the increase in computing and communication capabilities of smartphones,...
-
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
PublicationWe study the classical and quantum values of a class of one-and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR(XOR-d) games we study are a subclass of the well-known linear games. We introduce a 'constraint graph' associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the...
-
LTE and NB-IoT Performance Estimation Based on Indicators Measured by the Radio Module
PublicationMonitoring the operating parameters of power grids is extremely important for their proper functioning as well as for ensuring the security of the entire infrastructure. As the idea of the Internet of Things becomes more ubiquitous, there are tools for monitoring the state of the complex electrical grid and means to control it. There are also developed new measuring devices and transmission technologies allowing for the transfer...
-
Sawing Processes as a Way of Determining Fracture Toughness and Shear Yield Stresses of Wood
PublicationA new computational model, based on fracture mechanics, was used to determine cutting forces. Unlike traditional computing methods, which depend on many coefficients reflecting the machining of solid wood, the new model uses two main parameters: fracture toughness and shear yield stresses. The aim of this study was to apply this new method to determine these parameters for the tooth cutting edge principal positions and longitudinal...
-
Detection of Anomalies in the Operation of a Road Lighting System Based on Data from Smart Electricity Meters
PublicationSmart meters in road lighting systems create new opportunities for automatic diagnostics of undesirable phenomena such as lamp failures, schedule deviations, or energy theft from the power grid. Such a solution fits into the smart cities concept, where an adaptive lighting system creates new challenges with respect to the monitoring function. This article presents research results indicating the practical feasibility of real‐time...
-
Cross-layer mDNS/ARP integration for IEEE 802.11s Wireless mesh Network
PublicationPopularization of mobile computing devices created a need for robust, efficient and ubiquitous methods of communication and network access. At the same time, evolution and standardization of Wireless Local Area Network (WLAN) technologies made them an attractive solution for building of complex network systems. Moreover, growing maturity of WLAN standards such as IEEE 802.11 allows for introduction of WLAN architectures other than...
-
ROBOT TYPU QUADROCOPTER STEROWANY MIKROKONTROLERAMI O NIEWIELKIEJ MOCY OBLICZENIOWEJ
PublicationWspółczesna robotyka rozwija się bardzo dynamicznie. Coraz więcej osób prywatnych i inżynierów konstruuje różnego rodzaju pojazdy mobilne. Dlatego autorzy niniejszego referatu postawili sobie następującą tezę: możliwa jest budowa latającego robota mobilnego na bazie kontrolera o niskiej mocy obliczeniowej oraz prostego regulatora, i podjęli się jej udowodnienia.
-
Architektura przyszłości – przekraczanie granic poprzez interfejsy
PublicationArchitektura przyszłości rozpatrywana jest w kontekście rozwoju technologii cyfrowych, które umożliwiają nadawanie obiektom architektonicznym cech interfejsów. Przekraczanie granic dotyczy więc nadawania architekturze nowych funkcji - funkcjonalności zapożyczonych ze świata wirtualnego, emisji informacji oraz interakcji. W tym ujęciu „interfejs architektoniczny” stanowi płaszczyznę komunikacji pomiędzy obiektem architektonicznym...
-
Biblioteka PG w strukturach ogólnokrajowej sieci bibliotecznej (OSB)
PublicationBiblioteka Politechniki Gdańskiej została włączona do ogólnokrajowej sieci bibliotecznej (OSB). Proces rozbudowy OSB opiera się na wdrażaniu działającego w chmurze (cloud computing) systemu bibliotecznego Alma (z wyszukiwarką Primo), używanego przez ponad 3 tysiące bibliotek na świecie. Jest to system biblioteczny nowej generacji działający w oparciu o usługę chmurową typu Multitenant SaaS. Oznacza to, że system biblioteczny...
-
Mobile Security: Threats and Best Practices
PublicationCommunicating mobile security threats and best practices has become a central objective due to the ongoing discovery of new vulnerabilities of mobile devices. To cope with this overarching issue, the goal of this paper is to identify and analyze existing threats and best practices in the domain of mobile security. To this extent, we conducted a literature review based on a set of keywords. The obtained results concern recognizable...
-
Distributed Evacuation in Graphs with Multiple Exits
PublicationWe consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent at each time step. Thus, the agents must choose their movements strategy...
-
Soft Real-Time Communication with WebSocket and WebRTC Protocols Performance Analysis for Web-based Control Loops
PublicationThe web browser has become an access window for content and services. The browser is available on almost any device connected to the network, regardless of its intended use: desktop, mobile device, computing server, e-book reader etc. Browsers are used by people to read news, contact the world, to check a bank account, register a visit at the doctor, watching video content, electronic purchases, using web versions of the office...
-
Leading Edge
Journals -
Global edge alliances in graphs
PublicationIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Edge subdivision and edge multisubdivision versus some domination related parameters in generalized corona graphs
PublicationGiven a graph G= (V, E), the subdivision of an edge e=uv∈E(G) means the substitution of the edge e by a vertex x and the new edges ux and xv. The domination subdivision number of a graph G is the minimum number of edges of G which must be subdivided (where each edge can be subdivided at most once) in order to increase the domination number. Also, the domination multisubdivision number of G is the minimum number of subdivisions...
-
Optimal edge-coloring with edge rate constraints
PublicationWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
On minimum cost edge searching
PublicationWe 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...
-
Affective Computing
e-Learning Courses -
Influence of edge subdivision on the convex domination number
PublicationWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Advances in Intelligent Systems and Computing
Journals -
Agnieszka Landowska dr hab. inż.
PeopleAgnieszka Landowska works for Gdansk University of Technology, FETI, Department of Software Engineering. Her research concentrates on usability, accessibility and technology adoption, as well as affective computing methods. She initiated Emotions in HCI Research Group and conducts resarch on User eXperiene evaluation of applications and other technologies.
-
ARTIFICIAL MODEL IN THE ASSESSMENT OF THE ALGORITHM OF OBJECTS RECORDED BY LASER SCANNING SHAPE DETECTION (ALS/TLS)
PublicationBrief description of the study and used methods. Brief description of the study and used As part of the preparatory work aimed to create the application solution allowing for the automation of searching objects in data, obtained in the scanning process using ALS (Airborne Laser Scanning) or TLS (Terrestrial Laser Scanning), the authors prepared a artificial (synthetic, theoretical) model of space, used for the verification of operation...
-
Considerations of Computational Efficiency in Volunteer and Cluster Computing
PublicationIn the paper we focus on analysis of performance and power consumption statistics for two modern environments used for computing – volunteer and cluster based systems. The former integrate computational power donated by volunteers from their own locations, often towards social oriented or targeted initiatives, be it of medical, mathematical or space nature. The latter is meant for high performance computing and is typically installed...
-
Tight bounds on global edge and complete alliances in trees
PublicationIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Optimization issues in distributed computing systems design
PublicationIn recent years, we observe a growing interest focused on distributed computing systems. Both industry and academia require increasing computational power to process and analyze large amount of data, including significant areas like analysis of medical data, earthquake, or weather forecast. Since distributed computing systems – similar to computer networks – are vulnerable to failures, survivability mechanisms are indispensable...
-
Crowdsourcing and Volunteer Computing as Distributed Approach for Problem Solving
PublicationIn this paper, a combination between volunteer computing and crowdsourcing is presented. Two paradigms of the web computing are described, analyzed and compared in detail: grid computing and volunteer computing. Characteristics of BOINC and its contribution to global Internet processing are shown with the stress put onto applications the system can facilitate and problems it can solve. An alternative instance of a grid computing...
-
Quality Modeling in Grid and Volunteer-Computing Systems
PublicationA model of computational quality in large-scale computing systems was presented in the previous chapter of this book. This model describes three quality attributes: performance, reliability and energy efficiency. We assumed that all processes in the system are incessantly ready to perform calculations and that communication between the processes occurs immediately. These assumptions are not true for grid and volunteer computing...
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Comparison of edge detection algorithms for electric wire recognition
PublicationEdge detection is the preliminary step in image processing for object detection and recognition procedure. It allows to remove useless information and reduce amount of data before further analysis. The paper contains the comparison of edge detection algorithms optimized for detection of horizontal edges. For comparison purposes the algorithms were implemented in the developed application dedicated to detection of electric line...
-
Badanie jakości transmisji w podsystemie EDGE.
PublicationPrzedstawiono wyniki badań symulacyjnych jakości transmisji w podsystemie EDGE, będącego rozwinięciem systemu GSM w kierunku systemu trzeciej generacji. Uzyskane wyniki odnoszą się do szybkiej transmisji danych, realizowanej w oparciu o komutację kanałów ECSD oraz komutację pakietów EGPRS dla wybranych środowisk propagacyjnych.
-
Long Distance Geographically Distributed InfiniBand Based Computing
PublicationCollaboration between multiple computing centres, referred as federated computing is becom- ing important pillar of High Performance Computing (HPC) and will be one of its key components in the future. To test technical possibilities of future collaboration using 100 Gb optic fiber link (Connection was 900 km in length with 9 ms RTT time) we prepared two scenarios of operation. In the first one, Interdisciplinary Centre for Mathematical...
-
On Computing Curlicues Generated by Circle Homeomorphisms
PublicationThe dataset entitled Computing dynamical curlicues contains values of consecutive points on a curlicue generated, respectively, by rotation on the circle by different angles, the Arnold circle map (with various parameter values) and an exemplary sequence as well as corresponding diameters and Birkhoff averages of these curves. We additionally provide source codes of the Matlab programs which can be used to generate and plot the...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Metaheuristic algorithms for optimization of resilient overlay computing systems
PublicationThe idea of distributed computing systems has been gaining much interest in recent years owing to the growing amount of data to be processed for both industrial and academic purposes. However, similar to other systems, also distributed computing systems are vulnerable to failures. Due to strict QoS requirements, survivability guarantees are necessary for provisioning of uninterrupted service. In this article, we focus on reliability...
-
Number of active users of the mobile banking application (only a mobile phone) - 2017
Open Research DataCustomers using mobile devices can use their bank account via the bank's website or a separate application. Such a solution allows for easier logging in (usually no customer number is required, but only a password) and a number of additional functions (from a more extensive interface to a larger number of possible operations - making a transfer, opening...
-
On the approximation of the UWB dipole elliptical arms with stepped-edge polygon
PublicationA simple method of approximation of the ellipticalpatch with stepped-edge polygon is proposed as an introductionto wider studies over the planar ultrawideband (UWB) antennas.The general idea is to replace the elliptical patch with an equivalentpolygonal patch, with minimum loss in the performance. Theprinciples of the proposed method are presented in this letter, aswell as the results of performed numerical studies and its experimentalverification....
-
A Point Set Connection Problem for Autonomous Mobile Robots in a Grid
PublicationConsider 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...
-
Berkeley Open Infrastructure for Network Computing
PublicationZaprezentowano system BOINC (ang. Berkeley Open Infrastructure for Network Computing) jako interesujące rozwiązanie integrujące rozproszone moce obliczeniowe osobistych komputerów typu PC w Internecie. Przedstawiono zasadę działania opisywanej platformy. W dalszej części zaprezentowano kilka wybranych projektów naukowych wykorzystujących BOINC, które są reprezentatywne w zakresie zastosowania systemu w ujęciu założonego paradygmatu...
-
Quality Expectations of Mobile Subscribers
PublicationMobile systems, by nature, have finite resources. Radio spectrum is limited, expensive and shared between many users and services. Mobile broadband networks must support multiple applications of voice, video and data on a single IP-based infrastructure. These converged services each have unique traffic holding and quality requirements. A positive user experience must be obtained through efficient partitioning of the available wireless...