• Journal of Broadcast Engineering
• /
• v.10 no.1 s.26
• /
• pp.43-56
• /
• 2005

In the existing broadcasting environment, it is not easy to serve the bi-directional service between a broadcasting server and a TV audience. In the uni-directional broadcasting environments, almost TV programs are scheduled depending on the viewers' popular watching time, and the advertisement contents in these TV programs are mainly arranged by the popularity and the ages of the audience. The audiences make an effort to sort and select their favorite programs. However, the advertisement programs which support the TV program the audience want are not served to the appropriate audiences efficiently. This randomly provided advertisement contents can occur to the audiences' indifference and avoidance. In this paper, we propose the target advertisement service for the appropriate distribution of the advertisement contents. The proposed target advertisement service estimates the audience's profile without any issuing the private information and provides the target-advertised contents by using his/her estimated profile. For the experimental results, we used the real audiences' TV usage history such as the ages, fonder and time of the programs from AC Neilson Korea. And we show the accuracy of the proposed target advertisement service algorithm. NDS (Normalized Distance Sum) and the Vector correlation method, and implementation of our target advertisement service system.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2017.05a
• /
• pp.463-466
• /
• 2017

The purpose of this paper is to develop a module capable of all-directional driving different from conventional wheeled robots, and to solve the problems of the conventional mobile robot with side driving performance degradation, It is possible to overcome the disadvantages such as an increase in the time required for the unnecessary driving. The all - direction spherical wheel drive module for driving a ball - balancing robot is required to develop a power transfer mechanism and a driving algorithm for driving the robot in all directions using three rotor casters. 3DoF (Axis) A driver with built-in forward motion algorithm is embedded in the module and a driving motor module with 3DoF (axis) for driving direction and speed is installed. The movement mechanism depends on the sum of the rotation vectors of the respective driving wheels. It is possible to create various movement directions depending on the rotation and the vector sum of two or three drive wheels. It is possible to move in different directions according to the rotation vector field of each driving wheel. When a more innovative all-round spherical wheel drive module for forward movement is developed, it can be used in the driving part of the mobile robot to improve the performance of the robot more technically, and through the forward-direction robot platform with the drive module Conventional wheeled robots can overcome the disadvantage that the continuous straightening performance is lowered due to resistance to various environments. Therefore, it is necessary to use a full-direction driving function as well as a cleaning robot and a mobile robot applicable in the Americas and Europe It will be an essential technology for guide robots, boarding robots, mobile means, etc., and will contribute to the expansion of the intelligent service robot market and future automobile market.

• Tunnel and Underground Space
• /
• v.13 no.3
• /
• pp.187-195
• /
• 2003

This case study which is to make 2-Dimension earth's crust structures clearly is about the great boring-hole blasting to provide ground vibration source of the reflected wave research on the Korean Peninsula earth's crust structures research. For this study we've done blasting twice-500 ㎏/charge per delay, 1,000 ㎏/charge per delay, and the specifications of blasting are the following - dia.: 300 ㎜, boring-depth : 100m, besides, we used the explosives and electric detonators which have sufficient detonating velocity and very excellent safety, capacity of detonating, accurate delay time. We charged explosives into steel pipe with bulk type to avoid dead pressure by ground water. And then we tested about pipe airtight and blasting to certificate which has no problem by using on this study. In the results, we succeeded each blasting in Seosan, Youngdong. For the Peak Sum Vector(PSV) around the blasting at the main points, its real measured PSV is higher 180 % than estimated PSV with USBM. In this study we can't to be analysis of vibration velocity, but to be key providing vibration source.

• Journal of Korea Multimedia Society
• /
• v.7 no.2
• /
• pp.173-186
• /
• 2004

This paper proposed the content-based retrieval system as a method for performing image retrieval through the effective feature extraction of the object of significant meaning based on the characteristics of man's visual system. To allow the object region of interest to be primarily detected, the region, being comparatively large size, greatly different from the background color and located in the middle of the image, was judged as the major object with a meaning. To get the original features of the image, the cumulative sum of tile declination difference vector the segment of the object contour had and the signature of the bipartite object were extracted and used in the form of being applied to the rotation of the object and the change of the size after partition of the total length of the object contour of the image into the normalized segment. Starting with this form feature, it was possible to make a retrieval robust to any change in translation, rotation and scaling by combining information on the texture sample, color and eccentricity and measuring the degree of similarity. It responded less sensitively to the phenomenon of distortion of the object feature due to the partial change or damage of the region. Also, the method of imposing a different weight of similarity on the image feature based on the relationship of complexity between measured objects using the fractal dimension by the Boxing-Counting Dimension minimized the wrong retrieval and showed more efficient retrieval rate.

• Journal of Biomedical Engineering Research
• /
• v.34 no.3
• /
• pp.129-134
• /
• 2013

