• 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 the Korean School Mathematics Society
• /
• v.16 no.1
• /
• pp.141-155
• /
• 2013

Process to translate into other forms in the form of expression for function is important in the development of functional thinking. Also it should be emphasized on the teaching of the function. This study will identify the translation ability of functional expressions and errors in the process to translate. The purpose of this study is to suggest important implications for the teaching and learning of function. To do this, we lead high school students perform the task to examine the translation ability. Then we compute a percentage of correct answers for each question and analyze the types of errors and their causes.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.6
• /
• pp.1330-1341
• /
• 1993

The kinematic synthesis deals with the systematic design of mechanisms for a given performance. The area of synthesis may be grouped into two categories to determine the type and to size the dimensions of a mechanism for a specified task. In this paper, using a database of mechanisms a designer can determine the type of mechanism conveniently and design equations are automatically generated for a given input performance. The solving method of design equations utilizes an optimization routine to obtain roots effectively. The linkages of 4, 6, and 8bars with revolute joints are considered in this study but may be extended to linkages of more bars.

• Journal of the Korea Society of Computer and Information
• /
• v.1 no.1
• /
• pp.147-158
• /
• 1996

This paper proposed a concurrency control structure based on specialized data flow graphs that was analysed a run-time concurrency control activity to be integrated with the task scheduler Data were viewed as flowing on the arcs from one node to another in a stream of discrete to tokens. The network that Is based upon the Entity-Relationship model, can be viewed a fixed problems used query tokens as a data flow graph. The performance was measured used in the various expriments compared the overall performance of the different concurrency control methods, DBFG (DataBase Flow graphs) scheduling had the knowledge to obtain better performance than 2PL in a distributed environment.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.1
• /
• pp.9-23
• /
• 1999

병렬 그래프 감축 모델에 있어서 투기적 연산(speculative evaluation)모델은 병렬성을 증가시키지만 불필요한 연산으로 인해 자원을 낭비할 수 있다. 투기적 태스크가 람다 연산식을 WHNF(Weak Head Normal Form)로 감축할 때, 대치과정은 그래프를 증가시킬 수 있고, 많은 복사과정을 요구할 수 있다. 이러한 투기적 태스크는 나중에 불필요한 연산이 될 수있고 이 경우 이러한 투기적 태스크에서 발생한 다른 모든 투기적 태스크들을 종료해야 하는 부담이 있다. 또한 불필요하게 된 복사과정으로 인한 기억 공간을 재사용이 가능한 상태로 만들어 주어야 한다. 본 논문은 WHNF 또는 HNF 로 감축할 대 발생할수 있는 불필요한 대치과정으로 인한 오버헤드를 줄이기 위해 대치과정이 지연된 람다 연산식 형태 (DSF : Deferred Substitution Form)를 제안한다. 이 형태는 대치과정을 필수적 태스크(mandatory task)가 수행될 때 까지 지연시키기 위한 람다 연산식 형태이다. 대치과정이 지연된 람다 연산식 형태로의 감축을 수행하는 투기적 태스크에서 , 대치과정이 존재하지 않기 때문에 그래프의 크기가 증가하지 않고 또한 복사과정을 요구하지 않는다. 따라서 연산식에 대한 대치과정이 지연된 람다 연산식 형태로의 감축이 불필요하게 된 경우 부담이 줄어들게 된다. 아울러 병렬성을 증가시키기 위한 연산모델을 제안한다.

• Journal of the Society of Naval Architects of Korea
• /
• v.46 no.4
• /
• pp.424-434
• /
• 2009

Recently, compartment design of a naval ship for efficiently utilizing the limited spaces has become more important. However, the compartment design of the naval ship was not optimized like that of a commercial ship because of a number of design requirements. Thus, the task is being manually performed using the data of parent ships and designers' experiences. To improve this procedure, an optimal compartment design system, which can generate better compartment design result with the satisfaction of various design requirements, is developed in this study. Finally, to evaluate of the applicability of the developed system, it is applied to the compartment design of a 9,000ton missile destroyer(DDG). The result shows that the developed system can yield better result than original design.

