检索结果-内蒙古大学图书馆

On-orbit real-time robust cooperative target identification in complex background

Chinese Journal of Aeronautics 2015年第5期28卷 1451-1463页

作者： Wen Zhuoman Wang Yanjie Arjan Kuijper Di Nan Luo Jun Zhang Lei Jin Minghe Changchun Institute of Optics Fine Mechanics and Physics Chinese Academy of Sciences University of the Chinese Academy of Sciences Fraunhofer Institute for Computer Graphics Research Technische Universitt Darmstadt State Key Laboratory of Robotics and System Harbin Institute of Technology

Cooperative target identification is the prerequisite for the relative position and orientation measurement between the space robot arm and the to-be-arrested object. We propose an on- orbit real-time robust algorithm for cooperative target identification in complex background using the features of circle and lines. It first extracts only the interested edges in the target image using an adaptive threshold and refines them to about single-pixel-width with improved non-maximum suppression. Adapting a novel tracking approach, edge segments changing smoothly in tangential directions are obtained. With a small amount of calculation, large numbers of invalid edges are removed. From the few remained edges, valid circular arcs are extracted and reassembled to obtain circles according to a reliable criterion. Finally, the target is identified if there are certain numbers of straight lines whose relative positions with the circle match the known target pattern. Experiments demonstrate that the proposed algorithm accurately identifies the cooperative target within the range of 0.3 1.5 m under complex background at the speed of 8 frames per second, regardless of lighting condition and target attitude. The proposed algorithm is very suitable for real-time visual measurement of space robot arm because of its robustness and small memory requirement.

关键词： Circle detection Edge extraction Edge tracking Line detection Robot vision Space robot arm

来源：评论

学校读者我要写书评

暂无评论

dCompaction： Speeding up Compaction of the LSM-Tree via Delayed Compaction

引用

Journal of computer Science & Technology 2017年第1期32卷 41-54页

作者： Feng-Feng Pan Yin-Liang Yue Jin Xiong State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China University of Chinese Academy of Sciences Beijing 100049 China Institute of Information Engineering Chinese Academy of Sciences Beijing 100093 China

key-value （KV） stores have become a backbone of large-scale applications in today＇s data centers. Write- optimized data structures like the Log-Structured Merge-tree （LSM-tree） and their variants are widely used in KV storage systems like BigTable and RocksDB. Conventional LSM-tree organizes KV items into multiple, successively larger components, and uses compaction to push KV items from one smaller component to another adjacent larger component until the KV items reach the largest component. Unfortunately, current compaction scheme incurs significant write amplification due to repeated KV item reads and writes, and then results in poor throughput. We propose a new compaction scheme, delayed compaction （dCompaction） that decreases write amplification, dCompaction postpones some compactions and gathers them into the following compaction. In this way, it avoids KV item reads and writes during compaction, and consequently improves the throughput of LSM-tree based KV stores. We implement dCompaction on RocksDB, and conduct extensive experiments. Validation using YCSB framework shows that compared with RocksDB, dCompaction has about 40% write performance improvements and also comparable read performance.

关键词： key-value store Log-Structured Merge-tree （LSM-tree） write amplification delayed compaction

来源：评论

学校读者我要写书评

暂无评论

Hohmann transfer via constrained optimization

引用

Frontiers of Information Technology & Electronic Engineering 2018年第11期19卷 1444-1458页

作者： Li XIE Yi-qun ZHANG Jun-yan XU State Key Laboratory of Alternate Electrical Power System with Renewable Energy Sources School of Control and Computer EngineeringNorth China Electric Power UniversityBeijing 102206China Beijing Institute of Electronic Systems Engineering Beijing 100854China

Inspired by the geometric method proposed by Jean-Pierre MAREC, we first consider the Hohmann transfer problem between two coplanar circular orbits as a static nonlinear programming problem with an inequality constraint. By the Kuhn-Tucker theorem and a second-order sufficient condition for minima, we analytically prove the global minimum of the Hohmann transfer. Two sets of feasible solutions are found: one corresponding to the Hohmann transfer is the global minimum and the other is a local minimum. We next formulate the Hohmann transfer problem as boundary value problems, which are solved by the calculus of variations. The two sets of feasible solutions are also found by numerical examples. Via static and dynamic constrained optimizations, the solution to the Hohmann transfer problem is re-discovered, and its global minimum is analytically verified using nonlinear programming.

