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

Symposium on Applications and the Internet (SAINT)

作者： Wen-chung Shih Chao-tung Yang Chun-jen Chen Shian-shyong Tseng Department of Computer Science National Chiao Tung University Hsinchu Taiwan High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan Department of Information Science and Applications Asia University Taichung Taiwan

Parallel loop scheduling on grid environments is a challenging problem, especially for loops with irregular workload distribution. In the past, this problem of load imbalance resulting from irregular workload was not explicitly addressed. This paper proposes a new approach to schedule loop iterations with irregular workload on grid environments. Based on knowledge-based estimation of workload, the proposed method can dispatch an appropriate proportion of workload to each node for execution according to its performance. In addition, the scheduler uses historical statistics of CPU usage and network bandwidth to estimate the dynamically changing performance of each node. Two applications, regular type and irregular one respectively, are implemented and executed on a grid test-bed, which consists of four schools. Experimental results show that the new approach improves the performance on previous schemes

关键词： Grid computing Processor scheduling Concurrent computing Distributed computing computer science Application software Internet Bandwidth Testing Middleware

来源：评论

学校读者我要写书评

暂无评论

G-BLAST: a grid-based solution for mpiBLAST on computational grids

G-BLAST: a grid-based solution for mpiBLAST on computational...

引用

IEEE Region 10 International Conference TENCON

作者： Chao-Tung Yang Tsu-Fen Han Heng-Chuan Kan High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan National Center for High-performance Computing Southern Business Unit Tainan Taiwan

The researches of bioinformatics have grown with each passing day so that more and more computing power is required for better performance. These requires usually solved by parallelism techniques, because cluster technology can reduce the execution time and increase alignment efficiency. For example, mpiBLAST is a parallelism solution of NCBI BLAST via MPI parallel programming. However, most laboratories can not build up powerful supercomputing environments. They usually connect dozen of personal computers to build cluster computing environments. Besides, cluster usually is limited by local environment that leads to extend equipments difficulty. The concepts of grid can solve these problems. Grid environments coordinate the resources of distributed virtual organizations and satisfy a great many computational demands. In this paper, we have deployed a biogrid framework called G-BLAST. G-BLAST was designed for sequence alignment to use grid environment and access mpiBLAST application from a server node. Because grid environment is a heterogeneous environment, G-BLAST is endowed with selection the most adaptive work nodes, dynamic fragmenting database, and self-adjust performance data abilities. Furthermore, we also deployed a grid service portal and a grid service GUI desk application for normal users to submit jobs and host administrators to maintain their own work nodes, and the interaction between this application and G-BLAST meets WSRF standards.

关键词： Grid computing Bioinformatics Biology computing Databases Sequences Microcomputers Application software Concurrent computing Distributed computing Power engineering computing

来源：评论

学校读者我要写书评

暂无评论

A pairing-based signcryption scheme using self-certified public keys

引用

International Journal of computers and Applications 2007年第3期29卷 278-282页

作者： Li, F. Xin, X. Hu, Y. School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu Sichuan 610054 China Department of Information and Computing Science Zhengzhou University of Light Industry Zhengzhou Henan 450002 China Key Laboratory of Computer Networks and Information Security Xidian University Xi'an Shaanxi 710071 China

In recent years, many pairing-based signcryption schemes have been proposed. There is, however, an inherent weakness in these schemes: the private key escrow problem, in which the "trusted" private key generator (PKG) can easily impersonate any user at any time without being detected. In this paper we present a pairing-based signcryption scheme using self-certified public keys. In our scheme, users can choose their private keys independently. The public keys of users can be implicitly verified with the subsequent signature verification in a logically single step. A trusted PKG is no longer required. If the dishonest PKG impersonates an honest user to communicate with others, the user can provide a proof of treachery of the PKG afterwards, which is similar to certificate-based systems.

关键词： Public key cryptography

来源：评论

学校读者我要写书评

暂无评论

An Energy-Efficient TDMA MAC for Wireless Sensor Networks

An Energy-Efficient TDMA MAC for Wireless Sensor Networks

引用

IEEE Asia-Pacific Conference on Services computing (APSCC)

作者： Rong Gang Bai Yu Gui Qu Yang Guo Bao Hua Zhao Department of Electronic Engineering and Information Science University of Science and Technology Hefei Anhui China Department of Computer Science Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology Hefei Anhui China

