• The Journal of the Korea Contents Association
• /
• v.13 no.11
• /
• pp.562-570
• /
• 2013

Image of emotional pleasure or displeasure, tension or emotional division of tranquility in the form of a tree is evaluated by weighting. Image representative evaluation of the sensitivity of the brightness contrast ratings 1 car pleasure, displeasure or stress or emotional tranquility and two cars are separated by image segmentation. Emotion Recognition of four compared to the numerical data is measured by brightness. OpenCV implementation through evaluation graph the stress intensity contrast, tranquility, pleasure, displeasure, depending on changes in the value of the computing is divided into four emotional. Contrast sensitivity of computing the brightness depending on the value entered 'nuisance' to 'excellent' or 'stress' to 'calm' the emotional changes can give. Calculate the sensitivity of the image regularity of localized computing system can control the future direction of industry on the application of emotion recognition will play a positive role.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2000-2007
• /
• 1999

Recently, DDS (Distributed Database System) has been often implemented on VAN (Value Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centrailzed systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time. In a DDS design, the main problem is 1) how to select proper computer, and 2) how to allocate data fragment into proper nodes. This paper addresses DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes tow objectives, the operating and investment cost. GA (Genetic Algorithm) is developed to solve this mathematical formulation. A numerical experiment shows that the proposed method arrives at a good solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.7A
• /
• pp.512-521
• /
• 2012

In this paper, we propose feasible combining rules for a decoding scheme of product codes to apply finite soft decision. Since the decoding scheme of product codes are based on complex tanh calculation with infinite soft decision, it requires high decoding complexity and is hard to practically implement. Thus, simple methods to construct look-up tables for finite soft decision are derived by analyzing the operations of the scheme. Moreover, we focus on using convolutional codes, which is popular for easy application of finite soft decision, as the horizontal codes of product codes so that the proposed decoding scheme can be properly implemented. Numerical results show that the performance of the product codes with convolutional codes using 4-bit soft decision approaches to that of same codes using infinite soft decision.

• Journal of Communications and Networks
• /
• v.16 no.6
• /
• pp.627-638
• /
• 2014

In this paper, we study the joint price and power allocation in spectrum sharing macro-femtocell networks. The proposed game theoretic framework is based on bi-level Stackelberg game where macro base station (MBS) works as a leader and underlaid femto base stations (FBSs) work as followers. MBS has fixed data rate and imposes interference price on FBSs for maintaining its data rate and earns revenue while FBSs jointly adjust their power for maximizing their data rates and utility functions. Since the interference from FBSs to macro user equipment is kept under a given threshold and FBSs compete against each other for power allocation, there is a need to determine a power allocation strategy which converges to Stackelberg equilibrium. We consider two cases for MBS power allocation, i.e., fixed and dynamic power. MBS can adjust its power in case of dynamic power allocation according to its minimum data rate requirement and number of FBSs willing to share the spectrum. For both cases we consider uniform and non-uniform pricing where MBS charges same price to all FBSs for uniform pricing and different price to each FBS for non-uniform pricing according to its induced interference. We obtain unique closed form solution for each case if the co-interference at FBSs is assumed fixed. And an iterative algorithm which converges rapidly is also proposed to take into account the effect of co-tier interference on interference price and power allocation strategy. The results are explained with numerical simulation examples which validate the effectiveness of our proposed solutions.

• Composites Research
• /
• v.12 no.1
• /
• pp.1-10
• /
• 1999

In order to predict the dynamic behavior of composite laminated plate accurately, the parametric identification is performed using its mechanical properties- $E_1,\;E_2,\;V_{12},\;G_{12}$ as design parameters. After natural frequencies are measured through simple vibration test, the objective function consists of the sum of errors between experimental and numerical frequencies of a structure. As optimization algorithm, conjugate gradient method is used to minimize the objective function. Sensitivity Analysis is performed to update design parameters during this process and can explain the result of parametric identification. In order to check the propriety of result, mode shapes are compared before and after identification. The improved prediction of natural frequencies of composite laminated plate is obtained with updated properties. For the application of result, updated properties is applied to the composite laminated plate that has different stacking sequence.

• Korea-Australia Rheology Journal
• /
• v.13 no.1
• /
• pp.29-35
• /
• 2001

The development of filament stretching extensional rheometers over the past decade has enabled the systematic measurement of the transient extensional stress growth in dilute and semi-dilute polymer solutions. The strain-hardening in the extensional viscosity of dilute solutions overwhelms the perturbative effects of capillarity, inertia & gravity and the kinematics of the extensional deformation become increasingly homogeneous at large strains. This permits the development of a robust open-loop control algorithm for rapidly realizing a deformation with constant stretch history that is desired for extensional rheometry. For entangled fluids such as concentrated solutions and melts the situation is less well defined since the material functions are governed by the molecular weight between entanglements, and the fluids therefore show much less pronounced strain-hardening in transient elongation. We use experiments with semi-dilute/entangled and concentrated/entangled monodisperse polystyrene solutions coupled with time-dependent numerical computations using nonlinear viscoelastic constitutive equations such as the Giesekus model in order to show that an open-loop control strategy is still viable for such fluids. Multiple iterations using a successive substitution may be necessary, however, in order to obtain the true transient extensional viscosity material function. At large strains and high extension rates the extension of fluid filaments in both dilute and concentrated polymer solutions is limited by the onset of purely elastic instabilities which result in necking or peeling of the elongating column. The mode of instability is demonstrated to be a sensitive function of the magnitude of the strain-hardening in the fluid sample. In entangled solutions of linear polymers the observed transition from necking instability to peeling instability observed at high strain rates (of order of the reciprocal of the Rouse time for the fluid) is directly connected to the cross-over from a reptative mechanism of tube orientation to one of chain extension.

