MDSM: microarray database schema matching using the Hungarian method

Current microarray databases use different terminologies and structures and thereby limit the sharing of data and collating of results between laboratories. Consequently, an effective integrated microarray data model is required. One important process to develop such an integrated database is schema matching. In this paper, we propose an effective schema matching approach called MDSM, to syntactically and semantically map attributes of different microarray schemas. The contribution from this work will be used later to create microarray global schemas. Since microarray data is complex, we use microarray ontology to improve the measuring accuracy of the similarity between attributes. The similarity relations can be represented as weighted bipartite graphs. We determine the best schema matching by computing the optimal matching in a bipartite graph using the Hungarian optimisation method. Experimental results show that our schema matching approach is effective and flexible to use in different kinds of database models such as; database schema, XML schema, and web site map. Finally, a case study on an existing public microarray schema is carried out using the proposed method.

Groups, graphs and mutually unbiased bases

A new characteristic free approach to constructing large sets of mutually unbiased bases in Hilbert space is developed. We associate with a seed set of bases a finite subgroup of which defines a strongly regular graph. Large sets of mutually unbiased bases are obtained as the cliques of the graph.

Clock synchronization state graphs based on clock precision difference

Consistent and stable global states of clock synchronization are very important in distributed and parallel systems. This paper presents an innovative strategy and method to obtain stable global clock synchronization state graphs in asynchronous Internet environments. Our model will introduce the concept of clock precision difference as a means to evaluate running states of all clocks in this system and make this system  self-adaptive well. Finally, we introduce the concept of clock precision difference into global states analysis of clock synchronization and construct clock synchronization state graphs in order to evaluate distributed clock synchronization states. We also present detailed simulations of the strategy and mathematical analysis used on real Internet environments.

Intersection and partition graphs

This thesis reviews previous work done on both general partition graphs and existential partition graphs, which are a generalised form of general partition graphs, and extends some of the results.

Maximum-likelihood based estimation for Q-ball imaging using diffusion-weighted MRI data

Q-ball imaging has been presented to reconstruct diffusion orientation distribution function using diffusion weighted MRI. In this thesiis, we present a novel and robust approach to satisfy the smoothness constraint required in Q-ball imaging. Moreover, we developed an improved estimator based on the actual distribution of the MR data.

Assessment of spatiotemporal varying relationships between rainfall, land cover and surface water area using geographically weighted regression

Traditional regression techniques such as ordinary least squares (OLS) are often unable to accurately model spatially varying data and may ignore or hide local variations in model coefficients. A relatively new technique, geographically weighted regression (GWR) has been shown to greatly improve model performance compared to OLS in terms of higher R 2 and lower corrected Akaike information criterion (AICC). GWR models have the potential to improve reliabilities of the identified relationships by reducing spatial autocorrelations and by accounting for local variations and spatial non-stationarity between dependent and independent variables. In this study, GWR was used to examine the relationship between land cover, rainfall and surface water habitat in 149 sub-catchments in a predominately agricultural region covering 2.6 million ha in southeast Australia. The application of the GWR models revealed that the relationships between land cover, rainfall and surface water habitat display significant spatial non-stationarity. GWR showed improvements over analogous OLS models in terms of higher R 2 and lower AICC. The increased explanatory power of GWR was confirmed by the results of an approximate likelihood ratio test, which showed statistically significant improvements over analogous OLS models. The models suggest that the amount of surface water area in the landscape is related to anthropogenic drainage practices enhancing runoff to facilitate intensive agriculture and increased plantation forestry. However, with some key variables not present in our analysis, the strength of this relationship could not be qualified. GWR techniques have the potential to serve as a useful tool for environmental research and management across a broad range of scales for the investigation of spatially varying relationships.

Malware variant detection using similarity search over sets of control flow graphs

Static detection of polymorphic malware variants plays an important role to improve system security. Control flow has shown to be an effective characteristic that represents polymorphic malware instances. In our research, we propose a similarity search of malware using novel distance metrics of malware signatures. We describe a malware signature by the set of control flow graphs the malware contains. We propose two approaches and use the first to perform pre-filtering. Firstly, we use a distance metric based on the distance between feature vectors. The feature vector is a decomposition of the set of graphs into either fixed size k-sub graphs, or q-gram strings of the high-level source after decompilation. We also propose a more effective but less computationally efficient distance metric based on the minimum matching distance. The minimum matching distance uses the string edit distances between programs' decompiled flow graphs, and the linear sum assignment problem to construct a minimum sum weight matching between two sets of graphs. We implement the distance metrics in a complete malware variant detection system. The evaluation shows that our approach is highly effective in terms of a limited false positive rate and our system detects more malware variants when compared to the detection rates of other algorithms.

