• Journal of Navigation and Port Research
• /
• v.47 no.6
• /
• pp.401-409
• /
• 2023

This study compared and analyzed the performance of a distributed area search algorithm and a distributed probability search algorithm based on information exchange between ships. The distributed algorithm is a method that can search for an optimal avoidance route based on information exchange between ships. In the distributed area search algorithm, only a ship with the maximum cost reduction among neighboring ships has priority, so the next expected location can be changed. The distributed stochastic search algorithm allows a non-optimal value to be searched with a certain probability so that a new value can be searched. A circular-based ship collision avoidance model was used for the ship-to-ship collision avoidance experiment. The experimental method simulated the distributed area search algorithm and the distributed stochastic search algorithm while increasing the number of ships from 2 to 50 that were the same distance from the center of the circle. The calculation time required for each algorithm, sailing distance, and number of message exchanges were compared and analyzed. As a result of the experiment, the DSSA(Distributed Stochastic Search Algorithm) recorded a 25%calculation time, 88% navigation distance, and 84% of number of message exchange rate compared to DLSA.

• Journal of Convergence Society for SMB
• /
• v.6 no.4
• /
• pp.93-98
• /
• 2016

Recently, the project related to the smart grid are being actively studied around the developed world. In particular, the long-term stabilization measures distributed power supply problem has been highlighted. In this paper, we propose a three-dimensional numerical weather prediction models to compare the error rate information which combined with the physical models and statistical models to predict the output of distributed power. Proposed model can predict the system for a stable power grid-can improve the prediction information of the distributed power. In performance evaluation, proposed model was a generation forecasting accuracy improved by 4.6%, temperature compensated prediction accuracy was improved by 3.5%. Finally, the solar radiation correction accuracy is improved by 1.1%.

• Journal of Internet Computing and Services
• /
• v.13 no.5
• /
• pp.55-64
• /
• 2012

Nowadays, as Cloud computing becomes popular, a need for a DFS(distributed file system) is increased. But, in the current Cloud computing environments, there is no DFS framework that is sufficient to protect sensitive private information from attackers. Therefore, we designed and proposed a secure scheme for distributed file systems. The scheme provides confidentiality and availability for a distributed file system using a secret sharing method. In this paper, we measured the speed of encryption and decryption for our proposed method, and compared them with that of SEED algorithm which is the most popular algorithm in this field. This comparison showed the computational efficiency of our method. Moreover, the proposed secure read/write model is independent of Hadoop DFS structure so that our modified algorithm can be easily adapted for use in the HDFS. Finally, the proposed model is evaluated theoretically using performance measurement method for distributed secret sharing model.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.157-165
• /
• 2009

In this paper, we propose a distributed model that recognize ADLs of human can be occurred in daily living places. We collect and analyze user's environmental, location or activity information by simple sensor attached home devices or utensils. Based on these information, we provide a lifecare services by inferring the user's life pattern and health condition. But in order to provide a lifecare services well-refined activity recognition data are required and without enough inferred information it is very hard to build an ADL activity recognition model for high-level situation awareness. The sequence that generated by sensors are very helpful to infer the activities so we utilize the sequence to analyze an activity pattern and propose a distributed linear time inference algorithm. This algorithm is appropriate to recognize activities in small area like home, office or hospital. For performance evaluation, we test with an open data from MIT Media Lab and the recognition result shows over 75% accuracy.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.2
• /
• pp.540-549
• /
• 2018

This paper proposes the method of active distribution network expansion planning considering distributed generation integration and distribution network reconfiguration. The distribution network reconfiguration is taken as the expansion planning alternative with zero investment cost of the branches. During the process of the reconfiguration in expansion planning, all the branches are taken as the alternative branches. The objective is to minimize the total costs of the distribution network in the planning period. The expansion alternatives such as active management, new lines, new substations, substation expansion and Distributed Generation (DG) installation are considered. Distribution network reconfiguration is a complex mixed-integer nonlinear programming problem, with integration of DGs and active managements, the active distribution network expansion planning considering distribution network reconfiguration becomes much more complex. This paper converts the dual-level expansion model to Second-Order Cone Programming (SOCP) model, which can be solved with commercial solver GUROBI. The proposed model and method are tested on the modified IEEE 33-bus system and Portugal 54-bus system.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.175-185
• /
• 2005

