Oral intake and serum levels of ascorbic acid in continuous ambulatory peritoneal dialysis patients

Oral intake of ascorbic acid is essential for optimum health in human beings. Continuous ambulatory peritoneal dialysis (CAPD) patients have an increased need for ascorbic acid, because of increased loss through dialysate, reduced intake owing to nausea and loss of appetite, and increased oxidative stress. However, optimum intake is still controversial. We studied 50 clinically stable patients to determine the relationship between oral ascorbic acid intake and serum ascorbic acid (SAA) level. Total oral intake ranged from 28 mg daily to 412 mg daily. Only one patient had an oral intake of ascorbic acid below 60 mg per day. The SAA levels ranged from 1 mg/L to 36.17 mg/L. Although a strong correlation existed between intake and SAA (p < 0.001, R2 = 0.47), the variation in SAA at any given intake level was wide. Of the studied patients, 62% had an SAA < 8.7 mg/L, 40% had an SAA < 5.1 mg/L (below the level in a healthy population), and 12% had a level below 2 mg/L (scorbutic). None of the patients demonstrated clinical manifestations of scurvy. Our results show that, in CAPD patients, ascorbic acid deficiency can be reliably detected only with SAA measurements, and oral intake may influence SAA level. To maintain ascorbic acid in the normal range for healthy adults, daily oral intake needs to be increased above the U.S. recommended dietary allowance to 80-140 mg.

Learning the kernel matrix with semidefinite programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive semidefinite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space - classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semidefinite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -using the labeled part of the data one can learn an embedding also for the unlabeled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method for learning the 2-norm soft margin parameter in support vector machines, solving an important open problem.

Learning the Kernel Matrix with Semi-Definite Programming

Kernel-based learning algorithms work by embedding the data into a Euclidean space, and then searching for linear relations among the embedded data points. The embedding is performed implicitly, by specifying the inner products between each pair of points in the embedding space. This information is contained in the so-called kernel matrix, a symmetric and positive definite matrix that encodes the relative positions of all points. Specifying this matrix amounts to specifying the geometry of the embedding space and inducing a notion of similarity in the input space -- classical model selection problems in machine learning. In this paper we show how the kernel matrix can be learned from data via semi-definite programming (SDP) techniques. When applied to a kernel matrix associated with both training and test data this gives a powerful transductive algorithm -- using the labelled part of the data one can learn an embedding also for the unlabelled part. The similarity between test points is inferred from training points and their labels. Importantly, these learning problems are convex, so we obtain a method for learning both the model class and the function without local minima. Furthermore, this approach leads directly to a convex method to learn the 2-norm soft margin parameter in support vector machines, solving another important open problem. Finally, the novel approach presented in the paper is supported by positive empirical results.

Optimistic linear programming gives logarithmic regret for irreducible MDPs

We present an algorithm called Optimistic Linear Programming (OLP) for learning to optimize average reward in an irreducible but otherwise unknown Markov decision process (MDP). OLP uses its experience so far to estimate the MDP. It chooses actions by optimistically maximizing estimated future rewards over a set of next-state transition probabilities that are close to the estimates, a computation that corresponds to solving linear programs. We show that the total expected reward obtained by OLP up to time T is within C(P) log T of the reward obtained by the optimal policy, where C(P) is an explicit, MDP-dependent constant. OLP is closely related to an algorithm proposed by Burnetas and Katehakis with four key differences: OLP is simpler, it does not require knowledge of the supports of transition probabilities, the proof of the regret bound is simpler, but our regret bound is a constant factor larger than the regret of their algorithm. OLP is also similar in flavor to an algorithm recently proposed by Auer and Ortner. But OLP is simpler and its regret bound has a better dependence on the size of the MDP.

Continuous and pedagogically sound assessment : A new economy of power relations in Australian Law schools

In recent decades, assessment practices within Australian law schools have moved from the overwhelming use of end-of-year closed-book examinations to an increase in the use of a wider range of techniques. This shift is often characterised as providing a ‘better’ learning environment for students, contributing more positively to their own ‘personal development’ within higher education, or, considered along the lines of critical legal thought, as ‘liberating’ them from the ‘conservatising’ and ‘indoctrinating’ effects of the power relations that operate in law schools. This paper seeks to render problematic such liberal-progressive narratives about these changes to law school assessment practices. It will do so by utilising the work of French historian and philosopher Michel Foucault on power, arguing that the current range of assessment techniques demonstrates a shift in the ‘economy’ of power relations within the law school. Rather than ‘liberating’ students from relations of power, these practices actually extend the power relations through which students are governed. This analysis is intended to inform legal education research and assessment practice by providing a far more nuanced conceptual framework than one that seeks to ‘free’ law students from these ‘repressive’ practices, or hopes to ‘objectively’ contribute to their ‘personal development’.

