Pyktree : a K-tree implementation in Python

In this paper we present pyktree, an implementation of the K-tree algorithm in the Python programming language. The K-tree algorithm provides highly balanced search trees for vector quantization that scales up to very large data sets. Pyktree is highly modular and well suited for rapid-prototyping of novel distance measures and centroid representations. It is easy to install and provides a python package for library use as well as command line tools.

PCR bias Toward the wild-type k-ras and p53 sequences: Implications for PCR detection of mutations and cancer diagnosis

PCR-based cancer diagnosis requires detection of rare mutations in k- ras, p53 or other genes. The assumption has been that mutant and wild-type sequences amplify with near equal efficiency, so that they are eventually present in proportions representative of the starting material. Work on factor IX suggests that this assumption is invalid for one case of near- sequence identity. To test the generality of this phenomenon and its relevance to cancer diagnosis, primers distant from point mutations in p53 and k-ras were used to amplify wild-type and mutant sequences from these genes. A substantial bias against PCR amplification of mutants was observed for two regions of the p53 gene and one region of k-ras. For k-ras and p53, bias was observed when the wild-type and mutant sequences were amplified separately or when mixed in equal proportions before PCR. Bias was present with proofreading and non-proofreading polymerase. Mutant and wild-type segments of the factor V, cystic fibrosis transmembrane conductance regulator and prothrombin genes were amplified and did not exhibit PCR bias. Therefore, the assumption of equal PCR efficiency for point mutant and wild-type sequences is invalid in several systems. Quantitative or diagnostic PCR will require validation for each locus, and enrichment strategies may be needed to optimize detection of mutants.

Are the ‘cave’ minerals archerite (K,NH4)H2PO4 and biphosphammite (K,NH4)H2PO4 identical? A molecular structural study

The molecular structure of the mineral archerite ((K,NH4)H2PO4) has been determined and compared with that of biphosphammite ((NH4,K)H2PO4). Raman spectroscopy and infrared spectroscopy has been used to characterise these ‘cave’ minerals. Both minerals originated from the Murra-el-elevyn Cave, Eucla, Western Australia. The mineral is formed by the reaction of the chemicals in bat guano with calcite substrates. Raman and infrared bands are assigned to H2PO4-, OH and NH stretching vibrations. The Raman band at 981 cm-1 is assigned to the HOP stretching vibration. Bands in the 1200 to 1800 cm-1 region are associated with NH4+ bending modes. The molecular structure of the two minerals appear to be very similar, and it is therefore concluded that the two minerals are identical.

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d = VC(F) bound on the graph density of a subgraph of the hypercube—oneinclusion graph. The first main result of this paper is a density bound of n [n−1 <=d-1]/[n <=d] < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d contractible simplicial complexes, extending the well-known characterization that d = 1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VCdimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(logn) and is shown to be optimal up to an O(logk) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout.

Shifting : one-inclusion mistake bounds and sample compression

We present new expected risk bounds for binary and multiclass prediction, and resolve several recent conjectures on sample compressibility due to Kuzmin and Warmuth. By exploiting the combinatorial structure of concept class F, Haussler et al. achieved a VC(F)/n bound for the natural one-inclusion prediction strategy. The key step in their proof is a d=VC(F) bound on the graph density of a subgraph of the hypercube—one-inclusion graph. The first main result of this report is a density bound of n∙choose(n-1,≤d-1)/choose(n,≤d) < d, which positively resolves a conjecture of Kuzmin and Warmuth relating to their unlabeled Peeling compression scheme and also leads to an improved one-inclusion mistake bound. The proof uses a new form of VC-invariant shifting and a group-theoretic symmetrization. Our second main result is an algebraic topological property of maximum classes of VC-dimension d as being d-contractible simplicial complexes, extending the well-known characterization that d=1 maximum classes are trees. We negatively resolve a minimum degree conjecture of Kuzmin and Warmuth—the second part to a conjectured proof of correctness for Peeling—that every class has one-inclusion minimum degree at most its VC-dimension. Our final main result is a k-class analogue of the d/n mistake bound, replacing the VC-dimension by the Pollard pseudo-dimension and the one-inclusion strategy by its natural hypergraph generalization. This result improves on known PAC-based expected risk bounds by a factor of O(log n) and is shown to be optimal up to a O(log k) factor. The combinatorial technique of shifting takes a central role in understanding the one-inclusion (hyper)graph and is a running theme throughout

The undirected feedback vertex set problem has a Poly(k) Kernel

Resolving a noted open problem, we show that the Undirected Feedback Vertex Set problem, parameterized by the size of the solution set of vertices, is in the parameterized complexity class Poly(k), that is, polynomial-time pre-processing is sufficient to reduce an initial problem instance (G, k) to a decision-equivalent simplified instance (G', k') where k' � k, and the number of vertices of G' is bounded by a polynomial function of k. Our main result shows an O(k11) kernelization bound.

Vibrational spectroscopic analysis of taranakite (K,NH4)Al3(PO4)3(OH) •9(H2O) from the Jenolan Caves, Australia

Many phosphate containing minerals are found in the Jenolan Caves. Such minerals are formed by the reaction of bat guano and clays from the caves. Among these cave minerals is the mineral taranakite (K,NH4)Al3(PO4)3(OH)•9(H2O) which has been identified by X-ray diffraction. Jenolan Caves taranakite has been characterised by Raman spectroscopy. Raman and infrared bands are assigned to H2PO4-, OH and NH stretching vibrations. By using a combination of XRD and Raman spectroscopy, the existence of taranakite in the caves has been proven.

