Search results for: epf composer - Bridge of Knowledge

Search

Search results for: epf composer

Filters

total: 3971
filtered: 1924

clear all filters


Chosen catalog filters

  • Category

  • Year

  • Options

clear Chosen catalog filters disabled

Search results for: epf composer

  • Human Feedback and Knowledge Discovery: Towards Cognitive Systems Optimization

    Publication

    - Procedia Computer Science - Year 2020

    Current 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,...

    Full text available to download

  • Smart Virtual Product Development (SVPD) System to Support Product Inspection Planning in Industry 4.0

    Publication

    - Procedia Computer Science - Year 2020

    This 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...

    Full text available to download

  • Agile Requirements Prioritization in Practice: Results of an Industrial Survey

    Publication

    Agile 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,...

    Full text available to download

  • Improving the Performance of Ontological Querying by using a Contextual Approach

    In 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...

    Full text available to download

  • Contextual ontology for tonality assessment

    Publication

    classification 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...

    Full text available to download

  • Microscopic traffic simulation models for connected and automated vehicles (CAVs) – state-of-the-art

    Publication
    • P. Gora
    • C. Kartakazas
    • A. Drabicki
    • F. Islam
    • P. Ostaszewski

    - Procedia Computer Science - Year 2020

    Research 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...

    Full text available to download

  • Gossiping by energy-constrained mobile agents in tree networks

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2021

    Every 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...

    Full text to download in external service

  • Weighted 2-sections and hypergraph reconstruction

    Publication

    In the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...

    Full text to download in external service

  • Digitalization of High Speed Craft Design and Operation Challenges and Opportunities

    Publication

    - Procedia Computer Science - Year 2022

    In recent years, global demands for safe and sustainable ships led to dramatic changes in the maritime industry. Digitalization is expected to play an important part in the future. This is supported by analysis of the autonomous ships market which shows that digitalization of large ship types such as tankers and container ships is well on track. Although to date designs of autonomous High-Speed Craft (HSC) have been developed,...

    Full text available to download

  • Jamming and jamming mitigation for selected 5G military scenarios

    Publication
    • P. Skokowski
    • J. M. Kelner
    • K. Malon
    • K. Maślanka
    • A. Birutis
    • M. A. Vazquez
    • S. Saha
    • W. Low
    • A. Czapiewska
    • J. Magiera... and 2 others

    - Procedia Computer Science - Year 2022

    This paper presents jamming and jamming mitigation techniques, which can be used in relation to emerging military systems based on fifth-generation (5G) technology. Nowadays, 5G technology provides incremental improvements over Long Term Evolution (LTE) networks resulting in the enhancement of civilian communications. Considering enormous possible applications of this new technology, it is feasible to use them in military utilities....

    Full text available to download

  • MobileNet family tailored for Raspberry Pi

    With the advances in systems-on-a-chip technologies, there is a growing demand to deploy intelligent vision systems on low-cost microcomputers. To address this challenge, much of the recent research has focused on reducing the model size and computational complexity of contemporary convolutional neural networks (CNNs). The state-of-the-art lightweight CNN is MobileNetV3. However, it was designed to achieve a good trade-off between...

    Full text available to download

  • Integrating Experience-Based Knowledge Representation and Machine Learning for Efficient Virtual Engineering Object Performance

    Publication

    - Procedia Computer Science - Year 2021

    Machine learning and Artificial Intelligence have grown significant attention from industry and academia during the past decade. The key reason behind interest is such technologies capabilities to revolutionize human life since they seamlessly integrate classical networks, networked objects and people to create more efficient environments. In this paper, the Knowledge Representation technique of Set of Experience...

    Full text available to download

  • Implementation of high-precision computation capabilities into the open-source dynamic simulation framework YADE

    Publication

    - COMPUTER PHYSICS COMMUNICATIONS - Year 2022

    This paper deals with the implementation of arbitrary precision calculations into the open-source discrete element framework YADE published under the GPL-2+ free software license. This new capability paves the way for the simulation framework to be used in many new fields such as quantum mechanics. The implementation details and associated gains in the accuracy of the results are discussed. Besides the "standard" double (64 bits)...

    Full text available to download

  • Towards Use of OntoClean for Ontology Contextualization

    Publication

    Ontologies are formal systems of concepts used to describe numerous domains of interest. Ontologies are usually very expressive, but it comes at a price of computationally expensive reasoning over them. In our previous work we discussed the possible performance benefits that can be obtained by decomposing an ontology into contexts. While the benefits are appealing, we discovered that, in our case, the main obstacle against using...

    Full text available to download

  • A note on the affective computing systems and machines: a classification and appraisal

    Publication

    - Procedia Computer Science - Year 2022

    Affective 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...

    Full text available to download

  • ARIMA vs LSTM on NASDAQ stock exchange data

    Publication

    - Procedia Computer Science - Year 2022

    This study compares the results of two completely different models: statistical one (ARIMA) and deep learning one (LSTM) based on a chosen set of NASDAQ data. Both models are used to predict daily or monthly average prices of chosen companies listed on the NASDAQ stock exchange. Research shows which model performs better in terms of the chosen input data, parameters and number of features. The chosen models were compared using...

    Full text available to download

  • Machine learning applied to acoustic-based road traffic monitoring

    The 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...

    Full text available to download

  • Current trends in consumption of multimedia content using online streaming platforms: A user-centric survey

    Publication

    In 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...

    Full text to download in external service

  • Virtual Engineering Object / Virtual Engineering Process: A specialized form of Cyber Physical System for Industrie 4.0

    Publication

    - Procedia Computer Science - Year 2015

    This 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....

    Full text available to download

  • The complexity of zero-visibility cops and robber

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2015

    We 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...

    Full text available to download

  • A highly-efficient technique for evaluating bond-orientational order parameters

    We 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....

    Full text available to download

  • Aiming at methods’ wider adoption: Applicability determinants and metrics

    Publication

    Numerous 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...

    Full text available to download

  • Efficient parallel algorithms in global optimization of potential energy functions for peptides, proteins, and crystals

    Publication
    • J. Lee
    • J. Pillardy
    • C. Czaplewski
    • Y. Arnautova
    • D. Ripoll
    • A. Liwo
    • K. Gibson
    • R. Wawak
    • H. Scheraga

    - COMPUTER PHYSICS COMMUNICATIONS - Year 2000

    Full text to download in external service

  • A fast algorithm for computing the flux around non-overlapping disks on the plane

    Publication
    • V. Mityushev
    • N. Rylko

    - MATHEMATICAL AND COMPUTER MODELLING - Year 2013

    Full text to download in external service

  • Finite automata for compact representation of tuple dictionaries.

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2004

    Opisane 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...

    Full text available to download

  • Rank two bibartite bound entangled states do not exist.

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2003

    Wykazano, ż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.

    Full text available to download

  • Synchronous black hole search in directed graphs

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2011

    The 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...

    Full text available to download

  • Phutball is PSPACE-hard

    Publication

    W pracy dowodzimy, że gra ''Phutball'' (Philosopher's Football) jest PSPACE-trudna.

    Full text available to download

  • Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2010

    One of the recently considered models of robot-based computing makes use of identical, memoryless mobile units placed in nodes of an anonymous graph. The robots operate in Look-Compute-Move cycles; in one cycle, a robot takes a snapshot of the current configuration (Look), takes a decision whether to stay idle or to move to one of the nodes adjacent to its current position (Compute), and in the latter case makes an instantaneous...

    Full text available to download

  • Sustainable Waste Management for Implementation of a Circular Economy Model in a Port

    Publication

    - Procedia Computer Science - Year 2023

    The 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...

    Full text available to download

  • On minimum cost edge searching

    Publication

    We 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...

    Full text available to download

  • Finding small-width connected path decompositions in polynomial time

    Publication

    A 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...

    Full text available to download

  • Visual content representation and retrieval for Cognitive Cyber Physical Systems

    Publication

    - Procedia Computer Science - Year 2019

    Cognitive 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...

    Full text available to download

  • Cops, a fast robber and defensive domination on interval graphs

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2019

    The 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”,...

    Full text available to download

  • Smart Virtual Product Development (SVPD) to Enhance Product Manufacturing in Industry 4.0

    Publication

    - Procedia Computer Science - Year 2019

    This 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...

    Full text available to download

  • Nested Space Mapping Technology for Expedite EM-driven Design of Compact RF/microwave Components

    Publication

    A 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...

    Full text available to download

  • Low-Cost EM-Simulation-Driven Multi-Objective Optimization of Antennas

    Publication

    A 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...

    Full text available to download

  • Fast Low-fidelity Wing Aerodynamics Model for Surrogate-Based Shape Optimization

    Publication

    Variable-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...

    Full text available to download

  • The Hybrid Fuzzy - SOEKS Approach to the Polish Internet Mortgage Market

    The 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...

    Full text available to download

  • Implementing Virtual Engineering Objects (VEO) with the Set of Experience Knowledge Structure (SOEKS)

    Publication

    - Procedia Computer Science - Year 2014

    This 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...

    Full text available to download

  • Brushing with additional cleaning restrictions

    Publication

    In 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...

    Full text available to download

  • Viability of decisional DNA in robotics

    Publication

    - Procedia Computer Science - Year 2014

    The 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...

    Full text available to download

  • Modeling and Simulation for Exploring Power/Time Trade-off of Parallel Deep Neural Network Training

    Publication

    In 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...

    Full text available to download

  • A distributed system for conducting chess games in parallel

    This 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...

    Full text available to download

  • Airfoil Design Under Uncertainty Using Non-Intrusive Polynomial Chaos Theory and Utility Functions

    Publication

    - Procedia Computer Science - Year 2017

    Fast 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...

    Full text available to download

  • Pareto Ranking Bisection Algorithm for EM-Driven Multi-Objective Design of Antennas in Highly-Dimensional Parameter Spaces

    Publication

    - Procedia Computer Science - Year 2017

    A 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...

    Full text available to download

  • Optimization model of agile team’s cohesion

    Publication

    - Procedia Computer Science - Year 2014

    Team’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...

    Full text available to download

  • VIBRATION DIAGNOSTICS OF FOOTBRIDGE WITH USE OF ROTATION SENSOR

    Publication

    The 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....

    Full text available to download

  • The searchlight problem for road networks

    Publication

    - THEORETICAL COMPUTER SCIENCE - Year 2015

    We 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,...

    Full text available to download

  • Distinguishing views in symmetric networks: A tight lower bound

    Publication

    The 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.

    Full text available to download