Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "algorithm S" wg kryterium: Temat

  Lista filtrów
Wyrównaj
Wyświetlanie 1-25 z 40
Tytuł:
Robust Algorithm S to assess the precision of interlaboratory measurements
Autorzy:
Volodarsky, E. T.
Warsza, Z. L.
Kosheva, L.
Idźkowski, A.
Powiązania:
https://bibliotekanauki.pl/articles/114514.pdf
Data publikacji:
2015
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
robust statistics
algorithm S
test laboratory
comparability and acceptability of interlaboratory results
uncertainty
Opis:
The application of robust statistical methods to assess the precision (uncertainty) of the results of interlaboratory comparison tests is presented. The case, when these results may include outliers is considered. An usual rejection of such data reduces the reliability of evaluation, especially for small samples. The robust methods take into consideration all samples data including outliers. The use of the robust method Algorithm S is provided for estimating the precision of some measuring method tested in comparative studies in the group of accredited laboratories. Result obtained for simulated example is very close to the case with rejection outliers, but more reliable.
Źródło:
Measurement Automation Monitoring; 2015, 61, 4; 111-114
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Quantum Factorization of Integers 21 and 91 using Shor’s Algorithm
Autorzy:
Ardhyamath, Poornima
Naghabhushana, N. M.
Ujjinimatad, Rohitha
Powiązania:
https://bibliotekanauki.pl/articles/1070857.pdf
Data publikacji:
2019
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Euclidean Algorithm
Factorization
GCD
Quantum Fourier Transform
Shor’s Algorithm
Opis:
In this paper we focused on the factorization of integer in detail using well known Shor’s algorithm and its quantum part realization. The algorithm finds prime factors any integer more efficiently than any known classical algorithm. It is based on prior knowledge of the answer to the factorization problem. Algorithm includes finding gcd using polynomial time Euclidean algorithm, determination of unknown period from quantum computer and continued fraction expansion approach. Factorization of two integers 21 and 91 are shown in this paper with all steps. Quantum part of the factorization described mathematically.
Źródło:
World Scientific News; 2019, 123; 102-113
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Optimization model of freight transportation on the routes of international transport corridors
Autorzy:
Prokudin, Georgiy
Oliskevych, Myroslav
Сhupaylenko, Olexiy
Maidanik, Kateryna
Powiązania:
https://bibliotekanauki.pl/articles/2141062.pdf
Data publikacji:
2020
Wydawca:
Fundacja Centrum Badań Socjologicznych
Tematy:
Dijkstra’s algorithm
shortest routes
freight transportation
road network
computer system
Opis:
The article deals with the modified Dijkstra’s algorithm of searching the shortest routes between all transport nodes of the road-transport network, which allows presenting the transport problem in the classical matrix form. This makes it possible to apply each of the known methods of optimal transport plans to solve it. The object of study is the transport process of freight transportation on the transport network by routes of international transport corridors. The purpose of the work is to improve the methods of solving the problems of finding the shortest routes on the transport network, including sections of international transport corridors. The research method is the analysis and modeling of freight transportation on road networks. The modified Dijkstra’s algorithm of finding the shortest paths between all nodes of the road-transport network was work out, which allows to represent the transport problem in the classical matrix form, i.e. in the form of a table of connections. This makes it possible to apply each of the known methods of constructing optimal plans of cargo transportation in the table of connections. The software complex based on the developed algorithm was designed in the algorithmic language Delphi, which was tested on the example of a transport problem set in the form of a road network, as well as complex testing and debugging of a computer system to support decision-making on the optimization of freight traffic on Ukrainian and Western Europe transport systems.
Źródło:
Journal of Sustainable Development of Transport and Logistics; 2020, 5, 1; 66-76
2520-2979
Pojawia się w:
Journal of Sustainable Development of Transport and Logistics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the block decomposition and spectral factors of λ-matrices
Autorzy:
Bekhiti, Belkacem
Nail, Bachir
Dahimene, Abdelhakim
Hariche, Kamel
Fragulis, George F.
Powiązania:
https://bibliotekanauki.pl/articles/2049949.pdf
Data publikacji:
2020
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
block roots
solvents
spectral factors
block-Q.D. algorithm
block-Horner’s algorithm
matrix polynomials
Opis:
In this paper we have factorized matrix polynomials into a complete set of spectral factors using a new design algorithm, and with some systematic procedures a complete set of block roots (solvents) have been obtained. The newly developed procedure is just an extension of the (scalar) Horner method to its block form for use in the computation of the block roots of matrix polynomial, the block-Horner method bringing a local iterative nature, faster convergence, nested programmable scheme, needless of any prior knowledge of the matrix polynomial, with the only one inconvenience, which is the strong dependence on the initial guess. In order to avoid this trap, we proposed a combination of two computational procedures, for which the complete program starts with the right block-Q.D. algorithm. It is then followed by a refinement of the right factor by block-Horner’s algorithm. This results in the global nature of the program, which is faster in execution, has well defined initial conditions, and good convergence in much less time.
Źródło:
Control and Cybernetics; 2020, 49, 1; 41-76
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
An alternative to Gower’s inverse matrix
Autorzy:
López-Bonilla, J.
López-Vázquez, R.
Vidal-Beltrán, S.
Powiązania:
https://bibliotekanauki.pl/articles/1177483.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Adjoint matrix
Characteristic equation
Eigenvalue problem
Faddeev-Sominsky’s method
Gower’s pseudoinverse matrix
Leverrier-Takeno’s algorithm
Opis:
We show that the Faddeev-Sominsky’s process allows construct a natural inverse for any square matrix, which is an alternative to the inverse obtained by Gower.
Źródło:
World Scientific News; 2018, 102; 166-172
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Order optimization of health resorts treatment using Palmers algorithm as one of the key activities describing the business model
Autorzy:
Szromek, A. R.
Powiązania:
https://bibliotekanauki.pl/articles/323803.pdf
Data publikacji:
2018
Wydawca:
Politechnika Śląska. Wydawnictwo Politechniki Śląskiej
Tematy:
optimisation
Palmer’s algorithm
health resorts
business model
optymalizacja
algorytm Palmera
uzdrowisko
model biznesowy
Opis:
The aim of the article is to present one of the optimization methods of logistics processes, as solutions to improve operational efficiency in business models of spa enterprises. The author uses the Palmer's algorithm, using it to optimize the schedule of performing treatments in health resorts. The final result of the publication is the proposal to use the Palmer's algorithm with the author's amendment. The solution was supported by an example of using its for health resort treatments.
Źródło:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska; 2018, 119; 301-311
1641-3466
Pojawia się w:
Zeszyty Naukowe. Organizacja i Zarządzanie / Politechnika Śląska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
The 2 ½D algorithm in robot workspace analysis
Autorzy:
Kost, G.
Reclik, D.
Powiązania:
https://bibliotekanauki.pl/articles/386291.pdf
Data publikacji:
2008
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
algorytm 2 1/2 D
robotyka
algorytm Floyd'a
2 1/2 D algorithm
robotics
Floyd’s algorithm
Opis:
In this paper there is presented the method of 3D manipulator’s workspace analysis. The analysis of robot’s work-space is necessary for generation the safety movement path. There was 2 ˝ D method, which is based on algorithm of following sections defining in robot work area. Those sections are explored by flat analysis, but the results are transposed into graph form. This graph is the record of all possible movements, so to get the optimum movement there must be used Floyd’s algorithm. This, shortest trace is optimized and smoothed by using B-Spline curves.
Źródło:
Acta Mechanica et Automatica; 2008, 2, 3; 65-70
1898-4088
2300-5319
Pojawia się w:
Acta Mechanica et Automatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A general iterative solver for unbalanced inconsistent transportation problems
Autorzy:
Carp, D.
Popa, C.
Serban, C.
Powiązania:
https://bibliotekanauki.pl/articles/223848.pdf
Data publikacji:
2016
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
inconsistent linear inequalities
least squares solutions
projection-type algorithm
Kaczmarz Extended
transportation problem
simplex algorithm
Han’s algorithm
problemy transportowe
algorytm Simplex
algorytm Hana
Opis:
The transportation problem, as a particular case of a linear programme, has probably the highest relative frequency with which appears in applications. At least in its classical formulation, it involves demands and supplies. When, for practical reasons, the total demand cannot satisfy the total supply, the problem becomes unbalanced and inconsistent, and must be reformulated as e.g. finding a least squares solution of an inconsistent system of linear inequalities. A general iterative solver for this class of problems has been proposed by S. P. Han in his 1980 original paper. The drawback of Han’s algorithm consists in the fact that it uses in each iteration the computation of the Moore-Penrose pseudoinverse numerical solution of a subsystem of the initial one, which for bigger dimensions can cause serious computational troubles. In order to overcome these difficulties we propose in this paper a general projection-based minimal norm solution approximant to be used within Han-type algorithms for approximating least squares solutions of inconsistent systems of linear inequalities. Numerical experiments and comparisons on some inconsistent transport model problems are presented.
Źródło:
Archives of Transport; 2016, 37, 1; 7-13
0866-9546
2300-8830
Pojawia się w:
Archives of Transport
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Implementation and verification of course controllers in the inland navigation simulator (InSim)
Autorzy:
Zalewski, P.
Powiązania:
https://bibliotekanauki.pl/articles/360097.pdf
Data publikacji:
2013
Wydawca:
Akademia Morska w Szczecinie. Wydawnictwo AMSz
Tematy:
InSim
shiphandling simulation
PID controller
fuzzy controller
ship’s course control algorithm
Opis:
The formal verification of performance properties of a ship’s course control algorithm used in the InSim simulator of Maritime University of Szczecin is presented in the paper. Implementation of fuzzification, fuzzy rules and defuzzification techniques allowed the construction of a controller tuned in accordance to expert knowledge as an alternative to the industry PID standard. Both controllers’ structures are analysed. Their verification leads to the assessment and comparison of dynamic properties of a modelled ship’s course control. Further development of course controllers into track controllers has been discussed as well.
Źródło:
Zeszyty Naukowe Akademii Morskiej w Szczecinie; 2013, 36 (108) z. 1; 188-194
1733-8670
2392-0378
Pojawia się w:
Zeszyty Naukowe Akademii Morskiej w Szczecinie
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Faddeev-Sominsky’s algorithm
Autorzy:
Torres-Silva, H.
López-Bonilla, J.
Vidal-Beltrán, S.
Powiązania:
https://bibliotekanauki.pl/articles/1166341.pdf
Data publikacji:
2018
Wydawca:
Przedsiębiorstwo Wydawnictw Naukowych Darwin / Scientific Publishing House DARWIN
Tematy:
Adjoint matrix
Characteristic equation
Eigenvalue problem
Faddeev-Sominsky’s method
Inverse matrix
Leverrier-Takeno’s algorithm
Resolvent of a matrix
Opis:
We comment that the Faddeev-Sominsky’s process to obtain an inverse matrix is equivalent to the Cayley-Hamilton-Frobenius theorem plus the Leverrier-Takeno’s method to construct the characteristic polynomial of an arbitrary matrix. Besides, we deduce the Lanczos expression for the resolvent of the corresponding matrix.
Źródło:
World Scientific News; 2018, 106; 238-244
2392-2192
Pojawia się w:
World Scientific News
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Peculiarities of an inspection of a scene of an accident during investigations of crashes and accidents at railway transport according to the legislation of Ukraine
Autorzy:
Basysta, Irina
Powiązania:
https://bibliotekanauki.pl/articles/1861718.pdf
Data publikacji:
2014
Wydawca:
Wyższa Szkoła Bezpieczeństwa Publicznego i Indywidualnego Apeiron w Krakowie
Tematy:
investigation of criminal offences
investigator
algorithm of one’s work
version
investigation
accident
crash
railway transport
Opis:
During investigations of criminal offences of this category it is extremely important for an investigator to have proper access to the scene of an accident and to develop their own algorithm of work. According to the results of our study of the statistical data and materials of criminal proceedings (cases), we have found out that a lot of criminal cases in Ukraine were closed for various reasons for the past three years. In particular, there were registered 88 cases according to the constituent elements of offence, provided for in Art. 276 of the Criminal Code of Ukraine in 2011. There were 5 cases closed by procedure, and 67 ones taken to courts. In 2012, there were registered 53 cases according to the constituent elements of offence, provided for in Art. 276 of the Criminal Code of Ukraine. 13 of them were closed by procedure, and 71 cases were taken to court. And in 2013, the rate got worse since out of 237 registered cases according to the constituent elements of offence, there were 1429 closed by procedure and 11 ones taken to courts. Taking into consideration these data, it is timely and necessary to update scholarly attention to the key aspects of the issues, to develop the mechanism of improving current legislation and the algorithms for the proper functioning of investigators.
Źródło:
Security Dimensions; 2014, 12(12); 109-116
2353-7000
Pojawia się w:
Security Dimensions
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Maximum subarray problem optimization for specific data
Optymalizacja problemu największej podtablicy dla specyficznych danych
Autorzy:
Rojek, T.
Powiązania:
https://bibliotekanauki.pl/articles/407746.pdf
Data publikacji:
2017
Wydawca:
Politechnika Lubelska. Wydawnictwo Politechniki Lubelskiej
Tematy:
algorithm design and analysis
maximum subarray problem
Kadane’s algorithm
optimization
analiza algorytmów
projektowanie algorytmów
problem maksymalnej podtablicy
algorytm Kadane
optymalizacja
Opis:
The maximum subarray problem (MSP) is to the find maximum contiguous sum in an array. This paper describes a method of Kadanes algorithm (the state of the art) optimization for specific data (continuous sequences of zeros or negative real numbers). When the data are unfavourable, the modification of the algorithm causes a non significant performance loss (1% > decrease in performance). The modification does not improve time complexity but reduces the number of elementary operations. Various experimental data sets have been used to evaluate possible time efficiency improvement. For the most favourable data sets an increase in efficiency of 25% can be achieved.
Problem najwiekszej podtablicy to inaczej znalezienie podciągu, którego suma na największą wartość. Artykuł opisuje optymalizację algorytmu Kadane dla specyficznych danych (z powtarzającymi się ciągami zer lub liczb negatywnych). W przypadku niekorzystnych danych wejściowych zaproponowa modyfikacja nieznacznie spowalnia działanie algorytmu (mniej niż 1% szybkości działania). Ulepszenie algorytmu nie zmienia rzędu asymptotycznego tempa wzrostu, lecz zmniejsza ilość elementarnych operacji. Eksperymenty wykazały, że dla sprzyjających danych możemy zmniejszyć efektywny czas działania algorytmu o 25%.
Źródło:
Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska; 2017, 7, 4; 62-65
2083-0157
2391-6761
Pojawia się w:
Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Analysis of Graph Searching Algorithms for Route Planning in Inland Navigation
Autorzy:
Kazimierski, W.
Sawczak, A.
Wawrzyniak, N.
Powiązania:
https://bibliotekanauki.pl/articles/117106.pdf
Data publikacji:
2015
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Inland Navigation
route planning
Graph Searching Algorithms
Inland Waters
Nautical Spatial Data
Raster Data
vector data
Dijkstra’s Algorithm
Opis:
Route planning is one of the core functionalities of modern navigational systems also in inland waters. There is a possibility of at least partial automation of this process with the use of graph searching algorithms. Main problem here is to create a graph based on nautical spatial data. The paper presents research on examining dif-ferent graph searching methods for inland waters. The concept of using combined approach for vector and ras-ter data is given, followed by research results for raster data.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2015, 9, 2; 281-286
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
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
Artykuł
Tytuł:
On the Fuel Saving Operation for Coastal Merchant Ships using Weather Routing
Autorzy:
Takashima, K.
Mezaoui, B.
Shoji, R.
Powiązania:
https://bibliotekanauki.pl/articles/116404.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Weather Routing
route planning
Weather Navigation
Coastal Merchant Ship
Fuel Saving Operation
Dijkstra’s Algorithm
Simulation Study
Fuel Consumption
Opis:
It is well known that Weather Routing is one of the effective ship operation methods to reduce fuel consumption and many studies have been conducted to develop the effective calculation methods. However, most studies were performed focusing on the ocean going ships, and there were few studies made for coastal ships. The authors propose a minimum fuel route calculation method for coastal ships that use the precise forecasted environmental data and the propulsion performance data of the ship on actual seas. In the proposed method, we use the Dijkstra’s algorithm to calculate an optimum minimum fuel route suitable for coastal ships. Simulation study was carried out to evaluate the effectiveness of the proposed method using two coastal ships. As the result of study, the authors confirmed that the proposed calculation method is effective for fuel consumption reduction and is applicable for the operation of coastal merchant ships.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2009, 3, 4; 401-406
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Heading control system design for a micro-USV based on an adaptive expert S-PID algorithm
Autorzy:
Miao, R.
Dong, Z.
Wan, L.
Zeng, J.
Powiązania:
https://bibliotekanauki.pl/articles/258606.pdf
Data publikacji:
2018
Wydawca:
Politechnika Gdańska. Wydział Inżynierii Mechanicznej i Okrętownictwa
Tematy:
micro unmanned surface vessel (micro-USV)
control system design
adaptive expert S-PID algorithm
heading control
pool experiment
lake experiment
Opis:
The process of heading control system design for a kind of micro-unmanned surface vessel (micro-USV) is addressed in this paper and a novel adaptive expert S-PID algorithm is proposed. First, a motion control system for the micro-USV is designed based on STM32-ARM and the PC monitoring system is developed based on Labwindows/CVI. Second, by combining the expert control technology, S plane and PID control algorithms, an adaptive expert S-PID control algorithm is proposed for heading control of the micro-USV. Third, based on SL micro-USV developed in this paper, a large number of pool experiments and lake experiments are carried out, to verify the effectiveness and reliability of the motion control system designed and the heading control algorithm proposed. A great amount of comparative experiment results shows the superiority of the proposed adaptive expert S-PID algorithm in terms of heading control of the SL micro-USV.
Źródło:
Polish Maritime Research; 2018, 2; 6-13
1233-2585
Pojawia się w:
Polish Maritime Research
Dostawca treści:
Biblioteka Nauki
Artykuł
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
Artykuł
Tytuł:
AIS based shipping routes using the dijkstra algorithm
Autorzy:
Silveira, P.
Teixeira, A. P.
Guedes-Soares, C.
Powiązania:
https://bibliotekanauki.pl/articles/116029.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
Dijkstra’s Algorithm
AIS Data
Automatic Identification System (AIS)
AIS based shipping routes
shipping routes
Vessel Traffic Service (VTS)
port of Setubal
Ro-Ro Terminal
Opis:
This paper proposes an approach for identifying and characterizing shipping routes using information contained in Automatic Identification System messages broadcasted by ships and recorded by the coastal Vessel Traffic Service centre. The approach consists of using historical Automatic Identification System data to build a graph, where nodes are cells of a grid covering the geographical area being studied and the weights of directional edges are inversely related to ship movements between cells. Based on this graph, the Dijkstra algorithm is used to identify a potential safe route, assumed to be the most used route by ships between two locations. A second graph is created simultaneously, with the same nodes and edges, but with edge weights equal to the average speed of transitions between cells, thus allowing the determination of the average speed profile for any possible path within the graph. The proposed approach is applied to two scenarios: an approach to the port of Lisbon and the entry through the fairway to a RO-RO terminal in the port of Setubal in Portugal.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 3; 565-571
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Towards use of dijkstra algorithm for optimal navigation of an unmanned surface vehicle in a real-time marine environment with results from artificial potential field
Autorzy:
Singh, Y.
Sharma, S.
Sutton, R.
Hatton, D.
Powiązania:
https://bibliotekanauki.pl/articles/116058.pdf
Data publikacji:
2018
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
autonomous vehicles
dijkstra’s algorithm
Unmanned Surface Vehicle (USV)
port of portsmouth
Artificial Path Planning (APF)
Artificial Potential Field
real-time marine environment
optimal navigation
Opis:
The growing need of ocean surveying and exploration for scientific and industrial application has led to the requirement of routing strategies for ocean vehicles which are optimal in nature. Most of the op-timal path planning for marine vehicles had been conducted offline in a self-made environment. This paper takes into account a practical marine environment, i.e. Portsmouth Harbour, for finding an optimal path in terms of computational time between source and end points on a real time map for an USV. The current study makes use of a grid map generated from original and uses a Dijkstra algorithm to find the shortest path for a single USV. In order to benchmark the study, a path planning study using a well-known local path planning method artificial path planning (APF) has been conducted in a real time marine environment and effectiveness is measured in terms of path length and computational time.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2018, 12, 1; 125-131
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-sourced power system restoration strategy based on modified Prim’s algorithm
Autorzy:
Łukaszewski, Artur
Nogal, Łukasz
Powiązania:
https://bibliotekanauki.pl/articles/2086893.pdf
Data publikacji:
2021
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
self-healing grid
micro-grid
reconfiguration
greedy algorithms
graph theory
simulations
Prim’s algorithm
siatka samoleczenia
mikrosiatka
rekonfiguracja
algorytmy zachłanne
teoria grafów
symulacje
algorytm Prima
Opis:
Self-healing grids are one of the most developing concepts applied in electrical engineering. Each restoration strategy requires advanced algorithms responsible for the creation of local power systems. Multi-agent automation solutions dedicated for smart grids are mostly based on Prim’s algorithm. Graph theory in that field also leaves many problems unsolved. This paper is focused on a variation of Prim’s algorithm utility for a multi-sourced power system topology. The logic described in the paper is a novel concept combined with a proposal of a multi-parametrized weight calculation formula representing transmission features of energy delivered to loads present in a considered grid. The weight is expressed as the combination of three elements: real power, reactive power, and real power losses. The proposal of a novel algorithm was verified in a simulation model of a power system. The new restoration logic was compared with the proposal of the strategy presented in other recently published articles. The novel concept of restoration strategy dedicated to multi-sourced power systems was verified positively by simulations. The proposed solution proved its usefulness and applicability.
Źródło:
Bulletin of the Polish Academy of Sciences. Technical Sciences; 2021, 69, 5; e137942, 1--12
0239-7528
Pojawia się w:
Bulletin of the Polish Academy of Sciences. Technical Sciences
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
On the Anti-Mechanist Arguments Based on Gödel’s Theorem
Autorzy:
Krajewski, Stanisław
Powiązania:
https://bibliotekanauki.pl/articles/1796977.pdf
Data publikacji:
2020
Wydawca:
Polskie Towarzystwo Semiotyczne
Tematy:
Gödel’s theorem
mechanism
Lucas’s argument
Penrose’s argument
computationalism
mind
consistency
algorithm
artificial intelligence
natural number
Opis:
The alleged proof of the non-mechanical, or non-computational, character of the human mind based on Gödel’s incompleteness theorem is revisited. Its history is reviewed. The proof, also known as the Lucas argument and the Penrose argument, is refuted. It is claimed, following Gödel himself and other leading logicians, that antimechanism is not implied by Gödel’s theorems alone. The present paper sets out this refutation in its strongest form, demonstrating general theorems implying the inconsistency of Lucas’s arithmetic and the semantic inadequacy of Penrose’s arithmetic. On the other hand, the limitations to our capacity for mechanizing or programming the mind are also indicated, together with two other corollaries of Gödel’s theorems: that we cannot prove that we are consistent (Gödel’s Unknowability Thesis), and that we cannot fully describe our notion of a natural number.
Źródło:
Studia Semiotyczne; 2020, 34, 1; 9-56
0137-6608
Pojawia się w:
Studia Semiotyczne
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Basic 3D graphics processor implemented on small FPGA
Autorzy:
Panek, K.
Flak, B.
Koryciak, S.
Wiatr, K.
Powiązania:
https://bibliotekanauki.pl/articles/114415.pdf
Data publikacji:
2018
Wydawca:
Stowarzyszenie Inżynierów i Techników Mechaników Polskich
Tematy:
FPGA
Verilog
3D graphic
HDMI
Bresenham’s line
algorithm
perspective projection
Opis:
FPGAs have big computing possibilities and therefore are very popular as dedicated hardware accelerators. A few years ago, FPGAs were expensive and the cheapest ones had very limited capabilities, because of small amount of logic elements and slow internal clocks. Nowadays, cheap development boards are available at a price below 50€ with abilities to transmit even HDMI signals. This paper covers implementation of the soft processor with a 3D graphics coprocessor on the cheapest available FPGA board with HDMI connector, containing only 8k Logic Elements.
Źródło:
Measurement Automation Monitoring; 2018, 64, 1; 8-10
2450-2855
Pojawia się w:
Measurement Automation Monitoring
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Multi-objective optimisation of the electric wheelchair ride comfort and road holding based on jourdain’s principle model and genetic algorithm
Autorzy:
Belhorma, Mohamed
Bouchikhi, Aboubakar Seddik
Powiązania:
https://bibliotekanauki.pl/articles/2106225.pdf
Data publikacji:
2022
Wydawca:
Politechnika Białostocka. Oficyna Wydawnicza Politechniki Białostockiej
Tematy:
multibody systems
Jourdain’s principle
electric wheelchair
multi-objective optimisation
genetic algorithm
Opis:
The paper addresses the multi-body modelling of an electric wheelchair using Jourdain’s principle. First, a description of the adopted approach was presented. Next, the mathematical equations were developed to obtain the dynamic behaviour of the concerned system. The numerical computation was performed with MATLAB (matrix laboratory: a high performance language of technical computing) and validated by MBD (Multi-Body Dynamics) for Ansys, a professional multi-body dynamics simulation software powered by RecurDyn. Afterwards, the model was treated as an objective function included in genetic algorithm. The goal was to improve the ride quality and the road holding as well as the suspension workspace. The multi-objective optimisation aimed to reduce the Root-Mean-Square (RMS) of the seat’s vertical acceleration, the wheels load and the workspace modulus by varying the bodies’ masses, the spring-damper coefficients and the characteristics of the tires. Acceptable solutions were captured on the Pareto fronts, in contrast to the relatively considerable processing time involved in the use of a random road profile generated by the power spectral density (PSD). During the process, the compatibility and the efficiency of Jourdain’s equations were inspected.
Źródło:
Acta Mechanica et Automatica; 2022, 16, 1; 58--69
1898-4088
2300-5319
Pojawia się w:
Acta Mechanica et Automatica
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Inverse and direct optimization shape of airfoil using hybrid algorithm Big Bang-Big Crunch and Particle Swarm Optimization
Autorzy:
Masoumi, Heidar
Jalili, Farhad
Powiązania:
https://bibliotekanauki.pl/articles/281379.pdf
Data publikacji:
2019
Wydawca:
Polskie Towarzystwo Mechaniki Teoretycznej i Stosowanej
Tematy:
hybrid optimization algorithm
airfoil
inverse and direct optimization approaches
Euler’s equations
Opis:
In this paper, Big Bang-Big Crunch and Particle Swarm Optimization algorithms are combined and used for the first time to optimize airfoil geometry as a aerodynamic cross section. The optimization process is carried out both in reverse and direct directions. In the reverse approach, the object function is the difference between pressure coefficients of the optimized and target airfoils, which must be minimized. In the direct approach, three objective functions are introduced, the first of which is the drag to lift (D/L) ratio. It is minimized considering four different initial geometries, ultimately, all four geometries converge to the same final geometry. In other cases, maximizing lift the coefficient with the fixed drag coefficient constraint and minimizing the drag coefficient while the lift coefficient is fixed are defined as purposes. The results show that by changing the design parameters of the initial airfoil geometry, the proposed hybrid optimization algorithm as a powerful method satisfies the needs with proper accuracy and finally reaches the desired geometry.
Źródło:
Journal of Theoretical and Applied Mechanics; 2019, 57, 3; 697-711
1429-2955
Pojawia się w:
Journal of Theoretical and Applied Mechanics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new polynomial-time implementation of the out-of-kilter algorithm using Minty’s lemma
Autorzy:
Ghiyasvand, M.
Powiązania:
https://bibliotekanauki.pl/articles/205633.pdf
Data publikacji:
2014
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
network flows
minimum cost flow problem
out- of-kilter algorithm
Minty’s lemma
Opis:
It is less well known how to use the out-of-kilter idea to solve the min-cost flow problem because the generic version of the out-of-kilter algorithm runs in exponential time, although it is the sort of algorithm that computers can do easily. Ciupala (2005) presented a scaling out-of-kilter algorithm that runs in polynomial time using the shortest path computation in each phase. In this paper, we present a new polynomial time implementation of out-of-kilter idea. The algorithm uses a scaling method that is different from Ciupala’s scaling method. Each phase of Ciupala’s method needs a shortest path computation, while our algorithm uses Minty’s lemma to transform all the out-of-kilter arcs into in-kilter arcs. When the given network is infeasible, Ciupala’s algorithm does not work, but our algorithm presents some information that helps to repair the infeasible network.
Źródło:
Control and Cybernetics; 2014, 43, 1; 79-94
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Wyświetlanie 1-25 z 40

Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies