Skocz do pozycji: 1.

Tytuł:

Path Planning for Multiple Mobile Robots Using A* Algorithm

Autorzy:

Hüseyin Filiz, İ.
Olguner, S.
Evyapan, E.

Powiązania:

https://bibliotekanauki.pl/articles/1031600.pdf

Data publikacji:

2017-09

Wydawca:

Polska Akademia Nauk. Instytut Fizyki PAN

Tematy:

02.60.Pn

Opis:

This study presents optimization of planetary gear train in a specific configuration. General characteristics of planetary gear trains are discussed briefly. A compound configuration for planetary gear train is selected and an optimization study is performed for this configuration. For the given input power, motor speed and overall gear ratio, modules, facewidths, teeth numbers of gears are found, satisfying the condition of minimum kinetic energy of the gear trains. In optimization, the objective is set to minimization of kinetic energy. Allowable bending stress and allowable contact stress are considered as design constraints. Minimum teeth number for a given pressure angle, center distance, recommendation on the facewidth, limitations on teeth ratios are considered as geometrical and kinematical constraints. The Matlab® Optimtool optimization toolbox is used. Results for certain operating conditions are obtained and tabulated.

Źródło:

Acta Physica Polonica A; 2017, 132, 3; 728-733
0587-4246
1898-794X

Pojawia się w:

Acta Physica Polonica A

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 2.

Tytuł:

Path Planning for Multiple Mobile Robots Using A* Algorithm

Autorzy:

Batik Garip, Z.
Karayel, D.
Ozkan, S.
Atali, G.

Powiązania:

https://bibliotekanauki.pl/articles/1031599.pdf

Data publikacji:

2017-09

Wydawca:

Polska Akademia Nauk. Instytut Fizyki PAN

Tematy:

42.30.Tz
45.40.Ln
87.85.St
87.55.de
87.55.K-
87.55.kd

Opis:

One of the main problems in path planning for multiple mobile robots is to find the optimal path between two points so that robots can follow the shortest path and consume the least energy. Also, motion planning is important to avoid collisions if multiple mobile robots are running together within environments with obstacles. In this study, motion planning for multiple robots has been proposed. It is desired that robots could move in coordination with each other from the starting point to the destination point on a plane. The coordinates of the objects and mobile robots have been acquired using image processing with a single ceiling camera. The path planning for the shortest distance has been performed using A* algorithm in dynamic frame between robot-object and object-target point, respectively. A graphical user interface has been developed based on MATLAB GUI. It is hoped that the developed system will have a wide area of applications in industry and will make important contributions for the improvement of manufacturing, assembly, transportation and storage technologies.

Źródło:

Acta Physica Polonica A; 2017, 132, 3; 685-688
0587-4246
1898-794X

Pojawia się w:

Acta Physica Polonica A

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 3.

Tytuł:

The idea of using the A* algorithm for route planning an unmanned vehicle “Edredon”

Autorzy:

Naus, K.
Wąż, M.

Powiązania:

https://bibliotekanauki.pl/articles/359690.pdf

Data publikacji:

2013

Wydawca:

Akademia Morska w Szczecinie. Wydawnictwo AMSz

Tematy:

A* algorithm
navigation system
route planning
electronic chart
vehicle „Edredon”

Opis:

This article presents the concept of algorithm A* functioning in a navigation system equipped with electronic navigational chart for autonomous planning the shortest and safest route crossing an offshore unmanned vehicle “Edredon”. The first part describes the general technical architecture and functionality of the vehicle's navigation system. In the second part shows in detail the modules of the system responsible for the planning of the road and how to implement them in the A* algorithm. The third part describes the proper operation of testing whether the A* algorithm in the navigation system, while the task of planning the route of the autonomous vehicle. Final part is a discussion of the results obtained from tests carried out in order to evaluate the applicability of the A* algorithm for route planning in autonomous navigation systems.

Źródło:

Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 143-147
1733-8670
2392-0378

Pojawia się w:

Zeszyty Naukowe Akademii Morskiej w Szczecinie

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 4.

Tytuł:

Algorithm 88. A new algorithm calculating the distance between binary arborescences

Autorzy:

Palka, Z.

Powiązania:

https://bibliotekanauki.pl/articles/742368.pdf

Data publikacji:

1983

Wydawca:

Polska Akademia Nauk. Instytut Matematyczny PAN

Źródło:

Applicationes Mathematicae; 1983-1985, 18, 1; 151-157
1233-7234

Pojawia się w:

Applicationes Mathematicae

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 5.

Tytuł:

A routing algorithm and a router architecture for 3D NoC

Autorzy:

Kanagasabapathi, Somasundaram
Calicut, Chythanya

Powiązania:

https://bibliotekanauki.pl/articles/305713.pdf

Data publikacji:

2019

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

3D topology
router
network on chip
routing algorithm

Opis:

In recent years, the enhancement of microchip technologies has enabled large scale Systems-on-Chip (SoC). Due to sharp increase in number of processing elements, SoC faces various challenges in design and testing. Network on Chip (NoC) is an alternative technology to overcome the challenges in SoC design and testing. NoC emerged as a key architecture that allows one to optimize the parameters like power and area. In spite of its applications, NoC faces some real time challenges like designing an optimum topology, routing scheme and application mappings. In this paper, we address the main three issues on NoC, namely, designing of an optimal topology, routing algorithm and a router design for the topology. First, we propose a topology and a routing algorithm. We prove that our recursive network topology is Hamiltonian connected and we propose an algorithm for data packet transmissions, which is free from cyclic deadlocks and the algorithm maximizes the congestion factor. Our experimental results show that the proposed topology gives better performance in terms of average latency and power than the other topologies. Finally, we propose a router architecture for our 3D-NoC. The router architecture is based on shared buffers. Also, our experimental results indicate that the proposed router architecture consumes less area and power than the Virtual Channel architecture.

Źródło:

Computer Science; 2019, 20 (3); 369-383
1508-2806
2300-7036

Pojawia się w:

Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 6.

Tytuł:

Sequential Classification of Palm Gestures Based on A* Algorithm and MLP Neural Network for Quadrocopter Control

Autorzy:

Wodziński, M.
Krzyżanowska, A.

Powiązania:

https://bibliotekanauki.pl/articles/221525.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

machine learning
shortest path
sequential data
quadrocopter
GPU
CUDA

Opis:

This paper presents an alternative approach to the sequential data classification, based on traditional machine learning algorithms (neural networks, principal component analysis, multivariate Gaussian anomaly detector) and finding the shortest path in a directed acyclic graph, using A* algorithm with a regression-based heuristic. Palm gestures were used as an example of the sequential data and a quadrocopter was the controlled object. The study includes creation of a conceptual model and practical construction of a system using the GPU to ensure the realtime operation. The results present the classification accuracy of chosen gestures and comparison of the computation time between the CPU- and GPU-based solutions.

Źródło:

Metrology and Measurement Systems; 2017, 24, 2; 265-276
0860-8229

Pojawia się w:

Metrology and Measurement Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 7.

Tytuł:

A mesh algorithm for principal quadratic forms

Autorzy:

Polak, A.

Powiązania:

https://bibliotekanauki.pl/articles/106252.pdf

Data publikacji:

2011

Wydawca:

Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej

Tematy:

mesh algorithm
quadratic form
quadratic diophantine equation

Opis:

In 1970 a negative solution to the tenth Hilbert problem, concerning the determination of integral solutions of diophantine equations, was published by Y. W. Matiyasevich. Despite this result, we can present algorithms to compute integral solutions (roots) to a wide class of quadratic diophantine equations of the form q(x) = d, where q : Z is a homogeneous quadratic form. We will focus on the roots of one (i.e., d = 1) of quadratic unit forms (q11 = ... = qnn = 1). In particular, we will describe the set of roots Rq of positive definite quadratic forms and the set of roots of quadratic forms that are principal. The algorithms and results presented here are successfully used in the representation theory of finite groups and algebras. If q is principal (q is positive semi-definite and Ker q={v ∈ Zn; q(v) = 0}= Z · h) then |Rq| = ∞. For a given unit quadratic form q (or its bigraph), which is positive semi-definite or is principal, we present an algorithm which aligns roots Rq in a Φ-mesh. If q is principal (|Rq| is less than ∞), then our algorithm produces consecutive roots in Rq from finite subset of Rq, determined in an initial step of the algorithm.

Źródło:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2011, 11, 1; 23-31
1732-1360
2083-3628

Pojawia się w:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 8.

Tytuł:

A Numerical Algorithm for Filtering and State Observation

Autorzy:

Ibrir, S.

Powiązania:

https://bibliotekanauki.pl/articles/908263.pdf

Data publikacji:

1999

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

krzywa składana
różniczkowanie numeryczne
obserwator
spline functions
numerical differentiation
observers
smooth filters

Opis:

This paper deals with a numerical method for data fitting and estimation of continuous higher-order derivatives of a given signal from its non-exactsampled data. The proposed algorithm is a generalization of the algorithm proposed by Reinsch (1967). This algorithm is conceived as a key element in the structure of the numerical observer discussed in our recent papers. Satisfactory results are obtained which prove the efficiency of the proposed approach.

Źródło:

International Journal of Applied Mathematics and Computer Science; 1999, 9, 4; 855-869
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 9.

Tytuł:

A new algorithm for generation of decision trees

Autorzy:

Grzymała-Busse, J. W.
Hippe, Z. S.
Knap, M.
Mroczek, T.

Powiązania:

https://bibliotekanauki.pl/articles/1965778.pdf

Data publikacji:

2004

Wydawca:

Politechnika Gdańska

Tematy:

artificial intelligence
supervised machine learning
decision trees
Bayes networks

Opis:

A new algorithm for development of quasi-optimal decision trees, based on the Bayes theorem, has been created and tested. The algorithm generates a decision tree on the basis of Bayesian belief networks, created prior to the formation of the decision tree. The efficiency of this new algorithm was compared with three other known algorithms used to develop decision trees. The data set used for the experiments was a set of cases of skin lesions, histopatolgically verified.

Źródło:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2004, 8, 2; 243-247
1428-6394

Pojawia się w:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 10.

Tytuł:

A quick algorithm for planning a path for a biomimetic autonomous underwater vehicle

Autorzy:

Praczyk, T.

Powiązania:

https://bibliotekanauki.pl/articles/135094.pdf

Data publikacji:

2016

Wydawca:

Akademia Morska w Szczecinie. Wydawnictwo AMSz

Tematy:

path planning
underwater vehicle
autonomy
collision avoidance
automatic control
effective planning algorithm

Opis:

Autonomous underwater vehicles are vehicles that are entirely or partly independent of human decisions. In order to obtain operational independence, the vehicles have to be equipped with specialized software. The task of the software is to move the vehicle along a trajectory while avoiding collisions. In its role of avoiding obstacles, the vehicle may sometimes encounter situations in which it is very difficult to determine what the next movement should be from an ad hoc perspective. When such a situation occurs, a planning component of the vehicle software should be run with the task of charting a safe trajectory between nearby obstacles. This paper presents a new path planning algorithm for a Biomimetic Autonomous Underwater Vehicle. The main distinguishing feature of the algorithm is its high speed compared with such classic planning algorithms as A*. In addition to presenting the algorithm, this paper also summarizes preliminary experiments intended to assess the effectiveness of the proposed algorithm.

Źródło:

Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2016, 45 (117); 23-28
1733-8670
2392-0378

Pojawia się w:

Zeszyty Naukowe Akademii Morskiej w Szczecinie

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 11.

Tytuł:

A new optimal algorithm for a time-dependent scheduling problem

Autorzy:

Kubale, M.
Ocetkiewicz, K. M.

Powiązania:

https://bibliotekanauki.pl/articles/969669.pdf

Data publikacji:

2009

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

scheduling
single machine
deteriorating jobs
total completion time
algorithms

Opis:

In this article a single machine time-dependent scheduling problem with total completion time criterion is considered. There are n given jobs, j1,...,jn, and the processing time pi of the i-th job is given by pi = 1 + biSi, 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 [wzór], where bmin = min{bi}, then an optimal schedule can be found in O(n log n) time. The conducted computational experiments show that the presented algorithm performs very well even on data not satisfying the assumed constraints.

Źródło:

Control and Cybernetics; 2009, 38, 3; 713-721
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 12.

Tytuł:

An Application of Probabilistic Grammars to Efficient Machne Translation

Autorzy:

Skórzewski, Paweł

Powiązania:

https://bibliotekanauki.pl/articles/1037598.pdf

Data publikacji:

2010-09-15

Wydawca:

Uniwersytet im. Adama Mickiewicza w Poznaniu

Tematy:

a* algorithm
machine translation
natural language parsing
pcfg
probabilistic grammars

Opis:

In this paper we present one of the algorithms used to parse probabilistic context-free grammars: the A* parsing algorithm, which is based on the A* graph search method. We show an example of application of the algorithm in an existing machine translation system. The existing CYK-based parser used in the Translatica system was modified by applying the A* parsing algorithm in order to examine the possibilities of improving its performance. This paper presents the results of applying the A* algorithm with different heuristic functions and their impact on the performance of the parser.

Źródło:

Investigationes Linguisticae; 2010, 21; 90-98
1426-188X
1733-1757

Pojawia się w:

Investigationes Linguisticae

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 13.

Tytuł:

Parallelizing a new algorithm for the set partition problem

Autorzy:

Chi Thanh, Hoang

Powiązania:

https://bibliotekanauki.pl/articles/764365.pdf

Data publikacji:

2010

Wydawca:

Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej

Źródło:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2010, 10, 2
1732-1360
2083-3628

Pojawia się w:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 14.

Tytuł:

RED-LE: A Revised Algorithm for Active Queue Management

Autorzy:

Hassan, Samuel O.

Powiązania:

https://bibliotekanauki.pl/articles/2142301.pdf

Data publikacji:

2022

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy

Tematy:

active queue management
network congestion
router
RED-LE
simulation

Opis:

The random early detection (RED) algorithm was developed in 1993. Nearly three decades later, several improved variants have been proposed by scientists. The use of a (pure) linear function for computing packet drop probability has turned out to be a disadvantage, leading to the problem of large delays. Such a problem may be addressed by using linear and non-linear (i.e. as exponential) packet drop probability functions. This paper proposes a revised RED active queue management algorithm named RED-linear exponential (RED-LE). This variant involves an interplay of linear and exponential drop functions, in order to improve the performance of the original RED algorithm. More importantly, at low and moderate network traffic loads, the RED-LE algorithm employs the linear drop action. However, for high traffic loads, RED-LE employs the exponential function for computing the packet drop probability rate. Experimental results have shown that RED-LE effectively controls congestion and offers an improved network performance under different traffic loads.

Źródło:

Journal of Telecommunications and Information Technology; 2022, 2; 91--97
1509-4553
1899-8852

Pojawia się w:

Journal of Telecommunications and Information Technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 15.

Tytuł:

A direct algorithm of possibilistic clustering with partial supervision

Autorzy:

Viattchenin, D.

Powiązania:

https://bibliotekanauki.pl/articles/385026.pdf

Data publikacji:

2007

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Automatyki i Pomiarów

Tematy:

clustering
fuzzy tolerance
fuzzy cluster
membership degree
allotment
typical point
labeled object
and partial supervision

Opis:

Fuzzy clustering plays an important role in intelligent systems design and the respective methods constitute a part of the areas of automation and robotics. This paper describes a modification of a direct algorithm of possibilistic clustering that takes into account the information coming from the labeled objects. The clustering method based on the concept of allotment among fuzzy clusters is the basis of the new algorithm. The paper provides the description of basic ideas of the method and the plan of the basic version of a direct possibilistic-clustering algorithm. A plan of modification of the direct possibilistic-clustering algorithm in the presence of information from labeled objects is proposed. An illustrative example of the method's application to the Sneath and Sokal's two-dimensional data in comparison with the Gaussian-clustering method is carried out. Preliminary conclusions are formulated.

Źródło:

Journal of Automation Mobile Robotics and Intelligent Systems; 2007, 1, 3; 29-38
1897-8649
2080-2145

Pojawia się w:

Journal of Automation Mobile Robotics and Intelligent Systems

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 16.

Tytuł:

Hybrydowy algorytm samolokalizacji
A hybrid algorithm for self location

Autorzy:

Dimitrova-Grekow, T.

Powiązania:

https://bibliotekanauki.pl/articles/156755.pdf

