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

International Conference on Advanced information Networking and Applications (AINA)

作者： Wen-Hsien Tseng Hsing Mei Web Computing Laboratory Computer Science and Information Engineering Department Fu Jen Catholic University Taiwan

ISBN: (纸本)0769519067

Jinis discovery protocols allow people to access requested services spontaneously in their own federations. However, to access services in remote federations, people have to know where the remote lookup services of them are located. This prerequisite is owing to Jinis discovery protocols relying on multicasting support, which becomes an issue when people want to access services across non-multicastable federations. Jini system, moreover, cannot handle the mobility. When mobile clients join into a new federation, they have to relocate services, which were installed in the initiating federations. All these problems are consequent on lack of communication between federations in the current Jini system. We propose two new schemes to extend the Jini lookup service: one is called inter-Federation Communication; and the other is called Proxy-Object Forwarding. In the first scheme, we construct an extended lookup service in charge of the Inter-federation service lookup. In the second one, we predict the federations that mobile clients will move to, and forward the requested proxy-objects to the predicted federations. With the effort of this paper, the performance of the Jini system is enhanced. Our experiments show the significant improvement in response time with Inter-Federation Communication and Proxy-Object Forwarding.

关键词： Mobile communication Sun computer science Multicast protocols Access protocols Delay Personal digital assistants computer networks Terminology Bandwidth

来源：评论

学校读者我要写书评

暂无评论

Solving traveling salesman problems by genetic algorithms

引用

自然科学进展（英文版） 2003年第2期13卷 135-141页

作者： LIANG Yanchun GE Hongwei Zhou Chunguang LEE Heow Pueh LIN Wuzhong LIM Siak Piang LEE Kwok Hong College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sciences Beijing 100080 China Institute of High Performance Computing Singapore 117528 Singapore College of Mathematics Science Jilin University Changchun 130012 China College of Computer Science and Technology Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Department of Mechanical Engineering National University of Singapore Singapore 119260 Singapore

The gene section ordering on solving traveling salesman problems is analyzed by numerical experiments. Some improved crossover operations are presented. Several combinations of genetic operations are examined and the functions of these operations are analyzed. The essentiality of the ordering of the gene section and the significance of the evolutionary inversion operation are discussed. Some results and conclusions are obtained and given, which provide useful information for the implementation of the genetic operations for solving the traveling salesman problem.

关键词： genetic algorithms traveling salesman problem gene section evolutionary inversion genetic operations

来源：评论

学校读者我要写书评

暂无评论

Multi-resolution modeling in collaborative design

引用

18th International Symposium on computer and information sciences, ISCIS 2003

作者： Han, Junghyun Kim, Taeseong Cera, Christopher D. Regli, William C. Computer Graphics Laboratory School of Information and Communications Engineering Sung Kyun Kwan University Suwon440-746 Korea Republic of Geometric and Intelligent Computing Laboratory Department of Computer Science Drexel University PhiladelphiaPA19104 United States

ISBN: (纸本)3540204091

This paper provides a framework for information assurance within collaborative design, based on a technique we call role-based viewing. Such rolebased viewing is achieved through integration of multi-resolution geometry and security models. 3D models are geometrically partitioned, and the partitioning is used to create multi-resolution mesh hierarchies. Extracting an appropriately simplified model suitable for access rights for individual designers within a collaborative design environment is driven by an elaborate access control mechanism. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Dynamic belief revision operators

Dynamic belief revision operators

引用

作者： Nayak, Abhaya C. Pagnucco, Maurice Peppas, Pavlos Department of Computing Division of Information and Communication Sciences Macquarie University NSW 2109 Australia Artificial Intelligence Laboratory School of Computer Science and Engineering University of New South Wales Sydney NSW 2052 Australia AIT-Athens Information Technology 19.5km Markopoulo Avenue Peania 19002 Athens Greece

