arXiv subjects

Wei Ding

Publications and source records attributed to Wei Ding.

At least 55 records · Page 3Linked to original sources

arXiv2022

On the role of the microstructure in the deformation of porous solids

This study explores the role that the microstructure plays in determining the macroscopic static response of porous elastic continua and exposes the occurrence of position-dependent nonlocal effects that are strictly correlated to the configuration of the microstructure. Then, a nonlocal continuum theory based on variable-order fractional calculus is developed in order to accurately capture the complex spatially distributed nonlocal response. The remarkable potential of the fractional approach is illustrated by simulating the nonlinear thermoelastic response of porous beams. The performance, evaluated both in terms of accuracy and computational efficiency, is directly contrasted with high-fidelity finite element models that fully resolve the pores' geometry. Results indicate that the reduced-order representation of the porous microstructure, captured by the synthetic variable-order parameter, offers a robust and accurate representation of the multiscale material architecture that largely outperforms classical approaches based on the concept of average porosity.

cond-mat.mtrl-sci↗

arXiv2022

Experimental Observation and Description of Bandgaps Opening in Chiral Phononic Crystals by Analogy with Thomson scattering

Chiral phononic crystals provide unique properties not offered by conventional phononic material based on Bragg scattering and local resonance. However, it is insufficient to only consider the inertial amplification effect in chiral phononic crystals. Here, we theoretically and experimentally introduce the analogy with Thomson scattering to characterize the bandgap phenomena in chiral phononic crystals. Two phononic structures are proposed and discussed, one with translationrotation coupling and another with translation-translation coupling. The two lattices are different in appearance but have similar bandgaps. Thomson scattering in electromagnetic waves was drawn on to describe the coupling motion of the unit cells. We evidence that the bandgap generation is essentially based on the analogous Thomson scattering aiming to achieve an anti-phase superposition of the waves in the same polarization mode. This finding sheds new light on the physics of the elastodynamic wave manipulation in chiral phononic crystals and opens a remarkable route for their pragmatic implementation.

physics.app-ph↗

arXiv2022

Multiscale nonlocal beam theory: An application of distributed-order fractional operators

This study presents a comprehensive theoretical framework to simulate the response of multiscale nonlocal elastic beams. By employing distributed-order (DO) fractional operators with a fourth-order tensor as the strength-function, the framework can accurately capture anisotropic behavior of 2D heterogeneous beams with nonlocal effects localized across multiple scales. Building upon this general continuum theory and on the multiscale character of DO operators, a one-dimensional (1D) multiscale nonlocal Timoshenko model is also presented. This approach enables a significant model-order reduction without compromising the heterogeneous nonlocal description of the material, hence leading to an efficient and accurate multiscale nonlocal modeling approach. Both 1D and 2D approaches are applied to simulate the mechanical responses of nonlocal beams. The direct comparison of numerical simulations produced by either the DO or an integer-order fully-resolved model (used as ground truth) clearly illustrates the ability of the DO formulation to capture the effect of the microstructure on the macroscopic response. The assessment of the computational cost also indicates the superior efficiency of the proposed approach.

cs.CE↗

arXiv2022

PGADA: Perturbation-Guided Adversarial Alignment for Few-shot Learning Under the Support-Query Shift

Few-shot learning methods aim to embed the data to a low-dimensional embedding space and then classify the unseen query data to the seen support set. While these works assume that the support set and the query set lie in the same embedding space, a distribution shift usually occurs between the support set and the query set, i.e., the Support-Query Shift, in the real world. Though optimal transportation has shown convincing results in aligning different distributions, we find that the small perturbations in the images would significantly misguide the optimal transportation and thus degrade the model performance. To relieve the misalignment, we first propose a novel adversarial data augmentation method, namely Perturbation-Guided Adversarial Alignment (PGADA), which generates the hard examples in a self-supervised manner. In addition, we introduce Regularized Optimal Transportation to derive a smooth optimal transportation plan. Extensive experiments on three benchmark datasets manifest that our framework significantly outperforms the eleven state-of-the-art methods on three datasets.

