• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.3
• /
• pp.202-209
• /
• 2002

This paper deals with simplification of classification rules for data mining and rule bases for control systems. Datamining that extracts useful information from such a large amount of data is one of important issues. There are various ways in classification methodologies for data mining such as the decision trees and neural networks, but the result should be explicit and understandable and the classification rules be short and clear. The rough sets theory is an effective technique in extracting knowledge from incomplete and inconsistent data and provides a good solution for classification and approximation by using various attributes effectively This paper investigates granularity of knowledge for reasoning of uncertain concopts by using rough set approximations and uses a hierarchical classification structure that is more effective technique for classification by applying core to upper level. The proposed classification methodology makes analysis of an information system eary and generates minimal classification rules.

• The Korean Journal of Physiology
• /
• v.20 no.1
• /
• pp.103-124
• /
• 1986

Since it has been suggested that atrial receptor may be involved in the mechanism of extracellular volume regulation, it was shown that the granularity of atrial cardiocytes can be changed by water and salt depletion, and that an extract of cardiac atrial tissue, when injected intravenously into anesthetized rats, was shown to cause a large and rapid increase in renal excretion of sodium. Various natriuretic peptides were isolated and synthetized, and the effects were investigated by many workers. Most studies, however, have been carried out under anesthesia and there have teen some controversies over direct effect of the factor on the renal function. Therefore, it was attempted in this study to access the effects of an atrial extract and a synthetic natriuretic factor in unanesthetized rabbits. Intrarenal arterial infusion of atrial extract caused a rapid increase of urinary volume and excretion of sodium. Glomerular filtration rate and renal plasma flow were both increased with no change in filtration fraction. The ventricular extract produced no change in urinary excretion of electrolytes, nor in renal hemodynamics. Intrarenal infusion of synthetic atrial natriuretic factor caused increases of renal excretory rate of sodium, chloride and potassium, and $FE_{Na}$. Glomerular filtration rate, renal plasma flow increased. And free water clearance also increased. Accentuated excretory function correlated well with increased glomerular filtration rate and renal plasma flow during infusion and for 10 minutes following the cessation of the infusion. Renin secretion rate decreased during constant infusion of atrial natriuretic factor. However, no correlation was found with the changes in glomerular filtration rate, renal plasma flow, or urinary excretion of sodium. These results suggest that atrial extract or atrial natriuretic factor induces changes in renal hemodynamics, as in excretion of electrolytes either indirectly through hemodynamic changes or directly by inhibiting tubular reabsorption. At the same time, renin secretory function is affected by the factor possibly through an unknown mechanism.

• Journal of KIISE:Databases
• /
• v.32 no.1
• /
• pp.100-110
• /
• 2005

The update transactions to be executed in spatial databases usually have been known as interactive and long duration works. To improve the parallelism of concurrent updates, it needs multiple transactions concurrently update a large spatial object which has a spatial extensions larger than workspace of a client. However, under the existing locking protocols, it is not possible to concurrently update a large spatial object because of conflict of a write lock This paper proposes a partial locking scheme of enabling a transaction to set locks on parts of a big object. The partial locking scheme which is an exclusive locking scheme set by user, acquires locks for a part of the big object to restrict the unit of concurrency control to a partial object of a big object. The scheme gives benefits of improving the concurrency of un updating job for a large object because it makes the lock control granularity finer.

• The KIPS Transactions:PartC
• /
• v.13C no.4 s.107
• /
• pp.435-440
• /
• 2006

XML encryption is to provide confidentiality service, though not limited to, for web contents. XML encryption can be applied to entire data files as opaque objects, or more frequently to various parts of XML documents, supporting various encryption granularity. It is this characteristic that makes XML encryption a more efficient alternative for data confidentiality in various web applications than is possible with SSL/TLS, IPsec, PGP, or S/MIME. It is essential for successful deployment of XML encryption to achieve interoperability among the products implementing this technology, which requires the products to implement the XML encryption standards correctly. Conformance testing is to test if products implement the relevant standard correctly. In this paper we present a conformance testing method for XML encryption products and implement it. We will first look at XML encryption standards developed by W3C, and extract test criteria. Then we propose a testing method in which the encryption capability and the decryption capability of a product are tested separately. The proposed methody is actually implemented as a GUI-based testing tool and some test results are presented.

• The KIPS Transactions:PartA
• /
• v.10A no.3
• /
• pp.215-224
• /
• 2003

Since there are various networks and heterogeneity of nodes in Internet, the existing load-sharing algorithms are hardly adapted for use in Internet-based clustering systems. Therefore, in Internet-based clustering systems, a load-sharing algorithm must consider various conditions such as heterogeneity of nodes, characteristics of a network and imbalance of load, and so on. This paper has proposed an expanded-WF algorithm which is based on a WF (Weighted Factoring) algorithm for load-sharing in Internet-based clustering systems. The proposed algorithm uses an adaptive granularity strategy for load-sharing and duplicate execution of partial job for fault-tolerance. For the simulation, the to matrix multiplication using PVM is performed on the heterogeneous clustering environment which consists of two different networks. Compared to other algorithms such as Send, GSS and Weighted Factoring, the proposed algorithm results in an improvement of performance by 55%, 63% and 20%, respectively. Also, this paper shows that It can process the fault-tolerance.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1117-1123
• /
• 2015

