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

IEEE International Conference on Signal and Image Processing (ICSIP)

作者： Song, Hongyong Feng, Weijiang Guan, Naiyang Huang, Xuhui Luo, Zhigang Natl Univ Def Technol Coll Comp Inst Software Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Sci & Technol Parallel & Distributed Proc Lab Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Coll Comp Dept Comp Sci & Technol Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781509023776

Wearable device with an ego-centric camera would be the next generation device for human-computer interaction such as robot control. Hand gesture is a natural way of egocentric human-computer interaction. In this paper, we present an ego-centric multi-stage hand gesture analysis pipeline for robot control which works robustly in the unconstrained environment with varying luminance. In particular, we first propose an adaptive color and contour based hand segmentation method to segment hand region from the viewpoint. We then propose a convex U-shaped egocentric curve detection algorithm to precisely detect positions of fingertips. And parallelly, we utilize the convolutional neural networks to recognize hand gestures. Based on these techniques, we combine most information of hand to control the robot and develop a hand gesture analysis system on an iPhone and a robot arm platform to validate its effectiveness. Experimental result demonstrates that our method works perfectly on controlling the robot arm by hand gesture in real time.

关键词： ego-centric vision hand detection and segmentation fingertips detection hand gesture recognition robot control human-computer interaction

来源：评论

学校读者我要写书评

暂无评论

Remote storage management in science gateways via data bridging

引用

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE 2015年第16期27卷 4398-4411页

作者： Hajnal, Akos Marton, Istvan Farkas, Zoltan Kacsuk, Peter Hungarian Acad Sci Lab Parallel & Distributed Syst Inst Comp Sci & Control H-1132 Budapest Hungary Univ Westminster Comp Sci & Software Engn Dept London W1W 6UW England

State-of-the-art science gateways can be connected to several distributed computing infrastructures (DCIs) and are able to run jobs and workflows simultaneously in all those DCIs. Flexibility of accessing diverse data storages from these workflows and assisting end users to manage these storages are however the missing features in current gateway implementations, in which these problems often prove to be a barrier of exploiting the power of distributed computing by user communities having no or little IT competence. This paper addresses these issues by integrating a data bridging service called Data Avenue into WS-PGRADE/gUSE portal framework. Data Avenue offers tools for the end users to easily manage their data residing on various storage resources, and also, jobs become capable of accessing different storages regardless of the particular distributed computing infrastructure where the job is currently being run. Copyright (c) 2014 John Wiley & Sons, Ltd.

关键词： data storage systems data handling data transfer grid computing

来源：评论

学校读者我要写书评

暂无评论

DMRUT-MCDS: Discovery Relationships in the Cyber-Physical Integrated Network

引用

JOURNAL OF COMMUNICATIONS AND NETWORKS 2015年第6期17卷 558-567页

作者： Lu, Hongliang Cao, Jiannong Zhu, Weiping Jiao, Xianlong Lv, Shaohe Wang, Xiaodong Natl Univ Def Technol Sch Comp Sci & Technol Parallel & Distributed Proc Lab Beijing Peoples R China Hong Kong Polytech Univ Hung Hom Dept Comp Kowloon Hong Kong Peoples R China Wuhan Univ Int Sch Software Wuhan Peoples R China

In recent years, we have seen a proliferation of mobile-network-enabled smart objects, such as smart-phones and smart-watches, that form a cyber-physical integrated network to connect the cyber and physical worlds through the capabilities of sensing, communicating, and computing. Discovery of the relationship between smart objects is a critical and nontrivial task in cyber-physical integrated network applications. Aiming to find the most stable relationship in the heterogeneous and dynamic cyber-physical network, we propose a distributed and efficient relationship-discovery algorithm, called dynamically maximizing remaining unchanged time with minimum connected dominant set (DMRUT-MCDS) for constructing a backbone with the smallest scale infrastructure. In our proposed algorithm, the impact of the duration of the relationship is considered in order to balance the size and sustain time of the infrastructure. The performance of our algorithm is studied through extensive simulations and the results show that DMRUT-MCDS performs well in different distribution networks.

关键词： Cyber-physical environment dominate set minimum duration links relation

来源：评论

学校读者我要写书评

暂无评论

When Game Becomes Life: The Creators and Spectators of Online Game Replays and Live Streaming

