Filters
total: 3121
filtered: 1927
-
Catalog
- Publications 1927 available results
- Journals 294 available results
- Conferences 143 available results
- People 257 available results
- Inventions 5 available results
- Projects 3 available results
- Research Teams 3 available results
- Research Equipment 2 available results
- e-Learning Courses 140 available results
- Events 5 available results
- Open Research Data 342 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: computer phylogenetics
-
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...
-
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.
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
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...
-
Approximate search strategies for weighted trees
PublicationW pracy podajemy 3-przybliżony algorytm dla problemu spójnego przeszukiwania drzew ważonych.
-
Topology recognition and leader election in colored networks
PublicationTopology recognition and leader election are fundamental tasks in distributed computing in networks. The first of them requires each node to find a labeled isomorphic copy of the network, while the result of the second one consists in a single node adopting the label 1 (leader), with all other nodes adopting the label 0 and learning a path to the leader. We consider both these problems in networks whose nodes are equipped with...
-
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...
-
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....
-
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...
-
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.
-
YADE - An extensible framework for the interactive simulation of multiscale, multiphase, and multiphysics particulate systems
PublicationThis contribution presents the key elements of YADE, an extensible open-source framework for dynamic simulations. During the past 19 years, YADE has evolved from "Yet Another Dynamic Engine"' to a versatile multiscale and multiphysics solver, counting a large, active, and growing community of users and developers. The computationally intense parts of the source code are written in C++, using flexible object models that allow for...
-
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...
-
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...
-
Sustainable Waste Management for Implementation of a Circular Economy Model in a Port
PublicationThe manuscript presents the management of waste from marine vessels and cargo handling companies in a selected European Union port. The main objective of the paper is to analyse and evaluate the existing waste management model in the port of Szczecin in the context of circular economy. The expert research carried out is aimed, inter alia, at identifying which of the solutions currently in use need to be improved from an environmental...
-
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....
-
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...
-
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...
-
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.
-
TISAX - optimization of IT risk management in the automotive industry
Publication -
ChatGPT - opportunities or threats in the educational process
Publication -
Building a cybersecurity culture of public administration system in Poland
Publication -
Designing Intelligent Factory: Conceptual Framework and Empirical Validation
PublicationThis paper presents a framework for monitoring, analysing and decision making for a smart manufacturing environment. We maintain that this approach could play a vital role in developing an architecture and implementation of Industry 4.0. The proposed model has features like experience based knowledge representation and semantic analysis of engineering objects and manufacturing process. It is also capable of continuous real time...
-
Machine learning applied to acoustic-based road traffic monitoring
PublicationThe motivation behind this study lies in adapting acoustic noise monitoring systems for road traffic monitoring for driver’s safety. Such a system should recognize a vehicle type and weather-related pavement conditions based on the audio level measurement. The study presents the effectiveness of the selected machine learning algorithms in acoustic-based road traffic monitoring. Bases of the operation of the acoustic road traffic...
-
The complexity of bicriteria tree-depth
PublicationThe tree-depth problem can be seen as finding an elimination tree of minimum height for a given input graph G. We introduce a bicriteria generalization in which additionally the width of the elimination tree needs to be bounded by some input integer b. We are interested in the case when G is the line graph of a tree, proving that the problem is NP-hard and obtaining a polynomial-time additive 2b-approximation algorithm. This particular...
-
TECHNIKI CAD W INŻYNIERII ELEKTRYCZNEJ - WYBRANE ZAGADNIENIA
PublicationW pracy przedstawiono różne techniki CAD (ang. Computer Aided Design) wykorzystywane w inżynierii elektrycznej dla potrzeb komputerowego modelowania 3D przetworników elektromechanicznych. Wirtualne modele 3D różnych urządzeń są użyteczne nie tylko przy opracowywaniu dokumentacji technicznej ale są także wykorzystywane w obliczeniach inżynierskich:...
-
Hybrid stepless distribution transformer with four-quadrant AC/DC/AC converter at low voltage side - simulation tests
PublicationThe article presents the work of the stepless hybrid distribution transformer (HT), as an alternative to the so far applied Automatic Voltage Regulator (AVR) solutions, used to control the voltage in the power system in terms of the fundamental harmonic. The HT is a combination of a conventional distribution transformer and an AC/DC/AC converter connected in series with the transformers secondary winding. In the work the basic...
-
Design of power cable lines partially exposed to direct solar radiation – special aspects
PublicationPower cable lines are usually buried in the ground. However, in some cases, their ending sections are mounted along the supports of overhead lines. This leads to a situation where the cables are exposed to direct solar radiation and, consequentially, overheat. The paper presents the advanced computer modelling of power cables’ heating, considering their insolation as well as the effect of wind. The temperature and current-carrying...
-
Minimising the Churn Out of the Service by Using a Fairness Mechanism
PublicationThe paper proposes an algorithm of bandwidth distribution, ensuring fairness to end-users in computer networks. The proposed algorithm divides users into satisfied and unsatisfied users. It provides fairness in terms of quality of experience (QoE) for satisfied users and quality of service (QoS) for unsatisfied users. In this paper, we present detailed comparisons relevant to service providers to show the advantages of the proposed...
-
Self-Optimizing Adaptive Vibration Controller
PublicationThis paper presents a new approach to rejection of sinusoidal disturbances acting at the output of a discrete-time linear stable plant with unknown dynamics. It is assumed that the frequency of the sinusoidal disturbance is known, and that the output signal is contaminated with wideband measurement noise. The proposed controller, called SONIC (self-optimizing narrowband interference canceller), combines the coefficient fixing technique,...
-
An Alternative Proof of a Lower Bound on the 2-Domination Number of a Tree
PublicationA 2-dominating set of a graph G is a set D of vertices of G such that every vertex not in D has a at least two neighbors in D. The 2-domination number of a graph G, denoted by gamma_2(G), is the minimum cardinality of a 2-dominating set of G. Fink and Jacobson [n-domination in graphs, Graph theory with applications to algorithms and computer science, Wiley, New York, 1985, 283-300] established the following lower bound on the 2-domination...