• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.2
• /
• pp.241-249
• /
• 1997

In this paper, a new technique is proposed for generating a minimum-length synchronizable test sequence that can be applied in the distributed test architecture where both external synchtonization and input/output operation costs are taken into consideration. the method defines a set of transformation rules that constructs a duplex digraph from a given finite state machine representation of a protocol specification rules that constructs a duplex digraph from a given finite state machine representation of a protocol specificatio such that a rural chinese postman tour of the duplex digraph can be used to generate a minimum-length synchronizable test sequence using synchronizable distinguishing sequences as the state identification sequence for each state of the given finite state machine. The method provides an elegant solution to the synchronization problem that arises during the application of a predetermined test sequence in some protocol test architectures that utilize remote testers.

• Journal of Broadcast Engineering
• /
• v.14 no.3
• /
• pp.299-310
• /
• 2009

In this paper, we proposed a new method to correct the zoom lens distortion for the video sequence captured by the zoom lens. First, we defined the nonlinear zoom lens distortion model which is represented by the focal length and the lens distortion using the characteristic that lens distortion parameters are nonlinearly and monotonically changed while the focal length is increased. Then, we chose some sample images from the video sequence and estimated a focal length and a lens distortion parameter for each sample image. Using these estimated parameters, we were able to optimize the zoom lens distortion model. Once the zoom lens distortion model was obtained, lens distortion parameters of other images were able to be computed as their focal lengths were input. The proposed method has been made experiments with many real images and videos. As a result, accurate distortion parameters were estimated from the zoom lens distortion model and distorted images were well corrected without any visual artifacts.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.2
• /
• pp.552-562
• /
• 1997

This paper proposes a formal method on confromance testing for INAP(AIN) test sequence generation by optimization technique.In order to implement and prove the dffectiveness of the proposed method,we specify the SRSM of INAP protocol SRF in SDL and generate I/O FSM by using our S/W tool. We generate an opti-mal test sequence by applying our method our method to this reference I/O FSM. We prove experimentally that the length of the generated test sequence by our method is more effective and shorter(i.e 32% improved)than the one geverated by UIO method,and estimate that The test coverage space of our test sequence is larger that of UIO method.

• Journal of Convergence for Information Technology
• /
• v.12 no.2
• /
• pp.47-53
• /
• 2022

Recently, with the change of the intelligent security paradigm, study to apply various information generated from various information security systems to AI-based anomaly detection is increasing. Therefore, in this study, in order to convert log-like time series data into a vector, which is a numerical feature, the CBOW and Skip-gram inference methods of deep learning-based Word2Vec model and statistical method based on the coincidence frequency were used to transform the published ADFA system call data. In relation to this, an experiment was carried out through conversion into various embedding vectors considering the dimension of vector, the length of sequence, and the window size. In addition, the performance of the embedding methods used as well as the detection performance were compared and evaluated through GRU-based anomaly detection model using vectors generated by the embedding model as an input. Compared to the statistical model, it was confirmed that the Skip-gram maintains more stable performance without biasing a specific window size or sequence length, and is more effective in making each event of sequence data into an embedding vector.

• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.10 no.4
• /
• pp.325-332
• /
• 2017

In this paper, a survey of test sequence generation methods for testing the conformance of a protocol implementation to its specification is presented. The best known methods proposed in the literature are called transition tour, distinguishing sequence, characterizing sequence, and unique input/output sequence. Also, several variants of the above methods are introduced. Applications of these methods to the finite state machine model are discussed. Then, comparative analysis of the methods is made in terms of test sequence length. Finally, conclusions are given as follows. The T-method produces the shortest test sequence, but it has the worst fault coverage. The W-method tends to produce excessively long test sequences even though its fault coverage is complete. The problem with the DS-method is that a distinguishing sequence may not exist. The UIO-method is more widely applicable, but it does not provide the same fault coverage as the DS-method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.3012-3023
• /
• 1996

