arXiv subjects

Xiang He

Publications and source records attributed to Xiang He.

At least 73 records · Page 4Linked to original sources

arXiv2017

Lifting divisors with imposed ramifications on a generic chain of loops

Proves that if a curve has totally split reduction and the corresponding skeleton (as a metric graph) is a chain of loops with generic edge lengths, then every divisor on the graph with imposed ramification at the rightmost vertex $p$ of the skeleton lifts to a divisor class on the curve with the same ramification at some point $P$ that retracts to $p$, extending the work of Cartwright-Jensen-Payne. Gives a positive answer to lifting proper tropical intersections within a polytopal domain in an analytic torus.

math.AG↗

arXiv2017

Smoothing of limit linear series on curves and metrized complexes of pseudocompact type

We investigate the connection between Osserman limit series (on curves of pseudocompact type) and Amini-Baker limit linear series (on metrized complexes with corresponding underlying curve) via a notion of pre-limit linear series on curves of the same type. Then, applying the smoothing theorems of Osserman limit linear series, we deduce that, fixing certain metrized complexes, or for certain types of Amini-Baker limit linear series, the smoothability is equivalent to a certain "weak glueing condition". Also for arbitrary metrized complexes of pseudocompact type the weak glueing condition (when it applies) is necessary for smoothability. As an application we confirm the lifting property of specific divisors on the metric graph associated to a certain regular smoothing family, and give a new proof of the main theorem in the paper of Cartwright, Jensen and Payne for vertex avoiding divisors, and generalize loc.cit. for divisors of rank one in the sense that, for the metric graph, there could be at most three edges (instead of two) between any pair of adjacent vertices.

math.AG↗

arXiv2016

Development of four kinds of waveguide power divider for S band

Four kinds of waveguide power dividers with different structures working at 2.856 GHz are developed. By comparing the simulation performances of these four structures, the power divider with matching rod in the middle of its structure has got the best performance and finally be chosen for fabrication. The prototype has got qualified microwave measurement results as well as the high vacuum performance. It also works stable during the whole progress of microwave commissioning.

physics.acc-ph↗

arXiv2014

Accelerating Structure design and fabrication For KIPT and PAL XFEL

ANL and the National Science Center "Kharkov Institute of Physics Technology" (NSC KIPT, Kharkov, Ukraine) jointly proposed to design and build a 100MeV/100KW linear accelerator which will be used to drive the neutron source subcritical assembly. Now the linac was almost assembled in KIPT by the team from Institute of High Energy Physics (IHEP, Beijing, China). The design and measurement result of the accelerating system of the linac will be described in this paper.

physics.acc-ph↗

arXiv2014

Development of high-power and ultra-high-vacuum waveguide coupler working at C/X band

Waveguide directional couplers working at 5.712/11.9924 GHz are developed. Even holes symmetrical to the structure are drilled along the central line of the narrow-wall of waveguide, which are used to couple the electromagnetic power from the main-waveguide to the sub-waveguide. The final prototypes have got satisfactory performances of high-power, ultra-high-vacuum and high-directivity. The microwave measurement results are also qualified.

physics.acc-ph↗

arXiv2014

RF study and simulations of a C-band Barrel Open Cavity (BOC) pulse compressor

This paper focuses on the RF study of a C-band(5712MHz) BOC pulse compressor. The operating principle of BOC is presented and the technical specifications are determined. The main components of BOC such as the cavity, the matching waveguide, the coupling slots and the tuning rings were numerically simulated by 3-D codes software HFSS and CST Microwave Studio(MWS). The "whispering gallery" mode TM6,1,1 with an unload Q of 100000 was chosen to oscillate in the cavity. An energy multiplication factor of 1.99 and a peak power gain of 6.34 were achieved theoretically.

physics.acc-ph↗

arXiv2013

MIMO Broadcast Channel with an Unknown Eavesdropper: Secrecy Degrees of Freedom

