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

In this paper, we study the domain-independent sensor data structuring method and the derivations about ' Filter Criteria' expansion factors of heterogeneous domain systems. For this purpose, we propose a 5W1H based information search and retrieval method without knowledges about the target domains. And we also suggest a resource management model that can support expanding search of information. By the suggested method, the oneM2M standard able to implement the use-cases like 'data exchanging between the heterogeneous domains'.

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

In this paper, we propose a method to search candidates of network reconfiguration to restore distribution system with distributed energy resources using a level-based tree search algorithm. First, we introduce a method of expressing distribution network with distributed energy resources for fault restoration, and to represent the distribution network into a simplified graph. Second, we explain the tree search algorithm, and introduce a method of performing the tree search on the basis of search levels, which we call a level-based tree search in this paper. Then, we propose a candidate search method for fault restoration, and explain it using an example. Finally, we verify the proposed method using computer simulations.

• Journal of the military operations research society of Korea
• /
• v.3 no.1
• /
• pp.123-136
• /
• 1977

This thesis presents a modification and extension to the Burgess and Killebrew heuristic resource leveling procedure for project networks. In contrast to previous algorithms appearing in the literature, the objective function of this algorithm. is the minimization of the sum of the squared errors in each time period (deviations around the mean usage) of all resources over the duration of the project. This objective function continues the search for an improved schedule beyond that of previous algorithms with their associated objective functions. One important feature is that the algorithm tends to reduce the number of periods that a resource is idle during its duration on the project.

• The KIPS Transactions:PartB
• /
• v.11B no.1
• /
• pp.63-70
• /
• 2004

Port operation is largely divided into gate operation, yard operation and berth operation. Operation strategy and optimal resource allocation for three parts are important in the productivity of the port operation.. Especially the resource allocation planning in berth operation needs optimization, because it is directly connected with the processing time in shipping. Berth planning is not independent on recourse allocation but interrelated with yard stacking area allocation. Therefore, we design the optimized module of berth planning and give priority to interrelationship with yard space allocation, while existing studies design independent resource allocation in berth planning. We suggest constraints by mathematical method, and they are related to yard stacking area allocation with existing constraints. Then we look for solutions, use tabu search to optimize them, and design optimized the berth planning module. In the performance test of optimized module design of berth planning, we find that the berth planning with yard stacking area allocation takes less processing time than without yard stacking area allocation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.608-618
• /
• 2000

We consider the problem of placing resources in a distributed computing system so that certain performance requirements may be met while minimizing the number of required resource copies, irrespective of node or link failures. To meet the requirements for high performance and high availability, minimum number of resource copies should be placed in such a way that each node has at least two copies on the node or its neighbor nodes. This is called the fault-tolerant resource placement problem in this paper. The structure of a parallel or a distributed computing system is represented by a graph. The fault-tolerant placement problem is first transformed into the problem of finding the smallest fault-tolerant dominating set in a graph. The dominating set problem is known to be NP-complete. In this paper, searching for the smallest fault-tolerant dominating set is formulated as a state-space search problem, which is then solved optimally with the well-known A* algorithm. To speed up the search, we derive heuristic information by analyzing the properties of fault-tolerant dominating sets. Some experimental results on various regular and random graphs show that the search time can be reduced dramatically using the heuristic information.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.4 s.36
• /
• pp.93-102
• /
• 2005

