A Geometric Algorithm for Learning Oblique Decision Trees

In this paper we present a novel algorithm for learning oblique decision trees. Most of the current decision tree algorithms rely on impurity measures to assess goodness of hyperplanes at each node. These impurity measures do not properly capture the geometric structures in the data. Motivated by this, our algorithm uses a strategy, based on some recent variants of SVM, to assess the hyperplanes in such a way that the geometric structure in the data is taken into account. We show through empirical studies that our method is effective.

Primary Structural Documentation of the Major Urinary Protein of the Indian Commensal Rat (Rattus rattus) Using a Proteomics Platform

Purpose: A number of proteome studies have been performed recently to identify pheromone-related protein expression and their molecular function using genetically modified rodents' urine. However, no such studies have used Indian commensal rodents; interestingly, in a previous investigation, we confirmed the presence of volatile molecules in commensal rodents urine and these molecules seem to be actively involved in pheromonal communication. Therefore, the present study aims to identify the major urinary protein [MUP] present in commensal rat urine, which will help us to understand the protein's expression pattern and intrinsic properties among the rodents globally. Experimental Design: Initially, the total urinary proteins were separated by 1-D and 2-D electrophoresis and then subsequently analyzed by Matrix Assisted Laser Desorption Ionization-Time of Flight and Mass Spectrometer (MALDI-TOF/MS). Furthermore, they were then fragmented with the aid of a Tandem Mass Spectrometer (TOF/TOF) and the identified sequences aligned and confirmed using similarity with the deduced primary structures of members of the lipocalin superfamily.Results: The SDS-PAGE protein profiles showed distinct proteins with molecular masses of 15, 22.4, 25, 28, 42, 50, 55, 68, and 91 kDa. Of these proteins, the 22.4 kDa protein was considered to be target candidate. When 2D electrophoresis was carried out, about similar to 50 spots were detected with different masses and various pI ranges. The 22.4 kDa protein was found to have a pI of about 4.9. This 22.4 kDa protein spot was digested and subjected to mass spectrometry; it was identified as rat MUP. The fragmented peptides from the rat MUP at 935, 1026, 1192, and 1303 m/z were further fragmented with the aid of MS/MS and generated de novo sequence and this confirmed this protein to be the MUP present in the urine of commensal rats.Conclusion: The present investigation confirms the presence of MUP with a molecular mass of 22.4 kDa in the urine of commensal rats. This protein may be involved in the binding of volatile molecules and opens up a discussion about how volatile and non-volatile molecules in the commensal rats' urine may contribute chemo-communication.

Adhesively-bonded Patch Repair with Composites

Adhesively-bonded composite patch repairs over cracked or corrosion-damaged metallic aircraft structures have shown great promise for extending life of ageing structures. This study presents the numerical investigation into the interface behaviour of adhesively-bonded cracked aluminum alloy substrate patched with fibre-reinforced composite material. The adhesive is modelled as an elasto-plastic bilinear material to characterise the debond behaviour, while the defective substrate is regarded as linear elastic continuum. Two typical patch shapes were selected based on information available in the literature. Geometric and material nonlinear analyses for square and octagonal patches were performed to capture peel and shear stresses developed between the substrate and the patch to examine the possibility of interface delamination/debonding. Parametric studies on adhesive thickness and patch thickness were carried out to predict their infuence on damage tolerance of repaired structures.

Geometric quantum computation using fictitious spin-1/2 subspaces of strongly dipolar coupled nuclear spins

Geometric phases have been used in NMR to implement controlled phase shift gates for quantum-information processing, only in weakly coupled systems in which the individual spins can be identified as qubits. In this work, we implement controlled phase shift gates in strongly coupled systems by using nonadiabatic geometric phases, obtained by evolving the magnetization of fictitious spin-1/2 subspaces, over a closed loop on the Bloch sphere. The dynamical phase accumulated during the evolution of the subspaces is refocused by a spin echo pulse sequence and by setting the delay of transition selective pulses such that the evolution under the homonuclear coupling makes a complete 2 pi rotation. A detailed theoretical explanation of nonadiabatic geometric phases in NMR is given by using single transition operators. Controlled phase shift gates, two qubit Deutsch-Jozsa algorithm, and parity algorithm in a qubit-qutrit system have been implemented in various strongly dipolar coupled systems obtained by orienting the molecules in liquid crystal media.

Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs

