• Journal of Global Scholars of Marketing Science
• /
• v.16 no.3
• /
• pp.39-60
• /
• 2006

The purpose of this study is to investigate the effect of two different characteristics of music(tempo) and advertising photograph(type) in a fashion store on consumers' emotional responses and approach behavior and to suggest competitive in-store atmospheric strategies. To test the conceptual model, this study used a video simulation method. Researchers selected a fashion casual wear retail store for young people and videotaped to provide realistic store settings. Two different levels of background music(fast, slow) and advertising photograph(sexy, cheerful) were inserted into the video clip generating four stimuli. Including a stimulus for the control group, 5 video clips were created. A total of 289 subjects answered the questionnaire after viewing a two-minute video clips. The results are as follows: First, advertising photograph in a store had a significant effect on consumers' in-store emotional state, whereas musical tempo did not. Second, the effect of in-store consumers' emotional state on behavioral reponses were investigated. Results showed that consumers' positive emotional state lead to consumers' approach behavior. The results of this study indicated that background music and advertising photograph in a fashion store affected consumers' in-store emotional state, and ultimately these affected consumers' positive approach behavior. Thus retailer should try to create a pleasant store environment using effective store atmospheric factors like background music and advertising photograph.

• Journal of the Korean earth science society
• /
• v.27 no.6
• /
• pp.643-652
• /
• 2006

Data of the carbon monoxide concentration observed in Mt. Waliguan in China (WLG), Ulaan Uul in Mongolia (UUM), Tae-ahn Peninsula in Korea (TAP), and Ryori in Japan (RYO) were analyzed for a long period between 1991 and 2004. The annual average concentration of carbon monoxide was the highest at TAP $(233{\pm}41ppb)$ followed by $RYO(171{\pm}36ppb),\;UUM(155{\pm}26ppb),\;and\;WLG(135{\pm}22ppb)$. The seasonal variations being high in spring and low in summer were observed in other areas of Eastern Asia except WLG. TAP was high in carbon monoxide concentration in all seasons compared to WLG, UUM and RYO and shows wide distribution of concentration in the histogram, which is caused by the influence of large-scale air pollution due to its downwind location close to the East Asian continent, China in particular. Also, our data was compared with data measured at Mauna Loa (MLO) in Hawaii. According to the origin of the isentropic backward trajectory and its transport passage, carbon monoxide concentration observed in TAP was analyzed as follows: continental background airflows (CBG) were $216{\pm}47ppb$; regionally polluted continental airflows (RPC) were $316{\pm}56ppb$; Oceanic background airflows (OBG) were $108{\pm}41ppb$; and Partly perturbed oceanic airflows (PPO) were $161{\pm}6ppb$. The high concentration of carbon monoxide in TAP is due to the airflow from East Asian continent origin rather than that from the North Pacific origin. Especially, RPC which passes through the eastern China appeared to be the highest in concentration in spring, fall, and winter. However, OBG was affected by the North Pacific air mass with a low carbon monoxide concentration in summer. The NOAA satellite images and GEOS-CHEM model simulation confirmed a large-scale air pollution event that was in the course of expansion from southeastern China bound to the Korean Peninsula and the Korea East Sea by way of the Yellow Sea.

• Journal of radiological science and technology
• /
• v.33 no.3
• /
• pp.203-211
• /
• 2010

The purpose of this study is meant to develop an evaluation framework for PBL and S-PBL package, as well as verify reliability and propriety of developed framework. To achieve the purpose, existing researches and related documents were considered, and composed basic questionnaire which fits to the basic frame of the framework, 3 categories 15 items for PBL/S-PBL. Verifying its contents propriety, examined by 9 experts who professors in college and made 14 items for PBL, 15 items for S-PBL. To verify construct validity of basic frameworks, carried out factor analysis. Final evaluation framework questionnaire were 15 items selected, its PBL for 3 items in motivating, 7 items in integrity, 4 items in systematic and total 14 items, S-PBL for 4 items in motivating, 6 items in integrity, 5 items in systematic and total 15 items, and was verify to have adequate reliability with Cronbach's $\alpha$ is 0.9112 in PBL, 0.9166 of S-PBL.