Classifying the user intent of web queries using k-means clustering

Purpose: Web search engines are frequently used by people to locate information on the Internet. However, not all queries have an informational goal. Instead of information, some people may be looking for specific web sites or may wish to conduct transactions with web services. This paper aims to focus on automatically classifying the different user intents behind web queries. Design/methodology/approach: For the research reported in this paper, 130,000 web search engine queries are categorized as informational, navigational, or transactional using a k-means clustering approach based on a variety of query traits. Findings: The research findings show that more than 75 percent of web queries (clustered into eight classifications) are informational in nature, with about 12 percent each for navigational and transactional. Results also show that web queries fall into eight clusters, six primarily informational, and one each of primarily transactional and navigational. Research limitations/implications: This study provides an important contribution to web search literature because it provides information about the goals of searchers and a method for automatically classifying the intents of the user queries. Automatic classification of user intent can lead to improved web search engines by tailoring results to specific user needs. Practical implications: The paper discusses how web search engines can use automatically classified user queries to provide more targeted and relevant results in web searching by implementing a real time classification method as presented in this research. Originality/value: This research investigates a new application of a method for automatically classifying the intent of user queries. There has been limited research to date on automatically classifying the user intent of web queries, even though the pay-off for web search engines can be quite beneficial. © Emerald Group Publishing Limited.

Stepping stones : student journal : year K

"ORIGO Stepping Stones gives mathematics teachers the best of both worlds by delivering lessons and teacher guides on a digital platform blended with the more traditional printed student journals." -- Publisher website

Stepping stones : teacher lesson plans : year K

"ORIGO Stepping Stones gives mathematics teachers the best of both worlds by delivering lessons and teacher guides on a digital platform blended with the more traditional printed student journals." -- Publisher website

Topological map induction using neighbourhood information of places

In topological mapping, perceptual aliasing can cause different places to appear indistinguishable to the robot. In case of severely corrupted or non-available odometry information, topological mapping is difficult as the robot is challenged with the loop-closing problem; that is to determine whether it has visited a particular place before. In this article we propose to use neighbourhood information to disambiguate otherwise indistinguishable places. Using neighbourhood information for place disambiguation is an approach that neither depends on a specific choice of sensors nor requires geometric information such as odometry. Local neighbourhood information is extracted from a sequence of observations of visited places. In experiments using either sonar or visual observations from an indoor environment the benefits of using neighbourhood clues for the disambiguation of otherwise identical vertices are demonstrated. Over 90% of the maps we obtain are isomorphic with the ground truth. The choice of the robot’s sensors does not impact the results of the experiments much.

Using incomplete online metric maps for topological exploration with the Gap Navigation Tree

This paper presents a general, global approach to the problem of robot exploration, utilizing a topological data structure to guide an underlying Simultaneous Localization and Mapping (SLAM) process. A Gap Navigation Tree (GNT) is used to motivate global target selection and occluded regions of the environment (called “gaps”) are tracked probabilistically. The process of map construction and the motion of the vehicle alters both the shape and location of these regions. The use of online mapping is shown to reduce the difficulties in implementing the GNT.

Vibrational spectroscopy of synthetic archerite (K,NH4)H2PO4 : and in comparison with the natural cave mineral

In order to mimic the formation of archerite in cave minerals, the mineral analogue has been synthesised. The cave mineral is formed by the reaction of the chemicals in bat guano with calcite substrates. X-ray diffraction proves that the synthesised archerite analogue was pure. The vibrational spectra of the synthesised mineral are compared with that of the natural cave mineral. Raman and infrared bands are assigned to H2PO4-, OH and NH stretching and bending vibrations. The Raman band at 917 cm-1 is assigned to the HOP stretching vibration of the H2PO4- units. Bands in the 1200 to 1800 cm-1 region are associated with NH4+ bending modes. Vibrational spectroscopy enables the molecular structure of archerite to be analysed.

Use of a zeolite synthesised from alkali treated kaolin as a K fertiliser : glasshouse experiments on leaching and uptake of K by wheat plants in sandy soil

Zeolite N, a zeolite referred to in earlier publications as MesoLite, is made by caustic reaction of kaolin at temperatures between 80 °C and 95 °C. This material has a very high cation exchange capacity (CEC ≈ 500 meq/100 g). Soil column leaching experiments have shown that K-zeolite N additions greatly reduce leaching of NH4+ fertilisers but the agronomic effectiveness of the retained K+ and NH4+ is unknown. To measure the bioavailability of K in this zeolite, wheat was grown in a glasshouse with K-zeolite N as the K fertiliser in highly-leached and non-leached pots for four weeks and compared with a soluble K fertiliser (KCl). The plants grown in non-leached pots and fertilised with K-zeolite N were slightly larger than those grown with KCl. The elemental compositions in the plants were similar except for Si being significantly more concentrated in the plants supplied with K-zeolite N. Thus K-zeolite N may be an effective K-fertiliser. Plants grown in highly-leached pots were significantly smaller than those grown in non-leached pots. Plants grown in highly-leached pots were severely K deficient as half of the K from both KCl and K-zeolite N was leached from the pots within three days.