Pub Date : 2013-05-13DOI: 10.1109/IADCC.2013.6514393
Archana, Akhilesh Verma, Savita Goel, N. Kumar
Contrast enhancement plays an important role in image processing system. Enhancement is used to improve the appearance of an image and make it easier for visual interpretation, understanding and analysis of an image. Linear stretching and histogram equalization are the most common methods that are used for contrast enhancement, but the image that is enhanced by linear stretching or histogram equalization has bright and unnatural contrast. So we proposed a method that is based on genetic algorithm. This method enhances an image with natural contrast. In local contrast enhancement image can be enhanced using four parameters `a', `b', `c' and `k', where `a', `b', `c' and `k' are constants. We proposed a method in that the goal of contrast enhancement is achieved using these parameters with the new extension in their range. Local contrast enhancement increases the gray level of original image on the bases of light and dark edges. This proposed method has applied on m×n size of an original gray scale image. The local mean and local standard deviation of entire image, minimum value and maximum value of the image are used to statistically characterize digital image.
{"title":"Gray level enhancement to emphasize less dynamic region within image using genetic algorithm","authors":"Archana, Akhilesh Verma, Savita Goel, N. Kumar","doi":"10.1109/IADCC.2013.6514393","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514393","url":null,"abstract":"Contrast enhancement plays an important role in image processing system. Enhancement is used to improve the appearance of an image and make it easier for visual interpretation, understanding and analysis of an image. Linear stretching and histogram equalization are the most common methods that are used for contrast enhancement, but the image that is enhanced by linear stretching or histogram equalization has bright and unnatural contrast. So we proposed a method that is based on genetic algorithm. This method enhances an image with natural contrast. In local contrast enhancement image can be enhanced using four parameters `a', `b', `c' and `k', where `a', `b', `c' and `k' are constants. We proposed a method in that the goal of contrast enhancement is achieved using these parameters with the new extension in their range. Local contrast enhancement increases the gray level of original image on the bases of light and dark edges. This proposed method has applied on m×n size of an original gray scale image. The local mean and local standard deviation of entire image, minimum value and maximum value of the image are used to statistically characterize digital image.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123445271","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514266
A. Shukla, C. Jha, N. Saxena, S. K. Biswash
Wireless communication system is gaining to much attention for reliable communication. One of modern communication system is Mobile Ad-Hoc Networks (MANET) and it has several routing protocols for communication. The AODV is the one of efficient protocol for the MANET. In this paper we are proposing a novel technique for modeling for AODV routing protocol. The proposed technique is based on the Markov random walk model. Here we calculate the probability distribution for the several operations for efficient communication. This analysis is helpful to understand the dependency of the various factor over the AODV and it impact on QoS. Its effectiveness and efficiency has been checked by various parameters and further analyzed for the reliability and scalability.
{"title":"The analysis of AODV, based on mobility model","authors":"A. Shukla, C. Jha, N. Saxena, S. K. Biswash","doi":"10.1109/IADCC.2013.6514266","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514266","url":null,"abstract":"Wireless communication system is gaining to much attention for reliable communication. One of modern communication system is Mobile Ad-Hoc Networks (MANET) and it has several routing protocols for communication. The AODV is the one of efficient protocol for the MANET. In this paper we are proposing a novel technique for modeling for AODV routing protocol. The proposed technique is based on the Markov random walk model. Here we calculate the probability distribution for the several operations for efficient communication. This analysis is helpful to understand the dependency of the various factor over the AODV and it impact on QoS. Its effectiveness and efficiency has been checked by various parameters and further analyzed for the reliability and scalability.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"274 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125840574","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514244
C. Chandrakala, K. Prema, K. Hareesha
Unreliable wireless communication, mobility of network participants and limited resource capabilities of mobile devices make conventional replication techniques non suitable for MANETs. Frequent network partitions and dynamic disconnection should be handled to improve data availability. In this paper, a novel node failure fault tolerant data replication strategy is proposed. Main objective is to improve data accessibility among a mission critical mobility group. It ensures persistent data availability by duplicating data over replica nodes. The algorithm is designed to operate in environments with node failures. The proposed replica allocation methodology takes care of data availability values in the presence of node failures with mobile nodes remaining energy and storage capacity. Performance of the proposed approach is analyzed in terms of data availability and is demonstrated by simulations.
{"title":"Improved data availability and fault tolerance in MANET by replication","authors":"C. Chandrakala, K. Prema, K. Hareesha","doi":"10.1109/IADCC.2013.6514244","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514244","url":null,"abstract":"Unreliable wireless communication, mobility of network participants and limited resource capabilities of mobile devices make conventional replication techniques non suitable for MANETs. Frequent network partitions and dynamic disconnection should be handled to improve data availability. In this paper, a novel node failure fault tolerant data replication strategy is proposed. Main objective is to improve data accessibility among a mission critical mobility group. It ensures persistent data availability by duplicating data over replica nodes. The algorithm is designed to operate in environments with node failures. The proposed replica allocation methodology takes care of data availability values in the presence of node failures with mobile nodes remaining energy and storage capacity. Performance of the proposed approach is analyzed in terms of data availability and is demonstrated by simulations.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129460063","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514237
Fadhlun Mohamed Mahmood, Zailan Arabee bin Abdul Salam
Mobile location-based tourism applications provide guidance to the tourist on the move based on their preferences and context such as time and location. These applications depend heavily on the GPS which is used to determine the user location so as to deliver information that takes into account user preferences and context. However, the delivery of information that is relevant to the user in terms of their preferences and their contextual condition seem to be lacking in most of the applications. Semantic web technologies provide an opportunity to develop more intelligent location-based applications that would enable the delivery of information that is more accurate and relevant to the user. Thus, the objectives are; (1) to identify the benefits of leveraging semantic web technologies on the framework (2) to identify the techniques used to provide personalized activities recommendations based on the user preferences. (3) to identify the methods used to build user profile that contains user preferences. (4) to identify the key location-based component that needs to be integrated in the framework. A conceptual framework for personalized mobile location-based tourism apps leveraging semantic web to enhance tourism experience is proposed.
{"title":"A conceptual framework for personalized location-based Services (LBS) tourism mobile application leveraging semantic web to enhance tourism experience","authors":"Fadhlun Mohamed Mahmood, Zailan Arabee bin Abdul Salam","doi":"10.1109/IADCC.2013.6514237","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514237","url":null,"abstract":"Mobile location-based tourism applications provide guidance to the tourist on the move based on their preferences and context such as time and location. These applications depend heavily on the GPS which is used to determine the user location so as to deliver information that takes into account user preferences and context. However, the delivery of information that is relevant to the user in terms of their preferences and their contextual condition seem to be lacking in most of the applications. Semantic web technologies provide an opportunity to develop more intelligent location-based applications that would enable the delivery of information that is more accurate and relevant to the user. Thus, the objectives are; (1) to identify the benefits of leveraging semantic web technologies on the framework (2) to identify the techniques used to provide personalized activities recommendations based on the user preferences. (3) to identify the methods used to build user profile that contains user preferences. (4) to identify the key location-based component that needs to be integrated in the framework. A conceptual framework for personalized mobile location-based tourism apps leveraging semantic web to enhance tourism experience is proposed.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127054374","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514453
P. Dobriyal, K. Sharma, M. Sethi, G. Sharma
Power consumption plays an important role in any integrated circuit and is listed as one of the top three challenges in International technology roadmap for semiconductors. In any integrated circuit, clock distribution network and flip -flop consumes large amount of power as they make maximum number of internal transitions. In this paper, various techniques for implementing flip-flops with low power clocking system are analyzed. Among those techniques clocked pair shared flip-flop (CPSFF) consume least power than conditional data mapping flip flop (CDMFF), conditional discharge flip flop (CDFF) and conventional double edge triggered flip-flop (DEFF). We propose a novel CPSFF using Multi-Threshold voltage CMOS (MTCMOS) technique which reduces the power consumption by approximately 20% to 70% than the original CPSFF. In addition, to build a clocking system, double edge triggering and low swing clocking can be easily incorporated into the new flip-flop.
{"title":"A high performance D-flip flop design with low power clocking system using MTCMOS technique","authors":"P. Dobriyal, K. Sharma, M. Sethi, G. Sharma","doi":"10.1109/IADCC.2013.6514453","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514453","url":null,"abstract":"Power consumption plays an important role in any integrated circuit and is listed as one of the top three challenges in International technology roadmap for semiconductors. In any integrated circuit, clock distribution network and flip -flop consumes large amount of power as they make maximum number of internal transitions. In this paper, various techniques for implementing flip-flops with low power clocking system are analyzed. Among those techniques clocked pair shared flip-flop (CPSFF) consume least power than conditional data mapping flip flop (CDMFF), conditional discharge flip flop (CDFF) and conventional double edge triggered flip-flop (DEFF). We propose a novel CPSFF using Multi-Threshold voltage CMOS (MTCMOS) technique which reduces the power consumption by approximately 20% to 70% than the original CPSFF. In addition, to build a clocking system, double edge triggering and low swing clocking can be easily incorporated into the new flip-flop.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127224629","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514429
K. Sharma, P. V. Kumar
In the field of software engineering, the requirement engineering is getting special attention as it is based on the stakeholder's interests. The main factors that a requirement engineering process considers are business requirements and user requirements. The requirements are used to enhance the development of the software product with low cost and the time it should satisfy all the requirements. We developed a modified Tropos goal model, in which the evidence of satisfaction and denial of the goal is calculated from the likelihood of the events corresponding to the goals. Relations are defined between multiple goals and events, which define the importance of a particular goal. The event may be considered as a risk according to their likelihood value. So the inter relation values of the goals and events gives the impact of that event on the particular goal. In order to analyze the risk in achieving some particular goals, a set of candidate solutions are generated. The candidate solutions are evaluated on the basis of a risk affinitive value of the goals according to their events. The risk affinitive value is calculated from the different set of risk parameters, which is set like high, medium and low. The risk parameters clearly evaluate the affinity of that event to a particular set of goals. This parameter reduces the limitation in the previous work, like occurrence of same cost to risk values. According to the proposed approach distinct cost to risk values are achieved. Finally, the candidate solutions with low cost are selected.
{"title":"An efficient goal oriented risk analysis in requirement engineering","authors":"K. Sharma, P. V. Kumar","doi":"10.1109/IADCC.2013.6514429","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514429","url":null,"abstract":"In the field of software engineering, the requirement engineering is getting special attention as it is based on the stakeholder's interests. The main factors that a requirement engineering process considers are business requirements and user requirements. The requirements are used to enhance the development of the software product with low cost and the time it should satisfy all the requirements. We developed a modified Tropos goal model, in which the evidence of satisfaction and denial of the goal is calculated from the likelihood of the events corresponding to the goals. Relations are defined between multiple goals and events, which define the importance of a particular goal. The event may be considered as a risk according to their likelihood value. So the inter relation values of the goals and events gives the impact of that event on the particular goal. In order to analyze the risk in achieving some particular goals, a set of candidate solutions are generated. The candidate solutions are evaluated on the basis of a risk affinitive value of the goals according to their events. The risk affinitive value is calculated from the different set of risk parameters, which is set like high, medium and low. The risk parameters clearly evaluate the affinity of that event to a particular set of goals. This parameter reduces the limitation in the previous work, like occurrence of same cost to risk values. According to the proposed approach distinct cost to risk values are achieved. Finally, the candidate solutions with low cost are selected.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127318015","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514220
V. Mapare, S. Mapare, G. Sarate
A rectangular microstrip antenna for quadrature band and penta-band is developed using a mutual coupling technique. Single rectangular microstrip is splitted into multiple resonators along the width and gap coupled to non-radiating edges. The proposed structure gives sufficient separation between the operating frequencies for quadrature band and penta-band. It covers the frequency range from 1900 MHz to 3 GHz covering Universal Mobile Telecommunication System (UMTS, 1920-2170 MHz), Wireless Local Area Network (WLAN, 2400-2483.5 MHz) and low band Worldwide Interoperability for Microwave Access (WIMAX, 2.5 to 2.8 GHz). Simulation results are presented and discussed.
{"title":"Quadrature band and penta-band MIMO antenna by mutually coupling non-radiating edges","authors":"V. Mapare, S. Mapare, G. Sarate","doi":"10.1109/IADCC.2013.6514220","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514220","url":null,"abstract":"A rectangular microstrip antenna for quadrature band and penta-band is developed using a mutual coupling technique. Single rectangular microstrip is splitted into multiple resonators along the width and gap coupled to non-radiating edges. The proposed structure gives sufficient separation between the operating frequencies for quadrature band and penta-band. It covers the frequency range from 1900 MHz to 3 GHz covering Universal Mobile Telecommunication System (UMTS, 1920-2170 MHz), Wireless Local Area Network (WLAN, 2400-2483.5 MHz) and low band Worldwide Interoperability for Microwave Access (WIMAX, 2.5 to 2.8 GHz). Simulation results are presented and discussed.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130193194","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514323
K. Usha, M. Ezhilarasan
In this paper a new authentication system using Finger Knuckle Surface is examined. This introduces a personal authentication system that can simultaneously extract and exploit Finger back Knuckle surface geometrical features. Unlike, existing work on hand and finger geometrical methods which mainly concentrates of features extraction and recognition, this methods experiments with subsets of extracted feature to achieve better performance by exploiting less number of features. This is achieved by the determination of hybrid convex curves from the finger back knuckle surface. From the identified feature curves, the subset of the features like Knuckle edge points and knuckle tip points were identified. From these identified contours, geometrical structures like tangents and secants were constructed to obtain feature information in terms of angle. This method reduces critical problems that arise due to the extraction of more number of features. Also reduces the computational complexity of the feature extraction and recognition process.
{"title":"Hybrid detection of convex curves for biometric authentication using tangents and secants","authors":"K. Usha, M. Ezhilarasan","doi":"10.1109/IADCC.2013.6514323","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514323","url":null,"abstract":"In this paper a new authentication system using Finger Knuckle Surface is examined. This introduces a personal authentication system that can simultaneously extract and exploit Finger back Knuckle surface geometrical features. Unlike, existing work on hand and finger geometrical methods which mainly concentrates of features extraction and recognition, this methods experiments with subsets of extracted feature to achieve better performance by exploiting less number of features. This is achieved by the determination of hybrid convex curves from the finger back knuckle surface. From the identified feature curves, the subset of the features like Knuckle edge points and knuckle tip points were identified. From these identified contours, geometrical structures like tangents and secants were constructed to obtain feature information in terms of angle. This method reduces critical problems that arise due to the extraction of more number of features. Also reduces the computational complexity of the feature extraction and recognition process.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"68 S1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131717968","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514268
Z. Rehena, S. Roy, N. Mukherjee
Energy consumption is the key design criterion for routing data in WSN. However, some applications of WSN like disaster management, battlefield control etc. demand fast data delivery. In this paper, three data forwarding techniques are proposed. Here, the source nodes or intermediate nodes select a next node to forward the data to the destination based on different criteria. The process repeats until data reach the destination. In the first technique, neighbor node nearer to the sink is chosen considering its distance from sink node as a criterion. In the second technique remaining energy of the neighboring nodes is used as a criterion to select the next node. The combination of these two criteria is considered in the third technique based on Multiple Criteria Decision Analysis. A comparative study of the performance of these techniques has been carried out and results are presented in this paper.
{"title":"Efficient data forwarding techniques in Wireless Sensor Networks","authors":"Z. Rehena, S. Roy, N. Mukherjee","doi":"10.1109/IADCC.2013.6514268","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514268","url":null,"abstract":"Energy consumption is the key design criterion for routing data in WSN. However, some applications of WSN like disaster management, battlefield control etc. demand fast data delivery. In this paper, three data forwarding techniques are proposed. Here, the source nodes or intermediate nodes select a next node to forward the data to the destination based on different criteria. The process repeats until data reach the destination. In the first technique, neighbor node nearer to the sink is chosen considering its distance from sink node as a criterion. In the second technique remaining energy of the neighboring nodes is used as a criterion to select the next node. The combination of these two criteria is considered in the third technique based on Multiple Criteria Decision Analysis. A comparative study of the performance of these techniques has been carried out and results are presented in this paper.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125418668","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 : 2013-05-13DOI: 10.1109/IADCC.2013.6514241
S. Mukherjee, S. Roy
A SAT based detailed routing technique for island style FPGA architecture is presented in this paper. This technique uses the graph-colouring paradigm to propose a routing technique which routes multiple nets without decomposing them into 2-pin subnets for simplicity. In spite of this fact, the technique proposed proves to be efficient and scalable since it leverages the computing power of fast SAT solvers running in the back end, as shown by the experiments on benchmark circuits.
{"title":"Graph colouring based multi pin net detailed routing for FPGA using SAT","authors":"S. Mukherjee, S. Roy","doi":"10.1109/IADCC.2013.6514241","DOIUrl":"https://doi.org/10.1109/IADCC.2013.6514241","url":null,"abstract":"A SAT based detailed routing technique for island style FPGA architecture is presented in this paper. This technique uses the graph-colouring paradigm to propose a routing technique which routes multiple nets without decomposing them into 2-pin subnets for simplicity. In spite of this fact, the technique proposed proves to be efficient and scalable since it leverages the computing power of fast SAT solvers running in the back end, as shown by the experiments on benchmark circuits.","PeriodicalId":325901,"journal":{"name":"2013 3rd IEEE International Advance Computing Conference (IACC)","volume":"530 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126792816","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
扫码关注我们
求助内容：
应助结果提醒方式：