发布求助
文献互助 智能选刊 最新文献

Proceedings. 6th International Conference on Advanced Systems for Advanced Applications最新文献

筛选
英文 中文
An active replication scheme for mobile data management 用于移动数据管理的主动复制方案
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765746
Shiow-yang Wu, Yu-tse Chang
{"title":"An active replication scheme for mobile data management","authors":"Shiow-yang Wu, Yu-tse Chang","doi":"10.1109/DASFAA.1999.765746","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765746","url":null,"abstract":"A replication scheme determines the number and location of replicas in a distributed system. Traditional static replication schemes do not perform well in a mobile environment since the assumptions of fixed hosts and relatively static access patterns no longer hold. For effective data management in a mobile environment, we propose a dynamic replication scheme which employs user profiles for recording users' mobility schedules, access behavior and read/write patterns, and actively reconfigures the replicas to adjust to the changes in user locations and system status. Simulation results demonstrate that the scheme can accurately predict the data requirement to facilitate effective replication, reduce response time, and increase data availability.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125493922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 20
Video description model based on prototype-instance model 基于原型-实例模型的视频描述模型
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765742
R. Carlos, M. Kaji, Naoaki Horiuchi, K. Uehara
{"title":"Video description model based on prototype-instance model","authors":"R. Carlos, M. Kaji, Naoaki Horiuchi, K. Uehara","doi":"10.1109/DASFAA.1999.765742","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765742","url":null,"abstract":"Current video database systems are able to manipulate syntactic aspects of temporal media like video and audio. However, few of these systems are able to manipulate video information according to its semantic content. Furthermore, manually describing video content is tedious and not practical for the video data due to the temporal, spatial, and massive characteristic of the video, meanwhile content description always depends on user interpretation. Our video description model is based on \"object-oriented model based on prototypes\" which is proposed in the object-oriented programming field. A prototype is a prefabricated object with a predefined structure, content and behavior from which new objects can be constructed from other prototypes. By using prototypes, the user is able to describe video stories easily implementing and modifying prototypes of typical scenes that usually appear in several stories. Our method uses two hierarchical structures, one based on prototypes' inheritance structure and another based on prototype internal structure. From this point of view, our system includes a hierarchical prototype menu, which guides the user to reach easily requested prototypes; hence, the story remains the same regardless of different user interpretation.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128797820","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Adaptive and incremental query expansion for cluster-based browsing 基于集群浏览的自适应增量查询扩展
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765733
K. Eguchi, Hidetaka Ito, A. Kumamoto, Y. Kanata
{"title":"Adaptive and incremental query expansion for cluster-based browsing","authors":"K. Eguchi, Hidetaka Ito, A. Kumamoto, Y. Kanata","doi":"10.1109/DASFAA.1999.765733","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765733","url":null,"abstract":"In this paper, we propose a new method of information retrieval which combines adaptive and incremental query expansion with cluster-based browsing. The proposed method attempts to accurately learn users' interests from their relevance judgments on clustered search results instead of individual documents, reducing users' loads for the judgments. The use of adaptive relevance feedback leads to the capability for tracking vague or dynamically shifting goals of users. Incrementally expanded and refined queries can be used in re-searching to improve the retrieval effectiveness. We apply the proposed method to the information retrieval on the World Wide Web and demonstrate its effectiveness through basic experiments.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127995510","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 8
An effective Boolean algorithm for mining association rules in large databases 大型数据库中关联规则挖掘的有效布尔算法
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765750
Suh-Ying Wur, Y. Leu
{"title":"An effective Boolean algorithm for mining association rules in large databases","authors":"Suh-Ying Wur, Y. Leu","doi":"10.1109/DASFAA.1999.765750","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765750","url":null,"abstract":"In this paper, we present in effective Boolean algorithm for mining association rules in large databases of sales transactions. Like the a priori algorithm, the proposed Boolean algorithm mines association rules in two steps. In the first step, logic OR and AND operations are used to compute frequent itemsets. In the second step, logic AND and XOR operations are applied to derive all interesting association rules based on the computed frequent itemsets. By only scanning the database once and avoiding generating candidate itemsets in computing frequent itemsets, the Boolean algorithm gains a significant performance improvement over the a priori algorithm. We propose two efficient implementations of the Boolean algorithm, the bitstream approach and the sparse-matrix approach. Through comprehensive experiments, we show that both the bitstream approach and the sparse-matrix approach outperform the a priori algorithm in all database settings. The sparse-matrix approach in particular shows a very significant performance improvement over the a priori algorithm.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129724892","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 54
Approximation techniques for indexing two-dimensional constraint databases 索引二维约束数据库的近似技术
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765754
E. Bertino, B. Catania, Boris Chidlovskii
{"title":"Approximation techniques for indexing two-dimensional constraint databases","authors":"E. Bertino, B. Catania, Boris Chidlovskii","doi":"10.1109/DASFAA.1999.765754","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765754","url":null,"abstract":"Constraint databases have recently been proposed as a powerful framework to model and retrieve spatial data. The use of constraint databases should be supported by access data structures that make effective use of secondary storage and reduce query processing time. In this paper, we consider the indexing problem for objects represented by conjunctions of two-variable linear constraints and we analyze the problem of determining all generalized tuples whose extension intersects or is contained in the extension of a given half-plane. In an earlier paper we have shown that both selection problems can be reduced to a point location problem by using a dual transformation. If the angular coefficient of the half-plane belongs to a predefined set, we have proved that a dynamic optimal indexing solution, based on B/sup +/-trees, exists. In this paper we propose two approximation techniques that can be used to find the result when the angular coefficient does not belong to the predefined set. We also experimentally compare the proposed techniques with R-trees.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122901679","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
FRAGTIQUE: an OO distribution design methodology FRAGTIQUE:一个面向对象的分布设计方法
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765762
M. Savonnet, M. Terrasse, K. Yétongnon
{"title":"FRAGTIQUE: an OO distribution design methodology","authors":"M. Savonnet, M. Terrasse, K. Yétongnon","doi":"10.1109/DASFAA.1999.765762","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765762","url":null,"abstract":"We present an OO distribution design methodology based on a ponderated graph called Class Dependency Graph (CDG) which captures structural relationships and query usage frequencies of an OO database. We characterize and select a set of methods for which parallel execution can be optimized. These methods determine the partitioning strategy and are used to partition the CDG into a set of partition trees representing a group of co-referenced classes which must be partitioned together. We define clustering strategy and flow measures which are used: to evaluate the quality of the fragmentation process; and as a metric for the allocation pre-treatment which is based on a distance strings algorithm.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114173146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Summary grids: building accurate multidimensional histograms 摘要网格:建立准确的多维直方图
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765751
P. Furtado, H. Madeira
{"title":"Summary grids: building accurate multidimensional histograms","authors":"P. Furtado, H. Madeira","doi":"10.1109/DASFAA.1999.765751","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765751","url":null,"abstract":"Data summarization is very important for many data analysis tasks. In this paper we propose a simple but efficient data summarization algorithm, which outputs a histogram for multidimensional data, and make a comparative study of its usage with different distributions and with existing algorithms. The idea is to iteratively grow and modify regions of homogeneous data. This is a different strategy from the commonly used strategy of iteratively fracturing subspaces using straight lines. This work compares both strategies and concludes that the new technique is better and helds good results. We also concluded that discriminate handling of outliers is important to provide good approximates.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130115436","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Index design for structured documents based on abstraction 基于抽象的结构化文档索引设计
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765740
Jyh-Herng Chow, Josephine M. Cheng, Daniel T. Chang, Jane Xu
{"title":"Index design for structured documents based on abstraction","authors":"Jyh-Herng Chow, Josephine M. Cheng, Daniel T. Chang, Jane Xu","doi":"10.1109/DASFAA.1999.765740","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765740","url":null,"abstract":"HTML has so far been the standard format for delivering information on the World Wide Web. However, automated information processing of these documents for data exchange and interoperability has been difficult. XML, a subset of SGML, has been proposed to be the next standard format, that allows user-defined tags for better describing nested document structures and associated semantics. Operations on structured documents, such as searching in nested document structures, require new functions that are not currently available on most systems today. We describe a general framework for manipulating structured documents based on document abstractions. An abstraction is an approximation of an actual document, while possessing useful properties for analyses of interest. The framework provides a wide design space for the tradeoff between cost and capability. This general framework can be applied to index design, document searching and categorization. We present this framework by focusing on the indexing and searching of structured documents in the XML domain, and prove their soundness. We also address the issue of rich data types in XML documents.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"7 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113980068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
QEM: a scheduling method for wireless broadcast data QEM:无线广播数据的调度方法
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765745
Y. Chung, Myoung-Ho Kim
{"title":"QEM: a scheduling method for wireless broadcast data","authors":"Y. Chung, Myoung-Ho Kim","doi":"10.1109/DASFAA.1999.765745","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765745","url":null,"abstract":"In mobile distributed systems the data on air can be accessed by a large number of clients. This paper describes the way clients access the wireless broadcast data with short latency. We define and analyze the problem of wireless data scheduling and we propose a measure, named QueryDistance (QD), which represents the degree of coherence for the data set accessed by a query. We give a practically usable method named QEM which constructs the broadcast schedule by expanding each query's data set in greedy way. We also evaluate the performance of our method by experiments.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127088477","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 56
An interactive classification of Web documents by self-organizing maps and search engines 通过自组织地图和搜索引擎对Web文档进行交互式分类
Proceedings. 6th International Conference on Advanced Systems for Advanced Applications Pub Date : 1999-04-19 DOI: 10.1109/DASFAA.1999.765734
K. Hatano, Ryouichi Sano, Yiwei Duan, Katsumi Tanaka
{"title":"An interactive classification of Web documents by self-organizing maps and search engines","authors":"K. Hatano, Ryouichi Sano, Yiwei Duan, Katsumi Tanaka","doi":"10.1109/DASFAA.1999.765734","DOIUrl":"https://doi.org/10.1109/DASFAA.1999.765734","url":null,"abstract":"We propose an effective classification view mechanism for hypertext data such as Web documents based on Kohonen's self-organizing map (SOM) and search engines. Web documents collected by search engines are automatically classified by SOM and the obtained SOMs are incrementally modified according to the interaction between users and SOMs. At present, various search engines are designed to retrieve Web documents. When we use search engines to retrieve Web documents we get a lot of answers and have to examine each Web document. Therefore, in order to make up for search engines, we need a function to classify Web documents corresponding to the user's point of view and their purposes. Furthermore, we cannot retrieve pertinent Web documents by conventional search engines when a specific topic is described by more than one Web document. To solve these problems, we exploited a content-based clustering system for Web documents. In this system, Web documents are automatically clustered by their feature vectors produced from Web documents or minimal subgraphs consisting of multiple Web documents, and their overview maps are dynamically generated by SOM. Furthermore, we propose a method by which an obtained SOM is modified by user's interaction such as feedback operations.","PeriodicalId":229416,"journal":{"name":"Proceedings. 6th International Conference on Advanced Systems for Advanced Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1999-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128235362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信