arXiv subjects

Nan Wang

Publications and source records attributed to Nan Wang.

At least 163 records · Page 9Linked to original sources

arXiv2022

Generation of highly mutually coherent hard x-ray pulse pairs with an amplitude-splitting delay line

Beam splitters and delay lines are among the key building blocks of modern-day optical laser technologies. Progress in x-ray free electron laser source development and applications over the past decade is calling for their counter part operating in the Angstrom wavelength regime. Recent efforts in x-ray optics development have demonstrated relatively stable delay lines that most often adopted the division of wavefront approach for the beam splitting and recombination configuration. However, the two recombined beams have yet to achieve sufficient mutual coherence to enable applications such as interferometry, correlation spectroscopy, and nonlinear spectroscopy. We present the first experimental realization of the generation of highly mutually coherent pulse pairs using an amplitude-split delay line design based on transmission grating beam splitters and channel-cut crystal optic delay lines. The performance of the prototype system was analyzed in the context of x-ray coherent scattering and correlation spectroscopy, where we obtained nearly identical high-contrast speckle patterns from both branches. We show in addition the high level of dynamical stability during continuous delay scans, a capability essential for high sensitivity ultra-fast measurements.

physics.optics↗

arXiv2022

AnoDFDNet: A Deep Feature Difference Network for Anomaly Detection

This paper proposed a novel anomaly detection (AD) approach of High-speed Train images based on convolutional neural networks and the Vision Transformer. Different from previous AD works, in which anomalies are identified with a single image using classification, segmentation, or object detection methods, the proposed method detects abnormal difference between two images taken at different times of the same region. In other words, we cast anomaly detection problem with a single image into a difference detection problem with two images. The core idea of the proposed method is that the 'anomaly' usually represents an abnormal state instead of a specific object, and this state should be identified by a pair of images. In addition, we introduced a deep feature difference AD network (AnoDFDNet) which sufficiently explored the potential of the Vision Transformer and convolutional neural networks. To verify the effectiveness of the proposed AnoDFDNet, we collected three datasets, a difference dataset (Diff Dataset), a foreign body dataset (FB Dataset), and an oil leakage dataset (OL Dataset). Experimental results on above datasets demonstrate the superiority of proposed method. Source code are available at https://github.com/wangle53/AnoDFDNet.

cs.CV↗

arXiv2022

CancerBERT: a BERT model for Extracting Breast Cancer Phenotypes from Electronic Health Records

Accurate extraction of breast cancer patients' phenotypes is important for clinical decision support and clinical research. Current models do not take full advantage of cancer domain-specific corpus, whether pre-training Bidirectional Encoder Representations from Transformer model on cancer-specific corpus could improve the performances of extracting breast cancer phenotypes from texts data remains to be explored. The objective of this study is to develop and evaluate the CancerBERT model for extracting breast cancer phenotypes from clinical texts in electronic health records. This data used in the study included 21,291 breast cancer patients diagnosed from 2010 to 2020, patients' clinical notes and pathology reports were collected from the University of Minnesota Clinical Data Repository (UMN). Results: About 3 million clinical notes and pathology reports in electronic health records for 21,291 breast cancer patients were collected to train the CancerBERT model. 200 pathology reports and 50 clinical notes of breast cancer patients that contain 9,685 sentences and 221,356 tokens were manually annotated by two annotators. 20% of the annotated data was used as a test set. Our CancerBERT model achieved the best performance with macro F1 scores equal to 0.876 (95% CI, 0.896-0.902) for exact match and 0.904 (95% CI, 0.896-0.902) for the lenient match. The NER models we developed would facilitate the automated information extraction from clinical texts to further help clinical decision support. Conclusions and Relevance: In this study, we focused on the breast cancer-related concepts extraction from EHR data and obtained a comprehensive annotated dataset that contains 7 types of breast cancer-related concepts. The CancerBERT model with customized vocabulary could significantly improve the performance for extracting breast cancer phenotypes from clinical texts.