关键词： Hohmann transfer Nonlinear programming Constrained optimization Calculus of variations

来源：评论

学校读者我要写书评

暂无评论

Network penetration testing scheme description language

Network penetration testing scheme description language

引用

2011 International Conference on Computational and Information Sciences, ICCIS 2011

作者： Dai, Zhiyong Lv, Liangshuang Liang, Xiaoyan Bo, Yang State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769545011

Penetration testing is widely used to help ensure the security of the network. Traditional penetration testings were manually performed by tester according to scheme, the process is usually complex resulting in that it is labor-intensive and requires tester to be familiar with all kind of tools. So it is very desirable to use a unified method to describe the scheme which can be identified by computer, then the computer can be used to substitute for tester to perform penetration testing. A new method is presented to describe penetration testing scheme. We propose a language for tester to describe the penetration testing scheme. Based on the conceptual model of penetration testing scheme we design the penetration testing scheme description language (PTSDL) and outline the important EBNF. PTSDL is declarative abstracting the process of penetration testing which makes this language flexible, extensible and adaptable to new penetration testing method. Use of this language is illustrated by an experimental study, which shows that the language can effectively describe the penetration testing scheme. © 2011 IEEE.

关键词： Testing

来源：评论

学校读者我要写书评

暂无评论

GPU accelerating for rapid multi-core cache simulation

GPU accelerating for rapid multi-core cache simulation

引用

25th IEEE International Parallel and Distributed Processing Symposium, Workshops and Phd Forum, IPDPSW 2011

作者： Han, Wan Xiang, Long Gao, Xiaopeng Yi, Li State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769543857

To find the best memory system for emerging workloads, traces are obtained during application's execution, then caches with different configurations are simulated using these traces. Since program traces can be several gigabytes, simulation of cache performance is a time consuming process. Compute unified device architecture (CUDA) is a software development platform which enables programmers to accelerate the general-purpose applications on the graphics processing unit (GPU). This paper presents a real time multi-core cache simulator, which was built based on the Pin tool to get the memory reference;and fast method for multi-core cache simulation using the CUDA-enabled GPU. The proposed method is accelerated by the following techniques: execution parallelism exploration;memory latency hiding;a novel trace compression methodology. We describe how these techniques can be incorporated into CUDA code. Experimental results show that the hybrid parallel method of time-partitioning combines with set-partitioning presented here is 11.10× speedup compared to the CPU serial simulation algorithm. The present simulator can characterize cache performance of single-threaded or multi-threaded workloads at the speeds of 6-15 MIPS. It can simulates 6 cache configurations within one single pass at this speeds compared to CMP$im, which can only simulate one cache configuration each simulation pass at the speeds of 4-10 MIPS. © 2011 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

IntML-KNN: A Few-Shot Radio Frequency Fingerprint Identification Scheme for Lora Devices

引用

IEEE Signal Processing Letters 2025年

作者： Cao, Xin Tan, Weijie Gao, Qiangqiang Hu, Zhilong Li, Chunguo Guizhou University College of Computer Science and Technology Guiyang 550025 China Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang 550025 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu 610025 China Ministry of Industry and Information Technology Laboratory of Cryptograph Application Technology Innovation and Testing Verification Beijing 100015 China Southeast University School of Information Science and Engineering Nanjing 210096 China

Deep learning (DL) is widely used in radio frequency fingerprint identification (RFFI). However, in few-shot case, traditional DL-based RFFI need to construct auxiliary dataset to realize radio frequency fingerprint identification. To address this issue, we propose a few-shot RFFI (FS-RFFI) method based on interpolating metric learning and KNN (IntML-KNN). Specifically, the method first extends the dataset with data augmentation, and CutMix interpolation. Secondly, combining with metric learning to enhance the generalization capacity of the model. Finally, KNN algorithm is designed to realize device classification and detection. The proposed IntML-KNN method is verified on the commercial available LoRa dataset. The experimental results indicate that the proposed scheme exhibits strong classification and generalization performance in FS-RFFI. Meanwhile, the recognition rate of the proposed IntML-KNN reaches 97.00% with only 10% samples. © 1994-2012 IEEE.

