Searcharxiv⌕ Search

arXiv subjects

Jun Zhang

Publications and source records attributed to Jun Zhang.

At least 1,045 records · Page 58Linked to original sources

Deep learning analysis of breast MRIs for prediction of occult invasive disease in ductal carcinoma in situ

Purpose: To determine whether deep learning-based algorithms applied to breast MR images can aid in the prediction of occult invasive disease following the di- agnosis of ductal carcinoma in situ (DCIS) by core needle biopsy. Material and Methods: In this institutional review board-approved study, we analyzed dynamic contrast-enhanced fat-saturated T1-weighted MRI sequences of 131 patients at our institution with a core needle biopsy-confirmed diagnosis of DCIS. The patients had no preoperative therapy before breast MRI and no prior history of breast cancer. We explored two different deep learning approaches to predict whether there was a hidden (occult) invasive component in the analyzed tumors that was ultimately detected at surgical excision. In the first approach, we adopted the transfer learning strategy, in which a network pre-trained on a large dataset of natural images is fine-tuned with our DCIS images. Specifically, we used the GoogleNet model pre-trained on the ImageNet dataset. In the second approach, we used a pre-trained network to extract deep features, and a support vector machine (SVM) that utilizes these features to predict the upstaging of the DCIS. We used 10-fold cross validation and the area under the ROC curve (AUC) to estimate the performance of the predictive models. Results: The best classification performance was obtained using the deep features approach with GoogleNet model pre-trained on ImageNet as the feature extractor and a polynomial kernel SVM used as the classifier (AUC = 0.70, 95% CI: 0.58- 0.79). For the transfer learning based approach, the highest AUC obtained was 0.53 (95% CI: 0.41-0.62). Conclusion: Convolutional neural networks could potentially be used to identify occult invasive disease in patients diagnosed with DCIS at the initial core needle biopsy.

cs.CV↗

Revisiting the electronic phase diagram of YBa2Cu3Oy via temperature derivative of in-plane resistivity

We have re-examined the temperature-doping (T-p) phase diagram of YBa2Cu3Oy (YBCO) to address several issues therein by using the temperature derivative of in-plane resistivity, d\{rho}ab/dT. For p less than about 0.15, a temperature Tf has been defined to mark the onset of an upturn in d\{rho}ab/dT at T>Tc, which, in light of prior studies on another cuprate La2-xSrxCuO4, is attributed to the onset of superconducting fluctuations in normal state. The Tf exhibits a doping dependence similar to Tc, and the interval between Tf and Tc is about 5-30 K across the underdoped regime, showing agreement with a variety of other measurements to probe a restricted temperature range of superconducting fluctuations. Above Tf, the d\{rho}ab/dT increases linearly as T increases up to a value denoted as T2, which is about half the T* and falls roughly in parallel with T* as p rises up to about 0.13, indicating a prominent T^2-dependent \{rho}ab in this T-p region. The d\{rho}ab/dT helps reveal that, at Tf 0.10-0.11, thereby leaving a narrow window of doping for \{rho}ab to show a pure T^2 dependence. As T increases further, the d\{rho}ab/dT reaches a local maximum at a temperature T_R, signifying the known curvature change (inflection point) in \{rho}ab. With the derivatives, it is illustrated that, in the vicinity of T_R, the in-plane Hall coefficient R_H and thermopower Sab of YBCO display curvature changes as well, suggesting a correlation of the three transport properties. It is also found that the dSab/dT shows the onset of an upturn at a temperature coinciding with the Tf, which, backing the identification of Tf with the onset of superconducting fluctuations, demonstrates further the virtue of using the temperature derivative to unveil information helpful for the study of high-Tc cuprates.

cond-mat.supr-con↗

Enhanced Group Sparse Beamforming for Green Cloud-RAN: A Random Matrix Approach

