Studies on boundary lubrication properties of oxidised coconut and soy bean oils

Vegetable oils are a potential source of base oils for biodegradable lubricants, with limited oxidative stability. This study focuses on the effect of long-term ageing and the influence of oxidation products on the boundary lubrication performance of coconut and soy bean oils, by subjecting them to accelerated ageing in a dark oven at elevated temperature. The samples were collected at regular intervals and analysed for the changes in viscosity, percentage of free fatty acid and peroxide number compared to fresh oil samples. The boundary lubrication properties of these samples were evaluated using a four-ball tester. Increased wear observed with aged oil samples was linked to the destruction of triglyceride structure and formation of peroxides. The difference in the wear properties of soy bean oil to coconut oil was accounted by its high content of unsaturated fatty acids and its susceptibility to undergo oxidation. It was concluded that the coconut oil can perform as a better lubricant and has got a better storage life compared to soy bean oil.

Evaluation of the Queensland Minimum Passing Distance Road Rule

The two-year trial of the Queensland minimum passing distance (MPD) road rule began on 7 April 2014. The rule requires motor vehicles to provide cyclists a minimum lateral passing distance of one metre when overtaking cyclists in a speed zone of 60 km/h or less, and 1.5 metres when the speed limit is greater than 60 km/h. This document summarises the evaluation of the effectiveness of the new rule in terms of its: 1. practical implementation; 2. impact on road users’ attitudes and perceptions; and 3. road safety benefits. The Centre for Accident Research and Road Safety – Queensland (CARRS-Q) developed the evaluation framework (Haworth, Schramm, Kiata-Holland, Vallmuur, Watson & Debnath; 2014) for the Queensland Department of Transport and Main Roads (TMR) and was later commissioned to undertake the evaluation. The evaluation included the following components: • Review of correspondence received by TMR; • Interviews and focus groups with Queensland Police Service (QPS) officers; • Road user survey; • Observational study; and • Crash, injury and infringement data analysis.

Complexity of scheduling for minimum power on a GMAC

Two decision versions of a combinatorial power minimization problem for scheduling in a time-slotted Gaussian multiple-access channel (GMAC) are studied in this paper. If the number of slots per second is a variable, the problem is shown to be NP-complete. If the number of time-slots per second is fixed, an algorithm that terminates in O (Length (I)N+1) steps is provided.

Landau-Zener problem with waiting at the minimum gap and related quench dynamics of a many-body system

We discuss a technique for solving the Landau-Zener (LZ) problem of finding the probability of excitation in a two-level system. The idea of time reversal for the Schrodinger equation is employed to obtain the state reached at the final time and hence the excitation probability. Using this method, which can reproduce the well-known expression for the LZ transition probability, we solve a variant of the LZ problem, which involves waiting at the minimum gap for a time t(w); we find an exact expression for the excitation probability as a function of t(w). We provide numerical results to support our analytical expressions. We then discuss the problem of waiting at the quantum critical point of a many-body system and calculate the residual energy generated by the time-dependent Hamiltonian. Finally, we discuss possible experimental realizations of this work.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Phonetic tone signals quantity and word structure

Many languages exploit suprasegmental devices in signaling word meaning. Tone languages exploit fundamental frequency whereas quantity languages rely on segmental durations to distinguish otherwise similar words. Traditionally, duration and tone have been taken as mutually exclusive. However, some evidence suggests that, in addition to durational cues, phonological quantity is associated with and co-signaled by changes in fundamental frequency in quantity languages such as Finnish, Estonian, and Serbo-Croat. The results from the present experiment show that the structure of disyllabic word stems in Finnish are indeed signaled tonally and that the phonological length of the stressed syllable is further tonally distinguished within the disyllabic sequence. The results further indicate that the observed association of tone and duration in perception is systematically exploited in speech production in Finnish.

Potential functions for hydrogen bond interactions - IV. Minimum Energy Conformation of the α-Helical Structure of PoIy-L-Alanine

Making use of the empirical potential functions for peptide NH .. O bonds, developed in this laboratory, the relative stabilities of the rightand left-handed α-helical structures of poly-L-alanine have been investigated, by calculating their conformational energies (V). The value of Vmin of the right-handed helix (αP) is about - 10.4 kcal/mole, and that of the left-handed helix (αM) is about - 9.6 kcal/mole, showing that the former is lower in energy by 0.8 kcal/mole. The helical parameters of the stable conformation of αP are n ∼ 3.6 and h ∼ 1.5 Å. The hydrogen bond of length 2.85 Å and nonlinearity of about 10° adds about 4.0 kcal/ mole to the stabilising energy of the helix in the minimum enregy region. The energy minimum is not sharply defined, but occurs over a long valley, suggesting that a distribution of conformations (φ{symbol}, ψ) of nearly the same energy may occur for the individual residues in a helix. The experimental data of a-helical fibres of poly-L-alanine are in good agreement with the theoretical results for αP. In the case of proteins, the mean values of (φ{symbol}, ψ) for different helices are distributed, but they invariably occur within the contour for V = Vmin + 2 kcal/mole for αP.

