Sonali D. Patil, Kapil Tajane, Janhavi Sirdeshpande
{"title":"Enhancing Security and Privacy in Biometrics Based Authentication System Using Multiple Secret Sharing","authors":"Sonali D. Patil, Kapil Tajane, Janhavi Sirdeshpande","doi":"10.1109/ICCUBEA.2015.42","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.42","url":null,"abstract":"A biometric authentication system acquires biometric sample such as fingerprint from the subject. The fingerprint signifies physiological features of an individual. This biometric sample is stored in the database for preserving its security and privacy. Secret sharing can be applied for securing this biometric sample where, a fingerprint image gets divided into number of bits called as shares. These shares then stored at different places, for example, one share will be provided to the user in the form of ID card and another share will be in central database. For the reconstruction of image, both the shares are obligatory so as to get original image. To store the data in the form of shares at different places instead of whole data at one place augments security and privacy in biometrics based authentication system. This paper proposes a fusion of ID card swapping and fingerprint authentication. This fusion is implemented with multiple secret sharing scheme which uses two fingerprints as a base of authentication. This scheme helps to solve two problems such as maintenance of large databases and falsification.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115818332","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":"Performance Analysis of Synchronizer and Measurement of Metastability","authors":"A. Patharkar","doi":"10.1109/ICCUBEA.2015.102","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.102","url":null,"abstract":"There are so many applications which require more than one clock for their application. The transmitter works on one clock frequency and the receiver may work on another frequency. Due to this difference in frequencies between the transmitter and receiver causes the slower data transfer operation depending upon the transmitter frequency and sometimes there may be data loss. So in order to synchronize the data between them there is a need of synchronizer. The synchronizer plays an important role for proper communication between the transmitter and receiver. Another aspect of communication is reliability of data transfer and this can be determined and directly controlled by synchronizer. Hence the analysis of synchronizer plays vital role in an effective communication. The input to the synchronizer is asynchronous in nature so sometimes the synchronizer fails to synchronize the communication and this is called as metastability. Metastability states are common in digital circuits, and synchronizers are must to protect their fatal effects. Originally, they were required when reading an asynchronous input (namely, not synchronized with the clock so it might change exactly when sampled). Now, with multiple clock domains on the same chip, synchronizers are required when on-chip data crosses the clock domain boundaries.. This can be achieved by the parameters of synchronizer. The proposed architecture shows the analysis of the reliable data transfer and metastability.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116793154","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":"Obstacle Avoidance System in Autonomous Ground Vehicle Using Ground Plane Image Processing and Omnidirectional Drive","authors":"H. Modi, V. Nirav, H. Malav","doi":"10.1109/ICCUBEA.2015.122","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.122","url":null,"abstract":"Today one of the major concerns for any industry is availability of workspace and adequate intra-transport systems. This paper suggests the possible and probably cheap solution for both of above incapacities by implying sensor controlled motion of Omni-directional wheels. We have synchronized the image processing capability of Raspberry Pie processor with the sensitivity of motor driver circuit to obtain a precise and accurate motion of platform mounted with mecanum wheel that do not require any turning radius. As an image sensor we have used the simple CCD camera. The set of Image transformations are applied on the image to detect the obstacle precisely. We designed mecanum wheel with main constraint kept as shortage of space and load carrying capacity, hence we were able to report design of the wheel with specific dimensions. The image processing and simulation is done in the MATLAB environment. This choice has added the possibilities of the inclusion of advance control strategies and the use of image processing toolbox.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117224105","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":"Application of Particle Swarm Optimization for Production Scheduling","authors":"M. M. Ghumare, L. Bewoor, S. Sapkal","doi":"10.1109/ICCUBEA.2015.100","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.100","url":null,"abstract":"Production scheduling is an interdisciplinary challenge of addressing optimality criteria such as minimizing makespan, mean flow time, idle machine time, total tardiness, number of tardy jobs, in-process inventory cost, cost of being late. Research till date used various AI techniques, heuristics and metaheuristics to optimize scheduling criteria. If problem size goes on increasing heuristics is not able to give optimal results. The enumerations for finding the probabilities for improving the utilization of resources turn this problem towards NP-Hard. This paper presents comprehensive coverage of PSO application in solving optimization problems in the area of production scheduling. The paper discusses about use of PSO for improvement in the results of optimality criteria.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"121 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127188430","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":"Combination of Multiple Image Features along with KNN Classifier for Classification of Marathi Barakhadi","authors":"Dhanashree Joshi, S. Pansare","doi":"10.1109/ICCUBEA.2015.124","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.124","url":null,"abstract":"Character recognition is an emerging area for research in terms of different languages spoken all over the world and the associated writing of them. India itself has 11 different scripts and each script has its own subscripts. This diversity gives a wide scope for research out of which devnagari script has been chosen for studying its problems and solutions for those problems. Devnagari has marathi as one of its complicated language which has barakhadi as its characteristic part. A lot of researchers have worked on determining the marathi characters more efficiently, problem listed during this work are the styles of writing, strokes, aspect ratio etc. Data mining is evolving in various fields such as satellite images, medical images, object specific images etc. This paper discusses a new system that combines the Image processing methods along with the data mining classification algorithm which is a new trend called as image mining. The proposed technique applies data acquisition, pre-processing steps such as grayscale conversion, edge detection, binarization and feature extraction methods such as hu moments and GLCM feature extraction from image processing and extracted features are given to Data mining KNN classification algorithm for getting the classification results. The Database used is handwritten barakhadi of 3024 images of 36 barakhadi consonants and 12 vowels written by 7 different people from different age groups. The Proposed system will efficiently and effectively classify the character into its exact category and will reflect a very high performance as compared to others for this hybrid system which is never done before.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123408010","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":"Enhanced Artificial Bee Colony Algorithm with SPV for Travelling Salesman Problem","authors":"Ashay Shrivastava, Manish Gupta, Shashank Swami","doi":"10.1109/ICCUBEA.2015.176","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.176","url":null,"abstract":"Artificial Bee Colony (ABC) Algorithm is an optimization algorithm used to find out the global optima. In ABC, each bee stores the information of feasible solution or candidate solution and stochastically modifies this over time, based on the information provided by neighboring bees, it speculative modifies over time and based on the best solution found by the bee itself.. In this proposed work, enhanced ABC algorithm with SPV for travelling salesman problem is used. In this modified bee colony algorithm, additional phase in the form of mutation is used and SPV rule is used in this work for improving local search. After modification, proposed algorithm is implemented on standard travelling salesman problem for checking the efficiency of proposed work. The experimental results are compared with ABC algorithm and ABC with SPV algorithm.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"235 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116158390","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":"Improvement in Noise Performance and Transconductance Using Positive Feedback in Bulk Driven Operational Amplifier","authors":"A. Tiwari, S. Bhandari","doi":"10.1109/ICCUBEA.2015.193","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.193","url":null,"abstract":"Improvement in noise performance and Transconductance using positive feedback approach in bulk driven operational amplifier is proposed in this paper. Downscaling of CMOS technology has compelled the supply voltage to reduce, which in turn demands the reduction in threshold voltage. To overcome the barrier of threshold, bulk driven technique is a good nonconventional approach because it require no modification in the existing structure of MOSFET. The limitation with bulk driven approach is that the Transconductance of operational amplifier get reduced almost three to four times. Thanks to loop of positive feedback. The resulting Transconductance is boosted to a higher value, thus, increasing the voltage gain and decreasing the input referred noise. So, concept of positive feedback is used in the design of low voltage (LV) low Power (LP) building blocks of operational amplifier using standard CMOS technology. Though amplifier is designed for power supply of 1V, it is also capable to operate at supply of less than 1V. The simulation is carried out using Mentorgraphics tools of 180 nm technology.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122399177","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":"Mobile Agent: Load Balanced Process Migration in Linux Environments","authors":"M. Nimbalkar, Ganesh R. Pathak, Hema Nagargoje","doi":"10.1109/ICCUBEA.2015.116","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.116","url":null,"abstract":"This is an attempt to gain better performance in executing the processes in distributed environments, which allows execution environments to move processes from processor to processor dynamically at any point in the life of the process. In this paper, a migration algorithm is proposed to migrate the processes dynamically to lightly loaded host using the CPU load as migration criteria. During the migration, the algorithm takes care of identifying the live nodes and migrate the process to lightly loaded workstation. The centralized server maintains the status and load of each node in the NOW. Agents are running independently and are solely responsible for deciding if process need to be migrated or not based on the load of hosts. Agent node will be responsible for keeping track of load and if exceeds the defined threshold, decision will be made to migrate the process. In a case decided, it identifies the lightly loaded host and transfers state of the process to the target hosts. On the target hosts, the state is collected and the process resumes the execution and sends the result back to the source machine which initiated the request to migrate the process. By dynamically moving processes throughout their lifetimes, the system can potentially adapt better to changes in the load that could not be foreseen at the start of the tasks. Proponents of process migration claim that this dynamic adaptation leads to a better system-wide utilization of available resources than static process scheduling.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"321 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116823818","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}
Sarosij Adak, S. Swain, H. Pardeshi, Hafizur Rahman, C. Sarkar
{"title":"Effect of AlN Spacer Layer Thickness on Device Performance of AIInN/AlN/GaN MOSHEMT","authors":"Sarosij Adak, S. Swain, H. Pardeshi, Hafizur Rahman, C. Sarkar","doi":"10.1109/ICCUBEA.2015.179","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.179","url":null,"abstract":"In the present work, we have analyzed the influence of AlN spacer layer thickness (ts) on the device performances of a 120-nm gate length AlInN/AlN/GaN MOS-HEMT device, using 2D Sentaurus TCAD simulation. A hydrodynamic model with due consideration of interface traps is used for the simulations. Due to the high value of the two-dimensional electron gas (2DEG) density and mobility in the AlInN/AlN/GaN MOS-HEMT device, a very high drain current (0.004 A/μm) density is achieved. Simulation of major device performance parameters such as Tran conductance (gm), cutoff frequency (ft) and total gate capacitance (Cgg) have been done for ts ranging from 0.5 nm to 2 nm. We have also optimized the spacer layer thickness for obtaining the maximum device performance.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129750725","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":"Limited Preemptive Disk Scheduling for Real Time Database System","authors":"S. A. Bhura, Ankita A. Mahamune, A. Alvi","doi":"10.1109/ICCUBEA.2015.76","DOIUrl":"https://doi.org/10.1109/ICCUBEA.2015.76","url":null,"abstract":"Previously disk IOs have been thought of as non-preemptible operations. But in case of applications requiring short, interactive responses this non-preemption can be a disruption. One such domain is that of real-time disk scheduling. Such a blocking due to non-preemption is undesirable since it degrades the schedulability of real-time transactions as well as causes an hindrance to an execution of higher priority transactions. On the other hand making disk IOs preemptible produces many unnecessary preemptions. Arbitrary preemptions can introduce a significant runtime overhead and may cause high fluctuations in transaction execution times, so degrading system predictability. So there is a need of a viable alternative between these two extremes that are non-preemptive and fully preemptive scheduling models. As we know, before giving service to transactions, it is necessary to schedule them and find the required time. So, in order to know what this time required is and how to minimize it, it is mandatory to study the different parameters required for real time disk scheduling. This task can be achieved with the help of a mathematical model which shows how scheduling result of any algorithm can be evaluated. This paper derives a limited-preemption real-time scheduling algorithm and using a mathematical model it is evaluated and compared with the fully preemptive and non-preemptive scheduling models and shows how a limited preemption model acts as a viable alternative between these two extreme cases of fully preemptive and non-preemptive scheduling.","PeriodicalId":325841,"journal":{"name":"2015 International Conference on Computing Communication Control and Automation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126905313","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}