This paper proposes an energy-efficient and collision-free medium access control protocol TDMA-WSN for wireless sensor networks. The protocol is based on time division multiple access (TDMA) principle and reduces energy consumption by avoiding overhearing, collision and idle listening. Nodes in TDMA-WSN build schedules based on information about their neighborhood to determine when they can transmit to their neighbors and when they should listen to the channel or sleep. TDMA-WSN proposes a novel resolution with three-d-hop neighborhood information to avoid collision caused by the two-hop collision-free principle used in some protocols. TDMA-WSN can accelerate passing message by arranging schedule based on routing information from the upper-layer. The simulation results indicate that TDMA-WSN outperforms contention-based protocols (e.g., S-MAC) and scheduling-based protocols (e.g., NAMA) with significant energy savings.

关键词： Energy efficiency Time division multiple access Wireless sensor networks Access protocols Media Access Protocol Wireless application protocol Energy consumption Sleep Energy resolution Acceleration

来源：评论

学校读者我要写书评

暂无评论

A New Architecture of Sensitive File Management Based on Dual-Core and EFI

A New Architecture of Sensitive File Management Based on Dua...

引用

International IEEE Conference on Signal-Image Technologies and Internet-Based System

作者： Zijian Deng Xuejia Lai Laboratory of Information Security and National Computing Grid Southwest Jiaotong University Chengdu Sichuan China Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China

How to protect the sensitive information from unauthorized disclosure is one of the problems in computer security. In this paper we present a new method for preventing the sensitive file from unauthorized disclosure, security file management (SFM). SFM relies on dual-core technology, extensible firmware interface and trusted computing to provide a much high level of security than current solutions. All operations of sensitive files are run in trusted boundary. In this paper, we present the architecture of SFM, the initial designer and the security analysis.

关键词： Security Servers Cryptography Linux Protocols Software computer architecture

来源：评论

学校读者我要写书评

暂无评论

State Management in Large Scale Group Communication

State Management in Large Scale Group Communication

引用

IEEE International Conference on Signal Processing and Communications, ICSPC

作者： Dewan Tanvir Ahmed Shervin Shirmohammadi Jauvane C. de Oliveira Distributed and Collaborative Virtual Environments Research Laboratory School of Information Technology and Engineering University of Ottawa Canada Computer Science Department National Laboratory of Scientific Computing ACIMA Laboratory Petropolis Rio de Janeiro Brazil

Current state management practices heavily rely on centralized architectures that pose scalability bottleneck and are expensive to adopt and deploy. In this paper, large scale state management issues are considered and addressed from design perspectives. The intra zonal communication strategies presented in [2][5] assume that peer knows its position in the global coordinate system. In this work, we drop that assumption and approximate peer position through the relative end-to-end delay with respect to landmarks. The technical analysis presented in [4] shows that the protocol has higher diameter in terms of hop distance compared to NICE [6], although it has lower diameter in terms of end-toend delay among the peers. To address that problem we present multiphase mesh construction technique that requires further partitioning of each region into several sub-regions. Both server-side and client-side resources are effectively utilized in collaborative manner while respecting their roles in the system.

关键词： Large-scale systems Delay Scalability Virtual environment Multicast protocols Tree graphs Conference management Environmental management Technology management engineering management

来源：评论

学校读者我要写书评

暂无评论

3D Model Retrieval Based on V System Rotation Invariant Moments

3D Model Retrieval Based on V System Rotation Invariant Mome...

引用

International Conference on Natural Computation (ICNC)

作者： Zongmin Li Xiuping Men Yujie Liu Hua Li Department of Computer Science University of North Carolina Charlotte NC USA School Of Computer Science And Communication Engineering China University of Petroleum Shandong China Key Laboratory Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China

This paper proposes a novel methodology based on V-system polynomials for content-based search and retrieval of 3D objects. The V-system is composed by piecewise polynomials, and is capable of exactly describing the geometric information expressed by the popularly and widely used spline curves and surface. We define rotation invariant moments-v-system moment by combining V-system polynomials with spherical harmonics. After preprocessing for translation and scale invariance, the spherical extension is used as input for V-system moments and the values of obtained coefficients are considered as components of the feature vector. We evaluate on the Princeton Shape Benchmark, the proposed descriptors regarding computational aspects and shape retrieval performance. The-performance of the proposed method is compared to some previous approaches by means of precision/recall tests. Generally, results show that the new approach introduces improvements in the SD model retrieval process.

