Highly Efficient IR to NIR Upconversion in Gd2O2S: Er3+ for Photovoltaic Applications

Upconversion (UC) is a promising option to enhance the efficiency of solar cells by conversion of sub-bandgap infrared photons to higher energy photons that can be utilized by the solar cell. The UC quantum yield is a key parameter for a successful application. Here the UC luminescence properties of Er3+-doped Gd2O2S are investigated by means of luminescence spectroscopy, quantum yield measurements, and excited state dynamics experiments. Excitation into the maximum of the 4I15/2 → 4I13/2 Er3+ absorption band around 1500 nm induces very efficient UC emission from different Er3+ excited states with energies above the silicon bandgap, in particular, the emission originating from the 4I11/2 state around 1000 nm. Concentration dependent studies reveal that the highest UC quantum yield is realized for a 10% Er3+-doping concentration. The UC luminescence is compared to the well-known Er3+-doped β-NaYF4 UC material for which the highest UC quantum yield has been reported for 25% Er3+. The UC internal quantum yields were measured in this work for Gd2O2S: 10%Er3+ and β-NaYF4: 25%Er3+ to be 12 ± 1% and 8.9 ± 0.7%, respectively, under monochromatic excitation around 1500 nm at a power of 700 W/m2. The UC quantum yield reported here for Gd2O2S: 10%Er3+ is the highest value achieved so far under monochromatic excitation into the 4I13/2 Er3+ level. Power dependence and lifetime measurements were performed to understand the mechanisms responsible for the efficient UC luminescence. We show that the main process yielding 4I11/2 UC emission is energy transfer UC.

Efficient team actions: Outline of a theory of teams in sport

So far, social psychology in sport has preliminary focused on team cohesion, and many studies and meta analyses tried to demonstrate a relation between cohesiveness of a team and it's performance. How a team really co-operates and how the individual actions are integrated towards a team action is a question that has received relatively little attention in research. This may, at least in part, be due to a lack of a theoretical framework for collective actions, a dearth that has only recently begun to challenge sport psychologists. In this presentation a framework for a comprehensive theory of teams in sport is outlined and its potential to integrate the following presentations is put up for discussion. Based on a model developed by von Cranach, Ochsenbein and Valach (1986), teams are information processing organisms, and team actions need to be investigated on two levels: the individual team member and the group as an entity. Elements to be considered are the task, the social structure, the information processing structure and the execution structure. Obviously, different task require different social structures, communication and co-ordination. From a cognitivist point of view, internal representations (or mental models) guide the behaviour mainly in situations requiring quick reactions and adaptations, were deliberate or contingency planning are difficult. In sport teams, the collective representation contains the elements of the team situation, that is team task and team members, and of the team processes, that is communication and co-operation. Different meta-perspectives may be distinguished and bear a potential to explain the actions of efficient teams. Cranach, M. von, Ochsenbein, G., & Valach, L. (1986).The group as a self-active system: Outline of a theory of group action. European Journal of Social Psychology, 16, 193-229.

Estimating and quantifying uncertainties on level sets using the Vorob'ev expectation and deviation with Gaussian process models

Several methods based on Kriging have recently been proposed for calculating a probability of failure involving costly-to-evaluate functions. A closely related problem is to estimate the set of inputs leading to a response exceeding a given threshold. Now, estimating such a level set—and not solely its volume—and quantifying uncertainties on it are not straightforward. Here we use notions from random set theory to obtain an estimate of the level set, together with a quantification of estimation uncertainty. We give explicit formulae in the Gaussian process set-up and provide a consistency result. We then illustrate how space-filling versus adaptive design strategies may sequentially reduce level set estimation uncertainty.

An efficient simulation algorithm for the generalized von Mises distribution of order two

In this article we propose an exact efficient simulation algorithm for the generalized von Mises circular distribution of order two. It is an acceptance-rejection algorithm with a piecewise linear envelope based on the local extrema and the inflexion points of the generalized von Mises density of order two. We show that these points can be obtained from the roots of polynomials and degrees four and eight, which can be easily obtained by the methods of Ferrari and Weierstrass. A comparative study with the von Neumann acceptance-rejection, with the ratio-of-uniforms and with a Markov chain Monte Carlo algorithms shows that this new method is generally the most efficient.

