We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns. WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and tri...We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns. WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and trimming database. Whenever the database is trimmed to a size less than a specified threshold, the algorithm puts the database into main memory by constructing a tree, and finds frequent patterns on the tree. The experiment shows that WDHP outperform algorithm DHP and main memory based algorithm WAP in execution efficiency.展开更多
In this paper, we present a novel approach to model user request patterns in the World Wide Web. Instead of focusing on the user traffic for web pages, we capture the user interaction at the object level of the web pa...In this paper, we present a novel approach to model user request patterns in the World Wide Web. Instead of focusing on the user traffic for web pages, we capture the user interaction at the object level of the web pages. Our framework model consists of three sub-models: one for user file access, one for web pages, and one for storage servers. Web pages are assumed to consist of different types and sizes of objects, which are characterized using several categories: articles, media, and mosaics. The model is implemented with a discrete event simulation and then used to investigate the performance of our system over a variety of parameters in our model. Our performance measure of choice is mean response time and by varying the composition of web pages through our categories, we find that our framework model is able to capture a wide range of conditions that serve as a basis for generating a variety of user request patterns. In addition, we are able to establish a set of parameters that can be used as base cases. One of the goals of this research is for the framework model to be general enough that the parameters can be varied such that it can serve as input for investigating other distributed applications that require the generation of user request access patterns.展开更多
Searchable encryption(SE)enables data users to securely search encrypted data stored in untrusted cloud servers.However,most SE schemes allow for leakages of access and search patterns to maximize efficiency and funct...Searchable encryption(SE)enables data users to securely search encrypted data stored in untrusted cloud servers.However,most SE schemes allow for leakages of access and search patterns to maximize efficiency and functionality.Recent attacks have shown that adversaries can recover query keywords with prior knowledge of the database by exploiting these leakages.Unfortunately,the existing schemes that protect access and search patterns result in frequent communications and high computational costs.Furthermore,complex calculation processes also raise challenges for verifying search results.To address these concerns,we first design an efficient conjunctive SE scheme with search and access pattern privacy using private set intersection.In the proposed scheme,we utilize random numbers to obfuscate the values of polynomials and randomly divide the results into two parts,which simplifies the search process,improves search efficiency,and eliminates the need for time-consuming ciphertext multiplication operations.We also extend this scheme to support search result verifiability.Specifically,by embedding a random number as the root of the return polynomial,we achieve verifiability of search results.Furthermore,we prove the security of both schemes employing the simulation-based method.Finally,we implement the schemes in a real database and thorough performance analyses demonstrate their efficiency.展开更多
Massive machine type communication(m MTC) is one of the key application scenarios for the fifth generation mobile communication(5 G). Grant-free(GF) transmission can reduce the high signaling overhead in m MTC. Non-or...Massive machine type communication(m MTC) is one of the key application scenarios for the fifth generation mobile communication(5 G). Grant-free(GF) transmission can reduce the high signaling overhead in m MTC. Non-orthogonal multiple access(NMA) can support more users for m MTC than orthogonal frequency division multiple access(OFDMA). Applying GF transmission in NMA system becomes an active topic recently. The in-depth study on applying GF transmission in pattern division multiple access(PDMA), a competitive candidate scheme of NMA, is investigated in this paper. The definition, latency and allocation of resource and transmission mechanism for GF-PDMA are discussed in detail. The link-level and system-level evaluations are provided to verify the analysis. The analysis and simulation results demonstrate that the proposed GF-PDMA has lower latency than grant based PDMA(GB-PDMA), possesses strong scalability to confront collision and provides almost 2.15 times gain over GF-OFDMA in terms of supporting the number of active users in the system.展开更多
Pattem imprinting in deep sub-micron static random access memories （SRAMs） during total dose irradiation is inves- tigated in detail. As the dose accumulates, the data pattern of memory cells loading during irradiat...Pattem imprinting in deep sub-micron static random access memories （SRAMs） during total dose irradiation is inves- tigated in detail. As the dose accumulates, the data pattern of memory cells loading during irradiation is gradually imprinted on their background data pattern. We build a relationship between the memory cell＇s static noise margin （SNM） and the background data, and study the influence of irradiation on the probability density function of ASNM, which is the difference between two data sides＇ SNMs, to discuss the reason for pattern imprinting. Finally, we demonstrate that, for micron and deep sub-micron devices, the mechanism of pattern imprinting is the bias-dependent threshold shift of the transistor, but for a deep sub-micron device the shift results from charge trapping in the shallow trench isolation （STI） oxide rather than from the gate oxide of the micron-device.展开更多
This paper is premised on the hypothesis that the amount of rainfall in Nigeria decreases with increasing distance from the coastal areas to the north semi arid lands. This belief widely held in some circles does not ...This paper is premised on the hypothesis that the amount of rainfall in Nigeria decreases with increasing distance from the coastal areas to the north semi arid lands. This belief widely held in some circles does not really follow this pattern due to other climatic factors. This paper examined rainfall pattern and its variability in northeastern Nigeria and its impacts on access to water supply. Data on the mean monthly rainfall over a period of 33 years (1970-2002) were collected from the Nigeria Meteorological Agency (NIMET) in Abuja, Nigeria. The result of the analysis indicates that the mean annual rainfall in the study area is not dependent on distance but some other climatic factors such as relief, solar radiation, temperature, winds, and nature of soil among others. Thus, the amount of rainfall received in Taraba and Borno states which are located in the southern most and extreme end of the study area respectively were higher than that of Gombe state which lies in between them.展开更多
Over the past decade, Graphics Processing Units (GPUs) have revolutionized high-performance computing, playing pivotal roles in advancing fields like IoT, autonomous vehicles, and exascale computing. Despite these adv...Over the past decade, Graphics Processing Units (GPUs) have revolutionized high-performance computing, playing pivotal roles in advancing fields like IoT, autonomous vehicles, and exascale computing. Despite these advancements, efficiently programming GPUs remains a daunting challenge, often relying on trial-and-error optimization methods. This paper introduces an optimization technique for CUDA programs through a novel Data Layout strategy, aimed at restructuring memory data arrangement to significantly enhance data access locality. Focusing on the dynamic programming algorithm for chained matrix multiplication—a critical operation across various domains including artificial intelligence (AI), high-performance computing (HPC), and the Internet of Things (IoT)—this technique facilitates more localized access. We specifically illustrate the importance of efficient matrix multiplication in these areas, underscoring the technique’s broader applicability and its potential to address some of the most pressing computational challenges in GPU-accelerated applications. Our findings reveal a remarkable reduction in memory consumption and a substantial 50% decrease in execution time for CUDA programs utilizing this technique, thereby setting a new benchmark for optimization in GPU computing.展开更多
Pattern division multiple access(PDMA),which is a novel non-orthogonal multiple access(NOMA),has been proposed to address the challenges of massive connectivity and higher spectral efficiency for fifth generation(5G) ...Pattern division multiple access(PDMA),which is a novel non-orthogonal multiple access(NOMA),has been proposed to address the challenges of massive connectivity and higher spectral efficiency for fifth generation(5G) mobile network.The performance of PDMA mainly depends on the design of PDMA pattern matrix.In this paper,pattern matrix design of PDMA for 5G uplink(UL) applications in massive machine type communication(mMTC) and enhanced mobile broadband(eMBB) deployment scenarios are studied.The design criteria and examples for application in UL mMTC and UL eMBB are investigated.The performance of the PDMA pattern matrix is analyzed with the discrete constellation constrained capacity(CC-Capacity),and verified by Monte Carlo simulation.The simulation results show that the preferred PDMA pattern matrix can achieve good performance with different overloading factors(OF).展开更多
Under the background of ‘the Belt and Road’ initiative, the economic cooperation has great potential between China and Russia. The railway accessibility has an important influence on the economic connections of citi...Under the background of ‘the Belt and Road’ initiative, the economic cooperation has great potential between China and Russia. The railway accessibility has an important influence on the economic connections of cities along the railway line. This paper studied the Sino-Russian transnational economic connection based on the railway class accessibility along Trans-Siberian railway(the transnational China railway branch line). The results are as following. First, the railway accessibility of the Chinese nodes is stronger than that of the Russian nodes, which in general displays a tendency of space attenuation from China to the Sino-Russian border, then to Russia. Spatially, the railway accessibility within the study area shows a ‘High East, Low West’ and ‘High South, Low North’ spatial pattern. The railway accessibility of the nodes, which are located at the beginning and end of the railway line, is weaker than those nodes located in the middle of the line. Second, the railway accessibility and external economic connection intensity summation of the nodes show a positive relationship along the railway line. The economic connection intensity summation of different nodes presents obvious regional differentiation. Finally, as economic connection network has evolved, the small world effect of Sino-Russian railway economic connection network becomes strong.展开更多
Two allelopathic rice accessions, PI312777 and Allelopathy1, significantly suppressedthe growth of associated weeds in the field. Moreover, their weed-suppressing effectswere correlated with the cultivation patterns. ...Two allelopathic rice accessions, PI312777 and Allelopathy1, significantly suppressedthe growth of associated weeds in the field. Moreover, their weed-suppressing effectswere correlated with the cultivation patterns. The weed-suppressing effects of throwingand transplanting were more effective than that of direct seeding. Furthermore, theamounts of allelochemicals (resorcinols, flavones and hydroxamic acids) produced andreleased from two allelopathic rice accessions were much higher than that from a non-allelopathic rice variety Hua-Jing-Xian1, and reached the maximum concentration at the6th leaf stage. Differences in the weed-suppressing effects of rice accessions appear toresult from the accessions producing and releasing different amounts of allelochemicalsin the field. Further research confirmed that in PI312777 plants, allelochemicals weresynthesized by the above-ground parts, and then secreted through the root tissues. Roottissues of PI312777 plants never produced the allelochemicals. Root exudates fromPI312777 could significantly inhibit the growth of E. crus-galli surrounding rice plantsin water culture. However, when activated carbon was added to the culture solution, whichcould absorb allelochemicals from root exudates, the growth of E. crus-galli was nolonger significantly inhibited. Weed-suppressing effects of rice accessions depended onallelopathy, cultivation patterns and other factors in rice fields, while allelopathywas one of important factors. Interestingly, the amounts of allelochemicals produced andreleased from allelopathic rice plants may be induced by the presence of E. crus-galli.This suggests that there is a possible chemical recognition between rice and E. crus-galli.展开更多
Currently existing data access object （DAO） patterns have several limitations. First, the interface of the patterns and business objects is tightly-coupled, which affects seriously the dynamic extensibility of softw...Currently existing data access object （DAO） patterns have several limitations. First, the interface of the patterns and business objects is tightly-coupled, which affects seriously the dynamic extensibility of software systems. Second, the patterns have duplicated implementation codes, which add to difficulties of system maintenance. To solve these problems, a new DAO pattern with stronger independency and dynamic extensibility is proposed in this paper. An example is given to illustrate the using process of the new DAO pattern. The greatest advantages of the new DAO pattern are as follows. If any business object is needed to add to the system, we do not have to modify any codes of the class DAO Factory. All we need to do is to modify the mapping file. Furthermore, because we have only one DAO implementation class to accomplish all the data access to business objects, if some SQL statements are needed to be modified, all we need to do is to modify the DAO implementation class but not need to modify any business objects.展开更多
This research presents an improved real-time face recognition system at a low<span><span><span style="font-family:" color:red;"=""> </span></span></span><...This research presents an improved real-time face recognition system at a low<span><span><span style="font-family:" color:red;"=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">resolution of 15 pixels with pose and emotion and resolution variations. We have designed our datasets named LRD200 and LRD100, which have been used for training and classification. The face detection part uses the Viola-Jones algorithm, and the face recognition part receives the face image from the face detection part to process it using the Local Binary Pattern Histogram (LBPH) algorithm with preprocessing using contrast limited adaptive histogram equalization (CLAHE) and face alignment. The face database in this system can be updated via our custom-built standalone android app and automatic restarting of the training and recognition process with an updated database. Using our proposed algorithm, a real-time face recognition accuracy of 78.40% at 15</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">px and 98.05% at 45</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">px have been achieved using the LRD200 database containing 200 images per person. With 100 images per person in the database (LRD100) the achieved accuracies are 60.60% at 15</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">px and 95% at 45</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">px respectively. A facial deflection of about 30</span></span></span><span><span><span><span><span style="color:#4F4F4F;font-family:-apple-system, " font-size:16px;white-space:normal;background-color:#ffffff;"="">°</span></span><span> on either side from the front face showed an average face recognition precision of 72.25%-81.85%. This face recognition system can be employed for law enforcement purposes, where the surveillance camera captures a low-resolution image because of the distance of a person from the camera. It can also be used as a surveillance system in airports, bus stations, etc., to reduce the risk of possible criminal threats.</span></span></span></span>展开更多
文摘We propose an efficient hybrid algorithm WDHP in this paper for mining frequent access patterns. WDHP adopts the techniques of DHP to optimize its performance, which is using hash table to filter candidate set and trimming database. Whenever the database is trimmed to a size less than a specified threshold, the algorithm puts the database into main memory by constructing a tree, and finds frequent patterns on the tree. The experiment shows that WDHP outperform algorithm DHP and main memory based algorithm WAP in execution efficiency.
文摘In this paper, we present a novel approach to model user request patterns in the World Wide Web. Instead of focusing on the user traffic for web pages, we capture the user interaction at the object level of the web pages. Our framework model consists of three sub-models: one for user file access, one for web pages, and one for storage servers. Web pages are assumed to consist of different types and sizes of objects, which are characterized using several categories: articles, media, and mosaics. The model is implemented with a discrete event simulation and then used to investigate the performance of our system over a variety of parameters in our model. Our performance measure of choice is mean response time and by varying the composition of web pages through our categories, we find that our framework model is able to capture a wide range of conditions that serve as a basis for generating a variety of user request patterns. In addition, we are able to establish a set of parameters that can be used as base cases. One of the goals of this research is for the framework model to be general enough that the parameters can be varied such that it can serve as input for investigating other distributed applications that require the generation of user request access patterns.
基金supported by the National Key Research and Development Program of China under Grant No.2022YFB4501500 and No.2022YFB4501503the National Natural Science Foundation of China(62072369)+3 种基金The Youth Innovation Team of Shaanxi Universities(23JP160)the Shaanxi Special Support Program Youth Top-notch Talent Programthe Technology Innovation Leading Program of Shaanxi(2023-YD-CGZH-31)the China Postdoctoral Science Foundation under Grant Number 2024T170080
文摘Searchable encryption(SE)enables data users to securely search encrypted data stored in untrusted cloud servers.However,most SE schemes allow for leakages of access and search patterns to maximize efficiency and functionality.Recent attacks have shown that adversaries can recover query keywords with prior knowledge of the database by exploiting these leakages.Unfortunately,the existing schemes that protect access and search patterns result in frequent communications and high computational costs.Furthermore,complex calculation processes also raise challenges for verifying search results.To address these concerns,we first design an efficient conjunctive SE scheme with search and access pattern privacy using private set intersection.In the proposed scheme,we utilize random numbers to obfuscate the values of polynomials and randomly divide the results into two parts,which simplifies the search process,improves search efficiency,and eliminates the need for time-consuming ciphertext multiplication operations.We also extend this scheme to support search result verifiability.Specifically,by embedding a random number as the root of the return polynomial,we achieve verifiability of search results.Furthermore,we prove the security of both schemes employing the simulation-based method.Finally,we implement the schemes in a real database and thorough performance analyses demonstrate their efficiency.
基金supported by National High Technology Research and Development Program of China (863 Program, No. 2015AA01A709)
文摘Massive machine type communication(m MTC) is one of the key application scenarios for the fifth generation mobile communication(5 G). Grant-free(GF) transmission can reduce the high signaling overhead in m MTC. Non-orthogonal multiple access(NMA) can support more users for m MTC than orthogonal frequency division multiple access(OFDMA). Applying GF transmission in NMA system becomes an active topic recently. The in-depth study on applying GF transmission in pattern division multiple access(PDMA), a competitive candidate scheme of NMA, is investigated in this paper. The definition, latency and allocation of resource and transmission mechanism for GF-PDMA are discussed in detail. The link-level and system-level evaluations are provided to verify the analysis. The analysis and simulation results demonstrate that the proposed GF-PDMA has lower latency than grant based PDMA(GB-PDMA), possesses strong scalability to confront collision and provides almost 2.15 times gain over GF-OFDMA in terms of supporting the number of active users in the system.
文摘Pattem imprinting in deep sub-micron static random access memories （SRAMs） during total dose irradiation is inves- tigated in detail. As the dose accumulates, the data pattern of memory cells loading during irradiation is gradually imprinted on their background data pattern. We build a relationship between the memory cell＇s static noise margin （SNM） and the background data, and study the influence of irradiation on the probability density function of ASNM, which is the difference between two data sides＇ SNMs, to discuss the reason for pattern imprinting. Finally, we demonstrate that, for micron and deep sub-micron devices, the mechanism of pattern imprinting is the bias-dependent threshold shift of the transistor, but for a deep sub-micron device the shift results from charge trapping in the shallow trench isolation （STI） oxide rather than from the gate oxide of the micron-device.
文摘This paper is premised on the hypothesis that the amount of rainfall in Nigeria decreases with increasing distance from the coastal areas to the north semi arid lands. This belief widely held in some circles does not really follow this pattern due to other climatic factors. This paper examined rainfall pattern and its variability in northeastern Nigeria and its impacts on access to water supply. Data on the mean monthly rainfall over a period of 33 years (1970-2002) were collected from the Nigeria Meteorological Agency (NIMET) in Abuja, Nigeria. The result of the analysis indicates that the mean annual rainfall in the study area is not dependent on distance but some other climatic factors such as relief, solar radiation, temperature, winds, and nature of soil among others. Thus, the amount of rainfall received in Taraba and Borno states which are located in the southern most and extreme end of the study area respectively were higher than that of Gombe state which lies in between them.
文摘Over the past decade, Graphics Processing Units (GPUs) have revolutionized high-performance computing, playing pivotal roles in advancing fields like IoT, autonomous vehicles, and exascale computing. Despite these advancements, efficiently programming GPUs remains a daunting challenge, often relying on trial-and-error optimization methods. This paper introduces an optimization technique for CUDA programs through a novel Data Layout strategy, aimed at restructuring memory data arrangement to significantly enhance data access locality. Focusing on the dynamic programming algorithm for chained matrix multiplication—a critical operation across various domains including artificial intelligence (AI), high-performance computing (HPC), and the Internet of Things (IoT)—this technique facilitates more localized access. We specifically illustrate the importance of efficient matrix multiplication in these areas, underscoring the technique’s broader applicability and its potential to address some of the most pressing computational challenges in GPU-accelerated applications. Our findings reveal a remarkable reduction in memory consumption and a substantial 50% decrease in execution time for CUDA programs utilizing this technique, thereby setting a new benchmark for optimization in GPU computing.
基金supported by the National High Technology Research and Development Program of China(863 Program,No. 2015AA01A709)
文摘Pattern division multiple access(PDMA),which is a novel non-orthogonal multiple access(NOMA),has been proposed to address the challenges of massive connectivity and higher spectral efficiency for fifth generation(5G) mobile network.The performance of PDMA mainly depends on the design of PDMA pattern matrix.In this paper,pattern matrix design of PDMA for 5G uplink(UL) applications in massive machine type communication(mMTC) and enhanced mobile broadband(eMBB) deployment scenarios are studied.The design criteria and examples for application in UL mMTC and UL eMBB are investigated.The performance of the PDMA pattern matrix is analyzed with the discrete constellation constrained capacity(CC-Capacity),and verified by Monte Carlo simulation.The simulation results show that the preferred PDMA pattern matrix can achieve good performance with different overloading factors(OF).
基金Under the auspices of National Science and Technology Basic Project of the Ministry of Science and Technology of China(No.2017FY101303-1)National Natural Science Foundation of China(No.41571152,41771179)the Knowledge Innovation Program of CAS(No.ZDRW-ZS-2017-4-3-4,ZDBS-SSW-SQC)
文摘Under the background of ‘the Belt and Road’ initiative, the economic cooperation has great potential between China and Russia. The railway accessibility has an important influence on the economic connections of cities along the railway line. This paper studied the Sino-Russian transnational economic connection based on the railway class accessibility along Trans-Siberian railway(the transnational China railway branch line). The results are as following. First, the railway accessibility of the Chinese nodes is stronger than that of the Russian nodes, which in general displays a tendency of space attenuation from China to the Sino-Russian border, then to Russia. Spatially, the railway accessibility within the study area shows a ‘High East, Low West’ and ‘High South, Low North’ spatial pattern. The railway accessibility of the nodes, which are located at the beginning and end of the railway line, is weaker than those nodes located in the middle of the line. Second, the railway accessibility and external economic connection intensity summation of the nodes show a positive relationship along the railway line. The economic connection intensity summation of different nodes presents obvious regional differentiation. Finally, as economic connection network has evolved, the small world effect of Sino-Russian railway economic connection network becomes strong.
基金supported by the National Natural Science Foundation of China(30070130)the Natural Science Foundation of Guangdong Province,China(021045)+1 种基金National Key Technologies R&D Program in the Tenth Five-Year of China(2001BA509B07)the Scientific Fund for Scholars Returning Overseas of Ministry of Education,China(2001-498).
文摘Two allelopathic rice accessions, PI312777 and Allelopathy1, significantly suppressedthe growth of associated weeds in the field. Moreover, their weed-suppressing effectswere correlated with the cultivation patterns. The weed-suppressing effects of throwingand transplanting were more effective than that of direct seeding. Furthermore, theamounts of allelochemicals (resorcinols, flavones and hydroxamic acids) produced andreleased from two allelopathic rice accessions were much higher than that from a non-allelopathic rice variety Hua-Jing-Xian1, and reached the maximum concentration at the6th leaf stage. Differences in the weed-suppressing effects of rice accessions appear toresult from the accessions producing and releasing different amounts of allelochemicalsin the field. Further research confirmed that in PI312777 plants, allelochemicals weresynthesized by the above-ground parts, and then secreted through the root tissues. Roottissues of PI312777 plants never produced the allelochemicals. Root exudates fromPI312777 could significantly inhibit the growth of E. crus-galli surrounding rice plantsin water culture. However, when activated carbon was added to the culture solution, whichcould absorb allelochemicals from root exudates, the growth of E. crus-galli was nolonger significantly inhibited. Weed-suppressing effects of rice accessions depended onallelopathy, cultivation patterns and other factors in rice fields, while allelopathywas one of important factors. Interestingly, the amounts of allelochemicals produced andreleased from allelopathic rice plants may be induced by the presence of E. crus-galli.This suggests that there is a possible chemical recognition between rice and E. crus-galli.
文摘Currently existing data access object （DAO） patterns have several limitations. First, the interface of the patterns and business objects is tightly-coupled, which affects seriously the dynamic extensibility of software systems. Second, the patterns have duplicated implementation codes, which add to difficulties of system maintenance. To solve these problems, a new DAO pattern with stronger independency and dynamic extensibility is proposed in this paper. An example is given to illustrate the using process of the new DAO pattern. The greatest advantages of the new DAO pattern are as follows. If any business object is needed to add to the system, we do not have to modify any codes of the class DAO Factory. All we need to do is to modify the mapping file. Furthermore, because we have only one DAO implementation class to accomplish all the data access to business objects, if some SQL statements are needed to be modified, all we need to do is to modify the DAO implementation class but not need to modify any business objects.
文摘This research presents an improved real-time face recognition system at a low<span><span><span style="font-family:" color:red;"=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">resolution of 15 pixels with pose and emotion and resolution variations. We have designed our datasets named LRD200 and LRD100, which have been used for training and classification. The face detection part uses the Viola-Jones algorithm, and the face recognition part receives the face image from the face detection part to process it using the Local Binary Pattern Histogram (LBPH) algorithm with preprocessing using contrast limited adaptive histogram equalization (CLAHE) and face alignment. The face database in this system can be updated via our custom-built standalone android app and automatic restarting of the training and recognition process with an updated database. Using our proposed algorithm, a real-time face recognition accuracy of 78.40% at 15</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">px and 98.05% at 45</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">px have been achieved using the LRD200 database containing 200 images per person. With 100 images per person in the database (LRD100) the achieved accuracies are 60.60% at 15</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">px and 95% at 45</span></span></span><span><span><span style="font-family:;" "=""> </span></span></span><span style="font-family:Verdana;"><span style="font-family:Verdana;"><span style="font-family:Verdana;">px respectively. A facial deflection of about 30</span></span></span><span><span><span><span><span style="color:#4F4F4F;font-family:-apple-system, " font-size:16px;white-space:normal;background-color:#ffffff;"="">°</span></span><span> on either side from the front face showed an average face recognition precision of 72.25%-81.85%. This face recognition system can be employed for law enforcement purposes, where the surveillance camera captures a low-resolution image because of the distance of a person from the camera. It can also be used as a surveillance system in airports, bus stations, etc., to reduce the risk of possible criminal threats.</span></span></span></span>
