• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.1-6
• /
• 1997

The scheduling problem of satisfying both 0/1 constraint and the timing constraint while minimizing the total error is NP-complete when the optional parts have arbitrary processing times. In this paper, we present a heuristic scheduling algorithm for 0/1 constraint imprecise systems which consist of communicating tasks running on multiple processors. The algorithm is based on the program graph which is similar to the one presented in[4]. To check the schedulability, we apply Lawler and Moore's theorem. To analyze the performance of the proposed algorithm, intensive simulation is done. The results of the simulation shows that the longest processing first selection strategy outperforms random or minimal laxity policies.

• Journal of the Korean Society for Precision Engineering
• /
• v.22 no.5 s.170
• /
• pp.87-94
• /
• 2005

This paper presents the development of a virtual robot design program. Robot design requires numerical software, robot solution software and multi-body dynamics software to complete several designs. However using a commercialized software implies some disadvantages, such as the waste of time and money it costs to learn how to use the software. We developed a virtual robot design program with which a user can design a robot with rapidity and reliability. The virtual robot design program is composed of robot kinematics module and robot dynamics module. The program is powerful software which may be used to solve various problems of a robot. The 3D animator and a 2D/3D graph of the program can analyze the design results into visual data. The virtual robot design program is expected to increase the competitiveness and efficiency of the robot industry.

• Korean Journal of Remote Sensing
• /
• v.23 no.3
• /
• pp.199-209
• /
• 2007

Traditionally, aerial images have been used as main sources for compiling topographic maps. In recent years, lidar data has been exploited as another type of mapping data. Regarding their performances, aerial imagery has the ability to delineate object boundaries but omits much of these boundaries during feature extraction. Lidar provides direct information about heights of object surfaces but have limitations with respect to boundary localization. Considering the characteristics of the sensors, this paper proposes an approach to extracting buildings from lidar and aerial imagery, which is based on the complementary characteristics of optical and range sensors. For detecting building regions, relationships among elevation contours are represented into directional graphs and searched for the contours corresponding to external boundaries of buildings. For generating building models, a wing model is proposed to assemble roof surface patches into a complete building model. Then, building models are projected and checked with features in aerial images. Experimental results show that the proposed approach provides an efficient and accurate way to extract building models.

• Journal of Software Assessment and Valuation
• /
• v.17 no.2
• /
• pp.125-142
• /
• 2021

Reports of rampant cross-site scripting (XSS) vulnerabilities raise growing concerns on the effectiveness of current Static Analysis Security Testing (SAST) tools as an internet security device. Attentive to these concerns, this study aims to examine seven open-source SAST tools in order to account for their capabilities in detecting XSS vulnerabilities in PHP applications and to determine their performance in terms of effectiveness and analysis runtime. The representative tools - categorized as either text-based or graph-based analysis tools - were all test-run using real-world PHP applications with known XSS vulnerabilities. The collected vulnerability detection reports of each tool were analyzed with the aid of PhpStorm's data flow analyzer. It is observed that the detection rates of the tools calculated from the total vulnerabilities in the applications can be as high as 0.968 and as low as 0.006. Furthermore, the tools took an average of less than a minute to complete an analysis. Notably, their runtime is independent of their analysis type.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.4
• /
• pp.1045-1067
• /
• 2022

Given a graph G, a {1, 3, …, 2n-1}-factor of G is a spanning subgraph of G, in which each degree of vertices is one of {1, 3, …, 2n-1}, where n is a positive integer. In this paper, we first establish a lower bound on the size (resp. the spectral radius) of G to guarantee that G contains a {1, 3, …, 2n-1}-factor. Then we determine an upper bound on the distance spectral radius of G to ensure that G has a {1, 3, …, 2n-1}-factor. Furthermore, we construct some extremal graphs to show all the bounds obtained in this contribution are best possible.

• Nuclear Engineering and Technology
• /
• v.56 no.5
• /
• pp.1603-1618
• /
• 2024

Emergency operation plans are indispensable elements for effective process safety management especially when unanticipated events occur under extreme situations. In the paper, a synthesis framework is proposed for the integration success path planning and performance analysis. Within the synthesis framework, success path planning is implemented through flow-directed signal tracing, renaming and reconstruction from a complete collection of Minimal Path Sets (MPSs) that are obtained using graph traversal search on GO-FLOW model diagram. The performance of success paths is then evaluated and prioritized according to the task complexity and probability calculation of MPSs for optimum action plans identification. Finally, an Auxiliary Feed Water System of Pressurized Water Reactor (PWR-AFWS) is taken as an example system to demonstrate the flow-directed MPSs search method for success path planning and performance analysis. It is concluded that the synthesis framework is capable of providing procedural guidance for emergency response and safety management with optimal success path planning under extreme situations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.12
• /
• pp.552-559
• /
• 2008