In this paper, we analyze the compression of optical soliton which is obtained by proceeding the optical pulse in FSDD(Fiber with Slowly Decreasing Dispersion) using both NSE(Nonlinear Schrodinger Equation) and GNSE(General Nonlinear Schrodinger Equation) and compare the results. We replace the FSDD with a sequence of fibers having different dispersion values and pompre the results with those obtained in FSDD. It is found that the same results in peak value and FWHM(Full width Half Maximum) can be obtained by replacing FSDD with a sequence of fibers having proper length. We vary the shape of initial pulse which is the input of FSDD and suggest the condition to obtain higher compression rate.

• ETRI Journal
• /
• v.45 no.6
• /
• pp.952-962
• /
• 2023

In this study, a space-time transmission scheme is proposed to tackle the limitations of channel estimation with orthogonal pilot information in colocated multiple-input multiple-output systems with several transmitting and receiving antennas. Channel information is obtained using orthogonal pilots. Channel estimation introduces pilot heads required to estimate a channel. This leads to bandwidth insufficiency. As a result, trade-offs exist between the number of pilots required to estimate a channel versus spectral efficiency. The detection of data symbols is performed using the maximum likelihood decoding method as it provides a consistent approach to parameter estimation problems. The moment-generating function of the instantaneous signal-to-noise ratio is used to drive an approximate expression of the symbol error rate for the proposed scheme. Furthermore, the order of diversity is less by one than the number of receiver antennas used in the proposed scheme. The effect of the length of a pilot sequence on the proposed scheme's performance is also investigated.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.121-124
• /
• 2001

This paper proposed resource allocation algorithm for the minimum switching activity of functional unit in high level synthesis process as like DSP which is circuit to give many functional unit. The resource allocation method after scheduling use the power function calculating average hamming distance and switching activity of the between two input. First of all, the switching activity is calculated by the input value after calculating the average hamming distance between operation. In this paper, the proposed method though high If level simulation find switching activity in circuit each functional unit exchange for binary sequence length and value bit are logic one value. To use the switching activity find the allocation with minimal power consumption, the proposed method visits all control steps one by one and determines the allocation with minimal power consumption at each control step. As the existing method, the execution time can be fast according to use the number of operator and max control step. And it is the reduction effect from 6% to 8%.

• Journal of Korean Society of Coastal and Ocean Engineers
• /
• v.34 no.4
• /
• pp.128-134
• /
• 2022

Nakdong river estuary is being operated with the goal of expanding the period of seawater inflow from this year to 2022 every month and creating a brackish water area within 15 km of the upstream of the river bank. In this study, the deep learning algorithm Long Short-Term Memory (LSTM) was applied to predict the salinity of the Nakdong Bridge (about 5 km upstream of the river bank) for the purpose of rapid decision making for the target brackish water zone and prevention of salt water damage. Input data were constructed to reflect the temporal and spatial characteristics of the Nakdong River estuary, such as the amount of discharge from Changnyeong and Hamanbo, and an optimal model was constructed in consideration of the hydraulic characteristics of the Nakdong River Estuary by changing the degree according to the sequence length. For prediction accuracy, statistical analysis was performed using the coefficient of determination (R-squred) and RMSE (root mean square error). When the sequence length was 12, the R-squred 0.997 and RMSE 0.122 were the highest, and the prior prediction time showed a high degree of R-squred 0.93 or more until the 12-hour interval.

• Journal of KIISE:Databases
• /
• v.36 no.6
• /
• pp.455-465
• /
• 2009

Suffix trees are widely used in similar sequence matching for DNA. They have several problems such as time consuming, large space usages of disks and memories and data skew, since DNA sequences are very large and do not fit in the main memory. Thus, in the paper, we present a space efficient indexing method called SENoM, allowing us to build trees without merging phases for the partitioned sub trees. The proposed method is constructed in two phases. In the first phase, we partition the suffixes of the input string based on a common variable-length prefix till the number of suffixes is smaller than a threshold. In the second phase, we construct a sub tree based on the disk using the suffix sets, and then write it to the disk. The proposed method, SENoM eliminates complex merging phases. We show experimentally that proposed method is effective as bellows. SENoM reduces the disk usage less than 35% and reduces the memory usage less than 20% compared with TRELLIS algorithm. SENoM is available to query efficiently using the prefix tree even when the length of query sequence is large.