• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.347-360
• /
• 2001

The most expensive spatial operation in spatial databases is a spatial join which computes a combined table of which tuple consists of two tuples of the two tables satisfying a spatial predicate. Although the execution time of sequential processing of a spatial join has been so far considerably improved, the response time is not tolerable because of not meeting the requirements of interactive users. It is usually appropriate to use parallel processing to improve the performance of spatial join processing. However, as the number of processors increases, the efficiency of each processor decreases rapidly because of the disk bottleneck and the overhead of message passing. This paper proposes the method of task allocation to soften the disk bottleneck caused by accessing the shared disk at the same time, and to minimize message passing among processors. In order to evaluate the performance of the proposed method in terms of the number of disk accesses and message passing, we conduct experiments on the two kinds of parallel spatial join algorithms. The experimental tests on the MIMD parallel machine with shared disks show that the proposed semi-dynamic task allocation method outperforms the static and dynamic task allocation methods.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.754-765
• /
• 2006

In XML keyword search, a search result is defined as a set of the smallest elements (i.e., least common ancestors) containing all query keywords and a granularity of indexing is an XML element instead of a document. Under the conventional index structure, all least common ancestors produced by the combination of the elements, each of which contains a query keyword, are considered as a search result. In this paper, to avoid unnecessary operations of producing the least common ancestors and reduce query process time, we describe a way to construct a partitioned index composed of several partitions and produce a search result by merging those partitions if necessary. When a search result is restricted to be composed of the least common ancestors whose depths are higher than a given minimum depth, under the proposed partitioned index structure, search systems can reduce the query process time by considering only combinations of the elements belonging to the same partition. Even though the minimum depth is not given or unknown, search systems can obtain a search result with the partitioned index, which requires the same query process time to obtain the search result with non-partitioned index. Our experiment was conducted with the XML documents provided by the DBLP site and INEX2003, and the partitioned index could reduce a substantial amount of query processing time when the minimum depth is given.

• Journal of the Korean Society for information Management
• /
• v.25 no.4
• /
• pp.283-308
• /
• 2008

In this study, we testify that network structural attributes of a citation network can explain other aspects of journal citation behaviors and the importances of journals. And we also testify various citation impact indicators of journals including JIF and h-index to verify the difference among them especially focused on their ability to explain an institution's local features of citation behaviors. An institutional citation network is derived using the articles published in 2006-2007 by biotechnology faculties of Y University. And various journal citation impact indicators including JIF, SJR, h-index, EigenFactor, JII are gathered from different service sites such as Web of Science, SCImago, EigenFactor.com, Journal-Ranking.com. As a results, we can explain the institution's 5 research domains with inter-citation network. And we find that the co-citation network structural features can show explanations on the patterns of institutional journal citation behavior different from the simple cited frequency of the institution or patterns based on general citation indicators. Also We find that journal ranks with various citation indicators have differences and it implies that total-based indices, average-based indices, and hybrid index(h-index) explain different aspects of journal citation pattern. We also reveal that the coverage of citation DB doesn't be a matter in the journal ranking. Analyzing the citation networks derived from an institution's research outputs can be a useful and effective method in developing several library services.

• Journal of the Korean Society for information Management
• /
• v.32 no.4
• /
• pp.77-106
• /
• 2015

By document co-citation analysis with Korean Citation Index (KCI) data, this study accurately identified the research fronts and hot topics in Korean library and information science (LIS) from 2004 to 2013. 159 core papers in LIS domain and their citations are scraped manually from Korean Citation Index web site. In the cluster analysis and network analysis, 159 core papers were grouped into 27 clusters with multiple papers and 8 singlton clusters. Among the 27 clusters which have multple papers, 'LIS education' cluster was the largest with 16 core papers, and 'citation analysis & intellectual structure analysis' cluster had the strongest citation impact according to the ehs-index. Closer observation of the citations to the core papers in each research front showed that 67.5% of the citations were made by LIS research papers and 32.5% of the citations were made by non-LIS research papers. Considering the share of citations and the citation impact growth index, 'local documentation', 'citation analysis & intellectual structure analysis', and 'research trends analysis' were identified as the most emerging research front in Korean library and information science. The analytical methods used in this study have great potential in discovering the characteristics of research fronts in Korean interdisciplinary research domains.

• The KIPS Transactions:PartD
• /
• v.18D no.3
• /
• pp.157-168
• /
• 2011

