The channel response of data communication over a multipath wireless channel is often required to be known at the receiver. An accurate estimation of channel can greatly increase the throughput of the whole systems. Training-based methods are commonly used to learn the channel response. But the traditional channel estimation doesn't take the characteristics of wireless channel into account. On the other hand, Compressive sensing has recently gained much attention in various areas. In communication, compressive sensing is also been used to estimate the channel response in wireless orthogonal frequency division multiplexing (OFDM) systems. In this paper, we consider the channel estimation of frequency selective wireless channels which is the opposite of time selective wireless. An optimization for channel estimation based on compressed channel sensing is proposed in this paper. The optimization considers the character of channel. We use the delay of the channel to optimize the algorithm of Orthogonal Matching Pursuit. We present the LS and CS estimators and a method for modifications compromising of performance. The bit error number and the normalized mean square error for a 16-QAM system are presented by means of simulation results. Our simulation results demonstrate a significant reduction of the performance of the bite error number and the normalized mean square error. So that, the optimization for channel estimation based on compressed channel sensing achieves the same bit error number with the reduction of pilots by comparing the traditional channel estimation, then, the modified method also increase spectral efficiency.
{"title":"An Optimization for Channel Estimation Based on Compressed Channel Sensing","authors":"Si Zhang, Jian Kang, Y. Song, N. Wang","doi":"10.1109/SNPD.2012.128","DOIUrl":"https://doi.org/10.1109/SNPD.2012.128","url":null,"abstract":"The channel response of data communication over a multipath wireless channel is often required to be known at the receiver. An accurate estimation of channel can greatly increase the throughput of the whole systems. Training-based methods are commonly used to learn the channel response. But the traditional channel estimation doesn't take the characteristics of wireless channel into account. On the other hand, Compressive sensing has recently gained much attention in various areas. In communication, compressive sensing is also been used to estimate the channel response in wireless orthogonal frequency division multiplexing (OFDM) systems. In this paper, we consider the channel estimation of frequency selective wireless channels which is the opposite of time selective wireless. An optimization for channel estimation based on compressed channel sensing is proposed in this paper. The optimization considers the character of channel. We use the delay of the channel to optimize the algorithm of Orthogonal Matching Pursuit. We present the LS and CS estimators and a method for modifications compromising of performance. The bit error number and the normalized mean square error for a 16-QAM system are presented by means of simulation results. Our simulation results demonstrate a significant reduction of the performance of the bite error number and the normalized mean square error. So that, the optimization for channel estimation based on compressed channel sensing achieves the same bit error number with the reduction of pilots by comparing the traditional channel estimation, then, the modified method also increase spectral efficiency.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127659061","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 focuses on real option theory and on its applications in 4G LTE mobile network. The objective of this paper are (1) to introduce real option theory and to discuss its applicability as a decision support tools, (2) to exemplify some real options present in 4G LTE communication of MNO markets, and (3) to apply real option approach based on the proposed pricing model to the selected case to demonstrate the power of option pricing models as a decision support tool in 4G LTE mobile network. The application of real option approach is valuation of investment opportunities when the future capacity prices are uncertain but the investment costs are unknown. The optimal pricing of capacity tariffs is identified under stochastic capacity prices. The case demonstrates how real option models can be used to derive decision rules to problems faced by several telecom parties.
{"title":"Pricing Model and Real Options in 4G LTE Mobile Network","authors":"W. Premchaiswadi, S. Pattanavichai","doi":"10.1109/SNPD.2012.59","DOIUrl":"https://doi.org/10.1109/SNPD.2012.59","url":null,"abstract":"This paper focuses on real option theory and on its applications in 4G LTE mobile network. The objective of this paper are (1) to introduce real option theory and to discuss its applicability as a decision support tools, (2) to exemplify some real options present in 4G LTE communication of MNO markets, and (3) to apply real option approach based on the proposed pricing model to the selected case to demonstrate the power of option pricing models as a decision support tool in 4G LTE mobile network. The application of real option approach is valuation of investment opportunities when the future capacity prices are uncertain but the investment costs are unknown. The optimal pricing of capacity tariffs is identified under stochastic capacity prices. The case demonstrates how real option models can be used to derive decision rules to problems faced by several telecom parties.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131785101","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 principles of the immune system and Monoclonal were introduced briefly. Focused on the text expressed by the vector space model which was processed by semantic computation, an adaptive polyclonal clustering algorithm was proposed. Firstly, the calculation method was defined for the affinity between antibody and antigens and the affinity of antibodies, the genetic operation factors were designed, replacement, inverse, colonel, crossover, mutation, death, concatenate and clustering included, secondly, the process was given, and lastly, the clustering processes and analysis were done based on the text sets in a corpora. The experiments verifies that the algorithm proposed above can get the rational clustering number and have a better correct identification rate and recall rate.
{"title":"Immune Network Based Text Clustering Algorithm","authors":"Ma Li, Yang Lin, Lin Bai, Rongxi Wang","doi":"10.1109/SNPD.2012.111","DOIUrl":"https://doi.org/10.1109/SNPD.2012.111","url":null,"abstract":"The principles of the immune system and Monoclonal were introduced briefly. Focused on the text expressed by the vector space model which was processed by semantic computation, an adaptive polyclonal clustering algorithm was proposed. Firstly, the calculation method was defined for the affinity between antibody and antigens and the affinity of antibodies, the genetic operation factors were designed, replacement, inverse, colonel, crossover, mutation, death, concatenate and clustering included, secondly, the process was given, and lastly, the clustering processes and analysis were done based on the text sets in a corpora. The experiments verifies that the algorithm proposed above can get the rational clustering number and have a better correct identification rate and recall rate.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124123669","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}
Nowadays, database systems are one of the most popular and essential software programs in computer systems. Many computers are installed a database system and users maybe want to use these database systems as one system. The multi-database system is one of the solutions to this request. The multi-database system is a kind of the distributed database system. It is a cluster of independent database systems. As the distributed database system, the multi-database system has some problems. One of these problems is data migration among individual database systems in the multi-database system. Many reorganization techniques for distributed database systems already proposed. But these techniques are not always adaptive to the data migration in the multidatabase system. In order to overcome this problem, we adapt the incremental scheme to the data migration in the multidatabase system. In our new scheme, a large data migration operation is divided into small ones, and other operations are inserted between them. The experimental result proves the improvement of the turn-around times of other operations.
{"title":"Incremental Data Migration for Multi-database Systems","authors":"K. Higuchi, Wenqian Wang, T. Tsuji","doi":"10.1109/SNPD.2012.51","DOIUrl":"https://doi.org/10.1109/SNPD.2012.51","url":null,"abstract":"Nowadays, database systems are one of the most popular and essential software programs in computer systems. Many computers are installed a database system and users maybe want to use these database systems as one system. The multi-database system is one of the solutions to this request. The multi-database system is a kind of the distributed database system. It is a cluster of independent database systems. As the distributed database system, the multi-database system has some problems. One of these problems is data migration among individual database systems in the multi-database system. Many reorganization techniques for distributed database systems already proposed. But these techniques are not always adaptive to the data migration in the multidatabase system. In order to overcome this problem, we adapt the incremental scheme to the data migration in the multidatabase system. In our new scheme, a large data migration operation is divided into small ones, and other operations are inserted between them. The experimental result proves the improvement of the turn-around times of other operations.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114519749","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. Inoue, Ryouhei Nagahata, Yuuta Ishii, Masaya Dobashi, Rei Kaku, M. Iwashita
The rapid growth of the mobile Internet market has caused various changes in the mobile business. The purpose of this study is to construct mobile-user behavior models which are effective to plan business strategies in the mobile Internet market. We analyzed mobile Internet-access behavior based on the original survey data collected from mobile Internet users. This paper showed the results in the following points: mobile-Internet usages patterns, purchase behavior in the Mobile-Commerce market, etc. We clarified the basic characteristics of mobile Internet users.
{"title":"Mobile Internet-Access Behavior Analysis","authors":"A. Inoue, Ryouhei Nagahata, Yuuta Ishii, Masaya Dobashi, Rei Kaku, M. Iwashita","doi":"10.1109/SNPD.2012.71","DOIUrl":"https://doi.org/10.1109/SNPD.2012.71","url":null,"abstract":"The rapid growth of the mobile Internet market has caused various changes in the mobile business. The purpose of this study is to construct mobile-user behavior models which are effective to plan business strategies in the mobile Internet market. We analyzed mobile Internet-access behavior based on the original survey data collected from mobile Internet users. This paper showed the results in the following points: mobile-Internet usages patterns, purchase behavior in the Mobile-Commerce market, etc. We clarified the basic characteristics of mobile Internet users.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116335317","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}
In this research, we develop a real-time fluid simulator, which uses smoothed particle hydrodynamics (SPH), for virtual environments including 3-dimensional fluid. SPH is a type of particle method and easy to control computational time by reducing or increasing the number of particles, however, it is difficult to change the number of particles while maintaining the same volume of fluid and the stability during a simulation. In this paper, we propose a new method to automatically adjust the number of particles, mass, radius in kernel functions and gains of density feedback for a real-time process while maintaining the stability. This paper also proposes to apply the method to a system using parallel processing with multi-thread programming. Finally, simulations are performed to estimate the effectiveness of the proposed method for parallel processing.
{"title":"Adaptive Parameter Adjustment of a Real-Time SPH Simulation for Interactive Virtual Environments: Application to Parallel Processing","authors":"M. Kawai, Yohei Suzuki","doi":"10.1109/SNPD.2012.82","DOIUrl":"https://doi.org/10.1109/SNPD.2012.82","url":null,"abstract":"In this research, we develop a real-time fluid simulator, which uses smoothed particle hydrodynamics (SPH), for virtual environments including 3-dimensional fluid. SPH is a type of particle method and easy to control computational time by reducing or increasing the number of particles, however, it is difficult to change the number of particles while maintaining the same volume of fluid and the stability during a simulation. In this paper, we propose a new method to automatically adjust the number of particles, mass, radius in kernel functions and gains of density feedback for a real-time process while maintaining the stability. This paper also proposes to apply the method to a system using parallel processing with multi-thread programming. Finally, simulations are performed to estimate the effectiveness of the proposed method for parallel processing.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128400178","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 shows a model-based testing technique using a PN (place/transition net) that is a kind of Petri net in order to improve the reliability of concurrent software. In this technique, a PN representing the expected behavior of software under test is used for generating a special tree called an ECT (extended coverability tree), which gives test cases that satisfy a criterion called ECT-N transition coverage. This technique focuses on the number of resources that behave concurrently in order to concentrate test engineers' effort on an important aspect of concurrent behavior by using a realistic number of test cases. This paper includes basic notions, a test case generation algorithm, and an example for considering the effectiveness of this technique.
{"title":"Test Case Generation Technique Based on Extended Coverability Trees","authors":"Tomohiko Takagi, Z. Furukawa","doi":"10.1109/SNPD.2012.58","DOIUrl":"https://doi.org/10.1109/SNPD.2012.58","url":null,"abstract":"This paper shows a model-based testing technique using a PN (place/transition net) that is a kind of Petri net in order to improve the reliability of concurrent software. In this technique, a PN representing the expected behavior of software under test is used for generating a special tree called an ECT (extended coverability tree), which gives test cases that satisfy a criterion called ECT-N transition coverage. This technique focuses on the number of resources that behave concurrently in order to concentrate test engineers' effort on an important aspect of concurrent behavior by using a realistic number of test cases. This paper includes basic notions, a test case generation algorithm, and an example for considering the effectiveness of this technique.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129941999","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}
Systematic thought (such as Christian theology) has primarily been investigated using literature-based approaches, with texts that are usually more abstract and subjective in nature than scientific papers. However, as systematic ideas and thought influence all areas of human activity and thinking, the application of scientific methodologies such as bibliometrics, NLP (Natural Language Processing), and other information technologies may provide a more objective understanding of systematic thought. This paper introduces four methods of quantitative analysis for interpretation of the Bible in a scientific manner. The methods are citation analysis for interpreter's texts, vocabulary analysis for translations, variant text analysis for canonical texts, and evaluation method for rhetorical structure.
{"title":"Introducing Scientific Methods for the Interpretation of the Bible: Quantitative Analysis of Christian Documents","authors":"H. Murai","doi":"10.1109/SNPD.2012.18","DOIUrl":"https://doi.org/10.1109/SNPD.2012.18","url":null,"abstract":"Systematic thought (such as Christian theology) has primarily been investigated using literature-based approaches, with texts that are usually more abstract and subjective in nature than scientific papers. However, as systematic ideas and thought influence all areas of human activity and thinking, the application of scientific methodologies such as bibliometrics, NLP (Natural Language Processing), and other information technologies may provide a more objective understanding of systematic thought. This paper introduces four methods of quantitative analysis for interpretation of the Bible in a scientific manner. The methods are citation analysis for interpreter's texts, vocabulary analysis for translations, variant text analysis for canonical texts, and evaluation method for rhetorical structure.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126475135","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}
Based on three OpenMP program models, the technology of parallel region reconstruction is mainly discussed to implement the improved loop level OpenMP program. Parallel region reconstruction is to expand and merge parallel regions. When reconstructing parallel regions, there are two things should be noted, that is to keep data attribute and data dependence before and after optimization. Experimental results of PPOPP show that after parallel region reconstruction, the improvement of lu1k is maximally up to 28.1%, and the improvement of erle64 is the lowest about 1.87%. The reason of lu1k's highest improvement is that a parallel region is expanded outside a loop of 1024 iterations, which reduce 1023 times of the parallel region creation. The experimental results indicate the technology of parallel region reconstruction reduces the creation of parallel region, and improves the performance of the OpenMP program.
{"title":"Implement Improved Loop Level OpenMP Program Based on Parallel Region Reconstruction","authors":"Shi'an Hu, Aixian Dong, Hongtu Ma","doi":"10.1109/SNPD.2012.24","DOIUrl":"https://doi.org/10.1109/SNPD.2012.24","url":null,"abstract":"Based on three OpenMP program models, the technology of parallel region reconstruction is mainly discussed to implement the improved loop level OpenMP program. Parallel region reconstruction is to expand and merge parallel regions. When reconstructing parallel regions, there are two things should be noted, that is to keep data attribute and data dependence before and after optimization. Experimental results of PPOPP show that after parallel region reconstruction, the improvement of lu1k is maximally up to 28.1%, and the improvement of erle64 is the lowest about 1.87%. The reason of lu1k's highest improvement is that a parallel region is expanded outside a loop of 1024 iterations, which reduce 1023 times of the parallel region creation. The experimental results indicate the technology of parallel region reconstruction reduces the creation of parallel region, and improves the performance of the OpenMP program.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126796617","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}
S. Nakano, A. Inoue, K. Otsuka, T. Kurosawa, M. Iwashita, K. Nishimatsu
The Japanese mobile phone market is in the matured stage. Under competitive conditions, the most important objective of a mobile-carrier is to increase the market share. The aim of this research is to understand mobile-carrier choice behavior under assumed market conditions. We propose the binary choice models of which alternatives are change to other carrier or not. Three models are constructed based on survey data for three mobile-carriers: NTT docomo, au by KDDI, and Soft Bank. Each model has eight factors expressed by the satisfaction levels for mobile-service characteristics. It is shown that important decision-making factors vary from carrier to carrier. It implies that a mobile carrier should keep and improve the satisfaction level of the important factors in order to increase the market share.
日本手机市场正处于成熟阶段。在竞争条件下，移动运营商最重要的目标是增加市场份额。本研究的目的是了解假定市场条件下的移动运营商选择行为。提出了备选方案是否更换其他载体的二元选择模型。基于NTT docomo、au by KDDI和softbank三家移动运营商的调查数据，构建了三个模型。每个模型有8个因素，用对移动服务特征的满意程度来表示。研究表明，不同载体的重要决策因素是不同的。这意味着移动运营商要想增加市场份额，就必须保持和提高重要因素的满意度。
{"title":"Mobile-Carrier Churning Behavior Modeling Based on Customer Satisfaction","authors":"S. Nakano, A. Inoue, K. Otsuka, T. Kurosawa, M. Iwashita, K. Nishimatsu","doi":"10.1109/SNPD.2012.70","DOIUrl":"https://doi.org/10.1109/SNPD.2012.70","url":null,"abstract":"The Japanese mobile phone market is in the matured stage. Under competitive conditions, the most important objective of a mobile-carrier is to increase the market share. The aim of this research is to understand mobile-carrier choice behavior under assumed market conditions. We propose the binary choice models of which alternatives are change to other carrier or not. Three models are constructed based on survey data for three mobile-carriers: NTT docomo, au by KDDI, and Soft Bank. Each model has eight factors expressed by the satisfaction levels for mobile-service characteristics. It is shown that important decision-making factors vary from carrier to carrier. It implies that a mobile carrier should keep and improve the satisfaction level of the important factors in order to increase the market share.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122644187","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
扫码关注我们
求助内容：
应助结果提醒方式：