Li Ding

Durham University

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Trends

Author Order

Document Type

Co-Authors

K. D. Glazebrook

Lancaster University

Huishan Cai

University of Science and Technology of China

Jintao Cao

Huazhong Agricultural University

Yiqiang Sheng

Institute of Acoustics

Lingfang Wang

Nanchang University

Jinlin Wang

Institute of Acoustics

Nilay Tanık Argon

University of North Carolina at Chapel Hill

Serhan Ziya

University of North Carolina at Chapel Hill

Hongqiang Wang

National University of Defense Technology

Yan Zhang

Hebei Food Inspection and Research Institute

Cooperative Institutions

Chinese Academy of Sciences

University of Science and Technology of China

Lancaster University

University of Chinese Academy of Sciences

Central South University

Sun Yat-sen University

China University of Mining and Technology

Shanghai Jiao Tong University

Tsinghua University

University of Southampton

Author Statistics

Papers

Citation

H-Index

i-10 index

Research Field

The subprocess eq→νq' and the detection for the new physics theories

Journal of Liaoning Normal University (2008)

Li Ding

Many new theories beyond the standard model have predicted the existence of the new charged gauge boson W'. In this paper we first calculate the contributions from the new charged gauge boson predicted by little Higgs models and three\|site Higgsless model to the subprocess eq→νq'. Then we discuss the possibility of detecting W' via this process in future high energy eq collider (THERA) and linear e+e-collider ( ILC) experiments. At last, in the framework of one of the important features of the little Higgs model with T\|parity, called the LHT model, we study production of the new fermions. Our numerical results show that the process eq→νq is rather sensitive to W', so one can use this process to distinguish and test different new physics models in future THERA and ILC experiments.

Little Higgs

Parity (physics)

International Linear Collider

Source

Cite

Citations (0)

Application of Heuristic Algorithm to Computer Based Interlocking Route Search

Li Ding Shenghua Dai

In the Computer Based Interlocking (CBI) System of railway stations, the route search sub-module is one of the most important components, since its operating efficiency, reliability and safety can directly ensure the safety of train routes and shunting routes.This paper took an actual layout of railway station signal into consideration.By means of modeling the layout into a topological structure, we abstracted it as a directed graph.Then under the direction of path search in graph theory, we applied A* heuristic search algorithm to carry out the route search and it worked efficiently.

Interlocking

Algorithm design

Null-move heuristic

10.2991/caai-17.2017.69

Cite

Citations (0)

A Split Architecture Approach to Terabyte-Scale Caching in a Protocol-Oblivious Forwarding Switch

IEEE Transactions on Network and Service Management (2017)

Li Ding Jinlin Wang Yiqiang Sheng Lingfang Wang

Research has proven that in-network caching is an effective way of eliminating redundant network traffic. For a larger cache that scales up to terabytes, a network element must utilize block storage devices. Nevertheless, accessing block devices in packet forwarding paths could be a major performance bottleneck because storage devices are prone to be much slower than memory devices concerning bandwidth and latency. Software-defined networking (SDN) has entered into all aspects of network architecture by separating the control and forwarding plane to make it more programmable and application-aware. Protocol-oblivious forwarding (POF), which is an enhancement to current OpenFlow-based SDN forwarding architecture, enhances the network programmability further. In this paper, we proposed a novel split architecture to cope with the problem of speed mismatch between high-speed packet forwarding and low-speed block I/O operation over POF switches. The issues raised by this split architecture were first explored and could be summarized as packet dependency and protocol conversion. Then, we focused on solving these two problems and proposed an efficient and scalable design. Finally, we conducted extensive experiments to evaluate the split architecture along with the proposed approaches for packet dependency and protocol conversion.

Packet forwarding

OpenFlow

Forwarding plane

10.1109/tnsm.2017.2761894

Cite

Citations (10)

Investigation and design for structure of high-precision reference mirror

Li Ding T Wang H.J. Yang Hong-Zhi Jia

In order to ensure the measuring precision of high accuracy optical, the accuracy of the interferometer reference mirror must be controlled strictly. The influences of different number of adhered points and point distribution, and different support schemes on the shapes of reference mirror were investigated by means of finite element method under gravitational conditions. In order to achieve the peak to valley(PV) value of reference sphere mirror which is better than /40, a kind of support structure of 150 mm reference mirror was designed according to the results of research. The experimental results by means of finite element method indicate that the peak to valley (PV) value and root mean square (RMS) value of the reference surface are only 7.36 nm and 1.52 nm by support scheme with 12 3 distributed and six-points flexible support, and the thermal deformation is less than gravity deformation. These results demonstrate that all targets validate the rationality of structure and it can well satisfy the requirements.

Root mean square

Source

Cite

Citations (1)

Simulating Collaborative Distribution of 3PL Enterprise-Led

Li Ding Yuanxin Huang Xiaoyu Li Hongying Tian

To address the issue of high costs of traditional distribution and meet the transportation demand for low-volume, multi-batch, and high frequency, we use the theory of resources integration and the theory of virtual organization, and establish a model of a third-party logistics (3PL)-led collaborative distribution virtual enterprise. Using the AutoMod simulation software to prove the feasibility, the cost synergies of collaborative distribution study shows that the implementation of cooperative distribution is conducive to save social resources and is beneficial to the implementation of environmental logistics and internet of things.

10.1061/41139(387)380

Cite

Citations (0)