The scheduling methods of the distributed real-time systems have been proposed. However, they have some weak points. They did not schedule both sporadic and periodic tasks and messages at the same time or did not consider the end-to-end constraints such as precedence relations between sporadic tasks. This means that system scheduling must guarantee the constraints of practical systems and be applicable to them. This paper proposes a new scheduling method that can be applied to more practical model of distributed real-time systems. System model consists of sporadic and periodic tasks with precedence relations and sporadic and periodic messages and has end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.69-88
• /
• 2000

One of the most important factors on the performance of the distributed systems is the effective distribution of the software components, There have been a lot of researches on partitioning and allocating the task-based system, while the studies on the allocating the objects of the object-oriented system into the distributed object environments are very little relatively. In this paper. we defines the graph model for partitioning the existing C++ application and allocating the C++ objects into CORBA-base distributed system, In addition, we propose a distributed object allocation algorithm based on this graph model. The performance of distributed systems is determined by the concurrency between objects, the load balance among the processors and the communication cost on the networks. To search for the solutions optimizing the above three factors simultaneously, the object allocation algorithm of this paper is based on the Niched Pareto Genetic Algorithm (NPGA). We performed the experiment on the typical C++ application and CORBA system to prove the effectiveness of our graph model and our object allocation algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.7
• /
• pp.759-767
• /
• 2010

RT-eCos 3.0 is a micro-sized embedded real-time kernel that has been developed based on the open source eCos 3.0 to support the basic task model of the well-known distributed real-time object model, TMO(Time-Triggered Message-triggered Object). In this paper, the design and implementation techniques of the RMMC(Real-time Multicast & Memory replication Channel) that is a standard distributed IPC model of the TMO is described based on the RT-eCos 3.0. And the support technique of the global time for using the same time in a distributed environment using the RMMC is also described. The developed global time based RMMC supports highly abstracted distributed IPC environment in a wide area distributed computing environment with the RT-eCos 3.0.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.107-117
• /
• 1996

This paper proposes a conceptual model for distributed problem solving(DPS), where cooperation and communication among agents are based on virtual shared memory (VSM) In this model, all agents in a DPS system view all the memory in a distributed computer system as a single shared memory in which data, tasks, and results can in a distributed computer system as a single shared memory, in which data, tasks, and results can / be accessed by any of the agents. Several agents cooperatively solve a complex problem, as agents write data, intermediate results of execution, and tasks requested to other agents to VSM and other agents read or execute them. Also, in order to develop DPS systems based on the proposed conceptual model, this paper designs a DPS system development environment(DPS-VSM)using Network Linda. Thi spaper shows utility ofthe proposed model by presenting an example of simulation a VSM-based DPS system, and analyzes the model by comparing the features of DPS- VSM with some other DAI programming shells.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.1
• /
• pp.63-72
• /
• 1998

Diversity in hardware and software is increasing ever and our networked computing environment is becoming more diverse. The development of software becomes expensive works because of a collection of diverse computers, storing various data type in different places, working together by incompatabilities of operating system and various databases and protocols. CORBA is a standard for distributed computing environment and for system integration of heterogeneous distributed environment. CORBA provides many technical benefits for effective system integration and seamless infrastructure for distributed communication environment of heterogeneous systems. In this paper, we proposed a system integraton model based on CORBA for distributed object environment, softwarc reuse and the intcrconnecion of WWW. The model is composed of factory server, trading server, convcrsion scrvcr and applicaton scrvcr. Thc proposed model can easy application development and system integration. And we implcmcntcd thc gateway for cooperation with WWW. As a proof of the proposed model, we show how the distance learning system designed using the services provided by the proposed model.