cs.IR↗

arXiv2022

IMO$^3$: Interactive Multi-Objective Off-Policy Optimization

Most real-world optimization problems have multiple objectives. A system designer needs to find a policy that trades off these objectives to reach a desired operating point. This problem has been studied extensively in the setting of known objective functions. We consider a more practical but challenging setting of unknown objective functions. In industry, this problem is mostly approached with online A/B testing, which is often costly and inefficient. As an alternative, we propose interactive multi-objective off-policy optimization (IMO$^3$). The key idea in our approach is to interact with a system designer using policies evaluated in an off-policy fashion to uncover which policy maximizes her unknown utility function. We theoretically show that IMO$^3$ identifies a near-optimal policy with high probability, depending on the amount of feedback from the designer and training data for off-policy estimation. We demonstrate its effectiveness empirically on multiple multi-objective optimization problems.

cs.LG↗

arXiv2022

Theoretical Limits of Joint Detection and Estimation for Radar Target

This paper proposes a joint detection and estimation (JDE) scheme based on mutual information for the radar work, whose goal is to choose the true one between target existent and target absence, and to estimate the unknown distance parameter when the target is existent. Inspired by the thoughts of Shannon information theory, the JDE system model is established in the presence of complex white Gaussian noise. We make several main contributions: (1) the equivalent JDE channel and the posterior probability density function are derived based on the priori statistical characteristic of the noise, target scattering and joint target parameter; (2) the performance of the JDE system is measured by the joint entropy deviation and the joint information that is defined as the mutual information between received signal and the joint target parameter; (3) the sampling a posterior probability and cascaded JDEers are proposed, and their performance is measured by the empirical joint entropy deviation the empirical joint information; (4) the joint theorem is proved that the joint information is the available limit of the overall performance, that is, the joint information is available, and the empirical joint information of any JDEer is no greater than the joint information; (5) the cascaded theorem is proved that the sum of empirical detection information and empirical estimation information can approximate the joint information, i.e., the performance limit of cascaded JDEer is available. Simulation results verify the correctness of the joint and the cascaded theorems, and show that the performance of the sampling a posterior probability JDEer is asymptotically optimal. Moreover, the performance of cascaded JDEer can approximate the system performance of JDE system.

cs.IT↗

arXiv2021

Non-Clicks Mean Irrelevant? Propensity Ratio Scoring As a Correction

Recent advances in unbiased learning to rank (LTR) count on Inverse Propensity Scoring (IPS) to eliminate bias in implicit feedback. Though theoretically sound in correcting the bias introduced by treating clicked documents as relevant, IPS ignores the bias caused by (implicitly) treating non-clicked ones as irrelevant. In this work, we first rigorously prove that such use of click data leads to unnecessary pairwise comparisons between relevant documents, which prevent unbiased ranker optimization. Based on the proof, we derive a simple yet well justified new weighting scheme, called Propensity Ratio Scoring (PRS), which provides treatments on both clicks and non-clicks. Besides correcting the bias in clicks, PRS avoids relevant-relevant document comparisons in LTR training and enjoys a lower variability. Our extensive empirical evaluations confirm that PRS ensures a more effective use of click data and improved performance in both synthetic data from a set of LTR benchmarks, as well as in the real-world large-scale data from GMail search.

cs.IR↗

arXiv2021

Privacy-Preserving Energy Storage Sharing with Blockchain and Secure Multi-Party Computation

