• Annual Conference of KIPS
• /
• 2002.04b
• /
• pp.821-824
• /
• 2002

과거의 프로그램은 단일 프로그램으로 작성될 경우, 작성하기도 어렵고 관리 또한 용이하지가 않았다. 결국, 오늘날에는 이를 해결하고자 큰 프로그램을 작고 이해하기 쉬운 분산 컴포넌트별로 나누는 방식을 활용하고 있다. 하지만, 이러한 분산 컴포넌트 기반 소프트웨어는 보안 측면에서 볼 때 상당히 위험한 요소들을 내포하고 있다. 즉, 외부나 내부에서 독립적으로 링크되는 개개의 컴포넌트들이 보안을 고려한 모든 상황에서 안전하게 이용된다는 보장이 없다. 본 논문에서 제안하는 시스템은 바로 이러한 점을 해결하고자 운영 체제에 보안 모듈을 내장하고 이 보안 모듈로 하여금 개개의 컴포넌트가 링크될 때에 그 안전성을 검증하고 혹시 있을지 모를 불법적인 컴포넌트 조작을 사전에 막을 수 있도록 설계하였다.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.1 s.94
• /
• pp.125-131
• /
• 1999

For linkage mechanisms driven by a cam, cam profile is the major design factor and is determined by the cam follower motion. If a cam mechanism has additional kinematic linkage besides cam and follower then the follower motion should be specified from the motion of end linkage member so that cam would be able to generate the desired end linkage motion. In this paper, a cam-linkage mechanism is constructed with the combinations of modular linkage elements including cam and follower and as a result, a planar cam-linkage mechanism design software with the cam profile optimization function is developed and presented.

• Journal of the Korean Society of Propulsion Engineers
• /
• v.23 no.4
• /
• pp.50-60
• /
• 2019

This paper introduces the development of a toolbox for the Space Shuttle Main Engine(SSME) based on MATLAB/Simulink. A mathematical model of rocket engine creation and validation can be a complex process, the development of a rocket engine toolbox simplifies this process, thereby facilitating engine performance optimization as well as new design development. The mathematical modeling of the SSME dealt with in this paper is formed by 32 first-order differential equations derived from seven governing equations. We develop the toolbox for the SSME classifying each module according to the engine components. Further, we confirm the validity of the toolbox by comparing the results of the simulation obtained using the toolbox with those obtained using the original simulation of the engine.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.664-668
• /
• 2004

본 논문에서는 고속 이더넷의 고속의 이더넷의 물리계층에서 수신된 비트열로 부터 클록을 복원하고, 이 클록으로부터 동기된 비트열을 10b/8b 디코딩한 다음, 바이트열로 복원하여 데이터 링크계층의 MAC(Media Access controller)로 전송한다. PCS의 디코더는 S비트의 데이터와 제어신호를 추출하여 MAC으로 전달하는 기능을 수행한다. 즉 본 논문에서는 PCS기능 중 가장 중요한 요소인 10b/8b 디코더를 VHDL언어를 사용하여 기술하고 Xilinx ISE5.1를 이용하여 구현하였고, 입력 부분에 DDR인터페이스를 사용하였다. 구현한 결과 1056개의 게이트 사용하였으며, 10Gbps를 지원하기 위해서는 한 블록 당 2.5Gbps의 처리속도가 필요하다. 설계 모듈은 5.1Gbps의 처리 속도를 지원하여 관련 응용분야에서 사용이 가능할 것으로 사료된다.

• The KIPS Transactions:PartD
• /
• v.9D no.3
• /
• pp.447-456
• /
• 2002

Web applications haute different structural characteristics from conventional applications. A web application typically consists of server-side script elements which run on web sowers, client-side script elements which run on the client web-browser, link elements that the user clicks, and event elements that connect user-triggered request to the client script elements. These four elements are combined to form a web application. In such environments, direct application of conventional methods for measuring application complexity may not be possible, because they are primarily designed to measure complexity of modules and classes. In this paper, therefore, we propose metrics of Cyclomatic Complexity for Web Application (CCWA). We developed a tool to measure such metrics and applied it to the real-world examples. We found that the proposed CCWA metrics can be used for measuring complexity of highly complex web applications, which is not possible with conventional module and class based measurement techniques.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.160-167
• /
• 2003

A static shuffle-exchange network is not only useful for several parallel applications but also use less hardware than the popular multi-stage network or hypercube. Even though it has a lot of advantages, it has never been used in any implemented parallel machine. One of the reasons is there has not been any techniques to make the network fault-tolerant. In this paper multiple fault-tolerant static shuffle-exchange networks are presented. In order to recover from k faulty processing elements, a network needs at least 2 k additional processing elements and at most 4 k additional shuffle ports for each processing elements. By decomposing the k fault-tolerant static shuffle-exchange network into m identical modules, this paper shows that the reliability of the network can be increased.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.48 no.3
• /
• pp.6-12
• /
• 2011

Electric vehicles and robots are real-time distributed control systems composed of multiple drive subsystems using micro controller units. Each control subsystem should be modular, compact, power saving, interoperable and fault tolerable in order to be incorporated into the networked real-time distributed control system. Under the networked real-time distributed control the synchronization problem can be occurred to the position and orientation tracking control due to the load variance, mismatch and time delay between the multiple drive subsystems. This paper suggests two types of position synchronization control of the single link manipulators. One of them is composed of cross controller, Kalman filter and disturbance observer, and the other uses the generation of target trajectories to minimize the gradient vector of the scalar function which is composed of the sum of square errors between the reference input vector and the output vectors. The availability of the proposed control schemes is shown through the control experiments.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.561-572
• /
• 2006

Performance of the mobile devices greatly depends on the efficient resource management because they are usually resource-restricted. In particular, the dynamic storage allocation algorithms very important part of the mobile device's operating system and OS-like software platform. The existing dynamic storage allocation algorithms did not consider application's execution style and the type, life-time, and characteristics of memory objects that the application uses. Those algorithms, as a result, could not manage memory efficiently Therefore, this Paper analyzes the mobile application's execution characteristics and proposes anew dynamic storage allocation algorithm which saves the memory space and improves mobile application's execution speed. The test result shows that the proposed algorithm works 6.5 times faster than the linked-list algorithm[11], 2.5 times faster better than the Doug. Lea's algorithm[12] and 10.5 times faster than the Brent algorithm[14].

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.12C
• /
• pp.1239-1247
• /
• 2005

It is important to improve TCP performance in Self-similar TCP network where signalling between the same end nodes through bidirectional traffic routes. In wireless link, the traffic limitation pattern occurred in two or more TCP connections is applied into MPEC video control as multi time-interval congestion control. For TCP update variable, we extend TCP and perform as function call, and we study a method of relating TCP with LTS module controlling with the information type that is overcoming the limit of feedback loop determined by RTT. For comparison, we measure the TCP throughput without LTS and verify the fairness by means of meta control. The improved TCP performance is shown by that the number of connections of traffic congestion control increases when RTT increases.