387 resultados para resolvent convergence


Relevância:

10.00% 10.00%

Publicador:

Resumo:

The last two decades have seen a significant restructuring of work across Australia and other industrialised economies, a critical part of which has been the appearance of competency based education and assessment. The competency movement is about creating a more flexible and mobile labour force to increase productivity and it does so by redefining work as a set of transferable or ‘soft’ generic skills that are transportable and are the possession of the individual. This article sought to develop an analysis of competency based clinical assessment of nursing students across a bachelor of nursing degree course. This involved an examination of a total of 406 clinical assessment tools that covered the years 1992-2009 and the three years of a bachelor degree. Data analysis generated three analytical findings: the existence of a hierarchy of competencies that prioritises soft skills over intellectual and technical skills; the appearance of skills as personal qualities or individual attributes; and the absence of context in assessment. The article argues that the convergence in nursing of soft skills and the professionalisation project reform has seen the former give legitimacy to the enduring invisibility and devaluation of nursing work.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper we consider the case of large cooperative communication systems where terminals use the protocol known as slotted amplify-and-forward protocol to aid the source in its transmission. Using the perturbation expansion methods of resolvents and large deviation techniques we obtain an expression for the Stieltjes transform of the asymptotic eigenvalue distribution of a sample covariance random matrix of the type HH† where H is the channel matrix of the transmission model for the transmission protocol we consider. We prove that the resulting expression is similar to the Stieltjes transform in its quadratic equation form for the Marcenko-Pastur distribution.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper, we consider the variable-order Galilei advection diffusion equation with a nonlinear source term. A numerical scheme with first order temporal accuracy and second order spatial accuracy is developed to simulate the equation. The stability and convergence of the numerical scheme are analyzed. Besides, another numerical scheme for improving temporal accuracy is also developed. Finally, some numerical examples are given and the results demonstrate the effectiveness of theoretical analysis. Keywords: The variable-order Galilei invariant advection diffusion equation with a nonlinear source term; The variable-order Riemann–Liouville fractional partial derivative; Stability; Convergence; Numerical scheme improving temporal accuracy

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We examined properties of culture-level personality traits in ratings of targets (N=5,109) ages 12 to 17 in 24 cultures. Aggregate scores were generalizable across gender, age, and relationship groups and showed convergence with culture-level scores from previous studies of self-reports and observer ratings of adults, but they were unrelated to national character stereotypes. Trait profiles also showed cross-study agreement within most cultures, 8 of which had not previously been studied. Multidimensional scaling showed that Western and non-Western cultures clustered along a dimension related to Extraversion. A culture-level factor analysis replicated earlier findings of a broad Extraversion factor but generally resembled the factor structure found in individuals. Continued analysis of aggregate personality scores is warranted.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this this paper I identify specific historical trajectories that are directly contingent upon the deployment and use of new media, but which are actually hidden by a focus on the purely technological. They are: the increasingly abstract and alienated nature of economic value; the subsumption of all labour - material and intellectual - under systemic capital; and the convergence of formerly distinct spheres of analysis –the spheres of production, circulation, and consumption. This paper examines the implications of the knowledge economy from an historical materialist perspective. I synthesise the systemic views of Marx (1846/1972, 1875/1972 1970 1973 1976 1978 1981), Adorno (1951/1974 1964/1973 1991; Horkheimer and Adorno 1944/1998; Jarvis 1998), and Bourdieu (1991 1998) to argue for a language-focused approach to new media research and suggest aspects of Marxist thought which might be useful in researching emergent socio-technical domains. I also identify specific categories in the Marxist tradition which may no longer be analytically useful for researching the effects of new media.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Many of the classification algorithms developed in the machine learning literature, including the support vector machine and boosting, can be viewed as minimum contrast methods that minimize a convex surrogate of the 0–1 loss function. The convexity makes these algorithms computationally efficient. The use of a surrogate, however, has statistical consequences that must be balanced against the computational virtues of convexity. To study these issues, we provide a general quantitative relationship between the risk as assessed using the 0–1 loss and the risk as assessed using any nonnegative surrogate loss function. We show that this relationship gives nontrivial upper bounds on excess risk under the weakest possible condition on the loss function—that it satisfies a pointwise form of Fisher consistency for classification. The relationship is based on a simple variational transformation of the loss function that is easy to compute in many applications. We also present a refined version of this result in the case of low noise, and show that in this case, strictly convex loss functions lead to faster rates of convergence of the risk than would be implied by standard uniform convergence arguments. Finally, we present applications of our results to the estimation of convergence rates in function classes that are scaled convex hulls of a finite-dimensional base class, with a variety of commonly used loss functions.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Gradient-based approaches to direct policy search in reinforcement learning have received much recent attention as a means to solve problems of partial observability and to avoid some of the problems associated with policy degradation in value-function methods. In this paper we introduce GPOMDP, a simulation-based algorithm for generating a biased estimate of the gradient of the average reward in Partially Observable Markov Decision Processes (POMDPs) controlled by parameterized stochastic policies. A similar algorithm was proposed by Kimura, Yamamura, and Kobayashi (1995). The algorithm's chief advantages are that it requires storage of only twice the number of policy parameters, uses one free parameter β ∈ [0,1) (which has a natural interpretation in terms of bias-variance trade-off), and requires no knowledge of the underlying state. We prove convergence of GPOMDP, and show how the correct choice of the parameter β is related to the mixing time of the controlled POMDP. We briefly describe extensions of GPOMDP to controlled Markov chains, continuous state, observation and control spaces, multiple-agents, higher-order derivatives, and a version for training stochastic policies with internal states. In a companion paper (Baxter, Bartlett, & Weaver, 2001) we show how the gradient estimates generated by GPOMDP can be used in both a traditional stochastic gradient algorithm and a conjugate-gradient procedure to find local optima of the average reward. ©2001 AI Access Foundation and Morgan Kaufmann Publishers. All rights reserved.