A class of orthogonal pairs of subgroups of the group 𝑂(𝑁)

1965 ◽  
pp. 39-69
Author(s):  
A. M. Vasil′ev
Keyword(s):  
Orthogonal Pairs

Abstract 3252:OrthoCARs: Engineered human IL-2/IL-2Rb orthogonal pairs selectively enhance CAR T cell anti-tumor efficacy and durability of response

2020 ◽  
Author(s):  
Paul-Joseph Aspuria ◽  
Michele Bauer ◽  
Sandro Vivona ◽  
Steven E. Kauder ◽  
Scott McCauley ◽  
...  
Keyword(s):  
T Cell ◽  
Car T Cell ◽  
Car T ◽  
Orthogonal Pairs

A printed wide-beamwidth circularly polarized antenna via two pairs of radiating slots placed in a square contour

2016 ◽  
Vol 9 (3) ◽  
pp. 649-656 ◽  
Author(s):  
Neng-Wu Liu ◽  
Lei Zhu ◽  
Wai-Wa Choi
Keyword(s):  
Ground Plane ◽  
Large Angle ◽  
Axial Ratio ◽  
Dielectric Substrate ◽  
Slot Antenna ◽  
Radiation Patterns ◽  
Circularly Polarized ◽  
Low Profile ◽  
Orthogonal Pairs ◽  
Good Agreement

A low-profile circularly polarized (CP) slot antenna to achieve a wide axial-ratio (AR) beamwidth is proposed in this paper. The radiating patch consists of two orthogonal pairs of parallel slots etched symmetrically onto a ground plane. Firstly, our theoretical study demonstrates that the CP radiation can be satisfactorily achieved at the broadside, when the vertical and horizontal paired-slots are excited in the same amplitude with 90° phase difference. Secondly, the principle of CP radiation of the proposed antenna on an infinite ground plane is described. Through analyzing the spacing between two parallel slots, the |Eθ| and |Eφ| radiation patterns can be made approximately identical with each other over a large angle range. As such, the slot antenna achieves a wide AR beamwidth. After that, the 3 dB AR beamwidth with respect to the size of a finite ground plane is investigated to constitute a practical CP antenna on a finite ground plane. In final, the proposed CP antenna with a 1–4 probe-to-microstrip feeding network is designed and fabricated on a finite ground plane of a dielectric substrate. Measured results are shown to be in good agreement with the simulated ones about the gain, reflection coefficient, AR bandwidth, and radiation patterns. Most importantly, a wide 3 dB AR beamwidth of 126° and low-profile property with the height of 0.036λ0 are achieved.

Fracture detection using azimuthal variation of P-wave moveout from orthogonal seismic survey lines

Geophysics ◽  
1999 ◽  
Vol 64 (4) ◽  
pp. 1193-1201 ◽  
Author(s):  
Xiang‐Yang Li
Keyword(s):  
P Wave ◽  
Seismic Survey ◽  
Fracture Detection ◽  
Data Set ◽  
The North ◽  
High Impedance ◽  
Impedance Contrast ◽  
The North Sea ◽  
Marine Exploration ◽  
Orthogonal Pairs

An algorithm is proposed for determining the fracture orientation based on the azimuthal variations in the P-wave reflection moveout for a target interval. The differential moveout between orthogonal survey lines from the bottom of a given target shows cos 2ϕ variations with the line azimuth ϕ measured from the fracture strike for a fixed offset. A configuration of four intersecting survey lines may be used to quantify the fracture strike. The four lines form two orthogonal pairs, and the fracture strike can be obtained by analyzing the crossplot of the two corresponding pairs of the differential moveouts. An offset‐depth ratio (x/z) of 1.0 or greater (up to 1.5) is often required to quantify the moveout difference reliably. The sensitivity of the method is further enhanced by low/high impedance contrast at the top target interface but is greatly reduced by high/low impedance contrast. The method may be particularly useful in marine exploration with repeated surveys of various vintages where continuous azimuthal coverage is often not available. A data set from the North Sea is used to illustrate the technique.

Construction and generation of OCDMA code families using a complete row-wise orthogonal pairs algorithm

2013 ◽  
Vol 67 (10) ◽  
pp. 868-874 ◽  
Author(s):  
M. Ravi Kumar ◽  
P. Ganguly ◽  
S.S. Pathak ◽  
N.B. Chakrabarti
Keyword(s):  
Orthogonal Pairs

