Pub Date : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814678
A. Pradhan, T. De
In Wavelength Division Multiplexing (WDM) optical networks, the failure of network resources (e.g., fiber link or node) can disrupt the transmission of information to several destination nodes on a light-tree based multicast sessions. Thus, it is essential to protect multicast sessions by reserving resources along back-up trees. So that if primary tree fails to transmit the information back-up tree will forward the message to the desired destinations. In this paper, we address the problem of survivable of multicast routing and wavelength assignment with sub-wavelength traffic demands in a WDM mesh networks. In this work, we extend the approach of segment disjoint protection methodology to groom the multicast sessions in order to protect them from single link failures. We have proposed an efficient approach for protecting multicast sessions named light-tree based shared segment protection grooming (LTSSPG) scheme and compared with existing multicast traffic grooming with segment protection (MTG-SP) approach. In case of MTG-SP, each segment of primary tree is protected by dis-joint segment in the back-up tree to share the edges or segment. Whereas in case of LTSSPG approach, the segment are shared between the primary as well as back-up trees. The main objective of this work is to minimize the cost in terms of number of wavelengths requirement and optical splitters as well as minimizing the blocking probability of network resources. The performance of various algorithms are evaluated based on extensive simulations in standard networks.
{"title":"Survivable of multicast traffic grooming against single link failures in WDM mesh networks","authors":"A. Pradhan, T. De","doi":"10.1109/ICADIWT.2014.6814678","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814678","url":null,"abstract":"In Wavelength Division Multiplexing (WDM) optical networks, the failure of network resources (e.g., fiber link or node) can disrupt the transmission of information to several destination nodes on a light-tree based multicast sessions. Thus, it is essential to protect multicast sessions by reserving resources along back-up trees. So that if primary tree fails to transmit the information back-up tree will forward the message to the desired destinations. In this paper, we address the problem of survivable of multicast routing and wavelength assignment with sub-wavelength traffic demands in a WDM mesh networks. In this work, we extend the approach of segment disjoint protection methodology to groom the multicast sessions in order to protect them from single link failures. We have proposed an efficient approach for protecting multicast sessions named light-tree based shared segment protection grooming (LTSSPG) scheme and compared with existing multicast traffic grooming with segment protection (MTG-SP) approach. In case of MTG-SP, each segment of primary tree is protected by dis-joint segment in the back-up tree to share the edges or segment. Whereas in case of LTSSPG approach, the segment are shared between the primary as well as back-up trees. The main objective of this work is to minimize the cost in terms of number of wavelengths requirement and optical splitters as well as minimizing the blocking probability of network resources. The performance of various algorithms are evaluated based on extensive simulations in standard networks.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121511034","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814687
Kamran Khan, S. Rehman, Kamran Aziz, S. Fong, S. Sarasvady, Amrita Vishwa
Data Mining is all about data analysis techniques. It is useful for extracting hidden and interesting patterns from large datasets. Clustering techniques are important when it comes to extracting knowledge from large amount of spatial data collected from various applications including GIS, satellite images, X-ray crystallography, remote sensing and environmental assessment and planning etc. To extract useful pattern from these complex data sources several popular spatial data clustering techniques have been proposed. DBSCAN (Density Based Spatial Clustering of Applications with Noise) is a pioneer density based algorithm. It can discover clusters of any arbitrary shape and size in databases containing even noise and outliers. DBSCAN however are known to have a number of problems such as: (a) it requires user's input to specify parameter values for executing the algorithm; (b) it is prone to dilemma in deciding meaningful clusters from datasets with varying densities; (c) and it incurs certain computational complexity. Many researchers attempted to enhance the basic DBSCAN algorithm, in order to overcome these drawbacks, such as VDBSCAN, FDBSCAN, DD_DBSCAN, and IDBSCAN. In this study, we survey over different variations of DBSCAN algorithms that were proposed so far. These variations are critically evaluated and their limitations are also listed.
数据挖掘是关于数据分析技术的。它对于从大型数据集中提取隐藏的和有趣的模式非常有用。从地理信息系统、卫星图像、x射线晶体学、遥感、环境评估和规划等各种应用中收集的大量空间数据中提取知识时，聚类技术非常重要。为了从这些复杂的数据源中提取有用的模式，人们提出了几种流行的空间数据聚类技术。DBSCAN (Density Based Spatial Clustering of Applications with Noise)是一种基于密度的空间聚类算法。它可以在包含噪声和异常值的数据库中发现任意形状和大小的集群。然而，DBSCAN已知有许多问题，例如:(a)它需要用户输入指定执行算法的参数值;(b)在从不同密度的数据集中确定有意义的聚类时容易陷入困境;(c)并且会产生一定的计算复杂度。为了克服这些缺点，许多研究人员尝试对基本的DBSCAN算法进行改进，如VDBSCAN、FDBSCAN、DD_DBSCAN和IDBSCAN。在本研究中，我们调查了迄今为止提出的DBSCAN算法的不同变体。对这些变化进行了严格的评估，并列出了它们的局限性。
{"title":"DBSCAN: Past, present and future","authors":"Kamran Khan, S. Rehman, Kamran Aziz, S. Fong, S. Sarasvady, Amrita Vishwa","doi":"10.1109/ICADIWT.2014.6814687","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814687","url":null,"abstract":"Data Mining is all about data analysis techniques. It is useful for extracting hidden and interesting patterns from large datasets. Clustering techniques are important when it comes to extracting knowledge from large amount of spatial data collected from various applications including GIS, satellite images, X-ray crystallography, remote sensing and environmental assessment and planning etc. To extract useful pattern from these complex data sources several popular spatial data clustering techniques have been proposed. DBSCAN (Density Based Spatial Clustering of Applications with Noise) is a pioneer density based algorithm. It can discover clusters of any arbitrary shape and size in databases containing even noise and outliers. DBSCAN however are known to have a number of problems such as: (a) it requires user's input to specify parameter values for executing the algorithm; (b) it is prone to dilemma in deciding meaningful clusters from datasets with varying densities; (c) and it incurs certain computational complexity. Many researchers attempted to enhance the basic DBSCAN algorithm, in order to overcome these drawbacks, such as VDBSCAN, FDBSCAN, DD_DBSCAN, and IDBSCAN. In this study, we survey over different variations of DBSCAN algorithms that were proposed so far. These variations are critically evaluated and their limitations are also listed.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116037577","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814672
C. K. K. Reddy, P. Anisha, L. Prasad
Thunderstorm is a sudden electrical expulsion manifested by a blaze of lightening with a muffled sound. It is one of the most spectacular mesoscale weather phenomena in the atmosphere which occurs seasonally. On the other hand, prediction of thunderstorms is said to be the most complicated task in weather forecasting, due to its limited spatial and temporal extension either dynamically or physically. Every thunderstorm produce lightening, this kills more people every year than tornadoes. Heavy rain from thunderstorm leads to flash flooding, and causes extensive loss to property and other living organisms. Different scientific and technological researches are been carried on for the forecasting of this severe weather feature in advance to reduce damages. In this regard, many of the researchers proposed various methodologies like STP model, MOM model, CG model, LM model, QKP model, DBD model and so on for the detection, but neither of them could provide an accurate prediction. The present research adopted clustering and wavelet transform techniques in order to improve the prediction rate to a greater extent. This is the first research study carried on thunderstorm prediction using the clustering and wavelet techniques resulting with higher accuracy. The proposed model yields an average accuracy of 89.23% in the identification of thunderstorm.
{"title":"Detection of thunderstorms using data mining and image processing","authors":"C. K. K. Reddy, P. Anisha, L. Prasad","doi":"10.1109/ICADIWT.2014.6814672","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814672","url":null,"abstract":"Thunderstorm is a sudden electrical expulsion manifested by a blaze of lightening with a muffled sound. It is one of the most spectacular mesoscale weather phenomena in the atmosphere which occurs seasonally. On the other hand, prediction of thunderstorms is said to be the most complicated task in weather forecasting, due to its limited spatial and temporal extension either dynamically or physically. Every thunderstorm produce lightening, this kills more people every year than tornadoes. Heavy rain from thunderstorm leads to flash flooding, and causes extensive loss to property and other living organisms. Different scientific and technological researches are been carried on for the forecasting of this severe weather feature in advance to reduce damages. In this regard, many of the researchers proposed various methodologies like STP model, MOM model, CG model, LM model, QKP model, DBD model and so on for the detection, but neither of them could provide an accurate prediction. The present research adopted clustering and wavelet transform techniques in order to improve the prediction rate to a greater extent. This is the first research study carried on thunderstorm prediction using the clustering and wavelet techniques resulting with higher accuracy. The proposed model yields an average accuracy of 89.23% in the identification of thunderstorm.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124761646","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814666
D. Goutam, A. Verma, Neha Agrawal
The main issues in a cloud based environment are security, process fail rate and performance. Fault tolerance plays a key role in ensuring high serviceability and reliability in cloud. Nowadays, demands for high fault tolerance, high serviceability and high reliability are becoming unprecedentedly strong, building a high fault tolerance, high serviceability and high reliability cloud is a critical, challenging, and urgently required task. A lot of research is currently underway to analyze how clouds can provide fault tolerance for an application. When the number of processes are too many and the virtual machine is overloaded then the processes are failed causing lot of rework and annoyance for the users. The major cause of the failure of the processes at the virtual machine level are overloading of virtual machines, extra resource requirements of the existing processes etc. This paper introduces dynamic load balancing techniques for cloud environment in which RAM/Broker (resource awareness module) proactively decides whether the process can be applied on an existing virtual machine or it should be assigned to a different virtual machine created a fresh or any other existing virtual machine. So, in this way it can tackle the occurrence of the fault. This paper also proposed a mechanism which proactively decides the load on virtual machines and according to the requirement either creates a new virtual machine or uses an existing virtual machine for assigning the process. Once a process is complete, it will update the virtual machine status on the broker service so that other processes can be assigned to it.
{"title":"The performance evaluation of proactive fault tolerant scheme over cloud using CloudSim simulator","authors":"D. Goutam, A. Verma, Neha Agrawal","doi":"10.1109/ICADIWT.2014.6814666","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814666","url":null,"abstract":"The main issues in a cloud based environment are security, process fail rate and performance. Fault tolerance plays a key role in ensuring high serviceability and reliability in cloud. Nowadays, demands for high fault tolerance, high serviceability and high reliability are becoming unprecedentedly strong, building a high fault tolerance, high serviceability and high reliability cloud is a critical, challenging, and urgently required task. A lot of research is currently underway to analyze how clouds can provide fault tolerance for an application. When the number of processes are too many and the virtual machine is overloaded then the processes are failed causing lot of rework and annoyance for the users. The major cause of the failure of the processes at the virtual machine level are overloading of virtual machines, extra resource requirements of the existing processes etc. This paper introduces dynamic load balancing techniques for cloud environment in which RAM/Broker (resource awareness module) proactively decides whether the process can be applied on an existing virtual machine or it should be assigned to a different virtual machine created a fresh or any other existing virtual machine. So, in this way it can tackle the occurrence of the fault. This paper also proposed a mechanism which proactively decides the load on virtual machines and according to the requirement either creates a new virtual machine or uses an existing virtual machine for assigning the process. Once a process is complete, it will update the virtual machine status on the broker service so that other processes can be assigned to it.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129891956","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814695
S. Nithyanandam, S. Amaresan, N. Haris
Biometric technology deals with recognizing the uniqueness of individuals based on their exclusive Physical or behavioral characteristics. The developments in science & technology have made it possible to use biometrics in application when it is required to establish (or) confirm the identity of persons. Amongst a range of method, Iris recognition is a hastily intensifying technique of biometric technology. A large range of identification methods is used either verify or decide the identity of person request their processes. This Paper provides the inspiration for image acquisition, segmentation, normalization standed on the human being Iris imaging. A combination method is used to fragment the eye's digital image. The mined Iris region was then standardized by using Image registration method. A phase correlation method is installed for this Iris image registration principle. Investigational consequences demonstrate that our system is reasonably efficient and gives hopeful performance.
{"title":"An innovative normalization process by phase correlation method of Iris images for the block size of 32∗32","authors":"S. Nithyanandam, S. Amaresan, N. Haris","doi":"10.1109/ICADIWT.2014.6814695","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814695","url":null,"abstract":"Biometric technology deals with recognizing the uniqueness of individuals based on their exclusive Physical or behavioral characteristics. The developments in science & technology have made it possible to use biometrics in application when it is required to establish (or) confirm the identity of persons. Amongst a range of method, Iris recognition is a hastily intensifying technique of biometric technology. A large range of identification methods is used either verify or decide the identity of person request their processes. This Paper provides the inspiration for image acquisition, segmentation, normalization standed on the human being Iris imaging. A combination method is used to fragment the eye's digital image. The mined Iris region was then standardized by using Image registration method. A phase correlation method is installed for this Iris image registration principle. Investigational consequences demonstrate that our system is reasonably efficient and gives hopeful performance.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132796051","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814676
Xuejing Li, Zhendong Niu, Chongyang Shi
With the advent of the Web of Linked Data, new challenges to federated query processing are emerging. Different from traditional federated database systems which do static data integration, this Web of Data is open and ever-changing. In this paper, we present a agent-based architecture providing a flexible and decoupled solution for the federated queries over Linked Data. Based on the presented architecture, a Linked Data Management System (LDMS) has been developed. LDMS manages Linked Data in a virtual way, i.e., it does not load remote data into a local data store. With an application scenario, we demonstrate the scalability and extensibility of the presented architecture.
{"title":"An agent-based linked data integration system","authors":"Xuejing Li, Zhendong Niu, Chongyang Shi","doi":"10.1109/ICADIWT.2014.6814676","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814676","url":null,"abstract":"With the advent of the Web of Linked Data, new challenges to federated query processing are emerging. Different from traditional federated database systems which do static data integration, this Web of Data is open and ever-changing. In this paper, we present a agent-based architecture providing a flexible and decoupled solution for the federated queries over Linked Data. Based on the presented architecture, a Linked Data Management System (LDMS) has been developed. LDMS manages Linked Data in a virtual way, i.e., it does not load remote data into a local data store. With an application scenario, we demonstrate the scalability and extensibility of the presented architecture.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130562263","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814689
D. Gaurav, Dishant Mittal, Bhavya Vaidya, Jimmy Mathew
Renewable Energy is a pressing need in the 21st century as non-renewable sources are no longer fit for our energy needs. This is especially important in a country like India, where supply to demand ratio is very low. In this paper, we intend to identify the geographical areas for solar and wind energy generations at low cost. It is achieved by monitoring atmospheric weather conditions, such as temperature, humidity, wind speed and light intensity. Our design is based on remotely operated system with sensors, which gathers weather information and transmits measured values to the ground. In our research, we have considered a number of options to device atmospheric weather monitoring system at low cost, long lasting and durable for extreme weather conditions. The cost of the system is estimated to be nearly thirty dollars. It is highly reliable and deployable, and is a very useful utility in a country like India. The system can be easily deployed at areas to keep track of continuous climatic changes. The system is operated by battery, and is expected to run with a long life span, because of the system optimizations done for maximum power savings. Our system weighs only less than 150 gm, and is easily floatable and recoverable with the help of a simple Hydrogen balloon.
{"title":"A GSM based low cost weather monitoring system for solar and wind energy generation","authors":"D. Gaurav, Dishant Mittal, Bhavya Vaidya, Jimmy Mathew","doi":"10.1109/ICADIWT.2014.6814689","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814689","url":null,"abstract":"Renewable Energy is a pressing need in the 21st century as non-renewable sources are no longer fit for our energy needs. This is especially important in a country like India, where supply to demand ratio is very low. In this paper, we intend to identify the geographical areas for solar and wind energy generations at low cost. It is achieved by monitoring atmospheric weather conditions, such as temperature, humidity, wind speed and light intensity. Our design is based on remotely operated system with sensors, which gathers weather information and transmits measured values to the ground. In our research, we have considered a number of options to device atmospheric weather monitoring system at low cost, long lasting and durable for extreme weather conditions. The cost of the system is estimated to be nearly thirty dollars. It is highly reliable and deployable, and is a very useful utility in a country like India. The system can be easily deployed at areas to keep track of continuous climatic changes. The system is operated by battery, and is expected to run with a long life span, because of the system optimizations done for maximum power savings. Our system weighs only less than 150 gm, and is easily floatable and recoverable with the help of a simple Hydrogen balloon.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122004006","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814673
D. V. Paul, J. Pawar
Examinations are important tools for assessing student performance. They are commonly used as a metric to determine the quality of the students. However, examination question paper composition is a multi-constraint concurrent optimization problem. Question selection plays a key role in question paper composition system. Question selection is handled in traditional systems by using a specified question paper format containing a listing of weightages to be allotted to each unit/module of the syllabus. They do not consider other constraints such as total time duration for completion of the paper, total number of questions, question types, knowledge points, difficulty level of questions etc,. In this paper we have proposed an innovative evolutionary approach that handles multi-constraints while generating question papers from a very large question bank. The proposed Multi-objective Differential Evolution Approach (MDEA) has its advantage of simple structure, ease of use, better computational speed and good robustness. It is identified to be more suitable for combinatorial problems as compared to the generally used genetic algorithm. Experimental results indicate that the proposed approach is efficient and effective in generating near-optimal or optimal question papers that satisfy the specified requirements.
{"title":"A multi-objective differential evolution approach for the question selection problem","authors":"D. V. Paul, J. Pawar","doi":"10.1109/ICADIWT.2014.6814673","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814673","url":null,"abstract":"Examinations are important tools for assessing student performance. They are commonly used as a metric to determine the quality of the students. However, examination question paper composition is a multi-constraint concurrent optimization problem. Question selection plays a key role in question paper composition system. Question selection is handled in traditional systems by using a specified question paper format containing a listing of weightages to be allotted to each unit/module of the syllabus. They do not consider other constraints such as total time duration for completion of the paper, total number of questions, question types, knowledge points, difficulty level of questions etc,. In this paper we have proposed an innovative evolutionary approach that handles multi-constraints while generating question papers from a very large question bank. The proposed Multi-objective Differential Evolution Approach (MDEA) has its advantage of simple structure, ease of use, better computational speed and good robustness. It is identified to be more suitable for combinatorial problems as compared to the generally used genetic algorithm. Experimental results indicate that the proposed approach is efficient and effective in generating near-optimal or optimal question papers that satisfy the specified requirements.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115556592","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814704
Varsha Bhoir, M. Potey
The exponential growth in digital information led to the need of increasingly sophisticated search tools like the web search engines. Search engines return ranked list of documents and are less effective when users need precise answers to natural language questions. Question Answering systems involve this critical capability required for the next generation web search engines, to reduce the painstaking search through the long list of documents. The proposed solution of Question Answering system works for a specific domain of tourism which is a global and routine activity for leisure. The users have to struggle to navigate through these overloaded sites for a short piece of information of their interest. The crawler developed in the system gathers web page information which is processed using Natural Language Processing and Procedure programming for a specific keyword. The system returns precise short string answers or list to natural language questions related to tourism domain like distance, person, date, list of hotels, list of forts, etc.
{"title":"Question answering system: A heuristic approach","authors":"Varsha Bhoir, M. Potey","doi":"10.1109/ICADIWT.2014.6814704","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814704","url":null,"abstract":"The exponential growth in digital information led to the need of increasingly sophisticated search tools like the web search engines. Search engines return ranked list of documents and are less effective when users need precise answers to natural language questions. Question Answering systems involve this critical capability required for the next generation web search engines, to reduce the painstaking search through the long list of documents. The proposed solution of Question Answering system works for a specific domain of tourism which is a global and routine activity for leisure. The users have to struggle to navigate through these overloaded sites for a short piece of information of their interest. The crawler developed in the system gathers web page information which is processed using Natural Language Processing and Procedure programming for a specific keyword. The system returns precise short string answers or list to natural language questions related to tourism domain like distance, person, date, list of hotels, list of forts, etc.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130741476","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 : 2014-05-15DOI: 10.1109/ICADIWT.2014.6814668
D. Kumari, M. Tahiliani, Udaya Kumar K. Shenoy
CUBIC TCP, a variant of the traditional TCP, is the default congestion control algorithm deployed in Linux kernels above 2.6 version. CUBIC is mainly designed for high speed, long distance wired networks and several studies have exhibited that it indeed, enriches the performance of such networks. Recently, hand-held devices such as smart phones have grown very popular and there has been a lot of interest in the research community to design efficient operating systems for such devices. Android is one of the latest open source mobile operating system and it is based on a reduced version of the Linux kernel. Since it is Linux based, CUBIC TCP remains the default TCP in Android also. These hand-held devices, however, are connected to low speed wireless networks and consequently, CUBIC TCP deployment in Android ends up being a mismatch. The main goal of this work is to analyze the behavior of CUBIC TCP in low speed error prone wireless networks and bring out the challenges and issues related to the same.
{"title":"Experimental analysis of CUBIC TCP in error prone MANETs","authors":"D. Kumari, M. Tahiliani, Udaya Kumar K. Shenoy","doi":"10.1109/ICADIWT.2014.6814668","DOIUrl":"https://doi.org/10.1109/ICADIWT.2014.6814668","url":null,"abstract":"CUBIC TCP, a variant of the traditional TCP, is the default congestion control algorithm deployed in Linux kernels above 2.6 version. CUBIC is mainly designed for high speed, long distance wired networks and several studies have exhibited that it indeed, enriches the performance of such networks. Recently, hand-held devices such as smart phones have grown very popular and there has been a lot of interest in the research community to design efficient operating systems for such devices. Android is one of the latest open source mobile operating system and it is based on a reduced version of the Linux kernel. Since it is Linux based, CUBIC TCP remains the default TCP in Android also. These hand-held devices, however, are connected to low speed wireless networks and consequently, CUBIC TCP deployment in Android ends up being a mismatch. The main goal of this work is to analyze the behavior of CUBIC TCP in low speed error prone wireless networks and bring out the challenges and issues related to the same.","PeriodicalId":339627,"journal":{"name":"The Fifth International Conference on the Applications of Digital Information and Web Technologies (ICADIWT 2014)","volume":"107 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123972637","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
扫码关注我们
求助内容：
应助结果提醒方式：