• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.4
• /
• pp.145-152
• /
• 2018

In electronic textbooks (or e-Textbooks) the traditional paper-based textbooks are enriched with multimedia contents and new features such as interactive multimedia-based simulation, interactive quizzes, and content sharing. It has been envisioned that e-Textbooks will gradually replace the traditional paper-based textbooks in classrooms in the near future. HTML5 is an emerging and promising standard that enables web applications (or apps) to incorporate rich multimedia contents such as video clips, flash movies and simulation-based demonstration, as well as to provide cross-platform functionality which allows the apps to run on a diverse range of platforms. To support rich multimedia contents and cross-platform functionality, with respect to HTML5, this paper presents the new features, compares the current trend of mobile apps (e.g., native, web-based and hybrid apps) for e-Textbook development. In order to investigate the suitability of these three development approaches for e-Textbooks, we present a case study on our recent work in developing e-Textbooks using HTML5 and JavaScript, as well as analyses the challenges associated with HTML5 features (e.g, compatibility with web browsers) for developing e-Textbooks.

• KIPS Transactions on Software and Data Engineering
• /
• v.7 no.4
• /
• pp.129-134
• /
• 2018

Recently, the artificial neural network (ANN) model is a promising technique in the prediction, numerical control, robot control and pattern recognition. We predicted the outside temperature of greenhouse using ANN and utilized the model in greenhouse control. The performance of ANN model was evaluated and compared with multiple regression model(MRM) and support vector machine (SVM) model. The 10-fold cross validation was used as the evaluation method. In order to improve the prediction performance, the data reduction was performed by correlation analysis and new factor were extracted from measured data to improve the reliability of training data. The backpropagation algorithm was used for constructing ANN, multiple regression model was constructed by M5 method. And SVM model was constructed by epsilon-SVM method. As the result showed that the RMSE (Root Mean Squared Error) value of ANN, MRM and SVM were 0.9256, 1.8503 and 7.5521 respectively. In addition, by applying the prediction model to greenhouse heating load calculation, it can increase the income by reducing the energy cost in the greenhouse. The heating load of the experimented greenhouse was 3326.4kcal/h and the fuel consumption was estimated to be 453.8L as the total heating time is $10000^{\circ}C/h$. Therefore, data mining technology of ANN can be applied to various agricultural fields such as precise greenhouse control, cultivation techniques, and harvest prediction, thereby contributing to the development of smart agriculture.

• KIPS Transactions on Software and Data Engineering
• /
• v.6 no.1
• /
• pp.15-22
• /
• 2017

With the advance of Internet Technology, various social network services are created and used by users. Especially, the use of smart devices makes that multimedia contents can be used and distributed on social network services. However, since the crime rate also is increased by users with illegal purposes, there are needs to protect contents and block illegal usage of contents with multimedia forensics. In this paper, we propose a multimedia forensic technique which is identifying the video source. First, the scheme to acquire the sensor pattern noise (SPN) using morphology filtering is presented, which comes from the imperfection of photon detector. Using this scheme, the SPN of reference videos from the reference device is estimated and the SPN of an unknown video is estimated. Then, the similarity between two SPNs is measured to identify whether the unknown video is acquired using the reference device. For the performance analysis of the proposed technique, 30 devices including DSLR camera, compact camera, camcorder, action cam and smart phone are tested and quantitatively analyzed. Based on the results, the proposed technique can achieve the 96% accuracy in identification.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.219-226
• /
• 2018