Induced ordered weighted averaging operators

Since the introduction of the ordered weighted averaging operator [18], the OWA has received great attention with applications in fields including decision making, recommender systems [8, 21], classification [10] and data mining [16] among others. The most important step in the calculation of the OWA is the permutation of the input vector according to the size of its arguments. In some applications, it makes sense that the inputs be reordered by values different to those used in calculation. For instance, if we have a number of mobile sensor readings, we may wish to allocate more importance to the reading taken from the sensor closest to us at a given point in time, rather than the largest reading.

The L(2,1)-labelling problem for cubic Cayley graphs on dihedral groups

A k-L(2,1)-labelling of a graph G is a mapping f:V(G)→{0,1,2,…,k} such that |f(u)−f(v)|≥2 if uv∈E(G) and f(u)≠f(v) if u,v are distance two apart. The smallest positive integer k such that G admits a k-L(2,1)-labelling is called the λ-number of G. In this paper we study this quantity for cubic Cayley graphs (other than the prism graphs) on dihedral groups, which are called brick product graphs or honeycomb toroidal graphs. We prove that the λ-number of such a graph is between 5 and 7, and moreover we give a characterisation of such graphs with λ-number 5.

A weighted version of the Melbourne low-vision ADL index : a measure of disability impact

Objective. To develop a version of the Melbourne Low-Vision ADL Index that measures the personal impact of disability in activities of daily living (ADL's). Also, to determine the relationship between clinical measures of vision impairment and disability impact.

Methods. The Melbourne Low-Vision ADL Index (MLVAI) is a desk-based clinical assessment of disability in ADL's. Ability to perform each item is rated on a five-level descriptive scale from zero to four. In this study, the original version of the MLVAI was modified to measure disability impact. The simple modification involved weighting each item by the importance of that item to the person being tested. Importance was also rated on a five-level scale from zero to four. The validity and reliability of the Weighted Melbourne Low-Vision ADL Index (MLVAIW) was determined for 97 vision-impaired subjects in a cross-sectional study.

Results. Cronbach's alpha coefficient indicated an internal reliability of 0.94, and an intraclass correlation coefficient indicated an overall reliability of 0.88. The standard error of measurement was 24.7 points (out of a possible score of 400). There was a statistically significant difference in test scores between normal subjects and vision-impaired subjects. All vision measures had a high, statistically significant correlation with MLVAIW score. Near-word acuity had the strongest correlation (rs = 0.78, p < 0.001), followed by Melbourne Edge Test contrast sensitivity (rs = -0.72, p < 0.001). Visual field had the weakest correlation (rs = -0.52, p < 0.001). The best predictive model of MLVAIW score incorporated the variables age, near-word acuity, and visual field. Together, these variables accounted for 65.1% of the variance in MLVAIW score.

Conclusions. The MLVAI is highly valid and reliable when weighted by a scale that reflects the personal importance of ADL's. The MLVAIW can provide information over and above that obtained with the usual clinical vision measures and may be used to assess low-vision patients and to measure low-vision rehabilitation outcomes. It is suggested that the assessment of disability using the original MLVAI and the assessment of the impact of disability using the MLVAIW should be kept separate to facilitate the clear interpretation of the outcomes of low-vision rehabilitation.

An amoeboid algorithm for shortest path in fuzzy weighted networks

Taking the uncertainty existing in edge weights of networks into consideration, finding shortest path in such fuzzy weighted networks has been widely studied in various practical applications. In this paper, an amoeboid algorithm is proposed, combing fuzzy sets theory with a path finding model inspired by an amoeboid organism, Physarum polycephalum. With the help of fuzzy numbers, uncertainty is well represented and handled in our algorithm. What's more, biological intelligence of Physarum polycephalum has been incorporate into the algorithm. A numerical example on a transportation network is demonstrated to show the efficiency and flexibility of our proposed amoeboid algorithm.