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

6th International Conference on Intelligent Data Engineering and Automated Learning - IDEAL 2005

作者： Srinivasa, K.G. Sridharan, K. Shenoy, P. Deepa Venugopal, K.R. Patnaik, Lalit M. Department of Computer Science and Engineering University Visvesvaraya College of Engineering Bangalore 560001 India Department of CSE Sunny Buffalo United States Microprocessor Applications Laboratory Indian Institute of Science India

In this paper, we propose a self Adaptive Migration Model for Genetic Algorithms, where parameters of population size, the number of points of crossover and mutation rate for each population are fixed adaptively. Further, the migration of individuals between populations is decided dynamically. This paper gives a mathematical schema analysis of the method stating and showing that the algorithm exploits previously discovered knowledge for a more focused and concentrated search of heuristically high yielding regions while simultaneously performing a highly explorative search on the other regions of the search space. The effective performance of the algorithm is then shown using standard testbed functions, when compared with Island model GA(IGA) and Simple GA(SGA). © Springer-Verlag Berlin Heidelberg 2005.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A Secure Image Steganography using LSB, DCT and Compression Techniques on Raw Images

A Secure Image Steganography using LSB, DCT and Compression ...

引用

International Conference on Intelligent Sensing and Information Processing (ICISIP)

作者： K.B. Raja C.R. Chowdary K.R. Venugopal L.M. Patnaik Department ofComputer Science Engineering Bangalore University Department of Computer Science Engineering Bangalore University Bangalore Microprocessor Applications Laboratory Indian Institute of Science Bangalore

Steganography is an important area of research in recent years involving a number of applications. It is the science of embedding information into the cover image viz., text, video, and image (payload) without causing statistically significant modification to the cover image. The modern secure image steganography presents a challenging task of transferring the embedded information to the destination without being detected. In this paper we present an image based steganography that combines Least Significant Bit(LSB), Discrete Cosine Transform(DCT), and compression techniques on raw images to enhance the security of the payload. Initially, the LSB algorithm is used to embed the payload bits into the cover image to derive the stego-image. The stego-image is transformed from spatial domain to the frequency domain using DCT. Finally quantization and runlength coding algorithms are used for compressing the stego-image to enhance its security. It is observed that secure images with low MSE and BER are transferred without using any password, in comparison with earlier works.

关键词： Steganography Discrete cosine transforms Image coding Payloads Modems Information security Frequency domain analysis Cryptography Watermarking Filtering

来源：评论

学校读者我要写书评

暂无评论

Towards formal specification and generation of autonomic policies

引用

EUC 2005 Workshops: 2nd International Symposium on Ubiquitous Intelligence and Smart Worlds, UISW 2005, IFIP International Symposium on Network-Centric Ubiquitous Systems, NCUS 2005, 1st International Workshop on Security in Ubiquitous Computing Systems, SecUbiq 2005, 1st International Workshop on RFID and Ubiquitous Sensor Networks, USN 2005 and International Workshop on Trusted and Autonomic Ubiquitous and Embedded Systems, TAUES 2005 held in conjunction with the IFIP International Conference on Embedded and Ubiquitous Computing, 2005

作者： Sterritt, Roy Hinchey, Michael G. Rash, James L. Truszkowski, Walt Rouff, Christopher A. Gracanin, Denis University of Ulster Ireland NASA Software Engineering Laboratory NASA Goddard Space Flight Center GreenbeltMD20771 United States Advanced Architectures and Automation Branch NASA Goddard Space Flight Center GreenbeltMD20771 United States Advanced Concepts Business Unit Science Applications International Corp McLeanVA22102 United States Virginia Tech Department of Computer Science BlacksburgVA United States

ISBN: (纸本)3540308032

Autonomic Computing (AC), self-management based on high level guidance from humans, is increasingly gaining momentum as the way forward in designing reliable systems to hide complexity and conquer IT management costs. Effectively, AC may be viewed as Policy-Based Self-Management. In this paper we look at the motivation for utilizing NASA requirements-based programming technologies for mechanically transforming policies (expressed in restricted natural language, or appropriate graphical notations) into a provably equivalent formal model that can be used as the basis for code generation and other transformations, with the goal of self-generation of provable autonomic policies. © IFIP International Federation for Information Processing 2005.

关键词： Formal specification

来源：评论

学校读者我要写书评

暂无评论

