• The KIPS Transactions:PartD
• /
• v.13D no.3 s.106
• /
• pp.293-298
• /
• 2006

Many data are stored in database. For getting any information from many data, we use the query sentences. These information is basic and simple. Data mining method is various. In this paper, we manage clustering and association rules. We present a method for finding the better association rules, and we solve a problem of the existing association rules. We propose and apply a new clustering method to fit for association rules. It is not clustering of the existing distance basis or category basis. If we find association rules of each clusters, we can get not only existing rules found in all transaction but also rules that will be characteristics of clusters. Through this study, we can expect that we will reduce the number of many transaction access in large databases and find association of small group.

• The KIPS Transactions:PartD
• /
• v.15D no.2
• /
• pp.155-162
• /
• 2008

Biological sequences such as DNA sequences and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological dataset with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with the fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. As the result, the experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.1
• /
• pp.127-136
• /
• 2009

This paper proposes an on-line mining algorithm of moving trajectory patterns in RFID data streams considering changing characteristics over time and constraints of single-pass data scan. Since RFID, sensor, and mobile network technology have been rapidly developed, many researchers have been recently focused on the study of real-time data gathering from real-world and mining the useful patterns from them. Previous researches for sequential patterns or moving trajectory patterns based on stream data have an extremely time-consum ing problem because of multi-pass database scan and tree traversal, and they also did not consider the time-changing characteristics of stream data. The proposed method preserves the sequential strength of 2-lengths frequent patterns in binary relationship table using the time-evolving graph to exactly reflect changes of RFID data stream from time to time. In addition, in order to solve the problem of the repetitive data scans, the proposed algorithm infers candidate k-lengths moving trajectory patterns beforehand at a time point t, and then extracts the patterns after screening the candidate patterns by only one-pass at a time point t+1. Through the experiment, the proposed method shows the superior performance in respect of time and space complexity than the Apriori-like method according as the reduction ratio of candidate sets is about 7 percent.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2006.05a
• /
• pp.1616-1621
• /
• 2006

하천 지형은 흐름과 유사거동에 의한 세굴 또는 퇴적에 의하여 끊임없이 변한다. 이 연구에서는 최근 하천지형의 변화가 크게 일어나고 있는 한강 신곡수중보 직하류 우안의 고수부지 형성 이력에 대한 조사 및 분석을 실시하였다. 조사결과, 1981년 이전까지 하중도(제주초도)가 안정된 형태로 존재하였으나, 1980년대 중반을 거치면서 하중도는 소멸되었고 1990년대 중반 이후부터 우안에 비슷한 규모의 고수부지가 생성되었음을 알 수 있었다. 이 고수부지의 형성과정을 평가하면 다음과 같다. 1) 초기단계(흐름 변화에 따른 이동사주의 정지): 1995년 이전까지는 하천 내 자연적/인위적 교란에도 불구하고 이열사주 형태의 이동상이 유지되다가 1995년 이후 1988년 준공된 신곡수중보의 직.간접적인 영향을 받는다. 이로 인한 하중도의 소멸이 가중되면서부터 신곡수중보 직하류 우안의 이동사주가 정지하기에 이른다. 2) 성장단계(조석에 따른 부유사 반복 퇴적): 이동상 사주가 정지된 뒤 매일 2회씩 반복되는 조석의 영향을 받은 고농도의 부유사가 정지된 사주 위에 반복되어 퇴적되는 양상이 일어난다. 3) 정착단계(정지사주의 고수부지화): 정지사주에서 부유사가 퇴적하고 갈대와 같은 초본류 식생이 활착하게 되면서 부유사 퇴적은 가중되어 간다. 이러한 과정에서 1999년과 같은 대홍수 때 부유사의 고수부지 내 퇴적이 결정적이었을 것이다. 4) 확장단계(고수부지 확장단계): 대홍수 때 고수부지의 퇴적과 아울러 산재하던 버드나무가 교란을 받아 고수부지에서 새로운 버드나무 군락의 터전을 이루어 밀생하게 된다. 향후 고수부지가 잠기는 규모의 홍수가 빈발할 경우 퇴적층의 유실보다는 부유사 퇴적이 많아져 고수부지는 확장단계에 접어들게 된다.70{\sim}90$ 시간 동안 실험을 수행하였다. 세굴의 측정은 투명한 아크릴로 제작된 수제 내부에 CC카메라를 수제 전 후면 및 측면에 설치하여 월류수제의 세굴 발생을 실시간으로 측정하며 동시에 수제의 각 면에 각각 3개의 압력센서를 설치하여 압력분포를 측정함으로써, 월류수제 주변의 압력변화에 따른 세굴심의 실시간 변화를 비교할 수 있도록 하였다. 수심이 연중 $25{\sim}35m$를 유지하는 H호의 경우 간헐식 폭기장치를 가동하는 기간은 물론 그 외 기간에도 취수구의 심도를 표층 10m 이하로 유지 할 경우 전체 조류 유입량을 60% 이상 저감할 수 있을 것으로 조사되었다.심볼 및 색채 디자인 등의 작업이 수반되어야 하며, 이들을 고려한 인터넷용 GIS기본도를 신규 제작한다. 상습침수지구와 관련된 각종 GIS데이타와 각 기관이 보유하고 있는 공공정보 가운데 공간정보와 연계되어야 하는 자료를 인터넷 GIS를 이용하여 효율적으로 관리하기 위해서는 단계별 구축전략이 필요하다. 따라서 본 논문에서는 인터넷 GIS를 이용하여 상습침수구역관련 정보를 검색, 처리 및 분석할 수 있는 상습침수 구역 종합정보화 시스템을 구축토록 하였다.N, 항목에서 보 상류가 높게 나타났으나, 철거되지 않은 검전보나 안양대교보에 비해 그 차이가 크지 않은 것으로 나타났다.의 기상변화가 자발성 기흉 발생에 영향을 미친다고 추론할 수 있었다. 향후 본 연구에서 추론된 기상변화와 기흉 발생과의 인과관계를 확인하고 좀 더 구체화하기 위한 연구가 필요할 것이다.게 이루어질 수 있을 것으로 기대된다.는 초과수익률이 상승하지만, 이후로는 감소하므로, 반전거래전략을 활용하는 경우 주식투자기간은 24개월이하의 중단기가 적합함을

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.10 no.2 s.21
• /
• pp.69-79
• /
• 2004

