Performance of charge-injection-device infrared detector arrays at low and moderate backgrounds

Three 2 x 64 element charge injection device infrared detector arrays were tested at low and moderate background to evaluate their usefulness for space based astronomical observations. Testing was conducted both in the laboratory and in ground based telescope observations. The devices showed an average readout noise level below 200 equivalent electrons, a peak responsivity of 4 A/W, and a noise equivalent power of 3x10 sq root of W/Hz. Array well capacity was measured to be significantly smaller than predicted. The measured sensitivity, which compares well with that of nonintegrating discrete extrinsic silicon photoconductors, shows these arrays to be useful for certain astronomical observations. However, the measured readout efficiency and frequency response represent serious limitations in low background applications

Detector arrays for low-background space infrared astronomy

The status of development and characterization tests of integrated infrared detector array technology for astronomy applications is described. The devices under development include intrinsic, extrinsic silicon, and extrinsic germanium detectors, with hybrid silicon multiplexers. Laboratory test results and successful astronomy imagery have established the usefulness of integrated arrays in low-background astronomy applications

A Conceptual Design Study of a High Temperature Solar Thermal Receiver

A conceptual design was made for a solar thermal receiver capable of operation in the 1095 to 1650 C (2000 to 3000 F) temperature range. This receiver is designed for use with a two-axis paraboloidal concentrator in the 25 to 150 kW sub t power range, and is intended for industrial process heat, Brayton engines, or chemical/fuels reactions. Three concepts were analyzed parametrically. One was selected for conceptual design. Its key feature is a helical coiled tube of sintered silicon nitride which serves as the heat exchanger between the incident solar radiation and the working fluid. A mechanical design of this concept was prepared, and both thermal and stress analysis performed. The analysis showed good performance, low potential cost in mass production, and adaptability to both Brayton cycle engines and chemical/fuels production

Shifting mineral and redox controls on carbon cycling in seasonally flooded mineral soils

Although wetland soils represent a relatively small portion of the terrestrial landscape, they account for an estimated 20 %–30 % of the global soil carbon (C) reservoir. C stored in wetland soils that experience seasonal flooding is likely the most vulnerable to increased severity and duration of droughts in response to climate change. Redox conditions, plant root dynamics, and the abundance of protective mineral phases are well-established controls on soil C persistence, but their relative influence in seasonally flooded mineral soils is largely unknown. To address this knowledge gap, we assessed the relative importance of environmental (temperature, soil moisture, and redox potential) and biogeochemical (mineral composition and root biomass) factors in controlling CO2 efflux, C quantity, and organic matter composition along replicated upland–lowland transitions in seasonally flooded mineral soils. Specifically, we contrasted mineral soils under temperature deciduous forests in lowland positions that undergo seasonal flooding with adjacent upland soils that do not, considering both surface (A) and subsurface (B and C) horizons. We found the lowland soils had lower total annual CO2 efflux than the upland soils, with monthly CO2 efflux in lowlands most strongly correlated with redox potential (Eh). Lower CO2 efflux as compared to the uplands corresponded to greater C content and abundance of lignin-rich, higher-molecular-weight, chemically reduced organic compounds in the lowland surface soils (A horizons). In contrast, subsurface soils in the lowland position (Cg horizons) showed lower C content than the upland positions (C horizons), coinciding with lower abundance of root biomass and oxalate-extractable Fe (Feo, a proxy for protective Fe phases). Our linear mixed-effects model showed that Feo served as the strongest measured predictor of C content in upland soils, yet Feo had no predictive power in lowland soils. Instead, our model showed that Eh and oxalate-extractable Al (Alo, a proxy of protective Al phases) became significantly stronger predictors in the lowland soils. Combined, our results suggest that low redox potentials are the primary cause for C accumulation in seasonally flooded surface soils, likely due to selective preservation of organic compounds under anaerobic conditions. In seasonally flooded subsurface soils, however, C accumulation is limited due to lower C inputs through root biomass and the removal of reactive Fe phases under reducing conditions. Our findings demonstrate that C accrual in seasonally flooded mineral soil is primarily due to low redox potential in the surface soil and that the lack of protective metal phases leaves these C stocks highly vulnerable to climate change

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

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

Efficient LZ78 factorization of grammar compressed text

We present an efficient algorithm for computing the LZ78 factorization of a text, where the text is represented as a straight line program (SLP), which is a context free grammar in the Chomsky normal form that generates a single string. Given an SLP of size $n$ representing a text $S$ of length $N$, our algorithm computes the LZ78 factorization of $T$ in $O(n\sqrt{N}+m\log N)$ time and $O(n\sqrt{N}+m)$ space, where $m$ is the number of resulting LZ78 factors. We also show how to improve the algorithm so that the $n\sqrt{N}$ term in the time and space complexities becomes either $nL$, where $L$ is the length of the longest LZ78 factor, or $(N - \alpha)$ where $\alpha \geq 0$ is a quantity which depends on the amount of redundancy that the SLP captures with respect to substrings of $S$ of a certain length. Since $m = O(N/\log_\sigma N)$ where $\sigma$ is the alphabet size, the latter is asymptotically at least as fast as a linear time algorithm which runs on the uncompressed string when $\sigma$ is constant, and can be more efficient when the text is compressible, i.e. when $m$ and $n$ are small.Comment: SPIRE 201

Dictionary Matching with One Gap

The dictionary matching with gaps problem is to preprocess a dictionary $D$ of $d$ gapped patterns $P_1,\ldots,P_d$ over alphabet $\Sigma$, where each gapped pattern $P_i$ is a sequence of subpatterns separated by bounded sequences of don't cares. Then, given a query text $T$ of length $n$ over alphabet $\Sigma$, the goal is to output all locations in $T$ in which a pattern $P_i\in D$, $1\leq i\leq d$, ends. There is a renewed current interest in the gapped matching problem stemming from cyber security. In this paper we solve the problem where all patterns in the dictionary have one gap with at least $\alpha$ and at most $\beta$ don't cares, where $\alpha$ and $\beta$ are given parameters. Specifically, we show that the dictionary matching with a single gap problem can be solved in either $O(d\log d + |D|)$ time and $O(d\log^{\varepsilon} d + |D|)$ space, and query time $O(n(\beta -\alpha )\log\log d \log ^2 \min \{ d, \log |D| \} + occ)$, where $occ$ is the number of patterns found, or preprocessing time and space: $O(d^2 + |D|)$, and query time $O(n(\beta -\alpha ) + occ)$, where $occ$ is the number of patterns found. As far as we know, this is the best solution for this setting of the problem, where many overlaps may exist in the dictionary.Comment: A preliminary version was published at CPM 201

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