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

Developing an Automated Mechanism for Cluster computing in computerized Classroom

Procedia computer science 2011年 4卷 2068-2075页

作者： Shuen-Tai Wang Chin-Hung Li Hsi-Ya Chang Ying-Chuan Chen Ching-Hsien Hsu National Center for High-Performance Computing Taiwan Department of Computer Science and Information Engineering Chung Hua UniversityTaiwan

Scientific computing has become one of the key players in the advance of modern science and technologies. In the meantime, due to the success of developments in processor fabrication, the computing power of Personal computer (PC) is not to be ignored as well. Lots of high throughput type of applications can be satisfied by using the current desktop PCs, especially for those in computerized classrooms, and leave the supercomputers for the demands from large scale high performance parallel computations. The goal of this work is to develop an automated mechanism for cluster computing to utilize the computing power such as resides in computerized classroom. The PCs in computerized classroom are usually setup for education and training purpose during the daytime, and shut down at night. After well deployment, these PCs can be transformed into a pre-configured cluster computing resource immediately without touching the existing education/training environment installed on these PCs. Thus, the training activities will not be affected by this additional activity to harvest idle computing cycles. To echo today's energy saving issues, a dynamic power management is also developed to minimize energy cost. This development not only greatly reduces the management efforts and time to build a cluster, but also implies the reduction of the power consumption by such a mechanism.

关键词： Personal computer cluster computing computerized classroom dynamic power management

来源：评论

学校读者我要写书评

暂无评论

Möbius: An extensible tool for performance and dependability modeling 11th

Möbius: An extensible tool for performance and dependabilit...

引用

11th International Conference on Modelling Tools and Techniques for computer and Communication System performance Evaluation, TOOLS 2000

作者： Daly, David Deavours, Daniel D. Doyle, Jay M. Webster, Patrick G. Sanders, William H. Center for Reliable and High-Performance Computing Coordinated Science Laboratory and Department of Electrical and Computer Engineering University of Illinois at Urbana-Champaign 1308 W. Main St UrbanaIL United States

来源：评论

学校读者我要写书评

暂无评论

A model-based approach to attributed graph clustering 12

A model-based approach to attributed graph clustering

引用

2012 ACM SIGMOD International Conference on Management of Data, SIGMOD '12

作者： Xu, Zhiqiang Ke, Yiping Wang, Yi Cheng, Hong Cheng, James School of Computer Engineering Nanyang Technological University Singapore Singapore Institute of High Performance Computing Singapore Singapore Department of Computer Science National University of Singapore Singapore Singapore Department of Systems Engineering and Engineering Management Chinese University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9781450312479

Graph clustering, also known as community detection, is a long-standing problem in data mining. However, with the proliferation of rich attribute information available for objects in real-world graphs, how to leverage structural and attribute information for clustering attributed graphs becomes a new challenge. Most existing works take a distance-based approach. They proposed various distance measures to combine structural and attribute information. In this paper, we consider an alternative view and propose a model-based approach to attributed graph clustering. We develop a Bayesian probabilistic model for attributed graphs. The model provides a principled and natural framework for capturing both structural and attribute aspects of a graph, while avoiding the artificial design of a distance measure. Clustering with the proposed model can be transformed into a probabilistic inference problem, for which we devise an efficient variational algorithm. Experimental results on large real-world datasets demonstrate that our method significantly outperforms the state-of-art distance-based attributed graph clustering method. © 2012 ACM.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Verifiable data hiding scheme with tamper detection

Verifiable data hiding scheme with tamper detection

引用

作者： Kuo, Wen-Chung Wang, Chun-Cheng Kuo, Shao-Hung Wuu, Lih-Chyau Department of Computer Science and Information Engineering National Yunlin University of Science and Technology Yunlin Taiwan National Center for High-performance Computing National Applied Research Laboratories Tainan Taiwan Institute for Information Industry Taipei Taiwan

Traditional digital image authentication is usually based on signature or fragile watermarks. This performs authentication without any secret hidden data. Until now, many image authentication schemes with error detection based on watermarks or signatures have been proposed. Tampering attack can be detected but the areas tampered with cannot be determined for these schemes. In order to improve this shortcoming, a verifiable data hiding scheme is proposed for digital images in this paper. The main idea of the proposed scheme is combining multi-bit encoding function and multi-group data hiding scheme to increase embedding capacity and strengthen security with parity check to verify the tampering of digital images having embedded secret messages. Therefore, there are three major contributions in our proposed scheme. First, it can achieve image tamper detection and find what has been modified. Second, it resists collage attack. Third, it can increase the embedding capacity. These contributions are discussed according to experimental results. The proposed scheme includes a high security to reduce detection of hidden data and the MSE analysis also proves this scheme has good image quality. © 2019 - IOS Press and the authors. All rights reserved

