Search

The paper presents the results of the analysis on measured parameters of harmonics at the node of the high-voltage network. The measurements were made at the node connecting the pulp-and-paper mill to the 220 kV supply network. This load is nonlinear and has a large capacity. Particular attention is paid to the distributions of the current and voltage harmonics. The paper clearly shows probabilistic properties of the measured parameters of harmonics

We derive the capacity region of the two-user dirty-paper Gaussian multiaccess channel (MAC) with conferencing encoders. In this MAC, prior to each transmission block, the transmitters can hold a conference in which they can communicate with each other over error-free bit pipes of given capacities. The received signal suffers not only from additive Gaussian noise but also from additive interference, which is known noncausally to the transmitters but not to the receiver. The additive interference is modeled as Gaussian or uniform over a sphere. We show that the interference can be perfectly mitigated, i.e., that the capacity region without interference can also be achieved in its presence. This holds irrespective of whether the transmitters learn the interference before or after the conference. It follows as a corollary that also for the MAC with degraded message sets, the interference can be perfectly mitigated if it is known noncausally to the transmitters. To derive our results, we generalize Costa's single-user writing-on-dirty-paper achievability result to channels with dependent interference and not-necessarily Gaussian noise.

We consider transmission over the ergodic fading multiple-antenna broadcast (MIMO-BC) channel with partial channel state information at the transmitter and full information at the receiver. Over the equivalent non-fading channel, capacity has recently been shown to be achievable using transmission schemes that were designed for the "dirty paper" channel. We focus on a similar "fading paper" model. The evaluation of the fading paper capacity is difficult to obtain. We confine ourselves to the linear-assignment capacity, which we define, and use convex analysis methods to prove that its maximizing distribution is Gaussian. We compare our fading-paper transmission to an application of dirty paper coding that ignores the partial state information and assumes the channel is fixed at the average fade. We show that a gain is easily achieved by appropriately exploiting the information. We also consider a cooperative upper bound on the sum-rate capacity as suggested by Sato. We present a numeric example that indicates that our scheme is capable of realizing much of this upper bound.

A dirty-paper channel is considered, where the transmitter knows the interference sequence up to a constant multiplicative factor, known only to the receiver. Lower bounds on the achievable rate of communication are derived by proposing a coding scheme that partially compensates for the imprecise channel knowledge.We focus on a communication scenario where the signal-to-noise ratio is high. Our approach is based on analyzing the performance achievable using lattice-based coding schemes. When the power of the interference is finite, we show that the achievable rate of this lattice-based coding scheme may be improved by a judicious choice of the scaling parameter at the receiver. We further show that the communication rate may be improved, for finite as well as infinite interference power, by allowing randomized scaling at the transmitter.

We compare the capacity of dirty-paper coding (DPC) to that of time-division multiple access (TDMA) for a multiple-antenna (multiple-input multiple-output (MIMO)) Gaussian broadcast channel (BC). We find that the sum-rate capacity (achievable using DPC) of the multiple-antenna BC is at most min(M,K) times the largest single-user capacity (i.e., the TDMA sum-rate) in the system, where M is the number of transmit antennas and K is the number of receivers. This result is independent of the number of receive antennas and the channel gain matrix, and is valid at all signal-to-noise ratios (SNRs). We investigate the tightness of this bound in a time-varying channel (assuming perfect channel knowledge at receivers and transmitters) where the channel experiences uncorrelated Rayleigh fading and in some situations we find that the dirty paper gain is upper-bounded by the ratio of transmit-to-receive antennas. We also show that min(M,K) upper-bounds the sum-rate gain of successive decoding over TDMA for the uplink channel, where M is the number of receive antennas at the base station and K is the number of transmitters.

In this paper we consider the quantum teleportation and entanglement swapping protocols used in quantum based networks for passing information between a sender and receiver. For the teleportation protocol we observe and identify relationships that exist between Einstein-Podolsky-Rosen (EPR) Bell states employed as quantum resources, measured sender values and the gates employed at the receiver side. For the entanglement swapping protocol we consider input and output EPR states and the relationship between the two. We include a review of the concepts and our findings from the analysis carried out.