• Journal of Korean Society of Transportation
• /
• v.25 no.4
• /
• pp.99-108
• /
• 2007

This paper presents an elastic demand stochastic user equilibrium traffic assignment that could not be easily tackled. The elastic demand coupled with a travel performance function is known to converge to a supply-demand equilibrium, where a stochastic user equilibrium (SUE) is obtained. SUE is the state in which all equivalent path costs are equal, and thus no user can reduce his perceived travel cost. The elastic demand SUE traffic assignment can be formulated based on a dynamic system, which is a means of describing how one state develops into another state over the course of time. Traditionally it has been used for control engineering, but it is also useful for transportation problems in that it can describe time-variant traffic movements. Through the Lyapunov Function Theorem, the author proves that the model has a stable solution and confirms it with a numerical example.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.34 no.5
• /
• pp.505-513
• /
• 2010

The tribrachial flame has attracted interest as a basic structure of the flame edge. This flame structure helps understand stabilization of laminar flames and re-ignition of turbulent flames. A number of analytical and experimental studies have been carried out on the tribrachial flame. However, the effect of the variation of the flammability limits on the structure of the tribrachial flame has not been studied in detail. In this study, the effect of non-symmetric flammability limits on the flame structure was investigated by adopting a simple numerical scheme based on several laminar flame theories. A fixed velocity field was considered and boundary matching algorithm was used on the premixed branch. The variation of the diffusion branches under the non-symmetric flammability limits and heat loss was investigated. The formation and extinction of the diffusion branch behind the premixed branch were successfully described. This basic study can help understand the fundamental structure of the flame and can form the basis of subsequent detailed studies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.11
• /
• pp.4268-4290
• /
• 2015

Future mobile communications face enormous challenges as traditional voice services are replaced with increasing mobile multimedia and data services. To address the vast data traffic volume and the requirement of user Quality of Experience (QoE) in the next generation mobile networks, it is imperative to develop efficient content distribution technique, aiming at significantly reducing redundant data transmissions and improving content delivery performance. On the other hand, in recent years cloud computing as a promising new content-centric paradigm is exploited to fulfil the multimedia requirements by provisioning data and computing resources on demand. In this paper, we propose a cooperative caching framework which implements State based Content Distribution (SCD) algorithm for future mobile networks. In our proposed framework, cloud service providers deploy a plurality of cloudlets in the network forming a Distributed Cloud Service Network (DCSN), and pre-allocate content services in local cloudlets to avoid redundant content transmissions. We use content popularity and content state which is determined by content requests, editorial updates and new arrivals to formulate a content distribution optimization model. Data contents are deployed in local cloudlets according to the optimal solution to achieve the lowest average content delivery latency. We use simulation experiments to validate the effectiveness of our proposed framework. Numerical results show that the proposed framework can significantly improve content cache hit rate, reduce content delivery latency and outbound traffic volume in comparison with known existing caching strategies.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.2892-2913
• /
• 2016

Network virtualization promises to play a dominant role in shaping the future Internet by overcoming the Internet ossification problem. However, due to the injecting of additional virtualization layers into the network architecture, several new security risks are introduced by the network virtualization. Although traditional protection mechanisms can help in virtualized environment, they are not guaranteed to be successful and may incur high security overheads. By performing the virtual network (VN) embedding in a security-aware way, the risks exposed to both the virtual and substrate networks can be minimized, and the additional techniques adopted to enhance the security of the networks can be reduced. Unfortunately, existing embedding algorithms largely ignore the widespread security risks, making their applicability in a realistic environment rather doubtful. In this paper, we attempt to address the security risks by integrating the security factors into the VN embedding. We first abstract the security requirements and the protection mechanisms as numerical concept of security demands and security levels, and the corresponding security constraints are introduced into the VN embedding. Based on the abstraction, we develop three security-risky modes to model various levels of risky conditions in the virtualized environment, aiming at enabling a more flexible VN embedding. Then, we present a mixed integer linear programming formulation for the VN embedding problem in different security-risky modes. Moreover, we design three heuristic embedding algorithms to solve this problem, which are all based on the same proposed node-ranking approach to quantify the embedding potential of each substrate node and adopt the k-shortest path algorithm to map virtual links. Simulation results demonstrate the effectiveness and efficiency of our algorithms.