Tunable narrow-band infrared emitters from hexagonal lattices

In this work, we present both the theoretical basis as well as supporting experimental measurements for development of a novel mid-infrared thermally stimulated narrow band emitter with a spectral bandwidth of less than 10%. To achieve this, we utilize a metallized-surface 2D photonic crystal of air voids in a silicon background with hexagonal structure symmetry. Our results are based on the generation of discrete surface plasmon (SP) modes in the thin metallized layer residing on the top surface. This yields a series of adequately spaced discrete peaks in the reflection spectrum, dominated by a single sharp feature corresponding to the lowest plasmon order, in an otherwise uniform highly reflective spectrum (>90%) over most of the IR spectrum. This, in turn, gives rise to a sharp absorption feature with a correspondingly narrow thermal emission peak in the emission spectrum. Transfer matrix calculations simulate well both the position and strengths of the absorption peaks. By altering the period of the surface photonic lattice, the SP peak and emissive band can be tuned to the desired wavelength. These devices promise a new class of tunable infrared emitters with high power in a narrow spectral bandwidth. Such narrow band sources are critical to achieving high efficiency gas sensors.     

Domain decomposition for an asymptotic geological fault modeling

We present in this paper a domain decomposition method to treat faults in geological basin modeling. The particularity of this model is that the faults whose widths are very small in comparison with the basin size, are not characterized as subdomains any more but as interfaces between sedimentary blocks. The originality of this work lies in the formulation of this new fault model and in the definition and the computation of the interface conditions between the subdomains. To cite this article: E. Flauraud et al., C. R. Mecanique 331 (2003).     

What are We Developing? A Case Study of a College Mathematics Program

Over one‐third of all college mathematics enrollments are in courses considered to be developmental. While such courses have been the subject of a large body of research, one question that seems not to have been studied empirically is the alignment of the content of developmental and college level mathematics courses. This paper gives the results of such a study, conducted at a medium sized public liberal arts university. While the content of the developmental mathematics courses was used subsequently in the Precalculus course, most of the content of the Intermediate Algebra course was not used in other college level mathematics courses. It is hoped that the results of this paper will serve as a catalyst for other institutions to examine carefully and define the mission of both their developmental and college level mathematics courses.     

Translation planes of large dimension admitting nonsolvable groups

In this article, the question is considered whether there exist finite translation planes with arbitrarily small kernels admitting nonsolvable collineation groups. For any integerN, it is shown that there exist translation planes of dimension >N and orderq ³ admittingGL(2,q) as a collineation group.     

Quantitative Impact of a Cognitive Modeling Intelligent Tutoring System on Student Performance in Balancing Chemical Equations

The need for improved interactive tutoring capabilities in educational software for chemistry problem solving is an important one clearly articulated by teachers and students. To deliver the next generation of individualized interactive capabilities users demand, it is necessary to go beyond the conventional computer-assisted instruction methodology. The focus of this paper is the assessment with first-semester general chemistry students of a recently developed artificial intelligence (AI) tutor for balancing chemical equations. This is the first such assessment of an AI-based learning tool in chemistry. Students in CHEM 121 in the Fall 2001 semester at Duquesne University (N = 273) participated in the study. Students were divided into a test group that used the AI tutor as part of their study activities and a control group that did not use the tutor. It was found that the tutor improved the performance of the test group students to a statistically significant degree, helping the weakest students the most. This study establishes the feasibility of an AI-based approach to creating advanced new tutoring software for chemistry problem solving. Access to a Web-based demonstration of the equation-balancing tutor may be obtained by emailing the corresponding author.     

A graph-theoretic approach to modeling metabolic pathways

Summary The metabolic pathways of medazepam, oxazepam, and diazepam were modeled using graph-theoretic transforms which are incorporable into computer-assisted metabolic analysis programs. The information, represented in the form of a graph-theoretic transform kit, which was obtained from these pathways was then used to predict the metabolites of other benzodiazepine compounds. The transform kits gave statistically significant predictions with respect to a statistical method for evaluating the performance of the transform kits.     

Local algorithms in exterior tomography

Exterior tomographic data are taken over lines outside a central region, and such data occur in the industrial nondestructive evaluation of large objects such as rockets. We explain, using microlocal analysis, which singularities are well reconstructed from exterior data, and we explain how this phenomenon is reflected in the singular value decomposition for the exterior transform [E.T. Quinto, Singular value decompositions and inversion methods for the exterior Radon transform and a spherical transform, J. Math. Anal. Appl. 95 (1983) 437–448]. We extend Lambda Tomography to exterior data and to limited angle exterior data. The algorithm is tested on industrial data from Perceptics, Inc.     

A note on scheduling to meet two min-sum objectives

We consider a single machine scheduling problem with two min-sum objective functions: the sum of completion times and the sum of weighted completion times. We propose a simple polynomial time (1+(1/γ),1+γ)-approximation algorithm, and show that for γ>1, there is no (x,y)-approximation with 1<x<1+(1/γ) and 1<y<1+(γ-1)/(2+γ).