One of the systematic ways to generate the number of all cases is a combination to construct a combination tree, and its time complexity is O($2^n$). A combination tree is used for various purposes such as the graph homogeneity problem, the initial model for calculating frequent item sets, and so on. However, algorithms that must search the number of all cases of a combination are difficult to use realistically due to high time complexity. Nevertheless, as the amount of data becomes large and various studies are being carried out to utilize the data, the number of cases of searching all cases is increasing. Recently, as the GPU environment becomes popular and can be easily accessed, various attempts have been made to reduce time by parallelizing algorithms having high time complexity in a serial environment. Because the method of generating the number of all cases in combination is sequential and the size of sub-task is biased, it is not suitable for parallel implementation. The efficiency of parallel algorithms can be maximized when all threads have tasks with similar size. In this paper, we propose a method to efficiently collaborate between CPU and GPU to parallelize the problem of finding the number of all cases. In order to evaluate the performance of the proposed algorithm, we analyze the time complexity in the theoretical aspect, and compare the experimental time of the proposed algorithm with other algorithms in CPU and GPU environment. Experimental results show that the proposed CPU and GPU collaboration algorithm maintains a balance between the execution time of the CPU and GPU compared to the previous algorithms, and the execution time is improved remarkable as the number of elements increases.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.3
• /
• pp.45-58
• /
• 2020

In the current trend of increasing network traffic due to the popularization of cloud service and mobile devices, WAN bandwidth is very low compared to LAN bandwidth. In a WAN environment, a WAN optimizer is needed to overcome performance problems caused by transmission protocol, packet loss, and network bandwidth limitations. In this paper, we analyze the data deduplication algorithm of WANProxy, an open source WAN optimizer, and evaluate its performance in terms of network latency and WAN bandwidth. Also, we evaluate the performance of the two-stage compression method of WANProxy and Zstandard. We propose a new method to improve the performance of WANProxy by revising its data deduplication algorithm and evaluate its performance improvement. We perform experiments using 12 data files of Silesia with a data segment size of 2048 bytes. Experimental results show that the average compression rate by WANProxy is 150.6, and the average network latency reduction rates by WANProxy are 95.2% for a 10 Mbps WAN environment and 60.7% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, the two-stage compression of WANProxy and Zstandard increases the average compression rate by 33%. However, it increases the average network latency by 2.1% for a 10 Mbps WAN environment and 5.27% for a 100 Mbps WAN environment, respectively. Compared with WANProxy, our proposed method increases the average compression rate by 34.8% and reduces the average network latency by 13.8% for a 10 Mbps WAN and 12.9% for a 100 Mbps WAN, respectively. Performance analysis results of WANProxy show that its performance improvement in terms of network latency and WAN bandwidth is excellent in a 10Mbps or less WAN environment while superior in a 100 Mbps WAN environment.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.127-136
• /
• 2005

This paper measured a proper ratio of the size of demand fetch cache $L_1$ to that of prefetch cache $L_P$ by imulation when the size of $L_1$ and $L_P$ are constant which organize space-limited level 1 cache of a single microprocessor chip. The analysis of our experiment showed that in the condition of the sum of the size of $L_1$ and $L_P$ are 16 KB, the level 1 cache organization by constituting $L_P$ with 4 KB and employing OBL and FIFO as a prefetch technique and a cache replacement policy respectively resulted in the best performance. Also, this analysis showed that in the condition of the sum of the size of $L_1$ and $L_P$ are over 32 KB, employing dynamic filtering as prefetch technique of $L_P$ are more advantageous and splitting level 1 cache by constituting $L_1$ with 28 KB and $L_P$ with 4 KB in the case of 32 KB of space are available, by constituting $L_1$ with 48 KB and $L_P$ with 16 KB in the case of 64 KB elicited the best performance.

• The KIPS Transactions:PartC
• /
• v.12C no.3 s.99
• /
• pp.457-464
• /
• 2005

This paper describes an Adaptive Context-aware Service (ACS) using Model Driven Architecture (MDA)-based Service Creation Environment (SCE) on PARLAY X based service delivery platform in ubiquitous computing environments. It can be expected that both the context-awareness and adaptation in ubiquitous computing environments will be deployed. But the existing context-aware middleware lacks in considering adaptation. Therefore, the object of this paper is to support the architecture and the Application Programming Interface (API) of the network service for both the context-awareness and adaptation in ubiquitous computing environment. ACS is to provide users with the adaptive network service to the changing context constraints as well as detecting the changing context. For instance, ACS can provide users with QoS in network according to the detected context, after detecting the context such as location and speed. The architecture of ACS is comprised of a Service Creation Environment (SCE), Adaptive Context Broker and PARLAY gateway. SCE is to use Context-based Constraint Language (CCL) for an expression of context-awareness and adaptation. Adaptive Context Broker is to make a role of the broker between SCE and PARLAY G/W. PARLAY G/W is to support API for PARLAY X-based service delivery platform.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.523-530
• /
• 2005

