Searcharxiv⌕ Search

arXiv subjects

Jing Su

Publications and source records attributed to Jing Su.

54 records · Page 3Linked to original sources

BERT-hLSTMs: BERT and Hierarchical LSTMs for Visual Storytelling

Visual storytelling is a creative and challenging task, aiming to automatically generate a story-like description for a sequence of images. The descriptions generated by previous visual storytelling approaches lack coherence because they use word-level sequence generation methods and do not adequately consider sentence-level dependencies. To tackle this problem, we propose a novel hierarchical visual storytelling framework which separately models sentence-level and word-level semantics. We use the transformer-based BERT to obtain embeddings for sentences and words. We then employ a hierarchical LSTM network: the bottom LSTM receives as input the sentence vector representation from BERT, to learn the dependencies between the sentences corresponding to images, and the top LSTM is responsible for generating the corresponding word vector representations, taking input from the bottom LSTM. Experimental results demonstrate that our model outperforms most closely related baselines under automatic evaluation metrics BLEU and CIDEr, and also show the effectiveness of our method with human evaluation.

cs.CL↗

Strain-Rate-Dependent Deformation Behavior of Ti29Zr24Nb23Hf24 High Entropy Alloys at Elevated and Room Temperature

We investigate the strain-rate-dependent mechanical behavior and deformation mechanisms of a refractory high entropy alloy, Ti29Zr24Nb23Hf24 (at.%), with a single-phase body-centered cubic (BCC) structure. High-temperature compression tests were conducted at temperatures from 700 to 1100°C at strain rates ranging from 10-3 to 10 s-1. A sudden stress drop after yield point was observed at higher temperatures and lower strain rates with the Zener-Holloman parameter, lnZ, in the range of 17.2-20.7. Such a softening behavior can be related to the interaction of dislocations with short-range clustering. However, at higher strain rates or lower temperatures (lnZ>25.0), kink bands were activated being responsible for the continuous strengthening of the alloy in competition with the softening mechanism. Systematic TEM investigations reveal that dislocation walls formed along {110} planes and dislocation loops were observed at a low strain of 6% at a high strain rate of 1 s-1 and 800°C. Kink band induced dynamic recrystallization is evident upon further straining. On the other hand, at low strain rate of 10-3 s-1 and 800°C, discontinuous recrystallization mechanisms become dominant with arrays of dislocations forming in front of the bulged boundaries of parent grains. These sub-grain boundaries eventually turn into high-angle grain boundaries. We also investigate the deformation mechanism of the alloy under extremely high strain rate (103 s-1) at room temperature. The specimen exhibits extensive kink bands with arrays of dislocation walls. As further strained, multiple slip systems can be activated and the interaction of dislocation walls plays a vital role in the strain hardening of the alloy.

cond-mat.mtrl-sci↗

Generating Descriptions for Sequential Images with Local-Object Attention and Global Semantic Context Modelling

In this paper, we propose an end-to-end CNN-LSTM model for generating descriptions for sequential images with a local-object attention mechanism. To generate coherent descriptions, we capture global semantic context using a multi-layer perceptron, which learns the dependencies between sequential images. A paralleled LSTM network is exploited for decoding the sequence descriptions. Experimental results show that our model outperforms the baseline across three different evaluation metrics on the datasets published by Microsoft.

cs.CL↗

Collaborative Distillation in the Parameter and Spectrum Domains for Video Action Recognition

Recent years have witnessed the significant progress of action recognition task with deep networks. However, most of current video networks require large memory and computational resources, which hinders their applications in practice. Existing knowledge distillation methods are limited to the image-level spatial domain, ignoring the temporal and frequency information which provide structural knowledge and are important for video analysis. This paper explores how to train small and efficient networks for action recognition. Specifically, we propose two distillation strategies in the frequency domain, namely the feature spectrum and parameter distribution distillations respectively. Our insight is that appealing performance of action recognition requires \textit{explicitly} modeling the temporal frequency spectrum of video features. Therefore, we introduce a spectrum loss that enforces the student network to mimic the temporal frequency spectrum from the teacher network, instead of \textit{implicitly} distilling features as many previous works. Second, the parameter frequency distribution is further adopted to guide the student network to learn the appearance modeling process from the teacher. Besides, a collaborative learning strategy is presented to optimize the training process from a probabilistic view. Extensive experiments are conducted on several action recognition benchmarks, such as Kinetics, Something-Something, and Jester, which consistently verify effectiveness of our approach, and demonstrate that our method can achieve higher performance than state-of-the-art methods with the same backbone.

