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

12th International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 2012

作者： Jia, Haipeng Zhang, Yunquan Long, Guoping Yan, Shengen Lab. of Parallel Software and Computational Science Institute of Software Chinese Academy of Sciences China College of Information Science and Engineering Ocean University of China China State Key Laboratory of Computing Science Chinese Academy of Sciences China Graduate University of Chinese Academy of Sciences China

ISBN: (纸本)9783642330773

It is challenging to optimize GPU kernels because this progress requires deep technical knowledge of the underlying hardware. Modern GPU architectures are becoming more and more diversified, which further exacerbates the already difficult problem of performance optimization. This paper presents an insightful performance tuning chain for GPUs. The goal is to help non-expert programmers with limited knowledge of GPU architectures implement high performance GPU kernels directly. We achieve it by providing performance information to identify GPU program performance bottlenecks and decide which optimization methods should be adopted, so as to facilitate the best match between algorithm features and underlying hardware characteristics. To demonstrate the usage of tuning chain, we optimize three representative GPU kernels with different compute intensity: Matrix Transpose, Laplace Transform and Integral on both NVIDIA and AMD GPUs. Experimental results demonstrate that under the guidance of our tuning chain, performance of those kernels achieves 7.8~42.4 times speedup compared to their naïve implementations on both NVIDIA and AMD GPU platforms. © 2012 Springer-Verlag.

关键词： Chains

来源：评论

学校读者我要写书评

暂无评论

A lightweight forum-based distributed requirement elicitation process for open source community

引用

International Journal of Advancements in Computing Technology 2012年第7期4卷 138-145页

作者： Lai, Han Peng, Rong Sun, Dong Liu, Jia State Key Lab. of Software Engineering Wuhan University Wuhan China College of Computer Science Chongqing Technology and Business University Chongqing China

Nowadays, lots of open source communities adopt forum to acquire scattered stakeholders' requirements. But the requirements collection process always suffers from the unformatted description and unfocused discussions. In this paper, we establish a framework ReqForum to define the metamodel of the requirement elicitation forum. Based on it, we propose a lightweight forum-based requirements elicitation process which includes six steps: template-based requirements creation, opinions collection, requirements collection, requirements management, capability identification and the incentive mechanism. According to the proposed process, the prototype SKLSEForum is established by composing the Discuz and its existed pulg-ins. The implementation indicates that the process is feasible and the cost is economic.

关键词： Requirements engineering

来源：评论

学校读者我要写书评

暂无评论

Detecting infeasible traces in process models

Detecting infeasible traces in process models

引用

14th International Conference on Enterprise Information systems, ICEIS 2012

作者： Wang, Zhaoxia Wen, Lijie Zhu, Xiaochen Liu, Yingbo Wang, Jianmin School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Lab. for Information System Security Ministry of Education Beijing 100084 China National Laboratory for Information Science and Technology Beijing 100084 China Logistical Engineering University Chongqing 400016 China

ISBN: (纸本)9789898565105

Workflow testing is an important method of workflow analysis in design time. A challenging problem with trace-oriented test data generation in particular and trace-based workflow analysis in general is the existence of infeasible traces for which there is no input data for them to be executed. In this paper we build on the theory of workflow nets and introduce workflow nets where transitions have conditions associated with them. We then demonstrate that we can determine which execution traces, that are possible according to the control-flow dependencies, are actually possible taking the data perspective into account. This way we are able to more accurately determine in design time the infeasible traces caused by the correlation between transition conditions along this trace. Finally, we provide a solution to automatically detecting the shortest infeasible trace.

关键词： Infeasible traces Process models Workflow analysis

来源：评论

学校读者我要写书评

暂无评论

On the resistance of Boolean functions against fast algebraic attacks

On the resistance of Boolean functions against fast algebrai...

引用

14th International Conference on Information Security and Cryptology, ICISC 2011

作者： Du, Yusong Zhang, Fangguo Liu, Meicheng School of Information Science and Technology Sun Yat-sen University Guangzhou 510006 China Key Lab. of Network Security and Cryptology Fujian Normal University Fuzhou 350007 China State Key Laboratory of Information Security Institute of Software Chinese Academy of Sciences Beijing 100190 China

