Template-Type: ReDIF-Article 1.0 Author-Name: Runhua Miao Author-X-Name-First: Runhua Author-X-Name-Last: Miao Title: Multi-level secure storage method of electronic documents based on Hash function Abstract: In order to improve the storage security and efficiency of electronic documents, a new multi-level secure storage method of electronic documents based on Hash function is proposed in this paper. Firstly, the vector space model is constructed, and the electronic document data is divided into fixed size data blocks by using the idea of linear segmentation. Then, after normalisation, Hash function is used to encrypt each data block. Finally, according to the encryption results, the compressed sensing method is used for multi-level secure storage of electronic documents. The experimental results show that, compared with the traditional storage methods, this method has strong encryption performance, and the maximum intrusion rate is no more than 0.5%, which can ensure the security of electronic documents. This method can improve the storage efficiency of electronic documents. Journal: Int. J. of Information Technology and Management Pages: 106-116 Issue: 1/2 Volume: 24 Year: 2025 Keywords: Hash function; electronic document; multi-level security storage; data segmentation. File-URL: http://www.inderscience.com/link.php?id=144105 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:106-116 Template-Type: ReDIF-Article 1.0 Author-Name: Lixia Du Author-X-Name-First: Lixia Author-X-Name-Last: Du Author-Name: Xin An Author-X-Name-First: Xin Author-X-Name-Last: An Title: An enterprise financial credit risk measurement method based on differential evolution algorithm Abstract: In order to reduce the time cost and risk misjudgement rate of financial information risk measurement, this paper proposes a new enterprise financial credit risk measurement method based on differential evolution algorithm. Firstly, after preprocessing the enterprise financial credit risk data and determining the location of the clustering centre, a differential evolution automatic clustering model is constructed. Secondly, according to the clustering results, the differential evolution algorithm is used to measure the basic process of enterprise financial credit risk. Finally, the improved differential evolution algorithm is used for iterative measurement to achieve enterprise financial credit risk data measurement. The experimental results show that the time cost of the proposed method for enterprise financial credit risk measurement can be controlled within 0.4 s, and the error rate is not more than 1% under the condition of 1,000 data. Journal: Int. J. of Information Technology and Management Pages: 67-77 Issue: 1/2 Volume: 24 Year: 2025 Keywords: differential evolution algorithm; corporate finance; credit risks; measurement method. File-URL: http://www.inderscience.com/link.php?id=144106 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:67-77 Template-Type: ReDIF-Article 1.0 Author-Name: Lina Si Author-X-Name-First: Lina Author-X-Name-Last: Si Author-Name: Zhanlei Shang Author-X-Name-First: Zhanlei Author-X-Name-Last: Shang Title: Performance evaluation method of human resource management based on chaotic algorithm Abstract: This paper proposes a new method of HR management performance evaluation based on chaotic algorithm. First, to improve the evaluation performance as the research goal, design the guiding principles of evaluation. Second, under the guidance of the principle, the multi type data of HR management are collected, and the chaotic algorithm is used to extract the characteristics of the data. Finally, after constructing the index system, calculate the weight and construct the evaluation function to complete the overall management performance evaluation. The test results show that the evaluation performance of the method has been improved. On the basis of shortening the evaluation time, the evaluation accuracy has been improved to 97.68%. Journal: Int. J. of Information Technology and Management Pages: 27-36 Issue: 1/2 Volume: 24 Year: 2025 Keywords: chaotic algorithm; human resources; management performance evaluation; index system. File-URL: http://www.inderscience.com/link.php?id=144107 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:27-36 Template-Type: ReDIF-Article 1.0 Author-Name: Guang Zhao Author-X-Name-First: Guang Author-X-Name-Last: Zhao Author-Name: Zhi Li Author-X-Name-First: Zhi Author-X-Name-Last: Li Title: A data integrity detection method for accounting informatisation based on homomorphic hash function Abstract: In order to solve the problems of low data detection accuracy and high detection time overhead, this paper proposes an accounting information data integrity detection method based on homomorphic hash function. First, the accounting data is collected by data mining method and the strong relevance of the data is determined by association rules. Then, set the distance matrix to determine the data key points, match the niche factor between the data key points, and complete the feature extraction. Finally, the binary code is used to mark the accounting information data, and the anti-collision of homomorphic hash function is used to complete the projection of accounting data, so as to realise the data integrity detection. The results show that the detection accuracy of this method is up to 98%, and the detection time overhead is within 4S, which shows that this method can effectively improve the integrity detection effect. Journal: Int. J. of Information Technology and Management Pages: 13-26 Issue: 1/2 Volume: 24 Year: 2025 Keywords: homomorphic hash function; accounting informatisation; data detection; integrity: association rules. File-URL: http://www.inderscience.com/link.php?id=144108 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:13-26 Template-Type: ReDIF-Article 1.0 Author-Name: Xiaofeng Zhang Author-X-Name-First: Xiaofeng Author-X-Name-Last: Zhang Title: New business management model of enterprises based on data-driven Abstract: In the current enterprise management mode, there are problems such as low efficiency of enterprise management data processing and reducing the economic benefits of enterprises, which affect the rapid development of enterprises. In order to solve this problem, this paper studies the new business management model of enterprises based on data-driven. Build a data-driven enterprise management mode framework, integrate enterprise management data with KNN algorithm, and calculate user access trust and reliability values with trust management model to improve data processing efficiency and data security. Based on the digital processing of enterprise management data, the development strategy of new business management mode is given. The experimental results show that after applying the management mode designed in this paper, the maximum profit of the enterprise can reach 20.5 million yuan, and the maximum value of the enterprise data processing time is only 6.03 s. This proves that the designed management mode is more efficient for the enterprise management data processing, and can effectively improve the enterprise economic income, and has certain practical application value. Journal: Int. J. of Information Technology and Management Pages: 1-12 Issue: 1/2 Volume: 24 Year: 2025 Keywords: data-driven; business management model; data integration; KNN algorithm; trust management model; development strategy. File-URL: http://www.inderscience.com/link.php?id=144109 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:1-12 Template-Type: ReDIF-Article 1.0 Author-Name: Hongmei Wan Author-X-Name-First: Hongmei Author-X-Name-Last: Wan Title: A recognition method of abnormal learning behaviour in MOOC online education based on background subtraction Abstract: In order to overcome the problems of high time-consuming and poor recognition accuracy of learning behaviour recognition, this paper proposes an abnormal learning behaviour recognition method for MOOC online education based on background subtraction. Firstly, the characteristics of students' abnormal learning behaviours are collected and extracted. Then, the background difference algorithm is used to obtain the foreground object and background of the learning image, and the image pixels are classified. Finally, the mean background method is used to obtain the learning background, the abnormal behaviour recognition classifier is designed, and the background subtraction method is used to realise the abnormal learning behaviour recognition. The results show that the recognition accuracy of this method is as high as 98.32%, the recognition time is only 0.52 s, and the recognition recall rate is as high as 96.7%, indicating that this method can improve the recognition effect of abnormal learning behaviour. Journal: Int. J. of Information Technology and Management Pages: 52-66 Issue: 1/2 Volume: 24 Year: 2025 Keywords: background subtraction; binarisation treatment; mean background method; background difference method; online education. File-URL: http://www.inderscience.com/link.php?id=144110 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:52-66 Template-Type: ReDIF-Article 1.0 Author-Name: Siguang Dai Author-X-Name-First: Siguang Author-X-Name-Last: Dai Author-Name: Zhongming Tang Author-X-Name-First: Zhongming Author-X-Name-Last: Tang Author-Name: Ling Zhou Author-X-Name-First: Ling Author-X-Name-Last: Zhou Title: An evaluation method of government digital service quality based on big data Abstract: Aiming at the problems of low accuracy and poor reliability of government service quality evaluation, this paper proposes a government digital service quality evaluation method based on big data. Firstly, the tree structure of index selection was obtained by big data analysis method, and the service quality evaluation index was selected. Secondly, the factor analysis method is used to analyse the reasonability of each evaluation factor and construct the evaluation system. Secondly, it obtains the government digital service data, and finally calculates the weight of service quality evaluation index. According to the clustering of big data, the fuzzy language is integrated and processed to realise the evaluation of government digital service quality. The results show that the evaluation time of the proposed method is not more than 29 s, and the consistency coefficient value of quality evaluation accuracy is 0.79. It has high evaluation efficiency and accuracy. Journal: Int. J. of Information Technology and Management Pages: 37-51 Issue: 1/2 Volume: 24 Year: 2025 Keywords: big data; government digital service; quality evaluation; evaluation index; fuzzy logic. File-URL: http://www.inderscience.com/link.php?id=144111 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:37-51 Template-Type: ReDIF-Article 1.0 Author-Name: Yan Wang Author-X-Name-First: Yan Author-X-Name-Last: Wang Title: A performance evaluation method of new business model based on grey correlation algorithm Abstract: A new business model performance evaluation method based on grey correlation algorithm is designed to solve the problems of large evaluation error and low key of screening indicators in the new business model performance evaluation. First, analyse the new business model and screen the performance evaluation indicators of the new business model. Then, the clustering algorithm is used to determine the cluster family of each index, extract the performance evaluation index characteristics of the new business model, and construct the performance evaluation index system. Finally, the grey correlation algorithm is used to determine the grey correlation degree between the indicators, quantify the evaluation indicators, build a grey correlation model for the performance evaluation of the new business model, and realise the performance evaluation. The experimental results show that the evaluation error of the proposed evaluation method is only 2%, and the key degree of the selected index is higher than 90%, which is increased by more than 5%. This method has higher practical application value. Journal: Int. J. of Information Technology and Management Pages: 92-105 Issue: 1/2 Volume: 24 Year: 2025 Keywords: grey correlation algorithm; new business model; performance evaluation; clustering algorithm; main sequence; correlation sequence; consistency check. File-URL: http://www.inderscience.com/link.php?id=144112 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:92-105 Template-Type: ReDIF-Article 1.0 Author-Name: Miao Ma Author-X-Name-First: Miao Author-X-Name-Last: Ma Title: Research on digital English teaching materials recommendation based on improved machine learning Abstract: In order to overcome the problems of low accuracy, time-consuming and low user satisfaction in traditional methods, a digital English teaching materials recommendation method based on improved machine learning is proposed. Firstly, use web crawlers to obtain the data of digital English teaching platform, and use Word2vec model data for training to obtain the data feature vector. Secondly, K-means algorithm is used to cluster users according to feature vectors, and multi-Markov chains are used to predict user interest. Finally, the decision tree algorithm in machine learning is improved on the gradient boosting framework, and the digital English teaching materials are recommended by using the improved algorithm and the user interest prediction results. The experimental results show that the accuracy of this method is more than 96%, the average time of digital English teaching materials recommendation is 76.1 ms, and the average user satisfaction is 96.6. Journal: Int. J. of Information Technology and Management Pages: 78-91 Issue: 1/2 Volume: 24 Year: 2025 Keywords: improved machine learning; digitisation; English teaching; data recommendation; multiple Markov chains; decision tree. File-URL: http://www.inderscience.com/link.php?id=144113 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:78-91 Template-Type: ReDIF-Article 1.0 Author-Name: Xi Li Author-X-Name-First: Xi Author-X-Name-Last: Li Title: The personalised classification of brand promotion information based on K-means algorithm Abstract: In order to improve the efficiency of personalised classification of brand promotion information and shorten the time of personalised classification, this paper proposes a personalised classification method of brand promotion information based on K-means algorithm. First, collect brand promotion information, and calculate the text relevance of brand promotion information through weighting factors. Secondly, the attribute division of extension information is carried out by using the three branch decision-making theory. Then, the information features of brand promotion are extracted by capsule network. Finally, calculate the similarity between different brand promotion information, obtain the brand promotion information classification function, and realise the personalised classification of brand promotion information through k-means algorithm. The experimental results show that the classification accuracy of this method is 98.08%, and the time of personalised information classification is only 1.20 s, indicating that this method can effectively improve the efficiency of personalised classification of brand promotion information. Journal: Int. J. of Information Technology and Management Pages: 117-129 Issue: 1/2 Volume: 24 Year: 2025 Keywords: k-means algorithm; information attribute division; feature extraction; personalised classification of information. File-URL: http://www.inderscience.com/link.php?id=144114 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:117-129 Template-Type: ReDIF-Article 1.0 Author-Name: Carolina Almeida Author-X-Name-First: Carolina Author-X-Name-Last: Almeida Author-Name: Bráulio Alturas Author-X-Name-First: Bráulio Author-X-Name-Last: Alturas Title: Users' satisfaction evaluation based on ISO standards for tourism and travel mobile applications Abstract: This study is based on the results of a survey applied to a sample of 201 users, which gave them an opportunity to identify points of improvement that will be used in a proposal for a new application. In addition, it aimed to obtain data that allows analysis metrics to be applied to International Standard Organization (ISO) standards and attempts to understand why individuals use these applications, based on the technology acceptance model (TAM). From the results obtained, it was concluded that there was an average level of satisfaction with the applications of 4.22, on a scale ranging from 1 to 5. Based on the opinions of the respondents, it was also possible to select future improvements for the applications that could contribute to a new tourism and travel application. Finally, it was concluded that there is a direct link between content acceptance and quality. Journal: Int. J. of Information Technology and Management Pages: 130-144 Issue: 1/2 Volume: 24 Year: 2025 Keywords: application; user satisfaction; travel; tourism; rating; TAM; ISO standards; mobile applications. File-URL: http://www.inderscience.com/link.php?id=144132 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:130-144 Template-Type: ReDIF-Article 1.0 Author-Name: Marcelo Martins Author-X-Name-First: Marcelo Author-X-Name-Last: Martins Author-Name: Pedro Campos Author-X-Name-First: Pedro Author-X-Name-Last: Campos Author-Name: Isabel Mota Author-X-Name-First: Isabel Author-X-Name-Last: Mota Title: Blockchain governance: reducing trusted third parties with Decred project Abstract: Decred is a cryptocurrency with its own blockchain and has several similarities with bitcoin but implements a governance model that resembles a company with thousands of investors. These stakeholders invest their coins, receive the right to direct the project as they see fit and are rewarded for doing so. Everyone else not invested may use the coin as means of exchange, trading it for goods or services or consuming other services provided by the blockchain as the digital notary. This paper investigates how Decred project created its own version of money and implemented security measures to improve governance and remove trusted third parties from money issuance and e-voting. This topic is particularly relevant to understand how blockchain technologies improve governance and avoid the tyranny of the majority. In order to reach our goal, we use multi-agent simulation and statistical modelling to verify to what extent Decred is capable of providing a predictable, scarce, trustworthy digital asset. We show that Decred increased blockchain security with its hybrid proof-of-work+proof-of-stake (PoW + PoS) security mechanism, making an attack more expensive. Journal: Int. J. of Information Technology and Management Pages: 162-189 Issue: 1/2 Volume: 24 Year: 2025 Keywords: governance; blockchain; Decred; bitcoin; security; e-voting; proof-of-work; PoW; proof-of-stake; PoS; consensus; money; cryptoassets; cryptocurrencies. File-URL: http://www.inderscience.com/link.php?id=144134 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:162-189 Template-Type: ReDIF-Article 1.0 Author-Name: Sarah Bouraga Author-X-Name-First: Sarah Author-X-Name-Last: Bouraga Title: Tokenisation approaches on blockchain: state-of-the-art and classification framework Abstract: Tokens released and sold on blockchains have drawn a lot of attention. Some say it is just a fad, others argue they will radically change many industries. While the truth is probably in the middle, we believe that in order to fully grasp the potential of tokens and to advance our knowledge about the phenomenon, it is necessary to understand multiple aspects of it, such as: what are tokens, what kind of tokens are there, how are they designed, and what new advances need to be done? In this paper, we aim to provide a first step in that direction. Specifically, we propose a classification framework that will allow us to analyse the existing tokenisation approaches and whose application can point us to relevant research directions. The practical implications of this work are threefold. Firstly, it will enable interested readers to understand the fundamentals of the tokenisation process and of tokens. Next, it will help with the comparison of existing tokenisation approaches and with the decision regarding the most appropriate process for a given use case. Finally, the framework could make the design of future tokenisation approaches easier. Journal: Int. J. of Information Technology and Management Pages: 145-161 Issue: 1/2 Volume: 24 Year: 2025 Keywords: blockchain; tokenisation; fungible tokens; non-fungible tokens; NFTs; classification framework. File-URL: http://www.inderscience.com/link.php?id=144144 File-Format: text/html File-Restriction: Access to full text is restricted to subscribers. Handle: RePEc:ids:ijitma:v:24:y:2025:i:1/2:p:145-161