The O2O services in the healthcare sector have only been in full swing for about three years, and unlike existing O2O consumer goods, the scale and scope of the dispute are more complicated due to restrictions on medical treatment. In this study, O2O service platform operators and medical institutions' roles and responsibilities were redefined as a countermeasure for resolving disputes in healthcare O2O services and the laws for changing the transaction environment. A change in institutional mechanisms was proposed. This study looked at the types of consumer disputes related to healthcare O2O services as insufficient information problems, problems in the course of medical service implementation, problems with immunity provisions for platform operators, cancellations, and non-compliance with refunds. All the information generated during transactions in the healthcare sector was extensive in scale and included the most sensitive information among personal information, stressing the importance of ensuring security. The area that started in the O2O range before the medical institution visit also proposed a plan to establish a system for the delivery of proven information as a pre-medical person. The scale and growth will grow faster, given that consumers can experience the information they want anytime, anywhere they want. However, the platform broker's role, a link player, will become more important because consumers who use the service will have their first meeting with non-face-to-face product providers. On the other hand, service providers may have side effects of misleading consumers by providing false information or misleading consumers through exaggerated advertisements. The O2O service market is expected to expand beyond distribution and dining out to the entire industry. However, since it is challenging to check accurate statistics on the detailed market, various disputes and consumer protection measures will be required for each detailed market, and comprehensive leading solutions will be essential in the future.
The hydro-mechanical (HM) two-way sequential coupling in the TOUGH2-FLAC3D linking algorithm is validated completely and successfully in both M to H and H to M directions, which are initiated by mechanical surface loading for geomechanical validation and hydrological groundwater pumping for hydrogeological validation, respectively. For such complete and successful validation, a TOUGH2-FLAC3D linked numerical model is developed first by adopting the TOUGH2-FLAC3D linking algorithm, which uses the two-way (fixed-stress split) sequential coupling scheme and the implicit backward time stepping method. Two geomechanical and two hydrogeological validation problems are then simulated using the linked numerical model together with basic validation strategies and prerequisites. The second geomechanical and second hydrogeological validation problems are also associated with the Mandel effect and the Noordbergum and Rhade effects, respectively, which are three phenomenally well-known but numerically challenging HM effects. Finally, sequentially coupled numerical solutions are compared with either analytical solutions (verification) or fully coupled numerical solutions (benchmarking). In all the four validation problems, they show almost perfect to extremely or very good agreement. In addition, the second geomechanical validation problem clearly displays the Mandel effect and suggests a proper or minimum geometrical ratio of the height to the width for the rectangular domain to maximize agreement between the numerical and analytical solutions. In the meantime, the second hydrogeological validation problem clearly displays the Noordbergum and Rhade effects and implies that the HM two-way sequential coupling scheme used in the linked numerical model is as rigorous as the HM two-way full coupling scheme used in a fully coupled numerical model.
Journal of the Institute of Electronics Engineers of Korea CI
/
v.43
no.6
s.312
/
pp.34-42
/
2006
As art analytic method to uncover interesting patterns hidden under a large volume of data, data mining research has been actively done so far in various fields. However, current state-of-the-arts in data mining research have several challenging problems such as being too ad-hoc. The existing techniques are mostly the ones designed for individual problems, so there is no unifying theory applicable for more general data mining problems. In this paper, we address the problem of classification, which is one of significant data mining tasks. Specifically, our objective is to evaluate radial basis function (RBF) model for classification tasks and investigate its usefulness. For evaluation, we analyze the popular Monk's problems which are well-known datasets in data mining research. First, we develop RBF models by using the representational capacity based learning algorithm, and then perform a comparative assessment of the results with other models generated by the existing techniques. Through a variety of experiments, it is empirically shown that the RBF model has not only the superior performance on the Monk's problems but also its modeling process can be controlled in a systematic way, so the RBF model with RC-based algorithm might be a good candidate to handle the current ad-hoc problem.
Journal of the Korean Society of Marine Environment & Safety
/
v.28
no.4
/
pp.515-524
/
2022
To effectively collect, manage, and share the maritime traffic information, it is necessary to identify the technology trends concerning this particular information and analyze its current status and problems. Therefore, this study observes the domestic and foreign technology trends involving maritime traffic information while analyzing and summarizing the current status and problems in collecting, managing, and sharing it. According to the data analysis, the problems in the collecting stage are difficulties in collecting visual information from long-distance radars, CCTVs, and cameras in areas outside the LTE network coverage. Notably, this explains the challenges in detecting smuggling ships entering the territorial waters through the exclusive economic zone (EEZ) in the early stage. The problems in the management stage include difficult reductions and expansions of maritime traffic information caused by the lack of flexibility in storage spaces mostly constructed by the maritime transportation system. Additionally, it is challenging to deal with system failure with system redundancy and backup as a countermeasure. Furthermore, the problems in the sharing stage show that it is difficult to share information with external operating organizations since the internal network is mainly used to share maritime transportation information. If at all through the government cloud via platforms such as LRIT and SASS, it often fails to effectively provide various S/W applications that help use maritime big data. Therefore, it is suggested that collecting equipment such as unmanned aerial vehicles and satellites should be constructed to expand collecting areas in the collecting stage. In the management and sharing stages, the introduction and construction of private clouds are suggested, considering the operational administration and information disclosure of each maritime transportation system. Through these efforts, an enhancement of the expertise and security of clouds is expected.
For about the past decade and a half research efforts into cognitive radio networks (CRNs) have increased dramatically. This is because CRN is recognized as a technology that has the potential to squeeze the most out of the existing spectrum and hence virtually increase the effective capacity of a wireless communication system. The resulting increased capacity is still a limited resource and its optimal allocation is a critical requirement in order to realize its full benefits. Allocating these additional resources to the secondary users (SUs) in a CRN is an extremely challenging task and integer programming based optimization tools have to be employed to achieve the goals which include, among several aspects, increasing SUs throughput without interfering with the activities of primary users. The theory of the optimization tools that can be used for resource allocations (RA) in CRN have been well established in the literature; convex programming is one of them, in fact the major one. However when it comes to application and implementation, it is noticed that the practical problems do not fit exactly into the format of well established tools and researchers have to apply approximations of different forms to assist in the process. In this survey paper, the optimization tools that have been applied to RA in CRNs are reviewed. In some instances the limitations of techniques used are pointed out and creative tools developed by researchers to solve the problems are identified. Some ideas of tools to be considered by researchers are suggested, and direction for future research in this area in order to improve on the existing tools are presented.
Ratio of physically and mentally handicapped people among the total population is about 3∼4%. Regardless of the extent of seriousness of handicaps, they have to sustain various difficulties in their life time and pose challenging problems to their homes, community and nation. In the spectrum of their problems, measures such as treatment, rehabilitation and welfare work all occupied important part but most significant measure is the prevention. Such handicaps items from health care of maternal and child, mostly causes throughout the process of pregnancy, delivery and upbringing. And then this study is focused on the pregnant history of the mothers with handicapped children. The objective of this study is to identify the basic factors which can create a handicapped child during pregnancy and is to prevent the birth of such a child. For this study, 301 mothers who have handicapped children were selected, now receiving various training at 5 rehabilitation and educational facilities. And questionnaires distributed to them during the period of Oct, 1983 to Dec, 14. The collected responses have been analized in terms of significant numbers, percentage and metic average. Their related results are as follows: 1. The sexual ratio between the male and female was 58.5% compare 41.5%. The average age of the handicapped children was 10.1 years old and that of mothers at the time of the children's birth was 28.9 old years. They were born as 2.14th in their family, the ratio of antenatal care for pregnant mothers was 36.2% and 22.9% were abnormally delivered. 37.9% out of the total were born from mothers with ages above 35 years and as their first baby. 2. The time of confirming the handicapped nature of children was during babyhood by 97.1% and discovery of these misfortunes were made by chance. As for causes of those-handicapped status 20.9% disease from complication, 15.3% from difficulties experience at the time of delivery, 11.3% from heredity and 10% were results of drug abuse during pregnancy, and 49.8% of the handicapped children were mentally retarded.
Soft tissue reconstruction of dorsum of the foot and ankle has long presented challenging problems for the reconstructive surgeon. Limitations of available local tissue, the need for specialized tissue, and donor site morbidity restrict the options. In an effort to solve these difficult problems, we have begun to use adipofascial flap based on the perforating branch of the peroneal artery. We present our early experience of 5 patients treated with this flap. Our patients ranged from 6 to 26 years in age and included 3 males and 2 females. The etiologies of the wounds were secondary to traffic accident, and crushing injury. The flaps had reverse flow in all patients. The flap and the adjoining raw area were covered with a full-thickness skin graft, while the donor site at the lateral aspect of the leg was closed primarily without grafting. The skin graft was taken from the inguinal area, which was closed primarily. Compared with other flap, this adipofascial flap is thinner, producing less bulkiness to the recipient site and minor aesthetic sequelae to the donor site. In our opinion, this flap is versatile, effective, and an addition to the armamentarium of the reconstructive surgeon for coverage of difficult wounds of the foot and ankle.
Journal of the Korea Institute of Information Security & Cryptology
/
v.27
no.2
/
pp.213-222
/
2017
Online advertisement has many benefits comparing to offline advertisement but it also has many challenging problems by online ad abuses. Advertisement injection (Ad injection) is one of the threats that surreptitiously inserts advertisements without a permission of site owners. Users are exposed to additional ads and redundant web traffic by injected ads can cause a service quality problem. Moreover, advertisers can have economic loss when injected ads are different from original ones. Although ad injection leads to these problems it has not been fully studied yet. A few ad injection researches are done by online advertising providers such as Google. In this paper, we analyze ad injection activities to Korean major portal, Naver. We classify 6 types of ad injections and describe their characteristics by analyzing 27 downloaders and 199 installed programs.
The emergence of online media and their data has enabled data-driven methods to solve challenging and complex tasks such as rumor classification problems. Recently, deep learning based models have been shown as one of the fastest and the most accurate algorithms to solve such problems. These new models, however, either rely on complete data or several days-worth of data, limiting their applicability in real time. In this study, we go beyond this limit and test the possibility of super early rumor detection via recurrent neural networks (RNNs). Our model takes in social media streams as time series input, along with basic meta-information about the rumongers including the follower count and the psycholinguistic traits of rumor content itself. Based on analyzing millions of social media posts on 498 real rumors and 494 non-rumor events, our RNN-based model detected rumors with only 30 initial posts (i.e., within a few hours of rumor circulation) with remarkable F1 score of 0.74. This finding widens the scope of new possibilities for building a fast and efficient rumor detection system.
Numerical analysis of convection-dominated transport problems are challenging because of dual characteristics of the governing equation. In the finite element method, a strategy is to modify the test function to weight more in the upwind direction. This is called as the Petrov-Galerkin method. In this paper, both N+1 and N+2 Petrov-Galerkin methods are applied to transport problems at high grid Peclet number. Frequency fitting algorithm is used to obtain optimal levels of N+2 upwinding, and the results are discussed. Also, a new Petrov-Galerkin method, named as "Optimal Test Function Petrov-Galerkin Method," is proposed in this paper. The test function of this numerical method changes its shape depending upon relative strength of the convection to the diffusion. A numerical experiment is carried out to demonstrate the performance of the proposed method.
본 웹사이트에 게시된 이메일 주소가 전자우편 수집 프로그램이나
그 밖의 기술적 장치를 이용하여 무단으로 수집되는 것을 거부하며,
이를 위반시 정보통신망법에 의해 형사 처벌됨을 유념하시기 바랍니다.
[게시일 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일부터 적용되며, 종전 약관은 본 약관으로 대체되며, 개정된 약관의 적용일 이전 가입자도 개정된 약관의 적용을 받습니다.