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

A Non-Orthogonal Unicast and Multicast (NOUM) transmission system allows a multicast stream intended to all receivers to be jointly transmitted with unicast streams in the same time-frequency resource blocks. While the capacity of the two-user multi-antenna NOUM with perfect Channel State Information at the Transmitter (CSIT) is known and achieved by Dirty Paper Coding (DPC)-assisted NOUM with Superposition Coding (SC), the capacity and the capacity-achieving strategy of the multi-antenna NOUM with partial CSIT remain unknown. In this work, we focus on the partial CSIT setting and make two major contributions. First, we show that linearly precoded Rate-Splitting (RS), relying on splitting unicast messages into common and private parts, encoding the common parts together with the multicast message and linearly precoding at the transmitter, can achieve larger rate regions than DPC-assisted NOUM with partial CSIT. Second, we study Dirty Paper Coded Rate-Splitting (DPCRS), that marries RS and DPC. We show that the rate region of DPCRS-assisted NOUM is enlarged beyond that of conventional DPC-assisted NOUM and that of linearly precoded RS-assisted NOUM with partial CSIT., 6 pages, 3 figures, accepted by 54th Annual Asilomar Conference on Signals, Systems, and Computers

In this paper, we study how to fold a specified origami crease pattern in order to minimize the impact of paper thickness. Specifically, origami designs are often expressed by a mountain-valley pattern (plane graph of creases with relative fold orientations), but in general this specification is consistent with exponentially many possible folded states. We analyze the complexity of finding the best consistent folded state according to twometrics:minimizing the total number of layers in the folded state (so that a “flat folding” is indeed close toflat), andminimizing the total amount of paper required to execute the folding (where “thicker” creases consume more paper). We prove both problems strongly NP-complete even for 1D folding. On the other hand, we prove the first problem fixed-parameter tractable in 1D with respect to the number of layers., National Science Foundation (U.S.). Origami Design for Integration of Self-assembling Systems for Engineering Innovation (grant EFRI- 124038), National Science Foundation (U.S.). Expedition grant (CCF-1138967), United States. Department of Defense. National Defense Science and Engineering Graduate (NDSEG) Fellowship (32 CFR 168a)

A multiple-input multiple-output (MIMO) version of the dirty paper channel is studied, where the channel input and the dirt experience the same fading process and the fading channel state is known at the receiver (CSIR). This represents settings where signal and interference sources are co-located, such as in the broadcast channel. First, a variant of Costa's dirty paper coding (DPC) is presented, whose achievable rates are within a constant gap to capacity for all signal and dirt powers. Additionally, a lattice coding and decoding scheme is proposed, whose decision regions are independent of the channel realizations. Under Rayleigh fading, the gap to capacity of the lattice coding scheme vanishes with the number of receive antennas, even at finite Signal-to-Noise Ratio (SNR). Thus, although the capacity of the fading dirty paper channel remains unknown, this work shows it is not far from its dirt-free counterpart. The insights from the dirty paper channel directly lead to transmission strategies for the two-user MIMO broadcast channel (BC), where the transmitter emits a superposition of desired and undesired (dirt) signals with respect to each receiver. The performance of the lattice coding scheme is analyzed under different fading dynamics for the two users, showing that high-dimensional lattices achieve rates close to capacity., Accepted in IEEE Transactions on Wireless Communications

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.

International audience; Many students enter university having learned that the graph of a continuous function is “in one piece” and “can be drawn without lifting the pen from the paper.” Rigorously, a function R -> R is continuous if and only if its graph is path-connected. In this article, I examine proofs of this fact by students in a topology course. Based on Moore (1994), concept usage of continuity and path-connectedness is analysed through recognition and building-with of the RBC-model of epistemic actions (Dreyfus & Kidron, 2014) in combination with a refinement of Oerter's (1982) contextual layers of objects. A “propositional” layer to describe relationships between objects used in proof is introduced and used to perform case studies of students' solutions.

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 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 [6]) is shown to achieve the capacity of this channel in the limit of large bandwidth. This code transmits energy only when the channel gain is large enough. In this limit, this capacity without any receiver CSI is the same as the capacity with full receiver CSI--a phenomenon also true for dirty paper coding. For Rayleigh fading, this capacity (per unit time) is proportional to the logarithm of the bandwidth. Our coding scheme is motivated from the Gel'fand-Pinsker [2,3] coding and dirty paper coding [4]. Nonetheless, for our case, only causal CSI is required at the transmitter in contrast with dirty-paper coding and Gel'fand-Pinsker coding, where non-causal CSI is required. Then we consider a general discrete channel with i.i.d. states. Each input has an associated cost and a zero cost input "0" exists. The channel state is assumed be 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 non-causal transmitter CSI is derived. Finally, some connections are made to the case of non-causal transmitter CSI in [8].

International audience; Large scale distributed systems have become ubiquitous, from on-line social networks to the Internet-of-things. To meet rising expectations (scalability, robustness, flexibility,...) these systems increasingly espouse complex distributed ar-chitectures, that are hard to design, deploy and maintain. To grasp this complexity, developers should be allowed to assemble large distributed systems from smaller parts using a seamless, high-level programming paradigm. We present such an assembly-based programming framework, enabling developers to easily define and realize complex distributed topologies as a construction of simpler blocks (e.g. rings, grids). It does so by harnessing the power of self-organizing overlays, that is made accessible to developers through a high-level Domain Specific Language and self-stabilizing run-time. Our evaluation further shows that our approach is generic, expressive, low-overhead and robust.

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.

The classical writing on dirty paper capacity result establishes that full interference pre-cancellation can be attained in Gelfand-Pinsker problem with additive state and additive white Gaussian noise. This result holds under the idealized assumption that perfect channel knowledge is available at both transmitter and receiver. While channel knowledge at the receiver can be obtained through pilot tones, transmitter channel knowledge is harder to acquire. For this reason, we are interested in characterizing the capacity under the more realistic assumption that only partial channel knowledge is available at the transmitter. We study, more specifically, the dirty paper channel in which the interference sequence in multiplied by fading value unknown to the transmitter but known at the receiver. For this model, we establish an approximate characterization of capacity for the case in which fading values vary greatly in between channel realizations. In this regime, which we term the strong fading regime, the capacity pre-log factor is equal to the inverse of the number of possible fading realizations.

We show that the sufficient condition of the above mentioned paper is also necessary for the boundedness of Bergman type projections on a class of regulated domains.