Pub Date : 2016-12-01DOI: 10.1109/ICENCO.2016.7856464
A. Elbayoumy, Salah Farid Al-Ashry
Since Long Term Evolution (LTE) is a totally IP based cellular network hence, it only supports the packet switching (PS) function, which leads to the proposal of many alternatives for offering voice services over LTE to maintain the continuity of the most important cellular service over the new architecture of the celluar networks, these alternatives include Voice over LTE (VoLTE) which is the most cost and complexity ever for the voice service, also include the Circuit Switching FallBack (CSFB), the most widely deployed and currently exists alternative for voice service over LTE, meaning that it is the most preferable choice for many operators for its excellent circuit switching voice quality and SMS services delivering. The main drawback of the CSFB is the substantial call setup time delay, and if the worst fallback case happens, this time increased more, at this case the fallback happens at other MSC serving area than that MSC at which the registration was performed, therefore, at that case of fallback the Mobile Originating (MO) calls will need to perform inter-VLR location updating causing additional call setup time delay, on the other hand the Mobile Terminating (MT) calls will be dropped unless another functionality like Mobile Terminating Roaming Retry (MTRR) is adopted. This study is focused on the MTRR. MTRR is one of the 3GPP proposed solutions to solve the MT call dropping impact at MSCs boarders. Despite that MTRR found a satisfying solution for the problem of MT call dropping; on the other hand it made the call setup time nearly getting doubled. Therefore, it is important to analyze the fallback cases by giving a classification method for the fallback different cases, and the reasons cause that large additional call setup delay during CSFB. The paper also presents a new proposed sheme as an improved functionality to enhance the call setup time for both MT and MO calls during that case of fallback, caused by mismapping between Tracking Areas (TAs) and Location Areas (LAs) at MSCs serving area boarders, this new scheme with less procedures, reduces the call setup time for MT and MO calls at that case of fallback by finding a good method to perform the majority of the messages (causing that extra time) prior the MT/MO call procedures, and provide a solution for the limitations applied on MTRR, hence, improving the user quality of experience.
{"title":"New scheme for CSFB improvement in LTE","authors":"A. Elbayoumy, Salah Farid Al-Ashry","doi":"10.1109/ICENCO.2016.7856464","DOIUrl":"https://doi.org/10.1109/ICENCO.2016.7856464","url":null,"abstract":"Since Long Term Evolution (LTE) is a totally IP based cellular network hence, it only supports the packet switching (PS) function, which leads to the proposal of many alternatives for offering voice services over LTE to maintain the continuity of the most important cellular service over the new architecture of the celluar networks, these alternatives include Voice over LTE (VoLTE) which is the most cost and complexity ever for the voice service, also include the Circuit Switching FallBack (CSFB), the most widely deployed and currently exists alternative for voice service over LTE, meaning that it is the most preferable choice for many operators for its excellent circuit switching voice quality and SMS services delivering. The main drawback of the CSFB is the substantial call setup time delay, and if the worst fallback case happens, this time increased more, at this case the fallback happens at other MSC serving area than that MSC at which the registration was performed, therefore, at that case of fallback the Mobile Originating (MO) calls will need to perform inter-VLR location updating causing additional call setup time delay, on the other hand the Mobile Terminating (MT) calls will be dropped unless another functionality like Mobile Terminating Roaming Retry (MTRR) is adopted. This study is focused on the MTRR. MTRR is one of the 3GPP proposed solutions to solve the MT call dropping impact at MSCs boarders. Despite that MTRR found a satisfying solution for the problem of MT call dropping; on the other hand it made the call setup time nearly getting doubled. Therefore, it is important to analyze the fallback cases by giving a classification method for the fallback different cases, and the reasons cause that large additional call setup delay during CSFB. The paper also presents a new proposed sheme as an improved functionality to enhance the call setup time for both MT and MO calls during that case of fallback, caused by mismapping between Tracking Areas (TAs) and Location Areas (LAs) at MSCs serving area boarders, this new scheme with less procedures, reduces the call setup time for MT and MO calls at that case of fallback by finding a good method to perform the majority of the messages (causing that extra time) prior the MT/MO call procedures, and provide a solution for the limitations applied on MTRR, hence, improving the user quality of experience.","PeriodicalId":332360,"journal":{"name":"2016 12th International Computer Engineering Conference (ICENCO)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114082160","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 : 2016-12-01DOI: 10.1109/ICENCO.2016.7856443
Shahira Shaaban Azab, Mohamed Farouk Abdel Hady, H. Hefny
This paper proposes a new method for partitioning data clustering using PSO. The Proposed methods LPSOC designed for hard clusters. LPSOC alleviate some of the drawbacks of traditional algorithms and the state-of-the-art PSO clustering algorithm. Population-based algorithms such as PSO is less sensitive to initial condition than other algorithms such as K-means since search starts from multiple positions. The proposed algorithm LPSOC is less susceptible to local minima than K-means or even gbest version of PSO. In gbest PSO, all centroids are encoded in a single particle. Thus, the global best particle is a complete solution to the problem because its encoding contains the best position found for the centroids of all clusters. We used the local version of PSO in LPOSC. LPSOC uses a neighborhood of particles for optimizing the position of each cluster centroid. The whole swarm represents a solution to the clustering problem. This representation is far less computationally expensive than standard gbest version. The LPSOC is tested using six datasets from different domains to measure its performance fairly. LPOSC is compared with standard PSO for clustering and K-means. The results assure that the proposed method is very promising.
{"title":"Local best particle swarm optimization for partitioning data clustering","authors":"Shahira Shaaban Azab, Mohamed Farouk Abdel Hady, H. Hefny","doi":"10.1109/ICENCO.2016.7856443","DOIUrl":"https://doi.org/10.1109/ICENCO.2016.7856443","url":null,"abstract":"This paper proposes a new method for partitioning data clustering using PSO. The Proposed methods LPSOC designed for hard clusters. LPSOC alleviate some of the drawbacks of traditional algorithms and the state-of-the-art PSO clustering algorithm. Population-based algorithms such as PSO is less sensitive to initial condition than other algorithms such as K-means since search starts from multiple positions. The proposed algorithm LPSOC is less susceptible to local minima than K-means or even gbest version of PSO. In gbest PSO, all centroids are encoded in a single particle. Thus, the global best particle is a complete solution to the problem because its encoding contains the best position found for the centroids of all clusters. We used the local version of PSO in LPOSC. LPSOC uses a neighborhood of particles for optimizing the position of each cluster centroid. The whole swarm represents a solution to the clustering problem. This representation is far less computationally expensive than standard gbest version. The LPSOC is tested using six datasets from different domains to measure its performance fairly. LPOSC is compared with standard PSO for clustering and K-means. The results assure that the proposed method is very promising.","PeriodicalId":332360,"journal":{"name":"2016 12th International Computer Engineering Conference (ICENCO)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132124744","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 : 2016-12-01DOI: 10.1109/ICENCO.2016.7856446
N. Metawa, M. Elhoseny, M. Kabir Hassan, A. Hassanien
With the increasing impact of capital regulation on banks financial decisions especially in competing environment with credit constraints, it comes the urge to set an optimal mechanism of bank lending decisions that will maximize the bank profit in a timely manner. In this context, we propose a self-organizing method for dynamically organizing bank lending decision using Genetic Algorithm (GA). Our proposed GA based model provides a framework to optimize bank objective when constructing the loan portfolio, which maximize the bank profit and minimize the probability of bank default in a search for an optimal, dynamic lending decision. Multiple factors related to loan characteristics, creditor ratings are integrated to GA chromosomes and validation is performed to ensure the optimal decision. GA uses random search to suggest the best appropriate design. We use this algorithm in order to obtain the most efficient lending decision. The reason for choosing GA is its convergence and its flexibility in solving multi-objective optimization problems such as credit assessment, portfolio optimization and bank lending decision.
{"title":"Loan portfolio optimization using Genetic Algorithm: A case of credit constraints","authors":"N. Metawa, M. Elhoseny, M. Kabir Hassan, A. Hassanien","doi":"10.1109/ICENCO.2016.7856446","DOIUrl":"https://doi.org/10.1109/ICENCO.2016.7856446","url":null,"abstract":"With the increasing impact of capital regulation on banks financial decisions especially in competing environment with credit constraints, it comes the urge to set an optimal mechanism of bank lending decisions that will maximize the bank profit in a timely manner. In this context, we propose a self-organizing method for dynamically organizing bank lending decision using Genetic Algorithm (GA). Our proposed GA based model provides a framework to optimize bank objective when constructing the loan portfolio, which maximize the bank profit and minimize the probability of bank default in a search for an optimal, dynamic lending decision. Multiple factors related to loan characteristics, creditor ratings are integrated to GA chromosomes and validation is performed to ensure the optimal decision. GA uses random search to suggest the best appropriate design. We use this algorithm in order to obtain the most efficient lending decision. The reason for choosing GA is its convergence and its flexibility in solving multi-objective optimization problems such as credit assessment, portfolio optimization and bank lending decision.","PeriodicalId":332360,"journal":{"name":"2016 12th International Computer Engineering Conference (ICENCO)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116085817","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 : 2016-12-01DOI: 10.1109/ICENCO.2016.7856468
M. Elhoseny, N. Metawa, A. Hassanien
Despite the great efforts to assure quality in higher education institutions, the ambiguity of its related concepts and requirements constitute a big challenge when trying to implement it as an automated information system. The present work introduces a framework for an automated information system that manages the quality assurance in higher educations institutions. The aim of designing such a system is to provide an automation tool that avoids unnecessary and redundant tasks associated to quality in higher education institutions. In addition, the proposed system helps all higher education stockholders to handle and monitor their tasks. Moreover, it aims to help the quality assurance center in a higher education institution to apply its qualitys standards, and to make sure that they are being maintained and enhanced. This information system contains a core module and 17 sub-modules, which are described in this paper.
{"title":"An automated information system to ensure quality in higher education institutions","authors":"M. Elhoseny, N. Metawa, A. Hassanien","doi":"10.1109/ICENCO.2016.7856468","DOIUrl":"https://doi.org/10.1109/ICENCO.2016.7856468","url":null,"abstract":"Despite the great efforts to assure quality in higher education institutions, the ambiguity of its related concepts and requirements constitute a big challenge when trying to implement it as an automated information system. The present work introduces a framework for an automated information system that manages the quality assurance in higher educations institutions. The aim of designing such a system is to provide an automation tool that avoids unnecessary and redundant tasks associated to quality in higher education institutions. In addition, the proposed system helps all higher education stockholders to handle and monitor their tasks. Moreover, it aims to help the quality assurance center in a higher education institution to apply its qualitys standards, and to make sure that they are being maintained and enhanced. This information system contains a core module and 17 sub-modules, which are described in this paper.","PeriodicalId":332360,"journal":{"name":"2016 12th International Computer Engineering Conference (ICENCO)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124035956","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 : 2016-12-01DOI: 10.1109/ICENCO.2016.7856463
A. Meligy, A. A. Abdo, A. Alazab
P2P SN is emerging as a promising technique for allowing to members to exchange messages or files to a members of group However, the growing number of users who use DSN for sending and receiving messages or sharing their files is increasingly challenging users' privacy and security. In this paper, we propose a flexible privacy-preserving file sharing scheme over DSN that ensures both semantic security and effective availability of receivers. We call the proposed scheme as Partitioned scheme. In this paper, we suggest the partitioned scheme using Dynamic Identity-Based Broadcast Encryption for encryption in P2P SN. The system does not have the central server, each user has a key and roll to decrypt a special part of your file. This paper focuses on providing a dependable and secure DSN file sharing service that allows users' group dynamic access to that shared files.
{"title":"P2P Social Network with Partitioned Dynamic Identity-Based Broadcast Encryption","authors":"A. Meligy, A. A. Abdo, A. Alazab","doi":"10.1109/ICENCO.2016.7856463","DOIUrl":"https://doi.org/10.1109/ICENCO.2016.7856463","url":null,"abstract":"P2P SN is emerging as a promising technique for allowing to members to exchange messages or files to a members of group However, the growing number of users who use DSN for sending and receiving messages or sharing their files is increasingly challenging users' privacy and security. In this paper, we propose a flexible privacy-preserving file sharing scheme over DSN that ensures both semantic security and effective availability of receivers. We call the proposed scheme as Partitioned scheme. In this paper, we suggest the partitioned scheme using Dynamic Identity-Based Broadcast Encryption for encryption in P2P SN. The system does not have the central server, each user has a key and roll to decrypt a special part of your file. This paper focuses on providing a dependable and secure DSN file sharing service that allows users' group dynamic access to that shared files.","PeriodicalId":332360,"journal":{"name":"2016 12th International Computer Engineering Conference (ICENCO)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131639547","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 : 2016-12-01DOI: 10.1109/ICENCO.2016.7856472
Eslam E. El Maghraby, A. Gody, M. Farouk
Most developments in speech-based automatic recognition have relied on acoustic speech as the sole input signal, disregarding its visual counterpart. However, recognition based on acoustic speech alone can be afflicted with deficiencies that prevent its use in many real-world applications, particularly under adverse conditions. This paper aims to build a connected-words audio visual speech recognition system (AV-ASR) for English language that uses both acoustic and visual speech information to improve the recognition performance. Mel frequency cepstral coefficients (MFCCs) have been used to extract the audio features from the speech-files. For the visual counterpart, the Discrete Cosine Transform (DCT) Coefficients have been used to extract the visual feature from the speaker's mouth region and Principle Component Analysis (PCA) have been used for dimensionality reduction purpose, These features are then concatenated with traditional audio ones, and the resulting features are used for training hidden Markov models (HMMs) parameters using word level acoustic models. The system has been developed using hidden Markov model toolkit (HTK) that uses hidden Markov models (HMMs) for recognition. The potential of the suggested approach is demonstrate by a preliminary experiment on the GRID sentence database one of the largest databases available for audio-visual recognition system, which contains continuous English voice commands for a small vocabulary task. The experimental results show that the proposed Audio Video Speech Recognizer (AV-ASR) system exhibits higher recognition rate in comparison to an audio-only recognizer as well as it indicates robust performance. An increase of success rate by 3.9% for the grammar based word recognition system overall speakers is achieved for speaker independent test and for speaker dependent, it changes from speaker to another between 7% and 1%. Also when test the system under noisy environment it improve the result.
{"title":"Enhancing quality and accuracy of speech recognition system by using multimodal audio-visual speech signal","authors":"Eslam E. El Maghraby, A. Gody, M. Farouk","doi":"10.1109/ICENCO.2016.7856472","DOIUrl":"https://doi.org/10.1109/ICENCO.2016.7856472","url":null,"abstract":"Most developments in speech-based automatic recognition have relied on acoustic speech as the sole input signal, disregarding its visual counterpart. However, recognition based on acoustic speech alone can be afflicted with deficiencies that prevent its use in many real-world applications, particularly under adverse conditions. This paper aims to build a connected-words audio visual speech recognition system (AV-ASR) for English language that uses both acoustic and visual speech information to improve the recognition performance. Mel frequency cepstral coefficients (MFCCs) have been used to extract the audio features from the speech-files. For the visual counterpart, the Discrete Cosine Transform (DCT) Coefficients have been used to extract the visual feature from the speaker's mouth region and Principle Component Analysis (PCA) have been used for dimensionality reduction purpose, These features are then concatenated with traditional audio ones, and the resulting features are used for training hidden Markov models (HMMs) parameters using word level acoustic models. The system has been developed using hidden Markov model toolkit (HTK) that uses hidden Markov models (HMMs) for recognition. The potential of the suggested approach is demonstrate by a preliminary experiment on the GRID sentence database one of the largest databases available for audio-visual recognition system, which contains continuous English voice commands for a small vocabulary task. The experimental results show that the proposed Audio Video Speech Recognizer (AV-ASR) system exhibits higher recognition rate in comparison to an audio-only recognizer as well as it indicates robust performance. An increase of success rate by 3.9% for the grammar based word recognition system overall speakers is achieved for speaker independent test and for speaker dependent, it changes from speaker to another between 7% and 1%. Also when test the system under noisy environment it improve the result.","PeriodicalId":332360,"journal":{"name":"2016 12th International Computer Engineering Conference (ICENCO)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129306497","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 : 2016-12-01DOI: 10.1109/ICENCO.2016.7856456
A.H. Ahmed, A. Ouda, A. Kamel, Y. Elhalwagy
In this paper, a complete system of quad rotor stability mechanism was designed and implemented. Starting with a Single-axis Implementation of a Quad rotor, SISO approach is implemented for control structure to achieve desired objectives. The tradition PID and modified PID controllers were executed on one -axis of a Quadrotor using Microcontroller. The performance of the designed control structure is evaluated through time domain factors such as overshoot, settling time. Three axis accelerometer and Gyroscopes have been used in the system as the IMU. Attitude stabilization is achieved through implementing of the modified PID controller to each axis. The three axis stabilization is achieved by implementing the simultaneous modified PID controller over the axes and flight tests were performed. Altitude control was achieved by using ultrasonic sensor. In altitude hold mode, Copter maintains a consistent altitude while allowing roll, pitch, and yaw to be controlled normally. Three axis test and implementation of the algorithm has been performed and the results are discussed.
{"title":"Attitude stabilization and altitude control of quadrotor","authors":"A.H. Ahmed, A. Ouda, A. Kamel, Y. Elhalwagy","doi":"10.1109/ICENCO.2016.7856456","DOIUrl":"https://doi.org/10.1109/ICENCO.2016.7856456","url":null,"abstract":"In this paper, a complete system of quad rotor stability mechanism was designed and implemented. Starting with a Single-axis Implementation of a Quad rotor, SISO approach is implemented for control structure to achieve desired objectives. The tradition PID and modified PID controllers were executed on one -axis of a Quadrotor using Microcontroller. The performance of the designed control structure is evaluated through time domain factors such as overshoot, settling time. Three axis accelerometer and Gyroscopes have been used in the system as the IMU. Attitude stabilization is achieved through implementing of the modified PID controller to each axis. The three axis stabilization is achieved by implementing the simultaneous modified PID controller over the axes and flight tests were performed. Altitude control was achieved by using ultrasonic sensor. In altitude hold mode, Copter maintains a consistent altitude while allowing roll, pitch, and yaw to be controlled normally. Three axis test and implementation of the algorithm has been performed and the results are discussed.","PeriodicalId":332360,"journal":{"name":"2016 12th International Computer Engineering Conference (ICENCO)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125034423","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 : 2016-12-01DOI: 10.1109/ICENCO.2016.7856462
M. Torky, A. Meligy, H. Ibrahim
Protecting Online Social Networks (OSNs) against the new generation of the automated software tools (i.e. Social Bots) is an increasingly important lack from the security and privacy perspectives. Social bots is automated software scripts, which able to carry out dangerous activities in OSNs, such as auto-sharing and posting, auto-sending friend requests, auto-harvesting private information,etc. Indeed, These malicious activities harm the users' reputation and privacy as well as they challenge the Social Network Provider (SNP) as a security issue. In this paper, we introduce a novel anti-bot mechanism called Necklace CAPTCHA for securing Online Social Networks against the smart generation of social bots. The Necklace CAPTCHA is an Image-based CAPTCHA which depends on the Necklace Graph approach to generate its tests. Our results proved that the Necklace CAPTCHA is an effective anti-bot mechanism from the usability and security perspectives, such that it achieved efficiency rate about 93%, solving time around 24 seconds, and low probability value of guessing attack success rate about 1.35% in average. Compared with other CAPTCHAs, the Necklace CAPTCHA is a strong competitive approach regarding the usability and security metrics.
{"title":"Securing Online Social Networks against bad Bots based on a Necklace CAPTCHA approach","authors":"M. Torky, A. Meligy, H. Ibrahim","doi":"10.1109/ICENCO.2016.7856462","DOIUrl":"https://doi.org/10.1109/ICENCO.2016.7856462","url":null,"abstract":"Protecting Online Social Networks (OSNs) against the new generation of the automated software tools (i.e. Social Bots) is an increasingly important lack from the security and privacy perspectives. Social bots is automated software scripts, which able to carry out dangerous activities in OSNs, such as auto-sharing and posting, auto-sending friend requests, auto-harvesting private information,etc. Indeed, These malicious activities harm the users' reputation and privacy as well as they challenge the Social Network Provider (SNP) as a security issue. In this paper, we introduce a novel anti-bot mechanism called Necklace CAPTCHA for securing Online Social Networks against the smart generation of social bots. The Necklace CAPTCHA is an Image-based CAPTCHA which depends on the Necklace Graph approach to generate its tests. Our results proved that the Necklace CAPTCHA is an effective anti-bot mechanism from the usability and security perspectives, such that it achieved efficiency rate about 93%, solving time around 24 seconds, and low probability value of guessing attack success rate about 1.35% in average. Compared with other CAPTCHAs, the Necklace CAPTCHA is a strong competitive approach regarding the usability and security metrics.","PeriodicalId":332360,"journal":{"name":"2016 12th International Computer Engineering Conference (ICENCO)","volume":"176 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132971449","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
扫码关注我们
求助内容：
应助结果提醒方式：