{"title":"Experimental Analysis of Channel Interference in Ad Hoc Network","authors":"Anup Bhola, Uma Sharma, C. Jha","doi":"10.5121/ijcsa.2014.4120","DOIUrl":"https://doi.org/10.5121/ijcsa.2014.4120","url":null,"abstract":"","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"44 1","pages":"197-203"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90829846","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}
In this paper we present text dependent speaker recognition with an enhancement of detecting the emotion of the speaker prior using the hybrid FFBN and GMM methods. The emotional state of the speaker influences recognition system. Mel-frequency Cepstral Coefficient (MFCC) feature set is used for experimentation. To recognize the emotional state of a speaker Gaussian Mixture Model (GMM) is used in training phase and in testing phase Feed Forward Back Propagation Neural Network (FFBNN). Speech database consisting of 25 speakers recorded in five different emotional states: happy, angry, sad, surprise and neutral is used for experimentation. The results reveal that the emotional state of the speaker shows a significant impact on the accuracy of speaker recognition.
{"title":"Automatic Speech Emotion and Speaker Recognition Based on Hybrid GMM and FFBNN","authors":"J. SirishaDevi, Yarramalle Srinivas, S. Nandyala","doi":"10.5121/IJCSA.2014.4104","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4104","url":null,"abstract":"In this paper we present text dependent speaker recognition with an enhancement of detecting the emotion of the speaker prior using the hybrid FFBN and GMM methods. The emotional state of the speaker influences recognition system. Mel-frequency Cepstral Coefficient (MFCC) feature set is used for experimentation. To recognize the emotional state of a speaker Gaussian Mixture Model (GMM) is used in training phase and in testing phase Feed Forward Back Propagation Neural Network (FFBNN). Speech database consisting of 25 speakers recorded in five different emotional states: happy, angry, sad, surprise and neutral is used for experimentation. The results reveal that the emotional state of the speaker shows a significant impact on the accuracy of speaker recognition.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"113 1","pages":"35-42"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83077802","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}
In this paper we introduce an approach to model technological process of manufacture of a field-effect heterotransistor. The modeling gives us possibility to optimize the technological process to decrease length of channel by using mechanical stress. As accompanying results of the decreasing one can find decreasing of thickness of the heterotransistors and increasing of their density, which were comprised in integrated circuits.
{"title":"Modeling of Manufacturing of a Field-Effect Transistor to Determine Conditions to Decrease Length of Channel","authors":"P. E.L, Bulaeva E.A","doi":"10.5121/IJCSA.2014.4105","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4105","url":null,"abstract":"In this paper we introduce an approach to model technological process of manufacture of a field-effect heterotransistor. The modeling gives us possibility to optimize the technological process to decrease length of channel by using mechanical stress. As accompanying results of the decreasing one can find decreasing of thickness of the heterotransistors and increasing of their density, which were comprised in integrated circuits.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"98 1","pages":"43-52"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79243213","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}
Graph coloring is the assignment of colors to the graph vertices and edges in the graph theory. We can divide the graph coloring in two types. The first is vertex coloring and the second is edge coloring. The condition which we follow in graph coloring is that the incident vertices/edges have not the same color. There are some algorithms which solve the problem of graph coloring. Some are offline algorithm and others are online algorithm. Where offline means the graph is known in advance and the online means that the edges of the graph are arrive one by one as an input, and We need to color each edge as soon as it is added to the graph and the main issue is that we want to minimize the number of colors. We cannot change the color of an edge after colored in an online algorithm. In this paper, we improve the online algorithm for edge coloring. There is also a theorem which proves that if the maximum degree of a graph is Δ, then it is possible to color its edges, in polynomial time, using at most Δ+ 1 color. The algorithm provided by Vizing is offline, i.e., it assumes the whole graph is known in advance. In online algorithm edges arrive one by one in a random permutation. This online algorithm is inspired by a distributed offline algorithm of Panconesi and Srinivasan, referred as PS algorithm, works on 2-rounds which we extend by reusing colors online in multiple rounds.
{"title":"Extended Online Graph Edge Coloring","authors":"Lata Naharwal, Dalpat Songara","doi":"10.5121/IJCSA.2014.4117","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4117","url":null,"abstract":"Graph coloring is the assignment of colors to the graph vertices and edges in the graph theory. We can divide the graph coloring in two types. The first is vertex coloring and the second is edge coloring. The condition which we follow in graph coloring is that the incident vertices/edges have not the same color. There are some algorithms which solve the problem of graph coloring. Some are offline algorithm and others are online algorithm. Where offline means the graph is known in advance and the online means that the edges of the graph are arrive one by one as an input, and We need to color each edge as soon as it is added to the graph and the main issue is that we want to minimize the number of colors. We cannot change the color of an edge after colored in an online algorithm. In this paper, we improve the online algorithm for edge coloring. There is also a theorem which proves that if the maximum degree of a graph is Δ, then it is possible to color its edges, in polynomial time, using at most Δ+ 1 color. The algorithm provided by Vizing is offline, i.e., it assumes the whole graph is known in advance. In online algorithm edges arrive one by one in a random permutation. This online algorithm is inspired by a distributed offline algorithm of Panconesi and Srinivasan, referred as PS algorithm, works on 2-rounds which we extend by reusing colors online in multiple rounds.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"78 1","pages":"171-178"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82261845","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":"Energy Efficient MAC Protocols for Wireless Sensor Network","authors":"Shweta Agarwal, V. Jain, Kuldeep Goswami","doi":"10.5121/IJCSA.2014.4115","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4115","url":null,"abstract":"","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"67 1","pages":"153-160"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83582401","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}
We have proposed new approach for the speech recognition system by applying kernel adaptive filterfor speech enhancement and for the recognition,the hybrid HMM/DTW methods are usedin this paper. Noise removal is very important in many applications like telephone con versation, speech recognition, etc.In the recent past, the kernel methods are showing good results for speech processing applications . The feature used in the recognition process is MFCC features. It consists of a HMM system used to trainthe speech features and for classification purpose used the DTW method. Experimental results show a relative improvementof recognition rate compared to the traditional methods.
{"title":"Hybrid HMM/DTW based Speech Recognition with Kernel Adaptive Filtering Method","authors":"Cyril Onwubiko, K. Ouazzane","doi":"10.5121/IJCSA.2014.4102","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4102","url":null,"abstract":"We have proposed new approach for the speech recognition system by applying kernel adaptive filterfor speech enhancement and for the recognition,the hybrid HMM/DTW methods are usedin this paper. Noise removal is very important in many applications like telephone con versation, speech recognition, etc.In the recent past, the kernel methods are showing good results for speech processing applications . The feature used in the recognition process is MFCC features. It consists of a HMM system used to trainthe speech features and for classification purpose used the DTW method. Experimental results show a relative improvementof recognition rate compared to the traditional methods.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"19 1","pages":"11-21"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82608879","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":"Computation Grid As A Connected World","authors":"Ayushi Mathur, Megha Jain, S. Maheshwari","doi":"10.5121/IJCSA.2014.4119","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4119","url":null,"abstract":"","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"10 1","pages":"189-196"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73698724","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}
The term malware stands for malicious software. It is a program installed on a system without the knowledge of owner of the system. It is basically installed by the third party with the intention to steal some private data from the system or simply just to play pranks. This in turn threatens the computer’s security, wherein computer are used by one’s in day-to-day life as to deal with various necessities like education, communication, hospitals, banking, entertainment etc. Different traditional techniques are used to detect and defend these malwares like Antivirus Scanner (AVS), firewalls, etc. But today malware writers are one step forward towards then Malware detectors. Day-by-day they write new malwares, which become a great challenge for malware detectors. This paper focuses on basis study of malwares and various detection techniques which can be used to detect malwares.
{"title":"Basic survey on Malware Analysis, Tools and Techniques","authors":"D. Uppal, Vishakha Mehra, V. Verma","doi":"10.5121/IJCSA.2014.4110","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4110","url":null,"abstract":"The term malware stands for malicious software. It is a program installed on a system without the knowledge of owner of the system. It is basically installed by the third party with the intention to steal some private data from the system or simply just to play pranks. This in turn threatens the computer’s security, wherein computer are used by one’s in day-to-day life as to deal with various necessities like education, communication, hospitals, banking, entertainment etc. Different traditional techniques are used to detect and defend these malwares like Antivirus Scanner (AVS), firewalls, etc. But today malware writers are one step forward towards then Malware detectors. Day-by-day they write new malwares, which become a great challenge for malware detectors. This paper focuses on basis study of malwares and various detection techniques which can be used to detect malwares.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"8 1","pages":"103-112"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75361161","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}
A. Dubey, Dilip Sisodia, D. Khunteta, Amara Ram Saini, Vikas Chaturvedi
In the 21 st century, everywhere people analyze &measure societal. The new trend to compute the societal is known as social computing. The emerging trend of research focuses interaction of technologies with humanity. This interaction can be either man machine interaction or human computer interaction. T his article conveys the brief description of social computing and social impact of computing into variant environment. It optimises the interaction technology, ubiquitous computing and pervasive computing. Subsequently affective computing is discussed withartificial intelligence to motivate the automation of technology in social computing.
{"title":"EMERGED COMPUTER INTERACTION WITH HUMANITY :SOCIAL COMPUTING","authors":"A. Dubey, Dilip Sisodia, D. Khunteta, Amara Ram Saini, Vikas Chaturvedi","doi":"10.5121/IJCSA.2014.4116","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4116","url":null,"abstract":"In the 21 st century, everywhere people analyze &measure societal. The new trend to compute the societal is known as social computing. The emerging trend of research focuses interaction of technologies with humanity. This interaction can be either man machine interaction or human computer interaction. T his article conveys the brief description of social computing and social impact of computing into variant environment. It optimises the interaction technology, ubiquitous computing and pervasive computing. Subsequently affective computing is discussed withartificial intelligence to motivate the automation of technology in social computing.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"45 1","pages":"161-169"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77690370","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}
In present paper, a proposed expert system is designed to obtain a trained formulae for the optical model parameters used in elastic scattering neutrons of light nuclei for (Li), at energy range between [(1) to (20)] MeV. A simple algorithm has used to design this expert system, while a multi-layer backwardpropagation neural network (BPNN) is applied for training and testing the data used in this model. This group of formulae may get a simple expert system occurring from governing formulae model, and predicts the critical parameters usually resulted from the complicated computer coding methods. This expert system may use in nuclear reactions yields in both fission and fusion nature who gives more closely results to the real model.
{"title":"Expert System Design for Elastic Scattering Neutrons Optical Model using BPNN","authors":"Fadhil A. Ali","doi":"10.5121/IJCSA.2014.4101","DOIUrl":"https://doi.org/10.5121/IJCSA.2014.4101","url":null,"abstract":"In present paper, a proposed expert system is designed to obtain a trained formulae for the optical model parameters used in elastic scattering neutrons of light nuclei for (Li), at energy range between [(1) to (20)] MeV. A simple algorithm has used to design this expert system, while a multi-layer backwardpropagation neural network (BPNN) is applied for training and testing the data used in this model. This group of formulae may get a simple expert system occurring from governing formulae model, and predicts the critical parameters usually resulted from the complicated computer coding methods. This expert system may use in nuclear reactions yields in both fission and fusion nature who gives more closely results to the real model.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"46 1","pages":"1-9"},"PeriodicalIF":0.0,"publicationDate":"2014-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81778101","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
扫码关注我们
求助内容：
应助结果提醒方式：