• Title/Summary/Keyword: 데이터과학자

Search Result 599, Processing Time 0.028 seconds

Asbestos Trend in Korea from 1918 to 2027 Using Text Mining Techniques in a Big Data Environment (빅데이터환경에서 텍스트마이닝 기법을 활용한 한국의 석면 트렌드 (1918년~2027년))

  • Yul Roh;Hyeonyi Jeong;Byungno Park;Chaewon Kim;Yumi Kim;Mina Seo;Haengsoo Shin;Hyunwook Kim;Yeji Sung
    • Economic and Environmental Geology
    • /
    • v.56 no.4
    • /
    • pp.457-473
    • /
    • 2023
  • Asbestos has been produced, imported and used in various industries in Korea over the past decades. Since asbestos causes fatal diseases such as malignant mesothelioma and lung cancer, the use of asbestos has been generally banned in Korea since 2009. However, there are still many asbestos-containing materials around us, and safe management is urgently needed. This study aims to examine asbestos-related trend changes using major asbestos-related keywords based on the asbestos trend analysis using big data for the past 32 years (1991 to 2022) in Korea. In addition, we reviewed both domestic trends related to the production, import, and use of asbestos before 1990 and asbestos-related policies from 2023 to 2027. From 1991 to 2000, main keywords related to asbestos were research, workers, carcinogens, and the environment because the carcinogenicity of asbestos was highlighted due to domestic production, import, and use of asbestos. From 2001 to 2010, the main keywords related to asbestos were lung cancer, litigation, carcinogens, exposure, and companies because lawsuits were initiated in the US and Japan in relation to carcinogenicity due to asbestos. From 2011 to 2020, the high ranking keywords related to asbestos were carcinogen, baseball field, school, slate, building, and abandoned asbestos mine due to the seriousness of the asbestos problem in Korea. From 2021 to present (2023), the main search keywords related to asbestos such as school, slate (asbestos cement), buildings, landscape stone, environmental impact assessment, apartment, and cement appeared.

Analysis of Munitions Contract Work Using Process Mining (프로세스 마이닝을 이용한 군수품 계약업무 분석 : 공군 군수사 계약업무를 중심으로)

  • Joo, Yong Seon;Kim, Su Hwan
    • Journal of Intelligence and Information Systems
    • /
    • v.28 no.4
    • /
    • pp.41-59
    • /
    • 2022
  • The timely procurement of military supplies is essential to maintain the military's operational capabilities, and contract work is the first step toward timely procurement. In addition, rapid signing of a contract enables consumers to set a leisurely delivery date and increases the possibility of budget execution, so it is essential to improve the contract process to prevent early execution of the budget and transfer or disuse. Recently, research using big data has been actively conducted in various fields, and process analysis using big data and process mining, an improvement technique, are also widely used in the private sector. However, the analysis of contract work in the military is limited to the level of individual analysis such as identifying the cause of each problem case of budget transfer and disuse contracts using the experience and fragmentary information of the person in charge. In order to improve the contract process, this study analyzed using the process mining technique with data on a total of 560 contract tasks directly contracted by the Department of Finance of the Air Force Logistics Command for about one year from November 2019. Process maps were derived by synthesizing distributed data, and process flow, execution time analysis, bottleneck analysis, and additional detailed analysis were conducted. As a result of the analysis, it was found that review/modification occurred repeatedly after request in a number of contracts. Repeated reviews/modifications have a significant impact on the delay in the number of days to complete the cost calculation, which has also been clearly revealed through bottleneck visualization. Review/modification occurs in more than 60% of the top 5 departments with many contract requests, and it usually occurs in the first half of the year when requests are concentrated, which means that a thorough review is required before requesting contracts from the required departments. In addition, the contract work of the Department of Finance was carried out in accordance with the procedures according to laws and regulations, but it was found that it was necessary to adjust the order of some tasks. This study is the first case of using process mining for the analysis of contract work in the military. Based on this, if further research is conducted to apply process mining to various tasks in the military, it is expected that the efficiency of various tasks can be derived.

Cache Performance Analysis of Multiprocessor Systems for OLTP Applications based on a Memory-Resident DBMS (메모리 상주 DBMS 기반의 OLTP 응용을 위한 다중프로세서 시스템 캐쉬 성능 분석)

  • Chung, Yong-Wha;Hahn, Woo-Jong;Yoon, Suk-Han;Park, Jin-Won;Lee, Kang-Woo;Kim, Yang-Woo
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.6 no.4
    • /
    • pp.383-392
    • /
    • 2000
  • Currently, multiprocessors are evaluated almost exclusively with scientific applications. Commercial applications are rarely explored because it is difficult to obtain the source codes of commercial DBMS. Even when the source code is available, such as for POSTGRES, understanding the source code enough to perform detailed meaningful performance evaluations is a daunting task for computer architects.To evaluate multiprocessors with commercial applications, we have developed our own DBMS, called EZDB. EZDB is a parallelized DBMS, loosely inspired from POSTGRES, and running on top of a software architecture simulator. It is capable of executing parallel programs written in SQL. Contrary to POSTGRES, EZDB is not intended as a prototype for a production-quality DBMS. Its purpose is to easily run and evaluate the performance of commercial applications on multiprocessor architectures. To illustrate the usefulness of EZDB, we showed the cache performance data collected for the TPC-B benchmark on a shared-memory multiprocessor. The simulation results showed that the data structures exhibited unique sharing characteristics and that their locality properties and working sets were very different from those in scientific applications.

  • PDF

