Activity-Directed Synthesis: A Flexible Approach for Lead Generation

Activity-directed synthesis (ADS) is a structure-blind, functional-driven molecular discovery approach. In this Concept, four case studies highlight the general applicability of ADS and showcase its flexibility to support different medicinal chemistry strategies. ADS deliberately harnesses reactions with multiple possible outcomes, and allows many chemotypes to be evaluated in parallel. Resources are focused on bioactive molecules, which emerge in tandem with associated synthetic routes. Some of the future challenges for ADS are highlighted, including the realisation of an autonomous molecular discovery platform. The prospects for ADS to become a mainstream lead generation approach are discussed.     

Improving narrow bandgap a-SiGe:H alloys grown by hot-wire chemical vapor deposition

We have improved the electronic properties of narrow-bandgap (Tauc gap below 1.5 eV) amorphous-silicon germanium alloys (a-SiGe:H) grown by hot-wire chemical vapor deposition (HWCVD) by lowering the substrate temperature and deposition rate. Prior to this work, we were unable to grow a-SiGe:H alloys with bandgaps below 1.5 eV that had photo-to-dark conductivity ratios comparable with our plasma-enhanced CVD (PECVD) grown materials [B.P. Nelson et al., Mater. Res. Soc. Symp. 507 (1998) 447]. Decreasing the filament diameter from our standard configuration of 0.5 mm to 0.38 or 0.25 mm provides first big improvements in the photoresponse of these alloys. Lowering the substrate temperature from our previous optimal temperatures (T_sub starting at 435 °C) to at 250 °C provides additional photo-to-dark conductivity ratio increasing by two orders of magnitude for growth conditions containing 20–30% GeH₄ in the gas phase (relative to the total GeH₄+SiH₄ flow).     

Predicting Forest Age Classes from High Spatial Resolution Remotely Sensed Imagery Using Voronoi Polygon Aggregation

Efficient identification of forest age is useful for forest management and ecological applications. Here we propose a user-assisted method for determining forest age using high spatial resolution remotely sensed imagery. This method requires individual trees to be extracted from imagery and represented as points. We use a local maximum filter to generate points that are converted to Voronoi polygons. Properties of the Voronoi polygons are correlated with forest age and used to aggregate points (trees) into areas (stands) based on three forest age classes. Accuracy of the aggregation ranges from approximately 68% to 78% and identification of the mature class is more consistent and accurate than the younger classes.     

High dynamic range InP HBT delta-sigma analog-to-digital converters

To date, the development of multifunction multicarrier digital receivers for cellular base station and military communications applications has been limited by the demanding dynamic range requirements for the analog-to-digital converter (ADC). The use of oversampling delta-sigma modulators provides a promising approach to overcoming the dynamic range barriers Nyquist-rate converters face in the same applications. This paper discusses issues involved in the design of high-speed high dynamic range wide-band delta-sigma ADCs for such communications applications. Test results of prototype designs are also presented. The delta-sigma modulators described in this paper operate at sampling frequencies ranging from 1 to 2.5 GHz with center frequencies ranging from dc to 100 MHz, providing between 74 and 84.2 dB signal-to-noise ratio (12 and 13.7 bits) for bandwidths of 25 and 12.5 MHz, respectively. The loop filters are continuous-time low-pass and bandpass implementations of order 6 and 10, and were fabricated in an InP heterojunction bipolar (HBT) technology. A typical tenth-order design consumes 6 W of power and occupies a die area of 23.5 mm/sup 2/.     

The Two-Dimensional Clifford-Fourier Transform

