Pub Date : 2024-03-01DOI: 10.13052/jicts2245-800X.1214
Jun Lu;Guowei Huang;Dan Hu;Wenke Kuai
Due to the current problems of 5G(5th Generation Mobile Communication Technology) networks such as discontinuous coverage, poor coverage performance, and insufficient uplink rate, the real-time transmission performance of 5G networks has been greatly affected, and cannot meet the growing needs of high-speed communication and applications based on the Internet of Things. This paper aims to improve the transmission effect of 5G communication technology by improving the algorithm. By analyzing the problems of existing 5G bandwidth estimation algorithm, this paper proposes a Westwood-based coupling adaptive bandwidth estimation algorithm, and describes the algorithm ideas involved in the algorithm point-by-point. Moreover, this paper uses adaptive bandwidth estimation algorithm to update the slow start threshold in the fast retransmission phase, which makes the congestion window size of path transmission more reasonable. Simulation results show that the congestion control algorithm proposed in this paper improves the accuracy of link bandwidth estimation to a certain extent, improves the link congestion situation and improves the throughput of multipath transmission links. This article can be applied to the algorithm in multipath data transmission to further improve data processing efficiency and processing speed. Therefore, the improved method in this paper can be used in the practice of 5G communication to further improve the efficiency of 5G communication.
{"title":"Multi-Path Data Transmission System Based on 5G Communication Technology","authors":"Jun Lu;Guowei Huang;Dan Hu;Wenke Kuai","doi":"10.13052/jicts2245-800X.1214","DOIUrl":"https://doi.org/10.13052/jicts2245-800X.1214","url":null,"abstract":"Due to the current problems of 5G(5th Generation Mobile Communication Technology) networks such as discontinuous coverage, poor coverage performance, and insufficient uplink rate, the real-time transmission performance of 5G networks has been greatly affected, and cannot meet the growing needs of high-speed communication and applications based on the Internet of Things. This paper aims to improve the transmission effect of 5G communication technology by improving the algorithm. By analyzing the problems of existing 5G bandwidth estimation algorithm, this paper proposes a Westwood-based coupling adaptive bandwidth estimation algorithm, and describes the algorithm ideas involved in the algorithm point-by-point. Moreover, this paper uses adaptive bandwidth estimation algorithm to update the slow start threshold in the fast retransmission phase, which makes the congestion window size of path transmission more reasonable. Simulation results show that the congestion control algorithm proposed in this paper improves the accuracy of link bandwidth estimation to a certain extent, improves the link congestion situation and improves the throughput of multipath transmission links. This article can be applied to the algorithm in multipath data transmission to further improve data processing efficiency and processing speed. Therefore, the improved method in this paper can be used in the practice of 5G communication to further improve the efficiency of 5G communication.","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10695803","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142324362","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01DOI: 10.13052/jicts2245-800X.1213
Ana Koren;Ramjee Prasad
Electronic health records (EHRs) play a vital role in simplifying thorough and effective patient treatment, promoting smooth exchange of information between medical professionals, and enhancing the process of making clinical decisions. With the increasing adoption of sensor-embedded smart wearables and home automation devices, new opportunities arise for innovative solutions in various sectors, such as eHealth. In the age of 5G and 6G, the potential of utilizing user-collected health data becomes vast, promising significant improvements in people's health and well-being. Realizing continuous healthcare access takes a step closer to reality by equipping EHRs to effectively store and interpret data collected by these sensors. This would result in personalized medical services that adhere to standardized practices. This paper presents a comprehensive review of contemporary advancements in the realm of standardization methods aimed at managing personal health data. The study delves into an extensive analysis of state-of-the-art solutions that have emerged to address the intricate challenges associated with the harmonization and uniformity of personal health information. By systematically examining these cutting-edge approaches, the review elucidates the diverse strategies employed to establish a cohesive framework for organizing, storing, and exchanging personal health data. Furthermore, the review critically evaluates the effectiveness and limitations of each solution in terms of promoting interoperability, safeguarding data privacy, and facilitating seamless data sharing among healthcare stakeholders. Furthermore, this paper then presents an approach to standardize the data by establishing semantic constraints for healthcare data types and proposing a validation procedure to ensure compliance with relevant standards and regulations.
{"title":"Setting Standards for Personal Health Data in the Age of 5G and 6G Networks","authors":"Ana Koren;Ramjee Prasad","doi":"10.13052/jicts2245-800X.1213","DOIUrl":"10.13052/jicts2245-800X.1213","url":null,"abstract":"Electronic health records (EHRs) play a vital role in simplifying thorough and effective patient treatment, promoting smooth exchange of information between medical professionals, and enhancing the process of making clinical decisions. With the increasing adoption of sensor-embedded smart wearables and home automation devices, new opportunities arise for innovative solutions in various sectors, such as eHealth. In the age of 5G and 6G, the potential of utilizing user-collected health data becomes vast, promising significant improvements in people's health and well-being. Realizing continuous healthcare access takes a step closer to reality by equipping EHRs to effectively store and interpret data collected by these sensors. This would result in personalized medical services that adhere to standardized practices. This paper presents a comprehensive review of contemporary advancements in the realm of standardization methods aimed at managing personal health data. The study delves into an extensive analysis of state-of-the-art solutions that have emerged to address the intricate challenges associated with the harmonization and uniformity of personal health information. By systematically examining these cutting-edge approaches, the review elucidates the diverse strategies employed to establish a cohesive framework for organizing, storing, and exchanging personal health data. Furthermore, the review critically evaluates the effectiveness and limitations of each solution in terms of promoting interoperability, safeguarding data privacy, and facilitating seamless data sharing among healthcare stakeholders. Furthermore, this paper then presents an approach to standardize the data by establishing semantic constraints for healthcare data types and proposing a validation procedure to ensure compliance with relevant standards and regulations.","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10695799","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141117055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01DOI: 10.13052/jicts2245-800X.1211
Yingjie Cheng
Education professionals receive instruction in Music Education (ME) to prepare for prospective jobs like secondary or primary music teachers, schools ensembles executives, or ensembles directors at music institutions. In the discipline of music education, educators do original research on different approaches to teaching and studying music. The most accurate and effective method of extracting music from huge music databases has become one of the most frequently discussed participants in contemporary multimedia information retrieval development. The essence of multimedia material is presented within a range of techniques since it is not bound to a single side. These several categories could consist of the song's audio components and lyrics for musical information. Retrieving melodic information, subsequently, becomes the main focus of most recent studies. Aside from being an expensive deviate from academics, music programs are neither a viable profession neither a valid pastime. Therefore, in this study, we offer a Continuous Hidden Markov Algorithm (CHMA) related a novel method for recovering melodies from musical multimedia recordings. CHMA is considered to be the most basic dynamic Bayesian network. Two various types of audio frame features and audio example features are extracted throughout the feature extraction procedure from the audio signal according to unit length. Every music clip receives a unique approach that we implement with concurrently using various CHMA. The initial music gets processed using a trained CHMA that monitors fundamental frequencies, maps states, and generates retrieval outcomes. The training time for Traditional opera reached 455.76 minutes, the testing time for Narration achieved 56.10 minutes, and the recognition accuracy for advertisement reached an impressive 98.02%. A subsequently experimental result validates the applicability of the proposed approach.
{"title":"A Continuous Hidden Markov Algorithm-Based Multimedia Melody Retrieval System for Music Education","authors":"Yingjie Cheng","doi":"10.13052/jicts2245-800X.1211","DOIUrl":"10.13052/jicts2245-800X.1211","url":null,"abstract":"Education professionals receive instruction in Music Education (ME) to prepare for prospective jobs like secondary or primary music teachers, schools ensembles executives, or ensembles directors at music institutions. In the discipline of music education, educators do original research on different approaches to teaching and studying music. The most accurate and effective method of extracting music from huge music databases has become one of the most frequently discussed participants in contemporary multimedia information retrieval development. The essence of multimedia material is presented within a range of techniques since it is not bound to a single side. These several categories could consist of the song's audio components and lyrics for musical information. Retrieving melodic information, subsequently, becomes the main focus of most recent studies. Aside from being an expensive deviate from academics, music programs are neither a viable profession neither a valid pastime. Therefore, in this study, we offer a Continuous Hidden Markov Algorithm (CHMA) related a novel method for recovering melodies from musical multimedia recordings. CHMA is considered to be the most basic dynamic Bayesian network. Two various types of audio frame features and audio example features are extracted throughout the feature extraction procedure from the audio signal according to unit length. Every music clip receives a unique approach that we implement with concurrently using various CHMA. The initial music gets processed using a trained CHMA that monitors fundamental frequencies, maps states, and generates retrieval outcomes. The training time for Traditional opera reached 455.76 minutes, the testing time for Narration achieved 56.10 minutes, and the recognition accuracy for advertisement reached an impressive 98.02%. A subsequently experimental result validates the applicability of the proposed approach.","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10695800","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141117611","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01DOI: 10.13052/jicts2245-800X.1212
Shizheng Liu;Xuan Chen;Feng Cheng
Aiming at the shortcomings of long completion time and high consumption cost of cloud computing batch task scheduling in IoT, an Improved Chicken Swarm Optimization Algorithm (ICSO) for task scheduling in cloud computing scenarios is proposed. Specifically, in order to solve the problems of slow convergence and falling into local optimum of the chicken swarm optimization algorithm, we adopt the nonlinear decreasing technique of the rooster and the weighting technique of the hen, optimize the following coefficients of the chicks, and apply ICSO to cloud computing task scheduling. In simulation experiments, we conducted a large number of experiments using four standard benchmark functions with different number of tasks and the results show that ICSO algorithm reduces 25.8%, 9.3%, 8.8%, 7.5% in small task time compared to CSO, DCSO, GCSO, ABCSO in large task time by 30.8%, 8.3%, 7.8%, 6.3%, 11.8%, 10.3%, 8.8%, 7.5% savings in small task cost and 25.8%, 11.2%, 10.8%, 9.3% savings in large task cost. This method effectively reduces task scheduling time and cost consumption. Meanwhile, we tested it in combination with an IoT-based cloud platform and achieved very satisfying Results.
{"title":"Research on Task Scheduling for Internet of Things Cloud Computing Based on Improved Chicken Swarm Optimization Algorithm","authors":"Shizheng Liu;Xuan Chen;Feng Cheng","doi":"10.13052/jicts2245-800X.1212","DOIUrl":"10.13052/jicts2245-800X.1212","url":null,"abstract":"Aiming at the shortcomings of long completion time and high consumption cost of cloud computing batch task scheduling in IoT, an Improved Chicken Swarm Optimization Algorithm (ICSO) for task scheduling in cloud computing scenarios is proposed. Specifically, in order to solve the problems of slow convergence and falling into local optimum of the chicken swarm optimization algorithm, we adopt the nonlinear decreasing technique of the rooster and the weighting technique of the hen, optimize the following coefficients of the chicks, and apply ICSO to cloud computing task scheduling. In simulation experiments, we conducted a large number of experiments using four standard benchmark functions with different number of tasks and the results show that ICSO algorithm reduces 25.8%, 9.3%, 8.8%, 7.5% in small task time compared to CSO, DCSO, GCSO, ABCSO in large task time by 30.8%, 8.3%, 7.8%, 6.3%, 11.8%, 10.3%, 8.8%, 7.5% savings in small task cost and 25.8%, 11.2%, 10.8%, 9.3% savings in large task cost. This method effectively reduces task scheduling time and cost consumption. Meanwhile, we tested it in combination with an IoT-based cloud platform and achieved very satisfying Results.","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10695802","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141117589","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-01DOI: 10.13052/jicts2245-800X.1215
Hugh Boyes;Matthew D. Higgins
Advances in digitalization, particularly those regarding cyber-physical systems (CPS) have stimulated the adoption of digital capabilities such as Industrial IoT, machine learning, cloud services, and the use of digital twins. The increased digital sophistication of CPS is not without risk, particularly regarding the potential for information/cyber security incidents. Whilst the need for security of enterprise information security is not new, A significant challenge is understanding what security standards may be available and applicable when developing security controls and technical measures to protect CPS. This paper explores what research is available regarding the choice and comparison of information/cyber security standards. It provides a snapshot of the security standards landscape at the start of 2024. Issues relating to development and adoption of security standards are examined, illustrated using inconsistencies in language regarding three key terms: availability, integrity, and confidentiality.
{"title":"An Overview of Information and Cyber Security Standards","authors":"Hugh Boyes;Matthew D. Higgins","doi":"10.13052/jicts2245-800X.1215","DOIUrl":"https://doi.org/10.13052/jicts2245-800X.1215","url":null,"abstract":"Advances in digitalization, particularly those regarding cyber-physical systems (CPS) have stimulated the adoption of digital capabilities such as Industrial IoT, machine learning, cloud services, and the use of digital twins. The increased digital sophistication of CPS is not without risk, particularly regarding the potential for information/cyber security incidents. Whilst the need for security of enterprise information security is not new, A significant challenge is understanding what security standards may be available and applicable when developing security controls and technical measures to protect CPS. This paper explores what research is available regarding the choice and comparison of information/cyber security standards. It provides a snapshot of the security standards landscape at the start of 2024. Issues relating to development and adoption of security standards are examined, illustrated using inconsistencies in language regarding three key terms: availability, integrity, and confidentiality.","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10695801","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142324363","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-22DOI: 10.13052/jicts2245-800X.1141
Mohammed Mujeer Ulla;Preethi;Md. Sameeruddin Khan;Deepak S. Sakkari
Very recent attacks like ladder leaks demonstrated the feasibility of recovering private keys with side-channel attacks using just one bit of secret nonce. ECDSA nonce bias can be exploited in many ways. Some attacks on ECDSA involve complicated Fourier analysis and lattice mathematics. This paper will enable cryptographers to identify efficient ways in which ECDSA can be cracked on curves NIST256p, SECP256k1, NIST521p, and weak nonce, kind of attacks that can crack ECDSA and how to protect yourself. Initially, we begin with an ECDSA signature to sign a message using the private key and validate the generated signature using the shared public key. Then we use a nonce or a random value to randomize the generated signature. Every time we sign, a new verifiable random nonce value is created, and a way in which the intruder can discover the private key if the signer leaks any one of the nonce values. Then we use Lenstra-Lenstra-Lovasz (LLL) method as a black box, we will try to attack signatures generated from bad nonce or bad random number generator (RAG) on NIST256p, SECP256k1 curves. The combination of nonce generation, post-message signing, and validation in ECDSA helps achieve Uniqueness, Authentication, Integrity, and Non-Repudiation. The analysis is performed by considering all three curves for the implementation of the Elliptic Curve Digital Signature Algorithm (ECDSA). The comparative analysis for each of the selected curves in terms of computational time is done with the leak of nonce and with the Lenstra-Lenstra-Lovasz method to crack ECDSA. The average computational costs to break ECDSA with curves NIST256p, NIST521p, and SECP256k1 are 0.016, 0.34,0.46 respectively which is almost zero depicting the strength of the algorithm. The average computational costs to break ECDSA with curves SECP256K1 and NIST256p using LLL are 2.9 and 3.4 respectively
{"title":"Implementation of Elliptic Curve Cryptosystem with Bitcoin Curves on SECP256k1, NIST256p, NIST521p, and LLL","authors":"Mohammed Mujeer Ulla;Preethi;Md. Sameeruddin Khan;Deepak S. Sakkari","doi":"10.13052/jicts2245-800X.1141","DOIUrl":"https://doi.org/10.13052/jicts2245-800X.1141","url":null,"abstract":"Very recent attacks like ladder leaks demonstrated the feasibility of recovering private keys with side-channel attacks using just one bit of secret nonce. ECDSA nonce bias can be exploited in many ways. Some attacks on ECDSA involve complicated Fourier analysis and lattice mathematics. This paper will enable cryptographers to identify efficient ways in which ECDSA can be cracked on curves NIST256p, SECP256k1, NIST521p, and weak nonce, kind of attacks that can crack ECDSA and how to protect yourself. Initially, we begin with an ECDSA signature to sign a message using the private key and validate the generated signature using the shared public key. Then we use a nonce or a random value to randomize the generated signature. Every time we sign, a new verifiable random nonce value is created, and a way in which the intruder can discover the private key if the signer leaks any one of the nonce values. Then we use Lenstra-Lenstra-Lovasz (LLL) method as a black box, we will try to attack signatures generated from bad nonce or bad random number generator (RAG) on NIST256p, SECP256k1 curves. The combination of nonce generation, post-message signing, and validation in ECDSA helps achieve Uniqueness, Authentication, Integrity, and Non-Repudiation. The analysis is performed by considering all three curves for the implementation of the Elliptic Curve Digital Signature Algorithm (ECDSA). The comparative analysis for each of the selected curves in terms of computational time is done with the leak of nonce and with the Lenstra-Lenstra-Lovasz method to crack ECDSA. The average computational costs to break ECDSA with curves NIST256p, NIST521p, and SECP256k1 are 0.016, 0.34,0.46 respectively which is almost zero depicting the strength of the algorithm. The average computational costs to break ECDSA with curves SECP256K1 and NIST256p using LLL are 2.9 and 3.4 respectively","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10326102","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431209","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-22DOI: 10.13052/jicts2245-800X.1143
Wei Shang;Huihua Men;Xiujie Du
Accurate automatic scoring of English essay is beneficial for both teachers and students in English teaching. This paper briefly introduced an XGBoost-based automated scoring algorithm for English essay. To improve the accuracy of the algorithm, a long short-term memory (LSTM) semantic model was introduced to extract semantic scoring features from essays. Finally, the improved XGBoost algorithm was compared with the traditional XGBoost and LSTM algorithms in a simulation experiment using five types of essay prompts. The results indicate that the improved XGBoost algorithm has the best performance for automatic scoring of English essay and also requires the shortest scoring time.
{"title":"Machine Learning Models: A Study of English Essay Text Content Feature Extraction and Automatic Scoring","authors":"Wei Shang;Huihua Men;Xiujie Du","doi":"10.13052/jicts2245-800X.1143","DOIUrl":"https://doi.org/10.13052/jicts2245-800X.1143","url":null,"abstract":"Accurate automatic scoring of English essay is beneficial for both teachers and students in English teaching. This paper briefly introduced an XGBoost-based automated scoring algorithm for English essay. To improve the accuracy of the algorithm, a long short-term memory (LSTM) semantic model was introduced to extract semantic scoring features from essays. Finally, the improved XGBoost algorithm was compared with the traditional XGBoost and LSTM algorithms in a simulation experiment using five types of essay prompts. The results indicate that the improved XGBoost algorithm has the best performance for automatic scoring of English essay and also requires the shortest scoring time.","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10326100","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-22DOI: 10.13052/jicts2245-800X.1144
Han Yang
This paper mainly studied the automatic test paper generation and scoring problems in university English exams. Firstly, an automatic test paper generation model was established. Then, an improved genetic algorithm (IGA) was designed for intelligent test paper generation, and it was also used to automatically score answers to Chinese-to-English translation questions in terms of syntax and semantics. It was found that compared with the traditional GA and particle swarm optimization algorithm, the IGA method was faster in generating test papers, with an average generation time of 25 s, and had a higher success rate (94%), suggesting higher validity, and the difficulty and differentiation degrees of the test papers were closer to the preset values. The results of automatic scoring also had a correlation of more than 0.8 with the manual scoring results. The results prove the effectiveness of the automatic test paper generation and scoring method. It can be promoted and applied in practice to enhance the security and fairness of large-scale English exams, as well as achieve objectivity and consistency in scoring.
{"title":"A Study on an Intelligent Algorithm for Automatic Test Paper Generation and Scoring in University English Exams","authors":"Han Yang","doi":"10.13052/jicts2245-800X.1144","DOIUrl":"https://doi.org/10.13052/jicts2245-800X.1144","url":null,"abstract":"This paper mainly studied the automatic test paper generation and scoring problems in university English exams. Firstly, an automatic test paper generation model was established. Then, an improved genetic algorithm (IGA) was designed for intelligent test paper generation, and it was also used to automatically score answers to Chinese-to-English translation questions in terms of syntax and semantics. It was found that compared with the traditional GA and particle swarm optimization algorithm, the IGA method was faster in generating test papers, with an average generation time of 25 s, and had a higher success rate (94%), suggesting higher validity, and the difficulty and differentiation degrees of the test papers were closer to the preset values. The results of automatic scoring also had a correlation of more than 0.8 with the manual scoring results. The results prove the effectiveness of the automatic test paper generation and scoring method. It can be promoted and applied in practice to enhance the security and fairness of large-scale English exams, as well as achieve objectivity and consistency in scoring.","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10326101","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In today's digital world, the Internet is an essential component of communication networks. It provides a platform for quickly exchanging information among communicating parties. There is a risk of unauthorized persons gaining access to our sensitive information while it is being transmitted. Cryptography is one of the most effective and efficient strategies for protecting our data and it are utilized all around the world. The efficiency of a cryptography algorithm is determined by a number of parameters, one of which is the length of the key. For cryptography, key (public/private) is an essential part. To provide robust security, RSA takes larger key size. If we use larger key size, the processing performance will be slowed. As a result, processing speed will decrease and memory consumption will increase. Due to this, cryptographic algorithms with smaller key size and higher security are becoming more popular. Out of the cryptographic algorithms, Elliptic Curve Cryptography (ECC) provides equivalent level of safety which RSA provides, but it takes smaller key size. On the basis of key size, our work focused on, studied, and compared the efficacy in terms of security among the well-known public key cryptography algorithms, namely ECC (Elliptic Curve Cryptography) and RSA (Rivets Shamir Adelman).
{"title":"Analysis of Elliptic Curve Cryptography & RSA","authors":"Mohammad Rafeek Khan;Kamal Upreti;Mohammad Imran Alam;Haneef Khan;Shams Tabrez Siddiqui;Mustafizul Haque;Jyoti Parashar","doi":"10.13052/jicts2245-800X.1142","DOIUrl":"https://doi.org/10.13052/jicts2245-800X.1142","url":null,"abstract":"In today's digital world, the Internet is an essential component of communication networks. It provides a platform for quickly exchanging information among communicating parties. There is a risk of unauthorized persons gaining access to our sensitive information while it is being transmitted. Cryptography is one of the most effective and efficient strategies for protecting our data and it are utilized all around the world. The efficiency of a cryptography algorithm is determined by a number of parameters, one of which is the length of the key. For cryptography, key (public/private) is an essential part. To provide robust security, RSA takes larger key size. If we use larger key size, the processing performance will be slowed. As a result, processing speed will decrease and memory consumption will increase. Due to this, cryptographic algorithms with smaller key size and higher security are becoming more popular. Out of the cryptographic algorithms, Elliptic Curve Cryptography (ECC) provides equivalent level of safety which RSA provides, but it takes smaller key size. On the basis of key size, our work focused on, studied, and compared the efficacy in terms of security among the well-known public key cryptography algorithms, namely ECC (Elliptic Curve Cryptography) and RSA (Rivets Shamir Adelman).","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10326103","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431210","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-22DOI: 10.13052/jicts2245-800X.1145
René Lindner;Madlen Schmudde;Alicia Jiménez González;Jaime Loureiro Acuña;Knut Blind
The digitalization of public services is one of the major challenges that public administrations are currently facing. Electronic identifications play a major role for a variety of these related services. Due to the impact these services will have on the daily life of citizens, organizations, and the public at large, the social dimensions must be considered equally to the technical ones. To ensure the applicability, trust, and compliance of electronic identity for access to public services, it is necessary to take into account relevant standards collected through an analysis of the state-of-the-art. In general, the literature on integrating standardization in research projects is very rare and potential impacts of standards related to electronic identification have not been assessed yet. The European project IMPULSE has integrated standardization as an essential element and assessed the relevant standardization landscape as one activity. The analysis of the standardization landscape resulted in the identification of nine formal and six de-facto standards that have high relevance for IMPULSE. The process for this analysis and the resulting dashboard will support future projects to effectively consider, analyze and use standards for their projects.
{"title":"Analyzing the Standardization Landscape for Identity Management in Public Services - A Standards Review for the IMPULSE Project","authors":"René Lindner;Madlen Schmudde;Alicia Jiménez González;Jaime Loureiro Acuña;Knut Blind","doi":"10.13052/jicts2245-800X.1145","DOIUrl":"https://doi.org/10.13052/jicts2245-800X.1145","url":null,"abstract":"The digitalization of public services is one of the major challenges that public administrations are currently facing. Electronic identifications play a major role for a variety of these related services. Due to the impact these services will have on the daily life of citizens, organizations, and the public at large, the social dimensions must be considered equally to the technical ones. To ensure the applicability, trust, and compliance of electronic identity for access to public services, it is necessary to take into account relevant standards collected through an analysis of the state-of-the-art. In general, the literature on integrating standardization in research projects is very rare and potential impacts of standards related to electronic identification have not been assessed yet. The European project IMPULSE has integrated standardization as an essential element and assessed the relevant standardization landscape as one activity. The analysis of the standardization landscape resulted in the identification of nine formal and six de-facto standards that have high relevance for IMPULSE. The process for this analysis and the resulting dashboard will support future projects to effectively consider, analyze and use standards for their projects.","PeriodicalId":36697,"journal":{"name":"Journal of ICT Standardization","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10326104","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138431211","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：