• Journal of KIISE
• /
• v.41 no.12
• /
• pp.1126-1135
• /
• 2014

In recent years, RDF partitioning schemes have been studied for the effective distributed storage and management of large-scale RDF data. In this paper, we propose an RDF dynamic partitioning scheme to support load balancing in dynamic environments where the RDF data is continuously inserted and updated. The proposed scheme creates clusters and sub-clusters according to the frequency of the RDF data used by queries to set graph partitioning criteria. We partition the created clusters and sub-clusters by considering the workloads and data sizes for the servers. Therefore, we resolve the data concentration of a specific server, resulting from the continuous insertion and update of the RDF data, in such a way that the load is distributed among servers in dynamic environments. It is shown through performance evaluation that the proposed scheme significantly improves the query processing time over the existing scheme.

• Journal of IKEEE
• /
• v.22 no.3
• /
• pp.590-598
• /
• 2018

Recently, interest in IoT(Internet of Things) technology, which provides Internet services to objects, is increasing. IoT offers a variety of services in home networks, healthcare, and disaster alerts. IoT with LLN(Low Power & Lossy Networks) feature frequently loses sensor node. RPL, the standard routing protocol of IoT, performs global repair when data loss occurs in a sensor node. However, frequent loss of sensor nodes due to lower sensor nodes causes network performance degradation due to frequent full path reset. In this paper, we propose an additional selection method of the storage mode sensor node to solve the network degradation problem due to the frequent path resetting problem even after selecting the storage mode sensor node, and propose a method of equalizing the total path resetting number of each instance.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.8 no.1
• /
• pp.1088-1096
• /
• 1966

The following is a method of synthetic unitgraph derivation based on the routing of a time area diagram through channel storage, studied by Clark-Jonstone and Laurenson. Unithy drograph (or unitgraph) is the hydrograph that would result from unit rainfall\ulcorner excess occuring uniformly with respect to both time and area over a catchment in unit time. By thus standarzing rainfall characteristics and ignoring loss, the unitgraph represents only the effects of catchment characteristics on the time distribution of runoff from a catchment The situation abten arises where it is desirable to derive a unitgraph for the design of dams, large bridge, and flood mitigation works such as levees, floodways and other flood control structures, and are also used in flood forecasting, and the necessary hydrologie records are not available. In such cases, if time and funds permit, it may be desirable to install the necessary raingauges, pruviometers, and stream gaging stations, and collect the necessary data over a period of years. On the otherhand, this procedure may be found either uneconomic or impossible on the grounds of time required, and it then becomes necessary to synthesise a unitgraph from a knowledge of the physical charcteristics of the catchment. In the preparing the approach to the solution of the problem we must select a number of catchment characteristic(shape, stream pattern, surface slope, and stream slope, etc.), a number of parameters that will define the magnitude and shape of the unit graph (e.g. peak discharge, time to peak, and base length, etc.), evaluate the catch-ment characteristics and unitgraph parameters selected, for a number of catchments having adequate rainfall and stream data and obtain Correlations between the two classes of data, and assume the relationships derived in just above question apply to other, ungaged, Catchments in the same region and, knowing the physical characteritics of these catchments, substitute for them in the relation\ulcorner ships to determine the corresponding unitgraph parameters. This method described in this note, based on the routing of a time area diagram through channel storage, appears to provide a logical line of research and they allow a readier correlation of unitgraph parameters with catchment characteristics. The main disadvantage of this method appears to be the error in routing all elements of rainfall excess through the same amount of storage. evertheless, it should be noted that the synthetic unitgraph method is more accurate than the rational method since it takes account of the shape and tophography of the catchment, channel storage, and temporal variation of rainfall excess, all of which are neglected in rational method.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.2
• /
• pp.157-165
• /
• 2010

In the manufacturing industries, CAE analysis results are frequently required during the product development process for design verification. CAE data which include all related information of an analysis is, however, not efficiently shared among engineers because CAE data size is in general very large to deal with. At first, we represent a proposed lightweight format which is capable to include all the types of CAE analysis results and to support hierarchical data structure. Since each CAE system has different data structures of its own, a translator which translates to the proposed format is also represented. Unlike the design environment with CAD system, many CAE systems are used in a manufacturing company because many sorts of analysis are performed usually for a product design. Thus, lots of CAE results are generated and occupy huge size within storage, and they make it harder to manage or share many CAE results efficiently. A multi-CAE management system which is able to share many types of CAE data simultaneously using lightweight format is proposed in this paper. Finally, an implementation of the system for this will be introduced.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.3
• /
• pp.85-93
• /
• 2010

This paper proposes a new dynamic hardware allocation and binding algorithm of a simultaneous allocation and binding for SOC design automation. The proposed algorithm works on scheduled input graph and simultaneously allocates binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. This paper shows the effectiveness of the proposed algorithm by comparing experiments to determine number of function unit in advance or by comparing separated executing allocation and binding of existing system.

• Nuclear Engineering and Technology
• /
• v.44 no.7
• /
• pp.755-766
• /
• 2012

