• Journal of Korea Society of Industrial Information Systems
• /
• v.25 no.1
• /
• pp.89-99
• /
• 2020

In this paper, we consider a dyadic server control policy that combines workload control and single vacation. Customer arrives at the system with Bernoulli process, waits until his or her turn, and then receives service on FCFS(First come first served) discipline. If there is no customer to serve in the system, the idle single server spends a vacation of discrete random variable V. If the total service times of the waiting customers at the end of vacation exceeds predetermined workload threshold D, the server starts service immediately, and if the total workload of the system at the end of the vacation is less than or equal to D, the server stands by until the workload exceeds threshold and becomes busy. For the discrete-time Geo/G/1 queueing system operated under this dyadic server control policy, an idle period is analyzed and the steady-state queue length distribution is derived in a form of generating function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.624-631
• /
• 2011

In this paper, the RCF method is used in sensitivity analysis problems of the discrete power systems including both series FACTS equipments such as TCSC in transmission lines and generator controllers such as Exciter and PSS in generator terminal. To apply the RCF method in small signal stability problems of discrete power systems, state transition equations of controllers and TCSC are derived and the sensitivity calculation algorithm using state transition equations in discrete time domain is devised. The results of eigenvalue analysis showed that the variations of eigenvalues after periodic switching operations of TCSC can be calculated exactly by the RCF method and the change of firing angles in TCSC have important effect to determine the stability of power systems.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.477-487
• /
• 2000

When volume data is visualized by the ray casting method, the color value of each pixel in the image is obtained by composing the color contributions of the sample points that lie on the ray cast from the pixel point. In most ray tracing methods including Levoy's classical method, the color composition is formulated as a summation of the color contributions of the discrete sample points. However, the more precise color composition is formulated as differential equations over the color contributions of the continuous sample points. The discrete formulation is used, because analytical solutions to the continuous formulations are hard to find. In this paper, however, we have discovered a semi-analytical solution to the continuous formulation of a typical ray tracing of volume data. We have applied both Levoy's method and ours to the same set of data, and compared the visual quality of both results. The comparison shows that our method produces a more fine-grained visualization of volume data.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.289-294
• /
• 2002

A valid speech-sound block can be classified to provide important information for speech recognition. The classification of the speech-sound block comes from the MRA(multi-resolution analysis) property of the DWT(discrete wavelet transform), which is used to reduce the computational time for the pre-processing of speech recognition. The merging algorithm is proposed to extract valid speech-sounds in terms of position and frequency range. It needs some numerical methods for an adaptive DWT implementation and performs unvoiced/voiced classification and denoising. Since the merging algorithm can decide the processing parameters relating to voices only and is independent of system noises, it is useful for extracting valid speech-sounds. The merging algorithm has an adaptive feature for arbitrary system noises and an excellent denoising SNR(signal-to-nolle ratio).

• Journal of Internet Computing and Services
• /
• v.22 no.3
• /
• pp.45-52
• /
• 2021

Although many studies have been conducted to identify unknown attacks in cyber security intrusion detection systems, studies based on outliers are attracting attention. Accordingly, we identify outliers by defining categories for unknown attacks. The unknown attacks were investigated in two categories: first, there are factors that generate variant attacks, and second, studies that classify them into new types. We have conducted outlier studies that can identify similar data, such as variants, in the category of studies that generate variant attacks. The big problem of identifying anomalies in the intrusion detection system is that normal and aggressive behavior share the same space. For this, we applied a technique that can be divided into clear types for normal and attack by discrete wavelet transformation and detected anomalies. As a result, we confirmed that the outliers can be identified through One-Class SVM in the data reconstructed by discrete wavelet transform.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.2
• /
• pp.69-80
• /
• 2024

In this paper, we studied a discrete-time queuing system that operates under a mixed situation of D-policy and T-policy, one of the representative server control policies in queuing theory. A single server serves customers arriving by Bernoulli arrival process on a first-in, first-out basis(FIFO). If there are no customers to serve in the system, the server goes on vacation and returns, until the total service time (i.e., total amount of workload) of waiting customers exceeds predetermined workload threshold D. The operation of the system covered in this study can be used to model the efficient resource utilization of mobile devices using secondary batteries. In addition, it is significant in that the steady state waiting time and system sojourn time of the queuing system under a flexible mixed control policy were derived within a unified framework.

• Journal of Korea Society of Industrial Information Systems
• /
• v.29 no.1
• /
• pp.63-76
• /
• 2024

In this study, we analyzed queue length and sojourn time of discrete-time BMAP/G/1 queues under the workload control. Group customers (packets) with correlations arrive at the system following a discrete-time Markovian arrival process. The server starts busy period when the total service time of the arrived customers exceeds a predetermined workload threshold D and serves customers until the system is empty. From the analysis of workload and waiting time, distributions of queue length at the departure epoch and arbitrary time epoch and system sojourn time are derived. We also derived the mean value as a performance measure. Through numerical examples, we confirmed that we can obtain results represented by complex forms of equations, and we verified the validity of the theoretical values by comparing them with simulation results. From the results, we can obtain key performance measures of complex systems that operate similarly in various industrial fields and to analyze various optimization problems.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.5
• /
• pp.1245-1252
• /
• 2013

As the usage of digital image contents increase, a security problem for the payed image data or the ones requiring confidentiality is raised. This paper propose a depth-map image contents encryption methodology to hide the depth information. This method is performed on the frequency coefficients in the Wavelet domain. This method, by selecting the level and threshold value for the wavelet transform, encryption at various strengths are possible. The experimental results showed that encrypting only 0.048% of the entire data was enough to hide the constants of the depth-map. The encryption algorithm expected to be used effectively on the researches on encryption and others for image processing.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.4
• /
• pp.35-43
• /
• 2013

As texture images have become prevalent throughout a variety of industrial applications, copyright protection of these images has become important issues. For this reason, this paper proposes a color-texture image watermarking algorithm utilizing texture properties inherent in the image. The proposed algorithm selects suitable blocks to embed a watermark using the energy and homogeneity properties of the grey level co-occurrence matrices as inputs for the fuzzy c-means clustering algorithm. To embed the watermark, we first perform a discrete wavelet transform (DWT) on the selected blocks and choose one of DWT subbands. Then, we embed the watermark into discrete cosine transformed blocks with a gain factor. In this study, we also explore the effects of the DWT subbands and gain factors with respect to the imperceptibility and robustness against various watermarking attacks. Experimental results show that the proposed algorithm achieves higher peak signal-to-noise ratio values (47.66 dB to 48.04 dB) and lower M-SVD values (8.84 to 15.6) when we embedded a watermark into the HH band with a gain factor of 42, which means the proposed algorithm is good enough in terms of imperceptibility. In addition, the proposed algorithm guarantees robustness against various image processing attacks, such as noise addition, filtering, cropping, and JPEG compression yielding higher normalized correlation values (0.7193 to 1).

• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.448-457
• /
• 2011

In this study, the teaching material has been developed based on Polya's Problem Solving Techniques for preparing Korea Information Olympiad qualification and studying principle of computer. the basis of discrete mathematics and data structures were selected as the content of textbooks for students to learn computer programming principles. After the developed textbooks were applied to elementary school students of Science Gifted Education Center of J University, the result of study proves that textbook helps improve problem-solving ability using the testing tool restructured sample questions from previous test. We need guidebook and training course for teachers and realistic conditions for teaching the principles of computer.