{"title":"Research of the Discovery of Test Configuration Model on Reverse Engineering Based on TTCN-3","authors":"Xue-Mei Liu, Yongpo Liu, Shuangmei Liu, Liqin Hu","doi":"10.1109/ISCBI.2013.52","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.52","url":null,"abstract":"In this thesis, the traditional reverse method is applied to TTCN-3 test systems. The discovery system of inverse model is designed, and the discovery technology of test configuration models is also discussed. When reverse analyzing the test system based on TTCN-2, the test configuration information can be obtained from two aspects, namely static and dynamic. Then the discovery algorithm related to the areas is developed. The abstract model describing the test systems will be extracted. The reverse engineering based on TTCN-3 test systems can help testers grasp the system design from higher levels, and can test the consistence between test design and test implementation, which is of great significance and important value for test system maintenance, expansion and evaluation.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123799104","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":"Customized Category Based Clustering of URLs","authors":"Neetu Anand","doi":"10.1109/ISCBI.2013.68","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.68","url":null,"abstract":"Web applications are taking popularity in number of ways. Monitoring the client side data allow for gathering valuable information about its behaviour. In this paper an intelligent and integrated system for user activity monitoring for both computer and internet movement is proposed. The system provides on-line and off-line monitoring and allows detecting user behaviour. On-line monitoring is carried in real time and is used to predict user actions. Off-line monitoring is carried out after user has ended his work, and is based on the analysis of statistical parameters of user behaviour. A method for the identifying the category of web sites is also presented. Our system performs clustering on the basis of URL. The URL clustering is very informative, making techniques based on it faster than that make use of text information as well.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127777167","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":"Clustering in User Information Retrieval on Web","authors":"Sachin Sharma, V. Mangat","doi":"10.1109/ISCBI.2013.64","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.64","url":null,"abstract":"This paper focuses on personalization of \"user information needs\" by applying clustering techniques of data mining. In the current data centric world, it is very important to analyze data properly and draw the crux from the available for effective creation and maintenance of user profiles. This paper throws explains the use of an indispensable technique called Clustering Technique, which is used to group items exhibiting similar behavior into different item sets.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"28 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115708450","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":"Implementation of File Transfer Using Message Transmission Optimization Mechanism (MTOM)","authors":"H. Mhatre, Shilpa Verma, A. Jaiswal","doi":"10.1109/ISCBI.2013.10","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.10","url":null,"abstract":"Different applications over the Internet uses Web Services to help them for better communication. Using encryption techniques, these applications can send any type of information to each other. W3C recommends MTOM (Message Transmission Optimization Mechanism) as the standard for transferring binary files as an attachment to SOAP messages. The basic feature of MTOM is that it does not break the XML info set for transferring binary files. However, the work done so far on efficient processing of SOAP attachments is very little. This paper provides architecture and implementation for sending binary files as attachments using MTOM. The problem with DIME (Direct Internet Message Encapsulation) is that the binary content is sent outside the SOAP Envelope of the XML message. This means that even if your message is secure, the DIME attachment may not be secure. We realized that when MTOM is used, web service automatically handles the encoding of the data in the web service message. The implementation of architecture described in this paper for transferring binary files using MTOM will give approximately 10-20% faster result than DIME. This is because, in MTOM we do not need to package each chunk into the attachment, which is necessary in DIME.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116270308","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":"Air Cargo Scheduling Using Genetic Algorithms","authors":"S. Fong, M.G. da Costa, R. Khoury","doi":"10.1109/ISCBI.2013.41","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.41","url":null,"abstract":"This project is to optimize the scheduling of the packages within the aircrafts' loading capacities, which are simulated. The optimization criteria are evaluated by customer satisfaction and maximize the usage and profit of the aircrafts. Three algorithms for the batch delivery scheduling problem are developed to find the optimal air cargo shipment. These algorithms are genetic algorithm with earliest due date method, extended due date method and genetic algorithm with extended due date method. The performances of these algorithms are compared to first come first serve and earliest due date scheduling method. The performance of genetic algorithm is analyzed by its fitness function. Air cargos which are handled within Chinese cities is based on flight schedules of nine airline companies including Air Macau, EVA Airways, Cathay Pacific, China Southern Airlines, China Eastern Airlines, Air China, Dragon Air, China Airlines and Mandarin Airlines.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131364898","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":"Uncovering Cloaking Web Pages with Hybrid Detection Approaches","authors":"Jun Deng, Hao Chen, Jianhua Sun","doi":"10.1109/ISCBI.2013.65","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.65","url":null,"abstract":"Web search cloaking, used by spammers for the purpose of increasing the visiting rates of their website, is a challenging spamming technique to search engines. Existing cloaking detection systems have some shortcomings: the accuracy of their algorithms is not high enough, the types of cloaking techniques that be detected are limited. In this paper, we present a new system to attack these two problems. To improve the detection accuracy, our algorithm combines text, tag and URL based method. For the purpose of detecting more types of cloaking techniques, our system works as follows: driving a real browser to execute scripts in web pages, crawl a page for the second time by modifying the referrer field of our HTTP headers, obtaining search engine's cached page for further comparison. We apply our system to 104,800 URLs extracted from Yahoo. Results show that our system can gain a high accuracy: precision at 94.52% and recall at 98.57%. More types of cloaking techniques are successfully detected by our system.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124066729","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":"Handwritten Devanagari Compound Character Recognition Using Legendre Moment: An Artificial Neural Network Approach","authors":"K. Kale, S. V. Chavan, M. Kazi, Y. Rode","doi":"10.1109/ISCBI.2013.62","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.62","url":null,"abstract":"Handwritten Devanagari Compound character recognition is one of the new challenging task for the researcher, because Compound character are complex in structure, they are written by combination two or more character. Their occurrence in the script is up to 12 to 15%. In this research paper, a recognition system for handwritten Devanagari Compound Character is proposed bases on Legendre moment feature descriptor are used to recognize. Moment function have been successfully applied to many pattern recognition problem, due to this they tends to capture global features which makes them well suited as feature descriptor. The process image is normalized to 30X30 pixel size divided into zone, from this structural as well as statistical feature are extracted from each zone. The proposed system is trained and tested on 27000 handwritten collected from different people. For classification we have used Artificial Neural Network. The overall recognition rate for basic is up to 98.25% and for all compound character is 98.36%.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"233 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132774535","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":"Guaranteed Quality of Service in Cloud Ready Application","authors":"V. M. Sekhar, M. R. Kumar, K. V. Rao, N. Rao","doi":"10.1109/ISCBI.2013.13","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.13","url":null,"abstract":"Cloud computing is a grid based application which eases \"On demand network access to a shared pool of computing recourses\". This environment strives to be secure, scalable and customized with guaranteed Quality of Service (QoS). However, QoS is guaranteed through fulfillment of non-functional requirements like Security, Scalability, Mobility and Virtualization in Cloud computing System. In this paper we proposed \"the Open Cloud Security Architecture (OCSA) algorithm\" is an approach to fulfillment of our goal. To meet the computing demands of everyday operations like Nonfunctional requirements, here we have introduced OCSA to achieve that first security, the misuse case and Attack Tree analysis posed threat and Attack Surface of any Cloud, Second scalability to overcome network traffic congestion and Denial of Service (DoS) because of rapid growth of customers and Third, Storage and Service providing consequences arise and mitigated to achieve Mobility and Virtualization. The above unpredictable constraints can be modeled through DREAD analysis, So that above consequences partly annihilated and use of Cloud can be extended by adding more capacity on demand.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132994878","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":"Incremental Learning Algorithms for Fast Classification in Data Stream","authors":"S. Fong, Zhicong Luo, B. W. Yap","doi":"10.1109/ISCBI.2013.45","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.45","url":null,"abstract":"Classification is one of the most commonly used data mining methods which can make a prediction by modeling from the known data. However, in traditional classification, we need to acquire the whole dataset and then build a training model which may take a lot of time and resource consumption. Another drawback of the traditional classification is that it cannot process the dataset timely and efficiently, especially for real-time data stream or big data. In this paper, we evaluate a lightweight method based on incremental learning algorithms for fast classification. We use this method to do outlier detection via several popular incremental learning algorithms, like Decision Table, Naïve Bayes, J48, VFI, KStar, etc.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"36 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132973232","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}
Mrinal Kanti Deb Barma, Rajib Chowdhuri, N. Debbarma, S. K. Sen, Sudipta Roy
{"title":"Enhancing the Performance of AODV Using Node Remaining Energy and Aggregate Interface Queue Length","authors":"Mrinal Kanti Deb Barma, Rajib Chowdhuri, N. Debbarma, S. K. Sen, Sudipta Roy","doi":"10.1109/ISCBI.2013.23","DOIUrl":"https://doi.org/10.1109/ISCBI.2013.23","url":null,"abstract":"In this paper, an adaptive routing algorithm is presented in Mobile Adhoc Networks using modified AODV by calculating the load on different routes using parameters like nodes remaining energy and aggregate interface queue length. The weight value of each route is computed and stored in a metric. This metric value is used to choose a path to the destination. The AODV protocol is modified in such a way that only the destination node will respond to a route request which greatly reduces the transmission of control data packets in a network. The performance of modified AODV is also evaluated based on metrics like throughput, average end-to-end delay and normalized routing overhead.","PeriodicalId":311471,"journal":{"name":"2013 International Symposium on Computational and Business Intelligence","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117073586","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}