• Title/Summary/Keyword: shared system

Search Result 1,495, Processing Time 0.027 seconds

Robot-Human Task Sharing System for Assembly Process (조립 공정을 위한 로봇-사람 간 작업 공유 시스템)

  • Minwoo Na;Tae Hwa Hong;Junwan Yun;Jae-Bok Song
    • The Journal of Korea Robotics Society
    • /
    • v.18 no.4
    • /
    • pp.419-426
    • /
    • 2023
  • Assembly tasks are difficult to fully automate due to uncertain errors occurring in unstructured environments. When assembling parts such as electrical connectors, advances in grasping and assembling technology have made it possible for the robot to assemble the connectors without the aid of humans. However, some parts with tight assembly tolerances should be assembled by humans. Therefore, task sharing with human-robot interaction is emerging as an alternative. The goal of this concept is to achieve shared autonomy, which reduces the efforts of humans when carrying out repetitive tasks. In this study, a task-sharing robotic system for assembly process has been proposed to achieve shared autonomy. This system consists of two parts, one for robotic grasping and assembly, and the other for monitoring the process for robot-human task sharing. Experimental results show that robots and humans share tasks efficiently while performing assembly tasks successfully.

A Study on Buffer and Shared Memory Optimization for Multi-Processor System (다중 프로세서 시스템에서의 버퍼 및 공유 메모리 최적화 연구)

  • Kim, Jong-Su;Mun, Jong-Uk;Im, Gang-Bin;Jeong, Gi-Hyeon;Choe, Gyeong-Hui
    • The KIPS Transactions:PartA
    • /
    • v.9A no.2
    • /
    • pp.147-162
    • /
    • 2002
  • Multi-processor system with fast I/O devices improves processing performance and reduces the bottleneck by I/O concentration. In the system, the Performance influenced by shared memory used for exchanging data between processors varies with configuration and utilization. This paper suggests a prediction model for buffer and shared memory optimization under interrupt recognition method using mailbox. Ethernet (IEEE 802.3) packets are used as the input of system and the amount of utilized memory is measured for different network bandwidth and burstiness. Some empirical studies show that the amount of buffer and shared memory varies with packet concentration rate as well as I/O bandwidth. And the studies also show the correlation between two memories.

Analysis of Performance Requirement for Large-Scale InfiniBand-based DVSM System (대용량의 InfiniBand 기반 DVSM 시스템 구현을 위한 성능 요구 분석)

  • Cho, Myeong-Jin;Kim, Seon-Wook
    • The KIPS Transactions:PartA
    • /
    • v.14A no.4
    • /
    • pp.215-226
    • /
    • 2007
  • For past years, many distributed virtual shared-memory(DVSM) systems have been studied in order to develop a low-cost shared memory system with a fast interconnection network. But the DVSM needs a lot of data and control communication between distributed processing nodes in order to provide memory consistency in software, and this communication overhead significantly dominates the overall performance. In general, the communication overhead also increases as the number of processing nodes increase, so communication overhead is a very important performance factor for developing a large-scale DVSM system. In this paper, we study the performance scalability quantitatively and qualitatively for developing a large-scale DVSM system based on the next generation interconnection network, called the InfiniBand. Based on the study, we analyze a performance requirement of the next-coming interconnection network to be used for developing a performance-scalable DVSM system in the future.

A Simulation Model for Evaluating Demand Responsive Transit: Real-Time Shared-Taxi Application (수요대응형 교통수단 시뮬레이션 방안: Real-Time Shared-Taxi 적용예시)

  • Jung, Jae-Young
    • International Journal of Highway Engineering
    • /
    • v.14 no.3
    • /
    • pp.163-171
    • /
    • 2012
  • Demand Responsive Transit (DRT) services are becoming necessary as part of not only alternative transportation means for elderly and mobility impaired passengers, but also sustainable and flexible transportation options in urban area due to the development of communication technologies and Location Based Services (LBS). It is difficult to investigate the system performance regarding vehicle operational schemes and vehicle routing algorithms due to the lack of commercial software to support door-to-door vehicle simulation for larger area. This study proposes a simulation framework to evaluate innovative and flexible transit systems focusing on various vehicle routing algorithms, which describes data-type requirements for simulating door-to-door service on demand. A simulation framework is applied to compare two vehicle dispatch algorithms, Nearest Vehicle Dispatch (NVD) and Insertion Heuristic (IH) for real-time shared-taxi service in Seoul. System productivity and efficiency of the shared-taxi service are investigated, comparing to the conventional taxi system.

Adaptive Concurrency Control Approach on Shared Object Manipulation in Mixed Reality

  • Lee, Jun;Park, Sung-Jun
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.11
    • /
    • pp.75-84
    • /
    • 2021
  • In this paper, we propose an adaptive concurrency control scheme to reduce conflicts and working time in the cooperative work in mixed reality. To this ends, we first classified the goals, tasks and ownerships of the cooperative work. Then, the classified relationships are mapped according to their temporal and hierarchical relationships of shared object manipulation in the cooperative work. The proposed system provides adaptive concurrency controls of the shared object according to temporal orders of the sub-goals. With the proposed scheme, a participant is enable to move and rotate a shared object although another already has an ownership of the shared object in a specific order of the sub-goal. Thus, the proposed system provides adaptive and realistic cooperative working environment. We conducted a user study of the proposed scheme. The proposed system could reduce conflicts and working times comparing to conventional approaches.

