• Title/Summary/Keyword: distance between nodes

Search Result 279, Processing Time 0.026 seconds

A New Clock Routing Algorithm for High Performance ICs (고성능 집적회로 설계를 위한 새로운 클락 배선)

  • 유광기;정정화
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.36C no.11
    • /
    • pp.64-74
    • /
    • 1999
  • A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

  • PDF

Optimal Location Problem for Constrained Number of Emergency Medical Service (한정된 응급시설의 최적위치 문제)

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.10
    • /
    • pp.141-148
    • /
    • 2013
  • This paper proposes an EMS algorithm designed to determine the optimal locations for Emergency Medical Service centers that both satisfy the maximum ambulance response time T in case of emergency and cover the largest possible number of residents given a limited number of emergency medical services p in a city divided into different zones. This methodology generally applies integer programming whereby cases are categorized into 1 if the distance between two zones is within the response time and 0 if not and subsequently employs linear programming to obtain the optimal solution. In this paper, where p=1, the algorithm determines a node with maximum coverage. In cases where $p{\geq}2$, the algorithm selects top 5 nodes with maximum coverage. Based on inclusion-exclusion method, this selection entails repeatedly selecting a node with the maximum coverage when nodes with lower numbers are deleted. Among these 5 selected nodes, the algorithm selects a single node set with the greatest coverage and thereby as the optimal EMS location. The proposed algorithm has proven to accurately and expeditiously obtain the optimal solutions for 12-node network, 21-node network, and Swain's 55-node network.

A Study on QoS Improvement for Overlay Multicast Using Modified Dijkstra Algorithm (변형된 Dijkstra 알고리즘을 활용한 오버레이 멀티캐스트 QoS 향상 기법 연구)

  • Lee, Hyung-Ok;Nam, Ji-Seung;Park, Jun-Seok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.7
    • /
    • pp.3468-3473
    • /
    • 2013
  • Conditions that overlay multicast tree must satisfy for the real-time application system of a video-conference, an internet broadcasting is two things. First, the degree of nodes in a tree must be proper value. Second, the diameter of the multicast tree, distance between longest two users should be short. If the path between two users in the tree is long, the delay time in data transmission between two users great. So, it is not suitable to the application system such as video-conferences. In this paper, the cost of the dijkstra algorithm calculate with proposed score-function through checking the extra bandwidth, the delay and the requested bandwidth. It is composed the tree through the dijkstra algorithm.

A Study on Static Situation Awareness System with the Aid of Optimized Polynomial Radial Basis Function Neural Networks (최적화된 pRBF 뉴럴 네트워크에 의한 정적 상황 인지 시스템에 관한 연구)

  • Oh, Sung-Kwun;Na, Hyun-Suk;Kim, Wook-Dong
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.12
    • /
    • pp.2352-2360
    • /
    • 2011
  • In this paper, we introduce a comprehensive design methodology of Radial Basis Function Neural Networks (RBFNN) that is based on mechanism of clustering and optimization algorithm. We can divide some clusters based on similarity of input dataset by using clustering algorithm. As a result, the number of clusters is equal to the number of nodes in the hidden layer. Moreover, the centers of each cluster are used into the centers of each receptive field in the hidden layer. In this study, we have applied Fuzzy-C Means(FCM) and K-Means(KM) clustering algorithm, respectively and compared between them. The weight connections of model are expanded into the type of polynomial functions such as linear and quadratic. In this reason, the output of model consists of relation between input and output. In order to get the optimal structure and better performance, Particle Swarm Optimization(PSO) is used. We can obtain optimized parameters such as both the number of clusters and the polynomial order of weights connection through structural optimization as well as the widths of receptive fields through parametric optimization. To evaluate the performance of proposed model, NXT equipment offered by National Instrument(NI) is exploited. The situation awareness system-related intelligent model was built up by the experimental dataset of distance information measured between object and diverse sensor such as sound sensor, light sensor, and ultrasonic sensor of NXT equipment.

