• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2430-2441
• /
• 2000

A visual concurrent programming environment, called ESTGVP is designed and implemented, which is easy to understand, highly portable, and can represent parallel behaviors. For our purpose, a conventional state transition graph is extended so as to enable both of synchronous and asynchronous parallel operations. We call it extended state transition graph (ESTG). ESTGVP uses the ESTG and texts for programming, and makes it easy programming sequential and parallel behaviors. Also, it is easy to understand the control structure of a program because ESTGVP is a visual programming environment based on the graph. ESTGVP is written in Tel language and thus it is highly portable on various operating systems. It consists of three major components; edition, transformation and execution. If necessary, ESTG can be transformed into C or Tel language, and its execution is based on Tel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.9
• /
• pp.1658-1667
• /
• 1994

In a cellular mobile communication control system, assignment channel for a call in a cell so as to achieve high spectral efficience is an important problem within limited frequence bandwidth. The spectral efficiency is related to the coloring problem of graph theory in a cellular mobile communication control system. In this paper, we propose channel offset scheme using a graph theory of cellular mobile communication control system and formulate chromatic bandwidth of channel offset system which is related graph coloring problem. From formulated channel assignment problem, we investgate an optimal channel offset scheme of more efficent frequence spectrum and cell design according to channel constitution and give and upper and lower bound for overall srectral bandwidth.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.9
• /
• pp.3258-3273
• /
• 2021

Malware is a severe threat to the computing system and there's a long history of the battle between malware detection and anti-detection. Most traditional detection methods are based on static analysis with signature matching and dynamic analysis methods that are focused on sensitive behaviors. However, the usual detections have only limited effect when meeting the development of malware, so that the manual update for feature sets is essential. Besides, most of these methods match target samples with the usual feature database, which ignored the characteristics of the sample itself. In this paper, we propose a new malware detection method that could combine the features of a single sample and the general features of malware. Firstly, a structure of Directed Cyclic Graph (DCG) is adopted to extract features from samples. Then the sensitivity of each API call is computed with Markov Chain. Afterward, the graph is merged with the chain to get the final features. Finally, the detectors based on machine learning or deep learning are devised for identification. To evaluate the effect and robustness of our approach, several experiments were adopted. The results showed that the proposed method had a good performance in most tests, and the approach also had stability with the development and growth of malware.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.7B
• /
• pp.1239-1251
• /
• 1999

In this paper a scalable QoS-based hierarchical inter-domain routing scheme for distributed multimedia applications in a high speed wide area network. The problem of QoS-based routing is formulated as a multicriteria shortest path problem, known as NP-complete[21,30]. Our routing scheme consists of two phases. In Phase 1, two graph construction algorithms are performed to model the network under consideration as a graph. The graph contains a part of the network topology which is completely neglected or partially considered by existing routing schemes, thus maintaining more accurate topology information. In Phase 2, a heuristic call-by-call algorithm is performed for selecting a feasible path efficiently in depth first search-like manner on the graph and tailoring to each application's QoS requirements, beginning at a vertex that represents the source node. In this paper, a simple rule is also produced, by which the visiting order of outgoing edges at each vertex on the graph is determined. The rule is based on each edge's the minimum normalized slackness to the QoS requested. The proposed routing scheme extends the PNNI-type hierarchical routing framework. Note that our routing scheme is one of a few QoS-based hierarchical routing schemes that address explicitly the issue of selecting a path with multiple metrics.

• Spatial Information Research
• /
• v.21 no.5
• /
• pp.63-72
• /
• 2013

This paper analyzed the flood propagation characteristics of each flood elevation due to failure of embankment in Muju Namdae Stream using recursive call algorithm. A flood propagation order by the flood elevation was estimated by setting destruction point at Beonggu and Chasan small dam through recursive call algorithm and then, the number of grids of each flood propagation order and accumulated inundation area were calculated. Based on the flood propagation order and the grid size of DEM, flood propagation time could be predicted each flood elevation. As a result, the study could identify the process of flood propagation through distribution characteristic of the flood propagation order obtained from recursive call algorithm, and could provide basic data for protection from flood disaster by selecting the flood vulnerable area through the gradient pattern of the graph for accumulated inundation area each flood propagation order. In addition, the prediction of the flood propagation time for each flood water level using this algorithm helped provide valuable information to calculate the evacuation path and time during the flood season by predicting the flood propagation time of each flood water level.

• Journal of applied mathematics & informatics
• /
• v.33 no.1_2
• /
• pp.101-110
• /
• 2015

A Total Mean Cordial labeling of a graph G = (V, E) is a function $f:V(G){\rightarrow}\{0,1,2\}$ such that $f(xy)={\Large\lceil}\frac{f(x)+f(y)}{2}{\Large\rceil}$ where $x,y{\in}V(G)$, $xy{\in}E(G)$, and the total number of 0, 1 and 2 are balanced. That is ${\mid}ev_f(i)-ev_f(j){\mid}{\leq}1$, $i,j{\in}\{0,1,2\}$ where $ev_f(x)$ denotes the total number of vertices and edges labeled with x (x = 0, 1, 2). If there is a total mean cordial labeling on a graph G, then we will call G is Total Mean Cordial. Here, We investigate the Total Mean Cordial labeling behaviour of prism, gear, helms.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.39 no.2
• /
• pp.131-140
• /
• 2014

Customer networks go through constant changes. They may expand or shrink once they are formed. In dynamic environments, it is a critical corporate challenge to identify and manage influential customer groups in a cost effective way. In this context, we apply inverse optimization theory to suggest an efficient method to manage customer networks. In this paper, we assume that there exists a subset of nodes that might have a large effect on the network and that the network can be modified via some strategic actions. Rather than making efforts to find influential nodes whenever the network changes, we focus on a subset of selective nodes and perturb as little as possible the interaction between nodes in order to make the selected nodes influential in the given network. We define the following problem based on the inverse optimization. Given a graph and a prescribed node subset, the objective is to modify the structure of the given graph so that the fixed subset of nodes becomes a minimum dominating set in the modified graph and the cost for modification is minimum under a fixed norm. We call this problem the inverse dominating set problem and investigate its computational complexity.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.809-817
• /
• 2009

We call a cycle C be a small cycle if the length of C equals to 3 or 4. In this paper, we obtain two sufficient conditions to ensure the existence of vertex-disjoint small cycles in graph and propose several problems.

• Annual Conference of KIPS
• /
• 2012.04a
• /
• pp.1213-1214
• /
• 2012

Global variables can be read or modified by any part of the program, making it difficult to remember or reason about every possible use. Sometime it has tight couplings between some of other variables, and couplings between variables and functions. The main focus of this paper is to use call graph and the control flow analysis to design a model from where we generate the test cases for testing global variables.

• Journal of the Chungcheong Mathematical Society
• /
• v.23 no.4
• /
• pp.657-661
• /
• 2010

We study a singular function which we call a generalized cylinder convex(concave) function induced from different generalized dyadic expansion systems on the unit interval. We show that the generalized cylinder convex(concave)function is a singular function and the length of its graph is 2. Using a local dimension set in the unit interval, we give some characterization of the distribution set using its derivative, which leads to that this singular function is nowhere differentiable in the sense of topological magnitude.