arXiv subjects

Yucheng Liu

Publications and source records attributed to Yucheng Liu.

52 records · Page 3Linked to original sources

arXiv2021

On Converse Results for Secure Index Coding

In this work, we study the secure index coding problem where there are security constraints on both legitimate receivers and eavesdroppers. We develop two performance bounds (i.e., converse results) on the symmetric secure capacity. The first one is an extended version of the basic acyclic chain bound (Liu and Sadeghi, 2019) that takes security constraints into account. The second converse result is a novel information-theoretic lower bound on the symmetric secure capacity, which is interesting as all the existing converse results in the literature for secure index coding give upper bounds on the capacity.

cs.IT↗

arXiv2021

Information Leakage in Zero-Error Source Coding: A Graph-Theoretic Perspective

We study the information leakage to a guessing adversary in zero-error source coding. The source coding problem is defined by a confusion graph capturing the distinguishability between source symbols. The information leakage is measured by the ratio of the adversary's successful guessing probability after and before eavesdropping the codeword, maximized over all possible source distributions. Such measurement under the basic adversarial model where the adversary makes a single guess and allows no distortion between its estimator and the true sequence is known as the maximum min-entropy leakage or the maximal leakage in the literature. We develop a single-letter characterization of the optimal normalized leakage under the basic adversarial model, together with an optimum-achieving scalar stochastic mapping scheme. An interesting observation is that the optimal normalized leakage is equal to the optimal compression rate with fixed-length source codes, both of which can be simultaneously achieved by some deterministic coding schemes. We then extend the leakage measurement to generalized adversarial models where the adversary makes multiple guesses and allows certain level of distortion, for which we derive single-letter lower and upper bounds.

cs.IT↗

arXiv2021

A Linear Reduction Method for Local Differential Privacy and Log-lift

