BACKGROUND The introduction of the European Working Time Directive (EWTD) has greatly reduced training hours of surgical residents, which translates into 30% less surgical and clinical experience. Such a dramatic drop in attendance has serious implications such compromised quality of medical care. As the surgical department of the University of Heidelberg, our goal was to establish a model that...

Aiming towards the development of a general clustering theory, we discuss abstract axiomatization for clustering. In this respect, we follow up on the work of Kleinberg, ([1]) that showed an impossibility result for such axiomatization. We argue that an impossibility result is not an inherent feature of clustering, but rather, to a large extent, it is an artifact of the specific formalism used ...

Here, a silicon nanopillar array (Si-NPA) was fabricated. It was studied as a room-temperature organic vapour sensor, and the ethanol and acetone gas sensing properties were detected with I-V curves. I-V curves show that these Si-NPA gas sensors are sensitive to ethanol and acetone organic vapours. The turn-on threshold voltage is about 0.5 V and the operating voltage is 3 V. With 1% ethanol ga...

The paper presents two useful extensions of the incremental SVM in the context of online learning. An online support vector data description algorithm enables application of the online paradigm to unsupervised learning. Furthermore, online learning can be used in the large-scale classification problems to limit the memory requirements for storage of the kernel matrix. The proposed algorithms ar...

chainsaw is an important machine for tree felling limbing and bucking in hyrcanian forest and the major problems related to using forest machines was sound intensity. the aim of this study was to measure the sound level in occupational exposure of workers, determine the exposure time of workers and comparison of the variables among the workers. this study was carried out in namkhaneh district i...

Modern servers pay a heavy price in block access time on diskbound workloads when the working set is greater than the size of the local buffer cache. We provide a mechanism for cooperating servers to coordinate and share their local buffer caches. The coordinated buffer cache can handle working sets on the order of the aggregate cache memory, greatly improving performance on diskbound workloads...

A priority queue is presented that supports the operations insert and find-min in worst-case constant time, and delete and deletemin on element x in worst-case O(lg(min{wx, qx} + 2)) time, where wx (respectively qx) is the number of elements inserted after x (respectively before x) and are still present at the time of the deletion of x. Our priority queue then has both the working-set and the q...

We present a general transformation for combining a constant number of binary search tree data structures (BSTs) into a single BST whose running time is within a constant factor of the minimum of any “well-behaved” bound on the running time of the given BSTs, for any online access sequence. (A BST has a well-behaved bound with f(n) overhead if it spends at most O(f(n)) time per access and its b...