some applications are critical and must designed fault tolerant system. usually voting algorithm is one of the principle elements of a fault tolerant system. two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. majority confronts with the problem of threshold limits and voter of weight...

abstract in order to evaluation the effects of price policies (wheat guarantee price in each period and its price lag), environmental (planted area) and climatic (min and max average temperature, total annual precipitation, cold-day degree and hot-day degree) factors, we considered wheat yield in razavi-khorasan province (9 cities) for a 13-year statistical period (1371-72 to 1383-84). in this ...

Except for a few simple digital modulation techniques, derivation of average bit error probability over fading channels is difficult and is an involved process. In this letter, curve fitting technique has been employed to express bit error probability over AWGN of any digital modulation scheme in terms of a simple Gaussian function. Using this Gaussian function, a generalized closed form expres...

In this work, we present a novel approach to the generation task of ordering prenominal modifiers. We take a maximum entropy reranking approach to the problem which admits arbitrary features on a permutation of modifiers, exploiting hundreds of thousands of features in total. We compare our error rates to the state-of-the-art and to a strong Google ngram count baseline. We attain a maximum erro...

The authors present a technique for correcting for exposure measurement error in the analysis of case-control data when subjects have a variable number of repeated measurements, and the average is used as the subject's measure of exposure. The true exposure as well as the measurement error are assumed to be normally distributed. The method transforms each subject's observed average by a factor ...

A new lower bound for the average probability or error for a two-user discrete memoryless (DM) multiple-access channel (MAC) is derived. This bound has a structure very similar to the well-known sphere packing packing bound derived by Haroutunian. However, since explicitly imposes independence of the users’ input distributions (conditioned on the time-sharing auxiliary variable) results in a ti...

Learnability in Valiant’s pac-learning formalism is reformulated in terms of expected (average) error instead of confidence and error parameters. A finite-domain, random set formalism is introduced to develop algorithm-dependent, distributionspecific analytic error estimates. Two random set theorems for finite concept-spaces are presented to facilitate these developments. Analyses are carried o...

Risk assessment of financial intermediaries is an area of renewed interest due to the financial crises of the 1980’s and 90’s. An accurate estimation of risk, and its use in corporate or global financial risk models, could be translated into a more efficient use of resources. One important ingredient to accomplish this goal is to find accurate predictors of individual risk in the credit portfol...

Studies on consonant perception under noise conditions typically describe the average consonant error as exponential in the Articulation Index (AI). While this AI formula nicely fits the average error over all consonants, it does not fit the error for any consonant at the utterance level. This study analyzes the error patterns of six stop consonants /p, t, k, b, d, g/ with four vowels (/α/, /ε/...

In Section 4 of the main paper, we present results on two benchmarks in terms of average ranking, since classification datasets may not be commensurable in terms of raw validation error. For the sake of completeness, we present here results in terms of average meta-test error. Meta-test error is defined slightly differently in our two experiments. We also present a PCA of our data in the MLP ex...