Learning Heatmap-Style Jigsaw Puzzles Provides Good Pretraining for 2D Human Pose Estimation

arXiv (Cornell University) (2020)

Kun Zhang Rui Wu Ping Yao Kai Deng Li Ding

The target of 2D human pose estimation is to locate the keypoints of body parts from input 2D images. State-of-the-art methods for pose estimation usually construct pixel-wise heatmaps from keypoints as labels for learning convolution neural networks, which are usually initialized randomly or using classification models on ImageNet as their backbones. We note that 2D pose estimation task is highly dependent on the contextual relationship between image patches, thus we introduce a self-supervised method for pretraining 2D pose estimation networks. Specifically, we propose Heatmap-Style Jigsaw Puzzles (HSJP) problem as our pretext-task, whose target is to learn the location of each patch from an image composed of shuffled patches. During our pretraining process, we only use images of person instances in MS-COCO, rather than introducing extra and much larger ImageNet dataset. A heatmap-style label for patch location is designed and our learning process is in a non-contrastive way. The weights learned by HSJP pretext task are utilised as backbones of 2D human pose estimator, which are then finetuned on MS-COCO human keypoints dataset. With two popular and strong 2D human pose estimators, HRNet and SimpleBaseline, we evaluate mAP score on both MS-COCO validation and test-dev datasets. Our experiments show that downstream pose estimators with our self-supervised pretraining obtain much better performance than those trained from scratch, and are comparable to those using ImageNet classification models as their initial backbones.

Jigsaw

10.48550/arxiv.2012.07101

Cite

Citations (1)

What We Can Learn from the Agricultural Structure of USA and Some Suggestions

Cai-jing wenti yanjiu (2001)

Li Ding

Some officials in the Agricultural Ministry of China,invited by its counterparts of USA,visited some agricultural firms,agricultural Associations and government departments to investigate its agricultural production,manufacture,circulation and academic research.They got a strong feeling on the American agricultural micro foundation,market system and micro regulation that the leading and advanced agriculture of the USA resulted from a competitive agricultural system,and we should examine the theory and practice in our agricultural industrialization and the system by using the experiences of the USA for our reference.

Christian ministry

Industrialisation

Circulation (fluid dynamics)

Good agricultural practice

Agricultural communication

Source

Cite

Citations (0)

A Markov chain model-based method for cancer classification

Li Ding Hongqiang Wang

In this paper, we propose a Markov chain model (MCM)-based method for cancer classification. By viewing a gene chain extracted from a gene pathway map as a gene Markov chain (GMC), the method can construct a MCM for different cancer classes. The resulted MCM captures the co-activity pattern of genes in terms of an initial state distribution and a state transition probability matrix. When used for cancer classification, the method first calculates the respective probabilities of a test sample belonging to different cancer classes according to the corresponding MCM, and then predicts the class of the sample as the one with the highest probability. We evaluate the proposed method on the publicly available leukemia dataset and compare it with several conventional methods.

Stochastic matrix

Sample (material)

10.1109/icnc.2012.6234675

Cite

Citations (5)

DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM

Probability in the Engineering and Informational Sciences (2009)

Nilay Tanık Argon Li Ding K. D. Glazebrook Serhan Ziya

We consider a network of parallel service stations each modeled as a single-server queue. Each station serves its own dedicated customers as well as generic customers who are routed from a central controller. We suppose that the cost incurred by a customer is an increasing function of her time spent in the system. In a significant advance on most previous work, we do not require waiting costs to be convex, still less linear. With the objective of minimizing the long-run average waiting cost, we develop two heuristic routing policies, one of which is based on dynamic programming policy improvement and the other on Lagrangian relaxation. In developing the latter policy, we show that each station is “indexable” under mild conditions for customers’ waiting costs and also prove some structural results on the admission control problem that naturally arises as a result of the Lagrangian relaxation. We then test the performance of our heuristics in an extensive numerical study and show that the Lagrangian heuristic demonstrates a strong level of performance in a range of traffic conditions. In particular, it clearly outperforms both a greedy heuristic, which is a standard proposal in complex routing problems, and a recent proposal from the heavy traffic literature.

Heuristics

Lagrangian relaxation

10.1017/s0269964809000138

Cite

Citations (42)

A storage approach for OpenFlow switch based on Protocol Oblivious Forwarding

Jinghong Wu Hong Ni Xuewen Zeng Li Ding Xiaozhou Ye

OpenFlow, which facilitates decoupling between the forwarding and control plane, is developing rapidly and has already been widely studied in various fields. OpenFlow switches perform certain actions under the guidance of flow tables, which are configured by the controller. Currently, most of the work based on OpenFlow switch is concerned with switching performance such as forwarding rate, forwarding latency and flow table efficiency. In contrast, little work has been done on storage for OpenFlow switches. However, directly imposing storage functionality on OpenFlow switches with large capacity storage devices will lead to a series of problems. The most protruding and apparent one is the degradation of forwarding rate, which is one of the most important figure of merits for OpenFlow switch. This paper analyses the typical problems in this context and proposes a novel storage approach based on Protocol Oblivious Forwarding (POF), which is an enhancement to OpenFlow-based SDN forwarding architecture. The preliminary experimental results on Linux-based POF soft switch validate the effectiveness and efficiency of our approach.

OpenFlow

Forwarding plane

10.1109/iscc.2016.7543891

Cite

Citations (2)