• Title/Summary/Keyword: common path

Search Result 318, Processing Time 0.025 seconds

ON PATHOS BLOCK LINE CUT-VERTEX GRAPH OF A TREE

  • Nagesh, Hadonahalli Mudalagiraiah
    • Communications of the Korean Mathematical Society
    • /
    • v.35 no.1
    • /
    • pp.1-12
    • /
    • 2020
  • A pathos block line cut-vertex graph of a tree T, written P BLc(T), is a graph whose vertices are the blocks, cut-vertices, and paths of a pathos of T, with two vertices of P BLc(T) adjacent whenever the corresponding blocks of T have a vertex in common or the edge lies on the corresponding path of the pathos or one corresponds to a block Bi of T and the other corresponds to a cut-vertex cj of T such that cj is in Bi; two distinct pathos vertices Pm and Pn of P BLc(T) are adjacent whenever the corresponding paths of the pathos Pm(vi, vj) and Pn(vk, vl) have a common vertex. We study the properties of P BLc(T) and present the characterization of graphs whose P BLc(T) are planar; outerplanar; maximal outerplanar; minimally nonouterplanar; eulerian; and hamiltonian. We further show that for any tree T, the crossing number of P BLc(T) can never be one.

Initial requirements to the optimal performance of systems modeled by timed place Petri nets using the synchronic time ratio (Synchronic time ratio를 이용 시간 페트리 네트로 모델링된 시스템의 최적 성능에 필요한 초기 조건 결정)

  • Go, In-Seon;Choi, Juang-Hwan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.1
    • /
    • pp.101-108
    • /
    • 1997
  • The initial token value required to the optimal performance of discrete event systems can be decided by Sum of Delay Time and Synchronic Time ratio, which are new synchronic variables in Timed Place Petri Nets. For the system consisting of two Live-and-Bounded circuits(LB-circuits) fused in common Transition-Transition-Path or common Place-Place-Path, we prove that the Synchronic Time Ratio is the initial token ratio between two LB-circuits to optimally perform system functions. These results are generalized and formulated as a theorem. The initial tokens of a specific place can imply shared resources. Using the theorem, we can decide the minimum number of the shared resources to obtain the optimal performance, and minimize the idling time of resources. As an example, an automated assembly system is modeled by Timed Place Petri Net, and the initial tokens to achieve the optimal system performance are identified. All the values are verified by simulation.

  • PDF

The Influence of Belief in Body Control on Appearance Satisfaction of U.S. Female College Students (신체 통제에 대한 신념이 외모 만족도에 미치는 영향: 미국 여대생을 대상으로)

  • 이윤정
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.28 no.7
    • /
    • pp.974-982
    • /
    • 2004
  • The purpose of this study was to examine the influence of belief in body control on appearance satisfaction using structural equation modeling. In the structural equation model, self-esteem was included as a common predictor variable of belief in body control and appearance satisfaction, and the ideal body type and perceived body type were included as mediator variables. The data was collected from 96 female college students in the State of Washington, United States, Using AMOS 4, confirmatory factor analyses were conducted to fit the measurement models, and then the fit of the structural model was examined. The results of this study are as follows: The indirect effect of belief in body control on appearance satisfaction through its negative effect on ideal body type was significant. Yet, the direct path of belief in body control to appearance satisfaction and the indirect path through their common relationships with self-esteem were found not significant. These results indicate that higher body control belief may lead to lower appearance satisfaction due to the decreased size of ideal body type.

