• Journal of Oral Medicine and Pain
• /
• v.30 no.4
• /
• pp.391-400
• /
• 2005

Special Practitioner exists based on the need for special fields that are required to manage difficult patients with specialized skills distinguished from General practitioner. The purpose of dental specialist system is to manage patients who are not treatable by general practitioner by training doctors specializing in one specific field, thereby, enhancing health of the public. Oral Medicine deals with orofacial pain, oral soft tissue disease, forensic dentistry, oral diagnosis. In these days, living environments of city life bring about increase in stress which ultimately lead to increase in prevalence of temporomandibular disorder, oral soft tissue disease, neuropathies such as trigeminal neuralgia, and hence, the number of patients seeking help of those symptoms tend to increase. The purpose of this study was to analyze the rate of referrals and the routes of patients seeking help by investigating 3,707 patients who visited Department of Oral Medicine, College of Dentistry, Yonsei University, from August, 2004 to April, 2005. The results were as follows: 1. The types of disease referred to the Department of Oral Medicine were orofacial pain, oral soft tissue disease, forensic dentistry, oral diagnosis. 2. The rate of referrals was 58.51% which implies that more than half of the patients visiting the Department of Oral Medicine were referred. 3. The types of institution which made referrals were analyzed, and as a result, dental clinics made most of the referrals with the rate of 83.23%, while that from medical or oriental medical institutions was 16.78%. 4. Among the patients who visited the Department of Oral Medicine on their own, 30.52% gained the information about the Department of Oral Medicine from internet and mass media, and from neighbors. From the above results, most of the patients visiting the Department of Oral Medicine were found to be referred not only from the field of dentistry but also from the field of medicine. These suggest that Oral Medicine manages patients who are not treatable by general dental practitioners, and medical specialists tend to cooperate with the Department of Oral Medicine to manage diseases associated with Oral Medicine. Therefore, the role of Oral Medicine can be considered to be important as a special field, and the results of this study should be considered when working out a policy of Dental specialist system on demand and supply of residents in the future.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.1
• /
• pp.188-198
• /
• 2005

The Goldschmidt iterative algorithm for finding a floating point square root calculated it by performing a fixed number of multiplications. In this paper, a variable latency Goldschmidt's square root algorithm is proposed, that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the square root of a floating point number F, the algorithm repeats the following operations: $R_i=\frac{3-e_r-X_i}{2},\;X_{i+1}=X_i{\times}R^2_i,\;Y_{i+1}=Y_i{\times}R_i,\;i{\in}\{{0,1,2,{\ldots},n-1} }}'$with the initial value is $'\;X_0=Y_0=T^2{\times}F,\;T=\frac{1}{\sqrt {F}}+e_t\;'$. 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 28 for the single precision floating point, and 58 for the doubel precision floating point. Let $'X_i=1{\pm}e_i'$, there is $'\;X_{i+1}=1-e_{i+1},\;where\;'\;e_{i+1}<\frac{3e^2_i}{4}{\mp}\frac{e^3_i}{4}+4e_{r}'$. If '|X_i-1|<2^{\frac{-p+2}{2}}\;'$ is true, $'\;e_{i+1}<8e_r\;'$ is less than the smallest number which is representable by floating point number. So, $\sqrt{F}$ is approximate to $'\;\frac{Y_{i+1}}{T}\;'$. 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 square root tables ($T=\frac{1}{\sqrt{F}}+e_i$) with varying sizes. The 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 square root unit. Also, it can be used to construct optimized approximate reciprocal square root 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 Distribution Science
• /
• v.10 no.2
• /
• pp.19-28
• /
• 2012

Rapidly growing sales amount and the number of discount stores caused many side effects and sensitive issues in Korea. Because these severe competition due to more expensive cost just like excessive increase in advertising and location selection, and these caused completely ruined small merchants as well as passed on to the consumer. This Study focused on competitiveness of discount store in Korea to the perspective of college students, as explored the relationships between marketing communication and store loyalty. And, examined for two moderating effect, 1) consumers' value separated by hedonic value and utilitarian value between marketing communication and store loyalty, and 2) consumers' value separated by hedonic value and utilitarian value between marketing communication and consumption emotion. Finally, this study examined for mediating effect of consumption emotion between marketing communication and store loyalty. In order to verify the relationship, moderating and mediating effects, data were collected from 130 college students in Whasung, Gyeonggi Province to test theoretical model and its hypotheses. Findings are as followed : First, analysis showed that factors such as advertisement(β =.221, p<.05), publicity(β =.513, p<.01), sales promotion(β =.234, p<.01), word of mouth(β =.627, p<.01) and physical environment(β =.339, p<.01) for marketing communication in the discount store have statistically significant positive effect on store loyalty. But the result of regression analysis for which factors are more impact in marketing communication between store loyalty showed that word of mouth(β =.53, p<.01) is only statistically significant. Second, publicity(β =-.895, p<.05), the sub-dimension of marketing communication shows only statistically significant negative moderating effect on store loyalty. But, the results of the moderating effect of value between marketing communication and consumption emotion verified that utilitarian value show statistically significant, specifically advertisement(β =.294, p<.01), physical environment(β =.418, p<.01), sales promotion(β =.245, p<.01), word of mouth(β =.414, p<.01) and publicity(β =1.137, p<.05), respectively. And hedonic value show statistically significant, specifically advertisement(β =.286, p<.01), physical environment (β =.418, p<.01), sales promotion(β =.236, p<.01) and word of mouth(β =.420, p<.01), respectively. But publicity(β =.145, p=.119) is not statistically significant. Finally, the results verified mediating effect for consumption emotion between all factors for marketing communication and store loyalty showed that factors such as advertisement, publicity, word of mouth and physical environment for marketing communication except sales promotion were statistically significant fully mediated in advertisement, and partially mediated in publicity, word of mouth and physical environment. This testified that the consumption emotion had the most important factor to enhance store loyalty to the perspective of College students. These results can provide important implications and invaluable tips for planning marketing strategies and gaining access to new potential customers. Implications and future research directions are also discussed.

