Effects of annealing on performance of InP solar cells on GaAs substrates

Effects of annealing on crystal structure and device characteristics of InP solar cells on GaAs substrates were studied. Two different methods, thermally cycled annealing during the growth, and rapid thermal annealing after the growth, were applied. The results obtained for the annealed solar cells were compared with those obtained for nonannealed and homoepitaxial solar cells. The dislocation density was significantly reduced by annealing from that of the non-annealed heteropitaxial solar cells, and most of the device characteristics were improved.     

Testing the effects of temperature and humidity on printed passive UHF RFID tags on paper substrate

This article is an interesting substrate material for environmental-friendly printable electronics. In this study, screen-printed RFID tags on paper substrate are examined. Their reliability was tested with low temperature, high temperature, slow temperature cycling, high temperature and high humidity and water dipping test. Environmental stresses affect the tag antenna impedance, losses and radiation characteristics due to their impact on the ink film and paper substrate. Low temperature, temperature cycling and high humidity did not have a radical effect on the measured parameters: threshold power, backscattered signal power or read range of the tags. However, the frequency response and the losses of the tags were slightly affected. Exposure to high temperature was found to even improve the tag performance due to the positive effect of high temperature on the ink film. The combined high humidity and high temperature had the most severe effect on the tag performance. The threshold power increased, backscattered power decreased and the read range was shortened. On the whole, the results showed that field use of these tags in high, low and changing temperature conditions and high humidity conditions is possible. Use of these tags in combined high-humidity and high-temperature conditions should be carefully considered.     

Maximal and minimal representations of gapped and non-gapped motifs of a string

The problems of finding maximal and minimal equivalent representations for gapped and non-gapped motifs as well as finding motifs that characterize a fixed set of occurrence locations for a given string are studied. We apply two equivalence relations on representations. The first one is the well-known occurrence-equivalence of motifs. The second equivalence is introduced for patterns of occurrence locations, to characterize such patterns by motifs. For both equivalences, quadratic-time algorithms are given for finding a maximal representative of an equivalence class. Finding a minimal representative is shown to be NP-complete in both cases. For non-gapped motifs suffix-tree-based linear-time algorithms are given for finding maximal and minimal representatives. Maximal (minimal) gapped motifs are composed of blocks that are maximal (minimal) non-gapped motifs, maximal and minimal non-gapped motifs thus making up a small basis for all motifs. The implied bound on the number of gapped motifs that have a fixed number of non-gapped blocks is also given.     

Approximate Matching of Run-Length Compressed Strings

We focus on the problem of approximate matching of strings that have been compressed using run-length encoding. Previous studies have concentrated on the problem of computing the longest common subsequence (LCS) between two strings of length m and n , compressed to m' and n' runs. We extend an existing algorithm for the LCS to the Levenshtein distance achieving O(m'n+n'm) complexity. Furthermore, we extend this algorithm to a weighted edit distance model, where the weights of the three basic edit operations can be chosen arbitrarily. This approach also gives an algorithm for approximate searching of a pattern of m letters (m' runs) in a text of n letters (n' runs) in O(mm'n') time. Then we propose improvements for a greedy algorithm for the LCS, and conjecture that the improved algorithm has O(m'n') expected case complexity. Experimental results are provided to support the conjecture.     

Inkjet-printed passive UHF RFID tags: review and performance evaluation

In this paper, the performance and the feasibility of inkjet-printed dipole RFID tag antennas are experimentally studied in the implementation of identifying objects with different electromagnetic properties. To estimate the performance quality, we compare our results to those obtained using traditional etched copper dipole tag antennas. We first examine the performance characteristics, i.e. the read range and the radiation patterns, of tags in free space. Then we attach the tags directly to target objects and compare the optimum performance on target objects to that of the tag in free space. The obtained results provide information about the behaviour of inkjet-printed tag antennas on different objects. This information can be used to optimize the inkjet-printed tag antenna performance for use on objects with different characteristics.     

A randomized approximation algorithm for computing bucket orders

We show that a simple randomized algorithm has an expected constant factor approximation guarantee for fitting bucket orders to a set of pairwise preferences.     

Finding lowest common ancestors in arbitrarily directed trees

It is well known how to preprocess a rooted tree in linear time to yield the lowest common ancestor of any given pair of nodes in constant time. We generalize these algorithms for graphs called Arbitrarily Directed Trees, or ADTs. Such trees are obtained by reversing the directions of some edges in trees with the customary “root-to-leaf” orientation of edges.     

A note on language equations involving morphisms

Language equations, ETOL systems, L systems