SearcharxivSearch

arXiv subjects

Lin Cheng

Publications and source records attributed to Lin Cheng.

At least 73 records · Page 4Linked to original sources

Risk Assessment with Generic Energy Storage under Exogenous and Endogenous Uncertainty

Current risk assessment ignores the stochastic nature of energy storage availability itself and thus lead to potential risk during operation. This paper proposes the redefinition of generic energy storage (GES) that is allowed to offer probabilistic reserve. A data-driven unified model with exogenous and endogenous uncertainty (EXU & EDU) description is presented for four typical types of GES. Moreover, risk indices are proposed to assess the impact of overlooking (EXU & EDU) of GES. Comparative results between EXU & EDU are illustrated in distribution system with day-ahead chance-constrained optimization (CCO) and more severe risks are observed for the latter, which indicate that system operator (SO) should adopt novel strategies for EDU uncertainty.

q-fin.RM

TSGB: Target-Selective Gradient Backprop for Probing CNN Visual Saliency

The explanation for deep neural networks has drawn extensive attention in the deep learning community over the past few years. In this work, we study the visual saliency, a.k.a. visual explanation, to interpret convolutional neural networks. Compared to iteration based saliency methods, single backward pass based saliency methods benefit from faster speed, and they are widely used in downstream visual tasks. Thus, we focus on single backward pass based methods. However, existing methods in this category struggle to uccessfully produce fine-grained saliency maps concentrating on specific target classes. That said, producing faithful saliency maps satisfying both target-selectiveness and fine-grainedness using a single backward pass is a challenging problem in the field. To mitigate this problem, we revisit the gradient flow inside the network, and find that the entangled semantics and original weights may disturb the propagation of target-relevant saliency. Inspired by those observations, we propose a novel visual saliency method, termed Target-Selective Gradient Backprop (TSGB), which leverages rectification operations to effectively emphasize target classes and further efficiently propagate the saliency to the image space, thereby generating target-selective and fine-grained saliency maps. The proposed TSGB consists of two components, namely, TSGB-Conv and TSGB-FC, which rectify the gradients for convolutional layers and fully-connected layers, respectively. Extensive qualitative and quantitative experiments on the ImageNet and Pascal VOC datasets show that the proposed method achieves more accurate and reliable results than the other competitive methods. Code is available at https://github.com/123fxdx/CNNvisualizationTSGB.

cs.CV

Fourier-Engineered Plasmonic Lattice Resonances

Resonances in optical systems are useful for many applications, such as frequency comb generation, optical filtering, and biosensing. However, many of these applications are difficult to implement in optical metasurfaces because traditional approaches for designing multi-resonant nanostructures require significant computational and fabrication efforts. To address this challenge, we introduce the concept of Fourier lattice resonances (FLRs) in which multiple desired resonances can be chosen a priori and used to dictate the metasurface design. Because each resonance is supported by a distinct surface lattice mode, each can have a high quality factor. Here, we experimentally demonstrate several metasurfaces with arbitrarily placed resonances (e.g., at 1310 and 1550 nm) and Q-factors as high as 800 in a plasmonic platform. This flexible procedure requires only the computation of a single Fourier transform for its design, and is based on standard lithographic fabrication methods, allowing one to design and fabricate a metasurface to fit any specific, optical-cavity-based application. This work represents an important milestone towards the complete control over the transmission spectrum of a metasurface.

physics.optics

Data driven analysis of thermal simulations, microstructure and mechanical properties of Inconel 718 thin walls deposited by metal additive manufacturing

The extreme and repeated temperature variation during additive manufacturing of metal parts has a large effect on the resulting material microstructure and properties. The ability to accurately predict this temperature field in detail, and relate it quantitatively to structure and properties, is a key step in predicting part performance and optimizing process design. In this work, a finite element simulation of the Directed Energy Deposition (DED) process is used to predict the space- and time-dependent temperature field during the multi-layer build process for Inconel 718 walls. The thermal model is validated using the dynamic infrared (IR) images captured in situ during the DED builds, showing good agreement with experimental measurements. The relationship between predicted cooling rate, microstructural features, and mechanical properties is examined, and cooling rate alone is found to be insufficient in giving quantitative property predictions. Because machine learning offers an efficient way to identify important features from series data, we apply a 1D convolutional neural network (CNN) data-driven framework to automatically extract the dominant predictive features from simulated temperature history. The relationship between the CNN-extracted features and the mechanical properties is studied. To interpret how CNN performs in intermediate layers, we visualize the extracted features produced on each convolutional layer by a trained CNN. Our results show that the results predicted by the CNN agree well with experimental measurements and give insights into physical mechanisms of microstructure evolution and mechanical properties.