cs.CV↗

Bonseyes AI Pipeline -- bringing AI to you. End-to-end integration of data, algorithms and deployment tools

Next generation of embedded Information and Communication Technology (ICT) systems are collaborative systems able to perform autonomous tasks. The remarkable expansion of the embedded ICT market, together with the rise and breakthroughs of Artificial Intelligence (AI), have put the focus on the Edge as it stands as one of the keys for the next technological revolution: the seamless integration of AI in our daily life. However, training and deployment of custom AI solutions on embedded devices require a fine-grained integration of data, algorithms, and tools to achieve high accuracy. Such integration requires a high level of expertise that becomes a real bottleneck for small and medium enterprises wanting to deploy AI solutions on the Edge which, ultimately, slows down the adoption of AI on daily-life applications. In this work, we present a modular AI pipeline as an integrating framework to bring data, algorithms, and deployment tools together. By removing the integration barriers and lowering the required expertise, we can interconnect the different stages of tools and provide a modular end-to-end development of AI products for embedded devices. Our AI pipeline consists of four modular main steps: i) data ingestion, ii) model training, iii) deployment optimization and, iv) the IoT hub integration. To show the effectiveness of our pipeline, we provide examples of different AI applications during each of the steps. Besides, we integrate our deployment framework, LPDNN, into the AI pipeline and present its lightweight architecture and deployment capabilities for embedded devices. Finally, we demonstrate the results of the AI pipeline by showing the deployment of several AI applications such as keyword spotting, image classification and object detection on a set of well-known embedded platforms, where LPDNN consistently outperforms all other popular deployment frameworks.

cs.LG↗

Ice-Flower Systems And Star-graphic Lattices

Lattice theory has been believed to resist classical computers and quantum computers. Since there are connections between traditional lattices and graphic lattices, it is meaningful to research graphic lattices. We define the so-called ice-flower systems by our uncolored or colored leaf-splitting and leaf-coinciding operations. These ice-flower systems enable us to construct several star-graphic lattices. We use our star-graphic lattices to express some well-known results of graph theory and compute the number of elements of a particular star-graphic lattice. For more researching ice-flower systems and star-graphic lattices we propose Decomposition Number String Problem, finding strongly colored uniform ice-flower systems and connecting our star-graphic lattices with traditional lattices.

math.CO↗

Performance-Oriented Neural Architecture Search

Hardware-Software Co-Design is a highly successful strategy for improving performance of domain-specific computing systems. We argue for the application of the same methodology to deep learning; specifically, we propose to extend neural architecture search with information about the hardware to ensure that the model designs produced are highly efficient in addition to the typical criteria around accuracy. Using the task of keyword spotting in audio on edge computing devices, we demonstrate that our approach results in neural architecture that is not only highly accurate, but also efficiently mapped to the computing platform which will perform the inference. Using our modified neural architecture search, we demonstrate $0.88\%$ increase in TOP-1 accuracy with $1.85\times$ reduction in latency for keyword spotting in audio on an embedded SoC, and $1.59\times$ on a high-end GPU.

cs.LG↗

Potential Applications of Machine Learning at Multidisciplinary Medical Team Meetings

While machine learning (ML) systems have produced great advances in several domains, their use in support of complex cooperative work remains a research challenge. A particularly challenging setting, and one that may benefit from ML support is the work of multidisciplinary medical teams (MDTs). This paper focuses on the activities performed during the multidisciplinary medical team meeting (MDTM), reviewing their main characteristics in light of a longitudinal analysis of several MDTs in a large teaching hospital over a period of ten years and of our development of ML methods to support MDTMs, and identifying opportunities and possible pitfalls for the use of ML to support MDTMs.

cs.AI↗

Topological Graphic Passwords And Their Matchings Towards Cryptography