Data publikacji:

2013

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

roboty mobilne
nawigacja
lokalizacja
metryczno-topologiczne strategie
roboty edukacyjne
Mindstorms NXT
mobile robotics
navigation
location
topological-metric strategies
educational robots

Opis:

Niniejszy artykuł prezentuje podejście hybrydowe do samolokalizacji w oparciu o zintegrowany system zbierania danych. Obie funkcje topologiczna i metryczna zostały zrealizowane z użyciem dalmierza ultradźwiękowego. Do przetestowania poprawności działania opracowanej metody wykorzystano robot Lego Mindstorms NXT. Zaprezentowane rozwiązanie przyśpiesza pracę pojazdu, skracając czas rozpoznawania napotkanych obiektów orientacyjnych. Minimalizowany jest błąd odometryczny. Bardzo istotnym elementem pracy jest identyfikacja obiektów, ich orientacji i budowanie modelu mapy o względnym stopniu zaufania. Przeprowadzone badania wykazały wysoką dokładność zaprezentowanej metody samolokalizacji.
Application of two independent systems is a classical approach when realizing topological-metric localization algorithms [1, 2, 3]. In this issue a hybrid localization method with an integrated data collecting is proposed. Both functions, topological and metric, are based on a sonar. Multi-reflections are one of the biggest problems by the sonar systems [7, 8]. However, there are many examples of using sonars in the Simultaneous Localization and Mapping (SLAM) [4, 9]. The presented method (Section 2) consists of four phases: 1) data collec-tion and filtering (Figs. 1 and 2), 2) object classification (Fig. 3), 3) building map with a confidence coefficient (Fig. 4), 4) local and global map (Fig. 5) comparison and end decision. Many authors use a grid map for the topological localization [5, 6]. Here a model matching attempt is performed. The concept of the confidence coefficient map is very important in this work. Section 3 describes an experiment whose workspace is shown in Fig. 6. The results (Section 4) are presented in Table 1: 77% of the tests were successful , 14% gave fault results, while in 9% – no solution was found. In spite of the restrictions of the used robot, the project seems very perspective.

Źródło:

Pomiary Automatyka Kontrola; 2013, R. 59, nr 11, 11; 1163-1166
0032-4140

Pojawia się w:

Pomiary Automatyka Kontrola

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 17.

Tytuł:

A hybrid algorithm for solving inverse problems in elasticity

Autorzy:

Barabasz, B.
Gajda-Zagórska, E.
Migórski, S.
Paszyński, M.
Schaefer, R.
Smołka, M.

Powiązania:

https://bibliotekanauki.pl/articles/331427.pdf

Data publikacji:

2014

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

inverse problem
hierarchic genetic strategy
hybrid optimization
automatic hp adaptive finite element method
zagadnienie odwrotne
strategia genetyczna
optymalizacja hybrydowa
metoda elementów skończonych

Opis:

The paper offers a new approach to handling difficult parametric inverse problems in elasticity and thermo-elasticity, formulated as global optimization ones. The proposed strategy is composed of two phases. In the first, global phase, the stochastic hp-HGS algorithm recognizes the basins of attraction of various objective minima. In the second phase, the local objective minimizers are closer approached by steepest descent processes executed singly in each basin of attraction. The proposed complex strategy is especially dedicated to ill-posed problems with multimodal objective functionals. The strategy offers comparatively low computational and memory costs resulting from a double-adaptive technique in both forward and inverse problem domains. We provide a result on the Lipschitz continuity of the objective functional composed of the elastic energy and the boundary displacement misfits with respect to the unknown constitutive parameters. It allows common scaling of the accuracy of solving forward and inverse problems, which is the core of the introduced double-adaptive technique. The capability of the proposed method of finding multiple solutions is illustrated by a computational example which consists in restoring all feasible Young modulus distributions minimizing an objective functional in a 3D domain of a photo polymer template obtained during step and flash imprint lithography.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2014, 24, 4; 865-886
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 18.

Tytuł:

A new algorithm for a CFE-approximated solution of a discrete-time noninteger-order state equation

Autorzy:

Oprzędkiewicz, K.
Stanisławski, R.
Gawin, E.
Mitkowski, W.

Powiązania:

https://bibliotekanauki.pl/articles/199796.pdf

Data publikacji:

2017

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

fractional order calculus
discrete-time noninteger-order state equation
continuous fraction expansion
Al-Alaoui operator
równanie dyskretne
aproksymacja Al-Alaoui
CFE

Opis:

In the paper, a new method for solution of linear discrete-time fractional-order state equation is presented. The proposed method is simpler than other methods using directly discrete-time version of the Grünwald-Letnikov operator. The method is dedicated to use with any approximator to the operator expressed by a discrete transfer function, e.g. CFE-based Al-Alaoui approximation. A simulation example confirms the usefulness of the method.

Źródło:

Bulletin of the Polish Academy of Sciences. Technical Sciences; 2017, 65, 4; 429-437
0239-7528

Pojawia się w:

Bulletin of the Polish Academy of Sciences. Technical Sciences

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 19.

Tytuł:

Planning and management of aircraft maintenance using a genetic algorithm

Autorzy:

Kowalski, Mirosław
Izdebski, Mariusz
Żak, Jolanta
Gołda, Paweł
Manerowski, Jerzy

Powiązania:

https://bibliotekanauki.pl/articles/1841765.pdf

Data publikacji:

2021

Wydawca:

Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN

Tematy:

aircraft operation
maintenance
multi-criteria optimization
genetic algorithm

Opis:

The aim of the article was to develop a tool to support the process of planning and managing aircraft (ac) maintenance. Aircraft maintenance management has been presented for scheduled technical inspections resulting from manufacturers’ technical documentation for ac. The authors defined the problem under investigation in the form of a four-phase decisionmaking process taking into account assignment of aircraft to airports and maintenance stations, assignment of crew to maintenance points, setting the schedules, i.e. working days on which aircraft are directed to maintenance facilities. This approach to the planning and management of aircraft maintenance is a new approach, unprecedented in the literature. The authors have developed a mathematical model for aircraft maintenance planning and management in a multi-criteria approach and an optimisation tool based on the operation of a genetic algorithm. To solve the problem, a genetic algorithm was proposed. The individual steps of the algorithm construction were discussed and its effectiveness was verified using real data.

Źródło:

Eksploatacja i Niezawodność; 2021, 23, 1; 143-153
1507-2711

Pojawia się w:

Eksploatacja i Niezawodność

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 20.

Tytuł:

Planning and management of aircraft maintenance using a genetic algorithm

Autorzy:

Kowalski, Mirosław
Izdebski, Mariusz
Żak, Jolanta
Gołda, Paweł
Manerowski, Jerzy

Powiązania:

https://bibliotekanauki.pl/articles/1841824.pdf

Data publikacji:

2021

Wydawca:

Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN

Tematy:

aircraft operation
maintenance
multi-criteria optimization
genetic algorithm

Opis:

The aim of the article was to develop a tool to support the process of planning and managing aircraft (ac) maintenance. Aircraft maintenance management has been presented for scheduled technical inspections resulting from manufacturers’ technical documentation for ac. The authors defined the problem under investigation in the form of a four-phase decisionmaking process taking into account assignment of aircraft to airports and maintenance stations, assignment of crew to maintenance points, setting the schedules, i.e. working days on which aircraft are directed to maintenance facilities. This approach to the planning and management of aircraft maintenance is a new approach, unprecedented in the literature. The authors have developed a mathematical model for aircraft maintenance planning and management in a multi-criteria approach and an optimisation tool based on the operation of a genetic algorithm. To solve the problem, a genetic algorithm was proposed. The individual steps of the algorithm construction were discussed and its effectiveness was verified using real data.

Źródło:

Eksploatacja i Niezawodność; 2021, 23, 1; 143-153
1507-2711

Pojawia się w:

Eksploatacja i Niezawodność

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 21.

Tytuł:

Algorithm 45. A heuristic algorithm for the traveling-salesman problem
Algorytm 45. Heurystyczny algorytm dla zagadnienia komiwojażera

Autorzy:

Adrabiński, A.

Powiązania:

https://bibliotekanauki.pl/articles/742298.pdf

Data publikacji:

1976

Wydawca:

Polska Akademia Nauk. Instytut Matematyczny PAN

Źródło:

Applicationes Mathematicae; 1976-1977, 15, 2; 223-244
1233-7234

Pojawia się w:

Applicationes Mathematicae

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 22.

Tytuł:

A parallel algorithm for solving band systems and matrix inversion

Autorzy:

Halada, Ladislav

Powiązania:

https://bibliotekanauki.pl/articles/721587.pdf

Data publikacji:

1984

Wydawca:

Polska Akademia Nauk. Instytut Matematyczny PAN

Źródło:

Banach Center Publications; 1984, 13, 1; 535-541
0137-6934

Pojawia się w:

Banach Center Publications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 23.

Tytuł:

On a certain algorithm of eigenvalue localization for normal operators

Autorzy:

Moszyński, Krzysztof
Regińska, Teresa

Powiązania:

https://bibliotekanauki.pl/articles/720082.pdf

Data publikacji:

1990

Wydawca:

Polska Akademia Nauk. Instytut Matematyczny PAN

Źródło:

Banach Center Publications; 1990, 24, 1; 533-549
0137-6934

Pojawia się w:

Banach Center Publications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 24.

Tytuł:

A practical algorithm management of patients with benign prostatic hyperplasia

Autorzy:

Dutkiewicz, S.

Powiązania:

https://bibliotekanauki.pl/articles/3168.pdf

Data publikacji:

2008

Wydawca:

Instytut Medycyny Wsi

Tematy:

algorithm management
human disease
patient
benign prostate hyperplasia
hyperplasia
man
urinary outflow obstruction
enlargement
prostate
alpha1-adrenoreceptor blocker
5-alpha-reductase inhibitor
combination therapy
surgical treatment

Źródło:

Journal of Pre-Clinical and Clinical Research; 2008, 02, 2
1898-2395

Pojawia się w:

Journal of Pre-Clinical and Clinical Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 25.

Tytuł:

R peak determination using a WDFR algorithm and Adaptive threshold

Autorzy:

Nguyen, Thanh-Nghia
Nguyen, Thanh-Hai
Ngo, Ba-Viet

Powiązania:

https://bibliotekanauki.pl/articles/38437166.pdf

Data publikacji:

2022

Wydawca:

Polskie Towarzystwo Promocji Wiedzy

Tematy:

ECG signal
wavelet transforms
WDFR algorithm
R peak determination
adaptive threshold

Opis:

The determination of the R peak position in the ECG signal helps physicians not only to know the heart rate per minute, but also to monitor the patient’s health related to heart disease. This paper proposes a system to accurately determine the R peak position in the ECG signal. The system consists of a pre-processing block for filtering out noise using a WDFR algorithm and highlighting the amplitude of the R peak and a threshold value is calculated for determining the R peak. In this research, the MIT-BIH ECG dataset with 48 records are used for evaluation of the system. The results of the SEN, +P, DER and ACC parameters related to the system quality are 99.70%, 99.59%, 0.70% and 99.31%, respectively. The obtained performance of the proposed R peak position determination system is very high and can be applied to determine the R peak of the ECG signal measuring devices in practice.

Źródło:

Applied Computer Science; 2022, 18, 3; 19-30
1895-3735
2353-6977

Pojawia się w:

Applied Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 26.

Tytuł:

A diagnostic algorithm diagnosing the failure of railway signal equipment

Autorzy:

Wu, Yongcheng
Cao, Dejin

Powiązania:

https://bibliotekanauki.pl/articles/1955227.pdf

Data publikacji:

2021

Wydawca:

Polska Akademia Nauk. Polskie Towarzystwo Diagnostyki Technicznej PAN

Tematy:

failure diagnosis
railway signal equipment
denoising
feature extraction
diagnostyka uszkodzeń
sygnalizacja kolejowa
odszumianie
ekstrakcja cech

Opis:

Failure of railway signal equipment can cause an impact on its normal operation, and it is necessary to make a timely diagnosis of the failure. In this study, the data of a railway bureau from 2016 to 2020 were studied as an example. Firstly, denoising and feature extraction were performed on the data; then the Adaptive Comprehensive Oversampling (ADASYN) method was used to synthesize minority class samples; finally, three algorithms, back-propagation neural network (BPNN), support vector machine (SVM) and C4.5 algorithms, were used for failure diagnosis. It was found that the three algorithms performed poorly in diagnosing the original data but performed significantly better in diagnosing the synthesized samples, among which the BPNN algorithm had the best performance. The average precision, recall rate and F1 score of the BPNN algorithm were 0.94, 0.92 and 0.93, respectively. The results verify the effectiveness of the BPNN algorithm for failure diagnosis, and the algorithm can be further promoted and applied in practice.

Źródło:

Diagnostyka; 2021, 22, 4; 33-38
1641-6414
2449-5220

Pojawia się w:

Diagnostyka

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 27.

Tytuł:

A genetic algorithm for the maximum 2-packing set problem

Autorzy:

Trejo-Sánchez, Joel Antonio
Fajardo-Delgado, Daniel
Gutierrez-Garcia, J. Octavio

Powiązania:

https://bibliotekanauki.pl/articles/330154.pdf

Data publikacji:

2020

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

maximum 2-packing set
genetic algorithms
graph algorithms
algorytm genetyczny
algorytm grafowy

Opis:

Given an undirected connected graph G = (V, E), a subset of vertices S is a maximum 2-packing set if the number of edges in the shortest path between any pair of vertices in S is at least 3 and S has the maximum cardinality. In this paper, we present a genetic algorithm for the maximum 2-packing set problem on arbitrary graphs, which is an NP-hard problem. To the best of our knowledge, this work is a pioneering effort to tackle this problem for arbitrary graphs. For comparison, we extended and outperformed a well-known genetic algorithm originally designed for the maximum independent set problem. We also compared our genetic algorithm with a polynomial-time one for the maximum 2-packing set problem on cactus graphs. Empirical results show that our genetic algorithm is capable of finding 2-packing sets with a cardinality relatively close (or equal) to that of the maximum 2-packing sets. Moreover, the cardinality of the 2-packing sets found by our genetic algorithm increases linearly with the number of vertices and with a larger population and a larger number of generations. Furthermore, we provide a theoretical proof demonstrating that our genetic algorithm increases the fitness for each candidate solution when certain conditions are met.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2020, 30, 1; 173-184
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 28.

Tytuł:

Artificial intelligence in solving collision problem in restricted area

Autorzy:

Mąka, M.
Dramski, M.

Powiązania:

https://bibliotekanauki.pl/articles/359349.pdf

Data publikacji:

2013

Wydawca:

Akademia Morska w Szczecinie. Wydawnictwo AMSz

Tematy:

shortest path
safe route
restricted area
trapezoidal grid
area discretization
simplified ant algorithm
A* algorithm

Opis:

This paper presents one of the approaches to solve the collision problem in restricted area for two moving objects using artificial intelligence (SACO algorithm). Although AI should be used only when the classic methods fail, a simple comparison between them is very interesting. As we know the main task of navigation is to conduct safely an object from the point of departure to destination. This problem does not seem easy, especially if we consider the movement in restricted areas such narrow passages, ports etc.

Źródło:

Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 2; 118-122
1733-8670
2392-0378

Pojawia się w:

Zeszyty Naukowe Akademii Morskiej w Szczecinie

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 29.

Tytuł:

A control algorithm for joint flight of a group of drones

Autorzy:

Sabziev, Elkhan

Powiązania:

https://bibliotekanauki.pl/articles/2116418.pdf

Data publikacji:

2021

Wydawca:

Politechnika Śląska. Wydawnictwo Politechniki Śląskiej

Tematy:

group flight
drone
algorithm
lot grupowy
dron
algorytm

Opis:

Using drones in groups in the military field is not a novel idea. A massive attack by a large amount of equipment is known to be very difficult to prevent. Therefore, it is a good tactic to sacrifice some of the relatively cheap drones to destroy special enemy targets in a massive attack. This raises the issue of joint control of the behaviour of a group of drones. This paper proposes a System of Systems ideology-based decision-making system that allows to individually control each drone in a group flight. An algorithm is developed that allows controlling drones by controlling their speed.

Źródło:

Zeszyty Naukowe. Transport / Politechnika Śląska; 2021, 110; 157--167
0209-3324
2450-1549

Pojawia się w:

Zeszyty Naukowe. Transport / Politechnika Śląska

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 30.

Tytuł:

A linear algorithm for the two paths problem on permutation graphs

Autorzy:

Gopalakrishnan, C.
Pandu Rangan, C.

Powiązania:

https://bibliotekanauki.pl/articles/972048.pdf

Data publikacji:

1995

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

algorithm
bridge
connectivity
disjoint paths
permutation graph
two paths problem

Opis:

The 'two paths problem' is stated as follows. Given an undirected graph G = (V,E) and vertices s₁,t₁;s₂,t₂, the problem is to determine whether or not G admits two vertex-disjoint paths P₁ and P₂ connecting s₁ with t₁ and s₂ with t₂ respectively. In this paper we give a linear (O(|V|+ |E|)) algorithm to solve the above problem on a permutation graph.

Źródło:

Discussiones Mathematicae Graph Theory; 1995, 15, 2; 147-166
2083-5892

Pojawia się w:

Discussiones Mathematicae Graph Theory

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 31.

Tytuł:

A parallel algorithm of icsym forcomplexsymmetric linear systems in quantum chemistry

Autorzy:

Zhang, Y.
Lv, Q.
Xiao, M.
Xie, G.
Breitkopf, P.

Powiązania:

https://bibliotekanauki.pl/articles/305677.pdf

Data publikacji:

2018

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

complex symmetric linear systems
parallel computing
improved conjugate gradient-type iterative algorithm (ICSYM)

Opis:

Computational effort is a common issue for solving large-scale complex symmetric linear systems, particularly in quantum chemistry applications. In order to alleviate this problem, we propose a parallel algorithm of improved conjugate gradient-type iterative (ICSYM). Using three-term recurrence relation and or- thogonal properties of residual vectors to replace the tridiagonalization process of classical CSYM, which allows to decrease the degree of the reduce-operator from two to one communication at each iteration and to reduce the amount of vector updates and vector multiplications. Several numerical examples are implemented to show that high performance of proposed improved version is obtained both in convergent rate and in parallel efficiency.

Źródło:

Computer Science; 2018, 19 (4); 385-401
1508-2806
2300-7036

Pojawia się w:

Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 32.

Tytuł:

A genetic algorithm for the project scheduling with the resource constraints

Autorzy:

Klimek, Marcin

Powiązania:

https://bibliotekanauki.pl/articles/764689.pdf

Data publikacji:

2010

Wydawca:

Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej

Źródło:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2010, 10, 1
1732-1360
2083-3628

Pojawia się w:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 33.

Tytuł:

An autonomous vehicle sequencing problem at intersections: A genetic algorithm approach

Autorzy:

Yan, F.
Dridi, M.
El Moudni, A.

Powiązania:

https://bibliotekanauki.pl/articles/329874.pdf

Data publikacji:

2013

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

autonomous vehicle
autonomous intersection management
genetic algorithm
dynamic programming
heuristics
pojazd autonomiczny
algorytm genetyczny
programowanie dynamiczne

Opis:

This paper addresses a vehicle sequencing problem for adjacent intersections under the framework of Autonomous Intersection Management (AIM). In the context of AIM, autonomous vehicles are considered to be independent individuals and the traffic control aims at deciding on an efficient vehicle passing sequence. Since there are considerable vehicle passing combinations, how to find an efficient vehicle passing sequence in a short time becomes a big challenge, especially for more than one intersection. In this paper, we present a technique for combining certain vehicles into some basic groups with reference to some properties discussed in our earlier works. A genetic algorithm based on these basic groups is designed to find an optimal or a near-optimal vehicle passing sequence for each intersection. Computational experiments verify that the proposed genetic algorithms can response quickly for several intersections. Simulations with continuous vehicles are carried out with application of the proposed algorithm or existing traffic control methods. The results show that the traffic condition can be significantly improved by our algorithm.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2013, 23, 1; 183-200
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 34.

Tytuł:

A genetic algorithm based optimized convolutional neural network for face recognition

Autorzy:

Karlupia, Namrata
Mahajan, Palak
Abrol, Pawanesh
Lehana, Parveen K.

Powiązania:

https://bibliotekanauki.pl/articles/2201023.pdf

Data publikacji:

2023

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

convolutional neural network
genetic algorithm
deep learning
evolutionary technique
sieć neuronowa konwolucyjna
algorytm genetyczny
uczenie głębokie
technika ewolucyjna

Opis:

Face recognition (FR) is one of the most active research areas in the field of computer vision. Convolutional neural networks (CNNs) have been extensively used in this field due to their good efficiency. Thus, it is important to find the best CNN parameters for its best performance. Hyperparameter optimization is one of the various techniques for increasing the performance of CNN models. Since manual tuning of hyperparameters is a tedious and time-consuming task, population based metaheuristic techniques can be used for the automatic hyperparameter optimization of CNNs. Automatic tuning of parameters reduces manual efforts and improves the efficiency of the CNN model. In the proposed work, genetic algorithm (GA) based hyperparameter optimization of CNNs is applied for face recognition. GAs are used for the optimization of various hyperparameters like filter size as well as the number of filters and of hidden layers. For analysis, a benchmark dataset for FR with ninety subjects is used. The experimental results indicate that the proposed GA-CNN model generates an improved model accuracy in comparison with existing CNN models. In each iteration, the GA minimizes the objective function by selecting the best combination set of CNN hyperparameters. An improved accuracy of 94.5% is obtained for FR.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2023, 33, 1; 21--31
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 35.

Tytuł:

A learning algorithm combining functional discriminant coordinates and functional principal components

Autorzy:

Górecki, Tomasz
Krzyśko, Mirosław

Powiązania:

https://bibliotekanauki.pl/articles/729818.pdf

Data publikacji:

2014

Wydawca:

Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii

Tematy:

functional principal components
functional discriminant coordinates

Opis:

A new type of discriminant space for functional data is presented, combining the advantages of a functional discriminant coordinate space and a functional principal component space. In order to provide a comprehensive comparison, we conducted a set of experiments, testing effectiveness on 35 functional data sets (time series). Experiments show that constructed combined space provides a higher quality of classification of LDA method compared with component spaces.

Źródło:

Discussiones Mathematicae Probability and Statistics; 2014, 34, 1-2; 127-141
1509-9423

Pojawia się w:

Discussiones Mathematicae Probability and Statistics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 36.

Tytuł:

A distributed algorithm for protein identification from tandem mass spectrometry data

Autorzy:

Orzechowska, Katarzyna
Rubel, Tymon
Kurjata, Robert
Zaremba, Krzysztof

Powiązania:

https://bibliotekanauki.pl/articles/2097435.pdf

Data publikacji:

2022

Wydawca:

Polskie Towarzystwo Promocji Wiedzy

Tematy:

proteomics
mass spectrometry
distributed computing
Apache Spark

Opis:

Tandem mass spectrometry is an analytical technique widely used in proteomics for the high-throughput characterization of proteins in biological samples. Modern in-depth proteomic studies require the collection of even millions of mass spectra representing short protein fragments (peptides). In order to identify the peptides, the measured spectra are most often scored against a database of amino acid sequences of known proteins. Due to the volume of input data and the sizes of proteomic databases, this is a resource-intensive task, which requires an efficient and scalable computational strategy. Here, we present SparkMS, an algorithm for peptide and protein identification from mass spectrometry data explicitly designed to work in a distributed computational environment. To achieve the required performance and scalability, we use Apache Spark, a modern framework that is becoming increasingly popular not only in the field of “big data” analysis but also in bioinformatics. This paper describes the algorithm in detail and demonstrates its performance on a large proteomic dataset. Experimental results indicate that SparkMS scales with the number of worker nodes and the increas-ing complexity of the search task. Furthermore, it exhibits a protein identification efficiency comparable to X!Tandem, a widely-used proteomic search engine.

Źródło:

Applied Computer Science; 2022, 18, 2; 16--27
1895-3735

Pojawia się w:

Applied Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 37.

Tytuł:

Dynamic Key Generation During a Communication Instance Over GSM

Autorzy:

Zalaket, J.
Challita, K.

Powiązania:

https://bibliotekanauki.pl/articles/108666.pdf

Data publikacji:

2013

Wydawca:

Społeczna Akademia Nauk w Łodzi

Tematy:

mobile communication
encryption
GSM
A5 algorithm

Opis:

Mobile phone may become the protagonist of the new electronic technology. If we compare it with that of other technologies, the infiltration rate of mobile phones in the world is extremely high, both in cities than rural communities of the most of the countries. According to estimates made by the International Telecommunication Union the access to mobile networks is growing much faster than the access to Internet. This emergence has led many companies to allow new activities which were previously running strictly over the Internet to run over the mobile network such as the electronic payment. These circumstances make the security of mobile communication a priority to preserve the authentication, confidentiality and integrity of data sent between subscribers and mobile network. In this paper, we propose a dynamic key generation for the A5 GSM encryption algorithm to enforce the security and protect the transferred data. Our algorithm can be implemented over any GSM generation GSM/3G/4G.

Źródło:

Journal of Applied Computer Science Methods; 2013, 5 No. 1; 47-57
1689-9636

Pojawia się w:

Journal of Applied Computer Science Methods

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 38.

Tytuł:

Sensor Network Deployment Optimization for Improved Area Coverage Using a Genetic Algorithm

Autorzy:

Szklarski, Łukasz

Powiązania:

https://bibliotekanauki.pl/articles/1861643.pdf

Data publikacji:

2016

Wydawca:

Wyższa Szkoła Bezpieczeństwa Publicznego i Indywidualnego Apeiron w Krakowie

Tematy:

network of sensors
genetic algorithm
sensors deployment
area coverage

Opis:

Ensuring optimal coverage is a central objective of every sensor deployment plan. Effective monitoring of the environment helps to minimize manpower and time, while enhancing surveillance capability. In this paper, a solution for improved area coverage was presented. A lattice of a pre-defined parameter has been used as an input for the algorithm. For the purpose of the research the blanket deployment strategy has been adopted. Then, a genetic algorithm has been proposed and implemented to find an optimal solution. The proposed approach has been tested and the conclusions have been drawn. The results proved that the proposed genetic algorithm could already provide satisfactory results, usually finding only suboptimal solutions.

Źródło:

Security Dimensions; 2016, 19(19); 150-181
2353-7000

Pojawia się w:

Security Dimensions

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 39.

Tytuł:

Optimization of fractal compression of 3d images using a genetic algorithm

Autorzy:

Khanmirza, Z
Ramezani, F
Motameni, H

Powiązania:

https://bibliotekanauki.pl/articles/102068.pdf

Data publikacji:

2015

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

stereo system
fractal compression
genetic algorithm

Opis:

3D image technologies are widely recognized as the next generation of visual presentation considering the achievement of more natural experiences. To produce such images, two cameras are placed in a bit different position. When we seek to compress such images, we need a procedure to compress two images synchronously. In this paper, a procedure is presented for a suitable compression based on fractal compression which shows that we obtain high compression rate with an appropriate image quality; however, since the proposed procedure has a low search speed, we used genetic algorithm to remove the case.

Źródło:

Advances in Science and Technology. Research Journal; 2015, 9, 26; 124-128
2299-8624

Pojawia się w:

Advances in Science and Technology. Research Journal

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 40.

Tytuł:

A static calibration of mems 3-axis accelerometer using a genetic algorithm

Autorzy:

Marinov, Marin
Petrov, Zhivo

Powiązania:

https://bibliotekanauki.pl/articles/198726.pdf

Data publikacji:

2019

Wydawca:

Politechnika Śląska. Wydawnictwo Politechniki Śląskiej

Tematy:

MEMS accelerometers
calibration
bias
genetic algorithm
akcelerometr MEMS
kalibracja
obciążenie
algorytm genetyczny

Opis:

In this paper, a procedure for MEMS accelerometer static calibration using a genetic algorithm, considering non-orthogonality was presented. The results of simulations and real accelerometer calibration are obtained showing high accuracy of parameters estimation.

Źródło:

Zeszyty Naukowe. Transport / Politechnika Śląska; 2019, 105; 157-168
0209-3324
2450-1549

Pojawia się w:

Zeszyty Naukowe. Transport / Politechnika Śląska

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 41.

Tytuł:

A genetic algorithm for vehicle routing in logistic networks with practical constraints

Autorzy:

Koloch, Grzegorz
Lewandowski, Michał
Zientara, Marcin
Grodecki, Grzegorz
Matuszak, Piotr
Kantorski, Igor
Nowackig, Adam

Powiązania:

https://bibliotekanauki.pl/articles/1981356.pdf

Data publikacji:

2021-12-30

Wydawca:

Główny Urząd Statystyczny

Tematy:

rich vehicle routing problem
brownfield
hubs and satellites
genetic algorithm

Opis:

We optimise a postal delivery problem with time and capacity constraints imposed on vehicles and nodes of the logistic network. Time constraints relate to the duration of routes, whereas capacity constraints concern technical characteristics of vehicles and postal operation outlets. We consider a method which can be applied to a brownfield scenario, in which capacities of outlets can be relaxed and prospective hubs identified. As a solution, we apply a genetic algorithm and test its properties both in small case studies and in a simulated problem instance of a larger (i.e. comparable with real-world instances) size. We show that the genetic operators we employ are capable of switching between solutions based on direct origin-to-destination routes and solutions based on transfer connections, depending on what is more beneficial in a given problem instance. Moreover, the algorithm correctly identifies cases in which volumes should be shipped directly, and those in which it is optimal to use transfer connections within a single problem instance, if an instance in question requires such a selection for optimality. The algorithm is thus suitable for determining hubs and satellite locations. All considerations presented in this paper are motivated by real-life problem instances experienced by the Polish Post, the largest postal service provider in Poland, in its daily plans of delivering postal packages, letters and pallets.

Źródło:

Przegląd Statystyczny; 2021, 68, 3; 16-40
0033-2372

Pojawia się w:

Przegląd Statystyczny

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 42.

Tytuł:

Task allocation algorithms for maximizing reliability of heterogeneous distributed computing systems

Autorzy:

Mahmood, A.

Powiązania:

https://bibliotekanauki.pl/articles/205582.pdf

Data publikacji:

2001

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

heurystyka
niezawodność
obliczenie zdecentralizowane
przetwarzanie rozproszone
A* algorithm
branch-and-bound
distributed computing
heuristics
reliability
task allocation

Opis:

The rapid progress of microprocessor and communication technologies has made the distributed computing system economically attractive for many computer applications. One of the first problems encountered in the operation of a distributed system is the problem of allocating the tasks among the processing nodes. The task allocation problem is known to be computationally intractable for large task sets. In this paper, we consider the task allocation problem with the goal of maximizing reliability of heterogeneous distributed systems. After presenting a quantitative task allocation model, we present a least-cost branch-and-bound algorithm to find optimal task allocations. We also present two heuristic algorithms to obtain suboptimal allocations for realistic size large problems in a reasonable amount of computational time. Simulation was used to study the performance of the proposed algorithms for a large number of problems. Also, performance of the proposed algorithms has been compared with a well-known heuristics available in the literature.

Źródło:

Control and Cybernetics; 2001, 30, 1; 115-130
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 43.

Tytuł:

A fast algorithm for the construction of recurrence relations for modified moments

Autorzy:

Lewanowicz, Stanisław

Powiązania:

https://bibliotekanauki.pl/articles/1340584.pdf

Data publikacji:

1994

Wydawca:

Polska Akademia Nauk. Instytut Matematyczny PAN

Tematy:

Gegenbauer polynomials
recurrence relations
modified moments

Opis:

A new approach is presented for constructing recurrence relations for the modified moments of a function with respect to the Gegenbauer polynomials.

Źródło:

Applicationes Mathematicae; 1993-1995, 22, 3; 359-372
1233-7234

Pojawia się w:

Applicationes Mathematicae

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 44.

Tytuł:

A computation algorithm for Strassens matrix multiplication
Algorytm obliczania iloczynu macierzowego Strassena

Autorzy:

Tariov, A.
Gliszczyński, M.

Powiązania:

https://bibliotekanauki.pl/articles/154595.pdf

Data publikacji:

2010

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

iloczyn macierzowy Strassena
szybkie algorytmy
Strassen's matrix multiplication
fast algorithms

Opis:

