Assessing the performance of a building integrated BP c-Si PV system

In this study, the performance, yield and characteristics of a 16 year old photovoltaic (PV) system installation have been investigated. The technology, BP Saturn modules which were steel-blue polycrystalline silicon cells are no longer in production. A bespoke monitoring system has been designed to monitor the characteristics of 6 refurbished strings, of 18 modules connected in series. The total output of the system is configured to 6.5 kWp (series to parallel configuration). In addition to experimental results, the performance ratio (PR) of known values was simulated using PVSyst, a simulation software package. From calculations using experimental values, the PV system showed approximately 10% inferior power outputs to what would have been expected as standard test conditions. However, efficiency values in comparison to standard test conditions and the performance ratio (w75% from PVSyst simulations) over the past decade have remained practically the same. This output though very relevant to the possible performance and stability of aging cells, requires additional parametric studies to develop a more robust argument. The result presented in this paper is part of an on-going investigation into PV system aging effects.

The impact of number mismatch and passives on the real-time processing of relative clauses

Language processing plays a crucial role in language development, providing the ability to assign structural representations to input strings (e.g., Fodor, 1998). In this paper we aim at contributing to the study of children's processing routines, examining the operations underlying the auditory processing of relative clauses in children compared to adults. English-speaking children (6–8;11) and adults participated in the study, which employed a self-paced listening task with a final comprehension question. The aim was to determine (i) the role of number agreement in object relative clauses in which the subject and object NPs differ in terms of number properties, and (ii) the role of verb morphology (active vs. passive) in subject relative clauses. Even though children's off-line accuracy was not always comparable to that of adults, analyses of reaction times results support the view that children have the same structural processing reflexes observed in adults.

Coherent and semiclassical states in a magnetic field in the presence of the Aharonov-Bohm solenoid

A new approach to constructing coherent states (CS) and semiclassical states (SS) in a magnetic-solenoid field is proposed. The main idea is based on the fact that the AB solenoid breaks the translational symmetry in the xy-plane; this has a topological effect such that there appear two types of trajectories which embrace and do not embrace the solenoid. Due to this fact, one has to construct two different kinds of CS/SS which correspond to such trajectories in the semiclassical limit. Following this idea, we construct CS in two steps, first the instantaneous CS (ICS) and then the time-dependent CS/SS as an evolution of the ICS. The construction is realized for nonrelativistic and relativistic spinning particles both in (2 + 1) and (3 + 1) dimensions and gives a non-trivial example of SS/CS for systems with a nonquadratic Hamiltonian. It is stressed that CS depending on their parameters (quantum numbers) describe both pure quantum and semiclassical states. An analysis is represented that classifies parameters of the CS in such respect. Such a classification is used for the semiclassical decompositions of various physical quantities.

A new proposal for the picture changing operators in the minimal pure spinor formalism

Using a new proposal for the ""picture lowering"" operators, we compute the tree level scattering amplitude in the minimal pure spinor formalism by performing the integration over the pure spinor space as a multidimensional Cauchy-type integral. The amplitude will be written in terms of the projective pure spinor variables, which turns out to be useful to relate rigorously the minimal and non-minimal versions of the pure spinor formalism. The natural language for relating these formalisms is the. Cech-Dolbeault isomorphism. Moreover, the Dolbeault cocycle corresponding to the tree-level scattering amplitude must be evaluated in SO(10)/SU(5) instead of the whole pure spinor space, which means that the origin is removed from this space. Also, the. Cech-Dolbeault language plays a key role for proving the invariance of the scattering amplitude under BRST, Lorentz and supersymmetry transformations, as well as the decoupling of unphysical states. We also relate the Green`s function for the massless scalar field in ten dimensions to the tree-level scattering amplitude and comment about the scattering amplitude at higher orders. In contrast with the traditional picture lowering operators, with our new proposal the tree level scattering amplitude is independent of the constant spinors introduced to define them and the BRST exact terms decouple without integrating over these constant spinors.

An all-substrings common subsequence algorithm

Given two strings A and B of lengths n(a) and n(b), n(a) <= n(b), respectively, the all-substrings longest common subsequence (ALCS) problem obtains, for every substring B` of B, the length of the longest string that is a subsequence of both A and B. The ALCS problem has many applications, such as finding approximate tandem repeats in strings, solving the circular alignment of two strings and finding the alignment of one string with several others that have a common substring. We present an algorithm to prepare the basic data structure for ALCS queries that takes O(n(a)n(b)) time and O(n(a) + n(b)) space. After this preparation, it is possible to build that allows any LCS length to be retrieved in constant time. Some trade-offs between the space required and a matrix of size O(n(b)(2)) the querying time are discussed. To our knowledge, this is the first algorithm in the literature for the ALCS problem. (C) 2007 Elsevier B.V. All rights reserved.

