Pub Date : 2009-12-15DOI: 10.1109/IIT.2009.5413401
Fatima Ali Al Zeyoudi, Fatima Saeed Al Qaydi, Safa Salem Al Rashedi, I. Barhumi
This project aimed to design and simulate a speech processor for cochlear implant with optimum number of channels to achieve maximum Arabic speech intelligibility.
本课题旨在设计并模拟具有最佳通道数的人工耳蜗语音处理器，以达到最大的阿拉伯语语音清晰度。
{"title":"Design and simulation of a speech processor for cochlear implant based on Arabic language","authors":"Fatima Ali Al Zeyoudi, Fatima Saeed Al Qaydi, Safa Salem Al Rashedi, I. Barhumi","doi":"10.1109/IIT.2009.5413401","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413401","url":null,"abstract":"This project aimed to design and simulate a speech processor for cochlear implant with optimum number of channels to achieve maximum Arabic speech intelligibility.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"139 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114656913","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413779
A. Douar, S. Harous, M. Djoudi, D. Mechta
This work is in line with the framework of the development of a 3D interactive environment to make it easy for university students to do their distant practical works (PW). This environment allows several learners to share a 3D work space‥ Therefore this is a multi users environment, distributed over a network and uses the virtual reality which allows the performance of many activities. We propose in this paper the description of a PW generic classroom which has all the necessary virtual objects to accomplish the different experiments. The interaction with this work is done through a java Applet, shared between learners, that allows the manipulation of these objects to attain the expected objective of the experiment.
{"title":"An interactive 3D distributed environment for distance practical works","authors":"A. Douar, S. Harous, M. Djoudi, D. Mechta","doi":"10.1109/IIT.2009.5413779","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413779","url":null,"abstract":"This work is in line with the framework of the development of a 3D interactive environment to make it easy for university students to do their distant practical works (PW). This environment allows several learners to share a 3D work space‥ Therefore this is a multi users environment, distributed over a network and uses the virtual reality which allows the performance of many activities. We propose in this paper the description of a PW generic classroom which has all the necessary virtual objects to accomplish the different experiments. The interaction with this work is done through a java Applet, shared between learners, that allows the manipulation of these objects to attain the expected objective of the experiment.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"517 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116229542","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413374
Hamed Modaghegh, H. Khosravi R., M. Akbarzadeh-T.
As information technology and multimedia products become more and more readily available, copyright and other related legal topics become more and more significant. Embedding copyright information as hidden data into the multimedia product-named watermarking- is one of the methods to protect owner rights. Two main concepts in watermarking are imperceptibility and robustness of the watermark. A tradeoff between these two features exists, which can be introduced as an optimization problem. Genetic Algorithm (GA) is applied to solve this optimization problem. In this paper, a new adjustable watermarking method based on singular value decomposition is presented so that SVD parameters are adjusted by using the GA considering image complexity and attack resistance. The proposed watermarking method is also an adjustable solution, so that by changing fitness function (cost function), watermarking method can be converted to each of robust, fragile, or semi-fragile types. Simulation results show that the proposed method has better results from the case where watermarking parameters are adjusted by the user empirically.
{"title":"A new adjustable blind watermarking based on GA and SVD","authors":"Hamed Modaghegh, H. Khosravi R., M. Akbarzadeh-T.","doi":"10.1109/IIT.2009.5413374","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413374","url":null,"abstract":"As information technology and multimedia products become more and more readily available, copyright and other related legal topics become more and more significant. Embedding copyright information as hidden data into the multimedia product-named watermarking- is one of the methods to protect owner rights. Two main concepts in watermarking are imperceptibility and robustness of the watermark. A tradeoff between these two features exists, which can be introduced as an optimization problem. Genetic Algorithm (GA) is applied to solve this optimization problem. In this paper, a new adjustable watermarking method based on singular value decomposition is presented so that SVD parameters are adjusted by using the GA considering image complexity and attack resistance. The proposed watermarking method is also an adjustable solution, so that by changing fitness function (cost function), watermarking method can be converted to each of robust, fragile, or semi-fragile types. Simulation results show that the proposed method has better results from the case where watermarking parameters are adjusted by the user empirically.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128716986","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413770
Sungrae Kim, K. Kim, Jaejong Baek, Joo-Seok Song
Recently, many researchers have investigated the Voice over IP (VoIP) service over Wireless Local Area Networks (WLANs). One of the important challenges is to reduce the handoff delay in WLANs. Especially, the channel scan delay, which takes the largest portion of the WLAN handoff delay, is too long to support the delay-sensitive VoIP service. We propose a selective channel scan based on the pre-collected channel information of the neighboring access points (APs) to reduce the channel scan time. Mobile Stations (MSs) collect the channel information of neighboring Access Points (APs) when the VoIP is not used. When the VoIP service is used, MSs perform the selective channel scan mechanism based on the collected channel information. We use the handoff trigger based on the Inter-Arrival Time (IAT) of VoIP packets instead of Received Signal Strength Indication (RSSI). We evaluated the performance of the proposed scheme through computer simulations. The simulation results show that our scheme reduces the handoff delay enough to support the VoIP service over WLANs.
{"title":"A WLAN handoff scheme based on selective channel scan using pre-collected AP information for VoIP application","authors":"Sungrae Kim, K. Kim, Jaejong Baek, Joo-Seok Song","doi":"10.1109/IIT.2009.5413770","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413770","url":null,"abstract":"Recently, many researchers have investigated the Voice over IP (VoIP) service over Wireless Local Area Networks (WLANs). One of the important challenges is to reduce the handoff delay in WLANs. Especially, the channel scan delay, which takes the largest portion of the WLAN handoff delay, is too long to support the delay-sensitive VoIP service. We propose a selective channel scan based on the pre-collected channel information of the neighboring access points (APs) to reduce the channel scan time. Mobile Stations (MSs) collect the channel information of neighboring Access Points (APs) when the VoIP is not used. When the VoIP service is used, MSs perform the selective channel scan mechanism based on the collected channel information. We use the handoff trigger based on the Inter-Arrival Time (IAT) of VoIP packets instead of Received Signal Strength Indication (RSSI). We evaluated the performance of the proposed scheme through computer simulations. The simulation results show that our scheme reduces the handoff delay enough to support the VoIP service over WLANs.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129648875","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413786
A. Asaduzzaman, F. Sibai
Conceptual modeling is drawing more attention among researchers from many organizations and different disciplines including high-performance low-power multicore systems. As the popularity and demand grow, more processing power is required by the mission critical systems. Several chip vendors have developed teraflop computing systems (like Intel 80-Core Research Chip). Even though IBM offers the Roadrunner supercomputer, NSF and other research organization are looking for more powerful petascale computer system. In a petascale computer system, thousands to millions of processing cores are expected to work together using petabytes of memory to produce the expected performance. A high performance system like Roadrunner requires a very sophisticated power management system. No wonder, such a gigantic system costs millions of dollars. Conceptual modeling offers the opportunity to conduct research on complex and expensive systems in an inexpensive way. In this work, we address some key conceptual modeling issues and discuss a methodology to develop conceptual models of petascale computer systems. Important features of this methodology include data acquisition to improve accuracy by capturing the important details about the system under consideration and (system-to-) model abstraction to make the modeling manageable without eliminating any significant characteristics of the target system. We believe our findings help develop sound conceptual models of complex high performance petascale computer systems.
{"title":"Conceptual modeling of petascale computer systems","authors":"A. Asaduzzaman, F. Sibai","doi":"10.1109/IIT.2009.5413786","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413786","url":null,"abstract":"Conceptual modeling is drawing more attention among researchers from many organizations and different disciplines including high-performance low-power multicore systems. As the popularity and demand grow, more processing power is required by the mission critical systems. Several chip vendors have developed teraflop computing systems (like Intel 80-Core Research Chip). Even though IBM offers the Roadrunner supercomputer, NSF and other research organization are looking for more powerful petascale computer system. In a petascale computer system, thousands to millions of processing cores are expected to work together using petabytes of memory to produce the expected performance. A high performance system like Roadrunner requires a very sophisticated power management system. No wonder, such a gigantic system costs millions of dollars. Conceptual modeling offers the opportunity to conduct research on complex and expensive systems in an inexpensive way. In this work, we address some key conceptual modeling issues and discuss a methodology to develop conceptual models of petascale computer systems. Important features of this methodology include data acquisition to improve accuracy by capturing the important details about the system under consideration and (system-to-) model abstraction to make the modeling manageable without eliminating any significant characteristics of the target system. We believe our findings help develop sound conceptual models of complex high performance petascale computer systems.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"37 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123507869","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413356
M. A. Rigi, S. Mohammadi, Morteza Delgir
Auction refers to arbitrary resource allocation problems with self-motivated participants: Auctioneer and bidders. Double auction is a kind of auctions with multiple buyers and sellers who trade multiple goods. In double auction each trader submits his bid (price and quantity) to the auctioneer. Then the auctioneer collects all of the bids and tries to assign some buyers to some sellers according to their preferences in a way that the whole of the market reaches its maximum utility, this is called a mechanism. In a traditional double auction market each bid is a linear utility function, but in real world, behavior of buyers and sellers is not linear, therefore we propose a fuzzy non-linear utility function for traders because traders (like all humans) are thinking and making decisions in a fuzzy way. Our aim is to design an optimal double auction mechanism. To find optimum in this non-linear optimization problem, we use particle swarm optimization (PSO).
{"title":"Designing fuzzy utility-based double auctions using particle swarm optimization algorithm","authors":"M. A. Rigi, S. Mohammadi, Morteza Delgir","doi":"10.1109/IIT.2009.5413356","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413356","url":null,"abstract":"Auction refers to arbitrary resource allocation problems with self-motivated participants: Auctioneer and bidders. Double auction is a kind of auctions with multiple buyers and sellers who trade multiple goods. In double auction each trader submits his bid (price and quantity) to the auctioneer. Then the auctioneer collects all of the bids and tries to assign some buyers to some sellers according to their preferences in a way that the whole of the market reaches its maximum utility, this is called a mechanism. In a traditional double auction market each bid is a linear utility function, but in real world, behavior of buyers and sellers is not linear, therefore we propose a fuzzy non-linear utility function for traders because traders (like all humans) are thinking and making decisions in a fuzzy way. Our aim is to design an optimal double auction mechanism. To find optimum in this non-linear optimization problem, we use particle swarm optimization (PSO).","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131381579","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413790
B. Ziani, Y. Ouinten
Mining maximal frequent itemsets is an important issue in many data mining applications. In our thesis work on selection and tuning of indices in data werhouses, we have proposed a strategy based on mining maximal frequent itemsets in order to determine a set of candidate indices from a given workload. In a first step we have to select an algorithm, for mining maximal frequent itemsets, to implement. Experimental results in the repository of the workshops on Frequent Itemset Mining Implementations (http://fimi.cs.helsinki.fi/), shows that FPMAX has the best performance. Therefore, we have selected it for our own implementation in java language. FPMAX is an extension of FP-Growth method for mining maximal frequent itemsets only. We tested our implementation on two benchmark databases MUSHROOM and RETAIL. We compare our results with the best implementations available in the repository mentioned earlier. Our implementation showed good performances compared with the others. However, the comparison of response times published in FIMI 2004, for the chosen implementations, could not be replicated.
{"title":"Mining maximal frequent itemsets: A java implementation of FPMAX algorithm","authors":"B. Ziani, Y. Ouinten","doi":"10.1109/IIT.2009.5413790","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413790","url":null,"abstract":"Mining maximal frequent itemsets is an important issue in many data mining applications. In our thesis work on selection and tuning of indices in data werhouses, we have proposed a strategy based on mining maximal frequent itemsets in order to determine a set of candidate indices from a given workload. In a first step we have to select an algorithm, for mining maximal frequent itemsets, to implement. Experimental results in the repository of the workshops on Frequent Itemset Mining Implementations (http://fimi.cs.helsinki.fi/), shows that FPMAX has the best performance. Therefore, we have selected it for our own implementation in java language. FPMAX is an extension of FP-Growth method for mining maximal frequent itemsets only. We tested our implementation on two benchmark databases MUSHROOM and RETAIL. We compare our results with the best implementations available in the repository mentioned earlier. Our implementation showed good performances compared with the others. However, the comparison of response times published in FIMI 2004, for the chosen implementations, could not be replicated.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131947446","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413633
N. Yaagoubi, M. Boulmalf, H. Harroud, T. Ait-Idir, A. Karmouch
In this paper, we investigate the effect of interference on the performance of IEEE 802.11g wireless networks. We study different network configurations and evaluate their corresponding throughput performances with the aid of the ns2 simulator. We also provide recommendations for network deployment in order to minimize interference and improve the quality of service.
{"title":"Power management in wireless LANs: The case of IEEE 802.11 g","authors":"N. Yaagoubi, M. Boulmalf, H. Harroud, T. Ait-Idir, A. Karmouch","doi":"10.1109/IIT.2009.5413633","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413633","url":null,"abstract":"In this paper, we investigate the effect of interference on the performance of IEEE 802.11g wireless networks. We study different network configurations and evaluate their corresponding throughput performances with the aid of the ns2 simulator. We also provide recommendations for network deployment in order to minimize interference and improve the quality of service.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132036714","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413772
Abdulrahman AAl Abdulsalam
This paper presents a tool that can be used to simulate a system of concurrent processes which communicate through shared variables. Mechanisms for defining nondeterminism, atomic actions and process synchronization are supported. In addition, it includes a prototype for verifying basic safety properties such as mutual exclusion and absence of deadlocks using model checking technique. The aim is to provide teachers and students with a simple framework where concurrency concepts can be examined and grasped easily in an abstract and pure environment away from the complexities and sophistication of conventional programming environments.
{"title":"Using model checking tool for teaching concurrent programming concepts","authors":"Abdulrahman AAl Abdulsalam","doi":"10.1109/IIT.2009.5413772","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413772","url":null,"abstract":"This paper presents a tool that can be used to simulate a system of concurrent processes which communicate through shared variables. Mechanisms for defining nondeterminism, atomic actions and process synchronization are supported. In addition, it includes a prototype for verifying basic safety properties such as mutual exclusion and absence of deadlocks using model checking technique. The aim is to provide teachers and students with a simple framework where concurrency concepts can be examined and grasped easily in an abstract and pure environment away from the complexities and sophistication of conventional programming environments.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127591008","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 : 2009-12-15DOI: 10.1109/IIT.2009.5413782
Mahsa Mohaghegh, A. Sarrafzadeh
Globalization has made machine translation an attractive area of research and development. As technology opens up e-commerce opportunities, companies must overcome language barriers to reach new potential customers and partners. Web2.0 with tools like Google Translate makes the web more accessible. Statistical Machine Translation has been used for translation between many language pairs contributing to its popularity in recent years. It has however not been used for the English/Persian pair. This paper presents the first such attempt and describes the problems faced in creating a corpus and building a base line system. Our experience with the construction of a parallel corpus during this study and the problems encountered especially with the process of alignment are discussed. The prototype constructed and its evaluation is described and results analyzed. In the final part of the paper, conclusions are drawn and work planned for the future is discussed.
{"title":"An analysis of the effect of training data variation in English-Persian Statistical Machine Translation","authors":"Mahsa Mohaghegh, A. Sarrafzadeh","doi":"10.1109/IIT.2009.5413782","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413782","url":null,"abstract":"Globalization has made machine translation an attractive area of research and development. As technology opens up e-commerce opportunities, companies must overcome language barriers to reach new potential customers and partners. Web2.0 with tools like Google Translate makes the web more accessible. Statistical Machine Translation has been used for translation between many language pairs contributing to its popularity in recent years. It has however not been used for the English/Persian pair. This paper presents the first such attempt and describes the problems faced in creating a corpus and building a base line system. Our experience with the construction of a parallel corpus during this study and the problems encountered especially with the process of alignment are discussed. The prototype constructed and its evaluation is described and results analyzed. In the final part of the paper, conclusions are drawn and work planned for the future is discussed.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127627076","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
扫码关注我们
求助内容：
应助结果提醒方式：