A Study on the Change of Spatial Structures of Shared Space at Urban Campuses - The opposite concept of Gridlock upon the change to shared campuses - (도심 캠퍼스 공유공간의 공간 구조 변화에 대한 연구 - 그리드락의 반대 개념으로서의 공유 캠퍼스로의 변화에 대하여 -)

  • Kang, Eunki;Baek, Jin
    • Journal of the Architectural Institute of Korea Planning & Design
    • /
    • v.34 no.11
    • /
    • pp.145-156
    • /
    • 2018
  • Urban campus, one of the main urban facilities, is the representative place that is struggling with 'gridlock'. Due to privatization of space among different departments and space shortages, gridlock has been occurring as a result. The urban campus trying to solve this problem by changing the quality of space, especially the structure of the shared space, which is expected to be the solution to the grid lock problem. The main purpose of this study is to investigate the structural change in the university's shared space based on paradigm transition. The theoretical consideration is to analyze the spatial characteristics of university shared space that appear at different stages through a new perspective that compares the gridlock phenomenon and the shared paradigm. The framework of the analysis of the shared space, which has recently been restructured, is classified into the spatial characteristics of collaborative space, the creative space, and the common/complex space. In addition, these spatial characteristics are again analyzed through the division of legislative facility classification, management governance subject, area, building location and layout, exposure to the outside as well as the analysis of student and staff entry and exit, sharing structure of site and space, and the classification of program characteristics. The results are as follows: The restructured space is systemized so that the management governance of each space would be connected to each other to share information and space. Furthermore, the spatial boundary between colleges or between campus spaces are not only physically, but categorically clear. The restructured space has semi (or in-between)-spatial characteristics such as the intersection in inside and outside of the pedestrian's circulation and the mixture of programs. This study could serve as principal references in presenting the systematic analysis of directions of the shared spatial structure for the urban campus where new educational space is required due to the changes in the university system.

Metadata Structrues of Huge Shared Disk File System for Large Files in GIS (GIS에서 대용량 파일을 위한 대용량 공유 디스크 파일시스템의 메타데이터 구조)

  • 김경배;이용주;박춘서;신범주
    • Spatial Information Research
    • /
    • v.10 no.1
    • /
    • pp.93-106
    • /
    • 2002
  • The traditional file system are designed to store and manage fur small size files. So. we cannot process the huge files related with geographic information data using the traditional file system such as unix file system or linux file system. In this paper, we propose new metadata structures and management mechanisms for the large file system in geographic information system. The proposed mechanisms use dynamic multi-level mode for large files and dynamic bitmap for huge file system. We implement the proposed mechanisms in the metadata structures of SANtopia is shared disk huge file system for storage area networks(SAN).

  • PDF

Advanced Message Storing Method on mobilePOST SMSC (mobilePOST SMSC(Short Message Service Center)에서의 향상된 메시지 저장 기법)

  • Song, Byung-Kwen
    • Journal of the Korean Society for Railway
    • /
    • v.11 no.2
    • /
    • pp.126-138
    • /
    • 2008
  • This paper proposes the preservation method that can effectively process short messages at mobilePOST SMSC(Short Message Service Center) platform on CDMA(Code Division Multiple Access). There are three techniques for the preservation method. First one is shared memory technique where several processes within the system share same memory to process transmission of short messages with maximum performance. Second one is to back-up messages in shared memory to the file system to prevent lost during system initialization or other unstable period. Third technique is that when transmission of short message was completed, finished message is moved from the shared memory to relational database for accounting purposes.

A Design of the Active Web Server Supporting Synchronous Collaboration in the Web-Based Groupware Systems (동기화된 협동을 지원하기 위한 능동형 웹 서버 설계)

  • 허순영;배경일
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.4
    • /
    • pp.157-170
    • /
    • 1999
  • The web-based groupware systems hold many possibilities for system developers and users. Especially, web-based group collaborative systems are emerging as enterprise-wide information systems. Since data in group collaborative systems are apt to be shared among multiple concurrent users and modified simutaneously by them, the web-based group collaborative systems must support synchronous collaboration in order to provide users with synchronized and consistent views of shared data. However, current web technologies have limitations in supporting this, largely because the existing Hypertext Transfer Protocol(HTTP) is unidirectional and does not allow web servers to send messages to their web browsers without first receiving requests from them. This paper proposes an active web server that can overcome such limitations and facilitate synchronous collaboration in web-based group collaborative systems. To accomplish such goals, the active web server manages dependency relationships beween shared data and web browsers referencing them and actively propagates changing details of the shared data to all web browsers referencing them. And, this paper examines usefulness and effectiveness of the active web server to apply it to the ball-bearing design example of concurrent engineering design systems. The prototype system of the active web server is developed on a commercial Object-oriented Database Management System(0DBMS) called OBJECTSTERE using the C++ programming language.

  • PDF

The Streaming Method using Multiple Description Coding for cluster-based server with shared-nothing storage (비 공유 저장장치를 가지는 클러스터 기반 서버에서 다중 디스크립션 코딩을 이용한 스트리밍 방법)

  • Bak Yu-Hyeon;Kim Hag-Young;Kim Myung-Joon;Kim Kyong-Sok
    • The KIPS Transactions:PartA
    • /
    • v.13A no.3 s.100
    • /
    • pp.211-222
    • /
    • 2006
  • The cluster system with shared-nothing storage cannot escape from the problem of skewed request toward specific contents. This paper, therefore, suggests streaming method using MDC (Multiple Description Coding) instead of using single original content; this method is able to cope with skewed request in shared-nothing storage server as well as to continue to provide services in case of the system failure. Also, the system can support adaptive streaming service according to user player type, network status, the load of server, and client.