Computing technologies are extending the means by which people communicate. Especially, virtual worlds have recently become successful, due to rapidly improving Information Technologies. Chat is a crucial function in current virtual worlds. We need a realistic and efficient communication framework for multi-agents participating in a virtual world. The main contribution of our work is twofold. First, we propose a realistic communication framework which enables 'Complete Talk' and 'Partial Talk' in terms of spatial relationships between avatar agents. Second, our system reconstructs a dialogue graph which maintains all transcripts in the form of directed graphs with temporal(dialogue sequences) and spatial information(physical positions) about communicating agents.

• The Korean Journal of Applied Statistics
• /
• v.29 no.5
• /
• pp.849-858
• /
• 2016

It is important to control confounding bias when estimating the causal effect of treatment in an observational study. We illustrated that the covariate selection in the causal inference is different from the variable selection in the ANCOVA model. We then investigated the three criteria of covariate selection for controlling confounding bias, which can be used when we have inadequate information to draw a complete causal graph. VanderWeele and Shpitser (2011) proposed one of them and claimed it was better than the other two. We show by example that their criterion also has limitations and some disadvantages. There is no clear winner; however, their criterion is better (if some correction is made on its condition) than the other two because it can remove the confounding bias.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.1
• /
• pp.227-235
• /
• 2015

In this paper, I propose a linear time algorithm devised to produce exact solution to NP-complete maximum clique problem. The proposed algorithm firstly, from a given graph G=(V,E), sets vertex $v_i$ of the maximum degree ${\Delta}(G)$ as clique's major vertex. It then selects vertex $v_j$ of ${\Delta}(G)$ among vertices $N_G(v_i)$ that are adjacent to $v_i$, only to determine $N_G(v_i){\cap}N_G(v_j)$ as candidate cliques w and $v_k$. Next it obtains $w=w{\cap}N_G(v_k)$ by sorting $d_G(v_k)$ in the descending order. Lastly, the algorithm executes the same procedure on $G{\backslash}w$ graph to compare newly attained cliques to previously attained cliques so as to choose the lower. With this simple method, multiple independent cliques would also be attainable. When applied to various regular and irregular graphs, the algorithm proposed in this paper has obtained exact solutions to all the given graphs linear time O(n).

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.11
• /
• pp.1373-1381
• /
• 1999

이 논문에서는 통신망 설계 응용분야의 문제를 그래프 이론 문제로써 고려해 보았다. 개별 기업체가 서로 떨어진 두 곳을 연결하고자 할 때 공용통신망의 회선을 빌려 통신망을 구축하게 되는데 많은 경우 여러 종류의 회선들이 공급됨으로 어떤 회선을 선택하느냐의 문제가 생긴다. 일반적으로 빠른 회선(low delay)은 느린 회선(high delay)에 비해 비싸다. 그러나 서비스의 질(Quality of Service)이라는 요구사항이 종종 종단지연(end-to-end delay)시간에 의해 결정되므로, 무조건 낮은 가격의 회선만을 사용할 수는 없다. 결국 개별 기업체의 통신망을 위한 통로를 공용 통신망 위에 덮어씌워(overlaying) 구축하는 것의 여부는 두 개의 상반된 인자인 가격과 속도의 조절에 달려 있다. 따라서 일반적인 최소경로 찾기의 변형이라 할 수 있는 다음의 문제가 본 논문의 관심사이다. 두 개의 지점을 연결하는데 종단지연시간의 한계를 만족하면서 최소경비를 갖는 경로에 대한 해결을 위하여, 그래프 채색(coloring) 문제와 최단경로문제를 함께 포함하는 그래프 이론의 문제로 정형화시켜 살펴본다. 배낭문제로의 변환을 통해 이 문제는 {{{{NP-complete임을 증명하였고 {{{{O($\mid$E$\mid$D_0 )시간에 최적값을 주는 의사선형 알고리즘과O($\mid$E$\mid$)시간의 근사 알고리즘을 보였다. 특별한 경우에 대한 {{{{O($\mid$V$\mid$ + $\mid$E$\mid$)시간과 {{{{O($\mid$E$\mid$^2 + $\mid$E$\mid$$\mid$V$\mid$log$\mid$V$\mid$)시간 알고리즘을 보였으며 배낭 문제의 해결책과 유사한 그리디 휴리스틱(greedy heuristic) 알고리즘이 그물 구조(mesh) 그래프 상에서 좋은 결과를 보여주고 있음을 실험을 통해 확인해 보았다.Abstract This paper considers a graph-theoretic problem motivated by a telecommunication network optimization. When a private organization wishes to connect two sites by leasing physical lines from a public telecommunications network, it is often the cases that several categories of lines are available, at different costs. Typically a faster (low delay) lines costs more than a slower (high delay) line. However, low cost lines cannot be used exclusively because the Quality of Service (QoS) requirements often impose a bound on the end-to-end delay. Therefore, overlaying a path on the public network involves two diametrically opposing factors: cost and delay. The following variation of the standard shortest path problem is thus of interest: the shortest route between the two sites that meets a given bound on the end-to-end delay. For this problem we formulate a graph-theoretical problem that has both a shortest path component as well as coloring component. Interestingly, the problem could be formulated as a knapsack problem. We have shown that the general problem is NP-complete. The optimal polynomial-time algorithms for some special cases and one heuristic algorithm for the general problem are described.