• Journal of Internet Computing and Services
• /
• v.16 no.5
• /
• pp.1-9
• /
• 2015

As attacks in cyber space become advanced and complex, monotonous defense approach of one-one matching manner between attack and defense may be limited to defend them. More efficient defense method is required. This paper proposes multi layers security scheme that can support to defend assets against diverse cyber attacks in systematical and adaptive. We model multi layers security scheme based on Defense Zone including several defense layers and also discuss essential technical elements necessary to realize multi layers security scheme such as cyber threats analysis and automated assignment of defense techniques. Also effects of multi layers security scheme and its applicability are explained. In future, for embodiment of multi layers security scheme, researches about detailed architecture design for Defense Zone, automated method to select the best defense technique against attack and modeling normal state of asset for attack detection are needed.

• Geotechnical Engineering
• /
• v.26 no.9
• /
• pp.33-47
• /
• 2010

Underground constructions continue to provide challenges to Geotechnical Engineers yet they pose the best opportunities for development and deployment of advance technologies for analysis, design and construction. The reason for this is that, by virtue of the nature of underground constructions, more data and information on ground characteristics and response become available as the construction progresses. However, due to several barriers, these data and information are rarely, if ever, utilized to modify and improve project design and construction during the construction stage. To enable the use of evolving realtime data and information, and adaptively modify and improve design and construction, the paper presents an analysis and design system, called AMADEUS, for underground projects. AMADEUS stands for Adaptive, real-time and geologic Mapping, Analysis and Design of Underground Space. AMADEUS relies on recent advances in IT (Information Technology), particularly in digital imaging, data management, visualization and computation to significantly improve analysis, design and construction of underground projects. Using IT and remote sensors, real-time data on geology and excavation response are gathered during the construction using non-intrusive techniques which do not require expensive and time-consuming monitoring. The real-time data are then used to update geological and geomechanical models of the excavation, and to determine the optimal, construction sequences and stages, and structural support. Virtual environment (VE) systems are employed to allow virtual walk-throughs inside an excavation, observe geologic conditions, perform virtual construction operations, and investigate stability of the excavation via computer simulation to steer the next stages of construction.

• The Journal of Information Technology
• /
• v.5 no.2
• /
• pp.55-67
• /
• 2002

This paper presents an adaptive back propagation algorithm that update the learning parameter by the generated error, adaptively and varies the number of hidden layer node. This algorithm is expected to escaping from the local minimum and make the best environment for convergence to be change the number of hidden layer node. On the simulation tested this algorithm on two learning pattern. One was exclusive-OR learning and the other was $7{\times}5$ dot alphabetic font learning. In both examples, the probability of becoming trapped in local minimum was reduce. Furthermore, in alphabetic font learning, the neural network enhanced to learning efficient about 41.56%~58.28% for the conventional back propagation. and HNAD(Hidden Node Adding and Deleting) algorithm.

• Journal of Practical Agriculture & Fisheries Research
• /
• v.13 no.1
• /
• pp.3-17
• /
• 2011

Pipelines of processor have been growing deeper and issue widths wider over the years. If this trend continues, branch misprediction penalty will become very high. Branch misprediction is the single most significant performance limiter for improving processor performance using deeper pipelining. Therefore, more accurate branch predictor becomes an essential part of modem processors for FAFF(Food, Agriculture, Forestry, Fisheries)Information Processing. In this paper, we propose a branch prediction mechanism, using variable length history, which predicts using a bank having higher prediction accuracy among predictions from five banks. Bank 0 is a bimodal predictor which is indexed with the 12 least significant bits of the branch PC. Banks 1,2,3 and 4 are predictors which are indexed with different global history bits and the branch PC. In simulation results, the proposed mechanism outperforms gshare predictors using fixed history length of 12 and 13, up to 6.34% in prediction accuracy. Furthermore, the proposed mechanism outperforms gshare predictors using best history lengths for benchmarks, up to 2.3% in prediction accuracy.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.190-193
• /
• 2003