cs.CV↗

arXiv2022

Observation of Dual-band Topological Corner Modes in Acoustic Kagome Lattice with Long-range Interactions

The recent exotic topological corner modes (CMs) in photonic higher-order topological insulators with long-distance interactions have attracted numerous attentions and enriched the physics than their condensed-matter counterparts. While the next-nearest-neighbour (NNN) coupling appears between NNN lattice sites unselectively, and the NNN coupling and their associated dynamics remains elusive in acoustics due to the waveguide-resonator model, an analogy of tight-binding model (TBM), drastically hinders its NNN coupling. Here, in acoustics, we demonstrate selective NNN coupling-induced CMs in split-ring resonators-based kagome crystal and observe dual-band CMs. Three types of CMs are demonstrated in the first bulk gap which can be explained by TBM considering NNN coupling and one type of CMs is observed in the second. All of these findings are verified theoretically and experimentally which reveals rich physics in acoustics, opening a new way towards tunable or multi-band metamaterials design, and offering opportunities for intriguing acoustic manipulation and energy localization.

physics.app-ph↗

arXiv2021

Multiscale Nonlocal Elasticity: A Distributed Order Fractional Formulation

This study presents a generalized multiscale nonlocal elasticity theory that leverages distributed order fractional calculus to accurately capture coexisting multiscale and nonlocal effects within a macroscopic continuum. The nonlocal multiscale behavior is captured via distributed order fractional constitutive relations derived from a nonlocal thermodynamic formulation. The governing equations of the inhomogeneous continuum are obtained via the Hamilton principle. As a generalization of the constant order fractional continuum theory, the distributed order theory can model complex media characterized by inhomogeneous nonlocality and multiscale effects. In order to understand the correspondence between microscopic effects and the properties of the continuum, an equivalent mass-spring lattice model is also developed by direct discretization of the distributed order elastic continuum. Detailed theoretical arguments are provided to show the equivalence between the discrete and the continuum distributed order models in terms of internal nonlocal forces, potential energy distribution, and boundary conditions. These theoretical arguments facilitate the physical interpretation of the role played by the distributed order framework within nonlocal elasticity theories. They also highlight the outstanding potential and opportunities offered by this methodology to account for multiscale nonlocal effects. The capabilities of the methodology are also illustrated via a numerical study that highlights the excellent agreement between the displacement profiles and the total potential energy predicted by the two models under various order distributions. Remarkably, multiscale effects such as displacement distortion, material softening, and energy concentration are well captured at continuum level by the distributed order theory.

cs.CE↗

arXiv2021

ES-ImageNet: A Million Event-Stream Classification Dataset for Spiking Neural Networks

With event-driven algorithms, especially the spiking neural networks (SNNs), achieving continuous improvement in neuromorphic vision processing, a more challenging event-stream-dataset is urgently needed. However, it is well known that creating an ES-dataset is a time-consuming and costly task with neuromorphic cameras like dynamic vision sensors (DVS). In this work, we propose a fast and effective algorithm termed Omnidirectional Discrete Gradient (ODG) to convert the popular computer vision dataset ILSVRC2012 into its event-stream (ES) version, generating about 1,300,000 frame-based images into ES-samples in 1000 categories. In this way, we propose an ES-dataset called ES-ImageNet, which is dozens of times larger than other neuromorphic classification datasets at present and completely generated by the software. The ODG algorithm implements an image motion to generate local value changes with discrete gradient information in different directions, providing a low-cost and high-speed way for converting frame-based images into event streams, along with Edge-Integral to reconstruct the high-quality images from event streams. Furthermore, we analyze the statistics of the ES-ImageNet in multiple ways, and a performance benchmark of the dataset is also provided using both famous deep neural network algorithms and spiking neural network algorithms. We believe that this work shall provide a new large-scale benchmark dataset for SNNs and neuromorphic vision.

cs.CV↗

arXiv2021

Architecture Information Communication in Two OSS Projects: the Why, Who, When, and What

