• Title/Summary/Keyword: 변형경로

Search Result 323, Processing Time 0.029 seconds

A Shortest Path Routing Algorithm using a Modified Hopfield Neural Network (수정된 홉필드 신경망을 이용한 최단 경로 라우팅 알고리즘)

  • Ahn, Chang-Wook;Ramakrishna, R.S.;Choi, In-Chan;Kang, Chung-Gu
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.4
    • /
    • pp.386-396
    • /
    • 2002
  • This paper presents a neural network-based near-optimal routing algorithm. It employs a modified Hopfield Neural Network (MHNN) as a means to solve the shortest path problem. It uses every piece of information that is available at the peripheral neurons in addition to the highly correlated information that is available at the local neuron. Consequently, every neuron converges speedily and optimally to a stable state. The convergence is faster than what is usually found in algorithms that employ conventional Hopfield neural networks. Computer simulations support the indicated claims. The results are relatively independent of network topology for almost all source-destination pairs, which nay be useful for implementing the routing algorithms appropriate to multi -hop packet radio networks with time-varying network topology.

Massive Graph Expression and Shortest Path Search in Interpersonal Relationship Network (인물관계망의 대용량 그래프 표현과 최단 경로 탐색)

  • Min, Kyoung-Ju;Jin, Byeong-Chan;Jung, Man-Ho
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.26 no.4
    • /
    • pp.624-632
    • /
    • 2022
  • Relationship networks such as an interpersonal relationship network or navigation route search can be expressed in graph form. However, as the amount of data increase, there is a problem that it is difficult to search for the desired data when it is displayed on one screen. In this paper, we propose a visualization method for searching for people, searching for the shortest path between people, and using graphs to express an interpersonal relationship network with many nodes. Unlike the search for the shortest path in the routing table, the shortest path in the interpersonal relationship network should be changeable according to the intension or importance of the researcher or user who is analyzing it. To this end, the BFS algorithm was modified to apply the characteristics of the interpersonal relationship network. For the verification of the results, the data in the character relationship information of the Korean Classics DB in the Korean Classics Translation Institute was used.

The Effects of Stress and Time History on Pore Pressure Parameter of Overconsoldated clay (과압밀점토의 간극수압계수에 응력이력과 시간이력이 미치는 영향)

  • 김수삼;김병일;한상재;신현영
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.14 no.4
    • /
    • pp.286-294
    • /
    • 2002
  • This study investigated the effects of stress and time history of overconsolidated clayey soils on pore pressure parameter, A. Laboratory tests were carried out under the conditions of both varying stress and time history. The stress history is classified into (i) rotation angle of stress path, (ii) overconsolidation ratio, and (iii) magnitude of length of recent stress path. The time history is divided into (i) loading rate of recent stress path and (ii) rest time. Pore pressure parameters are different both in the magnitude and trend with the rotation angle, depending on the magnitude of overconsolidation ratio but not in a trend. In addition, the pore pressure parameters have no effects on the magnitude of length of recent stress path except the level of initially small strain, while loading rates of recent stress path have effects on it. Finally, the pore pressure parameters of overconsolidated clays increase with the existence of the rest time, until either the deviator stress exceeds 70 kPa or the strain up to 0.1%.

DRM Enabled P2P Model for Contents Protection (콘텐츠 보호를 위한 DRM이 적용된 P2P 모델)

  • Sung Jae-Youn;Jeong Yeon-Jeong;Yoon Ki-Song
    • The KIPS Transactions:PartC
    • /
    • v.13C no.4 s.107
    • /
    • pp.389-396
    • /
    • 2006
  • P2P(Peer To Peer) system, a most attractive file sharing system, is the largest channel of contents distribution and it takes 50% of network traffic. But P2P systems are infamous for used to illegal contents distribution channel not only in music industry, but also in movie industry. But, DRM(Digital Right Management) enabled P2P models are not suggested until now that interrupting illegal contents distribution and keeping advantage of P2P. So in this paper, we suggest a DRM enabled P2P model that can support distributed processing ability and high scalability with no modification in exist P2P model or architecture.

Constitutive Model for Hardening Materials such as Rock or Concrete (암석이나 콘크리트와 같은 경화재료에 대한 구성모델)

  • Kang, Byung Sun
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.13 no.1
    • /
    • pp.161-171
    • /
    • 1993
  • The aim of this study is to provide the stress-strain behavior of hardening geological materials such as rock or concrete on three dimensional spaces by using Desai model based on plastic theory. To validate proposed model, truly triaxial tests with high pressure under variety of stress paths in which three principal stresses were controlled independently using concrete materials were performed. The main results are summerized as follows: 1. Various stress paths for hardening materials used are satisfactorily explained by performing the truly triaxial test with high pressure. This is very important to investigate constitutive equations for materials like rock or concrete. 2. Since the proposed yield function is continuous, it avoids the singularity point at the intersection of two function in the previous models, thus, reducing the difficulties for computer implementation. 3. Analytic predictions for yielding behavior on $J_1-{\sqrt{J_{2D}}}$ octahedral and triaxial plane, as well as volumetric strain and stress-strain behavior agree well with experimental results.

  • PDF