In the work the vectorized algorithm for Strassen's matrix product calculating is presented. Unlike the proposed in other works "some recommendations" relating to the Strassen's matrix multiplication implementation, we offer specific computational procedures that allow correctly describe the entire sequence of transformations needed to obtain the final result. The proposed algorithm can be successfully applied to accelerate calculations in the FPGA-based platforms.
W pracy został przedstawiony wektoryzowany algorytm wyznaczenia iloczynu macierzowego Strassena. W odróżnieniu od poruszanych w innych publikacjach wybranych uwag dotyczących realizacji metody Strassena w niniejszej pracy zaproponowane są konkretne procedury, opisujące cały proces obliczeniowy i pozwalające na podstawie wykonania skończonej liczby etapów przetwarzania danych wejściowych otrzymać wynik końcowy. Została roztrząśnięta synteza proponowanego algorytmu oraz pokazana postać stosownego grafu przepływowego dla przykładu mnożenia macierzy drugiego rzędu. Zaproponowany algorytm może być sukcesywnie zastosowany do przyspieszonej realizacji obliczeń w platformach FPGA oraz zaimplementowany w wybranym środowisku sprzętowym. Niewątpliwym atutem odróżniającym przedstawione rozwiązanie od tradycyjnego algorytmu jest również brak rekurencji obliczeń, co daje dodatkowy zysk przy zrównolegleniu procesu wyznaczenia iloczynu.

Źródło:

Pomiary Automatyka Kontrola; 2010, R. 56, nr 7, 7; 691-693
0032-4140

Pojawia się w:

Pomiary Automatyka Kontrola

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 45.

Tytuł:

A numerical algorithm for computing the inverse of a Toeplitz pentadiagonal matrix

Autorzy:

Talibi, B.
Hadj, D. A.
Sarsri, D.

Powiązania:

https://bibliotekanauki.pl/articles/122953.pdf

Data publikacji:

2018

Wydawca:

Politechnika Częstochowska. Wydawnictwo Politechniki Częstochowskiej

Tematy:

pentadiagonal matrix
Toeplitz matrix
K-Hessenberg matrix
inverse
system algebry komputerowej
macierz K-Hessenberga
odwrotność
inwersja
algorytm numeryczny
macierz Toeplitza

Opis:

In the current paper, we present a computationally efficient algorithm for obtaining the inverse of a pentadiogonal toeplitz matrix. Few conditions are required, and the algorithm is suited for implementation using computer algebra systems.

Źródło:

Journal of Applied Mathematics and Computational Mechanics; 2018, 17, 3; 83-95
2299-9965

Pojawia się w:

Journal of Applied Mathematics and Computational Mechanics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 46.

Tytuł:

A new heuristic algorithm of fuzzy clustering

Autorzy:

Viattchenin, D. A.

Powiązania:

https://bibliotekanauki.pl/articles/970349.pdf

Data publikacji:

2004

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

grupowanie rozmyte
przydział
punkt typowy
fuzzy clustering
fuzzy tolerance
fuzzy cluster
membership degree
allotment
typical point

Opis:

This paper deals with a new method of fuzzy clustering. The basic concepts of the method are introduced as resulting from the consideration of the fundamental fuzzy clustering problem. The paper provides the description of the general plan of the algorithm and an illustrative example. An analysis of the experimental results of the method's application to the Anderson's Iris data is carried out. Some preliminary conclusions and the ways of prospective investigations are given.

Źródło:

Control and Cybernetics; 2004, 33, 2; 323-340
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 47.

Tytuł:

A Two-Phase Algorithm for a Resource Constrained Project Scheduling Problem with Discounted Cash Flows

Autorzy:

Klimek, M.
Łebkowski, P.

Powiązania:

https://bibliotekanauki.pl/articles/375952.pdf

Data publikacji:

2013

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

resource-constrained project scheduling
discounted cash flows
milestones
heuristics

Opis:

This paper presents a Resource-Constrained Project Scheduling Problem (RCPSP) settled by contractual milestones. The criterion analysed here is the maximisation of aggregate discounted cash flows from the contractor´s perspective, known as an RCPSP problem with Discounted Cash Flows (RCPSPDCF). The cash flows analysed here cover the contractor´s cash outflows (negative cash flows), related to the commencement of individual activities, and cash inflows (positive cash flows) after the fulfilment of individual milestones. The authors propose a two-phase algorithm for solving the problem defined. In the first phase, the simulated annealing metaheuristics is used, designed to identify a forward schedule with as high total DCF as possible. In the second phase, the best first-phase schedule is improved by right shifts of activities. To this end, the procedure which iteratively shifts tasks by one unit is applied, with a view to maximising the objective function. Activity shifts take into consideration precedence and resource constraints, and they are performed for a specified resource allocation to activities. This paper also includes an analysis of the problem for a sample project. The results of computational experiments are then analysed. The experiments were run with the use of standard test problems from the Project Scheduling Problem LIBrary (PSPLIB), with additionally defined cash flows and contractual milestones.

Źródło:

Decision Making in Manufacturing and Services; 2013, 7, 1-2; 51-68
1896-8325
2300-7087

Pojawia się w:

Decision Making in Manufacturing and Services

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 48.

Tytuł:

Application of a genetic algorithm for design optimisation of a passive magnetic gear

Autorzy:

Kowol, M.
Kołodziej, J.
Łukaniszyn, M.

Powiązania:

https://bibliotekanauki.pl/articles/97369.pdf

Data publikacji:

2016

Wydawca:

Politechnika Poznańska. Wydawnictwo Politechniki Poznańskiej

Tematy:

magnetic gear
finite element method
evolutionary algorithm

Opis:

This paper analyzes an influence of selected design parameters of a passive magnetic gear on the transmitted torque density. This constitutes the basis for determination of a number of design parameters and their ranges in the optimisation process. Calculations are carried out using the two–dimensional finite element method implemented in the Matlab environment. As a result of the optimisation process, the design parameters of the magnetic gear with a much higher value of the transmitted torque are obtained.

Źródło:

Computer Applications in Electrical Engineering; 2016, 14; 220-230
1508-4248

Pojawia się w:

Computer Applications in Electrical Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 49.

Tytuł:

Acoustical Assessment of Automotive Mufflers Using FEM, Neural Networks, and a Genetic Algorithm

Autorzy:

Chang, Y.-C.
Chiu, M.-C.
Wu, M.-R.

Powiązania:

https://bibliotekanauki.pl/articles/177901.pdf

Data publikacji:

2018

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

acoustics
finite element method
genetic algorithm
muffler optimization
polynomial neural network model

Opis:

In order to enhance the acoustical performance of a traditional straight-path automobile muffler, a multi-chamber muffler having reverse paths is presented. Here, the muffler is composed of two internally parallel/extended tubes and one internally extended outlet. In addition, to prevent noise transmission from the muffler’s casing, the muffler’s shell is also lined with sound absorbing material. Because the geometry of an automotive muffler is complicated, using an analytic method to predict a muffler’s acoustical performance is difficult; therefore, COMSOL, a finite element analysis software, is adopted to estimate the automotive muffler’s sound transmission loss. However, optimizing the shape of a complicated muffler using an optimizer linked to the Finite Element Method (FEM) is time-consuming. Therefore, in order to facilitate the muffler’s optimization, a simplified mathematical model used as an objective function (or fitness function) during the optimization process is presented. Here, the objective function can be established by using Artificial Neural Networks (ANNs) in conjunction with the muffler’s design parameters and related TLs (simulated by FEM). With this, the muffler’s optimization can proceed by linking the objective function to an optimizer, a Genetic Algorithm (GA). Consequently, the discharged muffler which is optimally shaped will improve the automotive exhaust noise.

Źródło:

Archives of Acoustics; 2018, 43, 3; 517-529
0137-5075

Pojawia się w:

Archives of Acoustics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 50.

Tytuł:

A Bayes algorithm for model compatibility and comparison of ARMA( p; q) models

Autorzy:

Tripathi, Praveen Kumar
Sen, Rijji
Upadhyay, S. K.

Powiązania:

https://bibliotekanauki.pl/articles/1054568.pdf

Data publikacji:

2021-06-04

Wydawca:

Główny Urząd Statystyczny

Tematy:

ARMA model
exact likelihood
Gibbs sampler
Metropolis algorithm
posterior predictive loss
model compatibility
Ljung-Box-Pierce statistic
GDP growth rate

Opis:

The paper presents a Bayes analysis of an autoregressive-moving average model and its components based on exact likelihood and weak priors for the parameters where the priors are defined so that they incorporate stationarity and invertibility restrictions naturally. A Gibbs- Metropolis hybrid scheme is used to draw posterior-based inferences for the models under consideration. The compatibility of the models with the data is examined using the Ljung- Box-Pierce chi-square-based statistic. The paper also compares different compatible models through the posterior predictive loss criterion in order to recommend the most appropriate one. For a numerical illustration of the above, data on the Indian gross domestic product growth rate at constant prices are considered. Differencing the data once prior to conducting the analysis ensured their stationarity. Retrospective short-term predictions of the data are provided based on the final recommended model. The considered methodology is expected to offer an easy and precise method for economic data analysis.

Źródło:

Statistics in Transition new series; 2021, 22, 2; 95-123
1234-7655

Pojawia się w:

Statistics in Transition new series

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 51.

Tytuł:

A New Algorithm for Phased Array Radar Search Function Improvement in Overload Situations

Autorzy:

Fatemi Mofrad, R. F.
Sadeghzadeh, R. A.

Powiązania:

https://bibliotekanauki.pl/articles/226581.pdf

Data publikacji:

2011

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

phased array radar
radar resource allocation
radar modeling
radar simulation
radar performance evaluation

Opis:

A new algorithm is proposed for phased array radar search function resource allocation. The proposed algorithm adaptively priorities radar search regions and in overload situations, based on available resources, radar characteristics, maximum range and search regions, optimally allocates radar resources in order to maximize probability of detection. The performance of new algorithm is evaluated by the multifunction phased array radar simulation test bed. This simulation test bed provides capability to design and evaluate the performance of different radar resource management, target tracking and beam forming algorithms. Some results are presented that show capabilities of this simulation software for multifunction radar algorithms design and performance evaluation.

Źródło:

International Journal of Electronics and Telecommunications; 2011, 57, 1; 55-63
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 52.

Tytuł:

Ant colony metaphor in a new clustering algorithm

Autorzy:

Boryczka, U.

Powiązania:

https://bibliotekanauki.pl/articles/969824.pdf

Data publikacji:

2010

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

data mining
cluster analysis
ant clustering algorithm

Opis:

Among the many bio-inspired techniques, ant clustering algorithms have received special attention, especially because they still require much investigation to improve performance, stability and other key features that would make such algorithms mature tools for data mining. Clustering with swarm-based algorithms is emerging as an alternative to more conventional clustering methods, such as k-means algorithm. This proposed approach mimics the clustering behavior observed in real ant colonies. As a case study, this paper focuses on the behavior of clustering procedures in this new approach. The proposed algorithm is evaluated on a number of well-known benchmark data sets. Empirical results clearly show that the ant clustering algorithm (ACA) performs well when compared to other techniques.

Źródło:

Control and Cybernetics; 2010, 39, 2; 343-358
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 53.

Tytuł:

Obstacle avoidance method of autonomous vehicle based on fusion improved A*APF algorithm

Autorzy:

Qian, Yubin
Sun, Hongtao
Feng, Song

Powiązania:

https://bibliotekanauki.pl/articles/2204535.pdf

Data publikacji:

2023

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

obstacle avoidance
path planning
fuzzy control
tracking control
unikanie przeszkód
planowanie ścieżki
kontroler rozmyty
kontroler śledzenia

Opis:

This paper proposes an autonomous obstacle avoidance method combining improved A-star (A*) and improved artificial potential field (APF) to solve the planning and tracking problems of autonomous vehicles in a road environment. The A*APF algorithm to perform path planning tasks, and based on the longitudinal braking distance model, a dynamically changing obstacle influence range is designed. When there is no obstacle affecting the controlled vehicle, the improved A* algorithm with angle constraint combined with steering cost can quickly generate the optimal route and reduce turning points. If the controlled vehicle enters the influence domain of obstacle, the improved artificial potential field algorithm will generate lane changing paths and optimize the local optimal locations based on simulated annealing. Pondering the influence of surrounding participants, the four-mode obstacle avoidance process is established, and the corresponding safe distance condition is analyzed. A particular index is introduced to comprehensively evaluate speed, risk warning, and safe distance factors, so the proposed method is designed based on the fuzzy control theory. In the tracking task, a model predictive controller in the light of the kinematics model is devised to make the longitudinal and lateral process of lane changing meet comfort requirements, generating a feasible autonomous lane-change path. Finally, the simulation was performed in the Matlab/Simulink and Carsim combined environment. The proposed fusion path generation algorithm can overcome the shortcomings of the traditional single method and better adapt to the dynamic environment. The feasibility of the obstacle avoidance algorithm is verified in the three-lane simulation scenario to meet safety and comfort requirements.

Źródło:

Bulletin of the Polish Academy of Sciences. Technical Sciences; 2023, 71, 2; art. no. e144624
0239-7528

Pojawia się w:

Bulletin of the Polish Academy of Sciences. Technical Sciences

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 54.

Tytuł:

A New Optimization Algorithm for Dilation and Erosion

Autorzy:

Yin, K.

Powiązania:

https://bibliotekanauki.pl/articles/108794.pdf

Data publikacji:

2011

Wydawca:

Społeczna Akademia Nauk w Łodzi

Tematy:

dilation
erosion
optimization
iteration algorithm
time complexity analysis

Opis:

Effectively optimizing dilation and erosion is an extensively studied but not completely resolved problem. In this paper, a new optimization algorithm is proposed to improve the efficiency of dilation and erosion. Four notions are given to define the edges for any simply connected structuring element (SE). An assistant algorithm is proposed to detect these edges. Based on these notions, three iteration equations can be derived, which redefine dilation and erosion as iteration calculation. Time complexity of the new algorithm is reduced to O(n³). In addition, the new algorithm is suitable for online applications without the decomposition of SE. Simulation shows that with the same parameters, the performance of the new algorithm is better than that of Yang's algorithm.

Źródło:

Journal of Applied Computer Science Methods; 2011, 3 No. 1; 5-16
1689-9636

Pojawia się w:

Journal of Applied Computer Science Methods

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 55.

Tytuł:

Algorytm selekcji wykorzystujący teorię hipergrafów
A selection algorithm based on the hypergraph theory

Autorzy:

Stefanowicz, Ł.
Wiśniewski, R.
Adamski, M.

Powiązania:

https://bibliotekanauki.pl/articles/152957.pdf

Data publikacji:

2014

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

selekcja
podsieci automatowe
implikanty proste
hipergraf
hipergraf transwersal dokładnych
transwersala
transwersala dokładna
selection
State Machine Components
SMCs
prime implicants
hypergraph
transversal
exact transversal

Opis:

Artykuł porusza kwestię selekcji określonych elementów zbioru z wykorzystaniem teorii hipergrafów. Przedstawiona została idea wspólnego algorytmu selekcji, w przypadku takich problemów, jak selekcja podsieci automatowych w dekompozycji sieci Petriego, a także selekcja implikantów prostych w procesie miminalizacji funkcji logicznych. Jako bazowy algorytm, wykorzystano metodę transwersal dokładnych, jednocześnie usprawniając ją o alternatywną scieżkę w przypadku, kiedy dany hipergraf selekcji nie należy do klasy hipergrafu transwersal dokładnych. Jak pokazują badania, metoda może być dobrą alternatywą obok wykorzystywanych metod tradycyjnych.
The paper deals with the selection problem based on the hypergraph theory. There is presented an idea of a common selection algorithm for selection of State Machine Components and Prime Implicants. The exact transversal method was used as a baseline algorithm. It was improved by supporting it with an optional path when a given selection hypergraph did not belong to the xt-class (class of the exact transversal hypergraph). In this case, the exact transversal was searched. When it was unsuccessful, the regular transversal was searched. The studies prove that the method allows obtaining the exact solution when the selection hypergraph does not belong to the xt-class, but has an exact transversal. The presented results show that a hypergraph which does not belong to the xt-class may have an exact transversal enabling obtaining a solution which would be as good as the one obtained with the backtracking method. The exact solution was also obtained with the use of an ordinary transversal, which de facto indicated that the regular transversals allowed, in certain cases, obtaining the exact solution. It seems to confirm the aptly determined class of solutions of the proposed improvements. In some cases, the solution contained one extra subnet, but in one tested case, the solution turned out to be much worse than the exact one.

