Search

Your search keyword '"Yang, Yukun"' showing total 67 results
Start Over Author "Yang, Yukun" Publisher elsevier bv
67 results on '"Yang, Yukun"'

14. Two birds with one stone: A universal design and application of signal-on labeled fluorescent/electrochemical dual-signal mode biosensor for the detection of tetracycline residues in tap water, milk and chicken

Author

Yang, Lanqing, primary, Wang, Xiaomin, additional, Zhang, Fuyuan, additional, Yu, Ligang, additional, Bai, Baoqing, additional, Zhang, Jinhua, additional, Zhang, Bo, additional, Tian, Yu, additional, Qin, Shu, additional, and Yang, Yukun, additional

Published
2023
Full Text
View/download PDF

43. Real-time dynamic system to path tracking and collision avoidance for redundant robotic arms

Author

Yang Yukun, Sun Hanxu, Gao Xin, Jia Qingxuan, Chen Gang, and Zhang Qianru

Subjects
0209 industrial biotechnology, Computer Networks and Communications, business.industry, Computer science, 020208 electrical & electronic engineering, Coordinate system, 02 engineering and technology, Space mapping, 020901 industrial engineering & automation, Robustness (computer science), Control theory, Signal Processing, Obstacle avoidance, 0202 electrical engineering, electronic engineering, information engineering, Robot, Computer vision, Artificial intelligence, Motion planning, Mean-shift, business, Robotic arm, Information Systems
Abstract

An dynamic system for real-time obstacle avoidance path planning of redundant robots is constructed in this paper. Firstly, the inter-frame difference method is used to identify the moving target and to calculate the target area, then on the basis of color features and gradient features extracted from the target area, the feature fusion Cam-Shift mean shift algorithm is used to track target, improving the robustness of the tracking algorithm. Secondly, a parallel two-channel target identification and location method based on binocular vision is proposed, updating the target's three-dimensional information in real time. Then, a dynamic collision-free path planning method is implemented: the safety rods are removed through the intersection test, and the minimum distance is derived directly by using the coordinate values of the target in the local coordinate system of the rod. On this basis, the obstacle avoidance gain and escape velocity related to the minimum distance is established, and obstacle avoidance path planning is implemented by using the zero space mapping matrix of redundant robot. Experiments are performed to study the efficiency of the proposed system.

Published
2016

44. Efficient measurement of round-trip link delays in software-defined networks

Author

Shizhong Xu, Xiong Wang, Sheng Wang, Shui Yu, Yang Yukun, Hanyu Liu, and Jing Ren

Subjects
Scheme (programming language), Computer Networks and Communications, Computer science, Distributed computing, 0805 Distributed Computing, 1005 Communications Technologies, 020206 networking & telecommunications, Measurement problem, 02 engineering and technology, Network topology, Computer Science Applications, Constraint (information theory), Hardware and Architecture, 0202 electrical engineering, electronic engineering, information engineering, 020201 artificial intelligence & image processing, Networking & Telecommunications, Link (knot theory), Software-defined networking, computer, Integer programming, computer.programming_language
Abstract

© 2019 Elsevier Ltd Round-trip link delay is an important indicator for network performance optimization and troubleshooting. The Software-Defined Networking (SDN) paradigm, which provides flexible and centralized control capability, paves the way for efficient round-trip link delay measurement. In this paper, we study the round-trip link delay measurement problem in SDN networks. We propose an efficient measurement scheme, which infers round-trip link delays from end-to-end delay of some measurement paths implemented with few flow rules in each SDN switch. Furthermore, to reduce measurement cost and meet measurement constraint, we address the Monitor Placement and Link Assignment (MPLA) problem involved in the measurement scheme. Specifically, we formulate the MPLA problem as a Mixed Integer Linear Programming (MILP) problem, prove that it is NP-hard, and propose an efficient algorithm called MPLA Algorithm based on Biding Strategy (MPLAA-BS) to solve the problem. The extensive simulation results on real network topologies reveal that the proposed scheme can efficiently and accurately measure round-trip link delays in SDN networks, and the MPLAA-BS can find feasible and resource-efficient solutions for the MPLA problem.

Published
2020

Catalog

Books, media, physical & digital resources
See catalog results