Ethical Issues in the Forth Industrial Revolution and the Enhancement of Bioethics Education in Korean Universities (4차 산업혁명 시대의 윤리적 이슈와 대학의 생명윤리교육 방향 제고)

  • KIM, Sookyung;LEE, Kyunghwa;KIM, Sanghee
    • Korean Journal of Medical Ethics
    • /
    • v.21 no.4
    • /
    • pp.330-343
    • /
    • 2018
  • This article explores some of the ethical issues associated with the fourth industrial revolution and suggests new directions for bioethics education in Korean universities. Some countries have recently developed guidelines and regulations based on the legal and ethical considerations of the benefits and social risks of new technologies associated with the fourth industrial revolution. Foreign universities have also created courses (both classroom and online) that deal with these issues and help to ensure that these new technologies are developed in an ethically appropriate fashion. In South Korea too there have been attempts to enhance bioethics education to meet the changing demands of society. However, bioethics education in Korea remains focused on traditional bioethical topics and largely neglects the ethical issues related to emerging technologies. Furthermore, Korean universities offer no online courses in bioethics and the classroom courses that do exist are generally treated as electives. In order to improve bioethics education in Korean universities, we suggest that (a) new course should be developed for interprofessional education; (b) courses in bioethics should be treated as required subjects gradually; (c) online courses should be prepared, and (d) universities should continually revise course contents in response to the development of new technologies.

Efficient Reverse Skyline Processing using Branch-and-Bound (분기한정법을 이용한 효율적인 리버스 스카이라인 질의 처리)

  • Han, Ah;Park, Young-Bae
    • Journal of KIISE:Databases
    • /
    • v.37 no.1
    • /
    • pp.12-21
    • /
    • 2010
  • Recently, "Service of information perspective" that is an important issue is that a company searches customers that interested in certain information and the company offers information to the customers. This service can gain high effects by low cost because of supporting selective information. In most recently, Reverse Skyline using Skyline Approximation(RSSA) is proposed to process services of information provider's perspective. RSSA has problem to defects about waste of processing time and memory. In this paper, Efficient Reverse Skyline(ERSL) Algorithm is proposed for Efficient processing the Skyline. ERSL is new Algorithm using Branch and Bound Skyline(BBS) reduces the waste of processing time and memory. When we execute the variety experimentation to valuation ERSL algorithm's capacity. It is proved the best efficient algorithm among the others because ERSL is flexibly kept the established capacity.

An Efficient Caching Strategy in Data Broadcasting (데이터 방송 환경에서의 효율적인 캐슁 정책)

  • Kim, Su-Yeon;Choe, Yang-Hui
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.12
    • /
    • pp.1476-1484
    • /
    • 1999
  • TV 방송 분야에서 다양한 정보와 상호 작용성을 제공하기 위해서 최근 기존 방송 내용인 A/V 스트림 외 부가정보 방송이 시도되고 있다. 데이타 방송에 대한 기존 연구는 대부분 고정된 내용의 데이타를 방송하는 환경을 가정하고 있어서 그 결과가 방송 내용의 변화가 많은 환경에 부적합하다. 본 논문에서는 데이타에 대한 접근이 반복되지 않을 가능성이 높고 사용자 접근 확률을 예상하기 어려운 상황에서 응답 시간을 개선하는 방안으로 수신 데이타를 무조건 캐쉬에 반입하고 교체가 필요한 경우 다음 방송 시각이 가장 가까운 페이지를 축출하는 사용자 단말 시스템에서의 캐슁 정책을 제안하였다. 제안된 캐쉬 관리 정책은 평균적인 캐쉬 접근 실패 비용을 줄임으로써 사용자 응답 시간을 개선하며, 서로 다른 스케줄링 기법을 사용하는 다양한 방송 제공자가 공존하는 환경에서 보편적으로 효과를 가져올 수 있다.Abstract Recently, many television broadcasters have tried to disseminate digital multimedia data in addition to the traditional content (audio-visual stream). The broadcast data need to be cached by a client system, to provide a reasonable response time for a user request. Previous studies assumed the dissemination of a fixed set of items, and the results are not suitable when broadcast items are frequently changed. In this paper, we propose a novel cache management scheme that chooses the replacement victim based on the remaining time to the next broadcast instance. The proposed scheme reduces response time, where it is hard to predict the probability distribution of user accesses. The caching policy we present here significantly reduces expected response time by minimizing expected cache miss penalty, and can be applied without difficulty to different scheduling algorithms.

