The research presented covers the theory and design of feedback-driven matching networks for radio frequency power amplifiers. The study examines amplifier classifications, types of tunable components, feedback typologies, and control systems to achieve the desired operation. The work centers on designing and implementing a tunable matching network for an amplifier's input and output. The tunable systems provide the amplifier with a wide range of operational frequencies at reasonable power levels comparable to today's modern communication systems and produce millisecond-based tuning times. Simulated results are verified against a fabricated system prototype and tweaked to provide further insight into the design's operation.

Thesis advisor: M. Utku Ünver / Thesis advisor: M. Bumin Yenmez / This thesis is a collection of three essays in market design concerning designs of matching markets, affirmative action schemes, and COVID-19 testing policies. In Chapter 1, we explore the possibility of designing matching mechanisms that can accommodate non-standard choice behavior. In the standard model of matching markets, preferences over potential assignments encode participants' choice behavior. Our contribution to this literature is introducing behavioral participants to matching theory's setup. We pin down the necessary and sufficient conditions on participants' choice behavior for the existence of stable and incentive compatible matching mechanisms. Our results imply that well-functioning matching markets can be designed to adequately accommodate a plethora of non-standard (and standard) choice behaviors. We illustrate the applicability of our results by demonstrating that a simple modification in a commonly used matching mechanism enables it to accommodate non-standard choice behavior. In Chapter 2, we show that commonly used methods in reserving positions for beneficiaries of affirmative action are often inadequate in settings where affirmative action policies apply at two levels simultaneously, for instance, at university and itsdepartments. We present a comprehensive evaluation of existing procedures and formally and empirically document their shortcomings. We propose a new solution with appealing theoretical properties and quantify the benefits of adopting it using recruitment advertisement data from India. Our theoretical analysis hints at new possibilities for future work in the literature on the theory of apportionment (of parliamentary seats). Chapter 3 delves into the designs of the commonly used and advocated COVID-19 testing policies to resolve a conflict between their allocative efficiency and the ability to identify the infection rates. We present a novel comparison of various COVID-19 testing policies that allows us to pin down ordinally efficient testing policies that generate reliable estimates of infection rates while prioritizing testing of persons suspected of having the disease. / Thesis (PhD) — Boston College, 2022. / Submitted to: Boston College. Graduate School of Arts and Sciences. / Discipline: Economics.

Given a digraph D = (V, A), with vertex set V and arc set A, a set S ⊆ V is a dominating set if for every vertex v in V \ S, there are a vertex u in S and an arc (u, v) from u to v. In this chapter we consider the counterparts in directed graphs of independent, dominating, independent dominating, and total dominating sets in undirected graphs.

In honor of Professor Peter Slater's work on paired domination, we introduce a relaxed version of paired domination, namely semipaired domination. Let G be a graph with vertex set V and no isolated vertices. A subset S ⊆ V is a semipaired dominating set of G if every vertex in V \ S is adjacent to a vertex in S and S can be partitioned into two element subsets such that the vertices in each subset are at most distance two apart. The semipaired domination number γPr2(G) is the minimum cardinality of a semipaired dominating set of G. In this paper, we study the semipaired domination versus other domination parameters. For example, we show that γ(G) ≤ γPr2(G) ≤ 2γ(G) and 2/3γt(G) ≤ γPr2(T) ≤ γ 4/3γt(G), where γ(G) and γt(G) denote the domination and total domination numbers of G. We characterize the trees G for which γPr2(G) = 2γ(G).