引用

ACM TRANSACTIONS ON MULTIMEDIA COMPUTING COMMUNICATIONS AND APPLICATIONS 2016年第4期12卷 47-47页

作者： Jia, Adele Lu Shen, Siqi Epema, Dick H. J. Iosup, Alexandru China Agr Univ Coll Informat & Elect Engn Beijing Peoples R China Natl Univ Def Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China Natl Univ Def Technol Sch Comp Changsha Hunan Peoples R China Delft Univ Technol Software & Comp Technol Dept NL-2600 AA Delft Netherlands Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China

Online gaming franchises such as World of Tanks, Defense of the Ancients, and StarCraft have attracted hundreds of millions of users who, apart from playing the game, also socialize with each other through gaming and viewing gamecasts. As a form of User Generated Content (UGC), gamecasts play an important role in user entertainment and gamer education. They deserve the attention of both industrial partners and the academic communities, corresponding to the large amount of revenue involved and the interesting research problems associated with UGC sites and social networks. Although previous work has put much effort into analyzing general UGC sites such as YouTube, relatively little is known about the gamecast sharing sites. In this work, we provide the first comprehensive study of gamecast sharing sites, including commercial streaming-based sites such as Amazon's *** and community-maintained replay-based sites such as WoTreplays. We collect and share a novel dataset on WoTreplays that includes more than 380,000 game replays, shared by more than 60,000 creators with more than 1.9 million gamers. Together with an earlier published dataset on ***, we investigate basic characteristics of gamecast sharing sites, and we analyze the activities of their creators and spectators. Among our results, we find that (i) WoTreplays and *** are both fast-consumed repositories, with millions of gamecasts being uploaded, viewed, and soon forgotten;(ii) both the gamecasts and the creators exhibit highly skewed popularity, with a significant heavy tail phenomenon;and (iii) the upload and download preferences of creators and spectators are different: while the creators emphasize their individual skills, the spectators appreciate team-wise tactics. Our findings provide important knowledge for infrastructure and service improvement, for example, in the design of proper resource allocation mechanisms that consider future gamecasting and in the tuning of incentive policies t

关键词： Online game communities gamecast sharing sites repository characteristics popularity dynamics user behaviors

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Non-negative Local Coordinate Factorization 1

引用

22nd International Conference on Neural Information Processing (ICONIP)

作者： Zhou, Cherong Zhang, Xiang Guan, Naiyang Huang, Xuhui Luo, Zhigang Sci & Technol Parallel & Distributed Proc Lab Changsha Hunan Peoples R China Coll Comp Inst Software Changsha Hunan Peoples R China Natl Univ Def Technol Coll Comp Dept Comp Sci & Technol Changsha 410073 Hunan Peoples R China

ISBN: (数字)9783319265353

ISBN: (纸本)9783319265353;9783319265346

Non-negative matrix factorization (NMF) is a popular matrix decomposition technique that has attracted extensive attentions from data mining community. However, NMF suffers from the following deficiencies: (1) it is non-trivial to guarantee the representation of the data points to be sparse, and (2) NMF often achieves unsatisfactory clustering results because it completely neglects the labels of the dataset. Thus, this paper proposes a semi-supervised non-negative local coordinate factorization (SNLCF) to overcome the above deficiencies. Particularly, SNLCF induces the sparse coefficients by imposing the local coordinate constraint and propagates the labels of the labeled data to the unlabeled ones by indicating the coefficients of the labeled examples to be the class indicator. Benefit from the labeled data, SNLCF can boost NMF in clustering the unlabeled data. Experimental results on UCI datasets and two popular face image datasets suggest that SNLCF outperforms the representative methods in terms of both average accuracy and average normalized mutual information.

关键词： Non-negative matrix factorization Local coordinate coding Semi-supervised learning

来源：评论

学校读者我要写书评

暂无评论

An Efficient Transmission Method for Bulk Data Based on Network Coding in Delay Tolerant Network 15

An Efficient Transmission Method for Bulk Data Based on Netw...

引用

18th ACM International Conference on Modelling, Analysis and Simulation of Wireless and Mobile Systems (MSWiM)

