• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1993.06a
• /
• pp.1203-1206
• /
• 1993

Fuzzy techniques are applied to the positioning of an elastic beam. The advantage is that the system model is not needed. A simple fuzzy friction compensator is also used. The final position is achieved within 3/2 the period of the fundamental mode. A fuzzy set of rules is applied for large-angle positioning, with adaptations that reduce the effects of shock. In this case, the final position is achieved within two fundamental periods. There is typically some final error attributed to the dry friction.

• The Pure and Applied Mathematics
• /
• v.2 no.1
• /
• pp.25-29
• /
• 1995

The topos constructed in [6] is a set-like category that includes among its axioms an axiom of infinity and an axiom of choice. In its final form a topos is free from any such axioms. Set$\^$G/ is a topos whose object are G-set Ψ$\sub$s/:G${\times}$S\longrightarrowS and morphism f:S \longrightarrowT is an equivariants map. We already known that Set$\^$G/ satisfies the weak form of the axiom of choice but it does not satisfies the axiom of the choice.(omitted)

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.209-214
• /
• 2008

Set-valued attributes appear in many applications to model complex objects occurring in the real world. One of the most important operations on set-valued attributes is the set join, because it provides a various method to express complex queries. Currently proposed set join algorithms are based on block nested loop join in which inverted files are partitioned horizontally into blocks. Evaluating these joins are expensive because they generate intermediate partial results severely and finally obtain the final results after merging partial results. In this paper, we present an efficient processing of set join algorithm. We propose a new set join algorithm that vertically partitions inverted files into blocks, where each block fits in memory, and performs block nested loop join without producing intermediate results. Our experiments show that the vertical bitmap nested set join algorithm outperforms previously proposed set join algorithms.

• THE INTERNATIONAL COMMERCE & LAW REVIEW
• /
• v.68
• /
• pp.43-63
• /
• 2015

The number of final appeal(the rate of final appeal: 43%) has been on the increase every year over the past ten years in Korea. The number of final appeal cases given to a justice of the Korean Supreme Court amounts to nearly one everyday, which makes it vulnerable to faulty decisions. Reversal rate of final appeal is as low as 10% with most of the cases being dismissed and hence the percentage of people having trust in the judiciary is merely 27%. In this context, the Korean judiciary has announced its plan to set up a final appellate court in the Supreme Court. The establishment of final appellate court, however, is not only against the Constitution but also hardly seen in other nations. It would only overexpand the Supreme Court. Furthermore, the final appellate court would end up deteriorating into the court of fourth instance and impose extra burden on the government as well as on the disputing parties. Therefore, it is necessary to upgrade the quality of the court by increasing the number of judges in the lower court and let them focus on the fact finding process. Facilitating the ADR(Alternative Dispute Resolution) process such as arbitration would help improve the structure of the judiciary. The incompatibility among the four values of the dispute resolution process(equitability, truth, quickness and efficiency) calls for building comprehensive judicial system in which disputes are settled by choosing either jurisprudence or utility.

• International journal of advanced smart convergence
• /
• v.8 no.3
• /
• pp.46-53
• /
• 2019

When a partitioned structure is derived from a data set using a clustering algorithm, it is not unusual to have a different set of outcomes when it runs with a different order of data. This problem is known as the order bias problem. Many algorithms in machine learning fields try to achieve optimized result from available training and test data. Optimization is determined by an evaluation function which has also a tendency toward a certain goal. It is inevitable to have a tendency in the evaluation function both for efficiency and for consistency in the result. But its preference for a specific goal in the evaluation function may sometimes lead to unfavorable consequences in the final result of the clustering. To overcome this bias problems, the first clustering process proceeds to construct an initial partition. The initial partition is expected to imply the possible range in the number of final clusters. We apply the data centric sorting to the data objects in the clusters of the partition to rearrange them in a new order. The same clustering procedure is reapplied to the newly arranged data set to build a new partition. We have developed an algorithm that reduces bias effect resulting from how data is fed into the algorithm. Experiment results have been presented to show that the algorithm helps minimize the order bias effects. We have also shown that the current evaluation measure used for the clustering algorithm is biased toward favoring a smaller number of clusters and a larger size of clusters as a result.

• Journal of Environmental Science International
• /
• v.29 no.10
• /
• pp.951-959
• /
• 2020

