• ETRI Journal
• /
• v.30 no.6
• /
• pp.856-858
• /
• 2008

Odd networks were introduced in the context of graph theory. However, their potential as fault-tolerant multiprocessor networks has been shown. Broadcasting is one of the most important communication primitives used in multiprocessor networks. In this letter, we introduce efficient one-to-all broadcasting schemes of odd networks for one-port and all-port models. We show the broadcasting time of the former is 2d-2 and that of the latter is d-1. The total time steps taken by the proposed algorithms are optimal.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.10a
• /
• pp.149-152
• /
• 2000

The chartered bus scheduling is to determine the allocation of buses to customer service requests. For the scheduling, we first represent the scheduling problem using a graph and develop a mathematical model. Second, we develop an algorithm for the scheduling problem including heuristic methods. We tested the performance of the algorithm on instances with real data. As a result, the total empty load driving time is reduced over 10% comparing with that of current practice at the company

• Management Science and Financial Engineering
• /
• v.10 no.2
• /
• pp.89-102
• /
• 2004

In this paper, we deal with a processor assignment problem that minimizes the total traffic load of an ATM switch controller by optimally assigning processors to ATM interface units. We develop an integer programming (IP) model for the problem, and devise an effective tabu search heuristic. Computational results reveal the efficacy of the proposed tabu search procedure, finding a good quality solution within 5% of optimality gap.

• Journal of applied mathematics & informatics
• /
• v.30 no.1_2
• /
• pp.49-56
• /
• 2012

In this paper we introduce two new labelings called product antimagic labeling and total product antimagic labeling for directed graphs and show the existence of the same for Cayley digraphs of 2-generated 2-groups.

• Genomics & Informatics
• /
• v.3 no.2
• /
• pp.52-54
• /
• 2005

Visualization of the homology information is an important method to analyze the evolutionary and functional meanings of genes. With a database containing model genomes of Homo sapiens, Mus muculus, and Rattus norvegicus, we constructed a web­based comparative analysis tool, BioCovi, to visualize the homology information of mammalian sequences on a very large scale. The user interface has several features: it marks regions whose identity is greater than that specified, it shows or hides gaps from the result of global sequence alignment, and it inverts the graph when total identity is higher than the threshold specified.

• Communications of the Korean Mathematical Society
• /
• v.32 no.2
• /
• pp.435-445
• /
• 2017

Let D be a directed graph with p vertices and q arcs. A vertex out-magic total labeling is a bijection f from $V(D){\cup}A(D){\rightarrow}\{1,2,{\ldots},p+q\}$ with the property that for every $v{\in}V(D)$, $f(v)+\sum_{u{\in}O(v)}f((v,u))=k$, for some constant k. Such a labeling is called a V-super vertex out-magic total labeling (V-SVOMT labeling) if $f(V(D))=\{1,2,3,{\ldots},p\}$. A digraph D is called a V-super vertex out-magic total digraph (V-SVOMT digraph) if D admits a V-SVOMT labeling. In this paper, we provide a method to find the most vital nodes in a network by introducing the above labeling and we study the basic properties of such labelings for digraphs. In particular, we completely solve the problem of finding V-SVOMT labeling of generalized de Bruijn digraphs which are used in the interconnection network topologies.

• Korean Journal of Medicinal Crop Science
• /
• v.24 no.4
• /
• pp.263-270
• /
• 2016

Background: In this study, microwave extraction was used, which is an effective method to extract useful bioactive substances as it requires low quantities of solvent and short time periods. The aim of this study was to determine the optimal extraction conditions for Agrimonia pilosa Ledeb. Methods and Results: The independent variables were ethanol concentration, microwave power, and extraction time, each of which had five levels. The dependent variables were total polyphenol and total flavonoid content, and DPPH radical scavenging activity. To determine the optimal extraction conditions for bioactive compounds, a response surface methodology was employed. Contour maps were generated from polynomial equations. The optimal conditions were then assumed by superimposing these contour maps. Based on the resulting graph, the optimal microwave extraction conditions for Agrimonia pilosa Ledeb were determined as 42 - 48% ethanol concentration, 240 - 280W microwave power, and 13 - 20 min of extraction time. Conclusions: Ethanol concentration had a significant effect on microwave extraction, in terms of total polyphenol and total flavonoid content, as well as DPPH radical scavenging activity. Microwave power and extraction time influenced the total polyphenol content, but not the total flavonoid content or the DPPH radical scavenging activity.

• Journal of KIISE:Software and Applications
• /
• v.41 no.8
• /
• pp.569-579
• /
• 2014

In a tactical-edge environment, where multiple weapon resources are coordinated together via services, it is essential to make an efficient binding between an abstract service and a resource that are needed to execute composite services for accomplishing a given mission. However, the tactical network that is used in military operation has low bandwidth and a high rate of packet loss. Therefore, communication overhead between services must be minimized to execute composite services in a stable manner in the tactical network. In addition, a tactical-edge environment changes dynamically, and it affects the connectivity and bandwidth of the tactical network. To deal with these characteristics of the tactical network we propose two service-resource reallocation methods which minimize the communication overhead between service gateways and effectively manage neutralization of gateways during distributed service coordination. We compared the effectiveness of these two - methods in terms of total communication overhead between service gateways and resource-allocation similarity between the initial resource allocation and the reallocation result.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.49 no.2
• /
• pp.134-142
• /
• 2012

This paper analyze an LDPC code replication method suitable for cloud computing. First, we determine the number of blocks suitable for cloud computing through analysis of the performance for the file availability and storage overhead. Also we determine the type of LDPC code appropriate for cloud computing through the performance for three types of LDPC codes. Finally we present the graph random generation method and the comparing method of each generated LDPC code's performance by the iterative decoding process. By the simulation, we confirmed the best graph's regularity is left-regular or least left-regular. Also, we confirmed the best graph's total number of edges are minimum value or near the minimum value.

• Journal of the Korean Society of Industry Convergence
• /
• v.14 no.3
• /
• pp.105-111
• /
• 2011

Landmark Spots in 2D gel electrophoresis are used in many methods of 2DEG spot matching. Landmark Spots are obtained manually and it is a bottle neck in the entire protein analysis process. Automated landmark spots detection is a very crucial topic in processing a massive amount of 2DGE data. In this paper, Automated landmark spot detection is proposed using point pattern matching and graph theory. Neighbor spots are defined by a graph theory to use and only a centered spot and its neighbor spots are considered for spot matching. Normalized Hausdorff distance is introduced as a criterion for measuring degree of similarity. In the conclusion, the method proposed in this paper can get about 50% of the total spot pairs and the accuracy rate is almost 100%, which the requirements of landmark spots are fully satisfied.