Architecture information is vital for Open Source Software (OSS) development, and mailing list is one of the widely used channels for developers to share and communicate architecture information. This work investigates the nature of architecture information communication (i.e., why, who, when, and what) by OSS developers via developer mailing lists. We employed a multiple case study approach to extract and analyze the architecture information communication from the developer mailing lists of two OSS projects, ArgoUML and Hibernate, during their development life-cycle of over 18 years. Our main findings are: (a) architecture negotiation and interpretation are the two main reasons (i.e., why) of architecture communication; (b) the amount of architecture information communicated in developer mailing lists decreases after the first stable release (i.e., when); (c) architecture communications centered around a few core developers (i.e., who); (d) and the most frequently communicated architecture elements (i.e., what) are Architecture Rationale and Architecture Model. There are a few similarities of architecture communication between the two OSS projects. Such similarities point to how OSS developers naturally gravitate towards the four aspects of architecture communication in OSS development.

cs.SE↗

arXiv2021

CodeTrans: Towards Cracking the Language of Silicon's Code Through Self-Supervised Deep Learning and High Performance Computing

Currently, a growing number of mature natural language processing applications make people's life more convenient. Such applications are built by source code - the language in software engineering. However, the applications for understanding source code language to ease the software engineering process are under-researched. Simultaneously, the transformer model, especially its combination with transfer learning, has been proven to be a powerful technique for natural language processing tasks. These breakthroughs point out a promising direction for process source code and crack software engineering tasks. This paper describes CodeTrans - an encoder-decoder transformer model for tasks in the software engineering domain, that explores the effectiveness of encoder-decoder transformer models for six software engineering tasks, including thirteen sub-tasks. Moreover, we have investigated the effect of different training strategies, including single-task learning, transfer learning, multi-task learning, and multi-task learning with fine-tuning. CodeTrans outperforms the state-of-the-art models on all the tasks. To expedite future works in the software engineering domain, we have published our pre-trained models of CodeTrans. https://github.com/agemagician/CodeTrans

cs.SE↗

arXiv2021

Learning a Proposal Classifier for Multiple Object Tracking

The recent trend in multiple object tracking (MOT) is heading towards leveraging deep learning to boost the tracking performance. However, it is not trivial to solve the data-association problem in an end-to-end fashion. In this paper, we propose a novel proposal-based learnable framework, which models MOT as a proposal generation, proposal scoring and trajectory inference paradigm on an affinity graph. This framework is similar to the two-stage object detector Faster RCNN, and can solve the MOT problem in a data-driven way. For proposal generation, we propose an iterative graph clustering method to reduce the computational cost while maintaining the quality of the generated proposals. For proposal scoring, we deploy a trainable graph-convolutional-network (GCN) to learn the structural patterns of the generated proposals and rank them according to the estimated quality scores. For trajectory inference, a simple deoverlapping strategy is adopted to generate tracking output while complying with the constraints that no detection can be assigned to more than one track. We experimentally demonstrate that the proposed method achieves a clear performance improvement in both MOTA and IDF1 with respect to previous state-of-the-art on two public benchmarks. Our code is available at https://github.com/daip13/LPC_MOT.git.

cs.CV↗

arXiv2020

Visual Localization for Autonomous Driving: Mapping the Accurate Location in the City Maze

Accurate localization is a foundational capacity, required for autonomous vehicles to accomplish other tasks such as navigation or path planning. It is a common practice for vehicles to use GPS to acquire location information. However, the application of GPS can result in severe challenges when vehicles run within the inner city where different kinds of structures may shadow the GPS signal and lead to inaccurate location results. To address the localization challenges of urban settings, we propose a novel feature voting technique for visual localization. Different from the conventional front-view-based method, our approach employs views from three directions (front, left, and right) and thus significantly improves the robustness of location prediction. In our work, we craft the proposed feature voting method into three state-of-the-art visual localization networks and modify their architectures properly so that they can be applied for vehicular operation. Extensive field test results indicate that our approach can predict location robustly even in challenging inner-city settings. Our research sheds light on using the visual localization approach to help autonomous vehicles to find accurate location information in a city maze, within a desirable time constraint.