The DOA(Direction Of Arrival) estimation to select a best beam for receiving a particular signal in switched beam antenna systems, and to shape the optimal beam in adaptive array antenna systems, is typically performed under the assumption that the target user motion is almost negligible. In this paper, we model the user as the time-varying source and adopt the LPA(Local Polynomial Approximation) tracking algorithm, proposed by Katkovnik, to solve the time-varying DOA estimation problem. Then, we compare the power spectrum functions between the LPA beamformer and the conventional beamformer, also, the normalized SNRs of each beamformer. The results show that the LPA beamformer is robuster than the conventional beamformer in tine-varying environments. In addition, in case of the conventional beamformer, more array elements give rise to more degradation in the aspect of SNR.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.799-800
• /
• 2008

An efficient intra mode selection algorithm is proposed to reduce the computational complexity of inter frames for the H.264|AVC video encoding system. We propose an adaptive thresholding algorithm based on distribution characteristics of the sum of the absolute differences (SAD) of the best inter mode. Through comparative analysis, the proposed algorithm shows better speed up ratio with a negligible quality loss.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.273-277
• /
• 2009

A compressed video stream is very sensitive to transmission errors that may severely degrade the reconstructed image. Therefore, error resilience is an essential problem in video communications. In this paper, we propose novel temporal error concealment techniques for recovering lost or erroneously received macroblock (MB). To reduce the computational complexity, the proposed method adaptively determines the search range for each lost MB to find best matched block in the previous frame. And the original corrupted MB split into for $8{\times}8$ sub-MBs, and estimates motion vector (MV) of each sub-MB using its boundary information. Then the estimated MVs are utilized to reconstruct the damaged MB. In simulation results, the proposed method shows better performance than conventional methods in both aspects of PSNR.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3502-3509
• /
• 2010

Streaming service in the wireless mobile network environment has been a very challenging issue due to the dynamic uncertain nature of the channels. Overhead such as congestion, latency, and jitter lead to the problem of performance degradation of an adaptive multi-streaming service. This paper proposes a AMSS (Adaptive Multi-level Streaming Service) mechanism to reduce the performance degradation due to overhead such as variable network bandwidth, mobility and limited resources of the wireless mobile network. The proposed AMSS optimizes streaming services by: 1) use of fuzzy similarity metric, 2) minimization of packet loss due to buffer overflow and resource waste, and 3) minimization of packet loss due to congestion and delay. The simulation result shows that the proposed method has better performance in congestion control and packet loss ratio than the other existing methods of TCP-based method, UDP-based method and VBM-based method. The proposed method showed improvement of 10% in congestion control ratio and 8% in packet loss ratio compared with VBM-based method which is one of the best method.

• Journal of Korea Water Resources Association
• /
• v.34 no.6
• /
• pp.701-711
• /
• 2001

Forecasting of water quality variation is not an easy process due to the complicated nature of various water quality factors and their interrelationships. The objective of this study is to test the applicability of neural network models to the forecasting of the water quality at Gongju station in Geum River. This is done by forecasting monthly water qualities such as DO, BOD, and TN, and comparing with those obtained by ARIMA model. The neural network models of this study use BP(Back Propagation) algorithm for training. In order to improve the performance of the training, the models are tested in three different styles ; MANN model which uses the Moment-Adaptive learning rate method, LMNN model which uses the Levenberg-Marquardt method, and MNN model which separates the hidden layers for judgement factors from the hidden layers for water quality data. the results show that the forecasted water qualities are reasonably close to the observed data. And the MNN model shows the best results among the three models tested

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.5
• /
• pp.115-122
• /
• 2011

Adaptive arrays suffer from severe performance degradation when there are errors in the steering vector. The DCRCB (doubly constrained robust Capon beamformer) overcomes such a problem, introducing a spherical uncertainty set of the steering vector together with a norm constraint. However, in the standard DCRCB, it is a difficult task to determine the bound for the uncertainty, the radius of the spherical set, such that a near best solution is obtained. A novel beamforming method is presented which has no difficulty of the uncertainty bound setting, employing a recursive search for the steering vector. Though the basic idea of recursive search has been known, the conventional recursive method needs to set a parameter for the termination of the search. The proposed method terminates it by using distances to the signal subspace, without the need for parameter setting. Simulation demonstrates that the proposed method has better performance than the conventional recursive method and than the non-recursive standard DCRCB, even the one with the optimum uncertainty bound.