Cosmological Constant and Scalar Gravitons

If a cosmological term is included in the equations of general relativity, the linearized equations can be interpreted as a tensor-scalar theory of finite-range gravitation. The scalar field cannot be transformed away be a gauge transformation (general co-ordinate transformation) and so must be interpreted as a physically significant degree of freedom. The hypothesis that a massive spin-two meson (mass m2) satisfied equations identical in form to the equations of general relativity leads to the prediction of a massive spin-zero meson (mass m0), the ratio of masses being m0 / m2 = 3*3.

Ternary Barker codes

Certain ternary codes having good autocorrelation properties akin to Barker codes are described.

Taken for granted: Material relations between disability and codes/guidelines

This paper provides a critical examination of the taken for granted nature of the codes/guidelines used towards the creation of designed spaces, their social relations with designers, and their agency in designing for people with disabilities. We conducted case studies at three national museums in Canada where we began by questioning societal representations of disability within and through material culture through the potential of actor-network theory where non-human actors have considerable agency. Specifically, our exploration looks into how representations of disability for designing, are interpreted through mediums such as codes, standards and guidelines. We accomplish this through: deep analyses of the museums’ built environments (outdoors and indoors); interviewed curators, architects and designers involved in the creation of the spaces/displays; completed dialoguing while in motion interviews with people who have disabilities within the spaces; and analyzed available documents relating to the creation of the museums. Through analyses of our rich data set involving the mapping of codes/guidelines in their ‘representation’ of disability and their contributions in ‘fixing’ disability, this paper takes an alternative approach to designing for/with disability by aiming to question societal representations of disability within and through material culture.

Fine mapping of qGW1, a major QTL for grain weight in sorghum

Key message We detected seven QTLs for 100-grain weight in sorghum using an F 2 population, and delimited qGW1 to a 101-kb region on the short arm of chromosome 1, which contained 13 putative genes. Abstract Sorghum is one of the most important cereal crops. Breeding high-yielding sorghum varieties will have a profound impact on global food security. Grain weight is an important component of grain yield. It is a quantitative trait controlled by multiple quantitative trait loci (QTLs); however, the genetic basis of grain weight in sorghum is not well understood. In the present study, using an F2 population derived from a cross between the grain sorghum variety SA2313 (Sorghum bicolor) and the Sudan-grass variety Hiro-1 (S. bicolor), we detected seven QTLs for 100-grain weight. One of them, qGW1, was detected consistently over 2 years and contributed between 20 and 40 % of the phenotypic variation across multiple genetic backgrounds. Using extreme recombinants from a fine-mapping F3 population, we delimited qGW1 to a 101-kb region on the short arm of chromosome 1, containing 13 predicted gene models, one of which was found to be under purifying selection during domestication. However, none of the grain size candidate genes shared sequence similarity with previously cloned grain weight-related genes from rice. This study will facilitate isolation of the gene underlying qGW1 and advance our understanding of the regulatory mechanisms of grain weight. SSR markers linked to the qGW1 locus can be used for improving sorghum grain yield through marker-assisted selection.

Activity recognition using binary tree SVM

