• Title/Summary/Keyword: Sub-path

Search Result 498, Processing Time 0.024 seconds

MORE RELATIONS BETWEEN λ-LABELING AND HAMILTONIAN PATHS WITH EMPHASIS ON LINE GRAPH OF BIPARTITE MULTIGRAPHS

  • Zaker, Manouchehr
    • Bulletin of the Korean Mathematical Society
    • /
    • v.59 no.1
    • /
    • pp.119-139
    • /
    • 2022
  • This paper deals with the λ-labeling and L(2, 1)-coloring of simple graphs. A λ-labeling of a graph G is any labeling of the vertices of G with different labels such that any two adjacent vertices receive labels which differ at least two. Also an L(2, 1)-coloring of G is any labeling of the vertices of G such that any two adjacent vertices receive labels which differ at least two and any two vertices with distance two receive distinct labels. Assume that a partial λ-labeling f is given in a graph G. A general question is whether f can be extended to a λ-labeling of G. We show that the extension is feasible if and only if a Hamiltonian path consistent with some distance constraints exists in the complement of G. Then we consider line graph of bipartite multigraphs and determine the minimum number of labels in L(2, 1)-coloring and λ-labeling of these graphs. In fact we obtain easily computable formulas for the path covering number and the maximum path of the complement of these graphs. We obtain a polynomial time algorithm which generates all Hamiltonian paths in the related graphs. A special case is the Cartesian product graph Kn☐Kn and the generation of λ-squares.

Analysis of Flow Performance According to Actuator Geometry of Receptacle for Hydrogen Charging System with Filter Applied (필터가 장착된 수소충전시스템용 리셉터클의 작동부 형상에 따른 유동 성능 분석)

  • JU HWAN CHOI; GU HO KIM;JAE KWANG KIM;YONG KI KIM;HYUN KYU SUH
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.34 no.1
    • /
    • pp.17-25
    • /
    • 2023
  • The purpose of this study was to propose a design that shows optimal performance by changing the geometry of the internal flow path of the receptacle in order to prevent the decrease in flow rate and differential pressure performance due to the application of the receptacle in the hydrogen charging system. To achieve this, 3D computational fluid dynamics simulation was performed for the receptacle, according to the geometry of the flow path inside the receptacle. The pressure results at the inlet and outlet were measured the same as both of N and H2 in the experiment, and the flow rate of H2 was 3.75 times higher than that of N2. In addition, since the flow performance of the receptacle improved under conditions where the flow path was widened, it was confirmed that reducing the diameter of the poppet and the width of the guide are advantageous for improving performance.

A WEIGHTED-PATH FOLLOWING INTERIOR-POINT ALGORITHM FOR CARTESIAN P(κ)-LCP OVER SYMMETRIC CONES

  • Mansouri, Hossein;Pirhaji, Mohammad;Zangiabadi, Maryam
    • Communications of the Korean Mathematical Society
    • /
    • v.32 no.3
    • /
    • pp.765-778
    • /
    • 2017
  • Finding an initial feasible solution on the central path is the main difficulty of feasible interior-point methods. Although, some algorithms have been suggested to remedy this difficulty, many practical implementations often do not use perfectly centered starting points. Therefore, it is worth to analyze the case that the starting point is not exactly on the central path. In this paper, we propose a weighted-path following interior-point algorithm for solving the Cartesian $P_{\ast}({\kappa})$-linear complementarity problems (LCPs) over symmetric cones. The convergence analysis of the algorithm is shown and it is proved that the algorithm terminates after at most $O\((1+4{\kappa}){\sqrt{r}}{\log}{\frac{x^0{\diamond}s^0}{\varepsilon}}\)$ iterations.

Muli-path Constraint-based Routing Algorithms for MPLS Traffic Engineering (MPLS 트래픽 엔지니어링을 위한 다중경로 Constraint-based 라우팅 알고리즘)

  • Lee, Jae-Young;Kim, Byung-Chul
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5B
    • /
    • pp.508-519
    • /
    • 2004
  • This paper proposed two multi-path constraint-based routing algorithms for Internet traffic engineering using MPLS. In normal constraint-based shortest path first (CSPF) routing algorithm, there is a high probability that it cannot find the required path through networks for a large bandwidth constraint that is one of the most important constraints for traffic engineering, The proposed algorithms can divide the bandwidth constraint into two or more sub-constraints and find a constrained path for each sub-constraint, if there is no single path satisfying the whole constraint. Extensive simulations show that they enhance the success probability of path setup and the utilization of network resources.