KrigInv: An efficient and user-friendly implementation of batch-sequential inversion strategies based on kriging

Several strategies relying on kriging have recently been proposed for adaptively estimating contour lines and excursion sets of functions under severely limited evaluation budget. The recently released R package KrigInv 3 is presented and offers a sound implementation of various sampling criteria for those kinds of inverse problems. KrigInv is based on the DiceKriging package, and thus benefits from a number of options concerning the underlying kriging models. Six implemented sampling criteria are detailed in a tutorial and illustrated with graphical examples. Different functionalities of KrigInv are gradually explained. Additionally, two recently proposed criteria for batch-sequential inversion are presented, enabling advanced users to distribute function evaluations in parallel on clusters or clouds of machines. Finally, auxiliary problems are discussed. These include the fine tuning of numerical integration and optimization procedures used within the computation and the optimization of the considered criteria.

A reliable, traffic-adaptive and energy-efficient link layer for wireless sensor networks

The paper presents a link layer stack for wireless sensor networks, which consists of the Burst-aware Energy-efficient Adaptive Medium access control (BEAM) and the Hop-to-Hop Reliability (H2HR) protocol. BEAM can operate with short beacons to announce data transmissions or include data within the beacons. Duty cycles can be adapted by a traffic prediction mechanism indicating pending packets destined for a node and by estimating its wake-up times. H2HR takes advantage of information provided by BEAM such as neighbour information and transmission information to perform per-hop congestion control. We justify the design decisions by measurements in a real-world wireless sensor network testbed and compare the performance with other link layer protocols.

Energy-Efficient Management Of Heterogeneous Wireless Sensor Networks

Various applications for the purposes of event detection, localization, and monitoring can benefit from the use of wireless sensor networks (WSNs). Wireless sensor networks are generally easy to deploy, with flexible topology and can support diversity of tasks thanks to the large variety of sensors that can be attached to the wireless sensor nodes. To guarantee the efficient operation of such a heterogeneous wireless sensor networks during its lifetime an appropriate management is necessary. Typically, there are three management tasks, namely monitoring, (re) configuration, and code updating. On the one hand, status information, such as battery state and node connectivity, of both the wireless sensor network and the sensor nodes has to be monitored. And on the other hand, sensor nodes have to be (re)configured, e.g., setting the sensing interval. Most importantly, new applications have to be deployed as well as bug fixes have to be applied during the network lifetime. All management tasks have to be performed in a reliable, time- and energy-efficient manner. The ability to disseminate data from one sender to multiple receivers in a reliable, time- and energy-efficient manner is critical for the execution of the management tasks, especially for code updating. Using multicast communication in wireless sensor networks is an efficient way to handle such traffic pattern. Due to the nature of code updates a multicast protocol has to support bulky traffic and endto-end reliability. Further, the limited resources of wireless sensor nodes demand an energy-efficient operation of the multicast protocol. Current data dissemination schemes do not fulfil all of the above requirements. In order to close the gap, we designed the Sensor Node Overlay Multicast (SNOMC) protocol such that to support a reliable, time-efficient and energy-efficient dissemination of data from one sender node to multiple receivers. In contrast to other multicast transport protocols, which do not support reliability mechanisms, SNOMC supports end-to-end reliability using a NACK-based reliability mechanism. The mechanism is simple and easy to implement and can significantly reduce the number of transmissions. It is complemented by a data acknowledgement after successful reception of all data fragments by the receiver nodes. In SNOMC three different caching strategies are integrated for an efficient handling of necessary retransmissions, namely, caching on each intermediate node, caching on branching nodes, or caching only on the sender node. Moreover, an option was included to pro-actively request missing fragments. SNOMC was evaluated both in the OMNeT++ simulator and in our in-house real-world testbed and compared to a number of common data dissemination protocols, such as Flooding, MPR, TinyCubus, PSFQ, and both UDP and TCP. The results showed that SNOMC outperforms the selected protocols in terms of transmission time, number of transmitted packets, and energy-consumption. Moreover, we showed that SNOMC performs well with different underlying MAC protocols, which support different levels of reliability and energy-efficiency. Thus, SNOMC can offer a robust, high-performing solution for the efficient distribution of code updates and management information in a wireless sensor network. To address the three management tasks, in this thesis we developed the Management Architecture for Wireless Sensor Networks (MARWIS). MARWIS is specifically designed for the management of heterogeneous wireless sensor networks. A distinguished feature of its design is the use of wireless mesh nodes as backbone, which enables diverse communication platforms and offloading functionality from the sensor nodes to the mesh nodes. This hierarchical architecture allows for efficient operation of the management tasks, due to the organisation of the sensor nodes into small sub-networks each managed by a mesh node. Furthermore, we developed a intuitive -based graphical user interface, which allows non-expert users to easily perform management tasks in the network. In contrast to other management frameworks, such as Mate, MANNA, TinyCubus, or code dissemination protocols, such as Impala, Trickle, and Deluge, MARWIS offers an integrated solution monitoring, configuration and code updating of sensor nodes. Integration of SNOMC into MARWIS further increases performance efficiency of the management tasks. To our knowledge, our approach is the first one, which offers a combination of a management architecture with an efficient overlay multicast transport protocol. This combination of SNOMC and MARWIS supports reliably, time- and energy-efficient operation of a heterogeneous wireless sensor network.