Recently several generalizations to higher dimension of the Fourier transform using Clifford algebra have been introduced, including the Clifford-Fourier transform by the authors, defined as an operator exponential with a Clifford algebra-valued kernel. In this paper an overview is given of all these generalizations and an in depth study of the two-dimensional Clifford-Fourier transform of the authors is presented. In this special two-dimensional case a closed form for the integral kernel may be obtained, leading to further properties, both in the L ₁ and in the L ₂ context. Furthermore, based on this Clifford-Fourier transform Clifford-Gabor filters are introduced. AMS subject classification numbers: 42B10, 30G35 Fred Brackx received a diploma degree in mathematics from Ghent University, Belgium, in 1970 and a Ph.D. degree in mathematics from the same university in 1973. Since 1984 he is professor for mathematical analysis at Ghent University and currently he is leading the Clifford Research Group. His main interests are function theory and functional analysis for functions with values in quaternion and Clifford algebras. The research covers Clifford distributions, generalized Fourier, Radon and Hilbert transforms, orthogonal polynomials and multi-dimensional wavelets. Nele De Schepper received a diploma degree in mathematics from Ghent University, Belgium, in 2001. Since then she holds an assistantship at the Department of Mathematical Analysis of Ghent University and is a member of the Clifford Research Group. Her main interests are function theory and functional analysis for functions with values in Clifford algebras. The research covers generalized Fourier transforms, orthogonal polynomials and multi-dimensional wavelets. Frank Sommen received a diploma degree in mathematics from Ghent University, Belgium, in 1978, a Ph.D. degree in mathematics from the same university in 1980, and a habilitation degree in mathematical analysis in 1984. From 1978 until 1999 he was at the National Fund for Scientific Research (Flanders). Since 2000 he holds a Research professorship at Ghent University. His main interests are function theory and functional analysis for functions with values in quaternion and Clifford algebras. The research covers Clifford distributions, generalized Fourier, Radon and Hilbert transforms, orthogonal polynomials and multi-dimensional wavelets, algebraic analysis, hyperfunctions and radial algebra.     

Improved RNS FIR filter architectures

A new architecture for implementing finite-impulse response (FIR) filters using the residue number system (RNS) is detailed. The design is based on using a restricted modulus set, with moduli of the form 2/sup n/,2/sup n/-1, and 2/sup n/+1. This does not restrict the modulus set to the common 3 modulus set {2/sup n/-1,2/sup n/,2/sup n/+1}, but any number of pairwise relatively prime moduli of this form, for example, {5,7,17,31,32,33}. Based on a comparison with a 2's complement design, the new RNS design can offer a significant speed improvement. The gain is obtained by using a set of small moduli, selected so as to minimize critical path delay and area. An algorithmic approach is used to obtain full adder based architectures that are optimized for area and delay. The modulus set is optimum based on cost parameters for each modulus. This new architecture presents a practical approach to implementing a fast RNS FIR filter.     

Implementation of RNS-Based Distributed Arithmetic Discrete Wavelet Transform Architectures Using Field-Programmable Logic

Currently there are design barriers inhibiting the implementation of high-precision digital signal processing (DSP) objects with field programmable logic (FPL) devices. This paper explores overcoming these barriers by fusing together the popular distributed arithmetic (DA) method with the residue number system (RNS) for use in FPL-centric designs. The new design paradigm is studied in the context of a high-performance filter bank and a discrete wavelet transform (DWT). The proposed design paradigm is facilitated by a new RNS accumulator structure based on a carry save adder (CSA). The reported methodology also introduces a polyphase filter structure that results in a reduced look-up table (LUT) budget. The 2C-DA and RNS-DA are compared, in the context of a FPL implementation strategy, using a discrete wavelet transform (DWT) filter bank as a common design theme. The results show that the RNS-DA, compared to a traditional 2C-DA design, enjoys a performance advantage that increases with precision (wordlength).     

A Revised Methodology for Research on Metamemory: Pre-judgment Recall And Monitoring (PRAM).

A revised methodology is described for research on metacognitive monitoring, especially judgments of learning (JOLs), to investigate psychological processing that previously has been only hypothetical and unobservable. During data collection a new stage of recall occurs just prior to the JOL, so that during data analysis the items can be partitioned into subcategories to measure the degree of JOL accuracy in ways that are more analytic than was previously possible. A weighted-average combinatorial rule allows the component measures of JOL accuracy to be combined into the usual overall measure of metacognitive accuracy. An example using the revised methodology offers a new explanation for the delayed-JOL effect, in which delayed JOLs are more accurate than immediate JOLs for predicting recall. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

A unified framework for off-line permutation routing in parallel networks

In this paper we present a general strategy for finding efficient permutation routes in parallel networks. Among the popular parallel networks to which the strategy applies are mesh networks, hypercube networks, hypercube-derivative networks, ring networks, and star networks. The routes produced are generally congestion-free and take a number of routing steps that is within a small constant factor of the diameter of the network. Our basic strategy is derived from an algorithm that finds (in polynomial time) efficient permutation routes for aproduct network, G×H, given efficient permutation routes forG andH. We investigate the use of this algorithm for routingmultiple permutations and extend its applicability to a wide class of graphs, including several families ofCayley graphs. Finally, we show that our approach can be used to find efficient permutation routes among the remaining live nodes infaulty networks.This research was supported in part by a grant from the NSF, Grant No. CCR-88-12567.