907 resultados para Minimum bias
Resumo:
Minimum aberration is the most established criterion for selecting a regular fractional factorial design of maximum resolution. Minimum aberration designs for n runs and n/2 less than or equal to m < n factors have previously been constructed using the novel idea of complementary designs. In this paper, an alternative method of construction is developed by relating the wordlength pattern of designs to the so-called 'confounding between experimental runs'. This allows minimum aberration designs to be constructed for n runs and 5n/16 less than or equal to m less than or equal to n/2 factors as well as for n/2 less than or equal to m < n.
Resumo:
When Campylobacter jejuni cultures that had been grown in broth at 39degreesC were subcultured into fresh medium at 30degreesC, there was a transient period of growth followed by a decline in viable-cell numbers before growth resumed once more. We propose that this complex behavior is the net effect of the growth of inoculum cells followed by a loss of viability due to oxidative stress and the subsequent emergence of a spontaneously arising mutant population that takes over the culture.
Resumo:
Background. This study examined whether alcohol abuse patients are characterized either by enhanced schematic processing of alcohol related cues or by an attentional bias towards the processing of alcohol cues. Method. Abstinent alcohol abusers (N = 25) and non-clinical control participants (N = 24) performed a dual task paradigm in which they had to make an odd/even decision to a centrally presented number while performing a peripherally presented lexical decision task. Stimuli on the lexical decision task comprised alcohol words, neutral words and non-words. In addition, participants completed an incidental recall task for the words presented in the lexical decision task. Results. It was found that, in the presence of alcohol related words, the performance of patients on the odd/even decision task was poorer than in the presence of other stimului. In addition, patients displayed slower lexical decision times for alcohol related words. Both groups displayed better recall for alcohol words than for other stimuli. Conclusions. These results are interpreted as supporting neither model of drug cravings. Rather, it is proposed that, in the presence of alcohol stimuli, alcohol abuse patients display a breakdown in the ability to focus attention.
Resumo:
Objective: The aims of these studies were (a) to investigate the relationship between attentional bias and eating disorders and (b) examine the impact of psychological treatment on attentional bias. Method: The first study compared performance on a pictorial dot probe of 82 female patients with clinical eating disorders and 44 healthy female controls. The second study compared the performance of 31 patients with eating disorder on the same task before and after receiving 20 weeks of standardized cognitive behavior therapy. Twenty-four patients with eating disorder served as wait-list controls. Results: With the exception of neutral shape stimuli, attentional biases for eating, shape, and weight stimuli were greater in the patient sample than the healthy controls. The second study found that attentional biases significantly reduced after active treatment only. Conclusion: Attentional biases may be an expression of the eating disorder. The question of whether such biases warrant specific intervention requires further investigation. (C) 2008 by Wiley Periodicals, Inc.
Resumo:
Objective: To examine the relationship between eating disorders and attentional biases. Method: The first study comprised 23 female patients with clinical eating disorders, women with high levels of anxiety (n = 19), and three female normal control groups comprising low (n = 31), moderate (n = 21), or high levels of shape concern (n 23). The second study comprised 82 women with clinical eating disorders and 44 healthy controls. All participants completed measures of eating disorder psychopathology and completed a modified pictorial dot-probe task. Results: In the first study, biases were found for negative eating and neutral weight pictures, and for positive eating pictures in women with eating disorders; these biases were greater than those found in anxious and normal controls. The second study replicated these findings and biases were also found for negative and neutral shape stimuli. Conclusion: It is concluded that future research should establish whether such biases warrant specific therapeutic interventions. (c) 2007 by Wiley Periodicals, Inc.
Resumo:
Individuals with Williams syndrome (WS) display poor visuo-spatial cognition relative to verbal abilities. Furthermore, whilst perceptual abilities are delayed, visuo-spatial construction abilities are comparatively even weaker, and are characterised by a local bias. We investigated whether his differentiation in visuo-spatial abilities can be explained by a deficit in coding spatial location in WS. This can be measured by assessing participants' understanding of the spatial relations between objects within a visual scene. Coordinate and categorical spatial relations were investigated independently in four participant groups: 21 individuals with WS; 21 typically developing (TD) children matched for non-verbal ability; 20 typically developing controls of a lower non-verbal ability; and 21 adults. A third task measured understanding of visual colour relations. Results indicated first, that the comprehension of categorical and coordinate spatial relations is equally poor in WS. Second, that the comprehension of visual relations is also at an equivalent level to spatial relational understanding in this population. These results can explain the difference in performance on visuo-spatial perception and construction tasks in WS. In addition, both the WS and control groups displayed response biases in the spatial tasks. However, the direction of bias differed across the groups. This finding is explored in relation to current theories of spatial location coding. (c) 2005 Elsevier Inc. All rights reserved.
Resumo:
A fast Knowledge-based Evolution Strategy, KES, for the multi-objective minimum spanning tree, is presented. The proposed algorithm is validated, for the bi-objective case, with an exhaustive search for small problems (4-10 nodes), and compared with a deterministic algorithm, EPDA and NSGA-II for larger problems (up to 100 nodes) using benchmark hard instances. Experimental results show that KES finds the true Pareto fronts for small instances of the problem and calculates good approximation Pareto sets for larger instances tested. It is shown that the fronts calculated by YES are superior to NSGA-II fronts and almost as good as those established by EPDA. KES is designed to be scalable to multi-objective problems and fast due to its small complexity.
Resumo:
A hybridised and Knowledge-based Evolutionary Algorithm (KEA) is applied to the multi-criterion minimum spanning tree problems. Hybridisation is used across its three phases. In the first phase a deterministic single objective optimization algorithm finds the extreme points of the Pareto front. In the second phase a K-best approach finds the first neighbours of the extreme points, which serve as an elitist parent population to an evolutionary algorithm in the third phase. A knowledge-based mutation operator is applied in each generation to reproduce individuals that are at least as good as the unique parent. The advantages of KEA over previous algorithms include its speed (making it applicable to large real-world problems), its scalability to more than two criteria, and its ability to find both the supported and unsupported optimal solutions.
OFDM joint data detection and phase noise cancellation based on minimum mean square prediction error
Resumo:
This paper proposes a new iterative algorithm for orthogonal frequency division multiplexing (OFDM) joint data detection and phase noise (PHN) cancellation based on minimum mean square prediction error. We particularly highlight the relatively less studied problem of "overfitting" such that the iterative approach may converge to a trivial solution. Specifically, we apply a hard-decision procedure at every iterative step to overcome the overfitting. Moreover, compared with existing algorithms, a more accurate Pade approximation is used to represent the PHN, and finally a more robust and compact fast process based on Givens rotation is proposed to reduce the complexity to a practical level. Numerical Simulations are also given to verify the proposed algorithm. (C) 2008 Elsevier B.V. All rights reserved.
Resumo:
In this study a minimum variance neuro self-tuning proportional-integral-derivative (PID) controller is designed for complex multiple input-multiple output (MIMO) dynamic systems. An approximation model is constructed, which consists of two functional blocks. The first block uses a linear submodel to approximate dominant system dynamics around a selected number of operating points. The second block is used as an error agent, implemented by a neural network, to accommodate the inaccuracy possibly introduced by the linear submodel approximation, various complexities/uncertainties, and complicated coupling effects frequently exhibited in non-linear MIMO dynamic systems. With the proposed model structure, controller design of an MIMO plant with n inputs and n outputs could be, for example, decomposed into n independent single input-single output (SISO) subsystem designs. The effectiveness of the controller design procedure is initially verified through simulations of industrial examples.
Resumo:
A beamforming algorithm is introduced based on the general objective function that approximates the bit error rate for the wireless systems with binary phase shift keying and quadrature phase shift keying modulation schemes. The proposed minimum approximate bit error rate (ABER) beamforming approach does not rely on the Gaussian assumption of the channel noise. Therefore, this approach is also applicable when the channel noise is non-Gaussian. The simulation results show that the proposed minimum ABER solution improves the standard minimum mean squares error beamforming solution, in terms of a smaller achievable system's bit error rate.
Resumo:
An analysis of Stochastic Diffusion Search (SDS), a novel and efficient optimisation and search algorithm, is presented, resulting in a derivation of the minimum acceptable match resulting in a stable convergence within a noisy search space. The applicability of SDS can therefore be assessed for a given problem.
Resumo:
Generalized cubes are a subclass of hypercube-like networks, which include some hypercube variants as special cases. Let theta(G)(k) denote the minimum number of nodes adjacent to a set of k vertices of a graph G. In this paper, we prove theta(G)(k) >= -1/2k(2) + (2n - 3/2)k - (n(2) - 2) for each n-dimensional generalized cube and each integer k satisfying n + 2 <= k <= 2n. Our result is an extension of a result presented by Fan and Lin [J. Fan, X. Lin, The t/k-diagnosability of the BC graphs, IEEE Trans. Comput. 54 (2) (2005) 176-184]. (c) 2005 Elsevier B.V. All rights reserved.