skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Loaded Microstrip Network Transmision-Line Metamaterials on an Irregular Grid
A planar loaded microstrip network metamaterial on an irregular grid for modeling 2-D electromagnetic environment in TE polarization is presented. The technique is applied to a Luneburg lens example toward printed circuit implementation and verification.  more » « less
Award ID(s):
1930032
PAR ID:
10450474
Author(s) / Creator(s):
;
Date Published:
Journal Name:
2022 IEEE International Symposium on Antennas and Propagation
Page Range / eLocation ID:
559 to 560
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. A set of reals is universally Baire if all of its continuous preimages in topological spaces have the Baire property. 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 is a type of generic absoluteness condition introduced by Woodin that asserts in strong terms that the theory of the universally Baire sets cannot be changed by set forcings. The π–«π–Ίπ—‹π—€π–Ύπ—Œπ— π–²π—Žπ—Œπ—…π—‚π—‡ π– π—‘π—‚π—ˆπ—† ( 𝖫𝖲𝖠 ) is a determinacy axiom isolated by Woodin. It asserts that the largest Suslin cardinal is inaccessible for ordinal definable surjections. Let 𝖫𝖲𝖠 - π—ˆπ—π–Ύπ—‹ - π—Žπ–‘ be the statement that in all (set) generic extensions there is a model of 𝖫𝖲𝖠 whose Suslin, co-Suslin sets are the universally Baire sets. We outline the proof that over some mild large cardinal theory, 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 is equiconsistent with 𝖫𝖲𝖠 - π—ˆπ—π–Ύπ—‹ - π—Žπ–‘ . In fact, we isolate an exact theory (in the hierarchy of strategy mice) that is equiconsistent with both (see Definition 3.1). As a consequence, we obtain that 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 is weaker than the theory β€œ 𝖹π–₯𝖒 + there is a Woodin cardinal which is a limit of Woodin cardinals.” This significantly improves upon the earlier consistency proof of 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 by Woodin. A variation of 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 , called π–³π—ˆπ—π–Ύπ—‹ 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 , is also shown to be equiconsistent with 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 over the same large cardinal theory. We also outline the proof that if V has a proper class of Woodin cardinals, a strong cardinal, and a generically universally Baire iteration strategy, then 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 holds after collapsing the successor of the least strong cardinal to be countable. This result is complementary to the aforementioned equiconsistency result, where it is shown that 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 holds in a generic extension of a certain minimal universe. This theorem is more general in that no minimal assumption is needed. A corollary of this is that 𝖫𝖲𝖠 - π—ˆπ—π–Ύπ—‹ - π—Žπ–‘ is not equivalent to 𝖲𝖾𝖺𝗅𝗂𝗇𝗀 . 
    more » « less
  2. null (Ed.)
    Abstract It is proved that a map $${\varphi }\colon R\to S$$ of commutative Noetherian rings that is essentially of finite type and flat is locally complete intersection if and only if $$S$$ is proxy small as a bimodule. This means that the thick subcategory generated by $$S$$ as a module over the enveloping algebra $$S\otimes _RS$$ contains a perfect complex supported fully on the diagonal ideal. This is in the spirit of the classical result that $${\varphi }$$ is smooth if and only if $$S$$ is small as a bimodule; that is to say, it is itself equivalent to a perfect complex. The geometric analogue, dealing with maps between schemes, is also established. Applications include simpler proofs of factorization theorems for locally complete intersection maps. 
    more » « less
  3. A status updating system is considered in which a variable length code is used to transmit messages to a receiver over a noisy channel. The goal is to optimize the codewords lengths such that successfully-decoded messages are timely. That is, such that the age-of-information (AoI) at the receiver is minimized. A hybrid ARQ (HARQ) scheme is employed, in which variable-length incremental redundancy (IR) bits are added to the originally-transmitted codeword until decoding is successful. With each decoding attempt, a non-zero processing delay is incurred. The optimal codewords lengths are analytically derived utilizing a sequential differential optimization (SDO) framework. The framework is general in that it only requires knowledge of an analytical expression of the positive feedback (ACK) probability as a function of the codeword length. 
    more » « less
  4. Abstract A subset E of a metric space X is said to be starlike-equivalent if it has a neighbourhood which is mapped homeomorphically into $$\mathbb{R}^n$$ for some n , sending E to a starlike set. A subset $$E\subset X$$ is said to be recursively starlike-equivalent if it can be expressed as a finite nested union of closed subsets $$\{E_i\}_{i=0}^{N+1}$$ such that $$E_{i}/E_{i+1}\subset X/E_{i+1}$$ is starlike-equivalent for each i and $$E_{N+1}$$ is a point. A decomposition $$\mathcal{D}$$ of a metric space X is said to be recursively starlike-equivalent, if there exists $$N\geq 0$$ such that each element of $$\mathcal{D}$$ is recursively starlike-equivalent of filtration length N . We prove that any null, recursively starlike-equivalent decomposition $$\mathcal{D}$$ of a compact metric space X shrinks, that is, the quotient map $$X\to X/\mathcal{D}$$ is the limit of a sequence of homeomorphisms. This is a strong generalisation of results of Denman–Starbird and Freedman and is applicable to the proof of Freedman’s celebrated disc embedding theorem. The latter leads to a multitude of foundational results for topological 4-manifolds, including the four-dimensional PoincarΓ© conjecture. 
    more » « less
  5. Abstract BackgroundThe Vaccine Ontology (VO) is a biomedical ontology that standardizes vaccine annotation. Errors in VO will affect a multitude of applications that it is being used in. Quality assurance of VO is imperative to ensure that it provides accurate domain knowledge to these downstream tasks. Manual review to identify and fix quality issues (such as missing hierarchical is-a relations) is challenging given the complexity of the ontology. Automated approaches are highly desirable to facilitate the quality assurance of VO. MethodsWe developed an automated lexical approach that identifies potentially missingis-arelations in VO. First, we construct two types of VO concept-pairs: (1) linked; and (2) unlinked. Each concept-pair further derives an Acquired Term Pair (ATP) based on their lexical features. If the same ATP is obtained by a linked concept-pair and an unlinked concept-pair, this is considered to indicate a potentially missingis-arelation between the unlinked pair of concepts. ResultsApplying this approach on the 1.1.192 version of VO, we were able to identify 232 potentially missingis-arelations. A manual review by a VO domain expert on a random sample of 70 potentially missingis-arelations revealed that 65 of the cases were valid missingis-arelations in VO (a precision of 92.86%). ConclusionsThe results indicate that our approach is highly effective in identifying missingis-arelation in VO. 
    more » « less