• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.291-301
• /
• 2011

This research describes the comparison broker's role and its effectiveness measurement framework of comparison shopping. We verified seller-led comparison challenge method provide comparison information of products to buyers more efficiently. Buyer's satisfaction of purchase (S) can be defined as an interactive function between seller's competitiveness vector (P) of products that supplied to the market, and buyer's informed level vector (B) of products that is known from a lot of sources. Then the buyer's informed level can be changed through the information analysis among products by transformation process using comparison matrix (C). So the role of comparison shopping is to construct a comparison matrix and to serve it to the buyers, and to change the buyer's informed level. The changed informed level influences a buyer's satisfaction, that improved satisfaction of purchase is defined as the effectiveness of comparison shopping. As a perfect construction and usage of comparison matrix is impossible, a more efficient method for improving the comparison effectiveness is the comparison challenge. This research shows that comparison shopping makes 9.32% and comparison challenge makes 19.11% enhancement of comparison effectiveness through television market data experiments.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.3
• /
• pp.149-154
• /
• 2015

In this paper proposes a stable marriage algorithm. The proposed algorithm firstly constructs an $n{\times}n$ matrix of men's and women's sum preference over opposite sex $p_{ij}$. It then repeatedly deletes row or column corresponding to the then maximum dispreference sum $_{max}p_{ij}$ until ${\forall}(|r_i|=1{\cap}|c_j|=1)$. If $|r_i|=1$ or $|c_j|=1$ then we select the $p_{ij}$ of $|r_i|=1$ or $|c_j|=1$ then the row or column values are deleted repeatedly until ${\forall}(|r_i|=1{\cap}|c_j|=1)$. When tested on 7 stable marriage problems, the proposed algorithm has proved to improve on the existing solutions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.4A
• /
• pp.189-196
• /
• 2012

A WAVE(Wireless Access for Vehicular Environment) system is a vehicle communication technology. The system provides the services to prevent vehicle accidents that might occur during driving. Also, it is used to provide various services such as monitoring vehicle management and system failure. However, the scrambler bit operation of WAVE system becomes less efficient in the organizations of software and hardware design because the parallel processing is impossible. Although scrambler algorithm proposed in this paper has different processing speed depending on input data 8 bit, 16 bit, 32 bit, and 64 bit. it improves the processing speed of the operation because it can make parallel processing possible depending on the input unit.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.143-148
• /
• 2022

It is very important for metaverse, mobile robot, and user location services to analyze the images continuously taken using a mobile smartphone or robot's monocular camera to estimate the camera's location. So far, PnP-related techniques have been applied to calculate the position. In this paper, the camera's moving direction is obtained using the essential matrix in the epipolar geometry applied to successive images, and the camera's continuous moving position is calculated through geometrical equations. A new estimation method was proposed, and its accuracy was verified through simulation. This method is completely different from the existing method and has a feature that it can be applied even if there is only one or more matching feature points in two or more images.

• Journal of the Korea Society for Simulation
• /
• v.10 no.1
• /
• pp.13-24
• /
• 2001

We propose a divide-conquer method of Petri nets under the condition of one-boundedness for all the Petri nets. We introduce the P-invariant transitive matrix of Petri nets and relationship between them. The feature of the P-invariant transitive matrix is that each element stands for the transitive relationship between input place and output place through the firing of the enable transition.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.23 no.3
• /
• pp.331-340
• /
• 2010

The basic theory and application of new adaptive finite element algorithm have been proposed in this study including the adaptive hp-refinement strategy, and the effective method for constructing hp-approximation. The hp-adaptive finite element concept needs the integrals of Legendre shape function, nonuniform p-distribution, and suitable constraint of continuity in conjunction with irregular node connection. The continuity of hp-adaptive mesh is an important problem at the common boundary of element interface. To solve this problem, the constraint of continuity has been enforced at the common boundary using the connectivity mapping matrix. The effective method for constructing of the proposed algorithm has been developed by using hierarchical nature of the integrals of Legendre shape function. To verify the proposed algorithm, the problem of simple cantilever beam has been solved by the conventional h-refinement and p-refinement as well as the proposed hp-refinement. The result obtained by hp-refinement approach shows more rapid convergence rate than those by h-refinement and p-refinement schemes. It it noted that the proposed algorithm may be implemented efficiently in practice.

