유비쿼터스 응용을 위한 HCI 기반 기술연구 소개

추현승 한국HCI학회 2007 한국HCI학회 학술대회 Vol.2007 No.2

1,6-Disubstituted-1H-benzo[d]imidazol-2(3H)-one Derivatives as PIM Kinase Inhibitors

추현승,정승익,Hong, Victor Sukbong,이진호 계명대학교 자연과학연구소 2022 Quantitative Bio-Science Vol.41 No.1

PIM proteins, which are proto-oncogenic serine/threonine kinases that are highly expressed in hematological malignancies and solid cancers, are potential molecular targets for anticancer drugs. 1H-Benzo[d]imidazol-2(3H)-one is a key structure in drug discovery, and several of its analogues have been developed as therapeutics. 1,6-Disubstituted-1H- benzo[d]imidazol-2(3H)-one derivatives were synthesized and evaluated in terms of their inhibitory activities against all three PIM kinases. Systematic structural modifications of benzo[d]imidazol-2-one at the 1- and 6-positions led to the discovery of pan-PIM inhibitors represented by 9. The binding modes of the synthesized compounds and the effects of the substituents on the selectivities among the PIM kinase isoforms were studied to confirm 1,6-disubstituted-1H- benzo[d]imidazol-2(3H)-one as a scaffold for use in the discovery of PIM kinase inhibitors.

3차원 토러스 구조를 갖는 멀티컴퓨터에서의 동적 작업 스케줄링 알고리즘

추현승,윤희용,박경린,Choo, Hyun-Seung,Youn, Hee-Yong,Park, Gyung-Leen 한국정보처리학회 2001 정보처리학회논문지 A Vol.8 No.3

멀티컴퓨터 시스템은 많은 연산 노드들을 이용함으로써 높은 성능을 얻는다. 다차원 매쉬(mash)는 단순함과 효율성 때문에 멀티컴퓨터 구조로 널리 이용되었다. 본 논문은 3차원 토러스(torus) 시스템을 위한 최초 적합(first-fit) 방법에 기반한 효율적인 프로세서 할당 알고리즘을 제안한다. 이 알고리즘은 CST(Coverage Status Table)을 이용하여 3차원 정보를 2차원 정보로 변형하므로써 프로세서 할당 시간을 최소화 한다. 종합적인 컴퓨터 시뮬레이션 결과는 제안한 방법이 최적 적합(best-fit)에 기반한 기존 방법들과 비교해서 프로세서 이용률은 비슷하면서, 프로세서 할당 시간이 항상 짧다는 것을 보여준다. 성능 차이는 입력 부하가 증가함에 따라 더욱 두드러진다. 다른 스케줄링 환경상에서 제안된 방법의 성능을 조사하기 위해서, 전형적인 FCFS 스케줄링 기법과 함께 non-FCFS 스케줄링 기법도 연구된다. Multicomputer systems achieve high performance by utilizing a number of computing nodes. Multidimensional meshes have become popular as multicomputer architectures due to their simplicity and efficiency. In this paper we propose an efficient processor allocation scheme for 3D torus based on first-fit approach. The scheme minimizes the allocation time by effectively manipulating the 3D information an 2D information using CST (Coverage Status Table). Comprehensive computer simulation reveals that the allocation time of the proposed scheme is always smaller than the earlier scheme based on best-fit approach, while allowing comparable processor utilization. The difference gets more significant as the input load increases. To investigate the performance of the proposed scheme with different scheduling environment, non-FCFs scheduling policy along with the typical FCFS policy is also studied.

무선 네트워크 환경에서 이동 단말들의 불규칙한 요구 탐지를 위한 연구

추현승,윤희용,정민영 한국시뮬레이션학회 2002 한국시뮬레이션학회 논문지 Vol.11 No.4

One of the key issues in mobile communication system is how to predict the number of calls per each cell. It is an important parameter and usually assumed as random Poisson value. For effective management of cellular network, the average number of calls should be traced and the changes in the numbers need to be promptly detected. In this paper we propose an algorithm detecting the changes in the demands of the users using the technique proposed for point-of-change problem based only on the number of call arrivals. Computer simulation reveals that the proposed method can effectively detect the discord, and the developed model is very accurate as showing mostly less than 1% differences.

WDM방식을 기반으로 한 광 네트워크상에서 최대 EDPs(Edge Disjoint Paths)을 이용한 라우팅 및 파장할당 알고리즘

추현승,정성택,이성창,Choo, Hyun-Seung,Chung, Sung-Taek,Lee, Sung-Chang 한국정보처리학회 2004 정보처리학회논문지 C : 정보통신,정보보안 Vol.11 No.5