physics.app-ph

Reinforcement Learning for Standards Design

Communications standards are designed via committees of humans holding repeated meetings over months or even years until consensus is achieved. This includes decisions regarding the modulation and coding schemes to be supported over an air interface. We propose a way to "automate" the selection of the set of modulation and coding schemes to be supported over a given air interface and thereby streamline both the standards design process and the ease of extending the standard to support new modulation schemes applicable to new higher-level applications and services. Our scheme involves machine learning, whereby a constructor entity submits proposals to an evaluator entity, which returns a score for the proposal. The constructor employs reinforcement learning to iterate on its submitted proposals until a score is achieved that was previously agreed upon by both constructor and evaluator to be indicative of satisfying the required design criteria (including performance metrics for transmissions over the interface).

stat.ML

Optimal attosecond pulses generation from oscillating plasma surfaces driven at relativistic intensity

The creation of attosecond pulses via laser-plasma interaction has been a subject of great scientific interest for more than three decades. This process is investigated by using particle-in-cell simulation with varying the plasma and laser parameters. The steepness of the density gradient at the plasma-vacuum interface is examined to see how this parameter affects the high-order harmonic generations and isolated-attosecond pulse creation. The optimal density gradient lengths $L$ are explored within the relativistic oscillating mirror mechanism. Although the ideal gradient lengths for the full width at half maximum and peak intensity of an isolated-attosecond pulse depend on the driving laser intensity independently, they are both found near $L$=0.2$λ$ for high laser intensities.

physics.plasm-ph

GRCNN: Graph Recognition Convolutional Neural Network for Synthesizing Programs from Flow Charts

Program synthesis is the task to automatically generate programs based on user specification. In this paper, we present a framework that synthesizes programs from flow charts that serve as accurate and intuitive specifications. In order doing so, we propose a deep neural network called GRCNN that recognizes graph structure from its image. GRCNN is trained end-to-end, which can predict edge and node information of the flow chart simultaneously. Experiments show that the accuracy rate to synthesize a program is 66.4%, and the accuracy rates to recognize edge and nodes are 94.1% and 67.9%, respectively. On average, it takes about 60 milliseconds to synthesize a program.

cs.CV

Superscattering, Superabsorption, and Nonreciprocity in Nonlinear Antennas

We propose tunable nonlinear antennas based on an epsilon-near-zero material with a large optical nonlinearity. We show that the absorption and scattering cross sections of the antennas can be controlled dynamically from a nearly superscatterer to a nearly superabsorber by changing the intensity of the laser beam. Moreover, we demonstrate that a hybrid nonlinear antenna, composed of epsilon-near-zero and high-index dielectric materials, exhibits nonreciprocal radiation patterns because of broken spatial inversion symmetry and large optical nonlinearity of the epsilon-near-zero material. By changing the intensity of the laser, the radiation pattern of the antenna can be tuned between a bidirectional and a unidirectional emission known as a Huygens source. Our study provides a novel approach toward ultrafast dynamical control of metamaterials, for applications such as beam steering and optical limiting.

physics.optics

Exploring the parameter reusability of CNN

In recent times, using small data to train networks has become a hot topic in the field of deep learning. Reusing pre-trained parameters is one of the most important strategies to address the issue of semi-supervised and transfer learning. However, the fundamental reason for the success of these methods is still unclear. In this paper, we propose a solution that can not only judge whether a given network is reusable or not based on the performance of reusing convolution kernels but also judge which layers' parameters of the given network can be reused, based on the performance of reusing corresponding parameters and, ultimately, judge whether those parameters are reusable or not in a target task based on the root mean square error (RMSE) of the corresponding convolution kernels. Specifically, we define that the success of a CNN's parameter reuse depends upon two conditions: first, the network is a reusable network; and second, the RMSE between the convolution kernels from the source domain and target domain is small enough. The experimental results demonstrate that the performance of reused parameters applied to target tasks, when these conditions are met, is significantly improved.

eess.IV

Learning Object Scale With Click Supervision for Object Detection