Excessive traffic of P2P applications in the limited communication environment is considered as a network bandwidth problem. Moreover, Though P2P systems search a resource in the phase of search using weakly connected systems(peers' connection to P2P overlay network is very weakly connected), it is not guaranteed to download the very peer's resource in the phase of download. In previous P2P search algorithm (1), we had adopted the heuristic peer selection method based on Random Walks to resolve this problems. In this paper, we suggested an adaptive P2P search algorithm based on the previous algorithm(1) to reform the node distribution rate which is affected in unit peer ability. Also, we have adapted the discriminative replication method based on a query ratio to reduce traffic amount additionally. In the performance estimation result of this suggested system, our system works on a appropriate point of compromise in due consideration of the direction of searching and distribution of traffic occurrence.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.3
• /
• pp.815-834
• /
• 2012

Recently, along with the innovative development of wireless communication techniques and mobile devices, mobile P2P services in mobile wireless networks have gained a lot of attention. In this paper, we propose a resource discovery scheme with data dissemination over mobile P2P networks. In the proposed scheme, each peer manages a local information table, a resource index table, and a routing table in a local database to enhance the accuracy and cost of resource discovery. The local information table stores the status of a mobile peer, and the resource index table stores the resource information of the neighbor peers via the ranking function. The routing table is used to communicate with the neighbor peers. We use a timestamp message to determine whether or not the resource index table will be changed before the resource information is exchanged. Our ranking function considers the interest and mobility of the mobile peer and prioritizes the resource information transmitted from the neighbor peers. It is shown via various experiments that the proposed scheme outperforms the existing scheme.

• Journal of Sasang Constitutional Medicine
• /
• v.27 no.4
• /
• pp.388-395
• /
• 2015

Objectives To grasp the trend of constitution medical industry related to the metabolic disorders by analyzing the web resource.Methods Web search with the search formula ("constitutional" or "spirit") and ("Metabolic" or "diabetes" or "high blood pressure" or "hyperlipidemia" or "obesity") for 20 years (1995.09.10 ~ 2015.09.09.) in the web portal address "Web search with the search formula ("constitutional" or "spirit") and ("Metabolic" or "diabetes" or "high blood pressure" or "hyperlipidemia" or "obesity") for 20 years (1995.09.10 ~ 2015.09.09.) in the web portal address "http://web.search.naver.com".Results In the search area of news, blogs, cafes and knowledge-in, the number of searched pages retrieved by the word "constitution" was about 1.78 million. In the news 9760 cases of "obesity", 4046 cases of "hypertension" and 3253 cases of "diabetes" were searched. In Naver Web search Korean medicine clinics related to "constitution" were 24.3%. If we multiple 25.3% to 1000, the actual number of herbal hospitals, The constitution related to Korean medicine clinics is estimated to be approximately 3160 places. Among metabolic disorders, "Overweight", "Diabetes" and "Hypertension" were most frequently searched.Conclusions Constitutional industry related to metabolic diseases is very actively created on the internet in various areas. Among metabolic diseases, obesity, diabetes, hypertension were found with high frequency.

• International conference on construction engineering and project management
• /
• 2007.03a
• /
• pp.530-539
• /
• 2007

Many construction projects such as highways, pipelines, tunnels, and high-rise buildings typically contain repetitive activities. Research has shown that the Critical Path Method (CPM) is not efficient in scheduling linear construction projects that involve repetitive tasks. Linear Scheduling Method (LSM) is one of the techniques that have been developed since 1960s to handle projects with repetitive characteristics. Although LSM has been regarded as a technique that provides significant advantages over CPM in linear construction projects, it has been mainly viewed as a graphical complement to the CPM. Studies of scheduling linear construction projects with resource consideration are rare, especially with multiple resource constraints. The objective of this proposed research is to explore a resource assignment mechanism, which assigns multiple critical resources to all activities to minimize the project duration while satisfying the activities precedence relationship and resource limitations. Resources assigned to an activity are allowed to vary within a range at different stations, which is a combinatorial optimization problem in nature. A heuristic multiple resource allocation algorithm is explored to obtain a feasible initial solution. The Simulated Annealing search algorithm is then utilized to improve the initial solution for obtaining near-optimum solutions. A housing example is studied to demonstrate the resource assignment mechanism.

• ETRI Journal
• /
• v.37 no.2
• /
• pp.262-272
• /
• 2015

In particular, for a practical mobile robot team to perform such a task as that of carrying out a search and rescue mission in a disaster area, the network connectivity and localization have to be guaranteed even in an environment where the network infrastructure is destroyed or a Global Positioning System is unavailable. This paper proposes the new collective intelligence network management architecture of multiple mobile robots supporting seamless network connectivity and cooperative localization. The proposed architecture includes a resource manager that makes the robots move around and not disconnect from the network link by considering the strength of the network signal and link quality. The location manager in the architecture supports localizing robots seamlessly by finding the relative locations of the robots as they move from a global outdoor environment to a local indoor position. The proposed schemes assuring network connectivity and localization were validated through numerical simulations and applied to a search and rescue robot team.