Filters
total: 2330
filtered: 1314
-
Catalog
- Publications 1314 available results
- Journals 283 available results
- Conferences 142 available results
- People 242 available results
- Projects 2 available results
- Research Teams 1 available results
- e-Learning Courses 85 available results
- Events 5 available results
- Open Research Data 256 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: computer
-
The Effectiveness of Computerized Cognitive Training Combined With Whole Body Cryotherapy in Improving Cognitive Functions in Older Adults. A Case Control Study
Publication -
A note on the affective computing systems and machines: a classification and appraisal
PublicationAffective computing (AfC) is a continuously growing multidisciplinary field, spanning areas from artificial intelligence, throughout engineering, psychology, education, cognitive science, to sociology. Therefore, many studies have been devoted to the aim of addressing numerous issues, regarding different facets of AfC solutions. However, there is a lack of classification of the AfC systems. This study aims to fill this gap by reviewing...
-
Aiming at methods’ wider adoption: Applicability determinants and metrics
PublicationNumerous computer science methods and techniques have been proposed by the scientific community. However, depending on the domain, only their minor fraction has met wider adoption. This paper brings attention to the concept of applicability - the notion that is well acknowledged in the scientific field but have not been analysed with respect to determinants, metrics and systematisation. The primary objective of the study was to...
-
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...
-
Human Feedback and Knowledge Discovery: Towards Cognitive Systems Optimization
PublicationCurrent computer vision systems, especially those using machine learning techniques are data-hungry and frequently only perform well when dealing with patterns they have seen before. As an alternative, cognitive systems have become a focus of attention for applications that involve complex visual scenes, and in which conditions may vary. In theory, cognitive applications uses current machine learning algorithms, such as deep learning,...
-
Path integrals formulations leading to propagator evaluation for coupled linear physics in large geometric models
PublicationReformulating linear physics using second kind Fredholm equations is very standard practice. One of the straightforward consequences is that the resulting integrals can be expanded (when the Neumann expansion converges) and probabilized, leading to path statistics and Monte Carlo estimations. An essential feature of these algorithms is that they also allow to estimate propagators for all types of sources, including initial conditions....
-
Airfoil Design Under Uncertainty Using Non-Intrusive Polynomial Chaos Theory and Utility Functions
PublicationFast and accurate airfoil design under uncertainty using non-intrusive polynomial chaos (NIPC) expansions and utility functions is proposed. The NIPC expansions provide a means to efficiently and accurately compute statistical information for a given set of input variables with associated probability distribution. Utility functions provide a way to rigorously formulate the design problem. In this work, these two methods are integrated...
-
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...
-
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...
-
Modeling of Imaging Mass Spectrometry Data and Testing by Permutation for Biomarkers Discovery in Tissues
Publication -
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...
-
Approximate search strategies for weighted trees
PublicationW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
An extended basis inexact shift–invert Lanczos for the efficient solution of large-scale generalized eigenproblems
PublicationThis paper proposes a technique, based on the Inexact Shift–Invert Lanczos (ISIL) method with Inexact Jacobi Orthogonal Component Correction (IJOCC) refinement, and a preconditioned conjugate-gradient (PCG) linear solver with multilevel preconditioner, for finding several eigenvalues for generalized symmetric eigenproblems. Several eigenvalues are found by constructing (with the ISIL process) an extended projection basis. Presented...
-
Cybersecurity and Privacy in Standards for Smart Grids – a Comprehensive Survey
PublicationResilient information and communications technologies are a prerequisite for reliable operation of smart grid. In recent years, many standards for the new form of electricity network have been proposed, which results in operators and other smart grid stakeholders having difficulties in finding the documents which can be related to their particular problems. The purpose of this paper is to bring in all smart grid standards that...
-
Modeling and Simulation for Exploring Power/Time Trade-off of Parallel Deep Neural Network Training
PublicationIn the paper we tackle bi-objective execution time and power consumption optimization problem concerning execution of parallel applications. We propose using a discrete-event simulation environment for exploring this power/time trade-off in the form of a Pareto front. The solution is verified by a case study based on a real deep neural network training application for automatic speech recognition. A simulation lasting over 2 hours...
-
A distributed system for conducting chess games in parallel
PublicationThis paper proposes a distributed and scalable cloud based system designed to play chess games in parallel. Games can be played between chess engines alone or between clusters created by combined chess engines. The system has a built-in mechanism that compares engines, based on Elo ranking which finally presents the strength of each tested approach. If an approach needs more computational power, the design of the system allows...
-
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....
-
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...
-
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...
-
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”,...
-
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...
-
The complexity of zero-visibility cops and robber
PublicationWe consider the zero-visibility cops & robber game restricted to trees. We produce a characterisation of trees of copnumber k and We consider the computational complexity of the zero-visibility Cops and Robber game. We present a heavily modified version of an already-existing algorithm that computes the zero-visibility copnumber of a tree in linear time and we show that the corresponding decision problem is NP-complete on a nontrivial...
-
A highly-efficient technique for evaluating bond-orientational order parameters
PublicationWe propose a novel, highly-efficient approach for the evaluation of bond-orientational order parameters (BOPs). Our approach exploits the properties of spherical harmonics and Wigner 3jj-symbols to reduce the number of terms in the expressions for BOPs, and employs simultaneous interpolation of normalised associated Legendre polynomials and trigonometric functions to dramatically reduce the total number of arithmetic operations....
-
Tools, Methods and Services Enhancing the Usage of the Kepler-based Scientific Workflow Framework
PublicationScientific workflow systems are designed to compose and execute either a series of computational or data manipulation steps, or workflows in a scientific application. They are usually a part of a larger eScience environment. The usage of workflow systems, however very beneficial, is mostly not irrelevant for scientists. There are many requirements for additional functionalities around scientific workflows systems that need to be...
-
Investigation of Vibro-Acoustical Properties Using Eigenvalue Problem Solution and Wavelets
Publication -
Finding Temperature Distribution at Heat Recovery Unit Using Genetic Algorithms
Publication -
Optimization of multilayer rail substrate under moving load, using metamaterials.
Publication -
On some aspects of Concurrent Control Processes Modelling and Implementation in LAD Diagram Language With Use of New Generation Engineering Software
Publication -
Finite State Machine Based Modelling of Discrete Control Algorithm in LAD Diagram Language With Use of New Generation Engineering Software
Publication -
Operational Properties Investigation of The Flat-Plate Solar Collector with Poliuretane Foam Insulation
Publication -
Dynamics of changes in Poland in the light of the Industry 4.0
Publication -
Autonomous control of a mobile robot to explore areas with difficult terrain
Publication -
IPNES - Interpreted Petri Net for Embedded Systems
Publication -
Selected reflections on formal modeling in Industry 4.0
Publication -
A Concept of a Training Project IT Management System
Publication -
Implementation of an example of Hierarchical Petri Net (HPN) in LAD language in TIA Portal
Publication -
Investigation of Anti-Lock Braking System failures using wavelet analysis
Publication -
Thermo-mechanic tests using 3d printed elements
Publication -
A Novel Framework for Decision Support System in Human Resource Management
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 -
Extensions of Quasilinearization Method for Differential Equations with Integral Boundary Conditions
PublicationPraca dotyczy równań różniczkowych z warunkami brzegowymi typu całkowego. Podano warunki dostateczne na istnienie jedynego rozwiązania takiego zagadnienia i pokazano, że odpowiednio konstruowane ciągi monotoniczne są zbieżne do tego rozwiązania i jest to zbieżność kwadratowa. Te monotoniczne ciągi są przybliżonymi rozwiązaniami problemu wyjściowego i obustronnie szacują szukane rozwiązanie.
-
Finite automata for compact representation of tuple dictionaries.
PublicationOpisane zostaje uogólnienie struktury danych - słownika, zwane słownikiem n-tek. Słownik n-tek przedstawia odwzorowanie n-tek łańcuchów znaków na pewne wartości. Motywacją dla powstania tej struktury danych są praktyczne zastosowania w przetwarzaniu języka i mowy, w których obszerne słowniki n-tek używane są do przedstawiania modeli języka. Przedstawiona zostaje technika oszczędnej reprezentacji słowników n-tek. Ta technika...
-
Rank two bibartite bound entangled states do not exist.
PublicationWykazano, że nie istnieją stany rzędu dwa które zawierałyby splątanie. Pokazano związki między lokalnym a globalnym rzędem macierzy gęstości oraz ewentualną możliwością wydestylowania kwantowego splątania.
-
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...
-
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 -
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.