Search
Filters
total: 1724
filtered: 1242
-
Catalog
- Publications 1242 available results
- Journals 169 available results
- Conferences 176 available results
- Publishing Houses 1 available results
- People 39 available results
- Projects 7 available results
- e-Learning Courses 13 available results
- Events 1 available results
- Open Research Data 76 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: MOBILE EDGE COMPUTING
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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....
-
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...
-
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...
-
A Method and Device for 3D Recognition of Cutting Edge Micro Geometry
PublicationA very useful method was successfully applied in the investigation of tools for machining wood and wood based composites. It allows scanning of the cutting edge micro geometry in three dimensions and reproducing it in a virtual space as a 3D surface. The application of the method opens new possibilities of studying tool wear by scanning, including the calculation of volume loss and other analysis of tool wedge geometry along and...
-
Complementary oriented allocation algorithm for cloud computing
PublicationNowadays cloud computing is one of the most popular processing models. More and more different kinds of workloads have been migrated to clouds. This trend obliges the community to design algorithms which could optimize the usage of cloud resources and be more effiient and effective. The paper proposes a new model of workload allocation which bases on the complementarity relation and analyzes it. An example of a case of use is shown...
-
Affective computing and affective learning – methods, tools and prospects
PublicationEvery teacher knows that interest, active participation and motivation are important factors in the learning process. At the same time e-learning environments almost always address only the cognitive aspects of education. This paper provides a brief review of methods used for affect recognition, representation and processing as well as investigates how these methods may be used to address affective aspect of e-education. The paper...
-
Self-stabilizing algorithm for edge-coloring of graphs
PublicationReferat ten poświęcony jest kolorowaniu grafów w modelu rozproszonym.Podano samostabilizujący się algorytm kolorowania krawędzi grafu wraz z dowodem poprawności oraz oszacowaniem jego czasu działania.
-
Mobile Activity Plan Applications for Behavioral Therapy of Autistic Children
PublicationThis paper concerns technological support for behavioral therapy of autistic children. A family of tools dedicated for mobile devices is presented, that allows to design and perform an activity schedule in behavioral therapy. The paper describes the main challenges, that were encountered, especially in meeting the non-functional requirements of the application: simplicity, repeatability, robustness, personalization, re-usability...
-
Parallel Programming for Modern High Performance Computing Systems
PublicationIn view of the growing presence and popularity of multicore and manycore processors, accelerators, and coprocessors, as well as clusters using such computing devices, the development of efficient parallel applications has become a key challenge to be able to exploit the performance of such systems. This book covers the scope of parallel programming for modern high performance computing systems. It first discusses selected and...
-
Collaborative Exploration of Trees by Energy-Constrained Mobile Robots
PublicationWe study the problem of exploration of a tree by mobile agents (robots) that have limited energy. The energy constraint bounds the number of edges that can be traversed by a single agent. We use a team of agents to collectively explore the tree and the objective is to minimize the size of this team. The agents start at a single node, the designated root of the tree and the height of the tree is assumed to be less than the energy...
-
Performance of Noise Map Service Working in Cloud Computing Environment
PublicationIn the paper a noise map service designated for the user interested in environmental noise subject is presented. It is based on cloud computing. Noise prediction algorithm and source model, developed for creating acoustic maps, are working in cloud computing environment. In the study issues related to noise modeling of sound propagation in urban spaces are discussed with a special focus on road noise. Examples of results obtained...
-
A Human Behaviour Model Agent for Testing of Voluntary Computing Systems
PublicationPaper presents a design and performance of a voluntary-based distributed computing system testing agent, implementing a human behaviour model. The agent, nicknamed iRobot, was designed and implemented to enable controlled, large scale testing of core algorithms of Comcute - a new voluntary distributed computing platform complementary to BOINC. The main agent design goals were: emulation of human behaviour when browsing web pages,...
-
Investigation of educational processes with affective computing methods
PublicationThis paper concerns the monitoring of educational processes with the use of new technologies for the recognition of human emotions. This paper summarizes results from three experiments, aimed at the validation of applying emotion recognition to e-learning. An analysis of the experiments’ executions provides an evaluation of the emotion elicitation methods used to monitor learners. The comparison of affect recognition algorithms...
-
Design of control algorithms for mobile robots in an environment with static and dynamic obstacles
PublicationThis article proposes the construction of autonomous mobile robots and designing of obstacle avoidance algorithms for them. Nowadays, mobile robots are gaining more and more popularity on the customer as well as industrial market, for example as automatic vacuum cleaners or lawnmowers. Obstacle avoidance algorithms play an important role in performance of this types of robots. The proposed algorithms were designed for builds with...
-
MAlSim - Mobile Agent Malware Simulator
PublicationOne of the problems related to the simulation of attacks against critical infrastructures is the lack of adequate tools for the simulation of malicious software (malware). Malware attacks are the most frequent in the Internet and they pose a serious threat against critical networked infrastructures. To address this issue we developed Mobile Agent Malware Simulator (MAISim). The framework uses the technology of mobile agents and...
-
Tuning the work function of graphite nanoparticles via edge termination
PublicationGraphite nanoparticles are important in energy materials applications such as lithium-ion batteries (LIBs), supercapacitors and as catalyst supports. Tuning the work function of the nanoparticles allows local control of lithiation behaviour in LIBs, and the potential of zero charge of electrocatalysts and supercapacitors. Using large scale density functional theory (DFT) calculations, we find that the surface termination of multilayer...
-
Edge-Guided Mode Performance and Applications in Nonreciprocal Millimeter-Wave Gyroelectric Components
PublicationThe analogies between the behavior of gyromagnetic and gyroelectric nonreciprocal structures, the use of the simple transfer matrix approach, and the edge-guided (EG) wave property, supported in a parallel plate model for integrated magnetized semiconductor waveguide, are investigated in those frequency regions, where the effective permittivity is negative or positive. As with their ferrite counterparts, the leakage of the EG waves...
-
An O ( n log n ) algorithm for finding edge span of cacti
PublicationLet G=(V,E) be a nonempty graph and xi be a function. In the paper we study the computational complexity of the problem of finding vertex colorings c of G such that: (1) |c(u)-c(v)|>=xi(uv) for each edge uv of E; (2) the edge span of c, i.e. max{|c(u)-c(v)|: uv belongs to E}, is minimal. We show that the problem is NP-hard for subcubic outerplanar graphs of a very simple structure (similar to cycles) and polynomially solvable for...
-
The edge of the [dis]order
Publication -
Usability of Mobile Applications: A Consolidated Model
PublicationMobile devices have become an integral part of the digital ecosystem, connecting people, businesses, and information around the world in ways never before possible. In particular, smartphones, tablets and other handheld devices equipped with mobile applications have changed every aspect of our lives. Today, a user can choose from nearly five million applications available for both Android and iOS operating systems. However, only...
-
Usability Testing of Mobile Applications: A Methodological Framework
PublicationLess than five percent of all mobile applications have become successful throughout 2023. The success of a new mobile application depends on a variety of factors ranging from business understanding, customer value, and perceived quality of use. In this sense, the topic of usability testing of mobile applications is relevant from the point of view of user satisfaction and acceptance. However, the current knowledge seems to be fragmented,...
-
Mobile application technology in levelling
PublicationThe topic of this article is the use of mobile application technology in geodetic measurements with an emphasis on levelling. Reference points were registered as data from levelling benchmarks, performed with a traditional dumpy level. The created application allowed the recording of measurements on location, sending them to a remote server for processing and preparing a report to be saved in a database. The project was to decrease...
-
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...
-
BeesyCluster as Front-End for High Performance Computing Services
PublicationThe paper presents the BeesyCluster system as a middleware allowing invocation of services on high performance computing resources within the NIWA Centre of Competence project. Access is possible through both WWW and SOAP Web Service interfaces. The former allows non-experienced users to invoke both simple and complex services exposed through easyto-use servlets. The latter is meant for integration of external applications with...
-
Teaching High Performance Computing Using BeesyCluster and Relevant Usage Statistics
PublicationThe paper presents motivations and experiences from using the BeesyCluster middleware for teaching high performance computing at the Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology. Features of BeesyCluster well suited for conducting courses are discussed including: easy-to-use WWW interface for application development and running hiding queuing systems, publishing applications as services...
-
General Provisioning Strategy for Local Specialized Cloud Computing Environments
PublicationThe well-known management strategies in cloud computing based on SLA requirements are considered. A deterministic parallel provisioning algorithm has been prepared and used to show its behavior for three different requirements: load balancing, consolidation, and fault tolerance. The impact of these strategies on the total execution time of different sets of services is analyzed for randomly chosen sets of data. This makes it possible...
-
Dynamical description of quantum computing: generic nonlocality of quantumnoise
PublicationWe develop a dynamical non-Markovian description of quantum computing in the weak-coupling limit, in the lowest-order approximation. We show that the long-range memory of the quantum reservoir (such as the 1/t4 one exhibited by electromagnetic vacuum) produces a strong interrelation between the structure of noise and the quantum algorithm, implying nonlocal attacks of noise. This shows that the implicit assumption of quantum error...
-
POLDER AND CITY: SUSTAINING WATER LANDSCAPES ON AN URBAN EDGE
PublicationThe question investigated in this paper is how to maintain the environmental quality of the polder landscape encompassing the city in the condition of urban pressure on this landscape. On the basis of theoretical approaches, historical surveys and introductory study models new ideas are tested on the case study of Gdansk, a city located in the Vistula River delta in northern Poland. Research shows that the city was created as a...
-
Genetic Programming for Interaction Efficient Supporting in Volunteer Computing Systems
PublicationVolunteer computing systems provide a middleware for interaction between project owners and great number volunteers. In this chapter, a genetic programming paradigm has been proposed to a multi-objective scheduler design for efficient using some resources of volunteer computers via the web. In a studied problem, genetic scheduler can optimize both a workload of a bottleneck computer and cost of system. Genetic programming has been...
-
Big Data Processing by Volunteer Computing Supported by Intelligent Agents
PublicationIn this paper, volunteer computing systems have been proposed for big data processing. Moreover, intelligent agents have been developed to efficiency improvement of a grid middleware layer. In consequence, an intelligent volunteer grid has been equipped with agents that belong to five sets. The first one consists of some user tasks. Furthermore, two kinds of semi-intelligent tasks have been introduced to implement a middleware...
-
Mobile Laser Scanning Calibration on a Marine Platform
PublicationThe article describes the method of calibration of the Riegl VMZ-400 mobile scanning system on a floating platform and an experiment aimed at conducting measurements from a previously calibrated instrument. The issue of factors affecting the quality of measurements was discussed. Mobile laser scanning is an increasingly popular measurement solution, but it is still innovative on a European scale. The use of a floating platform...
-
Genetic Programming with Negative Selection for Volunteer Computing System Optimization
PublicationVolunteer computing systems like BOINC or Comcute are strongly supported by a great number of volunteers who contribute resources of their computers via the Web. So, the high efficiency of such grid system is required, and that is why we have formulated a multi-criterion optimization problem for a volunteer grid system design. In that dilemma, both the cost of the host system and workload of a bottleneck host are minimized. On...