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

Preprocessing convex polygons using range trees for recognition with few finger probes

11th International Conference on computer Analysis of Images and Patterns, CAIP 2005

作者： Guha, Sumanta Khánh, Kiêu Trong Computer Science and Information Management Program Asian Institute of Technology P.O. Box 4 Klong Luang Pathumthani 12120 Thailand

ISBN: (纸本)3540289690

The problem considered is that of recognizing if a given convex polygon comes from a known collection by applying probes. Existing approaches use a number of probes that is linear in the number of sides of the polygon. The current premise is that probing is expensive, while computing is cheap. Accordingly, a method is proposed that recognizes a polygon from the collection, with high probability, using only a constant number of probes, at the cost of fairly large computing resources, particularly, in setting up and applying a range tree data structure. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Relevancy based access control of versioned XML documents 05

Relevancy based access control of versioned XML documents

引用

SACMAT 2005: Proceedings of 10th ACM Symposium on Access Control Models and Technologies

作者： Iwaihara, Mizuho Chatvichienchai, Somchai Anutariya, Chutiporn Wuwongse, Vilas Dept. Social Informatics Kyoto University Kyoto 606-8501 Japan Dept. Info.-Media Siebold University of Nagasaki Nagasaki 851-2195 Japan Computer Science Program Shinawatra University Pathumthani 12160 Thailand Computer Science and Information Management Program Asian Institute of Technology Pathumthani 12120 Thailand

ISBN: (纸本)9781595930453

Integration of version and access control of XML documents has the benefit of regulating access to rapidly growing archives of XML documents. Versioned XML documents provide us with valuable informations on dependencies between document nodes, but at the same time presenting the risk of undesirable data disclosure. In this paper we introduce the notion of relevancy-based access control, which realizes protection of versioned XML documents by various types of relevancy, such as version dependencies, schema similarities and temporal proximity. We define a new path query language XVerPath over XML document versions, which can be utilized for specifying relevancy-based access control policies. We also introduce the notion of relevancy class, for collectively and compactly specifying relevancy-based policies. Copyright 2005 ACM.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Modeling resource management by agents interaction

引用

WSEAS Transactions on information science and Applications 2005年第1期2卷 48-54页

作者： Suesaowaluk, Poonphon Sadananda, Ramakoti Computer Science and Information Management Program School of Advanced Technologies Asian Institute of Technology Patumthani 12120 Thailand

A scenario is envisaged in which agents have tasks to perform and are in a position to exchange tasks to improve their performance, and thus perhaps affect the overall performance of the system. Our model uses two computing machines with their usual resources, and with random initial jobs to be processed. Their performance is dependent not only on absolute total load but also on how much of each machine's resources are in demand, thus giving scope for the beneficial exchange of jobs. This paper describes the development of a negotiation mechanism for job exchange between machines and measurement of system performance. The concept may be extended to multiple machines that act as agents exchanging resources and tasks.

关键词： Intelligent agents

来源：评论

学校读者我要写书评

暂无评论

An agent interaction model for performance enhancement of network system

引用

WSEAS Transactions on computers 2005年第5期4卷 440-448页

作者： Suesaowaluk, Poonphon Sadananda, Ramakoti Computer Science and Information Management Program School of Advanced Technologies Asian Institute of Technology Patumthani 12120 Thailand

We envisage a scenario where a system of network computer initially with random loads, exchange jobs to balance load among themselves to enhance their individual performance and to provide augmented quality of service (QoS) to the user community. We model the individual machines as agents interacting with one another. The agents have beliefs and aspirations. The aspiration of an agent is seek load from other, when it did not have enough to begin with, and sheds the same of it finds itself excessively loaded. This paper develops the concept with a design of a utility function to reflect the agent aspiration. We also propose a measure of load imbalance between networked machines. Negotiation mechanism is developed for exchange of jobs between agents. We report our result of the simulation with two machines and extend the same for three machines. The extension of the idea to a large number of machines entail coming to term with complexity in form of administrative overloads. We discuss the "small word" concept in the content of a simulation massively large number of machines interconnected.

关键词： Software agents

来源：评论

学校读者我要写书评

暂无评论

A collaborative intelligent tutoring system for medical problem-based learning

