Wyniki wyszukiwania - BazTech

1

Tractography Methods in Preoperative Neurosurgical Planning

Koryciński Mateusz, Ciecierski Konrad A.

Journal of Telecommunications and Information Technology

|

2021

|

nr 3

78--85

EN

Knowledge of the location of nerve tracts during the surgical preoperative planning stage and during the surgery itself may help neurosurgeons limit the risk of causing neurological deficits affecting the patient’s essential abilities. Development of MRI techniques has helped profoundly with in vivo visualization of the brain’s anatomy, enabling to obtain images within minutes. Different methodologies are relied upon to identify anatomical or functional details and to determine the movement of water molecules, thus allowing to track nerve fibers. However, precise determination of their location continues to be a labor-intensive task that requires the participation of highly-trained medical experts. With the development of computational methods, machine learning and artificial intelligence, many approaches have been proposed to automate and streamline that process, consequently facilitating image-based diagnostics. This paper reviews these methods focusing on their potential use in neurosurgery for better planning and intraoperative navigation.

2

The use of the roadload application in geographical studies of flows generated by individual modes of transport

Borowska-Stefańska Marta, Kowalski Micha, Wiśniewski Szymon, Domagalski Adam

Transport Problems

|

2020

|

T. 15, z. 4, cz. 2

227--240

EN

The purpose of this article is to present the authors' own software for predicting changes in the density and directions of traffic flows and to compare overall results of research on transport accessibility with the results returned in the study of transport accessibility conducted with the software (isochronic accessibility). Developed for research purposes, the authors' application is based on Dijkstra's algorithm, which is classified as one of the greedy ones and does not always return optimum results, even though it is considered to be generally accurate. In the course of the research, it was stated that the implementation of Dijkstra's algorithm in the RoadLoad tool is suitable for studying and prognosing phenomena, under the assumption that there are detailed data on the point of departure and destination for each trip. The tool enables us to research a spatial (cumulated values of network load) as well as time-spatial (network load at virtually any time) dimension of the phenomenon. It cannot be applied, however, without the knowledge of the transport behavior characteristics of the users of the road system.

3

Zastosowanie informatyki w logistyce transportu

Brzoza A., Muszyński G.

Autobusy : technika, eksploatacja, systemy transportowe

|

2017

|

R. 18, nr 6

1335--1337, CD

PL

W artykule została omówiona logistyka transportu mająca coraz większe znaczenie w planowaniu transportu towarów. Ponieważ koszty transportu zależą od jego przewidywanego czasu dostarczenia oraz od środka transportu, stąd planowanie trasy przejazdu jest istotnym czynnikiem w logistyce transportu, która we współczesnym świecie nie może w pełni funkcjonować bez rozwiązań informatycznych. W artykule poddano analizie transport kolejowy w Szwajcarii, będący jednym z najbardziej rozwiniętych tego typu systemów transportowych w Europie. Obliczenia bazują na przykładowych danych dotyczących tras kolejowych narodowego przewoźnika w tym kraju z wyborem czasu przejazdu jako głównego kryterium wyznaczania optymalnej trasy przejazdu dla wybranych połączeń między miastami. Dla potrzeb analizy został stworzony program implementujący algorytm Dijkstry, który posłużył do wyszukiwania optymalnego połączenia między wskazanymi miastami według danego kryterium.

EN

This article discusses some computer-based logistics solutions aimed to improve the planning process in freight transport. Since transport costs are dependent on the lead time and the transport mode, route planning is a crucial factor in transport logistics, which, these days, relies heavilyon computer technology. The study is focused on the rail transport system in Switzerland, known to be the most developed in Europe. The data used in the computations refers to rail routes of the national carrier in that country. The transportation time was the main criterion to select an optimal route between origin and destination. The analysis involved developing a program that implements Dijkstra’s algorithm to find an optimal connection between places according to the selected criterion.

4

Vessels Route Planning Problem with Uncertain Data

Neumann T.

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

|

2016

|

Vol. 10, no. 3

459--464

EN

The purpose of this paper is to find a solution for route planning in a transport networks, where the costs of tracks, factor of safety and travel time are ambiguous. This approach is based on the Dempster-Shafer theory and well known Dijkstra's algorithm. In this approach important are the influencing factors of the mentioned coefficients using uncertain possibilities presented by probability intervals. Based on these intervals the quality intervals of each route can be determined. Applied decision rules can be described by the end user.

5

Propozycja metody trasowania przewodów wodociągowych

Suchorab P., Kowalski D., Kowalska B.