• 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

• The KIPS Transactions:PartA
• /
• v.12A no.5 s.95
• /
• pp.413-420
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal square mot calculates it by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal square root algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the rediprocal square root of a floating point number F, the algorithm repeats the following operations: '$X_{i+1}=\frac{{X_i}(3-e_r-{FX_i}^2)}{2}$, $i\in{0,1,2,{\ldots}n-1}$' with the initial value is '$X_0=\frac{1}{\sqrt{F}}{\pm}e_0$'. 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 28 for the single precision floating point, and 58 for the double precision floating point. Let '$X_i=\frac{1}{\sqrt{F}}{\pm}e_i$, there is '$X_{i+1}=\frac{1}{\sqrt{F}}-e_{i+1}$, where '$e_{i+1}{<}\frac{3{\sqrt{F}}{{e_i}^2}}{2}{\mp}\frac{{Fe_i}^3}{2}+2e_r$'. If '$|\frac{\sqrt{3-e_r-{FX_i}^2}}{2}-1|<2^{\frac{\sqrt{-p}{2}}}$' is true, '$e_{i+1}<8e_r$' is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to '$\frac{1}{\sqrt{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 square root tables ($X_0=\frac{1}{\sqrt{F}}{\pm}e_0$) with varying sizes. The 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 reciprocal square root unit. Also, it can be used to construct optimized approximate reciprocal square root 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.

• The KIPS Transactions:PartA
• /
• v.12A no.2 s.92
• /
• pp.95-102
• /
• 2005

The Newton-Raphson iterative algorithm for finding a floating point reciprocal which is widely used for a floating point division, calculates the reciprocal by performing a fixed number of multiplications. In this paper, a variable latency Newton-Raphson's reciprocal algorithm is proposed that performs multiplications a variable number of times until the error becomes smaller than a given value. To find the reciprocal of a floating point number F, the algorithm repeats the following operations: '$'X_{i+1}=X=X_i*(2-e_r-F*X_i),\;i\in\{0,\;1,\;2,...n-1\}'$ with the initial value $'X_0=\frac{1}{F}{\pm}e_0'$. 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 27 for the single precision floating point, and 57 for the double precision floating point. Let $'X_i=\frac{1}{F}+e_i{'}$, these is $'X_{i+1}=\frac{1}{F}-e_{i+1},\;where\;{'}e_{i+1}, is less than the smallest number which is representable by floating point number. So, $X_{i+1}$ is approximate to $'\frac{1}{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 $(X_0=\frac{1}{F}{\pm}e_0)$ with varying sizes. The 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 reciprocal unit. 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 Korean Society for information Management
• /
• v.38 no.3
• /
• pp.23-39
• /
• 2021

This study aims to explore research trends in Blockchain studies in South Korea using dynamic topic modeling and network analysis. To achieve this goal, we conducted the university & institute collaboration network analysis, the keyword co-occurrence network analysis, and times series topic analysis using dynamic topic modeling. Through the university & institute collaboration network analysis, we found major universities such as Soongsil University, Soonchunhyang University, Korea University, Korea Advanced Institute of Science and Technology (KAIST) and major institutes such as Ministry of National Defense, Korea Railroad Research Institute, Samil PricewaterhouseCoopers, Electronics and Telecommunications Research Institute that led collaborative research. Next, through the analysis of the keyword co-occurrence network, we found major research keywords including virtual assets (Cryptocurrency, Bitcoin, Ethereum, Virtual currency), blockchain technology (Distributed ledger, Distributed ledger technology), finance (Smart contract), and information security (Security, privacy, Personal information). Smart contracts showed the highest scores in all network centrality measures showing its importance in the field. Finally, through the time series topic analysis, we identified five major topics including blockchain technology, blockchain ecosystem, blockchain application 1 (trade, online voting, real estate), blockchain application 2 (food, tourism, distribution, media), and blockchain application 3 (economy, finance). Changes of topics were also investigated by exploring proportions of representative keywords for each topic. The study is the first of its kind to attempt to conduct university & institute collaboration networks analysis and dynamic topic modeling-based times series topic analysis for exploring research trends in Blockchain studies in South Korea. Our results can be used by government agencies, universities, and research institutes to develop effective strategies of promoting university & institutes collaboration and interdisciplinary research in the field.