This paper considers the problem of publishing data $X$ while protecting correlated sensitive information $S$. We propose a linear method to generate the sanitized data $Y$ with the same alphabet $\mathcal{Y} = \mathcal{X}$ that attains local differential privacy (LDP) and log-lift at the same time. It is revealed that both LDP and log-lift are inversely proportional to the statistical distance between conditional probability $P_{Y|S}(x|s)$ and marginal probability $P_{Y}(x)$: the closer the two probabilities are, the more private $Y$ is. Specifying $P_{Y|S}(x|s)$ that linearly reduces this distance $|P_{Y|S}(x|s) - P_Y(x)| = (1-α)|P_{X|S}(x|s) - P_X(x)|,\forall s,x$ for some $α\in (0,1]$, we study the problem of how to generate $Y$ from the original data $S$ and $X$. The Markov randomization/sanitization scheme $P_{Y|X}(x|x') = P_{Y|S,X}(x|s,x')$ is obtained by solving linear equations. The optimal non-Markov sanitization, the transition probability $P_{Y|S,X}(x|s,x')$ that depends on $S$, can be determined by maximizing the data utility subject to linear equality constraints. We compute the solution for two linear utility function: the expected distance and total variance distance. It is shown that the non-Markov randomization significantly improves data utility and the marginal probability $P_X(x)$ remains the same after the linear sanitization method: $P_Y(x) = P_X(x), \forall x \in \mathcal{X}$.

cs.IT↗

arXiv2020

yNet: a multi-input convolutional network for ultra-fast simulation of field evolvement

The capability of multi-input field-to-field regression, i.e. mapping the initial field and applied conditions to the evolved field, is appealing, enabling ultra-fast physics-free simulation of various field evolvements across many disciplines. We hereby propose a y-shaped multi-input deep convolutional network, yNet, which can effectively account for combined effects of multiple mixed inputs on output field. The proposed yNet is applied to the simulation of porosity evolution in selective lasering sintering (SLS). Upon testing, yNet can simulate nearly identical porosity evolution and development to the physics-based model, with a 99.13% morphological similarity for various SLS conditions. We then effortlessly boost the porosity simulation capability to the realistic, full-component level. yNet is generally applicable to simulating various structural/morphological evolutions and other condition-concerned, continuous field evolvements even with spatially and/or temporally non-uniform evolving kinetics. Once trained, the light-weight yNet can be distributed easily and ran with limited computational resource while reducing computation time to a split second. It thus may have a transformative impact by democratizing the capability of ultra-fast and extreme-scale simulation of various field evolvements.

cs.CE↗

arXiv2020

Privacy-Utility Tradeoff in a Guessing Framework Inspired by Index Coding

This paper studies the tradeoff in privacy and utility in a single-trial multi-terminal guessing (estimation) framework using a system model that is inspired by index coding. There are $n$ independent discrete sources at a data curator. There are $m$ legitimate users and one adversary, each with some side information about the sources. The data curator broadcasts a distorted function of sources to legitimate users, which is also overheard by the adversary. In terms of utility, each legitimate user wishes to perfectly reconstruct some of the unknown sources and attain a certain gain in the estimation correctness for the remaining unknown sources. In terms of privacy, the data curator wishes to minimize the maximal leakage: the worst-case guessing gain of the adversary in estimating any target function of its unknown sources after receiving the broadcast data. Given the system settings, we derive fundamental performance lower bounds on the maximal leakage to the adversary, which are inspired by the notion of confusion graph and performance bounds for the index coding problem. We also detail a greedy privacy enhancing mechanism, which is inspired by the agglomerative clustering algorithms in the information bottleneck and privacy funnel problems.

cs.IT↗

arXiv2020

Stability conditions on product varieties

Given a stability condition on a smooth projective variety $X$, we construct a family of stability conditions on $X\times C$, where $C$ is a smooth projective curve. In particular, this gives the existence of stability conditions on arbitrary products of curves. The proof uses, by following an idea of Toda, the positivity lemma established by Bayer and Macrì and weak stability conditions on the Abramovich-Polishchuk heart of a bounded t-structure in $D(X\times C)$.

math.AG↗

arXiv2020

Secure Index Coding with Security Constraints on Receivers

Index coding is concerned with efficient broadcast of a set of messages to receivers in the presence of receiver side information. In this paper, we study the secure index coding problem with security constraints on the receivers themselves. That is, for each receiver there is a single legitimate message it needs to decode and a prohibited message list, none of which should be decoded by that receiver. To this end, our contributions are threefold. We first introduce a secure linear coding scheme, which is an extended version of the fractional local partial clique covering scheme that was originally devised for non-secure index coding. We then develop two information-theoretic bounds on the performance of any valid secure index code, namely secure polymatroidal outer bound (on the capacity region) and secure maximum acyclic induced subgraph lower bound (on the broadcast rate). The structure of these bounds leads us to further develop two necessary conditions for a given index coding problem to be securely feasible (i.e., to have nonzero rates).

cs.IT↗

arXiv2020

Capacity Theorems for Distributed Index Coding

In index coding, a server broadcasts multiple messages to their respective receivers, each with some side information that can be utilized to reduce the amount of communication from the server. Distributed index coding is an extension of index coding in which the messages are broadcast from multiple servers, each storing different subsets of the messages. In this paper, the optimal tradeoff among the message rates and the server broadcast rates, which is defined formally as the capacity region, is studied for a general distributed index coding problem. Inner and outer bounds on the capacity region are established that have matching sum-rates for all 218 non-isomorphic four-message problems with equal link capacities for all the links from servers to receivers. The proposed inner bound is built on a distributed composite coding scheme that outperforms the existing schemes by incorporating more flexible decoding configurations and enhanced fractional rate allocations into two-stage composite coding, a scheme that was originally introduced for centralized index coding. The proposed outer bound is built on the polymatroidal axioms of entropy, as well as functional dependences such as the $\rm{fd}$-separation introduced by the multi-server nature of the problem. This outer bound utilizes general groupings of servers with different levels of granularity, which allows a natural tradeoff between computational complexity and tightness of the bound, and includes and improves upon all existing outer bounds for distributed index coding. Specific features of the proposed inner and outer bounds are demonstrated through concrete examples with four or five messages.

cs.IT↗

arXiv2020

Independent User Partition Multicast Scheme for the Groupcast Index Coding Problem

The groupcast index coding (GIC) problem is a generalization of the index coding problem, where one packet can be demanded by multiple users. In this paper, we propose a new coding scheme called independent user partition multicast (IUPM) for the GIC problem. The novelty of this scheme compared to the user partition multicast (UPM) (Shanmugam \textit{et al.}, 2015) is in removing redundancies in the UPM solution by eliminating the linearly dependent coded packets. We also prove that the UPM scheme subsumes the packet partition multicast (PPM) scheme (Tehrani \textit{et al.}, 2012). Hence, the IUPM scheme is a generalization of both PPM and UPM schemes. Furthermore, inspired by jointly considering users and packets, we modify the approximation partition multicast (CAPM) scheme (Unal and Wagner, 2016) to achieve a new polynomial-time algorithm for solving the general GIC problem. We characterize a class of GIC problems with $\frac{k(k-1)}{2}$ packets, for any integer $k\geq 2$, for which the IUPM scheme is optimal. We also prove that for this class, the broadcast rate of the proposed new heuristic algorithm is $k$, while the broadcast rate of the CAPM scheme is $\mathcal{O}(k^2)$.

cs.IT↗

arXiv2019

Cross-modality Knowledge Transfer for Prostate Segmentation from CT Scans

Creating large scale high-quality annotations is a known challenge in medical imaging. In this work, based on the CycleGAN algorithm, we propose leveraging annotations from one modality to be useful in other modalities. More specifically, the proposed algorithm creates highly realistic synthetic CT images (SynCT) from prostate MR images using unpaired data sets. By using SynCT images (without segmentation labels) and MR images (with segmentation labels available), we have trained a deep segmentation network for precise delineation of prostate from real CT scans. For the generator in our CycleGAN, the cycle consistency term is used to guarantee that SynCT shares the identical manually-drawn, high-quality masks originally delineated on MR images. Further, we introduce a cost function based on structural similarity index (SSIM) to improve the anatomical similarity between real and synthetic images. For segmentation followed by the SynCT generation from CycleGAN, automatic delineation is achieved through a 2.5D Residual U-Net. Quantitative evaluation demonstrates comparable segmentation results between our SynCT and radiologist drawn masks for real CT images, solving an important problem in medical image segmentation field when ground truth annotations are not available for the modality of interest.

eess.IV↗

arXiv2019

Comparative studies of optoelectrical properties of prominent PV materials: Halide Perovskite, CdTe, and GaAs

We compare three representative high performance PV materials: halide perovskite MAPbI3, CdTe, and GaAs, in terms of photoluminescence (PL) efficiency, PL lineshape, carrier diffusion, and surface recombination, over multiple orders of photo-excitation density. An analytic model is used to describe the excitation density dependence of PL intensity and extract the internal PL efficiency and multiple pertinent recombination parameters. A PL imaging technique is used to obtain carrier diffusion length without using a PL quencher, thus, free of unintended influence beyond pure diffusion. Our results show that perovskite samples tend to exhibit lower Shockley-Read-Hall (SRH) recombination rate in both bulk and surface, thus higher PL efficiency than the inorganic counterparts, particularly under low excitation density, even with no or preliminary surface passivation. PL lineshape and diffusion analysis indicate that there is considerable structural disordering in the perovskite materials, and thus photo-generated carriers are not in global thermal equilibrium, which in turn suppresses the nonradiative recombination. This study suggests that relatively low point-defect density, less detrimental surface recombination, and moderate structural disordering contribute to the high PV efficiency in the perovskite. This comparative photovoltaics study provides more insights into the fundamental material science and the search for optimal device designs by learning from different technologies.

physics.app-ph↗

arXiv2019

Generalized Alignment Chain: Improved Converse Results for Index Coding

In this paper, we study the information-theoretic converse for the index coding problem. We generalize the definition for the alignment chain, introduced by Maleki et al., to capture more flexible relations among interfering messages at each receiver. Based on this, we derive improved converse results for the single-server index coding problem. Compared to the maximum acyclic induced subgraph (MAIS) bound, the new bounds are always as tight and can strictly outperform the MAIS bound. They can also be useful for large problems, where the generally tighter polymatroidal bound is computationally impractical. We then extend these new bounds to the multi-server index coding problem. We also present a separate, but related result where we identify a smaller single-server index coding instance, compared to those identified in the literature, for which non-Shannon-type inequalities are necessary to give a tighter converse.

cs.IT↗

arXiv2017

On the Capacity for Distributed Index Coding

The distributed index coding problem is studied, whereby multiple messages are stored at different servers to be broadcast to receivers with side information. First, the existing composite coding scheme is enhanced for the centralized (single-server) index coding problem, which is then merged with fractional partitioning of servers to yield a new coding scheme for distributed index coding. New outer bounds on the capacity region are also established. For 213 out of 218 non-isomorphic distributed index coding problems with four messages the achievable sum-rate of the proposed distributed composite coding scheme matches the outer bound, thus establishing the sum-capacity for these problems.

cs.IT↗

arXiv2016

Rotor-phonon coupling in perovskite CH3NH3PbI3: the origin of exceptional transport properties

Atomic dynamics takes a fundamental part in numbers of physical properties of solids like high-Tc superconductivity, semiconducting transports, and thermoelectricity. Perovskite CH3NH3PbI3 exhibits outstanding photovoltaic performances, but the exact physical scenario has not been established yet, due to the inadequate understanding of the atomic dynamics and exceptional transport properties. We present a complete atomic dynamic picture consisting of phonons, rotational modes of protons and molecular vibrational modes, which is constructed by carrying out high-resolution time-of-flight inelastic neutron scattering measurements in a wide energy window ranging from 0.0036 to 54 meV on a large single crystal sample. A three-fold rotational mode of protons activated around 80 K reduces the lifetimes of acoustic and optical phonons down to about 4.5 ps and below 1 ps at 150 K, respectively. The orthorhombic to tetragonal phase transition takes place with a slower four-fold rotational mode of the C-N axis concomitantly setting in at ~ 165 K, above which the optical phonons are too broadened to be distinguished whereas the acoustic ones are still robust. The significantly reduced lifetimes of optical phonons are linked to the smaller mobility of charge carriers while the ultralow lattice thermal conductivity is attributed to nanoscale mean free paths of acoustic phonons. These microscopic insights provide a solid standing point, on which perovskite solar cells can be understood more accurately and their performances are perhaps further optimized. The revealed rotor-phonon coupling opens up an emergent opportunity to create unprecedented functionalities of materials.

cond-mat.mtrl-sci↗

arXiv2016

Multiplicity free gradings on semisimple Lie and Jordan algebras and skew root

A $G$-grading on an algebra is called multiplicity free if each homogeneous component of the grading is 1-dimensional, where $G$ is an abelian group. We introduce skew root systems of Lie type and skew root systems of Jordan type respectively, and use them to construct multiplicity free gradings on semisimple Lie algebras and on semisimple Jordan algebras respectively. Under certain conditions the corresponding Lie (resp. Jordan) algebras are simple. Three families of skew root systems of Lie type (resp. of Jordan type) are constructed and the corresponding Lie (resp. Jordan) algebras are identified. This is a new approach to study abelian group gradings on Lie and Jordan algebras.

math.RT↗

arXiv2016

Multiple-stage structure transformation of organic-inorganic hybrid perovskite CH3NH3PbI3

By performing spatially resolved Raman and photoluminescence spectroscopy with varying excitation wavelength, density, and data acquisition parameters, we have achieved a unified understanding towards the spectroscopy signatures of the organic-inorganic hybrid perovskite, transforming from the pristine state (CH3NH3PbI3) to fully degraded state (i.e., PbI2) for samples with varying crystalline domain size from mesoscopic scale (approximately 100 nm) to macroscopic size (cm), synthesized by three different techniques. We show that the hybrid perovskite exhibits multiple stages of structure transformation occurring either spontaneously or under light illumination, with exceptionally high sensitivity to the illumination conditions (e.g., power, illumination time and interruption pattern). We highlight four transformation stages (Stage 1 - 4, with Stage 1 being the pristine state) along a primary structure degradation path exhibiting distinctly different Raman spectroscopy features at each stage, and point out that previously reported Raman spectra in the literature reflect degraded structures of either Stage 3 or 4. Additional characteristic optical features of partially degraded materials under the joint action of spontaneous and photo degradation are given. This study offers reliable benchmark results for understanding the intrinsic material properties and structure transformation of this unique category of hybrid materials, and a straightforward method to monitor the structure degradation after the material is used in a device or characterized by other techniques. The findings are pertinently important to a wide range of potential applications where the hybrid material is expected to function in greatly different environment and light-matter interaction conditions.

cond-mat.mtrl-sci↗