• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.12 no.7
• /
• pp.1218-1226
• /
• 2008

With the development of semiconductor integrated technology and with the increasing use of multimedia functions in computer, more functions have been implemented as hardware. Nowadays, most microprocessors beyond 32 bits generally implement an integer multiplier as hardware. However, as for a divider, only specific microprocessor implements traditional SRT algorithm as hardware due to complexity of implementation and slow speed. This paper suggested an algorithm that uses a multiplier, 'w bit $\times$ w bit = 2w bit', to process $\frac{N}{D}$ integer division. That is, the reciprocal number D is first calculated, and then multiply dividend N to process integer division. In this paper, when the divisor D is '$D=0.d{\times}2^L$, 0.5 < 0.d < 1.0', approximate value of ' $\frac{1}{D}$', '$1.g{\times}2^{-L}$', which satisfies ' $0.d{\times}1.g=1+e$, $e<2^{-w}$', is defined as over reciprocal number and then an algorithm for over reciprocal number is suggested. This algorithm multiplies over reciprocal number '$01.g{\times}2^{-L}$' by dividend N to process $\frac{N}{D}$ integer division. The algorithm suggested in this paper doesn't require additional revision, because it can calculate correct reciprocal number. In addition, this algorithm uses only multiplier, so additional hardware for division is not required to implement microprocessor. Also, it shows faster speed than the conventional SRT algorithm and performs operation by word unit, accordingly it is more suitable to make compiler than the existing division algorithm. In conclusion, results from this study could be used widely for implementation SOC(System on Chip) and etc. which has been restricted to microprocessor and size of the hardware.

• Journal of The Korean Association For Science Education
• /
• v.22 no.4
• /
• pp.779-795
• /
• 2002

Internet, a world wide network of computers, is considered as a sea of information because it allows people to share information beyond the barriors of time and space. However, in spite of the unmeasurable potential applications of the internet, its use in the field of biology education has been extremely limited mainly due to the scarcity of good biology-related sites. In order to provide useful guidelines for constructing user-friendly study sites, which can help high school students with different intellectual levels to study biology, comparative studies were performed on selected educational sites. Initially, hundreds of related sites were examined, and, subsequently, four distinct sites were selected not only because they are well organized, but also because each is unique in its contents. Also, a survey was carried out against the users of each site. The survey results indicated that the high school students regard the web-based biology study tools as effective teaching methods although there might be some bias in criteria for selecting target sites. In addition to the detailed biology topics and the related biology informations, multimedia data including pictures, animations and movies are found to be one of the important ingredients for desirable biology study sites. Thus, the inclusion of multimedia components should also be considered when developing a systematic biology study site. Overall, the role of the cyber space is expected to become more and more important. Since the development of the user-satisfied and self-guided sites require interdisciplinary collaborational efforts which should be made to promote extensive communication among teachers, education professionals, and computer engineers. Furthermore, the introduction of good biology study sites to the students by their teachers is also important factor for the successful web-based education.

• Korean Journal of Agricultural and Forest Meteorology
• /
• v.8 no.1
• /
• pp.36-44
• /
• 2006

In this study, we constructed a forest fire danger map in the Yeongdong area of Gangwon-do and Northeastern area of Gyeongsangbuk-do using a forest fire rating model and geographical information system (GIS). We investigated the appropriate positions of the automatic weather station (AWS) and a comprehensive network solution (a system including measurement, communication and data processing) for the establishment of an optimum mountain meteorological observation network system (MMONS). Also, we suggested a possible plan for combining the MMONS with unmanned monitoring camera systems and wireless relay towers operated by local governments and the Korea Forest Service for prevention of forest fire.

• The KIPS Transactions:PartA
• /
• v.8A no.4
• /
• pp.469-478
• /
• 2001

In the virtual memory system, page replacement policy exerts a great influence on the performance of demand paging. There are LRU(Least Recently Used) and LFU (Least Frequently Used) as the typical replacement policies. The LRU policy performs effectively in many cases and adapts well to the changing workloads compared to other policies. It however cannot distinguish well between frequently and infrequently referenced pages. The LFU policy requires that the page with the smallest reference count be replaced. Though it considers all the references in the past, it cannot discriminate between references that occurred far back in the past and the more recent ones. Thus, it cannot adapt well to the changing workload. In this paper, we first analyze memory reference patterns of eight applications. The patterns show that the recently referenced pages or the frequently referenced pages are accessed continuously as the case may be. So it is rather hard to optimize page replacement scheme by using just one of the LRU or LFU policy. This paper makes an attempt to combine the advantages of the two policies and proposes a new page replacement policy. In the proposed policy, paging list is divided into two lists (LRU and LFU lists). By keeping the two lists in recency and reference frequency order respectively, we try to restrain the highly referenced pages in the past from being replaced by the LRU policy. Results from trace-driven simulations show that there exists points on the spectrum at which the proposed policy performs better than the previously known policies for the workloads we considered. Especially, we can see that our policy outperforms the existing ones in such applications that have reference patterns of re-accessing the frequently referenced pages in the past after some time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.8B
• /
• pp.691-700
• /
• 2006

