{"title":"Detection of the Parameters of Hypernasality","authors":"B. Barkana","doi":"10.1109/ITNG.2009.243","DOIUrl":"https://doi.org/10.1109/ITNG.2009.243","url":null,"abstract":"We analyze several hypernasal speech samples and describe methods to quantify the parameters and properties of hypernasality. This can help medical professionals detect and understand the blurred nasal words that patients try to say. In this way, we may avoid unnecessary medical procedures for hypernasal patients.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130280847","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}
Wei Jiang, Binxing Fang, Hongli Zhang, Zhihong Tian, Xin-fang Song
{"title":"Optimal Network Security Strengthening Using Attack-Defense Game Model","authors":"Wei Jiang, Binxing Fang, Hongli Zhang, Zhihong Tian, Xin-fang Song","doi":"10.1109/ITNG.2009.300","DOIUrl":"https://doi.org/10.1109/ITNG.2009.300","url":null,"abstract":"For assessing the security and optimal strengthening of large enterprise networks, this paper proposes a new approach uses configuration information on firewalls and vulnerability information on all network devices to build defense graphs that show the attack and defense strategy. Some models including a defense graph model, attack-defense taxonomy and cost quantitative model, and Attack-Defense Game (ADG) model. We regard the interactions between an attacker and the defender as a two-player, non-cooperative, zero-sum, finite strategic game and formulate the ADG model for the game. An algorithm for optimal strengthening strategy selection based on those models is proposed. Optimal strengthening strategies with minimizing costs are used to defend the attack and strengthening the network in advance. And finally, we perform empirical experiments to verify the effectiveness of the model experiment results indicate that our models and methods are effective and efficient.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129264180","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}
M. Jampour, Maryam Ashourzadeh, M. Yaghoobi, Issa Rashidfarokhi
{"title":"Compressing Images Using Fractal Characteristics by Estimating the Nearest Neighbor","authors":"M. Jampour, Maryam Ashourzadeh, M. Yaghoobi, Issa Rashidfarokhi","doi":"10.1109/ITNG.2009.45","DOIUrl":"https://doi.org/10.1109/ITNG.2009.45","url":null,"abstract":"In this paper a new technique have been introduced for image compression using Fractal characteristics. Compressing images in data storage and transformation is extremely important and valuable, for this reason researchers are always looking for different techniques to resolve this issue. In this paper we have used a combined method of estimating nearest neighbor, and with the help of an adaptive method to evaluate the Range of image sizes, a solution for compressing images is introduced which first the final image is appropriate after it is retrieved, second with respect to the selection of appropriate boundary in the blocks neighborhood along with the selection of sizes for picked blocks, the speed of algorithm execution with respect to the methods introduced, and also the quality has improved respectively. This method has been implemented in the Matlab platform on several images, and the analysis shows the improvement respective to other methods.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126636667","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}
{"title":"Side-Match Vector Quantizers Using Neural Network Based Variance Predictor for Image Coding","authors":"Shuangteng Zhang","doi":"10.1109/ITNG.2009.213","DOIUrl":"https://doi.org/10.1109/ITNG.2009.213","url":null,"abstract":"Side-match vector quantizer reduces bit-rates in image coding through exploiting the correlations of neighboring vectors. This paper presents a new side-match vector quantization method for image coding using a neural network-based variance predictor. In this method, the master codebook used for generating the state codebooks in side-match vector quantization is sorted according to the variances of the codewords. Unlike the regular side-match vector quantization which side-matches all of the codewords in the master codebook to select codewords to construct the state codebooks, the proposed method side-matches subsets of the codewords in the master codebook, selected based on the variance of the current vector being encoded. The variance of the current vector is predicted by a feed-forward three-layered neural network. Experimental results demonstrate that in terms of PSNR (Peak Signal-to-Noise Ratio) of the reconstructed images, the proposed method significantly outperforms the regular side-match vector quantizer, especially at lower coding bit-rates.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126907218","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}
{"title":"Supporting Live Student Projects: Lessons Learned from the Small Project Support Center at Radford University","authors":"Jeff Pittges, Joe D. Chase, T. L. Lewis","doi":"10.1109/ITNG.2009.307","DOIUrl":"https://doi.org/10.1109/ITNG.2009.307","url":null,"abstract":"Live projects are enabling a new generation of software engineering education by engaging students in software development projects that inject realism into the students' coursework. The educational benefits of incorporating live projects to solve real problems for real clients are well documented, but the challenges of supporting the students, clients, and deliverables are largely unaddressed. Radford University created the Small Project Support Center to meet these challenges and facilitate additional learning opportunities that students gain by working on live projects. This paper presents our experiences with a 360-degree view of the center, the operational challenges, and the many benefits that the center provides. The paper concludes with a summary of lessons learned and our plans to enhance and sustain the Small Project Support Center.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123240754","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}
{"title":"Optimum Power Allocation for Distributed Antenna Systems with Large-scale Fading-only Feedback","authors":"Dongho Lim, Kwonhue Choi, Huaping Liu","doi":"10.1109/ITNG.2009.309","DOIUrl":"https://doi.org/10.1109/ITNG.2009.309","url":null,"abstract":"We propose an optimum power allocation scheme for distributed antenna systems (DAS) in time-varying Rayleigh and Ricean fading channels. In the conventional power allocation schemes for DAS, channel state information (CSI) for feedback includes the fast small-scale fading. This causes two practical problems. First, tracking fast fading requires considerable extra bandwidth and processing, which becomes even larger as the number of the distributed antennas increases. Secondly, there is non-negligible power control latency due to the high Doppler of small-scale fading and the feedback loop delay. In this paper, we consider a DAS system which determines the transmission power at each distributed base stations (antennas) only based on the slowly varying large-scale fading excluding the fast small-scale fading and we derive the optimum power allocation (PA) rule for minimum BER under total power constraint. In case of even small variation in fast fading during feedback loop delay, the conventional optimum PA scheme, which includes fast small-scale fading in CSI feedback, degrades significantly and the proposed scheme achieves much lower bit error rates. Even in the case with no latency, the proposed scheme loses only about 1dB SNR compared to the optimum scheme, which includes fast fading feedback. Finally, though the proposed power allocation formula is derived assuming Rayleigh fading, we show that it can be employed to Ricean fading channels with a small line-of-sight (LOS) component with a negligible degradation.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126458786","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}
{"title":"Time-Based Cache Management for Video-on-Demand in P2P Environment","authors":"Y. Gui, G. Kim, H. Choi","doi":"10.1109/ITNG.2009.200","DOIUrl":"https://doi.org/10.1109/ITNG.2009.200","url":null,"abstract":"Peer-to-Peer (P2P) networks risen as a promising approach to provide large-scale VOD services over the Internet for their potential scalability. Since videos are typically large in volume and require high communication bandwidth for delivery, many peers are unwilling to cache them in whole for serving others. In this paper, we propose a new time-based cache management on peers and a peer clustering technique for better peer management of resource sharing. Simulation results show the performance advantage of our new scheme.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126466341","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}
{"title":"A Secure Content-Based Publish/Subscribe Middleware","authors":"A. Chaabane, M. Jmaiel","doi":"10.1109/ITNG.2009.339","DOIUrl":"https://doi.org/10.1109/ITNG.2009.339","url":null,"abstract":"Content-based publish/subscribe (CBPS) system is a wide-area communication infrastructure. It facilitates the dissemination of notifications from publishers to interested consumers through an event notification service. More specifically, the event notification service can be asked to apply a filter to the contents of event notifications. The issue of confidentiality is that the plain texts of events should be kept private from the infrastructure to counter against eavesdropping and that the infrastructure must remain able to make correct routing decisions efficiently. This paper presents a solution that allows confidentiality in a CBPS infrastructure without decreasing its performances such as efficiency, expressivity and scalability. This solution is based on smart cards as trusted devices. In this research work, we implemented it on one of the most popular CBPS systems: SIENA.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126074508","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}
P. B. Andersen, B. Poulsen, C. Træholt, J. Østergaard
{"title":"Using Service Oriented Architecture in a Generic Virtual Power Plant","authors":"P. B. Andersen, B. Poulsen, C. Træholt, J. Østergaard","doi":"10.1109/ITNG.2009.192","DOIUrl":"https://doi.org/10.1109/ITNG.2009.192","url":null,"abstract":"The purpose of this paper is to find and describe a suitable software framework that can be used to help implement the concept of a Generic Virtual Power Plant in the future power system. The Generic Virtual Power Plant concept, along with the utilization of distributed energy resources, has many interesting properties that can influence the future shape of power markets. The concept holds many promises including cheaper power to the consumer, a more flexible and responsive power production and the support of a more environment-friendly development. In order to realize a software solution supporting the Generic Virtual Power Plant, an array of different software design principles, patterns and architectures must be applied. Especially Service Oriented Architecture (SOA) can aid in implementing the Generic Virtual Power Plant. An analysis of the Nordic power market has been carried out in order to identify potential issues and barriers, henceforth mentioned as challenges, connected with the introduction of the Generic Virtual Power Plant concept.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121231594","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}
{"title":"A Trend Analysis of the Question Answering Domain","authors":"Mohan John Blooma, A. Chua, D. Goh, Chu Keong Lee","doi":"10.1109/ITNG.2009.96","DOIUrl":"https://doi.org/10.1109/ITNG.2009.96","url":null,"abstract":"We present a trend analysis of the question answering (QA) domain. Using bibliometric mapping, we sketched the boundary of the domain by uncovering the topics central to and peripheral to QA research in the new millennium. This paper visualizes the evolution of concepts in the QA domain by studying the dynamics of the QA research during the periods 2000 – 2003 and 2004 – 2007. It was found that question classification, answer extraction, information retrieval, user interface, performance evaluation, web, & natural language were the main topics in current QA research.","PeriodicalId":347761,"journal":{"name":"2009 Sixth International Conference on Information Technology: New Generations","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121707614","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}