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

Generalized Load Sharing for Homogeneous Networks of Distributed Environment

Journal of computer Networks and Communications 2008年第1期2008卷

作者： A. Satheesh K. Vimal Kumar S. Krishnaveni Department of Computer Science and Engineering Periyar Maniammai University Vallam Thanjavur 613403 Indiapmu.edu Department of Computer Science and Engineering SRM Institute of Management and Technology New Delhi 201204 *** Department of Computer Applications Periyar Maniammai University Vallam Thanjavur 613403 Indiapmu.edu

We propose a method for job migration policies by considering effective usage of global memory in addition to CPU load sharing in distributed systems. When a node is identified for lacking sufficient memory space to serve jobs, one or more jobs of the node will be migrated to remote nodes with low memory allocations. If the memory space is sufficiently large, the jobs will be scheduled by a CPU-based load sharing policy. Following the principle of sharing both CPU and memory resources, we present several load sharing alternatives. Our objective is to reduce the number of page faults caused by unbalanced memory allocations for jobs among distributed nodes, so that overall performance of a distributed system can be significantly improved. We have conducted trace-driven simulations to compare CPU-based load sharing policies with our policies. We show that our load sharing policies not only improve performance of memory bound jobs, but also maintain the same load sharing quality as the CPU-based policies for CPU-bound jobs. Regarding remote execution and preemptive migration strategies, our experiments indicate that a strategy selection in load sharing is dependent on the amount of memory demand of jobs, remote execution is more effective for memory-bound jobs, and preemptive migration is more effective for CPU-bound jobs. Our CPU-memory-based policy using either high performance or high throughput approach and using the remote execution strategy performs the best for both CPU-bound and memory-bound job in homogeneous networks of distributed environment.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Patent terminology classification using relaxation labeling

引用

Journal of Internet Technology 2007年第4期8卷 445-456页

作者： Cheng, Shian-Luen Yang, Shih-Yao Soo, Von-Wun Institute of Information Systems and Applications National Tsing Hua University Taiwan Department of Computer Science National Tsing Hua University Taiwan Department of Computer Science and Information Engineering National University of Kaohsiung Taiwan

In this paper, an approach to unknown term classification using relaxation labeling is proposed. The technique is used to classify the terminologies in patent documents. The terminologies on a CMP (chemical mechanical polishing) domain about the relations among components, the attributes and materials of components are to be extracted by NLP technique and regular expressions. ? In the progress of relaxation labeling, the probability of each class for each unclassified term was updated. Based on the extracted semantic information, the experiment results show that relaxation labeling is sufficient for terminology classification and has achieved 72% of accuracy.

关键词： Patents and inventions

来源：评论

学校读者我要写书评

暂无评论

Complexity measures for software components

引用

WSEAS Transactions on computers 2007年第7期6卷 1005-1012页

作者： Sharma, Arun Kumar, Rajesh Grover, P.S. Amity Institute of Information Technology Amity University Uttar Pradesh India School of Mathematics and Computer Applications Thapar Institute of Engineering and Technology Patiala India Department of Computer Science Delhi University Delhi India

In last decade, object-oriented concept is not so much powerful and adequate to cop up the requirements of rapid changes in ongoing applications. Component-Based Development (CBD) has emerged in a very fast way to address these changes, In CBD, software systems are built as an assembly of components already developed and prepared for integration. However, the quality aspects of software products are not adequately addressed by CBD. Complexity of components is a very essential attribute to be measured for components. The paper discusses various existing complexity metrics for traditional systems including object-oriented systems. It explores the possibilities whether some of these metrics can be applied for software components also or not. The paper proposes a new metric for measuring the complexity of software components. It also conducts an empirical study on a number of JavaBean components to evaluate the proposed metric. The correlation analysis of the proposed metric with Customizability metric, defined in the literature shows that highly complex components have a low value of customizability, thus very difficult to maintain.

关键词： Software engineering

来源：评论

学校读者我要写书评

暂无评论

Efficient channel allocation based on priority of the video in VoD systems

引用

3rd Asian Applied Computing Conference, AACC 2005

作者： Sujatha, D.N. Rajesh, K.V. Girish, K. Venugopal, K.R. Patnaik, L.M. Department of Computer Science and Engineering Bangalore University India Microprocessor Applications Laboratory Indian Institute of Science Bangalore India

ISBN: (纸本)1860948278

Today's technology offers easy access to multimedia services through high-speed communication networks. A Video-on-Demand (VoD) service allows customers to connect to an on-line video server and asynchronously watch videos. A Video-on-Demand system is typically implemented by Client-Server architecture. This paper presents a scheme of channel allocation based on priority of the requested video, to increase efficient channel utilization and lower the download time. This allocation scheme shows better performance when compared to conventional way of allocating channels.

