Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658967
Haizhen Sun, Liying Wang
Multi-state two-stage directed network systems can be used to model the performance of pipeline systems such as water supply network,gas supply network,oil transformation network etc..To overcome the"dimension damnation"-huge number of system states and reduce the complexity of computation in the process of reliability evaluation,a method which is based on the combination of the universal generating function (UGF) technique and random process methods is presented.A numerical example is given to illustrate the proposed method.
{"title":"Reliability Evaluation of Multi-State Two-Stage Directed Network Systems by Using Combined Stochastic Process Methods and Universal Generating Function","authors":"Haizhen Sun, Liying Wang","doi":"10.1109/DBTA.2010.5658967","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658967","url":null,"abstract":"Multi-state two-stage directed network systems can be used to model the performance of pipeline systems such as water supply network,gas supply network,oil transformation network etc..To overcome the\"dimension damnation\"-huge number of system states and reduce the complexity of computation in the process of reliability evaluation,a method which is based on the combination of the universal generating function (UGF) technique and random process methods is presented.A numerical example is given to illustrate the proposed method.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134443670","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}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658932
Yanbo Zhang, Y. Qu, Junsan Zhang
In recent years,Structural Correspondence Learning (SCL) is becoming one of the most important techniques for domain adaptation in natural language processing.T-SCL method for sentiment classification selects high frequency features which don't have enough ability to discriminate positive instances from negative instances.Therefore, FisherA&IG-SCL method,a new method for selecting pivot features, is proposed. This method makes pivot features selected by Criterion function and Information Gain more discriminative and descriptive. The experimental results show that proposed FisherA&IG-SCL method can produce much better performance.
{"title":"A New Method of Selecting Pivot Features for Structural Correspondence Learning in Domain Adaptive Sentiment Analysis","authors":"Yanbo Zhang, Y. Qu, Junsan Zhang","doi":"10.1109/DBTA.2010.5658932","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658932","url":null,"abstract":"In recent years,Structural Correspondence Learning (SCL) is becoming one of the most important techniques for domain adaptation in natural language processing.T-SCL method for sentiment classification selects high frequency features which don't have enough ability to discriminate positive instances from negative instances.Therefore, FisherA&IG-SCL method,a new method for selecting pivot features, is proposed. This method makes pivot features selected by Criterion function and Information Gain more discriminative and descriptive. The experimental results show that proposed FisherA&IG-SCL method can produce much better performance.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114078365","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}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659025
Xin Wang, Shuyi Wang, Pufeng Du, Zhiyong Feng
Effcient RDF data management is an essential factor in realizing the Semantic Web vision. However, most existing RDF storage schemes based on row-store relational databases are constrained in terms of efficiency and scalability. In this paper, we propose an RDF storage scheme that implements sextuple indexing for RDF triples using a column-oriented DBMS. To evaluate the performance of our approach, large-scale datasets upto 13 million triples are generated and benchmark queries that cover important RDF join patterns are devised. The experimental results show that our approach outperforms the row-oriented DBMS approach by upto an order of magnitude and is even competitive to the best state-of-the-art native RDF store.
{"title":"Storing and Indexing RDF Data in a Column-Oriented DBMS","authors":"Xin Wang, Shuyi Wang, Pufeng Du, Zhiyong Feng","doi":"10.1109/DBTA.2010.5659025","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659025","url":null,"abstract":"Effcient RDF data management is an essential factor in realizing the Semantic Web vision. However, most existing RDF storage schemes based on row-store relational databases are constrained in terms of efficiency and scalability. In this paper, we propose an RDF storage scheme that implements sextuple indexing for RDF triples using a column-oriented DBMS. To evaluate the performance of our approach, large-scale datasets upto 13 million triples are generated and benchmark queries that cover important RDF join patterns are devised. The experimental results show that our approach outperforms the row-oriented DBMS approach by upto an order of magnitude and is even competitive to the best state-of-the-art native RDF store.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123039373","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}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659102
Jia-li Du, P. Yu
As computers have become more affordable and accessible, the theories and techniques of natural language processing (NLP) are increasingly used as a means for automatically decoding natural language. Well-formed substring table (WFST) is an efficient parsing algorithm used to decode natural language. The form of (START, FINISH, LABELFOUND. TO FIND) is accepted by system as its basic model, and its obvious decoding of natural language can be shown by chart parsing. GP sentence has a special syntactic structure which can bring processing breakdown and backtracking during the automatic decoding. By analyzing the GP sentence on the basis of the techniques of WFST, we reach the conclusions that WFST method is helpful for readers to understand GP sentence which has a complex syntactic structure, that it is necessary for an effective NLP system to have access to syntactic, cognitive and semantic knowledge, and that the integration between machine techniques and human being cognition is essential for system to decode natural language.
{"title":"Towards Natural Language Processing: A Well-Formed Substring Table Approach to Understanding Garden Path Sentence","authors":"Jia-li Du, P. Yu","doi":"10.1109/DBTA.2010.5659102","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659102","url":null,"abstract":"As computers have become more affordable and accessible, the theories and techniques of natural language processing (NLP) are increasingly used as a means for automatically decoding natural language. Well-formed substring table (WFST) is an efficient parsing algorithm used to decode natural language. The form of (START, FINISH, LABELFOUND. TO FIND) is accepted by system as its basic model, and its obvious decoding of natural language can be shown by chart parsing. GP sentence has a special syntactic structure which can bring processing breakdown and backtracking during the automatic decoding. By analyzing the GP sentence on the basis of the techniques of WFST, we reach the conclusions that WFST method is helpful for readers to understand GP sentence which has a complex syntactic structure, that it is necessary for an effective NLP system to have access to syntactic, cognitive and semantic knowledge, and that the integration between machine techniques and human being cognition is essential for system to decode natural language.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"110 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123930225","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}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658929
Xiao Jun, Zhu Bei
The carbonate karst reservoir with severe heterogeneity is one of the most attractive research objects in petroleum geology and petroleum geophysics. The Carboniferous carbonate karst reservoir in Weixi'nan sag has been studied by using the prediction technology of seismic attribute in this paper, and four major research results are emphasized: It is believed that researches on the carbonate karst reservoir are significant both for theoretical and exploration practice.
{"title":"Seismic Prediction Technology for Carbonate Karst Reservoir in Weixi'nan Sag of Beibu Gulf Basin","authors":"Xiao Jun, Zhu Bei","doi":"10.1109/DBTA.2010.5658929","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658929","url":null,"abstract":"The carbonate karst reservoir with severe heterogeneity is one of the most attractive research objects in petroleum geology and petroleum geophysics. The Carboniferous carbonate karst reservoir in Weixi'nan sag has been studied by using the prediction technology of seismic attribute in this paper, and four major research results are emphasized: It is believed that researches on the carbonate karst reservoir are significant both for theoretical and exploration practice.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128687927","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}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658983
Mingyan Teng
Security issues are quite important in applications of Database As a Service (DAS) where data are published to the untrusted service providers by data owners. This paper is to address the problem of verifying the completeness of query results generated from the untrusted service providers in DAS applications. Existing studies on completeness verification of query results are focused on one dimensional data, which cannot be easily extended to multi-dimensional data. In this paper, we propose a novel approach of completeness verification on multidimensional data, namely neighborhood-based completeness verification (NBCV) scheme. It works by modelling and exploiting the contiguity among multi-dimensional data. Extensive experiments were conducted, and the results show the effectiveness of the proposed scheme in completeness verification of query results on multi-dimensional data.
{"title":"Verifying the Completeness of Query Results on Multi-Dimensional Data","authors":"Mingyan Teng","doi":"10.1109/DBTA.2010.5658983","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658983","url":null,"abstract":"Security issues are quite important in applications of Database As a Service (DAS) where data are published to the untrusted service providers by data owners. This paper is to address the problem of verifying the completeness of query results generated from the untrusted service providers in DAS applications. Existing studies on completeness verification of query results are focused on one dimensional data, which cannot be easily extended to multi-dimensional data. In this paper, we propose a novel approach of completeness verification on multidimensional data, namely neighborhood-based completeness verification (NBCV) scheme. It works by modelling and exploiting the contiguity among multi-dimensional data. Extensive experiments were conducted, and the results show the effectiveness of the proposed scheme in completeness verification of query results on multi-dimensional data.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"2 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128825154","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}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659010
Hongwu Luo, Yongjie Chen, Wendong Zhang
For the problems of large computational complexity and splitting attribute selection inclining to choose the attribute which has many values in ID3 algorithm,this paper presents an improved algorithm based on the Information Entropy and Attribute Weights.In the improved algorithm,it has been combined with the Taylor's theorem and Attribute Similarity theorem to simplify the calculation of Entropy and determine the attribute importance weights,and an amended information gain is accomplished as the attribute selection criteria.The results of experiment comparison proved that the algorithm can improve the speed of classification, significantly improve the accuracy of rules, and derive more practical rules for applications.
{"title":"An Improved ID3 Algorithm Based on Attribute Importance-Weighted","authors":"Hongwu Luo, Yongjie Chen, Wendong Zhang","doi":"10.1109/DBTA.2010.5659010","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659010","url":null,"abstract":"For the problems of large computational complexity and splitting attribute selection inclining to choose the attribute which has many values in ID3 algorithm,this paper presents an improved algorithm based on the Information Entropy and Attribute Weights.In the improved algorithm,it has been combined with the Taylor's theorem and Attribute Similarity theorem to simplify the calculation of Entropy and determine the attribute importance weights,and an amended information gain is accomplished as the attribute selection criteria.The results of experiment comparison proved that the algorithm can improve the speed of classification, significantly improve the accuracy of rules, and derive more practical rules for applications.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"53 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115918466","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}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658930
Guodong Shi, Yuwan Gu, Yuqiang Sun, Xiaokang Wang, A. Yin
In this paper,it is researched thoroughly for CYK-algorithm （Cocke - Younger- Kasami）of parsing normal sentence, in particular,it is analyzed thoroughly for the generating algorithm about initial CYK-table of word-lattice structure,and CYK-algorithm is improved by the attribute of span of time sequence after word-lattice distortion,a kind of word-lattice parsing algorithm based on improved CYK-algorithm is proposed. Structure pattern of independent model is proposed in term of the feature of program structure.At last,the algorithm's feasibility,running process and results,which consist with the results of theoretical analysis,are explained through an instance.
{"title":"Word-Lattice Parsing Parallel Algorithm","authors":"Guodong Shi, Yuwan Gu, Yuqiang Sun, Xiaokang Wang, A. Yin","doi":"10.1109/DBTA.2010.5658930","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658930","url":null,"abstract":"In this paper,it is researched thoroughly for CYK-algorithm （Cocke - Younger- Kasami）of parsing normal sentence, in particular,it is analyzed thoroughly for the generating algorithm about initial CYK-table of word-lattice structure,and CYK-algorithm is improved by the attribute of span of time sequence after word-lattice distortion,a kind of word-lattice parsing algorithm based on improved CYK-algorithm is proposed. Structure pattern of independent model is proposed in term of the feature of program structure.At last,the algorithm's feasibility,running process and results,which consist with the results of theoretical analysis,are explained through an instance.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115985773","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}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5658953
Aihua Wang, Haimin Zhang, Jihua Lu
We set up the uplink MIMO channel model between base station (BS) and mobile station (MS). Several parameters have been considered, including the distinguishable paths, the indistinguishable paths, angular spread, antenna polarization, linear receiving antenna array and other factors. Secondly, this paper simulates the space statistical properties of MIMO antenna channel by MATLAB. Analysis results show that, antenna correlation coefficient in MIMO channel increases with the increasing average arrival angle, decrease with the increasing antenna interval and angular expansion. Besides, this paper has also added the time factor into the correlation coefficient of antenna, and draw its three-dimensional space-time map, this can describe the channel change trend more intuitional .
{"title":"Modeling and Space-Time Correlation Analysis of MIMO Channel","authors":"Aihua Wang, Haimin Zhang, Jihua Lu","doi":"10.1109/DBTA.2010.5658953","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5658953","url":null,"abstract":"We set up the uplink MIMO channel model between base station (BS) and mobile station (MS). Several parameters have been considered, including the distinguishable paths, the indistinguishable paths, angular spread, antenna polarization, linear receiving antenna array and other factors. Secondly, this paper simulates the space statistical properties of MIMO antenna channel by MATLAB. Analysis results show that, antenna correlation coefficient in MIMO channel increases with the increasing average arrival angle, decrease with the increasing antenna interval and angular expansion. Besides, this paper has also added the time factor into the correlation coefficient of antenna, and draw its three-dimensional space-time map, this can describe the channel change trend more intuitional .","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116111876","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}
Pub Date : 2010-12-06DOI: 10.1109/DBTA.2010.5659028
Yuepeng Shi, Aiping Cui, Quanbo Ge
Motivated by the extensive application of sensor networks in the multisensor target tracking systems, the problem of data fusion with mixed time delays which includes short timedelay and long time-delay is considered in this paper. In order to overcome several primary problems occurred in the existing fusion methods based on the "Out-Of-Sequence" Measurements (OOSMs), such as high investment for tracking systems, huge computational complexity and bad real-time performance and so forth, a universal linear predict estimate weighted fusion algorithm is proposed. Different from the OOSMs methods in which the transmitted data from local sensors to the fusion center are measurements, the proposed fusion algorithm sends the local estimates to the fusion center for fusion and is called "Out-Of-Sequence" Estimates (OOSEs). The time calibration for fusion is finished by predict operation in the fusion center. The proposed OOSEs method can avoid many problems existed in the OOSMs method, but its fusion accuracy is lower than that of the OOSMs method after a sort. This is because that the OOSMs is a smoothing estimate and the OOSEs is a predict estimate. The superiorities of the proposed method are illustrated by performance analysis.
{"title":"Multisensor Estimation Fusion for Wireless Networks with Mixed Data Delays","authors":"Yuepeng Shi, Aiping Cui, Quanbo Ge","doi":"10.1109/DBTA.2010.5659028","DOIUrl":"https://doi.org/10.1109/DBTA.2010.5659028","url":null,"abstract":"Motivated by the extensive application of sensor networks in the multisensor target tracking systems, the problem of data fusion with mixed time delays which includes short timedelay and long time-delay is considered in this paper. In order to overcome several primary problems occurred in the existing fusion methods based on the \"Out-Of-Sequence\" Measurements (OOSMs), such as high investment for tracking systems, huge computational complexity and bad real-time performance and so forth, a universal linear predict estimate weighted fusion algorithm is proposed. Different from the OOSMs methods in which the transmitted data from local sensors to the fusion center are measurements, the proposed fusion algorithm sends the local estimates to the fusion center for fusion and is called \"Out-Of-Sequence\" Estimates (OOSEs). The time calibration for fusion is finished by predict operation in the fusion center. The proposed OOSEs method can avoid many problems existed in the OOSMs method, but its fusion accuracy is lower than that of the OOSMs method after a sort. This is because that the OOSMs is a smoothing estimate and the OOSEs is a predict estimate. The superiorities of the proposed method are illustrated by performance analysis.","PeriodicalId":320509,"journal":{"name":"2010 2nd International Workshop on Database Technology and Applications","volume":"289 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114568740","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：