New Insights into Autonomic Nerve Preservation in High Ligation of the Inferior Mesenteric Artery in Laparoscopic Surgery for Colorectal Cancer

  • Yang, Xiao-Fei;Li, Guo-Xin;Luo, Guang-Heng;Zhong, Shi-Zhen;Ding, Zi-Hai
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.6
    • /
    • pp.2533-2539
    • /
    • 2014
  • Aim: To take a deeper insight into the relationship between the root of the inferior mesenteric artery (IMA) and the autonomic nerve plexuses around it by cadaveric anatomy and explore anatomical evidence of autonomic nerve preservation in high ligation of the IMA in laparoscopic surgery for colorectal cancer. Methods: Anatomical dissection was performed on 11 formalin-fixed cadavers and 12 fresh cadavers. Anatomical evidence-based autonomic nerve preservation in high ligation of the IMA was performed in 22 laparoscopic curative resections of colorectal cancer. Results: As the upward continuation of the presacral nerves, the bilateral trunks of SHP had close but different relationships with the root of the IMA. The right trunk of SHP ran relatively far away from the root of IMA. When the apical lymph nodes were dissected close to the root of the IMA along the fascia space in front of the anterior renal fascia, the right trunk of SHP could be kept in suit under the anterior renal fascia. The left descending branches to SHP constituted a natural and constant anatomical landmark of the relationship between the root of IMA and the left autonomic nerves. Proximal to this, the left autonomic nerves surrounded the root of the IMA. Distally, the left trunk of the SHP departed from the root of IMA under the anterior renal fascia. When high ligation of the IMA was performed distal to it, the left trunk of SHP could be preserved. The distance between the left descending branches to SHP and the origin of IMA varied widely from 1.3 cm to 2.3 cm. Conclusions: The divergences of the bilateral autonomic nerve preservation around the root of the IMA may contribute to provide anatomical evidence for more precise evaluation of the optimal position of high ligation of the IMA in the future.

Which Is the Optimal Extent of Resection in Middle Third Gastric Cancer between Total Gastrectomy and Subtotal Gastrectomy?

  • Lee, Ji-Hyun;Kim, Yong-Il
    • Journal of Gastric Cancer
    • /
    • v.10 no.4
    • /
    • pp.226-233
    • /
    • 2010
  • Purpose: In resectable gastric cancer, choice regarding the extent of resection depends on tumor size, location, and distance from resection margin. However, there remains controversy for choice of resection for tumors in the middle third of the stomach. This study investigated patients who underwent gastrectomy in order to analyze the differences between total gastrectomy (TG) and subtotal gastrectomy (STG). Materials and Methods: From 2000 to 2006, 125 patients with a tumor in the middle third of the stomach underwent radical gastric resection at EUMC. We retrospectively conducted comparative analysis for the differences in clinicopathological characteristics and prognosis between TG and STG. Results: The average tumor size was 6.7 cm for TG, and 4.1 cm for STG. The number of metastatic lymph nodes were 13.3 for TG, and 3.7 for STG. Patients with more advanced cancer were more likely to receive TG. The 5-year survival rate for TG was lower (38.1%) than STG (69.0%). However, if tumor stages were stratified, there was no significant difference in the survival rate. Histologically, for the undifferentiated type of cancer (Stage 1, 2), the 5-year survival rate of STG was higher (88.1%) than TG (75.0%). Conclusions: Comparing patients with tumors in the middle third of the stomach who underwent TG and STG, there was no statistically significant difference in the 5-year survival rate. If stages were stratified, the clinicopathological characteristic becomes a key factor in deciding the prognosis, rather than the choice of resection. Thus if the radical resection margin can be obtained for a tumor in the middle third of the stomach, STG is considered instead of TG.

A THREE DIMENSIONAL FINITE ELEMENT ANALYSIS WITH CAVITY DESIGN ON FRACTURE OF COMPOSITE RESIN INLAY RESTORED TOOTH (복합레진 인레이 수복시 와동형태에 따른 치아파절에 관한 유한요소법적 연구)

  • Kim, Chull-Soon;Min, Byung-Soon
    • Restorative Dentistry and Endodontics
    • /
    • v.19 no.1
    • /
    • pp.231-254
    • /
    • 1994
  • Fracture of cusp, on posterior teeth, especially those carious or restored, is major cause of tooth loss. Inappropriate treatments, such as unnecessarily wide cavity preparations, increase the potential of further trauma and possible fracture of the remaining tooth structures. Fracture potential may be directly related to the stresses exerted upon the tooth during masticatory function. The purpose of this study is to evaluate the fracture resistance of tooth, restored with composite resin inlay. In this study, MOD inlay cavity prepared on maxillary first premolar and restored with composite resin inlay. Three dimensional finite element models with eight nodes isoparametric solid element, developed by serial grinding-photographing technique. These models have various occlusal isthmus and depth of cavity, 1/2, 1/3 and 1/4 of isthmus width and 0.7, 0.85 and 1.0 of depth of cavity. The magnitude of load was 474 N and 172 N as presented to maximal biting force and normal chewing force. These loads applied onto ridges of buccal and lingual cusp. These models analyzed with three dimensional finite element method. The results of this study were as follows : 1. There is no difference of displacement between width of occlusal isthmus and depth of cavity. 2. The stress concentrated at bucco-mesial comer, bucco-disal comer, pulpal line angle and the interface area between internal slopes of cusp and resin inlay. 3. The vector of stress direct to buccal and lingual side from center of cavity, to tooth surface going on to enamel. The magnitude of vector increase from occlusal surface to cervix. 4. The crack of tooth start interface area, between internal slop of buccal cusp and resin inlay. It progresses through buccopulpal line angle to cervix at buccomesial and buccodistal comer. 5. The influence with depth of cavity to fracture of tooth was more than width of isthmus. 6. It would be favorable to make the isthmus width narrower than a third of the intercuspal distance and depth of cavity is below 1 : 0.7.

  • PDF

