Discriminative Orthogonal Neighborhood-Preserving Projections for Classification

Orthogonal neighborhood-preserving projection (ONPP) is a recently developed orthogonal linear algorithm for overcoming the out-of-sample problem existing in the well-known manifold learning algorithm, i.e., locally linear embedding. It has been shown that ONPP is a strong analyzer of high-dimensional data. However, when applied to classification problems in a supervised setting, ONPP only focuses on the intraclass geometrical information while ignores the interaction of samples from different classes. To enhance the performance of ONPP in classification, a new algorithm termed discriminative ONPP (DONPP) is proposed in this paper. DONPP 1) takes into account both intraclass and interclass geometries; 2) considers the neighborhood information of interclass relationships; and 3) follows the orthogonality property of ONPP. Furthermore, DONPP is extended to the semisupervised case, i.e., semisupervised DONPP (SDONPP). This uses unlabeled samples to improve the classification accuracy of the original DONPP. Empirical studies demonstrate the effectiveness of both DONPP and SDONPP.

Selection for variables in quantitative structure-activity/property relationship studies - Comparison between methods of orthogonal descriptors and leaps-and-bounds regression analysis

In this paper, the comparison of orthogonal descriptors and Leaps-and-Bounds regression analysis is performed. The results obtained by using orthogonal descriptors are better than that obtained by using Leaps-and-Bounds regression for the data set of nitrobenzenes used in this study. Leaps-and-Bounds regression can be used effectively for selection of variables in quantitative structure-activity/property relationship(QSAR/QSPR) studies. Consequently, orthogonalisation of descriptors is also a good method for variable selection for studies on QSAR/QSPR.

Variable selection by orthogonal descriptors and prediction of R-f value of phenol and aniline derivatives

Orthogonal descriptors is a viable method for variable selection, but this method strongly depend on the orthogonalisation ordering of the descriptors. In this paper, we compared the different methods used for order the descriptors. It showed that better results could be achieved with the use of backward elimination ordering. We predicted R-f value of phenol and aniline derivatives by this method, and compared it with classical algorithms such as forward selection, backward elimination, and stepwise procedure. Some interesting hints were obtained.

Studies on the hemolytic activity of tentacle extracts of jellyfish Rhopilema esculentum Kishinouye: Application of orthogonal test

The present work is first reporting the hemolytic activity of venom from jellyfish Rhopilema esculentum Kishinouye extracted by different phosphate buffer solutions and incubated at different temperature according to the orthogonal test L6(1) x 3(6). Of the seven controllable independent variables, incubated temperature and phenylmethylsulfonyl fluoride (PMSF) had strongest effect on the hemolytic activity. (c) 2006 Elsevier B.V. All rights reserved.

Multiplexing VBR Traffic Flows with Guaranteed Application-level QoS Using Statistical Rate Monotonic Scheduling

Quality of Service (QoS) guarantees are required by an increasing number of applications to ensure a minimal level of fidelity in the delivery of application data units through the network. Application-level QoS does not necessarily follow from any transport-level QoS guarantees regarding the delivery of the individual cells (e.g. ATM cells) which comprise the application's data units. The distinction between application-level and transport-level QoS guarantees is due primarily to the fragmentation that occurs when transmitting large application data units (e.g. IP packets, or video frames) using much smaller network cells, whereby the partial delivery of a data unit is useless; and, bandwidth spent to partially transmit the data unit is wasted. The data units transmitted by an application may vary in size while being constant in rate, which results in a variable bit rate (VBR) data flow. That data flow requires QoS guarantees. Statistical multiplexing is inadequate, because no guarantees can be made and no firewall property exists between different data flows. In this paper, we present a novel resource management paradigm for the maintenance of application-level QoS for VBR flows. Our paradigm is based on Statistical Rate Monotonic Scheduling (SRMS), in which (1) each application generates its variable-size data units at a fixed rate, (2) the partial delivery of data units is of no value to the application, and (3) the QoS guarantee extended to the application is the probability that an arbitrary data unit will be successfully transmitted through the network to/from the application.

Orthogonal orientation control of carbon nanotube growth.

Carbon nanotubes (CNTs) have attracted attention for their remarkable electrical properties and have being explored as one of the best building blocks in nano-electronics. A key challenge to realize such potential is the control of the nanotube growth directions. Even though both vertical growth and controlled horizontal growth of carbon nanotubes have been realized before, the growth of complex nanotube structures with both vertical and horizontal orientation control on the same substrate has never been achieved. Here, we report a method to grow three-dimensional (3D) complex nanotube structures made of vertical nanotube forests and horizontal nanotube arrays on a single substrate and from the same catalyst pattern by an orthogonally directed nanotube growth method using chemical vapor deposition (CVD). More importantly, such a capability represents a major advance in controlled growth of carbon nanotubes. It enables researchers to control the growth directions of nanotubes by simply changing the reaction conditions. The high degree of control represented in these experiments will surely make the fabrication of complex nanotube devices a possibility.

Reformulating time-dependent density functional theory with non-orthogonal localized molecular orbitals.

