Due to the recent advancement in digital imaging technology, development of intervention equipment has become generalize. Video arbitration procedure is a process to insert a tiny catheter and a guide wire in the body, so in order to enhance the effectiveness and safety of this treatment, the high-quality of x-ray of image should be used. However, the increasing of radiation has become the problem. Therefore, the studies to improve the performance of x-ray detectors are being actively processed. Moreover, this intervention is based on the reference of the angiographic imaging and 3D medical image processing. In this paper, we propose a guidance system to support this intervention. Through this intervention, it can solve the problem of the existing 2D medical images based vessel that has a formation of cerebrovascular disease, and guide the real-time tracking and optimal route to the target lesion by intervention catheter and guide wire tool. As a result, the system was completely composed for medical image acquisition unit and image processing unit as well as a display device. The experimental environment, guide services which are provided by the proposed system Brain Phantom (complete intracranial model with aneurysms, ref H+N-S-A-010) was taken with x-ray and testing. To generate a reference image based on the Laplacian algorithm for the image processing which derived from the cerebral blood vessel model was applied to DICOM by Volume ray casting technique. $A^*$ algorithm was used to provide the catheter with a guide wire tracking path. Finally, the result does show the location of the catheter and guide wire providing in the proposed system especially, it is expected to provide a useful guide for future intervention service.
Ki, Myungseok;Seok, Jinwuk;Beack, Seungkwon;Jang, Daeyoung;Lee, Taejin;Kim, Hui Yong;Oh, Hyeju;Lim, Bo-mi;Bae, Byungjun;Kim, Heung Mook;Choi, Jin Soo
Journal of Broadcast Engineering
/
v.22
no.6
/
pp.829-849
/
2017
Due to the large-scale TV display, the convergence of broadcasting and broadband, and the advancement of signal compression and transmission technology, terrestrial digital broadcasting has evolved into UHD broadcasting capable of providing simultaneous broadcasting of fixed UHD and mobile HD. The Korean standard for terrestrial UHDTV broadcasting is based on ATSC 3.0, the broadcasting standard of North America. The terrestrial UHDTV broadcasting standard chose that as a new AV codec standard, HEVC video codec which can compress with higher efficiency compared to AVC, and MPEG-H 3D audio codec for realistic audio. Also, DASH and MMT are adopted as transmission format instead of MPEG-2 TS to support broadband as well as broadcasting network, and in order to provide 4K UHD/mobile HD service simultaneously ROUTE multiplexing technology is applied. In this paper, we propose an audio/video encoder, which is required to provide HDR/WCG supported high quality video service, 10.2 channel/4 object supporting stereo sound service, fixed UHD and mobile HD simultaneous broadcasting service based on ATSC3.0, also we implemented the ATSC 3.0 LDM system for ROUTE/DASH packager, multiplexing system and physical layer transmission/reception, and verified the service ability by applying it to real time broadcast environment.
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 the Korean Institute of Landscape Architecture
/
v.36
no.3
/
pp.63-74
/
2008
With the awareness that Sinyeongwol Sipgyeong(ten scenic spots in Yeongwol) were designed too hastily and only for PR purposes after the change in the tourism environment, this paper indicates that most tourism and culture sources in Yeongwol are related to King Danjong, the sixth king of the Joseon Dynasty. This study proposes a 'Storytelling Plan' for the landscape content called 'Cultural Landscapes - Yeongwol Palgyeong(eight scenic spots in Yeongwol)' after reviewing types and content of Yeongwol Palgyeong through the halo effect of the well-known sad history of King Danjong and the cultural value of Yeongwol. The significance of the unity of the historic site and neighboring landscape is focused on by investigating the anaphoric relations between cultural landscape texts('Yeongwol Palgyeong') and historic content(the sad history of King Danjong). For this, the cultural lnddscape of Yeongwol has been framed and layered to make spatial texts. To emphasize the 'Telling' as well as the 'Story,' interesting episodes have been reviewed to discover a motive. To diversify the 'Telling' methods, absorptive landscape factors have been classified as 'Place,' 'Object' and 'Visual Point.' In addition the storytelling of Yeongwol Palgyeong was examined in consideration of the story and background of 'Yeongwol Palgyeong - Sad Story of King Danjong' and the interaction of a variety of cultural content by suggesting micro-content such as infotainment and edutainment as absorptive landscape factors. In order to make the storytelling plan available in practice as an alternative plan for Yeongwol Tourism, a visual point should be properly set to make the landscape look sufficiently dynamic. In addition, real landscape routes and narration scenarios should be prepared as well. Professional landscape interpreters who are well informed of the natural features of Yeongwol and the history of King Danjong should be brought into the project, and Internet and digital technology-based strategies should be developed.
Journal of the Korea Institute of Information and Communication Engineering
/
v.10
no.10
/
pp.1737-1743
/
2006
OCR(On channel repeater) provides the high frequency reuse efficiency for allocating frequency bands to repeaters because the frequency of input and output signals of OCRs is the same. However the oscillation probability of OCRs is high due to the same input and output frequency. In order to prevent a repeater from oscillating, we must keep the antenna isolation higher than the gain of the repeater with a some margin. In this paper we simulated the effects of the amplitude, phase and time delay of feedback signals (m the characteristics of non-regeneration OCR. Simulation results show that the highest probability of oscillation is occurred when the gain of a repeater is the same value of the isolation. From the simulation results, we know that the phase of feedback signals can be adjusted to reduce the possibility of oscillation if a non-regeneration repeater has a narrow operation bandwidth or a signal bandwidth is narrow. As the time delay increases, the probability of oscillation and the fluctuation of gain over a certain frequency band increase also. The effects of the amplitude and phase of feedback signals on S/N of 8-VSB signal for generation and non-generation repeater were tested. The measured results show that the set-top can receive 8-VSB signal when the received signal power is $17{\sim}18dB$ higher than the noise power. When the isolation is almost same as the gain of the repeater, then the set-top can not receive 8-VSB signals due to the oscillation of the repeater. And the phase of feedback signals affects S/N at the output of the repeater when the isolation is $11.75{\sim}13.75dB$ larger than the gain of the repeater. In this case the set-top can not receive 8-VSB signal of at $48^{\circ}\;and\;347^{\circ}$ of the phase of feedback signals. However the phase of feedback signals can not affect the S/N of 8-VSB signals of the generation repeater because of the demodulation and modulation process of the generation repenter. The set-top can not receive 8-VSB signals when the amplitude of feedback signals is $12.6{\sim}13.6dB$ larger than the wanted signal power at the input port of the repeater. It's because that the amplitude of feedback signals saturates the front end of the repeater.
Kim Munjo;Im Jeongyeon;Kang Sanggil;Kim Munchrul;Kang Kyungok
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.
In the age of digital culture, TV broadcasting is exercising more influence as a information and communication medium compared to past. With the appearance of satellite broadcasting service in 2002, the broadcasting environment became a diversified field of local TV, cable TV, satellite, internet, etc. and created the time of multi-media and multi-channel. This ongoing change of broadcasting environment made the passive audience of the past, active image makers and new accepters, participants and users of communications, who know how to choose and use media as the active centerpiece, The active acceptor as the centerpiece of channel selections has become the center of the broadcasting, whereby they pick up and enjoy their favorite TV programs and came to remember the list of their favorite channels and zap them finally. In this point of spotting their favorite channels and improving the degree of recognition for the channels, the development of the noticeable brand for a particular program has made a great contribution. The aim of this study, therefore, is to recognize the factors, which are important in the habits of watching TV and to develop professional brands for TV broadcasting programs. The range of the survey for this study was home news programs and broadcasting stations abroad, which were on air from March to May in 2004. The focus of the survey was universal and professional news programs. Through this study, it was ascertained that, in the case of news, developing a brand for an anchor as well as for a professional brand of TV program could be an important element.
To enhance the competitive advantage in a constantly changing business environment, an enterprise management must make the right decision in many business activities based on both internal and external information. Thus, providing accurate information plays a prominent role in management's decision making. Intuitively, historical data can provide a feasible estimate through the forecasting models. Therefore, if the service department can estimate the service quantity for the next period, the service department can then effectively control the inventory of service related resources such as human, parts, and other facilities. In addition, the production department can make load map for improving its product quality. Therefore, obtaining an accurate service forecast most likely appears to be critical to manufacturing companies. Numerous investigations addressing this problem have generally employed statistical methods, such as regression or autoregressive and moving average simulation. However, these methods are only efficient for data with are seasonal or cyclical. If the data are influenced by the special characteristics of product, they are not feasible. In our research, we propose a forecasting framework that predicts service demand of manufacturing organization by combining Case-based reasoning (CBR) and leveraging an unsupervised artificial neural network based clustering analysis (i.e., Self-Organizing Maps; SOM). We believe that this is one of the first attempts at applying unsupervised artificial neural network-based machine-learning techniques in the service forecasting domain. Our proposed approach has several appealing features : (1) We applied CBR and SOM in a new forecasting domain such as service demand forecasting. (2) We proposed our combined approach between CBR and SOM in order to overcome limitations of traditional statistical forecasting methods and We have developed a service forecasting tool based on the proposed approach using an unsupervised artificial neural network and Case-based reasoning. In this research, we conducted an empirical study on a real digital TV manufacturer (i.e., Company A). In addition, we have empirically evaluated the proposed approach and tool using real sales and service related data from digital TV manufacturer. In our empirical experiments, we intend to explore the performance of our proposed service forecasting framework when compared to the performances predicted by other two service forecasting methods; one is traditional CBR based forecasting model and the other is the existing service forecasting model used by Company A. We ran each service forecasting 144 times; each time, input data were randomly sampled for each service forecasting framework. To evaluate accuracy of forecasting results, we used Mean Absolute Percentage Error (MAPE) as primary performance measure in our experiments. We conducted one-way ANOVA test with the 144 measurements of MAPE for three different service forecasting approaches. For example, the F-ratio of MAPE for three different service forecasting approaches is 67.25 and the p-value is 0.000. This means that the difference between the MAPE of the three different service forecasting approaches is significant at the level of 0.000. Since there is a significant difference among the different service forecasting approaches, we conducted Tukey's HSD post hoc test to determine exactly which means of MAPE are significantly different from which other ones. In terms of MAPE, Tukey's HSD post hoc test grouped the three different service forecasting approaches into three different subsets in the following order: our proposed approach > traditional CBR-based service forecasting approach > the existing forecasting approach used by Company A. Consequently, our empirical experiments show that our proposed approach outperformed the traditional CBR based forecasting model and the existing service forecasting model used by Company A. The rest of this paper is organized as follows. Section 2 provides some research background information such as summary of CBR and SOM. Section 3 presents a hybrid service forecasting framework based on Case-based Reasoning and Self-Organizing Maps, while the empirical evaluation results are summarized in Section 4. Conclusion and future research directions are finally discussed in Section 5.
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 Korean Association of Geographic Information Studies
/
v.17
no.4
/
pp.69-85
/
2014
Carbon stocks of NFI plots can be accurately estimated using field survey information. However, an accurate estimation of carbon stocks in other unsurveyed sites is very difficult. In order to fill this gap, various spatial information can be used as an ancillary data. In South Korea, there is the 1:5,000 forest type map that was produced by digital air-photo interpretation and field survey. Because this map contains very detailed forest information, it can be used as the high-quality spatial data for estimating carbon stocks. In this study, we compared three upscaling methods based on the 1:5,000 forest type map and 5th national forest inventory data. Map algebra(method 1), RK(Regression Kriging)(method 2), and GWR(Geographically Weighted Regression)(method 3) were applied to estimate forest carbon stock in Chungcheong-nam Do and Daejeon metropolitan city. The range of carbon stocks from method 2(1.39~138.80 tonC/ha) and method 3(1.28~149.98 tonC/ha) were more similar to that of previous method(1.56~156.40 tonC/ha) than that of method 1(0.00~93.37 tonC/ha). This result shows that RK and GWR considering spatial autocorrelation can show spatial heterogeneity of carbon stocks. We carried out paired t-test for carbon stock data using 186 sample points to assess estimation accuracy. As a result, the average carbon stocks of method 2 and field survey method were not significantly different at p=0.05 using paired t-test. And the result of method 2 showed the lowest RMSE. Therefore regression kriging method is useful to consider spatial variations of carbon stocks distribution in rugged terrain and complex forest stand.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 2004년 10월 1일]
이용약관
제 1 장 총칙
제 1 조 (목적)
이 이용약관은 KoreaScience 홈페이지(이하 “당 사이트”)에서 제공하는 인터넷 서비스(이하 '서비스')의 가입조건 및 이용에 관한 제반 사항과 기타 필요한 사항을 구체적으로 규정함을 목적으로 합니다.
제 2 조 (용어의 정의)
① "이용자"라 함은 당 사이트에 접속하여 이 약관에 따라 당 사이트가 제공하는 서비스를 받는 회원 및 비회원을
말합니다.
② "회원"이라 함은 서비스를 이용하기 위하여 당 사이트에 개인정보를 제공하여 아이디(ID)와 비밀번호를 부여
받은 자를 말합니다.
③ "회원 아이디(ID)"라 함은 회원의 식별 및 서비스 이용을 위하여 자신이 선정한 문자 및 숫자의 조합을
말합니다.
④ "비밀번호(패스워드)"라 함은 회원이 자신의 비밀보호를 위하여 선정한 문자 및 숫자의 조합을 말합니다.
제 3 조 (이용약관의 효력 및 변경)
① 이 약관은 당 사이트에 게시하거나 기타의 방법으로 회원에게 공지함으로써 효력이 발생합니다.
② 당 사이트는 이 약관을 개정할 경우에 적용일자 및 개정사유를 명시하여 현행 약관과 함께 당 사이트의
초기화면에 그 적용일자 7일 이전부터 적용일자 전일까지 공지합니다. 다만, 회원에게 불리하게 약관내용을
변경하는 경우에는 최소한 30일 이상의 사전 유예기간을 두고 공지합니다. 이 경우 당 사이트는 개정 전
내용과 개정 후 내용을 명확하게 비교하여 이용자가 알기 쉽도록 표시합니다.
제 4 조(약관 외 준칙)
① 이 약관은 당 사이트가 제공하는 서비스에 관한 이용안내와 함께 적용됩니다.
② 이 약관에 명시되지 아니한 사항은 관계법령의 규정이 적용됩니다.
제 2 장 이용계약의 체결
제 5 조 (이용계약의 성립 등)
① 이용계약은 이용고객이 당 사이트가 정한 약관에 「동의합니다」를 선택하고, 당 사이트가 정한
온라인신청양식을 작성하여 서비스 이용을 신청한 후, 당 사이트가 이를 승낙함으로써 성립합니다.
② 제1항의 승낙은 당 사이트가 제공하는 과학기술정보검색, 맞춤정보, 서지정보 등 다른 서비스의 이용승낙을
포함합니다.
제 6 조 (회원가입)
서비스를 이용하고자 하는 고객은 당 사이트에서 정한 회원가입양식에 개인정보를 기재하여 가입을 하여야 합니다.
제 7 조 (개인정보의 보호 및 사용)
당 사이트는 관계법령이 정하는 바에 따라 회원 등록정보를 포함한 회원의 개인정보를 보호하기 위해 노력합니다. 회원 개인정보의 보호 및 사용에 대해서는 관련법령 및 당 사이트의 개인정보 보호정책이 적용됩니다.
제 8 조 (이용 신청의 승낙과 제한)
① 당 사이트는 제6조의 규정에 의한 이용신청고객에 대하여 서비스 이용을 승낙합니다.
② 당 사이트는 아래사항에 해당하는 경우에 대해서 승낙하지 아니 합니다.
- 이용계약 신청서의 내용을 허위로 기재한 경우
- 기타 규정한 제반사항을 위반하며 신청하는 경우
제 9 조 (회원 ID 부여 및 변경 등)
① 당 사이트는 이용고객에 대하여 약관에 정하는 바에 따라 자신이 선정한 회원 ID를 부여합니다.
② 회원 ID는 원칙적으로 변경이 불가하며 부득이한 사유로 인하여 변경 하고자 하는 경우에는 해당 ID를
해지하고 재가입해야 합니다.
③ 기타 회원 개인정보 관리 및 변경 등에 관한 사항은 서비스별 안내에 정하는 바에 의합니다.
제 3 장 계약 당사자의 의무
제 10 조 (KISTI의 의무)
① 당 사이트는 이용고객이 희망한 서비스 제공 개시일에 특별한 사정이 없는 한 서비스를 이용할 수 있도록
하여야 합니다.
② 당 사이트는 개인정보 보호를 위해 보안시스템을 구축하며 개인정보 보호정책을 공시하고 준수합니다.
③ 당 사이트는 회원으로부터 제기되는 의견이나 불만이 정당하다고 객관적으로 인정될 경우에는 적절한 절차를
거쳐 즉시 처리하여야 합니다. 다만, 즉시 처리가 곤란한 경우는 회원에게 그 사유와 처리일정을 통보하여야
합니다.
제 11 조 (회원의 의무)
① 이용자는 회원가입 신청 또는 회원정보 변경 시 실명으로 모든 사항을 사실에 근거하여 작성하여야 하며,
허위 또는 타인의 정보를 등록할 경우 일체의 권리를 주장할 수 없습니다.
② 당 사이트가 관계법령 및 개인정보 보호정책에 의거하여 그 책임을 지는 경우를 제외하고 회원에게 부여된
ID의 비밀번호 관리소홀, 부정사용에 의하여 발생하는 모든 결과에 대한 책임은 회원에게 있습니다.
③ 회원은 당 사이트 및 제 3자의 지적 재산권을 침해해서는 안 됩니다.
제 4 장 서비스의 이용
제 12 조 (서비스 이용 시간)
① 서비스 이용은 당 사이트의 업무상 또는 기술상 특별한 지장이 없는 한 연중무휴, 1일 24시간 운영을
원칙으로 합니다. 단, 당 사이트는 시스템 정기점검, 증설 및 교체를 위해 당 사이트가 정한 날이나 시간에
서비스를 일시 중단할 수 있으며, 예정되어 있는 작업으로 인한 서비스 일시중단은 당 사이트 홈페이지를
통해 사전에 공지합니다.
② 당 사이트는 서비스를 특정범위로 분할하여 각 범위별로 이용가능시간을 별도로 지정할 수 있습니다. 다만
이 경우 그 내용을 공지합니다.
제 13 조 (홈페이지 저작권)
① NDSL에서 제공하는 모든 저작물의 저작권은 원저작자에게 있으며, KISTI는 복제/배포/전송권을 확보하고
있습니다.
② NDSL에서 제공하는 콘텐츠를 상업적 및 기타 영리목적으로 복제/배포/전송할 경우 사전에 KISTI의 허락을
받아야 합니다.
③ NDSL에서 제공하는 콘텐츠를 보도, 비평, 교육, 연구 등을 위하여 정당한 범위 안에서 공정한 관행에
합치되게 인용할 수 있습니다.
④ NDSL에서 제공하는 콘텐츠를 무단 복제, 전송, 배포 기타 저작권법에 위반되는 방법으로 이용할 경우
저작권법 제136조에 따라 5년 이하의 징역 또는 5천만 원 이하의 벌금에 처해질 수 있습니다.
제 14 조 (유료서비스)
① 당 사이트 및 협력기관이 정한 유료서비스(원문복사 등)는 별도로 정해진 바에 따르며, 변경사항은 시행 전에
당 사이트 홈페이지를 통하여 회원에게 공지합니다.
② 유료서비스를 이용하려는 회원은 정해진 요금체계에 따라 요금을 납부해야 합니다.
제 5 장 계약 해지 및 이용 제한
제 15 조 (계약 해지)
회원이 이용계약을 해지하고자 하는 때에는 [가입해지] 메뉴를 이용해 직접 해지해야 합니다.
제 16 조 (서비스 이용제한)
① 당 사이트는 회원이 서비스 이용내용에 있어서 본 약관 제 11조 내용을 위반하거나, 다음 각 호에 해당하는
경우 서비스 이용을 제한할 수 있습니다.
- 2년 이상 서비스를 이용한 적이 없는 경우
- 기타 정상적인 서비스 운영에 방해가 될 경우
② 상기 이용제한 규정에 따라 서비스를 이용하는 회원에게 서비스 이용에 대하여 별도 공지 없이 서비스 이용의
일시정지, 이용계약 해지 할 수 있습니다.
제 17 조 (전자우편주소 수집 금지)
회원은 전자우편주소 추출기 등을 이용하여 전자우편주소를 수집 또는 제3자에게 제공할 수 없습니다.
제 6 장 손해배상 및 기타사항
제 18 조 (손해배상)
당 사이트는 무료로 제공되는 서비스와 관련하여 회원에게 어떠한 손해가 발생하더라도 당 사이트가 고의 또는 과실로 인한 손해발생을 제외하고는 이에 대하여 책임을 부담하지 아니합니다.
제 19 조 (관할 법원)
서비스 이용으로 발생한 분쟁에 대해 소송이 제기되는 경우 민사 소송법상의 관할 법원에 제기합니다.
[부 칙]
1. (시행일) 이 약관은 2016년 9월 5일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.