Perfect Simulation of a Coupling Achieving the (d)over-bar-distance Between Ordered Pairs of Binary Chains of Infinite Order

We explicitly construct a stationary coupling attaining Ornstein`s (d) over bar -distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of i.i.d. sequences of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that we can identify the first regeneration point to the left of the origin almost surely.

Coincidence Wecken homotopies versus Wecken homotopies relative to a fixed homotopy in one of the maps

We study the 1-parameter Wecken problem versus the restricted Wecken problem, for coincidence free pairs of maps between surfaces. For this we use properties of the function space between two surfaces and of the pure braid group on two strings of a surface. When the target surface is either the 2-sphere or the torus it is known that the two problems are the same. We classify most pairs of homotopy classes of maps according to the answer of the two problems are either the same or different when the target is either projective space or the Klein bottle. Some partial results are given for surfaces of negative Euler characteristic. (C) 2010 Elsevier B.V. All rights reserved.

Twisted conjugacy classes in symplectic groups, mapping class groups and braid groups (with an appendix written jointly with Francois Dahmani)

We prove that the symplectic group Sp(2n, Z) and the mapping class group Mod(S) of a compact surface S satisfy the R(infinity) property. We also show that B(n)(S), the full braid group on n-strings of a surface S, satisfies the R(infinity) property in the cases where S is either the compact disk D, or the sphere S(2). This means that for any automorphism phi of G, where G is one of the above groups, the number of twisted phi-conjugacy classes is infinite.

Braid groups of non-orientable surfaces and the Fadell-Neuwirth short exact sequence

Let M be a compact, connected non-orientable surface without boundary and of genus g >= 3. We investigate the pure braid groups P,(M) of M, and in particular the possible splitting of the Fadell-Neuwirth short exact sequence 1 -> P(m)(M \ {x(1), ..., x(n)}) hooked right arrow P(n+m)(M) (P*) under right arrow P(n)(M) -> 1, where m, n >= 1, and p* is the homomorphism which corresponds geometrically to forgetting the last m strings. This problem is equivalent to that of the existence of a section for the associated fibration p: F(n+m)(M) -> F(n)(M) of configuration spaces, defined by p((x(1), ..., x(n), x(n+1), ..., x(n+m))) = (x(1), ..., x(n)). We show that p and p* admit a section if and only if n = 1. Together with previous results, this completes the resolution of the splitting problem for surface pure braid groups. (C) 2009 Elsevier B.V. All rights reserved.

COMPARISON OF PARTIAL SHADING LOSSES IN FREE FIELD PV-PLANTS WITH DIFFERENT ARRAY CONFIGURATIONS

A common problem when planning large free field PV-plants is optimizing the ground occupation ratio while maintaining low shading losses. Due to the complexity of this task, several PV-plants have been built using various configurations. In order to compare the shading losses of different PV technologies and array designs, empirical performance data of five free field PV-plants operating in Germany was analyzed. The data collected comprised 140 winter days from October 2011 until March 2012. The relative shading losses were estimated by comparing the energy output of selected arrays in the front rows (shading-free) against that of shaded arrays in the back rows of the same plant. The results showed that landscape mounting with mc-Si PV-modules yielded significantly better results than portrait one. With CIGS modules, making cross-table strings using the lower modules was not beneficial as expected and had more losses than a one-string-per-table layout. Parallel substrings with CdTe showed relatively low losses. Among the two CdTe products analyzed, none showed a significantly better performance.

All maximal-pairs in step-leap representation of melodic sequence

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special “binary don’t care” symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established “step–leap” representation is examined. In the step–leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don’t care symbols are used to represent the possible overlapping between the various abstract categories e.g. *=s, *=l and #=-s, #=-l. We propose an O(n+d(n-d)+z)-time algorithm for computing all maximal-pairs in a given sequence x=x[1..n], where x contains d occurrences of binary don’t cares and z is the number of reported maximal-pairs.

All maximal-pairs in step-leap representation of melodic sequence

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special “binary don’t care” symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established “step–leap” representation is examined. In the step–leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don’t care symbols are used to represent the possible overlapping between the various abstract categories e.g. *=s, *=l and #=-s, #=-l. We propose an O(n+d(n-d)+z)-time algorithm for computing all maximal-pairs in a given sequence x=x[1..n], where x contains d occurrences of binary don’t cares and z is the number of reported maximal-pairs.

Fases de stripes nos cupratos : um estudo do modelo t-J anisotrópico

Neste trabalho realizamos um estudo de um buraco em um antiferromagneto, como parte de uma revisão de diferentes técnicas de abordagem das fases de “stripes” nos cupratos supercondutores. Estudamos a transição do formalismo de “strings” para um buraco no modelo t - Jz bidimensional, onde existe uma solução analítica, para a solução de pólaron de spin no modelo t - J isotrópico através da aproximação de Born auto-consistente. A forma funcional dos picos de quase-partícula, do peso espectral e do “gap” espectral foi investigada numericamente em detalhe, em função da anisotropia magnética. O movimento de um pólaron de spin na presença de uma parede de domínio antiferromagnética (ADW) em antifase, como uma realização da configuração de “stripes” nos planos CuO dos cupratos de baixa dopagem, também foi analisada.

Representação e Anáilse de Gramáticas de Grafos

Os sistemas computacionais estão tomando proporções cada vez maiores envolvendo situações bastante complexas, onde muitas vezes erros são inaceitáveis, como em sistemas bancários, sistemas de controle de tráfego aéreo, etc... Para obter software confiável e com desempenho aceitável, pode-se aliar técnicas de desenvolvimento formal de software a técnicas de simulação de sistemas. O ambiente PLATUS reúne essas duas áreas: modelos de simulação são descritos usando gramáticas de grafos uma linguagem de especificação formal. Gramáticas de grafos são uma generalização de gramáticas de Chomsky, substituindo strings por grafos. Neste trabalho, serão tratadas gramáticas de grafos baseados em objetos, um modelo onde vértices e arcos são tipados, e as especificações são modulares (a especificação de um sistema consiste em várias gramáticas de grafos combinadas). Assim, o modelo de um sistema pode ser descrito de forma precisa, e a linguagem de especificação é bastante abstrata e expressiva. Num ambiente de simulação a questão da recuperação de dados merece uma atenção especial, uma vez que a eficiência do simulador está diretamente ligada a agilidade na obtenção das informações. Neste trabalho, o objetivo principal é definir uma representação para gramáticas de grafos que facilite o armazenamento, a recuperação e análise das estruturas identificadas no ambiente PLATUS, ou seja, gramáticas de grafos baseadas em objetos. São definidas também funções que implementam os procedimentos necessários, para a recuperação de dados durante a simulação. A eficiência dessas funções é demonstrada através do cálculo de sua ordem de complexidade. As estruturas são validadas através da implementação de um protótipo de banco de dados.

A Gagarinita e fases associadas no Granito Madeira (Pitinga, Amazonas)

O trabalho descreve a ocorrência de gagarinita-(Y) das porções mineralizadas de criolita da base do Depósito Criolítico Maciço associado à subfácies albita granito do Granito Madeira (1.8Ma) na jazida de Pitinga (Sn, Nb, Ta e criolita), onde o Y e ETR serão explorados como co-produtos. A gagarinita forma cristais anédricos de até 7mm, intersticiais ou inclusos na criolita, de cristalização anterior à criolita dos bolsões. Todos os cristais apresentam texturas típicas de exsolução, pela primeira vez descritas em fluoretos. Os padrões de exsolução são variados. Os cristais exsolvidos têm até 0,4mm, são incolores, as cores de interferência são de primeira ordem, com birrefringência 0,005-0,007, são U(-), com retardo de 150 a 210nm. A fase exsolvida distribui-se uniformemente em toda a extensão dos grãos da gagarinita-(Y), inclusive na borda; segue uma ou mais orientações preferenciais e tem dimensões semelhantes. Podem ocorrer coalescência de diferentes cristais exsolvidos, resultando em strings e stringlets. Mais raramente, a orientação é menos evidente e as dimensões dos cristais são mais variáveis No contato gagarinita/criolita, reconhece-se a formação da fase exsolvida como anterior à cristalização da criolita. A análise modal de uma população de grãos de gagarinita-(Y) com os diversos padrões texturais de exsolução fornece o valor médio de 25,8% (considerado estatisticamente representativo) de proporção de fase exsolvida em relação à fase hospedeira. Os parâmetros cristalinos da gagarinita-(Y) determinados a partir de análises por DRX são compatíveis com os da literatura. Análises por MSE, FRX e MEV da gagarinita-(Y) mostram uma composição bastante homogênea. A fórmula estrutural média calculada na base de 2(ETR+Y+Ca) é Na0,24Ca0,58Y1,01ETR0,39F5,81. O padrão de ETR normalizado ao condrito é caracterizado por enriquecimento em ETRP e anomalia negativa em Eu. A composição da fase exsolvida obtida por MSE, calculada para um total de cátions igual a 1, é Ce0,53-0,66 La0,09-0,26 Nd0,08-0,26 Sm0,01-0,04 Eu0,01Y0-0,03 F3,3-4,14. Esta fórmula é semelhante à da fluocerita, cujos picos característicos, entretanto, não ocorrem nos difratogramas. O padrão de ETR mostra um fracionamento contínuo dos ETR com empobrecimento em ETRP e discreta anomalia positiva em Eu. A composição da gagarinita inicial foi reconstituída considerando-se as proporções modais das fases hospedeira e exsolvida, obtendo-se Na0,19Ca0,48Y0,83ETR0,69F6,27. O padrão de ETR é plano com anomalia negativa em Eu menos acentuada que na gagarinita hospedeira Antes da exsolução, o sistema mineral comportava-se provavelmente como uma solução sólida com a substituição - + 2ETR3+<=> Na+ + Ca2+ + Y3+ . Formou-se, assim, uma gagarinita inicial excepcionalmente rica em ETRL (cátions relativamente grandes) cuja presença foi compensada por vacâncias, notadamente no sítio de coordenação VI. A diminuição da temperatura desestabilizou a estrutura mineral que exsolveu os cátions de ETR com raio iônico maior que o do Sm. A gagarinita hospedeira preservou os conteúdos de Y, ETRP (com exceção do Sm que se repartiu entre ela e a fase exsolvida) e Na (e Ca), constituindo uma estrutura estável, menos afetada por vacâncias e com um balanço de cargas bastante equilibrado. A fase exsolvida é um fluoreto com razão cátions/flúor= 1/3, correspondendo à composição da fluocerita. Sua estrutura não pôde ser determinada: picos da fluocerita não foram identificados e uma estrutura semelhante à da gagarinita (razão cátions/flúor= 1/2) parece pouco provável. Estudos subseqüentes poderão definir se trata-se de um novo mineral, polimorfo da fluocerita.