Energy storage provides an effective way of shifting temporal energy demands and supplies, which enables significant cost reduction under time-of-use energy pricing plans. Despite its promising benefits, the cost of present energy storage remains expensive, presenting a major obstacle to practical deployment. A more viable solution to improve the cost-effectiveness is by sharing energy storage, such as community sharing, cloud energy storage and peer-to-peer sharing. However, revealing private energy demand data to an external energy storage operator may compromise user privacy, and is susceptible to data misuses and breaches. In this paper, we explore a novel approach to support energy storage sharing with privacy protection, based on privacy-preserving blockchain and secure multi-party computation. We present an integrated solution to enable privacy-preserving energy storage sharing, such that energy storage service scheduling and cost-sharing can be attained without the knowledge of individual users' demands. It also supports auditing and verification by the grid operator via blockchain. Furthermore, our privacy-preserving solution can safeguard against a dishonest majority of users, who may collude in cheating, without requiring a trusted third-party. We implemented our solution as a smart contract on real-world Ethereum blockchain platform, and provide empirical evaluation in this paper.

cs.CR↗

arXiv2021

Unconditional energy dissipation and error estimates of the SAV Fourier spectral method for nonlinear fractional generalized wave equation

In this paper, we consider a second-order scalar auxiliary variable (SAV) Fourier spectral method to solve the nonlinear fractional generalized wave equation. Unconditional energy conservation or dissipation properties of the fully discrete scheme are first established. Next, we utilize the temporal-spatial error splitting argument to obtain unconditional optimal error estimate of the fully discrete scheme, which overcomes time-step restrictions caused by strongly nonlinear system, or the restrictions that the nonlinear term needs to satisfy the assumption of global Lipschitz condition in all previous works for fractional undamped or damped wave equations. Finally, some numerical experiments are presented to confirm our theoretical analysis.

math.NA↗

arXiv2021

The QXS-SAROPT Dataset for Deep Learning in SAR-Optical Data Fusion

Deep learning techniques have made an increasing impact on the field of remote sensing. However, deep neural networks based fusion of multimodal data from different remote sensors with heterogenous characteristics has not been fully explored, due to the lack of availability of big amounts of perfectly aligned multi-sensor image data with diverse scenes of high resolutions, especially for synthetic aperture radar (SAR) data and optical imagery. To promote the development of deep learning based SAR-optical fusion approaches, we release the QXS-SAROPT dataset, which contains 20,000 pairs of SAR-optical image patches. We obtain the SAR patches from SAR satellite GaoFen-3 images and the optical patches from Google Earth images. These images cover three port cities: San Diego, Shanghai and Qingdao. Here, we present a detailed introduction of the construction of the dataset, and show its two representative exemplary applications, namely SAR-optical image matching and SAR ship detection boosted by cross-modal information from optical images. As a large open SAR-optical dataset with multiple scenes of a high resolution, we believe QXS-SAROPT will be of potential value for further research in SAR-optical data fusion technology based on deep learning.

eess.IV↗

arXiv2021

Topological phenomena demonstrated in photorefractive photonic lattices

Topological photonics has attracted widespread research attention in the past decade due to its fundamental interest and unique manner in controlling light propagation for advanced applications. Paradigmatic approaches have been proposed to achieve topological phases including topological insulators in a variety of photonic systems. In particular, photonic lattices composed of evanescently coupled waveguide arrays have been employed conveniently to explore and investigate topological physics. In this article, we review our recent work on demonstration of topological phenomena in reconfigurable photonic lattices established by site-to-site cw-laser-writing or multiple-beam optical induction in photorefractive nonlinear crystals. We focus on the study of topological states realized in the celebrated one-dimensional Su-Schrieffer-Heeger lattices, including nonlinear topological edge states and gap solitons, nonlinearity-induced coupling to topological edge states, and nonlinear control of non-Hermitian topological states. In the two-dimensional case, we discuss two typical examples: universal mapping of momentum-space topological singularities through Dirac-like photonic lattices and realization of real-space nontrivial loop states in flatband photonic lattices. Our work illustrates how photorefractive materials can be employed conveniently to build up various synthetic photonic microstructures for topological studies, which may prove relevant and inspiring for exploration of fundamental phenomena in topological systems beyond photonics.

physics.optics↗

arXiv2021

