On many modern processors, context switches are costly in terms of latency. In this report, we argue that latency caused by kernel thread scheduling for incoming network messages can be avoided in a number of common situations, where instead the interrupt handler itself can perform the necessary protocol processing. For processors with high context switch costs, this can give a significant perf...

The Acceptor-Connector design pattern decouples connection establishment and service initialization in a distributed system from the processing performed once a service is initialized. This decoupling is achieved with three components: acceptors, connectors, and service handlers. A connector actively establishes a connection with a remote acceptor component and initializes a service handler to ...

This short paper is aimed to discuss the challenges for location-based services and proposes our framework, which makes it possible to obtain information from heterogeneous sources, and further set up the collaboration between Data Repositories and derived Top Hits Repository to improve the request-response efficiency. In our framework, the Data Handler, Profile Manager, Data Repository and TOP...

BACKGROUND In countries with low hepatitis A (HA) endemicity, infected food handlers are the source of most reported foodborne outbreaks. In Canada, accessible data repositories of infected food handler incidents are not available. We undertook a systematic review of such incidents to evaluate the extent of viral transmission through food contamination and the scope of post-exposure prophylaxis...

In order to minimize the number of situations when a model predictive controller fails to compute a control input, all practical MPC implementations should have a means to recover from infeasibility. We present a recently developed infeasibility handler which computes optimal relaxations of the relaxable constraints subject to a user-de ned prioritization. This infeasibility handler requires th...

A typical shadow-eliminating algorithm is presented in this paper. Algorithms for vehicle detection, edge detection and shadow detection are also given. If the shadow is not separated from the vehicle, the next traffic control processes, like vehicle classification, tracking and speed calculation, will be rather difficult. Our approach for shadow processing runs in real time in low-cost hardwar...

Classical simulation of quantum computation is necessary for studying the numerical behavior of quantum algorithms, as there does not yet exist a large viable quantum computer on which to perform numerical tests. Tensor network (TN) contraction is an algorithmic method that may be used for such simulations, often greatly reducing the computational cost over methods that simulate the full Hilber...