22nd International Conference on Data Engineering Workshops (ICDEW'06)最新文献

筛选
英文 中文
Multimodality Sensors for Sleep Quality Monitoring and Logging 多模态传感器用于睡眠质量监测和记录
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.97
Ya-Ti Peng, Ching-Yung Lin, Ming-Ting Sun
{"title":"Multimodality Sensors for Sleep Quality Monitoring and Logging","authors":"Ya-Ti Peng, Ching-Yung Lin, Ming-Ting Sun","doi":"10.1109/ICDEW.2006.97","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.97","url":null,"abstract":"In this paper, we investigate the possibility of using simple multimodality sensors to automatically detect a person’s sleep condition. We propose a system which consists of heart-rate, video, and audio sensors, and apply machine learning methods to infer the sleep-awake condition during the time a user spends on the bed. The sleep-awake conditions will be useful information for inferring sleep latency and sleep efficiency, which are critical to both sleep-related diseases and sleep quality measurements. To eliminate possible privacy concerns, we further explore the feasibility of using passive infrared (PIR) sensor instead of video sensor for motion information acquisition. Our experimental results are promising and show the potential use of the proposed novel economical alternative to the traditional medical measurement equipment, with competitive performance on the sleeprelated activity monitoring and the sleep quality measurements.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121886120","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
Processing XPath Queries in PC-Clusters Using XML Data Partitioning 使用XML数据分区处理pc集群中的XPath查询
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.120
Kentaro Kido, T. Amagasa, H. Kitagawa
{"title":"Processing XPath Queries in PC-Clusters Using XML Data Partitioning","authors":"Kentaro Kido, T. Amagasa, H. Kitagawa","doi":"10.1109/ICDEW.2006.120","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.120","url":null,"abstract":"Recently, with the rapid spread of XML format, it has become popular that large-scale data, whose size range from several hundreds of MB to several GB, are described by XML. For the purpose of providing fast and reliable means for storage and retrieval of huge XML data, it is a reasonable choice for us to use XML databases. In fact, there are many ways to realize XML databases, but relational XML database, in that an XML data is mapped to relational tables and query processing is enabled in terms of SQL queries, is one of the most popular way to implement XML databases. However, some researchers have pointed out that the performance of relational XML databases degrades when dealing with such huge XML data. In this study, we propose a scheme for parallel processing of XML data using PC Clusters. First, we discuss how to decompose XML data so that we can perform parallel processing of XML queries. We give the definitions of vertical and horizontal decomposition of XML data based on decomposition of schema graph and XML instances, respectively. To allocate decomposed XML data to cluster nodes, we give an algorithm for computing pseudo-optimal assignment of XML fragments like greedy method in the light of XML query workload. Finally, we experimentally evaluate the effectiveness of the proposed method.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125817827","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}
引用次数: 22
Query Classification and Storage Evaluation inWireless Sensor Networks 无线传感器网络中的查询分类与存储评估
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.123
Kyungseo Park, R. Elmasri
{"title":"Query Classification and Storage Evaluation inWireless Sensor Networks","authors":"Kyungseo Park, R. Elmasri","doi":"10.1109/ICDEW.2006.123","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.123","url":null,"abstract":"Recently, storage management has been a new focus of study in addition to traditional characteristics of wireless sensor networks. In this paper, five storage schemes that we categorize are evaluated in terms of query types that have different characteristics from one another. First, sensor network queries are classified by four criteria, and they are divided in more detail by the combination of elements in the criteria. Second, storage schemes are classified by considering where and how to store sensed data and what kind of routing protocols they use. Finally, storage schemes are evaluated for different query types in terms of metrics such as the number of transmissions, energy, delay, life span, and local storage capacity. Through the analysis and simulation, we show what kind of storage is suitable for which particular query characteristics.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121954148","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
A Model for a Semantic Enabled Network 语义支持网络的模型
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.10
William A. Ruh
{"title":"A Model for a Semantic Enabled Network","authors":"William A. Ruh","doi":"10.1109/ICDEW.2006.10","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.10","url":null,"abstract":"Networks have changed little since the rise and dominance of the IP protocol. Networks are focused on the transmission of transactions and information but have not played a significant role in the processing. They have focused on layers 1 through 4 in the OSI model. However, as more complex distributed systems are being developed increased intelligence in the network is becoming necessary. With the advent of next generation protocols and formats for information there is an opportunity to increase the capabilities of networks at the higher levels of the OSI model. Leveraging the technologies of the Semantic Web as well as Web Services in Layers 5 through 7 can lead to very powerful models for solving problems in developing and integrating distributed systems. This paper describes a model for the Semantic Enabled Network. It will address the basic concepts, architectural components and the characteristics of usage.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129184940","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}
引用次数: 1
A Robust Approach to Schema Matching overWeb Query Interfaces 基于web查询接口的模式匹配鲁棒方法
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.18
Jin Pei, Jun Hong, D. Bell
{"title":"A Robust Approach to Schema Matching overWeb Query Interfaces","authors":"Jin Pei, Jun Hong, D. Bell","doi":"10.1109/ICDEW.2006.18","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.18","url":null,"abstract":"In recent years, more and more data sources are available on the Web, where data can be accessed only via web interfaces. To make these data sources sharable, holistic schema matching which benefits from a large number of schemas has attracted much attention. However, current holistic approaches still suffer from the following limitations: a). They are sensitive to noisy data; b). While different types of information about attributes (e.g. attribute names, text descriptions, domain values) have been used, it remains an issue to effectively merge these types of information. In this paper, we propose a re-sampling method for handling noisy data across multiple web interfaces in the same domain. Furthermore, we propose a novel method to utilize different types of information about attributes, which is robust for resolving homonyms. Our experimental results show that our proposed methods are highly effective.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117256672","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}
引用次数: 11
XStruct: Efficient Schema Extraction from Multiple and Large XML Documents XStruct:从多个大型XML文档中高效提取模式
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.166
J. Hegewald, Felix Naumann, Melanie Herschel
{"title":"XStruct: Efficient Schema Extraction from Multiple and Large XML Documents","authors":"J. Hegewald, Felix Naumann, Melanie Herschel","doi":"10.1109/ICDEW.2006.166","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.166","url":null,"abstract":"XML is the de facto standard format for data exchange on the Web. While it is fairly simple to generate XML data, it is a complex task to design a schema and then guarantee that the generated data is valid according to that schema. As a consequence much XML data does not have a schema or is not accompanied by its schema. In order to gain the benefits of having a schema - efficient querying and storage of XML data, semantic verification, data integration, etc.- this schema must be extracted. In this paper we present an automatic technique, XStruct, for XML Schema extraction. Based on ideas of [5], XStruct extracts a schema for XML data by applying several heuristics to deduce regular expressions that are 1-unambiguous and describe each element’s contents correctly but generalized to a reasonable degree. Our approach features several advantages over known techniques: XStruct scales to very large documents (beyond 1GB) both in time and memory consumption; it is able to extract a general, complete, correct, minimal, and understandable schema for multiple documents; it detects datatypes and attributes. Experiments confirm these features and properties.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123316351","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}
引用次数: 80
A New Approach for Information Processing inWireless Sensor Network 一种新的无线传感器网络信息处理方法
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.12
Burcin Bostan-Korpeoglu, A. Yazıcı, I. Korpeoglu, R. George
{"title":"A New Approach for Information Processing inWireless Sensor Network","authors":"Burcin Bostan-Korpeoglu, A. Yazıcı, I. Korpeoglu, R. George","doi":"10.1109/ICDEW.2006.12","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.12","url":null,"abstract":"Recent technological advances enable realization of wireless sensor networks suitable for many applications including environmental monitoring, biological and chemical contamination detection, earthquake management. Depending on the application, the properties of sensor network databases include a distributed environment, approximate and long-running queries, large volumes of data, uncertainty and fuzziness in data and in queries, activeness, etc., which bring out new database processing and management problems. In particular, reactive sensor network database applications must be able to detect the occurrences of specific events or changes in the network state, and to respond by automatically executing the appropriate application logic. For such applications, an ECA rule-based fuzzy active database approach fits well. In this study, we propose an active database approach employing a fuzzy Petri net model, which processes uncertain sensor data and handles flexible (i.e., fuzzy and approximate) and continuous queries. The proposed model provides a natural data processing and management approach for sensor and actuator network applications that require reactive behavior.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122978838","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
Strategic Properties of Peer-to-Peer Data Structures and Behaviour of Human Peers in Economic Experiments 经济实验中点对点数据结构的策略属性和人类同伴的行为
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.139
Stephan Schosser, Klemens Böhm, R. Schmidt, B. Vogt
{"title":"Strategic Properties of Peer-to-Peer Data Structures and Behaviour of Human Peers in Economic Experiments","authors":"Stephan Schosser, Klemens Böhm, R. Schmidt, B. Vogt","doi":"10.1109/ICDEW.2006.139","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.139","url":null,"abstract":"Structured peer-to-peer networks manage large data sets. Each peer administers a part of the data. To answer a query, several peers must collaborate. However, experience with peer-to-peer file sharing systems shows that peers tend to abandon collaboration. Such behaviour is also expected in structured peer-to-peer systems. In the recent past, protocols for such systems to counter this kind of behaviour have been proposed. Our objective is to investigate how the behaviour of peers reacts to such protocols. We use idealized game theoretic models to analyze the strategic properties of structured peer-to-peer networks. The models predict cutoff strategies. I.e., if more than a certain percentage of their queries are answered, peers also answer queries in a stationary equilibrium. Another theoretical result is that free riding may occur in equilibrium. To check whether our theoretical predictions are in line with reality, we have implemented our model in an experimental laboratory and have analyzed the behaviour of human peers. These experiments support our theoretical results.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132473308","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}
引用次数: 1
Anti-Tamper Databases: Processing Aggregate Queries over Encrypted Databases 防篡改数据库:处理加密数据库上的聚合查询
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.30
Sun S. Chung, G. Özsoyoglu
{"title":"Anti-Tamper Databases: Processing Aggregate Queries over Encrypted Databases","authors":"Sun S. Chung, G. Özsoyoglu","doi":"10.1109/ICDEW.2006.30","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.30","url":null,"abstract":"This paper is about anti-tamper databases, where the database contents are encrypted for security in a way to allow efficient query processing directly on the encrypted database without decrypting it. We use a family of openform and closed-form homomorphism encryption/decryption functions and a computing architecture where (a) the database is encrypted a priori, and (b) for SQL queries expressible in relational algebra, there is no extra query processing cost except for the decryption of the final query output. For complex aggregate queries and nested queries that require extra query processing over the encrypted database, we present query execution strategies. We quantify the additional costs incurred when executing aggregate nested SQL queries over encrypted relational databases, and present detailed experimental results. We observe the crossover points as to when processing a query over an encrypted database is still more advantageous than shipping it over the internet to a secure server housing the original, non-encrypted database, evaluating it and returning the query output to the user.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114933531","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}
引用次数: 36
A PCA-Based Vehicle Classification Framework 基于pca的车辆分类框架
22nd International Conference on Data Engineering Workshops (ICDEW'06) Pub Date : 2006-04-03 DOI: 10.1109/ICDEW.2006.16
Chengcui Zhang, Xin Chen, Wei-bang Chen
{"title":"A PCA-Based Vehicle Classification Framework","authors":"Chengcui Zhang, Xin Chen, Wei-bang Chen","doi":"10.1109/ICDEW.2006.16","DOIUrl":"https://doi.org/10.1109/ICDEW.2006.16","url":null,"abstract":"Due to its great practical importance, Intelligent Transportation System has been an active research area in recent years. In this paper, we present a framework that incorporates various aspects of an intelligent transportation system with its ultimate goal being vehicle classification. Given a traffic video sequence, the proposed system first proceeds to segment individual vehicles. Then the extracted vehicle objects are normalized so that all vehicles are aligned along the same direction and measured at the same scale. Following the preprocessing step, two classification algorithms - Eigenvehicle and PCA-SVM, are proposed and implemented to classify vehicle objects into trucks, passenger cars, vans, and pick-ups. These two methods exploit the distinguishing power of Principal Component Analysis (PCA) at different granularities with different learning mechanisms. Experiments are conducted to compare these two methods and the results demonstrate the effectiveness of the proposed framework.","PeriodicalId":331953,"journal":{"name":"22nd International Conference on Data Engineering Workshops (ICDEW'06)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2006-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129137189","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}
引用次数: 66
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学术文献互助群
群 号:481959085
Book学术官方微信