Based on the destination IP address of incoming packets, the Internet routers determine next hops and forward packets toward final destinations through If address lookup. The bandwidth of communication links increases exponentially fast as well as the routing table size grows significant as the number of single host networks attached to the Internet increases. Since packets should be processed at wire-speed, the increased link speed reduces the processing time of a packet in routers, and hence more efficient and fast IP address lookup algorithms and architectures are required in the next generation routers. Most of the previous IP lookup schemes compare routing prefixes of shorter length first with a given input IP address. Since IP address lookup needs to find the most specific route of the given input, search continues until the longest matched prefix is found while it keeps remembering the current test matching prefix. In this paper, based on binary search on prefix length, we proposed a new IP address lookup algorithm which compares longer prefixes first. The proposed scheme is consisted of multiple tries with prefixes on leaves only. The trie composed of the longest prefixes is primarily searched whether there is a match with the given input. This processing is repeated for the trio of the next longer prefixes until there finds a match. Hence the proposed algorithm provides the fast search speed. The proposed algorithm also provides the incremental update of prefixes while the previous binary search on length scheme does not provide the incremental update because of pre-processing requirement. In this paper, we performed extensive simulations and showed the performance comparisons with related works.

• Journal of Global Scholars of Marketing Science
• /
• v.20 no.2
• /
• pp.188-198
• /
• 2010

This study attempts to examine the influence that negative WOM (NWOM) has in an online context. It specifically focuses on the impact of the service failure description and the perceived intention of the communication provider on consumer evaluations of firm competence, attitude toward the firm, positive word of mouth and behavioral intentions. Studies of communication persuasiveness focus on "who says what; to whom; in which channel; with what effect (Chiu 2007)." In this research study, we examine electronic web posting, particularly focusing on two aspects of "what": the level of service failure communicated and perceived intention of the individual posting. It stands to reason electronic NWOM that appears to be trying to damage a product’s or firm's reputation will be viewed as more biased and will thus be considered as less credible. According to attribution theory, people search for the causes of events especially those that are negative and unexpected (Weiner 2006). Hennig-Thurau and Walsh (2003) state "since the reader has only limited knowledge and trust of the author of an online articulation the quality of the contribution could be expected to serve as a potent moderator of the articulation-behavior relationship. We therefore posit the following hypotheses: H1. Subjects exposed to electronic NWOM describing a high level of service failure will provide lower scores on measures of (a) firm competence, (b) attitude toward the firm, (c) positive word of mouth, and (d) behavioral intention than will subjects exposed to electronic NWOM describing a low level of service failure. H2. Subjects exposed to electronic NWOM with a warning intent will provide lower scores on measures of (a) firm competence, (b) attitude toward the firm, (c) positive word of mouth, and (d) behavioral intention than will subjects exposed to electronic NWOM with a vengeful intent. H3. Level of service failure in electronic NWOM will interact with the perceived intention of the electronic NWOM, such that there will be a decrease in mean response on measures of (a) firm competence, (b) attitude toward the firm, (c) positive word of mouth, and (d) behavioral intention from electronic NWOM with a warning intent to a vengeful intent. The main study involved a2 (service failure severity) x2 (NWOM with warning versus vengeful intent) factorial experiment. Stimuli were presented to subjects online using a mock online web posting. The scenario described a service failure associated with non-acceptance of a gift card in a brick-and-mortar retail establishment. A national sample was recruited through an online research firm. A total of 113 subjects participated in the study. A total of 104 surveys were analyzed. The scenario was perceived to be realistic with 92.3% giving the scenario a greater than average response. Manipulations were satisfactory. Measures were pre-tested and validated. Items were analyzed and found reliable and valid. MANOVA results found the multivariate interaction was not significant, allowing our interpretation to proceed to the main effects. Significant main effects were found for post intent and service failure severity. The post intent main effect was attributable to attitude toward the firm, positive word of mouth and behavioral intention. The service failure severity main effect was attributable to all four dependent variables: firm competence, attitude toward the firm, positive word of mouth and behavioral intention. Specifically, firm competence for electronic NWOM describing high severity of service failure was lower than electronic NWOM describing low severity of service failure. Attitude toward the firm for electronic NWOM describing high severity of service failure was lower than electronic NWOM describing low severity of service failure. Positive word of mouth for electronic NWOM describing high severity of service failure was lower than electronic NWOM describing low severity of service failure. Behavioral intention for electronic NWOM describing high severity of service failure was lower for electronic NWOM describing low severity of service failure. Therefore, H1a, H1b, H1c and H1d were all supported. In addition, attitude toward the firm for electronic NWOM with a warning intent was lower than electronic NWOM with a vengeful intent. Positive word of mouth for electronic NWOM with a warning intent was lower than electronic NWOM with a vengeful intent. Behavioral intention for electronic NWOM with a warning intent was lower than electronic NWOM with a vengeful intent. Thus, H2b, H2c and H2d were supported. However, H2a was not supported though results were in the hypothesized direction. Otherwise, there was no significant multivariate service failure severity by post intent interaction, nor was there a significant univariate service failure severity by post intent interaction for any of the three hypothesized variables. Thus, H3 was not supported for any of the four hypothesized variables. This study has research and managerial implications. The findings of this study support prior research that service failure severity impacts consumer perceptions, attitude, positive word of mouth and behavioral intentions (Weun et al. 2004). Of further relevance, this response is evidenced in the online context, suggesting the need for firms to engage in serious focused service recovery efforts. With respect to perceived intention of electronic NWOM, the findings support prior research suggesting reader's attributions of the intentions of a source influence the strength of its impact on perceptions, attitude, positive word of mouth and behavioral intentions. The implication for managers suggests while consumers do find online communications to be credible and influential, not all communications are weighted the same. A benefit of electronic WOM, even when it may be potentially damaging, is it can be monitored for potential problems and additionally offers the possibility of redress.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.625-634
• /
• 2003

