首页 > 最新文献

2011 International Conference on Internet Computing and Information Services最新文献

英文 中文
Improving Star Join Queries Performance: A Maximal Frequent Pattern Based Approach for Automatic Selection of Indexes in Relational Data Warehouses 提高星型连接查询性能:一种基于最大频繁模式的关系数据仓库索引自动选择方法
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.36
B. Ziani, Y. Ouinten
Indexing is a fundamental technique used by the administrator to reduce the cost of processing complex queries defined on a data warehouse. However, selecting a suitable configuration of indexes is a difficult problem to solve. The problem is classified as NP-hard. Automatic index selection has received significant attention in the databases field. Most works have focused on providing tools and algorithms to help data bases administrators in the choice of a configuration of indexes. Some of these works have been adapted for the data warehouse context. The idea, recently introduced, of using data mining techniques to resolve this problem remains a promising approach. In this paper, we propose a maximal frequent pattern based approach to generate a configuration of indexes from a given workload. The proposed approach was tested on APB-1 benchmark under Oracle. The results obtained show that the proposed approach generates indexes that improve the performance of the workload.
索引是管理员用来降低处理在数据仓库上定义的复杂查询的成本的一种基本技术。然而,选择合适的索引配置是一个很难解决的问题。这个问题被归类为np困难。自动索引选择在数据库领域受到了广泛的关注。大多数工作的重点是提供工具和算法,以帮助数据库管理员选择索引配置。其中一些作品已经针对数据仓库上下文进行了改编。最近提出的使用数据挖掘技术来解决这个问题的想法仍然是一个很有前途的方法。在本文中,我们提出了一种基于最大频繁模式的方法来从给定的工作负载生成索引配置。提出的方法在Oracle下的APB-1基准上进行了测试。结果表明,该方法生成的索引提高了工作负载的性能。
{"title":"Improving Star Join Queries Performance: A Maximal Frequent Pattern Based Approach for Automatic Selection of Indexes in Relational Data Warehouses","authors":"B. Ziani, Y. Ouinten","doi":"10.1109/ICICIS.2011.36","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.36","url":null,"abstract":"Indexing is a fundamental technique used by the administrator to reduce the cost of processing complex queries defined on a data warehouse. However, selecting a suitable configuration of indexes is a difficult problem to solve. The problem is classified as NP-hard. Automatic index selection has received significant attention in the databases field. Most works have focused on providing tools and algorithms to help data bases administrators in the choice of a configuration of indexes. Some of these works have been adapted for the data warehouse context. The idea, recently introduced, of using data mining techniques to resolve this problem remains a promising approach. In this paper, we propose a maximal frequent pattern based approach to generate a configuration of indexes from a given workload. The proposed approach was tested on APB-1 benchmark under Oracle. The results obtained show that the proposed approach generates indexes that improve the performance of the workload.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121288831","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
The Research on the Data Mining Technology in the Active Demand Management 主动需求管理中的数据挖掘技术研究
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.125
Chen Xuemei, Gao Li, Wang Xi, Wei Zhonghua, Z. Zhenhua, Liao Zhigao
The traditional K-Means algorithm is sensitive to outliers, outliers traction and easy off-center, and overlap of classes can not very well show their classification. This paper introduces a variant of the probability distribution theory, K-Means clustering algorithm - Gaussian mixture model to part of the customer data randomly selected of Volkswagen dealer in a Beijing office in 2008, for example, and carry out empirical study based on the improved clustering algorithm model. The results showed that: data mining clustering algorithm in active demand management and market segmentation has important significance.
传统的K-Means算法对离群点敏感,离群点牵引力大,容易偏离中心,类的重叠不能很好地显示其分类。本文以2008年大众汽车北京办事处经销商随机抽取的部分客户数据为例,将概率分布理论的一种变体K-Means聚类算法-高斯混合模型引入其中,并基于改进的聚类算法模型进行实证研究。结果表明:数据挖掘聚类算法在主动需求管理和市场细分中具有重要意义。
{"title":"The Research on the Data Mining Technology in the Active Demand Management","authors":"Chen Xuemei, Gao Li, Wang Xi, Wei Zhonghua, Z. Zhenhua, Liao Zhigao","doi":"10.1109/ICICIS.2011.125","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.125","url":null,"abstract":"The traditional K-Means algorithm is sensitive to outliers, outliers traction and easy off-center, and overlap of classes can not very well show their classification. This paper introduces a variant of the probability distribution theory, K-Means clustering algorithm - Gaussian mixture model to part of the customer data randomly selected of Volkswagen dealer in a Beijing office in 2008, for example, and carry out empirical study based on the improved clustering algorithm model. The results showed that: data mining clustering algorithm in active demand management and market segmentation has important significance.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"293 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116309945","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
Application of Chaotic Time Series Prediction in Forecasting of Library Borrowing Flow 混沌时间序列预测在图书馆借阅流量预测中的应用
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.147
Mei Tian
Prediction of library borrowing flow plays an important role in controlling the quality of book collection and cataloging work in library. Traditional time series prediction methods are hard to model the library borrowing flow because it is a nonlinear dynamical process and has nonstationary and stochastic character. Based on support vector machine and the theory of chaotic time series prediction, a new method is proposed to model and predict the library borrowing flow. The experiments show this method is reasonable to solve the nonlinear problem in library borrowing flow and is of certain value in both theory and practice.
图书馆借阅流程预测对控制馆藏编目工作质量具有重要作用。图书馆借阅流程是一个非线性的动态过程,具有非平稳和随机的特点,传统的时间序列预测方法难以对其进行建模。基于支持向量机和混沌时间序列预测理论,提出了一种新的图书馆借阅流程建模和预测方法。实验表明,该方法对解决图书馆借阅流程中的非线性问题是合理的,具有一定的理论和实践价值。
{"title":"Application of Chaotic Time Series Prediction in Forecasting of Library Borrowing Flow","authors":"Mei Tian","doi":"10.1109/ICICIS.2011.147","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.147","url":null,"abstract":"Prediction of library borrowing flow plays an important role in controlling the quality of book collection and cataloging work in library. Traditional time series prediction methods are hard to model the library borrowing flow because it is a nonlinear dynamical process and has nonstationary and stochastic character. Based on support vector machine and the theory of chaotic time series prediction, a new method is proposed to model and predict the library borrowing flow. The experiments show this method is reasonable to solve the nonlinear problem in library borrowing flow and is of certain value in both theory and practice.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125465446","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
Neural Network Research Using Particle Swarm Optimization 基于粒子群优化的神经网络研究
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.106
Yahui Wang, Zhifeng Xia, Yifeng Huo
In view of the artificial neural network weights training problem, this paper proposed a method to optimize the network's structure parameters and regularization coefficient using two-layer Particle Swarm Optimization (PSO). This algorithm was applied to train Adaline network. Compared with fixed regularization coefficient method and Sliding Mode Variable Structure optimization method, the result showed that it had the advantages of high precision and strong ability of generalization.
针对人工神经网络权值训练问题,提出了一种利用双层粒子群算法优化网络结构参数和正则化系数的方法。将该算法应用于Adaline网络的训练。结果表明,该方法与固定正则系数法和滑模变结构优化法相比,具有精度高、泛化能力强的优点。
{"title":"Neural Network Research Using Particle Swarm Optimization","authors":"Yahui Wang, Zhifeng Xia, Yifeng Huo","doi":"10.1109/ICICIS.2011.106","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.106","url":null,"abstract":"In view of the artificial neural network weights training problem, this paper proposed a method to optimize the network's structure parameters and regularization coefficient using two-layer Particle Swarm Optimization (PSO). This algorithm was applied to train Adaline network. Compared with fixed regularization coefficient method and Sliding Mode Variable Structure optimization method, the result showed that it had the advantages of high precision and strong ability of generalization.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124074688","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
On a Kind of Birkhoff Type 2-Periodic Trigonometric and Paratrigonometric Interpolation 一类Birkhoff型2-周期三角和准三角插值
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.97
Jin Guoxiang, Zhang Li, Ding Yong
In this paper, a kind of Birkhoff type 2-Periodic trigonometric and Para trigonometric interpolation problems with equidistant nodes for 2Ĉ -periodic and antiperiodic functions are discussed. We give the necessary and sufficient conditions for the solvable case of these interpolation problems. The expressions of the interpolation basis are constructed.
本文讨论了2ƒà -周期函数和反周期函数的一类具有等距节点的Birkhoff型2-周期三角和准三角插值问题。给出了这些插值问题可解情况的充分必要条件。构造了插值基的表达式。
{"title":"On a Kind of Birkhoff Type 2-Periodic Trigonometric and Paratrigonometric Interpolation","authors":"Jin Guoxiang, Zhang Li, Ding Yong","doi":"10.1109/ICICIS.2011.97","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.97","url":null,"abstract":"In this paper, a kind of Birkhoff type 2-Periodic trigonometric and Para trigonometric interpolation problems with equidistant nodes for 2Ĉ -periodic and antiperiodic functions are discussed. We give the necessary and sufficient conditions for the solvable case of these interpolation problems. The expressions of the interpolation basis are constructed.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127532376","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
Analytical Model and Simulation for AlGaN/GaN High Electron Mobility Transistor AlGaN/GaN高电子迁移率晶体管的分析模型与仿真
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.93
J. Xia, Yang Ruixia, Zhao Zhengping, Z. Zhiguo, Feng Zhihong
Based on the charge control theory, a accurate analytical model of I-V characteristics for AlGaN/GaN high electron mobility transistor (HEMT) is presented considering the relationship between self-heating effect and polarization, electron mobility, velocity saturation, conduction band discontinuity, doping concentration, channel temperature. The comparison between simulations and physical calculation shows a good agreement. The model is simple in calculations, suitable for design of microwave device and circuit.
基于电荷控制理论,综合考虑极化、电子迁移率、速度饱和、导带不连续、掺杂浓度、通道温度等因素的影响,建立了AlGaN/GaN高电子迁移率晶体管(HEMT) I-V特性的精确解析模型。仿真结果与实际计算结果吻合较好。该模型计算简单,适用于微波器件和电路的设计。
{"title":"Analytical Model and Simulation for AlGaN/GaN High Electron Mobility Transistor","authors":"J. Xia, Yang Ruixia, Zhao Zhengping, Z. Zhiguo, Feng Zhihong","doi":"10.1109/ICICIS.2011.93","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.93","url":null,"abstract":"Based on the charge control theory, a accurate analytical model of I-V characteristics for AlGaN/GaN high electron mobility transistor (HEMT) is presented considering the relationship between self-heating effect and polarization, electron mobility, velocity saturation, conduction band discontinuity, doping concentration, channel temperature. The comparison between simulations and physical calculation shows a good agreement. The model is simple in calculations, suitable for design of microwave device and circuit.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132211850","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
Comparative Analysis on Spatio-Temporal Land Use and Land Cover (LULC) Characteristics in Three Asia Cities 亚洲3个城市土地利用/土地覆盖时空特征比较分析
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.52
X. Zou, Zhen Shang, I. Odeh, Yizhao Chen, Jian-long Li
integration of Geographical Information System (GIS) and Remote Sensing (RS) methods is one of the most important methods for detecting LULC's change. In this study, with the support of GIS, RS technology and based on recent 10 years LULC data, the landscape pattern dynamics and regional spatio-temporal features related with the LULC change of three metropolis in Asian region, Zhangjiagang (China), Dehradun (India), and Hanoi (Vietnam) are analyzed. We mapping the LULC using supervised method with parallelepiped-maximum likelihood algorithm in ERDAS Imagine 9.1 of the study area based on three consecutive satellite images: Land sat TM, Land sat ETM+ and ASTER. The regional feature of the three cities illustrates different development direction, and the urbanization process of the cities was at different stages. Zhangjiagang was found at the highest stage of urbanization, and with the significant high per capita income level. Hanoi and Dehradun were demonstrated a moderate degree of urbanization and extensive land alternation of agricultural and non-used land to urban area. In Hanoi, Vietnam's capital city, urban agriculture is a longstanding feature, but rapid urban growth is leading to greater competition over land use. In Dehradun, urban areas increased from 96.15 ha to 150.23 ha while agricultural areas decreased from 91.59ha to 45.33ha from 2000-2009. Urban class showed an overall amount and extent of change from 28023 ha to 33215 ha while agricultural areas decrease from 45031 to 41173 during 2002-2010 in Zhangjiagang. As the result, the issue of low quality and security of food was concerned in these three areas. Government support has encouraged urban producers to modernize and invest in safer developing practices. However, in these cities, as indeed elsewhere, there is an urgent need to recognize the significance of sustainable development, agriculture and native forest area reservation in future planning strategies. This kind of strategies identifies key trends and underlying environmental and socio-economic factors, and considers the future sustainability of the practice.
地理信息系统(GIS)与遥感(RS)相结合是土地利用价值变化监测的重要手段之一。本文以中国张家港、印度德拉敦和越南河内3个亚洲大都市为研究区域,在GIS、RS技术支持下,基于近10年城市土地利用碳储量数据,分析了城市土地利用碳储量变化的景观格局动态和区域时空特征。基于landsat TM、landsat ETM+和ASTER三幅连续卫星图像,利用ERDAS Imagine 9.1软件中的平行六面体-最大似然算法,利用监督方法对研究区LULC进行制图。三个城市的地域性特征说明了不同的发展方向,城市的城市化进程处于不同的阶段。张家港市处于城市化的最高阶段,人均收入水平显著偏高。河内市和德拉敦市城市化程度中等,农业用地和未利用用地向城市地区广泛转移。在越南首都河内,城市农业是一个长期存在的特点,但快速的城市发展正在导致对土地使用的更大竞争。在德拉敦,2000-2009年,城市面积从96.15公顷增加到150.23公顷,而农业面积从91.59公顷减少到45.33公顷。2002-2010年,张家港城市类总体数量和变化程度从28023 ha减少到33215 ha,农业类从45031 ha减少到41173 ha。因此,食品质量和安全问题在这三个领域受到关注。政府的支持鼓励城市生产者实现现代化,并投资于更安全的发展做法。然而,在这些城市和在其他地方一样,迫切需要认识到可持续发展、农业和原始森林地区保留在未来规划战略中的重要性。这种策略确定了关键趋势和潜在的环境和社会经济因素,并考虑了实践的未来可持续性。
{"title":"Comparative Analysis on Spatio-Temporal Land Use and Land Cover (LULC) Characteristics in Three Asia Cities","authors":"X. Zou, Zhen Shang, I. Odeh, Yizhao Chen, Jian-long Li","doi":"10.1109/ICICIS.2011.52","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.52","url":null,"abstract":"integration of Geographical Information System (GIS) and Remote Sensing (RS) methods is one of the most important methods for detecting LULC's change. In this study, with the support of GIS, RS technology and based on recent 10 years LULC data, the landscape pattern dynamics and regional spatio-temporal features related with the LULC change of three metropolis in Asian region, Zhangjiagang (China), Dehradun (India), and Hanoi (Vietnam) are analyzed. We mapping the LULC using supervised method with parallelepiped-maximum likelihood algorithm in ERDAS Imagine 9.1 of the study area based on three consecutive satellite images: Land sat TM, Land sat ETM+ and ASTER. The regional feature of the three cities illustrates different development direction, and the urbanization process of the cities was at different stages. Zhangjiagang was found at the highest stage of urbanization, and with the significant high per capita income level. Hanoi and Dehradun were demonstrated a moderate degree of urbanization and extensive land alternation of agricultural and non-used land to urban area. In Hanoi, Vietnam's capital city, urban agriculture is a longstanding feature, but rapid urban growth is leading to greater competition over land use. In Dehradun, urban areas increased from 96.15 ha to 150.23 ha while agricultural areas decreased from 91.59ha to 45.33ha from 2000-2009. Urban class showed an overall amount and extent of change from 28023 ha to 33215 ha while agricultural areas decrease from 45031 to 41173 during 2002-2010 in Zhangjiagang. As the result, the issue of low quality and security of food was concerned in these three areas. Government support has encouraged urban producers to modernize and invest in safer developing practices. However, in these cities, as indeed elsewhere, there is an urgent need to recognize the significance of sustainable development, agriculture and native forest area reservation in future planning strategies. This kind of strategies identifies key trends and underlying environmental and socio-economic factors, and considers the future sustainability of the practice.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134263442","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
Performance Improvement of Audio-Visual Speech Recognition with Optimal Reliability Fusion 基于最优可靠性融合的视听语音识别性能改进
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.58
M. Tariquzzaman, Song-Min Gyu, Kim Jin Young, Na Seung You, M. A. Rashid
In state-of-the-art ASR technology, audio and video (AV) information based speech recognition is one of key challenges to cope with noise problem. AV fusion is one of the robust approaches for ASR. The main issues of AV fusion is where and how to integrate the two modalities' information. To enhance the AV fusion performance the paper [1] has proposed the optimum reliability fusion (ORF) and applied the ORF to AV speaker identification. In this paper we adopt the ORF based fusion in AV based speech recognition and evaluate the performance improvement in that domain. The ORF's main idea is to introduce weighting factors in score-base reliability measure (SCRM) for solving the over- or under-estimation problem in SCRM calculation. Our AV speech recognition system is implemented for Korean digit recognition using SAMSUMG AV database. Experimental results show that ORF effectively reduce the relative error rate of 42.8% in comparison with the baseline system adopt the previous AV fusion scheme [2].
在先进的ASR技术中,基于音频和视频(AV)信息的语音识别是解决噪声问题的关键挑战之一。AV融合是治疗ASR的有效方法之一。AV融合的主要问题是在哪里以及如何整合两种模式的信息。为了提高AV融合的性能,文献[1]提出了最优可靠性融合(ORF),并将其应用于AV说话人识别。本文将基于ORF的融合应用于基于AV的语音识别中,并对该领域的性能改进进行了评估。ORF的主要思想是在分数基可靠性度量(SCRM)中引入加权因子,以解决SCRM计算中的高估或低估问题。我们的AV语音识别系统是使用SAMSUMG AV数据库实现的韩文数字识别。实验结果表明,与采用先前AV融合方案的基线系统相比,ORF有效降低了42.8%的相对错误率[2]。
{"title":"Performance Improvement of Audio-Visual Speech Recognition with Optimal Reliability Fusion","authors":"M. Tariquzzaman, Song-Min Gyu, Kim Jin Young, Na Seung You, M. A. Rashid","doi":"10.1109/ICICIS.2011.58","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.58","url":null,"abstract":"In state-of-the-art ASR technology, audio and video (AV) information based speech recognition is one of key challenges to cope with noise problem. AV fusion is one of the robust approaches for ASR. The main issues of AV fusion is where and how to integrate the two modalities' information. To enhance the AV fusion performance the paper [1] has proposed the optimum reliability fusion (ORF) and applied the ORF to AV speaker identification. In this paper we adopt the ORF based fusion in AV based speech recognition and evaluate the performance improvement in that domain. The ORF's main idea is to introduce weighting factors in score-base reliability measure (SCRM) for solving the over- or under-estimation problem in SCRM calculation. Our AV speech recognition system is implemented for Korean digit recognition using SAMSUMG AV database. Experimental results show that ORF effectively reduce the relative error rate of 42.8% in comparison with the baseline system adopt the previous AV fusion scheme [2].","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134518747","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}
引用次数: 4
An Approximate Nearest Neighbor Query Algorithm Based on Hilbert Curve 基于Hilbert曲线的近似最近邻查询算法
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.134
Hongbo Xu
Querying k nearest neighbors of query point from data set in high dimensional space is one of important operations in spatial database. The classic nearest neighbor query algorithms are based on R-tree. However, R-tree exits overlapping problem of minimum bounding rectangles. This causes its time complexity exponentially depends on the dimensionality of the space. So, the reduction of the dimensionality is the key point. Hilbert curve fills high dimensional space linearly, divides the space into equal-size grids and maps points lying in grids into linear space. Using the quality of reducing dimensionality of Hilbert curve, the paper presents an approximate k nearest neighbor query algorithm AKNN, and analyzes the quality of k nearest neighbors in theory. According to the experimental result, the execution time of algorithm AKNN is shorter than the nearest neighbor query algorithm based on R-tree in high dimensional space, and the quality of approximate k nearest neighbors satisfies the need of real applications.
在高维空间数据集中查询查询点的k近邻是空间数据库的重要操作之一。经典的最近邻查询算法是基于r树的。然而,r树存在最小边界矩形的重叠问题。这使得它的时间复杂度指数依赖于空间的维度。因此,降维是关键。希尔伯特曲线线性填充高维空间,将空间划分为大小相等的网格,并将网格中的点映射到线性空间中。利用Hilbert曲线降维的性质,提出了一种近似k近邻查询算法AKNN,并从理论上分析了k近邻的质量。实验结果表明,在高维空间中,AKNN算法的执行时间比基于r树的最近邻查询算法短,且近似k个最近邻的质量满足实际应用的需要。
{"title":"An Approximate Nearest Neighbor Query Algorithm Based on Hilbert Curve","authors":"Hongbo Xu","doi":"10.1109/ICICIS.2011.134","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.134","url":null,"abstract":"Querying k nearest neighbors of query point from data set in high dimensional space is one of important operations in spatial database. The classic nearest neighbor query algorithms are based on R-tree. However, R-tree exits overlapping problem of minimum bounding rectangles. This causes its time complexity exponentially depends on the dimensionality of the space. So, the reduction of the dimensionality is the key point. Hilbert curve fills high dimensional space linearly, divides the space into equal-size grids and maps points lying in grids into linear space. Using the quality of reducing dimensionality of Hilbert curve, the paper presents an approximate k nearest neighbor query algorithm AKNN, and analyzes the quality of k nearest neighbors in theory. According to the experimental result, the execution time of algorithm AKNN is shorter than the nearest neighbor query algorithm based on R-tree in high dimensional space, and the quality of approximate k nearest neighbors satisfies the need of real applications.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133084394","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
New DFE with Phase-Locked Loop 新型锁相环DFE
Pub Date : 2011-09-17 DOI: 10.1109/ICICIS.2011.150
Wei Rao, Huijuan Gao, B. Zou, Wen-qun Tan
In [1] the decision feedback equalizer (DFE) based on constant modulus algorithm (CMA) and decision directed (DD) adaptive algorithm was proposed. It has been proved that it is much more effective than the conventional DFEs such as DFE based on CMA and DFE based on DD. However when Doppler frequency shift occurs in the communication channel, which can result in carrier phase rotation, the decisions precision is very low which degrades the performance of these DFEs. Consequently based on the DFE in [1] a new DFE with phase-looked loop (PLL) is proposed. The PLL works in CMA part which can offer correct decision for DD, so the proposed method can obtain lower steady state MSE and compensate phase rotations. The efficiency of the method is proved by computer simulation.
在[1]中,提出了基于常模算法(CMA)和决策导向(DD)自适应算法的决策反馈均衡器(DFE)。实践证明,该算法比基于CMA的DFE和基于DD的DFE更有效,但当通信信道中发生多普勒频移导致载波相位旋转时,决策精度很低,降低了DFE的性能。在此基础上,提出了一种新的带相环的DFE。锁相环工作在CMA部分,可以对DD进行正确的判断,因此该方法可以获得较低的稳态MSE并补偿相位旋转。计算机仿真验证了该方法的有效性。
{"title":"New DFE with Phase-Locked Loop","authors":"Wei Rao, Huijuan Gao, B. Zou, Wen-qun Tan","doi":"10.1109/ICICIS.2011.150","DOIUrl":"https://doi.org/10.1109/ICICIS.2011.150","url":null,"abstract":"In [1] the decision feedback equalizer (DFE) based on constant modulus algorithm (CMA) and decision directed (DD) adaptive algorithm was proposed. It has been proved that it is much more effective than the conventional DFEs such as DFE based on CMA and DFE based on DD. However when Doppler frequency shift occurs in the communication channel, which can result in carrier phase rotation, the decisions precision is very low which degrades the performance of these DFEs. Consequently based on the DFE in [1] a new DFE with phase-looked loop (PLL) is proposed. The PLL works in CMA part which can offer correct decision for DD, so the proposed method can obtain lower steady state MSE and compensate phase rotations. The efficiency of the method is proved by computer simulation.","PeriodicalId":255291,"journal":{"name":"2011 International Conference on Internet Computing and Information Services","volume":"31 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133165551","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
期刊
2011 International Conference on Internet Computing and Information Services
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1