• Title/Summary/Keyword: measure link

Search Result 228, Processing Time 0.038 seconds

OPTIMAL PERIOD SELECTION TO MINIMIZE THE END-TO-END RESPONSE TIME

  • SHIN M.;LEE W.;SUNWOO M.
    • International Journal of Automotive Technology
    • /
    • v.6 no.1
    • /
    • pp.71-77
    • /
    • 2005
  • This paper presents a systematic approach which determines the optimal period to minimize performance measure subject to the schedulability constraints of a real-time control system by formulating the scheduling problem as an optimal problem. The performance measure is derived from the summation of end-to-end response times of processed I/Os scheduled by the static cyclic method. The schedulability constraint is specified in terms of allowable resource utilization. At first, a uniprocessor case is considered and then it is extended to a distributed system connected through a communication link, local-inter network, UN. This approach is applied to the design of an automotive body control system in order to validate the feasibility through a real example. By using the approach, a set of optimal periods can easily be obtained without complex and advanced methods such as branch and bound (B&B) or simulated annealing.

Performance Analysis of Multi-Media Traffic in Nonhirerachical Structures (비계층적 구조를 갖는 종합정보 통신망에서 다원트래픽 성능분석)

  • 김제숭
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.41
    • /
    • pp.103-112
    • /
    • 1997
  • In this paper, a nonhierarchial integrated information network with circuit switched and packet switched traffic is considered. It is assumed that circuit switched traffic is allowed to attempt an alternate path if the direct path is blocked, whereas packet switched traffic is not. The network uses a movable boundary scheme to allocate bandwidth dynamically. To analyze the performance of this type of network, EEBP(End to End Blocking Probability) is selected as a measure for circuit switched traffic and average time delay for packet switched traffic, respectively. EEBP and average time delay are derived analytically. Using the two proposed measure, the performance of the network under various bandwidth allocations and arrival patterns are observed. Moreover, the arrival rate of one link for circuit switched traffic is obtained from an approximation formula. Simulation results reveal the validity of the proposed approximation method.

  • PDF

Repetitive Periodic Motion Planning and Directional Drag Optimization of Underwater Articulated Robotic Arms

  • Jun Bong-Huan;Lee Jihong;Lee Pan-Mook
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.1
    • /
    • pp.42-52
    • /
    • 2006
  • In order to utilize hydrodynamic drag force on articulated robots moving in an underwater environment, an optimum motion planning procedure is proposed. The drag force acting on cylindrical underwater arms is modeled and a directional drag measure is defined as a quantitative measure of reaction force in a specific direction in a workspace. A repetitive trajectory planning method is formulated from the general point-to-point trajectory planning method. In order to globally optimize the parameters of repetitive trajectories under inequality constraints, a 2-level optimization scheme is proposed, which adopts the genetic algorithm (GA) as the 1st level optimization and sequential quadratic programming (SQP) as the 2nd level optimization. To verify the validity of the proposed method, optimization examples of periodic motion planning with the simple two-link planner robot are also presented in this paper.

A NOTE FOR RESTRICTED INFORMATION MARKETS

  • Jianqi, Yang;Qingxian, Xiao;Haifeng, Yan
    • Journal of applied mathematics & informatics
    • /
    • v.27 no.5_6
    • /
    • pp.1073-1086
    • /
    • 2009
  • This paper considers the problems of martingale measures and risk-minimizing hedging strategies in the market with restricted information. By constructing a general restricted information market model, the explicit relation of arbitrage and the minimal martingale measure between two different information markets are discussed. Also a link among all equivalent martingale measures under restricted information market is given. As an example of restricted information markets, this paper constitutes a jump-diffusion process model and presents a risk minimizing problem under different information. Through $It\hat{o}$ formula and projection results in Schweizer[13], the explicit optimal strategy for different market information are given.

  • PDF

Throughput-based fair bandwidth allocation in OBS networks

  • Le, Van Hoa;Vo, Viet Minh Nhat;Le, Manh Thanh
    • ETRI Journal
    • /
    • v.40 no.5
    • /
    • pp.624-633
    • /
    • 2018
  • Fair bandwidth allocation (FBA) has been studied in optical burst switching (OBS) networks, with the main idea being to map the max-min fairness in traditional IP networks to the fair-loss probability in OBS networks. This approach has proven to be fair in terms of the bandwidth allocation for differential connections, but the use of the ErlangB formula to calculate the theoretical loss probability has made this approach applicable only to Poisson flows. Furthermore, it is necessary to have a reasonable fairness measure to evaluate FBA models. This article proposes an approach involving throughput-based-FBA, called TFBA, and recommends a new fairness measure that is based on the ratio of the actual throughput to the allocated bandwidth. An analytical model for the performance of the output link with TFBA is also proposed.

