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

A Multi-dimensional Trust-aware Cloud Service Selection Mechanism Based on Evidential Reasoning Approach

International Journal of Automation and computing 2015年第2期12卷 208-219页

作者： Wen-Juan Fan Shan-Lin Yang Harry Perros Jun Pei School of Management Hefei University of Technology Department of Computer Science North Carolina State University The Ministry of Education Key Laboratory of Process Optimization and Intelligent Decision Making Department of Industry and System Engineering University of Florida

In the last few years, cloud computing as a new computing paradigm has gone through significant development, but it is also facing many problems. One of them is the cloud service selection problem. As increasingly boosting cloud services are offered through the internet and some of them may be not reliable or even malicious, how to select trustworthy cloud services for cloud users is a big challenge. In this paper, we propose a multi-dimensional trust-aware cloud service selection mechanism based on evidential reasoning(ER) approach that integrates both perception-based trust value and reputation based trust value, which are derived from direct and indirect trust evidence respectively, to identify trustworthy services. Here, multi-dimensional trust evidence, which reflects the trustworthiness of cloud services from different aspects, is elicited in the form of historical users feedback ratings. Then, the ER approach is applied to aggregate the multi-dimensional trust ratings to obtain the real-time trust value and select the most trustworthy cloud service of certain type for the active users. Finally, the fresh feedback from the active users will update the trust evidence for other service users in the future.

关键词： Cloud service selection multi-dimensional trust evidence trust and reputation evaluation evidential reasoning(ER) clond service

来源：评论

学校读者我要写书评

暂无评论

An efficient and fast polarity optimization approach for mixed polarity Reed-Muller logic circuits

引用

Frontiers of computer Science 2017年第4期11卷 728-742页

作者： Zhenxue HE Limin XIAO Fei GU Tongsheng XIA Shubin SU Zhisheng HUO Rong ZHANG Longbing ZHANG Li RUAN Xiang WANG State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Computer Science and Engineering Beihang University Beijing 100191 China School of Electronic and Information Engineering Beihang University Beijing 100191 China State Key Laboratory of Computer Architecture Institute of Computing Technology Chinese Academy of Sciences Beijing 100190 China National Engineering Research Center for Science & Technology Resources Sharing Service Beijing 100191 China

Although the genetic algorithm has been widely used in the polarity optimization of mixed polarity Reed- Muller （MPRM） logic circuits, few studies have taken into account the polarity conversion sequence. In order to im- prove the efficiency of polarity optimization of MPRM logic circuits, we propose an efficient and fast polarity optimiza- tion approach （FPOA） considering the polarity conversion se- quence. The main idea behind the FPOA is that, firstly, the best polarity conversion sequence of the polarity set wait- ing for evaluation is obtained by using the proposed hybrid genetic algorithm （HGA）; secondly, each of polarity in the polarity set is converted according to the best polarity con- version sequence obtained by HGA. Our proposed FPOA is implemented in C and a comparative analysis has been pre- sented for MCNC benchmark circuits. The experimental re- suits show that for the circuits with more variables, the FPOA is highly effective in improving the efficiency of polarity op- timization of MPRM logic circuits compared with the tradi- tional polarity optimization approach which neglects the po- larity conversion sequence and the improved polarity opti- mization approach with heuristic technique.

关键词： genetic algorithm polarity optimization mixed

来源：评论

学校读者我要写书评

暂无评论

Conflict detection model of access control policy in collaborative environment

Conflict detection model of access control policy in collabo...

引用

2011 International Conference on Computational and Information Sciences, ICCIS 2011

作者： Fan, Beibei Liang, Xiaoyan Luo, Yang 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

Cross-domain interoperation based on role-mapping increasingly becomes a representative research field of collaborative environment. However, in this collaborative environment, there would still be more permission or less than the role of role-mapping policy required when authorization, this situation can not be completely avoided. This disaccord will result in conflict of access control policies (ACPs) in collaborative domains, and ultimately lead to unauthorized access to resources in autonomy domains. A new method is presented to detect the conflict between access control policies in collaborative environment automatically. The ACPs conflict detection model (ACPCDM) is established, the termination of ACPCDM is proved by the putdown automation, and the prototype system is implemented. At last, we validate the validity of this method with experiments, the result of the experiments shows that the analysis report of conflict can not only detect if there is conflict, but also figure out the conflict type, the causes and location of the conflict. So it is much easier for administer in each domain to resolve the conflict. © 2011 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A novel parameter learning method of virtual garment