This paper presents an effective classification method based on Support Vector Machines (SVM) in the context of activity recognition. Local features that capture both spatial and temporal information in activity videos have made significant progress recently. Efficient and effective features, feature representation and classification plays a crucial role in activity recognition. For classification, SVMs are popularly used because of their simplicity and efficiency; however the common multi-class SVM approaches applied suffer from limitations including having easily confused classes and been computationally inefficient. We propose using a binary tree SVM to address the shortcomings of multi-class SVMs in activity recognition. We proposed constructing a binary tree using Gaussian Mixture Models (GMM), where activities are repeatedly allocated to subnodes until every new created node contains only one activity. Then, for each internal node a separate SVM is learned to classify activities, which significantly reduces the training time and increases the speed of testing compared to popular the `one-against-the-rest' multi-class SVM classifier. Experiments carried out on the challenging and complex Hollywood dataset demonstrates comparable performance over the baseline bag-of-features method.

Class-specific sparse codes for representing activities

In this paper we investigate the effectiveness of class specific sparse codes in the context of discriminative action classification. The bag-of-words representation is widely used in activity recognition to encode features, and although it yields state-of-the art performance with several feature descriptors it still suffers from large quantization errors and reduces the overall performance. Recently proposed sparse representation methods have been shown to effectively represent features as a linear combination of an over complete dictionary by minimizing the reconstruction error. In contrast to most of the sparse representation methods which focus on Sparse-Reconstruction based Classification (SRC), this paper focuses on a discriminative classification using a SVM by constructing class-specific sparse codes for motion and appearance separately. Experimental results demonstrates that separate motion and appearance specific sparse coefficients provide the most effective and discriminative representation for each class compared to a single class-specific sparse coefficients.

Efficient search for statistically significant dependency rules in binary data

Analyzing statistical dependencies is a fundamental problem in all empirical science. Dependencies help us understand causes and effects, create new scientific theories, and invent cures to problems. Nowadays, large amounts of data is available, but efficient computational tools for analyzing the data are missing. In this research, we develop efficient algorithms for a commonly occurring search problem - searching for the statistically most significant dependency rules in binary data. We consider dependency rules of the form X->A or X->not A, where X is a set of positive-valued attributes and A is a single attribute. Such rules describe which factors either increase or decrease the probability of the consequent A. A classical example are genetic and environmental factors, which can either cause or prevent a disease. The emphasis in this research is that the discovered dependencies should be genuine - i.e. they should also hold in future data. This is an important distinction from the traditional association rules, which - in spite of their name and a similar appearance to dependency rules - do not necessarily represent statistical dependencies at all or represent only spurious connections, which occur by chance. Therefore, the principal objective is to search for the rules with statistical significance measures. Another important objective is to search for only non-redundant rules, which express the real causes of dependence, without any occasional extra factors. The extra factors do not add any new information on the dependence, but can only blur it and make it less accurate in future data. The problem is computationally very demanding, because the number of all possible rules increases exponentially with the number of attributes. In addition, neither the statistical dependency nor the statistical significance are monotonic properties, which means that the traditional pruning techniques do not work. As a solution, we first derive the mathematical basis for pruning the search space with any well-behaving statistical significance measures. The mathematical theory is complemented by a new algorithmic invention, which enables an efficient search without any heuristic restrictions. The resulting algorithm can be used to search for both positive and negative dependencies with any commonly used statistical measures, like Fisher's exact test, the chi-squared measure, mutual information, and z scores. According to our experiments, the algorithm is well-scalable, especially with Fisher's exact test. It can easily handle even the densest data sets with 10000-20000 attributes. Still, the results are globally optimal, which is a remarkable improvement over the existing solutions. In practice, this means that the user does not have to worry whether the dependencies hold in future data or if the data still contains better, but undiscovered dependencies.

Optimisation Problems in Wireless Sensor Networks : Local Algorithms and Local Graphs

This thesis studies optimisation problems related to modern large-scale distributed systems, such as wireless sensor networks and wireless ad-hoc networks. The concrete tasks that we use as motivating examples are the following: (i) maximising the lifetime of a battery-powered wireless sensor network, (ii) maximising the capacity of a wireless communication network, and (iii) minimising the number of sensors in a surveillance application. A sensor node consumes energy both when it is transmitting or forwarding data, and when it is performing measurements. Hence task (i), lifetime maximisation, can be approached from two different perspectives. First, we can seek for optimal data flows that make the most out of the energy resources available in the network; such optimisation problems are examples of so-called max-min linear programs. Second, we can conserve energy by putting redundant sensors into sleep mode; we arrive at the sleep scheduling problem, in which the objective is to find an optimal schedule that determines when each sensor node is asleep and when it is awake. In a wireless network simultaneous radio transmissions may interfere with each other. Task (ii), capacity maximisation, therefore gives rise to another scheduling problem, the activity scheduling problem, in which the objective is to find a minimum-length conflict-free schedule that satisfies the data transmission requirements of all wireless communication links. Task (iii), minimising the number of sensors, is related to the classical graph problem of finding a minimum dominating set. However, if we are not only interested in detecting an intruder but also locating the intruder, it is not sufficient to solve the dominating set problem; formulations such as minimum-size identifying codes and locating dominating codes are more appropriate. This thesis presents approximation algorithms for each of these optimisation problems, i.e., for max-min linear programs, sleep scheduling, activity scheduling, identifying codes, and locating dominating codes. Two complementary approaches are taken. The main focus is on local algorithms, which are constant-time distributed algorithms. The contributions include local approximation algorithms for max-min linear programs, sleep scheduling, and activity scheduling. In the case of max-min linear programs, tight upper and lower bounds are proved for the best possible approximation ratio that can be achieved by any local algorithm. The second approach is the study of centralised polynomial-time algorithms in local graphs these are geometric graphs whose structure exhibits spatial locality. Among other contributions, it is shown that while identifying codes and locating dominating codes are hard to approximate in general graphs, they admit a polynomial-time approximation scheme in local graphs.

Measurement of dielectric constant of conducting liquids

A ratio transformer method suitable for the measurement of the dielectric constant of highly conducting liquids is described. The resistance between the two plates of the capacitor can be as low as 2 k Omega . In this method variations in this low resistance will not give any error in capacitance measurement. One of the features of this method is the simplicity in balancing the resistance, using a LDR (light dependent resistor), without influencing the independent capacitance measurement. The ratio transformer enables the ground capacitances to be eliminated. The change in leakage inductance of the ratio transformer while changing the ratios is also taken into account. The capacitance of a dielectric cell of the order of 50 pF can be measured from 1000 Hz to 100 kHz with a resolution of 0.06 pF. The electrode polarisation problem is also discussed.

The new binary pulsar and the observation of gravitational spin precession

The possibility of observing gravitational spin precession due to spin-orbit coupling in a binary pulsar system is considered. An analysis is presented which can aid in delineating the relevant physical effects from pulse-structure data. In this analysis, it is assumed that the pulsar radiation emanates from a cone whose axis is tilted with respect to the axis of rotation. It is found that the time-averaged pulse width and polarization sweep vary periodically with time and that this variation has a periodicity of the order of the spin-precession frequency averaged over a complete revolution. It is concluded that for an orbital period of about 180 years, it suffices to measure polarization data with an accuracy of a few parts in 100 over a period of six months to a year in order to uncover the effects of spin precession. The consistency of the analysis is checked, and the calculations are applied to a recently discovered binary pulsar.

Quantization noise in binary holograms

The signal-to-noise (S/N) ratio in the reconstructed image from a binary hologram has been quantitatively related to the amplitude and phase quantization levels. The S/N ratio increases monotonically with increasing number of quantization levels. This observation is further supported by experimental results.

Systematic search for optical Barker codes with minimum length

A method that yields optical Barker codes of smallest known lengths for given discrimination is described.

Critical Exponent β and Rectilinear Diameter of the Binary-Liquid System Carbon Disulfide + Nitromethane

The system CS2 + CH3NO2 shows β=0.315±0.004 over 10-6<ε=|T-Tc| / Tc<2�10-1 with no indication of a classical value ½ even far away from Tc. The diameter shows a curvature and is of the form �c+b ε+fε7 / 8exp(-gεh).