• International journal of advanced smart convergence
• /
• v.4 no.1
• /
• pp.18-30
• /
• 2015

As the speed of networks that subscribers can use has greatly increased, demand for high-quality broadcast content, such as from Internet Protocol Television (IPTV) and Video on Demand (VoD), is likewise increasing. Therefore, while broadcasters are increasing content and channels, they are striving to improve consumer quality of experience (QoE) to differentiate themselves from competitors, including by producing higher physical-quality content. Recently, subjective measurement methods have been internationally standardized as the most reliable approach for measuring and evaluating IPTV QoE. However, a majority of these methods are performed in experimental environments and are based on the extremely brief viewing period of approximately ten seconds using original reference videos. It is actually difficult to apply standard evaluation methods based on a ten-second viewing interval to assess real broadcast watching of IPTV or other services that involve a longer time (i.e., more than thirty minutes). In this paper, we therefore propose a method that accommodates actual viewing environments. Using the mean opinion score, we experimentally analyze the effects of evaluation interval changes under actual conditions in which IPTV service is provided. In addition, we propose improvements by applying the results into actual live broadcast IPTV service and by analyzing consumer service QoE.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.612-620
• /
• 2017

Relay coordination in power system is a complex problem and so far, meta-heuristic algorithms and other methods as an alternative approach may not properly deal with large scale relay coordination due to their huge time consuming computation. In some cases the relay coordination could be unachievable. As the urgency for a proper approach is essential, in this paper an innovative and simple relay coordination method is introduced that is able to be applied on optimization algorithms for relay protection coordination. The objective function equation of operating time of relays are divided into two separate functions with less constraints. As the analytical results show here, this equivalent method has a remarkable speed with high accuracy to coordinate directional relays. Two distribution systems including directional overcurrent relays are studied in DigSILENT software and the collected data are examined in MATLAB. The relay settings of this method are compared with particle swarm optimization and genetic algorithm. The analytical results show the correctness of this mathematical and practical approach. This fast coordination method has a proper velocity of convergence with low iteration that can be used in large scale systems in practice and also to provide a feasible solution for protection coordination in smart grids as online or offline protection coordination.

• Journal of information and communication convergence engineering
• /
• v.12 no.4
• /
• pp.263-270
• /
• 2014

Corner detection and feature extraction are essential aspects of computer vision problems such as object recognition and tracking. Feature detectors such as Scale Invariant Feature Transform (SIFT) yields high quality features but computationally intensive for use in real-time applications. The Features from Accelerated Segment Test (FAST) detector provides faster feature computation by extracting only corner information in recognising an object. In this paper we have analyzed the efficient object detection algorithms with respect to efficiency, quality and robustness by comparing characteristics of image detectors for corner detector and feature extractors. The simulated result shows that compared to conventional SIFT algorithm, the object recognition system based on the FAST corner detector yields increased speed and low performance degradation. The average time to find keypoints in SIFT method is about 0.116 seconds for extracting 2169 keypoints. Similarly the average time to find corner points was 0.651 seconds for detecting 1714 keypoints in FAST methods at threshold 30. Thus the FAST method detects corner points faster with better quality images for object recognition.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.152-159
• /
• 2005

For high-speed data communication in band-limited channels, main of the bit error are fading and ISI(Inter-Symbol Interference). The common way of dealing with ISI is using equalization in the receiver. In this thesis, channel adaptive equalizer which uses Fuzzy Stochastic Gradient(FSG) and Constant Modulus Algorithm(CMA) is nonlinear equalizer, or Blind equalizer, that works directly on the signals with no training sequences required. This equalizer employs Takagi-Sugeno's fuzzy model that uses the FSG algorithm, to automatically regulate the step size of the descent gradient vector, combining fast convergence rate and low mean square error(MSE), and the CMA which is a special case of Godard's algorithm, to having multiple dispersion constants($R_p$).

• Structural Engineering and Mechanics
• /
• v.45 no.1
• /
• pp.111-127
• /
• 2013

