The use of FEP Teflon in solar cell cover technology

FEP plastic film was used as a cover and as an adhesive to bond cover glasses to silicon solar cells. Various anti-reflective coatings were applied to cells and subsequently covered with FEP. Short circuit currents were measured before and after application of the coating and of the FEP. FEP was bonded to seven of the nine differently coated cells, with no change in the total short circuit current in four cases

Sampled Weighted Min-Hashing for Large-Scale Topic Mining

We present Sampled Weighted Min-Hashing (SWMH), a randomized approach to automatically mine topics from large-scale corpora. SWMH generates multiple random partitions of the corpus vocabulary based on term co-occurrence and agglomerates highly overlapping inter-partition cells to produce the mined topics. While other approaches define a topic as a probabilistic distribution over a vocabulary, SWMH topics are ordered subsets of such vocabulary. Interestingly, the topics mined by SWMH underlie themes from the corpus at different levels of granularity. We extensively evaluate the meaningfulness of the mined topics both qualitatively and quantitatively on the NIPS (1.7 K documents), 20 Newsgroups (20 K), Reuters (800 K) and Wikipedia (4 M) corpora. Additionally, we compare the quality of SWMH with Online LDA topics for document representation in classification.Comment: 10 pages, Proceedings of the Mexican Conference on Pattern Recognition 201

Distribution of sizes of erased loops for loop-erased random walks

We study the distribution of sizes of erased loops for loop-erased random walks on regular and fractal lattices. We show that for arbitrary graphs the probability $P(l)$ of generating a loop of perimeter $l$ is expressible in terms of the probability $P_{st}(l)$ of forming a loop of perimeter $l$ when a bond is added to a random spanning tree on the same graph by the simple relation $P(l)=P_{st}(l)/l$. On $d$-dimensional hypercubical lattices, $P(l)$ varies as $l^{-\sigma}$ for large $l$, where $\sigma=1+2/z$ for $1<d<4$, where z is the fractal dimension of the loop-erased walks on the graph. On recursively constructed fractals with $\tilde{d} < 2$ this relation is modified to $\sigma=1+2\bar{d}/{(\tilde{d}z)}$, where $\bar{d}$ is the hausdorff and $\tilde{d}$ is the spectral dimension of the fractal.Comment: 4 pages, RevTex, 3 figure

Ionized dopant concentrations at the heavily doped surface of a silicon solar cell

Data are combined with concentrations obtained by a bulk measurement method using successive layer removal with measurements of Hall effect and resistivity. From the MOS (metal-oxide-semiconductor) measurements it is found that the ionized dopant concentration N has the value (1.4 + or - 0.1) x 10 to the 20th power/cu cm at distances between 100 and 220 nm from the n(+) surface. The bulk measurement technique yields average values of N over layers whose thickness is 2000 nm. Results show that, at the higher concentrations encountered at the n(+) surface, the MOS C-V technique, when combined with a bulk measurement method, can be used to evaluate the effects of materials preparation methodologies on the surface and near surface concentrations of silicon cells

On the cause of the flat-spot phenomenon observed in silicon solar cells at low temperatures and low intensities

A model is presented that explains the "flat-spot" (FS) power loss phenomenon observed in silicon solar cells operating deep space (low temperature, low intensity) conditions. Evidence is presented suggesting that the effect is due to localized metallurgical interactions between the silicon substrate and the contact metallization. These reactions are shown to result in localized regions in which the PN junction is destroyed and replaced with a metal-semiconductor-like interface. The effects of thermal treatment, crystallographic orientation, junction depth, and metallurization are presented along with a method of preventing the effect through the suppression of vacancy formation at the free surface of the contact metallization. Preliminary data indicating the effectiveness of a TiN diffusion barrier in preventing the effect are also given

Fractal-like Distributions over the Rational Numbers in High-throughput Biological and Clinical Data

Recent developments in extracting and processing biological and clinical data are allowing quantitative approaches to studying living systems. High-throughput sequencing, expression profiles, proteomics, and electronic health records are some examples of such technologies. Extracting meaningful information from those technologies requires careful analysis of the large volumes of data they produce. In this note, we present a set of distributions that commonly appear in the analysis of such data. These distributions present some interesting features: they are discontinuous in the rational numbers, but continuous in the irrational numbers, and possess a certain self-similar (fractal-like) structure. The first set of examples which we present here are drawn from a high-throughput sequencing experiment. Here, the self-similar distributions appear as part of the evaluation of the error rate of the sequencing technology and the identification of tumorogenic genomic alterations. The other examples are obtained from risk factor evaluation and analysis of relative disease prevalence and co-mordbidity as these appear in electronic clinical data. The distributions are also relevant to identification of subclonal populations in tumors and the study of the evolution of infectious diseases, and more precisely the study of quasi-species and intrahost diversity of viral populations

Scalable Mining of Common Routes in Mobile Communication Network Traffic Data

A probabilistic method for inferring common routes from mobile communication network traffic data is presented. Besides providing mobility information, valuable in a multitude of application areas, the method has the dual purpose of enabling efficient coarse-graining as well as anonymisation by mapping individual sequences onto common routes. The approach is to represent spatial trajectories by Cell ID sequences that are grouped into routes using locality-sensitive hashing and graph clustering. The method is demonstrated to be scalable, and to accurately group sequences using an evaluation set of GPS tagged data

Optimization of Robustness of Complex Networks

Networks with a given degree distribution may be very resilient to one type of failure or attack but not to another. The goal of this work is to determine network design guidelines which maximize the robustness of networks to both random failure and intentional attack while keeping the cost of the network (which we take to be the average number of links per node) constant. We find optimal parameters for: (i) scale free networks having degree distributions with a single power-law regime, (ii) networks having degree distributions with two power-law regimes, and (iii) networks described by degree distributions containing two peaks. Of these various kinds of distributions we find that the optimal network design is one in which all but one of the nodes have the same degree, $k_1$ (close to the average number of links per node), and one node is of very large degree, $k_2 \sim N^{2/3}$, where $N$ is the number of nodes in the network.Comment: Accepted for publication in European Physical Journal

You can't see what you can't see: Experimental evidence for how much relevant information may be missed due to Google's Web search personalisation

The influence of Web search personalisation on professional knowledge work is an understudied area. Here we investigate how public sector officials self-assess their dependency on the Google Web search engine, whether they are aware of the potential impact of algorithmic biases on their ability to retrieve all relevant information, and how much relevant information may actually be missed due to Web search personalisation. We find that the majority of participants in our experimental study are neither aware that there is a potential problem nor do they have a strategy to mitigate the risk of missing relevant information when performing online searches. Most significantly, we provide empirical evidence that up to 20% of relevant information may be missed due to Web search personalisation. This work has significant implications for Web research by public sector professionals, who should be provided with training about the potential algorithmic biases that may affect their judgments and decision making, as well as clear guidelines how to minimise the risk of missing relevant information.Comment: paper submitted to the 11th Intl. Conf. on Social Informatics; revision corrects error in interpretation of parameter Psi/p in RBO resulting from discrepancy between the documentation of the implementation in R (https://rdrr.io/bioc/gespeR/man/rbo.html) and the original definition (https://dl.acm.org/citation.cfm?id=1852106) as per 20/05/201