关键词： Authentication

来源：评论

学校读者我要写书评

暂无评论

Estimating Change Detection of Forest Area using Satellite Imagery

Estimating Change Detection of Forest Area using Satellite I...

引用

2019 International Conference on Data science and Communication, IconDSC 2019

作者： Katarki, Greeshma Ranmale, Harivijay Bidari, Indira Chickerur, Satyadhyan Department of Computer Science and Engineering B.V.B.College of Engineering and Technology Hubballi Karnataka580 031 India Centre for High Performance Computing KLE Technological University Hubballi Karnataka580 031 India

ISBN: (纸本)9781538693193

Todays information age developing in nanoseconds is immensely affected by global warming. One of the main reasons for the global warming is deforestation. Due to deforestation, only scant amount is remaining of the original stupendous amount of forest that previously protected our planet. Deforestation is continuing to cause adverse ecological effects on the system that was well sustained for millennia. It is the need of the hour to address the issue to minimize the effects of technologies till date have caused. The less we keep track of deforestation the lesser we will be able to control it. In the proposed solution we intend to provide a state of the art solution to address the ever growing need to minimize deforestation. The solution utilizes image processing and techniques which use machine learning to identify the changes in the pattern by analyzing the satellite images. A methodology for the automatic detection of deforestation from multispectral satellite data is presented based on Convolutional Neural Networks. © 2019 IEEE.

关键词： Deforestation

来源：评论

学校读者我要写书评

暂无评论

CoChain: high Concurrency Blockchain Sharding via Consensus on Consensus 42

CoChain: High Concurrency Blockchain Sharding via Consensus ...

引用

42nd IEEE International Conference on computer Communications, INFOCOM 2023

作者： Li, Mingzhe Lin, You Zhang, Jin Wang, Wei Southern University of Science and Technology Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation Research Institute of Trustworthy Autonomous Systems Computer Science and Engineering Department China Hong Kong University of Science and Technology Computer Science and Engineering Department Hong Kong Institute of High Performance Computing and Agency for Science Technology and Research Singapore

ISBN: (纸本)9798350334142