Weakly-supervised object detection has recently attracted increasing attention since it only requires image-levelannotations. However, the performance obtained by existingmethods is still far from being satisfactory compared with fully-supervised object detection methods. To achieve a good trade-off between annotation cost and object detection performance,we propose a simple yet effective method which incorporatesCNN visualization with click supervision to generate the pseudoground-truths (i.e., bounding boxes). These pseudo ground-truthscan be used to train a fully-supervised detector. To estimatethe object scale, we firstly adopt a proposal selection algorithmto preserve high-quality proposals, and then generate ClassActivation Maps (CAMs) for these preserved proposals by theproposed CNN visualization algorithm called Spatial AttentionCAM. Finally, we fuse these CAMs together to generate pseudoground-truths and train a fully-supervised object detector withthese ground-truths. Experimental results on the PASCAL VOC2007 and VOC 2012 datasets show that the proposed methodcan obtain much higher accuracy for estimating the object scale,compared with the state-of-the-art image-level based methodsand the center-click based method

cs.CV

Dynamic Bandwidth Allocation in Small-Cell Networks: An Economics Approach

We propose and experimentally demonstrate a bandwidth allocation method based on the comparative advantage of spectral efficiency among users in a multi-tone small-cell radio access system with frequency-selective fading channels. The method allocates frequency resources by ranking the comparative advantage of the spectrum measured at the receivers ends. It improves the overall spectral efficiency of the access system with low implementation complexity and independently of power loading. In a two-user wireless transmission experiment, we observe up to 23.1% average capacity improvement by using the proposed method.

cs.NI

Hallucinated Adversarial Learning for Robust Visual Tracking

Humans can easily learn new concepts from just a single exemplar, mainly due to their remarkable ability to imagine or hallucinate what the unseen exemplar may look like in different settings. Incorporating such an ability to hallucinate diverse new samples of the tracked instance can help the trackers alleviate the over-fitting problem in the low-data tracking regime. To achieve this, we propose an effective adversarial approach, denoted as adversarial "hallucinator" (AH), for robust visual tracking. The proposed AH is designed to firstly learn transferable non-linear deformations between a pair of same-identity instances, and then apply these deformations to an unseen tracked instance in order to generate diverse positive training samples. By incorporating AH into an online tracking-by-detection framework, we propose the hallucinated adversarial tracker (HAT), which jointly optimizes AH with an online classifier (e.g., MDNet) in an end-to-end manner. In addition, a novel selective deformation transfer (SDT) method is presented to better select the deformations which are more suitable for transfer. Extensive experiments on 3 popular benchmarks demonstrate that our HAT achieves the state-of-the-art performance.

cs.CV

Fully Distributed DC Optimal Power Flow Based on Distributed Economic Dispatch and Distributed State Estimation

Optimal power flow (OPF) is an important technique for power systems to achieve optimal operation while satisfying multiple constraints. The traditional OPF are mostly centralized methods which are executed in the centralized control center. This paper introduces a totally Distributed DC Optimal Power Flow (DDCOPF) method for future power systems which have more and more distributed generators. The proposed method is based on the Distributed Economic Dispatch (DED) method and the Distributed State Estimation (DSE) method. In this proposed scheme, the DED method is used to achieve the optimal power dispatch with the lowest cost, and the DSE method provides power flow information of the power system to the proposed DDCOPF algorithm. In the proposed method, the Auto-Regressive (AR) model is used to predict the load variation so that the proposed algorithm can prevent overflow. In addition, a method called constraint algorithm is developed to correct the results of DED with the proposed correction algorithm and penalty term so that the constraints for the power system will not be violated. Different from existing research, the proposed method is completely distributed without need for any centralized facility.

eess.SY

A Novel Self-Intersection Penalty Term for Statistical Body Shape Models and Its Applications in 3D Pose Estimation