Źródło:

Pomiary Automatyka Kontrola; 2014, R. 60, nr 7, 7; 516-518
0032-4140

Pojawia się w:

Pomiary Automatyka Kontrola

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 56.

Tytuł:

A Computational Algorithm for Path Interval Determination in Multi-Axis Filleted End Milling

Autorzy:

Sekine, Tsutomu

Powiązania:

https://bibliotekanauki.pl/articles/102603.pdf

Data publikacji:

2020

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

toolpath generation
path interval
multi-axis CNC machining
torus intersection problem
filleted end mill
generowanie ścieżki narzędzia
interwał ścieżki
wieloosiowa obróbka CNC
problem z przecięciem torusa
zaokrąglony frez trzpieniowy

Opis:

The demands for filleted end milling with high efficiency are increasing more and more. Path interval determination is one of the computational processes in the tool path generation, and its development can offer further improvement in multi-axis filleted end milling. However, to our knowledge, the practical approach has been hardly proposed so far. Hence, this study proposes a novel algorithm to determine a suitable path interval in multi-axis filleted end milling with a tool inclination. The procedure with wide applicability and robustness was described based on the 3D geometrical consideration of filleted end mill. Then, the characteristics of procedure were discussed with the visual data obtained from the computational results.

Źródło:

Advances in Science and Technology. Research Journal; 2020, 14, 2; 198-205
2299-8624

Pojawia się w:

Advances in Science and Technology. Research Journal

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 57.

Tytuł:

On asymptotic behaviour of a binary genetic algorithm

Autorzy:

Kosiński, Witold
Kotowski, Stefan
Socała, Jolanta

Powiązania:

https://bibliotekanauki.pl/articles/764267.pdf

Data publikacji:

2006

Wydawca:

Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej

Źródło:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2006, 4, 1
1732-1360
2083-3628

Pojawia się w:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 58.

Tytuł:

Learning decision rules using a distributed evolutionary algorithm

Autorzy:

Kwedlo, W.
Krętowski, M.

Powiązania:

https://bibliotekanauki.pl/articles/1986918.pdf

Data publikacji:

2002

Wydawca:

Politechnika Gdańska

Tematy:

decision rule learning
distributed evolutionary algorithms

Opis:

A new parallel method for learning decision rules from databases by using an evolutionary algorithm is proposed. We describe an implementation of EDRL-MD system in the cluster of multiprocessor machines connected by Fast Ethernet. Our approach consists in a distribution of the learning set into processors of the cluster. The evolutionary algorithm uses a master-slave model to compute the fitness function in parallel. The remiander of evolutionary algorithm is executed in the master node. The experimental results show, that for large datasets our approach is able to obtain a significant speed-up in comparison to a single processor version.

Źródło:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2002, 6, 3; 483-492
1428-6394

Pojawia się w:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 59.

Tytuł:

A Genetic Algorithm to Minimize the Total Tardiness for M-Machine Permutation Flowshop Problems

Autorzy:

Chung, Chia-Shin
Flynn, James
Rom, Walter
Staliński, Piotr

Powiązania:

https://bibliotekanauki.pl/articles/475000.pdf

Data publikacji:

2012

Wydawca:

Fundacja Upowszechniająca Wiedzę i Naukę Cognitione

Tematy:

genetic algorithm
scheduling
permutation flowshop
tardiness

Opis:

The m-machine, n-job, permutation flowshop problem with the total tardiness objective is a common scheduling problem, known to be NP-hard. Branch and bound, the usual approach to finding an optimal solution, experiences difficulty when n exceeds 20. Here, we develop a genetic algorithm, GA, which can handle problems with larger n. We also undertake a numerical study comparing GA with an optimal branch and bound algorithm, and various heuristic algorithms including the well known NEH algorithm and a local search heuristic LH. Extensive computational experiments indicate that LH is an effective heuristic and GA can produce noticeable improvements over LH.

Źródło:

Journal of Entrepreneurship, Management and Innovation; 2012, 8, 2; 26-43
2299-7075
2299-7326

Pojawia się w:

Journal of Entrepreneurship, Management and Innovation

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 60.

Tytuł:

Hardware implementation of a Takagi-Sugeno neuro-fuzzy system optimized by a population algorithm

Autorzy:

Dziwiński, Piotr
Przybył, Andrzej
Trippner, Paweł
Paszkowski, Józef
Hayashi, Yoichi

Powiązania:

https://bibliotekanauki.pl/articles/2031120.pdf

Data publikacji:

2021

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

hardware implementation of fuzzy systems
FPGA
population algorithm

Opis:

Over the last several decades, neuro-fuzzy systems (NFS) have been widely analyzed and described in the literature because of their many advantages. They can model the uncertainty characteristic of human reasoning and the possibility of a universal approximation. These properties allow, for example, for the implementation of nonlinear control and modeling systems of better quality than would be possible with the use of classical methods. However, according to the authors, the number of NFS applications deployed so far is not large enough. This is because the implementation of NFS on typical digital platforms, such as, for example, microcontrollers, has not led to sufficiently high performance. On the other hand, the world literature describes many cases of NFS hardware implementation in programmable gate arrays (FPGAs) offering sufficiently high performance. Unfortunately, the complexity and cost of such systems were so high that the solutions were not very successful. This paper proposes a method of the hardware implementation of MRBF-TS systems. Such systems are created by modifying a subclass of Takagi-Sugeno (TS) fuzzy-neural structures, i.e. the NFS group functionally equivalent to networks with radial basis functions (RBF). The structure of the MRBF-TS is designed to be well suited to the implementation on an FPGA. Thanks to this, it is possible to obtain both very high computing efficiency and high accuracy with relatively low consumption of hardware resources. This paper describes both, the method of implementing MRBFTS type structures on the FPGA and the method of designing such structures based on the population algorithm. The described solution allows for the implementation of control or modeling systems, the implementation of which was impossible so far due to technical or economic reasons.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2021, 11, 3; 243-266
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 61.

Tytuł:

Measuring and Maintaining Consistency: a Hybrid Ftf Algorithm

Autorzy:

Bunch, J. R.
Le Borne, R. C.
Proudler, I. K.

Powiązania:

https://bibliotekanauki.pl/articles/908062.pdf

Data publikacji:

2001

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

algorytmy
matematyka
FTF
numerical stability
consistency

Opis:

Due to the versatility as well as its ease of implementation, the Fast Transversal Filters algorithm is attractive for many adaptive filtering applications. However, it is not widely used because of its undesirable tendency to diverge when operating in finite precision arithmetic. To compensate, modifications to the algorithm have been introduced that are either occasional (performed when a predefined condition(s) is violated) or structured as part of the normal update iteration. However, in neither case is any confidence explicitly given that the computed parameters are in fact close to the desired ones. Here, we introduce a time invariant parameter that provides the user with more flexibility in establishing confidence in the consistency of the updated filter parameters. Additionally, we provide evidence through the introduction of a hybrid FTF algorithm that when sufficient time is given prior to catastrophic divergence, the update parameters of the FTF algorithm can be adjusted so that consistency can be acquired and maintained.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2001, 11, 5; 1203-1216
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 62.

Tytuł:

A robust algorithm to solve the signal setting problem considering different traffic assignment approaches

Autorzy:

Adacher, L.
Gemma, A.

Powiązania:

https://bibliotekanauki.pl/articles/330229.pdf

Data publikacji:

2017

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

genetic algorithm
surrogate method
traffic signal synchronization
traffic assignment
simulation model
algorytm genetyczny
metoda zastępcza
synchronizacja sygnału ruchu
model symulacji

Opis:

In this paper we extend a stochastic discrete optimization algorithm so as to tackle the signal setting problem. Signalized junctions represent critical points of an urban transportation network, and the efficiency of their traffic signal setting influences the overall network performance. Since road congestion usually takes place at or close to junction areas, an improvement in signal settings contributes to improving travel times, drivers’ comfort, fuel consumption efficiency, pollution and safety. In a traffic network, the signal control strategy affects the travel time on the roads and influences drivers’ route choice behavior. The paper presents an algorithm for signal setting optimization of signalized junctions in a congested road network. The objective function used in this work is a weighted sum of delays caused by the signalized intersections. We propose an iterative procedure to solve the problem by alternately updating signal settings based on fixed flows and traffic assignment based on fixed signal settings. To show the robustness of our method, we consider two different assignment methods: one based on user equilibrium assignment, well established in the literature as well as in practice, and the other based on a platoon simulation model with vehicular flow propagation and spill-back. Our optimization algorithm is also compared with others well known in the literature for this problem. The surrogate method (SM), particle swarm optimization (PSO) and the genetic algorithm (GA) are compared for a combined problem of global optimization of signal settings and traffic assignment (GOSSTA). Numerical experiments on a real test network are reported.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2017, 27, 4; 815-826
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 63.

Tytuł:

Efficiency of a voluntary speed reduction algorithm for a ship’s great circle sailing

Autorzy:

Wang, H.
Mao, W.
Eriksson, L.

Powiązania:

https://bibliotekanauki.pl/articles/117253.pdf

Data publikacji:

2020

Wydawca:

Uniwersytet Morski w Gdyni. Wydział Nawigacyjny

Tematy:

great circle sailing
algorithm, ship’s sailing route
route planning
Dynamic Programming (DP)
great circle route
great circle (orthodrome)
Estimated Time of Arrival (ETA)

Opis:

The great-circle is the shortest distance between two points on the surface of the earth. When planning a ship’s sailing route (waypoints and forward speeds) for a specific voyage, the great circle route is commonly considered as a reference route, especially for ocean-crossing seaborne transport. During the planning process, the upcoming sea weather condition is one of the most important factors affecting the ship’s route optimization/planning results. To avoid encountering harsh conditions, conventional routing optimization algorithms, such as Isochrone method and Dynamic Programming method, have been developed/implemented to schedule a ship’s optimal routes by selecting waypoints around the great circle reference route based on the ship’s operational performances at sea. Due to large uncertainties in sea weather forecast that used as inputs of these optimization algorithms, the optimized routes may have worse performances than the traditional great circle sailing. In addition, some shipping companies are still sailing in or making charting contracts based on the great circle routes. Therefore, in this study, a new optimization algorithm is proposed to consider the voluntary speed reduction with optimal speed configuration along the great circle course. The efficiency of this method is investigated by comparing these two methods for optimal route planning with respect to ETA and minimum fuel consumption. A container ship sailing in the North Atlantic with full-scale performance measurements are employed as the case study vessels for the comparison.

Źródło:

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2020, 14, 2; 301-308
2083-6473
2083-6481

Pojawia się w:

TransNav : International Journal on Marine Navigation and Safety of Sea Transportation

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 64.

Tytuł:

Strong convergence theorem of a hybrid projection algorithm for a family of quasi-φ-asymptotically nonexpansive mappings

Autorzy:

Tang, J. F.
Chang, S. S.
Liu, M.
Liu, J. A.

Powiązania:

https://bibliotekanauki.pl/articles/255543.pdf

Data publikacji:

2010

Wydawca:

Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH

Tematy:

quasi-phi-asymptotically nonexpansive mapping
asymptotically regular mapping
hybrid projection iterative algorithm
strong convergence theorem

Opis:

The main purpose of this paper is by using a new hybrid projection iterative algorithm to prove some strong convergence theorems for a family of quasi-φ-asymptotically nonexpansive mappings. The results presented in the paper improve and extend the corresponding results announced by some authors.

Źródło:

Opuscula Mathematica; 2010, 30, 3; 341-348
1232-9274
2300-6919

Pojawia się w:

Opuscula Mathematica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 65.

Tytuł:

Komputerowy algorytm identyfikacji szumów RTS
A computing algorithm of multi-level RTS noise identification

Autorzy:

Cichosz, J.
Konczakowska, A.
Szatkowski, A.

Powiązania:

https://bibliotekanauki.pl/articles/268745.pdf

Data publikacji:

2006

Wydawca:

Politechnika Gdańska. Wydział Elektrotechniki i Automatyki

Opis:

W referacie przedstawiono algorytm identyfikacji wielopoziomowych szumów RTS {Random Telegraph Signal) w sygnałach szumowych małej częstotliwości oparty na aproksymacji odcinkowo-stałej. Algorytm umożliwia wydzielanie składowej RTS z sygnału szumowego przyrządu półprzewodnikowego. W wyniku zastosowania algorytmu można wyznaczyć wartości poziomów impulsów RTS i ich czasy trwania. Dokładność wydzielenia składowej RTS przeanalizowano badając zgodność z rozkładem Gaussa lej części sygnału szumowego, którą otrzymano po odjęciu składowej RTS zidentyfikowanej z wykorzystaniem zaproponowanej procedury.
A computing algorithm of identification of multi-level RTS noise has been proposed. The procedure makes it possible to extract the RTS component from noise signal which has been recorded. The proposed computing algorithm is the well-processing procedure in the case, if an RTS with noise being analysed decomposes into the sum of the RTS component and the remainder component having the mean value equal to zero, where the arithmetic mean value is calculated on the time intervals being the domains of the successive RTS pulses, and next, if a respectively defined separation condition is satisfied by the successive RTS pulses. With the use of the computing procedure one can find the levels and duration times of the sequence of the successive RTS pulses. One can estimate the accuracy of the extraction of an RTS component of an RTS with noise by analysing the statistical properties of the remainder component, which is expected to be a gaussian noise having zero mean value. Also NSP analyses of the extracted Random Telegraph Signals and of the remainder noise components have been taken into account. The procedure has been used and discussed in examination of the low-frequency noise of the semiconductor devices.

Źródło:

Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej; 2006, 22; 9-18
1425-5766
2353-1290

Pojawia się w:

Zeszyty Naukowe Wydziału Elektrotechniki i Automatyki Politechniki Gdańskiej

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 66.

Tytuł:

A control algorithm applied to polarization states of light in the nonlinear optical resonator

Autorzy:

Wierzbicki, M.

Powiązania:

https://bibliotekanauki.pl/articles/206554.pdf

Data publikacji:

2002

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

dwustabilność optyczna
układ nieliniowy
inverse modelling
nonlinear systems
optical bistability

Opis:

In this paper a control algorithm is presented for a nonlinear system defined by a nonlinear mapping F : R^n -> R^n of input states to output states of the system, for the problem of motion in the R^n space of output states along the given trajectory. The application of this algorithm in nonlinear optics is presented, for the control of light polarization transmitted through the Fabry-Perot resonator filled with a material with nonlinear optical properties. The calculated trajectory in the space of polarization states of output light leads to the phenomenon of optical bistability, i.e. sudden changes of output polarization induced by small variations of the input parameters, and the dependence of the current state of light polarization on the history of the system.

Źródło:

Control and Cybernetics; 2002, 31, 1; 129-139
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 67.

Tytuł:

A Key-Finding Algorithm Based on Music Signature

Autorzy:

Kania, Dariusz
Kania, Paulina

Powiązania:

https://bibliotekanauki.pl/articles/177312.pdf

Data publikacji:

2019

Wydawca:

Polska Akademia Nauk. Czasopisma i Monografie PAN

Tematy:

music information retrieval
computational music cognition
music data mining
music visualisation

Opis:

The paper presents the key-finding algorithm based on the music signature concept. The proposed music signature is a set of 2-D vectors which can be treated as a compressed form of representation of a musical content in the 2-D space. Each vector represents different pitch class. Its direction is determined by the position of the corresponding major key in the circle of fifths. The length of each vector reflects the multiplicity (i.e. number of occurrences) of the pitch class in a musical piece or its fragment. The paper presents the theoretical background, examples explaining the essence of the idea and the results of the conducted tests which confirm the effectiveness of the proposed algorithm for finding the key based on the analysis of the music signature. The developed method was compared with the key-finding algorithms using Krumhansl-Kessler, Temperley and Albrecht-Shanahan profiles. The experiments were performer on the set of Bach preludes, Bach fugues and Chopin preludes.

Źródło:

Archives of Acoustics; 2019, 44, 3; 447-457
0137-5075

Pojawia się w:

Archives of Acoustics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 68.

Tytuł:

Nowy algorytm estymacji pozycji źródła emisji elektromagnetycznej
A new algorithm for determining of radar position

Autorzy:

Kawalec, A.
Wajszczyk, B.

Powiązania:

https://bibliotekanauki.pl/articles/210668.pdf

Data publikacji:

2006

Wydawca:

Wojskowa Akademia Techniczna im. Jarosława Dąbrowskiego

Tematy:

rozpoznanie radioelektroniczne
źródła emisji
lokalizacja źródła emisji
radar recognition
algorithm for emitter position estimation

Opis:

Lokalizacja, czyli określenie miejsca położenia źródła emisji, jest istotnym, a często najważniejszym, elementem łańcucha czynności (zadań) systemu rozpoznania radioelektronicznego, takich jak: wykrywanie (przechwyt) emisji sygnałów elektromagnetycznych, namierzanie, czyli określanie kierunku na źródło emisji, analiza sygnałów w celu klasyfikacji różnych typów (ocena zagrożenia) i identyfikacji egzemplarzy źródeł emisji tego samego typu. W złożonych sytuacjach pomiarowych estymacja miejsca położenia źródła emisji, wykorzystująca dotychczasowe klasyczne metody rozwiązywania równań liniowych, oparte na metodzie najmniejszej sumy kwadratów, często prowadzi do powstania bardzo dużych błędów w ocenie pozycji źródła emisji. W artykule omówiono nowy beziteracyjny algorytm lokalizacji źródeł emisji, będący szczególną implementacją metody najmniejszej sumy kwadratów. Algorytm ten umożliwia estymację pozycji źródeł emisji w przestrzeni. W pracy przedstawiono wyniki przeprowadzonych badań dla nowego algorytmu oraz porównano uzyskane rezultaty z rozwiązaniami obecnie wykorzystywanymi w urządzeniach rozpoznania radioelektronicznego. W przypadkach złego uwarunkowania zagadnienia, regularyzacja Tichonova umożliwia osiągnięcie poprawnego wyniku estymacji oraz zapewnia stabilność numeryczną algorytmu. Dla nowego algorytmu stosowanie regularyzacji Tichonowa nie jest wymagane. Poprawia to jego efektywność.
A problem of localising position of point emitter in Cartesian co-ordinates from passive radar bearings can be formulated as a linear least squares problem. A non-iterative algorithm of triangulation method, being an implementation of linear least squares method, is presented. The algorithm enables us fast and reliable spatial localisation of electromagnetic emitter. The characteristic features of the new algorithm follow from the results of numerical experiments. The results of its testing on simulated data are given. The new algorithm enables us reliable determination of all three co-ordinates of emitter position, especially when the signal receiving points are in array of angle forwards or backwards. The errors in estimated emitter position are for most cases of bearings much smaller then those produced by the matrix estimation algorithm frequently commented and referred to in literature.

Źródło:

Biuletyn Wojskowej Akademii Technicznej; 2006, 55, 1; 5-23
1234-5865

Pojawia się w:

Biuletyn Wojskowej Akademii Technicznej

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 69.

Tytuł:

A genetic algorithm-based approach for flexible job shop rescheduling problem with machine failure interference

Autorzy:

Liang, Zhongyuan
Zhong, Peisi
Zhang, Chao
Yang, Wenlei
Xiong, Wei
Yang, Shihao
Meng, Jing

Powiązania:

https://bibliotekanauki.pl/articles/27320976.pdf

Data publikacji:

2023

Wydawca:

Polska Akademia Nauk. Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne PAN

Tematy:

genetic algorithm
rescheduling
machine failure
flexible job shop scheduling

Opis:

Rescheduling is the guarantee to maintain the reliable operation of production system process. In production system, the original scheduling scheme cannot be carried out when machine breaks down. It is necessary to transfer the production tasks in the failure cycle and replan the production path to ensure that the production tasks are completed on time and maintain the stability of production system. To address this issue, in this paper, we studied the event-driven rescheduling policy in dynamic environment, and established the usage rules of right-shift rescheduling and complete rescheduling based on the type of interference events. And then, we proposed the rescheduling decision method based on genetic algorithm for solving flexible job shop scheduling problem with machine fault interference. In addition, we extended the "mk" series of instances by introducing the machine fault interference information. The solution data show that the complete rescheduling method can respond effectively to the rescheduling of flexible job shop scheduling problem with machine failure interference.

Źródło:

Eksploatacja i Niezawodność; 2023, 25, 4; art. no. 171784
1507-2711

Pojawia się w:

Eksploatacja i Niezawodność

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 70.

Tytuł:

A redundance aware algorithm for the ring perception problem

Autorzy:

Mancini, Giorgio

Powiązania:

https://bibliotekanauki.pl/articles/1953492.pdf

Data publikacji:

1997

Wydawca:

Politechnika Gdańska

Opis:

Following the guidelines proposed by R. Balducci and R. Pearlman [1] for an efficient exact solution of the Ring Perception Problem, a new approach based on 'pre-filtering' technique is introduced to perceive rings in structures represented by 2-connected graphs. The resulting algorithm has proved to reduce both resources allocation and redundant information processing when dealing with chemical cases. Actual computing times have constantly shown a conspicuous reduction with respect to methods using hash-tables 12.3] to treat redundant information. Furthermore no user intervention to 'tune' effectiveness is required (e.g. hash-table dimensioning).

Źródło:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 1997, 1, 1; 89-95
1428-6394

Pojawia się w:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 71.

Tytuł:

Using a vision cognitive algorithm to schedule virtual machines

Autorzy:

Zhao, J.
Mhedheb, Y.
Tao, J.
Jrad, F.
Liu, Q.
Streit, A.

Powiązania:

https://bibliotekanauki.pl/articles/330838.pdf

Data publikacji:

2014

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

cloud computing
vision cognitive algorithm
VM scheduling
simulation
chmura obliczeniowa
algorytm poznawczy
szeregowanie
symulacja

Opis:

Scheduling virtual machines is a major research topic for cloud computing, because it directly influences the performance, the operation cost and the quality of services. A large cloud center is normally equipped with several hundred thousand physical machines. The mission of the scheduler is to select the best one to host a virtual machine. This is an NP-hard global optimization problem with grand challenges for researchers. This work studies the Virtual Machine (VM) scheduling problem on the cloud. Our primary concern with VM scheduling is the energy consumption, because the largest part of a cloud center operation cost goes to the kilowatts used. We designed a scheduling algorithm that allocates an incoming virtual machine instance on the host machine, which results in the lowest energy consumption of the entire system. More specifically, we developed a new algorithm, called vision cognition, to solve the global optimization problem. This algorithm is inspired by the observation of how human eyes see directly the smallest/largest item without comparing them pairwisely. We theoretically proved that the algorithm works correctly and converges fast. Practically, we validated the novel algorithm, together with the scheduling concept, using a simulation approach. The adopted cloud simulator models different cloud infrastructures with various properties and detailed runtime information that can usually not be acquired from real clouds. The experimental results demonstrate the benefit of our approach in terms of reducing the cloud center energy consumption.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2014, 24, 3; 535-550
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 72.

Tytuł:

A new algorithm for calculating the most reliable pair of disjoint paths in a network

Autorzy:

Gomes, T.
Craveirinha, J.
Violante, A.

Powiązania:

https://bibliotekanauki.pl/articles/308916.pdf

Data publikacji:

2006

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy

Tematy:

reliability
OR in telecommunications
routing

Opis:

In various types telecommunication networks, namely mobile ad hoc networks, WDM networks and MPLS networks, there is the necessity of calculating disjoint paths for given node to node connections in order to increase the reliability of the services supported by these networks. This leads to the problem of calculating a pair of disjoint paths (or a set of disjoint paths) which optimises some measure of performance in those networks. In this paper we present an algorithm, designated as OptDP, for obtaining the most reliable pair of disjoint paths based on the loopless version of MPS, a very efficient k-shortest path algorithm, and on Dijkstra algorithm. Since to the best of our knowledge there is no other proposal of an algorithm capable of solving exactly the same problem we perform a comparison with the application to this problem of the DPSP algorithm which calculates a set of disjoint paths with high reliability. Also a comparison with a simplified version (designated as NopDP) of the proposed algorithm, which stops after a maximal number F of candidate pairs of paths have been found, is presented. The comparison also includes the percentage of cases in which both algorithms were not capable of finding the optimal pair.

Źródło:

Journal of Telecommunications and Information Technology; 2006, 4; 31-38
1509-4553
1899-8852

Pojawia się w:

Journal of Telecommunications and Information Technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 73.

Tytuł:

On-line signature partitioning using a population based algorithm

Autorzy:

Zalasiński, Marcin
Łapa, Krystian
Cpałka, Krzysztof
Przybyszewski, Krzysztof
Yen, Gary G.

Powiązania:

https://bibliotekanauki.pl/articles/91729.pdf

Data publikacji:

2020

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

on-line signature
biometrics
signature partitioning
population-based algorithm
podpis on-line
biometria
partycjonowanie sygnatur
algorytm populacyjny

Opis:

The on-line signature is a biometric attribute which can be used for identity verification. It is a very useful characteristic because it is commonly accepted in societies across the world. However, the verification process using this particular biometric feature is a rather difficult one. Researchers working on identity verification involving the on-line signature might face various problems, including the different discriminative power of signature descriptors, the problem of a large number of descriptors, the problem of descriptor generation, etc. However, population-based algorithms (PBAs) can prove very useful when resolving these problems. Hence, we propose a new method for on-line signature partitioning using a PBA in order to improve the verification process effectiveness. Our method uses the Differential Evolution algorithm with a properly defined evaluation function for creating the most characteristic partitions of the dynamic signature. We present simulation results of the proposed method for the BioSecure DS2 database distributed by the BioSecure Association.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 1; 5-13
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 74.

Tytuł:

On the asymptotic behavior of a simple genetic algorithm

Autorzy:

Socała, Jolanta
Kosiński, Witold
Kotowski, Stefan

Powiązania:

https://bibliotekanauki.pl/articles/747762.pdf

Data publikacji:

2005

Wydawca:

Polskie Towarzystwo Matematyczne

Tematy:

Genetics

Źródło:

Mathematica Applicanda; 2005, 33, 47/06
1730-2668
2299-4009

Pojawia się w:

Mathematica Applicanda

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 75.

Tytuł:

A rationalized algorithm for complex-valued inner product calculation
Zracjonalizowany algorytm wyznaczania zespolonego iloczynu skalarnego

Autorzy:

Cariow, A.
Cariowa, G.

Powiązania:

https://bibliotekanauki.pl/articles/156555.pdf

Data publikacji:

2012

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Tematy:

zespolony iloczyn skalarny
redukcja złożoności obliczeniowej
complex-valued inner product
arithmetic complexity reduction

Opis:

This paper presents a rationalized algorithm for calculating a complex-valued inner product. The main idea of algorithm synthesis uses the well-known opportunity to calculate the product of two complex numbers with three multiplications and five additions of real numbers. Thus, the proposed algorithmic solution reduces the number of real multiplications and additions compared to the schoolbook implementation, and takes advantage of parallelization of calculation offered by field-programmable gate arrays (FPGAs).
W artykule został przedstawiony równoległy algorytm wyznaczania iloczynu skalarnego dwóch wektorów, których elementami są liczbami zespolonymi. Proponowany algorytm wyróżnia się w stosunku do całkowicie równoległej implementacji metody naiwnej zredukowaną złożonością multiplikatywną. Jeśli metoda naiwna wymaga wykonania 4N mnożeń (układów mnożących podczas implementacji sprzętowej) oraz 2(2N-1) dodawań (sumatorów) liczb rzeczywistych to proponowany algorytm wymaga tylko 3N mnożeń oraz 6N-1 dodawań. W pracy została przedstawiona zracjonalizowana wektorowo-macierzowa procedura obliczeniowa wyznaczania takich iloczynów a także zdefiniowane konstrukcje macierzowe, wchodzące w skład owej procedury. Przy implementacji sprzętowej proponowany algorytm posiada niewątpliwe walory w stosunku do implementacji naiwnego sposobu zrównoleglenia obliczeń wymagającego więcej bloków mnożących. A ponieważ blok mnożący pochłania znacznie więcej zasobów sprzętowych platformy implementacyjnej niż sumator, to redukcja liczby tych bloków przy projektowaniu jednostek obliczeniowych jest sprawą niezwykle aktualną. W przypadku implementacji jednostki do obliczania iloczynu skalarnego w strukturze FPGA proponowane rozwiązanie pozwala zaoszczędzić pewną część umieszczonej w układzie puli bloków mnożących lub też elementów logicznych.

Źródło:

Pomiary Automatyka Kontrola; 2012, R. 58, nr 7, 7; 674-676
0032-4140

Pojawia się w:

Pomiary Automatyka Kontrola

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 76.

Tytuł:

Call-level Analysis of a Two-Link Multirate Loss Model based on a Convolution Algorithm

Autorzy:

Sagkriotis, S. G.
Pantelis, S. K.
Moscholios, I. D.
Vassilakis, V. G.

Powiązania:

https://bibliotekanauki.pl/articles/309118.pdf

Data publikacji:

2018

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy

Tematy:

call blocking
convolution
loss model
offoading
product form

Opis:

We consider a two-link system that accommodates Poisson arriving calls from different service-classes and propose a multirate teletraffic loss model for its analysis. Each link has two thresholds, which refer to the number of in-service calls in the link. The lowest threshold, named support threshold, defines up to which point the link can support calls offloaded from the other link. The highest threshold, named offloading threshold, defines the point where the link starts offloading calls to the other link. The adopted bandwidth sharing policy is the complete sharing policy, in which a call can be accepted in a link if there exist enough available bandwidth units. The model does not have a product form solution for the steady state probabilities. However, we propose approximate formulas, based on a convolution algorithm, for the calculation of call blocking probabilities. The accuracy of the formulas is verified through simulation and found to be quite satisfactory.

Źródło:

Journal of Telecommunications and Information Technology; 2018, 1; 3-10
1509-4553
1899-8852

Pojawia się w:

Journal of Telecommunications and Information Technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 77.

Tytuł:

Application of a PSO algorithm for identification of the parameters of Jiles-Atherton hysteresis model

Autorzy:

Knypiński, Ł.
Nowak, L.
Sujka, P.
Radziuk, K.

Powiązania:

https://bibliotekanauki.pl/articles/141610.pdf

Data publikacji:

2012

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

optymalizacja
histereza
model Jilesa-Athertona
optimization
hysteresis
Jiles-Atherton model
particle swarm optumization method

Opis:

In the paper an algorithm and computer code for the identification of the hysteresis parameters of the Jiles-Atherton model have been presented. For the identification the particle swarm optimization method (PSO) has been applied. In the optimization procedure five design variables has been assumed. The computer code has been elaborated using Delphi environment. Three types of material have been examined. The results of optimization have been compared to experimental ones. Selected results of the calculation for different material are presented and discussed.

Źródło:

Archives of Electrical Engineering; 2012, 61, 2; 139-148
1427-4221
2300-2506

Pojawia się w:

Archives of Electrical Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 78.

Tytuł:

A heuristic algorithm for equipment scheduling at an automated container terminal with multi-size containers

Autorzy:

Li, Hui

Powiązania:

https://bibliotekanauki.pl/articles/27311782.pdf

Data publikacji:

2023

Wydawca:

Polska Akademia Nauk. Czasopisma i Monografie PAN

Tematy:

automated container terminal
multi-size containers
yard cranes
energy consumption
planowanie zintegrowane
kontenery
żurawie stoczniowe
zużycie energii

Opis:

With the increasing volume of shipping containers, container multimodal transport and port scheduling have attracted much attention. The allocation and dispatching of handling equipment to minimize completion time and energy consumption have always been a focus of research. This paper considers a scheduling problem at an automated land-maritime multimodal container terminal with multi-size containers, in which operating facilities and equipment such as quay cranes, vehicles, yard cranes, and external container trucks are involved. Moreover, the diversity of container sizes and the location of handshake areas in yards are concerned. A mixed integer programming model is established to schedule all operating facilities and equipment. To solve the mathematical model is a NP-hard problem, which is difficult to be solved by conventional methods. Then we propose a heuristic algorithm which merges multiple targets into one and designs an improved genetic algorithm based on the heuristic combination strategy in which 20-ft containers are paired-up to the same yard before allocation. After that, some experiments are designed to prove the effectiveness of the model and the algorithm. The effect of configurations on efficiency and energy consumption under different conditions is discussed, and the influences of different parameters and the proportion of 20-ft containers are also compared. Furthermore, the influence of locations of handshake area with different yard quantities are compared. To conclude, there is an optimal number of equipment to be allocated. If few equipment is used, the operation time will be prolonged; if too many, the energy consumption will be increased. When the yard operation is the bottleneck, the handover location should be in the centre, otherwise other locations might be feasible. When the proportion of 20-ft containers that can be combined is large, the method proposed in this paper has advantages over traditional methods. The proposed algorithm has made a breakthrough in improving efficiency and reducing energy consumption.

