• Journal of the Korea Society of Computer and Information
• /
• v.21 no.9
• /
• pp.91-100
• /
• 2016

In this research, emergency vehicle dispatching problems faced with in the wake of massive natural disasters are considered. Here, the emergency vehicle dispatching problems can be regarded as a single machine stochastic scheduling problems, where the processing times are independently and identically distributed random variables, are considered. The objective of minimizing the expected number of tardy jobs, with distinct job due dates that are independently and arbitrarily distributed random variables, is dealt with. For these problems, optimal static-list policies can be found by solving corresponding assignment problems. However, for the special cases where due dates are exponentially distributed random variables, using a proposed dynamic programming approach is found to be relatively faster than solving the corresponding assignment problems. This so-called Pivot Dynamic Programming approach exploits necessary optimality conditions derived for ordering the jobs partially.

• Journal of Advanced Navigation Technology
• /
• v.17 no.3
• /
• pp.346-353
• /
• 2013

The dominant trend in software development is the globalisation of the software industry. This development is faced with diverse problems, which require solution by the adoption of new processes and development techniques. eXtreme Programming (known as XP) is one methodology which is now at the leading edge of software development. This recent trend in XP allows organisation members to cooperate towards the development of new software independently of the existing developers. This is achieved functionally between the members by the development of distributed pair programming, this is not IDE plug-in shape of text, simple screen sharing or chatting function based.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2721-2731
• /
• 1997

Distributed programming can be greatly simplified by language support for distributed communication. Many web-browsers now offer some form of active objects and the number and types of them are growing daily in interesting and innovative ways. Java applets are well known as one kind of active object related to web-browser. This paper focuses in distributed active objects which is one kind of active objects that can communicate with other active objects located in different machines across the Internet. Java RMI and CORBA IDL are two major programming environments for distributed active objects which are non compatible with each other. To make discussion concrete, we introduce a single application as implemented on two environments : the HORM, adopting RMI mechanism, and the OrbixWeb2.0.1, adopting CORBA specification, respectively. Binding, inheritance, polymorphism, object passing and callbacks across the machine boundary in distributed programming environments are issued. The results show that some differences in the implementation of distributed active objects can have a significant impact on how distributed applications are structured. The comparison between two implementations on the programming environments will be the basis for building the translation system between HORB to OrbixWeb and vice versa.

• Journal of Electrical Engineering and Technology
• /
• v.11 no.2
• /
• pp.329-337
• /
• 2016

With the increasing deployment of distributed generators in the distribution system, a very large search space is required when dynamic programming (DP) is applied for the optimized dispatch schedules of voltage and reactive power controllers such as on-load tap changers, distributed generators, and shunt capacitors. This study proposes a new optimal voltage and reactive power scheduling method based on dynamic programming with a heuristic searching space reduction approach to reduce the computational burden. This algorithm is designed to determine optimum dispatch schedules based on power system day-ahead scheduling, with new control objectives that consider the reduction of active power losses and maintain the receiving power factor. In this work, to reduce the computational burden, an advanced voltage sensitivity index (AVSI) is adopted to reduce the number of load-flow calculations by estimating bus voltages. Moreover, the accumulated switching operation number up to the current stage is applied prior to the load-flow calculation module. The computational burden can be greatly reduced by using dynamic programming. Case studies were conducted using the IEEE 30-bus test systems and the simulation results indicate that the proposed method is more effective in terms of saving electric charges and improving the voltage profile than loss minimization.

• Journal of Internet Computing and Services
• /
• v.6 no.6
• /
• pp.71-83
• /
• 2005

In this paper, we developed the Distributed Programming Developing Tool(DPDT) which can make distributed application program efficiency based on the distributed object group framework supporting group management and dynamic binding for object resources requested from clients on distributed systems. The distributed object group framework we constructed provides not only the group register/withdraw, the access right and the name/property services for server objects from a point of view of group management services, but also dynamic binding, replicated object supporting, load balance, and federation among the object groups from a point of view of the supporting services of distributed application, When developing distributed application, by using our tool, server programming developer implements objects in each server system, next registers the properties to need for service provision to the object group. Client programming developer can also develop client program easily by obtaining the access right for the object or the object group and using the properties of objects with the access right permitted to the client. For providing above application developing environment in this paper. we described the definition of object group, the architecture of the distributed object group framework which our tool supports, and its functionalities, then specified the 3 GUI environments of DPDT implemented for providing efficient interfaces between the distributed object group and distributed applications. Finally, by using the DPDT, we showed the group register/withdraw and the access right grant procedure of objects which are server programs, the developing process of client program, and the executing results of the distributed application developed.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.791-802
• /
• 1996