The AGM approach to belief change is not geared to provide a decent account of iterated belief change. Darwiche and Pearl have sought to extend the AGM proposal in an interesting way to deal with this problem. We show that the original Darwiche-Pearl approach is, on the one hand excessively strong and, on the other rather limited in scope. The later Darwiche-Pearl approach, we argue, although it addresses the first problem, still remains rather permissive. We address both these issues by (1) assuming a dynamic revision operator that changes to a new revision operator after each instance of belief change, and (2) strengthening the Darwiche-Pearl proposal. Moreover, we provide constructions of this dynamic revision operator via entrenchment kinematics as well as a simple form of lexicographic revision, and prove representation results connecting these accounts. © 2003 Elsevier science B.V. All rights reserved.

关键词： Entrenchment kinematics Iterated belief change Lexicographic revision Unary revision

来源：评论

学校读者我要写书评

暂无评论

Global and localized parallel preconditioning techniques for large scale solid Earth simulations

Global and localized parallel preconditioning techniques for...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Kai Wang Sangbae Kim Jun Zhang K. Nakajima H. Okuda Laboratory for High Performance Scientific Computing and Computer Simulation Department of Computer Science University of Kentucky Lexington KY USA Research Organization for Information Science and Technology Meguro Tokyo Japan Department of Quantum Engineering and System Sciences University of Tokyo Bunkyo Tokyo Japan

We investigate and compare a few parallel preconditioning techniques in the iterative solution of large sparse linear systems arising from solid Earth simulation with and without using contact information in the domain partitioning process. Previous studies are focused on using static or matrix pattern based incomplete LU (ILU) preconditioners in a localized preconditioner implementation. Our current studies are concerned with preconditioner performance for solving two different cases with and without known contact information. For the cases with contact information, we use localized threshold value based incomplete LU (ILUT) preconditioner to improve efficiency. For the cases without contact information, we use a global sparse approximate inverse preconditioner with a static sparsity pattern to achieve robustness. Numerical results from simulating ground motion on a parallel supercomputer are given to compare the effectiveness of these parallel preconditioning techniques.

关键词： Large-scale systems Earth Solid modeling Linear systems Sparse matrices Computational modeling computer simulation Uniform resource locators Geoscience information science

来源：评论

学校读者我要写书评

暂无评论

Advances in simulated modeling of vibration systems based on computational intelligence

引用

自然科学进展(英文版) 2002年第12期12卷 881-886页

作者： LIANG Yanchun LEE Heow Pueh LIN Wuzhong LIM Siak Piang LEE Kwok Hong Zhou Chunguang College of Computer Science and Technology Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy of Sci Institute of High Performance Computing Singapore 117528 Department of Mechanical Engineering National University of Singapore Singapore 119260 Singapore College of Computer Science and Technology Jilin University Changchun 130012 China

Computational intelligence is the computational simulation of the bio-intelligence, which includes artificial neural networks, fuzzy systems and evolutionary computations. This article summarizes the state of the art in the field of simulated modeling of vibration systems using methods of computational intelligence, based on some relevant subjects and the authors' own research work. First, contributions to the applications of computational intelligence to the identification of nonlinear characteristics of packaging are reviewed. Subsequently, applications of the newly developed training algorithms for feedforward neural networks to the identification of restoring forces in multi-degree-of-freedom nonlinear systems are discussed. Finally, the neural-network-based method of model reduction for the dynamic simulation of microelectromechanical systems (MEMS) using generalized Hebbian algorithm (GHA) and robust GHA is outlined. The prospects of the simulated modeling of vibration systems using techniques of computational intelligence are also indicated.

关键词： computational intelligence artificial neural network fuzzy system evolutionary computation vibration system

来源：评论

学校读者我要写书评

暂无评论

An automatic cache cooperative environment using ICP

An automatic cache cooperative environment using ICP

引用

International Conference on information Technology: Coding and computing (ITCC)

作者： Hsing Mei Chun-Yu Lu Chi-Chen Lai Web Computing Laboratory Computer Science and Information Engineering Department Fu Jen Catholic University Taiwan

