• Title/Summary/Keyword: Sharable

Search Result 70, Processing Time 0.024 seconds

A Patching-Based VOD System supporting VCR Operations (VCR 동작을 지원하는 패칭 기반의 주문형 비디오 시스템)

  • 조창식;마평수;이기호;강지훈
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.1
    • /
    • pp.9-16
    • /
    • 2003
  • In this paper, we propose a method for supporting VCR operations in a patching based multicast VOD system. Random access, pause and resume operations are supported in our system, and the channel and session scheduling algorithms for the VCR operations are proposed. When it is necessary to join a sharable multicast channel in the admission control for the VCR operations, the patching technique, which shares an on-going regular channel and allocates a new patching channel for the missing data, is used. Therefore, unlike the previous approach that allocates an excessive number of I-channels, service latency is minimized and channel usage is optimized in our system. Moreover buffered data. which is saved in disk during patching, is reused to prevent unnecessary patching channel allocation. For this. the patching management information is extended and a buffed data management scheme is proposed. In our system, the First-Come-First-Served scheduling is used to inform clients the service latency for the VCR operations immediately.

A Batch Processing Algorithm for Moving k-Nearest Neighbor Queries in Dynamic Spatial Networks

  • Cho, Hyung-Ju
    • Journal of the Korea Society of Computer and Information
    • /
    • v.26 no.4
    • /
    • pp.63-74
    • /
    • 2021
  • Location-based services (LBSs) are expected to process a large number of spatial queries, such as shortest path and k-nearest neighbor queries that arrive simultaneously at peak periods. Deploying more LBS servers to process these simultaneous spatial queries is a potential solution. However, this significantly increases service operating costs. Recently, batch processing solutions have been proposed to process a set of queries using shareable computation. In this study, we investigate the problem of batch processing moving k-nearest neighbor (MkNN) queries in dynamic spatial networks, where the travel time of each road segment changes frequently based on the traffic conditions. LBS servers based on one-query-at-a-time processing often fail to process simultaneous MkNN queries because of the significant number of redundant computations. We aim to improve the efficiency algorithmically by processing MkNN queries in batches and reusing sharable computations. Extensive evaluation using real-world roadmaps shows the superiority of our solution compared with state-of-the-art methods.

Privacy-Preserving Key-Updatable Public Key Encryption with Keyword Search Supporting Ciphertext Sharing Function

  • Wang, Fen;Lu, Yang;Wang, Zhongqi;Tian, Jinmei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.1
    • /
    • pp.266-286
    • /
    • 2022
  • Public key encryption with keyword search (PEKS) allows a user to make search on ciphertexts without disclosing the information of encrypted messages and keywords. In practice, cryptographic operations often occur on insecure devices or mobile devices. But, these devices face the risk of being lost or stolen. Therefore, the secret keys stored on these devices are likely to be exposed. To handle the key exposure problem in PEKS, the notion of key-updatable PEKS (KU-PEKS) was proposed recently. In KU-PEKS, the users' keys can be updated as the system runs. Nevertheless, the existing KU-PEKS framework has some weaknesses. Firstly, it can't update the keyword ciphertexts on the storage server without leaking keyword information. Secondly, it needs to send the search tokens to the storage server by secure channels. Thirdly, it does not consider the search token security. In this work, a new PEKS framework named key-updatable and ciphertext-sharable PEKS (KU-CS-PEKS) is devised. This novel framework effectively overcomes the weaknesses in KU-PEKS and has the ciphertext sharing function which is not supported by KU-PEKS. The security notions for KU-CS-PEKS are formally defined and then a concrete KU-CS-PEKS scheme is proposed. The security proofs demonstrate that the KU-CS-PEKS scheme guarantees both the keyword ciphertext privacy and the search token privacy. The experimental results and comparisons bear out that the proposed scheme is practicable.

Research on Science DMZ scalability for the high performance research data networking (연구데이터의 고성능 네트워킹을 위한 Science DMZ 확장성 연구)

  • Lee, Chankyun;Jang, Minseok;Noh, Minki;Seok, Woojin
    • KNOM Review
    • /
    • v.22 no.2
    • /
    • pp.22-28
    • /
    • 2019
  • A Science DeMilitarized Zone (DMZ) is an optimized network technology tailored to research data nature. The Science DMZ guarantees end-to-end network performance by forming a closed research network without redundant networking and security devices for the authorized researchers. Data Transfer Node (DTN) is an essential component for the high performance and security of the Science DMZ, since only transfer functions of research data are allowed to the DTN without any security- and performance-threatening functions such as commercial internet service. Current Science DMZ requires per-user DTN server installation which turns out a scalability limitation of the networks in terms of management overhead, entry barrier of the user, and networks-wise CAPEX. In order to relax the aforementioned scalability issues, this paper suggests a centralized DTN design where end users in a group can share the centralized DTN. We evaluate the effectiveness of the suggested sharable DTN design by comparing CAPEX against to that of current design with respect to the diverse network load and the state-of-the-art computing machine.

A Conceptual Architecture and its Experimental Validation of CCTV-Video Object Activitization for Tangible Assets of Experts' Visual Knowledge in Smart Factories (고숙련자 공장작업지식 자산화를 위한 CCTV-동영상 객체능동화의 개념적 아키텍처와 실험적 검증)

  • Eun-Bi Cho;Dinh-Lam Pham;Kyung-Hee Sun;Kwanghoon Pio Kim
    • Journal of Internet Computing and Services
    • /
    • v.25 no.2
    • /
    • pp.101-111
    • /
    • 2024
  • In this paper, we propose a concpetual architecture and its implementation approach for contextualizing unstructured CCTV-video frame data into structured XML-video textual data by using the deep-learning neural network models and frameworks. Conclusively, through the conceptual architecture and the implementation approach proposed in this paper, we can eventually realize and implement the so-called sharable working and experiencing knowledge management platforms to be adopted to smart factories in various industries.