• The Korean Journal of Archival Studies
• /
• no.42
• /
• pp.135-183
• /
• 2014

Korea has a high standard of IT environment to serve exhibit programs through the web with internet propagation and IT technology. However, the web exhibition of public institutions not only seem to introduce off-line exhibitions but also not to invigorate. It is caused by the lack of awareness, the cost of system installation and the lack of professional manpower. In this situation, OMEKA could suggest practical solutions to archives where need their own exhibition through the web. Especially, it would helpful for small record management organizations which are not enough budget and personal. OMEKA is an open source software program for digital collection and contents management. It has an affinity with users unlike traditional archives service programs. It also has been variously used by libraries, museums and schools because of exceptional exhibit functions. In this article, we introduce to the installation of a practical use about OMEKA. Regarding to OMEKA features, we consider it to raise exhibit effects. OMEKA would reduce the cost related to plans of exhibitions because it could display various contents and programs which reflecting characteristics of institutions. In addition, the availability of installation and widespread technological environment would lessen burden of public institutions. Using OMEKA, they would improve service level of public institutions and, make users satisfy. Therefore, they can change the social recognition of public institutions. OMEKA can contribute to various exercises of public records. It is not just the stereotypical system but, serves exhibition and collections with the strategy which each public institution would like to display. After all, it not only to connect to users with producers but also to improve the public image of institutions positively. Then, OMEKA would bring the great result through this interaction between public institutions and users.

• Asia-Pacific Journal of Business Venturing and Entrepreneurship
• /
• v.16 no.5
• /
• pp.159-175
• /
• 2021

This study attempted to analyze the relationship between influencer's characteristic factors such as professionalism, authenticity, and interactivity and content quality factors consisting of accuracy, completeness, and diversity on brand attitude and purchase attitude through trust and self-consistency. To reveal the structural relationship between main variables, a survey was conducted on 201 users. An EFA, CFA, and reliability analysis were performed to confirm reliability and validity. And structural equation was conducted to verify hypothesis. The main results are as follows. First, it was found that professionalism and interactivity had a significant positive effect on trust. And, accuracy, completeness, and variety were all found to have a significant positive effect on trust. Second, in the relationship between individual characteristic factors and self-consistency, it was found that professionalism and authenticity had a significant positive effect on self-consistency. In addition, in the relationship between content quality and self-consistency, accuracy, completeness, and diversity were found to have a positive effect on self-consistency along with trust. Third, in the relationship between trust and self-consistency on brand attitude and purchase intention, both trust and self-consistency were found to have a statistically significant positive effect on brand attitude. It was found that only self-consistency and brand attitude had a statistically significant positive effect on purchase intention. These findings showed that when users perceive professionalism and interaction with influencer, trust increases, and professionalism and progress increase self-consistency with influencer. In addition, in the case of content quality, it was found that trust and self-consistency responded positively when perceived content quality through content accuracy, completeness, and diversity. Also, trust and self-consistency increased attitudes toward brands and could influence consumption behavior such as purchase intention. Therefore, for effective marketing performance using influencer's influence in the field of influencer marketing, which has a strong information delivery on products and brands, not only personal characteristics such as professionalism, authenticity, and interactivity, but also quality of content should be considered. The above research results are expected to suggest implications for marketing strategies and practices as one available basic data to exert the expected effect of marketing using influencer.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.9 no.6
• /
• pp.757-772
• /
• 2019

The purpose of this paper is to measure the clustering change and analyze empirical results, and choose the clustering ports for Busan, Incheon, and Gwangyang ports by using Artificial Neural Network, Social Network, and Tabu Search models on 38 Asian container ports over the period 2007-2016. The models consider number of cranes, depth, birth length, and total area as inputs and container throughput as output. Followings are the main empirical results. First, the variables ranking order which affects the clustering according to artificial neural network are TEU, birth length, depth, total area, and number of cranes. Second, social network analysis shows the same clustering in the benevolent and aggressive models. Third, the efficiency of domestic ports are worsened after clustering using social network analysis and tabu search models. Forth, social network and tabu search models can increase the efficiency by 37% compared to that of the general CCR model. Fifth, according to the social network analysis and tabu search models, 3 Korean ports could be clustered with Asian ports like Busan Port(Kobe, Osaka, Port Klang, Tanjung Pelepas, and Manila), Incheon Port(Shahid Rajaee, and Gwangyang), and Gwangyang Port(Aqaba, Port Sulatan Qaboos, Dammam, Khor Fakkan, and Incheon). Korean seaport authority should introduce port improvement plans by using the methods used in this paper.