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

International Joint Conference on Neural Networks

作者： Menglong Lu Dawei Feng Linbo Qiao Dawen Ding Dongsheng Li Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China College of Computer National University of Defense Technology Changsha China CMC AS2 South CSC Asiainfo Nanchang China

Bundle method for regularized risk minimization (BMRM) is a variant of Cutting Plane Method (CPM). It performs efficiently in solving a convex minimization problem, which is a core part in a plethora of machine learning applications. Nonetheless, while exposed to the challenge of large-scale learning, the synchronous parallel implementation of BMRM easily encounters the straggler problem due to the diversity among heterogeneous working nodes' capability and unevenness in the inherent data distribution. In this paper, we propose a novel asynchronous distributed BMRM implementation, which employs an asynchronous computing window to fully explore the fast nodes' computational capabilities while reserving the good convergence of the BMRM. Extensive experiments show that the asynchronous BMRM algorithm has significant improvement of performance over its synchronous counterpart, and owns the ability to solve large-scale problems efficiently.

关键词： Estimation Linear programming Machine learning Risk management Convergence Servers Minimization

来源：评论

学校读者我要写书评

暂无评论

Design of an Indoor Exploration and Multi-Objective Navigation System

Design of an Indoor Exploration and Multi-Objective Navigati...

引用

Chinese Control Conference (CCC)

作者： Guoxian Zheng Lei Zhang Huaxi Yulin Zhang Bo Ding State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China MIS Universite de Picardie Jules Verne Amiens France National Laboratory for Parallel and Distributed Processing National University of Defense Technology Changsha China

In this paper, we propose an indoor robot autonomous navigation system. The robot firstly explores in an unknown environment, and then navigates autonomously by using the explored map. The robot is equipped a 2D laser scanner as the main sensor. The laser scanner is used for path planning and frontier-based exploration. A 2D global occupancy map is built for path planning, frontier-based exploration and multi-objective autonomous navigation. Laser scans are transmitted into Simultaneous Localization and Mapping (SLAM) process in the exploration phase. In indoor environment, the exploration efficiency is improved by merging a heuristic algorithm. By using multi-threading technology and a 3D perception approach proposed in this paper, the robot equipped with a low-cost RGBD sensor can detect all kinds of obstacles to achieve highly reliable navigation in complicated 3D environment. Meanwhile, we develop a multi-objective navigation application to make human-robot interaction more convenient and satisfy multi-task deployment. Our approaches are demonstrated by experimental results.

关键词： Navigation Three-dimensional displays Robot sensing systems Lasers Path planning Two dimensional displays

来源：评论

学校读者我要写书评

暂无评论

RuleRAG: Rule-Guided Retrieval-Augmented Generation with Language Models for Question Answering

arXiv

引用

arXiv 2024年

作者： Chen, Zhongwu Xu, Chengjin Wang, Dingmin Huang, Zhen Dou, Yong Jiang, Xuhui Guo, Jian National Key Laboratory of Parallel and Distributed Computing College of Computer Science and Technology National University of Defense Technology China IDEA Research International Digital Economy Academy Department of Computer Science University of Oxford United Kingdom

Retrieval-augmented generation (RAG) has shown promising potential in knowledge intensive question answering (QA). However, existing approaches only consider the query itself, neither specifying the retrieval preferences for the retrievers nor informing the generators of how to refer to the retrieved documents for the answers, which poses a significant challenge to the QA performance. To address these issues, we propose Rule-guided Retrieval-Augmented Generation with LMs, which explicitly introduces rules for in-context learning (RuleRAG-ICL) to guide retrievers to recall related documents in the directions of rules and uniformly guide generators to reason attributed by the same rules. The combination of queries and rules can be used as fine-tuning data to update retrievers and generators, achieving better rule-based instruction-following ability (RuleRAG-FT). Moreover, most existing RAG datasets were constructed without considering rules and Knowledge Graphs (KGs) are recognized as providing high-quality rules. Therefore, we construct five rule-aware RAG benchmarks for QA, RuleQA, based on KGs to stress the significance of retrieval and reasoning with rules. Experiments on RuleQA demonstrate RuleRAG-ICL improves the retrieval quality of +89.2% in Recall@10 and answer accuracy of +103.1% in Exact Match, and RuleRAG-FT yields more enhancement. In addition, experiments on four existing RAG datasets show RuleRAG is also effective by offering rules in RuleQA to them, further proving the generalization of rule guidance in RuleRAG. Code and RuleQA are at https://***/r/RuleRAG. Copyright © 2024, The Authors. All rights reserved.

关键词： Question answering

来源：评论

学校读者我要写书评

暂无评论

Collaborative deep learning across multiple data centers

arXiv

引用

arXiv 2018年

作者： Xu, Kele Mi, Haibo Feng, Dawei Wang, Huaimin Chen, Chuan Zheng, Zibin Lan, Xu National Key Laboratory of Parallel and Distributed Processing Changsha China College of Computer National University of Defense Technology Changsha China School of Data and Computer Science Sun Yat-Sen University Guangzhou China Queen Mary University of London London United Kingdom