A new method for assessing the performance of popular image matching algorithms is presented. Specifically, the method assesses the type of images under which each of the algorithms reviewed herein perform to its maximum or highest efficiency. The efficiency is measured in terms of the number of matches founds by the algorithm and the number of type I and type II errors encountered when the algorithm is tested against a specific pair of images. Current comparative studies asses the performance of the algorithms based on the results obtained in different criteria such as speed, sensitivity, occlusion, and others. These studies are an important resource to understand the behavior of the algorithms and their influence on the results obtained. But they do not account for the inherent characteristics of the algorithms that derive the process through which the matching features are evaluated, filtered, and finally selected. Moreover, these methods cannot be used to predict the efficiency or level of accuracy that could be reached by using one algorithm or the other depending on of the type of images. This ability to predict performance becomes handy in situations where time is a limiting factor in a project because it allows one to quickly predict which algorithm will save the most time and resources.

Objective: The study assesses the impact of dual enrollment participation on remediation and completion for traditional first time, full-time freshmen at a community college in Northeast Tennessee. Method: This study began with the full population of 1,232 students who enrolled between 2008 and 2012 at a community college in northeast Tennessee the fall semester after finishing high school. The population was required to have American College Testing (ACT) scores, completely fill out the Free Application for Federal Student Aid (FAFSA), enroll full-time as a degree-seeking student, and complete the first fall semester. Propensity score matching was utilized to eliminate self-selection bias and enable parametric comparisons using optimal matching of dual enrollment participants and non-participants while controlling for a range of covariates. Results: The analyses showed that community college students who participated in dual enrollment were (a) 9% or nearly 3.4 times less likely to take remediation, (b) 26% or nearly 2.5 times more likely to graduate in 2 years, and (c) 28% or nearly 1.5 times more likely to graduate in 3 years. Contributions: This study contributes to the literature showing that dual enrollment reduces remediation rates and assists in timely completions for community college students. Policy recommendations are to increase equitable participation, normalize dual enrollment for students academically able to do college coursework, align state terminology with the nation, and improve data for future research.

Computing correspondences or maps between shapes is one of the oldest problems in Computer Graphics and Geometry Processing with a wide range of applications from deformation transfer, statistical shape analysis, to co-segmentation and exploration among a myriad others. A good map is supposed to be continuous, as-bijective-as-possible, accurate if there are ground-truth corresponding landmarks given, and lowdistortionw.r.t. different measures, for example as-conformal-as-possible to preserve the angles. This thesis contributes to the area of non-rigid shape matching and map space exploration in Geometry Processing. Specifically, we consider the discrete setting, where the shapes are discretized as amesh structure consisting of vertices, edges, and polygonal faces. In the simplest case, we only consider the graph structure with vertices and edges only. In this thesis, we design algorithms to compute soft correspondences between discrete shapes. Specifically, (1)we propose different regularizers, including orientation-preserving operator and the Resolvent Laplacian Commutativity operator, to promote the shape correspondences in the functional map framework. (2) We propose two refinement methods, namely BCICP and ZoomOut, to improve the accuracy, continuity, bijectivity and the coverage of given point-wisemaps. (3)We propose a tree structure and an enumeration algorithm to explore the map space between a pair of shapes that can update multiple high-quality dense correspondences.

No description available.

ClueMaker (CM) is a Java desktop application used for data visualisation (via graph) by subjects like insurance companies (to unravel fraud activity), Czech organisation Hlí- dač Státu (to identify connections between subjects) or many others. This application currently uses a naive way to merge entities from different data sources (matching one field by exact string match). Goal of this thesis is to analyse, create and integrate a solution to CM, which would allow for merging entities based on entity similarity, and integrate such solution into the GUI of CM. Such solution should allow the user to merge two graph entities, show user the potentially same or very similar entities and allow for a global scan of the graph for potential merges. Furthermore, this solution should make use of data relationships within CM in addition to the attributes of entities. 1

京都大学 / 0048 / 新制・課程博士 / 博士(社会健康医学) / 甲第19636号 / 社医博第69号 / 新制||社医||9(附属図書館) / 32672 / 京都大学大学院医学研究科社会健康医学系専攻 / (主査)教授 佐藤 俊哉, 教授 今中 雄一, 教授 小西 郁生 / 学位規則第4条第1項該当 / Doctor of Public Health / Kyoto University / DFAM