Use The Use Case Points method is a software estimation method that is based on user requirements. When requirement analysts elicit user requirements, they obtain different use cases because different levels of detail are possible for the Use Case, and this affects the Use Case Points. In this paper, we suggest a method to refine the level of detail of the Use Case by using the concept of an elementary function. This refinement method achieves the desired reliability for the Use Case Points because it produces less of a deviation in the Use Case Points for different requirement analysts than other methods that are based on the step, transaction, and narrative of the Use Case.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.11
• /
• pp.549-560
• /
• 2001

Cluster system provides attractive scalability in terms of compution power and memory size. With the advances in high speed computer network technology, cluster systems are becoming increasingly competitive compared to expensive MPPs (massively parallel processors). Load balancing is very important issue since an inappropriate scheduling of tasks cannot exploit the true potential of the system and can offset the gain from parallelization. In parallel processing program, it is difficult to predict the load of each task before running the program. Furthermore, tasks are interdependent each other in many ways. The dynamic load balancing algorithm, which evaluates each processor's load in runtime, partitions each task into the appropriate granularity and assigns them to processors in proportion to their performance in cluster systems. However, if the communication cost between processing nodes is expensive, it is not efficient for all nodes to attend load balancing process. In this paper, we restrict a processor that attend load balancing by the communication cost and the deviation of its load from the average. We simulate various models of the cluster system with parameters such as communication cost, node number, and range of workload value to compare existing load balancing methods with the proposed dynamic algorithms.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.27 no.1
• /
• pp.7-14
• /
• 2017

Theoretically, it is known that common beliefs and/or common knowledge cannot be attained in asynchronously distributed multiagent environments, however, it show that some propositions with deadlines can be attained as common beliefs among a set of fully trusted agents even when they communicate to each other asynchronously. Generally, in the multiagent environment, the attainment of common beliefs is approached as a problem of communication, and for the common beliefs paradox that the common beliefs is not attained on a system without communication time restriction is applied to loose coarser granularity and it prove that forming common beliefs is possible by relaxing necessary requirements through the KakaoTalk chatting model. I also experimented with the reasoning function that confirms the common beliefs by inquiring about the common belief generated by implementing the inference function in each agent of the KakaoTalk chatting model. Through utilizing metalogic programming, a formalization of the presentation and reasoning of common beliefs has been achieved, and the group chatting model of KakaoTalk was adopted in experiments to show that common beliefs can be formed among distributed agents using asynchronous communication.

• Journal of the Korean Institute of Rural Architecture
• /
• v.21 no.3
• /
• pp.17-24
• /
• 2019

This study aimed to develop a mobile separating and sorting device for discharge sites to separate and sort mixed construction waste generated in small and medium scale in small provincial cities into inorganic materials and combustible materials. The study results can be summarized as follows: 1) As a result of analyzing the existing domestic technology for the separating and sorting mixed construction waste, a device sorting the waste by fusing the vibration screen, disc screen, air blowing methods and the separating and sorting the combustible waste is applied in Korea. 2) In foreign countries, the air blowing, screen, gravity sorters are used for separating and sorting combustible waste in the same way as in Korea. Especially German T Company suggests a construction waste separating and sorting system using an optical sorter. 3) As for the test device for separating and sorting mixed construction waste to be buried in landfill, the processing capacity was set as 16 tons per day. 4) For separating and sorting inorganic materials by granularity, this study set a trommel with two types of diameter as a basic. To operate the mobile all-in-one system, the device is designed to locate a conveyor, a combustible waste conveying device, inside of the trommel. 5) The device is designed in a mobile mode under the concept of primary separating and sorting device, and it can be transported using a 2.5-ton truck minimum. The diameter and length of the trommel are designed to be within 1500mm and 3000mm, respectively. In a further study, an optimized separating and sorting technology is planned to be presented through an experimental study for processing efficiency analysis at the mixed construction waste site by manufacturing the pilot experiment facility reflecting the design elements in the result of this study.

• Journal of the Korea Institute of Building Construction
• /
• v.19 no.5
• /
• pp.391-399
• /
• 2019

This study reviewed the possibility of recycling into exhausted aggregate resources in Korea as a means of utilizing coal gasification slag(CGS) from integrated gasification combined cycle(IGCC) while being commissioned in order to introduce the new system to Korea. In other words, in order to solve the problem of insufficient aggregate resources, CGS generated by IGCC as a residual aggregate for concrete secondary products, which is an empty mortar, was considered to replace CGS in the range of 0 to 100 % for mixed residual aggregate mixed with crushed sand A(CSa) of good quality and sea sand(SS) of deep particles, which are the most commonly used in the domestic construction industry. According to the study, replacing CGS with CSa or crushed sand B(CSb)+SS by 25 % to 50 % resulted in good results in the aspect of the granularity of the aggregate and the workability and compressive strength of cement mortar, which were found to be usable.