• Genomics & Informatics
• /
• v.17 no.2
• /
• pp.15.1-15.7
• /
• 2019

Automatically detecting mentions of pharmaceutical drugs and chemical substances is key for the subsequent extraction of relations of chemicals with other biomedical entities such as genes, proteins, diseases, adverse reactions or symptoms. The identification of drug mentions is also a prior step for complex event types such as drug dosage recognition, duration of medical treatments or drug repurposing. Formally, this task is known as named entity recognition (NER), meaning automatically identifying mentions of predefined entities of interest in running text. In the domain of medical texts, for chemical entity recognition (CER), techniques based on hand-crafted rules and graph-based models can provide adequate performance. In the recent years, the field of natural language processing has mainly pivoted to deep learning and state-of-the-art results for most tasks involving natural language are usually obtained with artificial neural networks. Competitive resources for drug name recognition in English medical texts are already available and heavily used, while for other languages such as Spanish these tools, although clearly needed were missing. In this work, we adapt an existing neural NER system, NeuroNER, to the particular domain of Spanish clinical case texts, and extend the neural network to be able to take into account additional features apart from the plain text. NeuroNER can be considered a competitive baseline system for Spanish drug and CER promoted by the Spanish national plan for the advancement of language technologies (Plan TL).

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.3
• /
• pp.792-812
• /
• 2022

Multi-agent systems often need to achieve the goal of learning more effectively for a task through coordination. Although the introduction of deep learning has addressed the state space problems, multi-agent learning remains infeasible because of the joint action spaces. Large-scale joint action spaces can be sparse according to implicit or explicit coordination structure, which can ensure reasonable coordination action through the coordination structure. In general, the multi-agent system is dynamic, which makes the relations among agents and the coordination structure are dynamic. Therefore, the explicit coordination structure can better represent the coordinative relationship among agents and achieve better coordination between agents. Inspired by the maximization of social group utility, we dynamically construct a factor graph as an explicit coordination structure to express the coordinative relationship according to the utility among agents and estimate the joint action values based on the local utility transfer among factor graphs. We present the application of such techniques in the scenario of multiple intelligent vehicle systems, where state space and action space are a problem and have too many interactions among agents. The results on the multiple intelligent vehicle systems demonstrate the efficiency and effectiveness of our proposed methods.

• Journal of Internet Computing and Services
• /
• v.23 no.5
• /
• pp.17-23
• /
• 2022

Network slicing is a promising paradigm and significant evolution for adjusting the heterogeneous services based on different requirements by placing dynamic virtual network functions (VNF) forwarding graph (VNFFG) and orchestrating service function chaining (SFC) based on criticalities of Quality of Service (QoS) classes. In system architecture, software-defined networks (SDN), network functions virtualization (NFV), and edge computing are used to provide resourceful data view, configurable virtual resources, and control interfaces for developing the modified deep reinforcement learning agent (MDRL-A). In this paper, task requests, tolerable delays, and required resources are differentiated for input state observations to identify the non-critical/critical classes, since each user equipment can execute different QoS application services. We design intelligent slicing for handing the cross-domain resource with MDRL-A in solving network problems and eliminating resource usage. The agent interacts with controllers and orchestrators to manage the flow rule installation and physical resource allocation in NFV infrastructure (NFVI) with the proposed formulation of completion time and criticality criteria. Simulation is conducted in SDN/NFV environment and capturing the QoS performances between conventional and MDRL-A approaches.

• Annual Conference on Human and Language Technology
• /
• 2019.10a
• /
• pp.252-257
• /
• 2019

이 논문은 한국어 Abstract Meaning Representation (AMR; 추상 의미 표상) 가이드라인 1.0^*을 소개한다. AMR은 통합적인 의미 표상 체계로, 의미 분석(semantic parsing)의 주요 Task 중 하나로 자리매김하고 있다. 한국어 AMR 가이드라인은 현행 AMR 1.2.6을 심도 있게 분석하고 이를 한국어 상황에 맞게 로컬라이징한 것이다. 해당 가이드라인은 추후 한국어 AMR 말뭉치 구축(sembanking)에 대비하여 일관된 주석 세부 지침을 제공하기 위해 작성되었다.