Group sparse beamforming is a general framework to minimize the network power consumption for cloud radio access networks (Cloud-RANs), which, however, suffers high computational complexity. In particular, a complex optimization problem needs to be solved to obtain the remote radio head (RRH) ordering criterion in each transmission block, which will help to determine the active RRHs and the associated fronthaul links. In this paper, we propose innovative approaches to reduce the complexity of this key step in group sparse beamforming. Specifically, we first develop a smoothed $\ell_p$-minimization approach with the iterative reweighted-$\ell_2$ algorithm to return a Karush-Kuhn-Tucker (KKT) point solution, as well as enhancing the capability of inducing group sparsity in the beamforming vectors. By leveraging the Lagrangian duality theory, we obtain closed-form solutions at each iteration to reduce the computational complexity. The well-structured solutions provide the opportunities to apply the large-dimensional random matrix theory to derive deterministic approximations for the RRH ordering criterion. Such an approach helps to guide the RRH selection only based on the statistical channel state information (CSI), which does not require frequent update, thereby significantly reducing the computation overhead. Simulation results shall demonstrate the performance gains of the proposed $\ell_p$-minimization approach, as well as the effectiveness of the large system analysis based framework for computing RRH ordering criterion.

cs.IT↗

Joint Power Control and Beamforming for Uplink Non-Orthogonal Multiple Access in 5G Millimeter-Wave Communications

In this paper, we investigate the combination of two key enabling technologies for the fifth generation (5G) wireless mobile communication, namely millimeter-wave (mmWave) communications and non-orthogonal multiple access (NOMA). In particular, we consider a typical 2-user uplink mmWave-NOMA system, where the base station (BS) equips an analog beamforming structure with a single RF chain and serves 2 NOMA users. An optimization problem is formulated to maximize the achievable sum rate of the 2 users while ensuring a minimal rate constraint for each user. The problem turns to be a joint power control and beamforming problem, i.e., we need to find the beamforming vectors to steer to the two users simultaneously subject to an analog beamforming structure, and meanwhile control appropriate power on them. As direct search for the optimal solution of the non-convex problem is too complicated, we propose to decompose the original problem into two sub-problems that are relatively easy to solve: one is a power control and beam gain allocation problem, and the other is an analog beamforming problem under a constant-modulus constraint. The rational of the proposed solution is verified by extensive simulations, and the performance evaluation results show that the proposed sub-optimal solution achieve a close-to-bound uplink sum-rate performance.

cs.IT↗

1.25 GHz sine wave gating InGaAs/InP single-photon detector with monolithically integrated readout circuit

InGaAs/InP single-photon detectors (SPDs) are the key devices for applications requiring near-infrared single-photon detection. Gating mode is an effective approach to synchronous single-photon detection. Increasing gating frequency and reducing module size are important challenges for the design of such detector system. Here we present for the first time an InGaAs/InP SPD with 1.25 GHz sine wave gating using a monolithically integrated readout circuit (MIRC). The MIRC has a size of 15 mm * 15 mm and implements the miniaturization of avalanche extraction for high-frequency sine wave gating. In the MIRC, low-pass filters and a low-noise radio frequency amplifier are integrated based on the technique of low temperature co-fired ceramic, which can effectively reduce the parasitic capacitance and extract weak avalanche signals. We then characterize the InGaAs/InP SPD to verify the functionality and reliability of MIRC, and the SPD exhibits excellent performance with 27.5 % photon detection efficiency, 1.2 kcps dark count rate, and 9.1 % afterpulse probability at 223 K and 100 ns hold-off time. With this MIRC, one can further design miniaturized high-frequency SPD modules that are highly required for practical applications.

quant-ph↗

Explicit Deep Holes of Reed-Solomon Codes

In this paper, deep holes of Reed-Solomon (RS) codes are studied. A new class of deep holes for generalized affine RS codes is given if the evaluation set satisfies certain combinatorial structure. Three classes of deep holes for projective Reed-Solomon (PRS) codes are constructed explicitly. In particular, deep holes of PRS codes with redundancy three are completely obtained when the characteristic of the finite field is odd. Most (asymptotically of ratio $1$) of the deep holes of PRS codes with redundancy four are also obtained.

cs.IT↗

When Point Process Meets RNNs: Predicting Fine-Grained User Interests with Mutual Behavioral Infectivity

