KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS (TIIS) 是被 SCIE (THOMSON REUTERS) 和 SCOPUS (ELSEVIER) 检索的在线学术期刊，由 KSII 出版并得到 KETI 的支持。交易每隔一个月发布一次。交易旨在让读者在与有线和无线互联网和信息系统相关的多个重点领域获得最先进的技术。 IT 的技术和应用正在迅速变化和更新。因此，向研究人员、开发人员、部署工程师、技术经理和教育工作者快速发布和分发至关重要。我们最重要的目标是在收到稿件后迅速发表被录用的论文。

KSII Transactions on Internet and Information Systems (TIIS) is an online academic journal published by KSII and supported by KETI, indexed by SCIE (THOMSON REUTERS) and SCOPUS (ELSEVIER). The journal is published bi-monthly and aims to provide readers with cutting-edge technologies related to wired and wireless internet and information systems. The technologies and applications in IT are rapidly evolving, making it essential to quickly publish and disseminate research findings for researchers, developers, deployment engineers, technical managers, and educators. Our primary goal is to swiftly publish accepted papers upon receipt of submissions.

KSII Transactions on Internet and Information Systems (TIIS) 是一本由 KSII 出版并得到 KETI 支持的在线学术期刊，已被 SCIE (THOMSON REUTERS) 和 SCOPUS (ELSEVIER) 检索。该期刊每隔一个月发布一次，旨在为读者提供与有线和无线互联网及信息系统相关的前沿技术。信息技术的技术和应用正在迅速变化，因此，快速发布和传播研究成果对研究人员、开发人员、部署工程师、技术经理和教育工作者至关重要。我们的主要目标是在收到稿件后迅速发表被录用的论文。

KSII Transactions on Internet and Information Systems

Edge computing is frequently employed in the Internet of Vehicles, although the computation and communication capabilities of roadside units with edge servers are limited.As a result, to perform distributed machine learning on resource-limited MEC systems, resources have to be allocated sensibly.This paper presents an Improved MADDPG algorithm to overcome the current IoV concerns of high delay and limited offloading utility.Firstly, we employ the MADDPG algorithm for task offloading.Secondly, the edge server aggregates the updated model and modifies the aggregation model parameters to achieve optimal policy learning.Finally, the new approach is contrasted with current reinforcement learning techniques.The simulation results show that compared with MADDPG and MAA2C algorithms, our algorithm improves offloading utility by 2% and 9%, and reduces delay by 29.6%.

Ziyang Jin

Yijun Wang

Jingying Lv

Edge Computing Task Offloading of Internet of Vehicles Based on Improved MADDPG Algorithm

Since time series clustering is performed without prior information, it is used for exploratory data analysis.In particular, clusters of time series with similar shapes can be used in various fields, such as business, medicine, finance, and communications.However, existing time series clustering algorithms have a problem in that time series with different shapes are included in the clusters.The reason for such a problem is that the existing algorithms do not consider the limitations on the size of the generated clusters, and use a dimension reduction method in which the information loss is large.In this paper, we propose a method to alleviate the disadvantages of existing methods and to find a better quality of cluster containing similarly shaped time series.In the data preprocessing step, we normalize the time series using z-transformation.Then, we use piecewise aggregate approximation (PAA) to reduce the dimension of the time series.In the clustering step, we use density-based spatial clustering of applications with noise (DBSCAN) to create a precluster.We then use a modified K-means algorithm to refine the preclusters containing differently shaped time series into subclusters containing only similarly shaped time series.In our experiments, our method showed better results than the existing method.

Jungyu Ahn

Ju-Hong Lee

Clustering Algorithm for Time Series with Similar Shapes

具有相似形状的时间序列聚类算法

This paper presents a new method for improving teaching aids with the design and development of a chemistry education platform -the Mixed Reality (MR) Chemistry Lab.Our system provides a new educational experience in which students can simulate a chemistry experiment in a virtual lab and interact with objects using Oculus Helmet-Mounted Displays (HMD) and hand controller devices.The proposed system aims to familiarize students with experimental procedures and safety knowledge before conducting actual experiments.Moreover, students will be able to observe microscopic atomic structure models in three dimensions.Our research also includes a five-part, quantitative evaluation system user tests perform using a quantitative questionnaire consisting of five items, including hardware equipment, immersion, education, interaction sense of control, and degree of difficulty.The evaluation results confirm that this system will be helpful to the educational experience of conducting chemistry experiments with scientific evaluation methods, and the proposed system is also expected to have a broad range of applications in many other subjects.

Xiaoyun Duan

Shin-Jin Kang

Jong Choi

Soo Kim