cs.CV↗

arXiv2020

High-fidelity, low-latency polarization quantum state transmissions over a hollow-core conjoined-tube fibre at around 800 nm

The performances of optical fibre-based quantum information systems are limited by the intrinsic properties of silica glass materials, e.g. high latency, Rayleigh-scattering loss wavelength scaling law, and cross-coupling induced modal impurity. Hollow-core optical fibre (HCF) promises to unify air-borne light propagation and non-line-of-sight transmission, thus holding great potentials for versatile photonics-based quantum infor-mation applications. The early version of HCF based on photonic-bandgap guidance has not proven itself as a reliable quantum channel because of the poor modal purity in both spatial and polarization domains, as well as significant difficulty in fabrication when the wavelength shifts to the visible region. In this work, based on the polarization degree of freedom, we first, to the best of our knowledge, demonstrate high-fidelity (~0.98) single-photon transmission and distribution of entangled photons over a conjoined-tube hollow-core fibre (CTF) by using commercial silicon single-photon avalanche photodiodes. Our CTF realized the combined merits of low loss, high spatial mode purity, low polarization degradation, and low chromatic dispersion. We also demonstrate single-photon low latency (~99.96% speed of light in vacuum) transmission, thus paving the way for extensive uses of HCF links in versatile polarization-based quantum information processing.

physics.optics↗

arXiv2020

Comparing SNNs and RNNs on Neuromorphic Vision Datasets: Similarities and Differences

Neuromorphic data, recording frameless spike events, have attracted considerable attention for the spatiotemporal information components and the event-driven processing fashion. Spiking neural networks (SNNs) represent a family of event-driven models with spatiotemporal dynamics for neuromorphic computing, which are widely benchmarked on neuromorphic data. Interestingly, researchers in the machine learning community can argue that recurrent (artificial) neural networks (RNNs) also have the capability to extract spatiotemporal features although they are not event-driven. Thus, the question of "what will happen if we benchmark these two kinds of models together on neuromorphic data" comes out but remains unclear. In this work, we make a systematic study to compare SNNs and RNNs on neuromorphic data, taking the vision datasets as a case study. First, we identify the similarities and differences between SNNs and RNNs (including the vanilla RNNs and LSTM) from the modeling and learning perspectives. To improve comparability and fairness, we unify the supervised learning algorithm based on backpropagation through time (BPTT), the loss function exploiting the outputs at all timesteps, the network structure with stacked fully-connected or convolutional layers, and the hyper-parameters during training. Especially, given the mainstream loss function used in RNNs, we modify it inspired by the rate coding scheme to approach that of SNNs. Furthermore, we tune the temporal resolution of datasets to test model robustness and generalization. At last, a series of contrast experiments are conducted on two types of neuromorphic datasets: DVS-converted (N-MNIST) and DVS-captured (DVS Gesture).

cs.CV↗

arXiv2020

Mitigating Class Boundary Label Uncertainty to Reduce Both Model Bias and Variance

The study of model bias and variance with respect to decision boundaries is critically important in supervised classification. There is generally a tradeoff between the two, as fine-tuning of the decision boundary of a classification model to accommodate more boundary training samples (i.e., higher model complexity) may improve training accuracy (i.e., lower bias) but hurt generalization against unseen data (i.e., higher variance). By focusing on just classification boundary fine-tuning and model complexity, it is difficult to reduce both bias and variance. To overcome this dilemma, we take a different perspective and investigate a new approach to handle inaccuracy and uncertainty in the training data labels, which are inevitable in many applications where labels are conceptual and labeling is performed by human annotators. The process of classification can be undermined by uncertainty in the labels of the training data; extending a boundary to accommodate an inaccurately labeled point will increase both bias and variance. Our novel method can reduce both bias and variance by estimating the pointwise label uncertainty of the training set and accordingly adjusting the training sample weights such that those samples with high uncertainty are weighted down and those with low uncertainty are weighted up. In this way, uncertain samples have a smaller contribution to the objective function of the model's learning algorithm and exert less pull on the decision boundary. In a real-world physical activity recognition case study, the data presents many labeling challenges, and we show that this new approach improves model performance and reduces model variance.