Predicting fine-grained interests of users with temporal behavior is important to personalization and information filtering applications. However, existing interest prediction methods are incapable of capturing the subtle degreed user interests towards particular items, and the internal time-varying drifting attention of individuals is not studied yet. Moreover, the prediction process can also be affected by inter-personal influence, known as behavioral mutual infectivity. Inspired by point process in modeling temporal point process, in this paper we present a deep prediction method based on two recurrent neural networks (RNNs) to jointly model each user's continuous browsing history and asynchronous event sequences in the context of inter-user behavioral mutual infectivity. Our model is able to predict the fine-grained interest from a user regarding a particular item and corresponding timestamps when an occurrence of event takes place. The proposed approach is more flexible to capture the dynamic characteristic of event sequences by using the temporal point process to model event data and timely update its intensity function by RNNs. Furthermore, to improve the interpretability of the model, the attention mechanism is introduced to emphasize both intra-personal and inter-personal behavior influence over time. Experiments on real datasets demonstrate that our model outperforms the state-of-the-art methods in fine-grained user interest prediction.

cs.LG↗

Block-induced complex structures building the flare-productive solar active region 12673

Solar active region (AR) 12673 produced 4 X-class, 27 M-class, and numerous lower class flares during its passage across the visible solar disk in September 2017. Our study is to answer the questions why this AR was so flare-productive and how the X9.3 flare, the largest one of the last decade, took place. We find that there was a sunspot in the initial several days, and then two bipolar regions emerged nearby it successively. Due to the standing of the pre-existing sunspot, the movement of the bipoles was blocked, while the pre-existing sunspot maintained its quasi-circular shaped umbra only with the disappearance of a part of penumbra. Thus, the bipolar patches were significantly distorted, and the opposite polarities formed two semi-circular shaped structures. After that, two sequences of new bipolar regions emerged within the narrow semi-circular zone, and the bipolar patches separated along the curved channel. The new bipoles sheared and interacted with the previous ones, forming a complex topological system, during which numerous flares occurred. At the highly sheared region, a great deal of free energy was accumulated. On September 6, one negative patch near the polarity inversion line began to rapidly rotate and shear with the surrounding positive fields, and consequently the X9.3 flare erupted. Our results reveal that the block-induced complex structures built the flare-productive AR and the X9.3 flare was triggered by an erupting filament due to the kink instability. To better illustrate this process, a block-induced eruption model is proposed for the first time.

astro-ph.SR↗

Generalized Sparse and Low-Rank Optimization for Ultra-Dense Networks

Ultra-dense network (UDN) is a promising technology to further evolve wireless networks and meet the diverse performance requirements of 5G networks. With abundant access points, each with communication, computation and storage resources, UDN brings unprecedented benefits, including significant improvement in network spectral efficiency and energy efficiency, greatly reduced latency to enable novel mobile applications, and the capability of providing massive access for Internet of Things (IoT) devices. However, such great promises come with formidable research challenges. To design and operate such complex networks with various types of resources, efficient and innovative methodologies will be needed. This motivates the recent introduction of highly structured and generalizable models for network optimization. In this article, we present some recently proposed large-scale sparse and low-rank frameworks for optimizing UDNs, supported by various motivating applications. A special attention is paid on algorithmic approaches to deal with nonconvex objective functions and constraints, as well as computational scalability.

cs.IT↗

Flare Ribbons Approach Observed by the Interface Region Imaging Spectrograph and the Solar Dynamics Observatory

We report flare ribbons approach (FRA) during a multiple-ribbon M-class flare on 2015 November 4 in NOAA AR 12443, obtained by the Interface Region Imaging Spectrograph and the Solar Dynamics Observatory. The flare consisted of a pair of main ribbons and two pairs of secondary ribbons. The two pairs of secondary ribbons were formed later than the appearance of main ribbons, with respective time delays of 15 and 19 minutes. The negative-polarity main ribbon spread outward faster than the first secondary ribbon with the same polarity in front of it, and thus the FRA was generated. Just before their encounter, the main ribbon was darkening drastically and its intensity decreased by about 70% in 2 minutes, implying the suppression of main-phase reconnection that produced two main ribbons. The FRA caused the deflection of the main ribbon to the direction of secondary ribbon with a deflection angle of about 60 degree. Post-approach arcade was formed about 2 minutes later and the downflows were detected along the new arcade with velocities of 35-40 km/s, indicative of the magnetic restructuring during the process of FRA. We suggest that there are three topological domains with footpoints outlined by the three pairs of ribbons. Close proximity of these domains leads to deflection of the ribbons in agreement with the magnetic field topology.

