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.

The mixed anion mineral parnauite Cu9[(OH)10|SO4|(AsO4)2]•7H2O – a Raman spectroscopic study

The mixed anion mineral parnauite Cu9[(OH)10|SO4|(AsO4)2].7H2O from two localities namely Cap Garonne Mine, Le Pradet, France and Majuba Hill mine, Pershing County, Nevada, USA has been studied by Raman spectroscopy. The Raman spectrum of the French sample is dominated by an intense band at 975 cm-1 assigned to the ν1 (SO4)2- symmetric stretching mode and Raman bands at 1077 and 1097 cm-1 may be attributed to the ν3 (SO4)2- antisymmetric stretching mode. Two Raman bands 1107 and 1126 cm-1 are assigned to carbonate CO32- symmetric stretching bands and confirms the presence of carbonate in the structure of parnauite. The comparatively sharp band for the Pershing County mineral at 976 cm-1 is assigned to the ν1 (SO4)2- symmetric stretching mode and a broad spectral profile centered upon 1097 cm-1 is attributed to the ν3 (SO4)2- antisymmetric stretching mode. Two intense bands for the Pershing County mineral at 851 and 810 cm-1 are assigned to the ν1 (AsO4)3- symmetric stretching and ν3 (AsO4)3- antisymmetric stretching modes. Two Raman bands for the French mineral observed at 725 and 777 cm-1 are attributed to the ν3 (AsO4)3- antisymmetric stretching mode. For the French mineral, a low intensity Raman band is observed at 869 cm-1 and is assigned to the ν1 (AsO4)3- symmetric stretching vibration. Chemical composition of parnauite remains open and the question may be raised is parnauite a solid solution of two or more minerals such as a copper hydroxy-arsenate and a copper hydroxy sulphate.

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.

Bilski v Kappos : The United States Supreme Court delivers mixed views on patenting non-physical inventions and business methods

The United States Supreme Court has handed down a once in a generation patent law decision that will have important ramifications for the patentability of non-physical methods, both internationally and in Australia. In Bilski v Kappos, the Supreme Court considered whether an invention must either be tied to a machine or apparatus, or transform an article into a different state or thing to be patentable. It also considered for the first time whether business methods are patentable subject matter. The decision will be of particular interest to practitioners who followed the litigation in Grant v Commissioner of Patents, a Federal Court decision in which a Brisbane-based inventor was denied a patent over a method of protecting an asset from the claims of creditors.

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.

Tracking employees' twists and turns : describing a mixed methods approach to assessing change in the psychological contract

The psychological contract is a key analytical device utilised by both academics and practitioners to conceptualise and explore the dynamics of the employment relationship. However, despite the recognised import of the construct, some authors suggest that its empirical investigation has fallen into a 'methodological rut' [Conway & Briner, 2005, p. 89] and is neglecting to assess key tenets of the concept, such as its temporal and dynamic nature. This paper describes the research design of a longitudinal, mixed methods study which draws upon the strengths of both qualitative and quantitative modes of inquiry in order to explore the development of, and changes in, the psychological contract. Underpinned by a critical realist philosophy, the paper seeks to offer a research design suitable for exploring the process of change not only within the psychological contract domain, but also for similar constructs in the human resource management and broader organisational behaviour fields.

Mixed convection laminar flow along a horizontal plate subject to streamwise sinusoidal surface temperature

Mixed convection of a two-dimensional laminar incompressible flow along a horizontal flat plate with streamwise sinusoidal surface temperature has been numerically investigated for different values of Rayleigh number and Reynolds number for constant values of Prandtl number, amplitude and frequency of periodic temperature. The numerical scheme is based on the finite element method adapted to rectangular non-uniform mesh elements by a non-linear parametric solution algorithm. The fluid considered in this study is air. The results are obtained for the Rayleigh number and Reynolds number ranging from 102 to 104 and 1 to 100, respectively, with constant physical properties for the fluid medium considered. Velocity and temperature profiles, streamlines, isotherms, and average Nusselt numbers are presented to observe the effect of the investigating parameters on fluid flow and heat transfer characteristics. The present results show that the convective phenomena are greatly influenced by the variation of Rayleigh numbers and Reynolds number.

Street computing : towards an integrated open data Application Programming Interface (API) for cities

This special issue of the Journal of Urban Technology brings together five articles that are based on presentations given at the Street Computing workshop held on 24 November 2009 in Melbourne in conjunction with the Australian Computer-Human Interaction conference (OZCHI 2009). Our own article introduces the Street Computing vision and explores the potential, challenges and foundations of this research vision. In order to do so, we first look at the currently available sources of information and discuss their link to existing research efforts. Section 2 then introduces the notion of Street Computing and our research approach in more detail. Section 3 looks beyond the core concept itself and summarises related work in this field of interest.

Metaheuristics for the mixed shop scheduling problem

In this paper, three metaheuristics are proposed for solving a class of job shop, open shop, and mixed shop scheduling problems. We evaluate the performance of the proposed algorithms by means of a set of Lawrence’s benchmark instances for the job shop problem, a set of randomly generated instances for the open shop problem, and a combined job shop and open shop test data for the mixed shop problem. The computational results show that the proposed algorithms perform extremely well on all these three types of shop scheduling problems. The results also reveal that the mixed shop problem is relatively easier to solve than the job shop problem due to the fact that the scheduling procedure becomes more flexible by the inclusion of more open shop jobs in the mixed shop.

How effective is the new child restraint legislation in Queensland? A mixed methods evaluation

Research Interests: Are parents complying with the legislation? Is this the same for urban, regional and rural parents? Indigenous parents? What difficulties do parents experience in complying? Do parents understand why the legislation was put in place? Have there been negative consequences for other organisations or sectors of the community?

Good and bad Sharia : Australia's mixed response to Islamic law

Reflecting on the legal consequences of globalisation in the 21st century, Twining predicted that societies in the West would have to 'wrestle with the extent to which the state should recognise, make concessions to, or even enforce norms and values embedded in different religions, cultures or traditions'. This is borne out as the direction across the common law world moves towards entrenching legal pluralism. The concessions each nation has made to minorities with different religions, cultures and traditions have varied. The special character of Islam, as a comprehensive blueprint for life in which law and religion unite, has meant that the negotiations for a special place for Muslims within each common law jurisdiction has been at the forefront of new legal ordering possibilities. This is the crux of the pluralism debate. Cautiously, Australians have watched the, at times histrionic, discourse in Canada and Great Britain on official recognition for Islamic law.

Mixed convection flow of micropolar fluid in an open ended arc-shape cavity

Numerical simulations for mixed convection of micropolar fluid in an open ended arc-shape cavity have been carried out in this study. Computation is performed using the Alternate Direct Implicit (ADI) method together with the Successive Over Relaxation (SOR) technique for the solution of governing partial differential equations. The flow phenomenon is examined for a range of values of Rayleigh number, 102 ≤ Ra ≤ 106, Prandtl number, 7 ≤ Pr ≤ 50, and Reynolds number, 10 ≤ Re ≤ 100. The study is mainly focused on how the micropolar fluid parameters affect the fluid properties in the flow domain. It was found that despite the reduction of flow in the core region, the heat transfer rate increases, whereas the skin friction and microrotation decrease with the increase in the vortex viscosity parameter, Δ.