In this paper, a new version of gravitational search algorithm based on opposition-based learning (OBGSA) is introduced and applied for optimum design of reinforced concrete retaining walls. The new algorithm employs the opposition-based learning concept to generate initial population and updating agents' position during the optimization process. This algorithm is applied to minimize three objective functions include weight, cost and $CO_2$ emissions of retaining structure subjected to geotechnical and structural requirements. The optimization problem involves five geometric variables and three variables for reinforcement setups. The performance comparison of the new OBGSA and classical GSA algorithms on a suite of five well-known benchmark functions illustrate a faster convergence speed and better search ability of OBGSA for numerical optimization. In addition, the reliability and efficiency of the proposed algorithm for optimization of retaining structures are investigated by considering two design examples of retaining walls. The numerical experiments demonstrate that the new algorithm has high viability, accuracy and stability and significantly outperforms the original algorithm and some other methods in the literature.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.116-122
• /
• 2006

Most of the multimedia applications require strict quality of service (QoS) guarantee during the communication between a single source and multiple destinations. This gives rise to the need for an efficient QoS multicast routing strategy. Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in Internet. This paper describes a network model for researching the routing problem and proposes a new multicast tree selection algorithm based on genetic algorithms to simultaneously optimize multiple QoS parameters. The paper mainly presents a QoS multicast routing algorithm based on genetic algorithm (QMRGA). The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.

• Journal of Digital Convergence
• /
• v.11 no.4
• /
• pp.215-220
• /
• 2013

The super computer calls usually as the super computer in case the computing power of the computer is 20 G flops (GFLOPS) or greater. In the past, the computer equipped with the vector processor (the instrument processing the order having the logic operation and maximum value or minimum value besides the common computer instruction) processing the scientific calculation with the super high speed was installed as the super computer. Recently, cyber attack focuses on supercomputer because if it is being infected, then it will affect hundreds of client PC. Therefore, our research paper analyzed super computer security issues and biometric countermeasure to develop the level of security on super computer.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.33 no.4
• /
• pp.209-216
• /
• 2020

In this paper, parametric structural analysis is presented utilizing the co-rotational(CR) shell analysis utilizing EDISON. CR shell analysis shows faster convergence than the commercial software, NASTRAN, does. The 1st natural frequency of the rear frame is obtained, which is close to that of the engine during high speed cruise. Three cases under two design variables are presented and analyzed. Gusset is shown to be more effective among those which feature the same weight change. The results presented in this paper will be applicable for further researches to improve the durability of a motorcycle rear frame.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.233-239
• /
• 2004

In this paper, we describe a defense mechanism to cope with stepping stones attacks in high-speed networks. (Stepping stones Attacker launches attacks not from their own computer but from intermediary hosts that they previously compromised.) We aim at tracing origin hacker system, which attack target system via stepping stones. There are two kind of traceback technology ; IP packet traceback, or connection traceback. We are concerned with connection traceback in this paper. We propose a new host-based traceback. The purpose of this paper is that distinguish between origin hacker system and stepping stones by using process structure of OS(Operating System).

• Journal of information and communication convergence engineering
• /
• v.16 no.3
• /
• pp.153-159
• /
• 2018

In this paper, we present a three-dimensional (3D) optical encryption technique for quick response (QR) code using computational synthesized integral imaging, computational volumetric reconstruction, and double random phase encryption. Two-dimensional (2D) QR code has many advantages, such as enormous storage capacity and high reading speed. However, it does not protect primary information. Therefore, we present 3D optical encryption of QR code using double random phase encryption (DRPE) and an integral imaging technique for security enhancement. We divide 2D QR code into four parts with different depths. Then, 2D elemental images for each part of 2D QR code are generated by computer synthesized integral imaging. Generated 2D elemental images are encrypted using DRPE, and our method increases the level of security. To validate our method, we report simulations of 3D optical encryption of QR code. In addition, we calculated the peak side-lobe ratio (PSR) for performance evaluation.