Źródło:

Archives of Transport; 2023, 65, 1; 67--86
0866-9546
2300-8830

Pojawia się w:

Archives of Transport

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 79.

Tytuł:

K3M: A universal algorithm for image skeletonization and a review of thinning techniques

Autorzy:

Saeed, K.
Tabędzki, M.
Rybnik, M.
Adamski, M.

Powiązania:

https://bibliotekanauki.pl/articles/907744.pdf

Data publikacji:

2010

Wydawca:

Uniwersytet Zielonogórski. Oficyna Wydawnicza

Tematy:

szkieletyzacja
obraz cyfrowy
przetwarzanie obrazu
przetwarzanie równoległe
skeletonization
thinning
digital image processing
parallelization
iteration
thinning methodologies
sequential thinning
parallel thinning

Opis:

This paper aims at three aspects closely related to each other: first, it presents the state of the art in the area of thinning methodologies, by giving descriptions of general ideas of the most significant algorithms with a comparison between them. Secondly, it proposes a new thinning algorithm that presents interesting properties in terms of processing quality and algorithm clarity, enriched with examples. Thirdly, the work considers parallelization issues for intrinsically sequential algorithms of thinning. The main advantage of the suggested algorithm is its universality, which makes it useful and versatile for a variety of applications.

Źródło:

International Journal of Applied Mathematics and Computer Science; 2010, 20, 2; 317-335
1641-876X
2083-8492

Pojawia się w:

International Journal of Applied Mathematics and Computer Science

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 80.

Tytuł:

PaX-DBSCAN: a proposed algorithm for improved clustering
PaX-DBSCAN: propozycja algorytmu dla doskonalonego grupowania

Autorzy:

Samson, Grace L.
Lu, Joan

Powiązania:

https://bibliotekanauki.pl/articles/592926.pdf

Data publikacji:

2016

Wydawca:

Uniwersytet Ekonomiczny w Katowicach

Tematy:

Bulk-loading
Clustering
Parallel computing
Partition
Spatial database
Spatial index
X-tree
Algorytm bulk loading
Grupowanie
Indeks przestrzenny
Przestrzenne bazy danych
Przetwarzanie równoległe
Rozdzielanie
Struktura drzewiasta X-tree

Opis:

We focused on applying parallel computing technique to the bulk loading of X-tree in other to improve the performance of DBSCAN clustering algorithm. We have given a full description of how the system can be archived. We proposed a new parallel algorithm for DBSCAN and another algorithm to extend the X-tree spatial indexing structure. Spatial database systems incorporate space in database systems, they support nontraditional data types and more complex queries, therefore in order to optimise such systems for efficient information processing and retrieval, appropriate techniques must be adopted to facilitate the construction of suitable index structures.
W artykule autorzy skupiają swoją uwagę na zastosowaniu techniki przetwarzania równoległego przy wykorzystaniu struktur drzewiastych X-tree i algorytmu bulk loading. Zaproponowano nowy algorytm przetwarzania równoległego DBSCAN i drugi algorytm dla rozszerzania struktur indeksowania przestrzennego. Algorytm grupowania DBSCAN jest efektywnym algorytmem grupowania dla Systemów Przestrzennych Baz Danych, który ma możliwość wykrywania zakłóceń i nie wymaga znacznej liczby skupień wcześniej ustalonych, jednakże działanie algorytmu zmienia się, gdy rozmiar danych jest duży. Ten algorytm może nie działać optymalnie, jeśli niewłaściwe wartości są wybrane dla minpts i eps. Dlatego nowy zaproponowany algorytm powinien eliminować te ograniczenia.

Źródło:

Studia Ekonomiczne; 2016, 296; 86-121
2083-8611

Pojawia się w:

Studia Ekonomiczne

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 81.

Tytuł:

Control algorithm of a precision seeder

Autorzy:

Rutkowski, J.
Vicente, N. M. A.
Spadło, M.
Szulc, T.

Powiązania:

https://bibliotekanauki.pl/articles/335414.pdf

Data publikacji:

2013

Wydawca:

Sieć Badawcza Łukasiewicz - Przemysłowy Instytut Maszyn Rolniczych

Tematy:

differential GPS
seeder
precision agriculture

Opis:

This paper addresses the issue of the control system of a precision seeder. This seeder is to be used to dispose seeds in one field in such way that the plants originated from those seeds resemble the pixels of a digital image, thus acting as a "garden printer". The seeder is developed to be used for seeding public gardens with complex images and shapes, but the knowledge obtained on its development is to be used as well in other fields of precision agriculture. After a brief description of the components of the seeder, the control algorithm will be presented, as well as the mathematical principles behind it. At the end of this document a field test, where the logo of the Industrial Institute of Agricultural Engineering was seeded/"printed" on the snow (in order to be visible), is shown.

Źródło:

Journal of Research and Applications in Agricultural Engineering; 2013, 58, 4; 146-149
1642-686X
2719-423X

Pojawia się w:

Journal of Research and Applications in Agricultural Engineering

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 82.

Tytuł:

A cooperative positioning algorithm for DSRC enabled vehicular networks

Autorzy:

Efatmaneshnik, M.
Kealy, A.
Alam, N.
Dempster, A.

Powiązania:

https://bibliotekanauki.pl/articles/129825.pdf

Data publikacji:

2011

Wydawca:

Stowarzyszenie Geodetów Polskich

Tematy:

DSRC
Vanet
cooperative positioning
ranging
time of arrival
CRLB
Kalman filtering
robust positioning
pozycjonowanie
godzina przyjazdu
filtracja Kalmana

Opis:

Many of the safety related applications that can be facilitated by Dedicated Short Range Communications (DSRC), such as vehicle proximity warnings, automated braking (e.g. at level crossings), speed advisories, pedestrian alerts etc., rely on a robust vehicle positioning capability such as that provided by a Global Navigation Satellite System (GNSS). Vehicles in remote areas, entering tunnels, high rise areas or any high multipath/ weak signal environment will challenge the integrity of GNSS position solutions, and ultimately the safety application it underpins. To address this challenge, this paper presents an innovative application of Cooperative Positioning techniques within vehicular networks. CP refers to any method of integrating measurements from different positioning systems and sensors in order to improve the overall quality (accuracy and reliability) of the final position solution. This paper investigates the potential of the DSRC infrastructure itself to provide an intervehicular ranging signal that can be used as a measurement within the CP algorithm. In this paper, time-based techniques of ranging are introduced and bandwidth requirements are investigated and presented. The robustness of the CP algorithm to inter-vehicle connection failure as well as GNSS dropouts is also demonstrated using simulation studies. Finally, the performance of the Constrained Kalman Filter used to integrate GNSS measurements with DSRC derived range estimates within a typical VANET is described and evaluated.

Źródło:

Archiwum Fotogrametrii, Kartografii i Teledetekcji; 2011, 22; 117-129
2083-2214
2391-9477

Pojawia się w:

Archiwum Fotogrametrii, Kartografii i Teledetekcji

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 83.

Tytuł:

A new algorithm for testing the properties of nonwoven fabrics
Nowy algorytm do badania właściwości włóknin

Autorzy:

Sokołowski, A.
Więcek, T.

Powiązania:

https://bibliotekanauki.pl/articles/129541.pdf

Data publikacji:

2017

Wydawca:

Politechnika Rzeszowska im. Ignacego Łukasiewicza. Oficyna Wydawnicza

Tematy:

algorithm
nonwoven fabrics
porosity
porowatość
włóknina
algorytm

Opis:

The new algorithm to study the properties of nonwoven fabrics is presented in the paper. The algorithm consists in image processing of the image of the highlighted nonwoven fabric. From the image there are selected the bright areas, which means sparse distributions of the fibers. Because nonwoven fabrics are used, among others, as medical and filtration materials their structure has significant impact on their ownership. The software task is primarily determine the porosity of the material.
Przedstawiono nowy algorytm do badania porowatości włóknin. Algorytm zawiera przetwarzanie obrazu podświetlanej włókniny. Na obrazie są zaznaczone jasne obszary, co oznacza rozrzedzoną dystrybucję włókien. Ponieważ włókniny są używane między innymi jako materiały medyczne i filtracyjne, ich struktura ma znaczący wpływ na ich właściwości fizyczne. Zadaniem oprogramowania jest przede wszystkim określenie porowatości materiału.

Źródło:

Physics for Economy; 2017, 1, 1; 41-48
2544-7742
2544-7750

Pojawia się w:

Physics for Economy

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 84.

Tytuł:

Risk management in the allocation of vehicles to tasks in transport companies using a heuristic algorithm

Autorzy:

Izdebski, Mariusz

Powiązania:

https://bibliotekanauki.pl/articles/27311808.pdf

Data publikacji:

2023

Wydawca:

Polska Akademia Nauk. Czasopisma i Monografie PAN

Tematy:

transport companies
allocation of vehicles
organization of transport
risk management
heuristic algorithm
ant algorithm
optimization
firmy transportowe
przydział pojazdów
organizacja transportu
zarządzanie ryzykiem
algorytm heurystyczny
algorytm mrówkowy
optymalizacja

Opis:

The work deals with the issue of assigning vehicles to tasks in transport companies, taking into account the minimization of the risk of dangerous events on the route of vehicles performing the assigned transport tasks. The proposed risk management procedure based on a heuristic algorithm reduces the risk to a minimum. The ant algorithm reduces it in the event of exceeding the limit, which differs from the classic methods of risk management, which are dedicated only to risk assessment. A decision model has been developed for risk management. The decision model considers the limitations typical of the classic model of assigning vehicles to tasks, e.g. window limits and additionally contains limitations on the acceptable risk on the route of vehicles' travel. The criterion function minimizes the probability of an accident occurring along the entire assignment route. The probability of the occurrence of dangerous events on the routes of vehicles was determined based on known theoretical distributions. The random variable of the distributions was defined as the moment of the vehicle's appearance at a given route point. Theoretical probability distributions were determined based on empirical data using the STATISTICA 13 package. The decision model takes into account such constraints as the time of task completion and limiting the acceptable risk. The criterion function minimizes the probability of dangerous events occurring in the routes of vehicles. The ant algorithm has been validated on accurate input data. The proposed ant algorithm was 95% effective in assessing the risk of adverse events in assigning vehicles to tasks. The algorithm was run 100 times. The designated routes were compared with the actual hours of the accident at the bottom of the measurement points. The graphical interpretation of the results is shown in the PTV Visum software. Verification of the algorithm confirmed its effectiveness. The work presents the process of building the algorithm along with its calibration.

Źródło:

Archives of Transport; 2023, 67, 3; 139--153
0866-9546
2300-8830

Pojawia się w:

Archives of Transport

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 85.

Tytuł:

Harmonogramowanie powtarzalnych procesów budowlanych z zastosowaniem algorytmu rojowego
Scheduling repetitive construction processes using a swarm algorithm

Autorzy:

Tomczak, Michał
Jaśkowski, Piotr

Powiązania:

https://bibliotekanauki.pl/articles/1857862.pdf

Data publikacji:

2021

Wydawca:

Polski Związek Inżynierów i Techników Budownictwa

Tematy:

proces budowlany
harmonogramowanie
przedsięwzięcie budowlane
proces powtarzalny
algorytm rojowy
construction process
scheduling
construction project
repetitive process
swarm algorithm

Opis:

W artykule zaproponowano metodę optymalizacji trójkryterialnej harmonogramów powtarzalnych procesów budowlanych. Ze względu na trudności w projektowaniu realizacji tego typu przedsięwzięć z wykorzystaniem klasycznych narzędzi i metod zaproponowano wykorzystanie algorytmów rojowych do znajdowania niezdominowanych rozwiązań problemu. Zaprezentowano także przykład zastosowania algorytmu optymalizacji rojem cząstek do opracowania harmonogramu realizacji powtarzalnych procesów budowlanych i doboru brygad roboczych w celu minimalizacji czasu realizacji przedsięwzięcia i poszczególnych obiektów lub działek roboczych oraz przestojów w pracy brygad.
This paper proposes a method for tri-criteria optimization of schedules of repetitive construction processes. Due to the difficulties in designing the implementation of such projects using classical tools and methods, the use of swarm algorithms for finding non-dominated solutions to the problem was proposed. An example of the application of the particle swarm optimization algorithm to the development of a schedule for the realization of repetitive construction processes and the selection of work crews in order to minimize the execution time of the project and individual objects or work units as well as downtime in the work crews is also presented.

Źródło:

Przegląd Budowlany; 2021, 92, 7-8; 45-49
0033-2038

Pojawia się w:

Przegląd Budowlany

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 86.

Tytuł:

Profesor Tadeusz Łobos i jego algorytm A4
Professor Tadeusz Llobos and his A4 algorithm

Autorzy:

Chrzan, K. L.

Powiązania:

https://bibliotekanauki.pl/articles/1203359.pdf

Data publikacji:

2018

Wydawca:

Sieć Badawcza Łukasiewicz - Instytut Napędów i Maszyn Elektrycznych Komel

Tematy:

cyfrowa ochrona linii
algorytmy identyfikacji zwarć
algorytm Łobosa
algorytm A4
digital line protection
algorithms for distance protection
Lobos’s algorithm A4

Opis:

This document shows cirriculum vitae, scientific work and achievement of Prof. Tadeusz Łobos. The most known his achievement is algorithm A3 and especially algorithm A4. This second one was many times referred and explained in reading books. What is visible in his carrier it is a very intensive co-operation with German scientists. During 48 years scientific activity he spent over 10 years in Germany in the frame of 13 different scholarships and on the 4 years long contract in Darmstadt, Erlangen, Saarbruecken and Dresden. As alone from polish electrical engineers he became the prestigious Humboldt Research Award. Tadeusz Łobos published over 300 articles and conference papers, got 7 patents and was the supervisor of 13 doctor theses.
W pracy opisano życiorys, pracę naukową i osiągnięcia prof. Tadeusza Łobosa. Najbardziej znanym jego osiągnięciem są algorytmy Łobosa A3, a szczególnie algorytm A4 wielokrotnie cytowany i opisany w książkach. Zwraca uwagę niezwykle intensywna współpraca z partnerami niemieckimi. W ciągu swej 48 letniej pracy naukowej, przebywał w sumie ponad 10 lat na co najmniej 13 stypendiach oraz 4-letnim kontrakcie w Darmstadzie, Erlangen, Saarbruecken i Dreźnie. Jako jedyny polski elektrotechnik otrzymał prestiżową Humboldt Research Award, opublikował ponad 300 artykułów i referatów konferencyjnych, otrzymał 7 patentów i był promotorem 13 prac doktorskich.

Źródło:

Maszyny Elektryczne: zeszyty problemowe; 2018, 4, 120; 143-147
0239-3646
2084-5618

Pojawia się w:

Maszyny Elektryczne: zeszyty problemowe

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 87.

Tytuł:

Design of a novel control algorithm for a 6 D.O.F. mobile manipulator based on a robust observer

Autorzy:

Bolandi, H.
Ehyaei, A. F.
Esmaeilzadeh, A. M.

Powiązania:

https://bibliotekanauki.pl/articles/970986.pdf

Data publikacji:

2005

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

robust control
mobile manipulator
generalized-α method
robust observer

Opis:

In this paper a control algorithm based on a design technique named "Robust Damping Control" is introduced. A robust observer is further shown to overcome the problem of using velocity sensors that may degrade the system performance. The proposed controller uses only position measurements and is capable of disturbance rejection in the presence of unknown bounded disturbances without requiring the knowledge of its bound. Moreover, we propose an accurate and fast time integration method to solve the dynamic equations of the mobile manipulator system. The simulation results of a 6 D.O.F. mobile manipulator illustrate the effectiveness of the presented algorithm.

Źródło:

Control and Cybernetics; 2005, 34, 4; 1057-1074
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 88.

Tytuł:

A continuous-time distributed algorithm for solving a class of decomposable nonconvex quadratic programming