Multiple Input and Multiple Output (MIMO) systems use multiple antennas at both transmitter and receiver ends for increasing link capacity and spectral efficiency. However, combining schemes used for such systems face critical issues such as presence of interference, signals to interference and noise ratios (SINRs) and complexity. To overcome the asserted issues; in this paper linear multiuser detection techniques are employed in over loaded MIMO systems where the number of transmit antennas (\(\varvec{N_t}\)) is greater than number of receiver antennas (\(\varvec{N_r}\)), using Hybrid Automatic Repeat request with Incremental Redundancy (HARQ IR). The primary aim of this research is to enhance bit error rate (BER) and throughput by transforming an overloaded MIMO systems (\(\varvec{N_t>N_r}\)) into critically loaded system (\(\varvec{N_t=N_r}\)) or under loaded MIMO systems (\(\varvec{N_t

Air-gap discharge in oil-paper insulation is one of the main types of partial discharge (PD) in power transformer. The discharge development stage for monitoring and diagnosis of transformer potential faults is a significant area of study. The method of wavelet packet energy entropy, which is based on different frequency bands energy distribution of PD signals at different insulation states, is provided to explore the variation characteristics of the whole PD process. In this paper, air-gap discharge model is built in the simulative transformer tank that collects PD signals based on constant voltage method. This model also utilizes wavelet packet decomposition method to partition PD signal bands obtaining signal energy distribution in each frequency band, as well as total signal energy tendency along with PD development process. Wavelet packet energy entropy, which is the new PD feature parameter describing the development process, represents the order degree of PD signals which corresponds to dielectric strength. Finally, because of the cyclic change of this method, the step points of wavelet packet entropy are taken as the way to effectively divide the PD development stage.

International audience; This work investigates optimal Degrees of Freedom (DoF) achieving schemes for the MISO Compound Broadcast Channels (BC) where a source is equipped with M antennas, and communicates with 2 single antennas receivers. We develop a modified Dirty Paper Coding scheme that yields the optimal DoF for some Compound MISO BCs in the complex field. This coding scheme offers a “non-linear” alternative to interference alignment at the receivers which yields higher rates in the finite ranges of power. For asymptotic power regimes, it allows for fractional DoF of 1/2, while being of simple formulation and straightforward application to secondary transmissions in Compound Cognitive networks.

Dirty paper codes are a powerful tool for combating known interference. However, there is a significant difference between knowing the transmitted interference sequence and knowing the received interference sequence, especially when the channel modifying the interference is uncertain. We present an upper bound on the capacity of a compound vector dirty paper channel where although an additive Gaussian sequence is known to the transmitter, the channel matrix between the interferer and receiver is uncertain but known to lie within a bounded set. Our bound is tighter than previous bounds in the low-SIR regime for the scalar version of the compound dirty paper channel and employs a construction that focuses on the relationship between the dimension of the message-bearing signal and the dimension of the additive state sequence. Additionally, a bound on the high-SNR behavior of the system is established., Comment: to be presented at ISIT 2013

The paper deals with the problem of defining the optimal topology for a distributed fault detection architecture for non-linear large-scale systems. A stochastic modelbased framework for diagnosis is formulated. The system structural graph is decomposed into subsystems and each subsystem is monitored by one local diagnoser. It is shown that overlapping of subsystems allows to improve the detectability properties of the monitoring architecture. Based on this theoretical result, an optimal decomposition design method is proposed, able to define the minimum number of detection units needed to guarantee the detectability of certain faults while minimizing the communication costs subject to some computation cost constraints. An algorithmic procedure is presented to solve the proposed optimal decomposition problem. Preliminary simulation results show the potential of the proposed approach. " 48 60 65

Significant progress in DNA nanotechnology has accelerated the development of molecular machines with functions like macroscale machines. However, the mobility of DNA self-assembled nanorobots is still dramatically limited due to challenges with designing and controlling nanoscale systems with many degrees of freedom. Here, an origami-inspired method to design transformable DNA nanomachines is presented. This approach integrates stiff panels formed by bundles of double-stranded DNA connected with foldable creases formed by single-stranded DNA. To demonstrate the method, a DNA version of the paper origami mechanism called a waterbomb base (WBB) consisting of six panels connected by six joints is constructed. This nanoscale WBB can follow four distinct motion paths to transform between five distinct configurations including a flat square, two triangles, a rectangle, and a fully compacted trapezoidal shape. To achieve this, the sequence specificity of DNA base-pairing is leveraged for the selective actuation of joints and the ion-sensitivity of base-stacking interactions is employed for the flattening of joints. In addition, higher-order assembly of DNA WBBs into reconfigurable arrays is achieved. This work establishes a foundation for origami-inspired design for next generation synthetic molecular robots and reconfigurable nanomaterials enabling more complex and controllable motion.

We develop a theoretical framework for rigid origami, and show how this framework can be used to connect rigid origami and results from cognate areas, such as the rigidity theory, graph theory, linkage folding and computer science. First, we give definitions on important concepts in rigid origami, then focus on how to describe the configuration space of a creased paper. The shape and 0-connectedness of the configuration space are analyzed using algebraic, geometric and numeric methods, where the key results from each method are gathered and reviewed., Comment: 29 pages, 7 figures, submitted to the Proceedings of the Royal Society A

A wideband Rayleigh fading channel is considered with causal channel state information (CSI) at the transmitter and no receiver CSI. A simple orthogonal code with energy detection rule at the receiver (similar to pulse position modulation in IEEE Trans. Inf. Theory, vol. 46, no. 4, Apr. 2000 and IEEE Trans. Inf. Theory, vol. 52 no. 5, May 2006) is shown to achieve the capacity of this channel in the wideband limit. This strategy transmits energy only when the channel gain exceeds a threshold, hence only needs causal transmitter CSI. In the wideband limit, this capacity without any receiver CSI is the same as the capacity with full receiver CSI, which is proportional to the logarithm of the bandwidth. Similar threshold-based pulse position modulation is shown to achieve the capacity per unit cost of the dirty-tape channel (dirty paper channel with causal transmitter CSI and no receiver CSI), which equals its capacity per unit cost with full receiver CSI. Then, a general discrete channel with i.i.d. states is considered. Each input has an associated cost and a zero cost input “0” exists. The channel state is assumed to be known at the transmitter in a causal manner. Capacity per unit cost is found for this channel and a simple orthogonal code is shown to achieve this capacity. Later, a novel orthogonal coding scheme is proposed for the case of causal transmitter CSI and a condition for equivalence of capacity per unit cost for causal and noncausal transmitter CSI is derived.

We introduce an algorithm for approximating a 2-manifold 3D mesh by a set of developable surfaces. Each developable surface is a generalized cylinder represented as a strip of triangles not necessarily taken from the original mesh. Our algorithm is automatic, creates easy-to-assemble pieces, and provides L"@K global error bounds. The algorithm consists of three stages. In the first stage, the mesh is segmented into meaningful components. The second stage approximates each of the mesh components in 3D by a set of triangle strips with smooth (non-jagged) boundaries that guarantee a maximal user-defined error relative to the original mesh. Finally, these strips are unfolded to the plane, resulting in flat patterns, which may be cut and assembled from paper. The approximation quality is controlled by a user-supplied parameter specifying the allowed Hausdorff distance between the input mesh and its piecewise-developable approximation. The strips generated by our algorithm may be parameterized to conform with the parameterization of the original mesh, if given, to facilitate texture mapping. We demonstrate this by physically assembling paper-craft models from the strips generated by our algorithm when run on several polygonal 3D mesh data sets.

In a recent paper (Computer Aided Geometric Design 23 (3), 243-260), Yang presented a novel kind of nonlinear and geometry driven subdivision scheme for curve interpolation. The author declared that this scheme was shape preserving when all free parameters were explicitly selected by some specific rules. In this note, we demonstrate that the author (a) ignored the consistency of the definition to straight edges, and also (b) did not give a perfect scheme and proof for the shape preserving subdivision.

Costa's “writing on dirty paper” result establishes that full state pre-cancellation can be attained in the Gel'fand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the assumptions that full channel knowledge is available at both the transmitter and the receiver. In this work we consider the scenario in which the state is multiplied by an ergodic fading process which is not known at the encoder. We study both the case in which the receiver has knowledge of the fading and the case in which it does not: for both models we derive inner and outer bounds to capacity and determine the distance between the two bounds when possible. For the channel without fading knowledge at either the transmitter or the receiver, the gap between inner and outer bounds is finite for a class of fading distributions which includes a number of canonical fading models. In the capacity approaching strategy for this class, the transmitter performs Costa's pre-coding against the mean value of the fading times the state while the receiver treats the remaining signal as noise. For the case in which only the receiver has knowledge of the fading, we determine a finite gap between inner and outer bounds for two classes of discrete fading distribution. The first class of distributions is the one in which there exists a probability mass larger than one half while the second class is the one in which the fading is uniformly distributed over values that are exponentially spaced apart. Unfortunately, the capacity in the case of a continuous fading distribution remains very hard to characterize.

Artificial chordal replacement with polytetrafluoroethylene suture lines is a well-accepted technique for mitral valve repair. This report presents a method of making chordal loops of the desired length using a strip of paper. This technique uses a simple, cost-free, and easily obtained material--a strip of paper--to prepare artificial chordal loops with its advantages.

Porin FomA in the outer membrane of Fusobacterium nucleatum is a trimeric protein, which exhibits permeability properties similar to that of the well-known enterobacterial diffusion porins. The proposed topology model of the FomA monomer depicts the β-barrel motif typical of diffusion porins, consisting of 16 antiparallel β-strands. To investigate the accuracy of the FomA model and assess the topological relationship with other porins, individual deletions of variable size in seven of the eight surface-exposed regions of the porin were genetically engineered. Deletions in the predicted loops L1 to L7 were tolerated by the FomA porins, as judged by a normal assembly in the outer membrane of Escherichia coli and a sustained pore-forming ability. Deletions in the largest proposed external region, loop L6, made the FomA porins considerably more permeable to antibiotics, indicating larger pore channels. The distinctly increased uptake rates and size exclusion limits displayed by the L6 deletion mutant porins, suggest that loop L6 folds back into the β-barrel thereby constricting the native FomA channel. Thus, the position of the channel constriction loop appears to be shifted towards the C terminus in the FomA porin, as compared to the crystal structures of five non-specific diffusion porins.

Crumpled sheets of paper tend to exhibit a specific and complex structure, which is described by physicists as ridge networks. Existing literature shows that the automation of ridge network detection in crumpled paper is very challenging because of its complex structure and measuring distortion. In this paper, we propose to model the ridge network as a weighted graph and formulate the ridge network detection as an optimization problem in terms of the graph density. First, we detect a set of graph nodes and then determine the edge weight between each pair of nodes to construct a complete graph. Next, we define a graph density criterion and formulate the detection problem to determine a subgraph with maximal graph density. Further, we also propose to refine the graph density by including a pairwise connectivity into the criterion to improve the connectivity of the detected ridge network. Our experimental results show that, with the density criterion, our proposed method effectively automates the ridge network detection.

One of the most ubiquitous examples of origami is the common paper shopping bag. In a common model of paper folding, there are a finite number of creases, between which the paper must stay rigid and flat, as if made of plastic or metal plates connected by hinges. We show that (maybe surprisingly), the paper shopping bag cannot be flattened under this model using the usual pattern of creases. This raises the question of what foldings are possible in this model? We introduce some techniques for foldability analysis, and show that the bag may be flattened by adding new creases, or by adding new material between creases.

We demonstrate control and synchronization of chaos in a Nd: YVO4 microchip laser. Stabilization of chaotic oscillations to high periodic orbits is experimentally and numerically accomplished by internal frequency resonance between the pump and loss modulation frequencies. Various periodic patterns can be extracted predictably from one chaotic oscillation by varing the pump modulation parameters. Characteristics of synchronization of chaos in two separate Nd: YVO4 microchip lasers are also analyzed in the case of employing two master-slave types and a mutually-coupled type. A secure optical communication system using chaos synchronization is numerically demonstrated.

In this article we show the relation between the theory of pulse shaping for WSSUS channels and the notion of approximate eigenstructure for time-varying channels. We consider pulse shaping for a general signaling scheme, called Weyl-Heisenberg signaling, which includes OFDM with cyclic prefix and OFDM/OQAM. The pulse design problem in the view of optimal WSSUS-averaged SINR is an interplay between localization and "orthogonality". The localization problem itself can be expressed in terms of eigenvalues of localization operators and is intimately connected to the concept of approximate eigenstructure of LTV channel operators. In fact, on the L2-level both are equivalent as we will show. The concept of "orthogonality" in turn can be related to notion of tight frames. The right balance between these two sides is still an open problem. However, several statements on achievable values of certain localization measures and fundamental limits on SINR can already be made as will be shown in the paper.

The current technique employed to determine the parameters which specify the betatron oscillation in the PEPII ring at SLAC is a global procedure in that the data from each BPM (Beam Position Monitor) is weighted equally. However for more accurate interaction point (IP) measurements it would be beneficial to weight the data from the BPMs closest to the IP much more heavily. Researchers are thus considering the possibility of developing a technique to determine the oscillation parameters near the IP using as few BPMs as possible. In this paper, allowing BPM gains and cross coupling, we show analytically that given data from N BPMs there remain 6N + 2 degrees of freedom in the matrices M{sub A,A}, M{sub B,A}, ..., M{sub N,N-1} unspecified by the observable data alone. From this we demonstrate that data from at least 3 BPMs is required to completely specify the system when the transfer maps between BPMs are assumed known, and that 4 BPMs may be more suitable.

The Tenth Summer Conference on General Topology and Applications was held August 15-18, 1994 at Vrije Universiteit, Amsterdam. There were four special sessions at the conference: (1) Continuum Theory and Dynamics, (2) Topology and Descriptive Set Theory, (3) Set Theoretic Topology, and (4) Infinite dimensional and Geometric Topology. In addition there were two minicourses: Topological Methods in Surface Dynamics and Topology and Descriptive Set Theory.

This short paper aims to recognize the correct decomposition for the total odd-mode capacitance of the coupled microstriplines and present an improved expression for the gap capacitances. The used procedure utilizes the results which were obtained earlier by the conformal mapping techniques.

The design rules of winding configurations and stator-pole/rotor-tooth (SP/RT) number combinations of doubly-fed flux-switching permanent magnet (DF-FSPM) machines are investigated in this paper based on coil-EMF vectors. The relationships between the components of stator and rotor coil-EMF vector diagrams are unveiled at first, including the numbers of stator and rotor phases, and the numbers of stator and rotor spokes. Then, the SP/RT number combinations are derived considering feasible stator/rotor phase number combinations and different winding configurations. The SP/RT number combinations are optimized considering the winding factors, magnetic field harmonics, unbalanced magnetic forces and machine diameter. It is shown that both of the stator and rotor pitch factors increase when the SP and RT numbers get closer. Furthermore, the influence of winding configurations and SP/RT number combinations on electromagnetic performances of DF-FSPM machines are analyzed by finite-element method. Finally, the analysis results are validated by experiment.

In this paper, we consider a general K-user Gaussian multiple-input multiple-output (MIMO) broadcast channel (BC). We assume that the channel state is deterministic and known to all the nodes. While the private-message capacity region is well known to be achievable with dirty paper coding (DPC), we are interested in the simpler linearly precoded transmission schemes. In particular, we focus on linear precoding schemes combined with rate-splitting (RS). First, we derive an achievable rate region with minimum mean square error (MMSE) precoding at the transmitter and joint decoding of the sub-messages at the receivers. Then, we study the achievable sum rate of this scheme and obtain two findings: 1) an analytically tractable upper bound on the sum rate that is shown numerically to be a close approximation, and 2) how to reduce the number of active streams -- crucial to the overall complexity -- while preserving the sum rate to within a constant loss. The latter results in two practical algorithms: a stream elimination algorithm and a stream ordering algorithm. Finally, we investigate the constant-gap optimality of linearly precoded RS with respect to the capacity. Our result reveals that, while the achievable rate of linear precoding alone can be arbitrarily far from the capacity, the introduction of RS can help achieve the capacity region to within a constant gap in the two-user case. Nevertheless, we prove that the RS scheme's constant-gap optimality does not extend to the three-user case. Specifically, we show, through a pathological example, that the gap between the sum rate and the sum capacity can be unbounded., This paper is accepted for publication in the IEEE Transactions on Information Theory. This paper is the revised version of "Linearly Precoded Rate Splitting: Optimality and Non-Optimality for MIMO Broadcast Channels"

The vanishing of the modified Euler characteristic for symmetrically arranged space-filling polytopes is given a general proof based on the topological concept of orbifolds. The modified Euler characteristic is applicable to such important crystallographic objects as asymmetric units and Dirichlet domains., The notion of the Euler characteristic of a polyhedron or tessellation has been the subject of in-depth investigations by many authors. Two previous papers worked to explain the phenomenon of the vanishing (or zeroing) of the modified Euler characteristic of a polyhedron that underlies a periodic tessellation of a space under a crystallographic space group. The present paper formally expresses this phenomenon as a theorem about the vanishing of the Euler characteristic of certain topological spaces called topological orbifolds. In this new approach, it is explained that the theorem in question follows from the fundamental properties of the orbifold Euler characteristic. As a side effect of these considerations, a theorem due to Coxeter about the vanishing Euler characteristic of a honeycomb tessellation is re-proved in a context which frees the calculations from the assumptions made by Coxeter in his proof. The abstract mathematical concepts are visualized with down-to-earth examples motivated by concrete situations illustrating wallpaper and 3D crystallographic space groups. In a way analogous to the application of the classic Euler equation to completely bounded solids, the formula proven in this paper is applicable to such important crystallographic objects as asymmetric units and Dirichlet domains.

In 1966, Zimmerman proposed a type of Möbius aromaticity that involves through‐space electron delocalization; it has since been widely applied to explain reactivity in pericyclic reactions, but is considered to be limited to transition‐state structures. Although the easily accessible hexahelicene radical anion has been known for more than half a century, it was overlooked that it exhibits a ground‐state minimum and robust Zimmerman‐Möbius aromaticity in its central noose‐like opening, becoming, hence, the oldest existing Möbius aromatic system and with smallest Möbius cycle known. Despite its overall aromatic stabilization energy of 13.6 kcal mol−1 (at B3LYP/6‐311+G**), the radical also features a strong, globally induced paramagnetic ring current along its outer edge. Exclusive global paramagnetic currents can also be found in other fully delocalized radical anions of 4N+2 π‐electron aromatic polycyclic benzenoid hydrocarbons (PAH), thus questioning the established magnetic criterion of antiaromaticity. As an example of a PAH with nontrivial topology, we studied a novel Möbius[16]cyclacene that has a non‐orientable surface manifold and a stable closed‐shell singlet ground state at several density functional theory levels. Its metallic monoanion radical (0.0095 eV band gap at HSE06/6‐31G* level) is also wave‐function stable and displays an unusual 4π‐periodic, magnetically induced ring current (reminiscent of the transformation behaviour of spinors under spatial rotation), thus indicating the existence of a new, Hückel‐rule‐evading type of aromaticity., Topology in chemistry: The consequences of Möbius topology are explored in anionic radicals of polycyclic aromatic hydrocarbons by DFT methods. A stable Zimmerman‐Möbius minimum in the noose region of the [6]helicene radical anion, constituting smallest and historically oldest Möbius aromatic cycle, is disclosed as well as a metallic Möbius cyclacenide nanohoop exhibiting an unprecedented 4π‐periodic strong aromatic ring current and unusual stability, defying Hückel's rule.

The current literature on intelligent reflecting surface (IRS) focuses on optimizing the IRS phase shifts to yield coherent beamforming gains, under the assumption of perfect channel state information (CSI) of individual IRS-assisted links, which is highly impractical. This work, instead, considers the random rotations scheme at the IRS in which the reflecting elements only employ random phase rotations without requiring any CSI. The only CSI then needed is at the base station (BS) of the overall channel to implement the beamforming transmission scheme. Under this framework, we derive the sum-rate scaling laws in the large number of users regime for the IRS-assisted multiple-input single-output (MISO) broadcast channel, with optimal dirty paper coding (DPC) scheme and the lower-complexity random beamforming (RBF) and deterministic beamforming (DBF) schemes at the BS. The random rotations scheme increases the sum-rate by exploiting multi-user diversity, but also compromises the gain to some extent due to correlation. Finally, energy efficiency maximization problems in terms of the number of BS antennas, IRS elements and transmit power are solved using the derived scaling laws. Simulation results show the proposed scheme to improve the sum-rate, with performance becoming close to that under coherent beamforming for a large number of users., Accepted in IEEE Transactions on Wireless Communications

Canonical G‐quadruplexes can adopt a variety of different topologies depending on the arrangement of propeller, lateral, or diagonal loops connecting the four G‐columns. A novel intramolecular G‐quadruplex structure is derived through inversion of the last G‐tract of a three‐layered parallel fold, associated with the transition of a single propeller into a lateral loop. The resulting (3+1) hybrid fold features three syn⋅anti⋅anti⋅anti G‐tetrads with a 3’‐terminal all‐syn G‐column. Although the ability of forming a duplex stem‐loop between G‐tracts seems beneficial for a propeller‐to‐lateral loop rearrangement, unmodified G‐rich sequences resist folding into the new (3+1) topology. However, refolding can be driven by the incorporation of syn‐favoring guanosine analogues into positions of the fourth G‐stretch. The presented hybrid‐type G‐quadruplex structure as determined by NMR spectroscopy may provide for an additional scaffold in quadruplex‐based technologies., Starting with a parallel‐stranded DNA G‐quadruplex, refolding into a novel (3+1) hybrid topology with a propeller‐propeller‐lateral loop architecture and an all‐syn 3’‐terminal G‐tract is reported. Although supported by additional stacking of a lateral duplex hairpin onto an outer G‐tetrad, the structural rearrangement must be enforced through the specific incorporation of syn‐favoring 8‐bromoguanosine analogues into the terminal G‐run.

A convenient form of graph paper is described that allows the frequency constant (f c ) and the MTF index ( n ) of many devices to be easily determined.

In recent MIC techniques, double-sided MIC has been studied because its advantages in propagation characteristics are greater than that conventional MIC's. A coupled microstrip slotline is one of them. Its application to various circuit elements has often been discussed. But the coupled microstrip slotline is essentially three-dimensional structure, so the analysis demands a rigorous three-dimensional treatment. Also, the recent high-speed pulse technique demands analysis in the time domain. The present paper treats a directional coupler using the coupled microstrip slotline in three-dimensional space and time. The results of the directional coupler analysis is presented with the complicated time variation of the three-dimensional electromagnetic field. So, the mechanism of the directional coupling phenomena that is produced by the propagation characteristics of the even and odd modes is presented in the time domain, In particular, the instantaneous diagram of the Poynting vector details the energy flow in the transient process. For the analysis of the characteristics of the complex microwave device, these results present the utilities of the various field distributions that are obtained by the three-dimensional vector analysis in the time domain.

Radial-line stabs provide an interesting alternative to low-impedance conventional straight stubs.They are useful as filter elements in both series and shunt configurations. In this short paper, the planar circuit analysis previously performed for a series-connected radial stub is extended to the shunt configuration. Theoretical and experimental results are presented to verify the equivalent model for the shunt-connected radial stub.

The general configuration of a system of three coupled microstrip lines is analyzed and its parameters (mode numbers, effective dielectric constants, and modal impedances) are derived in terms of the system capacitances. These capacitances were computed by using the network analog method. In this paper, it is shown that for a system of three equal-width lines, there are, in general, the normal-mode impedances (four of which are independent). This would make the design of a system based on three equal-width lines, mainly with narrow strips and narrow separations, rather complicated. For a system of three equal-impedance lines, the number of mode impedances reduces to only three, which would facilitate the design. This latter system can be achieved by an appropriate increase of the width of the center line relative to that of the outer lines. Thus, a set of curves and a corresponding formula are obtained to determine this relative increase as a function of the geometric parameters. A complete set of design data for the new geometric configuration are also given. The experimental results of two fabricated three-line couplers, one based on the present data and the second on other published data, are compared.

In this paper, an analysis is developed for calculating the lumped inductance of a simple via connecting two infinitely thin striplines, located above a perfectly conducting ground plane. The striplines are oriented in the same direction, and the via is assumed to be in the form of an infinitely thin vertical plate, connecting the two lines. This system is analyzed by a hybrid partial-element and circuit-theory approach. Numerical results are presented to illustrate the application of this technique.

The entire world is struggling to control the spread of coronavirus (COVID‐19) as there are no proper drugs for treating the disease. Under clinical trials, some of the repurposed antiviral drugs have been applied to COVID‐19 patients and reported the efficacy of the drugs with the diverse inferences. Molecular topology has been developed in recent years as an influential approach for drug design and discovery in which molecules that are structurally related show similar pharmacological properties. It permits a purely mathematical description of the molecular structure so that in the development of identification of new drugs can be found through adequate topological indices. In this paper, we study the structural properties of the several antiviral drugs such as chloroquine, hydroxychloroquine, lopinavir, ritonavir, remdesivir, theaflavin, nafamostat, camostat, umifenovir and bevacizumab by considering the distance and bond measures of chemical compounds. Our quantitative values of the topological indices are extremely useful in the recent development of designing new drugs for COVID‐19., The primary results of the paper include distance‐based and bond additive topological descriptors of antiviral medications for the treatment of COVID‐19 like chloroquine, hydroxychloroquine, lopinavir, ritonavir, remdesivir, theaflavin, nafamostat, camostat, umifenovir, and bevacizumab by graph‐theoretic technique, in particular, strength‐weighted quotient graph.

The purpose of this short paper is to give an exact theory of quarter-wave coupled circulators with Chebyshev characteristics. The synthesis starts by replacing the lumped-element equivalent shunt resonator of the circulator by a distributed one that has the same susceptance slope parameter as the original circuit. In this way the overall network involves commensurate transmission lines only. The bandwidth over which the assumed form of the equivalent circuit applies is carefully discussed in terms of the two split frequencies of the magnetized junction. Tables for the required circulator parameters and transformer admittances for one and two transformer sections as a function of VSWR and bandwidth are included. The realizable solution for the latter arrangement is severely restricted by the equivalent circuit of the basic junction. Experimental results on an octave-band stripline circulator, with a two-section transformer, are also included.

Circular RNA is progressively reported to occur in various species including mammals where it is thought to be involved in the post-transcriptional regulation of gene expression, partly via interactions with microRNA. Here, we asked whether the circular topology causes functional differences to linear forms when interacting with short RNA strands in vitro and in human cells. Kinetic studies with human bladder cancer-derived synthetic circular RNA versus linear transcripts, respectively, with short oligoribonucleotides showed similar association rates for both topologies. Conversely, a substantial topology-related difference was measured for the activation entropy and the activation enthalpy of RNA–RNA annealing. This finding strongly indicates a significant difference of the mechanism of RNA–RNA interactions. To investigate whether these characteristics of circular RNA are biologically meaningful we performed transient transfection experiments with a microRNA-regulated expression system for luciferase in bladder cancer-derived cells. We co-transfected linear or circular RNA containing one microRNA binding site for the target-suppressing microRNA mlet7a. Here, the circular isoform showed a strongly increased competition with microRNA function versus linear versions. In summary, this study suggests novel topology-related characteristics of RNA–RNA interactions involving circRNA in vitro and in living cells.

A derivation of the equivalent admittance of symmetrical 3-port circulators is given which is based on the requirement that the S-matrix eigenvalues be separated by 120/spl deg/ on the unit circle for perfect circulation. This quantity has the property that if a 2-port matching network is found which matches into this admittance, then the same matching network connected in each circulator arm will match the circulator. It was used in conjunction with a computerized measurement system to determine the optimal single-step transformer matching of a stripline 3.7-4.2-GHz circulator and resulted in a device with performance better than 30 dB over this band.

A method is presented for finding dimensions of coupled lines and interdigital structures on microstrip given the electrical properties. Both a graphical approach and computer approach using polynomial approximations are given. These results are within 1 percent of Bryant and Weiss' dimensions for coupled lines for most practical stripwidths and spacings. Experimental data for a 10-percent bandwidth microstrip interdigital filter are given.

The graph transformation method of [5] has been extended to apply for a class of coupled nonuniform transmission lines whose self and mutual line constants have the same functional dependence along the direction of propagation, and it is assumed that the mode of propagation is TEM. First, the graph representation of such nonuniform coupled two-wire transmission lines is derived by decomposition of the 4 X 4 admittance matrix. This leads to three-port equivalent circuits of nonuniform coupled two-wire line networks. Then, the multiport graph transformations of networks consisting of nonuniform transmission lines and nonuniform stubs are shown. By using the graph transformation of n-wire nonuniform coupled lines, the equivalent circuits for the nonuniform interdigital line and the nonuniform meander line are given. Finally, a meander-line low-pass filter consisting of parabolic tapered coupled transmission lines designed on this equivalent circuit is shown.

A method analysis of square spiral inductors for use in monolithic microwave integrated circuits (MMIC's) is presented. The method is based on the coupled microstrip-line theory and incorporates a novel solution to the multicoupled-line problem. The analysis includes the effect of the discontinuities at the right-angled bends in the lines, and also the feedback effect where the lead-out bridge crosses the lines. The method can be used to analyze components with an arbitrary number of spiral turns. Theoretical results are compared with the measured S-parameters of a 3 1/2-turn component over the range 2-12 GHz, and reasonable agreement between the two is found.

This note compares and analyzes two commonly used simple waveguide Gunn oscillators in terms of their loaded Q-factors. Suitable design criteria are established for both, and two oscillators which were tested conformed well to these. It is concluded that although the more mechanically complex oscillator, which is in common use, has a greater flexibility, the simpler oscillator is adequate for most applications.

By utilizing state variable theory, certain useful matrix identities involving submatrices of the chain parameter matrix for a multiconductor transmission line are shown. These identities are extensions of familiar properties associated with two-conductor lines to multiconductor lines and are used to formulate the complete solution for the terminal currents when the line is terminated by linear networks. The identities allow a simplified solution for these currents and reduce numerous redundant time-consuming matrix multiplications. In addition, the correspondence between familiar terms for the two-conductor case and the multiconductor case is shown.