Reconfigurable Matching Networks for RF Amplifiers

This article presents applications of reconfigurable matching networks for RF amplifier design. Two possible solutions are given, one where the switching element is a PIN diode, and the other is based on graphene. Due to the fact that its conductivity depends on applied bias voltage, the graphene-based circuits can be used in microwave circuits as controllable elements. The structure of the proposed switch is very simple and it is particularly convenient for microstrip-based circuits. Because of that, a design of reconfigurable amplifier with the graphene-based switch is presented together with the one which has the PIN diode switch. Both amplifiers have the same specifications, and the one with the PIN diode switch is fabricated. The amplifier utilizing the PIN switch was used as a reference to make a comparison the two types of switches. Results of both amplifiers are very similar which indicates possible future applications of the graphene-based switch.

Recommending peers for learning: Matching on dissimilarity in interpretations to provoke breakdown

People recommenders are a widespread feature of social networking sites and educational social learning platforms alike. However, when these systems are used to extend learners’ Personal Learning Networks, they often fall short of providing recommendations of learning value to their users. This paper proposes a design of a people recommender based on content-based user profiles, and a matching method based on dissimilarity therein. It presents the results of an experiment conducted with curators of the content curation site Scoop.it!, where curators rated personalized recommendations for contacts. The study showed that matching dissimilarity of interpretations of shared interests is more successful in providing positive experiences of breakdown for the curator than is matching on similarity. The main conclusion of this paper is that people recommenders should aim to trigger constructive experiences of breakdown for their users, as the prospect and potential of such experiences encourage learners to connect to their recommended peers.

Flexibele Leerroutes voor Propedeusestudenten: Grounded Theory Onderzoek naar het Identificeren van Studentkenmerken in de Matching, ten behoeve van een Vraaggerichte, Gepersonaliseerde Leerroute in de Propedeuse Social Work

De Groot, D. (2016). Flexibele Leerroutes voor Propedeusestudenten: Grounded Theory Onderzoek naar het Identificeren van Studentkenmerken in de Matching, ten behoeve van een Vraaggerichte, Gepersonaliseerde Leerroute in de Propedeuse Social Work. Juli, 26, 2016, Heerlen, Nederland: Open Universiteit.

University of Southampton thesis end matter template for use with Word 2007/2010/2013/2016 (PC) and Word 2008/2011/2016 (Mac)

This template covers the final sections of a thesis - appendices, glossary, list of references and bibliography. Support materials for using the template are referenced near the start of the file. You will want to use this in conjunction with the Front Matter http://www.edshare.soton.ac.uk/9405/ and Chapter http://www.edshare.soton.ac.uk/9403/ templates.

COMP1205 self-assessment template CV

Appendix needed for the CV coursework.

WEB6203 Interdisciplinary Thinking: Report Assignment and Template

The template is based on the chapter version of the university thesis template

The Pennsylvania Adoption Exchange Improves Its Matching Process

The Pennsylvania Adoption Exchange (PAE) helps case workers who represent children in state custody by recommending prospective families for adoption. We describe PAE's operational challenges using case worker surveys and analyze child outcomes through a regression analysis of data collected over multiple years. A match recommendation spreadsheet tool implemented by PAE incorporates insights from this analysis and allows PAE managers to better utilize available information. Using a discrete-event simulation of PAE, we justify the value of a statewide adoption network and demonstrate the importance of better information about family preferences for increasing the percentage of children who are successfully adopted. Finally, we detail a series of simple improvements that PAE achieved through collecting more valuable information and aligning incentives for families to provide useful preference information.

Multiscale morphology design of hybrid halide perovskites through a polymeric template

Hybrid halide perovskites have emerged as promising active constituents of next generation solution processable optoelectronic devices. During their assembling process, perovskite components undergo very complex dynamic equilibria starting in solution and progressing throughout film formation. Finding a methodology to control and affect these equilibria, responsible for the unique morphological diversity observed in perovskite films, constitutes a fundamental step towards a reproducible material processability. Here we propose the exploitation of polymer matrices as cooperative assembling components of novel perovskite CH3NH3PbI3 : polymer composites, in which the control of the chemical interactions in solution allows a predictable tuning of the final film morphology. We reveal that the nature of the interactions between perovskite precursors and polymer functional groups, probed by Nuclear Magnetic Resonance (NMR) spectroscopy and Dynamic Light Scattering (DLS) techniques, allows the control of aggregates in solution whose characteristics are strictly maintained in the solid film, and permits the formation of nanostructures that are inaccessible to conventional perovskite depositions. These results demonstrate how the fundamental chemistry of perovskite precursors in solution has a paramount influence on controlling and monitoring the final morphology of CH3NH3PbI3 (MAPbI3) thin films, foreseeing the possibility of designing perovskite : polymer composites targeting diverse optoelectronic applications.

Leveraging Multiple Features for Image Retrieval and Matching