关键词： Shape Content based retrieval Image retrieval Polynomials information retrieval Solid modeling computer science Feature extraction Noise robustness Petroleum

来源：评论

学校读者我要写书评

暂无评论

Supporting Large-Scale Networked Virtual Environments

Supporting Large-Scale Networked Virtual Environments

引用

IEEE International Symposium on Virtual Environments, Human-computer Interfaces and Measurement Systems (VECIMS)

作者： Dewan Tanvir Ahmed Shervin Shirmohammadi Jauvane C. de Oliveira Jimmy Bonney Distributed and Collaborative Virtual Environments Research Laboratory School of Information Technology and Engineering University of Ottawa ONT Canada Applied Multimedia and Virtual Environments Laboratory Computer Science Department National Laboratory for Scientific Computing Petropolis Rio de Janeiro Brazil

In this paper, we introduce a framework that supports a large number of participants in a collaborative virtual environment (CVE). We consider object classification based on avatars' physical characteristics to define the overlay network used to disseminate update messages between participants. This concept systematically puts objects into different logical clusters where each cluster can be rated in terms of a persistency class. We integrate a greedy heuristic algorithm to form a better network structure and then apply the dominating set principle to build a routing table for intra-zone communication. In this paper, we have used OPNET to verify the applicability of these approaches to large-scale CVEs.

关键词： Large-scale systems Virtual environment International collaboration Graphics Internet Delay Particle measurements Anthropometry information technology Multimedia systems

来源：评论

学校读者我要写书评

暂无评论

Developing a computer science-specific learning taxonomy 07

Developing a computer science-specific learning taxonomy

引用

2007 Working Group Reports on ITiCSE on Innovation and Technology in computer science Education, ITiCSE-WGR 2007

作者： Fuller, Ursula Johnson, Colin G. Ahoniemi, Tuukka Cukierman, Diana Hernán-Losada, Isidoro Jackova, Jana Lahtinen, Essi Lewis, Tracy L. Thompson, Donna McGee Riedesel, Charles Thompson, Errol Computing Laboratory University of Kent CanterburyCT2 7NF United Kingdom Institute of Software Systems Tampere University of Technology Tampere Finland School of Computing Science Simon Fraser University BurnabyBC Canada Department of Lenguajes Y Sistemas Informáticos Universidad Rey Juan Carlos Madrid Spain Faculty of Management Science and Informatics University of Zilina Zilina Slovakia Department of Information Technology Radford University RadfordVA24142 United States Department of Learning Commons Simon Fraser University BurnabyBC Canada Department of Computer Science and Engineering University of Nebraska Lincoln 259 Avery Hall LincolnNE68588-0115 United States Massey University Wellington New Zealand

ISBN: (纸本)9781450378420

Bloom's taxonomy of the cognitive domain and the SOLO taxonomy are being increasingly widely used in the design and assessment of courses, but there are some drawbacks to their use in computer science. This paper reviews the literature on educational taxonomies and their use in computer science education, identifies some of the problems that arise, proposes a new taxonomy and discusses how this can be used in application-oriented courses such as programming.

关键词： Taxonomies

来源：评论

学校读者我要写书评

暂无评论

Reflections on modelling vagueness in description logics 2

Reflections on modelling vagueness in description logics

引用

2nd ISWC Workshop on Uncertainty Reasoning for the Semantic web, URSW 2006

作者： Schockaert, Steven Victor, Patricia Houben, Geert-Jan Cornelis, Chris De Cock, Martine Kerre, Etienne Department of Applied Mathematics and Computer Science Ghent University Belgium Web and Information System Engineering Laboratory Vrije Universiteit Brussel Belgium

Description logics are a popular, and widely used, formalism for describing domain knowledge in a structured way. To cope with the vagueness of real-world knowledge, several fuzzy description logics have already been proposed. In this contribution, we argue that, rather than modelling all vagueness in a generalized description logic, it may be more natural to encode vague attributes in concrete domains [1], and to model vague predicates on the level of query processing.

关键词： Data description

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：