The essential tremor is an involuntary oscillatory movement of body parts. Conventional treatments of essential tremor have little effects in some patients and also leads to significant side effects. Alternative to these treatments, sensory stimulation may have beneficial effects on the essential tremor. The purpose of this study was to analyze an effect of sensory stimulation on essential tremor. Ten patients with essential tremor ($67.4{\pm}8.82$ yrs, 5 men and 5 women) participated in this study. Three-axis gyro sensors were attached on index finger, hand and forearm of patients. Task of 'arms outstretched forward' was performed with and without sensory stimulation. Vectorsum of three dimensional angular velocities (pitch, roll, yaw) was calculated. Outcome measures included root-meansquare (RMS) mean of the vector-sum amplitude, total power, peak power and peak frequency. RMS amplitude, total power and peak power were reduced by sensory stimulation (p < 0.05). Peak frequency was not affected by sensory stimulation. The results indicate that the sensory stimulation is useful to suppress the essential tremor.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.46 no.4
• /
• pp.199-208
• /
• 2023

Taguchi method is one of the most popular approaches for design optimization such that performance characteristics become robust to uncontrollable noise variables. However, most previous Taguchi method applications have addressed a single-characteristic problem. Problems with multiple characteristics are more common in practice. The multi-criteria decision making(MCDM) problem is to select the optimal one among multiple alternatives by integrating a number of criteria that may conflict with each other. Representative MCDM methods include TOPSIS(Technique for Order of Preference by Similarity to Ideal Solution), GRA(Grey Relational Analysis), PCA(Principal Component Analysis), fuzzy logic system, and so on. Therefore, numerous approaches have been conducted to deal with the multi-characteristic design problem by combining original Taguchi method and MCDM methods. In the MCDM problem, multiple criteria generally have different measurement units, which means that there may be a large difference in the physical value of the criteria and ultimately makes it difficult to integrate the measurements for the criteria. Therefore, the normalization technique is usually utilized to convert different units of criteria into one identical unit. There are four normalization techniques commonly used in MCDM problems, including vector normalization, linear scale transformation(max-min, max, or sum). However, the normalization techniques have several shortcomings and do not adequately incorporate the practical matters. For example, if certain alternative has maximum value of data for certain criterion, this alternative is considered as the solution in original process. However, if the maximum value of data does not satisfy the required degree of fulfillment of designer or customer, the alternative may not be considered as the solution. To solve this problem, this paper employs the desirability function that has been proposed in our previous research. The desirability function uses upper limit and lower limit in normalization process. The threshold points for establishing upper or lower limits let us know what degree of fulfillment of designer or customer is. This paper proposes a new design optimization technique for multi-characteristic design problem by integrating the Taguchi method and our desirability functions. Finally, the proposed technique is able to obtain the optimal solution that is robust to multi-characteristic performances.

• Journal of the Korea Computer Graphics Society
• /
• v.26 no.3
• /
• pp.123-131
• /
• 2020

This study proposes a real-time rendering algorithm for lighting when each of more than 100,000 moving particles exists as a light source. Two 3D textures are used to dynamically determine the range of influence of each light, and the first 3D texture has light color and the second 3D texture has light direction information. Each frame goes through two steps. The first step is to update the particle information required for 3D texture initialization and rendering based on the Compute shader. Convert the particle position to the sampling coordinates of the 3D texture, and based on this coordinate, update the colour sum of the particle lights affecting the corresponding voxels for the first 3D texture and the sum of the directional vectors from the corresponding voxels to the particle lights for the second 3D texture. The second stage operates on a general rendering pipeline. Based on the polygon world position to be rendered first, the exact sampling coordinates of the 3D texture updated in the first step are calculated. Since the sample coordinates correspond 1:1 to the size of the 3D texture and the size of the game world, use the world coordinates of the pixel as the sampling coordinates. Lighting process is carried out based on the color of the sampled pixel and the direction vector of the light. The 3D texture corresponds 1:1 to the actual game world and assumes a minimum unit of 1m, but in areas smaller than 1m, problems such as stairs caused by resolution restrictions occur. Interpolation and super sampling are performed during texture sampling to improve these problems. Measurements of the time taken to render a frame showed that 146 ms was spent on the forward lighting pipeline, 46 ms on the defered lighting pipeline when the number of particles was 262144, and 214 ms on the forward lighting pipeline and 104 ms on the deferred lighting pipeline when the number of particle lights was 1,024766.

• Korean Journal of Remote Sensing
• /
• v.31 no.6
• /
• pp.531-548
• /
• 2015