Mixed Reality System for Virtual Chemistry Lab

虚拟化学实验室的混合现实系统

The ever-increasing demand for H.264 scalable video coding (H.264/SVC) distribution motivates researchers to devise ways to enhance the quality of video delivered on the Internet.Furthermore, researchers and practitioners in general depend on computer simulators to analyze or evaluate their designed network architecture or proposed protocols.Therefore, a complete toolset, which is called myEvalSVC, for evaluating the delivered quality of H.264/SVC transmissions in a simulated environment is proposed to help the network and video coding research communities.The toolset is based on the H.264 Scalable Video coding streaming Evaluation Framework (SVEF) and extended to connect to the NS2 simulator.With this combination, people who work on video coding can simulate the effects of a more realistic network on video sequences resulting from their coding schemes, while people who work on network technology can evaluate the impact of real video streams on the proposed network architecture or protocols.To demonstrate the usefulness of the proposed new toolset, examples of H.264/SVC transmissions over 802.11 and 802.11e are provided.

Chih-Heng Ke

myEvalSVC: an Integrated Simulation Framework for Evaluation of H.264/SVC Transmission

myEvalSVC：一种用于H.264/SVC传输评估的综合仿真框架

The MobileNetV3 is specially designed for mobile devices with limited memory and computing power.To reduce the network parameters and improve the network inference speed, a new lightweight network is proposed based on MobileNetV3.Firstly, to reduce the computation of residual blocks, a partial residual structure is designed by dividing the input feature maps into two parts.The designed partial residual structure is used to replace the residual block in MobileNetV3.Secondly, a dual-path feature extraction structure is designed to further reduce the computation of MobileNetV3.Different convolution kernel sizes are used in the two paths to extract feature maps with different sizes.Besides, a transition layer is also designed for fusing features to reduce the influence of the new structure on accuracy.The CIFAR-100 dataset and Image Net dataset are used to test the performance of the proposed partial residual structure.The ResNet based on the proposed partial residual structure has smaller parameters and FLOPs than the original ResNet.The performance of improved MobileNetV3 is tested on CIFAR-10, CIFAR-100 and ImageNet image classification task dataset.Comparing MobileNetV3, GhostNet and MobileNetV2, the improved MobileNetV3 has smaller parameters and FLOPs.Besides, the improved MobileNetV3 is also tested on CPU and Raspberry Pi.It is faster than other networks

Liquan Zhao

Leilei Wang

KSII TIIS

A new lightweight network based on MobileNetV3

基于MobileNetV3的新型轻量级网络

An Efficient mmWave MIMO Transmission with Hybrid Precoding

高效毫米波MIMO混合预编码传输

The soft cancellation list (SCANL) decoding algorithm for polar codes runs L soft cancellation (SCAN) decoders with different decoding factor graphs.Although it can achieve better decoding performance than SCAN algorithm, it has high latency.In this paper, a fast simplified SCANL (Fast-SSCANL) algorithm that runs L independent Fast-SSCAN decoders is proposed.In Fast-SSCANL decoder, special nodes in each factor graph is identified, and corresponding low-latency decoding approaches for each special node is propose first.Then, syndrome check aided Fast-SSCANL (SC-Fast-SSCANL) algorithm is further put forward.The ordinary nodes satisfied the syndrome check will execute hard decision directly without traversing the factor graph, thereby reducing the decoding latency further.Simulation results show that Fast-SSCANL and SC-Fast-SSCANL algorithms can achieve the same BER performance as the SCANL algorithm with lower latency.Fast-SSCANL algorithm can reduce latency by more than 83% compared with SCANL, and SC-Fast-SSCANL algorithm can reduce more than 85% latency compared with SCANL regardless of code length and code rate.

Choangyang Liu

Wenjie Dai

Rui Guo

Syndrome Check aided Fast-SSCANL Decoding Algorithm for Polar Codes

极性码快速SSCANL译码算法的症候检查辅助方法

Underwater Wireless Sensors Networks (UWSNs) are deployed in remotely monitored environment such as water level monitoring, ocean current identification, oil detection, habitat monitoring and numerous military applications.Providing scalable and efficient routing is very challenging in UWSNs due to the harsh underwater environment.The biggest difficulties are the nodes inherent movement due to water current, long delay in data transmission, low bandwidth of the acoustic signal, high error rate and energy scarcity in battery powered nodes.Many routing protocols have been proposed to solve the aforementioned problems.There are three broad categories of routing protocols namely depth based, energy based and vector-based routing.Vector Based Forwarding protocols perform routing through virtual pipeline by defining their radius which give proper direction to packets communication.We proposed a routing protocol termed as Path-Oriented Energy Scaled Expanded Vector Based Forwarding (PESEVBF).PESEVBF takes into account all parameters; holding time, the source nodes packets routing path and void holes creation on the second hop; PESEVBF not only considers the packet upward advancement but also focus on density of the forwarded nodes in terms of number of potential forwarding and suppressed nodes for path selection.Node selection in resultant holding time is based on minimum Path Factor (PF) value.Moreover, the suppressed node will be selected for packet forwarding to avoid the void holes occurrences on the second hop.Performance of PESEVBF is compared with other routing protocols using matrices such as energy consumption, packet delivery ratio, packets dropping ratio and duplicate packets creation indicating considerable performance improvement.