This study focuses on the relationship between pollution factors around Masan, Changwon and Chinhae city considerd as main pollution sources and marine environment in Masan bay of Korea. Water quality data measured In Jinhae bay and environmental investigation data in Masan, Changwon and Jinhae cities from 1981 to 1998 were used for this study. Annual means and standard deviations of COD, DIN and DIP concentrations from 1981 to 1998 showed that both their concentration and fluctuations were higher in the inner part of Masan bay (region A) than near Somodo (region B). Sediment dredging in Masan bay had been done from 1990 to 1994. After dredging, COD concentration has been decreasing In surface layer. Also water pollution was gradually spreaded from the inner part to the outer part of the bay due to the continuous inflow of domestic sewage and industrial wastewater. In the late of 1990s, the pollution was heavier. DIN and DIP concentrations were found to be increased by establishment of industry complex and decreased by sewage treatment plant near the city adjacent to Jinhae bay, 1993. The correlation between COD, DIN and DIP changes and neighbor cities' pollution sources were calculated From 1981 to 1998, correlation coefficient (r) was over 0.8 except for the bottom of region A From 1981 to 1998, r between the DIP concentration and population was over 0.65 except for the surface of region A, and the r between the DIP and the number of factories was over 0.6 too, in region B.

• Journal of forensic and investigative science
• /
• v.1 no.2
• /
• pp.31-43
• /
• 2006

I searched the recent murder cases for other criminal methods of homicides the monthly statistics of the local police agencies of the whole country, I found that there are many criminal cases where knives were used. Based on this finding, I decided to conduct my survey about kitchen knives. The statistics indicated more than five hundread male and female adults were reported to have committed murders. Of the 500 people, 21 used a kitchen knife to commit murder. This study showed that when people have a conflict, the kitchen knife is as a tool that can be easily changed into a weapon. If the points of the knife is round, more homicides could be avoided. If regulations were established, as we have with dagger when producing, selling or purchasing, I would assume that the number of the crimes with knives will be remarkably diminished. It is our responsibility to create a bill concerning regulatory standards in understanding the dangers of kitchen knives. We must immediately participate in active publicity campaigns.

• KIPS Transactions on Computer and Communication Systems
• /
• v.7 no.9
• /
• pp.219-226
• /
• 2018

One of the systematic ways to generate the number of all cases is a combination to construct a combination tree, and its time complexity is O($2^n$). A combination tree is used for various purposes such as the graph homogeneity problem, the initial model for calculating frequent item sets, and so on. However, algorithms that must search the number of all cases of a combination are difficult to use realistically due to high time complexity. Nevertheless, as the amount of data becomes large and various studies are being carried out to utilize the data, the number of cases of searching all cases is increasing. Recently, as the GPU environment becomes popular and can be easily accessed, various attempts have been made to reduce time by parallelizing algorithms having high time complexity in a serial environment. Because the method of generating the number of all cases in combination is sequential and the size of sub-task is biased, it is not suitable for parallel implementation. The efficiency of parallel algorithms can be maximized when all threads have tasks with similar size. In this paper, we propose a method to efficiently collaborate between CPU and GPU to parallelize the problem of finding the number of all cases. In order to evaluate the performance of the proposed algorithm, we analyze the time complexity in the theoretical aspect, and compare the experimental time of the proposed algorithm with other algorithms in CPU and GPU environment. Experimental results show that the proposed CPU and GPU collaboration algorithm maintains a balance between the execution time of the CPU and GPU compared to the previous algorithms, and the execution time is improved remarkable as the number of elements increases.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.50-50
• /
• 2022