Let n points be placed independently in d-dimensional space according to the density f(x) = A(d)e(-lambda parallel to x parallel to alpha), lambda, alpha > 0, x is an element of R-d, d >= 2. Let d(n) be the longest edge length of the nearest-neighbor graph on these points. We show that (lambda(-1) log n)(1-1/alpha) d(n) - b(n) converges weakly to the Gumbel distribution, where b(n) similar to ((d - 1)/lambda alpha) log log n. We also prove the following strong law for the normalized nearest-neighbor distance (d) over tilde (n) = (lambda(-1) log n)(1-1/alpha) d(n)/log log n: (d - 1)/alpha lambda <= lim inf(n ->infinity) (d) over tilde (n) <= lim sup(n ->infinity) (d) over tilde (n) <= d/alpha lambda almost surely. Thus, the exponential rate of decay alpha = 1 is critical, in the sense that, for alpha > 1, d(n) -> 0, whereas, for alpha <= 1, d(n) -> infinity almost surely as n -> infinity.

Geometric Characterizations for Patterson-Sullivan Measures of Geometrically Finite Kleinian Groups

The main results of this thesis show that a Patterson-Sullivan measure of a non-elementary geometrically finite Kleinian group can always be characterized using geometric covering and packing constructions. This means that if the standard covering and packing constructions are modified in a suitable way, one can use either one of them to construct a geometric measure which is identical to the Patterson-Sullivan measure. The main results generalize and modify results of D. Sullivan which show that one can sometimes use the standard covering construction to construct a suitable geometric measure and sometimes the standard packing construction. Sullivan has shown also that neither or both of the standard constructions can be used to construct the geometric measure in some situations. The main modifications of the standard constructions are based on certain geometric properties of limit sets of Kleinian groups studied first by P. Tukia. These geometric properties describe how closely the limit set of a given Kleinian group resembles euclidean planes or spheres of varying dimension on small scales. The main idea is to express these geometric properties in a quantitative form which can be incorporated into the gauge functions used in the modified covering and packing constructions. Certain estimation results for general conformal measures of Kleinian groups play a crucial role in the proofs of the main results. These estimation results are generalizations and modifications of similar results considered, among others, by B. Stratmann, D. Sullivan, P. Tukia and S. Velani. The modified constructions are in general defined without reference to Kleinian groups, so they or their variants may prove useful in some other contexts in addition to that of Kleinian groups.

Ground state geometric distortions Image distal substituent effects in determining the β-facial selectivity in 7-norbornenones

The X-ray structure of Image and MNDO optimized geometries of related 7-norbornenone derivatives show a clear tilt of the carbonyl bridge away from the C=C double bond. The preferred reduction from the more hindered face of the diester reveals the electron/electrostatic origin of π - facial selectivity in these systems. X-ray structure and MNDO calculations reveal the dominance of electronic effects in determining the π-facial selectivity in 4a.

Flat connections, geometric invariants and the symplectic nature of the fundamental group of surfaces

In this paper we associate a new geometric invariant to the space of fiat connections on a G (= SU(2))-bundle on a compact Riemann surface M and relate it tcr the symplectic structure on the space Hom(pi(1)(M), G)/G consisting of representations of the fundamental group pi(1)(M) Of M into G module the conjugate action of G on representations.

Analysis of geometric and strain effects in homo-Diels-Alder reactions

Molecular mechanics calculations have been carried out to quantify the key geometric and strain effects which are likely to control the homo-Diels-Alder reactivity of 1,4-dienes. The criteria considered include C1..C5 and C2..C4 distances in the diene, twist angle of the two pi units, and the magnitude of strain increase as a result of cycloaddition. By first considering these factors in a number of non-conjugated dienes with known reactivity, the ranges of values within which the reaction is favoured are proposed. Calculations are also reported on several substrates which have not been investigated so far. Promising systems for experimental study are suggested which, in addition to being intrinsically interesting, would place the present proposals on a firm basis.

Line clipping revisited: Two efficient algorithms based on simple geometric observations

Two new line clipping algorithms, the opposite-corner algorithm and the perpendicular-distance algorithm, that are based on simple geometric observations are presented. These algorithms do not require computation of outcodes nor do they depend on the parametric representations of the lines. It is shown that the opposite-corner algorithm perform consistently better than an algorithm due to Nicholl, Lee, and Nicholl which is claimed to be better than the classic algorithm due to Cohen-Sutherland and the more recent Liang-Barsky algorithm. The pseudo-code of the opposite-corner algorithm is provided in the Appendix.

On some geometric invariants associated to the space of flat connections on an open space

A geometric invariant is associated to the parabolic moduli space on a marked surface and is related to the symplectic structure of the moduli space.