Wyszukiwarka
Filtry
wszystkich: 199
Wyniki wyszukiwania dla: COMPLEX ROOTS FINDING ALGORITHM
-
Modal parameters identification with Particle Swarm Optimization
PublikacjaThe paper presents method of the modal parameters identification based on the Particle Swarm Optimization (PSO) algorithm [1]. The basic PSO algorithm is modified in order to achieve fast convergence and low estimation error of identified parameters values. The procedure of identification as well as algorithm modifications are presented and some simple examples for the SISO systems are provided. Results are compared with the results...
-
Computational algorithm for the analysis of mechatronic systems with distributed parameter elements
PublikacjaThe 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
-
Information Retrieval in Wikipedia with Conceptual Directions
PublikacjaThe paper describes our algorithm used for retrieval of textual information from Wikipedia. The experiments show that the algorithm allows to improve typical evaluation measures of retrieval quality. The improvement of the retrieval results was achieved by two phase usage approach. In first the algorithm extends the set of content that has been indexed by the specified keywords and thus increases the Recall value. Then, using the...
-
Ship weather routing optimization with dynamic constraints based on reliable synchronous roll prediction
PublikacjaShip routing process taking into account weather conditions is a constrained multi-objective optimization problem and it should consider various optimization criteria and constraints. Formulation of a stability-related, dynamic route optimization constraint is presented in this paper. One of the key objectives of a cross ocean sailing is finding a compromise between ship safety and economics of operation. This compromise should...
-
Automatic Discovery of IaaS Cloud Workload Types
PublikacjaThe paper presents an approach to automatic discovery of workloads types. We perform functional characteristics of the workloads executed in our cloud environment, that have been used to create model of the computations. To categorize the resources utilization we used K-means algorithm, that allow us automatically select six types of computations. We perform analysis of the discovered types against to typical computational benchmarks,...
-
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...
-
Stability analysis of interconnected discrete-time fractional-order LTI state-space systems
PublikacjaIn this paper, a stability analysis of interconnected discrete-time fractional-order (FO) linear time-invariant (LTI) state-space systems is presented. A new system is formed by interconnecting given FO systems using cascade, feedback, parallel interconnections. The stability requirement for such a system is that all zeros of a non-polynomial characteristic equation must be within the unit circle on the complex z-plane. The obtained...
-
Neural Network-Based Sequential Global Sensitivity Analysis Algorithm
PublikacjaPerforming 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...
-
Performance Evaluation of Selected Parallel Object Detection and Tracking Algorithms on an Embedded GPU Platform
PublikacjaPerformance evaluation of selected complex video processing algorithms, implemented on a parallel, embedded GPU platform Tegra X1, is presented. Three algorithms were chosen for evaluation: a GMM-based object detection algorithm, a particle filter tracking algorithm and an optical flow based algorithm devoted to people counting in a crowd flow. The choice of these algorithms was based on their computational complexity and parallel...
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Categorization of Cloud Workload Types with Clustering
PublikacjaThe paper presents a new classification schema of IaaS cloud workloads types, based on the functional characteristics. We show the results of an experiment of automatic categorization performed with different benchmarks that represent particular workload types. Monitoring of resource utilization allowed us to construct workload models that can be processed with machine learning algorithms. The direct connection between the functional...
-
Combining Road Network Data from OpenStreetMap with an Authoritative Database
PublikacjaComputer modeling of road networks requires detailed and up-to-date dataset. This paper proposes a method of combining authoritative databases with OpenStreetMap (OSM) system. The complete route is established by finding paths in the graph constructed from partial data obtained from OSM. In order to correlate data from both sources, a method of coordinate conversion is proposed. The algorithm queries road data from OSM and provides...
-
The Algorithm of Modelling and Analysis of Latent Semantic Relations: Linear Algebra vs. Probabilistic Topic Models
PublikacjaThis paper presents the algorithm of modelling and analysis of Latent Semantic Relations inside the argumentative type of documents collection. The novelty of the algorithm consists in using a systematic approach: in the combination of the probabilistic Latent Dirichlet Allocation (LDA) and Linear Algebra based Latent Semantic Analysis (LSA) methods; in considering each document as a complex of topics, defined on the basis of separate...
-
Testing Stability of Digital Filters Using Multimodal Particle Swarm Optimization with Phase Analysis
PublikacjaIn this paper, a novel meta-heuristic method for evaluation of digital filter stability is presented. The proposed method is very general because it allows one to evaluate stability of systems whose characteristic equations are not based on polynomials. The method combines an efficient evolutionary algorithm represented by the particle swarm optimization and the phase analysis of a complex function in the characteristic equation....
-
Mobile devices and computing cloud resources allocation for interactive applications
PublikacjaUsing mobile devices such as smartphones or iPads for various interactive applications is currently very common. In the case of complex applications, e.g. chess games, the capabilities of these devices are insufficient to run the application in real time. One of the solutions is to use cloud computing. However, there is an optimization problem of mobile device and cloud resources allocation. An iterative heuristic algorithm for...
-
FPGA realization of an improved alpha max plus beta min algorithm
PublikacjaThe generalized improved version of the alpha max plus beta min square-rooting algorithm and its realization in the Field Programmable Gate Array (FPGA) are presented. The algorithm computes the square root to calculate the approximate magnitude of a complex sample. It is especially useful for pipelined calculations in the DSP. In case of four approximation regions it is possible to reduce the peak error form 3.95% to 0.33%. This...
-
Performance of FAN conception of traffic control in IP QoS networks
PublikacjaIn this paper we present the architectural implementation of Flow Aware Networking (FAN), a new approach for realizing QoS guarantees in the Internet. We also propose FAN traffic control algorithm which performs traffic control on flow level. Using the proposed FAN node model, we conduct simulation research to prove if FAN can be a new approach for realizing QoS guarantees. The basis of this research is finding a way to guarantee...
-
Local Texture Pattern Selection for Efficient Face Recognition and Tracking
PublikacjaThis paper describes the research aimed at finding the optimal configuration of the face recognition algorithm based on local texture descriptors (binary and ternary patterns). Since the identification module was supposed to be a part of the face tracking system developed for interactive wearable computer, proper feature selection, allowing for real-time operation, became particularly important. Our experiments showed that it is...
-
Proposal of a method for effective tasks distribution in the execution of compolex problems
PublikacjaAn access to a great number of various services allows for decomposition of complex problems into smaller and less complex tasks. Those tasks can be presented in a form of a dependency graph. This paper shows an idea of executing such a problem using cooperating autonomous agents. Main focus of this work is cooperation covering effective tasks distribution among executors. This paper presents an algorithm for dynamic executor selection...
-
A new approach to active noise and vibration control - [Part II: unknown frequency case]
PublikacjaThis paper presents a new approach to rejection of complex-valued sinusoidal disturbances acting at the output of a discrete-time stable linear plant with unknown and possibly timevarying dynamics. It is assumed that both the instantaneous frequency of the sinusoidal disturbance and its amplitude may be slowly varying with time and that the output signal is contaminated with wideband measurement noise. It is not assumed that a...