We study a multi-antenna broadcast channel with two legitimate receivers and an external eavesdropper. We assume that the channel matrix of the eavesdropper is unknown to the legitimate terminals but satisfies a maximum rank constraint. As our main result we characterize the associated secrecy degrees of freedom for the broadcast channel with common and private messages. We show that a direct extension of the single-user wiretap codebook does not achieve the secrecy degrees of freedom. Our proposed optimal scheme involves decomposing the signal space into a common subspace, which can be observed by both receivers, and private subspaces which can be observed by only one of the receivers, and carefully transmitting a subset of messages in each subspace. We also consider the case when each user's private message must additionally remain confidential from the other legitimate receiver and characterize the s.d.o.f.\ region in this case.

cs.IT↗

arXiv2012

MIMO Multiple Access Channel with an Arbitrarily Varying Eavesdropper

A two-transmitter Gaussian multiple access wiretap channel with multiple antennas at each of the nodes is investigated. The channel matrices at the legitimate terminals are fixed and revealed to all the terminals, whereas the channel matrix of the eavesdropper is arbitrarily varying and only known to the eavesdropper. The secrecy degrees of freedom (s.d.o.f.) region under a strong secrecy constraint is characterized. A transmission scheme that orthogonalizes the transmit signals of the two users at the intended receiver and uses a single-user wiretap code is shown to be sufficient to achieve the s.d.o.f. region. The converse involves establishing an upper bound on a weighted-sum-rate expression. This is accomplished by using induction, where at each step one combines the secrecy and multiple-access constraints associated with an adversary eavesdropping a carefully selected group of sub-channels.

cs.IT↗

arXiv2010

MIMO Wiretap Channels with Arbitrarily Varying Eavesdropper Channel States

In this work, a class of information theoretic secrecy problems is addressed where the eavesdropper channel states are completely unknown to the legitimate parties. In particular, MIMO wiretap channel models are considered where the channel of the eavesdropper is arbitrarily varying over time. Assuming that the number of antennas of the eavesdropper is limited, the secrecy rate of the MIMO wiretap channel in the sense of strong secrecy is derived, and shown to match with the converse in secure degrees of freedom. It is proved that there exists a universal coding scheme that secures the confidential message against any sequence of channel states experienced by the eavesdropper. This yields the conclusion that secure communication is possible regardless of the location or channel states of (potentially infinite number of) eavesdroppers. Additionally, it is observed that, the present setting renders the secrecy capacity problems for multi-terminal wiretap-type channels more tractable as compared the case with full or partial knowledge of eavesdropper channel states. To demonstrate this observation, secure degrees of freedom regions are derived for the Gaussian MIMO multiple access wiretap channel (MIMO MAC-WT) and the Gaussian MIMO broadcast wiretap channel (MIMO BC-WT) where the transmitter(s) and the intended receiver(s) have the same number of antennas.

cs.IT↗

arXiv2010

The Gaussian Many-to-1 Interference Channel with Confidential Messages

The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information theoretic secrecy to this model and consider the many-to-one interference channel with confidential messages, in which each receiver, in particular, the one subject to interference, is also one from which the interfering users' messages need to be kept secret from. We derive the achievable secrecy sum rate for this channel using nested lattice codes, as well as an upper bound on the secrecy sum rate for all possible channel gain configurations. We identify several nontrivial cases where the gap between the upper bound and the achieved secrecy sum rate is only a function of the number of the users K, and is uniform over all possible channel gain configurations in each case. In addition, we identify the secure degree of freedom for this channel and show it to be equivalent to its degree of freedom, i.e., the secrecy in high SNR comes for free.

cs.IT↗

arXiv2010

Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay

We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the source and the destination nodes are allowed to transmit, and the relay receives a superposition of their transmitted signals. We propose a new coding scheme that satisfies two requirements simultaneously: the transmitted message must be kept secret from the relay node, and the destination must be able to detect any Byzantine attack that the relay node might launch reliably and fast. The three main components of the scheme are the nested lattice code, the privacy amplification and the algebraic manipulation detection (AMD)code. Specifically, for the Gaussian two-hop network, we show that lattice coding can successfully pair with AMD codes enabling its first application to a noisy channel model. We prove, using this new coding scheme, that the probability that the Byzantine attack goes undetected decreases exponentially fast with respect to the number of channel uses, while the loss in the secrecy rate, compared to the rate achievable when the relay is honest, can be made arbitrarily small. In addition, in contrast with prior work in Gaussian channels, the notion of secrecy provided here is strong secrecy.

cs.IT↗

arXiv2009

The Spontaneous Generation of Magnetic Moment of Beryllium Dimer on Graphene

Graphene has various potential applications in electronics and scientists are seeking to introduce magnetic properties on graphene. Here we report our theoretical findings that a local magnetic moment as large as 1 $μ_B$ can be generated from the adsorption of the diamagnetic beryllium dimer on perfect diamagnetic graphene. Unexpectedly the adsorption system is remarkably stable as evidenced by the binding energy of 1.04 eV, indicating that the formation of beryllium dimer is energetically much favorable. Analyses reveal that the magnetic moment and stability is originated from the spontaneous transfer of one electron from the anti-bonding orbital of the dimer to graphene.

cond-mat.mtrl-sci↗

arXiv2009

The Role of Feedback in Two-way Secure Communications

Most practical communication links are bi-directional. In these models, since the source node also receives signals, its encoder has the option of computing its output based on the signals it received in the past. On the other hand, from a practical point of view, it would also be desirable to identify the cases where such an encoder design may not improve communication rates. This question is particularly interesting for the case where the transmitted messages and the feedback signals are subject to eavesdropping. In this work, we investigate the question of how much impact the feedback has on the secrecy capacity by studying two fundamental models. First, we consider the Gaussian two-way wiretap channel and derive an outer bound for its secrecy capacity region. We show that the secrecy rate loss can be unbounded when feedback signals are not utilized except for a special case we identify, and thus conclude that utilizing feedback can be highly beneficial in general. Second, we consider a half-duplex Gaussian two-way relay channel where the relay node is also an eavesdropper, and find that the impact of feedback is less pronounced compared to the previous scenario. Specifically, the loss in secrecy rate, when ignoring the feedback, is quantified to be less than 0.5 bit per channel use when the relay power goes to infinity. This achievable rate region is obtained with simple time sharing along with cooperative jamming, which, with its simplicity and near optimum performance, is a viable alternative to an encoder that utilizes feedback signals.

cs.IT↗

arXiv2009

Interference Channels with Strong Secrecy

It is known that given the real sum of two independent uniformly distributed lattice points from the same nested lattice codebook, the eavesdropper can obtain at most 1 bit of information per channel regarding the value of one of the lattice points. In this work, we study the effect of this 1 bit information on the equivocation expressed in three commonly used information theoretic measures, i.e., the Shannon entropy, the Renyi entropy and the min entropy. We then demonstrate its applications in an interference channel with a confidential message. In our previous work, we showed that nested lattice codes can outperform Gaussian codes for this channel when the achieved rate is measured with the weak secrecy notion. Here, with the Renyi entropy and the min entropy measure, we prove that the same secure degree of freedom is achievable with the strong secrecy notion as well. A major benefit of the new coding scheme is that the strong secrecy is generated from a single lattice point instead of a sequence of lattice points. Hence the mutual information between the confidential message and the observation of the eavesdropper decreases much faster with the number of channel uses than previously known strong secrecy coding methods for nested lattice codes.

cs.IT↗

arXiv2009

Two-hop Secure Communication Using an Untrusted Relay