한국농어촌공사 산하의 농업용저수지 중 3786개소에 대한 수질조사를 '19년도에 실시한 결과, TOC 기준 4등급 초과 저수지 비율은 약 20%로써, 도심 근교 저수지에서 녹조현상 빈발로 인해 수질, 악취, 미관 등의 환경문제 개선 민원이 다수 발생하고 있다. 현재 녹조 발생 사후관리를 위해 주로 사용되고 있는 대형 조류제거선은 저수심 수변부에서의 적용성에 한계가 있고, Al 기반의 응집제를 사용하여 조류를 수거해서 폐기하고 있는 실정이다. (주)이엔이티는 농어촌연구원, (주)코레드, (주)삼호인넷과 함께 호소나 정체하천의 수변지역에 적용될 수 있는 저에너지형 유해조류 포집시스템 개발과, 수거된 조류부산물을 무독화하여 농업재료로 재활용하는 방안을 연구하고 있다. 저수지나 정체수역의 녹조는 바람, 수면유동 등에 의해 수변에 집적되는 특성이 있어, 인공지능 기술로 녹조현상을 감시하여 조류 밀집구간에 접근할 수 있는 자율이동식 수상이동장치를 개발 중이다. 수상이동장치는 조류포집장치를 탑재하기 위한 부력체, 원격 운전이 가능한 무인항법장치, 수변식생대 및 저수심지역 이동을 고려한 수차방식 추진체, 전체 장치의 전원 공급을 위한 고성능 배터리 등으로 구성하여 상세 도면 설계를 진행하고 있다. 조류포집장치에는 표층에 주로 분포하는 남조류를 선택 흡입하는 포집 부표를 적용하였고, Al계 응집제 사용을 배제한 분리막 실험을 통해 침지형 막분리조 및 가압형 농축조를 설계하였다. 유해조류 포집 및 농축은 수상에서 이동체에 탑재하여 이뤄지고, 육상에서는 자원 회수가 가능하도록 회분식 응집공정으로 구분하였다. 조류 밀집지역에서 수거된 조류의 무독화 및 농업재료 자원화 타당성 평가를 위해 특용 버섯균주를 활용한 시료별 분석항목을 선정하고 실험 매트릭스에 따라 실증실험을 수행하였다. 수거조류를 전처리하여 성분 및 발열량을 분석하고 버섯재배 전후의 마이크로시스틴 독소(LR, RR, LR)를 포함한 성분 분석을 수행하여, 고체연료, 비료 및 사료로 활용방안을 검토하였다. 무인자율이동 조류포집장치는 실증화 규모로 제작하여 기선정된 테스트베드에서 현장적용성 평가를 수행할 예정이다. 본 연구를 통해 개발된 유해조류 포집 시스템은 기존의 녹조제거 방안을 보완하여 정체수역의 생태계 복원 및 친수공간의 환경개선 등에 적용되며, 무독화가 입증된 유해조류의 농업재료 자원화 기술은 고부가 상품 개발 및 환경폐기물 감축에 활용될 것이다.

• Progress in Medical Physics
• /
• v.25 no.4
• /
• pp.298-303
• /
• 2014

In this study, we examine the trends and types of incidents frequently occur during radiation therapy by using the data from the radiation oncology safety information system (ROSIS), according to discovery method explores the development direction of future research accident cause factor control method. This study was carried out analysis of incident data in ROSIS nearly 1163 cases in last 11 years from 2003 to 2013. We categorized into treatment methods, found the time, discoverer of occupations and finding ways to analyze the data. Then, we calculate the percentage and the classification for each item. About 1163 cases of incident cases including the near miss cases, external radiation therapy, brachytherapy and other were 97%, 2% and 1%. In the case was improperly planned dose delivery was 44% (497 cases) which 429 cases (86%) was found before 3 fractions and 13 cases were found after 11 fractions. The investigation was found to be distributed in various a found times. Approximately 42% of found time was during treatment and 29% of patients were found the problem during inspection chart. Occupation to discover the most radiation accidents was the radiation therapist (53%) who works in treatment room. Among 1163 incidence cases, 24% cases were found the accident before the treatment, therefore most of accident were found after of during the treatment (70%, 813 cases). This trend is acquired through ROSIS analysis, is expected to be not significantly different in the case of Korea, so it is necessary more diverse and systematic research for the prevention and early detection by using the ROSIS data.