The goal of image retrieval and matching is to find and locate object instances in images from a large-scale image database. While visual features are abundant, how to combine them to improve performance by individual features remains a challenging task. In this work, we focus on leveraging multiple features for accurate and efficient image retrieval and matching. We first propose two graph-based approaches to rerank initially retrieved images for generic image retrieval. In the graph, vertices are images while edges are similarities between image pairs. Our first approach employs a mixture Markov model based on a random walk model on multiple graphs to fuse graphs. We introduce a probabilistic model to compute the importance of each feature for graph fusion under a naive Bayesian formulation, which requires statistics of similarities from a manually labeled dataset containing irrelevant images. To reduce human labeling, we further propose a fully unsupervised reranking algorithm based on a submodular objective function that can be efficiently optimized by greedy algorithm. By maximizing an information gain term over the graph, our submodular function favors a subset of database images that are similar to query images and resemble each other. The function also exploits the rank relationships of images from multiple ranked lists obtained by different features. We then study a more well-defined application, person re-identification, where the database contains labeled images of human bodies captured by multiple cameras. Re-identifications from multiple cameras are regarded as related tasks to exploit shared information. We apply a novel multi-task learning algorithm using both low level features and attributes. A low rank attribute embedding is joint learned within the multi-task learning formulation to embed original binary attributes to a continuous attribute space, where incorrect and incomplete attributes are rectified and recovered. To locate objects in images, we design an object detector based on object proposals and deep convolutional neural networks (CNN) in view of the emergence of deep networks. We improve a Fast RCNN framework and investigate two new strategies to detect objects accurately and efficiently: scale-dependent pooling (SDP) and cascaded rejection classifiers (CRC). The SDP improves detection accuracy by exploiting appropriate convolutional features depending on the scale of input object proposals. The CRC effectively utilizes convolutional features and greatly eliminates negative proposals in a cascaded manner, while maintaining a high recall for true objects. The two strategies together improve the detection accuracy and reduce the computational cost.

Validation of AltiKa Matching Pursuit Rain Flag

The major drawback of Ka band, operating frequency of the AltiKa altimeter on board SARAL, is its sensitivity to atmospheric liquid water. Even light rain or heavy clouds can strongly attenuate the signal and distort the signal leading to erroneous geophysical parameters estimates. A good detection of the samples affected by atmospheric liquid water is crucial. As AltiKa operates at a single frequency, a new technique based on the detection by a Matching Pursuit algorithm of short scale variations of the slope of the echo waveform plateau has been developed and implemented prelaunch in the ground segment. As the parameterization of the detection algorithm was defined using Jason-1 data, the parameters were re-estimated during the cal-val phase, during which the algorithm was also updated. The measured sensor signal-to-noise ratio is significantly better than planned, the data loss due to attenuation by rain is significantly smaller than expected (<0.1%). For cycles 2 to 9, the flag detects about 9% of 1Hz data, 5.5% as rainy and 3.5 % as backscatter bloom (or sigma0 bloom). The results of the flagging process are compared to independent rain data from microwave radiometers to evaluate its performances in term of detection and false alarms.

Motion compensation with minimal residue dispersion matching criteria

Dissertação (mestrado)—Universidade de Brasília, Faculdade de Tecnoloigia, 2016.

Essays on Matching Markets and Their Equilibria

Matching theory and matching markets are a core component of modern economic theory and market design. This dissertation presents three original contributions to this area. The first essay constructs a matching mechanism in an incomplete information matching market in which the positive assortative match is the unique efficient and unique stable match. The mechanism asks each agent in the matching market to reveal her privately known type. Through its novel payment rule, truthful revelation forms an ex post Nash equilibrium in this setting. This mechanism works in one-, two- and many-sided matching markets, thus offering the first mechanism to unify these matching markets under a single mechanism design framework. The second essay confronts a problem of matching in an environment in which no efficient and incentive compatible matching mechanism exists due to matching externalities. I develop a two-stage matching game in which a contracting stage facilitates subsequent conditionally efficient and incentive compatible Vickrey auction stage. Infinite repetition of this two-stage matching game enforces the contract in every period. This mechanism produces inequitably distributed social improvement: parties to the contract receive all of the gains and then some. The final essay demonstrates the existence of prices which stably and efficiently partition a single set of agents into firms and workers, and match those two sets to each other. This pricing system extends Kelso and Crawford's general equilibrium results in a labor market matching model and links one- and two-sided matching markets as well.

RSLT: trasformazione di Open LinkedData in testi in linguaggio naturaletramite template dichiarativi

La diffusione del Semantic Web e di dati semantici in formato RDF, ha creato la necessità di un meccanismo di trasformazione di tali informazioni, semplici da interpretare per una macchina, in un linguaggio naturale, di facile comprensione per l'uomo. Nella dissertazione si discuterà delle soluzioni trovate in letteratura e, nel dettaglio, di RSLT, una libreria JavaScript che cerca di risolvere questo problema, consentendo la creazione di applicazioni web in grado di eseguire queste trasformazioni tramite template dichiarativi. Verranno illustrati, inoltre, tutti i cambiamenti e tutte le modi�che introdotte nella versione 1.1 della libreria, la cui nuova funzionalit�à principale �è il supporto a SPARQL 1.0.

QoE-aware power management in vehicle-to-grid networks:a matching-theoretic approach

Frequency, time and places of charging and discharging have critical impact on the Quality of Experience (QoE) of using Electric Vehicles (EVs). EV charging and discharging scheduling schemes should consider both the QoE of using EV and the load capacity of the power grid. In this paper, we design a traveling plan-aware scheduling scheme for EV charging in driving pattern and a cooperative EV charging and discharging scheme in parking pattern to improve the QoE of using EV and enhance the reliability of the power grid. For traveling planaware scheduling, the assignment of EVs to Charging Stations (CSs) is modeled as a many-to-one matching game and the Stable Matching Algorithm (SMA) is proposed. For cooperative EV charging and discharging in parking pattern, the electricity exchange between charging EVs and discharging EVs in the same parking lot is formulated as a many-to-many matching model with ties, and we develop the Pareto Optimal Matching Algorithm (POMA). Simulation results indicates that the SMA can significantly improve the average system utility for EV charging in driving pattern, and the POMA can increase the amount of electricity offloaded from the grid which is helpful to enhance the reliability of the power grid.