• Journal of Korean Society of Forest Science
• /
• v.96 no.3
• /
• pp.362-368
• /
• 2007

This study was conducted to estimate merchantable volume and yield per diameter (DBH) class of Pinus koraiensis and Larix kaempferi. Stem volume of trees in each diameter class was calculated using the existing equations for taper and height curve. Saw logs and pulpwood volume were then estimated from the stem volume in each diameter class. The final step was to estimate merchantable volume and yield from saw logs, assuming saw logs were used for lumber (boards or dimension products) production only. The results showed that the stem volume of Larix kaempferi was 23~38% higher than that of Pinus koraiensis at the same diameter classes. Both species were able to produce saw logs from the diameter class of 18 cm. Saw logs and pulpwood yield for both species rapidly increased due to the size limitation on small end diameter. This yield reached a maximum of 90% and 88% at 26 cm and 38cm diameter class, respectively, for Pinus koraiensis and Larix kaempferi. Lumber yield estimated for board products ranged from 23% to 56%. In the case of dimension products, Lumber yield became significantly smaller as saw logs were used for larger dimension products. These results can be used for calculating merchantable volume and economic value of trees, as well as determining final lumber products.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.276-284
• /
• 2005

In the mobile computing environment, caching data at the client's side is a useful technique for improving the performance. For caching to be effective, the cache contents must be consistent with those stored in the server. That is, unfortunately, difficult to enforce due to the frequent disconnection and mobility of clients. In the literature, the basic approach adopted is for the sever to periodically broadcast invalidation reports(IRs) that contain information about objects that have been updated recently. However IR-based cache maintenance scheme has a main drawback. Any client who has been disconnected longer than w seconds has to discard all cached items even some of them may still be valid. In this paper, we propose two main schemes which can adapt clients' losing IR messages by long disconnection. First, the client sends its disconnection time when connection is re-established, and the server uses this information to decide the size of broadcast window w dynamically. Second, the server maintains IR messages for a given period of time and a client who has been disconnected longer than w seconds can verify its cache consistency individually. Compared to previous IR-based schemes, our schemes can significantly reduce cache missing and uplink request and improve the throughput by reducing response time.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.6
• /
• pp.306-313
• /
• 2005

Conditional branch prediction is an important technique for improving processor performance. Branch mispredictions, however, waste a large number of cycles, inhibit out-of-order execution, and waste electric power on mis-speculated instructions. Hence, the branch predictor with higher accuracy is necessary for good processor performance. In global-history-based predictors like gshare and GAg, many mispredictions come from commit update of the history. Some works on this subject have discussed the need for speculative update of the history and recovery mechanisms for branch mispredictions. In this paper, we present a simple mechanism for recovering the branch history after a misprediction. The proposed mechanism adds an age_counter to the original predictor and doubles the size of the branch history register. The age_counter counts the number of outstanding branches and uses it to recover the branch history register. Simulation results on the Simplescalar 3.0/PISA tool set and the SPECINTgS benchmarks show that gshare and GAg with the proposed recovery mechanism improved the average prediction accuracy by 2.14$\%$ and 9.21$\%$, respectively and the average IPC by 8.75$\%$ and 18.08$\%$, respectively over the original predictor.

• Journal of KIISE:Information Networking
• /
• v.31 no.3
• /
• pp.269-279
• /
• 2004

