Based on daily updated data about communicable diseases in the municipalities of Nordland, Troms and Finnmark counties in Northern Norway, we have implemented a prototype of a disease query engine (DQE), that match symptom sets (the query vector) to diseases (the disease vectors), aimed at helping the general public to find reliable information about likely communicable diseases. The motivation...

Due to the increasing use of network-based systems, there is a growing interest in access to and search mechanisms for text databases in languages other than English. To adapt searching systems to those foreign languages with characteristics similar to the English language, all we need to do for the most part is to establish a general stopword list and a stemming procedure. This article present...

List scheduling is the most frequently used scheduling technique. In this context worst case analysis as well as many experimental studies were performed for various computational models. However, many new models have been proposed during the last decade with the aim to provide a realistic but still simple and general model of parallel computation. LogP is one of the most popular models so far ...

This paper proposes a Bibliographic system intends to exchange bibliographic information of survey/review articles by relying on Web service technology. It allows researchers and university students to interact with system via single service using platform-independent standard named Web service to add, search and retrieve bibliographic information of review articles in various science and techn...

BACKGROUND Internationally, there has been a call to improve the youth-friendliness of health services. In surveys, 60-90% of young people report having contact with a GP at least once a year. Regular contact with the GP can be assumed to be an indicator of a youth-friendly health service. The aim of the current study was to identify associations between a high consultation rate with young peop...

In many-server systems with heterogeneous servers, the Fastest-Server-First (FSF) policy is known for its excellent performance. However, when service rates are unknown and/or time-varying, implementing the FSF policy is not straightforward. We thus propose a routing algorithm, Performance-Based Routing, that approximates the FSF policy: servers are ranked in a dynamic list, where the shorter t...

Similar to most big data applications, the big data tendency also poses heavy impacts on service recommender systems. With the growing number of alternative services, effectively recommending services that users preferred has became an important research issue. Service recommender systems have been exposed as valuable tools to help users deal with services overload and provide appropriate recom...