A study on statistical characteristics of time-varying underwater acoustic communication channel influenced by surface roughness (수면 거칠기에 따른 수면 경로의 시변 통신채널 통계적 특성 분석)

  • In-Seong Hwang;Kang-Hoon Choi;Jee Woong Choi
    • The Journal of the Acoustical Society of Korea
    • /
    • v.42 no.6
    • /
    • pp.491-499
    • /
    • 2023
  • Scattering by Sea surface roughness occurs due to sea level roughness, communication performance deteriorates by causing frequency spread in communication signals and time variation in communication channels. In order to compare the difference in time variation of underwater acoustic communication channel according to the surface roughness, an experiment was performed in a tank owned by Hanyang University Ocean Acoustics Lab. Artificial surface roughness was created in the tank and communication signals with three bandwidths were used (8 kHz, 16 kHz, 32 kHz). The measured surface roughness was converted into a Rayleigh parameter and used as a roughness parameter, and statistical analysis was performed on the time-varying channel characteristics of the surface path using Doppler spread and correlation time. For the Doppler spread of the surface path, the Weighted Root Mean Square Doppler spread (wfσν) that corrected the effect of the carrier frequency and bandwidth of the communication signal was used. Using the correlation time of the surface path and the energy ratio of the direct path and the surface path, the correlation of total channels was simulated and compared with the measured correlation time of total channels. In this study, we propose a method for efficient communication signal design in an arbitrary marine environment by using the time-varying characteristics of the sea surface path according to the sea surface roughness.

Gastric juice and Realgar and Orpiment Mineral Medicine Reaction; Reaction Path and Speciation Modeling in Human Body (웅황과 자황의 소화 반응과 인체내 존재형태에 대한 예측 모델링)

  • Kim Sun Ok;Park Maeng Eon;Shin Soon Shik;Kim Gyeang Cheol
    • Journal of Physiology & Pathology in Korean Medicine
    • /
    • v.16 no.2
    • /
    • pp.365-372
    • /
    • 2002
  • The mineral medicines mean a sort of mineral or rock for medical treatment and natural material using their chemical components and physical properties. In this study, it was apprehended the mineralogical characteristics of As-bearing group mineral medicines. The extraction test is an vitro test system for predicting the bioavailability of the major and minor elements from mineral medicines and incorporates gastrointestinal tract parameters representative of a human(including stomach and small intestinal pH, stomach mixing time and velocity). The results of the extraction test are used for reaction path modeling in human body. Reaction path modeling in human body can predict digestion with gastric juice as well as bioavailability, speciation. Also, it can predict accumulation of arsenic as pH condition. As the results of the extraction test for digestion, the amounts of Fe extraction was the highest, followed by As, Ca, Ni. In addition, as the results of the reaction path modeling between arsenic compounds and gastric juice using thermodynamic data, when absorbed, major species are followed by H₃As₃S/sub 6/(aq), As₃S/sub 6/ (aq), AsO/sup +/, H₂As₃S/sup 6-/, H₂AsO/sup 3-/, HAs₃S6/sup 2-/, HAsO/sub 3//sup 2-/ and AsO/sub 3//sup 3-/. Specifically the concentration of H₃As₃S/sub 6/(aq) is the highest. As pH increases, the concentration of H₂AsO/sup 3-/, HAsO/sub 3//sup 2-/, HAsO/sub 3//sup 3-/, HAs₃S/sub 6//sup 2-/, H₂As₃S/sup 6-/, and H₃As₃S/sub 6/ increases, whereas the concentration of H₃As₃S/sub 6/ and AsO/sup +/ decreases. On the results of this study, it is able to find out effective and toxic components of poisonous arsenic group of mineral medicines and expected to be widely used for the development of new medicines.