Modeling of human driving behavior based on piecewise linear model

Modeling of human driving behavior based on piecewise linear...

引用

IEEE International Symposium on Industrial Electronics (ISIE)

作者： Jong-Hae Kim S. Okuma Young-Woo Kim Don-Ha Hwang Min-Huei Kim Dong-Hee Kim Department of Electrical Engineering and Computer Science Graduate School of Engineering University of Nagoya Japan Space Robotics Research Center Toyota Technological Institute Nagoya Japan Industry Applications Research Laboratory Korea Electrotechnology Research Institute Changwon South Korea Department of Electrical & Automation Engineering Yeungnam College of Science and Technology Daegu South Korea Department of Electrical Engineering Yeungnam University Kyungbuk South Korea

This paper presents the development of the modeling strategy of the human driving behavior based on the expression as Piecewise Linear (PWL) model focusing on the driver’s stopping maneuver. The driving data are collected by using the three-dimensional driving simulator based on CAVE, which provides stereoscopic immersive vision. In our modeling, the relationship between the driver’s sensory information and the operation of the driver such as braking amount is expressed by PWL model, which is a class of Hybrid Dynamical System (HDS). The identification problem for the PWL model is formulated as the Mixed Integer Linear Programming (MILP) by transforming the switching conditions into binary variables. From the obtained results, it is found that the driver appropriately switches the ‘control low’ according to the sensory information. These results enable us to capture not only the physical meaning of the driving skill, but also the decision-making aspect (switching conditions) in the driver’s stopping maneuver.

关键词： Humans Piecewise linear techniques Hidden Markov models Decision making computer science Space technology Robotics and automation Switches Automatic control Service robots

来源：评论

学校读者我要写书评

暂无评论

Mining top – k ranked webpages using simulated annealing and genetic algorithms

引用

2nd Asian Applied Computing Conference, AACC 2004

作者： Deepa Shenoy, P. Srinivasa, K.G. Thomas, A.O. Venugopal, K.R. Patnaik, L.M. Department of Computer Science and Engineering University Visvesvaraya College of Engineering Bangalore India Microprocessor Applications Laboratory Indian Institute of Science Bangalore India

ISBN: (纸本)9783540236597

Searching on the Internet has grown in importance over the last few years, as huge amount of information is invariably accumulated on the Web. The problem involves locating the desired information and corresponding URLs on the WWW. With billions of webpages in existence today, it is important to develop efficient means of locating the relevant webpages on a given topic. A single topic may have thousands of relevant pages of varying popularity. Top - k document retrieval systems identifies the top - k ranked webpages pertaining to a given topic. In this paper, we propose an efficient top-k document retrieval method (TkRSAGA), that works on the existing search engines using the combination of Simulated Annealing and Genetic Algorithms. The Simulated Annealing is used as an optimized search technique in locating the top-k relevant webpages, while Genetic Algorithms helps in faster convergence via parallelism. Simulations were conducted on real datasets and the results indicate that TkRSAGA outperforms the existing algorithms. © Springer-Verlag Berlin Heidelberg 2004.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multipath routing to provide quality of service in mobile ad hoc networks 4th

Multipath routing to provide quality of service in mobile ad...

引用

4th International Workshop on Distributed Computing, IWDC 2002

作者： Patnaik, L.M. Suvernkar, Anand Microprocessor Applications Laboratory Department of Computer Science and Automation Indian Institute Of Science Bangalore560012 India

ISBN: (纸本)354000355X

Because of frequent topology changes and node failures, providing quality of service routing in mobile ad hoc networks becomes a very critical issue. The quality of service can be provided by routing the data along multiple paths. Such selection of multiple paths helps to improve reliability and load balancing, reduce delay introduced due to route rediscovery in presence of path failures. There are basically two issues in such a multipath routing. Firstly, the sender node needs to obtain the exact topology information. Since the nodes are continuously roaming, obtaining the exact topology information is a tough task. Here, we propose an algorithm which constructs highly accurate network topology with minimum overhead. The second issue is that the paths in the path set should offer best reliability and network throughput. This is achieved in two ways 1) by choice of a proper metric which is a function of residual power, traffic load on the node and in the surrounding medium 2) by allowing the reliable links to be shared between different paths. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Energy utilization

来源：评论

学校读者我要写书评

暂无评论

Multiagent fault‐diagnosis expert system in power systems

引用