Instal

|

2016

|

nr 5

44--47

PL

Wybór trasy wodociągu jest jednym z podstawowych zadań stawianych przed projektantem. Od decyzji podjętych na tym etapie zależy wiele późniejszych aspektów, takich jak: przebieg procesu budowy, koszty inwestycyjne i eksploatacyjne oraz częściowo proces eksploatacji sieci. Wśród wielu etapów projektowania systemu wodociągowego, wyznaczanie trasy przewodów wodociągowych (proces trasowania) jest stosunkowo najsłabiej wspieranym przez komputerowe narzędzia wspomagania projektowania. Wynika to z faktu, iż każda sieć wodociągowa ma indywidualny charakter, w tym strukturę geometryczną, która determinowana jest przez układ terytorialno-wysokościowy danej jednostki osadniczej oraz punkty lokalizacji źródeł wody, pompowni i największego zapotrzebowania na wodę. Uniwersalny opis takich struktur może być realizowany przez elementy geometrii fraktalnej. Daje to szerokie możliwości proponowania nowych podejść w kontekście ich klasyfikowania, opisywania, odwzorowywania i projektowania. W niniejszym artykule przedstawiono propozycję metody trasowania przewodów wodociągowych, opartą o elementy teorii fraktalnej, teorii grafów, algorytm znajdowania najkrótszej ścieżki i hierarchizację punktów poboru wody. Metodę przetestowano w warunkach modelowej jednostki osadniczej.

EN

The water pipes path design is one of the basic steps during the designing process. Basing on decisions made during this stage depends many further aspects, such as: building process, investment and exploitation costs and partially the exploitation process. Among many steps of water supply system design, the water pipes path design is relatively weakly supported by computer aided designing tools. That is because every water supply network is unique, considering both shape and territory of a municipality, but also a number and localisation of water sources, pumping stations and highest water demand points. The universal description of all water supply structures is available by using elements of a fractal geometry. That gives plural possibilities in new methods of a classification, description and design of water supply networks. This paper presents the method of a water pipes path design method with the use of elements of a fractal geometry, graph theory, shortest path algorithm and classification of water demand points. The method was further applied in model municipality conditions.

6

Determination of the shortest path as the basis for examining the most weather favorable routes

Medyna P., Mąka M.

Zeszyty Naukowe / Akademia Morska w Szczecinie

|

2012

|

nr 32 (104) z. 1

29-33

EN

Generating initial population of evolutionary algorithms used in the process of weather ship route optimization requires the determination of the area where it may find the points of designated routes. The problem may be a need to sail around the continent, circumnavigate the islands, and the restrictions from the ice fields and other closed areas. Comparing routes to the rhumb line or great circle may be also impossible. It is proposed to determinate the preliminary route using Dijkstra's algorithm using land / ocean data of the GFS model. It will be used during generation an initial population on the ocean area in these cases.

7

Mobile application prototype for public transportation trip planning

Bembenik R., Byczuk M.

Metody Informatyki Stosowanej

|

2011

|

nr 3

19-30

EN

Paper presents a prototype of a system that allows passengers of public transportation to plan their trips. It is assumed that the user enters information concerning the planned trip (start address, end address and start time) and the system provides (i) description of the most convenient route i.e. one with the minimum number of transfers, the shortest walking distance and possibly the shortest trip time and (ii) a map presenting the route. The system is delivered to the end-user as a mobile application. Mobile devices (cellular phones, smartphones) are oftentimes equipped with a GPS (Global Positioning System) unit. The client's application makes use of the GPS unit so that the users who do not know their exact location can conveniently plan their trips. The system is built up of four programs implemented in Java. Oracle Spatial is used to store, access and analyze spatial data in the system.

8

Dijkstra's algorithm revisited: the dynamic programming connexion

Sniedovich M.

Control and Cybernetics

|

2006

|

Vol. 35, no 3

599-620

EN

Dijkstra's Algorithm is one of the most popular algorithms in computer science. It is also popular in operations research. It is generally viewed and presented as a greedy algorithm. In this paper we attempt to change this perception by providing a dynamic programming perspective on the algorithm. In particular, we are reminded that this famous algorithm is strongly inspired by Bellman's Principle of Optimality and that both conceptually and technically it constitutes a dynamic programming successive approximation procedure par excellence. One of the immediate implications of this perspective is that this popular algorithm can be incorporated in the dynamic programming syllabus and in turn dynamic programming should be (at least) alluded to in a proper exposition/teaching of the algorithm.