http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
u-City 서비스 구축 및 운영을 위한 법제도 개선에 관한 연구
박순형(Soon-Hyung Park) 한국IT서비스학회 2009 한국IT서비스학회 학술대회 논문집 Vol.2009 No.1
The vision of u-City is an implementation of ubiquitous environments that makes anybody to be able to access the source of information and knowledge in anywhere and anytime with any methods. It is necessary to study the law and institution of u-City about a role of the government and local governments to have a new growth power. We need to improve the related law and institution with standardization of u-City service to regulate and coordinate diversity of main organ and business area. In this paper, we select service modes to consider the priority order of service and suggest a reform measure of law and institution classified by service models.
동적 슬라이싱 기법을 이용한 프로그램 버전들의 통합 알고리즘
박순형(Soon Hyung Park),정은이(Eun Yi Jung),박만곤(Man Gon Park) 한국정보처리학회 2000 정보처리학회논문지 Vol.7 No.3
For the operation of the practical software systems, the development, extension and modification phases are successively needed through the new requirements added and their errors debugging detected. Therefore, if it is possible to integrate the reusable software components and to reorganize them into the new software systems, we can improve the productivity, quality, and cost-effectiveness for the development of software systems. For these reasons, it will be required to research and develop methodology and tools for programs integration which make some programs merged effectively. In the process of merging two versions of a program into one, we can consider that some parts of the two versions are equivalent under the non-interference between them. According to the previous studies the program selected to determine the criterion of non-interference was very large, so we have difficulty in integrating many programs practically. In this paper, we propose a new improved algorithm which can reduce the related program size of non-interference criterion by use of dynamic slicing techniques for integration of two versions of a program, and prove the efficiency of the proposed algorithm by showing some examples.
소프트웨어 테스팅을 위한 동적 프로그램 슬라이싱 알고리즘의 효율성 비교
박순형(Park Soon Hyung),박만곤(Park Man Gon) 한국정보처리학회 1998 정보처리학회논문지 Vol.5 No.9
Software engineers generally analyze the program behavior under the test-case revealed the error, not under any generic test-case. In this paper we discuss the dynamic slice consisting of all statements that actually affect the value of a variable occurrence for a given program input. We propose an efficient algorithm to make dynamic program slices. The efficiency of this algorithm is evaluated on some developed programs. Results are shown by a marking table of execution history, Dynamic Dependence Graph, and Reduced Dynamic Dependence Graph. Consequently, the efficiency of the proposed algorithm is also presented by the comparison with algorithm that was announced previously.
특정도시의 단계별 필수기반 u-City 서비스 도출 방안에 관한 연구
박순형(Soon-Hyung Park) 한국IT서비스학회 2009 한국IT서비스학회 학술대회 논문집 Vol.2009 No.1
A u-city is a vision of a city with computers and sensors built in to its infrastructure, and data sharing among the various information systems. A u-City provides several u-City services to the u-City clients. The u-City services for local governments contain two types of functions: common function and specified function. It is needed a study on generation of specified service models of local governments. The proposed service model divides functions of the city into two service areas: common support service and specified support service. And we suggest the way to generate the u-services of each local government in this paper.
다중 기준변수를 사용한 동적 프로그램 슬라이싱 알고리즘의 효율성 비교
박순형(Park Soon Hyung),박만곤(Park Man Gon) 한국정보처리학회 1999 정보처리학회논문지 Vol.6 No.9
Software engineers are used to analyse the error behavior of computer programs using test cases which are collected for the testing phase when software errors are detected. In actual software testing and debugging, it is important to adopt dynamic slicing technique which is concerned on all the statements to be affected by the variable of current inputs and to use technique of its implementation. The traditional dynamic slicing has focused on the single slicing criterion algorithm. It has been thought that it is needed to develope and implement algorithm for used multiple criteria variables program slicing, which finds every slicing criterion variable where it is used multiple criteria variables. In this paper, we propose an efficient algorithm to make dynamic program slices when it has used multiple criteria variables. The results of the implementation are presented by the marking table on execution history and the dynamic dependence graph. Also we can find that the proposed dynamic program slicing approach using multiple criteria variables is more efficient than the traditional single case algorithm on the practical testing environment.