Uniqueness of the group topology of some homeomorphism groups

In this paper, we generalize a theorem of Kallman [2, Theorem 1.1] and we resolve the unsettled case there.     

Preservice Elementary Teachers' Use of Mathematics in a Project‐Based Science Approach

The use of a project‐based science (PBS) approach to teaching encourages students to integrate mathematics and science in meaningful ways as they create projects. As a beginning study of how students use mathematics in such an approach, an analysis of 23 projects developed by preservice elementary teachers enrolled in an elementary science course was conducted. Findings showed that students made a number of different types of mathematical errors and underutilized data representation and summary forms. Implications included the importance of developing methods for supporting the use of mathematical tools in utilizing a project‐based approach and considering ways that such tools mediate scientific thinking.     

Random orderings of the integers and card shuffling

In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of these orders in terms of a class of generalized riffle shuffles.     

A 24-GHz Patch Array with a Power Amplifier/Low-Noise Amplifier MMIC

This paper presents an active patch array designed at 24 GHz. It can be used as a front-end component for a phased array. A series resonant array structure is chosen which is compact and easy excite. With 5 elements, the array proved a 12-dB antenna gain. A power amplifier and a low noise amplifier are designed on a single GaAs chip (PALNA). Bias switch is used in the PALNA, which greatly reduces the switch loss in a transceiver and increases the efficiency. 20-dB small signal gain is achieved in both power amplifier and low noise amplifier. The active patch array is built by the combination of the patch array and PALNA. The measured active gain of this antenna is 35-dB for the PA mode and 31-dB for the LNA mode. This active patch array can obtain an EIRP of 34 dBm with a total radiated power of 22dBm and a maximum PAE of 32%. To check the noise performance, we applied sources at both normal temperature and 77K (liquid nitrogen) and extracted the noise figure (3.5 dB) of the active antenna by the Y factor method. The results proved that the active antenna is working efficiently as both a transmitting and receiving antenna.     

Geometry optimization in Cartesian coordinates: Constrained optimization

An efficient algorithm for constrained geometry optimization in Cartesian coordinates is presented. It incorporates mode-following techniques within both the classical method of Lagrange multipliers and the penalty function method. Both constrained minima and transition states can be located and, unlike the standard Z-matrix using internal coordinates, the desired constraints do not have to be satisfied in the initial structure. The algorithm is as efficient as a Z-matrix optimization while presenting several additional advantages.     

Evolution of the high power THz source program at Jefferson Lab

We report the evolution of the high power THz source program at Jefferson Lab. The source is based on coherent synchrotron radiation in which short bunches of relativistic electrons radiate when traversing a dipolar magnetic field. In our first accelerator we produced 20 W of broadband THz light. Our upgraded accelerator with higher current and improved THz extraction optics will considerably enhance the output power to >100 W. In this paper we describe the source in some detail and present theoretical calculations for the upgrade.     

Structural properties and tractability results for linear synteny

The syntenic distance between two species is the minimum number of fusions, fissions, and translocations required to transform one genome into the other. The linear syntenic distance, a restricted form of this model, has been shown to be close to the syntenic distance. Both models are computationally difficult to compute and have resisted efficient approximation algorithms with non-trivial performance guarantees. In this paper, we prove that many useful properties of syntenic distance carry over to linear syntenic distance. We also give a reduction from the general linear synteny problem to the question of whether a given instance can be solved using the maximum possible number of translocations. Our main contribution is an algorithm exactly computing linear syntenic distance in nested instances of the problem. This is the first polynomial time algorithm exactly solving linear synteny for a non-trivial class of instances. It is based on a novel connection between the syntenic distance and a scheduling problem that has been studied in the operations research literature.