astro-ph.SR↗

LERC: Coordinated Cache Management for Data-Parallel Systems

Memory caches are being aggressively used in today's data-parallel frameworks such as Spark, Tez and Storm. By caching input and intermediate data in memory, compute tasks can witness speedup by orders of magnitude. To maximize the chance of in-memory data access, existing cache algorithms, be it recency- or frequency-based, settle on cache hit ratio as the optimization objective. However, unlike the conventional belief, we show in this paper that simply pursuing a higher cache hit ratio of individual data blocks does not necessarily translate into faster task completion in data-parallel environments. A data-parallel task typically depends on multiple input data blocks. Unless all of these blocks are cached in memory, no speedup will result. To capture this all-or-nothing property, we propose a more relevant metric, called effective cache hit ratio. Specifically, a cache hit of a data block is said to be effective if it can speed up a compute task. In order to optimize the effective cache hit ratio, we propose the Least Effective Reference Count (LERC) policy that persists the dependent blocks of a compute task as a whole in memory. We have implemented the LERC policy as a memory manager in Spark and evaluated its performance through Amazon EC2 deployment. Evaluation results demonstrate that LERC helps speed up data-parallel jobs by up to 37% compared with the widely employed least-recently-used (LRU) policy.

cs.DC↗

Weak lensing power spectrum reconstruction by counting galaxies.-- I: the ABS method

We propose an Analytical method of Blind Separation (ABS) of cosmic magnification from the intrinsic fluctuations of galaxy number density in the observed galaxy number density distribution. The ABS method utilizes the different dependences of the signal (cosmic magnification) and contamination (galaxy intrinsic clustering) on galaxy flux, to separate the two. It works directly on the measured cross galaxy angular power spectra between different flux bins. It determines/reconstructs the lensing power spectrum analytically, without assumptions of galaxy intrinsic clustering and cosmology. It is unbiased in the limit of infinite number of galaxies. In reality the lensing reconstruction accuracy depends on survey configurations, galaxy biases, and other complexities, due to finite number of galaxies and the resulting shot noise fluctuations in the cross galaxy power spectra. We estimate its performance (systematic and statistical errors) in various cases. We find that, stage IV dark energy surveys such as SKA and LSST are capable of reconstructing the lensing power spectrum at $z\simeq 1$ and $\ell\la 5000$ accurately. This lensing reconstruction only requires counting galaxies, and is therefore highly complementary to the cosmic shear measurement by the same surveys.

astro-ph.CO↗

High Efficient Reconstruction of Single-shot T2 Mapping from OverLapping-Echo Detachment Planar Imaging Based on Deep Residual Network

Purpose: An end-to-end deep convolutional neural network (CNN) based on deep residual network (ResNet) was proposed to efficiently reconstruct reliable T2 mapping from single-shot OverLapping-Echo Detachment (OLED) planar imaging. Methods: The training dataset was obtained from simulations carried out on SPROM software developed by our group. The relationship between the original OLED image containing two echo signals and the corresponded T2 mapping was learned by ResNet training. After the ResNet was trained, it was applied to reconstruct the T2 mapping from simulation and in vivo human brain data. Results: Though the ResNet was trained entirely on simulated data, the trained network was generalized well to real human brain data. The results from simulation and in vivo human brain experiments show that the proposed method significantly outperformed the echo-detachment-based method. Reliable T2 mapping was achieved within tens of milliseconds after the network had been trained while the echo-detachment-based OLED reconstruction method took minutes. Conclusion: The proposed method will greatly facilitate real-time dynamic and quantitative MR imaging via OLED sequence, and ResNet has the potential to reconstruct images from complex MRI sequence efficiently.

cs.CV↗

Cache Placement in Fog-RANs: From Centralized to Distributed Algorithms

