Pub Date : 2014-05-01DOI: 10.14355/IJCSA.2014.0302.04
P. Chandrasekar, A. Arul Lawrence Selvakumar
This work presents an XML-based authoring methodology that facilitates the different tasks associated with the development of standards-compliant e-learning content development. The idea is to support a unified authoring process of adaptive e-learning content by adopting the manual writing metaphor. According to this metaphor, which is specially well-suited for technical domains, instructors are compelled to view e-learning material as the manuals normally written and used to teach a particular subject. The methodology is supported by the DocBook document model (an XML application) which has a number of tools associated that facilitate the implementation of the methodology. Other tasks such as the packaging of contents or publishing in the Learning Management System (LMS) can be automated from these manuals.
{"title":"Location Based Security and Message Authentication Services in Vehicular Ad Hoc Network (VANET)","authors":"P. Chandrasekar, A. Arul Lawrence Selvakumar","doi":"10.14355/IJCSA.2014.0302.04","DOIUrl":"https://doi.org/10.14355/IJCSA.2014.0302.04","url":null,"abstract":"This work presents an XML-based authoring methodology that facilitates the different tasks associated with the development of standards-compliant e-learning content development. The idea is to support a unified authoring process of adaptive e-learning content by adopting the manual writing metaphor. According to this metaphor, which is specially well-suited for technical domains, instructors are compelled to view e-learning material as the manuals normally written and used to teach a particular subject. The methodology is supported by the DocBook document model (an XML application) which has a number of tools associated that facilitate the implementation of the methodology. Other tasks such as the packaging of contents or publishing in the Learning Management System (LMS) can be automated from these manuals.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"50 1","pages":"91-108"},"PeriodicalIF":0.0,"publicationDate":"2014-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85731208","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-01DOI: 10.14355/IJCSA.2014.0302.01
G. Vert, Bilal Gonen, J. Brown
Intrusion detection systems have undergone numerous years of study and yet a great deal of problems remain; primarily a high percentage of false alarms and abysmal detection rates. A new type of threat has emerged that of Advanced Persistent Threat. This type of attack is known for being sophisticated and slow moving over a long period of time and is found in networked systems. Such threats may be detected by evaluation of large numbers of state variables describing complex system operation and state transitions over time. Analysis of such large numbers of variables is computationally inefficient especially if it is meant to be done in real time. The paper develops a completely new theoretical model that appears to be able to distill high order state variable data sets down to the essence of analytic changes in a system with APT operating. The model is based on the computationally efficient use of integer vectors. This approach has the capability to analyze threat over time, and has potential to detect, predict and classify new threat as being similar to threat already detected. The model presented is highly theoretical at this point with some initial prototype work demonstrated and some initial performance data.
{"title":"A Theoretical Model for Detection of Advanced Persistent Threat in Networks and Systems Using a Finite Angular State Velocity Machine (FAST-VM)","authors":"G. Vert, Bilal Gonen, J. Brown","doi":"10.14355/IJCSA.2014.0302.01","DOIUrl":"https://doi.org/10.14355/IJCSA.2014.0302.01","url":null,"abstract":"Intrusion detection systems have undergone numerous years of study and yet a great deal of problems remain; primarily a high percentage of false alarms and abysmal detection rates. A new type of threat has emerged that of Advanced Persistent Threat. This type of attack is known for being sophisticated and slow moving over a long period of time and is found in networked systems. Such threats may be detected by evaluation of large numbers of state variables describing complex system operation and state transitions over time. Analysis of such large numbers of variables is computationally inefficient especially if it is meant to be done in real time. The paper develops a completely new theoretical model that appears to be able to distill high order state variable data sets down to the essence of analytic changes in a system with APT operating. The model is based on the computationally efficient use of integer vectors. This approach has the capability to analyze threat over time, and has potential to detect, predict and classify new threat as being similar to threat already detected. The model presented is highly theoretical at this point with some initial prototype work demonstrated and some initial performance data.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"76 1","pages":"63"},"PeriodicalIF":0.0,"publicationDate":"2014-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"76351542","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-01DOI: 10.14355/ijcsa.2014.0302.03
Lei Tang, Zongtao Duan, Hanbo Wang, Zhiwen Yu
Various reminder systems have emerged to promote users’ health. However, it is hard to say such systems by which person is passively following the instructions can truly meet the goal. This means researchers are under pressure to find the ways of persuading a user to accept the instructions. Seeking the best time to provide the prompts is important to improve user adherence. A methodology is proposed by a following idea where the full benefit of the acceptable reminder will be achieved only if the user is open-minded to an interruption caused by it reasonably and closely. The time for prompting is thus evaluated before a decision on when a user is most receptive. We describe our experience in delivering the attention-sensitive reminders for elder adults to take their medication. Experimental results show that the approach can improve user adherence in an efficient and flexible way.
{"title":"Improving User Adherence to a Reminder: a Model and Methodology","authors":"Lei Tang, Zongtao Duan, Hanbo Wang, Zhiwen Yu","doi":"10.14355/ijcsa.2014.0302.03","DOIUrl":"https://doi.org/10.14355/ijcsa.2014.0302.03","url":null,"abstract":"Various reminder systems have emerged to promote users’ health. However, it is hard to say such systems by which person is passively following the instructions can truly meet the goal. This means researchers are under pressure to find the ways of persuading a user to accept the instructions. Seeking the best time to provide the prompts is important to improve user adherence. A methodology is proposed by a following idea where the full benefit of the acceptable reminder will be achieved only if the user is open-minded to an interruption caused by it reasonably and closely. The time for prompting is thus evaluated before a decision on when a user is most receptive. We describe our experience in delivering the attention-sensitive reminders for elder adults to take their medication. Experimental results show that the approach can improve user adherence in an efficient and flexible way.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"1 1","pages":"79"},"PeriodicalIF":0.0,"publicationDate":"2014-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83107821","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}
Sign Language is a meansof communication between audibly challenged people. To provide an interface between the audibly challenged community and the rest of the world we need Sign Language translators. A sign language recognition system computerizes the work of a sign language trEvery Sign Language Recognition (SLR) System is trained to recognizespecific sets of signs and they correspondingly output the sign in the required format. These SLR systems are built with powerful image processing techniques. The sign language recognition systems are capable of recognizing a specific set of signing gestures and output the corresponding text/audio. Most of these systems involve the techniques of detection, segmentation, tracking, gesture recognition and classification. This paperproposes a design for a SLR System.
{"title":"Segmentation, Tracking And Feature Extraction For Indian Sign Language Recognition","authors":"D. S, K. S., Nivin Anton A L, P. S.","doi":"10.5121/IJCSA.2014.4207","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4207","url":null,"abstract":"Sign Language is a meansof communication between audibly challenged people. To provide an interface between the audibly challenged community and the rest of the world we need Sign Language translators. A sign language recognition system computerizes the work of a sign language trEvery Sign Language Recognition (SLR) System is trained to recognizespecific sets of signs and they correspondingly output the sign in the required format. These SLR systems are built with powerful image processing techniques. The sign language recognition systems are capable of recognizing a specific set of signing gestures and output the corresponding text/audio. Most of these systems involve the techniques of detection, segmentation, tracking, gesture recognition and classification. This paperproposes a design for a SLR System.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"38 1","pages":"57-72"},"PeriodicalIF":0.0,"publicationDate":"2014-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73605080","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}
Recently we introduced an approach to increase sharpness of diffusion-junction and implanted-junction heterorectifiers. The heterorectifiers could by single and as a part of heterobipolar transistors. However manufacturing p-n-junctions by ion implantation leads to generation of radiation defects in materials of heterostructure. In this paper we introduce an approach to use an overlayer and optimization of annealing of radiation defects to decrease quantity of radiation defects.
{"title":"Decreasing of Quantity of Radiation De-Fects in Implanted-Junction Heterorec-Tifiers by Using Overlayers","authors":"E. Pankratov, E. Bulaeva","doi":"10.5121/IJCSA.2014.4203","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4203","url":null,"abstract":"Recently we introduced an approach to increase sharpness of diffusion-junction and implanted-junction heterorectifiers. The heterorectifiers could by single and as a part of heterobipolar transistors. However manufacturing p-n-junctions by ion implantation leads to generation of radiation defects in materials of heterostructure. In this paper we introduce an approach to use an overlayer and optimization of annealing of radiation defects to decrease quantity of radiation defects.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"141 1","pages":"21-29"},"PeriodicalIF":0.0,"publicationDate":"2014-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80130552","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}
This work is proposed thefeed forward neural network with symmetric table addition methodto design the neuron synapses algorithm of the sine function approximations, and according to theTaylor series expansion. Matlab code and LabVIEW are used to build and create the neural network , which has been designed and traineddatabase set to improve its performance, and gets the besta global convergence with small value of MSE errors and 97.22% accuracy.
{"title":"Feed Forward Neural Network For Sine Function With Symmetric Table Addition Method Using Labview And Matlab Code","authors":"Fadhil A. Ali","doi":"10.5121/IJCSA.2014.4201","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4201","url":null,"abstract":"This work is proposed thefeed forward neural network with symmetric table addition methodto design the neuron synapses algorithm of the sine function approximations, and according to theTaylor series expansion. Matlab code and LabVIEW are used to build and create the neural network , which has been designed and traineddatabase set to improve its performance, and gets the besta global convergence with small value of MSE errors and 97.22% accuracy.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"75 1","pages":"1-12"},"PeriodicalIF":0.0,"publicationDate":"2014-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84172016","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":"Security Issues in Grid Computing","authors":"N. Mishra, Ritu Yadav, S. Maheshwari","doi":"10.5121/IJCSA.2014.4118","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4118","url":null,"abstract":"","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"5 1","pages":"179-187"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90262531","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":"Model Based Testing of Website","authors":"Sumit Machra, Narendra Khatri","doi":"10.5121/IJCSA.2014.4114","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4114","url":null,"abstract":"","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"11 1","pages":"143-152"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84309326","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":"Augmented Split –protocol; An Ultimate DDoS Defender","authors":"B. Rawal, H. Ramcharan, Anthony K. Tsetse","doi":"10.5121/IJCSA.2014.4107","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4107","url":null,"abstract":"","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"43 1","pages":"65-81"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88481777","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}
Parikh matrix of a word gives numerical information of the word in terms of its subwords.In this Paper an algorithm for finding Parikh matrix of a binary wordis introduced. With the help of this algorithm Parikh matrix of a binary word, however large it may be can be found out. M-ambiguous words are the problem of Parikh matrix. In this paper an algorithm is shown to find the M - ambiguous words of a binary ordered word instantly. We have introduced a system to represent binary words in a two dimensional field. We see that there are some relations among the representations of M -ambiguous words in the two dimensional field. We have also introduced a set of equations which will help us to calculate the M - ambiguous words.
{"title":"SOME ALTERNATIVE WAYS TO FIND M -AMBIGUOUS BINARY WORDS CORRESP ONDING TO A PARIKH MATRIX","authors":"Amrita Bhattacharjee, B. S. Purkayastha","doi":"10.5121/IJCSA.2014.4106","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4106","url":null,"abstract":"Parikh matrix of a word gives numerical information of the word in terms of its subwords.In this Paper an algorithm for finding Parikh matrix of a binary wordis introduced. With the help of this algorithm Parikh matrix of a binary word, however large it may be can be found out. M-ambiguous words are the problem of Parikh matrix. In this paper an algorithm is shown to find the M - ambiguous words of a binary ordered word instantly. We have introduced a system to represent binary words in a two dimensional field. We see that there are some relations among the representations of M -ambiguous words in the two dimensional field. We have also introduced a set of equations which will help us to calculate the M - ambiguous words.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"41 1","pages":"53-64"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72688130","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
扫码关注我们
求助内容：
应助结果提醒方式：