A collaborative intelligent tutoring system for medical prob...

引用

IUI 04: 2004 International Conference on Intelligent User Interfaces

作者： Suebnukarn, Siriwan Haddawy, Peter Computer Science and Information Management Program Asian Institute of Technology PO Box 4 Pathumthani Thailand

This paper describes COMET, a collaborative intelligent tutoring system for medical problem-based learning. The system uses Bayesian networks to model individual student knowledge and activity, as well as that of the group. It incorporates a multi-modal interface that integrates text and graphics so as to provide a rich communication channel between the students and the system, as well as among students in the group. Students can sketch directly on medical images, search for medical concepts, and sketch hypotheses on a shared workspace. The prototype system incorporates substantial domain knowledge in the area of head injury diagnosis. A major challenge in building COMET has been to develop algorithms for generating tutoring hints. Tutoring in PBL is particularly challenging since the tutor should provide as little guidance as possible while at the same time not allowing the students to get lost. From studies of PBL sessions at a local medical school, we have identified and implemented eight commonly used hinting strategies. We compared the tutoring hints generated by COMET with those of experienced human tutors. Our results show that COMET's hints agree with the hints of the majority of the human tutors with a high degree of statistical agreement (McNemar test, p = 0.652, Kappa = 0.773). Copyright 2004 ACM.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Temporal versioning of XML documents

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2004年 3334卷 419-428页

作者： Wuwongse, Vilas Yoshikawa, Masatoshi Amagasa, Toshiyuki Computer Science and Information Management Program Asian Institute of Technology P.O. Box 4 Klong Luang Pathumthani 12120 Thailand Information Technology Center Nagoya University Furo-cho Chikusa-ku Nagoya 464-8601 Japan Graduate School of Information Science Nara Institute of Science and Technology 8916-5 Takayama Ikoma Nara 630-0101 Japan

A data model supporting the unification of the management of temporal XML document databases and version control, i.e., a Temporal Version Data Model (TVDM), is proposed. TVDM is temporally change-centric and represents the change between two consecutive versions by means of temporal delta (tDelta). A tDelta employs a temporal XML expression (tXex) which is an extension of ordinary XML elements by incorporation into them temporal as well as ordinary variables. In addition to valid time, TVDM introduces version time and associates it with each version. All versions including the base or the current one can be uniformly represented by tDeltas. A technique to implement TVDM is also presented. © Springer-Verlag Berlin Heidelberg 2004.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

Stepwise development of security protocols: A speech act-oriented approach

Stepwise development of security protocols: A speech act-ori...

引用

FMSE'04: Proceedings of the 2004 ACM Workshop on Formal Methods in Security Engineering

作者： Dung, Phan Minh Thang, Phan Minh Asian Institute of Technologies Computer Science and Information Management Program PO Box 4 Klong Luang 12120 Pathumthani Thailand Asian Institute of Technologies Acrors Program PO Box 4 Klong Luang 12120 Pathumthani Thailand

ISBN: (纸本)1581139713

We propose a novel multi-layers paradigm for the design of key exchange protocols. In the top layer, protocols are specified in a high-level, declarative, formal language using speech acts as the basic building blocks. The declarative semantics of speech acts are specified by their preconditions and effects like in Hoare logics. A protocol logic, called ProtoLog, is developed for reasoning about speech act oriented protocols. Using the language of speech acts, protocol designers could develop their protocols in an modular and compositional way that are correct from the outset. High-level speech act-oriented protocols are automatically translated into lower-level message exchanging protocols by a "protocol compiler" that implements speech acts by sending and receiving appropriate encrypted messages. To demonstrate the applicability of our idea, we apply it on the class of well-designed key exchange protocols where a protocol is well-designed if a speech act is executed only if its preconditions are satisfied. We develop a "protocol compiler" for the class of well-designed protocols and prove the soundness and a limited form of completeness of the protocol logic ProtoLog wrt the translation, implemented by the compiler, under the Dolev-Yao assumption of perfect cryptography. An immediate corollary from the soundness result is the guarantee of the secrecy of exchanged keys (an essential security requirement of key exchange protocols) in well-designed protocols. Copyright 2004 ACM.

关键词： Network protocols

来源：评论

学校读者我要写书评

