Filters
total: 3832
filtered: 1885
-
Catalog
- Publications 1885 available results
- Journals 295 available results
- Conferences 132 available results
- People 253 available results
- Projects 2 available results
- Laboratories 1 available results
- Research Teams 1 available results
- e-Learning Courses 92 available results
- Events 6 available results
- Open Research Data 1165 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: brain computer interface
-
Fluid–solid interaction on a thin platelet with high-velocity flow: vibration modelling and experiment
PublicationThe paper concerns the nonlinear behaviour of a thin platelet that is streamlined in an aerodynamic tunnel. The air velocity in the aerodynamic tunnel was at 858.9 km/h or 0.7 Ma (Ma—Mach number is a dimensionless quantity in fluid dynamics representing the ratio of flow velocity past a boundary to the local speed of sound). This experiment was numerically simulated using FSI (fluid–solid interaction) tools, namely the coupling...
-
Properties of Barium Cerate-Zirconate Thin Films
PublicationIn this work, we review several experimental results showing the electrical properties of barium cerate-zirconate thin films and discuss them in view of the possible influence of various factors on their properties. Most of the presented Ba(Ce, Zr, Y)O3 thin films were formed by the pulsed laser deposition (PLD) technique, however thin films prepared using other methods, like RF magnetron sputtering, electron-beam deposition, powder...
-
Nanokrystaliczne warstwy ceramiczne otrzymywane metodą pirolizy aerozolowej w tlenkowych ogniwach paliwowych
PublicationNiniejsza rozprawa doktorska dotyczy badań materiałów wytwarzanych w postaci cienkich, nanokrystalicznych warstw ceramicznych metodą pirolizy aerozolowej dla zastosowań w tlenkowych ogniwach paliwowych (SOFC). Badane są trzy możliwe obszary zastosowań wytwarzanych warstw tj. osadzanie powłok ochronnych na stalowych interkonektorach dostarczających gazy do elektrody tlenowej, wytwarzanie bariery ochronnej zapobiegającej dyfuzji...
-
Implementation of algebraic procedures on the GPU using CUDA architecture on the example of generalized eigenvalue problem
Publication -
Efficient parallel algorithms in global optimization of potential energy functions for peptides, proteins, and crystals
Publication -
A fast algorithm for computing the flux around non-overlapping disks on the plane
Publication -
New approach to the chunk recoginition in Polish
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.
-
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 -
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.
-
Very accurate time propagation of coupled Schrödinger equations for femto- and attosecond physics and chemistry, with C++ source code
PublicationIn this article, I present a very fast and high-precision (up to 33 decimal places) C++ implementation of the semi-global time propagation algorithm for a system of coupled Schrödinger equations with a time-dependent Hamiltonian. It can be used to describe time-dependent processes in molecular systems after excitation by femto- and attosecond laser pulses. It also works with an arbitrary user supplied Hamiltonian and can be used...
-
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 -
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...
-
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.
-
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...
-
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....
-
Nested Space Mapping Technology for Expedite EM-driven Design of Compact RF/microwave Components
PublicationA robust simulation-driven methodology for rapid and reliable design of RF/microwave circuits comprising compact microstrip resonant cells (CMRCs) is presented. We introduce a nested space mapping (NSM) technology, in which the inner space mapping layer is utilized to improve the generalization capabilities of the equivalent circuit model corresponding to a constitutive element of the circuit under consideration. The outer layer...
-
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...
-
A Surrounding World Knowledge Acquiring by Using a Low-cost Ultrasound Sensors
Publication -
Preface
Publication -
Ensemble Classifier for Mining Data Streams
Publication -
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....
-
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...
-
Approximate search strategies for weighted trees
PublicationW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
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...
-
SCF - a Framework Supporting Achieving and Assessing Conformity with Standards
PublicationStandards Conformity Framework (SCF) presented in this paper encompasses methods and tools whichprovide support for application of standards and other normative documents. The approach taken focuses ondevelopment, assessment and maintenance of an electronic document which demonstrates conformity. Sucha document contains an argument structure developed in accordance with the Trust-IT methodology. Thepaper discusses details of the...
-
Phutball is PSPACE-hard
PublicationW pracy dowodzimy, że gra ''Phutball'' (Philosopher's Football) jest PSPACE-trudna.
-
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublicationArtykuł poświęcony jest nowym modelom konsensusowego kolorowania grafów. Artykuł zawiera omówienie trzech takich modeli, analizę ich złożoności obliczeniowej oraz wielomianowy algorytm dla częściowych k-drzew, dla tzw. modelu addytywnego.
-
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.
-
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...
-
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...