Continuous innovation in SMEs : how design innovation shapes business performance through doing more with less

Firms face the challenge to survive and thrive in an increasingly competitive global market, developing strategies to continuously innovate, often having to do more with less. Increasing awareness of the benefits of stimulating continuous innovation in small and medium enterprises has led to the development and implementation of design innovation programs, with many western countries investing in design innovation programs for better firm performance. This paper investigates how firms respond to a design innovation program and engage in continuous innovation, doing more business with a focused less diverse strategy. Early findings from a study of companies engaged in a design innovation program indicate that applying design principles to all aspects of their business has delivered better business performance and better positioning in global markets.

A continuous time model for election timing

We consider a continuous time model for election timing in a Majoritarian Parliamentary System where the government maintains a constitutional right to call an early election. Our model is based on the two-party-preferred data that measure the popularity of the government and the opposition over time. We describe the poll process by a Stochastic Differential Equation (SDE) and use a martingale approach to derive a Partial Differential Equation (PDE) for the government’s expected remaining life in office. A comparison is made between a three-year and a four-year maximum term and we also provide the exercise boundary for calling an election. Impacts on changes in parameters in the SDE, the probability of winning the election and maximum terms on the call exercise boundaries are discussed and analysed. An application of our model to the Australian Federal Election for House of Representatives is also given.

Pedagogy of introductory computer programming : a people-first approach

Students struggle with learning to program. In recent years, not only has there been a dramatic drop in the number of students enrolling in IT and Computer Science courses, but attrition from these courses continues to be significant. Introductory programming subjects traditionally have high failure rates and as they tend to be core to IT and Computer Science courses can be a road block for many students to their university studies. Is programming really that difficult — or are there other barriers to learning that have a serious and detrimental effect on student progression? In-class experiments were conducted in introductory programming units to confirm our hypothesis that that pair-programming would benefit students' learning to program. We investigated the social and cultural barriers to learning programming by questioning students' perceptions of confidence, difficulty and enjoyment of programming. The results of paired and non-paired students were compared to determine the effect of pair-programming on learning outcomes. Both the empirical and anecdotal results of our experiments strongly supported our hypothesis.

A longitudinal study of corporate earnings guidance in Australia’s continuous disclosure environment

Since the introduction of a statutory‐backed continuous disclosure regime (CDR) in 1994, regulatory reforms have significantly increased litigation risk in Australia for failure to disclose material information or for false and misleading disclosure. However, there is almost no empirical research on the impact of the reforms on corporate disclosure behaviour. Motivated by the absence of research and using management earnings forecasts (MEFs) as a disclosure proxy, this study examines (1) why managers issue earnings forecasts, (2) what firm‐specific factors influence MEF characteristics, and (3) how MEF behaviour changes as litigation risk increases. Based on theories in information economics, a theoretical framework for MEF behaviour is formulated which includes antecedent influencing factors related to firms‟ internal and external environments. Applying this framework, hypotheses are developed and tested using multivariate models and a large sample of hand-collected MEFs (7,213) issued by top 500 ASX-listed companies over the 1994 to 2008 period. The results reveal strong support for the hypotheses. First, MEFs are issued to reduce information asymmetry, litigation risk and signal superior performance. Second, firms with better financial performance, smaller earnings changes, and lower operating uncertainty provide better quality MEFs. Third, forecast frequency and quality (accuracy, timeliness and precision) noticeably improve as litigation risk increases. However, managers appear to be still reluctant to disclose earnings forecasts when there are large earnings changes, and an asymmetric treatment of news type continues to prevail (a good news bias). Thus, the findings generally provide support for the effectiveness of the CDR regulatory reforms in improving disclosure behaviour and will be valuable to market participants and corporate regulators in understanding the implications of management forecasting decisions and areas for further improvement.

Toward a shared understanding of competency in programming : an invitation to the BABELnot Project

The ICT degrees in most Australian universities have a sequence of up to three programming subjects, or units. BABELnot is an ALTC-funded project that will document the academic standards associated with those three subjects in the six participating universities and, if possible, at other universities. This will necessitate the development of a rich framework for describing the learning goals associated with programming. It will also be necessary to benchmark exam questions that are mapped onto this framework. As part of the project, workshops are planned for ACE 2012, ICER 2012 and ACE 2013, to elicit feedback from the broader Australasian computing education community, and to disseminate the project’s findings. The purpose of this paper is to introduce the project to that broader Australasian computing education community and to invite their active participation.