Search results

Filters

  • Journals
  • Authors
  • Keywords
  • Date
  • Type

Search results

Number of results: 16
items per page: 25 50 75
Sort by:
Download PDF Download RIS Download Bibtex

Abstract

Abstract The enhancement of surgical simulation tools is an important research study, to assist in the assessment and feedback of medical training practice. In this research, the Spring Tensor Model (STEM) has been used for laparoscopic end-effector navigation through obstacles and high-risk areas. The modelling of the surgical trainer as part of the laparoscopic simulator seeks to emulate the physical environment as a virtualised representation in the integrated infrastructure. Combining sensor network framework paradigms to a surgical knowledge-based construct demonstrates how STEMcan enhance medical practice. The architectural hybridisation of the training framework has enabled the adaptation of STEM modelling techniques for a simulated laparoscopic training methodology. The primary benefit of the architecture is that this integration strategy has resulted in a seamless transition of the heuristic framework to be applied to surgical training.
Go to article

Authors and Affiliations

Christopher Chiu
Zenon Chaczko
Download PDF Download RIS Download Bibtex

Abstract

The article introduces an innovative approch for the inspection challenge that represents a generalization of the classical Traveling Salesman Problem. Its priciple idea is to visit continuous areas (circles) in a way, that minimizes travelled distance. In practice, the problem can be defined as an issue of scheduling unmanned aerial vehicle which has discrete-continuous nature. In order to solve this problem the use of local search algorithms is proposed.

Go to article

Authors and Affiliations

Radosław Grymin
Wojciech Bożejko
Zenon Chaczko
Jarosław Pempera
Mieczysław Wodecki
Download PDF Download RIS Download Bibtex

Abstract

Abstract The subject of this work is the new idea of blocks for the cyclic flow shop problem with setup times, using multiple patterns with different sizes determined for each machine constituting optimal schedule of cities for the traveling salesman problem (TSP). We propose to take advantage of the Intel Xeon Phi parallel computing environment during so-called ’blocks’ determination basing on patterns, in effect significantly improving the quality of obtained results.
Go to article

Authors and Affiliations

Wojciech Bożejko
Zenon Chaczko
Mariusz Uchroński
Mieczysław Wodecki

This page uses 'cookies'. Learn more