• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2005.04a
• /
• pp.374-377
• /
• 2005

유비쿼터스 컴퓨팅 환경에서는 사용자 주변의 센서로부터 각종 컨텍스트 정보를 입력받아 사용자를 식별하고 필요한 자원을 분배하는 과정이 중요하다. 하지만 사용자 식별 및 자원 분배 과정에서 특정 사용자에 의해 자원의 독점 현상이 발생되기 때문에 다른 사용자들에게 효과적으로 자원을 분배할 수 없다. 이를 위해 센서와 자원의 공유에 대한 연구가 필요하다. 본 연구에서는 휴대용 모바일 장치에서 사용자의 컨텍스트 인식과 자원의 공유를 위하여 P2P 방식을 적용한 지능형 P2P 모바일 에이전트를 제안한다. 제안하는 구조는 사용자 주변의 센서와 서비스 자원을 공유함으로써 특정 자원에 대한 독점성을 제거하고, 효과적인 사용자 컨텍스트 인식 및 서비스 지원을 목적으로 한다.

• Journal of Navigation and Port Research
• /
• v.45 no.4
• /
• pp.186-193
• /
• 2021

To enhance the competitiveness of the Busan Port in accordance with changes in global shipping and port industry trends, the Busan New Port is promoting step-by-step integration and developing a port resource-sharing platform. However, inefficient resource-sharing can cause unnecessary additional costs or impede port productivity, so accurate supply and demand matching of shared resources is required. In this study, the supply and demand of port resources were investigated for employees of Busan New Port and North Port, and port resources that could be ideally shared through IPA(Importance Performance Analysis) were analyzed. As a result of analyzing the equipment in the port, Yard Tractor, Reach Stacker, and Top Handler were the top considerations, and for facilities in the port, berths and aprons, empty container yards, and refrigerated container yards were the most important considerations. As for the data in the port, gate status, equipment specifications, and berth and apron conditions were the top considerations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.9_10
• /
• pp.452-465
• /
• 2008

This paper proposes a light-weight, seamless integrated access control for global e-Science resource sharing. E-Science, based on Grid Computing, was designed to help scientists to remotely control and process the Grid resources such as high-end equipments and remote machines. As many researchers engage in the e-Science Grids, the researchers in a grid often have to wait for or give up use of the Grid resources, even when there are idle resources in other Grids. In this case, provided that proper compensation is given, Grid resource sharing is helpful both for the researchers and the Grids which provide their resources. But, sharing Grid resources globally is not simple, as each e-Science Grid is especially designed for resource sharing in its Virtual Organization(VO) and already has its unique access control policy for its resources. This paper proposes a new integrated access control for e-Science Grid resource sharing. The access control is light-weight without any priori service level agreement(SLA)s among the Grids which share their resources and seamless because the users can use the resources shared as the ones belonging to their Grids without their additional registration to the other Grids.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2221-2234
• /
• 1997

Distributed mutual exclusion algorithms have employed two approaches to achieve mutual exclusion and can be divided into two broad classes:token-based and permission-based. Token-based algorithms share a unique token among the nodes and a node is allowed to access its common resources if it possesses the token. Permission-based algorithms require one or more successive rounds of message exchanges among the nodes to obtain the permission to access the common resources. A hypercube architecture has earned wide acceptance in multiprocessor systems in the past few years because of its simple, yet rich topology. Accordingly, we study distributed permission-based mutual exclusion algorithms for hypercubes, and design a distributed permission-based mutual exclusion algorithm based on a new information structure adapted to the hypercubes. The new information structure is a request set of T-pattern from a logical mesh that is embedded into a hypercube. If a node wants to access the common resources, it sends request message to all nodes in the request set by Lan's multicast algorithm. Once the node receives a grant message from all nodes in the request set, it accesses the common resource. We evaluate our algorithm with respect to minimum round-trip delay, blocking delay, and the number of messages per access to the common resource.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.6
• /
• pp.488-501
• /
• 2009

In ubiquitous environments, invisible devices and software are connected to one another to provide convenient services to users. In order to provide such services, we must have mobile devices that connect users and services. But such services are usually limited to those served on a single mobile device. To resolve the resource limitation problem of mobile devices, a nearby resource sharing research has been studied. Also, not only the nearby resource share but also a resource recommendation through context-based resource reasoning has been studied such as an UMO Project. The UMO Project share and manage the various context information for the personalization resource recommendation and reason based on current context information. Also, should verify resource inference rules for reliable the resource recommendation. But, to create various context information requires huge cost and time in actuality. Thus, we propose a inference verification tool called USim to resolve problem. The proposed inference verification tool provides convenient graphic user interfaces and it easily creates context information. The USim exactly verifies new inference rules through dynamic changes of context information.