关键词： Data augmentation deep learning few-shot LoRa metric learning radio frequency fingerprint

来源：评论

学校读者我要写书评

暂无评论

A method to boost support vector machines 6th

A method to boost support vector machines

引用

6th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2002

作者： Diao, Lili Hu, keyun Lu, Yuchang Shi, Chunyi The State Key Laboratory of Intelligent Technology and System Dept of Computer Science and Technology Tsinghua University Beijing100084 China

ISBN: (纸本)9783540437048

Combining boosting and Support Vector Machine (SVM) is proved to be beneficial, but it is too complex to be feasible. This paper introduces an efficient way to boost SVM. It embraces the idea of active learning to dynamically select "important" samples into training sample set for constructing base classifiers. This method maintains a small training sample set with settled size in order to control the complexity of each base classifier. Other than construct each base SVM classifier directly, it uses the training samples only for finding support vectors. This way to combine boosting and SVM is proved to be accurate and efficient by experimental results. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Teach and playback of realistic target reaching movement of virtual human upper limb

Teach and playback of realistic target reaching movement of ...

引用

3rd International Conference on Autonomic and Autonomous systems, ICAS 2007

作者： Na, Meng Ding, Li Jia, Peifa State Key Laboratory of Intelligent Technology and System Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)076952799X

The significant research objective of virtual human is to generate realistic movement like real-life person. For the most frequent daily activity of target reaching movement of human upper limb, teach and playback method is proposed to generate vivid human motion, which combines respective merits of parametric keyframe, kinematics, dynamics, and motion capture methods together. First, the tip trajectory and velocity rules are learned and estimated by a weighted least squares support vector machine (WLS-SVM) and a combined half-Gaussians model respectively. Then an inverse kinematic method with dynamic constraint, damped least squares (DLS), is used to calculate the joint angles of the upper limb. Finally, the experimental results show that once the target position is appointed, the 3D virtual human skeleton model can generate realistic reaching movement. © 2007 IEEE.

关键词： Inverse kinematics

来源：评论

学校读者我要写书评

暂无评论

Learning bayesian networks with hidden variables using the combination of em and evolutionary algorithms 5th

引用

5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2001

作者： Tian, Fengzhan Lu, Yuchang Shi, Chunyi The State Key Laboratory of Intelligent Technology and System The Department of Computer Science and Technology Tsinghua University Beijing100084 China

ISBN: (纸本)3540419101

In this paper, a new method, called EM-EA, is put forward for learning Bayesian network structures from incomplete data. This method combines the EM algorithm with an evolutionary algorithm (EA) and transforms the incomplete data to complete data using EM algorithm and then evolve network structures using the evolutionary algorithm with the complete data. In order to learn Bayesian networks with hidden variables, a new mutation operator has been introduced and the function of the crossover has been correspondingly expanded. The results of the experiments show that EM-EA is more accurate and practical than other network structure learning algorithms that deal with the incomplete data. © Springer-Verlag Berlin Heidelberg 2001.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Automatic generation for penetration testing scheme analysis model for network

Automatic generation for penetration testing scheme analysis...

引用

2011 International Conference on Computational and Information Sciences, ICCIS 2011

作者： Shen, Lu Liang, Xiaoyan Bo, Yang Xia, Chunhe State Key Laboratory of Virtual Reality Technology and System School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9780769545011

The existing penetration testing systems need to rely on the professional skills in the testing process, so they increase the penetration testing of human resources and costs. While it also reduces the efficiency of the test, it increases the test cycle. This paper presents a new penetration testing scheme by an automatically generated method. Through penetration testing scheme description, we establish an automatic generation system about penetration testing scheme, and the automatic generation penetration testing scheme for network analysis model (AGPTSAM) is established, and then the termination of the AGPTSAM is proved by the pushdown automaton. The prototype system of AGPTSAM is implemented. The penetration testing scheme could provide guidance and basis for the implementation of the penetration testing system, and shorten the test cycle and the human resources cost. This method is verification of effectiveness by experimental which works on the implementing platform. © 2011 IEEE.

关键词： Analytical models Automatica Generation Computational modeling Information security Penetration Testing Prototypes Scheme Testing

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：