Rooh Ullah

Beenish Akram

Amna Zafar

Atif Saeed

Sultan Almotiri

Mohammed Al Ghamdi

Ayesha Beenish

An Efficient Routing Scheme Based on Node Density for Underwater Acoustic Sensors Networks

基于节点密度的水下声传感器网络高效路由方案

Previous studies on joint optimization of computation offloading and service caching policies in Mobile Edge Computing (MEC) have often neglected the impact of dependency-aware subtasks, edge server resource constraints, and multiple users on policy formulation.To remedy this deficiency, this paper proposes a many-objective joint optimization dependencyaware task offloading and service caching model (MaJDTOSC).MaJDTOSC considers the impact of dependencies between subtasks on the joint optimization problem of task offloading and service caching in multi-user, resource-constrained MEC scenarios, and takes the task completion time, energy consumption, subtask hit rate, load variability, and storage resource utilization as optimization objectives.Meanwhile, in order to better solve MaJDTOSC, a many-objective evolutionary algorithm TSMSNSGAIII based on a three-stage mating selection strategy is proposed.Simulation results show that TSMSNSGAIII exhibits an excellent and stable performance in solving MaJDTOSC with different number of users setting and can converge faster.Therefore, it is believed that TSMSNSGAIII can provide appropriate sub-task offloading and service caching strategies in multi-user and resource-constrained MEC scenarios, which can greatly improve the system offloading efficiency and enhance the user experience.

Xiangyu Shi

Zhixia Zhang

Zhihua Cui

Xingjuan Cai

Many-objective joint optimization for dependency-aware task offloading and service caching in mobile edge computing

多目标联合优化在移动边缘计算中的依赖感知任务卸载与服务缓存

Humidity is an important parameter in meteorology and is closely related to weather, human health, and the environment.Due to the limitations of the number of observation stations and other factors, humidity data are often not as good as expected, so high-resolution humidity fields are of great interest and have been the object of desire in the research field and industry.This study presents a novel super-resolution algorithm for humidity fields based on the Wasserstein generative adversarial network(WGAN) framework, with the objective of enhancing the resolution of low-resolution humidity field information.WGAN is a more stable generative adversarial networks(GANs) with Wasserstein metric, and to make the training more stable and simple, the gradient cropping is replaced with gradient penalty, and the network feature representation is improved by sub-pixel convolution, residual block combined with convolutional block attention module(CBAM) and other techniques.We evaluate the proposed algorithm using ERA5 relative humidity data with an hourly resolution of 0.25°×0.25°.Experimental results demonstrate that our approach outperforms not only conventional interpolation techniques, but also the super-resolution generative adversarial network(SRGAN) algorithm.

Tao Li

Liang Wang

Lina Wang

Rui Han

Super-Resolution Reconstruction of Humidity Fields based on Wasserstein Generative Adversarial Network with Gradient Penalty

基于带梯度惩罚的Wasserstein生成对抗网络的湿度场超分辨率重建

Abbreviation	KSII TIIS
Journal Impact	1.20
Quartiles(Global)	TELECOMMUNICATIONS(Q4)

ISSN	1976-7277, 2288-1468
h-index	38

Publication Information	Publisher: Korea Society of Internet Information，Publishing cycle: Bimonthly，Journal Type: journal，Open Access Journals: No
Basic data	Year of publication: 2007，Proportion of original research papers: 98.50%，Self Citation Rate:8.30%， Gold OA Rate: 95.18%
Average review cycle	网友分享经验：平均4.3个月
Average recruitment ratio	网友分享经验：容易

KSII Transactions on Internet and Information Systems

Journal Citation Format

A journal article with 1 author

A journal article with 2 authors

A journal article with 3 authors

A journal article with 5 or more authors

Books Citation Format

Thesis Citation Format

Web sites Citation Format

Patent Citation Format

Staying up late manually editing references? ivySCI automatically matches journals and helps you generate references with a single click.

Share Submission Experience