The most important factor influencing the robustness of the Internet Is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes worse the network congestion. Recently, Brakmo and Peterson have proposed a new version of TCP, which is named TCP Vegas, with a fundamentally different congestion control scheme from that of the Reno. Many studies indicate that the Vegas is able to achieve better throughput and higher stability than the Reno. But there are two unfairness problems in Vegas. These problems hinder the spread of the Vegas in current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP PowerVegas. The existing Vegas depends mainly only on the rtt(round trip time), but the proposed PowerVegas use the new congestion control scheme combined the Information on the rtt with the information on the packet loss. Therefore the PowerVegas performs the congestion control more competitively than the Vegas. Thus, the PowerVegas is able to solve effectively these unfairness problems which the Vegas has experienced. To evaluate the proposed approach, we compare the performance among PowerVegas, Reno and Vegas under same network environment. Using simulation, the PowerVegas is able to achieve better throughput and higher stability than the Reno and is shown to achieve much better fairness than the existing Vegas.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.5
• /
• pp.213-217
• /
• 2001

Excessive memory buffer requirement in continuous media playback is a serious impediment of wide spread usage of on-line multimedia service. Skewed access frequency of available video files provides an opportunity of re-using the date blocks which has been loaded by one session for later usage. We present novel algorithm which minimizes the buffer requirement in multiple sessions of multimedia playbacks. In continuous media playback originated from the disk, a certain amount of memory buffer is required to synchronize asynchronous disk. Read operation and synchronous playback operation. As aggregate playback bandwodth increases, larger amount of buffer needs to be allocated for this synchronization purpose. The focus of this work is to study the asymptotic behavior of the synchronization buffer requirement and to develop an algorithm coping with this excessive buffer requirement under bandwidth congestioon. We argue that in a large scale continuous media server, it may not be necessary to read the blocks for each session directly from the disk. The beauty of our work lies in the fact that it dynamically adapts to disk utilization of the server and finds the optimal way of servicinh the individual sessions while minimizing the overall buffer space requirement. Optimality of the proposed algorithm is shown by proof. The effectiveness and performance of the proposed scheme is examined via simulation.

• Journal of KIISE:Information Networking
• /
• v.33 no.2
• /
• pp.175-182
• /
• 2006

The CGA proposed by IETF working group prevents address spoofing and stealing and provides digital signature to users, but key collision problem arises. To solve this critical problem, the CGA defines the SEC field within address format, which is set to high value when high security is required and vice versa, but the CGA faces a dilemma between security and the processing time. As SEC value increases, the processing time to generate the CGA grows dramatically while key collision ratio increases if low SEC value is applied to the CGA. We propose modified CGA (MCGA) that has shorter processing time than the CGA and offers digital signature with small overheads. To solve key collision problem, we employ hierarchical ad hoc network. The MCGA is applicable to IPv6 networks as well public networks. In this paper, we design a mathematical model to analyze the processing time for MCGA and CGA first and evaluate the processing time via simulations, where the processing time for MCGA is reduced down 3.3 times when SEC value is set to 0 and 68,000 times when SEC value is set to 1. Further, we have proved that the CGA is inappropriate for both ad hoc networks and IPv6 networks when the SEC field is set to more than 3.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.12
• /
• pp.708-713
• /
• 2003

For many years clustered heterogeneous web server architecture has been formed on the internet because the explosive internet services and the various quality of requests. The critical point in cluster environment is the mapping schemes of request to server. and recently this is the main issue of internet architecture. The topic of previous mapping methods is to assign equal loads to servers in cluster using the number of requests. But recent growth of various services makes it hard to depend on simple load balancing to satisfy appropriate latency. So mapping based on requested content to decrease response time and to increase cache hit rates on entire servers - so called “content-based” mapping is highly valuated on the internet recently. This paper proposes Prioritized Highest Random Weight mapping(PHRW mapping) that improves content-based mapping to properly fit in the heterogeneous environment. This mapping scheme that assigns requests to the servers with priority, is very effective on heterogeneous web server cluster, especially effective on decreasing latency of reactive data service which has limit on latency. This paper have proved through algorithm and simulation that proposed PHRW mapping show higher-performance by decrease in latency.