Web services are the best way to solve cross-platform, cross-language, loosely coupled distributed systems in web environment at present. But because of some non-functional attributes such as authorization, security, transaction, logging, etc. in web services, the adaptation and reuse of web services are decreased. It is difficult to maintain and extend SOA-based applications which are composed of them. In order to solve the above problems, Aspect-Oriented Programming is introduced to web services in this paper, the non-functional attributes are separated and realized as aspectual services and the web services and aspectual services are weaved at SOAP level to construct the final system when the application runs.
{"title":"Research on SOA-Based Applications Based on AOP and Web Services","authors":"Jingjun Zhang, F. Meng, Guangyuan Liu","doi":"10.1109/ICCEE.2008.107","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.107","url":null,"abstract":"Web services are the best way to solve cross-platform, cross-language, loosely coupled distributed systems in web environment at present. But because of some non-functional attributes such as authorization, security, transaction, logging, etc. in web services, the adaptation and reuse of web services are decreased. It is difficult to maintain and extend SOA-based applications which are composed of them. In order to solve the above problems, Aspect-Oriented Programming is introduced to web services in this paper, the non-functional attributes are separated and realized as aspectual services and the web services and aspectual services are weaved at SOAP level to construct the final system when the application runs.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"18 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129087977","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 paper, a highly effective system for Thai speech recognition is proposed. The speech recognizer for so-called speaker-independent is created by using Continuous Density Hidden Markov Model (CDHMM). In the acoustic level, the models trained for both speaker genders, and for each separate gender are investigated and tested in terms of accuracy. Experimental evaluation shows that with the acoustic models combination, the accuracy could be improved considerably in the acoustic level. The acoustic combination can support spoken utterances from both genders and still provide the high accuracy simultaneously. Interestingly, when using the acoustic models combination, the syllable accuracy of 89.84% is achieved with 4.53% improvement over using the conventional acoustic models trained for both genders.
{"title":"Boosting Thai Syllable Speech Recognition Using Acoustic Models Combination","authors":"S. Tangwongsan, R. Phoophuangpairoj","doi":"10.1109/ICCEE.2008.130","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.130","url":null,"abstract":"In this paper, a highly effective system for Thai speech recognition is proposed. The speech recognizer for so-called speaker-independent is created by using Continuous Density Hidden Markov Model (CDHMM). In the acoustic level, the models trained for both speaker genders, and for each separate gender are investigated and tested in terms of accuracy. Experimental evaluation shows that with the acoustic models combination, the accuracy could be improved considerably in the acoustic level. The acoustic combination can support spoken utterances from both genders and still provide the high accuracy simultaneously. Interestingly, when using the acoustic models combination, the syllable accuracy of 89.84% is achieved with 4.53% improvement over using the conventional acoustic models trained for both genders.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124753023","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 paper, an optimized cell planning for path loss reduction has been proposed. A 10 by 10 Km square block is considered as traffic required area (TRA) which consists of number of base stations (BSs) and mobile stations (MSs). The optimization algorithm: Tabu search, is used to optimize the position of base stations in such a way that the path loss (or reciprocal signal strength) between the BS and MS is minimum (or maximum). In order to accommodate large number of users, algorithm adds new BSs and also drops existing BSs. Then, the propagation path loss from a base station to a receiver point was calculated according to Okumura-Hata and Walfisch-Ikegami model. These are empirical models based on the measurement data. In order to improve the efficiency of the Tabu search, intensification through dynamic Tabu list and Tabu time have been used. Results obtained showed that proposed algorithm is highly effective. There is a capacity improvement by 14% at 900 MHz and 15% at 1200 MHz and the corresponding reduction in outdoor propagation path loss varies from 1 to 15 dB.
{"title":"Optimized Cell Planning for Path Loss Reduction","authors":"N. Sah","doi":"10.1109/ICCEE.2008.19","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.19","url":null,"abstract":"In this paper, an optimized cell planning for path loss reduction has been proposed. A 10 by 10 Km square block is considered as traffic required area (TRA) which consists of number of base stations (BSs) and mobile stations (MSs). The optimization algorithm: Tabu search, is used to optimize the position of base stations in such a way that the path loss (or reciprocal signal strength) between the BS and MS is minimum (or maximum). In order to accommodate large number of users, algorithm adds new BSs and also drops existing BSs. Then, the propagation path loss from a base station to a receiver point was calculated according to Okumura-Hata and Walfisch-Ikegami model. These are empirical models based on the measurement data. In order to improve the efficiency of the Tabu search, intensification through dynamic Tabu list and Tabu time have been used. Results obtained showed that proposed algorithm is highly effective. There is a capacity improvement by 14% at 900 MHz and 15% at 1200 MHz and the corresponding reduction in outdoor propagation path loss varies from 1 to 15 dB.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123911022","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}
Energy efficiency is a key issue in research area of wireless ad hoc and sensor network. Many wireless applications are inherently broadcasting based and here the energy consumption issue becomes even more pronounced. We have devised a localized deterministic distributed heuristic to incorporate directional antennas Connected Dominating Set (CDS) which ensures connectivity of wireless nodes and minimizes energy consumption for broadcasting. We tested our approach simulating in Network Simulator-2 (NS-2) and showed improved result in terms of energy conservation.
{"title":"Directional Antenna Based Connected Dominating Set Construction for Energy Efficient Broadcasting in Wireless Ad Hoc Network","authors":"A. Iqbal, N. Ahmed, M. Akbar","doi":"10.1109/ICCEE.2008.140","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.140","url":null,"abstract":"Energy efficiency is a key issue in research area of wireless ad hoc and sensor network. Many wireless applications are inherently broadcasting based and here the energy consumption issue becomes even more pronounced. We have devised a localized deterministic distributed heuristic to incorporate directional antennas Connected Dominating Set (CDS) which ensures connectivity of wireless nodes and minimizes energy consumption for broadcasting. We tested our approach simulating in Network Simulator-2 (NS-2) and showed improved result in terms of energy conservation.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"2012 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121461321","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 P2P streaming system, real-time performance is very important for evaluating quality of service, which directly determines the user experience. However, real-time performance is restricted by server bandwidth cost. Based on the proposed data transmitting model, this paper investigates the recursiveness of real-time performance through theoretical analysis, and computes its relationship with server bandwidth cost. The impact of system scale and service capacity of peer is also discussed. Especially, we consider both overlay diameter and the one hop delay in the investigation, hence can obtain more exact results. Our findings are of great importance for the design and deployment of P2P streaming system.
{"title":"Real-Time Performance vs. Server Bandwidth Cost in Peer-to-Peer Streaming System","authors":"Yifeng Lu, Hao Ren, Jinlin Wang","doi":"10.1109/ICCEE.2008.31","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.31","url":null,"abstract":"In P2P streaming system, real-time performance is very important for evaluating quality of service, which directly determines the user experience. However, real-time performance is restricted by server bandwidth cost. Based on the proposed data transmitting model, this paper investigates the recursiveness of real-time performance through theoretical analysis, and computes its relationship with server bandwidth cost. The impact of system scale and service capacity of peer is also discussed. Especially, we consider both overlay diameter and the one hop delay in the investigation, hence can obtain more exact results. Our findings are of great importance for the design and deployment of P2P streaming system.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126334781","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 presents a new method of prediction -- extension classified prediction, it is used to predict monthly average temperature of cities. The historical data of the monthly average temperature of cities and precipitation of cities and sunshine hours of cities are used to establish classified classics field and node field element. The dependent function of material element and extension set are applied to establish prediction model. The prediction results can be obtained by means of classified analysis. Through analyzing and calculating the real data of a certain city, the results show that extension classified prediction is effective in predicting monthly average temperature of cities.
{"title":"Extension Classified Prediction Used in Predicting Monthly Average Temperature of Cities","authors":"Yang Yuanyuan, Zeng Tao, Yu Yongquan","doi":"10.1109/ICCEE.2008.22","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.22","url":null,"abstract":"This paper presents a new method of prediction -- extension classified prediction, it is used to predict monthly average temperature of cities. The historical data of the monthly average temperature of cities and precipitation of cities and sunshine hours of cities are used to establish classified classics field and node field element. The dependent function of material element and extension set are applied to establish prediction model. The prediction results can be obtained by means of classified analysis. Through analyzing and calculating the real data of a certain city, the results show that extension classified prediction is effective in predicting monthly average temperature of cities.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132356697","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 examines and analyzes the impact of correlations that exist in shadow fading between links in multihop cellular networks. Statistical moments of the total interference are derived based on two correlated shadowing models, shadowing model as functions of the spatial loss field and correlated lognormal shadowing. We apply both methods in order to evaluate performance in uplink of multihop CDMA cellular systems. Outage probability is introduced as a QoS parameter. The results show that there is no significant difference between two correlated shadowing models. But, taking into consideration independent shadowing causes an optimistic and unreal performance evaluation which may not useful for deployment of multihop cellular networks in real environments.
{"title":"The Effect of Correlated Link Shadowing on the Performance of Multihop Cellular Networks","authors":"B. Kasiri, M. Naderi, B. Abolhassani","doi":"10.1109/ICCEE.2008.181","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.181","url":null,"abstract":"This paper examines and analyzes the impact of correlations that exist in shadow fading between links in multihop cellular networks. Statistical moments of the total interference are derived based on two correlated shadowing models, shadowing model as functions of the spatial loss field and correlated lognormal shadowing. We apply both methods in order to evaluate performance in uplink of multihop CDMA cellular systems. Outage probability is introduced as a QoS parameter. The results show that there is no significant difference between two correlated shadowing models. But, taking into consideration independent shadowing causes an optimistic and unreal performance evaluation which may not useful for deployment of multihop cellular networks in real environments.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134516343","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}
Among various enhancement methods, dual microphone methods are utilized for their low cost implementation and use of spatial noise reduction. In this paper, we present a double microphone noise reduction method for nearby microphones. Our method is based on a modified coherence based filter which reduces correlated noises using cross spectral subtraction. In our proposed method the amount of noise reduction is controlled in order to achieve an acceptable compromise between residual noise and speech distortion. The performance of the enhancement technique is carried out using PESQ measure. Obtained results confirm the ability of the proposed approach to reduce distortion of signal.
{"title":"Residual Noise Control for Coherence Based Dual Microphone Speech Enhancement","authors":"B. Zamani, M. Rahmani, A. Akbari","doi":"10.1109/ICCEE.2008.56","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.56","url":null,"abstract":"Among various enhancement methods, dual microphone methods are utilized for their low cost implementation and use of spatial noise reduction. In this paper, we present a double microphone noise reduction method for nearby microphones. Our method is based on a modified coherence based filter which reduces correlated noises using cross spectral subtraction. In our proposed method the amount of noise reduction is controlled in order to achieve an acceptable compromise between residual noise and speech distortion. The performance of the enhancement technique is carried out using PESQ measure. Obtained results confirm the ability of the proposed approach to reduce distortion of signal.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131813426","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}
By increasing the pipeline length in processors, the accuracy of the branch predictor unit plays an important role in processors efficiencies. In addition to the accuracy, consuming power is also an essential in portable systems. Therefore, in the processors these days the prediction unit is used to determine the branch destination, while most of these accesses are not necessary. In this paper, a method is proposed to reduce the consuming power in the jump prediction unit. In this proposed method, the non-necessary accesses to BTB are reduced by taking into account this fact that there exists distances between different consecutive branch instructions. This method decides the access to BTB by a constant value and a counter. After an instruction entrance, the BTB is accessed if the counter is zero, and if the instruction is a branch instruction and exists in the BTB the counter is reset. The simulation and experimental results illustrate the suitable performance of the proposed method in comparisons to the other methods. This superiority is for both the execution time and for the consuming power. Also it is more strengthened by increasing the distance.
{"title":"A Novel Approach for Branch Buffer Consuming Power Reduction","authors":"B. Zamani, E. Adeli, H. Gharedaghi, M. Soryani","doi":"10.1109/ICCEE.2008.48","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.48","url":null,"abstract":"By increasing the pipeline length in processors, the accuracy of the branch predictor unit plays an important role in processors efficiencies. In addition to the accuracy, consuming power is also an essential in portable systems. Therefore, in the processors these days the prediction unit is used to determine the branch destination, while most of these accesses are not necessary. In this paper, a method is proposed to reduce the consuming power in the jump prediction unit. In this proposed method, the non-necessary accesses to BTB are reduced by taking into account this fact that there exists distances between different consecutive branch instructions. This method decides the access to BTB by a constant value and a counter. After an instruction entrance, the BTB is accessed if the counter is zero, and if the instruction is a branch instruction and exists in the BTB the counter is reset. The simulation and experimental results illustrate the suitable performance of the proposed method in comparisons to the other methods. This superiority is for both the execution time and for the consuming power. Also it is more strengthened by increasing the distance.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"142 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127555091","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}
Computer supported collaborative learning (CSCL) is a new student-based collaborative learning in the network environment; it is a better learning method. CSCL has become a very broad field of study. Learning contract is a written agreement of student and teacher common planning, designing of the learning activities. Attempts to study the binding of contracts to promote computer supported collaborative learning (CSCL) effective conduct. In this paper, at first exposed the definition of the learning contract and CSCL, then discussed the connotation of them, designed a system of CSCL based on learning contract, including several modules, such as learning contract module, resource module and so on . Then discussed the functional modules of the system in detail.
{"title":"Design of Computer Supported Collaborative Learning System Based on Learning Contract","authors":"Duan Xinyu, Li Min","doi":"10.1109/ICCEE.2008.129","DOIUrl":"https://doi.org/10.1109/ICCEE.2008.129","url":null,"abstract":"Computer supported collaborative learning (CSCL) is a new student-based collaborative learning in the network environment; it is a better learning method. CSCL has become a very broad field of study. Learning contract is a written agreement of student and teacher common planning, designing of the learning activities. Attempts to study the binding of contracts to promote computer supported collaborative learning (CSCL) effective conduct. In this paper, at first exposed the definition of the learning contract and CSCL, then discussed the connotation of them, designed a system of CSCL based on learning contract, including several modules, such as learning contract module, resource module and so on . Then discussed the functional modules of the system in detail.","PeriodicalId":365473,"journal":{"name":"2008 International Conference on Computer and Electrical Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-12-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128955830","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
扫码关注我们
求助内容：
应助结果提醒方式：