it has been suggested that single nucleotide polymorphisms (snps) in genes involved in toll-like receptors (tlrs) pathway may exhibit broad effects on function of this network and might contribute to a range of human diseases. however, the extent to which these variations affect tlr signaling is not well understood. in this study, we adopted a bioinformatics approach to predict the consequences...

In the present era, prevalence of lifestyle-related disorders is rapidly on rise globally. Modernization and advancement science technology have contributed to increasingly sedentary lifestyles. Among these lifestyle disorders, obesity or overweight (Sthoulya) stands out as a significant issue, disrupting individuals' physical, mental, social well-being. Obesity characterized by an excessive ac...

We discuss the role of nearest neighbor The nearest neighbor method can essential be seen technologies in case based reasoning. We describe the to involve a two step process. The first step in the use of the ordered weighted averaging for the nearest neighbor approach is to calculate the similarity development of nearest neighbor rules. A procedure for of the object of interest to each of the o...

(Watson & Trotzky, 2006) describes the implementation of a distributed case-based reasoning system, called case-agent system to mean computational agents representing cases, contrasting it to the conventional approach of one process (agent) that accesses a single case-base. The authors aim to show feature modelling in their system and test performance of retrieval as compared to other retrieval...

Straightforward implementation of the exact pairwise nearest neighbor (PNN) takes O(N) time, where N is the number of training vectors. This is rather slow in practical situations. Fortunately much faster implementation can be obtained with rather simple modifications to the basic algorithm. In the present paper we propose a fast O(τN) time implementation of the exact PNN, where τ is shown to b...

We describe and test a software approach to fault detection in common numerical algorithms. Such result checking or algorithm-based fault tolerance (ABFT) methods may be used, for example, to overcome single-event upsets in computational hardware or to detect errors in complex, high-efficiency implementations of the algorithms. Following earlier work, we use checksum methods to validate results...

Many case-based reasoning algorithms retrieve cases using a derivative of the k-nearest neighbor (k-NN) classiier, whose similarity function is sensitive to irrelevant, interacting, and noisy features. Many proposed methods for reducing this sensitivity parameterize k-NN's similarity function with feature weights. We focus on methods that automatically assign weight settings using little or no ...

Straightforward implementation of the exact pairwise nearest neighbor (PNN) algorithm takes O(N3) time, where N is the number of training vectors. This is rather slow in practical situations. Fortunately, much faster implementation can be obtained with rather simple modifications to the basic algorithm. In this paper, we propose a fast O(tauN2) time implementation of the exact PNN, where tau is...