An Efficient Routing Algorithm Considering Packet Collisions in Cognitive Radio Ad-hoc Network (CR Ad-hoc Network에서 패킷 충돌을 고려한 효율적인 경로탐색 알고리즘)

  • Kim, Jin-Su;Choi, Jun-Ho;Shin, Myeong-Jin;Lee, Ji-Seon;Yoo, Sang-Jo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.9
    • /
    • pp.751-764
    • /
    • 2013
  • In cognitive radio ad-hoc networks, common control channel overload and packet collisions are occured due to indiscriminate broadcasting of control packets. So that the path reliability is reduced and control channel is easily saturated. In this paper, we propose a new routing algorithm considering the probability of appearance of primary user and channel status of neighbor nodes. When the source node needs to transmit a data packet to the destination, it performs route discovery process by exchanging control messages using a control channel in ADOV CR Ad-hoc networks. If any intermediate node doesn't have common data channel with previous node to transmit data, it doesn't rebroadcast control packet. And if it has common data channels with previous node, each node determines channel contribution factor with the number of common channels. Based on the channel contribution factor, each node performs different back-off broadcasting. In addition, each node controls control packet flooding by applying to proposed advanced mode using such as number of available channels and channel stability. With the proposed method, the number of control packets to find the data transmission path and the probability of collision among control packets can be decreased. While the path reliability can be increased. Through simulation, we show that our proposed algorithm reduces packet collisions in comparison with the traditional algorithm.

Balance Winding Scheme to Reduce Common-Mode Noise in Flyback Transformers

  • Fu, Kaining;Chen, Wei
    • Journal of Power Electronics
    • /
    • v.19 no.1
    • /
    • pp.296-306
    • /
    • 2019
  • The flyback topology is being widely used in power adapters. The coupling capacitance between primary and secondary windings of a flyback transformer is the main path for common-mode (CM) noise conduction. A Y-cap is usually used to effectively suppress EMI noise. However, this results in problems in space, cost, and the danger of safety leakage current. In this paper, the CM noise behaviors due to the electric field coupling of the transformer windings in a flyback adapter with synchronous rectification are analyzed. Then a scheme with balance winding is proposed to reduce the CM noise with a transformer winding design that eliminates the Y-cap. The planar transformer has advantages in terms of its low profile, good heat dissipation and good stray parameter consistency. Based on the proposed scheme, with the help of a full-wave simulation tool, the key parameter influences of the transformer PCB winding design on CM noise are further analyzed. Finally, a PCB transformer for an 18W adapter is designed and tested to verify the effectiveness of the balance winding scheme.

Optimal Path Search Algorithm for Urban Applying Received Signal Strength on Satellite Communication Environment (위성통신 환경에서 전파수신감도를 활용한 도심지 최적경로탐색 알고리즘)

  • Park, No-Uk;Kim, Joo-Seok;Lim, Joo-Yoeng;Lim, Tae-Hyuk;Yoo, Chang-Hyun;Kwon, Kun-Sup;Kim, Kyung-Seok
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.12 no.6
    • /
    • pp.189-197
    • /
    • 2012
  • In this paper, we propose an optimal path search algorithm that applies the received signal strength between a mobile device and a satellite. Because the common path search algorithm is only based on the shortest path search, it is difficult to provide stable multimedia services for the satellite mobile devices. The proposed algorithm provides the stable communication environment for the satellite mobile devices based on received signal strength. In Satellite communications, changes in the radio quality are severe depending on the receiving environment. Therefore, an accurate analysis of the receiving environment characteristics is very important for providing stable multimedia services of satellite communications. The causes of radio attenuation are atmosphere attenuation, vegetation attenuation and buildings attenuation. These factors were applied to analyze the received signal strength. The proposed algorithm can search the optimal path in urban for stable satellite multimedia services.

Analysis of Cause and Effect Structure for Nogwonsang (노권상(勞倦傷)의 인과 구조 분석)

  • Yoon, Kyu-Jin;Lee, Sang-Chul;Kim, Min-Yong;Park, Young-Bae;Park, Young-Jae
    • The Journal of the Society of Korean Medicine Diagnostics
    • /
    • v.14 no.1
    • /
    • pp.1-14
    • /
    • 2010
  • Backgrounds : Bojungikgitang is one of the most common herbal prescriptions in Oriental Medicine, and it is highly recommended prescription for Nogwonsang syndrome. The Author developed Nogwonsang questionnaire for quantitative evaluation. Nogwonsang questionnaire is consisted of causes that induce fatigue, symptoms that directly associated with fatigue, and secondary symptoms that is induced from fatigue. Purposes : This study aims to verify whether the Bojungikgitang Questionnaire has causality and meaningful path structure by path analysis. Methods : 242 patients from 12 OMD clinics participated in this study. The patients executed a question investigation in the object. Factor analysis was conducted for extraction of factor and abridgment of items. Path analysis was conducted to verify path structure. SPSS 15.0 for Windows and AMOS 7.0 were used for statistical analysis. Results : Overwork factor explains fatigue factor. Coefficient is 0.771. Fatigue factor explains digesting and cold factor. Individually coefficient is 0.632 and 0.465. Model fit is $X^2=61.395$(df=51), GFI=0.960, AGFI=0.939, NFI= 0.924, CFI=0.986, RMSEA=0.029. Path structure is proved to be significant. Conclusions : Further research is needed Gold standard of Nogwonsang. Establishment of Gold standard leads and the collection of data and the research which are objective are possible. Connection of the clinical indexes which are objective on the paperweight outside and leads and the development of the diagnosis tool which is fixed quantity is demanded.

