eLearning content authentication using bipartite matching

Content authenticity and correctness is one of the important challenges in eLearning as there can be many solutions for one specific problem in the cyber space. Therefore, we feel the necessity of mapping problem to solutions using graph partition and weighted bipartite matching. This paper presents a novel architecture and methodology for a personal eLearning system called PELS that is developed by us. We also present an efficient algorithm to partition question-answer (QA) space and explore best possible solution to a particular problem. Our approach can be efficiently applied to social eLearning space where there is one-to-many and many-to-many relationship with a level of bonding. The main advantage of our approach is that we use QA ranking by adjusted edge weights provided by subject matter experts (SME) or expert database. Finally, we use statistical methods called confidence interval and hypothesis test on the data to check the reliability and dependability of the quality of results.

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.

Interacting amino acid preferences of 3D pattern pairs at the binding sites of transient and obligate protein complexes

To assess the physico-chemical characteristics of protein-protein interactions, protein sequences and overall structural folds have been analyzed previously. To highlight this, discovery and examination of amino acid patterns at the binding sites defined by structural proximity in 3-dimensional (3D) space are essential. In this paper, we investigate the interacting preferences of 3D pattern pairs discovered separately in transient and obligate protein complexes. These 3D pattern pairs are not necessarily sequence-consecutive, but each residue in two groups of amino acids from two proteins in a complex is within certain °A threshold to most residues in the other group. We develop an algorithm called AA-pairs by which every pair of interacting proteins is represented as a bipartite graph, and it discovers all maximal quasi-bicliques from every bipartite graph to form our 3D pattern pairs. From 112 and 2533 highly conserved 3D pattern pairs discovered in the transient and obligate complexes respectively, we observe that Ala and Leu is the highest occuring amino acid in interacting 3D patterns of transient (20.91%) and obligate (33.82%) complexes respectively. From the study on the dipeptide composition on each side of interacting 3D pattern pairs, dipeptides Ala-Ala and Ala-Leu are popular in 3D patterns of both transient and obligate complexes. The interactions between amino acids with large hydrophobicity difference are present more in the transient than in the obligate complexes. On contrary, in obligate complexes, interactions between hydrophobic residues account for the top 5 most occuring amino acid pairings.

On animal distributions in dynamic landscapes

Few landscapes are static and patterns of resource distribution can vary markedly in time and space. Patterns of movement and dispersal in response to environmental change are equally diverse and occur on a broad range of temporal scales. For patterns of movement and dispersal that vary spatially and temporally throughout the life-time of an individual, the concepts of home range and geographic range alone do not adequately describe the observed patterns of distribution of individuals, populations or species. Here we further simplify Gauthreaux (1982) classification of movement types into a simple bipartite system and link movements (or lack thereof) to a similarly simple classification of ranges. In addition, we introduce two new indices that describe the relationship of an individual's life-time movements to its distribution as described by home and geographic range. Our interest in this subject arose from endeavouring to interpret local changes in waterbird abundance in the arid interior of the Australian continent and to understand these changes in relation to patterns of resource distribution and movement. In this discussion we focus on terrestrial vertebrates capable of multiple breeding events throughout an extended life-time.

An application of novel clustering technique for information security

This article presents experimental results devoted to a new application of the novel clustering technique introduced by the authors recently. Our aim is to facilitate the application of robust and stable consensus functions in information security, where it is often necessary to process large data sets and monitor outcomes in real time, as it is required, for example, for intrusion detection. Here we concentrate on the particular case of application to profiling of phishing websites. First, we apply several independent clustering algorithms to a randomized sample of data to obtain independent initial clusterings. Silhouette index is used to determine the number of clusters. Second, we use a consensus function to combine these independent clusterings into one consensus clustering . Feature ranking is used to select a subset of features for the consensus function. Third, we train fast supervised classification algorithms on the resulting consensus clustering in order to enable them to process the whole large data set as well as new data. The precision and recall of classifiers at the final stage of this scheme are critical for effectiveness of the whole procedure. We investigated various combinations of three consensus functions, Cluster-Based Graph Formulation (CBGF), Hybrid Bipartite Graph Formulation (HBGF), and Instance-Based Graph Formulation (IBGF) and a variety of supervised classification algorithms. The best precision and recall have been obtained by the combination of the HBGF consensus function and the SMO classifier with the polynomial kernel.

An efficient algorithm for partitioning and authenticating problem-solutions of elearning contents

Content authenticity and correctness is one of the important challenges in eLearning as there can be many solutions to one specific problem in cyber space. Therefore, the authors feel it is necessary to map problems to solutions using graph partition and weighted bipartite matching. This article proposes an efficient algorithm to partition question-answer (QA) space and explores the best possible solution to a particular problem. The approach described can be efficiently applied to social eLearning space where there are one-to-many and many-to-many relationships with a level of bonding. The main advantage of this approach is that it uses QA ranking by adjusted edge weights provided by subject-matter experts or the authors' expert database.

A framework for mobile elearning (mLearning) with analytical decision model

Mobile eLearning (mLearning) can create a revolution in eLearning with the popularity of smart mobile devices and Application. However, contents are the king to make this revolution happen. Moreover, for an effective mLearning system, analytical aspects such as, quality of contents, quality of results, performance of learners, needs to be addressed. This paper presents a framework for personal mLearning. In this paper, we have used graph-based model called bipartite graph for content authentication and identification of the quality of results. Furthermore, we have used statistical estimation process for trustworthiness of weights in the bipartite graph using confidence interval and hypothesis test as analytical decision model tool.

Graph-induced restricted Boltzmann machines for document modeling

Discovering knowledge from unstructured texts is a central theme in data mining and machine learning. We focus on fast discovery of thematic structures from a corpus. Our approach is based on a versatile probabilistic formulation – the restricted Boltzmann machine (RBM) –where the underlying graphical model is an undirected bipartite graph. Inference is efficient document representation can be computed with a single matrix projection, making RBMs suitable for massive text corpora available today. Standard RBMs, however, operate on bag-of-words assumption, ignoring the inherent underlying relational structures among words. This results in less coherent word thematic grouping. We introduce graph-based regularization schemes that exploit the linguistic structures, which in turn can be constructed from either corpus statistics or domain knowledge. We demonstrate that the proposed technique improves the group coherence, facilitates visualization, provides means for estimation of intrinsic dimensionality, reduces overfitting, and possibly leads to better classification accuracy.

A survey on quantum computing with main focus on the methods of implementation and commercialization gaps

This research focuses on surveying in an attractive field of quantum computing. The paper begins by highlighting a brief history of quantum mechanics. Major elements of quantum computing such as quantum superposition, quantum tunnelling and qubits are addressed at next from a physics perspective. In addition, various methods and applications of quantum physics are also examined. This paper discusses the power and efficiencies that a quantum computer provides and the basis for these claims. Furthermore, the level of research in quantum computing and it’s commercial markets assays to find out the major contributions and developments in the field of quantum computing. The top two leading organisations in quantum computing are picked and reviewed with their up to date contributions. This paper expresses the methods and techniques which are being used by these two organisations to implement a quantum processor and the level of success that has been achieved. This research attempts to log the challenges and limitations that these organisations face in the development of quantum computing. Finally, the research compares quantum model with classical computing model.