Search
Filters
total: 2760
-
Catalog
- Publications 2343 available results
- Journals 152 available results
- Conferences 73 available results
- Publishing Houses 1 available results
- People 34 available results
- Projects 1 available results
- e-Learning Courses 18 available results
- Events 1 available results
- Open Research Data 137 available results
displaying 1000 best results Help
Search results for: ZAKIAN’S COMPUTATIONAL ALGORITHM
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublicationThe paper presents a systematic computational package for analysis of complex systems composed of multiple lumped and distributed parameter subsystems. The algorithm is based on the transfer function method (DTFM). With this algorithm, a bond graph technique for the modelling is developed to simplify computations. Analysis of different systems requires only changing the inputs data in the form of the bond graph diagram
-
A COMPUTATIONAL ALGORITHM FOR THE NUMERICAL SOLUTION OF NONLINEAR FRACTIONAL INTEGRAL EQUATIONS
Publication -
The chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used for the computations. The results we got using the model have been compared to the results obtained from real computational environment.
PublicationThe chapter analyses the K-Means algorithm in its parallel setting. We provide detailed description of the algorithm as well as the way we paralellize the computations. We identified complexity of the particular steps of the algorithm that allows us to build the algorithm model in MERPSYS system. The simulations with the MERPSYS have been performed for different size of the data as well as for different number of the processors used...
-
Computational analysis of an infinite magneto-thermoelastic solid periodically dispersed with varying heat flow based on non-local Moore–Gibson–Thompson approach
PublicationIn this investigation, a computational analysis is conducted to study a magneto-thermoelastic problem for an isotropic perfectly conducting half-space medium. The medium is subjected to a periodic heat flow in the presence of a continuous longitude magnetic field. Based on Moore–Gibson–Thompson equation, a new generalized model has been investigated to address the considered problem. The introduced model can be formulated by combining...
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using Johnson’s algorithm
Open Research DataThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using the Floyd–Warshall algorithm
Open Research DataThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Modelowanie procesu wrzenia i kondensacji w rozszerzonym zakresie ciśnień zredukowanych
PublicationNiniejsza rozprawa doktorska ma na celu pokazanie wpływu uwzględnienia ciśnienia zredukowanego w analizowanym modelu opisują-cym współczynnik przejmowania ciepła na zbieżność z danymi eksperymentalnymi.Przedmiotem analizy jest półempiryczny model Mikielewicza w zastosowaniu do danych eksperymentalnych w kanałach konwencjonalnych i o małej średnicy płynów uznanych za perspektywiczne.W ramach realizowanych prac badawczych pozyskano...
-
Computational Intelligence - 2023
e-Learning CoursesWidening the students knowledge about the selected methods of artificial intelligence
-
Computational Intelligence 2022
e-Learning CoursesWidening the students knowledge about the selected methods of artificial intelligence
-
Reduction of Computational Complexity in Simulations of the Flow Process in Transmission Pipelines
PublicationThe paper addresses the problem of computational efficiency of the pipe-flow model used in leak detection and identification systems. Analysis of the model brings attention to its specific structure, where all matrices are sparse. With certain rearrangements, the model can be reduced to a set of equations with tridiagonal matrices. Such equations can be solved using the Thomas algorithm. This method provides almost the same values...
-
Proximal primal–dual best approximation algorithm with memory
PublicationWe propose a new modified primal–dual proximal best approximation method for solving convex not necessarily differentiable optimization problems. The novelty of the method relies on introducing memory by taking into account iterates computed in previous steps in the formulas defining current iterate. To this end we consider projections onto intersections of halfspaces generated on the basis of the current as well as the previous...
-
Interactive Query Expansion with the Use of Clustering by Directions Algorithm
PublicationThis paper concerns Clustering by Directions algorithm. The algorithm introduces a novel approach to interactive query expansion. It is designed to support users of search engines in forming web search queries. When a user executes a query, the algorithm shows potential directions in which the search can be continued. This paper describes the algorithm and it presents an enhancement which reduces the computational complexity of...
-
On Computational Aspects of Greedy Partitioning of Graphs
PublicationIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λ-backbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NP-complete or polynomially...
-
Generating optimal paths in dynamic environments using RiverFormation Dynamics algorithm
PublicationThe paper presents a comparison of four optimisation algorithms implemented for the purpose of finding the shortest path in static and dynamic environments with obstacles. Two classical graph algorithms –the Dijkstra complete algorithm and A* heuristic algorithm – were compared with metaheuristic River Formation Dynamics swarm algorithm and its newly introduced modified version. Moreover, another swarm algorithm has been compared...
-
Context Search Algorithm for Lexical Knowledge Acquisition
PublicationA Context Search algorithm used for lexical knowledge acquisition is presented. Knowledge representation based on psycholinguistic theories of cognitive processes allows for implementation of a computational model of semantic memory in the form of semantic network. A knowledge acquisition using supervised dialog templates have been performed in a word game designed to guess the concept a human user is thinking about. The game,...
-
Performance comparison of new modified gradient algorithm and Foy algorithm for iterative position calculation
PublicationIn the paper a new position calculation algorithm is presented. It is proposed for indoor environments and is called modified gradient algorithm. This algorithm is compared with well-known Foy algorithm. The comparative analysis is based on real distance measurements conducted in indoor environment.
-
Computational intelligence methods in production management
PublicationThis chapter presents a survey of selected computational intelligence methods used in production management. This group of methods includes, among others, approaches based on the artificial neural networks, the evolutionary algorithms, the fuzzy logic systems and the particle swarm optimization mechanisms. From the abovementioned methods particularly noteworthy are the evolutionary and the particle swarm algorithms, which are successfully...
-
Quality Evaluation of Novel DTD Algorithm Based on Audio Watermarking
PublicationEcho cancellers typically employ a doubletalk detection (DTD) algorithm in order to keep the adaptive filter from diverging in the presence of near-end speech signal or other disruptive sounds in the microphone signal. A novel doubletalk detection algorithm based on techniques similar to those used for audio signal watermarking was introduced by the authors. The application of the described DTD algorithm within acoustic echo cancellation...
-
Considerations of Computational Efficiency in Volunteer and Cluster Computing
PublicationIn the paper we focus on analysis of performance and power consumption statistics for two modern environments used for computing – volunteer and cluster based systems. The former integrate computational power donated by volunteers from their own locations, often towards social oriented or targeted initiatives, be it of medical, mathematical or space nature. The latter is meant for high performance computing and is typically installed...
-
ANALYSIS OF EFFECTIVENESS AND COMPUTATIONAL COMPLEXITY OF TREND REMOVAL METHODS
PublicationThe paper presents a method of processing measurement data due to remove slowly varying component of the trend occurring in the recorded waveforms. Comparison of computational complexity and trend removal efficiency between some commonly used methods is presented. The impact of these procedures on probability distribution and power spectral density is shown. Effectiveness and computational complexity of these methods depend essentially...
-
Arterial cannula shape optimization by means of the rotational firefly algorithm
PublicationThe article presents global optimization results of arterial cannula shapes by means of the newly modified firefly algorithm. The search for the optimal arterial cannula shape is necessary in order to minimize losses and prepare the flow that leaves the circulatory support system of a ventricle (i.e. blood pump) before it reaches the heart. A modification of the standard firefly algorithm, the so-called rotational firefly algorithm,...
-
Optimized Computational Intelligence Model for Estimating the Flexural Behavior of Composite Shear Walls
PublicationThis article presents a novel approach to estimate the flexural capacity of reinforced concrete-filled composite plate shear walls using an optimized computational intelligence model. The proposed model was developed and validated based on 47 laboratory data points and the Transit Search (TS) optimization algorithm. Using 80% of the experimental dataset, the optimized model was selected by determining the unknown coefficients of...
-
Aerodynamic shape optimization by variable-fidelity computational fluid dynamics models: a review of recent progress
PublicationA brief review of some recent variable-fidelity aerodynamic shape optimization methods is presented.We discuss three techniques that—by exploiting information embedded in low-fidelity computationalfluid dynamics (CFD) models—are able to yield a satisfactory design at a low computational cost, usu-ally corresponding to a few evaluations of the original, high-fidelity CFD model to be optimized. Thespecific techniques considered here...
-
Computational Intelligence - sem. 2022/23
e-Learning CoursesWidening the students knowledge about the selected methods of artificial intelligence
-
Computational Intelligence - 2023/2024 sem.
e-Learning CoursesWidening the students knowledge about the selected methods of artificial intelligence
-
Computational Intelligence - sem. 2023/2024
e-Learning CoursesWidening the students knowledge about the selected methods of artificial intelligence
-
Neural Network-Based Sequential Global Sensitivity Analysis Algorithm
PublicationPerforming global sensitivity analysis (GSA) can be challenging due to the combined effect of the high computational cost, but it is also essential for engineering decision making. To reduce this cost, surrogate modeling such as neural networks (NNs) are used to replace the expensive simulation model in the GSA process, which introduces the additional challenge of finding the minimum number of training data samples required to...
-
Computational modelling of historic masonry railroad arch bridges
PublicationThe problems encountered during the analyzes of structural response of historic masonry railroad arch bridges are described in this paper. The attention is mainly focused on the stiffness of the masonry arches, their strengths and appropriate estimation of railroad load intensity. Issues related to computational modelling of two, existing, almost 130 years old masonry arch railroad bridges are presented in this context. The main...
-
Numerically efficient algorithm for compact microwave device optimization with flexible sensitivity updating scheme
PublicationAn efficient trust-region algorithm with flexible sensitivity updating management scheme for electromagnetic (EM)-driven design optimization of compact microwave components is proposed. During the optimization process, updating of selected columns of the circuit response Jacobian is performed using a rank-one Broyden formula (BF) replacing finite differentiation (FD). The FD update is omitted for directions sufficiently well aligned...
-
Efficient knowledge-based optimization of expensive computational models using adaptive response correction
PublicationComputer simulation has become an indispensable tool in engineering design as they allow an accurate evaluation of the system performance. This is critical in order to carry out the design process in a reliable manner without costly prototyping and physical measurements. However, high-fidelity computer simulations are computationally expensive. This turns to be a fundamental bottleneck when it comes to design automation using numerical...
-
A new optimal algorithm for a time-dependent scheduling problem
PublicationIn this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs j_1, ..., j_n and the processing time pi of the i-th job is given by p_i = 1 + b_is_i, where si is the starting time of the i-th job, i = 1, ..., n. If all jobs have different and non-zero deterioration rates and bi > bj => bi >= (b_min+1)/(b_min) b_j + 1/b_min, where b_min = min{b_i}, then...
-
Hybrid DUMBRA: an efficient QoS routing algorithm for networks with DiffServ architecture
PublicationDynamic routing is very important issue of current packet networks. It may support the QoS and help utilize available network resources. Unfortunately current routing mechanisms are not sufficient to fully support QoS. Although many research has been done in this area no generic QoS routing algorithm has been proposed that could be used across all network structures. Existing QoS routing algorithms are either dedicated to limited...
-
Self-Adaptive Mesh Generator for Global Complex Roots and Poles Finding Algorithm
PublicationIn any global method of searching for roots and poles, increasing the number of samples increases the chances of finding them precisely in a given area. However, the global complex roots and poles finding algorithm (GRPF) (as one of the few) has direct control over the accuracy of the results. In addition, this algorithm has a simple condition for finding all roots and poles in a given area: it only requires a sufficiently dense...
-
Computational Model of Time for Stiff Hybrid Systems Applied to Control Synthesis
PublicationComputational representation.
-
The OpenMolcas Web: A Community-Driven Approach to Advancing Computational Chemistry
Open Research DataThe developments of the open-source OpenMolcas chemistry software environment since spring 2020 are described, with a focus on novel functionalities accessible in the stable branch of the package or via interfaces with other packages. These developments span a wide range of topics in computational chemistry and are presented in thematic sections: electronic...
-
An Improvement of Global Complex Roots and Poles Finding Algorithm for Propagation and Radiation Problems
PublicationAn improvement of the recently developed global roots finding algorithm has been proposed. The modification allows to shorten the computational time by reducing the number of function calls. Moreover, both versions of the algorithms (standard and modified) have been tested for numerically defined functions obtained from spectral domain approach and field matching method. The tests have been performed for three simple microwave...
-
Advances in computational electrodynamics.
PublicationArtykuł prezentuje wybrane metody, które są rozwijane w Politechnice Gdańskiej, i które mogą być wykorzystane do przyspieszenia komputerowego projektowania układów mikrofalowych i analizy numerycznej układów niskiej i dużej częstotliwości. Przeprowadzono przegląd metod tworzenia układów zastępczych i ich wykorzystanie do automatycznego projektowania filtrów pasmowo-przepustowych. Przedstawiono różne podejścia reprezentacji pola...
-
FPGA-Based Implementation of Real Time Optical Flow Algorithm and Its Applications for Digital Image Stabilization
PublicationAn efficient simplification procedure of the optical flow (OF) algorithm as well as its hardware implementation using the field programmable gate array (FPGA) technology is presented. The modified algorithm is based on block matching of subsets of successive frames, and exploits one-dimensional representation of subsets as well as the adaptive adjustments of their sizes. Also, an l1-norm-based correlation function requiring no...
-
Adversarial attack algorithm for traffic sign recognition
PublicationDeep learning suffers from the threat of adversarial attacks, and its defense methods have become a research hotspot. In all applications of deep learning, intelligent driving is an important and promising one, facing serious threat of adversarial attack in the meanwhile. To address the adversarial attack, this paper takes the traffic sign recognition as a typical object, for it is the core function of intelligent driving. Considering...
-
Interactive Information Retrieval Algorithm for Wikipedia Articels
PublicationThe article presents an algorithm for retrieving textual information in documents collection. The algorithm employs a category system that organizers the repository and using interaction with user improves search precision. The algorithm was implemented for simple English Wikipedia and the first evaluation results indicates the proposed method can help to retrieve information from large document repositories.
-
New Indoor Positioning Algorithm for Distance Measurements
PublicationIn the paper a new indoor positioning algorithm is presented. This algorithm takes into account selected features of radio wave propagation in indoor environment. This results in improvement in accuracy of calculated position estimates. A comparative analysis of this new algorithm with Chan and Foy algorithms was made and described in the paper. This comparative analysis was made with utilization of real radio distance measurements.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm.
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
An Approximation of the Zero Error Capacity by a Greedy Algorithm
PublicationWe present a greedy algorithm that determines a lower bound on the zero error capacity. The algorithm has many new advantages, e.g., it does not store a whole product graph in a computer memory and it uses the so-called distributions in all dimensions to get a better approximation of the zero error capacity. We also show an additional application of our algorithm.
-
Computational and experimental evaluation of view out according to European Standard EN17037.
PublicationThis paper presents an experimental evaluation of view out based on EN17037:2018 Daylight in Buildings within an educational building. The primary motivation to conduct the research was an introduction of a view out appraisal criteria by the mentioned standard. The study gives insights into the following: (i) the use of computational evaluation of an outside view according to the EN17037 criteria (ii) the use of the direct simultaneous...
-
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λ-backbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for bounded-degree...
-
Towards an experience based collective computational intelligence for manufacturing
PublicationKnowledge based support can play a vital role not only in the new fast emerging information and communication technology based industry, but also in traditional manufacturing. In this regard, several domain specific research endeavors have taken place in the past with limited success. Thus, there is a need to develop a flexible domain independent mechanism to capture, store, reuse, and share manufacturing knowledge. Consequently,...
-
Journal of Applied and Computational Mechanics
Journals -
Electronic nose algorithm design using classical system identification for odour intensity detection
PublicationThe two elements considered crucial for constructing an efficient environmental odour intensity monitoring systems are sensors and algorithms typically addressed to as electronic nose sensor (e-nose). Due to operational complexity of biochemical sensors developed in human bodies algorithms based on computational methods of artificial intelligence are typically considered superior to classical model based approaches in development...