In this paper a novel linear regression model is proposed to mine related queries from query logs. Three types of association relationships between queries are identified and leveraged in our model, which include query session co-occurence, URL-clicked sharing and text similarity. Previous work directly applies part of these relations, which may be largely affected by the noise in query logs, such as the sparsity of click-through data, query-session segmentation errors and noisy clicks. In this work we propose linear regression analysis to identify effective features. In this way, we can effectively deal with the noise issue. The experiments demonstrate that the features identified with linear regression analysis are very effective. Moreover, the performance of our proposed linear regression model outperforms existing methods.
{"title":"Mining Related Queries from Query Logs Based on Linear Regression","authors":"Haijun Zhai, Jin Zhang, Xiaolei Wang, Gang Zhang","doi":"10.1109/FITME.2008.59","DOIUrl":"https://doi.org/10.1109/FITME.2008.59","url":null,"abstract":"In this paper a novel linear regression model is proposed to mine related queries from query logs. Three types of association relationships between queries are identified and leveraged in our model, which include query session co-occurence, URL-clicked sharing and text similarity. Previous work directly applies part of these relations, which may be largely affected by the noise in query logs, such as the sparsity of click-through data, query-session segmentation errors and noisy clicks. In this work we propose linear regression analysis to identify effective features. In this way, we can effectively deal with the noise issue. The experiments demonstrate that the features identified with linear regression analysis are very effective. Moreover, the performance of our proposed linear regression model outperforms existing methods.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"359 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124522662","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}
A method for moving multi-target recognition and tracking in stable scene is presented. Optical flow is used to extract the velocity of pixels, and targets are recognized by combining motion character points obtained by binary discrete wavelet transforms (BDWT). A discrete kalman filter is used to track targets in the follow-up frames; the center and scale of tracking window are updated by a Mexico wavelet kernel function mean shift method which is embedded into the discrete kalman filter framework to stabilize the trajectories of the targets for robust tracking during mutual occlusion. The method is tested on several frame sequences and shown to achieve robust and reliable frame-rate recognition and tracking.
{"title":"Motion Multi-Vehicle Recognition and Tracking in Stable Scene","authors":"T. Gao, Zhengguang Liu, Jun Zhang","doi":"10.1109/FITME.2008.112","DOIUrl":"https://doi.org/10.1109/FITME.2008.112","url":null,"abstract":"A method for moving multi-target recognition and tracking in stable scene is presented. Optical flow is used to extract the velocity of pixels, and targets are recognized by combining motion character points obtained by binary discrete wavelet transforms (BDWT). A discrete kalman filter is used to track targets in the follow-up frames; the center and scale of tracking window are updated by a Mexico wavelet kernel function mean shift method which is embedded into the discrete kalman filter framework to stabilize the trajectories of the targets for robust tracking during mutual occlusion. The method is tested on several frame sequences and shown to achieve robust and reliable frame-rate recognition and tracking.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128828560","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}
Description logics (short for DLs) are very important for the expression of ontologies, which allow reasoning about individuals and concepts. However, DLs can not process the indefinite knowledge existing widely in nature. Based on the cloud model, we present cloud-ALC to deal with the indefinite knowledge, which is the extension of the important description logic ALC. We define its syntax and semantic, study its properties in detail, and propose the techniques to solve the entailment problem. Case analysis proves that cloud-ALC can provide a formal underpinning for the indefiniteness extension of ontology description languages.
{"title":"A New Knowledge Representation Method Based on Ontology and Cloud Theory","authors":"Peiguang Lin, Zhizheng Zhou","doi":"10.1109/FITME.2008.140","DOIUrl":"https://doi.org/10.1109/FITME.2008.140","url":null,"abstract":"Description logics (short for DLs) are very important for the expression of ontologies, which allow reasoning about individuals and concepts. However, DLs can not process the indefinite knowledge existing widely in nature. Based on the cloud model, we present cloud-ALC to deal with the indefinite knowledge, which is the extension of the important description logic ALC. We define its syntax and semantic, study its properties in detail, and propose the techniques to solve the entailment problem. Case analysis proves that cloud-ALC can provide a formal underpinning for the indefiniteness extension of ontology description languages.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"150 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127266769","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}
As the quick increase of urban economy, which is brought about by the development of market economy, China's urban logistics are facing new and higher - requirement challenges. At present, the people pay more and more attention on logistics transport, and the cooperative development which is a new, more reasonable concept of development has been universally recognized around the world. This article studies the organization mode of urban rapid logistics transport systempsilas cooperative development. First, the theoretical connotation of urban rapid logistics transport systempsilas cooperative development was depicted. Second, the article analyses this organization model, which include introducing all parts of urban rapid logistics system, analyzing the existing problems in its development, and how to solve these problems to construct a rapid logistics system of cooperative development. Last, the article studies the realizing route of this organizations mode.
{"title":"The Research on the Organization Mode of Urban Rapid Logistics Transport System's Cooperative Development","authors":"Aiyuan Duan, Jungang Yang, Min Deng","doi":"10.1109/FITME.2008.122","DOIUrl":"https://doi.org/10.1109/FITME.2008.122","url":null,"abstract":"As the quick increase of urban economy, which is brought about by the development of market economy, China's urban logistics are facing new and higher - requirement challenges. At present, the people pay more and more attention on logistics transport, and the cooperative development which is a new, more reasonable concept of development has been universally recognized around the world. This article studies the organization mode of urban rapid logistics transport systempsilas cooperative development. First, the theoretical connotation of urban rapid logistics transport systempsilas cooperative development was depicted. Second, the article analyses this organization model, which include introducing all parts of urban rapid logistics system, analyzing the existing problems in its development, and how to solve these problems to construct a rapid logistics system of cooperative development. Last, the article studies the realizing route of this organizations mode.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122011297","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}
The face recognition is an active subject in the area of computer pattern recognition, which has been a focus in reach for the last couple of decades because of its widely potential applications. A face recognition approach is put forward based on the RBF neural network. Also discussed are the problem of feature of a face image vector, the problem of normalization of the image-size, and the problem of training algorithm of hidden layerpsilas neural nodes. Experiments have been conducted on ORL face database. The results show that compared with BP neural network, the RBF neural network can decrease the error rate, the training time, and the recognition time efficiently.
{"title":"Face Recognition Based on Radial Basis Function Neural Networks","authors":"Weihua Wang","doi":"10.1109/FITME.2008.79","DOIUrl":"https://doi.org/10.1109/FITME.2008.79","url":null,"abstract":"The face recognition is an active subject in the area of computer pattern recognition, which has been a focus in reach for the last couple of decades because of its widely potential applications. A face recognition approach is put forward based on the RBF neural network. Also discussed are the problem of feature of a face image vector, the problem of normalization of the image-size, and the problem of training algorithm of hidden layerpsilas neural nodes. Experiments have been conducted on ORL face database. The results show that compared with BP neural network, the RBF neural network can decrease the error rate, the training time, and the recognition time efficiently.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115938034","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}
The auditory localization technology based on microphone array has wildly used in the field of communication as well as voice processing. Embarking from the basic principle of sound transmission, we deduce the precise near field model of sound transmission. Combining such model with the idea of subspace algorithm, we also put forward a two-dimensional auditory localization algorithm which is suitable in the near field wide band voice signal, by which built the development platform based on the DSP auditory localization hardware system. The result turns out this algorithm has an efficient localization.
{"title":"Study on Auditory Localization System Based on Microphone Array","authors":"H. He, Fengjiu Wang, Dongyan Bai","doi":"10.1109/FITME.2008.39","DOIUrl":"https://doi.org/10.1109/FITME.2008.39","url":null,"abstract":"The auditory localization technology based on microphone array has wildly used in the field of communication as well as voice processing. Embarking from the basic principle of sound transmission, we deduce the precise near field model of sound transmission. Combining such model with the idea of subspace algorithm, we also put forward a two-dimensional auditory localization algorithm which is suitable in the near field wide band voice signal, by which built the development platform based on the DSP auditory localization hardware system. The result turns out this algorithm has an efficient localization.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"47 29","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120928953","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}
Guoai Xu, Yang Gao, Fan-fan Liu, Aiguo Chen, Miao Zhang
As the scale and complexity of software systems increasing, researches have begun to place much more emphasis on the area of software measurement, especially coupling measurement in object-oriented systems. In order to understand the coupling measure, we make use of complex network theory to characterize and describe its macroscopic properties. A novel software coupling network was proposed firstly, then the well-defined weight was further added to the software coupling network and got the software coupling weight network which was used to calculate coupling measure. Some of the coupling measure methods such as coupling between objects (CBO) and message passing coupling (MPC) were calculated based on the general statistical features of software coupling weight network. The examinations show that both of CBO and MPC have the scale-free property. Finally the relationship between them was interpreted.
{"title":"Statistical Analysis of Software Coupling Measurement Based on Complex Networks","authors":"Guoai Xu, Yang Gao, Fan-fan Liu, Aiguo Chen, Miao Zhang","doi":"10.1109/FITME.2008.62","DOIUrl":"https://doi.org/10.1109/FITME.2008.62","url":null,"abstract":"As the scale and complexity of software systems increasing, researches have begun to place much more emphasis on the area of software measurement, especially coupling measurement in object-oriented systems. In order to understand the coupling measure, we make use of complex network theory to characterize and describe its macroscopic properties. A novel software coupling network was proposed firstly, then the well-defined weight was further added to the software coupling network and got the software coupling weight network which was used to calculate coupling measure. Some of the coupling measure methods such as coupling between objects (CBO) and message passing coupling (MPC) were calculated based on the general statistical features of software coupling weight network. The examinations show that both of CBO and MPC have the scale-free property. Finally the relationship between them was interpreted.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"144 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121394306","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}
Copulas have become a powerful tool for modeling the dependence structure of financial data and preferable to the traditional, correlation-based approach. This paper concerns the application of copula functions in VaR and conditional VaR valuation. Some measures of dependence risks are proposed in studying financial portfoliopsilas risk. We investigate the relations between the dependence risk measure and copula function, and find that the choice of copula will effect on the degree of dependence risk in portfolio.
{"title":"Study on Measures of Dependence Conditional Risk Based-on Copulas in Financial Portfolio","authors":"Yi Wen-de, Huang Ai-hua","doi":"10.1109/FITME.2008.131","DOIUrl":"https://doi.org/10.1109/FITME.2008.131","url":null,"abstract":"Copulas have become a powerful tool for modeling the dependence structure of financial data and preferable to the traditional, correlation-based approach. This paper concerns the application of copula functions in VaR and conditional VaR valuation. Some measures of dependence risks are proposed in studying financial portfoliopsilas risk. We investigate the relations between the dependence risk measure and copula function, and find that the choice of copula will effect on the degree of dependence risk in portfolio.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120958710","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}
This paper analyzes the importance and necessity of synergistic work of R&D teams, establishes incentive factors, mutual factors and supporting factors in the process of synergistic work and the structural equation model of relations among various R&D team atmospheres. On the basis of exploratory factor analysis, confirmatory factor analysis and full structure equation model analysis, the paper concludes: (1) there is a positive correlation between incentive factors and atmosphere factors during the process of synergistic work of a R&D team and the growth of R&D team; (2) mutual factors in this process are positively associated with the formation of R&D team atmospheres while correlation between supporting factors and the formation is not so significant, both kinds of factors together forming an indirect relation to this formation.
{"title":"Research on the Synergistic Work Mechanism of R&D Teams","authors":"Huatao Peng, Jixin Xin","doi":"10.1109/FITME.2008.121","DOIUrl":"https://doi.org/10.1109/FITME.2008.121","url":null,"abstract":"This paper analyzes the importance and necessity of synergistic work of R&D teams, establishes incentive factors, mutual factors and supporting factors in the process of synergistic work and the structural equation model of relations among various R&D team atmospheres. On the basis of exploratory factor analysis, confirmatory factor analysis and full structure equation model analysis, the paper concludes: (1) there is a positive correlation between incentive factors and atmosphere factors during the process of synergistic work of a R&D team and the growth of R&D team; (2) mutual factors in this process are positively associated with the formation of R&D team atmospheres while correlation between supporting factors and the formation is not so significant, both kinds of factors together forming an indirect relation to this formation.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"124 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121025870","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}
There are many challenges in building a Web data-space. The first is uncertain schema mapping in data integration. The second is uncertain data. The third is how to select effective deep Web database and how many databases will be selected to answer the user query.In this paper, we develop a Web dataspace system with the help of mass collaboration. Firstly, we propose a Web dataspace system architecture, which is inspired by the concept of data spaces and emphasizes soliciting mass collaboration. Secondly, we discuss the challenges to this approach and propose solutions. Users feedback in our system is divided two types: explicit user feedback and implicit user feedback. We also discuss the questions that will be asked to the users and the user types in our system. In the end, we give the conclusions.
{"title":"A Mass Collaboration Web Dataspace System","authors":"Zhengtao Liu, Yuguang Mao, Jiandong Wan, C. Ye","doi":"10.1109/FITME.2008.47","DOIUrl":"https://doi.org/10.1109/FITME.2008.47","url":null,"abstract":"There are many challenges in building a Web data-space. The first is uncertain schema mapping in data integration. The second is uncertain data. The third is how to select effective deep Web database and how many databases will be selected to answer the user query.In this paper, we develop a Web dataspace system with the help of mass collaboration. Firstly, we propose a Web dataspace system architecture, which is inspired by the concept of data spaces and emphasizes soliciting mass collaboration. Secondly, we discuss the challenges to this approach and propose solutions. Users feedback in our system is divided two types: explicit user feedback and implicit user feedback. We also discuss the questions that will be asked to the users and the user types in our system. In the end, we give the conclusions.","PeriodicalId":218182,"journal":{"name":"2008 International Seminar on Future Information Technology and Management Engineering","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127581936","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
扫码关注我们
求助内容：
应助结果提醒方式：