UWGAN: Underwater GAN for Real-world Underwater Color Restoration and Dehazing

In real-world underwater environment, exploration of seabed resources, underwater archaeology, and underwater fishing rely on a variety of sensors, vision sensor is the most important one due to its high information content, non-intrusive, and passive nature. However, wavelength-dependent light attenuation and back-scattering result in color distortion and haze effect, which degrade the visibility of images. To address this problem, firstly, we proposed an unsupervised generative adversarial network (GAN) for generating realistic underwater images (color distortion and haze effect) from in-air image and depth map pairs based on improved underwater imaging model. Secondly, U-Net, which is trained efficiently using synthetic underwater dataset, is adopted for color restoration and dehazing. Our model directly reconstructs underwater clear images using end-to-end autoencoder networks, while maintaining scene content structural similarity. The results obtained by our method were compared with existing methods qualitatively and quantitatively. Experimental results obtained by the proposed model demonstrate well performance on open real-world underwater datasets, and the processing speed can reach up to 125FPS running on one NVIDIA 1060 GPU. Source code, sample datasets are made publicly available at https://github.com/infrontofme/UWGAN_UIE.

eess.IV↗

arXiv2021

CORe: Capitalizing On Rewards in Bandit Exploration

We propose a bandit algorithm that explores purely by randomizing its past observations. In particular, the sufficient optimism in the mean reward estimates is achieved by exploiting the variance in the past observed rewards. We name the algorithm Capitalizing On Rewards (CORe). The algorithm is general and can be easily applied to different bandit settings. The main benefit of CORe is that its exploration is fully data-dependent. It does not rely on any external noise and adapts to different problems without parameter tuning. We derive a $\tilde O(d\sqrt{n\log K})$ gap-free bound on the $n$-round regret of CORe in a stochastic linear bandit, where $d$ is the number of features and $K$ is the number of arms. Extensive empirical evaluation on multiple synthetic and real-world problems demonstrates the effectiveness of CORe.

cs.LG↗

arXiv2021

Explanation as a Defense of Recommendation

Textual explanations have proved to help improve user satisfaction on machine-made recommendations. However, current mainstream solutions loosely connect the learning of explanation with the learning of recommendation: for example, they are often separately modeled as rating prediction and content generation tasks. In this work, we propose to strengthen their connection by enforcing the idea of sentiment alignment between a recommendation and its corresponding explanation. At training time, the two learning tasks are joined by a latent sentiment vector, which is encoded by the recommendation module and used to make word choices for explanation generation. At both training and inference time, the explanation module is required to generate explanation text that matches sentiment predicted by the recommendation module. Extensive experiments demonstrate our solution outperforms a rich set of baselines in both recommendation and explanation tasks, especially on the improved quality of its generated explanations. More importantly, our user studies confirm our generated explanations help users better recognize the differences between recommended items and understand why an item is recommended.

cs.IR↗

arXiv2020

A Survey on Edge Performance Benchmarking

Edge computing is the next Internet frontier that will leverage computing resources located near users, sensors, and data stores to provide more responsive services. Therefore, it is envisioned that a large-scale, geographically dispersed, and resource-rich distributed system will emerge and play a key role in the future Internet. However, given the loosely coupled nature of such complex systems, their operational conditions are expected to change significantly over time. In this context, the performance characteristics of such systems will need to be captured rapidly, which is referred to as performance benchmarking, for application deployment, resource orchestration, and adaptive decision-making. Edge performance benchmarking is a nascent research avenue that has started gaining momentum over the past five years. This article first reviews articles published over the past three decades to trace the history of performance benchmarking from tightly coupled to loosely coupled systems. It then systematically classifies previous research to identify the system under test, techniques analyzed, and benchmark runtime in edge performance benchmarking.

cs.DC↗

arXiv2020

Distributed Learning with Low Communication Cost via Gradient Boosting Untrained Neural Network