Method for obtaining minimum noise in a general purpose hot wire amplifier

It has been shown that the conventional practice of designing a compensated hot wire amplifier with a fixed ceiling to floor ratio results in considerable and unnecessary increase in noise level at compensation settings other than optimum (which is at the maximum compensation at the highest frequency of interest). The optimum ceiling to floor ratio has been estimated to be between 1.5-2.0 ωmaxM. Application of the above considerations to an amplifier in which the ceiling to floor ratio is optimized at each compensation setting (for a given amplifier band-width), shows the usefulness of the method in improving the signal to noise ratio.

Quantity and tone in Finnish lexically stressed syllables

This paper presents results from a study on the tonal aspects of quantity in Finnish lexically stressed syllables. Fourteen speakers produced a set of 66 utterances where the quantity and structure of the lexically stressed syllable was system- atically varied. The tonal aspects of the syllable nucleus and nucleus and coda in case of closed syllables was stud- ied in the framework of the Target Approximation theory as formulated by Yi Xu. The results show a clear tendency to- wards the quantity distinction and bimoracity in general in Finnish to be signalled tonally by a dynamic falling tone as opposed to a static high tone in short (one mora) nuclei.

Associations between personality traits and sleep quality and quantity in young adults

This thesis examines the associations between personality traits and sleep quantity and quality in young adults. Additionally the possible effects of birth status on these associations are examined. The data used in this thesis is part of a birth cohort study (Helsinki Study of Very Low Birth Weight Adults). The personality traits are based on the five-factor model of personality. The sleep quantity and quality are based on actigraphy assessments. Four hypothesis were made about the personality and sleep associations: (1) neuroticism is related to a lesser quality of sleep, (2) there will be more significant associations between personality traits and sleep quality than between personality traits and sleep quantity, (3) the Very Low Birth Weight (VLBW) as well as, (4) the Small for Gestational Age (SGA) status will affect the associations. Linear regressions were used to study the associations between personality traits and sleep quality and quantity. Whenever an association was significant, it was tested whether this association was moderated first, by the VLBW and second, by the SGA status of the participant. The results were mostly in line with previous research especially demonstrating the negative association between neuroticism and the quality of sleep and suggesting that vulnerability to stress decreases sleep quality. Also it was found that agreeableness and conscientiousness were associated with better sleep quality and extraversion was associated with lower sleep quantity. In addition SGA status moderated the personality and sleep associations. It is proposed that there are two factors behind the interaction. First, prenatally developing mechanisms have an effect on the development of sleep as well as personality. Second, differences in the postnatal environment, for instance the parenting practices, can account for this finding. Future research could focus especially on what kind of prenatal disturbances SGA infants have in the development of mechanisms related to sleep and personality. Also focusing on the differences in parental interaction might shed more light on the results.

Minimum-Decoding-Complexity, maximum-rate Space-Time Block Codes from Clifford algebras

It is well known that Alamouti code and, in general, Space-Time Block Codes (STBCs) from complex orthogonal designs (CODs) are single-symbol decodable/symbolby-symbol decodable (SSD) and are obtainable from unitary matrix representations of Clifford algebras. However, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). In this paper, we obtain SSD codes with unitary weight matrices (but not CON) from matrix representations of Clifford algebras. Moreover, we derive an upper bound on the rate of SSD codes with unitary weight matrices and show that our codes meet this bound. Also, we present conditions on the signal sets which ensure full-diversity and give expressions for the coding gain.

Non-unitary-weight Space-Time Block Codes with Minimum Decoding Complexity

Space-Time Block Codes (STBCs) from Complex Orthogonal Designs (CODs) are single-symbol decodable/symbol-by-symbol decodable (SSD); however, SSD codes are obtainable from designs that are not CODs. Recently, two such classes of SSD codes have been studied: (i) Coordinate Interleaved Orthogonal Designs (CIODs) and (ii) Minimum-Decoding-Complexity (MDC) STBCs from Quasi-ODs (QODs). The class of CIODs have non-unitary weight matrices when written as a Linear Dispersion Code (LDC) proposed by Hassibi and Hochwald, whereas the other class of SSD codes including CODs have unitary weight matrices. In this paper, we construct a large class of SSD codes with nonunitary weight matrices. Also, we show that the class of CIODs is a special class of our construction.

Guessing under source uncertainty with side information

We study the problem of guessing the realization of a finite alphabet source, when some side information is provided, in a setting where the only knowledge the guesser has about the source and the correlated side information is that the joint source is one among a family. We define a notion of redundancy, identify a quantity that measures this redundancy, and study its properties. We then identify good guessing strategies that minimize the supremum redundancy (over the family). The minimum value measures the richness of the uncertainty class.

Minimum enclosing spheres formulations for support vector ordinal regression

We present two new support vector approaches for ordinal regression. These approaches find the concentric spheres with minimum volume that contain most of the training samples. Both approaches guarantee that the radii of the spheres are properly ordered at the optimal solution. The size of the optimization problem is linear in the number of training samples. The popular SMO algorithm is adapted to solve the resulting optimization problem. Numerical experiments on some real-world data sets verify the usefulness of our approaches for data mining.