Color Sensibility Image of Naturally Dyed Silk Fabric (천연염색 견직물의 색채감성 이미지)

  • Yang, Young-Ae;Yi, Eun-Jou
    • Science of Emotion and Sensibility
    • /
    • v.13 no.2
    • /
    • pp.403-412
    • /
    • 2010
  • This study was aimed to consider the influence of hue-tone, dyes, and mordants of naturally dyed silk fabric on color sensibility image factors and to establish color sensibility image scales of naturally dyed silk fabric by color and image descriptors. By single or sequential dyeing with various natural dyes commercially available in domestic and foreign market on the same silk fabric, a total of 66 colored fabric stimuli were prepared and they were used to evaluate subjective color sensibility image by 40 participants. As results, four different color sensibility image factors for naturally dyed silk fabric, 'delight', 'natural', 'modern' and 'attractive' were extracted. All of factors were significantly influenced by hue-tone, dyes, and mordants. Furthermore, by using color sensibility image adjectives and colors, multidimensional image scales were established, which leads to the conclusions that the results of this study help to design color sensibility-oriented naturally dyed fabric and apparel products.

  • PDF

SemFilter: A Simple and Efficient Semantic XML Message Filtering (SemFilter: 단순하며 효율적인 시맨틱 XML 메시지 필터링)

  • Kim, Jae-Hoon;Park, Seog
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.680-693
    • /
    • 2008
  • Recent studies on XML filtering assume that all data sources follow a single global schema defined in a filtering system. However, beyond this simple assumption, a filtering system can provide a service that allows data publishers to have their own schema; hence, the data sources will become heterogeneous. The number of data sources is expected to be large in a filtering system and the data sources are frequently published, updated, and disappeared, that is, dynamic. In this paper, we introduce implementing a simple and efficient XPath query translation method for such a dynamic environment. The method is especially targeted for a query which is composed based only on users' knowledge and experience without a graphical guidance of the global schema. When a user queries a large number of heterogeneous data, there is a high possibility that the query is not consistent with the same local schema assumed by the user. Our query translation method also supports a function for this problem. Some experimental results for query translation performance have shown that our method has reasonable performance, and is more practical than the existing method.

A Study on Saliency-based Stroke LOD for Painterly Rendering (회화적 렌더링을 위한 세일리언시 기반의 스트로크 단계별 세부묘사 제어에 관한 연구)

  • Lee, Ho-Chang;Seo, Sang-Hyun;Yoon, Kyung-Hyun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.36 no.3
    • /
    • pp.199-209
    • /
    • 2009
  • In this paper, we suggest a stroke level of detail (LOD) based on a saliency density. On painter]y rendering, the stroke LOD has an advantage of making the observer concentrate on the main object and improving accuracy of expression. For the stroke LOD, it is necessary to classify the detailed and abstracted area. We divide the area on the basis of saliency distribution and the level of detailed expression is controlled based on the saliency information. 'We define that the area of which the saliency distribution is high is a major subject that an artist tries to express, it is described in detail. The area of which the saliency distribution is low is abstractly described. Each divided area has the abstraction level. And by adapting the brushes of which sizes are appropriate to each level, it is possible to express the area which needs to be expressed in details from the one which needs to be expressed abstractly.

Qualitative Case Study on Computational Thinking Patterns of Programming Processes for the Tower of Hanoi Task (하노이 탑 프로그래밍 경험에서 나타나는 정보과학적 사고 패턴에 관한 질적 사례 연구)

  • Jang, Jeongsuk;Jun, Youngcook;Yoon, Jihyun
    • The Journal of Korean Association of Computer Education
    • /
    • v.16 no.4
    • /
    • pp.33-45
    • /
    • 2013
  • This paper aims at exploring how a high school student is engaged with C computer programming language and explore deep aspects of programming experiences based on video recalled interview as part of portraiture. The single case was selected and several in-depth interviews and video recording were arranged after Oct 2011. The portrait of K reveals interesting strands of his computer programming experiences with his own thinking patterns and exploring ideas for more concrete ways of coding his thinking similar to scientific experiments; ie, design-development-implementation-debugging-revision. Overall, this case illustrates how the inner aspects of subjective programming experiences on the tower of Hanoi were integrated and unified within himself for inner growth. We discussed the student's inner faculties as part of the student's unity and suggested future research direction.

  • PDF