scholarly journals Fine-Grained Reductions from Approximate Counting to Decision

2021 ◽  
Vol 13 (2) ◽  
pp. 1-24
Author(s):  
Holger Dell ◽  
John Lapinskas
Keyword(s):  
General Framework ◽  
Time Algorithm ◽  
Approximate Counting ◽  
Counting Problems ◽  
Negative Weight ◽  
Exponential Time ◽  
Fine Grained ◽  
Exponential Time Hypothesis ◽  
All Pairs Shortest Path ◽  
Orthogonal Pairs

In this article, we introduce a general framework for fine-grained reductions of approximate counting problems to their decision versions. (Thus, we use an oracle that decides whether any witness exists to multiplicatively approximate the number of witnesses with minimal overhead.) This mirrors a foundational result of Sipser (STOC 1983) and Stockmeyer (SICOMP 1985) in the polynomial-time setting, and a similar result of Müller (IWPEC 2006) in the FPT setting. Using our framework, we obtain such reductions for some of the most important problems in fine-grained complexity: the Orthogonal Vectors problem, 3SUM, and the Negative-Weight Triangle problem (which is closely related to All-Pairs Shortest Path). While all these problems have simple algorithms over which it is conjectured that no polynomial improvement is possible, our reductions would remain interesting even if these conjectures were proved; they have only polylogarithmic overhead and can therefore be applied to subpolynomial improvements such as the n 3 / exp(Θ (√ log n ))-time algorithm for the Negative-Weight Triangle problem due to Williams (STOC 2014). Our framework is also general enough to apply to versions of the problems for which more efficient algorithms are known. For example, the Orthogonal Vectors problem over GF( m ) d for constant  m can be solved in time n · poly ( d ) by a result of Williams and Yu (SODA 2014); our result implies that we can approximately count the number of orthogonal pairs with essentially the same running time. We also provide a fine-grained reduction from approximate #SAT to SAT. Suppose the Strong Exponential Time Hypothesis (SETH) is false, so that for some 1 < c < 2 and all k there is an O ( c n )-time algorithm for k -SAT. Then we prove that for all k , there is an O (( c + o (1)) n )-time algorithm for approximate # k -SAT. In particular, our result implies that the Exponential Time Hypothesis (ETH) is equivalent to the seemingly weaker statement that there is no algorithm to approximate #3-SAT to within a factor of 1+ɛ in time 2 o ( n )/ ɛ 2 (taking ɛ > 0 as part of the input).

Simultaneous correlation of orthogonal pairs of complementary sequences

2009 ◽  
Vol 45 (25) ◽  
pp. 1332 ◽  
Author(s):  
P.G. Donato ◽  
M.A. Funes ◽  
M.N. Hadad ◽  
D.O. Carrica
Keyword(s):  
Complementary Sequences ◽  
Orthogonal Pairs

On orthogonal pairs in categories and localization

1992 ◽  
pp. 211-224 ◽  
Author(s):  
Carles Casacuberta ◽  
Georg Peschke ◽  
Markus Pfenniger
Keyword(s):  
Orthogonal Pairs

Orthogonal pairs of weak*-closed inner ideals in a JBW*-triple

2007 ◽  
Vol 143 (1) ◽  
pp. 121-144 ◽  
Author(s):  
C. MARTIN EDWARDS
Keyword(s):  
Symmetric Space ◽  
Banach Spaces ◽  
Dual Space ◽  
State Spaces ◽  
Geometrical Condition ◽  
Physical Systems ◽  
Algebraic Properties ◽  
Symmetric Complex ◽  
Image Position ◽  
Orthogonal Pairs

AbstractPre-symmetric complex Banach spaces have been proposed as models for state spaces of physical systems. A neutral GL-projection on a pre-symmetric space represents an operation on the corresponding system, and has as its range a further pre-symmetric space which represents the state space of the resulting system. Two neutral GL-projectionsSandTon the pre-symmetric spaceA*are said to be L-orthogonal if for all elementsxinSA*andyinTA*,By studying the algebraic properties of the dual spaceAofA*, which is a JBW*-triple, it is shown that, provided that the orthogonal neutral GL-projectionsSandTsatisfy a certain geometrical condition, there exists a smallest neutral GL-projectionS∨Tmajorizing bothSandT, and thatS,TandS∨Tform a compatible family.

Sign in / Sign up

Export Citation Format

Share Document