alzheimers disease (ad) is by far the most common cause of dementia. definite diagnosis of ad is based on pathological findings. nincds-adrda criteria, published more than 25 years ago, are commonly used for the clinical diagnosis of ad. however, considering serious shortcomings of these criteria, new criteria have been proposed. according to these new criteria, ad can be diagnosed in predement...

Abstract— In this paper, a new extended method of multi criteria decision making based on fuzzy-Topsis theory is introduced. fuzzy mcdm algorithm for determining the best choice among all possible choices when the data are fuzzy is also presented. Using a new index leads to procedure for choosing fuzzy ideal and negative ideal solutions directly from the fuzzy data observed alternatives.in this...

Keyword spotting is an efficient approach for search of relevant recordings in databases of recorded unconstrained speech. Many algorithms have been proposed in the past for this problem and several techniques claim to be very efficient and accurate. Researchers have so far attempted to correctly compare their results by using standardized Receiver Operating Characteristic (ROC) curves, and per...

735 For the last four decades the diagnosis of MI has been based on the WHO criteria. The definition of MI required the presence of at least two of the following three factors: clinical history of ischemic chest pain; serial changes in ECG; a rise and fall in serum cardiac enzymes. These criteria have been extensively modified by the clinicians in their application: chest pain is often non-spec...

The most common way of constructing a hash function (e.g., SHA-1) is to iterate a compression function on the input message. The compression function is usually designed from scratch or made out of a block-cipher. In this paper, we introduce a new security notion for hash-functions, stronger than collision-resistance. Under this notion, the arbitrary length hash function H must behave as a rand...

In this paper we propose a new approach, recommended for solving certain class of multi-criteria scheduling problems, with the use of cloud exploration of the solution space supported by finegrained parallel computing. The approach allow us to approximate Pareto front more accurately than other known algorithms in competitive time. To show and check advantageous properties of the proposed appro...

Let a0, . . . , ak−1 be analytic functions on a domain Ω. Let F be a family of meromorphic functions f on Ω such that f 6= 0 and f (k) + ak−1f (k−1) + . . . + a0f 6= 0 on Ω, for all f ∈ F . Then {f ′/f : f ∈ F} is a normal family. Furthermore, let a0, . . . , ak−1 be meromorphic functions on a domain Ω. Let F be a family of meromorphic functions f on Ω such that f 6= 0, f ′ 6= 0 and f (k) + ak−...