Performance Improvement of Context-Sensitive Spelling Error Correction Techniques using Knowledge Graph Embedding of Korean WordNet (alias. KorLex) (한국어 어휘 의미망(alias. KorLex)의 지식 그래프 임베딩을 이용한 문맥의존 철자오류 교정 기법의 성능 향상)

  • Lee, Jung-Hun;Cho, Sanghyun;Kwon, Hyuk-Chul
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.3
    • /
    • pp.493-501
    • /
    • 2022
  • This paper is a study on context-sensitive spelling error correction and uses the Korean WordNet (KorLex)[1] that defines the relationship between words as a graph to improve the performance of the correction[2] based on the vector information of the word embedded in the correction technique. The Korean WordNet replaced WordNet[3] developed at Princeton University in the United States and was additionally constructed for Korean. In order to learn a semantic network in graph form or to use it for learned vector information, it is necessary to transform it into a vector form by embedding learning. For transformation, we list the nodes (limited number) in a line format like a sentence in a graph in the form of a network before the training input. One of the learning techniques that use this strategy is Deepwalk[4]. DeepWalk is used to learn graphs between words in the Korean WordNet. The graph embedding information is used in concatenation with the word vector information of the learned language model for correction, and the final correction word is determined by the cosine distance value between the vectors. In this paper, In order to test whether the information of graph embedding affects the improvement of the performance of context- sensitive spelling error correction, a confused word pair was constructed and tested from the perspective of Word Sense Disambiguation(WSD). In the experimental results, the average correction performance of all confused word pairs was improved by 2.24% compared to the baseline correction performance.

Characterization of Ecological Networks on Wetland Complexes by Dispersal Models (분산 모형에 따른 습지경관의 생태 네트워크 특성 분석)

  • Kim, Bin;Park, Jeryang
    • Journal of Wetlands Research
    • /
    • v.21 no.1
    • /
    • pp.16-26
    • /
    • 2019
  • Wetlands that provide diverse ecosystem services, such as habitat provision and hydrological control of flora and fauna, constitute ecosystems through interaction between wetlands existing in a wetlandscape. Therefore, to evaluate the wetland functions such as resilience, it is necessary to analyze the ecological connectivity that is formed between wetlands which also show hydrologically dynamic behaviors. In this study, by defining wetlands as ecological nodes, we generated ecological networks through the connection of wetlands according to the dispersal model of wetland species. The characteristics of these networks were then analyzed using various network metrics. In the case of the dispersal based on a threshold distance, while a high local clustering is observed compared to the exponential dispersal kernel and heavy-tailed dispersal model, it showed a low efficiency in the movement between wetlands. On the other hand, in the case of the stochastic dispersion model, a low local clustering with high efficiency in the movement was observed. Our results confirmed that the ecological network characteristics are completely different depending on which dispersal model is chosen, and one should be careful on selecting the appropriate model for identifying network properties which highly affect the interpretation of network structure and function.

Cluster Head Selection Scheme Using Fluctuating Distance of Cluster Head (클러스터 헤드의 변동 거리를 고려한 클러스터 헤드 선출 기법)

  • Kim, Jin-Su;Choi, Seong-Yong;Han, Seung-Jin;Choi, Jun-Hyeog;Rim, Kee-Wook;Lee, Jung-Hyun
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.45 no.6
    • /
    • pp.77-86
    • /
    • 2008
  • Traditional cluster-based routing method is a representative method for increasing the energy efficiencies. In these cluster-based routing methods, the selected cluster head collect/aggregate the information and send the aggregated information to the base station. But they have to solve the unnecessary energy dissipation of frequent information exchange between the cluster head and whole member nodes in cluster. In this paper, we minimize the frequency of the information exchange for reducing the unnecessary transmit/receive frequencies as calculate the overlapped area or number of overlapped member nodes between the selected cluster head and previous cluster head in the setup phase. And besides, we consider the direction of super cluster head for optimal cluster formation. So, we propose the modified cluster selection scheme that optimizes the energy dissipation in the setup phase and reuses the saved energy in the steady phase efficiently that prolongs the whole wireless sensor network lifetime by uniformly selecting the cluster head.