ISBN: (纸本)0769515061

Internet Cache Protocol (ICP) is useful for constructing a cooperative cache environment on the Internet. The proxy servers exchange ICP queries and replies in order to share the cached objects with others. However, the required bandwidth of the ICP procedure in the cooperative environment is fixed no matter how high or low the ICP hit rate is. We propose a querying filter mechanism to select proper ICP queries before sending them out. With the querying filter scheme, every proxy server builds a status table to store favorite web hosts of its neighbors. When the original hosts are requesting, those objects will be delivered freely in order to keep the ICP hit rate stable. Other queries have to be filtered for decreasing additional traffic cost. By doing so the unqualified queries will be filtered and the network bandwidth can be saved; this eventually raises the utilization of the ICP mechanism.

关键词： Cache memory Internet Bandwidth information filtering information filters Protocols Cooperative caching web server Telecommunication traffic Costs

来源：评论

学校读者我要写书评

暂无评论

Discovery of parallel scheduling algorithms in cellular automata - based systems 15

Discovery of parallel scheduling algorithms in cellular auto...

引用

15th International Parallel and Distributed Processing Symposium, IPDPS 2001

作者： Seredyński, F. Świȩcicka, A. Zomaya, A.Y. Polish -Japanese Institute of Information Technologies Koszykowa 86 Warsaw02-008 Poland Institute of Computer Science Polish Academy of Sciences Ordona 21 Warsaw01-237 Poland Department of Computer Science Bialystok University of Technology Wiejska 45A Bialystok15-351 Poland Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Nedlands PerthWA6907 Australia

ISBN: (纸本)0769509908

In this paper we report new results concerning developing parallel multiprocessor scheduling algorithms working in cellular automata (CAs) - based scheduler. We consider the simplest case when a multiprocessor system is limited to two processors, but we not imply any limitations on a size and parameters of parallel programs. We use an approach called a selected neighborhood to design a nonlinear structure of CAs for a given program graph. We propose to use coevolutionary genetic algorithm (GA) to discover rules of parallel CAs, suitable for solving the scheduling problem. We compare sequential and parallel scheduling algorithms discovered in the context of CAs - based scheduling system. © 2001 IEEE.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

Discovery of parallel scheduling algorithms in cellular automata - based systems

Discovery of parallel scheduling algorithms in cellular auto...

引用

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： F. Seredynski A. Swiecicka A.Y. Zomaya Polish Japanese Institute of Information Technology Warsaw Poland Institute of Computer Science Polish Academy of Sciences Warsaw Poland Department of Computer Science Bialystok University of Technology Bialystok Poland Parallel Computing Research Laboratory Department of Electrical and Electronic Engineering University of Western Australia Australia

来源：评论

学校读者我要写书评

暂无评论

Performance enhancement of web-based push transmitter with channel scheduling

Performance enhancement of Web-based push transmitter with c...

引用

IEEE Annual International computer Software and Applications Conference (COMPSAC)

作者： Hsing Mei Chia-Hsi Chang Wen-Hsien Tseng Web Computing Laboratory Computer Science and Information Engineering Department Fu Jen Catholic University Taipei Taiwan

Push provides the automated and personalized web information delivery. Users can subscribe their interested channels from content providers. These channels will be delivered to users automatically in each update. Among all the components involved in a push system, a transmitter manages the deployment and maintenance of information channels. A content based channel scheduling mechanism for transmitters is designed and evaluated. Instead of push information by arriving order, the transmitter takes three more factors into account, i.e. the channel update period, the size of content, and the waiting time of content in queue. The transmitter delivers channels by their calculated priorities. Studying the results from our XML based simulation system, the new channel scheduling algorithm not only improves the average response time, but also decreases the average loss rate.

关键词： Transmitters Scheduling algorithm Network servers Software maintenance Processor scheduling Algorithm design and analysis Remote monitoring Laboratories computer science Publishing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：