992 resultados para algorithm Context


Relevância:

20.00% 20.00%

Publicador:

Resumo:

This study examined the effects of political identity and the changing intergroup context on communication perceptions during an election campaign. Perceptions of media bias and of campaign impact on self and others were assessed before and after the election. The responses of politically aligned voters reflected their membership in a dominant or subordinate group preelection and in a losing or winning group postelection. Dominant group members were initially less biased in their views of the campaign and its impact but sought to blame their party's loss on media bias and on the gullibility of political out-group members and voters in general. Subordinate group members initially showed strong in-group-serving biases but were less critical of the media and the electorate after their party had won. Results highlight the dynamic, intergroup, nature of media perceptions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Recently Adams and Bischof (1994) proposed a novel region growing algorithm for segmenting intensity images. The inputs to the algorithm are the intensity image and a set of seeds - individual points or connected components - that identify the individual regions to be segmented. The algorithm grows these seed regions until all of the image pixels have been assimilated. Unfortunately the algorithm is inherently dependent on the order of pixel processing. This means, for example, that raster order processing and anti-raster order processing do not, in general, lead to the same tessellation. In this paper we propose an improved seeded region growing algorithm that retains the advantages of the Adams and Bischof algorithm fast execution, robust segmentation, and no tuning parameters - but is pixel order independent. (C) 1997 Elsevier Science B.V.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Motivation: Prediction methods for identifying binding peptides could minimize the number of peptides required to be synthesized and assayed, and thereby facilitate the identification of potential T-cell epitopes. We developed a bioinformatic method for the prediction of peptide binding to MHC class II molecules. Results: Experimental binding data and expert knowledge of anchor positions and binding motifs were combined with an evolutionary algorithm (EA) and an artificial neural network (ANN): binding data extraction --> peptide alignment --> ANN training and classification. This method, termed PERUN, was implemented for the prediction of peptides that bind to HLA-DR4(B1*0401). The respective positive predictive values of PERUN predictions of high-, moderate-, low- and zero-affinity binder-a were assessed as 0.8, 0.7, 0.5 and 0.8 by cross-validation, and 1.0, 0.8, 0.3 and 0.7 by experimental binding. This illustrates the synergy between experimentation and computer modeling, and its application to the identification of potential immunotheraaeutic peptides.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

