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

2013 IEEE International Conference on Green Computing and Communications and IEEE Internet of Things and IEEE Cyber, Physical and Social Computing, GreenCom-iThings-CPSCom 2013

作者： Xiao, Limin Zheng, Yao Tang, Wenqi Yao, Guangchao Ruan, Li Wang, Xiang State Key Laboratory of Software Development Environment Beihang University China School of Computer Science and Engineering Beihang University Beijing China School of Electronic and Information Engineering Beihang University Beijing China

ISBN: (纸本)9780769550466

High-quality content-based music similarity retrieval methods are non-vectorial and use non-metric divergence measures, which prevents the expansion of music recommendation systems. We presents a GPU-based method to speed up content-based music similarity search in large-scale collections, in order to improve the response speed without reducing retrieval accuracy. The method also introduce an optimization technique based on memory layout to improve memory access. The efficiency of our method is validated through extensive experiments. Evaluation results show that our single GPU implementation achieves 10x speedup ratio on NVIDIA GTX480, when compared to a typical general purpose CPU's execution time. © 2013 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Circular convex bipartite graphs: Feedback vertex set 1

引用

7th International Conference on Combinatorial Optimization and Applications, COCOA 2013

作者： Lu, Zhao Lu, Min Liu, Tian Xu, Ke Key Laboratory of High Confidence Software Technologies School of Electronic Engineering and Computer Science Peking University Beijing 100871 China National Lab. of Software Development Environment Beihang University Beijing 100191 China

ISBN: (数字)9783319037806

ISBN: (纸本)9783319037790

A feedback vertex set is a subset of vertices, such that the removal of this subset renders the remaining graph cycle-free. The weight of a feedback vertex set is the sum of weights of its vertices. Finding a minimum weighted feedback vertex set is tractable for convex bipartite graphs, but NP-complete even for unweighted bipartite graphs. In a circular convex (convex, respectively) bipartite graph, there is a circular (linear, respectively) ordering defined on one class of vertices, such that for every vertex in another class, the neighborhood of this vertex is a circular arc (an interval, respectively). The minimum weighted feedback vertex set problem is shown tractable for circular convex bipartite graphs in this paper, by making a Cook reduction (i.e. polynomial time Turing reduction) for this problem from circular convex bipartite graphs to convex bipartite graphs. © Springer International Publishing 2013.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Probability tree based passenger flow prediction and its application to the Beijing subway system

引用

Frontiers of computer science 2013年第2期7卷 195-203页

作者： Biao LENG Jiabei ZEN Zhang XIONG Weifeng LV Yueliang WAN State Key Laboratory of Software Development Environment Beihang UniversityChina Beijing 100191 School of Computer Science and Engineering Beihang UniversityChina Beijing 100191 Shenzhen Key Laboratory of Data Vitalization (Smart City) Research Institute of Beihang University in Shenzhen China Shenzhen 518057 The Third Research Institute of Ministry of Public Security Run Technologies Co. Ltd. China Beijing 100044

In order to provide citizens with safe, convenient and comfortable services and infrastructure in a metropolis, the prediction of passenger flows in the metro-net of subway system has become more important than ever before. Al- though a great number of prediction methods have been pre- sented in the field of transportation, all of them belong to the station oriented approach, which is not well suited to the Bei- jing subway system. This paper proposes a novel metro-net oriented method, called the probability tree based passenger flow model, which is also based on historic origin-destination （OD） information. First it learns and obtains the appearance probabilities for each kind of OD pair. For the real-time origin datum, the destination datum is calculated, and then several kinds of passenger flow in the metro-net can be pre- dicted by gathering all the contributions. The results of exper- iments, using the historical data of Beijing subway, show that although the proposed method has lower performance than existing prediction approaches for forecasting exit passenger flows, it is able to predict several additional kinds of passen- ger flow in stations and throughout the subway system; and it is a more feasible, suitable, and advanced passenger flow prediction model for Beijing subway system.

关键词： passenger flow prediction tree model origin-destination information

来源：评论

学校读者我要写书评

暂无评论

From interest to function: Location estimation in social media

From interest to function: Location estimation in social med...

引用

27th AAAI Conference on Artificial Intelligence, AAAI 2013

作者： Chen, Yan Zhao, Jichang Hu, Xia Zhang, Xiaoming Li, Zhoujun Chua, Tat-Seng State Key Laboratory of Software Development Environment Beihang University China School of Computing National University of Singapore Singapore Singapore Department of Physics Bar-Ilan University Israel Department of Computer Science and Engineering Arizona State University United States

ISBN: (纸本)9781577356158

Recent years have witnessed the tremendous development of social media, which attracts a vast number of Internet users. The high-dimension content generated by these users provides an unique opportunity to understand their behavior deeply. As one of the most fundamental topics, location estimation attracts more and more research efforts. Different from the previous literature, we find that user's location is strongly related to user interest. Based on this, we first build a detection model to mine user interest from short text. We then establish the mapping between location function and user interest before presenting an efficient framework to predict the user's location with convincing fidelity. Thorough evaluations and comparisons on an authentic data set show that our proposed model significantly outperforms the state-of-the-arts approaches. Moreover, the high efficiency of our model also guarantees its applicability in real-world scenarios. Copyright © 2013, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Social networking (online)

来源：评论

学校读者我要写书评

暂无评论

HySF: A Striped File Assignment Strategy for Parallel File System with Hybrid Storage

HySF: A Striped File Assignment Strategy for Parallel File S...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Mingfa Zhu Guoying Li Li Ruan Ke Xie Limin Xiao State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing China

