• 한국HCI학회:학술대회논문집
• /
• 2006.02a
• /
• pp.1175-1181
• /
• 2006

본 논문에서는 모바일 그리드 컴퓨팅 환경에서, 작업분배에 대한 보다 효율적인 계획을 스스로 결정하고, 이를 지속적으로 개선하는 'Self-Growing Engine' 기반 적응시스템을 제안한다. 최근, 모바일 컴퓨팅 환경에서의 다양한 제약사항을 극복하기 위해, 주변의 여러 컴퓨팅 단말기들의 유휴자원을 공유하여 하나의 작업을 처리하는 그리드 컴퓨팅 개념을 무선환경에 적용하려는 연구가 이슈로 등장하고 있다. 이때, 대부분의 기존 연구들은 그리드 컴퓨팅에 참여하는 단말기들의 리소스 상태만 고려하여 작업을 할당하는 방식을 취하고 있다. 따라서 상대적으로 작업효율이 낮은 단말기에서 작업이 할당되는 경우도 생기게 된다. 제안 시스템에서는 보다 효율적인 작업분배 결정을 위해, 다양한 사항을 고려하여 적절한 단말기를 선택하며, 각 작업수행결과를 history로 저장하며, 이후에 같은 요청이 있을 때 이를 분석하여 보다 적절한 단말기를 선택하도록 스스로 진화하는 특성을 갖는다. 우리는 제안 시스템의 평가를 위해, 데스크 탑에서 프로토타입을 구현하여 시뮬레이션을 수행하였으며, 그 결과를 통해 제안시스템의 효율성을 증명하였다.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.209-211
• /
• 2005

This paper proposes a adaptive medium-access control(MAC) protocol designed for low-power wireless multi-hop sensor networks which is used for connecting physical world and cyber computing space. Wireless multi-hop sensor networks use battery-operated computing and sensing device. We expect sensor networks to be deployed in an ad hoc fashion, with nodes remaining inactive for long time, but becoming suddenly active when specific event is detected. These characteristics of multi-hop sensor networks and applications motivate a MAC that is different from traditional wireless MACs about power conservation scheme, such as IEEE 802.11. Proposed MAC uses a few techniques to reduce energy consumption. Result show that proposed MAC obtains more energy savings.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.313-326
• /
• 2022

This study presents a noble scheme for distributed and parallel simulations with optimized agent placement for simulation instances. The traditional parallel simulation has some limitations in that it does not provide sufficient performance even though using multiple resources. The main reason for this discrepancy is that supporting parallelism inevitably requires additional costs in addition to the base simulation cost. We present a comprehensive study of parallel simulation architectures, execution flows, and characteristics. Then, we identify critical challenges for optimizing large simulations for parallel instances. Based on our cost-benefit analysis, we propose a novel approach to overcome the performance constraints of agent-based parallel simulations. We also propose a solution for eliminating the synchronizing cost among local instances. Our method ensures balanced performance through optimal deployment of agents to local instances and an adaptive agent placement scheme according to the simulation load. Additionally, our empirical evaluation reveals that the proposed model achieves better performance than conventional methods under several conditions.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2001.11a
• /
• pp.335-354
• /
• 2001

.Next Generation Multimedia Streaming Technology Massive Scale Support $\rightarrow$ Clustered Solution Adaptive to Heterogeneous Network daptive to Heterogeneous Terminal Capability Presentation Technique .SMART Server Architecture .HERMES File System .Clustered Solution . High Speed Storage Interconnect .' Content Partitioning . Load Management . Support for Heterogeniety . Adaptive End to End Streaming Transport: Unicast vs. Multicast '. Scalable Encoding

• Journal of applied mathematics & informatics
• /
• v.11 no.1_2
• /
• pp.373-378
• /
• 2003

consider the problem of sequentially hypotheses about a parameter $\theta$ in the presence of the nuisance parameter $\rho$. and we investigate further to computing the error probabilities and expected sample sizes in the frequentist properties of the adaptive S.P.R.T. for $\theta$.

• Communications of the Korean Institute of Information Scientists and Engineers
• /
• v.24 no.12 s.211
• /
• pp.84-91
• /
• 2006

• Nuclear Engineering and Technology
• /
• v.56 no.7
• /
• pp.2498-2515
• /
• 2024

In this study, we propose a fully parallelized adaptive particle refinement (APR) algorithm for smoothed particle hydrodynamics (SPH) to construct a stable and efficient multi-resolution computing system for nuclear safety analysis. The APR technique, widely employed by SPH research groups to adjust local particle resolutions, currently operates on a serialized algorithm. However, this serialized approach diminishes the computational efficiency of the system, negating the advantages of acceleration achieved through high-performance computing devices. To address this drawback, we propose a fully parallelized APR algorithm designed to enhance both efficiency and computational accuracy, facilitated by a new adaptive smoothing length model. For model validation, we simulated both hydrostatic and hydrodynamic benchmark cases in 2D and 3D environments. The results demonstrate improved computational efficiency compared to the conventional SPH method and APR with a serialized algorithm, and the model's accuracy was confirmed, revealing favorable outcomes near the resolution interface. Through the analysis of jet breakup, we verified the performance and accuracy of the model, emphasizing its applicability in practical nuclear safety analysis.

• IEIE Transactions on Smart Processing and Computing
• /
• v.6 no.4
• /
• pp.276-280
• /
• 2017

This paper presents computationally efficient image compression for wireless transmission of high-definition video, to adaptively utilize available channel bandwidth and improve image quality. The method indirectly predicts an unknown available channel bandwidth by monitoring encoder buffer status, and adaptively controls a quantization parameter to fully utilize the bandwidth. Experimental results show that the proposed method is robust to variations in channel bandwidth.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.155-166
• /
• 2003

Mobile computing becomes a new issue of researches in computing due to the advances of mobile equipment and the connection with Internet. In mobile environment, there are many constraints such as limited bandwidth, intermittent disconnection, limited battery life, and so on. By these reasons, broadcasting has been generally used to disseminate data efficiently by the mobile applications. This paper proposes an adaptive broadcasting method which logically divides broadcast channel into the periodic broadcast channel and the on-demand broadcast channel and dynamically assigns the bandwidths of both channel. The former disseminates data that are selected based on both the popularity and the size of each datum, the latter disseminates data that are selected based on the requests of mobile clients. When selecting data to be disseminated, the proposed broadcasting method considers the mobility of a mobile client and also considers the size of each datum by using SF(size factor) proposed in this paper. This paper also evaluates the proposed broadcasting method by measuring the energy expenditure of mobile client in experiments.

• Proceedings of the Korea Society of Information Technology Applications Conference
• /
• 2007.11a
• /
• pp.138-138
• /
• 2007