In this paper, we discuss a distributed shared memory management scheme based on multi-threaded programming model for a large-scale loosely coupled multiprocessor system. The scheme covers three major issues in the distribued shared memory;the address translation table management, the block coherence maintenance, and the block placement policy. The scheme efficiently resolves the general problems occurred in the distributed shared memory such as a false sharing, an unnecessary replication, a block bouncing, and an address aliasing phenomenon. It also provides the application transparency, good scalability, easy implementation, and multithreaded programming model to users.

• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.4
• /
• pp.449-456
• /
• 1999

본 논문은 C++에 분산 객체 프로그래밍 기능을 추가한 D++ 언어를 제안한다. 대등관계 복제객체 모델을 지원하는 D++는 분산 클래스의 정의, 멤버 함수의 일치성 제어 정의 기능, 그리고 영구 객체 이름에 기반한 분산 객체를 정의할 수 있는 언어 구조를 제공한다. D++ 프로그램에서 새로이 생성되는 분산 객체는 생성 시에 제공되는 객체의 영구 이름과 동일한 영구 이름을 갖는 분산 객체가 존재할 경우 해당 객체들과 복제 관계를 유지함으로써 정보를 공유한다. 각 복제 객체들은 서로 간에 대등한 관계를 가지며, 멤버 함수 정의 시에 기술되는 특성에 따라 일치성이 유지된다. 이 같은 D++의 분산 객체 모델은 실시간 그룹웨어의 기본 요구 사항인 분산 환경에서의 정보 공유 및 사건 공지 기능을 자연스럽게 해결해 주기 때문에 실시간 그룹웨어의 개발을 효율적으로 지원할 수 있을 것으로 기대한다. Abstract This paper proposes D++ programming language that is an extension of C++ for distributed object oriented programming. The D++, which supports peer-to-peer object model, provides new language constructs for the definition of distributed classes, the definition of the consistency control of the member function and the definition of distributed object variables with the persistent name. In D++, when the persistent name of a newly created distributed object is same as that of an existing distributed object, the new distributed object replicates object state of the existing distributed object and thus they share the object state. The replicas have peer relation and the consistency among them is maintained according to the characteristic described on the definition of designated member functions. It is expected that D++ language increases efficiency in development of real-time groupware because the distributed object model of D++ naturally supports the information sharing and event notification that are the basic functions required when building real-time groupware.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.762-773
• /
• 2014

As the web of data is increasingly producing large RDFS datasets, it becomes essential in building scalable reasoning engines over large triples. There have been many researches used expensive distributed framework, such as Hadoop, to reason over large RDFS triples. However, in many cases we are required to handle millions of triples. In such cases, it is not necessary to deploy expensive distributed systems because logic program based reasoners in a single machine can produce similar reasoning performances with that of distributed reasoner using Hadoop. In this paper, we propose a scalable RDFS reasoner using logical programming methods in a single machine and compare our empirical results with that of distributed systems. We show that our logic programming based reasoner using a single machine performs as similar as expensive distributed reasoner does up to 200 million RDFS triples. In addition, we designed a meta data structure by decomposing the ontology triples into separate sectors. Instead of loading all the triples into a single model, we selected an appropriate subset of the triples for each ontology reasoning rule. Unification makes it easy to handle conjunctive queries for RDFS schema reasoning, therefore, we have designed and implemented RDFS axioms using logic programming unifications and efficient conjunctive query handling mechanisms. The throughputs of our approach reached to 166K Triples/sec over LUBM1500 with 200 million triples. It is comparable to that of WebPIE, distributed reasoner using Hadoop and Map Reduce, which performs 185K Triples/sec. We show that it is unnecessary to use the distributed system up to 200 million triples and the performance of logic programming based reasoner in a single machine becomes comparable with that of expensive distributed reasoner which employs Hadoop framework.

• The KIPS Transactions:PartA
• /
• v.10A no.5
• /
• pp.439-452
• /
• 2003

Mobile agent is one of the good technologies for overcoming network load and latency in distributed applications, and it may be a promising way of base technology of distributed applications because of its high adaptability for various network environments. In this paper, a mobile agent programming system, called HUMAN, is designed and implemented efficient use in various distributed applications based on mobile agents. HUMAN supports such high level utilities as file searhing, addressing by groups of nodes, storing path information, storing search information, and thus it gives us high easiness in agent-based programming. And it provides various itinerary modes and flexible reply modes for easy adaptation to given network environment. It also provides a management server for registering and active agents. Thus it can be efficiently applied for such varous distributed applications as searching distributed information, remote control, and file sharing in networks. A simple electronic commerce system is designed is designed and implemented as a HUMAN based illustrative application.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.1177-1180
• /
• 1996

In this paper, we propose an algorithm that realizes cooperative behavior by construction of autonomous mobile robot system. Each robot is able to sense other robots and obstacles, and it has the rule of behavior to achieve the goal of the system. In this paper, to improve performance of the whole system, we use Genetic Programming based on Natural Selection. Genetic Programming's chromosome is a program of tree structure and it's major operators are crossover and mutation. We verify the effectiveness of the proposed scheme from the several examples.