European Transactions on Electrical Power 1995年第5期5卷 341-347页

作者： Wang, J.P. Trécat, J. Dr. Jianping Wang is a doctor fellow in the Faculte Polytechnique de Mons in Belgium. His current research field is parallel processing applications in power systems. Dr. Wang obtained his BS degree from Southwest Jiaotong University in P.R. Chinain 1982. From 1982 to 1990 he was appointed as an assistant lecturer. lecturer and associate professor respectively in the electrical engineering department of Southwest Jiaotong University. He obtained his Ph.D in the FacultC Polytechnique de Mons in July of 1993. (BD Dolez 3 1 FPMS B-7000 Mons Belgium T +32-65/37 41 87 Fax +32-65/37 43 00) Professor J. Trécat is a director in the power system laboratory in the Faculty Polytechnique de Mons. He obtained his Ph.D in the University of Manchester Institute of Science and Technology(UM1ST) in U.K. in 1970. He has been working in the fields of power system automation artificial intelligence application and computer vision in the Facult6 Polytechnique de Mons since 1970. He is a senior member of IEEE and he has made much contribution both in electrical engineering education and research. (BD Dolez 3 I FPMS B-7000 Mons T +32-651374185. Fax +32-6513743 00)

In order to solve the speed problem and shallow reasoning problem met in current research in fault diagnosis expert system, this paper presents a model based parallel fault diagnosis expert system for energy management systems (EMS). The Petri net model, which corresponds to the relationship between power system components and their protection systems, has been used for the inference in fault diagnosis. A multiagent parallel processing expert system, which is based on five transputers in Sun workstation, has been built for fault diagnosis purposes. The test results show that this expert system is not only fast but also has better performances. Copyright © 1995 John Wiley & Sons, Ltd.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Simulation-Based Test Generation Scheme Using Genetic Algorithms

A Simulation-Based Test Generation Scheme Using Genetic Algo...

引用

International Conference on VLSI Design

作者： M. Srinivas L.M. Patnaik Department of Computer Science and Automation Microprocessor Applications Laboratory Indian Institute of Science Bangalore India

来源：评论

学校读者我要写书评

暂无评论

PERFORMANCE EVALUATION OF BIDIRECTIONAL ASSOCIATIVE MEMORY ON A TRANSPUTER-BASED PARALLEL SYSTEM

引用

PARALLEL COMPUTING 1992年第4期18卷 401-413页

作者： MAHADEVAN, I PATNAIK, LM Dept. of Computer Science and Automation Indian Institute of Science Bangalore 560 012 India Microprocessor Applications Laboratory Supercomputer Education and Research Centre Dept. of Computer Science and Automation Indian Institute of Science Bangalore 560 012 India

In this paper we discuss a parallel implementation of an artificial neural network for pattern association, the Bidirectional Associative Memory (BAM). The parallelism inherent in BAM has been exploited using various transputer-based architectures like hypercube, mesh and linear array. The speedup and utilization of the system are obtained for the architectures mentioned above and a comparative study is made. Simulation results show that the hypercube topology gives a better performance in terms of speedup and utilization when compared to other architectures.

关键词： BIDIRECTIONAL ASSOCIATIVE MEMORY TRANSPUTERS HYPERCUBE MESH LINEAR ARRAY PATTERN RECOGNITION NEURAL NETWORKS

来源：评论

学校读者我要写书评

暂无评论

A force directed hill-climbing placement algorithm 5

A force directed hill-climbing placement algorithm

引用

5th International Conference on VLSI Design, ICVD 1992

作者： Mall, R. Palnaik, L.M. Dept. of Computer Science and Automation Indian Institute of Sciencc Bangalore560 012 India Microprocessor Applications Laboratory Indian Institute of Scicncc Bangalore560 012 India

ISBN: (纸本)0818624655

In this paper, we propose a heuristic pnxedure for finding near-optimal placement of VLSI circuit modules on a two- dimensional layout. This heuristic procedure combines ideas from a greedy placement algorithm and the Probabilistic Hill-Climbing technique. The main advantage of this alpproach is that while it retains the fast convergence property of the greedy algorithm, it exhibits adaptive hill- climbing capability. Performance evaluation studies on this algorithm have been carried out and the results appear promising. The results indicate that while the algorithm is computationally less expensive than the simulated annealing algorithm, it yields betterfinal placement solutions than the greedy algorithm. © 1991 IEEE.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：