• Journal of the Korea Society of Computer and Information
• /
• v.10 no.1 s.33
• /
• pp.59-66
• /
• 2005

The organization of the web is progressively more being used to improve search and analysis of information on the web as a large collection of heterogeneous documents. Most people begin at a Web search engine to find information. but the user's pertinent search results are often greatly diluted by irrelevant data or sometimes appear on target but still mislead the user in an unwanted direction. One of the intentional, sometimes vicious manipulations of Web databases is a intentionally biased web page like Google bombing that is based on the PageRank algorithm. one of many Web structuring techniques. In this thesis, we regard the World Wide Web as a directed labeled graph that Web pages represent nodes and link edges. In the Present work, we define the label of an edge as having a link context and a similarity measure between link context and target page. With this similarity, we can modify the transition matrix of the PageRank algorithm. By suggesting a motivating example, it is explained how our proposed algorithm can filter the Web intentionally biased web Pages effective about $60\%% rather than the conventional PageRank.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.117-125
• /
• 2005

The dominator tree presents the dominance frontier from directed graph to the tree. we present the effective algorithm for constructing the dominator tree from arbitrary directed graph. The reducible flow graph was reduced to dominator tree after dominator calculation. And the irreducible flow graph was constructed to dominator-join graph using join-edge information of information table. For reducing the dominator tree from dominator-join graph, we implement the effective sequency reducible algorithm and delay reducible algorithm. As a result of implementation, we can see that the delay reducible algorithm takes less execution time than the sequency reducible algorithm. Therefore, we can reduce the flow graph to dominator tree effectively.

• Journal of the Korean Society of Visualization
• /
• v.13 no.1
• /
• pp.43-48
• /
• 2015

Collective cell migration is a fundamental phenomenon observed in various biological processes such as development, wound healing, and cancer metastasis. During the collective migration, cells undergo changes in their phenotypes from those of stable to the migratory state via the process called epithelial-mesenchymal transition (EMT). Recent findings in biology and biochemistry have shown that EMT is closely related to the cancer invasion or metastasis, but not much of the correlations in kinematics and physical forces between the neighboring cells are known yet. In this study, we aim to understand the cell migration and stress distribution within the expanding cell cluster. We constructed the in vitro cell cluster on the hydrogel, employed traction force microscopy (TFM) and monolayer stress microscopy (MSM) to visualize the physical forces within the expanding cell monolayer. During the expansion, cells at the cluster edge exhibited enhanced motility and developed focal adhesions that are the essential features of EMT while cells at the core of the cluster maintained the epithelial characteristics. In the aspect of mechanical stress, the cluster edge had the highest traction force of ~90 Pa directed toward the cluster core, which means that cells at the edge actively pull the substrate to make the cluster expansion. The cluster core of the tightly confined cells by neighboring cells had a lower traction force value (~60 Pa) but the highest intercellular normal stress of ~800 Pa because of the accumulation of traction from the edge of the monolayer.

• 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.

• Journal of the Korean Academy of Esthetic Dentistry
• /
• v.10 no.1
• /
• pp.8-15
• /
• 2001

The Class III malocclusion classified in two types of Skeletal Class III and Pseudo Class III. In the case of the maxillary deficiency, the protraction H-G(facemask) with Bonded RPE can be used. For children with A-P and vertical maxillary deficiency, the preferred treatment is to move the maxilla into a more anterior and inferior position, which also increases its size as bone is added at the posterior and superior sutures. Successful forward repositioning of the maxilla can be accomplished before age 8. To resist tooth movement as much as possible, the maxillary teeth should be splinted together as a single unit. The maxillary appliance must have hooks for attachment to the facemask that are located in the canine-primary molar area above the occlusal plane. The facemask usually worn until a positive overjet of 2-5mm is achieved interincisally. Occipital chin cup is successful in those patients who can bring their incisors close to an edge-to-edge position when in centric relation. This treatment is particularly useful in patients who begin treatment with a short lower anterior facial height, as this type of treatment can lead to an increase in lower anterior facial height. If the pull of the chin cup is directed below the condyle, the force of the appliance may lead to a downward and backward rotation of the mandible.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.11a
• /
• pp.30-33
• /
• 2023

The recent scholarly focus has been directed towards the expeditious and accurate detection of salient objects, a task that poses considerable challenges for resource-limited edge devices due to the high computational demands of existing models. To mitigate this issue, some contemporary research has favored inference speed at the expense of accuracy. In an effort to reconcile the intrinsic trade-off between accuracy and computational efficiency, we present novel model for salient object detection. Our model incorporate group-wise attentive module within the decoder of the encoder-decoder framework, with the aim of minimizing computational overhead while preserving detection accuracy. Additionally, the proposed architectural design employs attention mechanisms to generate boundary information and semantic features pertinent to the salient objects. Through various experimentation across five distinct datasets, we have empirically substantiated that our proposed models achieve performance metrics comparable to those of computationally intensive state-of-the-art models, yet with a marked reduction in computational complexity.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.135-142
• /
• 2011

Unlike using the sequence-based representation for a chromosome in previous genetic algorithms for Bayesian structure learning, we proposed a matrix representation-based genetic algorithm. Since a good chromosome representation helps us to develop efficient genetic operators that maintain a functional link between parents and their offspring, we represent a chromosome as a matrix that is a general and intuitive data structure for a directed acyclic graph(DAG), Bayesian network structure. This matrix-based genetic algorithm enables us to develop genetic operators more efficient for structuring Bayesian network: a probability matrix and a transpose-based mutation operator to inherit a structure with the correct edge direction and enhance the diversity of the offspring. To show the outstanding performance of the proposed method, we analyzed the performance between two well-known genetic algorithms and the proposed method using two Bayesian network scoring measures.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.7
• /
• pp.2060-2071
• /
• 2000

Scheduling parallel tasks, represented as a Directed Acyclic Graph (DAG) or task graph, on a multiprocessor system has been an important research area in the past decades. List scheduling algorithms assign priorities to a node or an edge in an input DAG, and then generate a schedule according to the assigned priorities. This appear proposes a list scheduling algorithms with effective method of priority assignments. The paper also analyzes the worst case performance and optimality condition for the proposed algorithm. The performance comparison study shows that the proposed algorithms outperforms existing scheduling algorithms especially for input DAGs with high communication overheads. The performance improvement over existing algorithms becomes larger as the input DAG becomes more dense and the level of parallelism in the DAG is increased.

• Journal of the Korean Mathematical Society
• /
• v.53 no.3
• /
• pp.519-532
• /
• 2016

The zero-divisor graph of a noncommutative ring R, denoted by ${\Gamma}(R)$, is a graph whose vertices are nonzero zero-divisors of R, and there is a directed edge from a vertex x to a distinct vertex y if and only if xy = 0. Let $R=M_2(F_q)$ be the $2{\times}2$ matrix ring over a finite field $F_q$. In this article, we investigate the automorphism group of ${\Gamma}(R)$.

• Bulletin of the Korean Mathematical Society
• /
• v.45 no.2
• /
• pp.385-396
• /
• 2008

For a positive integer m and a digraph D, the m-step competition graph $C^m$ (D) of D has he same set of vertices as D and an edge between vertices u and v if and only if there is a vertex x in D such that there are directed walks of length m from u to x and from v to x. Cho and Kim [6] introduced notions of competition index and competition period of D for a strongly connected digraph D. In this paper, we extend these notions to a general digraph D. In addition, we study competition indices of tournaments.