Virtual Angioscopy for Diagnosis of Carotid Artery Stenosis (경동맥 협착증 진단을 위한 가상혈관경)

  • 김도연;박종원
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.9
    • /
    • pp.821-828
    • /
    • 2003
  • The virtual angioscopy was implemented using MR angiography image of carotid artery Inside of the carotid artery is one of the body region not accessible by real optical endoscopy but can be visualized with virtual endoscopy. In order to determine the navigation path, we segmented the common carotid artery and internal carotid artery from the MR angiography image. We used the coordinates as a navigation path for virtual camera that were calculated from medial axis transformation. We used the perspective projection and marching cube algorithm to render the surface from volumetric MRA image data. A stroke occurs when brain cells die because of decreased blood flow to the brain. The carotid artery is the primary blood vessel that supplies the blood flow to the brain. Therefore, the carotid artery stenosis is the primary reason of stroke. The virtual angioscopy is highly recommended as a diagnosis tool with which the specific Place of stenosis can be identified and the degree of stenosis can be measured qualitatively. Also, the virtual angioscopy can be used as an education and training tool for endoscopist and radiologist.

A QoS Guaranteed Mechanism Using the FRSVP in the Hierarchical Mobile IPv6 (계층적 이동 IPv6 네트워크에서 FRSVP를 이용한 QoS 보증 방안)

  • Kim Bo-Gyun;Hong Choong-Seon;Lee Dae-Young
    • The KIPS Transactions:PartC
    • /
    • v.12C no.3 s.99
    • /
    • pp.419-428
    • /
    • 2005
  • This paper divides domains into the intra, inter domain according to the mobile node's movement and .proposes the Fast RSVP algorithm on the HMIPv6. It is done to advance reservation using L2 beacon signal when MN is located to overlapped cell area. In case of intra-region handoff, the advance reservation is reserved at the nearest common router and In case of inter-region handoff, it is done to advance reservation through the other site MAP's QA(QoS Agent) to the AR and optimize CN's path. Because of using the bandwidth efficiently and switching the data path quickly, the proposal algorithm minimizes the service disruption by data routing.

An Extended Scan Path Architecture Based on IEEE 1149.1 (IEEE 1149.1을 이용한 확장된 스캔 경로 구조)

  • Son, U-Jeong;Yun, Tae-Jin;An, Gwang-Seon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1924-1937
    • /
    • 1996
  • In this paper, we propose a ESP(Extended Scan Path) architecture for multi- board testing. The conventional architectures for board testing are single scan path and multi-scan path. In the single scan path architecture, the scan path for test data is just one chain. If the scan path is faulty due to short or open, the test data is not valid. In the multi-scan path architecture, there are additional signals in multi-board testing. So conventional architectures are not adopted to multi-board testing. In the case of the ESP architecture, even though scan paths either short or open, it doesn't affect remaining other scan paths. As a result of executing parallel BIST and IEEE 1149.1 boundary scan test by using, he proposed ESP architecture, we observed to the test time is short compared with the single scan path architecture. Because the ESP architecture uses the common bus, there are not additional signals in multi-board testing. By comparing the ESP architecture with conventional one using ISCAS '85 bench mark circuit, we showed that the architecture has improved results.

  • PDF