Valuable training data is often owned by independent organizations and located in multiple data centers. Most deep learning approaches require to centralize the multi-datacenter data for performance purpose. In practice, however, it is often infeasible to transfer all data to a centralized data center due to not only bandwidth limitation but also the constraints of privacy regulations. Model averaging is a conventional choice for data parallelized training, but its ineffectiveness is claimed by previous studies as deep neural networks are often non-convex. In this paper, we argue that model averaging can be effective in the decentralized environment by using two strategies, namely, the cyclical learning rate and the increased number of epochs for local model training. With the two strategies, we show that model averaging can provide competitive performance in the decentralized mode compared to the data-centralized one. In a practical environment with multiple data centers, we conduct extensive experiments using state-of-the-art deep network architectures on different types of data. Results demonstrate the effectiveness and robustness of the proposed method. Copyright © 2018, The Authors. All rights reserved.

关键词： Network architecture

来源：评论

学校读者我要写书评

暂无评论

Optimal and near-optimal allocation of precedence-constrained tasks to parallel processors: defying the high complexity using effective search techniques

Optimal and near-optimal allocation of precedence-constraine...

引用

International Conference on parallel processing (ICPP)

作者： I. Ahmad Yu-Kwong Kwok Department of Computer Science Hong Kong University of Science and Technology Hong Kong China Parallel Processing Laboratory School of Electrical and Computer Engineering Purdue University West Lafayette IN USA

Obtaining an optimal schedule for a set of precedence-constrained tasks with arbitrary costs is a well-known NP-complete problem. However, optimal solutions are desired in many situations. In this paper we propose search-based algorithms for determining optimal schedules for moderately large problem sizes. The first algorithm which is based on the A* search technique uses a computationally efficient cost function for guiding the search with reduced complexity. We propose a number of state-pruning techniques to reduce the size of the search space. For further lowering the complexity, we parallelize the search. The parallel version is based on reduced interprocessor communication and is guided by static and dynamic load-balancing schemes to evenly distribute the search states to the processors. We also propose an approximate algorithm that guarantees a bounded deviation from the optimal solution but takes considerably shorter time. Based on an extensive experimental evaluation of the algorithms, we conclude that the parallel algorithm with pruning techniques is an efficient scheme for generating optimal solutions for medium to moderately large problems while the approximate algorithm is a useful alternative if slightly degraded solutions are acceptable.

关键词： Optimal scheduling Processor scheduling Computational efficiency Costs Concurrent computing Network topology Scheduling algorithm Computer science Laboratories Multiprocessor interconnection networks

来源：评论

学校读者我要写书评

暂无评论

Loss rank mining: A general hard example mining method for real-time Detectors

arXiv

引用

arXiv 2018年

作者： Yu, Hao Zhang, Zhaoning Qin, Zheng Wu, Hao Li, Dongsheng Zhao, Jun Lu, Xicheng Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China College of Electronic and Engineering National University of Defense Technology Changsha China College of Meteorology and Oceanology National University of Defense Technology Changsha China

Modern object detectors usually suffer from low accuracy issues, as foregrounds always drown in tons of backgrounds and become hard examples during training. Compared with those proposal-based ones, real-time detectors are in far more serious trouble since they renounce the use of regionproposing stage which is used to filter a majority of backgrounds for achieving real-time rates. Though foregrounds as hard examples are in urgent need of being mined from tons of backgrounds, a considerable number of state-of-the-art realtime detectors, like YOLO series, have yet to profit from existing hard example mining methods, as using these methods need detectors fit series of prerequisites. In this paper, we propose a general hard example mining method named Loss Rank Mining (LRM) to fill the gap. LRM is a general method for real-time detectors, as it utilizes the final feature map which exists in all real-time detectors to mine hard examples. By using LRM, some elements representing easy examples in final feature map are filtered and detectors are forced to concentrate on hard examples during training. Extensive experiments validate the effectiveness of our method. With our method, the improvements of YOLOv2 detector on auto-driving related dataset KITTI and more general dataset PASCAL VOC are over 5% and 2% mAP, respectively. In addition, LRM is the first hard example mining strategy which could fit YOLOv2 perfectly and make it better applied in series of real scenarios where both real-time rates and accurate detection are strongly demanded. Copyright © 2018, The Authors. All rights reserved.

关键词： Mining

来源：评论

学校读者我要写书评

暂无评论

Loss Rank Mining: A General Hard Example Mining Method for Real-time Detectors

Loss Rank Mining: A General Hard Example Mining Method for R...

引用

International Joint Conference on Neural Networks

作者： Hao Yu Zhaoning Zhang Zheng Qin Hao Wu Dongsheng Li Jun Zhao Xicheng Lu Science and Technology on Parallel and Distributed Laboratory National University of Defense Technology Changsha China College of Electronic and Engineering National University of Defense Technology Changsha China College of Meteorology and Oceanology National University of Defense Technology Changsha China

