e Informatica Softw. Eng. J.最新文献_第3页

TCP/IP Model for Metaverse Networks and Some Potential Applications 元宇宙网络的TCP/IP模型及其潜在应用

e Informatica Softw. Eng. J. Pub Date : 2022-07-01 DOI: 10.17706/jsw.17.4.158-167

Xinyue Liang, Mengyao Chen, Weijun Zhu, Yiran Wang, Zhen Luo, Mengmeng Xu, Jian Wang

引用次数: 0

A Simulation of Covid-19 Transmission until the Steady State Using Graph Algorithm 基于图算法的稳态前Covid-19传播模拟

e Informatica Softw. Eng. J. Pub Date : 2022-05-01 DOI: 10.17706/jsw.17.3.130

Toshinari Baba

{"title":"A Simulation of Covid-19 Transmission until the Steady State Using Graph Algorithm","authors":"Toshinari Baba","doi":"10.17706/jsw.17.3.130","DOIUrl":"https://doi.org/10.17706/jsw.17.3.130","url":null,"abstract":"This research computes the average days to reach the steady state of COVID-19 infection by repeated simulation of human interactions using a bi-directed graph. It examines the effect of one infected person on a community comprising groups of people who interacts daily with each other such as school, commuter train, family, etc. Randomization is used to determine group structure and a bi-directed graph models the network of frequently interacting people. Once a person is infected, the incubation period is 5 days, and this person possibly infects other people for the next 6 days. A randomization distribution determines whether each person directly linked to an already infected person will be infected, or not. The effective reproduction number of the actual data is used in the study. Finally, this study examines how many days are required to reach the steady state where a new infected person is not observed any more. The study highlights number of days at the infections peak and how many days are required to reach the steady state. Future research would consider multiple starting points, variants, ages, genders, ethnicities, seasons, and regions. Furthermore, comparison with results of AI machine learning will be examined.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"19 1","pages":"130-136"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81842799","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}

引用次数: 0

Design and Implementation of Graduate Student Integrated Information Management System - Degree Management 研究生综合信息管理系统-学位管理的设计与实现

e Informatica Softw. Eng. J. Pub Date : 2022-05-01 DOI: 10.17706/jsw.17.3.121-129

Dong-Xu Liu, Feng Qin, Ying-Ming Wang, Xiu-Ru Li, Qiangguo Yin, Dandan Zuo, Y. Zheng

{"title":"Design and Implementation of Graduate Student Integrated Information Management System - Degree Management","authors":"Dong-Xu Liu, Feng Qin, Ying-Ming Wang, Xiu-Ru Li, Qiangguo Yin, Dandan Zuo, Y. Zheng","doi":"10.17706/jsw.17.3.121-129","DOIUrl":"https://doi.org/10.17706/jsw.17.3.121-129","url":null,"abstract":"Degree management is considered the kernel of the Degree Informationization Construction. With the continue population and development of information and technology, the government put great emphasis on college graduation student, effective and standard graduate student degree management system has been the mainstream direction of college graduation management system, as well as thenecessary means and effective ways to educate college graduation student. Firstly, this paper introduced the application status of graduate comprehensive information management system at home and abroad. Citing Anhui University of technology’s graduation student education, we have analysised and researched the reality problems and emergency situations in the process of degree management, proposing reasonable solutions. Next, basing on Anhui University of Technology graduation degree management rules and degree management requirements, we designed graduation comprehensive information management system—degeree management software. The system has been devided five subsystem: thesis proposal management subsystem, mid-term examination subsystem, degree management subsystem,scientific information subsystem and fostering plan subsystem. Lastly, this paper not only introduced the test cases of the system but also summarized the system and put forward the prospect. This system is based on B/S(Browse/Server) and used OOD(Object-Oriented Design) method. In addition, software reuse and MVC(Model + View + Hibernate) pattern has been used in the paper. The degeree management software has improved the development efficiency greatly and reduced the development cost.Users can learn and master the software by its simple interactive inference.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"1 1","pages":"121-129"},"PeriodicalIF":0.0,"publicationDate":"2022-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82903478","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}

引用次数: 1

Intimacy and Influence Based Scheduling Algorithm for Vehicle-to-Grid Network 基于亲密度和影响的车网调度算法

e Informatica Softw. Eng. J. Pub Date : 2022-03-01 DOI: 10.17706/jsw.17.2.48-57

Jianyu Hu, Jing Zhang, Hongrui Nian

{"title":"Intimacy and Influence Based Scheduling Algorithm for Vehicle-to-Grid Network","authors":"Jianyu Hu, Jing Zhang, Hongrui Nian","doi":"10.17706/jsw.17.2.48-57","DOIUrl":"https://doi.org/10.17706/jsw.17.2.48-57","url":null,"abstract":"The increasing number of Electric Vehicles (EVs) makes vehicle communication and vehicle charging linked together to form a part of the intelligent transportation system, which promotes the development of Vehicle-to-Grid (V2G) and Vehicular Ad Hoc Network (VANET). At the same time, the charging behavior of electric vehicles affects the energy distribution and storage of each charging pile. Scheduling technology plays an important role in the field of power and communication. The charging behavior is closely related to vehicle communication and will eventually affect vehicle scheduling. Therefore, analyzing the relationship between user charging and user communication is the basis of vehicle scheduling. In order to solve the problem, Intimacy and Influence based Connected Dominating Set Scheduling Algorithm (IICDSA) is proposed in this paper to adjust the charging behavior of users to realize vehicle scheduling: Firstly, V2G network model is constructed to describe the vehicle communication network, and then, Intimacy Measurement algorithm based on Relationship of Attribute (IMRA) is designed to analyze the relationship between users; secondly, Influence Walk algorithm based on the Intimacy between Users (IWIU) is designed to measure the user influence; at last, Connected Dominated Set Scheduling algorithm based on user Influence and user Location (CDSSIL) is designed to schedule users in groups. Furthermore, the simulation results show that the algorithm reduces the system scheduling cost and improves the utilization of charging pile.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"5 1","pages":"48-57"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87428844","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}

引用次数: 0

Trajectory Privacy Protection Mechanism based on Salp-Like Swarm Algorithm 基于类salp群算法的轨迹隐私保护机制

e Informatica Softw. Eng. J. Pub Date : 2022-03-01 DOI: 10.17706/jsw.17.2.71-86

Sitong Shi, Jing Zhang, Yanzi Li, Jianyu Hu

{"title":"Trajectory Privacy Protection Mechanism based on Salp-Like Swarm Algorithm","authors":"Sitong Shi, Jing Zhang, Yanzi Li, Jianyu Hu","doi":"10.17706/jsw.17.2.71-86","DOIUrl":"https://doi.org/10.17706/jsw.17.2.71-86","url":null,"abstract":"Location-based services have been widely used in daily life, providing diversified services for users. However, users may face the risk of trajectory privacy disclosure while enjoying the convenience of location-based services. Most of the existing trajectory protection schemes cannot match the road network and are vulnerable to attacks based on background information. In this paper, the concept of salp swarm algorithm is introduced to construct salp-like swarm algorithm, which can generate K−1 false trajectories that are highly similar to real trajectories. It is difficult for attackers to distinguish them. Besides, a road network matching model is designed in order to match the proposed trajectory privacy protection algorithm with the real road network environment, so that the effect of trajectory privacy protection is improved. Morever, a false location selection mechanism is proposed to find false location points, which not only considers the location and speed of users, but also ensures that the selection of false location points is more in line with the road network environment. The experimental results show that, under the condition of satisfying the same service quality, the trajectory privacy leakage probability of this scheme is reduced by 33% compared with the existing schemes, and it has better privacy protection effect.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"17 1","pages":"71-86"},"PeriodicalIF":0.0,"publicationDate":"2022-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90977497","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}

引用次数: 0

Multi-agent-based Modelling and Virtual Reality Simulation System of Major Accidents in Petrochemical Enterprise 基于多智能体的石化企业重大事故建模与虚拟现实仿真系统

e Informatica Softw. Eng. J. Pub Date : 2022-03-01 DOI: 10.17706/jsw.17.2.58-70

Wenjiang Chen, Jinxing Hu, Diping Yuan, J. Liu

引用次数: 0

Software Fault Severity Prediction Using Git History Metrics and Commits 使用Git历史指标和提交的软件故障严重性预测

e Informatica Softw. Eng. J. Pub Date : 2022-03-01 DOI: 10.17706/jsw.17.2.36-47

Herimanitra Ranaivoson, M. Badri

引用次数: 0

Automated Collection of Redirect Chains from Search Results Pages to Prize Scam Pages 自动收集重定向链从搜索结果页到奖品骗局页

e Informatica Softw. Eng. J. Pub Date : 2022-02-01 DOI: 10.17706/jsw.18.1.31-43

Mizuki Takagi, Konan Nagashima, Kazunari Mitan, Masatake Shirai, Taiichi Saito

引用次数: 0

A Research for Executable Path Automatic Generation Method Based on EFSM 基于EFSM的可执行路径自动生成方法研究

e Informatica Softw. Eng. J. Pub Date : 2022-02-01 DOI: 10.17706/jsw.18.1.15-30

Biao Wu, Q. Ge

{"title":"A Research for Executable Path Automatic Generation Method Based on EFSM","authors":"Biao Wu, Q. Ge","doi":"10.17706/jsw.18.1.15-30","DOIUrl":"https://doi.org/10.17706/jsw.18.1.15-30","url":null,"abstract":"Extended finite state machine (EFSM) is currently one of the most widely used model in the field of software testing. EFSM model is an enhanced model based on finite state machine (FSM). Automated test data generation is still a challenging problem due to the complexity of EFSM which extends the input and output parameters, context variables as well as the predicate condition. These reasons lead to conflict of the context variable with the enable conditions in the transition path. In order to avoid infeasible path generation, this paper proposes a method based on modified breadth first search to generate feasible transition path (MBFS-FTP). To solve the problem of state explosion in path generation, this paper converts state diagram to transition diagram on EFSM model. In order to make the EFSM static model can be driven execution, this paper uses UML model and generate executable model, so that implements EFSM execute dynamically. When using breadth-first search algorithm (MBFS) on every target transition to generate an executable transition path, the conflict detection algorithm is utilized to the transition path for conflict decision, avoiding the occurrence of an infeasible transition path. Considering target transition has multiple feasible transition paths, this paper combines suggested penalized value of definition-predicate-use (def-p-use) pair and length of feasible transition path, and then develops the measurement method of feasible transition path, and obtained a set of feasible transition path containing all of transitions. Through the experiment on two actual EFSM model, verifying the effectiveness of MBFS-FTP for feasible transition automatic generation, the experimental results show that MBFS-FTP can reduce the feasible transition path length, and make transition paths are more easily to be triggered at the times of generating test cases lately, furthermore, it can improve the efficiency of generate feasible transition path and save a lot of time.","PeriodicalId":11452,"journal":{"name":"e Informatica Softw. Eng. J.","volume":"45 1","pages":"15-30"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73525218","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}

引用次数: 0

Fundamental Algorithms in Distributed Systems 分布式系统中的基本算法

e Informatica Softw. Eng. J. Pub Date : 2022-02-01 DOI: 10.17706/jsw.18.1.44-54

Zhiliang Wan

引用次数: 0