引用

12th International Conference on Virtual systems and Multimedia, VSMM 2006

作者： Yujun, Chen Jiaxin, Wang Zehong, Yang Yixu, Song State Key Laboratory of Intelligent Technology and System Computer Science and Technology Department Tsinghua University Beijing 100084 China

ISBN: (纸本)3540463046

In this paper we present a novel parameter learning and identification method of virtual garment. We innovate in the ordinary parameter identification process and introduce the fabric data (Kawabata Evaluation system data) to combine the expert's knowledge with fuzzy system. With our method the parameters of virtual garment can be calculated automatically which are assigned by the animator's experience and hard to tune in the past years. The statistic analysis and machine learning method are used to build the fuzzy system to present the fabric expert's knowledge. With interactively inputting the human subjective variables to our method, the animator who knows little knowledge in physical attributes of fabric material can also create and tune the virtual garment application. The experimental results indicate that this method can be used in practical virtual environments and has the expansibility to other applications. © Springer-Verlag Berlin Heidelberg 2006.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

SARP: Producing approximate results with small correctness losses for cloud interactive services 15

SARP: Producing approximate results with small correctness l...

引用

12th ACM International Conference on Computing Frontiers, CF 2015

作者： Han, Rui Wang, Junwei Ge, Fengming Vazquez-Poletti, Jose Luis Zhan, Jianfeng State Key Laboratory Computer Architecture ICT CAS Beijing China Universidad Complutense de Madrid Madrid Spain

ISBN: (纸本)9781450333580

Despite the importance of providing fluid responsiveness to user requests for interactive services, such request processing is very resource expensive when dealing with large-scale input data. These often exceed the application owners' budget when services are deployed on a cloud, in which resources are charged in monetary terms. Providing approximate processing results is a feasible solution for such problem that trades off request correctness (quantified by output quality) for response time reduction. However, existing techniques in this area either use partial input data or skip expensive computations to produce approximate results, thus resulting in large losses in output quality on a tight resource budget. In this paper, we propose SARP, a Synopsis-based Approximate Request Processing framework to produce approximate results with small correctness losses even using small amount of resources. To achieve this, SARP conducts full computations over the statistical aggregation of the entire input data using two key ideas: (1) offline synopsis management that generates and maintains a set of synopses that represent the statistical aggregation of original input data at different approximation levels. (2) Online synopsis selection that considers both the current resource allocation and the workload status so as to select the synopsis with the maximal length that can be processed within the required response time. We demonstrate the effectiveness of our approach by testing the recommendation services in E-commerce sites using a large, real-world dataset. Using prediction accuracy as the output quality, the results demonstrate: (i) SARP achieves significant response time reduction with very small quality losses compared to the exact processing results.(ii) Using the same processing time, SARP demonstrates a considerable reduction in quality loss compared to existing approximation techniques. © Copyright 2015 ACM.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

A new 3D LIDAR-based lane markings recognition approach

A new 3D LIDAR-based lane markings recognition approach

引用

2013 IEEE International Conference on Robotics and Biomimetics, ROBIO 2013

作者： Li, Tan Zhidong, Deng State Key Laboratory on Intelligent Technology and System Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)9781479927449

A new active vision based lane markings recognition approach is presented. An efficient method for separating road surface data from a 3D LIDAR data frame is proposed which delimitates the drivable region by its profile. A new approach for extracting significant points of lane markings is developed using digital signal processing technology. And the significant points are clustered based on an orientation guided scheme. The tracking problem of lane markings in sequential frames is investigated. The experimental results show that the presented approach has a global perspective of surrounding road environments and is not sensitive to different natural illuminations. © 2013 IEEE.

关键词： Digital signal processing

来源：评论