Sharding is an effective technique to improve the scalability of blockchain. It splits nodes into multiple groups so that they can process transactions in parallel. To achieve higher parallelism and concurrency at large scales, it is desirable to maintain a large number of small shards. However, simply configuring small shards easily results in a higher fraction of malicious nodes inside shards, causing shard corruption and compromising system security. Existing sharding techniques hence demand large shards, at the expense of limited concurrency. To address this limitation, we propose CoChain: a blockchain sharding system that can securely configure small shards for enhanced concurrency. CoChain allows some shards to be corrupted. For security, each shard is monitored by multiple other shards. The latter reach a cross-shard Consensus on the Consensus results of their monitored shard. Once a corrupted shard is found, its subsequent consensus will be taken over by another shard, hence recovering the system. Via Consensus on Consensus, CoChain allows the existence of shards with more fraction of malicious nodes ( © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Polygonal mesh simplification with face color and boundary edge preservation using quadric error metric 4

Polygonal mesh simplification with face color and boundary e...

引用

4th International Symposium on Multimedia Software engineering, MSE 2002

作者： Fahn, Chin-Shyurng Chen, Hung-Kuang Shiau, Yi-Haur Department of Computer Science and Information Engineering National Taiwan University of Science and Technology Taipei106 Taiwan Department of Electronic Engineering National Taiwan University of Science and Technology Taipei106 Taiwan Software and Development Division National Center for High-Performance Computing Hsinchu300 Taiwan

ISBN: (纸本)0769518575

In applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and construct a multiresolution representation. We propose a new and simple constraint scheme based on the quadric error metric proposed by Garland and Heckbert (1997, 1998) to preserve face colors and boundary edges during the simplification process. In addition, our method generates progressive meshes that store the polygonal mesh in a continuous multi-resolution representation. According to our experimental results, this new method is successful in preserving face colors and boundary edges. Moreover, we compare the latency of resolution changes for progressive meshes of various models. © 2002 IEEE.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Towards garbage collection mechanism for RTSJ-oriented embedded Java Processor

Towards garbage collection mechanism for RTSJ-oriented embed...

引用

10th IEEE International Conference on computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable computing and Communications, ScalCom-2010

作者： Hu, Guang Chai, Zhilei Zhao, Wenke Tu, Shiliang Department of Computer Science Shanghai International Studies University Shanghai China Department of Computer Science and Engineering Fudan University Shanghai China Siemens Corporate Technology Beijing China Center of Intelligent and High Performance Computing School of Information Technology Jiangnan University Wuxi China

ISBN: (纸本)9780769541082

Currently, Java has been gradually applied in embedded real-time area with the improvement by the Real-Time Specification for Java (RTSJ). Accordingly, a hardware Java execution engine for embedded real-time applications, JPOR-32 (32-bit Java Processor Optimized for RTSJ), is designed. Taking JPOR-32 for an example, this paper presents the garbage collection mechanism for RTSJ-oriented embedded processor in detail. JPOR-32 provides effective architectural support for garbage collection. And the object reference format of JPOR-32 provides supports for objects tracing and heap scanning. The support for write barrier of real-time concurrent GC is also performed. Moreover, JPOR- 32 provides optimized instruction level support for garbage collection. In addition, different garbage collection algorithms are compared on the base of the resource-constrained feature and the real-time requirement of the processor, and the hybrid garbage collectors are suggested. © 2010 IEEE.

关键词： Refuse collection

来源：评论

学校读者我要写书评

暂无评论

Robust task scheduling for volunteer computing systems

Robust task scheduling for volunteer computing systems

引用

作者： Lee, Young Choon Zomaya, Albert Y. Siegel, Howard Jay Centre for Distributed and High Performance Computing School of Information Technologies University of Sydney Sydney NSW 2006 Australia Department of Electrical and Computer Engineering Department of Computer Science Colorado State University Fort Collins CO 80523-1373 United States

performance perturbations are a natural phenomenon in volunteer computing systems. Scheduling parallel applications with precedence-constraints is emerging as a new challenge in these systems. In this paper, we propose two novel robust task scheduling heuristics, which identify best task-resource matches in terms of makespan and robustness. Our approach for both heuristics is based on a proactive reallocation (or schedule expansion) scheme enabling output schedules to tolerate a certain degree of performance degradation. Schedules are initially generated by focusing on their makespan. These schedules are scrutinized for possible rescheduling using additional volunteer computing resources to increase their robustness. Specifically, their robustness is improved by maximizing either the total allowable delay time or the minimum relative allowable delay time over all allocated volunteer resources. Allowable delay times may occur due to precedence constraints. In this paper, two proposed heuristics are evaluated with an extensive set of simulations. Based on simulation results, our approach significantly contributes to improving the robustness of the resulting schedules. © 2009 Springer science+Business Media, LLC.

关键词： Resource allocation

来源：评论

学校读者我要写书评

暂无评论

How to Steal CPU Idle Time When Synchronous I/O Mode Becomes Promising 24

How to Steal CPU Idle Time When Synchronous I/O Mode Becomes...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Wu, Chun-Feng Chang, Yuan-Hao Yang, Ming-Chang Kuo, Tei-Wei Department of Computer Science National Yang Ming Chiao Tung University Taiwan Institue of Information Science Academia Sinica Taiwan Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong Department of Computer Science and Information Engineering National Taiwan University Taiwan High Performance and Scientific Computing Center National Taiwan University Taiwan Delta Electronics Taiwan

ISBN: (纸本)9798400706011

The advent of Ultra-Low-Latency storage devices has narrowed the performance gap between storage and CPU in computing platforms, facilitating synchronous I/O adoption. Yet, this approach introduces substantial busy waiting time and underutilizes computing units. To address this, we propose a light-weighted Idle-Time-Stealing (ITS) design. This involves a self-improving thread conducting prefetching for high-priority processes during synchronous I/O, and an I/O-waiting process continuing subsequent instruction executions when justifiable. Another thread, the self-sacrificing thread, proactively switches low-priority process I/O requests from synchronous to asynchronous mode, prioritizing high-priority executions. Experimental results demonstrate the effectiveness of our ITS design in reducing CPU idle time. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Data storage equipment

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：