• Proceedings of the IEEK Conference
• /
• 2001.06b
• /
• pp.161-164
• /
• 2001

정상상태에서 소자 내부의 격자온도 분포를 해석할 수 있는 시뮬레이터를 제작하였다. Slotboom 변수를 사용하여 열흐름 방정식을 이산화하였다. 또한 격자온도 분포를 고려한 초기 해의 설정 방법을 제안하였다. 제안된 방법의 타당성을 검증하기 위하여 N/sup ＋ P 정합 다이오드에 대해 모의실험을 수행하여 MEDICI의 결과와 비교하였다 순방향 전압-전류 특성은 MEDICI의 결과와 비교하여 7% 이내의 최대 상대오차를 보였고 전위 분포와 온도 분포는 각각 2%, 2% 이내의 최대 상대오차를 보였다. BANDIS에서는 수렴을 위해 평균 3.7회 이하의 행렬 연산이 필요하였으며, MEDICI에서는 평균 5.1회 이하의 행렬 연산이 필요하였다.

• Journal of Korean Society of Steel Construction
• /
• v.11 no.1 s.38
• /
• pp.69-78
• /
• 1999

When the lateral forces are applied to a frame, columns in the frame are usually accompanied with sidesway. If this sidesway is large, the frame is subjected to buckling and an early yielding of members which reduces the overall frame stiffness. In this study, numerical analysis of frames were conducted to evaluate the ultimate lateral strength of steel moment resisting frames permitted to sidesway under axial and lateral forces, and develope the procedure for determining the limits of column slenderness ratios. In the numerical analysis, the effects of the relative stiffness ratio between beam and column, deterioration of overall frame stiffness, slenderness ratio and loading conditions were considered. The elasto-plastic analysis method in which the $P-{\Delta}$effect is implemented, presented by the author previously, was adopted in the analysis. Incremental lateral forces were applied to the frame under constant axial loads and the generalized inverse is employed for the post-ultimate behavior.

• Journal of Internet Computing and Services
• /
• v.14 no.1
• /
• pp.15-22
• /
• 2013

WAVE(Wireless Access for Vehicular Environment) is new concepts and Vehicles communications technology using for ITS(Intelligent Transportation Systems) service by IEEE standard 802.11p. Also it increases the efficiency and safety of the traffic on the road. However, the efficiency of Scrambler bit computational algorithms of OFDM modulation in WAVE systems will fall as it is not able to process in parallel in terms of hardware and software. This paper proposes an algorithm to configure 64-bits matrix table in scambler bit computation as well as an algorithm to compute 64-bits matrix table and input data in parallel. The proposed algorithm on this thesis is executed using 64-bits matrix table. In the result, the processing speed for 1 and 1000 times is improved about 40.08% ~ 40.27% and processing rate per sec is performed more than 468.35 compared to bit operation scramble. And processing speed for 1 and 1000 times is improved about 7.53% ~ 7.84% and processing rate per sec is performed more than 91.44 compared to 32-bits operation scramble. Therefore, if the 64 bit-CPU is used for 64-bits executable scramble algorithm, it is improved more than 40% compare to 32-bits scrambler.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.4
• /
• pp.419-423
• /
• 2007

In this paper, we consider the M/G/1 queueing system with randomized control of T-policy. Whenever the busy period ends, the server is turned off and takes multiple vacations whose interval is fixed time T with probability p or stays on and waits for arriving customers with probability 1-p. We introduce the cost function and determine the optimal combination of (p, T) to minimize the average cost per unit time.