The Establishment and Design of the Science Class in Cyber Space (사이버과학교실시스템 설계 및 구현)

  • Kim, Mi-Young;Kweon, Hyo-Soon;Park, Hye-Ock
    • Journal of Engineering Education Research
    • /
    • v.9 no.4
    • /
    • pp.28-45
    • /
    • 2006
  • As society has changed to being more knowledge-based, it is indispensable that Internet usage is incorporated into education. Therefore, the e-learning system is being developed in order to provide a proper environment. However, many LCMS that were developed, currently are not based on SCORM, the world e-learning standard, nor KEM, the Korea Educational Metadata of Korea Education & Research Information Service(KERIS), and hence, it is difficult to share learning contents developed from such varied environments. National Science Museum, a non-educational institution, also provides the educational science exhibits in reality or in cyber space, which cannot be produced by elementary schools, and secondary schools. Consequently, new systems are necessary, whose modules should be divided into four, for example, 'teachers', 'learners', 'managers', and 'instructors', and be associated with each other so that they are able to integrate and manage such systems, and be used in school education as well. Therefore, in this study, more advanced LMS and LCMS, which are the web-portal sites used for a cyber science class at the National Science Museum, were designed and established. These sites were surely based on the KEM, and the SCORM.

XML Web Services for Learning ContentsBased on a Pedagogical Design Model (교수법적 설계 모델링에 기반한 학습 컨텐츠의 XML 웹 서비스 구축)

  • Shin, Haeng-Ja;Park, Kyung-Hwan
    • Journal of Korea Multimedia Society
    • /
    • v.7 no.8
    • /
    • pp.1131-1144
    • /
    • 2004
  • In this paper, we investigate a problem with an e-learning system for e-business environments and introduce the solving method of the problem. To be more accurate, existing Web-hosted and ASP (Application Service Provider)-oriented service model is difficult to cooperate and integrate among the different kinds of systems. So we have produced sharable and reusable learning object, they have extracted a principle from pedagogical designs for units of reuse. We call LIO (Learning Item Object). This modeling makes use of a constructing for XML Web Services. So to speak, units of reuse from pedagogical designs are test tutorial, resource, case example, simulation, problem, test, discovery and discussion and then map introduction, fact, try, quiz, test, link-more, tell-more LIO learning object. These typed LIOs are stored in metadata along with the information for a content location. Each one of LIOs is designed with components and exposed in an interface for XML Web services. These services are module applications, which are used a standard SOAP (Simple Object Access Protocol) and locate any computer over Internet and publish, find and bind to services. This guarantees the interoperation and integration of the different kinds of systems. As a result, the problem of e-learning systems for e-business environments was resolved and then the power of understanding about learning objects based on pedagogical design was increased for learner and instruction designers. And organizations of education hope for particular decreased costs in constructing e-learning systems.

  • PDF

Conflict Pattern Analysis for Heterogeneous Workflow Interoperability Among Interorganizational Business Processes (조직간 비즈니스 프로세스의 워크플로우 상호운용성 충돌패턴에 관한 연구)

  • Park, Jin-Soo;Kim, Bo-Youn;Hwang, You-Sub
    • Journal of Intelligence and Information Systems
    • /
    • v.15 no.1
    • /
    • pp.103-122
    • /
    • 2009
  • The recent development of information technology has been envisioned as the next technological wave and is expected to play an important role in diminishing boundaries between business organizations. Enterprises have recently resulted in a surge in workflow management, making business processes sharable among different business organizations. To make heterogeneous workflows operational, it is crucial that workflow management systems provide efficient tools for an environment supporting interoperability of business processes among different business organizations. As the potential of workflow management is becoming widely recognized, the demand for an integrated framework that facilitates interoperability among heterogeneous workflows is concomitantly growing. Despite the large body of work in the area of workflow management, few efforts are directed towards identifying conflict patterns for heterogeneous workflow interoperability of inter-organizational business processes. In this paper, we summarize state of the art research trends in workflow management research area and identify conflict patterns for heterogeneous workflows. We believe that this is one of the first attempts to conceptualize conflict patterns that exist on inter-organizational business processes. This paper opens up a novel avenue for workflow management research by supplementing the existing conceptual frameworks for workflow management.

  • PDF

Software Architecture for Implementing the Grid Computing of the High Availability Solution through Load Balancing (고가용성 솔루션 구축을 위한 그리드 측면에서의 소프트웨어 아키텍처를 통한 로드밸랜싱 구현)

  • Lee, Byoung-Yup;Park, Jun-Ho;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.3
    • /
    • pp.26-35
    • /
    • 2011
  • In these days, internet environment are very quickly development as well on-line service have been using a online for the mission critical business around the world. As the amount of information to be processed by computers has recently been increased there has been cluster computing systems developed by connecting workstations server using high speed networks for high availability. but cluster computing technology are limited for a lot of IT resources. So, grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because grid middleware does not have common sharable information system. In order to use grid computing environment efficiently which consists of various grid middleware, it is necessary to have application-independent information system which can share information description and services, and expand them easily. This paper proposed new database architecture and load balancing for high availability through Grid technology.

A Study on the Demand Analysis of Sharable Resources in the Busan New Port Container Terminal (부산신항 컨테이너터미널 내 공유가능 자원들의 수요분석 연구)

  • Nam, Jung-Woo;Sim, Min-Seop;Cha, Jae-Ung;Kim, Joo-Hye;Kim, Yul-Seong
    • 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.