For high-dimensional data, there are huge communication costs for distributed GBDT because the communication volume of GBDT is related to the number of features. To overcome this problem, we propose a novel gradient boosting algorithm, the Gradient Boosting Untrained Neural Network(GBUN). GBUN ensembles the untrained randomly generated neural network that softly distributes data samples to multiple neuron outputs and dramatically reduces the communication costs for distributed learning. To avoid creating huge neural networks for high-dimensional data, we extend Simhash algorithm to mimic forward calculation of the neural network. Our experiments on multiple public datasets show that GBUN is as good as conventional GBDT in terms of prediction accuracy and much better than it in scaling property for distributed learning. Comparing to conventional GBDT varieties, GBUN speeds up the training process up to 13 times on the cluster with 64 machines, and up to 4614 times on the cluster with 100KB/s network bandwidth. Therefore, GBUN is not only an efficient distributed learning algorithm but also has great potentials for federated learning.

cs.LG↗

arXiv2020

Weakly nonlinear topological gap solitons in Su-Schrieffer-Heeger photonic lattices

We study both theoretically and experimentally the effect of nonlinearity on topologically protected linear interface modes in a photonic Su-Schrieffer-Heeger (SSH) lattice. It is shown that under either focusing or defocusing nonlinearity, this linear topological mode of the SSH lattice turns into a family of topological gap solitons. These solitons are stable. However, they exhibit only a low amplitude and power and are thus weakly nonlinear, even when the bandgap of the SSH lattice is wide. As a consequence, if the initial beam has modest or high power, it will either delocalize, or evolve into a soliton not belonging to the family of topological gap solitons. These theoretical predictions are observed in our experiments with optically induced SSH-type photorefractive lattices.

physics.optics↗

arXiv2020

Cloud-based Privacy-Preserving Collaborative Consumption for Sharing Economy

Cloud computing has been a dominant paradigm for a variety of information processing platforms, particularly for enabling various popular applications of sharing economy. However, there is a major concern regarding data privacy on these cloud-based platforms. This work presents novel cloud-based privacy-preserving solutions to support collaborative consumption applications for sharing economy. In typical collaborative consumption, information processing platforms need to enable fair cost-sharing among multiple users for utilizing certain shared facilities and communal services. Our cloud-based privacy-preserving protocols, based on homomorphic Paillier cryptosystems, can ensure that the cloud-based operator can only obtain an aggregate schedule of all users in facility sharing, or a service schedule conforming to service provision rule in communal service sharing, but is unable to track the personal schedules or demands of individual users. More importantly, the participating users are still able to settle cost-sharing among themselves in a fair manner for the incurred costs, without knowing each other's private schedules or demands. Our privacy-preserving protocols involve no other third party who may compromise privacy. We also provide an extensive evaluation study and a proof-of-concept system prototype of our protocols.

cs.CR↗

arXiv2020

Brain Tumor Anomaly Detection via Latent Regularized Adversarial Network

With the development of medical imaging technology, medical images have become an important basis for doctors to diagnose patients. The brain structure in the collected data is complicated, thence, doctors are required to spend plentiful energy when diagnosing brain abnormalities. Aiming at the imbalance of brain tumor data and the rare amount of labeled data, we propose an innovative brain tumor abnormality detection algorithm. The semi-supervised anomaly detection model is proposed in which only healthy (normal) brain images are trained. Model capture the common pattern of the normal images in the training process and detect anomalies based on the reconstruction error of latent space. Furthermore, the method first uses singular value to constrain the latent space and jointly optimizes the image space through multiple loss functions, which make normal samples and abnormal samples more separable in the feature-level. This paper utilizes BraTS, HCP, MNIST, and CIFAR-10 datasets to comprehensively evaluate the effectiveness and practicability. Extensive experiments on intra- and cross-dataset tests prove that our semi-supervised method achieves outperforms or comparable results to state-of-the-art supervised techniques.

eess.IV↗