We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimization problems that occur as crucial subproblems in many real-world optimization problems and have a variety of applications in several different areas. We prove that there exist instances of the minimum s-t-cut proble...

In this work we investigate bounded Lukasiewicz logics, characterised as the intersection of the k-valued Lukasiewicz logics for k = 2, . . . , n (n ≥ 2). These logics formalise a generalisation of Ulam’s game with applications in Information Theory. Here we provide an analytic proof calculus G LBn for each bounded Lukasiewicz logic, obtained by adding a single rule to G L, a hypersequent calcu...

Aims: In the rapidly advancing world of laparoendoscopic surgery, surgeons are faced with new devices all of which are aimed towards a single access. Various single-access devices are available on the market. Our study aimed to compare the performance of experienced laparoscopic surgeons on validated laparoscopic tasks using five devices within a simulation setting. Methods: Ten experienced con...

The single cut measurement of exposure to respirable dust is the accepted method of exposure classification in occupational hygiene. We previously showed that actual pulmonary tissue dose may be substantially different from the dose expected, or the indicated dose, based on measurements using current single cut methodologies. We now examine exposure misclassification of workers based on any sin...