Missionary heroines in eastern lands : woman's work in mission fields / by E.R. Pitman.

http://www.archive.org/details/missionaryheroin00pitmuoft

The Sâankhya aphorisms of Kapila, with extracts from Vijnâana Bhiksu's commentary, tr. by J.R. Ballantyne.

http://www.archive.org/details/thesaenkhyaaphor00kapiuoft

Hinduism and Christianity in Orissa: containing a brief description of the country, religion, manners and customs, of the Hindus, and an account of the operations of the American Freewill Baptist Mission in northern Orissa ... By O.R. Bacheler ...

http://www.archive.org/details/hinduismandchris00bachuoft

Generating Good Degree Distributions for Sparse Parity Check Codes using Oracles

Fast forward error correction codes are becoming an important component in bulk content delivery. They fit in naturally with multicast scenarios as a way to deal with losses and are now seeing use in peer to peer networks as a basis for distributing load. In particular, new irregular sparse parity check codes have been developed with provable average linear time performance, a significant improvement over previous codes. In this paper, we present a new heuristic for generating codes with similar performance based on observing a server with an oracle for client state. This heuristic is easy to implement and provides further intuition into the need for an irregular heavy tailed distribution.

Fusion Artmap: A Neural Network Architecture for Multi-Channel Data Fusion and Classification

Fusion ARTMAP is a self-organizing neural network architecture for multi-channel, or multi-sensor, data fusion. Single-channel Fusion ARTMAP is functionally equivalent to Fuzzy ART during unsupervised learning and to Fuzzy ARTMAP during supervised learning. The network has a symmetric organization such that each channel can be dynamically configured to serve as either a data input or a teaching input to the system. An ART module forms a compressed recognition code within each channel. These codes, in turn, become inputs to a single ART system that organizes the global recognition code. When a predictive error occurs, a process called paraellel match tracking simultaneously raises vigilances in multiple ART modules until reset is triggered in one of them. Parallel match tracking hereby resets only that portion of the recognition code with the poorest match, or minimum predictive confidence. This internally controlled selective reset process is a type of credit assignment that creates a parsimoniously connected learned network. Fusion ARTMAP's multi-channel coding is illustrated by simulations of the Quadruped Mammal database.

Fusion ARTMAP: An Adaptive Fuzzy Network for Multi-Channel Classification

Fusion ARTMAP is a self-organizing neural network architecture for multi-channel, or multi-sensor, data fusion. Fusion ARTMAP generalizes the fuzzy ARTMAP architecture in order to adaptively classify multi-channel data. The network has a symmetric organization such that each channel can be dynamically configured to serve as either a data input or a teaching input to the system. An ART module forms a compressed recognition code within each channel. These codes, in turn, beco1ne inputs to a single ART system that organizes the global recognition code. When a predictive error occurs, a process called parallel match tracking simultaneously raises vigilances in multiple ART modules until reset is triggered in one of thmn. Parallel match tracking hereby resets only that portion of the recognition code with the poorest match, or minimum predictive confidence. This internally controlled selective reset process is a type of credit assignment that creates a parsimoniously connected learned network.

Space, Time and Learning in the Hippocampus: How Fine Spatial and Temporal Scales Are Expanded into Population Codes for Behavioral Control

The hippocampus participates in multiple functions, including spatial navigation, adaptive timing, and declarative (notably, episodic) memory. How does it carry out these particular functions? The present article proposes that hippocampal spatial and temporal processing are carried out by parallel circuits within entorhinal cortex, dentate gyrus, and CA3 that are variations of the same circuit design. In particular, interactions between these brain regions transform fine spatial and temporal scales into population codes that are capable of representing the much larger spatial and temporal scales that are needed to control adaptive behaviors. Previous models of adaptively timed learning propose how a spectrum of cells tuned to brief but different delays are combined and modulated by learning to create a population code for controlling goal-oriented behaviors that span hundreds of milliseconds or even seconds. Here it is proposed how projections from entorhinal grid cells can undergo a similar learning process to create hippocampal place cells that can cover a space of many meters that are needed to control navigational behaviors. The suggested homology between spatial and temporal processing may clarify how spatial and temporal information may be integrated into an episodic memory.

Distributed Hypothesis Testing, Attention Shifts and Transmitter Dynatmics During the Self-Organization of Brain Recognition Codes