A Binary Decision Diagram (BDD) is a graph-based data structure that calculates an exact top event probability (TEP). It has been a very difficult task to develop an efficient BDD algorithm that can solve a large problem since its memory consumption is very high. Recently, in order to solve a large reliability problem within limited computational resources, Jung presented an efficient method to maintain a small BDD size by a BDD truncation during a BDD calculation. In this paper, it is first identified that Jung's BDD truncation algorithm can be improved for a more practical use. Then, a more efficient truncation algorithm is proposed in this paper, which can generate truncated BDD with smaller size and approximate TEP with smaller truncation error. Empirical results showed this new algorithm uses slightly less running time and slightly more storage usage than Jung's algorithm. It was also found, that designing a truncation algorithm with ideal features for every possible fault tree is very difficult, if not impossible. The so-called ideal features of this paper would be that with the decrease of truncation limits, the size of truncated BDD converges to the size of exact BDD, but should never be larger than exact BDD.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.7
• /
• pp.331-340
• /
• 2001

이 논문은 인과적 메시지 로깅 기법에서 결함 포용을 목적으로 안전 저장 장치(stable storage)에 저장되는 메시지 내용 로그와 메시지 순서 로그의 쓰레기 처리 기법을 제안한다. 기존의 인과적 메시지 로깅을 기반으로 한 메시지 로그 쓰레기 처리 기법은 메시지 순서 로그의 쓰레기만을 처리하였다. 메시지 내용 로그는 불필요한 복귀를 피하기 위해 유지해야 하며, 메시지내용 로그의 쓰레기 처리를 위해서는 부가적인 메시지를 필요로 하였다. 이 논문은 인과적 메시지 로깅 기법에서 메시지 내용 로그와 메시지 순서 로그가 쓰레기 처리되어지기 위해 필요한 조건을 새롭게 정의하며, 이 정의를 기반으로 한 메시지 내용 로그와 메시지 순서 로그의 쓰레기 처리 알고리즘을 제안한다. 제시된 조건을 기반으로 한 메시지 내용 로그와 메시지 순서 로그의 쓰레기 처리는 송수신 메시지에 부가된 MAG(Modified Antecednce Graph)를 이용하므로 쓰레기 처리를 위한 부가적인 메시지를 발생시키지 않는다. 하지만 제안된 기법은 일반 메시지가 송수신되기 전까지 쓰레기 처리가 지연되는 '지연 쓰레기 처리 현상(lazy garbage collection)'을 발생시킨다. 하지만 '지연 쓰레기 처리 현상'은 분산 시스템의 일관성을 위배하지 않으며, 쓰레기 처리를 위한 부가적인 메시지 교환을 필요로 하지 않는다.

• Journal of Conservation Science
• /
• v.5 no.1 s.5
• /
• pp.105-111
• /
• 1996

In order to maintain and evaluate the adequate humidity and temperature of a museum, the data of these should be periodically monitored and accumulated. For this purpose, We have designed the interpretation method of charts of the widely used thermo hydrorecorder at the museum, and developed the computer-based program (name of the program : HATH interpretation program). This method is as follows;The recording of thermo hydrorecorder(model ; Sato R-704) Input a through scanner (UMAX type), and was transformed into numerical value and was processed the statistics by HATH interpretation program. Output can be present the numerical value and the graph which are classified by a day, a month, and a year. By this method, the humidity and temperature data which were taken from 12points in the exhibition case, storage and outdoor of the Ho-Am art Museum in 1995 were processed. At the results, its ability for fast processing, management and analysis of the data was proved to be excellent.

• Journal of the Korean Society of Clothing and Textiles
• /
• v.43 no.4
• /
• pp.521-531
• /
• 2019

Uigwe Banchado are paintings of court events and royal ceremonies of the Joseon dynasty. The paintings record national events and ceremonial rituals performed by the Joseon royal family, such as marriages, celebrations, enthronements, processions to royal tombs, and archery ceremonies. This record provides a combination of information about the event's appearance, including preparation, procedure, people involved, reproductions worn by the participants, and the items used at that time. Through the realistic depictions painted in the Uigwe Banchado, in particular, one can grasp the scene of events at the time and reproduce the diverse attire worn by participants in the event. Based on 31 representative Uigwe Banchado, 550 knowledge nodes were written. These include 31 royal protocols, 41 attires, 136 clothes, 8 storage facilities, 120 objects, 55 people, 33 places and 83 concepts. The meaningful relationships between each node can be explored via a network graph. Digital illustrations of the 41 attires were created to aid in the understanding of Joseon dynasty royal ceremonial ritual attire.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.18 no.5
• /
• pp.1-8
• /
• 2019

Breath analysis using a portable device is better than the classical breath analysis system in terms of installation and operation. There is an increasing need to develop cost-effective equipment for testing gas sensors from the viewpoint of functionalities that can be applied applicable to portable devices. In the present study, an economical gas chamber for in-situ gas measurement is implemented with a single gas chamber without using expensive gas storage and control equipment; the gas response characteristics are analyzed using the above-described chamber. The main features of the implemented gas chamber are simple injection procedure, improved gas diffusion, easy measurement and cleaning, support for low-power mode measurement function for portable devices, and open source platform. Moreover, an analysis of gas response characteristics based on changes in sensor voltage show that the sensitivity and 90% response time are affected by the sensor voltage. Furthermore, the sensitivity graph has an inflection point in a specific range. The gas sensor applied in this study showed fast response speed and high sensitivity for sensor voltages of 3.0-3.5 V, regardless of the concentration of acetone gas, the target gas used in this study.