When a PCI 2.2 bus master requests data using Memory Read command, a target device may hold PCI bus without data to be transferred for long time because a target device needs time to prepare data infernally. Because the usage efficiency of the PCI bus and the data transfer efficiency are decreased due to this situation, the PCI specification recommends to use the Delayed Transaction mechanism to improve the system performance. But the mechanism cann't fully improve performance because a target device doesn't know the exact size of prefetched data. In the previous work, we propose a new method called Prefetch Request when a bus master intends to read data from the target device. In this paper, we design PCI 2.2 controller and local device that support the proposed method. The designed PCI 2.2 controller has simple local interface and it is used to convert the PCI protocol into the local protocol. So the typical users, who don't know the PCI protocol, can easily design the PCI target device using the proposed PCI controller. We propose the basic behavioral verification, hardware design verification, and random test verification to verify the designed hardware. We also build the test bench and define assembler instructions. And we propose random testing environment, which consist of reference model, random generator ,and compare engine, to efficiently verify corner case. This verification environment is excellent to find error which is not detected by general test vector. Also, the simulation under the proposed test environment shows that the proposed method has the higher data transfer efficiency than the Delayed Transaction about $9\%$.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.515-522
• /
• 2005

This paper presents a method for effectively modeling inlay/onlay prostheses restoring a tooth that are partially destroyed. An inlay/onlay is composed of internal surface adhering to an abutment, and external surface revealed to the outside sight. Internal surfaces are modeled using Minkowski sum expanding the grinded surface parts of abutments so that the internal surfaces can adhere to the abutments with closer contact. In modeling external surfaces, we exploit 3D mesh deformation techniques: DMFFD(direct manipulation free-form deformation)[19] and MWD(multiple wires deformation)[17] with three kinds of informations: standard teeth models, mesh data obtained by scanning a plaster cast of a patient's tooth, FGP(functionally guided plane) measuring the occlusion of the patients's teeth. The standard teeth models are used for building up the basic shapes of external surfaces, while the plaster fast and FGP data are used for reflecting the unique properties of adjacent md occlusal surfaces of the patients's teeth, which are slightly different to each other but very important for correct functioning. With these informations as input data, the adjacent and occlusal surfaces are automatically generated as mesh data using the techniques of DMFFD and m, respectively. Our method was implemented so that inlay/onlay prostheses fan be designed more accurately by visualizing the generated mesh models with requirements by dentists.

• The KIPS Transactions:PartA
• /
• v.12A no.6 s.96
• /
• pp.557-562
• /
• 2005

Throughput and latency of interconnection network are important factors of the performance of multiprocessor systems. The dual-link CC-NUMA architecture using point-to-point unidirectional link is one of the popular structures in high-end commercial systems. In terms of optimal path between nodes, several paths exist with the optimal hop count by its native multi-path structure. Furthermore, transaction latency between nodes is affected by congestion of links on the transaction path. Hence the transaction latency may get worse if the transactions make a hot spot on some links. In this paper, I propose a dynamic transaction routing algorithm that maintains the balanced link utilization with the optimal path length, and I compare the performance with the fixed path method on the dual-link CC-NUMA systems. By the proposed method, the link competition is alleviated by the real-time path selection, and consequently, dynamic transaction algorithm shows a better performance. The program-driven simulation results show $1{\~}10\%$ improved fluctuation of link utilization, $1{\~}3\%$ enhanced acquirement of link, and $1{\~}6\%$ improved system performance.