Autorzy:

Zhao, Y.
Liu, Q.

Powiązania:

https://bibliotekanauki.pl/articles/91832.pdf

Data publikacji:

2018

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

decomposable nonconvex quadratic programming
multi-agent network
consensus
Lyapunov method

Opis:

In this paper, a continuous-time distributed algorithm is presented to solve a class of decomposable quadratic programming problems. In the quadratic programming, even if the objective function is nonconvex, the algorithm can still perform well under an extra condition combining with the objective, constraint and coupling matrices. Inspired by recent advances in distributed optimization, the proposed continuous-time algorithm described by multi-agent network with consensus is designed and analyzed. In the network, each agent only accesses the local information of its own and from its neighbors, then all the agents in a connected network cooperatively find the optimal solution with consensus.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 4; 283-291
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 89.

Tytuł:

Symulacyjne badania algorytmu bombardierskiego współczesnego samolotu bojowego
Simulation of a bombing algorithm for modern combat aircraft

Autorzy:

Wróblewski, M.
Ważny, M.

Powiązania:

https://bibliotekanauki.pl/articles/210114.pdf

Data publikacji:

2007

Wydawca:

Wojskowa Akademia Techniczna im. Jarosława Dąbrowskiego

Tematy:

mechanika
system nawigacyjno-celowniczy
równania celownicze
mechanics
navigation - sight system
sight equations

Opis:

W referacie przedstawiono podstawowe problemy związane z identyfikacją i symulacją algorytmów obliczeniowych stosowanych w systemach nawigacyjno-celowniczych współczesnych samolotów bojowych na przykładzie samolotu Su-22M4. Symulacja algorytmów prowadzona jest pod kątem analitycznej oceny efektywności (skuteczności) użycia lotniczych środków bojowych. Problem rozpatrzony został w sposób modelowy, na bazie jednego z najbardziej reprezentatywnych algorytmów dla samolotu Su-22M4, tj. algorytmu celowania podczas bombardowania z lotu poziomego nieruchomego celu naziemnego. W referacie przedstawione zostały także rezultaty weryfikacji skuteczności zamodelowanego do badań symulacyjnych konkretnego algorytmu bombardierskiego.
In this paper, simulation investigations of the computational bombing algorithm for deck aiming-navigation system called PrNK -54 are presented. The identification and verification were made to simulate Su-22 aircraft mission activities. Especially, basic problems of CCIP bombing are considered. The paper provides also many examples of calculated and received solutions.

Źródło:

Biuletyn Wojskowej Akademii Technicznej; 2007, 56, 1; 303-315
1234-5865

Pojawia się w:

Biuletyn Wojskowej Akademii Technicznej

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 90.

Tytuł:

A self–stabilizing algorithm for finding weighted centroid in trees

Autorzy:

Bielak, H.
Pańczyk, M.

Powiązania:

https://bibliotekanauki.pl/articles/106176.pdf

Data publikacji:

2012

Wydawca:

Uniwersytet Marii Curie-Skłodowskiej. Wydawnictwo Uniwersytetu Marii Curie-Skłodowskiej

Tematy:

self-stabilizing algorithm
tree networks
time complexity

Opis:

In this paper we present some modification of the Blair and Manne algorithm for finding the center of a tree network in the distributed, self-stabilizing environment. Their algorithm finds n/2 -separator of a tree. Our algorithm finds weighted centroid, which is direct generalization of the former one for tree networks with positive weights on nodes. Time complexity of both algorithms is O(n2), where n is the number of nodes in the network.

Źródło:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica; 2012, 12, 2; 27-37
1732-1360
2083-3628

Pojawia się w:

Annales Universitatis Mariae Curie-Skłodowska. Sectio AI, Informatica

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 91.

Tytuł:

AH Method: a Novel Routine for Vicinity Examination of the Optimum Found with a Genetic Algorithm

Autorzy:

Piętak, Daniel Andrzej
Bilski, Piotr
Napiorkowski, Paweł Jan

Powiązania:

https://bibliotekanauki.pl/articles/2200688.pdf

Data publikacji:

2022

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

heuristics
evolutionary computations
genetic algorithms
uncertainty estimation
parameter study

Opis:

The paper presents a novel heuristic procedure (further called the AH Method) to investigate function shape in the direct vicinity of the found optimum solution. The survey is conducted using only the space sampling collected during the optimization process with an evolutionary algorithm. For this purpose the finite model of point-set is considered. The statistical analysis of the sampling quality based upon the coverage of the points in question over the entire attraction region is exploited. The tolerance boundaries of the parameters are determined for the user-specified increase of the objective function value above the found minimum. The presented test-case data prove that the proposed approach is comparable to other optimum neighborhood examination algorithms. Also, the AH Method requires noticeably shorter computational time than its counterparts. This is achieved by a repeated, second use of points from optimization without additional objective function calls, as well as significant repository size reduction during preprocessing.

Źródło:

International Journal of Electronics and Telecommunications; 2022, 68, 4; 695--708
2300-1933

Pojawia się w:

International Journal of Electronics and Telecommunications

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 92.

Tytuł:

Controllability-oriented placement of actuators for active noise-vibration control of rectangular plates using a memetic algorithm

Autorzy:

Wrona, S.
Pawełczyk, M.

Powiązania:

https://bibliotekanauki.pl/articles/176577.pdf

Data publikacji:

2013

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

active control
flexible structures
actuators placement
controllability Gramian
evolutionary algorithm
memetic algorithm

Opis:

For successful active control with a vibrating plate it is essential to appropriately place actuators. One of the most important criteria is to make the system controllable, so any control objectives can be achieved. In this paper the controllability-oriented placement of actuators is undertaken. First, a theoretical model of a fully clamped rectangular plate is obtained. Optimization criterion based on maximization of controllability of the system is developed. The memetic algorithm is used to find the optimal solution. Obtained results are compared with those obtained by the evolutionary algorithm. The configuration is also validated experimentally.

Źródło:

Archives of Acoustics; 2013, 38, 4; 529-536
0137-5075

Pojawia się w:

Archives of Acoustics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 93.

Tytuł:

A genetic algorithm and B&B algorithm for integrated production scheduling, preventiveand corrective maintenance to save energy

Autorzy:

Sadiqi, Assia
El Abbassi, Ikram
El Barkany, Abdellah
Darcherif, Moumen
El Biyaali, Ahmed

Powiązania:

https://bibliotekanauki.pl/articles/1841396.pdf

Data publikacji:

2020

Wydawca:

Polska Akademia Nauk. Czytelnia Czasopism PAN

Tematy:

scheduling
maintenance
genetic algorithm
branch
bound
MILP
modeling
optimization
CPLEX
Python

Opis:

The rapid global economic development of the world economy depends on the availability of substantial energy and resources, which is why in recent years a large share of non-renewable energy resources has attracted interest in energy control. In addition, inappropriate use of energy resources raises the serious problem of inadequate emissions of greenhouse effect gases, with major impact on the environment and climate. On the other hand, it is important to ensure efficient energy consumption in order to stimulate economic development and preserve the environment. As scheduling conflicts in the different workshops are closely associated with energy consumption. However, we find in the literature only a brief work strictly focused on two directions of research: the scheduling with PM and the scheduling with energy. Moreover, our objective is to combine both aspects and directions of in-depth research in a single machine. In this context, this article addresses the problem of integrated scheduling of production, preventive maintenance (PM) and corrective maintenance (CM) jobs in a single machine. The objective of this article is to minimize total energy consumption under the constraints of system robustness and stability. A common model for the integration of preventive maintenance (PM) in production scheduling is proposed, where the sequence of production tasks, as well as the preventive maintenance (PM) periods and the expected times for completion of the tasks are established simultaneously; this makes the theory put into practice more efficient. On the basis of the exact Branch and Bound method integrated on the CPLEX solver and the genetic algorithm (GA) solved in the Python software, the performance of the proposed integer binary mixed programming model is tested and evaluated. Indeed, after numerically experimenting with various parameters of the problem, the B&B algorithm works relatively satisfactorily and provides accurate results compared to the GA algorithm. A comparative study of the results proved that the model developed was sufficiently efficient.

Źródło:

Management and Production Engineering Review; 2020, 11, 4; 138-148
2080-8208
2082-1344

Pojawia się w:

Management and Production Engineering Review

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 94.

Tytuł:

Optimization of Circular Antenna Arrays Using a Differential Search Algorithm

Autorzy:

Recioui, A.

Powiązania:

https://bibliotekanauki.pl/articles/1402537.pdf

Data publikacji:

2015-08

Wydawca:

Polska Akademia Nauk. Instytut Fizyki PAN

Tematy:

84.40.Ba
52.40.Fd

Opis:

Circular and concentric circular antenna array patterns are synthesized to generate array factors with minimum side-lobe level and high directivity. The comprehensive learning differential search algorithm is used for synthesizing a one-and a three-ring circular and concentric circular antenna array with thirty elements. This synthesis is done by finding the optimum inter-element spacing of rings, phases and/or positions that give optimum side lobe level. The computational results show that side lobe level is reduced significantly in non-uniform case for concentric in comparison with a single ring.

Źródło:

Acta Physica Polonica A; 2015, 128, 2B; B-7-B-8
0587-4246
1898-794X

Pojawia się w:

Acta Physica Polonica A

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 95.

Tytuł:

Evolutionary algorithm with a configurable search mechanism

Autorzy:

Łapa, Krystian
Cpałka, Krzysztof
Laskowski, Łukasz
Cader, Andrzej
Zeng, Zhigang

Powiązania:

https://bibliotekanauki.pl/articles/1837536.pdf

Data publikacji:

2020

Wydawca:

Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych

Tematy:

evolutionary algorithm
population-based algorithm
optimization
operator pool
operator selection
individual selection

Opis:

In this paper, we propose a new population-based evolutionary algorithm that automatically configures the used search mechanism during its operation, which consists in choosing for each individual of the population a single evolutionary operator from the pool. The pool of operators comes from various evolutionary algorithms. With this idea, a flexible balance between exploration and exploitation of the problem domain can be achieved. The approach proposed in this paper might offer an inspirational alternative in creating evolutionary algorithms and their modifications. Moreover, different strategies for mutating those parts of individuals that encode the used search operators are also taken into account. The effectiveness of the proposed algorithm has been tested using typical benchmarks used to test evolutionary algorithms.

Źródło:

Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 3; 151-171
2083-2567
2449-6499

Pojawia się w:

Journal of Artificial Intelligence and Soft Computing Research

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 96.

Tytuł:

A generalized varying-domain optimization method for fuzzy goal programming with priorities based on a genetic algorithm

Autorzy:

Li, S. Y.
Hu, C. F.
Teng, C. J.

Powiązania:

https://bibliotekanauki.pl/articles/970454.pdf

Data publikacji:

2004

Wydawca:

Polska Akademia Nauk. Instytut Badań Systemowych PAN

Tematy:

rozmyte programowanie celowe
priorytet
algorytm genetyczny
fuzzy goal programming
priorities
SQP
genetic algorithm
GENOCOP III

Opis:

This paper proposes a generalized domain optimization method for fuzzy goal programming with different priorities. According to the three possible styles of the objective function, the domain optimization method and its generalization are correspondingly proposed. This method can generate the results consistent with the decision-maker's priority expectations, according to which the goal with higher priority may have higher level of satisfaction. However, the reformulated optimization problem may be nonconvex for the reason of the nature of the original problem and the introduction of the varying-domain optimization method. It is possible to obtain a local optimal solution for nonconvex programming by the SQP algorithm. In order to get the global solution of the new programming problem, the co-evolutionary genetic algorithm, called GENOCOP III, is used instead of the SQP method. In this way the decision-maker can get. the optimum of the optimization problem. We demonstrate the power of this proposed method based on genetic algorithm by illustrative examples.

Źródło:

Control and Cybernetics; 2004, 33, 4; 633-652
0324-8569

Pojawia się w:

Control and Cybernetics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 97.

Tytuł:

An evolutionary algorithm determining a defuzzyfication functional

Autorzy:

Kosiński, W.
Markowska-Kaczmar, U.

Powiązania:

https://bibliotekanauki.pl/articles/1943273.pdf

Data publikacji:

2007

Wydawca:

Politechnika Gdańska

Tematy:

ordered fuzzy numbers
defuzzyfication
genetic algorithm

Opis:

Order fuzzy numbers are defined that make it possible to deal with fuzzy inputs quantitatively, exactly in the same way as with real numbers, together with four algebraic operations. An approximation formula is given for a defuzzyfication functional that plays the main role when dealing with fuzzy controllers and fuzzy inference systems. A dedicated evolutionary algorithm is presented in order to determine the form of a functional when a training set is given. The form of a genotype composed of three types of chromosomes and the fitness function are given and Genetic operators are proposed.

Źródło:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk; 2007, 11, 1-2; 47-58
1428-6394

Pojawia się w:

TASK Quarterly. Scientific Bulletin of Academic Computer Centre in Gdansk

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 98.

Tytuł:

Strojenie uogólnionego algorytmu sterowania predykcyjnego w czasie ciągłym
Tuning of a generalized algorithm of continuous predictive control

Autorzy:

Kowalczuk, Z.

Powiązania:

https://bibliotekanauki.pl/articles/152955.pdf

Data publikacji:

1998

Wydawca:

Stowarzyszenie Inżynierów i Techników Mechaników Polskich

Źródło:

Pomiary Automatyka Kontrola; 1998, R. 44, nr 8, 8; 302-305
0032-4140

Pojawia się w:

Pomiary Automatyka Kontrola

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 99.

Tytuł:

Passive detection algorithm for a noisy vessel

Autorzy:

Ugrinovic, K.

Powiązania:

https://bibliotekanauki.pl/articles/332802.pdf

Data publikacji:

2001

Wydawca:

Polskie Towarzystwo Akustyczne

Opis:

In the paper it is assumed that the underwater acoustic noise, of a noisy vessel, is a sum of a zero mean Gaussian stochastic process with a finite variance due to propeller(s) cavitation and of a finite number of sine waves with extremely small amplitudes. These two processes are mutually statistically independent. The deep-sea underwater ambient acoustic noise is supposed to be a zero mean Gaussian stochastic process with a finite variance as well. In the paper are considered the probability density function of the instantaneous values of the underwater acoustic noise of the noisy vessel and of the deep-sea underwater ambient acoustic noise. The likelihood ratio and the detection algorithm of the optimal statistical detection are given. The statistical indirect evaluation of the noisy vessel passive detection is considered. The indirect evaluation measure of the detection algorithm is so-called deflection coefficient, which is the function of the difference between statistical expectations of the two possible probability density functions of the received acoustic signals.

Źródło:

Hydroacoustics; 2001, 4; 245-248
1642-1817

Pojawia się w:

Hydroacoustics

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce

Skocz do pozycji: 100.

Tytuł:

A Novel Kernel Algorithm for Finite Impulse Response Channel Identification

Autorzy:

Fateh, Rachid
Darif, Anouar
Boumezzough, Ahmed
Safi, Said
Frikel, Miloud

Powiązania:

https://bibliotekanauki.pl/articles/24200741.pdf

Data publikacji:

2023

Wydawca:

Instytut Łączności - Państwowy Instytut Badawczy

Tematy:

finite impulse response
kernel adaptive filtering
kernel recursive projection identification
nonlinear system identification

Opis:

Over the last few years, kernel adaptive filters have gained in importance as the kernel trick started to be used in classic linear adaptive filters in order to address various regression and time-series prediction issues in nonlinear environments.In this paper, we study a recursive method for identifying finite impulse response (FIR) nonlinear systems based on binary-value observation systems. We also apply the kernel trick to the recursive projection (RP) algorithm, yielding a novel recursive algorithm based on a positive definite kernel. For purposes, our approach is compared with the recursive projection (RP) algorithm in the process of identifying the parameters of two channels, with the first of them being a frequency-selective fading channel, called a broadband radio access network (BRAN B) channel, and the other being a a theoretical frequency-selective channel, known as the Macchi channel. Monte Carlo simulation results are presented to show the performance of the proposed algorithm.

Źródło:

Journal of Telecommunications and Information Technology; 2023, 2; 84--93
1509-4553
1899-8852

Pojawia się w:

Journal of Telecommunications and Information Technology

Dostawca treści:

Biblioteka Nauki

/5

Artykuł

Zmień widok

• na półce