• IE interfaces
• /
• v.17 no.2
• /
• pp.149-157
• /
• 2004

This paper considers a conformity testing problem on EJB(Enterprise JavaBeans). The EJB architecture is a component architecture for the development and deployment of component-based distributed business applications. The objective is to find an optimal test sequence for the conformity test between the EJB specification and an implemented one. For the test sequence, we formulate the problem as a rural Chinese postman tour one and use a linear programming formulation. Based upon the formulations, we suggest a conformance test procedure and show its efficiency by applying the procedure to the CMP(Container- Managed persistency) entity bean of the EJB.

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.36-40
• /
• 2013

The paper discusses the problem of how to allocate the fund to a large number of individuals in a higher school so as to bring a higher utility return based on the theory of uncertain set. Suppose that experts can assign each invested individual a corresponding nondecreasing membership function on a close interval I according to its actual level and developmental foreground. The membership degree at the fund $x{\in}I$ is called utility degree from fund x, and product (minimum) of utility degrees of distributed funds for all invested individuals is called united utility degree from the fund. Based on the above concepts, we present an uncertain optimization model, called Maximal United Utility Degree (or Maximal Membership Degree) model for fund distribution. Furthermore, we use nondecreasing polygonal functions defined on close intervals to structure a mathematical maximal united utility degree model. Finally, we design a genetic algorithm to solve these models.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.67-74
• /
• 2004

Most of today's parallel numerical schemes use synchronous algorithms, where some processors that have finished their tasks earlier than others must wait at synchronization points for correct computation. Hence overall performance of the system is dependent upon the speed of the slowest processor. In this paper, we det·ise a synchronous/asynchronous hybrid algorithm to accelerate convergence of the solution for finding the dominant eigenpair of a large matrix, by reducing the idle times of faster processors using MPMD programming methodology.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2001.10a
• /
• pp.318-321
• /
• 2001

A collaboration supporting system, which enables multi-user collaboration and communication in Internet environment, is being a new indispensable tool to compete and collaborate with business peers. A collaboration supporting system in distributed environment requires scalable and open system architecture to rapidly deploy a new technology and trends. In this paper, we propose such a collaboration supporting system where communication API is using XMI(Extended Markup Language)-based SOAP(Simple Object Access Protocol)protocols, which is independent on programming language and platform. In our system, sever components are developed with EJB(Enterprise Java Beans). System analysis, design, and development are based on UML(Unified Modeling Language).

• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.157-162
• /
• 2005

Parallel implementation and performance assessment of the grid assembly in a structured chimera grid approach is studied. The grid assembly process, involving hole cutting and searching donor, is parallelized on the PC cluster. A message passing programming model based on the MPI library is implemented using the single program multiple data(SPMD) paradigm. The coarse-grained communication is optimized with the minimized memory allocation because that the parallel grid assembly can access the decomposed geometry data in other processors by only message passing in the distributed memory system such as a PC cluster. The grid assembly workload is based on the static load balancing tied to flow solver. A goal of this work is a development of parallelized grid assembly that is suited for handling multiple moving body problems with large grid size.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.4
• /
• pp.23-37
• /
• 2001

This paper is concerned with the critical issue of allocating limited corporate resources among multiple products and between production and marketing functions of a functionally decentralized firm where the two geographically remote functions independently make decisions pertaining to their own decision-making domain. We attempt to demonstrate how IT can contribute to enhancing the quality of coordinating production and marketing functions from the perspective of resource allocation. To this end, we propose a prototype named ITBCS (IT-Based Coordination System) that works under LAN supported computing environments. We develop a comprehensive coordination scheme that can handle various cost functions for the resource constrained, multiple product case that huts been tittle discussed in literature. A preliminary version of ITBCS has been implemented for a hypothetical situation where LAN electronically wires distributed marketing and production computing nodes. Managerial implications are also discussed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.327-331
• /
• 2006

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands and the product is provided to the warehouse via procurement ordering from any manufacturing plant or market The Problem is formulated as an Mixed Integer Programming with the objective function of minimizing the sum of inventory holding cost (at the warehouse and retailers), and transportation cost and procurement ordering cost at the warehouse, subject to inventory-balancing constraints, ordering constraints, vehicle capacity constraints and transportation time constraints. The problem is Proven to be NP-hard. Accordingly, a Lagrangean heuristic procedure is derived and tested for its effectiveness through computational experiments with some numerical instances.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10b
• /
• pp.568-570
• /
• 2001

현재 다양한 패러다임의 수많은 프로그래밍 언어가 존재하고 있으며, 각각의 프로그래밍 언어를 실습하려면 해석기(interpreter)나 컴파일러(compiler) 같은 언어처리기를 갖추는 것이 필요하다. 언어처리기를 개별적으로 갖추는 것은 설치에 대한 시간적 부담, 시스템 자원 낭비 업그레이드의 필요성 등으로 인해서 언어 학습과 직접적인 관련이 없는 부분에 대한 부담이 커진다. 본 논문에서는 WWW 환경에서 프로그래밍 언어를 실습할 수 있는 시스템을 구축하였다. 실습하는 프로그래밍 언어는 특정 서버에 제한적이지 않고, 네트워크를 통한 분산환경에서 확장이 용이하다. 또한 실습환경을 설정하는 구성 파일은 구조화된 문서의 작성을 지원하는 XML을 이용하여 관리자가 쉽게 구성파일을 작성할 수 있도록 했고, 자바의 정책(policy)파일을 이용해 시스템 자원 사용 허가를 투명하게 했다.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.1
• /
• pp.20-28
• /
• 2002

A collaboration supporting system, which enables multi-user collaboration and communication in Internet environment, is being a new indispensable tool to compete and collaborate with business peers. A collaboration supporting system in distributed environment requires scalable and open system architecture to rapidly deploy a new technology and trends. In this paper, we propose such a collaboration supporting system where communication API is using XML(Extended Markup Language)-based SOAP(Simple Object Access Protocol)protocols, which Is independent on programming language and platform. In our system, server components are developed with EJB(Enterprise Java Beans). System analysis, design, and development are based on UML(Unified Modeling Language).