Filtry
wszystkich: 2329
wybranych: 1311
-
Katalog
- Publikacje 1311 wyników po odfiltrowaniu
- Czasopisma 283 wyników po odfiltrowaniu
- Konferencje 142 wyników po odfiltrowaniu
- Osoby 244 wyników po odfiltrowaniu
- Projekty 2 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 85 wyników po odfiltrowaniu
- Wydarzenia 5 wyników po odfiltrowaniu
- Dane Badawcze 256 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: computer
-
The Effectiveness of Computerized Cognitive Training Combined With Whole Body Cryotherapy in Improving Cognitive Functions in Older Adults. A Case Control Study
Publikacja -
A note on the affective computing systems and machines: a classification and appraisal
PublikacjaAffective 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
PublikacjaNumerous 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
PublikacjaRozważ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
PublikacjaCurrent 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
PublikacjaReformulating 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....
-
Implementation of algebraic procedures on the GPU using CUDA architecture on the example of generalized eigenvalue problem
Publikacja -
Efficient parallel algorithms in global optimization of potential energy functions for peptides, proteins, and crystals
Publikacja -
A fast algorithm for computing the flux around non-overlapping disks on the plane
Publikacja -
New approach to the chunk recoginition in Polish
Publikacja -
Extensions of Quasilinearization Method for Differential Equations with Integral Boundary Conditions
PublikacjaPraca 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
Publikacja -
Application of crowdfunding to video game projects financing
Publikacja -
Finite automata for compact representation of tuple dictionaries.
PublikacjaOpisane 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.
PublikacjaWykazano, ż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
PublikacjaIn 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
Publikacja -
Finding Temperature Distribution at Heat Recovery Unit Using Genetic Algorithms
Publikacja -
Optimization of multilayer rail substrate under moving load, using metamaterials.
Publikacja -
On some aspects of Concurrent Control Processes Modelling and Implementation in LAD Diagram Language With Use of New Generation Engineering Software
Publikacja -
Finite State Machine Based Modelling of Discrete Control Algorithm in LAD Diagram Language With Use of New Generation Engineering Software
Publikacja -
Operational Properties Investigation of The Flat-Plate Solar Collector with Poliuretane Foam Insulation
Publikacja -
Dynamics of changes in Poland in the light of the Industry 4.0
Publikacja -
Autonomous control of a mobile robot to explore areas with difficult terrain
Publikacja -
IPNES - Interpreted Petri Net for Embedded Systems
Publikacja -
Selected reflections on formal modeling in Industry 4.0
Publikacja -
A Concept of a Training Project IT Management System
Publikacja -
Implementation of an example of Hierarchical Petri Net (HPN) in LAD language in TIA Portal
Publikacja -
Investigation of Anti-Lock Braking System failures using wavelet analysis
Publikacja -
Thermo-mechanic tests using 3d printed elements
Publikacja -
A Novel Framework for Decision Support System in Human Resource Management
Publikacja -
ARUZ — Large-scale, massively parallel FPGA-based analyzer of real complex systems
Publikacja -
On minimum cost edge searching
PublikacjaWe 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
PublikacjaWe 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
PublikacjaThe 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
PublikacjaWe 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
PublikacjaThis 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
PublikacjaA 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
PublikacjaA 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
PublikacjaVariable-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
Publikacja -
Preface
Publikacja -
Ensemble Classifier for Mining Data Streams
Publikacja -
A highly-efficient technique for evaluating bond-orientational order parameters
PublikacjaWe 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
PublikacjaThis 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
PublikacjaW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
Synchronous black hole search in directed graphs
PublikacjaThe 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
PublikacjaStandards 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
PublikacjaW pracy dowodzimy, że gra ''Phutball'' (Philosopher's Football) jest PSPACE-trudna.
-
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem
PublikacjaArtykuł 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.