ISBN: (纸本)9783642319112

Boolean functions with large algebraic immunity resist algebraic attacks to a certain degree, but they may not resist fast algebraic attacks (FAA's). It is necessary to study the resistance of Boolean functions against FAA's. In this paper, we localize the optimal resistance of Boolean functions against FAA's and introduce the concept of e-fast algebraic immunity (e-FAI) for n-variable Boolean functions against FAA's, where e is a positive integer and . We give the sufficient and necessary condition of e-FAI. With e-FAI the problem of deciding the resistance of an n-variable Boolean function against FAA's can be converted into the problem of observing the properties of one given matrix. An algorithm for deciding e-FAI and the optimal resistance against FAA's is also described. © 2012 Springer-Verlag.

关键词： Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Skull-closed autonomous development: Object-wise incremental learning

Skull-closed autonomous development: Object-wise incremental...

引用

9th International Symposium on Neural Networks, ISNN 2012

作者： Wang, Yuekai Wu, Xiaofeng Weng, Juyang State Key Lab. of ASIC and System Fudan University Shanghai 200433 China Department of Electronic Engineering Fudan University Shanghai 200433 China School of Computer Science Fudan University Shanghai 200433 China Dept. of Computer Sci. and Eng. Michigan State University East Lansing MI 48824 United States

ISBN: (纸本)9783642313455

The series of Where-What Networks (WWNs) is a brain-inspired developmental model that simulates the dorsal (where) stream and the ventral (what) stream that converge to the motor area in the frontal cortex. Since developmental learning is always incremental, the order of different stimuli should affect the outcome of learning. In contrast to the uniform distribution of stimuli across image frames used in prior WWN experiments, this work studies non-uniform distribution in the sense that during training one object is presented at all the image locations before another object is presented. A new mechanism called cell regenesis is introduced to enable a less-often used cell to recommit its neuronal resource to new stimuli. The experimental results shown in this paper indicate that WWN-6 can deal with object-wise incremental learning. © 2012 Springer-Verlag.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

A biologically-inspired network for generic object recognition using CUDA

A biologically-inspired network for generic object recogniti...

引用

2009 11th IEEE International Conference on e-Health Networking, Applications and Services, Healthcom 2009

作者： Wang, Yuekai Wu, Xiaofeng Song, Xiaoying Zhang, Wenqiang Weng, Juyang State Key Lab. of ASIC and System Fudan University Shanghai 200433 China Department of Electronic Engineering Fudan University Shanghai 200433 China School of Computer Science Fudan University Shanghai 200433 China Dept. of Computer Sci. and Eng. Michigan State University East Lansing MI 48824 United States

Generic object recognition is one of the most important fields in the artificial intelligence. Some cortex-like networks for generic object recognition are proposed these years. But most of them concentrated on the discussion about the recognition performance (such as recognition rate, number of objects to be recognized), not the practicability, i.e., implementation with ubiquitous devices and application in real time. This paper reports a try on implementation of a biologically-inspired where-what network (WWN), which integrates object recognition and attention in a single network, via parallelizing the various stages of the network training with CUDA on GPU to shorten the training time. The experiment on HAIBAO Robot exhibited in 2010 Shanghai Expo shows that this optimization can achieve a speedup of almost 16 times compared to the C-based program on an Intel Core 2 DUO 3.00 GHZ CPU in real environments. © 2012 Springer-Verlag GmbH.

关键词： Object recognition

来源：评论

学校读者我要写书评

暂无评论

Context-based requirement modeling for self-adaptive service software

引用

Journal of Computational Information systems 2012年第24期8卷 10131-10140页

作者： Liu, Wei Feng, Zaiwen School of Computer Science and Engineering Hubei Key Laboratory of Intelligence Robot Wuhan Institute of Technology Wuhan 430073 China State Key Lab. of Software Engineering Wuhan University Wuhan 430072 China

Service-oriented self-adaptation software (SoSAS) utilizes services as fundamental elements for developing applications that have the capability to autonomously modify their behavior at run-time in response to changes in their environment. While a few techniques have been developed to support the modeling and analysis of requirements for self-adaptive systems, limited attention has been paid to the description of service requirements and uncertainty in requirements of SoSAS. In this paper, we propose a context-based requirement representing and modeling framework as a fundamental of self-adaptation evolution. We introduce a context snapshot model to represent uncertainty in requirement with domain knowledge;goal-oriented context requirement to model user requirements and process-oriented context requirement to model service requirements;and finally, propose means-c-end analysis to relate user and service requirement with context condition. We illustrate and evaluate our approach through three scenarios of city intelligent traffic domain in the support tool ConUSER. © 2011 by Binary Information Press.

关键词： Uncertainty analysis

来源：评论

学校读者我要写书评

暂无评论

Image super-resolution reconstruction based on sparse representation and low-rank matrix completion

引用

Journal of Information and Computational science 2012年第13期9卷 3859-3866页

作者： Jing, Guodong Shi, Yunhui Yin, Baocai Beijing Municipal Key Lab. of Multimedia and Intelligent Software Technology College of Computer Science and Technology Beijing University of Technology Beijing 100124 China

This paper addresses the problem of generating a High-resolution (HR) image from a single Low-resolution (LR) image. We propose the super-resolution reconstruction approach based on sparse representation and low-rank matrix completion. The approach represents images in forms of sparse and rearranges image regions into the low dimension construction{matrices of low rank. High-frequency details of image are restored using the sparse representation which is recovered from the down-sampled images. For paths at the same position of multiple pictures which are obtained by several super resolution reconstructions are highly correlated, they are arranged to be a matrix of low-rank which can be completed exactly from corrupted entries. Experiment results demonstrate that the proposed method significantly improves the PSNR and visual quality of reconstructed high-resolution images. 1548-7741/Copyright © 2012 Binary Information Press.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Optimal point movement for covering circular regions

Optimal point movement for covering circular regions

引用

23rd International Symposium on Algorithms and Computation, ISAAC 2012

作者： Chen, Danny Z. Tan, Xuehou Wang, Haitao Wu, Gangshan Department of Computer Science and Engineering University of Notre Dame Notre Dame IN 46556 United States Tokai University 4-1-1 Kitakaname Hiratsuka 259-1292 Japan Department of Computer Science Utah State University Logan UT 84322 United States State Key Lab. for Novel Software Technology Nanjing University Hankou Road 22 Nanjing 210093 China

ISBN: (纸本)9783642352607

Given n points in a circular region C in the plane, we study the problem of moving these points to the boundary of C to form a regular n-gon such that the maximum of the Euclidean distances traveled by the points is minimized. These problems find applications in mobile sensor barrier coverage of wireless sensor networks. The problem further has two versions: the decision version and optimization version. In this paper, we present an O(n log2 n) time algorithm for the decision version and an O(n log3 n) time algorithm for the optimization version. The previously best algorithms for these two problem versions take O(n3.5) time and O(n3.5 log n) time, respectively. A by-product of our techniques is an algorithm for dynamically maintaining the maximum matching of a circular convex bipartite graph;our algorithm performs each vertex insertion or deletion on the graph in O(log 3.5 n) time. This result may be interesting in its own right. © Springer-Verlag 2012.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Optimal Pricing of Multi-model Hybrid system for PaaS Cloud Computing

Optimal Pricing of Multi-model Hybrid System for PaaS Cloud ...

引用

International Conference on Cloud and Service Computing (CSC)

作者： Hao Lu Xing Wu Wu Zhang Jin Liu School of Computer Engineering and Science Shanghai University Shanghai China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China State Key Lab. Of Software Engineering Wuhan University Wuhan China

Success of cloud computing service depends on an acceptable pricing model, especially in the PaaS. As a dynamic platform, PaaS layer depends on the infrastructure layer and extends to the application layer. How to find an optimal pricing policy is the problem for the cloud providers in face of stochastic and dynamic demand. In this paper, we present an approach of dynamic pricing model in order to get max profits. We analyze the model by a multi-condition hybrid system. But we also use a theory of revenue maximization and cost minimization. When at a current state, the system content cost minimization to build a hybrid system for revenue maximization, we will get the most profits.

关键词： Pricing Cloud computing Computational modeling Mathematical model Educational institutions Optimal control Equations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：