본 논문에서 파장 분할 다중화(WDM) 방식을 이용한 광 네트워크상의 라우팅과 파장할당 알고리즘을 고찰해 보겠다. 선형 프로그래밍(Linear Programming)과 그래프 컬러링(Graph Coloring)의 조합으로 이루어진 기존의 RWA기법들은 복잡하며, 발견적 방법(Heuristic Method) 사용이 요구된다. 이와 같은 방법은 실행시간이 길며, 최악의 경우에는 실행이 불가능하여 결과를 얻지 못한다. RWA를 해결하기 위한 다른 방법은 최대 EDPs(Edge Disjoint Paths)를 얻기 위해 greedy algorithm을 적용하는 것이다. 이것은 실행시간이 짧지만 파장의 수를 최적으로 사용하지 못한다. 본 논문에서 최대의 EDPs를 얻기 위해서 최대 흐름 기법(Maximum Flow Technique)을 이용한 새로운 알고리즘을 제안한다. 그리고 제안한 알고리즘과 기존에 제시된 최대 EDPs 알고리즘을 비교해 보겠다. In the present paper routing and wavelength assignment (RWA) in optical WDM networks is considered. Previous techniques based on the combination of integer linear programming and graph coloring are complex and require extensive use of heuristics. Such methods are mostly slow and sometimes impossible to get results due to infeasibility. An alternative approach applied to RWA employs on the greedy algorithm for obtaining the maximum edge disjoint paths. Even though this approach is fast, it produces a solution for any connection request, which is very far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow technique to obtain the maximum quantity of edge, disjoint paths. Here we compare the offered method with previous maximum edge disjoint paths algorithms ap plied to the RWA.

IMT-2000을 위한 시스템간 핸드오프의 성능 향상

추현승,윤희용,최대규,Choo, Hyun-Seung,Youn, Hee-Yong,Choi, Dae-Kyu 한국정보처리학회 2002 정보처리학회논문지 C : 정보통신,정보보안 Vol.9 No.6

For a successful inter-system handoff, several important issues must be handled and additional new features must be considered. This paper focuses on the cellular structure of small cells which are required for the high density of population and a handoff scheme designed between two heterogenous networks. Incase of inter-system handoff (ISHO), the time required to complete the handoff can vary and depends on the structure of networks. And also the transmission of additional signals can increase the probability of failure for ISHO. Here we propose the sub-boundary cell base station (Sub-BBS) to alleviate the role of the BBS. The Sub-BBS is adjacent to BBS in the same regional mobile network. 쪼en the mobile terminal enters Sub-BBS, the network starts finding a new route and after entering BBS, it initiates the transformation process. The proposed scheme significantly reduces the ISHO failure rate compared to the existing one which is the most recent and known as efficient.

몬데카를로 소프트 헨드오프 모델링

추현승,정민영,홍인기 한국시뮬레이션학회 2004 한국시뮬레이션학회 논문지 Vol.13 No.1

In this paper some models for obtaining the distribution of a sojourn time in CDMA cellular systems are proposed. Knowledge on this is essential for reliable modeling of the soft handoff and for solving other related problems in the analysis of cellular system. The proposed model is based on random walk and can be adopted to different conditions. Analytical results can be obtained that lead to a quite complicated numerical scheme so simulation models are used for Monte Carlo experiments. Main assumptions include different kinds of mobile carriers (pedestrians and transport passengers) and round shape of a cell. The scheme for simulation experiments is presented along with the discussion of simulation results.

출구 버퍼모듈을 갖는 패킷교환식 상호 연결 망의 성능 분석

추현승(Choo Hyun Seung),박경린(Park Gyung Leen) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.4

Packet-switched multistage interconnection networks(MINs) have been widely used for digital switching systems and super computers. In this paper we show that multiple packets in a switching element can move to the succeeding switching element in one network cycle by fully utilizing the cycle bandwidth. Only one packet movement was usually assumed in typical MINs. We present an analytical model for the MINs with the multiple packet movement scheme, and validate it by computer simulation. Comparisons with the traditional MINs of single packet movement reveal that the throughput is increased up to about 30% for practical size MINs. Similar result was also obtained for delays. The performance increase is more significant when the network traffic is nonuniform.

이차원 메쉬 상호 연결 망에 대한 효율적인 태스크할당 알고리즘

추현승(Choo Hyun Seung),박경린(Park Gyung Leen),유성무(Yoo Seong Moo) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.6

An effective allocation of requested number of processors to newly incoming tasks in two-dimensional (2D) mesh interconnection networks is very important for achieving the desired high performance and resource utilization. It also needs to guarantee the complete recognition of the free submeshes based on contiguous and available processors with minimum overhead. An efficient task allocation algorithm for 2D meshes is presented in this paper. By employing a new approach for searching the one-dimensional array, the proposed algorithm can find the available submesh without the scanning of the entire 2D array unlike earlier designs. As a result, the new algorithm can significantly reduce the task allocation time. Comprehensive computer simulation shows that the average allocation time and waiting delay are much smaller than earlier designs irrespective of the size of meshes. The hardware overhead is comparable to other algorithms.

개인 이동 통신 상에서 가상 계층을 이용한 위치 갱신 트래픽의 감소

정대우,추현승,윤희용,박경린 한국시뮬레이션학회 2001 한국시뮬레이션학회 논문지 Vol.10 No.2

In mobile wireless network efficient location management for tracking and finding mobile users is a critical issue. The traffic for location update can be excessive, especially at the base stations that are near to the location area (LA) boundaries. In this paper we propose a new location update scheme which can significantly reduce the signaling traffic for location update. It is based on the virtual layer approach employing SubMSCs. The virtual layer is laid upon the original layer of LAs such that the mobile terminals moving around the boundary cells of adjacent LAs become to move within a virtual LA. As a result, the location update traffic is substantially reduced compared to overlapping scheme which is the most recent and efficient location update scheme.