• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.193-203
• /
• 2007

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.240-242
• /
• 2009

A computationally efficient implementation of the progressive edge-growth algorithm is presented. This implementation uses an array of red-black (RB) trees to manage the layered structure of check nodes and adopts a new strategy to expand the Tanner graph. The complexity analysis and the simulation results show that the proposed approach reduces the computational effort effectively. In constructing a low-density parity check code with a length of $10^4$, the RB-tree-array-based implementation takes no more 10% of the time required by the original method.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.6
• /
• pp.1275-1281
• /
• 2011

Many authors studied cooperative games that arise from variants of dominating set games on graphs. In wireless networks, the connected dominating set is used to reduce routing table size and communication cost. In this paper, we introduce a connected dominating set game to model the cost allocation problem arising from a connected dominating set on a given graph and study its core. In addition, we give a polynomial time algorithm for determining the balancedness of the game on a tree, for finding a element of the core.

• Journal of the Korean Mathematical Society
• /
• v.58 no.5
• /
• pp.1261-1277
• /
• 2021

An inertial manifold is often constructed as a graph of a function from low Fourier modes to high ones and one used to consider backward bounded (in time) solutions for that purpose. We here show that the proof of the uniqueness of such solutions is crucial in the existence theory of inertial manifolds. Avoiding contraction principle, we mainly apply the Arzela-Ascoli theorem and Laplace transform to prove their existence and uniqueness respectively. A non-self adjoint example is included, which is related to a differential system arising after Kwak transform for Navier-Stokes equations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.612-627
• /
• 2009

The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2003.05a
• /
• pp.271-285
• /
• 2003

In the conduct of this study, a web-enabled healthcare system for the management of hypertension was implemented through a hyperlink-based inference approach. The hyperlink-based inference platform implemented using the hypertext capacity of HTML which ensured accessibility, multimedia facilities, fast response, stability, ease of use and upgrade, and platform independency of expert systems. Many HTML documents, which are hyperlinked to each other based on expert rules, were uploaded beforehand to perform the hyperlink-based inference. The HTML documents were uploaded and maintained automatically by our proprietary tool called the Web-Based inference System (WeBIS) that supports a graphical user interface (GUI) for the input and edit of decision graphs. Nevertheless, the editing task of the decision graph using the GUI tool is a time consuming and tedious chore when the knowledge engineer must perform it manually. Accordingly, this research implemented an automatic generator of the decision graph for the management of hypertension. As a result, this research suggests a methodology for the development of Web-enabled healthcare systems using the hyperlink-based inference approach and, as an example, implements a Web-enabled healthcare system for hypertension, a platform which peformed especially well in the areas of speed and stability.

• Food Science and Preservation
• /
• v.6 no.1
• /
• pp.29-36
• /
• 1999

Using Fuji apple fruits cultivated in Kyungpook prefecture, the calibration model for firmness evaluation of fruits by near infrared(NIR) reflectance spectroscopy was developed, and the various influence factors such as instrument variety, measuring method, sample group, apple peel and selection of firmness point were investigated. Spectra of sample were recorded in wavelength range of 1100∼2500nm using NIR spectrometer (InfraAlyzer 500), and data were analyzed by stepwise multiple linear regression of IDAS program. The accuracy of calibration model was the highest when using sample group with wide range, and the firmness mean values obtained in graph by texture analyser(TA) were used as standard data. Chemometrics models were developed using a calibration set of 324 samples and an independent validation set of 216 samples to evaluate the predictive ability of the models. The correlation coefficients and standard error of prediction were 0.84 and 0.094kg, respectively. Using developed calibration model, it was possible to monitor the firmness change of fruits during storage frequently. Time, which was reached to firmness high value in graph by TA, is possible to use as new parameter for freshness of fruit surface during storage.

• Journal of the Korean School Mathematics Society
• /
• v.6 no.1
• /
• pp.101-113
• /
• 2003

The purpose of this study is to analyze students misunderstood types relate to trigonometric function and to devise its teaching method using GSP. To do this, we performed several steps as followings: First, we performed questionnaire survey to 70 students belong to second year at high school to find students comprehension degree about radian angle representation and trigonometric function graph. Second, we devised the teaching-learning materials relate to trigonometric function graph using GSP. And then, we used them in the class of 35 students who are at the time to learn trigonometric function in the first year at high school. Third, we conducted Questionnaire survey to students studied through teaching and learning materials using GSP. As a result of doing the survey, we found that general students were interested in the class using GSP and they could also operate computer without difficulty.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2865-2870
• /
• 2015

Recently, due to the hardware computing enhancement such as quantum computers, the amount of information that can be processed in a short period of time is growing exponentially. The cryptography system proposed by Koblitz and Fellows has a problem that it can not be guaranteed that the problem finding perfect dominating set is NP-complete in specific 3-regular graphs because the number of invariant polynomial can not be generated enough. In this paper, we propose an enhanced method to improve the vulnerability in 3-regular graph by generating plenty of invariant polynomials.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.10
• /
• pp.988-995
• /
• 2008

A consensus-based feedback linearization method is proposed to maintain a specified time-varying geometric configuration for formation flying of multiple autonomous vehicles. In this approach, there exists no explicit leader in the team, and the proposed control strategy requires only the local neighbor-to-neighbor information between vehicles. The information flow topology between the vehicles is defined by Graph Laplacian matrix, and the formation flying can be achieved by the proposed feedback linearization with consensus algorithm. The stability analysis of the proposed controller is also performed via eigenvalue analysis for the closed-looop system. Numerical simulation is performed for rotary-wing type micro aerial vehicles to validate the performance of the proposed controller.