Graphical passwords (GPWs) are convenient for mobile equipments with touch screen. Topological graphic passwords (Topsnut-gpws) can be saved in computer by classical matrices and run quickly than the existing GPWs. We research Topsnut-gpws by the matching of view, since they have many advantages. We discuss: configuration matching partition, coloring/labelling matching partition, set matching partition, matching chain, etc. And, we introduce new graph labellings for enriching Topsnut-matchings and show that these labellings can be realized for trees or spanning trees of networks. In theoretical works we explore Graph Labelling Analysis, and show that every graph admits our extremal labellings and set-type labellings in graph theory. Many of the graph labellings mentioned are related with problems of set matching partitions to number theory, and yield new objects and new problems to graph theory.

cs.CR↗

Topological Coding and Topological Matrices Toward Network Overall Security

A mathematical topology with matrix is a natural representation of a coding relational structure that is found in many fields of the world. Matrices are very important in computation of real applications, s ce matrices are easy saved in computer and run quickly, as well as matrices are convenient to deal with communities of current networks, such as Laplacian matrices, adjacent matrices in graph theory. Motivated from convenient, useful and powerful matrices used in computation and investigation of today's networks, we have introduced Topcode-matrices, which are matrices of order $3\times q$ and differ from popular matrices applied in linear algebra and computer science. Topcode-matrices can use numbers, letters, Chinese characters, sets, graphs, algebraic groups \emph{etc.} as their elements. One important thing is that Topcode-matrices of numbers can derive easily number strings, since number strings are text-based passwords used in information security. Topcode-matrices can be used to describe topological graphic passwords (Topsnut-gpws) used in information security and graph connected properties for solving some problems coming in the investigation of Graph Networks and Graph Neural Networks proposed by GoogleBrain and DeepMind. Our topics, in this article, are: Topsnut-matrices, Topcode-matrices, Hanzi-matrices, adjacency ve-value matrices and pan-Topcode-matrices, and some connections between these Topcode-matrices will be proven. We will discuss algebraic groups obtained from the above matrices, graph groups, graph networking groups and number string groups for encrypting different communities of dynamic networks. The operations and results on our matrices help us to set up our overall security mechanism to protect networks.

cs.IT↗

Using Chinese Characters To Generate Text-Based Passwords For Information Security

Graphical passwords (GPWs) are in many areas of the current world. Topological graphic passwords (Topsnut-gpws) are a new type of cryptography, and they differ from the existing GPWs. A Topsnut-gpw consists of two parts: one is a topological structure (graph), and one is a set of discrete elements (a graph labelling, or coloring), the topological structure connects these discrete elements together to form an interesting "story". Our idea is to transform Chinese characters into computer and electronic equipments with touch screen by speaking, writing and keyboard for forming Hanzi-graphs and Hanzi-gpws. We will use Hanzigpws to produce text-based passwords (TB-paws). We will introduce flawed graph labellings on disconnected Hanzi-graphs.

cs.IT↗

Liquid Epitaxial Growth of Two-dimensional Non-layer structured hybrid Perovskite

The hybrid perovskite CH3NH3PbX3 (X= Cl, Br, I) is a promising material for developing novel optoelectronic devices. Owing to the intrinsic non-layer structure, it remains challenging to synthesize molecularly thin CH3NH3PbX3 with large size. Here, we report a low-cost and highly efficient fabrication route to obtain large-scale single-crystalline 2D CH3NH3PbX3 perovskites on a mica substrate via liquid epitaxy. The 2D perovskite is characterized as 8 nm in thickness and hundreds of micrometers in lateral size. First-principles calculations suggest the strong potassium-halogen interactions at the perovskite/mica interface lower the interface energy of perovskites, driving their fast in-plane growth. Spectroscopic investigations reveal 2D CH3NH3PbBr3 possess small exciton binding energy of 30 meV, allowing a superior visible-light photodetector with a photoresponsivity of 126 A/W and a bandwidth exceeded 80 kHz. These features demonstrate that liquid epitaxy is a bottom-up approach to fabricate the non-layer structured 2D perovskites, which offer a new material platform for the device applications and fundamental investigations.

cond-mat.mtrl-sci↗

Valley vortex states and degeneracy lifting via photonic higher-band excitation

