• International Journal of Computer Science & Network Security
• /
• 제24권2호
• /
• pp.15-24
• /
• 2024

One of the most significant issues in combinatorial optimization is the classical NP-complete conundrum known as the 0/1 Knapsack Problem. This study delves deeply into the investigation of practical solutions, emphasizing two classic algorithmic paradigms, brute force, and dynamic programming, along with the metaheuristic and nature-inspired family algorithm known as the Genetic Algorithm (GA). The research begins with a thorough analysis of the dynamic programming technique, utilizing its ability to handle overlapping subproblems and an ideal substructure. We evaluate the benefits of dynamic programming in the context of the 0/1 Knapsack Problem by carefully dissecting its nuances in contrast to GA. Simultaneously, the study examines the brute force algorithm, a simple yet comprehensive method compared to Branch & Bound. This strategy entails investigating every potential combination, offering a starting point for comparison with more advanced techniques. The paper explores the computational complexity of the brute force approach, highlighting its limitations and usefulness in resolving the 0/1 Knapsack Problem in contrast to the set above of algorithms.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2003년도 봄 학술발표논문집 Vol.30 No.1 (B)
• /
• pp.368-370
• /
• 2003

단백질들의 복수서열정렬은 단백질 서열간의 관계를 유추할 수 있는 유용한 도구이다. 최적화된 복수서열정렬을 얻기 위해 사용되는 가장 유용한 방법은 dynamic programming이다. 그러나 dynamic programming은 특정한 비용함수를 사용할 수 없기 때운에 특별한 경우 최적의 복수서열정렬을 제공하지 못하는 문제점이 있다. 우리는 이러한 문제점을 해결하기 위하여 부분정렬개선기법을 사용한 알고리즘을 제안하였으며, 이 알고리즘이 dynamic programming의 문제점을 효과적으로 해결함을 보였다.

• 한국통신학회논문지
• /
• 제21권12호
• /
• pp.3109-3120
• /
• 1996

SDL has been standardized to specify behavioral aspects of communication systems based on the formal description technique, and it is powerful and user friendly in the sense of supporting human communication and understanding, formal analysis andcomparison of behaviors, alternative implementations and design optimization, and its structural decomposition. However, SDL is not sufficient for an efficient handing of entrire system descriptions because the communication systems are generally very complex, and composed from the various interactions among sub-systems. Also, it is very difficult to explicitly verify dynamic views such as liveness and reachability. it leads the demands on analysis scheme to verify dynamic behaviros of specified systems. This paper presents modeling concepts of Petri Nets from SDL and transformation rules to Numerical Petri Nets to provide efficient technqiques for verification of dynamic behaviors, and proposes the reachability garaph that is able to trace all reachable states of a modeled system and reduce an information loss on the reachability tree.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제15권5호
• /
• pp.570-576
• /
• 2015

Existing flash storage devices such as universal flash storage and solid state disk support command queuing to improve storage I/O bandwidth. Command queuing allows multiple read/write requests to be pending in a device queue. Because multi-channel and multi-way architecture of flash storage devices can handle multiple requests simultaneously, command queuing is an indispensable technique for utilizing parallel architecture. However, command queuing can be harmful to the latency of fsync system call, which is critical to application responsiveness. We propose a dynamic queue depth adaptation technique, which reduces the queue depth if user application is expected to send fsync calls. Experiments show that the proposed technique reduces the fsync latency by 79% on average compared to the original scheme.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2003년도 봄 학술발표회 논문집
• /
• pp.521-528
• /
• 2003

This paper presents the results of a cooperative research on remote parallel pseudo-dynamic testing on a base-isolated bridge with multiple piers using Internet between KAIST, Korea and Kyoto Univ., Japan. Experimental facilities located at two institutions were parallelly used to test the nonlinear behavior of the base-isolators. Two data communication schemes for parallel tests were developed and the performance is compared. The results indicate that the elapsed time may vary widely depending on the data communication and testing schemes : i.e. 1-25sec for each time step. But it is fairly comparable with the time required for pseudo-dynamic testing. The testing method can become more powerful, as the data communication and monitoring techniques through Internet improve further.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권7호
• /
• pp.2480-2495
• /
• 2014

This paper describes a hierarchical method for image-based age estimation that combines age group classification and age value estimation. The proposed method uses a coarse-to-fine strategy with different appearance features to describe facial shape and texture. Considering the damage to continuity between neighboring groups caused by fixed divisions during age group classification, a dynamic grouping technique is employed to allow non-fixed groups. Based on the given group, an ordinal hyperplane ranking (OHRank) model is employed to transform age estimation into a series of binary enquiry problems that can take advantage of the intrinsic correlation and ordinal information of age. A set of experiments on FG-NET are presented and the results demonstrate the validity of our solution.

• 제어로봇시스템학회논문지
• /
• 제18권8호
• /
• pp.794-799
• /
• 2012

The international standard, ISO-11783, was designed for the communication within an agriculture machinery. Even if it is based on the CAN (Control Area Network) protocol, its extended features which include point-to-point communication and large data transmission support show different network performance from the standard CAN. This paper proposes a dynamic priority allocation method to improve the real-time performance of ISO-11783. Computer simulation shows reduction of the deadline-missed cases and community latency via proposed algorithm.

• Journal of Power Electronics
• /
• 제18권1호
• /
• pp.34-44
• /
• 2018

This paper presents a pulse-width adjustment (PWA) strategy for a novel bidirectional DC-DC boost converter to improve the performance of the dynamic inductor current response. This novel converter consists of three main components: a full-bridge converter (FBC), a high-frequency isolated transformer with large leakage inductance, and a three-level voltage-doubler rectifier (VDR). A number of scholars have analyzed the principles, such as the soft-switching performance and high-efficiency characteristic, of this converter based on pulse-width modulation plus phase-shift (PPS) control. It turns out that this converter is suitable for energy storage applications and exhibits good performance. However, the dynamic inductor current response processes of control variable adjustment is not analyzed in this converter. In fact, dc component may occur in the inductor current during its dynamic response process, which can influence the stability and reliability of the converter system. The dynamic responses under different operating modes of a conventional feedforward control are discussed in this paper. And a PWA strategy is proposed to enhance the dynamic inductor current response performance of the converter. This paper gives a detailed design and implementation of the PWA strategy. The proposed strategy is verified through a series of simulation and experimental results.

• 대한전자공학회논문지TC
• /
• 제48권2호
• /
• pp.14-20
• /
• 2011

통신 노드들이 이동 중인 mobile ad hoc networks에서, 통신처리율에 따라 노드 쌍들의 순위를 결정하면, 이를 바탕으로 전체 네트워크의 처리율을 향상시키는 동적인 라우팅을 할 수 있다. Balanced Howell rotations는 브리지 게임을 위한 토너먼트 구성 방법의 하나이다. 본 논문에서는 mobile ad hoc networks의 전반적인 통신 처리율 향상을 위해 balanced Howell rotations를 활용할 수 있음을 설명한다. 그리고 balanced Howell rotations가 존재할 수 있는 조건을 제시하고, 이를 증명한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제5권9호
• /
• pp.1668-1683
• /
• 2011

The importance of secure communication between only legitimate group members in ad hoc networks has been growing in recent years. Due to the ad hoc nature the scalability on dynamic membership change is a major concern. However, the previous models require at least O(log n) communication cost for key update per each membership change, which imposes a heavy burden on the devices. In this paper we present a scalable model that supports communication-efficient membership change in ad hoc networks by exclusionary keys and RSA functions. The multicast cost for key update is extremely low, that is O(1) , and one-to-one communications occur mostly in neighboring devices.