To deal with the rapid growth of high-speed and/or ultra-low latency data traffic for massive mobile users, fog radio access networks (Fog-RANs) have emerged as a promising architecture for next-generation wireless networks. In Fog-RANs, the edge nodes and user terminals possess storage, computation and communication functionalities to various degrees, which provides high flexibility for network operation, i.e., from fully centralized to fully distributed operation. In this paper, we study the cache placement problem in Fog-RANs, by taking into account flexible physical-layer transmission schemes and diverse content preferences of different users. We develop both centralized and distributed transmission aware cache placement strategies to minimize users' average download delay subject to the storage capacity constraints. In the centralized mode, the cache placement problem is transformed into a matroid constrained submodular maximization problem, and an approximation algorithm is proposed to find a solution within a constant factor to the optimum. In the distributed mode, a belief propagation based distributed algorithm is proposed to provide a suboptimal solution, with iterative updates at each BS based on locally collected information. Simulation results show that by exploiting caching and cooperation gains, the proposed transmission aware caching algorithms can greatly reduce the users' average download delay.

eess.SP↗

Forest understory trees can be segmented accurately within sufficiently dense airborne laser scanning point clouds

Airborne laser scanning (LiDAR) point clouds over large forested areas can be processed to segment individual trees and subsequently extract tree-level information. Existing segmentation procedures typically detect more than 90% of overstory trees, yet they barely detect 60% of understory trees because of the occlusion effect of higher canopy layers. Although understory trees provide limited financial value, they are an essential component of ecosystem functioning by offering habitat for numerous wildlife species and influencing stand development. Here we model the occlusion effect in terms of point density. We estimate the fractions of points representing different canopy layers (one overstory and multiple understory) and also pinpoint the required density for reasonable tree segmentation (where accuracy plateaus). We show that at a density of ~170 pt/m-sqr understory trees can likely be segmented as accurately as overstory trees. Given the advancements of LiDAR sensor technology, point clouds will affordably reach this required density. Using modern computational approaches for big data, the denser point clouds can efficiently be processed to ultimately allow accurate remote quantification of forest resources. The methodology can also be adopted for other similar remote sensing or advanced imaging applications such as geological subsurface modelling or biomedical tissue analysis.

cs.CV↗

Hybrid Precoding in Millimeter Wave Systems: How Many Phase Shifters Are Needed?

Hybrid precoding has been recently proposed as a cost-effective transceiver solution for millimeter wave (mm-wave) systems. The analog component in such precoders, which is composed of a phase shifter network, is the key differentiating element in contrast to conventional fully digital precoders. While a large number of phase shifters with unquantized phases are commonly assumed in existing works, in practice the phase shifters should be discretized with a coarse quantization, and their number should be reduced to a minimum due to cost and power consideration. In this paper, we propose a new hybrid precoder implementation using a small number of phase shifters with quantized and fixed phases, i.e., a fixed phase shifter (FPS) implementation, which significantly reduces the cost and hardware complexity. In addition, a dynamic switch network is proposed to enhance the spectral efficiency. Based on the proposed FPS implementation, an effective alternating minimization (AltMin) algorithm is developed with closed-form solutions in each iteration. Simulation results show that the proposed algorithm with the FPS implementation outperforms existing ones. More importantly, it needs much fewer phase shifters than existing hybrid precoder proposals, e.g., $\sim$10 fixed phase shifters are sufficient for practically relevant system settings.

cs.IT↗

Sine wave gating Silicon single-photon detectors for multiphoton entanglement experiments

Silicon single-photon detectors (SPDs) are the key devices for detecting single photons in the visible wavelength range. Here we present high detection efficiency silicon SPDs dedicated to the generation of multiphoton entanglement based on the technique of high-frequency sine wave gating. The silicon single-photon avalanche diodes (SPADs) components are acquired by disassembling 6 commercial single-photon counting modules (SPCMs). Using the new quenching electronics, the average detection efficiency of SPDs is increased from 68.6% to 73.1% at a wavelength of 785 nm. These sine wave gating SPDs are then applied in a four-photon entanglement experiment, and the four-fold coincidence count rate is increased by 30% without degrading its visibility compared with the original SPCMs.

quant-ph↗

An Efficient Version of the Bombieri-Vaaler Lemma

In their celebrated paper "On Siegel's Lemma", Bombieri and Vaaler found an upper bound on the height of integer solutions of systems of linear Diophantine equations. Calculating the bound directly, however, requires exponential time. In this paper, we present the bound in a different form that can be computed in polynomial time. We also give an elementary (and arguably simpler) proof for the bound.

math.NT↗