Pub Date : 2011-06-30DOI: 10.3745/KIPSTD.2011.18D.3.197
Sang-hak Lee, Jungmee Yun
Set-top Box which receives broadcasting signal and delivers it to display device such as TV usually doesn`t have low-power mode, standby power mode. On the other side, most consumer electronics support standby power mode. The main reasons come from technical barriers and operational stability. Set-top box normally consumes 80~90% power of active mode even though turning off. This is much higher compared to other consumer electronics which consume less than 1W in standby power mode. However, most developed countries including Korea are enforcing the regulations which enhance energy efficiency of set-top box. This paper describes design and development of low-power set-top box. Key technologies are SoC supporting low-power mode, system hardware and software operating in separated power mode, and middleware managing the power with broadcasting system. Finally, we show energy saving expectation through development and proliferation.
{"title":"Study on Improving Energy-Efficiency of Set-top Box","authors":"Sang-hak Lee, Jungmee Yun","doi":"10.3745/KIPSTD.2011.18D.3.197","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.3.197","url":null,"abstract":"Set-top Box which receives broadcasting signal and delivers it to display device such as TV usually doesn`t have low-power mode, standby power mode. On the other side, most consumer electronics support standby power mode. The main reasons come from technical barriers and operational stability. Set-top box normally consumes 80~90% power of active mode even though turning off. This is much higher compared to other consumer electronics which consume less than 1W in standby power mode. However, most developed countries including Korea are enforcing the regulations which enhance energy efficiency of set-top box. This paper describes design and development of low-power set-top box. Key technologies are SoC supporting low-power mode, system hardware and software operating in separated power mode, and middleware managing the power with broadcasting system. Finally, we show energy saving expectation through development and proliferation.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120904986","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 : 2011-06-30DOI: 10.3745/KIPSTD.2011.18D.3.157
Sungho Kim, Hongchan Roh, D. Lee, Sanghyun Park
Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree`s insertion performance.
{"title":"AS B-tree: A study on the enhancement of the insertion performance of B-tree on SSD","authors":"Sungho Kim, Hongchan Roh, D. Lee, Sanghyun Park","doi":"10.3745/KIPSTD.2011.18D.3.157","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.3.157","url":null,"abstract":"Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree`s insertion performance.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123706026","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 : 2011-04-30DOI: 10.3745/KIPSTD.2011.18D.2.111
Sungjin Park, Daeho Kim, Min-Young Son, Keunhyuk Yeom
These days RFID application has been developed rapidly. It has been applied to many business areas such as logistics and supply chains. The Electronic Product Code (EPC) Network Architecture, an open global standard, is proposed by EPCglobal for developing RFID enabled systems. People who want to obtain the product information which are master information and event information have to apply with EPC Network Architecture. However, EPCIS which has master information and event information has to be accessed base on each EPC. Therefore, there is lots of duplicate accessing to EPCIS because RFID application has to access the same EPCIS over again which makes all performance down in EPC Network. This paper proposes how to reduce access times to EPCIS using EPC grouping based on EPCIS address. We build EPC Network environment to experiment about performance of RFID application system and we prove the improvement of EPC Network. Our result shows the reducing the EPCIS communication time by maximum 99 percentages.
{"title":"The method of grouping query based on EPCIS to improve the RFID application performance in EPC Network","authors":"Sungjin Park, Daeho Kim, Min-Young Son, Keunhyuk Yeom","doi":"10.3745/KIPSTD.2011.18D.2.111","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.2.111","url":null,"abstract":"These days RFID application has been developed rapidly. It has been applied to many business areas such as logistics and supply chains. The Electronic Product Code (EPC) Network Architecture, an open global standard, is proposed by EPCglobal for developing RFID enabled systems. People who want to obtain the product information which are master information and event information have to apply with EPC Network Architecture. However, EPCIS which has master information and event information has to be accessed base on each EPC. Therefore, there is lots of duplicate accessing to EPCIS because RFID application has to access the same EPCIS over again which makes all performance down in EPC Network. This paper proposes how to reduce access times to EPCIS using EPC grouping based on EPCIS address. We build EPC Network environment to experiment about performance of RFID application system and we prove the improvement of EPC Network. Our result shows the reducing the EPCIS communication time by maximum 99 percentages.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127179586","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 : 2011-04-30DOI: 10.3745/KIPSTD.2011.18D.2.089
Chihyun Park, Jaegyoon Ahn, Youngmi Yoon, Sanghyun Park
The CNV (Copy Number Variation) which is one of the genetic structural variations in human genome is closely related with the function of gene. In particular, the genome-wide association studies for genetic diseased persons have been researched. However, there have been few studies which infer the genetic function of CNV with normal human. In this paper, we propose the analysis method to reveal the functional relationship between common CNV and genes without considering their genomic loci. To achieve that, we propose the data integration method for heterogeneity biological data and novel measurement which can calculate the correlation between common CNV and genes. To verify the significance of proposed method, we has experimented several verification tests with GO database. The result showed that the novel measurement had enough significance compared with random test and the proposed method could systematically produce the candidates of genetic function which have strong correlation with common CNV.
{"title":"Genome-Wide Association Study between Copy Number Variation and Trans-Gene Expression by Protein-Protein Interaction-Network","authors":"Chihyun Park, Jaegyoon Ahn, Youngmi Yoon, Sanghyun Park","doi":"10.3745/KIPSTD.2011.18D.2.089","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.2.089","url":null,"abstract":"The CNV (Copy Number Variation) which is one of the genetic structural variations in human genome is closely related with the function of gene. In particular, the genome-wide association studies for genetic diseased persons have been researched. However, there have been few studies which infer the genetic function of CNV with normal human. In this paper, we propose the analysis method to reveal the functional relationship between common CNV and genes without considering their genomic loci. To achieve that, we propose the data integration method for heterogeneity biological data and novel measurement which can calculate the correlation between common CNV and genes. To verify the significance of proposed method, we has experimented several verification tests with GO database. The result showed that the novel measurement had enough significance compared with random test and the proposed method could systematically produce the candidates of genetic function which have strong correlation with common CNV.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124152687","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 : 2011-04-30DOI: 10.3745/KIPSTD.2011.18D.2.081
Jinhyun Kim, Kyuseok Shim
Sequential pattern mining that determines frequent patterns appearing in a given set of sequences is an important data mining problem with broad applications. For example, sequential pattern mining can find the web access patterns, customer`s purchase patterns and DNA sequences related with specific disease. In this paper, we develop the sequential pattern mining algorithms using MapReduce framework. Our algorithms distribute input data to several machines and find frequent sequential patterns in parallel. With synthetic data sets, we did a comprehensive performance study with varying various parameters. Our experimental results show that linear speed up can be achieved through our algorithms with increasing the number of used machines.
{"title":"Sequential Pattern Mining with Optimization Calling MapReduce Function on MapReduce Framework","authors":"Jinhyun Kim, Kyuseok Shim","doi":"10.3745/KIPSTD.2011.18D.2.081","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.2.081","url":null,"abstract":"Sequential pattern mining that determines frequent patterns appearing in a given set of sequences is an important data mining problem with broad applications. For example, sequential pattern mining can find the web access patterns, customer`s purchase patterns and DNA sequences related with specific disease. In this paper, we develop the sequential pattern mining algorithms using MapReduce framework. Our algorithms distribute input data to several machines and find frequent sequential patterns in parallel. With synthetic data sets, we did a comprehensive performance study with varying various parameters. Our experimental results show that linear speed up can be achieved through our algorithms with increasing the number of used machines.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122416740","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 : 2011-04-30DOI: 10.3745/KIPSTD.2011.18D.2.123
Haeryoung Park, Haeyoung Yoo
However a mobile application has limited compatibility to other platforms and device. So a mobile application should be rebuilt as particular restrictions of platforms or mobile phones when the mobile application is reused for other platforms. However a mobile application has limited compatibility to other platforms and device. So a mobile application should be rebuilt as particular restrictions of platforms or mobile phones when the mobile application is reused for other platforms. This paper ascertains problems when a mobile application is transplanted for reusing into other platforms, and suggests to evaluation systems of portability`s quality that we can check the portability convenience of the existing mobile application. As we confirm its grade that shows convenience of suggested portability, we are able to check problems issued when a mobile application implants to other platforms. Then it is expected that we can check capability of rebuilding and endeavor rate. Also if the method will be considered at the first step of designing a mobile application, it will be the best way to develop the better mobile application that we can easily implant many other mobile platforms.
{"title":"Portability Evaluation Technique of Application for Heterogeneous Mobile Platform","authors":"Haeryoung Park, Haeyoung Yoo","doi":"10.3745/KIPSTD.2011.18D.2.123","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.2.123","url":null,"abstract":"However a mobile application has limited compatibility to other platforms and device. So a mobile application should be rebuilt as particular restrictions of platforms or mobile phones when the mobile application is reused for other platforms. However a mobile application has limited compatibility to other platforms and device. So a mobile application should be rebuilt as particular restrictions of platforms or mobile phones when the mobile application is reused for other platforms. This paper ascertains problems when a mobile application is transplanted for reusing into other platforms, and suggests to evaluation systems of portability`s quality that we can check the portability convenience of the existing mobile application. As we confirm its grade that shows convenience of suggested portability, we are able to check problems issued when a mobile application implants to other platforms. Then it is expected that we can check capability of rebuilding and endeavor rate. Also if the method will be considered at the first step of designing a mobile application, it will be the best way to develop the better mobile application that we can easily implant many other mobile platforms.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128337547","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 : 2011-04-30DOI: 10.3745/KIPSTD.2011.18D.2.143
Hyung-Suk Lho, Yunsik Kim, W. Cho
In this paper developed a wearable activity device and algorithm which can be converted into the real-time activity and monitoring by acquiring sensor row data to be occurred when a person is walking by using a tri-axial accelerometer. Test was proceeded at various step speeds such as slow walking, walking, fast walking, slow running, running and fast running, etc. for 36 minutes in accordance with the test protocol after wearing a metabolic test system(K4B2), Actical and the device developed in this study at the treadmill with 59 participants of subjects as its target. To measure the activity of human body, a regression equation estimating the Energy Expenditure(EE) was drawn by using data output from the accelerometer and information on subjects. As a result of experiment, the recognition rate of algorithm being proposed was shown the activity conversion algorithm was enhanced by 1.61% better than the performance of Actical.
{"title":"Real-Time Activity Monitoring Algorithm Using A Tri-axial Accelerometer","authors":"Hyung-Suk Lho, Yunsik Kim, W. Cho","doi":"10.3745/KIPSTD.2011.18D.2.143","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.2.143","url":null,"abstract":"In this paper developed a wearable activity device and algorithm which can be converted into the real-time activity and monitoring by acquiring sensor row data to be occurred when a person is walking by using a tri-axial accelerometer. Test was proceeded at various step speeds such as slow walking, walking, fast walking, slow running, running and fast running, etc. for 36 minutes in accordance with the test protocol after wearing a metabolic test system(K4B2), Actical and the device developed in this study at the treadmill with 59 participants of subjects as its target. To measure the activity of human body, a regression equation estimating the Energy Expenditure(EE) was drawn by using data output from the accelerometer and information on subjects. As a result of experiment, the recognition rate of algorithm being proposed was shown the activity conversion algorithm was enhanced by 1.61% better than the performance of Actical.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125748797","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 : 2011-04-30DOI: 10.3745/KIPSTD.2011.18D.2.101
Won-Seok Hwang, Young-Joo Do, Sang-Wook Kim
According to the increasing use of blogs, a huge number of posts have appeared in a blogosphere. This causes web surfers to face difficulty in finding the quality posts in their search results. As a result, post ranking algorithms are required to help web serfers to effectively search for quality posts. Although there have been various algorithms proposed for web-page ranking, they are not directly applicable to post ranking since posts have their unique features different from those of web pages. In this paper, we propose post ranking algorithms that exploit actions performed by bloggers. We also evaluate the effectiveness of post ranking algorithms by performing extensive experiments using real-world blog data.
{"title":"Post Ranking in a Blogosphere with a Scrap Function: Algorithms and Performance Evaluation","authors":"Won-Seok Hwang, Young-Joo Do, Sang-Wook Kim","doi":"10.3745/KIPSTD.2011.18D.2.101","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.2.101","url":null,"abstract":"According to the increasing use of blogs, a huge number of posts have appeared in a blogosphere. This causes web surfers to face difficulty in finding the quality posts in their search results. As a result, post ranking algorithms are required to help web serfers to effectively search for quality posts. Although there have been various algorithms proposed for web-page ranking, they are not directly applicable to post ranking since posts have their unique features different from those of web pages. In this paper, we propose post ranking algorithms that exploit actions performed by bloggers. We also evaluate the effectiveness of post ranking algorithms by performing extensive experiments using real-world blog data.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129086664","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 : 2011-04-30DOI: 10.3745/KIPSTD.2011.18D.2.133
Yong-Ju Lee
To ensure the successful employment of semantic web services, it is essential that they rely on the use of high quality ontologies. However, building such ontologies is difficult and costly, thus hampering web service deployment. This study automatically builds ontologies from WSDL documents and their underlying semantics, and presents discovery methods of similar web service operations using these ontologies. The key ingredient is techniques that cluster parameters in the collection of web services into semantically meaningful concepts, and capture the hierarchical relationships between the words contained in the tag. We implement an operation retrieval system for web services. This system finds out a ranked set of similar operations using a novel similarity measurement method, and selects the most optimal operation which satisfies user`s requirements. It can be directly used for the web services composition.
{"title":"Discovery Methods of Similar Web Service Operations by Learning Ontologies","authors":"Yong-Ju Lee","doi":"10.3745/KIPSTD.2011.18D.2.133","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.2.133","url":null,"abstract":"To ensure the successful employment of semantic web services, it is essential that they rely on the use of high quality ontologies. However, building such ontologies is difficult and costly, thus hampering web service deployment. This study automatically builds ontologies from WSDL documents and their underlying semantics, and presents discovery methods of similar web service operations using these ontologies. The key ingredient is techniques that cluster parameters in the collection of web services into semantically meaningful concepts, and capture the hierarchical relationships between the words contained in the tag. We implement an operation retrieval system for web services. This system finds out a ranked set of similar operations using a novel similarity measurement method, and selects the most optimal operation which satisfies user`s requirements. It can be directly used for the web services composition.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114522320","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 : 2011-04-01DOI: 10.3745/KIPSTD.2011.18D.4.309
Dae-Young Choi
Handling fuzzy query in voice search on smartphones is one of the most difficult problems. It is mainly derived from the complexity and the degree of freedom of natural language. To reduce the complexity and the degree of freedom of fuzzy query in voice search on smartphones, attribute-driven approach for fuzzy query is proposed. In addition, a new page ranking algorithm based on the values of attributes for handling fuzzy query is proposed. It provides a smartphone user with location-based personalized page ranking based on user`s search intentions. It is a further step toward location-based personalized web search for smartphone users. In this paper, we design a prototype model for handling fuzzy query in voice search on smartphones and show the experimental results of the proposed approach compared to existing smartphones.
{"title":"A Prototype Model for Handling Fuzzy Query in Voice Search on Smartphones","authors":"Dae-Young Choi","doi":"10.3745/KIPSTD.2011.18D.4.309","DOIUrl":"https://doi.org/10.3745/KIPSTD.2011.18D.4.309","url":null,"abstract":"Handling fuzzy query in voice search on smartphones is one of the most difficult problems. It is mainly derived from the complexity and the degree of freedom of natural language. To reduce the complexity and the degree of freedom of fuzzy query in voice search on smartphones, attribute-driven approach for fuzzy query is proposed. In addition, a new page ranking algorithm based on the values of attributes for handling fuzzy query is proposed. It provides a smartphone user with location-based personalized page ranking based on user`s search intentions. It is a further step toward location-based personalized web search for smartphone users. In this paper, we design a prototype model for handling fuzzy query in voice search on smartphones and show the experimental results of the proposed approach compared to existing smartphones.","PeriodicalId":348746,"journal":{"name":"The Kips Transactions:partd","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122704922","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
扫码关注我们
求助内容：
应助结果提醒方式：