• 제어로봇시스템학회논문지
• /
• 제18권3호
• /
• pp.258-266
• /
• 2012

This paper describes a biped walking algorithm for a hydraulic humanoid robot on inclined floors. To realize stable and robust biped walking, the walking algorithm was divided into five control strategies. The first is a joint position control strategy. This strategy is for tracking desired joint position trajectories with a gain switching. The second is a multi-model based ZMP (Zero Moment Point) control strategy for dynamic balance. The third is a walking pattern flow control strategy for smooth transition from step to step. The fourth is an ankle compliance control, which increases the dynamic stability at the moment of floor contact. The last is an upright pose control strategy for robust walking on an inclined floor. All strategies are based on simple pendulum models and include practical sensory feedback in order to implement the strategies on a physical robot. Finally, the performance of the control strategies are evaluated and verified through dynamic simulations of a hydraulic humanoid on level and inclined floors.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제14권8호
• /
• pp.753-757
• /
• 2008

본 논문은 그리드 환경에서 동전계획법을 위한 새로운 스케줄링 정책을 제안한다. 이 스케줄링 정책의 특징은 동적 테이블의 지역성을 고려하여 테이블을 분할하고, 네트워크 지연이 최소인 노드에 작업을 할당함으로써 작업의 실행시간을 단축하는 것이다. 또한 최적의 병행성을 얻기 위해 분산 하향식으로 동적 테이블을 구성한다 시뮬레이션을 통하여 제안하는 그리드 스케줄링 정책이 그리드 환경의 성능 향상 면에서 기존의 분기-한정(branch-bound) 알고리즘에 비해 더 효과적임을 보인다

• International Journal of Reliability and Applications
• /
• 제2권1호
• /
• pp.27-36
• /
• 2001

This Paper proposes a new methodology for assessing the reliability of an accident management, which Is based on the reliability physics and the scheme to generate dynamic event tree. The methodology consists of 3 main steps: screening; uncertainty propagation; and probability estimation. Sensitivity analysis is used for screening the variables of significance. Latin Hypercube sampling technique and MAAP code are used for uncertainty propagation, and the dynamic event tree generation method is used for the estimation of non-success probability of implementing an accident management strategy. This approach is applied in assessing the non-success probability of implementing a cavity flooding strategy, which is to supply water into the reactor cavity using emergency fire systems during the sequence of station blackout at the reference plant.

• 한국컴퓨터정보학회논문지
• /
• 제13권5호
• /
• pp.45-52
• /
• 2008

본 논문에서는 고성능 컴퓨팅 시스템의 성능 향상을 위한 효율적인 동적 작업부하 균등화 정책을 제안한다. 이 정책은 시스템 자원인 CPU와 메모리를 효율적으로 사용하여 고성능 컴퓨팅 시스템의 처리량을 최대화하고, 각 작업의 수행시간을 최소화한다. 또한 이 정책은 수행중인 작업의 메모리 요구량과 각 노드의 부하 상태를 파악하여 작업을 동적으로 할당한다. 이때 작업을 할당받은 노드가 과부하 상태가 되면 다른 노드로 작업을 이주시켜 각 노드의 작업부하를 균등하게 유지함으로써 작업의 대기시간을 줄이고, 각 작업의 수행시간을 단축한다. 본 논문에서는 시뮬레이션을 통하여 제안하는 동적 작업부하 균등화 정책이 기존의 메모리 기반의 작업부하 균등화 정책에 비해 고성능 컴퓨팅 시스템의 성능 향상 면에서 우수함을 보인다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.315-320
• /
• 1992

This paper presents the simulation architecture and strategy for dynamic simulation of chemical process and describes key features of developed dynamic simulation system, MOSA(Multi-Objective Simulation Architecture). A plant structure may be partioned into several strong coupling units, called cluster. If this cluster is solved simultaneously, it is possible to simulate whole plant without introducing convergence problem of tear streams. In this study, a flexible modular approach based on clusters was proposed as a promising architecture for dynamic chemical process simulator.

• 한국경영과학회지
• /
• 제25권4호
• /
• pp.81-95
• /
• 2000

A knowledge-based system with fuzzy production rules is a representation of static knowledge of an expert. On the other hand, a real system such as the stock market is dynamic in nature. Therefore we need a strategy to reflect the dynamic nature of real system when we make inferences with a knowledge-based system. This paper proposes a strategy of dynamic inferencing for a knowledge-based system with fuzzy production rules. The strategy suggested in this paper applies weights of attributes of conditions of a rule in the knowledge-base. A degree of match(DM) between actual input information and a condition of a rule is represented by a value [0,1]. Weights of relative importance of attributes in a rule are obtained by AHP(Analytic Hierarcy Process) method. Then these weights are applied as exponents for the DM, and the DMs in a rule are combined, with MIN operator, into a single DM for the rule. In this way, overall DM for a rule changes depending on the importance of attributes of the rule. As a result, the dynamic nature of a real system can be incorporated in an inference with fuzzy production rules.

• 한국컴퓨터정보학회논문지
• /
• 제22권4호
• /
• pp.17-24
• /
• 2017

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• 한국컴퓨터정보학회논문지
• /
• 제21권1호
• /
• pp.147-153
• /
• 2016

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• 한국컴퓨터정보학회논문지
• /
• 제21권1호
• /
• pp.125-129
• /
• 2016

In this paper, we propose an efficient dynamic workload balancing strategy which improves the performance of high-performance computing system. The key idea of this dynamic workload balancing strategy is to minimize execution time of each job and to maximize the system throughput by effectively using system resource such as CPU, memory. Also, this strategy dynamically allocates job by considering demanded memory size of executing job and workload status of each node. If an overload node occurs due to allocated job, the proposed scheme migrates job, executing in overload nodes, to another free nodes and reduces the waiting time and execution time of job by balancing workload of each node. Through simulation, we show that the proposed dynamic workload balancing strategy based on CPU, memory improves the performance of high-performance computing system compared to previous strategies.

• Journal of Information Processing Systems
• /
• 제20권1호
• /
• pp.131-147
• /
• 2024

A routing strategy based on traffic prediction and dynamic cache allocation for satellite nodes is proposed to address the issues of high propagation delay and overall delay of inter-satellite and satellite-to-ground links in low Earth orbit (LEO) satellite systems. The spatial and temporal correlations of satellite network traffic were analyzed, and the relevant traffic through the target satellite was extracted as raw input for traffic prediction. An improved gradient boosting regression tree algorithm was used for traffic prediction. Based on the traffic prediction results, a dynamic cache allocation routing strategy is proposed. The satellite nodes periodically monitor the traffic load on inter-satellite links (ISLs) and dynamically allocate cache resources for each ISL with neighboring nodes. Simulation results demonstrate that the proposed routing strategy effectively reduces packet loss rate and average end-to-end delay and improves the distribution of services across the entire network.