Many algorithms have been proposed to statically assign files in parallel I/O systems. Most of them were built on the basis that the underlying storage devices are homogeneous, while the wide use of SSDs makes hybrid storage architecture composed of SSDs and HDDs to be adopted in many parallel I/O systems. In this way, the previous static assignment algorithms could not fulfill the need of this new storage architecture any more. In this paper, we first develop an extensive hybrid parallel I/O system, in which the SSDs and HDDs are laid in the same system level. Then we build the performance model for both SSDs and HDDs in order to find the appropriate roles for them in the parallel I/O system. Based on the performance model, we propose a novel static file assignment algorithm named HySF for the hybrid parallel I/O system targeted to acquire low response time and load balancing. We reach the low response time goal by assigning files to the appropriate respective storage medium and load balancing goal by sorting the files by the access rate. The experiment results show that the HySF algorithm achieves much better performance on mean response time than the other algorithms and presents great flexibility.

关键词： Heuristic algorithms Time factors Load management Load modeling Mathematical model Cost function Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

GPU-Accelerated Query by Humming Using Modified SPRING Algorithm

GPU-Accelerated Query by Humming Using Modified SPRING Algor...

引用

IEEE International Conference on Data Mining Workshops (ICDM Workshops)

作者： Guangchao Yao Yao Zheng Limin Xiao Li Ruan Yongnan Li Zhenzhong Zhang State Key Laboratory of Software Development Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9781479931446

Current query by humming system can hardly be extended to large massive database as most of them adopt the features extracted from MIDI files which are not widely used and the very time-consuming match methods. In this work, we regard query by humming as a subsequence similarity match problem and exploit the modified SPRING algorithm instead of DTW as the core match method to compare the melody feature extracted from polyphonic music. The SPRING algorithm reduces the algorithm complexity of subsequence match dramatically. Furthermore, we also make it possible for our system to achieve a high speedup over the serial version on different GPU platforms. Experimental results show that our system has more advantages over the state of the art subsequence match method, and has a good scalability to massive database. The processing capacity can reach to thousands of sequences match per second under down sampling. At the same time, the retrieval accuracy results related to all aspects of query by humming point out the encountered problems and the future direction.

关键词： Springs Databases Feature extraction Music Acceleration Accuracy Graphics processing units

来源：评论

学校读者我要写书评

暂无评论

A rough set algorithm for attribute reduction via mutual information and conditional entropy

A rough set algorithm for attribute reduction via mutual inf...

引用

International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)

作者： Jing Tian Quan Wang Bing Yu Dan Yu State Key Laboratory of Software Development Environment Beihang University Beijing China School of Computer Science and Engineering Beihang University Beijing China

ISBN: (纸本)9781467352512

Attribute reduction is one of the kernel components in the rough set theory, which has been successfully applied in many fields. This paper firstly analyzes the major drawbacks that most of the current algorithmic approaches hold. Then it proposes a novel heuristic algorithm, which redefines the significance function of attributes using mutual information and conditional entropy. Also this paper considers the redundancy variation of the existing attributes within the reduct set influenced by the newly-added elements. Besides, the attribute dependency measurement is modified instead of common entropy-based assessment during the procedure in this article. The experimental result shows that our algorithm can obtain the reduct set with minimal number of members under most circumstances with faster convergence rate than other entropy-based methods.

关键词： Entropy Mutual information Educational institutions Heuristic algorithms Rough sets Random variables

来源：评论

学校读者我要写书评

暂无评论

Energy Aware Scheduling for Precedence Constrained Parallel Tasks in a Power-Scalable Cluster

Energy Aware Scheduling for Precedence Constrained Parallel ...

引用

IEEE International Conference on High Performance Computing and Communications (HPCC)

作者： Aihua Liang Limin Xiao Yongnan Li Zhenzhong Zhang Li Ruan School of Computer Science and Engineering Beihang University Beijing China State Key Laboratory of Software Development Environment Beihang University Beijing China

Improving the energy efficiency of high performance clusters has become important research issue. We proposed a new algorithm that reduces energy consumption of precedence constrained parallel tasks in power-scalable clusters. To reduce energy consumption without increasing the schedule length, our algorithm reclaims both static and dynamic slack time and employs different frequency adjusting techniques in different slack time. The optimal frequency is obtained through analyzing the precedence constraints of parallel tasks. We conducted experiments to compare the proposed algorithm with two other existing algorithms. Simulation results show that the proposed algorithm can get better energy efficiency without increasing the make span.

关键词： Energy consumption Time-frequency analysis Heuristic algorithms Clustering algorithms Scheduling algorithms Scheduling

来源：评论

学校读者我要写书评

暂无评论

Square over finite field GF(2n) using Self-Assembly of DNA Tiles

引用

International Journal of Hybrid Information Technology 2013年第4期6卷 63-70页

作者： Li, Yongnan Xiao, Limin Ruan, Li Xie, Ke Yao, Guangchao State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China

The tile assembly model is a highly distributed parallel model of molecular computation. Plenty of experiments have proved that the simple binary arithmetic could be fulfilled by the process of self-assembly of DNA (deoxyribonucleic acid) tiles. Finite field GF(2n) is one of the most commonly used mathematic sets. A DNA computing system was designed based on the tile assembly model and applied to perform the operation of square over finite field GF(2n). One concrete example is proposed to show the details of our tile assembly system.

关键词： DNA

来源：评论

学校读者我要写书评

暂无评论

Intelligent transportation systems for smart cities:a progress review

引用

science China(Information sciences) 2012年第12期55卷 2908-2914页

作者： COOPER Dave E State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang University

To better meet the challenge of providing effective,low-cost,energy efficient transport services,the concept of intelligent transport systems(ITS) has been proposed and lauded as an innovative and promising solution for next generation transport *** this paper,the progress of ITS research around the world is briefly reviewed and current challenges are outlined,thereby offering further insight into ITS development for all researchers in this area.

关键词： intelligent transportation systems traffic information smart city

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：