{"title":"Locating mobile nodes using heuristics with fuzzy logic handoff","authors":"Sourav Saha, M. Mukherjee, S. Neogy","doi":"10.1504/IJAISC.2009.027297","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027297","url":null,"abstract":"In wireless and mobile networks ensuring smooth handoff and tracing exact location of destination node and that too without wasting much time and bandwidth of constrained network is much essential. Several related techniques have been proposed in literature. Each has its own advantages/disadvantages. In this paper, we have proposed, first, a fuzzy logic based handoff management scheme that also handles some basic network management activities like call transferring after allotting a suitable wireless or radio link to the incoming node. It also proposes a location management scheme based on simple heuristics technique like time and probability.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"128 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133953420","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":"An intelligent search technique for network security administration","authors":"S. Bhattacharya, S. Ghosh","doi":"10.1504/IJAISC.2009.027299","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027299","url":null,"abstract":"Security is a challenging task for today's network administration. Usually, attackers penetrate into a network through a chain of exploits. Such an exploit sequence can be termed as an attack path, and the set of all possible attack paths forms an attack graph. In this paper, we propose a novel Artificial Intelligence (AI) based approach to find out an attack path consisting of logically connected exploits, which essentially shows the minimum number of exploits required to obtain access over a critical network asset. The solution is further extended to form an attack graph for the enterprise network.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115415367","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A multivalued planning model","authors":"M. Baioletti, A. Milani, V. Poggioni, S. Suriani","doi":"10.1504/IJAISC.2009.027291","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027291","url":null,"abstract":"In this work a model for planning with multivalued fluents and graded actions, based on the infinity-valued Lukasiewicz logic, is introduced. In multivalued planning, fluents and actions can assume truth values in [0, 1]. Multivalued fluents and graded actions allow to model many real situations where some features of the world cannot be modelled with boolean values and where actions can be executed with varying strength which produces graded effects as well. A correct/complete algorithm which solves bounded multivalued planning problems based on MIP compilation is also described and a prototype implementation is presented.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"299 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124277032","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":"Optimisation of software testing using Genetic Algorithm","authors":"Praveen Ranjan Srivastava","doi":"10.1504/IJAISC.2009.027301","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027301","url":null,"abstract":"Software testing is meant to increase confidence in the correctness of software. Test data generation is one of the key issues in software testing. A properly generated test suite may not only locate the errors in a software system, but also help in reducing the high cost associated with software testing. It is often desired that test data in the form of test sequences within a test suite can be automatically generated to achieve the required test coverage. This paper proposes Genetic Algorithm (GA) to test data generation for optimising the software testing.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125767119","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":"Classified Vector Quantisation and population decoding for pattern recognition","authors":"Bailing Zhang, S. Guan","doi":"10.1504/IJAISC.2009.027294","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027294","url":null,"abstract":"Learning Vector Quantisation (LVQ) is a method of applying the Vector Quantisation (VQ) to generate references for Nearest Neighbour (NN) classification. Though successful in many occasions, LVQ suffers from several shortcomings, especially the reference vectors are prone to diverge. In this paper, we propose a Classified Vector Quantisation (CVQ) to establish VQ for classification. By CVQ, each data category is represented by its own codebook, which can be implemented by some learning algorithms. In classification process, each codebook offers a generalised NN. The examples of handwritten digit recognition and offline signature verification are used to demonstrate the efficiency of the proposed scheme.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134037319","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":"Cognitive neuronal dynamics of aesthetics: Kawabata and Zeki's neuroscience on beauty in Paralleli","authors":"Check-Teck Foo, S. Foo, Sin-Yee Foo","doi":"10.1504/IJAISC.2009.027300","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027300","url":null,"abstract":"Artificial Intelligence (AI) is now widely used across a wide variety of fields. Yet, there are so far very few reported in-depth experimental studies utilising artificial intelligence in modelling cognitively of how the brain or mind processes aesthetics. In this paper, we document our study of aesthetical judgements via Artificial Neural Network (ANN). A technology inspired from neuronal processes of the brain is here enabled through training to derive meanings from symbolic designs. The insights gained from our cognitive neurodynamic modelling of the processes are presented. To the best of our knowledge, ours is probably the first prototypical artificial judge of aesthetics ever created: one capable of assessing designs in a human-like fashion.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123154151","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":"Ontology-based automatic query refinement","authors":"S. Selvaraju, G. Mahalakshmi, S. Rajasekar","doi":"10.1504/IJAISC.2009.027298","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027298","url":null,"abstract":"The effectiveness of user query plays a vital role in retrieving highly relevant documents in keyword-based search engine. Because of the lack of domain knowledge, users tend to post very short queries, which do not express their information need clearly, which reduce the precision and re-call of the search. Ontology-based automatic query refinement system has been proposed to overcome this problem in search engine. This system proposes an ontology-based automatic query refinement model for the exploitation of full-fledged domain ontology to support semantic search in keyword-based search engine. This system formulates effective query using ontology to increase the relevancy of documents retrieved.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131525922","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}
K. Umamaheswari, S. Sumathi, S. Sivanandam, T. Ponson
{"title":"Classification in data mining for face images using neuro: genetic approaches","authors":"K. Umamaheswari, S. Sumathi, S. Sivanandam, T. Ponson","doi":"10.1504/IJAISC.2009.027289","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027289","url":null,"abstract":"This paper describes a method of hybrid classifier/recogniser based on Neuro-Genetic processing of face images. The use of Data Mining techniques has a legitimate and enabling ways to explore large image collections using the Neuro-Genetic approaches. Much research in human face recognition involves fronto-parallel face images, which are operated under strict imaging conditions such as controlled illumination and limited facial expressions. A novel Symmetric-Based Algorithm is proposed for face detection in still grey-level images, which acts as a selective attentional mechanism. A fusion of three face classifiers, Linear Discriminant Analysis (LDA), Line-Based Algorithm (LBA) and Kernel Direct Discriminant Analysis (KDDA), is proposed with Genetic Algorithm, which optimises the weights of neural network. It helps to extract only the essential features that effectively and successively improve the classification accuracy. The BioID face database, from BioID Laboratory, Texas, USA, has 1024 images for 22 subjects are used for analysis.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129351337","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":"Inverse kinematics of manipulator using weighted fuzzy clustering method for fuzzy training data","authors":"Vijayant Agarwal, B. C. Nakra, A. Mittal","doi":"10.1504/IJAISC.2009.027290","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027290","url":null,"abstract":"The inverse kinematics of redundant manipulator is considered. A model-free regression approach based on weighted fuzzy clustering method is formulated. For the adopted technique, the observed or training data pair is fuzzy instead of crisp for known value of joint variables to enhance the practicability of inverse kinematics solutions, since the real-time data collected by the sensors is generally fuzzy or vague instead of crisp. Simulation results indicate that this method has higher identifying precision and better real-time ability. Therefore, a new way for solving the inverse kinematics of manipulator for fuzzy data is proposed.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122009339","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":"Rough equivalence and algebraic properties of rough sets","authors":"B. Tripathy, A. Mitra, J. Ojha","doi":"10.1504/IJAISC.2009.027296","DOIUrl":"https://doi.org/10.1504/IJAISC.2009.027296","url":null,"abstract":"Rough sets are used as an effective model to deal with imprecise knowledge, since its inception by Pawlak (1982). Rough equalities, introduced and studied by Novotny and Pawlak (1985a, 1985b, 1985c) as methods for comparison of rough sets, were generalised to the notions of rough equivalences by Tripathy et al. (2008), where they have shown their superiority over rough equalities. In this paper, we establish the rough equivalence of some of the algebraic properties, which occur frequently in the study of crisp sets. These new properties can be used in the study of rough logic.","PeriodicalId":364571,"journal":{"name":"Int. J. Artif. Intell. Soft Comput.","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125310555","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}