Analysis of fractal electrodes for efficient neural stimulation

Planar electrodes are increasingly used in therapeutic neural stimulation techniques such as functional electrical stimulation, epidural spinal cord stimulation (ESCS), and cortical stimulation. Recently, optimized electrode geometries have been shown to increase the efficiency of neural stimulation by increasing the variation of current density on the electrode surface. In the present work, a new family of modified fractal electrode geometries is developed to enhance the efficiency of neural stimulation. It is shown that a promising approach in increasing the neural activation function is to increase the "edginess" of the electrode surface, a concept that is explained and quantified by fractal mathematics. Rigorous finite element simulations were performed to compute electric potential produced by proposed modified fractal geometries. The activation of 256 model axons positioned around the electrodes was then quantified, showing that modified fractal geometries required a 22% less input power while maintaining the same level of neural activation. Preliminary in vivo experiments investigating muscle evoked potentials due to median nerve stimulation showed encouraging results, supporting the feasibility of increasing neural stimulation efficiency using modified fractal geometries.

Virological and phylogenetic characterization of attenuated small ruminant lentivirus isolates eluding efficient serological detection

Three field isolates of small ruminant lentiviruses (SRLVs) were derived from a mixed flock of goats and sheep certified for many years as free of caprine arthritis encephalitis virus (CAEV). The phylogenetic analysis of pol sequences permitted to classify these isolates as A4 subtype. None of the animals showed clinical signs of SRLV infection, confirming previous observations which had suggested that this particular subtype is highly attenuated, at least for goats. A quantitative real time PCR strategy based on primers and probes derived from a highly variable env region permitted us to classify the animals as uninfected, singly or doubly infected. The performance of different serological tools based on this classification revealed their profound inadequacy in monitoring animals infected with this particular SRLV subtype. In vitro, the isolates showed differences in their cytopathicity and a tendency to replicate more efficiently in goat than sheep cells, especially in goat macrophages. By contrast, in vivo, these viruses reached significantly higher viral loads in sheep than in goats. Both env subtypes infected goats and sheep with equal efficiency. One of these, however, reached significantly higher viral loads in both species. In conclusion, we characterized three isolates of the SRLV subtype A4 that efficiently circulate in a mixed herd of goats and sheep in spite of their apparent attenuation and a strict physical separation between goats and sheep. The poor performance of the serological tools applied indicates that, to support an SRLV eradication campaign, it is imperative to develop novel, subtype specific tools.