BP (89-A-1204); Defense Advanced Research Projects Agency (90-0083); National Science Foundation (IRI-90-00530); Air Force Office of Scientific Research (90-0175, 90-0128); Army Research Office (DAAL-03-88-K0088)

Simplified decoding techniques for linear block codes

Error correcting codes are combinatorial objects, designed to enable reliable transmission of digital data over noisy channels. They are ubiquitously used in communication, data storage etc. Error correction allows reconstruction of the original data from received word. The classical decoding algorithms are constrained to output just one codeword. However, in the late 50’s researchers proposed a relaxed error correction model for potentially large error rates known as list decoding. The research presented in this thesis focuses on reducing the computational effort and enhancing the efficiency of decoding algorithms for several codes from algorithmic as well as architectural standpoint. The codes in consideration are linear block codes closely related to Reed Solomon (RS) codes. A high speed low complexity algorithm and architecture are presented for encoding and decoding RS codes based on evaluation. The implementation results show that the hardware resources and the total execution time are significantly reduced as compared to the classical decoder. The evaluation based encoding and decoding schemes are modified and extended for shortened RS codes and software implementation shows substantial reduction in memory footprint at the expense of latency. Hermitian codes can be seen as concatenated RS codes and are much longer than RS codes over the same aphabet. A fast, novel and efficient VLSI architecture for Hermitian codes is proposed based on interpolation decoding. The proposed architecture is proven to have better than Kötter’s decoder for high rate codes. The thesis work also explores a method of constructing optimal codes by computing the subfield subcodes of Generalized Toric (GT) codes that is a natural extension of RS codes over several dimensions. The polynomial generators or evaluation polynomials for subfield-subcodes of GT codes are identified based on which dimension and bound for the minimum distance are computed. The algebraic structure for the polynomials evaluating to subfield is used to simplify the list decoding algorithm for BCH codes. Finally, an efficient and novel approach is proposed for exploiting powerful codes having complex decoding but simple encoding scheme (comparable to RS codes) for multihop wireless sensor network (WSN) applications.

Differential inducibility of HLA class I and II antigens by r-IFN gamma in type III bare lymphocyte syndrome.

Case Reports

Investigation of the shape of the R(0) absorption line in ν3, N2O recorded from an axisymmetric supersonic free jet expansion

The hydrodynamic structure of an axisymmetric supersonic expansion can be regarded as a series of concentric divergent cones, with decreasing particle densities as the cone angle increases. Different groups of molecules therefore contribute to high-resolution absorption line shapes when optically probing the expansion in a direction perpendicular to the jet axis. These groups are distinguished by the cone angle, inducing a specific Doppler shift, and by the particle density, contributing a specific weight to the absorption intensity. As a result different broader line profiles are observed compared to room temperature spectra. This effect is investigated here selecting as the working example the R(0), ν3 absorption line in N2O recorded using a Fourier transform interferometer. Independent impact pressure and quadrupole mass spectrometric measurements are performed leading to two complementary maps of the expansion, allowing the recorded absorption line shape to be quantitatively modeled. © 2006 Elsevier Ltd. All rights reserved.

Structure, function, and phylogeny of the mating locus in the Rhizopus oryzae complex.

The Rhizopus oryzae species complex is a group of zygomycete fungi that are common, cosmopolitan saprotrophs. Some strains are used beneficially for production of Asian fermented foods but they can also act as opportunistic human pathogens. Although R. oryzae reportedly has a heterothallic (+/-) mating system, most strains have not been observed to undergo sexual reproduction and the genetic structure of its mating locus has not been characterized. Here we report on the mating behavior and genetic structure of the mating locus for 54 isolates of the R. oryzae complex. All 54 strains have a mating locus similar in overall organization to Phycomyces blakesleeanus and Mucor circinelloides (Mucoromycotina, Zygomycota). In all of these fungi, the minus (-) allele features the SexM high mobility group (HMG) gene flanked by an RNA helicase gene and a TP transporter gene (TPT). Within the R. oryzae complex, the plus (+) mating allele includes an inserted region that codes for a BTB/POZ domain gene and the SexP HMG gene. Phylogenetic analyses of multiple genes, including the mating loci (HMG, TPT, RNA helicase), ITS1-5.8S-ITS2 rDNA, RPB2, and LDH genes, identified two distinct groups of strains. These correspond to previously described sibling species R. oryzae sensu stricto and R. delemar. Within each species, discordant gene phylogenies among multiple loci suggest an outcrossing population structure. The hypothesis of random-mating is also supported by a 50:50 ratio of plus and minus mating types in both cryptic species. When crossed with tester strains of the opposite mating type, most isolates of R. delemar failed to produce zygospores, while isolates of R. oryzae produced sterile zygospores. In spite of the reluctance of most strains to mate in vitro, the conserved sex locus structure and evidence for outcrossing suggest that a normal sexual cycle occurs in both species.