cs.LG↗

arXiv2020

SummerTime: Variable-length Time SeriesSummarization with Applications to PhysicalActivity Analysis

\textit{SummerTime} seeks to summarize globally time series signals and provides a fixed-length, robust summarization of the variable-length time series. Many classical machine learning methods for classification and regression depend on data instances with a fixed number of features. As a result, those methods cannot be directly applied to variable-length time series data. One common approach is to perform classification over a sliding window on the data and aggregate the decisions made at local sections of the time series in some way, through majority voting for classification or averaging for regression. The downside to this approach is that minority local information is lost in the voting process and averaging assumes that each time series measurement is equal in significance. Also, since time series can be of varying length, the quality of votes and averages could vary greatly in cases where there is a close voting tie or bimodal distribution of regression domain. Summarization conducted by the \textit{SummerTime} method will be a fixed-length feature vector which can be used in-place of the time series dataset for use with classical machine learning methods. We use Gaussian Mixture models (GMM) over small same-length disjoint windows in the time series to group local data into clusters. The time series' rate of membership for each cluster will be a feature in the summarization. The model is naturally capable of converging to an appropriate cluster count. We compare our results to state-of-the-art studies in physical activity classification and show high-quality improvement by classifying with only the summarization. Finally, we show that regression using the summarization can augment energy expenditure estimation, producing more robust and precise results.

cs.LG↗

arXiv2020

GeoCMS : Towards a Geo-Tagged Media Management System

In this paper, we propose the design and implementation of the new geotagged media management system. A large amount of daily geo-tagged media data generated by user's smart phone, mobile device, dash cam and camera. Geotagged media, such as geovideos and geophotos, can be captured with spatial temporal information such as time, location, visible area, camera direction, moving direction and visible distance information. Due to the increase in geo-tagged multimedia data, the researches for efficient managing and mining geo-tagged multimedia are newly expected to be a new area in database and data mining. This paper proposes a geo-tagged media management system, so called Open GeoCMS(Geotagged media Contents Management System). Open GeoCMS is a new framework to manage geotagged media data on the web. Our framework supports various types which are for moving point, moving photo - a sequence of photos by a drone, moving double and moving video. Also, GeoCMS has the label viewer and editor system for photos and videos. The Open GeoCMS have been developed as an open source system.

cs.DB↗

arXiv2020

Fair Auction and Trade Framework for Cloud VM Allocation based on Blockchain

Cloud auctions provide cost-effective strategies for cloud VM allocation. Most existing cloud auctions simply assume that the auctioneer is trustable, and thus the fairness of auctions can be easily achieved. However, in fact, such a trustable auctioneer may not exist, and the fairness is non-trivial to guarantee. In this work, for the first time, we propose a decentralized cloud VM auction and trade framework based on blockchain. We realize both auction fairness and trade fairness among participants (e.g., cloud provider and cloud users) in this system, which guarantees the interest of each party will not suffer any loss as long as it follows the protocol. Furthermore, we implement our system through the local blockchain and Ethereum official test blockchain, carry out experimental simulations, and demonstrate the feasibility of our system.

cs.CR↗

arXiv2019

CFS: A Distributed File System for Large Scale Container Platforms

We propose CFS, a distributed file system for large scale container platforms. CFS supports both sequential and random file accesses with optimized storage for both large files and small files, and adopts different replication protocols for different write scenarios to improve the replication performance. It employs a metadata subsystem to store and distribute the file metadata across different storage nodes based on the memory usage. This metadata placement strategy avoids the need of data rebalancing during capacity expansion. CFS also provides POSIX-compliant APIs with relaxed semantics and metadata atomicity to improve the system performance. We performed a comprehensive comparison with Ceph, a widely-used distributed file system on container platforms. Our experimental results show that, in testing 7 commonly used metadata operations, CFS gives around 3 times performance boost on average. In addition, CFS exhibits better random-read/write performance in highly concurrent environments with multiple clients and processes.

cs.DC↗