We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The intermediate node is willing to employ a designated relaying scheme to facilitate reliable communication between the source and the destination. Yet, the information it relays needs to be kept secret from it. In this two-hop communication scenario, where the use of the untrusted relay node is essential, we find that a positive secrecy rate is achievable. The center piece of the achievability scheme is the help provided by either the destination node with transmission capability, or an external "good samaritan" node. In either case, the helper performs cooperative jamming that confuses the eavesdropping relay and disables it from being able to decipher what it is relaying. We next derive an upper bound on the secrecy rate for this system. We observe that the gap between the upper bound and the achievable rate vanishes as the power of the relay node goes to infinity. Overall, the paper presents a case for intentional interference, i.e., cooperative jamming, as an enabler for secure communication.

cs.IT↗

arXiv2009

Cooperation with an Untrusted Relay: A Secrecy Perspective

We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should be deployed at all. That is, whether cooperation with an untrusted relay node can ever be beneficial. We first provide an achievable secrecy rate for the general untrusted relay channel, and proceed to investigate this question for two types of relay networks with orthogonal components. For the first model, there is an orthogonal link from the source to the relay. For the second model, there is an orthogonal link from the relay to the destination. For the first model, we find the equivocation capacity region and show that answer is negative. In contrast, for the second model, we find that the answer is positive. Specifically, we show by means of the achievable secrecy rate based on compress-and-forward, that, by asking the untrusted relay node to relay information, we can achieve a higher secrecy rate than just treating the relay as an eavesdropper. For a special class of the second model, where the relay is not interfering itself, we derive an upper bound for the secrecy rate using an argument whose net effect is to separate the eavesdropper from the relay. The merit of the new upper bound is demonstrated on two channels that belong to this special class. The Gaussian case of the second model mentioned above benefits from this approach in that the new upper bound improves the previously known bounds. For the Cover-Kim deterministic relay channel, the new upper bound finds the secrecy capacity when the source-destination link is not worse than the source-relay link, by matching with the achievable rate we present.

cs.IT↗

arXiv2009

Providing Secrecy With Structured Codes: Tools and Applications to Two-User Gaussian Channels

Recent results have shown that structured codes can be used to construct good channel codes, source codes and physical layer network codes for Gaussian channels. For Gaussian channels with secrecy constraints, however, efforts to date rely on random codes. In this work, we advocate that structured codes are useful for providing secrecy, and show how to compute the secrecy rate when structured codes are used. In particular, we solve the problem of bounding equivocation rates with one important class of structured codes, i.e., nested lattice codes. Having established this result, we next demonstrate the use of structured codes for secrecy in two-user Gaussian channels. In particular, with structured codes, we prove that a positive secure degree of freedom is achievable for a large class of fully connected Gaussian channels as long as the channel is not degraded. By way of this, for these channels, we establish that structured codes outperform Gaussian random codes at high SNR. This class of channels include the two-user multiple access wiretap channel, the two-user interference channel with confidential messages and the two-user interference wiretap channel. A notable consequence of this result is that, unlike the case with Gaussian random codes, using structured codes for both transmission and cooperative jamming, it is possible to achieve an arbitrary large secrecy rate given enough power.

cs.IT↗

arXiv2009

The Gaussian Many-to-One Interference Channel with Confidential Messages

We investigate the $K$-user many-to-one interference channel with confidential messages in which the $K$th user experiences interference from all other $K-1$ users, and is at the same time treated as an eavesdropper to all the messages of these users. We derive achievable rates and an upper bound on the sum rate for this channel and show that the gap between the achievable sum rate and its upper bound is $\log_2(K-1)$ bits per channel use under very strong interference, when the interfering users have equal power constraints and interfering link channel gains. The main contributions of this work are: (i) nested lattice codes are shown to provide secrecy when interference is present, (ii) a secrecy sum rate upper bound is found for strong interference regime and (iii) it is proved that under very strong interference and a symmetric setting, the gap between the achievable sum rate and the upper bound is constant with respect to transmission powers.

cs.IT↗