This study aimed to re-establish the conservation area reflecting landscape ecological value through scenario program, targeting Odaesan National Park. The basic data were mapped in watershed planning units, which were set considering topographical and ecological values. The framework of Marxan with Zones, using an indexation process, was using the mapped indicators. Each best solution according to the scenarios was assessed through sensitivity analysis, and a final solution was selected among the best solutions, considering criteria including area ratio of conservation area and grouping. Lastly, the final solution was verified in the overlap analysis with recent zonation. As a result, through the framework of Marxan with Zones, the best solution of scenario 1, which was set by the highest conservation criteria was selected as the final solution, and the area ratio of conservation area and grouping was excellent. As for the overlap analysis, the suggested conservation area was improved compared to recent zonation in terms of the area ratio (39.4%), biotope grade I (35.6%) and the distribution points (7 places) of legally protected species.

• Journal of Korean Academy of Nursing
• /
• v.40 no.5
• /
• pp.631-641
• /
• 2010

Purpose: This study was done to develop standards for dementia care as a baseline for professional nurses to provide a framework for dementia care evaluation Methods: The dementia care standards were developed through a literature review and focus group discussions. According to the Delphi method, the data analysis was conducted using the Content Validity Index (CVI). Results: The final set of 18 standards on dementia care was developed through one round of CVI. The standards included four structural standards: 'Organization of nursing system', 'Operating system', 'Management of human resources', 'Management of material resources', 13 procedural standards: 'Advanced assessment', 'Nursing diagnosis', 'Nursing plam', 'Advanced nursing implementation', 'Evaluation', 'Education', 'Research', 'Consultation', 'Counseling and cooperation', 'Development of specialty', 'Utilizing resources', 'Nursing quality assurance', 'Ethics', and one standard concerning outcome ('Evaluation of nursing tasks in care of patients with dementia'). The final set of 55 criteria on care of patients with dementia was confirmed through two rounds of CVI. The final 171 indicators were confirmed through four rounds of CVI. Conclusion: These dementia care standards provides a framework that allows registered nurses to clarify their roles and tasks in the care of patients with dementia and provides evaluation criteria.

• Proceedings of the KSR Conference
• /
• 2007.11a
• /
• pp.927-939
• /
• 2007

This paper concerns dynamics of a wheel-axle set on a tangent track which was already published in a book titled "Dynamics of Railway Vehicle Systems" authored by Garg and Dukkipati [1], pointing out several missing terms and erroneous parts in the derived expressions on the conventional governing equations of motion. It is indicated that the x-direction components of normal forces at left and right wheel-rail contact points in the equilibrium axis were missed. Another point is that in deriving the creepages the disturbed velocity components in both x and y directions in the equilibrium axis should not be disregarded in the first term of the numerators. When considering the creepage in the y direction in the body coordinate system, the second term of lateral velocity at the contact point also cannot be neglected. Besides, the hyper-assumptions in the final expressions of vertical components of normal forces at left and right wheel-rail contact points have been recovered in reaching the final stage of analytical model development. Finally it is noteworthy that the process of applying creep theory is deemed to contain a little bit inconsistencies and ambiguities to be clear.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.7
• /
• pp.3397-3413
• /
• 2016

Considering that the layered cellular automata (LCA) are naturally fit for representing image data in various applications, a novel reverse iterative image encryption scheme based on LCA is proposed. Specifically, the plain image is set as the final configuration of an 8-layer CA, and some sequences derived from a random sequence are set as the pre-final configuration, which ensure that the same plain image will never be encrypted in the same way when encrypted many times. Then, this LCA is backward evolved by following some reversible two order rules, which are generated with the aid of a newly defined T-shaped neighborhood. The cipher image is obtained from the recovered initial configuration. Several analyses and experimental results show that the proposed scheme possesses a high security level and executive performance.

• Transactions of Materials Processing
• /
• v.5 no.3
• /
• pp.232-238
• /
• 1996

A dynamic mill set-up technique was developed to achieva a more precise roll gap set-up of the finishing mill stands for steel strip rolling. In the conventional mill set-up model the set-up values such as roll gap and roll speed are determined before the sheet bar reached the entry side of the finishing mill train and maintained constant until the strip top end passes through the last stand. In the way however a dynamic set-up logic that gives a way to adjust the roll gap value of the final mill stand for the strip ingoing from the ahead of the front stand was developed and attached to the existing set-up model. The roll gap modification is based on the analysis of the observation in the third stand of the finishing mill train. The dynamic set-up model was proved very effective for the more precise mill set-up and for operational stability in the hot strip finishing mill train.