• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.925-926
• /
• 2006

In the multi-agent system for a single task, the action selection can be made for the real-time environment by using the global coordination space, global coordination graph and MAX-PLUS algorithm. However, there are some difficulties in multi-agent system for multi-tasking. In this paper, a real-time decision making method is suggested by using coordination space, coordination graph and dynamic coordinated state of multi-agent system including many agents and multiple tasks. Specifically, we propose locally dynamic coordinated state to effectively use MAX-PLUS algorithm for multiple tasks completion. Our technique is shown to be valid in the box pushing simulation of a multi-agent system.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.1
• /
• pp.44-52
• /
• 2008

In this paper we consider detecting collisions between characters whose motion is specified by motion capture data. Since we are targeting on massive crowd simulation, we only consider rough collisions, modeling the characters as a disk in the floor plane. To provide efficient collision detection, we introduce a hierarchical bounding volume, the Motion Oriented Bounding Box tree (MOBB tree). A MOBBtree stores space-time bounds of a motion clip. In crowd animation tests, MOBB trees performance improvements ranging between two and an order of magnitude.

• The Journal of the Convergence on Culture Technology
• /
• v.9 no.1
• /
• pp.649-654
• /
• 2023

This paper proposes the design of a neural network structure search model using graph convolutional neural networks. Deep learning has a problem of not being able to verify whether the designed model has a structure with optimized performance due to the nature of learning as a black box. The neural network structure search model is composed of a recurrent neural network that creates a model and a convolutional neural network that is the generated network. Conventional neural network structure search models use recurrent neural networks, but in this paper, we propose GC-NAS, which uses graph convolutional neural networks instead of recurrent neural networks to create convolutional neural network models. The proposed GC-NAS uses the Layer Extraction Block to explore depth, and the Hyper Parameter Prediction Block to explore spatial and temporal information (hyper parameters) based on depth information in parallel. Therefore, since the depth information is reflected, the search area is wider, and the purpose of the search area of the model is clear by conducting a parallel search with depth information, so it is judged to be superior in theoretical structure compared to GC-NAS. GC-NAS is expected to solve the problem of the high-dimensional time axis and the range of spatial search of recurrent neural networks in the existing neural network structure search model through the graph convolutional neural network block and graph generation algorithm. In addition, we hope that the GC-NAS proposed in this paper will serve as an opportunity for active research on the application of graph convolutional neural networks to neural network structure search.

• Korean Journal of Mathematics
• /
• v.25 no.2
• /
• pp.279-301
• /
• 2017

An L(3, 2, 1)-labeling for the graph G = (V, E) is an assignment f of a label to each vertices of G such that ${\mid}f(u)-f({\upsilon}){\mid}{\geq}4-k$ when $dist(u,{\upsilon})=k{\leq}3$. The L(3, 2, 1)-labeling number, denoted by ${\lambda}_{3,2,1}(G)$, for G is the smallest number N such that there is an L(3, 2, 1)-labeling for G with span N. In this paper, we compute the L(3, 2, 1)-labeling number ${\lambda}_{3,2,1}(G)$ when G is a cylindrical grid, which is the cartesian product $P_m{\Box}C_n$ of the path and the cycle, when $m{\geq}4$ and $n{\geq}138$. Especially when n is a multiple of 4, or m = 4 and n is a multiple of 6, then we have ${\lambda}_{3,2,1}(G)=11$. Otherwise ${\lambda}_{3,2,1}(G)=12$.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.9
• /
• pp.858-862
• /
• 2015

This paper presents a new forward-viewing mono-camera based obstacle detection algorithm for mobile robots. The proposed method extracts the coarse location of an obstacle in an image using inverse perspective mapping technique from sequential images. In the next step, graph-cut based image labeling is conducted for estimating the exact obstacle boundary. The graph-cut based labeling algorithm labels the image pixels as either obstacle or floor as the final outcome. Experiments are performed to verify the obstacle detection performance of the developed algorithm in several examples, including a book, box, towel, and flower pot. The low illumination condition, low color contrast between floor and obstacle, and floor pattern cases are also tested.

• Journal of the Korean School Mathematics Society
• /
• v.4 no.1
• /
• pp.103-114
• /
• 2001