学校读者我要写书评

暂无评论

SemanGist: A local semantic image representation

SemanGist: A local semantic image representation

引用

9th Pacific Rim Conference on Multimedia, PCM 2008

作者： Wang, Dong Liu, Xiaobing Wang, Duanpeng Li, Jianmin Zhang, Bo State Key Laboratory of Intelligent Technology and System Department of Computer Science and Technology Tsinghua University Beijing 100084 China

ISBN: (纸本)354089795X

Although various kinds of image features have been proposed, there exists no single optimal feature which can save the effort of all other features for multimedia analysis applications, e.g. image annotation. In this paper, we propose a novel image representation, Semantic Gist (SemanGist), to combine the merit of multiple features automatically. Given a local image patch, SemanGist converts multiple low-level features of the patch into compact prediction scores of a few predefined semantic categories. To this end, a discriminative multi-label boosting algorithm is adopted. This local SemanGist output allows for incorporating semantic spatial context among adjacent patches. For applications like image annotation, this may further reduce possible annotation errors by considering the label compatibility. The same boosting algorithm is applied to the SemanGist representation, together with low-level features, to ensure the label compatibility. Experiments on an image annotation task show that SemanGist not only achieves compact representation but also incorporates spatial context at low run-time computational cost. © 2008 Springer.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Accelerate cache simulation with generic GPU

Accelerate cache simulation with generic GPU

引用

IEEE 9th International Conference on computer and Information Technology, CIT 2009

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

ISBN: (纸本)9780769538365

Trace-driven cache simulation is the most widely used method to evaluate different cache structures. Several techniques have been proposed to reduce the simulation time of sequential trace-driven simulation. An obvious way to achieve fast parallel simulation is to simulate the individual independent sets of a cache concurrently on different compute resources. We propose improvements to current trace-driven simulation methods to make them faster and more economical. This paper considers the use of generic GPU to accelerate cache simulation which exploits set-partitioning as the main source of parallelism. We develop more efficient parallel simulation techniques by introducing more knowledge into the Compute Unified Device architecture (CUDA) on the GPU. Our experimental result shows that the new algorithm can produce performance results for a number of set-associative caches in just a single simulation run and still produce the exact results. © 2009 IEEE.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

Using GPU to accelerate a pin-based multi-level cache simulator 10

Using GPU to accelerate a pin-based multi-level cache simula...

引用

Proceedings of the 2010 Spring Simulation Multiconference

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

ISBN: (纸本)9781450300698

Trace-driven simulation methodology is the most widely used method to evaluate the design of future computer memory architecture. Since this methodology demands large amounts of storage and computer time, there is a growing need for simulation methodologies to determine the memory system requirements of emerging workloads in a reasonable amount of time. Several techniques have been proposed to reduce the space that store memory reference and improve the performance of sequential trace-driven simulation. This paper presents the use of binary instrumentation as the memory reference generator and parallel simulation technique that based on the generic graphics processing unit (GPU). One way to achieve fast parallel simulation is to simulate the independent sets of a cache concurrently on different compute resource, but results show that this method is not efficient because of a high correlation of the activity between different sets. To put parallelism to effective use, we show that a multi-configuration simulation in single pass method gains 2.44x performance improvement compared to traditional sequential algorithm. © 2010 SCS.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

A method to boost naïve Bayesian classifiers 6th

A method to boost naïve Bayesian classifiers

引用

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

In this paper, we introduce a new method to improve the performance of combining boosting and naive Bayesian. Instead of combining boosting and Naive Bayesian learning directly, which was proved to be unsatisfactory to improve performance, we select the training samples dynamically by bootstrap method for the construction of naive Bayesian classifiers, and hence generate very different or unstable base classifiers for boosting. Besides, we devise a modification for the weight adjusting of boosting algorithm in order to achieve this goal: minimizing the overlapping errors of its constituent classifiers. We conducted series of experiments, which show that the new method not only has performance much better than naive Bayesian classifiers or directly boosted naive Bayesian ones, but also much quicker to obtain optimal performance than boosting stumps and boosting decision trees incorporated with naive Bayesian learning. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：