Search

We study a semilinear hyperbolic system of PDEs which arises as a continuum approximation of the discrete nonlinear dimer array model introduced by Hadad, Vitelli and Alu (HVA) in \cite{HVA17}. We classify the system's traveling waves, and study their stability properties. We focus on traveling pulse solutions (``solitons'') on a nontrivial background and moving domain wall solutions (kinks); both arise as heteroclinic connections between spatially uniform equilibrium of a reduced dynamical system. We present analytical results on: nonlinear stability and spectral stability of supersonic pulses, and spectral stability of moving domain walls. Our stability results are in terms of weighted $H^1$ norms of the perturbation, which capture the phenomenon of {\it convective stabilization}; as time advances, the traveling wave ``outruns'' the \underline{growing} disturbance excited by an initial perturbation; the non-trivial spatially uniform equilibria are linearly exponentially unstable. We use our analytical results to interpret phenomena observed in numerical simulations., Comment: 48 pages, 13 figures

We present discontinuous Galerkin (DG) methods for solving a first-order semi-linear hyperbolic system, which was originally proposed as a continuum model for a one-dimensional dimer lattice of topological resonators. We examine the energy-conserving or energy-dissipating property in relation to the choices of simple, mesh-independent numerical fluxes. We demonstrate that, with certain numerical flux choices, our DG method achieves optimal convergence in the $L^2$ norm. We provide numerical experiments that validate and illustrate the effectiveness of our proposed numerical methods.

The ability to learn more and more concepts over time from incrementally arriving data is essential for the development of a life-long learning system. However, deep neural networks often suffer from forgetting previously learned concepts when continually learning new concepts, which is known as catastrophic forgetting problem. The main reason for catastrophic forgetting is that the past concept data is not available and neural weights are changed during incrementally learning new concepts. In this paper, we propose a pseudo-rehearsal based class incremental learning approach to make neural networks capable of continually learning new concepts. We use a conditional generative adversarial network to consolidate old concepts memory and recall pseudo samples during learning new concepts and a balanced online memory recall strategy is to maximally maintain old memories. And we design a comprehensible incremental concept learning network as well as a concept contrastive loss to alleviate the magnitude of neural weights change. We evaluate the proposed approach on MNIST, Fashion-MNIST and SVHN datasets and compare with other rehearsal based approaches. The extensive experiments demonstrate the effectiveness of our approach.

In this work, we propose a novel meta-learning approach for few-shot classification, which learns transferable prior knowledge across tasks and directly produces network parameters for similar unseen tasks with training samples. Our approach, called LGM-Net, includes two key modules, namely, TargetNet and MetaNet. The TargetNet module is a neural network for solving a specific task and the MetaNet module aims at learning to generate functional weights for TargetNet by observing training samples. We also present an intertask normalization strategy for the training process to leverage common information shared across different tasks. The experimental results on Omniglot and miniImageNet datasets demonstrate that LGM-Net can effectively adapt to similar unseen tasks and achieve competitive performance, and the results on synthetic datasets show that transferable prior knowledge is learned by the MetaNet module via mapping training data to functional weights. LGM-Net enables fast learning and adaptation since no further tuning steps are required compared to other meta-learning approaches., Comment: To appear in ICML2019

We study spin transport through a normal metal-spin superconductor junction. A spin-flip reflection is demonstrated at the interface, where a spin-up electron incident from the normal metal can be reflected as a spin-down electron and the spin $2\times \hbar/2$ will be injected into the spin superconductor. When the (spin) voltage is smaller than the gap of the spin superconductor, the spin-flip reflection determines the transport properties of the junction. We consider both graphene-based (linear-dispersion-relation) and quadratic-dispersion-relation normal metal-spin superconductor junctions in detail. For the two-dimensional graphene-based junction, the spin-flip reflected electron can be along the specular direction (retro-direction) when the incident and reflected electron locates in the same band (different bands). A perfect spin-flip reflection can occur when the incident electron is normal to the interface, and the reflection coefficient is slightly suppressed for the oblique incident case. As a comparison, for the one-dimensional quadratic-dispersion-relation junction, the spin-flip reflection coefficient can reach 1 at certain incident energies. In addition, both the charge current and the spin current under a charge (spin) voltage are studied. The spin conductance is proportional to the spin-flip reflection coefficient when the spin voltage is less than the gap of the spin superconductor. These results will help us get a better understanding of spin transport through the normal metal-spin superconductor junction., Comment: 11 pages, 9 figures