The purpose of this study is to develop learning materials for functional concept on variable and to verify the effect of how well students could learn functional concept after they studied with those materials. To accomplish the purpose of this study, I developed learning materials and after teaching students with them. I have concluded the followings : First, there was little effect in teaching functional concept on variable between two experimental groups, whereas teaching functional concept had greater effect on forming functional concept in high level groups in those two experimental groups. Second, teaching functional concept on variable had little effect on students' understanding of functional concept and perfecting tables in Black box, graph, and mathematical problems, whereas there was much effect in students' understanding functional concept and solving relation formula, image, and range problems related to everyday life or general things. On the basis of the problems which appeared in the process of this study, the following can be suggested : First, we should develop learning materials fit for low level students so that they could understand functional concept. Second, we should continue to teach the basic problems like solving relation formula, image, and range, and understanding functional concept in graph until students are able to understand them exactly. Third, since the goals of Unit Function in a middle school textbook is to solve problems related to everyday life through functional thinking, there should be change in constructing systematic contents of Unit Function in a middle school textbook.

• Journal of the Korean Chemical Society
• /
• v.58 no.2
• /
• pp.198-204
• /
• 2014

In this present study, bagasse based pulp and paper industry wastewater was treated under different operating conditions such as initial pH (6-8), temperature ($25-35^{\circ}C$) and contact time (3-7 days) by using Bacillus subtilis. Response surface methodology (RSM) coupled with Box-Behnken response surface design (BBD) was employed to investigate the effect of process variables on the responses such as turbidity, biological oxygen demand (BOD) and chemical oxygen demand (COD) removal. The experimental data were analyzed by Pareto analysis of variance (ANOVA) and the second order polynomial models were developed. Interactive effects of the process variables on the responses were studied using plotting 3D response surface contour graph and the optimum process conditions were found to be: initial pH of 7, temperature of $30^{\circ}C$ and contact time of 5 days. Under these conditions, removal efficiencies of turbidity, BOD and COD were found to be 85%, 93% and 80% respectively which are close agreement with real experiments. These results indicate that the treatment of bagasse based pulp and paper industry wastewater using Bacillus subtilis is an effective and novel technique.

• ETRI Journal
• /
• v.42 no.3
• /
• pp.433-445
• /
• 2020

A denial-of-service (DoS) attack is a serious attack that targets web applications. According to Imperva, DoS attacks in the application layer comprise 60% of all the DoS attacks. Nowadays, attacks have grown into application- and business-layer attacks, and vulnerability-analysis tools are unable to detect business-layer vulnerabilities (logic-related vulnerabilities). This paper presents the business-layer dynamic application security tester (BLDAST) as a dynamic, black-box vulnerability-analysis approach to identify the business-logic vulnerabilities of a web application against DoS attacks. BLDAST evaluates the resiliency of web applications by detecting vulnerable business processes. The evaluation of six widely used web applications shows that BLDAST can detect the vulnerabilities with 100% accuracy. BLDAST detected 30 vulnerabilities in the selected web applications; more than half of the detected vulnerabilities were new and unknown. Furthermore, the precision of BLDAST for detecting the business processes is shown to be 94%, while the generated user navigation graph is improved by 62.8% because of the detection of similar web pages.

• Computational Structural Engineering
• /
• v.9 no.3
• /
• pp.97-105
• /
• 1996

An integrated environment for optimum design has been developed using Motif. The integrated environment is composed of the preprocessor, the postprocessor and the optimization part. The preprocessor is part of making a finite element model for optimum structural design and the postprocessor displays results of optimum design and the optimization part is the part which execute optimization. It is designed to reduce user's difficulties in structural optimum design. It used Graphic User Interface for the concurrent representation of various inputs and outputs through the dialog box, mouse and keyboard. Structural optimum design can be done easily through dialog box, menu, concurrent representation of modeling process and results of structural optimum design can be understood easily through stress contour, deformed model and graph of cost function.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.12 no.2
• /
• pp.175-181
• /
• 2004

Analysis of brake characteristics has progressed rapidly in recent years, as computer techniques have developed. However, there are many problems in predicting braking characteristics, due to the numerous design variables of the brake system. Therefore, a synthetic braking performance analysis is required for all brake system parts such as master cylinder, booster, control valve and split system. In this paper, a program which can analyze braking performance such as force distribution, braking efficiency, pedal force and pedal travel, is presented. The preprocessor of the program helps users prepare input files through a dialog box. An additional postprocessor makes the graph presentation of solved results. Also, a simple example problem is applied to show the usefulness of the presented program.