Pub Date : 2009-12-15DOI: 10.1109/IIT.2009.5413639
Yuji Wada, J. Sawamoto, Yuta Watanabe, T. Katoh
In this paper, our research objective is to develop a database virtualization technique so that data analysts or other users who apply data mining methods to their jobs can use all ubiquitous databases in the Internet as if they were recognized as a single database, thereby helping to reduce their workloads such as data collection from the databases and data cleansing works. In this study, firstly we examine XML scheme advantages and propose a database virtualization method by which such ubiquitous databases as relational databases, object-oriented databases, and XML databases are useful, as if they all behaved as a single database. Next, we show the method of virtualization of ubiquitous databases can describe ubiquitous database schema in a unified fashion using the XML schema. Moreover, it consists of a high-level concept of distributed database management of the same type and of different types, and also of a location transparency feature.
{"title":"Database virtualization technology in ubiquitous computing","authors":"Yuji Wada, J. Sawamoto, Yuta Watanabe, T. Katoh","doi":"10.1109/IIT.2009.5413639","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413639","url":null,"abstract":"In this paper, our research objective is to develop a database virtualization technique so that data analysts or other users who apply data mining methods to their jobs can use all ubiquitous databases in the Internet as if they were recognized as a single database, thereby helping to reduce their workloads such as data collection from the databases and data cleansing works. In this study, firstly we examine XML scheme advantages and propose a database virtualization method by which such ubiquitous databases as relational databases, object-oriented databases, and XML databases are useful, as if they all behaved as a single database. Next, we show the method of virtualization of ubiquitous databases can describe ubiquitous database schema in a unified fashion using the XML schema. Moreover, it consists of a high-level concept of distributed database management of the same type and of different types, and also of a location transparency feature.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"13 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":"131277792","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.5413761
S. Lazarova-Molnar
All state-space based simulation methods are doomed by the phenomenon of state-space explosion. The condition occurs when the simulation becomes memory-infeasible as simulation time advances due to the large number of states in the model. However, state-space explosion is not something that depends solely on the number of discrete states of the model as typically observed. While this is correct and completely sufficient for Markovian models, it is certainly not a sufficient criterion when models involve non-exponential probability distribution functions. In this paper we discuss the phenomenon of state-space explosion in terms of accurate complexity prediction for a general class of models. Its early diagnosis is especially significant in the case of proxel-based simulation, as it can lead towards hybridization of the method by employing discrete phase approximations for the critical states and transitions. This can significantly reduce the computational complexity of the simulation.
{"title":"True state-space complexity prediction: By the proxel-based simulation method","authors":"S. Lazarova-Molnar","doi":"10.1109/IIT.2009.5413761","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413761","url":null,"abstract":"All state-space based simulation methods are doomed by the phenomenon of state-space explosion. The condition occurs when the simulation becomes memory-infeasible as simulation time advances due to the large number of states in the model. However, state-space explosion is not something that depends solely on the number of discrete states of the model as typically observed. While this is correct and completely sufficient for Markovian models, it is certainly not a sufficient criterion when models involve non-exponential probability distribution functions. In this paper we discuss the phenomenon of state-space explosion in terms of accurate complexity prediction for a general class of models. Its early diagnosis is especially significant in the case of proxel-based simulation, as it can lead towards hybridization of the method by employing discrete phase approximations for the critical states and transitions. This can significantly reduce the computational complexity of the simulation.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"17 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":"131256229","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.5413637
Claude Turner
This article provides a brief review of steganography, steganalysis and wireless sensor networks (WSNs). It also presents a computational framework for steganography in WSN. The technique uses the concept of redundancy and distributed computing to add robustness to the steganographic embedding and extraction algorithms.
{"title":"A steganographic computational paradigm for wireless sensor networks","authors":"Claude Turner","doi":"10.1109/IIT.2009.5413637","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413637","url":null,"abstract":"This article provides a brief review of steganography, steganalysis and wireless sensor networks (WSNs). It also presents a computational framework for steganography in WSN. The technique uses the concept of redundancy and distributed computing to add robustness to the steganographic embedding and extraction algorithms.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"86 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":"130651129","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.5413774
Kosuke Numa, Tatsuo Sugimoto, Masako Miyata, Kiyoko Toriumi, J. Abe, Yuri Tanaka, S. Niida, K. Hori
We propose a system for collecting and connecting people's stories. In order to help encourage participants to engage their “expression mode,” we employed mobile phones for video capture, as opposed to traditional video cameras. As part of our work, we held a workshop in an art festival. In the workshop, facilitators capture participants' stories using mobile phones. Applying a question-and-answer game format, each video has connections to other videos. Our system shows these connections on a large screen such that participants can see an entire network of stories and add their own to it. We show the results of our experiments and conclude that our proposed workshop could successfully collect people's stories and connect them.
{"title":"Using common devices as collaborative tools for collecting and connecting people's stories","authors":"Kosuke Numa, Tatsuo Sugimoto, Masako Miyata, Kiyoko Toriumi, J. Abe, Yuri Tanaka, S. Niida, K. Hori","doi":"10.1109/IIT.2009.5413774","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413774","url":null,"abstract":"We propose a system for collecting and connecting people's stories. In order to help encourage participants to engage their “expression mode,” we employed mobile phones for video capture, as opposed to traditional video cameras. As part of our work, we held a workshop in an art festival. In the workshop, facilitators capture participants' stories using mobile phones. Applying a question-and-answer game format, each video has connections to other videos. Our system shows these connections on a large screen such that participants can see an entire network of stories and add their own to it. We show the results of our experiments and conclude that our proposed workshop could successfully collect people's stories and connect them.","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":"129666392","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.5413369
A. H. Mohammad, M. E. Woodward
Localized Quality of Service (QoS) routing has been recently proposed for supporting the requirements of multimedia applications and satisfying QoS constraints. Localized algorithms avoid the problems associated with the maintenance of global network state by using statistics of flow blocking probabilities. Using local information for routing avoids the overheads of global information with other nodes. However, localized QoS routing algorithms perform routing decision based on information updated from path request to path request. This paper proposes to tackle a combined localized routing and admission control in order to avoid congestion. We introduce a Congestion Avoidance Routing algorithm (CAR) in localized QoS routing which make a decision of routing in each connection request using an admission control to route traffic away from congestion. Simulations of various network topologies are used to illustrate the performance of the CAR. We compare the performance of the CAR algorithm against the Credit Based Routing (CBR) algorithm and the Quality Based Routing (QBR) under various ranges of traffic loads.
{"title":"Localized QoS routing and admission control: Performance evaluation","authors":"A. H. Mohammad, M. E. Woodward","doi":"10.1109/IIT.2009.5413369","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413369","url":null,"abstract":"Localized Quality of Service (QoS) routing has been recently proposed for supporting the requirements of multimedia applications and satisfying QoS constraints. Localized algorithms avoid the problems associated with the maintenance of global network state by using statistics of flow blocking probabilities. Using local information for routing avoids the overheads of global information with other nodes. However, localized QoS routing algorithms perform routing decision based on information updated from path request to path request. This paper proposes to tackle a combined localized routing and admission control in order to avoid congestion. We introduce a Congestion Avoidance Routing algorithm (CAR) in localized QoS routing which make a decision of routing in each connection request using an admission control to route traffic away from congestion. Simulations of various network topologies are used to illustrate the performance of the CAR. We compare the performance of the CAR algorithm against the Credit Based Routing (CBR) algorithm and the Quality Based Routing (QBR) under various ranges of traffic loads.","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":"124363676","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.5413792
R. Zantout, Mazen Jrab, L. Hamandi, F. Sibai
Fleet management is an important topic in research and development nowadays. Companies, security and emergency forces need to keep track of their trucks and cars and know where a vehicle is at a moment in time, and when, where and for how long a vehicle stopped.
{"title":"Fleet management automation using the global positioning system","authors":"R. Zantout, Mazen Jrab, L. Hamandi, F. Sibai","doi":"10.1109/IIT.2009.5413792","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413792","url":null,"abstract":"Fleet management is an important topic in research and development nowadays. Companies, security and emergency forces need to keep track of their trucks and cars and know where a vehicle is at a moment in time, and when, where and for how long a vehicle stopped.","PeriodicalId":239829,"journal":{"name":"2009 International Conference on Innovations in Information Technology (IIT)","volume":"8 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":"115318138","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.5413763
Piers R. J. Campbell, H. Fathulla, Faheem Ahmed
Classification algorithms have found high levels of application in a range of domains. One of the most important classification algorithms that is currently in wide use Classification And Regression Trees (CART), which yields accurate and consistent results in most multiple domains. A significant failing of CART and other similar algorithms is their inability to handle imprecision. This inability to handle the “grey areas” makes these algorithms less applicable to a range of domains such as Medicine and Finance. A well-regarded method for handling such imprecision is Fuzzy Logic, and in this paper a novel algorithm that combines CART and Fuzzy Logic is presented. Following the description of the implementation the experimental results presented which have been achieved through the use of the proposed FuzzyCART algorithm demonstrate an increased level of classification accuracy for medical data when compared to classical CART.
分类算法在许多领域都有很高的应用。分类回归树(classification And Regression Trees, CART)是目前广泛使用的一种重要的分类算法，它能在大多数多领域产生准确一致的结果。CART和其他类似算法的一个重大缺陷是它们无法处理不精确。由于无法处理“灰色地带”，这些算法不太适用于医学和金融等一系列领域。模糊逻辑是一种很好的处理这种不精确的方法，本文提出了一种结合CART和模糊逻辑的新算法。在描述实现之后，通过使用所提出的FuzzyCART算法实现的实验结果表明，与经典CART相比，医疗数据的分类精度提高了。
{"title":"FuzzyCART: A novel Fuzzy Logic based Classification & Regression Trees Algorithm","authors":"Piers R. J. Campbell, H. Fathulla, Faheem Ahmed","doi":"10.1109/IIT.2009.5413763","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413763","url":null,"abstract":"Classification algorithms have found high levels of application in a range of domains. One of the most important classification algorithms that is currently in wide use Classification And Regression Trees (CART), which yields accurate and consistent results in most multiple domains. A significant failing of CART and other similar algorithms is their inability to handle imprecision. This inability to handle the “grey areas” makes these algorithms less applicable to a range of domains such as Medicine and Finance. A well-regarded method for handling such imprecision is Fuzzy Logic, and in this paper a novel algorithm that combines CART and Fuzzy Logic is presented. Following the description of the implementation the experimental results presented which have been achieved through the use of the proposed FuzzyCART algorithm demonstrate an increased level of classification accuracy for medical data when compared to classical CART.","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":"126276287","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.5413370
Zahra Eskandari Gharghe, B. M. Bidgoli
Broder's shingling is one of the state-of-the-art approaches in detecting near-duplicate documents. Prior evaluations of this method have shown that document-pairs which have different main content but have a large amount of similar unimportant details are the main sources of its errors. Different web pages from the same site are a good example of such documents. In such pages, almost always there is a similar boilerplate text which has a chance to be selected as the document's fingerprint and trick the algorithm. It seems that this problem is due to representing each document only by a sample of its shingles. This sample only contains some of the page's shingles and discards any other information. by Including additional information such as frequencies of shingles in this sample, we can improve the performance of the algorithm. This paper proposes a weighting of shingles and adapts shingling to be applied on weighted shingles. Our results have shown an improvement in shingling's performance.
{"title":"Weighted shingling: an adaptation of shingling for weighted shingles","authors":"Zahra Eskandari Gharghe, B. M. Bidgoli","doi":"10.1109/IIT.2009.5413370","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413370","url":null,"abstract":"Broder's shingling is one of the state-of-the-art approaches in detecting near-duplicate documents. Prior evaluations of this method have shown that document-pairs which have different main content but have a large amount of similar unimportant details are the main sources of its errors. Different web pages from the same site are a good example of such documents. In such pages, almost always there is a similar boilerplate text which has a chance to be selected as the document's fingerprint and trick the algorithm. It seems that this problem is due to representing each document only by a sample of its shingles. This sample only contains some of the page's shingles and discards any other information. by Including additional information such as frequencies of shingles in this sample, we can improve the performance of the algorithm. This paper proposes a weighting of shingles and adapts shingling to be applied on weighted shingles. Our results have shown an improvement in shingling's performance.","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":"132002305","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.5413635
E. Nourani, M. A. Azgomi
As the use of web services is growing, there is an increasing demand for dependability. In this paper we intend to introduce various offered solutions for dependable web services. The existing solutions are divided into two categories: fault tolerance techniques, such as active and passive replications, and the use of design diversity. The main contribution of this paper is the use of design diversity techniques and WS-BPEL, which would result in proposing a useful and flexible architecture for dependable web services. The proposed architecture has been used as the basis of a design pattern for dependable web services, called D3WS. We have implemented the proposed architecture in a prototype application using N-version programming (NVP). We have also modeled the architecture using stochastic reward nets (SRNs) for further evaluation of dependability measures.
{"title":"A design pattern for dependable web services using design diversity techniques and WS-BPEL","authors":"E. Nourani, M. A. Azgomi","doi":"10.1109/IIT.2009.5413635","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413635","url":null,"abstract":"As the use of web services is growing, there is an increasing demand for dependability. In this paper we intend to introduce various offered solutions for dependable web services. The existing solutions are divided into two categories: fault tolerance techniques, such as active and passive replications, and the use of design diversity. The main contribution of this paper is the use of design diversity techniques and WS-BPEL, which would result in proposing a useful and flexible architecture for dependable web services. The proposed architecture has been used as the basis of a design pattern for dependable web services, called D3WS. We have implemented the proposed architecture in a prototype application using N-version programming (NVP). We have also modeled the architecture using stochastic reward nets (SRNs) for further evaluation of dependability measures.","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":"131332416","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.5413777
Y. Gadallah, Ikbal Taleb
The use of voice to control devices and applications provides a flexible, convenient and secure method for operating these systems. Users can control these systems using voice commands while they are in the proximity of the system to be controlled. Attempting to apply such control over the internet may be affected by several network impairments, e.g. jitter, errors, losses, etc. The effects of these impairments, while may not be felt by the normal human ear, can impact the operation of the software that processes these commands. This processing system is usually based on speaker identification and speech recognition components. In this paper, we study these network effects on the correct operation of such systems. We experiment with different types of network impairments and measure the effects on the voice-controlled operation. Our experiments show that network impairments affect the processing of voice commands to varying degrees. They also provide a comparative view between the behavior of command processing modules and the perceived quality of voice.
{"title":"Network effects on the functionality of voice-controlled systems and applications","authors":"Y. Gadallah, Ikbal Taleb","doi":"10.1109/IIT.2009.5413777","DOIUrl":"https://doi.org/10.1109/IIT.2009.5413777","url":null,"abstract":"The use of voice to control devices and applications provides a flexible, convenient and secure method for operating these systems. Users can control these systems using voice commands while they are in the proximity of the system to be controlled. Attempting to apply such control over the internet may be affected by several network impairments, e.g. jitter, errors, losses, etc. The effects of these impairments, while may not be felt by the normal human ear, can impact the operation of the software that processes these commands. This processing system is usually based on speaker identification and speech recognition components. In this paper, we study these network effects on the correct operation of such systems. We experiment with different types of network impairments and measure the effects on the voice-controlled operation. Our experiments show that network impairments affect the processing of voice commands to varying degrees. They also provide a comparative view between the behavior of command processing modules and the perceived quality of voice.","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":"130818204","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
扫码关注我们
求助内容：
应助结果提醒方式：