暂无评论

A rule-based XML access control model

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 2003年 2876卷 35-48页

作者： Anutariya, Chutiporn Chatvichienchai, Somchai Iwiahara, Mizuho Wuwongse, Vilas Kambayashi, Yahiko Computer Science Program Shinawatra University Pathumthani Thailand Department of Social Informatics Graduate School of Informatics Kyoto University Kyoto Japan Computer Science and Information Management Program Asian Institute of Technology Pathumthani Thailand

Due to a widely use of XML language in various application domains, a well-established mechanism for the definition and enforcement of security controls on specific accesses to XML documents is demanded, in order to ensure that only authorized entities can perform certain actions on the protected data. The proposed rule-based, declarative approach supports definition of (possibly implicit and complex) authorization rules on particular nodes within a document as well as enforcement of multiple user-defined policies, specifying selected mechanisms to resolve conflicts or to apply default authorization. Moreover, by founded on both RDF and XDD theory, the developed approach yields a simple yet flexible and interchangeable XML access control model with well-defined declarative semantics. © Springer-Verlag Berlin Heidelberg 2003.

关键词： Access control models

来源：评论

学校读者我要写书评

暂无评论

Modeling and forecasting of hourly transactions on a WWW and proxy cache server

Modeling and forecasting of hourly transactions on a WWW and...

引用

1999 Internet Workshop, IWS 1999

作者： Tantatsanawong, Panjai Phien, Huynh Ngoc Kanchanasut, Kanchana Computer Science and Information Management Program School of Advanced Technologies Asian Institute of Technology Thailand

ISBN: (纸本)0780359259

A modeling approach is introduced in this paper to capture the real characteristics of the WWW traffic, using a combination of Box-Jenkins models with seasonality removal. Fourier analysis and standardization are used to render seasonal data into non-seasonal data. However, seasonality cannot be completely removed by this approach, so both seasonal and non-seasonal models are employed and the best models are selected using posterior possibility criterion (PPC). In order to improve the forecasting accuracy, forecast values obtained by the developed models are adjusted by the difference percentage of the day of the week and by using this percentage adjusted values in place of the actual data, which are not available at the time of forecasting. With this adjustment, the developed models can provide very accurate forecast values, except for the case where the higher level of hierarchical proxy is shared by child proxies located in a different time zone. © 1999 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

The AI3 CacheBone project

The AI3 CacheBone project

引用

1999 Internet Workshop, IWS 1999

作者： Kanchanasut, Kanchana Yamaguchi, Suguru Kiatsirivatana, Kriengsak Inoue, Hiroyuki Suksakorn, Apisit Tantatsanawong, Panjai Internet Research Lab Computer Science and Information Management Program School of Advanced Technologies Asian Institute of Technology P.0.Box 4. KIongluang Pathumthani12120 Thailand Graduate School of Information Science Nara Institute of Science and Technology 8916-5 Takayama Ikoma Nara630-0101 Japan

ISBN: (纸本)0780359259

Hierarchical WWW cache formation which provides both higher hit rates and saves overall bandwidth consumption through fetching WWW objects and periodically redistributing them among member caches is proposed as an application on a satellite Internet infrastructure. With regular prefetching and distribution of WWW objects, our system can utilize the satellite Internet with continuous streaming data transmissions for efficient WWW caching. Our system consists of a single hub cache and several rim caches. The hub cache is a core unit which is located at the satellite hub station and gathers WWW objects from the Internet, while the rim cache fetches requested WWW objects from the hub cache as well as receiving WWW objects pushed from the hub cache. The prefetching strategy of the rim cache is based on the statistical pattern analysis of user accesses. Traffic monitoring is used to manage both prefetching and object push operations. In order to reduce the consumption of bandwidth in the satellite Internet, multicast transmission of WWW objects is introduced. Furthermore, cached objects are checked regularly with an ''if update' tag so that their consistency can be maintained with reasonable overhead. We discuss our design and implementation of the AI3 CacheBone with our adaptive hierarchical WWW cache formation scheme. Through experiments, we show that the performance of our rim cache shows an improvement of approximately three fold when compared with ordinary hierarchical cache systems such as Squid. © 1999 IEEE.

关键词： Bandwidth

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：