Pub Date : 2017-09-01DOI: 10.1109/ISPCC.2017.8269714
Priyanka Jangra, Monish Gupta
Internet of Things (IoT) has drawn attention recently as a means of connecting the proliferating embedded devices to the Internet. IoT devices are forecast to grow to 33 billion by 2035. These devices include sensing devices, security cameras, mobile phones, and home automation/control devices. Alike WSN, IoT seems to be developed at much larger scale and ma have much more wider applications. To deploy such architectures there is a sturdy requirement of understanding various techniques being used widely by the proposed schemes. Thus, this paper works over to define and give a new direction to identify the right technique for the IoT architectures in terms of cryptography.
物联网(Internet of Things, IoT)作为一种将激增的嵌入式设备连接到互联网的手段，最近引起了人们的关注。到2035年，物联网设备预计将增长到330亿台。这些设备包括传感设备、安全摄像头、移动电话和家庭自动化/控制设备。与WSN一样，物联网的发展规模更大，应用范围也更广泛。要部署这样的体系结构，就需要理解被提议的方案广泛使用的各种技术。因此，本文致力于定义并给出一个新的方向，以确定在密码学方面适合物联网架构的技术。
{"title":"Expositioning of cryptography techniques in IoT domain","authors":"Priyanka Jangra, Monish Gupta","doi":"10.1109/ISPCC.2017.8269714","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269714","url":null,"abstract":"Internet of Things (IoT) has drawn attention recently as a means of connecting the proliferating embedded devices to the Internet. IoT devices are forecast to grow to 33 billion by 2035. These devices include sensing devices, security cameras, mobile phones, and home automation/control devices. Alike WSN, IoT seems to be developed at much larger scale and ma have much more wider applications. To deploy such architectures there is a sturdy requirement of understanding various techniques being used widely by the proposed schemes. Thus, this paper works over to define and give a new direction to identify the right technique for the IoT architectures in terms of cryptography.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129039480","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 : 2017-09-01DOI: 10.1109/ISPCC.2017.8269721
Damandeep Kaur, G. K. Walia
Ant colony optimization (ACO) is algorithm used for optimization motivated by the natural behaviour of species of ants. In this ants retain pheromone for foraging at the ground. ACO has been originated to detect the edges of microscopic images of blood samples which are affected by malaria disease. The edge detection approach of ACO is used to maintain pheromone matrix which determines the information of edges provided at every image pixel position, based on no. of ants movement that are dispatched to be in motion on the image. Thus, changes in the intensity values of images determine the movement of the ants. The results have been taken to study an approach for Ant Colony Edge Detection method.
{"title":"Edge detection of Malaria parasites using ant colony optimization","authors":"Damandeep Kaur, G. K. Walia","doi":"10.1109/ISPCC.2017.8269721","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269721","url":null,"abstract":"Ant colony optimization (ACO) is algorithm used for optimization motivated by the natural behaviour of species of ants. In this ants retain pheromone for foraging at the ground. ACO has been originated to detect the edges of microscopic images of blood samples which are affected by malaria disease. The edge detection approach of ACO is used to maintain pheromone matrix which determines the information of edges provided at every image pixel position, based on no. of ants movement that are dispatched to be in motion on the image. Thus, changes in the intensity values of images determine the movement of the ants. The results have been taken to study an approach for Ant Colony Edge Detection method.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"43 10","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121011696","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 : 2017-09-01DOI: 10.1109/ISPCC.2017.8269701
Vicky Kumar, Ashok Kumar, Manjeet Singh
The base station (BS) is the main device in a wireless sensor network (WSN) and used to collect data from all the sensor nodes. The information of the whole network is stored in the BS and hence it is always targeted by the adversaries who want to interrupt the operation of the network. The nodes transmit their data to the BS using multi-hop technique and hence form an eminent traffic pattern that can be easily observed by a remote adversary. The presented research aims to increase the anonymity of the BS. The proposed scheme uses a mobile BS and ring nodes to complete the above mentioned objective. The simulation results show that the proposed scheme has superior outcomes as compared to the existing techniques.
{"title":"Boosting anonymity in wireless sensor networks","authors":"Vicky Kumar, Ashok Kumar, Manjeet Singh","doi":"10.1109/ISPCC.2017.8269701","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269701","url":null,"abstract":"The base station (BS) is the main device in a wireless sensor network (WSN) and used to collect data from all the sensor nodes. The information of the whole network is stored in the BS and hence it is always targeted by the adversaries who want to interrupt the operation of the network. The nodes transmit their data to the BS using multi-hop technique and hence form an eminent traffic pattern that can be easily observed by a remote adversary. The presented research aims to increase the anonymity of the BS. The proposed scheme uses a mobile BS and ring nodes to complete the above mentioned objective. The simulation results show that the proposed scheme has superior outcomes as compared to the existing techniques.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121983439","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 : 2017-09-01DOI: 10.1109/ISPCC.2017.8269725
Mohit Garg
Dynamic systems are mostly complex, time-varying and of higher order. This paper presents model order reduction scheme used for the order reduction of complex, higher order dynamic systems. The proposed scheme for reduction of higher order system transfer function is based on modified-pole clustering and coefficient matching technique. The efforts has been made in this paper to decrease the order of the given transfer function and essentially preserving all the useful characteristics of the original transfer function using the proposed scheme. Some other techniques used for the reduction of model dimension are also described and analyzed. An example has been included to illustrate the proposed method of model order reduction for analysis and control of a dynamic system. The present method is compared with other order reduction method and concluding remarks are presented.
{"title":"Model order reduction and approximation analysis for control system design","authors":"Mohit Garg","doi":"10.1109/ISPCC.2017.8269725","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269725","url":null,"abstract":"Dynamic systems are mostly complex, time-varying and of higher order. This paper presents model order reduction scheme used for the order reduction of complex, higher order dynamic systems. The proposed scheme for reduction of higher order system transfer function is based on modified-pole clustering and coefficient matching technique. The efforts has been made in this paper to decrease the order of the given transfer function and essentially preserving all the useful characteristics of the original transfer function using the proposed scheme. Some other techniques used for the reduction of model dimension are also described and analyzed. An example has been included to illustrate the proposed method of model order reduction for analysis and control of a dynamic system. The present method is compared with other order reduction method and concluding remarks are presented.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126401569","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 : 2017-09-01DOI: 10.1109/ISPCC.2017.8269695
Jyotsna Dogra, M. Sood, Shruti Jain, Navdeep Parashar
In the recent years, image segmentation has become one of the important technique in several generalpurpose fields where it has been used to extract region of interest from the background. Image segmentation is a classic subject in the field of image processing which has a special focus on image processing techniques. Since, in literature there is no general solution to the image segmentation problem, various techniques have been employed to effectively solve these problems combined with the domain knowledge. A lot of brainstorming has been done to come up with an optimal technique to make images smooth and easy to evaluate. Among various image segmentation techniques, thresholding is one of the simplest techniques that has been used for image segmentation where the region of interest has been extracted from the background by comparing the pixel values with the threshold value. To obtain the threshold value histogram of the image has been calculated. The results shows that any abnormality can be localized easily in horizontal divided MRI brain image rather than in vertical divided MRI image.
{"title":"Segmentation of magnetic resonance images of brain using thresholding techniques","authors":"Jyotsna Dogra, M. Sood, Shruti Jain, Navdeep Parashar","doi":"10.1109/ISPCC.2017.8269695","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269695","url":null,"abstract":"In the recent years, image segmentation has become one of the important technique in several generalpurpose fields where it has been used to extract region of interest from the background. Image segmentation is a classic subject in the field of image processing which has a special focus on image processing techniques. Since, in literature there is no general solution to the image segmentation problem, various techniques have been employed to effectively solve these problems combined with the domain knowledge. A lot of brainstorming has been done to come up with an optimal technique to make images smooth and easy to evaluate. Among various image segmentation techniques, thresholding is one of the simplest techniques that has been used for image segmentation where the region of interest has been extracted from the background by comparing the pixel values with the threshold value. To obtain the threshold value histogram of the image has been calculated. The results shows that any abnormality can be localized easily in horizontal divided MRI brain image rather than in vertical divided MRI image.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127338229","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 : 2017-09-01DOI: 10.1109/ISPCC.2017.8269671
R. Kumar, Swati Gupta
This study designed a scheduling algorithm for Cloud Computing Environment by taking values of different parameters from a file provided by a user which gives the details of different cloudlets to be made. The cloudlets are assigned to different hosts according to the Shortest Deadline First combined with First Come First Serve where the Cloudlets are being submitted at different arrival times. The deadline provided by user is used to determine whether the Cloudlet is able to finish execution in the prescribed time interval or not. This implementation increased the number of jobs that finished executing in a particular time interval, thereby minimising the number of cloudlets that missed the deadline as compared to the Datacenter Broker scheduler which implements First Come First Serve. The characteristics remained fixed whether its for DataCenter Broker Scheduler or the Arrival based Deadline First Scheduler except the number of Cloudlets were increased gradually and the results were compared. The results show that the First Come First Serve Scheduler misses more Cloudlets from deadline as compared to ADSF Scheduler. All the cloudlets arrived at different time and were scheduled and submitted according to that time and not simultaneously which resulted in more efficient results. The results show that the Total De-layed Cloudlets have a huge difference for both the algorithms. Although, the waiting time is some what same.
本研究通过从用户提供的文件中获取不同参数的值，设计了一种云计算环境下的调度算法，该文件给出了不同的云计算细节。根据“最短截止日期先到”和“先到先服务”将cloudlets分配给不同的主机，其中cloudlets在不同的到达时间被提交。用户提供的截止日期用于确定Cloudlet是否能够在规定的时间间隔内完成执行。此实现增加了在特定时间间隔内完成执行的作业数量，因此与实现先到先服务的Datacenter Broker调度器相比，可以最大限度地减少错过截止日期的cloudlet数量。无论是DataCenter Broker Scheduler还是基于到达的Deadline First Scheduler，除了cloudlet的数量逐渐增加并比较结果外，特征保持不变。结果表明，与ADSF调度器相比，先到先服务调度器在截止日期前错过了更多的Cloudlets。所有的cloudlets都在不同的时间到达，并根据该时间进行调度和提交，而不是同时进行，从而产生更高效的结果。结果表明，对于两种算法，Total de - layedcloudlets有很大的差异。虽然，等待的时间是有些相同的。
{"title":"Arrival based deadline aware job scheduling algorithm in cloud","authors":"R. Kumar, Swati Gupta","doi":"10.1109/ISPCC.2017.8269671","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269671","url":null,"abstract":"This study designed a scheduling algorithm for Cloud Computing Environment by taking values of different parameters from a file provided by a user which gives the details of different cloudlets to be made. The cloudlets are assigned to different hosts according to the Shortest Deadline First combined with First Come First Serve where the Cloudlets are being submitted at different arrival times. The deadline provided by user is used to determine whether the Cloudlet is able to finish execution in the prescribed time interval or not. This implementation increased the number of jobs that finished executing in a particular time interval, thereby minimising the number of cloudlets that missed the deadline as compared to the Datacenter Broker scheduler which implements First Come First Serve. The characteristics remained fixed whether its for DataCenter Broker Scheduler or the Arrival based Deadline First Scheduler except the number of Cloudlets were increased gradually and the results were compared. The results show that the First Come First Serve Scheduler misses more Cloudlets from deadline as compared to ADSF Scheduler. All the cloudlets arrived at different time and were scheduled and submitted according to that time and not simultaneously which resulted in more efficient results. The results show that the Total De-layed Cloudlets have a huge difference for both the algorithms. Although, the waiting time is some what same.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130643983","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 : 2017-09-01DOI: 10.1109/ISPCC.2017.8269675
D. Reddy, K. Akshay, R. Giridhar, S. Karan, N. Mohankumar
In today's world, as the demand for IC production grows exponentially, testing and validation of all the manufactured chips becomes impossible. Therefore, in the proposed method, we have developed a technique for embedding unique signatures with minimalistic hardware or area overhead while preserving the intended functionality. To achieve this, three ‘levels’ of security are provided. First, circuit specific information is derived and used for signature generation. Second, the generated signature is hashed, obfuscating the logic reverse engineering process and finally a bit sequence from a Pseudo-Random Number Generator (PRNG) to make it unfeasibly difficult for the attacker to decode the signature.
{"title":"BHARKS: Built-in hardware authentication using random key sequence","authors":"D. Reddy, K. Akshay, R. Giridhar, S. Karan, N. Mohankumar","doi":"10.1109/ISPCC.2017.8269675","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269675","url":null,"abstract":"In today's world, as the demand for IC production grows exponentially, testing and validation of all the manufactured chips becomes impossible. Therefore, in the proposed method, we have developed a technique for embedding unique signatures with minimalistic hardware or area overhead while preserving the intended functionality. To achieve this, three ‘levels’ of security are provided. First, circuit specific information is derived and used for signature generation. Second, the generated signature is hashed, obfuscating the logic reverse engineering process and finally a bit sequence from a Pseudo-Random Number Generator (PRNG) to make it unfeasibly difficult for the attacker to decode the signature.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"30 41","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131804651","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 : 2017-09-01DOI: 10.1109/ISPCC.2017.8269699
Vasudev S. Mallan, Syam Gopi, A. Muir, R. R. Bhavani
It is now possible to control an Unmanned Ground Vehicle (UGV) with a free smartphone app such as ROS Control. Smartphones offer such low cost and easily available human-robot interface (HRI) controlling robots with tilt gestures. However, tilt gestures are not used in the more commonly available UGV control devices, such as joystick and button based gamepads. Tilt gestures have not been studied in terms of their effectiveness for controlling UGVs. If they are effective, then the low cost and high availability of smartphones running apps such as ROS Control can make a huge change in the world of HRI and control devices for UGV for the developing world. They can be ruggedized and are low cost, and more familiar to the general populace — which are factors that can help the adoption of robotics in India. This research explores the ease of use and effectiveness in controlling a UGV by benchmarking a tilt-based HRI (on the ROS Control app) with the more established joystick and button based HRI on a gamepad. A 40-person usability study using both devices in Gazebo, a robotic simulated environment, was conducted. Performance metrics (time on task and lane deviations) were measured, to indicate effectiveness. However, the statistical analysis conducted using Wilcoxon Signed Rank test shows a significant difference in the use of both the input devices in controlling a UGV favoring the gamepad. However, most of the participants report the tilt based app as more controllable and highly usable.
现在可以使用免费的智能手机应用程序(如ROS control)来控制无人地面车辆(UGV)。智能手机提供了这种低成本和易于获得的人机界面(HRI)，可以通过倾斜手势控制机器人。然而，倾斜手势并不用于更常见的UGV控制设备，如操纵杆和基于按钮的游戏手柄。倾斜手势在控制ugv方面的有效性尚未得到研究。如果它们是有效的，那么运行ROS Control等应用程序的智能手机的低成本和高可用性可以在发展中国家的HRI和UGV控制设备领域产生巨大变化。它们可以坚固耐用，成本低，更为普通民众所熟悉——这些因素可以帮助印度采用机器人技术。本研究通过对基于倾斜的HRI(在ROS Control应用程序上)与手柄上更成熟的操纵杆和基于按钮的HRI进行基准测试，探索了控制UGV的易用性和有效性。在机器人模拟环境Gazebo中使用这两种设备进行了一项40人的可用性研究。测量了性能指标(完成任务的时间和车道偏差)，以表明有效性。然而，使用Wilcoxon Signed Rank测试进行的统计分析显示，在使用这两种输入设备来控制UGV时，偏好手柄的情况有显著差异。然而，大多数参与者表示，基于倾斜的应用程序更容易控制，易用性也更高。
{"title":"Comparative empirical usability assessment of two HRI input devices for a mobile robot","authors":"Vasudev S. Mallan, Syam Gopi, A. Muir, R. R. Bhavani","doi":"10.1109/ISPCC.2017.8269699","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269699","url":null,"abstract":"It is now possible to control an Unmanned Ground Vehicle (UGV) with a free smartphone app such as ROS Control. Smartphones offer such low cost and easily available human-robot interface (HRI) controlling robots with tilt gestures. However, tilt gestures are not used in the more commonly available UGV control devices, such as joystick and button based gamepads. Tilt gestures have not been studied in terms of their effectiveness for controlling UGVs. If they are effective, then the low cost and high availability of smartphones running apps such as ROS Control can make a huge change in the world of HRI and control devices for UGV for the developing world. They can be ruggedized and are low cost, and more familiar to the general populace — which are factors that can help the adoption of robotics in India. This research explores the ease of use and effectiveness in controlling a UGV by benchmarking a tilt-based HRI (on the ROS Control app) with the more established joystick and button based HRI on a gamepad. A 40-person usability study using both devices in Gazebo, a robotic simulated environment, was conducted. Performance metrics (time on task and lane deviations) were measured, to indicate effectiveness. However, the statistical analysis conducted using Wilcoxon Signed Rank test shows a significant difference in the use of both the input devices in controlling a UGV favoring the gamepad. However, most of the participants report the tilt based app as more controllable and highly usable.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133867536","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 : 2017-09-01DOI: 10.1109/ISPCC.2017.8269753
P. Singh, Sheely Garg, Mandeep Kaur, M. Bajwa, Y. Kumar
Testing is the most important and critical task in software development life cycle. Whenever software testing execution fails its test scripts is analyzed so that the point where fault occurred can be detected and the expected result can be achieved. Detecting fault in software is called as fault localization. Manually fault localization can be a cumbersome job so providing automated technique to do the same without human intervention is the demand from long time. In this paper, a brief overview of some important fault localization technique using soft computing techniques is carried out. Based on the identified points, it is identified that better result may be generated using machine learning technique along with time reduction. Prime objective of this paper is to made and attempt for identifying the fault localization techniques in combination with soft computing approaches to minimize the time and space complexities, so that the better results may be achieved in context of usability and effectiveness.
{"title":"Fault localization in software testing using soft computing approaches","authors":"P. Singh, Sheely Garg, Mandeep Kaur, M. Bajwa, Y. Kumar","doi":"10.1109/ISPCC.2017.8269753","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269753","url":null,"abstract":"Testing is the most important and critical task in software development life cycle. Whenever software testing execution fails its test scripts is analyzed so that the point where fault occurred can be detected and the expected result can be achieved. Detecting fault in software is called as fault localization. Manually fault localization can be a cumbersome job so providing automated technique to do the same without human intervention is the demand from long time. In this paper, a brief overview of some important fault localization technique using soft computing techniques is carried out. Based on the identified points, it is identified that better result may be generated using machine learning technique along with time reduction. Prime objective of this paper is to made and attempt for identifying the fault localization techniques in combination with soft computing approaches to minimize the time and space complexities, so that the better results may be achieved in context of usability and effectiveness.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"53 22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124590088","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 : 2017-09-01DOI: 10.1109/ISPCC.2017.8269689
Pratiksha Gautam, H. Saini
Over the past few years, several software clone detection techniques have been developed. The software clones are the consequence of copied/pasted activity in software development which eventuates at different level of abstraction and may have different inception in a software system. This paper presents an efficient approach for the detection of type-1 software clones. The proposed detect type-1 software clones with high precision, recall, portability, and scalability. The type-1 clones generated by using mutation operator-based editing taxonomy.
{"title":"A hybrid approach for detection of Type-1 software clones","authors":"Pratiksha Gautam, H. Saini","doi":"10.1109/ISPCC.2017.8269689","DOIUrl":"https://doi.org/10.1109/ISPCC.2017.8269689","url":null,"abstract":"Over the past few years, several software clone detection techniques have been developed. The software clones are the consequence of copied/pasted activity in software development which eventuates at different level of abstraction and may have different inception in a software system. This paper presents an efficient approach for the detection of type-1 software clones. The proposed detect type-1 software clones with high precision, recall, portability, and scalability. The type-1 clones generated by using mutation operator-based editing taxonomy.","PeriodicalId":142166,"journal":{"name":"2017 4th International Conference on Signal Processing, Computing and Control (ISPCC)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121730433","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
扫码关注我们
求助内容：
应助结果提醒方式：