More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.2
• /
• pp.380-389
• /
• 2005

The Goldschmidt iterative algorithm for a floating point divide calculates it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's divide algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To calculate a floating point divide '$\frac{N}{F}$', multifly '$T=\frac{1}{F}+e_t$' to the denominator and the nominator, then it becomes ’$\frac{TN}{TF}=\frac{N_0}{F_0}$'. And the algorithm repeats the following operations: ’$R_i=(2-e_r-F_i),\;N_{i+1}=N_i{\ast}R_i,\;F_{i+1}=F_i{\ast}R_i$, i$\in${0,1,...n-1}'. The bits to the right of p fractional bits in intermediate multiplication results are truncated, and this truncation error is less than ‘$e_r=2^{-p}$'. The value of p is 29 for the single precision floating point, and 59 for the double precision floating point. Let ’$F_i=1+e_i$', there is $F_{i+1}=1-e_{i+1},\;e_{i+1}',\;where\;e_{i+1}, If '$[F_i-1]<2^{\frac{-p+3}{2}}$ is true, ’$e_{i+1}<16e_r$' is less than the smallest number which is representable by floating point number. So, ‘$N_{i+1}$ is approximate to ‘$\frac{N}{F}$'. Since the number of multiplications performed by the proposed algorithm is dependent on the input values, the average number of multiplications per an operation is derived from many reciprocal tables ($T=\frac{1}{F}+e_t$) with varying sizes. 1'he superiority of this algorithm is proved by comparing this average number with the fixed number of multiplications of the conventional algorithm. Since the proposed algorithm only performs the multiplications until the error gets smaller than a given value, it can be used to improve the performance of a divider. Also, it can be used to construct optimized approximate reciprocal tables. The results of this paper can be applied to many areas that utilize floating point numbers, such as digital signal processing, computer graphics, multimedia, scientific computing, etc

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.3
• /
• pp.645-653
• /
• 2011