作者： Chen, Wancheng Bai, YueBin Liang, Jiaojiao Liu, Wenjia Wang, Rui Mo, Xiaoyun Luo, Ziming Beihang Univ Sch Comp Sci & Engn State Key Lab Software Dev Environm Beijing Peoples R China Natl Univ Def Technol Sch Comp Sci Natl Lab Parallel & Distributed Proc Changsha Hunan Peoples R China Harbin Engn Univ Coll Comp Sci & Technol Harbin Peoples R China

ISBN: (纸本)9781450337625

With nodes in Delay Tolerant Network(DTN) distributing sparsely and moving rapidly, they usually suffer from intermittent connections and communications, thus bringing about limited message forwarding opportunities. All these could lead to inefficient forwarding, low delivery, long latency and limited transmission capacity in performance. In this paper, efficient encoding and decision methods are presented and integrated into the DTN routing strategy. The custody-encoding-forwarding mode is designed by merging the random linear network coding into the DTN routing, together with the replica re-allocation and memory management, and built on that encoding scheme, the intra/inter flow adaptive collaborative network coding is elaborated to implement the fresh custody-decision-encoding-forwarding mode. A decision-making strategy based on Bayesian Network(BN) measures the "degree" in a specific generation in networks by taking comprehensive consideration of current and historical network conditions to enhance the network robustness and self-adaptivity. By evaluating the delivery, delay and overhead performance on ONE and MATlab platforms, the effectiveness of proposed strategies is validated in the end.

关键词： network coding DTN Bayesian Network decision-making performance

来源：评论

学校读者我要写书评

暂无评论

Constraint-Relaxation Approach for Nonnegative Matrix Factorization: A Case Study

Constraint-Relaxation Approach for Nonnegative Matrix Factor...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Wang, Jue Guan, Naiyang Huang, Xuhui Luo, Zhigang Natl Univ Def Technol Coll Comp Sci & Technol Parallel & Distributed Proc Lab Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Coll Comp Inst Software Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Coll Comp Dept Comp Sci & Techonoly Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781479986965

Nonnegative matrix factorization (NMF) is a powerful technique for dimensionality reduction. Conventional NMF algorithms usually keep the matrices W and H nonnegative while iterating. However, to get the NMF of a matrix, it's unnecessary to force the temporary solutions in iterations nonnegative. In this paper, we propose a two-staged approach for NMF. At the relaxation stage, the nonnegative constraint of temporary solutions is relaxed and a real valued matrix factorization is generated. At the constraint stage, the real valued matrix factorization is transformed to a nonnegative matrix factorization by an invertible linear transformation. Based on this approach, we study on exact nonnegative matrix factorization when rank=2. We proved that, given two real valued matrices of rank=2, there exists an invertible linear transformation which can transform the real valued matrices to nonnegative matrices with their product stable. We propose an algorithm to find out the transformation. When rank is higher than 2, this kind of transformation may not exist. In the experiments, it's showed that this approach can reach a nonnegative matrix factorization with lower reconstruction error than conventional methods, and the technique for rank=2 exact NMF works well.

关键词： nonnegative matrix factorization constraint-relaxation exact rank-2 NMF linear transformation

来源：评论

学校读者我要写书评

暂无评论

Symmetric Non-negative Matrix Factorization Based Link Partition Method for Overlapping Community Detection

Symmetric Non-negative Matrix Factorization Based Link Parti...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Zhang, Xiang Guan, Naiyang Zhang, Wenju Huang, Xuhui Wu, Shuyi Luo, Zhigang Natl Univ Def Technol Coll Comp Sci & Technol Parallel & Distributed Proc Lab Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Coll Comp Inst Software Changsha 410073 Hunan Peoples R China Natl Univ Def Technol Coll Comp Dept Comp Sci & Technol Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781479986965

Partitioning links rather than nodes is effective in overlapping community detection (OCD) on complex networks. However, it consumes high CPU and memory overheads because the volume of links is huge especially when the network is rather complex. In this paper, we proposes a symmetric non-negative matrix factorization (SNMF) based link partition method called SNMF-Link to overcome this deficiency. In particular, SNMF-Link represents data in a lower-dimensional space spanned by the node-link incidence matrix. By solving a lighter SNMF problem, SNMF-Link learns the clustering indicators of each links. Since traditional multiplicative update rule (MUR) based optimization algorithm for SNMF suffers from slow convergence, we applied the augmented Lagrangian method (ALM) to efficiently optimize SNMF. Experimental results show that SNMF-Link is much more efficient than the representative clustering algorithms without reducing the OCD performance.