关键词： Multimedia services

来源：评论

学校读者我要写书评

暂无评论

How it works: A field study of non-technical users interacting with an intelligent system

Conference on Human Factors in Computing Systems - Proceedin...

引用

Conference on Human Factors in Computing Systems - Proceedings 2007年 31-40页

作者： Tullio, Joe Dey, Anind K. Chalecki, Jason Fogarty, James Applications Research Center Motorola Labs. Schaumburg IL 60196 Human Computer Interaction Institute Carnegie Mellon University Pittsburgh PA 15213 Computer Science and Engineering University of Washington Seattle WA 98195 Oracle Corporation

ISBN: (纸本)1595935932;9781595935939

In order to develop intelligent systems that attain the trust of their users, it is important to understand how users perceive such systems and develop those perceptions over time. We present an investigation into how users come to understand an intelligent system as they use it in their daily work. During a six-week field study, we interviewed eight office workers regarding the operation of a system that predicted their managers' interruptibility, comparing their mental models to the actual system model. Our results show that by the end of the study, participants were able to discount some of their initial misconceptions about what information the system used for reasoning about interruptibility. However, the overarching structures of their mental models stayed relatively stable over the course of the study. Lastly, we found that participants were able to give lay descriptions attributing simple machine learning concepts to the system despite their lack of technical knowledge. Our findings suggest an appropriate level of feedback for user interfaces of intelligent systems, provide a baseline level of complexity for user understanding, and highlight the challenges of making users aware of sensed inputs for such systems. © Copyright 2007 ACM.

关键词： Interactive computer systems Formal logic Intelligent systems Learning systems User interfaces Context aware Field study Mental models Qualitative research

来源：评论

学校读者我要写书评

暂无评论

A hybrid clustering and classification technique for soil data mining

A hybrid clustering and classification technique for soil da...

引用

IET-UK International Conference on Information and Communication Technology in Electrical sciences, ICTES 2007

作者： Vibha, L. HarshaVardhan, G.M. Prashanth, S.J. Shenoy, P Deepa Venugopal, K.R. Patnaik, L.M. Department of Computer Science and Engineering University Visvesvaraya College of Engineering Bangalore 560 001 India Microprocessor Applications Laboratory Indian Institute of Science Bangalore 560 012 India

ISBN: (纸本)9780863419379

Predictive soil modelling using geostatistical methods is a research concept in modern soil science and soil geography for the last two decades. One of the reasons for this lack of soil spatial data is that conventional soil survey methods are relatively slow, qualitative and expensive. Spatial data sets covering large areas like digital geomorphographical maps, geological, land use, and climate data are available and these geo-datasets contain information about soil formation and resulting hydrologic variables etc which are needed to extract relevant soil information. In this paper we present an efficient hybrid model that was achieved by first clustering the data and then classifying it, and using the spatial conceptual information extracted from the environmental variables. This paper assists in assessment of the status of food production associated with land degradation and estimate indicators of soil nutrient mining by a country and region. The findings and conclusions of this paper result from the monitoring of the nutrient mining of agricultural lands in a country which have a direct implication on policy development. We propose a framework where soil is classified into different types, then a future work could be to predict soil fertility, based on which you can decide upon the fertilisers and suitable crops that could be cultivated with expertise.

关键词： Soils

来源：评论

学校读者我要写书评

暂无评论

Probabilistic Average Energy Flooding to maximize lifetime of mobile ad hoc networksx

Probabilistic Average Energy Flooding to maximize lifetime o...

引用

3rd International Conference on Wireless Communication and Sensor Networks (WCSN-2007)

作者： Thriveni, J. Vishwanath, K.R. Venugopal, K.R. Patnaik, L.M. Department of Computer Science and Engineering University Visvesvaraya College of Engineering Bangalore University Bangalore 560 001 India Microprocessor Applications Laboratory Indian Institute of Science Bangalore India

Wireless mobile ad hoc stations have limited battery capacity, hence, ad hoc routing protocols ought to be energy conservative. Route discovery is a common operation in routing to resolve many issues. In a Mobile Ad Hoc Network (MANET) in particular, due to host mobility, such operations are expected to be executed more frequently. A straightforward broadcasting by flooding is usually very costly and will result in serious redundancy, contention, and collision, resulting in broadcast storm problem. In this paper, an algorithm is proposed to improve flooding performance of Ad Hoc On-Demand Distance Vector (AODV) routing protocol called, Probabilistic-Average-Energy-flooding (PAEF) which periodically performs an averaging algorithm Calculate-Average-Energy (CAE) to estimate the average energy Eavg. This algorithm is used in route discovery process to make a rebroadcast decision by the node. Our simulation results show an improvement in the network lifetime and the throughput compared to traditional AODV.

