Ethnic minority patients receive lower priority triage assignments in Veteran's Affairs (VA) emergency departments (EDs) compared to White patients, but it is currently unknown whether this disparity arises from generalized biases across the triage assessment process or from differences in how objective and/or subjective institution-level or person-level information is incorporated into the tri...

An invited report on national occupational health research priorities, agenda and strategy of Japan was delivered in the NORA (National Occupational Research Agenda) Symposium 2001, USA. The third NORA Symposium was held by the US National Institute for Occupational Safety and Health (NIOSH) in Washington DC on June 27, 2001. The national conference in Japan entitled "Conference on Occupational...

Priority queues and double-ended priority queues are fundamental data types in Computer Science, and various data structures have been proposed to implement them. In particular, diamond deques, interval heaps, min-max-pair heaps, and twin-heaps provide implicit structures for double-ended priority queues. Although these heap-like structures are essentially the same when they are presented in an...

Nowadays, project selection is a vital decision in many organizations. Because competition among research projects in order to gain more budgets and to attain new scientific domain has increased. Due to multiple objectives and budgeting restrictions for academic research projects have led to the use of expert system for decision making by academic and research centers. The existing methods suff...

In this paper we show that the widely used normalization constraint ∑ n i=1 wi = 1 does not apply to the priority vectors associated with reciprocal relations, whenever additive transitivity is involved. We show that misleading applications of this type of normalization may lead to unsatisfactory results and we give some examples from the literature. Then, we propose an alternative normalizatio...

In this paper we show how to implement bounded ordered dictionaries, also called bounded priority queues, in O(log log N) time per operation and O(n) space. Here n denotes the number of elements stored in the dictionary and N denotes the size of the universe. Previously, this time bound required O(N) space E77].

A k-bounded priority queue transforms an input sequence CT into an output sequence z which is a re-ordering of the sequence c while never storing more than k elements during the transformation. We consider the set of all such related pairs (a, 7) in both the case that cs is a binary sequence and the case that o is a permutation of 1,2,. , n. We derive properties of this relation and use it to d...

Well-known results on the ergodicity of queues with preemptive priority were obtained under assumption that jobs arrive according to Poisson process. This assumption, however, does not always hold true in practice. In our work we find sufficient conditions for two classes a single server, where interarrival times high-priority have either Erlang or hyperexponential distribution and low-priority...

Structuring real-time concurrent programs in the form of groups of fixed-priority processes is an old art which is appropriate for only a small fraction of modern real-time distributed computing application systems. However, it is still practiced on the basis of an insufficient technical foundation. One of the basic issues in using the fixed-priority process structuring approach is to avoid the...