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

3rd International Conference on Semantics, Knowledge, and grid, SKG 2007

作者： Chin, SungHo Lee, JongHyuk Song, SeongJin Song, Byungkwen Yu, HeonChang Distributed and Grid Computing Lab. Department of Computer Science Education Korea University Anam-dong Sungbuk-ku Seoul 136-701 Korea Republic of Dept. of Information and Communication Seokyeong University Korea Republic of

ISBN: (纸本)0769530079

In the Service Oriented grid, a grid application can be composed of diverse grid Services which may be already deployed on grid sites, and dependencies between these grid Services can be described as the workflow graph. Though many grid scheduling methods have been developed, they have been studied based on static heterogeneous computing environment. For this reason, these heuristics cannot be directly applied to grid, which is more dynamic computing environment. Therefore, we develop the dynamic service scheduling method, which support that the workflow applications can be performed effectively in spite of dynamic grid nature. Lastly, we show that our proposed scheduling method outperforms than other conventional scheduling methods through the various experiments. © 2007 IEEE.

关键词： Scheduling

来源：评论

学校读者我要写书评

暂无评论

Kidneygrid: A grid platform for integration of distributed kidney models and resources

KidneyGrid: A grid platform for integration of distributed k...

引用

4th International Workshop on Middleware for grid computing (MGC'06) held at the ACM/IFIP/USENIX International Middleware Conference

作者： Chu, Xingchen Lonie, Andrew Harris, Peter Thomas, S. Randall Buyya, Rajkumar Grid Computing and Distributed Systems Lab. Dept. of Computer Science and Software Eng. University of Melbourne Australia Department of Information Systems University of Melbourne Australia Unit Faculty of Medicine Dentistry and Health Sciences University of Melbourne Australia FRE 2873 CNRS/Université d'Evry - Val d'Essonnes 91000 Evry France

ISBN: (纸本)1595935819

In this paper, we present a grid computing platform that provides experimental scientists and analysts with access to computational simulations and knowledge databases hosted in separate lab.ratories around the world involved with human and animal kidney research. No single lab.ratory can develop these resources in isolation and the community of users should no longer need to be dependent upon the specific programming environment in which applications have been developed. This is a major innovation in life science and exploits the power of existing and planned high-bandwidth communications networks for collab.rative research and for shared access to knowledge resources. The innovation is developed within a specialist community of renal scientists but will be transferable to any other field of research requiring interaction between published literature and databases, theoretical models and simulations and the formulation of effective experimental design. © 2006 ACM.

关键词： grid computing

来源：评论

学校读者我要写书评

暂无评论

IT management using a heavyweight CIM ontology

IT management using a heavyweight CIM ontology

引用

17th GI/ITG Conference on Communication in distributed systems, KiVS 2011

作者： Textor, Andreas Stynes, Jeanne Kroeger, Reinhold Rhein Main University of Applied Sciences Distributed Systems Lab. Kurt-Schumacher-Ringer 18 D-65197 Wiesbaden Germany Cork Institute of Technology Department of Computing Rossa Avenue Bishopstown Cork Ireland

ISBN: (纸本)9783939897279

This paper presents an approach for ontology-based IT management based on a heavyweight (formal) ontology using the Web Ontology Language (OWL). The ontology comprises a complete OWL representation of the Common Information Model (CIM) and management rules defined in the Semantic Web Rule Language (SWRL). The ontology not only models the managed system types, but a runtime system dynamically updates model instances in the ontology that reflect values of managed system entities. This allows the evalution of rules that take into account both model and model instances. A reaction module uses the CIM interface of the managed system to invoke CIM methods according to rule evaluation results, thus resulting in automated management. In order to ensure the consistency of the ontology when changes are performed, belief change theory is employed. © A. Textor and J. Stynes and R. Kroeger.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Augmented reality and tangible user interfaces integration for enhancing the user experience

Augmented reality and tangible user interfaces integration f...

引用

11th ACM SIGGRAPH International Conference on Virtual-Reality Continuum and Its Applications in Industry, VRCAI 2012

作者： Rodrigues, Fábio Sato, Fernando Botega, Leonardo Oliveira, Allan Computing and Information Systems Research Lab. Centro Universitário Eurípides de Marília Brazil Wireless Networks and Distributed Interactive Simulations Laboratory Universidade Federal de São Carlos Brazil

ISBN: (纸本)9781450318259

The integration of post-wimp computer interfaces arises as an alternative to meet individual limitations of each one, considering both interaction components and feedbacks to users. Tangible interfaces can present restrictions referring to physical space on tabletop architectures, which limits the manipulation of objects and deprecates the interactive process. Hence, this paper proposes the integration of techniques of mobile Augmented Reality with tabletop tangible architecture for blending real and virtual components on its surface, aiming to make the interactive process richer, seamless and more complete. © 2012 ACM.

关键词： Augmented reality

来源：评论

学校读者我要写书评

暂无评论

Building dynamic integrity protection for multiple independent authorities in virtualization-based infrastructure

Building dynamic integrity protection for multiple independe...

引用

2009 10th IEEE/ACM International Conference on grid computing, grid 2009

作者： Cheng, Ge Jin, Hai Zou, Deqing Zhang, Xinwen Li, Min Yu, Chen Xiang, Guofu Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan 430074 China Samsung Information Systems America San Jose CA United States

ISBN: (纸本)9781424451494

In grid and cloud computing infrastructures, the integrity of a computing platform is a critical security requirement in order to provide secure and honest computing environments to service providers and resource consumers. However, due to the fact that software components running on a single platform are usually provided and maintained by different authorities which are potentially untrusted to each other, the problem to monitor and protect runtime system integrity become very challenging and has not been well addressed yet. In this paper, we present a virtualization based dynamic integrity protection method which ensures that only appropriate authorities can control over their components without interfering with other component providers or authorities. In our solution, integrity requirements defined by the authorities of upper components (e.g., service middleware and applications) are respected by preventing the underlying components (e.g., operating system) from exposing their sensitive data, which can be caused by update of the underlying components or other malicious actions. We implement our solution on Xen-based platform, and our evaluation results show that the solution is effective for integrity protection with acceptable performance overhead. © 2009 IEEE.

关键词： Virtualization

来源：评论

学校读者我要写书评

暂无评论

Espresso: Brewing Java for More Non-Volatility with Non-volatile Memory

arXiv

引用

arXiv 2017年

作者： Wu, Mingyu Zhao, Ziming Li, Haoyu Li, Heting Chen, Haibo Zang, Binyu Guan, Haibing Shanghai Key Lab. of Scalable Computing and Systems Institute of Parallel and Distributed Systems Shanghai Jiao Tong University

Fast, byte-addressable non-volatile memory (NVM) em-braces both near-DRAM latency and disk-like persistence, which has generated considerable interests to revolutionize system software stack and programming models. However, it is less understood how NVM can be combined with managed runtime like Java virtual machine (JVM) to ease persistence management. This paper proposes Espresso1, a holistic ex-tension to Java and its runtime, to enable Java programmers to exploit NVM for persistence management with high perfor-mance. Espresso first provides a general persistent heap de-sign called Persistent Java Heap (PJH) to manage persistent data as normal Java objects. The heap is then strengthened with a recoverable mechanism to provide crash consistency for heap metadata. It then provides a new abstraction called Persistent Java Object (PJO) to provide an easy-to-use but safe persistent programming model for programmers to per-sist application data. The evaluation confirms that Espresso significantly outperforms state-of-art NVM support for Java (i.e., JPA and PCJ) while being compatible to existing data structures in Java programs. Copyright © 2017, The Authors. All rights reserved.

关键词： Nonvolatile storage

来源：评论

学校读者我要写书评

暂无评论

An efficient local address generation for the block-cyclic distribution 3

An efficient local address generation for the block-cyclic d...

引用

3rd International Conference on Algorithms and Architectures for Parallel Processing, ICA3PP 1997

作者： Kwon, Oh-Young Kim, Tae-Geun Han, Tack-Don Yang, Sung-Bong Kim, Shin-Dug Distributed Computing Lab. Systems Engineering Research Institute 1 Ueun-dong Yusong-gu Taejon305-333 Korea Republic of Parallel Processing System Laboratory Dept. of Computer Science Yonsei University Seoul120-749 Korea Republic of

ISBN: (纸本)0780342291

In order to generate local addresses for an array section A(l:h:s) with block-cyclic distribution, an efficient compiling method is required. In this paper, two local address generation methods for the block-cyclic distribution are presented. One is a simple local address generation method that is modified from the virtual-block scheme. The other is a linear-time ΔM table construction method. The array elements of A(l:h:s) to be accessed at run-time build up a family of lines. By using the equation of the lines, a ΔM table can be generated in O(k) time. Experimental results show that a simple local address generation method has poor performance but a linear-time ΔM table generation method is faster than other algorithms in ΔM table generation time and access time for 10,000 array elements. © 1997 IEEE.

关键词： Virtual addresses

来源：评论

学校读者我要写书评

暂无评论

OddCI: On-demand distributed computing infrastructure

OddCI: On-demand distributed computing infrastructure

引用

2nd ACM Workshop on Many-Task computing on grids and Supercomputers 2009, MTAGS '09

作者： Costa, Rostand Brasileiro, Francisco Filho, Guido Lemos Sousa, Dênio Mariz Federal University of Campina Grande Systems and Computing Department Distributed Systems Lab. Av. Aprigio Veloso 882 - Bloco CO - Bodocongo Campina Grande Paraíba Brazil Federal University of Paraíba Informatics Department Campus I - Cidade Universitária João Pessoa Paraíba Brazil

ISBN: (纸本)9781605587141

The availab.lity of large quantities of processors is a crucial enabler of many-task computing. Voluntary computing systems have proven that it is possible to build computing platforms with millions of nodes to support the execution of embarrassingly parallel applications. These systems, however, lack the flexibility of more traditional grid infrastructures. On the other hand, flexible infrastructures currently availab.e can gather only dozens of thousands nodes. We propose a novel architecture for generic distributed computing Infrastructures (DCI) that can be instantiated on demand to be, at the same time, flexible and highly-scalab.e. Bringing the scalab.lity from voluntary computing, the flexibility from grid computing and the elasticity from cloud computing in a single arrangement, our proposal allows for fast setup, fast initialization and fast dismantle of customized DCI supported by both dedicated and shared underlying infrastructures. Our approach leverages broadcast communication as an efficient mechanism to enable aggregation of geographically distributed computing resources, including millions of non-traditional processing devices such as PDA, mobile phones and Digital TV receivers, using both opportunistic and non-opportunistic models. We show the feasibility of the proposed architecture by implementing it atop a digital television system. We also assess the performance of such system and show that it can be used to execute several classes of many-tasks computing applications with very high efficiency, substantially decreasing their response time. Copyright © 2009 ACM.

关键词： Digital television

来源：评论

学校读者我要写书评

暂无评论

A Lie group based Gaussian mixture model distance measure for multimedia comparison 09

A Lie group based Gaussian mixture model distance measure fo...

引用

1st International Conference on Internet Multimedia computing and Service, ICIMCS 2009

作者： Gong, Liyu Wang, Tianjiang Yu, Yan Liu, Fang Hu, Xiangen Intelligent and Distributed Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan Hubei 430074 China Department of Information and Computing Science School of Science Wuhan University of Science and Technology Wuhan Hubei 430065 China Department of Psychology Institute for Intelligent Systems University of Memphis Memphis TN 38152 United States

ISBN: (纸本)9781605588407

In this paper, we propose a novel method to measure the distance between two Gaussian Mixture Models. The proposed distance measure is based on the minimum cost that must paid to transform from one Gaussian Mixture Model into the other. We parameterize the components of a Gaussian Mixture Model which are Gaussian probability density functions (pdf) as positive definite lower triangular transformation matrices. Then we identify that Gaussian pdfs form a Lie group. Based on Lie group theory, the geodesic length can be used to measure the minimum cost that must paid to transform from one Gaussian pdf into the other. Combining geodesic length with the earth mover's distance, we propose the Lie group earth mover's distance for Gaussian Mixture Models. We test our distance measure in image retrieval. The experimental results indicate that our distance measure is more effective than other measures including the Kullback-Liebler divergence. Copyright 2009 ACM.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

Self-Adaptive Extracting Academic Entities from World Wide Web

Self-Adaptive Extracting Academic Entities from World Wide W...

引用

International Conference on Collab.rative computing: Networking, Applications and Worksharing (Collab.rateCom)

作者： Pingpeng Yuan Yi Li Hai Jin Ling Liu Services Computing Technology and System Lab. Huazhong University of Science and Technology Wuhan China Distributed Data Intensive Systems Lab. Georgia Institute of Technology Atlanta Georgia

Huge amount of entities and theirs relationships are posted on the Web. Those entities and theirs relationship networks help many activities. In this paper, we focus on the task of extracting academic entity network from homepages. Homepages usually contain many entities, such as persons, conference/journal and organization and theirs relationship. However, homepages don't follow a unified layout format and often contains similar information, but differs greatly in layouts and styles, which makes it impossible to use a unified set of rules to handle them all. Thus we propose an integrated approach to automatically extract data from unstructured texts. The main idea of the approach is to adopt the most suitable approach to extract entities. Thus, the approach is self-adaptive. Firstly, the approach decomposes web pages into text units and then classifier is used to determine units' type. Once the units' types are known, the different technologies are chosen to deal with them. For example, edit distance and inverted index are used to identify names etc. And Conditional Random Field technology is considered the best solution to extract publication entries. The result shows that LineX has achieved high performance on extracting entities from web pages in academic community.

关键词： Web pages Data mining Knowledge based systems Electronic mail HTML Internet Organizations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：