We demonstrate valley-dependent vortex generation in a photonic graphene. Without breaking the inversion symmetry, excitation of two equivalent valleys leads to formation of an optical vortex upon Bragg-reflection to the third valley, with its chirality determined by the valley degree of freedom. Vortex-antivortex pairs with valley-dependent topological charge flipping are also observed and corroborated by numerical simulations. Furthermore, we develop a three-band effective Hamiltonian model to describe the dynamics of the coupled valleys, and find that the commonly used two-band model is not sufficient to explain the observed vortex degeneracy lifting. Such valley-polarized vortex states arise from high-band excitation without inversion symmetry breaking or synthetic-field-induced gap opening. Our results from a photonic setting may provide insight for the study of valley contrasting and Berry-phase mediated topological phenomena in other systems.

physics.optics↗

Text-based Passwords Generated From Topological Graphic Passwords

Topological graphic passwords (Topsnut-gpws) are one of graph-type passwords, but differ from the existing graphical passwords, since Topsnut-gpws are saved in computer by algebraic matrices. We focus on the transformation between text-based passwords (TB-paws) and Topsnut-gpws in this article. Several methods for generating TB-paws from Topsnut-gpws are introduced; these methods are based on topological structures and graph coloring/labellings, such that authentications must have two steps: one is topological structure authentication, and another is text-based authentication. Four basic topological structure authentications are introduced and many text-based authentications follow Topsnut-gpws. Our methods are based on algebraic, number theory and graph theory, many of them can be transformed into polynomial algorithms. A new type of matrices for describing Topsnut-gpws is created here, and such matrices can produce TB-paws in complex forms and longer bytes. Estimating the space of TB-paws made by Topsnut-gpws is very important for application. We propose to encrypt dynamic networks and try to face: (1) thousands of nodes and links of dynamic networks; (2) large numbers of Topsnut-gpws generated by machines rather than human's hands. As a try, we apply spanning trees of dynamic networks and graphic groups (Topsnut-groups) to approximate the solutions of these two problems. We present some unknown problems in the end of the article for further research.

cs.IT↗

Graph Theory Towards New Graphical Passwords In Information Networks

Graphical passwords (GPWs) have been studied over 20 years. We are motivated from QR codes that can be considered GPWs, are successfully applied in today's world. However, one need such GPWs that can be use conveniently and have higher level security in information networks. We aim to GPWs for mobile devices with touch screen. No more researching papers of GPWs by means of techniques of graph theory that are already used in a wide range of scientific areas, especially, dynamic networks. Our investigation is devoted to designing new type of graphical passwords by methods of graph theory, such as various topological structures and colorings (labellings). We develop the idea of "topological structure plus number theory" in maximal planar graphs, and provide new techniques for designing new type of GPWs, and furthermore we do theoretical analysis on these new type of GPWs.

cs.CR↗

Topic Stability over Noisy Sources

Topic modelling techniques such as LDA have recently been applied to speech transcripts and OCR output. These corpora may contain noisy or erroneous texts which may undermine topic stability. Therefore, it is important to know how well a topic modelling algorithm will perform when applied to noisy data. In this paper we show that different types of textual noise will have diverse effects on the stability of different topic models. From these observations, we propose guidelines for text corpus generation, with a focus on automatic speech transcription. We also suggest topic model selection methods for noisy corpora.

cs.CL↗

Numerical simulation of time delays in light induced ionization

We apply a fundamental definition of time delay, as the difference between the time a particle spends within a finite region of a potential and the time a free particle spends in the same region, to determine results for photoionization of an electron by an extreme ultraviolet (XUV) laser field using numerical simulations on a grid. Our numerical results are in good agreement with those of the Wigner-Smith time delay, obtained as the derivative of the phase shift of the scattering wave packet with respect to its energy, for the short-range Yukawa potential. In case of the Coulomb potential we obtain time delays for any finite region, while - as expected - the results do not converge as the size of the region increases towards infinity. The impact of an ultrashort near-infrared probe pulse on the time delay is analyzed for both the Yukawa as well as the Coulomb potential and is found to be small for intensities below $10^{13}$ W/cm$^2$.

physics.atom-ph↗

Theoretical analysis of time delays and streaking effects in XUV photoionization

We apply a recently proposed theoretical concept and numerical approach to obtain time delays in extreme ultraviolet (XUV) photoionization of an electron in a short- or long-range potential. The results of our numerical simulations on a space-time grid are compared to those for the well-known Wigner-Smith time delay and different methods to obtain the latter time delay are reviewed. We further use our numerical method to analyze the effect of a near-infrared streaking field on the time delay obtained in the numerical simulations.

physics.atom-ph↗