518 resultados para Dimension Theory


Relevância:

20.00% 20.00%

Publicador:

Resumo:

better health service.Conclusion:This research provides an insight into the perceptions of the rhetoric and reality of community member involvement in the process of developing multi-purpose services. It revealed a grounded theory in which fear and trust were intrinsic to a process of changing from a traditional hospital service to the acceptance of a new model of health care provided at a multi-purpose service.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Aims and objectives. This purpose of this study was to describe the process of expertise acquisition in nephrology nursing practice. Background. It has been recognized for a number of decades that experts, compared with other practitioners in a number of professions and occupations, are the most knowledgeable and effective, in terms of both the quantity and quality of output. Studies relating to expertise have been undertaken in a range of nursing contexts and specialties; to date, however, none have been undertaken which focus on nephrology nursing. Design. This study, using grounded theory methodology, took place in one renal unit in New South Wales, Australia and involved six non-expert and 11 expert nurses. Methods. Simultaneous data collection and analysis took place using participant observation, semi-structured interviews and review of nursing documentation. Findings. The study revealed a three-stage skills-acquisitive process that was identified as non-expert, experienced non-expert and expert stages. Each stage was typified by four characteristics, which altered during the acquisitive process; these were knowledge, experience, skill and focus. Conclusion. This was the first study to explore nephrology nursing expertise and uncovered new aspects of expertise not documented in the literature and it also made explicit other areas, which had only been previously implied. Relevance to clinical practice. Of significance to nursing, the exercise of expertise is a function of the recognition of expertise by others and it includes the blurring of the normal boundaries of professional practice. © 2006 Blackwell Publishing Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The works depicted two ostensibly plaster figures 'cocooned' in protective overalls. The pose of both figures had a sense of instability, balancing improbably due to internal weights. This teetering, arching quality, combined with the empty sleeves of the overalls, made reference to the Rodin's Balzac and its aura of heroic subjectivity. As the Tyvek suits depicted in the works are a common part of my studio paraphernalia, these works sought to draw a line between these two opposing aspects of the subjectivity of the artist - the transcendent and the quotidian. The works were shown as part of ‘The Day the Machine Started’ for Dianne Tanzer Gallery + Projects at the 2010 Melbourne Art Fair. The works received citations in The Age and The Australian newspapers.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Sample complexity results from computational learning theory, when applied to neural network learning for pattern classification problems, suggest that for good generalization performance the number of training examples should grow at least linearly with the number of adjustable parameters in the network. Results in this paper show that if a large neural network is used for a pattern classification problem and the learning algorithm finds a network with small weights that has small squared error on the training patterns, then the generalization performance depends on the size of the weights rather than the number of weights. For example, consider a two-layer feedforward network of sigmoid units, in which the sum of the magnitudes of the weights associated with each unit is bounded by A and the input dimension is n. We show that the misclassification probability is no more than a certain error estimate (that is related to squared error on the training set) plus A3 √((log n)/m) (ignoring log A and log m factors), where m is the number of training patterns. This may explain the generalization performance of neural networks, particularly when the number of training examples is considerably smaller than the number of weights. It also supports heuristics (such as weight decay and early stopping) that attempt to keep the weights small during training. The proof techniques appear to be useful for the analysis of other pattern classifiers: when the input domain is a totally bounded metric space, we use the same approach to give upper bounds on misclassification probability for classifiers with decision boundaries that are far from the training examples.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d = VC(F) bound on the graph density of a subgraph of the hypercube—oneinclusion graph. The first main result of this paper is a density bound of n [n−1 <=d-1]/[n <=d] < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d contractible simplicial complexes, extending the well-known characterization that d = 1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VCdimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(logn) and is shown to be optimal up to an O(logk) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Assessment for Learning is a pedagogical practice with anticipated gains of increased student motivation, mastery and autonomy as learners develop their capacity to monitor and plan their own learning progress. Assessment for Learning (AfL) differs from Assessment of learning in its timing, occurring within the regular flow of learning rather than end point, in its purpose of improving student learning rather than summative grading and in the ownership of the learning where the student voice is heard in judging quality. Since Black and Wiliam (1998) highlighted the achievement gains that AfL practices seem to bring to all learners in classrooms, it has become part of current educational policy discourse in Australia, yet teacher adoption of the practices is not a straightforward implementation of techniques within an existing classroom repertoire. As can be seen from the following meta-analysis, recent research highlights a more complex interrelationship between teacher and student beliefs about learning and assessment, and the social and cultural interactions in and contexts of the classroom. More research is needed from a sociocultural perspective that allows meaning to emerge from practice. Before another policy push, we need to understand better the many factors within the assessment relationship. We need to hear from teachers and students through long-term AfL case studies both to inform AfL theory and to shed light on the complexities of pedagogical change for enhancing learner autonomy.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We present a modification of the algorithm of Dani et al. [8] for the online linear optimization problem in the bandit setting, which with high probability has regret at most O ∗ ( √ T) against an adaptive adversary. This improves on the previous algorithm [8] whose regret is bounded in expectation against an oblivious adversary. We obtain the same dependence on the dimension (n 3/2) as that exhibited by Dani et al. The results of this paper rest firmly on those of [8] and the remarkable technique of Auer et al. [2] for obtaining high probability bounds via optimistic estimates. This paper answers an open question: it eliminates the gap between the high-probability bounds obtained in the full-information vs bandit settings.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Levels of waste within the construction industry need to be reduced for environmental and economic reasons. Changing people's wasteful behaviour can make a significant contribution. This paper describes a research project that used Ajzen's 'theory of planned behaviour' to investigate the attitudinal forces that shape behaviour at the operative level. It concludes that operatives see waste as an inevitable by-product of construction activity. Attitudes towards waste management are not negative, although they are pragmatic and impeded by perceptions of a lack of managerial commitment. Waste management is perceived as a low project priority, and there is an absence of appropriate resources and incentives to support it. A theory of waste behaviour is proposed for the construction industry, and recommendations are made to help managers improve operatives' attitudes towards waste.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper offers a reply to Jochen Runde's critical appraisal of the ontological framework underpinning Dopfer and Potts's (2008) General Theory of Economic Evolution. We argue that Runde's comprehensive critique contains several of what we perceive to be misunderstandings in relation to the key concepts of ‘generic’ and ‘meso’ that we seek here to unpack and redress.