k-PRIME CORDIAL GRAPHS

  • PONRAJ, R.;SINGH, RAJPAL;KALA, R.;NARAYANAN, S. SATHISH
    • Journal of applied mathematics & informatics
    • /
    • v.34 no.3_4
    • /
    • pp.227-237
    • /
    • 2016
  • In this paper we introduce a new graph labeling called k-prime cordial labeling. Let G be a (p, q) graph and 2 ≤ p ≤ k. Let f : V (G) → {1, 2, . . . , k} be a map. For each edge uv, assign the label gcd (f(u), f(v)). f is called a k-prime cordial labeling of G if |vf (i) − vf (j)| ≤ 1, i, j ∈ {1, 2, . . . , k} and |ef (0) − ef (1)| ≤ 1 where vf (x) denotes the number of vertices labeled with x, ef (1) and ef (0) respectively denote the number of edges labeled with 1 and not labeled with 1. A graph with a k-prime cordial labeling is called a k-prime cordial graph. In this paper we investigate the k-prime cordial labeling behavior of a star and we have proved that every graph is a subgraph of a k-prime cordial graph. Also we investigate the 3-prime cordial labeling behavior of path, cycle, complete graph, wheel, comb and some more standard graphs.

An Advanced RFID Localization Algorithm Based on Region Division and Error Compensation

  • Li, Junhuai;Zhang, Guomou;Yu, Lei;Wang, Zhixiao;Zhang, Jing
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.4
    • /
    • pp.670-691
    • /
    • 2013
  • In RSSI-based RFID(Radio Frequency IDentification) indoor localization system, the signal path loss model of each sub-region is different from others in the whole localization area due to the influence of the multi-path phenomenon and other environmental factors. Therefore, this paper divides the localization area into many sub-regions and constructs separately the signal path loss model of each sub-region. Then an improved LANDMARC method is proposed. Firstly, the deployment principle of RFID readers and tags is presented for constructing localization sub-region. Secondly, the virtual reference tags are introduced to create a virtual signal strength space with RFID readers and real reference tags in every sub-region. Lastly, k nearest neighbor (KNN) algorithm is used to locate the target object and an error compensating algorithm is proposed for correcting localization result. The results in real application show that the new method enhances the positioning accuracy to 18.2% and reduces the time cost to 30% of the original LANDMARC method without additional tags and readers.

Thickness and Annealing Effects on the Thermoelectric Properties of P-type Bi0.5Sb1.5Te3 Thin Films (P형 Bi0.5Sb1.5Te3 박막의 열전 특성에 미치는 두께 및 어닐링 효과)

  • Kim Il-Ho;Jang Kyug-Wook
    • Korean Journal of Materials Research
    • /
    • v.14 no.1
    • /
    • pp.41-45
    • /
    • 2004
  • P-type $Bi_{0.5}$$Sb_{1.5}$ $Te_3$ thin films were deposited by the flash evaporation technique, and their thermoelectric properties and electronic transport parameters were investigated. The effective mean free path model was adopted to examine the thickness effect on the thermoelectric properties. Annealing effects on the carrier concentration and mobility were also studied, and their variations were analyzed in conjunction with the antisite defects. Seebeck coefficient and electrical resistivity versus inverse thickness showed a linear relationship, and the effective mean free path was found to be 3150$\AA$. No phase transformation and composition change were observed after annealing treatment, but carrier mobility increased due to grain growth. Carrier concentration decreased considerably due to reduction of the antisite defects, so that electrical conductivity decreased and Seebeck coefficient increased. When annealed at 473 K for 1 hr, Seebeck coefficient and electrical conductivity were $160\mu$V/K and 610 $W^{-1}$ $cm^{ -1}$, respectively. Therefore, the thermoelectric quality factor were also enhanced to be $16\mu$W/cm $K^2$.>.

Finding Optimal Small Networks by Mathematical Programming Models (수리계획 모형을 이용한 최적의 작은 네트워크 찾기)

  • Choi, Byung-Joo;Lee, Hee-Sang
    • IE interfaces
    • /
    • v.21 no.1
    • /
    • pp.1-7
    • /
    • 2008
  • In this paper we study the Minimum Edge Addition Problem(MEAP) to decrease the diameter of a graph. MEAP can be used for improving the serviceability of telecommunication networks with a minimum investment. MEAP is an NP-hard optimization problem. We present two mathematical programming models : One is a multi-commodity flow formulation and the other is a path partition formulation. We propose a branch-and-price algorithm to solve the path partition formulation to the optimality. We develop a polynomial time column generation sub-routine conserving the mathematical structure of a sub problem for the path partition formulation. Computational experiments show that the path partition formulation is better than the multi-commodity flow formulation. The branch-and-price algorithm can find the optimal solutions for the immediate size graphs within reasonable time.