Robust Blind Source Separation to Noisy Environment For Speech Recognition in Car (차량용 음성인식을 위한 주변잡음에 강건한 브라인드 음원분리)

  • Kim, Hyun-Tae;Park, Jang-Sik
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.12
    • /
    • pp.89-95
    • /
    • 2006
  • The performance of blind source separation(BSS) using independent component analysis (ICA) declines significantly in a reverberant environment. A post-processing method proposed in this paper was designed to remove the residual component precisely. The proposed method used modified NLMS(normalized least mean square) filter in frequency domain, to estimate cross-talk path that causes residual cross-talk components. Residual cross-talk components in one channel is correspond to direct components in another channel. Therefore, we can estimate cross-talk path using another channel input signals from adaptive filter. Step size is normalized by input signal power in conventional NLMS filter, but it is normalized by sum of input signal power and error signal power in modified NLMS filter. By using this method, we can prevent misadjustment of filter weights. The estimated residual cross-talk components are subtracted by non-stationary spectral subtraction. The computer simulation results using speech signals show that the proposed method improves the noise reduction ratio(NRR) by approximately 3dB on conventional FDICA.

  • PDF

A Constitutive Model for Normally Consolidated Clays (정규압밀점토의 응력 -변형률 구성 방정식)

  • 이영휘
    • Geotechnical Engineering
    • /
    • v.8 no.2
    • /
    • pp.71-80
    • /
    • 1992
  • A new constitutive model is proposed for normally consolidated clays. A main skeleton of the proposed model is based on the concepts of the incremental stress-strain theory by Roscoe and Poorooshasb. The equation of the undrained stress path is formulated by introducing the new pore pressure parameter(C), which is the slope of the linear line in the plot of the normalized pore pressure against the stress ratio. Once the stress increment along the constant stress ratio path (followed by untrained stress path) is know, the volumetric strains are calculated from the linear characteristics between void ratio and logarithm of the mean normal stress for any stress ratio. Then the incremental shear strains are successfully predicted by applying the flow rule derived in the modified theory by Roscoe and Burland.

  • PDF

Multiobjective Routing and Scheduling for Vehicles Transporting Hazardous Materials (위험물 운송차량의 다목적 경로 및 스케줄 관리 방안)

  • Sin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.5
    • /
    • pp.161-172
    • /
    • 2007
  • Vehicles transporting hazardous materials can make huge damage to people, properties and environment by traffic accidents. Therefore, transporting hazardous materials is a big issue with the cutting edge technology of communications in these days. However, despite this situation, Korean government gives limited efforts for systematic management, research and investment about hazardous materials. Accordingly, this research suggests the key path finding algorithm about management of real-time schedule and routes for vehicles transporting hazardous materials. Besides, the case study is progressed in transportation networks of Seoul in order to evaluate the reality of algorithm. Specifically, time-space network transformation is performed for time window attributes. In addition, this study proposes the techniques searching for non-dominated paths considering schedule by the multiobjective shortest path algorithm based on dynamic programming in dynamic transportation networks including multiobjective attributes.

Characteristics of Stress-Strain Behavior for Lade's Single Work-Hardening Constitutive Model with Stress Path of Sands (모래의 응력경로에 따른 Lade의 단일항복면 구성모델의 응력-변형거동 특성)

  • Kim, Chan-Kee;Lee, Jong-Cheon;Cho, Won-Beom;Park, Wook-Geun;Kim, Hwan-Wook
    • Journal of the Korean Geosynthetics Society
    • /
    • v.11 no.2
    • /
    • pp.1-9
    • /
    • 2012
  • In order to review the utility of Lade's single hardening constitutive model, a series of isotropic compression-expansion tests and consolidated drained triaxial tests including as CTC, TC, RTC, and OSP were performed by Baekma river sand with various of stress path. Parameters required in model were determined using these tests. The accuracy of analysis was reviewed by back analysis of test results used to determine the 11 parameters of soil property through the test of each stress path. Also. for verifying the accuracy of prediction for the stress-strain behavior using failure criterion related 9 parameters with correlational equation and constant and yield criterion related parameters h, ${\alpha}$ and ${\eta}_1$, when stress path is different with each other, it has been obtained in the review result of stress path dependent characteristics of the constitutional model through the analyzing results of CTC, TC, RTC, OSP, and fine silica sand tests.

An Economic Ship Routing System Based on a Minimal Dynamic-cost Path Search Algorithm (최소동적비용 경로탐색 알고리즘 기반 선박경제운항시스템)

  • Joo, Sang-Yeon;Cho, Tae-Jeong;Cha, Jae-Mun;Yang, Jin-Ho;Kwon, Yung-Keun
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.1 no.2
    • /
    • pp.79-86
    • /
    • 2012
  • An economic ship routing means to sail a ship with a goal of minimizing the fuel consumption by utilizing weather forecast information, and various such systems have been recently studied. For a successful economic ship routing system, an efficient algorithm is needed to search an optimal geographical path, and most of the previous systems were approaching to that problem through a minimal static-cost path search algorithm based on the Dijkstra algorithm. To apply that kind of search algorithm, the cost of every edge assigned with the estimated fuel consumption should be constant. However, that assumption is not practical at all considering that the actual fuel consumption is determined by the weather condition when the ship will pass the edge. To overcome such a limitation, we propose a new optimal ship routing system based on a minimal dynamic-cost path search algorithm by properly modifying the Dijkstra algorithm. In addition, we propose a method which efficiently reduces the search space by using the $A^*$ algorithm to decrease the running time. We compared our system with the shortest path-based sailing method over ten testing routes and observed that the former reduced the estimated fuel consumption than the latter by 2.36% on average and the maximum 4.82% with little difference of estimated time of arrival.