Filters
total: 1759
displaying 1000 best results Help
Search results for: computer technology
-
Local Texture Pattern Selection for Efficient Face Recognition and Tracking
PublicationThis paper describes the research aimed at finding the optimal configuration of the face recognition algorithm based on local texture descriptors (binary and ternary patterns). Since the identification module was supposed to be a part of the face tracking system developed for interactive wearable computer, proper feature selection, allowing for real-time operation, became particularly important. Our experiments showed that it is...
-
Issues of Measuring the Course of Batch Production Processes
PublicationIn order to meet demands induced by development of manufacturing processes and production systems, new criteria and indicators that would allow a multiple aspect and realistic rating of batch production process courses are necessary. The objective of this paper is to present the correlation between production processes measurement, its rating and production control, basing on case study analysis from production enterprise. A new...
-
River flow simulation based on the HEC-RAS system
PublicationThis work considers the problem of river floods, and presents a computer solution that can be used to predict such a threat. The basic tool, called Hydrologic Engineering Centers for River Analysis System (HEC-RAS), and created by the US Army Corps of Engineering, is well developed; and the models created in the system HEC-RAS are quite realistic. For the purpose of solving practical national flood problems, simplified static and...
-
River Flow Simulation Based on the HEC-RAS System
PublicationThis work considers the problem of river floods, and presents a computer solution that can be used to predict such a threat. The basic tool, called Hydrologic Engineering Centers for River Analysis System (HEC-RAS), and created by the US Army Corps of Engineering, is well developed; and the models created in the system HEC-RAS are quite realistic. For the purpose of solving practical national flood problems, simplified static and...
-
Parametrical 3D model of an asynchronous motor - AutoCAD application.
PublicationA computer program for automatic drawing of 3D models of squirrel-cage induction motors is presented in this paper. The created model of a machine is of parametrical nature, which means that the user defines geometry of particular elements (shaft, stator core, bearing, windings etc.) on the basis dimensions and some other parameters e.g. type of bearing, kind of winding, number of slots. This program is useful for 3D modelling...
-
Grzegorz Gołaszewski dr inż.
PeopleGrzegorz Gołaszewski, lecturer at Gdańsk University of Technology, computer scientist, a specialist in software engineering.Graduated from the Faculty of Electronics, Telecomunications and Informatics of Gdańsk University of Technology in 2004 with a degree in Computer Science, with specialization in Software Engineering and Databases. Affiliated with the faculty since graduation. Praticipated in PIPS and ANGEL research projects....
-
Wojciech Gumiński dr inż.
PeopleWojciech Gumiński received his M.Sc. ad Ph.D. degrees from Faculty of Electronics, Telecommunications and Informatics, Gdansk University of Technology, Poland in 1991 and 2003 respectively. His scientific and research interest include computer network architectures, communication protocols and digital signal processing. Hi participated as principal investigator in several projects including Future Internet Engineering, PL-LAB...
-
Agile Requirements Prioritization in Practice: Results of an Industrial Survey
PublicationAgile software development stresses the importance of providing the customer with a product of a maximized business value. To achieve that, requirements prioritization is used. Agile development methods like Scrum define guidelines for prioritization, however practitioners do not necessarily have to follow them. Our goal was to investigate the industry practice related to requirements prioritization process, including its timing,...
-
Improving the Performance of Ontological Querying by using a Contextual Approach
PublicationIn the paper we present the results of experiment we performed to determine whether a contextual approach may be used to increase the performance of querying a knowledge base. For the experiments we have used a unique setting where we put much effort in developing a contextual and a non-contextual ontology which are as much close counterparts as possible. To achieve this we created a contextual version...
-
Contextual ontology for tonality assessment
Publicationclassification tasks. The discussion focuses on two important research hypotheses: (1) whether it is possible to construct such an ontology from a corpus of textual document, and (2) whether it is possible and beneficial to use inferencing from this ontology to support the process of sentiment classification. To support the first hypothesis we present a method of extraction of hierarchy of contexts from a set of textual documents...
-
Industry 4.0 Implementation Challenges in Manufacturing Industries: an Interpretive Structural Modelling Approach
PublicationFor the last few years, the fourth industrial revolution, known as Industry 4.0, has been a hot topic among academics. Industry 4.0 literature involves researches presenting studies related to its different aspects including challenges, opportunities, implementation and adoption. However, a detailed study of challenges and barriers towards the Industry 4.0 implementation in manufacturing industries is missing. Hence, this paper...
-
Microscopic traffic simulation models for connected and automated vehicles (CAVs) – state-of-the-art
PublicationResearch on connected and automated vehicles (CAVs) has been gaining substantial momentum in recent years. However, thevast amount of literature sources results in a wide range of applied tools and datasets, assumed methodology to investigate thepotential impacts of future CAVs traffic, and, consequently, differences in the obtained findings. This limits the scope of theircomparability and applicability and calls for a proper standardization...
-
Smart Virtual Product Development (SVPD) System to Support Product Inspection Planning in Industry 4.0
PublicationThis paper presents the idea of supporting product inspection planning process during the early stages of product life cycle for the experts working on product development. Aim of this research is to assist a collaborative product development process by using Smart Virtual Product Development (SVPD) system, which is based on Set of Experience Knowledge Structure (SOEKS) and Decisional DNA (DDNA). The proposed system is developed...
-
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...
-
Pareto Ranking Bisection Algorithm for EM-Driven Multi-Objective Design of Antennas in Highly-Dimensional Parameter Spaces
PublicationA deterministic technique for fast surrogate-assisted multi-objective design optimization of antennas in highly-dimensional parameters spaces has been discussed. In this two-stage approach, the initial approximation of the Pareto set representing the best compromise between conflicting objectives is obtained using a bisection algorithm which finds new Pareto-optimal designs by dividing the line segments interconnecting previously...
-
Finding small-width connected path decompositions in polynomial time
PublicationA connected path decomposition of a simple graph $G$ is a path decomposition $(X_1,\ldots,X_l)$ such that the subgraph of $G$ induced by $X_1\cup\cdots\cup X_i$ is connected for each $i\in\{1,\ldots,l\}$. The connected pathwidth of $G$ is then the minimum width over all connected path decompositions of $G$. We prove that for each fixed $k$, the connected pathwidth of any input graph can be computed in polynomial-time. This answers...
-
Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞-fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any cop-free path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...
-
Current trends in consumption of multimedia content using online streaming platforms: A user-centric survey
PublicationIn its early days, consumption of multimedia content was only possible at a stationary terminal device. The music player was located at home, and had to have a physical drive. Over the last decade, there has been an enormous increase in the number of online streaming platforms. These services enable users to consume rich multimedia content on various devices. Thanks to the widespread and availability of portable devices, any person...
-
2-Coloring number revisited
Publication2-Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2-coloring number can be very poor for many graphs. Additionally we prove that the 2-coloring number may grow...
-
Proposition of the methodology for Data Acquisition, Analysis and Visualization in support of Industry 4.0
PublicationIndustry 4.0 offers a comprehensive, interlinked, and holistic approach to manufacturing. It connects physical with digital and allows for better collaboration and access across departments, partners, vendors, product, and people. Consequently, it involves complex designing of highly specialized state of the art technologies. Thus, companies face formidable challenges in the adoption of these new technologies....
-
Visual content representation and retrieval for Cognitive Cyber Physical Systems
PublicationCognitive Cyber Physical Systems have gained significant attention from academia and industry during the past few decade. One of the main reasons behind this interest is the potential of such technologies to revolutionize human life since they intend to work robustly under complex visual scenes, which environmental conditions may vary, adapting to a comprehensive range of unforeseen changes, and exhibiting prospective behavior...
-
Smart Virtual Product Development (SVPD) to Enhance Product Manufacturing in Industry 4.0
PublicationThis paper presents a system capable of enhancing product development process for industrial manufactured products. This system is known as Smart Virtual Product Development (SVPD), and it helps in decision making by using explicit knowledge of formal decision events. It stores and reuses the past decisional events or sets of experiences related to different activities involved in industrial product development process i.e. product...
-
Three levels of fail-safe mode in MPI I/O NVRAM distributed cache
PublicationThe paper presents architecture and design of three versions for fail-safe data storage in a distributed cache using NVRAM in cluster nodes. In the first one, cache consistency is assured through additional buffering write requests. The second one is based on additional write log managers running on different nodes. The third one benefits from synchronization with a Parallel File System (PFS) for saving data into a new file which...
-
Modeling of Imaging Mass Spectrometry Data and Testing by Permutation for Biomarkers Discovery in Tissues
Publication -
Application of crowdfunding to video game projects financing
Publication -
Efficient parallel algorithms in global optimization of potential energy functions for peptides, proteins, and crystals
Publication -
A Surrounding World Knowledge Acquiring by Using a Low-cost Ultrasound Sensors
Publication -
Preface
Publication -
Ensemble Classifier for Mining Data Streams
Publication -
ARUZ — Large-scale, massively parallel FPGA-based analyzer of real complex systems
Publication -
Implementation of algebraic procedures on the GPU using CUDA architecture on the example of generalized eigenvalue problem
Publication -
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...
-
Universal Augmentation Schemes for Network Navigability
PublicationRozważano problem uzupełniania grafu (reprezentującego np. sieci społeczne) poprzez dodanie w każdym węźle jednego dodatkowego skierowanego połączenia (długodystansowego). Dokładniej, dla każdego węzła definiuje się listę prawdopodobieństw istnienia połączenia wychodzącego z danego węzła do wszystkich pozostałych węzłów; wartości tych prawdopodobieństw muszą sumować się do jedności. Routing zachłanny w takiej sieci polega na przekazywaniu...
-
Connected searching of weighted trees
PublicationW 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.
-
Synchronous black hole search in directed graphs
PublicationThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Smaller representation of finite state automata
PublicationThis paper is a follow-up to Jan Daciuk's experiments on space-efficient finite state automata representation that can be used directly for traversals in main memory (Daciuk, 2000)[4]. We investigate several techniques for reducing memory footprint of minimal automata, mainly exploiting the fact that transition labels and transition pointer offset values are not evenly distributed and so are suitable for compression. We achieve...
-
Optimization model of agile team’s cohesion
PublicationTeam’s cohesion is one of the most important factors of IT project execution effectiveness. Optimization of team’s cohesion gives the possibility of reducing the risk of project failure. It also allows to increase the teamwork efficiency and thus optimize time of tasks execution, increase the guarantee of maintaining the scope of the project and the chance of achieving a given level of products quality. This article presents determination...
-
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,...
-
Distinguishing views in symmetric networks: A tight lower bound
PublicationThe view of a node in a port-labeled network is an infinite tree encoding all walks in the network originating from this node. We prove that for any integers n ≥ D ≥ 1, there exists a port-labeled network with at most n nodes and diameter at most D which contains a pair of nodes whose (infinite) views are different, but whose views truncated to depth Omega( D log(n/ D )) are identical.
-
Virtual Engineering Object / Virtual Engineering Process: A specialized form of Cyber Physical System for Industrie 4.0
PublicationThis paper reviews the theories, parallels and variances between Virtual Engineering Object (VEO) / Virtual Engineering Process (VEP) and Cyber Physical System (CPS). VEO and VEP is an experience based knowledge representation of engineering objects and processes respectively. Cyber–physical systems (CPSs) are the next generation of engineered systems in which computing, communication, and control technologies are tightly integrated....
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Implementing Virtual Engineering Objects (VEO) with the Set of Experience Knowledge Structure (SOEKS)
PublicationThis paper illustrates the idea of Virtual Engineering Object (VEO) powered by Set of Experience Knowledge Structure (SOEKS) and Decisional DNA (DDNA). A VEO is the knowledge representation of an engineering object, having embodiment of all its associated knowledge and experience within it. Moreover, VEO is a specialization of Cyber-Physical System (CPS) in terms of that its extension in knowledge gathering and reuse, whereas CPS...
-
Low-Cost EM-Simulation-Driven Multi-Objective Optimization of Antennas
PublicationA surrogate-based method for efficient multi-objective antenna optimization is presented. Our technique exploits response surface approximation (RSA) model constructed from sampled low-fidelity antenna model (here, obtained through coarse-discretization EM simulation). The RSA model enables fast determination of the best available trade-offs between conflicting design goals. A low-cost RSA model construction is possible through...
-
Fast Low-fidelity Wing Aerodynamics Model for Surrogate-Based Shape Optimization
PublicationVariable-fidelity optimization (VFO) can be efficient in terms of the computational cost when compared with traditional approaches, such as gradient-based methods with adjoint sensitivity information. In variable-fidelity methods, the directoptimization of the expensive high-fidelity model is replaced by iterative re-optimization of a physics-based surrogate model, which is constructed from a corrected low-fidelity model. The success...
-
Viability of decisional DNA in robotics
PublicationThe Decisional DNA is an artificial intelligence system that uses prior experiences to shape future decisions. Decisional DNA is written in the Set Of Experience Knowledge Structure (SOEKS) and is capable of capturing and reusing a broad range of data. Decisional DNA has been implemented in several fields including Alzheimer’s diagnosis, geothermal energy and smart TV. Decisional DNA is well suited to use in robotics due to the...
-
The Hybrid Fuzzy - SOEKS Approach to the Polish Internet Mortgage Market
PublicationThe paper presents the hybrid fuzzy- SOEKS approach to the Polish Internet mortgage market, which is treated as an example of a fast changing market. Firstly, the market and market problems are described. Then, the first approach to the market problems is presented: the complete fuzzy model which was built basing on the rules. The fuzzy model is presented on one real data case. Next, the new approach, called Set of Experience Knowledge...
-
Brushing with additional cleaning restrictions
PublicationIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
VIBRATION DIAGNOSTICS OF FOOTBRIDGE WITH USE OF ROTATION SENSOR
PublicationThe benefits of the additional measurement of rotational degrees of free-dom on the performance of the vibration diagnosis of bridges are studied in this paper. The common vibrational diagnostics that uses translational degrees of freedom is extended by measurements of rotations. The study is curried out on a footbridge and the presence of damage as well as its location and size is determined with use of FEM updating procedure....
-
A fast algorithm for computing the flux around non-overlapping disks on the plane
Publication -
Computer modeling and testing of structural metamaterials
Publication