关键词： Mobile ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Robust and high capacity image steganography using SVD

Robust and high capacity image steganography using SVD

引用

IET-UK International Conference on Information and Communication Technology in Electrical sciences, ICTES 2007

作者： Babu, K Suresh Raja, K.B. Rao K, Uma Maheshwar A.R.K., Rashmi K R.V.K., Venugopal K Patnaik, L.M. Department of Computer Science and Engineering University Visvesvaraya College of Engineering Bangalore University Bangalore 560 001 India Microprocessor Applications Laboratory Indian Institute of Science Bangalore India

ISBN: (纸本)9780863419379

Steganography plays an important role in the field of information hiding for secret communication. The proposed algorithm Robust and high capacity image steganography using SVD (RHISSVD) is based on singular value decomposition (SVD) transform of digital images. In this technique two important properties of SVD are utilized, namely (i) The singular values (SV) represents luminance or energy of the digital image layer. (ii) The respective pair of singular vectors represents the image geometry. Slight variation of the SV cannot affect the visual perception of the image. The cover image is transformed in to SVDs and the secret message to be transmitted is embedded in to singular values of cover image. It is observed that RHISSVD has an improvement in PSNR and capacity compared to existing algorithms.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Self-Healing antchain for increasing lifespan in wireless sensor networks

Self-Healing antchain for increasing lifespan in wireless se...

引用

IET-UK International Conference on Information and Communication Technology in Electrical sciences, ICTES 2007

作者： Tarannum, Suraiya Anitha, V. Priya, A.G. Adrakatti, Rajeshwari Nalini, L. Venugopal, K.R. Patnaik, L.M. Department of Computer Science and Engineering University Visvesvaraya College of Engineering Bangalore - 560 001 India Microprocessor Applications Laboratory Indian Institute of Science Bangalore-560 012 India

ISBN: (纸本)9780863419379

A Wireless Sensor Network (WSN) consists of a large number of randomly deployed sensor nodes. These sensor nodes organize themseleves into a cooperative network and perform the three basic functions of sensing, computations and *** paper proposes a at-routing technique for such a network consisting of homogenous nodes. It is an energy-effiient data gathering protocol where sensor nodes in the network form an Antchain. The role of Antchain head and Antchain tail for each data gathering process is scheduled by means of a Time Division Multiple Access technique which ensures uniform depletion of energy among sensor nodes. The real advantage comes to light in the event of the death of a node. The proposed algorithm heals the network in such a way that only one node communicates with the base station at the end of the data gathering process. Simulation results indicate that Self-Healing AntChain performs better than other AntChain systems in terms of network lifetime, average energy consumed and aggregated data delivery ratio, in addition to being a highly fault-tolerant, exible and adaptive system.

关键词： Sensor nodes

来源：评论

学校读者我要写书评

暂无评论

A huffman decoding algorithm in mobile robot platform

引用

Information Technology Journal 2007年第5期6卷 776-779页

作者： Ponalagusamy, R. Kannan, E. Arock, Michael Department of Mathematics National Institute of Technology Trichy 620 015 Tamilnadu India Department of Computer Science and Engineering Vel Shri Rengarajan Shaugunthala High Tech Engineering College Chennai 600 062 Tamilnadu India Department of Computer Applications National Institute of Technology Trichy 620 015 Tamilnadu India

In the field of mobile robotics, data is transmitted from the robot over low bandwidth channels or incrementally in short bursts to a host, where it can be further processed for visualization. JPEG-LS is the one of the image and file compressions, in which the Huffman decoding is used to compress the result of quantization stage. In the recent production and management scenario, advanced factories require first an increasing degree of automation to reduce the product cost and, second, availability of greater flexibility of output and product types. To meet such requirements in near future, the factories need to link the flow of material, energy and information together more efficiently. In order to link the flow of information with other entities, we have to involve data compression, coding and decoding techniques. The speed is very demanding for such applications which in turn motivate to develop a fast decoding algorithm to meet the challenges arising in the field of predicting collision free path for robot. Huffman decoding has been widely used in data, image and video compression. This motivates the present work. For a Concurrent Read and Exclusive Write (CREW), Parallel Random Access Machine (PRAM) model with N processors, we propose a parallel algorithm for Huffman decoding in this paper. The algorithm employs (N+1)-ary search, which is parallel version of binary search. Its time complexity amounts to O (log N+1 (n+1)), where n is the number of symbols in a Huffman tree. © 2007 Asian Network for Scientific Information.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：