Low-background performance of a monolithic InSb CCD array

A 20 element monolithic InSb charge coupled device (CCD) detector array was measured under low background conditions to assess its potential for orbital astronomical applications. At a temperature of 64 K, previous results for charge transfer efficiency (CTE) were reproduced, and a sensitivity of about 2 x 10 to the minus 15th power joules was measured. At 27 and 6 K, extended integration times were achieved, but CTE was substantially degraded. The noise was approximately 6000 charges, which was in excess of the level where statistical fluctuations from the illumination could be detected. A telescope demonstration was performed showing that the array sensitivity and difficulty of operation were not substantially different from laboratory levels. Ways in which the device could be improved for astronomical applications were discussed

On the suitability of suffix arrays for lempel-ziv data compression

Lossless compression algorithms of the Lempel-Ziv (LZ) family are widely used nowadays. Regarding time and memory requirements, LZ encoding is much more demanding than decoding. In order to speed up the encoding process, efficient data structures, like suffix trees, have been used. In this paper, we explore the use of suffix arrays to hold the dictionary of the LZ encoder, and propose an algorithm to search over it. We show that the resulting encoder attains roughly the same compression ratios as those based on suffix trees. However, the amount of memory required by the suffix array is fixed, and much lower than the variable amount of memory used by encoders based on suffix trees (which depends on the text to encode). We conclude that suffix arrays, when compared to suffix trees in terms of the trade-off among time, memory, and compression ratio, may be preferable in scenarios (e.g., embedded systems) where memory is at a premium and high speed is not critical

A Minimal Periods Algorithm with Applications

Kosaraju in ``Computation of squares in a string'' briefly described a linear-time algorithm for computing the minimal squares starting at each position in a word. Using the same construction of suffix trees, we generalize his result and describe in detail how to compute in O(k|w|)-time the minimal k-th power, with period of length larger than s, starting at each position in a word w for arbitrary exponent $k\geq2$ and integer $s\geq0$. We provide the complete proof of correctness of the algorithm, which is somehow not completely clear in Kosaraju's original paper. The algorithm can be used as a sub-routine to detect certain types of pseudo-patterns in words, which is our original intention to study the generalization.Comment: 14 page

Infrared receivers for low background astronomy: Incoherent detectors and coherent devices from one micrometer to one millimeter

The status of incoherent detectors and coherent receivers over the infrared wavelength range from one micrometer to one millimeter is described. General principles of infrared receivers are included, and photon detectors, bolometers, coherent receivers, and important supporting technologies are discussed, with emphasis on their suitability for low background astronomical applications. Broad recommendations are presented and specific opportunities are identified for development of improved devices

Scheduling Jobs in Flowshops with the Introduction of Additional Machines in the Future

This is the author's peer-reviewed final manuscript, as accepted by the publisher. The published article is copyrighted by Elsevier and can be found at: http://www.journals.elsevier.com/expert-systems-with-applications/.The problem of scheduling jobs to minimize total weighted tardiness in flowshops,\ud with the possibility of evolving into hybrid flowshops in the future, is investigated in\ud this paper. As this research is guided by a real problem in industry, the flowshop\ud considered has considerable flexibility, which stimulated the development of an\ud innovative methodology for this research. Each stage of the flowshop currently has\ud one or several identical machines. However, the manufacturing company is planning\ud to introduce additional machines with different capabilities in different stages in the\ud near future. Thus, the algorithm proposed and developed for the problem is not only\ud capable of solving the current flow line configuration but also the potential new\ud configurations that may result in the future. A meta-heuristic search algorithm based\ud on Tabu search is developed to solve this NP-hard, industry-guided problem. Six\ud different initial solution finding mechanisms are proposed. A carefully planned\ud nested split-plot design is performed to test the significance of different factors and\ud their impact on the performance of the different algorithms. To the best of our\ud knowledge, this research is the first of its kind that attempts to solve an industry-guided\ud problem with the concern for future developments

Suffix Tree of Alignment: An Efficient Index for Similar Data

We consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings $A$ and $B$ is a compacted trie representing all suffixes in $A$ and $B$. It has $|A|+|B|$ leaves and can be constructed in $O(|A|+|B|)$ time. However, if the two strings are similar, the generalized suffix tree is not efficient because it does not exploit the similarity which is usually represented as an alignment of $A$ and $B$. In this paper we propose a space/time-efficient suffix tree of alignment which wisely exploits the similarity in an alignment. Our suffix tree for an alignment of $A$ and $B$ has $|A| + l_d + l_1$ leaves where $l_d$ is the sum of the lengths of all parts of $B$ different from $A$ and $l_1$ is the sum of the lengths of some common parts of $A$ and $B$. We did not compromise the pattern search to reduce the space. Our suffix tree can be searched for a pattern $P$ in $O(|P|+occ)$ time where $occ$ is the number of occurrences of $P$ in $A$ and $B$. We also present an efficient algorithm to construct the suffix tree of alignment. When the suffix tree is constructed from scratch, the algorithm requires $O(|A| + l_d + l_1 + l_2)$ time where $l_2$ is the sum of the lengths of other common substrings of $A$ and $B$. When the suffix tree of $A$ is already given, it requires $O(l_d + l_1 + l_2)$ time.Comment: 12 page

Mg/Ca paleothermometry in the Central Gulf of Cadiz during Heinrich Events

The Astrobiology Explorer (ABE) is a MIDEX mission concept, currently under Concept Phase A study at NASA's Ames Research Center in collaboration with Ball Aerospace & Technologies, Corp., and managed by NASA's Jet Propulsion Laboratory. ABE will conduct infrared spectroscopic observations to address important problems in astrobiology, astrochemistry, and astrophysics. The core observational program would make fundamental scientific progress in understanding the distribution, identity, and evolution of ices and organic matter in dense molecular clouds, young forming stellar systems, stellar outflows, the general diffuse ISM, HII regions, Solar System bodies, and external galaxies. The ABE instrument concept includes a 0.6 m aperture Ritchey-Chretien telescope and three moderate resolution (R = 2000-3000) spectrometers together covering the 2.5-20 micron spectral region. Large format (1024 x 1024 pixel) IR detector arrays will allow each spectrometer to cover an entire octave of spectral range per exposure without any moving parts. The telescope will be cooled below 50 K by a cryogenic dewar shielded by a sunshade. The detectors will be cooled to ~7.5 K by a solid hydrogen cryostat. The optimum orbital configuration for achieving the scientific objectives of the ABE mission is a low background, 1 AU Earth driftaway orbit requiring a Delta II launch vehicle. This configuration provides a low thermal background and allows adequate communications bandwidth and good access to the entire sky over the ~1.5 year mission lifetime

Breeding for resistance to new and emerging lettuce diseases in California

Abstract: Preventing crop loss due to diseases has historically been the primary focus of public lettuce (Lactuca sativa) breeding efforts in the United States. Recent years have seen a shift in the industry, with increasing percentages of romaine and mixed lettuces being grown under intensive production systems. Possibly related to this change, several diseases have recently been reported for the first time or have increased in incidence. Two of these, lettuce dieback and crown rot, affect primarily romaine lettuce, whereas a third, Fusarium wilt, threatens all types. Lettuce dieback is caused by soilborne viruses of the family Tombusviridae. This disease may be identical to 'brown blight', which was widespread in the 1940s but vanished when resistant crisphead cultivars were developed. Fusarium wilt of lettuce was initially observed in California in 1990, and first caused significant crop losses in both California and Arizona in 2001. Crown rot of romaine, now known as Phoma basal rot, was first observed in the Salinas Valley of California in 2001. The cause of this disease was recently identified as Phoma exigua. Progress and results of breeding for genetic resistance to these diseases will be discussed

The Infrared Array Camera (IRAC) for the Spitzer Space Telescope

The Infrared Array Camera (IRAC) is one of three focal plane instruments in the Spitzer Space Telescope. IRAC is a four-channel camera that obtains simultaneous broad-band images at 3.6, 4.5, 5.8, and 8.0 microns. Two nearly adjacent 5.2x5.2 arcmin fields of view in the focal plane are viewed by the four channels in pairs (3.6 and 5.8 microns; 4.5 and 8 microns). All four detector arrays in the camera are 256x256 pixels in size, with the two shorter wavelength channels using InSb and the two longer wavelength channels using Si:As IBC detectors. IRAC is a powerful survey instrument because of its high sensitivity, large field of view, and four-color imaging. This paper summarizes the in-flight scientific, technical, and operational performance of IRAC.Comment: 7 pages, 3 figures. Accepted for publication in the ApJS. A higher resolution version is at http://cfa-www.harvard.edu/irac/publication