Recently flash memory has been being utilized as a main storage device in mobile devices, and flashSSDs are getting popularity as a major storage device in laptop and desktop computers, and even in enterprise-level server machines. Unlike HDDs, on flash memory, the overwrite operation is not able to be performed unless it is preceded by the erase operation to the same block. To address this, FTL(Flash memory Translation Layer) is employed on flash memory. Even though the modified data block is overwritten to the same logical address, FTL writes the updated data block to the different physical address from the previous one, mapping the logical address to the new physical address. This enables flash memory to avoid the high block-erase cost. A flashSSD has an array of NAND flash memory packages so it can access one or more flash memory packages in parallel at once. To take advantage of the internal parallelism of flashSSDs, it is beneficial for DBMSs to request I/O operations on sequential logical addresses. However, the B-tree structure, which is a representative index scheme of current relational DBMSs, produces excessive I/O operations in random order when its node structures are updated. Therefore, the original b-tree is not favorable to SSD. In this paper, we propose AS(Always Sequential) B-tree that writes the updated node contiguously to the previously written node in the logical address for every update operation. In the experiments, AS B-tree enhanced 21% of B-tree's insertion performance.

• Journal of Radiation Protection and Research
• /
• v.26 no.2
• /
• pp.93-99
• /
• 2001

Voxel head phantom for overcoming the limitation of mathematical phantom in depleting anatomical details was constructed and example dose calculation for BNCT was performed. The repeated structure algorithm of the general purpose Monte Carlo code, MCNP4B was applied for yokel Monte Carlo calculation. Simple binary yokel phantom and combinatorial geometry phantom composed of two materials were constructed for validating the voxel Monte Carlo calculation system. The tomographic images of VHP man provided by NLM(National Library of Medicine) were segmented and indexed to construct yokel head phantom. Comparison of doses for broad parallel gamma and neutron beams in AP and PA directions showed decrease of brain dose due to the attenuation of neutron in eye balls in case of yokel head phantom. The spherical tumor volume with diameter, 5cm was defined in the center of brain for BNCT dose calculation in which accurate 3 dimensional dose calculation is essential. As a result of BNCT dose calculation for downward neutron beam of 10keV and 40keV, the tumor dose is about doubled when boron concentration ratio between the tumor to the normal tissue is $30{\mu}g/g$ to $3{\mu}g/g$. This study established the voxel Monte Carlo calculation system and suggested the feasibility of precise dose calculation in therapeutic radiology.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.762-773
• /
• 2014

As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

• The KIPS Transactions:PartD
• /
• v.10D no.4
• /
• pp.591-602
• /
• 2003

Delay and discontinuance phenomenon of service are cause by sudden increase of the network communication amount and the quantity consumed of resources when Internet users are driven excessively to a conventional single large database sewer. To solve these problems, spatial database cluster consisted of several single nodes on high-speed network to offer high-performance is risen. But, research about spatial join operation that can reduce the performance of whole system in case process at single node is not achieved. So, in this paper, we propose efficient parallel spatial join processing method in a spatial database cluster system that uses data partitions and replications method that considers the characteristics of space data. Since proposed method does not need the creation step and the assignment step of tasks, and does not occur additional message transmission between cluster nodes that appear in existent parallel spatial join method, it shows performance improvement of 23% than the conventional parallel R-tree spatial join for a shared-nothing architecture about expensive spatial join queries. Also, It can minimize the response time to user because it removes redundant refinement operation at each cluster node.

• The KIPS Transactions:PartB
• /
• v.9B no.4
• /
• pp.399-406
• /
• 2002

The goal of this research has been to develop an adaptive user agent for web surfing. To achieve this goal, the research has concentrated on three issues: collection of user data, construction and improvement of user profile, and adaptation by applying the user profile. The main outcome from the research is a prototype system that provides the functional definition and componential design scheme for an adaptive user agent for the web environment. Internally, the system achieves its operational goal from the cooperation of two independent agents. They are IIA (Interactive Interface Agent) and UPA (User Profiling Agent). As a tool for providing a user-friendly interface environment, the IIA employs the Keyword Index, which is a list of index terms of a webpage as well as a keyword menu for subsequent queries, and the Suggest Link, which is a hierarchical list of URLs showing the past browsing procedure of the user. The UPA reflects in the User Profile, both the static and the dynamic information obtained from the user's browsing behavior. In particular, a user's interests are represented in the form of Interest Vectors which, based on the similarity of the vectors, is subject to update and creation, thus dynamically profiling the user's ever-shifting interests.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2001.12a
• /
• pp.413-426
• /
• 2001

