{"title":"BPDST: Blockchain-Based Privacy-Preserving Data Sharing on Thin Client for Electronic Medical Records","authors":"Lu Xu, Mengchen Lin, Yong Feng, Yani Sun","doi":"10.20532/cit.2021.1005412","DOIUrl":"https://doi.org/10.20532/cit.2021.1005412","url":null,"abstract":"Sharing medical data can improve the quality of medical services and reduce costs. However, the current Electronic Medical Records (EMRs) are scattered and easily tampered with, which is not conducive to the sharing of EMRs and is not compatible with thin clients. Fortunately, blockchain technology is tamper-proof, decentralized, auditable, and meets the above requirements. To solve these problems, we first propose Blockchain-Based Privacy-Preserving Data Sharing on Thin-Client for Electronic Medical Records (BPDST) approach that combines the k-anonymity and cloud storage, which thin clients can run like a full-node user and safeguard user's EMRs privacy concurrently. Using this approach, patients can control their own EMRs, while the consortium blockchain is responsible for the transaction process and sending the correct results to the patients. BPDST can also share information without leaking or tampering with EMRs' privacy, achieving the purpose of sharing medical data and privacy protection. In the medical field, this study can effectively protect users' privacy when sharing medical data to provide convenience for users and break the \"island\" phenomenon among various medical institutions. Security analysis and extensive experiments show that BPDST is secure and practical for sharing EMRs.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"86 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124134909","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Yousef A. Yousef, Abdelrafe Elzamly, Mohamed Doheir, N. M. Yaacob
{"title":"Assessing Soft Skills for Software Requirements Engineering Processes","authors":"Yousef A. Yousef, Abdelrafe Elzamly, Mohamed Doheir, N. M. Yaacob","doi":"10.20532/cit.2021.1005397","DOIUrl":"https://doi.org/10.20532/cit.2021.1005397","url":null,"abstract":"Software requirement engineering (SRE) is the process of establishing, documenting, and maintaining software requirements. The goal of this research is to investigate the importance of soft skills in SRE. The data collection was performed through an online questionnaire. Descriptive statistics, principal components analysis (PCA), and stepwise regression techniques were used to analyze the data. A comprehensive review determined the 31 soft skills associated with SRE. There were 122 software development experts in Gaza who participated in the survey. The PCA analysis extracted six factors, named problem-solving, learning willingness, commitment, pressure resilience, critical thinking, and interpersonal skills. The analysis discovered that the level of SRE practice in Gaza is 73.71%. Furthermore, it was determined that 89.2% of respondents have critical thinking skills, and 85% have problem-solving and commitment skills. The result shows that all soft skills factors have strong links to SRE. However, only four soft skills (problem-solving, willingness to learn, pressure tolerance, and critical thinking) were found to have an impact on SRE. Considering these findings, we recommend focusing on the development of soft skills, especially problem-solving\u0000and willingness to learn skills, for the team analyzing software system requirements.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131330439","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Cloud-based Mobile Privacy Protection System with Efficient Cache Mechanism","authors":"Wenyun Dai, Longbin Chen","doi":"10.20532/cit.2021.1005295","DOIUrl":"https://doi.org/10.20532/cit.2021.1005295","url":null,"abstract":"People increasingly rely on their mobile devices and use them to store a lot of data. Some of the data are personal and private, whose leakage leads to users' privacy harm. Meanwhile, mobile apps and services over-collect users' data due to the coarse-grained access control approach utilized by the mobile operating system. We propose a cloud-based approach to provide fine-grained access control toward data requests. We add privacy level, as a new metadata, to data and manage the storage using different policies correspondingly. However, the proposed approach leads to performance decreases because of the extra communication cost. We also introduce a novel cache mechanism to eliminate the extra cost by storing non-private and popular data on the mobile device. As part of our cache mechanism, we design a user-preference-based ordering method along with the principle of locality to determine how popular some data are. We also design a configurable refresh policy to improve the overall performance. Finally, we evaluate our approach using a real phone in a simulated environment. The results show that our approach can keep the response time of all data requests within a reasonable range and the cache mechanism can further improve the performance.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126678106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of Data Visualization and Big Data Analysis in Intelligent Agriculture","authors":"Wei Liu","doi":"10.20532/cit.2021.1005390","DOIUrl":"https://doi.org/10.20532/cit.2021.1005390","url":null,"abstract":"Intelligent agriculture can renovate agricultural production and management, making agricultural production truly scientific and efficient. The existing data mining technology for agricultural information is powerful and professional. But the technology is not well adapted for intelligent agriculture. Therefore, this paper introduces data visualization and big data analysis into the application scenarios of intelligent agriculture. Firstly, an intelligent agriculture data visualization system was established, and the RadViz data visualization method was detailed for intelligent agriculture. Moreover, the intelligent agriculture data were processed using dimensionality reduction through principal component analysis (PCA) and further optimized through k-means clustering (KMC). Finally, the crop yield was predicted using the multiple regression algorithm and the residual principal component regression algorithm. The crop yield prediction model was proved effective through experiments.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122859591","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Application of Big Data Analysis to Agricultural Production, Agricultural Product Marketing, and Influencing Factors in Intelligent Agriculture","authors":"Jianfeng Cheng","doi":"10.20532/cit.2021.1005404","DOIUrl":"https://doi.org/10.20532/cit.2021.1005404","url":null,"abstract":"Agricultural Internet of things (AIoT) promotes the modernization of traditional agricultural production and marketing model. However, the existing time series prediction methods for agricultural production and agricultural product (AP) marketing cannot adapt well to most real-world scenarios, failing to realize multistep forecast of production and AP marketing data. To solve the problem, this paper explores the big data analysis of agricultural production, AP marketing, and influencing factors in intelligent agriculture. To realize long-, and short-term predictions, a small-sample time series model was set up for AIoT production, and a big-sample time series model was constructed for AP marketing. The data fusion algorithm based on Kalman filter (KF) was adopted to fuse the massive multi-source AP marketing data. The proposed strategy was proved valid through experiments.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117024904","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hakim Azri, H. Belbachir, Fatiha Guerroudji Meddah
{"title":"Identifying Spam Activity on Public Facebook Pages","authors":"Hakim Azri, H. Belbachir, Fatiha Guerroudji Meddah","doi":"10.20532/cit.2021.1005221","DOIUrl":"https://doi.org/10.20532/cit.2021.1005221","url":null,"abstract":"Since their emergence, online social networks (OSNs) keep gaining popularity. However, many related problems have also arisen, such as the use of fake accounts for malicious activities. In this paper, we focus on identifying spammers among users that are active on public Facebook pages. We are specifically interested in identifying groups of spammers sharing similar URLs. For this purpose, we built an initial dataset based on all the content that has been posted upon feed posts on a set of public Facebook pages with high numbers of subscribers. We assumed that such public pages, with hundreds of thousands of subscribers and revolving around a common attractive topic, make an ideal ground for spamming activity. Our first contribution in this paper is a reliable methodology that helps in identifying potential spammer and non-spammer accounts that are likely to be tagged as, respectively, spammers/non-spammers upon manual verification. For that aim, we used a set of features characterizing spam activity with a coring method. This methodology, combined with manual human validation, successfully allowed us to build a dataset of spammers and non-spammers. Our second contribution is the analysis of the identified spammer accounts. We found that these accounts do not display any community-like behavior as they rarely interact with each other, and are slightly more active than non-spammers during late-night hours, while slightly less active during daytime hours. Finally, our third contribution is the proposal of a clustering approach that successfully detected 16 groups of spammers in the form of clusters of spam accounts sharing similar URLs.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"254 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114445860","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Analysis of Key Factors Influencing Smart Court Development Based on Decision Making Trial and Evaluation Laboratory","authors":"Jing Min","doi":"10.20532/cit.2021.1005396","DOIUrl":"https://doi.org/10.20532/cit.2021.1005396","url":null,"abstract":"This paper analyzes the state of the art in the development of smart courts in China since 2016 and explores the factors affecting the development of smart courts in China based on DEcision MAking Trial and Evaluation Laboratory (DEMATEL) and Interpretive Structural Modeling (ISM) models. The direct influence relationships between the factors were determined by data extracted from a questionnaire survey. Based on the resulting composite influence matrix, it was deduced that the factors that influence smart court development involve three groups: intrinsic factors, including pre-planning, promotion, network service, and the five main functional systems; transitional factors, including data collection, operation and maintenance, update; and proximate factors, including investment intention, equipment, and monitoring system. Drawing on the conclusion, this paper argues that the development of data collection, equipment, and monitoring system should be the priority in the smart court development, and a benign circulation will be achieved when the five main systems of smart courts are well-established as they can attract talents, investment, and other important factors.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123310587","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Business Cost Modelling of Information Processing in Supply Chain Units","authors":"R. Bucki, P. Suchánek","doi":"10.20532/cit.2021.1005418","DOIUrl":"https://doi.org/10.20532/cit.2021.1005418","url":null,"abstract":"The paper analyzes and successively assesses the problem of information delays in a sample logistics system, in which customer inquiries are sent to adjacent or dedicated units in the logistics chain. Within such a framework time and unit costs of customer service and inquiry are analyzed. A detailed model of the logistics system is thus elaborated using a mathematical approach and its graphical representation. The accompanying case study includes the analysis of the detailed situation in which two models are compared that do not differ in the structure of logistic units but are characterized by different information flow paths. Simulation results are presented through a thorough graphic, numerical and descriptive analysis. Finally, the problem of information transmission in the logistics system is summarized.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131338017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Event-triggered Observer-based Robust H∞ Fault-tolerant Control for Markov Jumping NCSs","authors":"Xingjian Fu, Xinyao Geng","doi":"10.20532/cit.2021.1005111","DOIUrl":"https://doi.org/10.20532/cit.2021.1005111","url":null,"abstract":"For network control systems (NCSs) with parameter uncertainties, packet loss and time-delays, the design for the observer and robust H∞ fault-tolerant controller is discussed with the event-triggered mechanism. The random Markov jumping system is used to describe the NCSs with faults. In order to reduce the frequency of data transmission and save network channel resources, the discrete event-triggered mechanism is utilized, which allows the NCS to transmit the signal when the trigger condition is met only. Under this mechanism the system states are estimated by the observer provided, while a robust fault-tolerant controller is designed for actuator failures, so that the NCSs can remain stable in the event of failures. Finally, the proposed method is verified by simulation, the respective results showing its validity and feasibility.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124392925","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Natural Language Processing Using Neighbour Entropy-based Segmentation","authors":"Jianfeng Qiao, Xingzhi Yan, Shuran Lv","doi":"10.20532/cit.2021.1005393","DOIUrl":"https://doi.org/10.20532/cit.2021.1005393","url":null,"abstract":"In natural language processing (NLP) of Chinese hazard text collected in the process of hazard identification, Chinese word segmentation (CWS) is the first step to extracting meaningful information from such semi-structured Chinese texts. This paper proposes a new neighbor entropy-based segmentation (NES) model for CWS. The model considers the segmentation benefits of neighbor entropies, adopting the concept of \"neighbor\" in optimization research. It is defined by the benefit ratio of text segmentation, including benefits and losses of combining the segmentation unit with more information than other popular statistical models. In the experiments performed, together with the maximum-based segmentation algorithm, the NES model achieves a 99.3% precision, 98.7% recall, and 99.0% f-measure for text segmentation; these performances are higher than those of existing tools based on other seven popular statistical models. Results show that the NES model is a valid CWS, especially for text segmentation requirements necessitating longer-sized characters. The text corpus used comes from the Beijing Municipal Administration of Work Safety, which was recorded in the fourth quarter of 2018.","PeriodicalId":445452,"journal":{"name":"J. Comput. Inf. Technol.","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114245269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}