• Proceedings of the Korea Contents Association Conference
• /
• 2008.05a
• /
• pp.484-488
• /
• 2008

In ubiquitous environments, there are a large number of various mobile devices everywhere. Recently, many studies have been research on distributed resources sharing in this ubiquitous environments. However, the problems with this researches are no considering user's situation and preference. Therefore in this paper, we suggest the personalized resource sharing system considering user's situation and preference. Our system is aware of user's situation by using user's schedule information and a context information such as the time and location information and recommends personalized resources by using the simple weighted scheme. We prove our situation-aware based personalized resource sharing system by using a meeting scenario.

• Journal of KIISE:Computing Practices and Letters
• /
• v.7 no.6
• /
• pp.630-640
• /
• 2001

In this paper, we describe the design and implementation of ObjectPeerWork, which is a framework for the development of shared object model-based P2P(Peer-to-Peer) applications. The shared object model can prevent the computing power decrease on the way of resource management by incorporating the resource management function into resources themselves, and raise reliability on shared resources by improving the security problems. Also this model assures expandability by means of distributed component-based request broker manager and module container. The ObjectPeerWork based on this shared object model is a framework which makes the implementation of the enterprise information system possible, and makes distribution of the computing power and efficient resource management possible by improving the weakness in the general P2P model.

• Proceedings of the Korea Multimedia Society Conference
• /
• 1998.04a
• /
• pp.361-365
• /
• 1998

대용량 데이터, 높은 전송율, 실시간 제한의 특성을 가진 연속미디어 데이터 서비스를 지원하는 시스템은 집중적인 I/O 발생으로 인해 서비스 가능 사용자 수는 활용할 수 있는 여유자원에 의해 제한된다. 그러므로 본 논문은 인접한 요구간의 시간 간격(interval)을 버퍼에 캐슁하여 공유하는 기법을 기반으로, 동적으로 버퍼 공유 크기를 결정하고 요구들을 그룹핑함으로써 인접한 블록들의 버퍼 점유를 막고, 디스크 억세스를 감소시킨다. 또한 그룹 반환을 통해 버퍼 사용 효율을 높이고 여유 자원을 확보함으로써 승인제어에서 자원 활용 효율이 향상됨을 시뮬레이션을 통해 보인다.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.272-275
• /
• 2007

유비쿼터스 환경은 보이지 않는 수많은 장치들과 소프트웨어들이 서로 연결되어 각각의 사용자들에게 편리한 서비스를 제공한다. 이러한 서비스를 제공 받기 위해서는 사용자와 서비스간의 매개체 역할을 하는 모바일 디바이스가 필요하다. 하지만 자원이 제한적인 모바일 디바이스의 특성상 다양한 서비스를 이용할 수는 없다. 따라서 본 논문에서는 사용자의 프로파일을 고려한 사용자 맞춤 차원 공유 시스템을 개발하여 주변의 다양한 자원을 실시간으로 공유 할 수 있도록 함으로써 모바일 디바이스의 제한적인 리소스 문제를 해결 하고자한다. 본 논문에서는 테스트 시나리오를 이용하여 제안하는 사용자 맞춤 자원 공유 시스템을 검증한다.

• Korean Journal of Construction Engineering and Management
• /
• v.13 no.4
• /
• pp.100-109
• /
• 2012

Large road construction projects are typically partitioned into sections that are then contracted individually to contractors. Each section requires using similar heavy equipment including excavators, dump trucks and pavers, which constitute the highest cost. Normally the equipment is not shared between them, as each contractor wishes to have their equipment readily available. However, such practices result in very low utilization of these equipment. The goal of this research is to develop a programmatic resource sharing system in which contractors can share equipment depending on the changing needs of a multi-sectioned road project. This paper introduces the results of a survey performed to investigate how contractors currently manage the supply and demand of equipment and the equipment that are practical for sharing across a project. More importantly, the paper describes a set of metrics (DPR, nDPR, SDI) needed to quantify the amount of supply/demand variance occurring in each section. The metrics were used on an actual road construction project, and the results show that each section suffers from an imbalance between its monthly planned and actual utilization of equipment. The results also indicate that the sharing of the equipment can lead to potentially large savings as equipment requirements can be met within a project as to short leasing from outside vendors.