• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1067-1076
• /
• 2003

Database sharing system (DSS) refers to a system for high performance transaction processing. In DSS, the processing nodes are locally coupled via a high speed network and share a common database at the disk level. Each node has a local memory and a separate copy of operating system. To reduce the number of disk accesses, the node caches database pages in its local memory buffer. In this paper, we propose a dynamic transaction routing algorithm to balance the load of each node in the DSS. The proposed algorithm is novel in the sense that it can support node-specific locality of reference by utilizing the primary copy authority assigned to each node; hence, it can achieve better cache hit ratios and thus fewer disk I/Os. Furthermore, the proposed algorithm avoids a specific node being overloaded by considering the current workload of each node. To evaluate the performance of the proposed algorithm, we develop a simulation model of the DSS, and then analyze the simulation results. The results show that the proposed algorithm outperforms the existing algorithms in the transaction processing rate. Especially the proposed algorithm shows better performance when the number of concurrently executed transactions is high and the data page access patterns of the transactions are not equally distributed.

• Journal of Animal Science and Technology
• /
• v.46 no.4
• /
• pp.509-516
• /
• 2004

This study is to investigate the amount of biased estimates for heritability and genetic correlation according to data structure on marbling scores in Korean cattle. Breeding population with 5 generations were simulated by way of selection for carcass weight, Longissimus muscle area and latent values of marbling scores and random mating. Latent variables of marbling scores were categorized into five by the thresholds of 0, I, 2, and 3 SD(DSI) or seven by the thresholds of -2, -1, 0,1I, 2, and 3 SD(DS2). Variance components and genetic pararneters(Heritabilities and Genetic correlations) were estimated by restricted maximum likelihood on multivariate linear mixed animal models and by Gibbs sampling algorithms on multivariate threshold mixed animal models in DS1 and DS2. Simulation was performed for 10 replicates and averages and empirical standard deviation were calculated. Using REML, heritabilitis of marbling score were under-estimated as 0.315 and 0.462 on DS1 and DS2, respectively, with comparison of the pararneter(0.500). Otherwise, using Gibbs sampling in the multivariate threshold animal models, these estimates did not significantly differ to the parameter. Residual correlations of marbling score to other traits were reduced with comparing the parameters when using REML algorithm with assuming linear and normal distribution. This would be due to loss of information and therefore, reduced variation on marbling score. As concluding, genetic variation of marbling would be well defined if liability concepts were adopted on marbling score and implemented threshold mixed model on genetic parameter estimation in Korean cattle.

• KIPS Transactions on Software and Data Engineering
• /
• v.10 no.3
• /
• pp.91-98
• /
• 2021

Today's information and communication technology is rapidly developing, the security of IT infrastructure is becoming more important, and at the same time, cyber attacks of various forms are becoming more advanced and sophisticated like intelligent persistent attacks (Advanced Persistent Threat). Early defense or prediction of increasingly sophisticated cyber attacks is extremely important, and in many cases, the analysis of network-based intrusion detection systems (NIDS) related data alone cannot prevent rapidly changing cyber attacks. Therefore, we are currently using data generated by intrusion detection systems to protect against cyber attacks described above through Host-based Intrusion Detection System (HIDS) data analysis. In this paper, we conducted a comparative study on machine learning algorithms using LID-DS (Leipzig Intrusion Detection-Data Set) host-based intrusion detection data including thread information, metadata, and buffer data missing from previously used data sets. The algorithms used were Decision Tree, Naive Bayes, MLP (Multi-Layer Perceptron), Logistic Regression, LSTM (Long Short-Term Memory model), and RNN (Recurrent Neural Network). Accuracy, accuracy, recall, F1-Score indicators and error rates were measured for evaluation. As a result, the LSTM algorithm had the highest accuracy.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.215-218
• /
• 1998

This paper proposes a blind multi-user detector using Code-Constrained Minimum Variance (CCMV) method which directly detects the DS-CDMA signals in a multipath fading channel without estimating the channels. This algorithm reduces the complexity of computation by making a small size data matrix with the order of the channel length. Advantageously it requires to know the spreading code and the time delay of only the desired user.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.41-44
• /
• 2001

In this paper, we have investigated the adaptive sector antenna which can control the size and direction angle of sectors, and proposed the three sectorization algorithms which are based on distribution of users, distribution of codes and distribution of signal power, respectively. The BERs of each sectorization algorithms are compared through computer simulation. As results of the simulation, the sectorization algorithm based on signal power are better than the other in terms nf BER. We have simulated error performance the DS-CDMA/BPSK system with the antenna in AWGN, frequency non-selective Rayleigh fading and MAI channels.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.1
• /
• pp.227-242
• /
• 2015