关键词： Symmetric Non-negative Matrix Factorization (SNMF) Link Partition Overlapping Community Detection (OCD) Augmented Lagrangian Method (ALM)

来源：评论

学校读者我要写书评

暂无评论

Hydra: Efficient Detection of Multiple Concurrency Bugs on Fused CPU-GPU Architecture 43

Hydra: Efficient Detection of Multiple Concurrency Bugs on F...

引用

43rd Annual International Conference on parallel Processing (ICPP)

作者： Dai, Zhuofang Wang, Haojun Zhang, Weihua Chen, Haibo Zang, Binyu Fudan Univ Software Sch Shanghai Peoples R China Fudan Univ Shanghai Key Lab Data Sci Shanghai Peoples R China Fudan Univ Parallel Proc Inst Shanghai Peoples R China Shanghai Jiao Tong Univ Inst Parallel & Distributed Syst Shanghai Peoples R China

ISBN: (纸本)9781479956180

Detecting concurrency bugs, such as data race, atomicity violation and order violation, is a cumbersome task for programmers. This situation is further being exacerbated due to the increasing number of cores in a single machine and the prevalence of threaded programming models. Unfortunately, many existing software-based approaches usually incur high runtime overhead or accuracy loss, while most hardware-based proposals usually focus on a specific type of bugs and thus are inflexible to detect a variety of concurrency bugs. In this paper, we propose Hydra, an approach that leverages massive parallelism and programmability of fused GPU architecture to simultaneously detect multiple types of concurrency bugs, including data race, atomicity violation and order violation. Hydra instruments and collects program behavior on CPU and transfers the traces to GPU for bug detection through on-chip interconnect. Furthermore, to achieve high speed, Hydra exploits bloom filter to filter out unnecessary detection traces. Hydra incurs small hardware complexity and requires no changes to internal critical-path processor components such as cache and its coherence protocol, and is with about 1.1% hardware overhead under a 32-core configuration. Experimental results show that Hydra only introduces about 0.35% overhead on average for detecting one type of bugs and 0.92% overhead for simultaneously detecting multiple bugs, yet with the similar detectability of a heavyweight software bug detector (e.g., Helgrind).

关键词： debugging concurrency bug gpu

来源：评论

学校读者我要写书评

暂无评论

WPress: An Application-Driven Performance Benchmark For Cloud-Based Virtual Machines 18

WPress: An Application-Driven Performance Benchmark For Clou...

引用

18th IEEE International Enterprise distributed Object Computing Conference (EDOC)

作者： Borhani, Amir Hossein Leitner, Philipp Lee, Bu-Sung Li, Xiaorong Hung, Terence Inst High Performance Comp Singapore 13863 Singapore Univ Zurich Seal Software Evolut & Architecture Lab CH-8006 Zurich Switzerland Nanyang Technol Univ Sch Comp Engn Parallel & Distributed Comp Ctr Singapore 639798 Singapore

ISBN: (纸本)9781479954704

Approaching a comprehensive performance benchmark for on-line transaction processing (OLTP) applications in a cloud environment is a challenging task. Fundamental features of clouds, such as the pay-as-you-go pricing model and unknown underlying configuration of the system, are contrary to the basic assumptions of available benchmarks such as TPC-W or RUBiS. In this paper, we introduce a systematic performance benchmark approach for OLTP applications on public clouds that use virtual machines (VMs). We propose WPress benchmark, which is based on the widespread blogging software, WordPress, as a representative OLTP application and implement an open source workload generator. Furthermore, we utilize a CPU micro-benchmark to investigate CPU performance of cloud-based VMs in greater detail. Average response time and total VM cost are the performance metrics measured by WPress. We evaluate small and large instance types of three real-life cloud providers, Amazon EC2, Microsoft Azure and Rackspace cloud. Results imply that Rackspace cloud has better average response times and total VM cost on small instances. However, Microsoft Azure is preferable for large instance type.

关键词： Benchmarking Cloud Computing Virtual Machine Amazon EC2 Microsoft Azure Rackspace Cloud OLTP CPU Micro-Benchmark

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：