• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.501-508
• /
• 2009

In this paper, we prove that folded hyper-star network FHS(2n,n) is node-symmetric and a bipartite network. We show that FHS(2n,n) can be embedded into odd network On+1 with dilation 2, congestion 1 and Od can be embedded into FHS(2n,n) with dilation 2 and congestion 1. Also, we show that $2n{\time}n$ torus can be embedded into FHS(2n,n) with dilation 2 and congestion 2.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2258-2276
• /
• 2019

Resource sharing is one of the main goals achieved by network virtualization technology to enhance network resource utilization and enable resource customization. Though resource sharing can improve network efficiency by accommodating various users in a network, limited infrastructure capacity is still a challenge to ultra-low latency service operators. In this paper, we propose an inter-slice resource borrowing schema based on the device-to-device (D2D) potentiality especially for ultra-low latency transmission in cellular networks. An extended and modified Kuhn-Munkres bipartite matching algorithm is developed to optimally achieve inter-slice resource borrowing. Simulation results show that, proper D2D user matching can be achieved, satisfying ultra-low latency (ULL) users' quality of service (QoS) requirements and resource utilization in various scenarios.

• Journal of Industrial Convergence
• /
• v.19 no.5
• /
• pp.1-11
• /
• 2021

Prior research regarding the macro patterns of industry convergence has focused on the inter-industry patent network and cross-industry movements of products or services. This article provides a novel approach, according to which human resources embodying explicit and implicit knowledge and technologies are important media driving industry convergence. Drawing on GOMS data (2015-2019) and using information of university graduates' academic majors and their occupations, this article proposes an analytic strategy by which to understand the macro patterns and structural features of industry convergence. Specifically, we build unbalanced bipartite networks of major-industry (occupation) relations, and construct the measures of the industry's niche width and the measure of the average degree of convergence of majors that each industry is linked to. By crossing the two measures, we identify four groups of industries(occupations); specialist, generalist, partial convergence, and full convergence. The convergence group is composed of industries (occupations) that acquire human resources from a number of academic majors each of which plays a role of glue connecting several local industries.

• Journal of KIISE:Software and Applications
• /
• v.31 no.10
• /
• pp.1266-1275
• /
• 2004

Bioinformatics is concerned with the creation and development of advanced information and computational technologies for problems in biology. It is divided into genomics, proteomics and metabolimics. In metabolimics, an organism is represented by metabolic pathway, i.e., well-displayed graph, and so the graph drawing tool to draw pathway well is necessary to understand it comprehensively. In this paper, we design an improved drawing algorithm. It enhances the readability by making use of the bipartite graph. Also it is possible to draw large graph properly by considering the facts that metabolic pathway graph is scale-free network and is composed of circular components, hierarchic components and linear components.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.426-431
• /
• 2005

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate many-to-many 2-DPC in a double loop network G(mn;1,m), and show that every nonbipartite G(mn;1,m), $m{\geq}3$, has 2-DPC joining any two source-sink pairs of vertices and that every bipartite G(mn;1,m) has 2-DPC joining any two source-sink pairs of black-white vertices and joining any Pairs of black-black and white-white vertices. G(mn;l,m) is bipartite if and only if n is odd and n is even.

• Journal of Ecology and Environment
• /
• v.48 no.3
• /
• pp.256-262
• /
• 2024

Background: Research investigating the relationship between latitude and network specialization plant-pollinator networks present conflicting results. While some studies indicate a positive link between latitude and network specialization, particularly in tropical regions, others suggest contradictory trends, with specialization declining towards lower latitudes. These studies underscore the intricate nature of ecological specialization in plant-pollinator networks and the need for further studies in this field to gain a more nuanced understanding of the underlying mechanisms driving these patterns. In this study, we explore the relationship between plant-pollinator network specialization and latitude using a global dataset comprising 93 plant-pollinator networks. Results: Our analysis revealed a significant relationship with latitude mostly in the Southern Hemisphere, particularly concerning metrics such as connectance and nestedness. However, notably, we found no association with H2, a metric immune to the size, shape, or sampling effects of the network and considered highly suitable for measuring network specialization in both Hemispheres. Conclusions: The absence of latitudinal trends in network specialization (H2) in both Hemispheres in this study imply that the mutual attraction between plants and pollinators remains relatively stable across various latitudes. Our comparison with prior research highlights the diversity of conclusions regarding how latitude influences plant-pollinator networks. While our results are consistent with certain studies, indicating no direct impact of latitude on network specialization, discrepancies persist.

• Journal of Communications and Networks
• /
• v.15 no.3
• /
• pp.321-328
• /
• 2013

In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.3
• /
• pp.205-225
• /
• 2022

In this paper, we derive analytical closed results for the first (a, b)-KA index, the Sombor index, the modified Sombor index, the first reduced (a, b)-KA index, the reduced Sombor index, the reduced modified Sombor index, the second reduced (a, b)-KA index and the mean Sombor index mSO_α for the OTIS biswapped networks by considering basis graphs as path, wheel graph, complete bipartite graph and r-regular graphs. Network theory plays a significant role in electronic and electrical engineering, such as signal processing, networking, communication theory, and so on. A topological index (TI) is a real number associated with graph networks that correlates chemical networks with a variety of physical and chemical properties as well as chemical reactivity. The Optical Transpose Interconnection System (OTIS) network has recently received increased interest due to its potential uses in parallel and distributed systems.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.6_1
• /
• pp.483-491
• /
• 2013

By a development of car navigation systems and mobile or positioning technology, it increases interest in location based services, especially pedestrian navigation systems. Updating of digital maps is important because digital maps are mass data and required to short updating cycle. In this paper, we proposed change detection for different network data-sets based on areal feature matching. Prior to change detection, we defined type of updating between different network data-sets. Next, we transformed road lines into areal features(block) that are surrounded by them and calculated a shape similarity between blocks in different data-sets. Blocks that a shape similarity is more than 0.6 are selected candidate block pairs. Secondly, we detected changed-block pairs by bipartite graph clustering or properties of a concave polygon according to types of updating, and calculated Fr$\acute{e}$chet distance between segments within the block or forming it. At this time, road segments of KAIS map that Fr$\acute{e}$chet distance is more than 50 are extracted as updating road features. As a result of accuracy evaluation, a value of detection rate appears high at 0.965. We could thus identify that a proposed method is able to apply to change detection between different network data-sets.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.7
• /
• pp.680-695
• /
• 1991

In this paper, the conditions on the number of required copies of a self-routing network with and without extra stages in back-to-back manner are presented respectively for a nonblocking $Multi-Log_2N$ multiconnection network. Actually the obained results hold regardless of connection patterns, i.e., whether a network deploys on-to-one connections or multiconnections. Thus open problems on the nonblocking condition for a multi $Multi-Log_2N$ multiconnection network are solved. Interestingly some of the given formulas comprise the Benes network and the Canto network as a special case repectively. A novel switching system architecture deploying a distributed calls-distribution algorithm is provided to design a nonblocking $Multi-Log_2N$ photonic switching network using a directional coupler. And a directional couplex based call holding demultiplexer is introduced to hold a call until blocking disappears in a switching network and let it enter to a network, provided that the number of switching networks is less than that of required switching networks for a nonblocking $Multi-Log_2N$ network.