Collapse fragility analysis of the soil nail walls with shotcrete concrete layers

  • Bayat, Mahmoud;Emadi, Amin;Kosariyeh, Amir Homayoun;Kia, Mehdi;Bayat, Mahdi
    • Computers and Concrete
    • /
    • v.29 no.5
    • /
    • pp.279-283
    • /
    • 2022
  • The seismic analytic collapse fragility of soil nail wall structures with a shotcrete concrete covering is investigated in this paper. The finite element modeling process has been well described. The fragility function evaluates the link between ground motion intensities and the likelihood of reaching a specific level of damage. The soil nail wall has been subjected to incremental dynamic analysis (IDA) from medium to strong ground vibrations. The nonlinear dynamic analysis of the soil nail wall uses a set of 20 earthquake ground motions with varying PGAs. PGD is utilized as an intensity measure, the numerical findings demonstrate that the soil nailing wall reaction is particularly sensitive to earthquake intensity measure (IM).

A Method to Measure Damage Areas on Railway Accidents by the HAZMATs types using GIS Spatial Analysis (GIS 공간 분석기법을 활용한 위험물질별 철도사고 피해규모 자동추출방안에 관한 연구)

  • Park, Min-Kyu;Kim, Si-Gon;Lee, Won-Tae
    • Journal of the Korea Safety Management & Science
    • /
    • v.12 no.1
    • /
    • pp.35-42
    • /
    • 2010
  • Due to the industrialization and urbanization, the transport of hazardous materials increases, which rises possibilities in occurring prospective accidents in terms of hazardous material transport as well. This study applied the model developed from the previous research to analyze the scale of damage areas from the accidents related to hazardous material accidents, as well as suggested a method to measure automatically the scale of accident including casualties and environmental damage based on the guideline which suggests the quantities of hazardous materials exposed from an accident and was defined in the study of standardization for hazardous material classification. A buffering analysis technique of Geographic Information System (GIS) was applied for that. To apply the model which evaluates the scale of population and exposure to environment on each link, rail network, zones, rail accident data, rail freight trips, and locations of rivers etc were complied as a database for GIS analysis. In conclusion, a method to measure damage areas by the types of hazardous materials was introduced using a Clip and a Special Join technique for overlay analysis.

On Unicast Routing Algorithm Based on Estimated Path for Delay Constrained Least Cost (경로 추정 기반의 지연시간을 고려한 저비용 유니캐스트 라우팅 알고리즘)

  • Kim, Moon-Seong;Bang, Young-Cheol;Choo, Hyun-Seung
    • Journal of Internet Computing and Services
    • /
    • v.8 no.1
    • /
    • pp.25-31
    • /
    • 2007
  • The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

  • PDF

New Factor for Balancing Cost and Delay Unicast Algorithm Based on Statistic Interval Estimation (통계적 구간 추정에 근거한 비용과 지연시간에 조화로운 유니캐스트 라우팅을 위한 새로운 인자)

  • Kim, Moon-Seong;Bang, Young-Cheol;Choo, Hyun-Seung
    • Journal of the Korea Society for Simulation
    • /
    • v.16 no.1
    • /
    • pp.1-9
    • /
    • 2007
  • The development of efficient Qualify of Service (QoS) routing algorithms in high speed networks is extremely difficult to achieve, because in order to operate, divergent services require various quality conditions. If the parameter of concern is to measure the delay on a specific link, the routing algorithm obtains the Least Delay (LD) path. Meanwhile, if the parameter is to measure the link cost, the Least Cost (LC) path is calculated. The Delay Constrained Least Cost (DCLC) path problem of the mixed issues on the LD and LC has been shown to be NP-hard. The path cost of LD path is relatively more expensive than that of the LC path, and the path delay of the LC path is relatively higher than that of the LD path in the DCLC problem. In this paper, we introduce the new factor for balancing cost and delay. The simulation result shows that our introduced factor is satisfied to solve the DCLC problem.

  • PDF

Measuring the Goodness of Fit of Link Reduction Algorithms for Mapping Intellectual Structures in Bibliometric Analysis (계량서지적 분석에서 지적구조 매핑을 위한 링크 삭감 알고리즘의 적합도 측정)

  • Lee, Jae Yun
    • Journal of the Korean Society for information Management
    • /
    • v.39 no.2
    • /
    • pp.233-254
    • /
    • 2022
  • Link reduction algorithms such as pathfinder network are the widely used methods to overcome problems with the visualization of weighted networks for knowledge domain analysis. This study proposed NetRSQ, an indicator to measure the goodness of fit of a link reduction algorithm for the network visualization. NetRSQ is developed to calculate the fitness of a network based on the rank correlation between the path length and the degree of association between entities. The validity of NetRSQ was investigated with data from previous research which qualitatively evaluated several network generation algorithms. As the primary test result, the higher degree of NetRSQ appeared in the network with better intellectual structures in the quality evaluation of networks built by various methods. The performance of 4 link reduction algorithms was tested in 40 datasets from various domains and compared with NetRSQ. The test shows that there is no specific link reduction algorithm that performs better over others in all cases. Therefore, the NetRSQ can be a useful tool as a basis of reliability to select the most fitting algorithm for the network visualization of intellectual structures.