Pub Date : 2014-12-01DOI: 10.1109/ICCIC.2014.7238479
S. V. Appaji, G. Acharyulu
The Four Stage Encryption System introduced by Acharyulu and Appaji provides secrecy even when the attacker has some samples of plain texts and their corresponding cipher texts obtained with the same key, because the cipher text generated each time, for the same plain text with the same key, is different. In other words, the system is secure against adaptive chosen-plain text attack. Another interesting feature is that even the size of the cipher text, for given plain text under a given key, is unpredictable. In this paper the use of the system and sensible evidence to the strength of the system are demonstrated by executing it sufficiently large number of times for different choices of plain texts and keys.
{"title":"A study of four stage encryption: Experimental results","authors":"S. V. Appaji, G. Acharyulu","doi":"10.1109/ICCIC.2014.7238479","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238479","url":null,"abstract":"The Four Stage Encryption System introduced by Acharyulu and Appaji provides secrecy even when the attacker has some samples of plain texts and their corresponding cipher texts obtained with the same key, because the cipher text generated each time, for the same plain text with the same key, is different. In other words, the system is secure against adaptive chosen-plain text attack. Another interesting feature is that even the size of the cipher text, for given plain text under a given key, is unpredictable. In this paper the use of the system and sensible evidence to the strength of the system are demonstrated by executing it sufficiently large number of times for different choices of plain texts and keys.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125190160","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-12-01DOI: 10.1109/ICCIC.2014.7238449
J. P. Sharma, Vibhor Chauhan
Voltage sags during short-circuit faults are one of the major power quality problems and voltage sag mitigation at point of common coupling (PCC) is proposed using solid state fault current limiter (SSFCL). The proposed SSFCL is tested on a practical express distribution feeder, Bajaj hospital in a MATLAB/SIMULINK environment. Proposed SSFCL mitigate voltage sag at PCC for various unsymmetrical/symmetrical faults such single phase-to-ground, phase-to-phase, three phase and two-phase-to ground faults. In present scenario increased demand of electricity has raised short circuit level of power system. Proposed SSFCL also limit fault current significantly and thus reduced short circuit level and electromagnetic stress in associated equipment's. The performance of proposed SSFCL is evaluated in the forms of voltage sag mitigation and suppression of fault current for unsymmetrical/symmetrical faults and it is shown that, SSFCL has tremendous competence of suppressing the fault current and voltage mitigation quasi instantaneously that leads more reliable and stable condition of system.
{"title":"Application of solid state fault current limiter on express feeder for voltage sag mitigation","authors":"J. P. Sharma, Vibhor Chauhan","doi":"10.1109/ICCIC.2014.7238449","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238449","url":null,"abstract":"Voltage sags during short-circuit faults are one of the major power quality problems and voltage sag mitigation at point of common coupling (PCC) is proposed using solid state fault current limiter (SSFCL). The proposed SSFCL is tested on a practical express distribution feeder, Bajaj hospital in a MATLAB/SIMULINK environment. Proposed SSFCL mitigate voltage sag at PCC for various unsymmetrical/symmetrical faults such single phase-to-ground, phase-to-phase, three phase and two-phase-to ground faults. In present scenario increased demand of electricity has raised short circuit level of power system. Proposed SSFCL also limit fault current significantly and thus reduced short circuit level and electromagnetic stress in associated equipment's. The performance of proposed SSFCL is evaluated in the forms of voltage sag mitigation and suppression of fault current for unsymmetrical/symmetrical faults and it is shown that, SSFCL has tremendous competence of suppressing the fault current and voltage mitigation quasi instantaneously that leads more reliable and stable condition of system.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125630244","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-12-01DOI: 10.1109/ICCIC.2014.7238340
Moin Hasan, Major Singh Goraya
Multi-processor systems are advantageous in the sense that they allow concurrent execution of the given workload. The workload can be thought as the computation units which can be either processes or tasks. These processes or tasks can either be independent programs or partitioned modules of a single program. This paper presents an algorithm named as “Successive Stage Multi Round Scheduling” which is able to allocate and balance the given workload among the connected processing units of the Multi-processor system in order to improve the efficiency of the system. Simulation results are obtained using the hypercube architecture due to its simple design and high interconnectivity and results are compared with two existing schemes namely “Minimum Distance Scheduling” and “Two Round Scheduling".
{"title":"Successive stage multi-round scheduling for cube based multi-processor systems","authors":"Moin Hasan, Major Singh Goraya","doi":"10.1109/ICCIC.2014.7238340","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238340","url":null,"abstract":"Multi-processor systems are advantageous in the sense that they allow concurrent execution of the given workload. The workload can be thought as the computation units which can be either processes or tasks. These processes or tasks can either be independent programs or partitioned modules of a single program. This paper presents an algorithm named as “Successive Stage Multi Round Scheduling” which is able to allocate and balance the given workload among the connected processing units of the Multi-processor system in order to improve the efficiency of the system. Simulation results are obtained using the hypercube architecture due to its simple design and high interconnectivity and results are compared with two existing schemes namely “Minimum Distance Scheduling” and “Two Round Scheduling\".","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122784083","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-12-01DOI: 10.1109/ICCIC.2014.7238520
M. Beri
Control of direction of motor rotation is achieved via real-time image acquisition and processing. The model is prepared using Matlab and Simulink platforms and input is taken via any camera attached to the system. Commands are executed to rotate the rotor in either direction depending upon the movement of any object in front of the camera, be it a pencil, a pen, a human finger, a human eyeball or any body part for that matter. No costly system is required besides a webcam for image capturing and a dc motor. This novel controlling system befits all and highly reduces human effort. Besides bringing rapidity in execution of systems, it is a boon for the motor disabled.
{"title":"Rotation direction control by finger movement","authors":"M. Beri","doi":"10.1109/ICCIC.2014.7238520","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238520","url":null,"abstract":"Control of direction of motor rotation is achieved via real-time image acquisition and processing. The model is prepared using Matlab and Simulink platforms and input is taken via any camera attached to the system. Commands are executed to rotate the rotor in either direction depending upon the movement of any object in front of the camera, be it a pencil, a pen, a human finger, a human eyeball or any body part for that matter. No costly system is required besides a webcam for image capturing and a dc motor. This novel controlling system befits all and highly reduces human effort. Besides bringing rapidity in execution of systems, it is a boon for the motor disabled.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121636673","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-12-01DOI: 10.1109/ICCIC.2014.7238518
R. Anbunathan, A. Basu
Android mobile testing is challenging as it involves several applications to be tested. Automated testing involves lot of script writing or instrumentation of source code. In this paper, designing a crawler algorithm without any source code instrumentation (Block box approach) is discussed. In this approach, UI Automator is the tool used to learn User Interface (UI) objects of each screen recursively. The properties of these objects are stored in a database for navigating through menu tree to detect application crash. The effectiveness of this method is studied and compared with other methods.
{"title":"A recursive crawler algorithm to detect crash in Android application","authors":"R. Anbunathan, A. Basu","doi":"10.1109/ICCIC.2014.7238518","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238518","url":null,"abstract":"Android mobile testing is challenging as it involves several applications to be tested. Automated testing involves lot of script writing or instrumentation of source code. In this paper, designing a crawler algorithm without any source code instrumentation (Block box approach) is discussed. In this approach, UI Automator is the tool used to learn User Interface (UI) objects of each screen recursively. The properties of these objects are stored in a database for navigating through menu tree to detect application crash. The effectiveness of this method is studied and compared with other methods.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127680280","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-12-01DOI: 10.1109/ICCIC.2014.7238295
B. Jeevarani, Asst K Chitra, Professor
Nowadays cloud computing is the fastest growing technology that is used as a source of providing service through Internet. It is an enhanced model of Utility Computing. It embodies all technologies in Computer Architecture. It delivers the clients the needed applications, processes and Information as a service. It provides software platform as a service and virtualized servers, storage area and networks as a service. In addition to that it also manages and delivers database services. The traditional time consuming way of database management degrades the system performance. At present a weak form of consistency is maintained in cloud computing environment. This paper introduces an improved consistency model for cloud computing platform using prioritized read-write mechanism.
{"title":"Improved consistency model in cloud computing databases","authors":"B. Jeevarani, Asst K Chitra, Professor","doi":"10.1109/ICCIC.2014.7238295","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238295","url":null,"abstract":"Nowadays cloud computing is the fastest growing technology that is used as a source of providing service through Internet. It is an enhanced model of Utility Computing. It embodies all technologies in Computer Architecture. It delivers the clients the needed applications, processes and Information as a service. It provides software platform as a service and virtualized servers, storage area and networks as a service. In addition to that it also manages and delivers database services. The traditional time consuming way of database management degrades the system performance. At present a weak form of consistency is maintained in cloud computing environment. This paper introduces an improved consistency model for cloud computing platform using prioritized read-write mechanism.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132797610","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-12-01DOI: 10.1109/ICCIC.2014.7238374
M. Bhanumurthy, Koteswararao Anne
Medical image segmentation is a crucial process which makes possible, the characterization and visualization of the structure of interest in medical images. Brain MRI segmentation is a more difficult procedure because of inconsistency of abnormal tissues like tumor. In this paper, we propose a fully automated technique that uses artificial intelligence to detect and segment abnormal tissues like tumor and atrophy in brain MRI images accurately. Three stages are offered in our work: (1) Feature Extraction (2) Classification and (3) Segmentation. The extracted features like energy, entropy, homogeneity, contrast and correlation from the brain MRI images are applied as input to an artificial intelligence system that uses a Neuro-fuzzy classifier which classifies the images into normal or abnormal. The abnormal tissues like tumor and atrophy are then segmented using region growing method. The accuracy of the segmentation results are assessed with metrics like False Positive Ratio (FPR), False Negative Ratio (FNR), Specificity, Sensitivity and Accuracy. This entire procedure is developed as a Graphical User Interface (GUI) system which results in automated detection and segmentation of tumor.
{"title":"An automated detection and segmentation of tumor in brain MRI using artificial intelligence","authors":"M. Bhanumurthy, Koteswararao Anne","doi":"10.1109/ICCIC.2014.7238374","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238374","url":null,"abstract":"Medical image segmentation is a crucial process which makes possible, the characterization and visualization of the structure of interest in medical images. Brain MRI segmentation is a more difficult procedure because of inconsistency of abnormal tissues like tumor. In this paper, we propose a fully automated technique that uses artificial intelligence to detect and segment abnormal tissues like tumor and atrophy in brain MRI images accurately. Three stages are offered in our work: (1) Feature Extraction (2) Classification and (3) Segmentation. The extracted features like energy, entropy, homogeneity, contrast and correlation from the brain MRI images are applied as input to an artificial intelligence system that uses a Neuro-fuzzy classifier which classifies the images into normal or abnormal. The abnormal tissues like tumor and atrophy are then segmented using region growing method. The accuracy of the segmentation results are assessed with metrics like False Positive Ratio (FPR), False Negative Ratio (FNR), Specificity, Sensitivity and Accuracy. This entire procedure is developed as a Graphical User Interface (GUI) system which results in automated detection and segmentation of tumor.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134500063","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-12-01DOI: 10.1109/ICCIC.2014.7238381
Patteti Krishna, T. Kumar, K. K. Rao
In this paper, Long Term Evolution (LTE) Cellular networks provides higher bit rates and consequently higher spectral efficiencies. Quadrature Amplitude Modulation has been adopted by most wireless communication standards such as Long Term Evolution (LTE). We analyses the Bit error rate (BER) of M-ary QAM in both multipath fading channels such as Rayleigh fading and Additive white gaussian noise (AWGN) channels. The simulation shows between the BER and energy per bit to noise power spectral density.
{"title":"M-QAM bit error rate analysis of multipath channels in LTE system","authors":"Patteti Krishna, T. Kumar, K. K. Rao","doi":"10.1109/ICCIC.2014.7238381","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238381","url":null,"abstract":"In this paper, Long Term Evolution (LTE) Cellular networks provides higher bit rates and consequently higher spectral efficiencies. Quadrature Amplitude Modulation has been adopted by most wireless communication standards such as Long Term Evolution (LTE). We analyses the Bit error rate (BER) of M-ary QAM in both multipath fading channels such as Rayleigh fading and Additive white gaussian noise (AWGN) channels. The simulation shows between the BER and energy per bit to noise power spectral density.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124684867","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-12-01DOI: 10.1109/ICCIC.2014.7238444
A. Suresh, M. Kiran, C. S. Kumar
In this paper, a new auto tuning least square optimization tuning technique is presented to design Wood and Berry (WB) distillation column. It has Two Inputs and Two Outputs (TITO) binary distillation column. Design of TITO systems with decentralized, centralized, decouplers (compensators) and optimization tuning methods are not guaranteed to achieve desired output response. By adopting least square optimization tuning, it acts like an auto tuning control strategy. Hence, best performance characteristics of the system can be obtained. Here, WB TITO system is designed with full centralized structure and its PID values are evaluated from the MATLAB simulation program. Performance of the closed loop system is compared with Real Coded Genetic algorithm (RGA) and Covariance Matrix Adaption Evolution Strategy (CMAES). Best simulation results and performance indices values are obtained in least square optimization tuning method.
{"title":"Design PID controller for TITO process based on least square optimization tuning method","authors":"A. Suresh, M. Kiran, C. S. Kumar","doi":"10.1109/ICCIC.2014.7238444","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238444","url":null,"abstract":"In this paper, a new auto tuning least square optimization tuning technique is presented to design Wood and Berry (WB) distillation column. It has Two Inputs and Two Outputs (TITO) binary distillation column. Design of TITO systems with decentralized, centralized, decouplers (compensators) and optimization tuning methods are not guaranteed to achieve desired output response. By adopting least square optimization tuning, it acts like an auto tuning control strategy. Hence, best performance characteristics of the system can be obtained. Here, WB TITO system is designed with full centralized structure and its PID values are evaluated from the MATLAB simulation program. Performance of the closed loop system is compared with Real Coded Genetic algorithm (RGA) and Covariance Matrix Adaption Evolution Strategy (CMAES). Best simulation results and performance indices values are obtained in least square optimization tuning method.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125477068","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-12-01DOI: 10.1109/ICCIC.2014.7238566
D. Saravanapriya, Dr M Karthikeyan
Sentence Clustering is performed based on the key terms in sentences within a document or group of documents. A sentence may come under different topics in a single document with different word of similar meaning which will not be clustered correctly by using hierarchical clustering methods. Hierarchical clustering methods are robust. They are not very efficient as its time complexity is O (n2). To overcome this problem, K-means type algorithms are used, but it handles only few documents. A proposed algorithm uses both hierarchical and partitional clustering method alternatively. It increases the accuracy and reduces the time complexity for multiple news articles. It is applied to group the text spans from multiple news articles that refer to the same event.
{"title":"Clustering sentences to discover events from multiple news articles using Buckshot and Fractionation","authors":"D. Saravanapriya, Dr M Karthikeyan","doi":"10.1109/ICCIC.2014.7238566","DOIUrl":"https://doi.org/10.1109/ICCIC.2014.7238566","url":null,"abstract":"Sentence Clustering is performed based on the key terms in sentences within a document or group of documents. A sentence may come under different topics in a single document with different word of similar meaning which will not be clustered correctly by using hierarchical clustering methods. Hierarchical clustering methods are robust. They are not very efficient as its time complexity is O (n2). To overcome this problem, K-means type algorithms are used, but it handles only few documents. A proposed algorithm uses both hierarchical and partitional clustering method alternatively. It increases the accuracy and reduces the time complexity for multiple news articles. It is applied to group the text spans from multiple news articles that refer to the same event.","PeriodicalId":187874,"journal":{"name":"2014 IEEE International Conference on Computational Intelligence and Computing Research","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131616559","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
扫码关注我们
求助内容：
应助结果提醒方式：