A Convenient Route for the Synthesis of Complex Metal Oxides Employing Solid-Solution Precursors

Synthesis of complex metal oxides by the thermal decomposition of solid-solution precursors (formed by isomorphous compounds of component metals) has been investigated since the method enables mixing of cations on an atomic scale and drastically reduces diffusion distances to a few angstroms. Several interesting oxides such as Ca2Fe03,5C, aCoz04,C a2C0205a, nd Ca,FeCo05 have been prepared by this technique starting from carbonate solid solutions of the type Ca,-,Fe,C03, Cal-,Co,C03, and Ca,-,,M,M'yC03 (M, M' = Mn, Fe, Co). The method has been extended to oxalate solid-solution precursors, and the possibility of making use of other kinds of precursor solid solutions is indicated.

Matrix Decomposition Methods for Data Mining : Computational Complexity and Algorithms

Matrix decompositions, where a given matrix is represented as a product of two other matrices, are regularly used in data mining. Most matrix decompositions have their roots in linear algebra, but the needs of data mining are not always those of linear algebra. In data mining one needs to have results that are interpretable -- and what is considered interpretable in data mining can be very different to what is considered interpretable in linear algebra. --- The purpose of this thesis is to study matrix decompositions that directly address the issue of interpretability. An example is a decomposition of binary matrices where the factor matrices are assumed to be binary and the matrix multiplication is Boolean. The restriction to binary factor matrices increases interpretability -- factor matrices are of the same type as the original matrix -- and allows the use of Boolean matrix multiplication, which is often more intuitive than normal matrix multiplication with binary matrices. Also several other decomposition methods are described, and the computational complexity of computing them is studied together with the hardness of approximating the related optimization problems. Based on these studies, algorithms for constructing the decompositions are proposed. Constructing the decompositions turns out to be computationally hard, and the proposed algorithms are mostly based on various heuristics. Nevertheless, the algorithms are shown to be capable of finding good results in empirical experiments conducted with both synthetic and real-world data.

Mining Cell Transition Data

Cell transition data is obtained from a cellular phone that switches its current serving cell tower. The data consists of a sequence of transition events, which are pairs of cell identifiers and transition times. The focus of this thesis is applying data mining methods to such data, developing new algorithms, and extracting knowledge that will be a solid foundation on which to build location-aware applications. In addition to a thorough exploration of the features of the data, the tools and methods developed in this thesis provide solutions to three distinct research problems. First, we develop clustering algorithms that produce a reliable mapping between cell transitions and physical locations observed by users of mobile devices. The main clustering algorithm operates in online fashion, and we consider also a number of offline clustering methods for comparison. Second, we define the concept of significant locations, known as bases, and give an online algorithm for determining them. Finally, we consider the task of predicting the movement of the user, based on historical data. We develop a prediction algorithm that considers paths of movement in their entirety, instead of just the most recent movement history. All of the presented methods are evaluated with a significant body of real cell transition data, collected from about one hundred different individuals. The algorithms developed in this thesis are designed to be implemented on a mobile device, and require no extra hardware sensors or network infrastructure. By not relying on external services and keeping the user information as much as possible on the user s own personal device, we avoid privacy issues and let the users control the disclosure of their location information.

A crop productivity research protocol for long wall mining

Springsure Creek Coal (SCC) intends to develop a coal mine using the long wall mining process under grain farming land near Emerald in Central Queensland (CQ). While this technology will result in some subsidence of the land surface, SCC wishes to maintain productivity of the grain cropping land in the precinct after coal mining. However, the impact of the surface subsidence resulting from that mining process on productivity of cropping land in any Australian landscape is currently unclear. A research protocol to investigate the impacts of subsidence on grain productivity for when the SCC project becomes operational is proposed. The protocol has wider application for other similar mining projects throughout the country. A copy of the full report is accessible on www.aginstitute.com.au.

Kinetics of resinification of furfuryl alcohol in aqueous solution

Kinetic information on the resinification of furfuryl alcohol has been derived from the rate of increase of color intensity measured with a photoelectric colorimeter, the resinification being carried out isothermally in Clark-Lubs aqueous buffer solutions in the pH range of 1.0-2.2. The activation energy for polymerization is found to increase exponentially with pH. The time required for emulsification (which is quickly followed by separation of resin layer) to occur in an aqueous solution of furfuryl alcohol also increases exponentially with pH, but it decreases exponentially with temperature. This is described quantitatively by a single expression.

Iterative solution of a class of linear equations with application to reconstruction of three-dimensional object arrays

An iterative algorithm baaed on probabilistic estimation is described for obtaining the minimum-norm solution of a very large, consistent, linear system of equations AX = g where A is an (m times n) matrix with non-negative elements, x and g are respectively (n times 1) and (m times 1) vectors with positive components.

The heat capacity of liquid carbon disulfide + acetonitrile, especially near the upper critical solution temperature

The heat capacity Cp of the binary liquid system CS2 + CH3CN has been studied. This system has an upper critical solution temperature To ≈ 323.4 K and a critical mole fraction of CS2xo ≈ 0.5920. Measurements were made both for mixtures close to and far away from the critical region. The heat capacity of the mixture with x = xo exhibits a symmetric logarithmic anomaly around Tc, which is apparently preserved even for compositions in the immediate vicinity of xc. For compositions far away from xc, only a normal rise in Cp over the covered temperature range is observed.

Approximate solution for the redistribution of impurities during second oxidation

The impurity profile for the second oxidation, used in MOST fabrication, has been obtained by Margalit et al. [1]. The disadvantage of this technique is that the accuracy of their solution is directly dependent on the computer time. In this article, an analytical solution is presented using the approximation of linearizing the second oxidation procedure.

On trade-off solution pairs in a special type of transportation problem

Abstract is not available.

The Newcastle solution: A realist perspective

This intervention was a multi-component program where a number of different strategies were implemented simultaneously: • Reduced trading hours; • ‘Lockouts’; • Restrictions on the strength of alcohol after certain times; • Managerial changes to the operation of the licensed premises

Finite field computation technique for exact solution of systems of linear equations and interval linear programming problems

An error-free computational approach is employed for finding the integer solution to a system of linear equations, using finite-field arithmetic. This approach is also extended to find the optimum solution for linear inequalities such as those arising in interval linear programming probloms.