Modern object detectors usually suffer from low accuracy issues, as foregrounds always drown in tons of back-grounds and become hard examples during training. Compared with those proposal-based ones, real-time detectors are in far more serious trouble since they renounce the use of region-proposing stage which is used to filter a majority of back-grounds for achieving real-time rates. Though foregrounds as hard examples are in urgent need of being mined from tons of backgrounds, a considerable number of state-of-the-art real-time detectors, like YOLO series, have yet to profit from existing hard example mining methods, as using these methods need detectors fit series of prerequisites. In this paper, we propose a general hard example mining method named Loss Rank Mining (LRM) to fill the gap. LRM is a general method for real-time detectors, as it utilizes the final feature map which exists in all real-time detectors to mine hard examples. By using LRM, some elements representing easy examples in final feature map are filtered and detectors are forced to concentrate on hard examples during training. Extensive experiments validate the effectiveness of our method. With our method, the improvements of YOLOv2 detector on auto-driving related dataset KITTI and more general dataset PASCAL VOC are over 5% and 2% mAP, respectively. In addition, LRM is the first hard example mining strategy which could fit YOLOv2 perfectly and make it better applied in series of real scenarios where both real-time rates and accurate detection are strongly demanded.

关键词： Detectors Real-time systems Feature extraction Training Object detection Pipelines Task analysis

来源：评论

学校读者我要写书评

暂无评论

Maximizing Uniform Multicast Throughput in Multi-Channel Dense Wireless Sensor Networks

Maximizing Uniform Multicast Throughput in Multi-Channel Den...

引用

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Xianlong Jiao Guirong Chen Xiaodong Wang Yuli Chen Li Yang College of Information System and Management National University of Defense Technology Changsha Information and Navigation College Air Force Engineering University Xi'an Science and Technology on Parallel and Distributed Processing Laboratory National University of Defense Technology Changsha Chongqing Guanyinqiao Elementary School Chongqing Chongqing Liangjiangxinqu Renhe Experimental School Chongqing

ISBN: (纸本)9781509056972

This paper investigates the problem of maximizing uniform multicast throughput (MUMT) for multi-channel dense wireless sensor networks, where all nodes locate within one-hop transmission range and can communicate with each other on multiple orthogonal channels. This kind of networks show wide application in the real world, and maximizing uniform multicast throughput for these networks is worth deep studying. Previous researches have proved MUMT problem is NP-hard. However, previous researches are either hard to implement, or use too many relay nodes to complete the multicast task, and thus incur high overhead or poor performance. To efficiently solve MUMT problem, we adopt the concept of the maximum independent set with the size constraint, and present one novel Single-Broadcast based Multicast algorithm called SBM based on the concept. We prove that SBM algorithm achieves a constant ratio to the theoretical throughput upper bound. Extensive experimental results demonstrate that, SBM performs better than existing work in terms of both the uniform multicast throughput and the total number of transmissions.

关键词： Throughput Wireless sensor networks Approximation algorithms Schedules Data communication Algorithm design and analysis Relays

来源：评论

学校读者我要写书评

暂无评论

Physiologically based speech synthesis 92

Physiologically based speech synthesis

引用

Proceedings of the 6th International Conference on Neural Information processing Systems

作者： Makoto Hirayama Eric Vatikiotis-Bateson Kiyoshi Honda Yasuharu Koike Mitsuo Kawato ATR Human Information Processing Research Laboratories Soraku-gun Kyoto Japan ATR Auditory and Visual Perception Research Laboratories ATR Human Information Processing Research Laboratories Soraku-gun Kyoto Japan and Laboratory of Parallel Distributed Processing Research Institute for Electronic Science Hokkaido University Sapporo Hokkaido Japan

ISBN: (纸本)9781558602748

This study demonstrates a paradigm for modeling speech production based on neural networks. Using physiological data from speech utterances, a neural network learns the forward dynamics relating motor commands to muscles and the ensuing articulator behavior that allows articulator trajectories to be generated from motor commands constrained by phoneme input strings and global performance parameters. From these movement trajectories, a second neural network generates PARCOR parameters that are then used to synthesize the speech acoustics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Applying linux high-availability and load balancing servers for Video-on-Demand (VOD) systems

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in Computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3332卷 455-462页

作者： Yang, Chao-Tung Wang, Ko-Tzu Li, Kuan-Ching Lee, Liang-Teh High Performance Computing Laboratory Dept. of Computer Science and Information Engineering Tunghai University Taichung 407 Taiwan Parallel and Distributed Processing Center Dept. of Computer Science and Information Management Providence University Taichung 433 Taiwan Dept. of Computer Science and Engineering Tatung University Taipei 104 Taiwan

In this research paper, we integrate and implement High-Availability (HA) and Load-Balancing technologies to clusters of workstations, increasing both the availability and scalability of services and resources in these systems. The cluster of workstations is commonly built and used as web-based VOD servers. Thus, this paper presents the hardware and software configurations of cluster systems working as VOD servers. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：