The cost of biopharmaceutical R&D: Is biotech different?

The costs of developing the types of new drugs that have been pursued by traditional pharmaceutical firms have been estimated in a number of studies. However, similar analyses have not been published on the costs of developing the types of molecules on which biotech firms have focused. This study represents a first attempt to get a sense for the magnitude of the R&D costs associated with the discovery and development of new therapeutic biopharmaceuticals (specifically, recombinant proteins and monoclonal antibodies [mAbs]). We utilize drug-specific data on cash outlays, development times, and success in obtaining regulatory marketing approval to estimate the average pre-tax R&D resource cost for biopharmaceuticals up to the point of initial US marketing approval (in year 2005 dollars). We found average out-of-pocket (cash outlay) cost estimates per approved biopharmaceutical of $198 million, $361 million, and $559 million for the preclinical period, the clinical period, and in total, respectively. Including the time costs associated with biopharmaceutical R&D, we found average capitalized cost estimates per approved biopharmaceutical of $615 million, $626 million, and $1241 million for the preclinical period, the clinical period, and in total, respectively. Adjusting previously published estimates of R&D costs for traditional pharmaceutical firms by using past growth rates for pharmaceutical company costs to correspond to the more recent period to which our biopharmaceutical data apply, we found that total out-of-pocket cost per approved biopharmaceutical was somewhat lower than for the pharmaceutical company data ($559 million vs $672 million). However, estimated total capitalized cost per approved new molecule was nearly the same for biopharmaceuticals as for the adjusted pharmaceutical company data ($1241 million versus $1318 million). The results should be viewed with some caution for now given a limited number of biopharmaceutical molecules with data on cash outlays, different therapeutic class distributions for biopharmaceuticals and for pharmaceutical company drugs, and uncertainty about whether recent growth rates in pharmaceutical company costs are different from immediate past growth rates. Copyright © 2007 John Wiley & Sons, Ltd.

Returns to R&D on new drug introductions in the 1980s.

This study finds that the mean IRR for 1980-84 U.S. new drug introductions is 11.1%, and the mean NPV is 22 million (1990 dollars). The distribution of returns is highly skewed. The results are robust to plausible changes in the baseline assumptions. Our work is also compared with a 1993 study by the OTA. Despite some important differences in assumptions, both studies imply that returns for the average NCE are within one percentage point of the industry's cost of capital. This is much less than what is typically observed in analyses based on accounting data.

Where does energy R&D come from? Examining crowding out from energy R&D

Recent efforts to endogenize technological change in climate policy models demonstrate the importance of accounting for the opportunity cost of climate R&D investments. Because the social returns to R&D investments are typically higher than the social returns to other types of investment, any new climate mitigation R&D that comes at the expense of other R&D investment may dampen the overall gains from induced technological change. Unfortunately, there has been little empirical work to guide modelers as to the potential magnitude of such crowding out effects. This paper considers both the private and social opportunity costs of climate R&D. Addressing private costs, we ask whether an increase in climate R&D represents new R&D spending, or whether some (or all) of the additional climate R&D comes at the expense of other R&D. Addressing social costs, we use patent citations to compare the social value of alternative energy research to other types of R&D that may be crowded out. Beginning at the industry level, we find no evidence of crowding out across sectors-that is, increases in energy R&D do not draw R&D resources away from sectors that do not perform R&D. Given this, we proceed with a detailed look at alternative energy R&D. Linking patent data and financial data by firm, we ask whether an increase in alternative energy patents leads to a decrease in other types of patenting activity. While we find that increases in alternative energy patents do result in fewer patents of other types, the evidence suggests that this is due to profit-maximizing changes in research effort, rather than financial constraints that limit the total amount of R&D possible. Finally, we use patent citation data to compare the social value of alternative energy patents to other patents by these firms. Alternative energy patents are cited more frequently, and by a wider range of other technologies, than other patents by these firms, suggesting that their social value is higher. © 2011 Elsevier B.V.