Statistical body shape models are widely used in 3D pose estimation due to their low-dimensional parameters representation. However, it is difficult to avoid self-intersection between body parts accurately. Motivated by this fact, we proposed a novel self-intersection penalty term for statistical body shape models applied in 3D pose estimation. To avoid the trouble of computing self-intersection for complex surfaces like the body meshes, the gradient of our proposed self-intersection penalty term is manually derived from the perspective of geometry. First, the self-intersection penalty term is defined as the volume of the self-intersection region. To calculate the partial derivatives with respect to the coordinates of the vertices, we employed detection rays to divide vertices of statistical body shape models into different groups depending on whether the vertex is in the region of self-intersection. Second, the partial derivatives could be easily derived by the normal vectors of neighboring triangles of the vertices. Finally, this penalty term could be applied in gradient-based optimization algorithms to remove the self-intersection of triangular meshes without using any approximation. Qualitative and quantitative evaluations were conducted to demonstrate the effectiveness and generality of our proposed method compared with previous approaches. The experimental results show that our proposed penalty term can avoid self-intersection to exclude unreasonable predictions and improves the accuracy of 3D pose estimation indirectly. Further more, the proposed method could be employed universally in triangular mesh based 3D reconstruction.

cs.CV

Real-Time Optimal Control for Irregular Asteroid Landings Using Deep Neural Networks

Precise soft landings on asteroids are central to many deep space missions for surface exploration and resource exploitation. To improve the autonomy and intelligence of landing control, a real-time optimal control approach is proposed using deep neural networks (DNN) for asteroid landing problems wherein the developed DNN-based landing controller is capable of steering the lander to a preselected landing site with high robustness to initial conditions. First, to significantly reduce the time consumption of gravity calculation, DNNs are used to approximate the irregular gravitational field of the asteroid based on the samples from a polyhedral method. Then, an approximate indirect method is presented to solve the time-optimal landing problems with high computational efficiency by taking advantage of the designed gravity approximation method and a homotopy technique. Furthermore, five DNNs are developed to learn the functional relationship between the state and optimal actions obtained by the approximate indirect method, and the resulting DNNs can generate the optimal control instructions in real time because there is no longer need to solve the optimal landing problems onboard. Finally, a DNN-based landing controller composed of these five DNNs is devised to achieve the real-time optimal control for asteroid landings. Simulation results of the time-optimal landing for Eros are given to substantiate the effectiveness of these techniques and illustrate the real-time performance, control optimality, and robustness of the developed DNN-based optimal landing controller.

math.OC

Deep Adaptive Proposal Network for Object Detection in Optical Remote Sensing Images

Object detection is a fundamental and challenging problem in aerial and satellite image analysis. More recently, a two-stage detector Faster R-CNN is proposed and demonstrated to be a promising tool for object detection in optical remote sensing images, while the sparse and dense characteristic of objects in remote sensing images is complexity. It is unreasonable to treat all images with the same region proposal strategy, and this treatment limits the performance of two-stage detectors. In this paper, we propose a novel and effective approach, named deep adaptive proposal network (DAPNet), address this complexity characteristic of object by learning a new category prior network (CPN) on the basis of the existing Faster R-CNN architecture. Moreover, the candidate regions produced by DAPNet model are different from the traditional region proposal network (RPN), DAPNet predicts the detail category of each candidate region. And these candidate regions combine the object number, which generated by the category prior network to achieve a suitable number of candidate boxes for each image. These candidate boxes can satisfy detection tasks in sparse and dense scenes. The performance of the proposed framework has been evaluated on the challenging NWPU VHR-10 data set. Experimental results demonstrate the superiority of the proposed framework to the state-of-the-art.

cs.CV

Near Optimal Adaptive Shortest Path Routing with Stochastic Links States under Adversarial Attack

We consider the shortest path routing (SPR) of a network with stochastically time varying link metrics under potential adversarial attacks. Due to potential denial of service attacks, the distributions of link states could be stochastic (benign) or adversarial at different temporal and spatial locations. Without any \emph{a priori}, designing an adaptive SPR protocol to cope with all possible situations in practice optimally is a very challenging issue. In this paper, we present the first solution by formulating it as a multi-armed bandit (MAB) problem. By introducing a novel control parameter into the exploration phase for each link, a martingale inequality is applied in the our combinatorial adversarial MAB framework. As such, our proposed algorithms could automatically detect features of the environment within a unified framework and find the optimal SPR strategies with almost optimal learning performance in all possible cases over time. Moreover, we study important issues related to the practical implementation, such as decoupling route selection with multi-path route probing, cooperative learning among multiple sources, the "cold-start" issue and delayed feedback of our algorithm. Nonetheless, the proposed SPR algorithms can be implemented with low complexity and they are proved to scale very well with the network size. Comparing to existing approaches in a typical network scenario under jamming attacks, our algorithm has a 65.3\% improvement of network delay given a learning period and a 81.5\% improvement of learning duration under a specified network delay.

cs.NI