The aim of this study was to develop a Pulsed Magnetic Fields(PMFs) system which can produce effects locally and simulate muscular tissues equally. To evaluate the PMFs system we caused DOMS(Delayed Onset Muscle Soreness) to subjects in biceps of the arm. Then, we stimulated acupoint HT2 using PMFs(20 minutes) and TEAS(20 minutes) for 2 days. The other subjects did not stimulate. Then we checked body surface temperature in biceps of the arm. All subjects had an asymmetrical body surface temperature in biceps after exercise(Non-stimulation group=$2.00{\pm}1.16^{\circ}C$, TEAS group=$1.73{\pm}0.52^{\circ}C$, PMFs group=$1.48{\pm}0.51^{\circ}C$). After 1st stimulation all subjects had decreased temperature differences(Non-stimulation group=$1.37{\pm}0.71^{\circ}C$, TEAS group=$1.08{\pm}0.43^{\circ}C$, PMFs group=$1.23{\pm}0.15^{\circ}C$). PMFs group had a symmetry body surface temperature after 24 hours($0.05{\pm}0.06^{\circ}C$) and TEAS group had that after 48 hours($0.1{\pm}0.08^{\circ}C$). Non-stimulation group did not recovery after 48 hours($0.37{\pm}0.06^{\circ}C$). Therefore, PMFs on acupoint had an therapeutic effect in DOMS.

• Journal of Intelligence and Information Systems
• /
• v.22 no.1
• /
• pp.19-41
• /
• 2016

Recently, the proliferation of mobile devices such as smartphones and tablet personal computers and the development of information communication technologies (ICT) have led to a big trend of a shift from single-channel shopping to multi-channel shopping. With the emergence of a "smart" group of consumers who want to shop in more reasonable and convenient ways, the boundaries apparently dividing online and offline shopping have collapsed and blurred more than ever before. Thus, there is now fierce competition between online and offline channels. Ever since the emergence of online shopping, a major type of multi-channel shopping has been "showrooming," where consumers visit offline stores to examine products before buying them online. However, because of the growing use of smart devices and the counterattack of offline retailers represented by omni-channel marketing strategies, one of the latest huge trends of shopping is "webrooming," where consumers visit online stores to examine products before buying them offline. This has become a threat to online retailers. In this situation, although it is very important to examine the influencing factors for switching from online shopping to webrooming, most prior studies have mainly focused on a single- or multi-channel shopping pattern. Therefore, this study thoroughly investigated the influencing factors on customers switching from online shopping to webrooming in terms of both the "search" and "purchase" processes through the application of a push-pull-mooring (PPM) framework. In order to test the research model, 280 individual samples were gathered from undergraduate and graduate students who had actual experience with webrooming. The results of the structural equation model (SEM) test revealed that the "pull" effect is strongest on the webrooming intention rather than the "push" or "mooring" effects. This proves a significant relationship between "attractiveness of webrooming" and "webrooming intention." In addition, the results showed that both the "perceived risk of online search" and "perceived risk of online purchase" significantly affect "distrust of online shopping." Similarly, both "perceived benefit of multi-channel search" and "perceived benefit of offline purchase" were found to have significant effects on "attractiveness of webrooming" were also found. Furthermore, the results indicated that "online purchase habit" is the only influencing factor that leads to "online shopping lock-in." The theoretical implications of the study are as follows. First, by examining the multi-channel shopping phenomenon from the perspective of "shopping switching" from online shopping to webrooming, this study complements the limits of the "channel switching" perspective, represented by multi-channel freeriding studies that merely focused on customers' channel switching behaviors from one to another. While extant studies with a channel switching perspective have focused on only one type of multi-channel shopping, where consumers just move from one particular channel to different channels, a study with a shopping switching perspective has the advantage of comprehensively investigating how consumers choose and navigate among diverse types of single- or multi-channel shopping alternatives. In this study, only limited shopping switching behavior from online shopping to webrooming was examined; however, the results should explain various phenomena in a more comprehensive manner from the perspective of shopping switching. Second, this study extends the scope of application of the push-pull-mooring framework, which is quite commonly used in marketing research to explain consumers' product switching behaviors. Through the application of this framework, it is hoped that more diverse shopping switching behaviors can be examined in future research. This study can serve a stepping stone for future studies. One of the most important practical implications of the study is that it may help single- and multi-channel retailers develop more specific customer strategies by revealing the influencing factors of webrooming intention from online shopping. For example, online single-channel retailers can ease the distrust of online shopping to prevent consumers from churning by reducing the perceived risk in terms of online search and purchase. On the other hand, offline retailers can develop specific strategies to increase the attractiveness of webrooming by letting customers perceive the benefits of multi-channel search or offline purchase. Although this study focused only on customers switching from online shopping to webrooming, the results can be expanded to various types of shopping switching behaviors embedded in single- and multi-channel shopping environments, such as showrooming and mobile shopping.