Time-dependent density functional theory (TDDFT) has broad application in the study of electronic response, excitation and transport. To extend such application to large and complex systems, we develop a reformulation of TDDFT equations in terms of non-orthogonal localized molecular orbitals (NOLMOs). NOLMO is the most localized representation of electronic degrees of freedom and has been used in ground state calculations. In atomic orbital (AO) representation, the sparsity of NOLMO is transferred to the coefficient matrix of molecular orbitals (MOs). Its novel use in TDDFT here leads to a very simple form of time propagation equations which can be solved with linear-scaling effort. We have tested the method for several long-chain saturated and conjugated molecular systems within the self-consistent charge density-functional tight-binding method (SCC-DFTB) and demonstrated its accuracy. This opens up pathways for TDDFT applications to large bio- and nano-systems.

Division of labor in frontal eye field neurons during presaccadic remapping of visual receptive fields.

Our percept of visual stability across saccadic eye movements may be mediated by presaccadic remapping. Just before a saccade, neurons that remap become visually responsive at a future field (FF), which anticipates the saccade vector. Hence, the neurons use corollary discharge of saccades. Many of the neurons also decrease their response at the receptive field (RF). Presaccadic remapping occurs in several brain areas including the frontal eye field (FEF), which receives corollary discharge of saccades in its layer IV from a collicular-thalamic pathway. We studied, at two levels, the microcircuitry of remapping in the FEF. At the laminar level, we compared remapping between layers IV and V. At the cellular level, we compared remapping between different neuron types of layer IV. In the FEF in four monkeys (Macaca mulatta), we identified 27 layer IV neurons with orthodromic stimulation and 57 layer V neurons with antidromic stimulation from the superior colliculus. With the use of established criteria, we classified the layer IV neurons as putative excitatory (n = 11), putative inhibitory (n = 12), or ambiguous (n = 4). We found that just before a saccade, putative excitatory neurons increased their visual response at the RF, putative inhibitory neurons showed no change, and ambiguous neurons increased their visual response at the FF. None of the neurons showed presaccadic visual changes at both RF and FF. In contrast, neurons in layer V showed full remapping (at both the RF and FF). Our data suggest that elemental signals for remapping are distributed across neuron types in early cortical processing and combined in later stages of cortical microcircuitry.

A miR-34a-Numb Feedforward Loop Triggered by Inflammation Regulates Asymmetric Stem Cell Division in Intestine and Colon Cancer.

Emerging evidence suggests that microRNAs can initiate asymmetric division, but whether microRNA and protein cell fate determinants coordinate with each other remains unclear. Here, we show that miR-34a directly suppresses Numb in early-stage colon cancer stem cells (CCSCs), forming an incoherent feedforward loop (IFFL) targeting Notch to separate stem and non-stem cell fates robustly. Perturbation of the IFFL leads to a new intermediate cell population with plastic and ambiguous identity. Lgr5+ mouse intestinal/colon stem cells (ISCs) predominantly undergo symmetric division but turn on asymmetric division to curb the number of ISCs when proinflammatory response causes excessive proliferation. Deletion of miR-34a inhibits asymmetric division and exacerbates Lgr5+ ISC proliferation under such stress. Collectively, our data indicate that microRNA and protein cell fate determinants coordinate to enhance robustness of cell fate decision, and they provide a safeguard mechanism against stem cell proliferation induced by inflammation or oncogenic mutation.

Debating the division of labour in healthcare in France and England

As Larson (1990) states, professions are historically specific and ‘there is no pattern of social closure around an occupation that is not inflected by the latter’s past, its specific activity and typical context of performance or…the political context in which closure is obtained.’ Larson’s work focuses particularly on the differences between the establishment of professions in France, where there was considerable state intervention, with that in the US and UK, both of which were more market-oriented. This paper is based on data from an evaluation of a large European exchange programme of staff between Kent and Lille, from 2005 to 2008 and discusses the division of labour in healthcare between two occupational groups, medicine and nursing, in England and in France. This division of labour has been extensively discussed in the UK, particularly since from the mid 1990s the nursing role has been extended and innovations such as nurse prescribing have been introduced, whereas such extended roles have not been introduced in France. The paper draws particularly on interview data from mental health practitioners, in which it is argued that whilst the English nurses may on the surface seem to have a wider range of competences and autonomy, in reality they are more constrained, as they operate under protocols and therefore do not exercise professional judgement. Not only do these data illustrate the centrality of professional judgement in discussions about practice, they also demonstrate the circularity of many debates on extended roles.

SK1-like functors for division algebras

We investigate the group valued functor G(D) = D*/F*D' where D is a division algebra with center F and D' the commutator subgroup of D*. We show that G has the most important functorial properties of the reduced Whitehead group SK1. We then establish a fundamental connection between this group, its residue version, and relative value group when D is a Henselian division algebra. The structure of G(D) turns out to carry significant information about the arithmetic of D. Along these lines, we employ G(D) to compute the group SK1(D). As an application, we obtain theorems of reduced K-theory which require heavy machinery, as simple examples of our method.