Atmospheric Motion Vector (AMV) from satellite images have shown Slow Speed Bias (SSB) in comparison with rawinsonde. The causes of SSB are originated from tracking, selection, and height assignment error, which is known to be the leading error. However, recent works have shown that height assignment error cannot be fully explained the cause of SSB. This paper attempts a new approach to examine the possibility of SSB reduction of COMS AMV by using a new target tracking algorithm. Tracking error can be caused by averaging of various wind patterns within a target and changing of cloud shape in searching process over time. To overcome this problem, Gaussian Mixture Model (GMM) has been adopted to extract the coldest cluster as target since the shape of such target is less subject to transformation. Then, an image filtering scheme is applied to weigh more on the selected coldest pixels than the other, which makes it easy to track the target. When AMV derived from our algorithm with sum of squared distance method and current COMS are compared with rawindsonde, our products show noticeable improvement over COMS products in mean wind speed by an increase of $2.7ms^{-1}$ and SSB reduction by 29%. However, the statistics regarding the bias show negative impact for mid/low level with our algorithm, and the number of vectors are reduced by 40% relative to COMS. Therefore, further study is required to improve accuracy for mid/low level winds and increase the number of AMV vectors.

• Journal of Food Hygiene and Safety
• /
• v.32 no.1
• /
• pp.8-13
• /
• 2017

This study was conducted to develop an agent-based computing platform enabling simulation of on-farm produce contamination by enteric foodborne pathogens, which is herein called PPMCS (Preharvest Produce Microbial Contamination Simulator). Also, fecal contamination of preharvest produce was simulated using PPMCS. Although Agent-based Modeling and Simulation, the tool applied in this study, is rather popular in where socio-economical human behaviors or ecological fate of animals in their niche are to be predicted, the incidence of on-farm produce contamination which are thought to be sporadic has never been simulated using this tool. The agents in PPMCS including crop, animal as a source of fecal contamination, and fly as a vector spreading the fecal contamination are given their intrinsic behaviors that are set to be executed at certain probability. Once all these agents are on-set following the intrinsic behavioral rules, consequences as the sum of all the behaviors in the system can be monitored real-time. When fecal contamination of preharvest produce was simulated in PPMCS as numbers of animals, flies, and initially contaminated plants change, the number of animals intruding cropping area affected most on the number of contaminated plants at harvest. For further application, the behaviors and variables of the agents are adjustable depending on user's own scenario of interest. This feature allows PPMCS to be utilized in where different simulating conditions are tested.

• Journal of Intelligence and Information Systems
• /
• v.17 no.3
• /
• pp.187-201
• /
• 2011

KOSPI200 index is the Korean stock price index consisting of actively traded 200 stocks in the Korean stock market. Its base value of 100 was set on January 3, 1990. The Korea Exchange (KRX) developed derivatives markets on the KOSPI200 index. KOSPI200 index futures market, introduced in 1996, has become one of the most actively traded indexes markets in the world. Traders can make profit by entering a long position on the KOSPI200 index futures contract if the KOSPI200 index will rise in the future. Likewise, they can make profit by entering a short position if the KOSPI200 index will decline in the future. Basically, KOSPI200 index futures trading is a short-term zero-sum game and therefore most futures traders are using technical indicators. Advanced traders make stable profits by using system trading technique, also known as algorithm trading. Algorithm trading uses computer programs for receiving real-time stock market data, analyzing stock price movements with various technical indicators and automatically entering trading orders such as timing, price or quantity of the order without any human intervention. Recent studies have shown the usefulness of artificial intelligent systems in forecasting stock prices or investment risk. KOSPI200 index data is numerical time-series data which is a sequence of data points measured at successive uniform time intervals such as minute, day, week or month. KOSPI200 index futures traders use technical analysis to find out some patterns on the time-series chart. Although there are many technical indicators, their results indicate the market states among bull, bear and flat. Most strategies based on technical analysis are divided into trend following strategy and non-trend following strategy. Both strategies decide the market states based on the patterns of the KOSPI200 index time-series data. This goes well with Markov model (MM). Everybody knows that the next price is upper or lower than the last price or similar to the last price, and knows that the next price is influenced by the last price. However, nobody knows the exact status of the next price whether it goes up or down or flat. So, hidden Markov model (HMM) is better fitted than MM. HMM is divided into discrete HMM (DHMM) and continuous HMM (CHMM). The only difference between DHMM and CHMM is in their representation of state probabilities. DHMM uses discrete probability density function and CHMM uses continuous probability density function such as Gaussian Mixture Model. KOSPI200 index values are real number and these follow a continuous probability density function, so CHMM is proper than DHMM for the KOSPI200 index. In this paper, we present an artificial intelligent trading system based on CHMM for the KOSPI200 index futures system traders. Traders have experienced on technical trading for the KOSPI200 index futures market ever since the introduction of the KOSPI200 index futures market. They have applied many strategies to make profit in trading the KOSPI200 index futures. Some strategies are based on technical indicators such as moving averages or stochastics, and others are based on candlestick patterns such as three outside up, three outside down, harami or doji star. We show a trading system of moving average cross strategy based on CHMM, and we compare it to a traditional algorithmic trading system. We set the parameter values of moving averages at common values used by market practitioners. Empirical results are presented to compare the simulation performance with the traditional algorithmic trading system using long-term daily KOSPI200 index data of more than 20 years. Our suggested trading system shows higher trading performance than naive system trading.