This paper proposes a weighting factor optimization method in predictive control algorithm for torque ripple reduction in an induction motor fed by an indirect matrix converter (IMC). In this paper, the torque ripple behavior is analyzed to validate the proposed weighting factor optimization method in the predictive control platform and shows the effectiveness of the system. Therefore, an optimization method is adopted here to calculate the optimum weighting factor corresponds to minimum torque ripple and is compared with the results of conventional weighting factor based predictive control algorithm. The predictive control algorithm selects the optimum switching state that minimizes a cost function based on optimized weighting factor to actuate the indirect matrix converter. The conventional and introduced weighting factor optimization method in predictive control algorithm are validated through simulations and experimental validation in DS1104 R&D controller platform and show the potential control, tracking of variables with their respective references and consequently reduces the torque ripple.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2400-2413
• /
• 2019

Doubly-selective (DS) fading channel is often occurred in many orthogonal frequency division multiplexing (OFDM) communication systems, such as high-speed rail communication systems and underwater acoustic (UWA) wireless networks. It is challenging to provide an accurate and fast estimation over the doubly-selective channel, due to the strong Doppler shift. This paper addresses the doubly selective channel estimation problem based on complex exponential basis expansion model (CE-BEM) in OFDM systems from the perspective of distributed compressive sensing (DCS). We propose a novel DCS-based improved sparsity adaptive matching pursuit (DCS-IMSAMP) algorithm. The advantage of the proposed algorithm is that it can exploit the joint channel sparsity information using dynamic threshold, variable step size and tailoring mechanism. Simulation results show that the proposed algorithm achieves 5dB performance gain with faster operation speed, in comparison with traditional DCS-based sparsity adaptive matching pursuit (DCS-SAMP) algorithm.

• Journal of the Korean Society of Safety
• /
• v.38 no.2
• /
• pp.8-14
• /
• 2023

In various industrial sites, piping systems play an essential role in stable fluid supply and pressure maintenance. However, these systems are constantly exposed to risks of earthquakes, explosions, fires, and leaks, which can result in casualties or serious economic losses. With rapid advancements in the industry, different-sized piping systems have been launched; however, there are not enough maintenance personnel for troubleshooting and responding to situations where damages occur to piping systems. This increases the need for introducing autonomous damage management systems. In this study, a lab-based piping system was designed and manufactured by referring to the piping system of a naval ship to analyze the effectiveness of autonomous damage management systems. By using this testbed, a representative algorithm, the hydraulic resistance control algorithm, was realized and examinedIn addition, the difference between the averaged pressure and normalized pressure was introduced to improve the performance of the existing algorithm, which faces some limitations with regard to sensor noise and back pressure from the rupture-simulated pipeline part.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.8
• /
• pp.3053-3059
• /
• 2010

In DS-CDMA method, Mobile Stations own jointly one radio channel and are made to use a PN code (Pseudo-Noise Code) for the purpose of minimize interference. However, corelation value of PN code is one when time delay is zero but the corelation value is 1 / N when time delay is not 0. Therefore corelation characteristic does not fully attained. As a result, when the user increase, the performance degradation and system capacity problem will be able to occur by interference among users. In this paper, the PN code has ideally self corelation. It was proved that PN code could depress interference from other users in multiple access system.

• Journal of KIISE:Information Networking
• /
• v.32 no.1
• /
• pp.68-79
• /
• 2005

The popularity of Web service is ever increasing. As the number of services and clients continue to increase, the problem of providing a system that scales with this increase is becoming more difficult. A costly and ineffective method is to buy a new system that is more powerful every time the load becomes unbearable. h more cost effective solution is to expand the system as the need arises. This is the approach taken in Web cluster systems. However, providing effective scalability in a Web cluster system is stil1 an open issue. In this study, we implement a Web cluster system based on Layer 7 switching technique on Linux. The implementation is based on a design proposed and implemented by Aron et al., but on the FreeBSD. Though the design li the same, due to the vast difference between the FreeBSD and Linux, the implementation presented in this paper is totally new. We also propose the Dual Scheduling (DS) load distribution algorithm that distributes the requests to the system resources by observing the variations in the request rate. We show through measurement on our implementation that the DS alorithm performs considerably bettor than previous algorithms.