OBJECTIVE: To evaluate a diagnostic algorithm for pulmonary tuberculosis based on smear microscopy and objective response to trial of antibiotics. SETTING: Adult medical wards, Hlabisa Hospital, South Africa, 1996-1997. METHODS: Adults with chronic chest symptoms and abnormal chest X-ray had sputum examined for Ziehl-Neelsen stained acid-fast bacilli by light microscopy. Those with negative smears were treated with amoxycillin for 5 days and assessed. Those who had not improved were treated with erythromycin for 5 days and reassessed. Response was compared with mycobacterial culture. RESULTS: Of 280 suspects who completed the diagnostic pathway, 160 (57%) had a positive smear, 46 (17%) responded to amoxycillin, 34 (12%) responded to erythromycin and 40 (14%) were treated as smear-negative tuberculosis. The sensitivity (89%) and specificity (84%) of the full algorithm for culture-positive tuberculosis were high. However, 11 patients (positive predictive value [PPV] 95%) were incorrectly diagnosed with tuberculosis, and 24 cases of tuberculosis (negative predictive value [NPV] 70%) were not identified. NPV improved to 75% when anaemia was included as a predictor. Algorithm performance was independent of human immunodeficiency virus status. CONCLUSION: Sputum smear microscopy plus trial of antibiotic algorithm among a selected group of tuberculosis suspects may increase diagnostic accuracy in district hospitals in developing countries.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Normal mixture models are being increasingly used to model the distributions of a wide variety of random phenomena and to cluster sets of continuous multivariate data. However, for a set of data containing a group or groups of observations with longer than normal tails or atypical observations, the use of normal components may unduly affect the fit of the mixture model. In this paper, we consider a more robust approach by modelling the data by a mixture of t distributions. The use of the ECM algorithm to fit this t mixture model is described and examples of its use are given in the context of clustering multivariate data in the presence of atypical observations in the form of background noise.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The study aimed to describe the types of care allocated at the end of acute care to people diagnosed with TBI and to identify the factors associated with variations in referral to care. A retrospective analysis of medical records of 61 patients was conducted based on a sample from two hospitals. While 60.7% of the study sample were referred to formal rehabilitation care, this was primarily non-inpatient rehabilitation care (32.8%). Discriminant analysis was used to determine medical and non-medical predictors of referral. Results indicated that place of treatment and age contribute to group differences and were significant in separating the inpatient rehabilitation group from the non-inpatient and no rehabilitation groups. Review by a rehabilitation physician was associated with referral to inpatient rehabilitation but was not adequate to explain referral to non-inpatient rehabilitation. An in-depth exploration of post-acute referral is warranted to improve policy and practice in relation to continuity of care following TBI.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Continuous-valued recurrent neural networks can learn mechanisms for processing context-free languages. The dynamics of such networks is usually based on damped oscillation around fixed points in state space and requires that the dynamical components are arranged in certain ways. It is shown that qualitatively similar dynamics with similar constraints hold for a(n)b(n)c(n), a context-sensitive language. The additional difficulty with a(n)b(n)c(n), compared with the context-free language a(n)b(n), consists of 'counting up' and 'counting down' letters simultaneously. The network solution is to oscillate in two principal dimensions, one for counting up and one for counting down. This study focuses on the dynamics employed by the sequential cascaded network, in contrast to the simple recurrent network, and the use of backpropagation through time. Found solutions generalize well beyond training data, however, learning is not reliable. The contribution of this study lies in demonstrating how the dynamics in recurrent neural networks that process context-free languages can also be employed in processing some context-sensitive languages (traditionally thought of as requiring additional computation resources). This continuity of mechanism between language classes contributes to our understanding of neural networks in modelling language learning and processing.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, the minimum-order stable recursive filter design problem is proposed and investigated. This problem is playing an important role in pipeline implementation sin signal processing. Here, the existence of a high-order stable recursive filter is proved theoretically, in which the upper bound for the highest order of stable filters is given. Then the minimum-order stable linear predictor is obtained via solving an optimization problem. In this paper, the popular genetic algorithm approach is adopted since it is a heuristic probabilistic optimization technique and has been widely used in engineering designs. Finally, an illustrative example is sued to show the effectiveness of the proposed algorithm.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper surveys current work on the design of alarms for anesthesia environments and notes some of the problems arising from the need to interpret alarms in context. Anesthetists' responses to audible alarms in the operating room were observed across four types of surgical procedure (laparoscopic, arthroscopic, cardiac, and intracranial) and across three phases of a procedure (induction, maintenance, and emergence). Alarms were classified as (a) requiring a corrective response, (b) being the intended result of a decision, (c) being ignored as a nuisance alarm, or (d) functioning as a reminder. Results revealed strong effects of the type of procedure and phase of procedure on the number and rate of audible alarms. Some alarms were relatively confined to specific phases; others were seen across phases, and responses differed according to phase. These results were interpreted in light of their significance for the development of effective alarm systems. Actual or potential applications of this research include the design of alarm systems that are more informative and more sensitive to operative context than are current systems.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Item noise models of recognition assert that interference at retrieval is generated by the words from the study list. Context noise models of recognition assert that interference at retrieval is generated by the contexts in which the test word has appeared. The authors introduce the bind cue decide model of episodic memory, a Bayesian context noise model, and demonstrate how it can account for data from the item noise and dual-processing approaches to recognition memory. From the item noise perspective, list strength and list length effects, the mirror effect for word frequency and concreteness, and the effects of the similarity of other words in a list are considered. From the dual-processing perspective, process dissociation data on the effects of length, temporal separation of lists, strength, and diagnosticity of context are examined. The authors conclude that the context noise approach to recognition is a viable alternative to existing approaches.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Perceived depth was measured for three-types of stereograms with the colour/texture of half-occluded (monocular) regions either similar to or dissimilar to that of binocular regions or background. In a two-panel random dot stereogram the monocular region was filled with texture either similar or different to the far panel or left blank. In unpaired background stereograms the monocular region either matched the background or was different in colour or texture and in phantom stereograms the monocular region matched the partially occluded object or was a different colour or texture. In all three cases depth was considerably impaired when the monocular texture did not match either the background or the more distant surface. The content and context of monocular regions as well as their position are important in determining their role as occlusion cues and thus in three-dimensional layout. We compare coincidence and accidental view accounts of these effects. (C) 2002 Elsevier Science Ltd. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An equivalent algorithm is proposed to simulate thermal effects of the magma intrusion in geological systems, which are composed of porous rocks. Based on the physical and mathematical equivalence, the original magma solidification problem with a moving boundary between the rock and intruded magma is transformed into a new problem without the moving boundary but with a physically equivalent heat source. From the analysis of an ideal solidification model, the physically equivalent heat source has been determined in this paper. The major advantage in using the proposed equivalent algorithm is that the fixed finite element mesh with a variable integration time step can be employed to simulate the thermal effect of the intruded magma solidification using the conventional finite element method. The related numerical results have demonstrated the correctness and usefulness of the proposed equivalent algorithm for simulating the thermal effect of the intruded magma solidification in geological systems. (C) 2003 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Fifth-grade children were given a series of word reading tasks. First, two sets of 16 disyllabic words with medial VCV spellings, and with a long initial vowel were selected, varying in frequency but with similar word-initial segments. Nonwords were derived from these sets of words by exchanging initial onsets. Children read these nonwords in a first testing session. In a second test session, children were given the Woodcock Word Identification Test and the set of analogue words from which the nonwords were derived. Initial analyses examined only nonwords derived from words that were correctly read. Both sets of nonwords were more likely to be read with a long initial vowel than a short initial vowel, although this tendency was stronger in nonwords derived from high frequency words. Furthennore, Word Identification ability showed a strong relationship with the preference for long initial vowels in this type of disyllabic nonword, both for nonwords derived from known analogues and for nonwords derived from words that children could not read correctly. This preference was also correlated with the preference for context-sensitive grapheme-phoneme correspondences in the reading of ambiguous monosyllabic nonwords.These results have strong implications for current theories of word reading.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A graph clustering algorithm constructs groups of closely related parts and machines separately. After they are matched for the least intercell moves, a refining process runs on the initial cell formation to decrease the number of intercell moves. A simple modification of this main approach can deal with some practical constraints, such as the popular constraint of bounding the maximum number of machines in a cell. Our approach makes a big improvement in the computational time. More importantly, improvement is seen in the number of intercell moves when the computational results were compared with best known solutions from the literature. (C) 2009 Elsevier Ltd. All rights reserved.