본 연구는 첫째, 정보통신기술의 발달이 시각장애인 복지 증진에 미칠 수 있는 가능성에 대한 이론적인 부분을 고찰하였다. 둘째, 우리나라 시각장애인 정보화의 문제점과 해결책을 도출하였고 셋째, 시각장애 사용자를 위한 전자상거래 인터페이스 디자인의 분석 및 설계를 통해 전자상거래에서 시각장애 사용자들이 큰 제약없이 사용할 수 있는 방안을 제시하고자 한다. 현재 시각장애인들의 웹 사용을 보면 시각장애 전용 S/W의 보조 하에 사용을 하고 있다. 그러한 보조 도구의 실정에 맞도록 텍스트 버전 및 Non-Frame버전, Alt-Text 옵션, 캡션 등을 넣어 접근성을 확보하고 인터넷을 큰 제약을 받지않고 이용할 수 있도록 웹 페이지의 설계가 필요한 실정이다. 이를 위하여 먼저 시각장애에 대한 개념과 원인 및 종류 그리고 특성을 통해 시각장애인에 대한 이론적 배경을 파악하였다. 그리고 시각장애인의 정보화 환경과 이용 현황과 시각장애인의 정보 접근을 제도적, 기기 및 소프트웨어 개발 측면에서 분석을 하였고, 장애인을 위한 정보통신기술 중 대표적인 사례를 검토해 보았다. 다음으로 국내외의 대표적인 전자상거래 사이트에서의 인터페이스를 화면구성(Layout), 텍스트(Text), 그래픽(Graphic), 멀티미디어(MultiMedia) 측면에서 분석을 하였다. 분석한 내용을 바탕으로 시각장애 사용자의 입력(User Input) 부분을 고려한 인터페이스 방향을 제시하고 프로토타입을 개발하여 시험 대상 사이트와의 만족도를 시각장애 사용자를 통해 비교 ·분석하였다. 결론부분에서는 정보불평등을 해소하고, 정보통신기술이 장애인의 복지향상에 기여하도록 하기 위해 전자상거래 싸이트에서의 시각 장애인들을 위한 방향을 제시하고자 한다.박의 표현, 등록 및 색인방법 (c) 공급 선박의 분류와 표현 방법 (d) 에이전트의 정보 수집을 위한 메시지 표현 방법 (e) 수집된 선박정보의 데이터베이스 저장 표현방법 (f) 요구 선박을 찾아주는 정보제공 서비스가 요구된다.동을 보여 조사대상 5호분, 6호분, 7호분, 중 가장 심한 거동을 보이고 있다. 이는 고분 벽돌의 깨짐이 6호분이 가장 심하다는 사실과 무관하지 않은 것으로 판단된다. 봉분내부의 토양층구조에 대한 지오레이다 영상단면을 분석한 결과 무령왕릉 연도상부의 누수지방지층이 심하게 균열되어 있음을 발견하였다. 이 곳은 고분내부로 직접누수가 발생하는 곳이다. 직접누수와 지하수 형태로 유입된 침투수는 고분군 주위의 지반의 함수비를 증가시켜 지반의 지지력을 약화시키고 또한 고분내로 서서히 유입되어 고분내부의 습도를 100%로 유지시키는 주된 원인이다. 이러한 높은 습도는 고분내의 남조류의 번식을 가져왔으며 남조류의 번식은 현재 6호분이 가장 심각하고 7호분이 우려되는 수준이며 5호분은 문제가 없는 것으로 판단된다. 이와 같이 고분군의 발굴후 인위적인 환경변화와 지속적인 강우침투 및 배수 불량의 영향은 고분군의 안정성에 상당한 위험을 초래하였으며, 현 상태는 각 고분에 대한 보강이 불가피한 것으로 판단된다. 고분 벽돌의 깨짐, 고분 벽체의 거동, 조류의 서식등을 포함하여 송산리 고분군에서 발생되고 있는 보존상의 제반 문제점들을 일차적으로 누수 및 침투수에 의한 결과이다. 그러므로 무엇보다도 고분군 내부 및 고분 주변으로의 강우 및 지하수 침투를 막는 차수 대책이 시급한 것으로 판단된다. 또한 이미 발생한 변위가 더 이상 진행되지 않도록 하중을 경감하고 토압의 균형을 이루는 보강대책이 시급한 실정이다. 고분군