• Title/Summary/Keyword: Shared Information

Search Result 2,118, Processing Time 0.034 seconds

A Study on the Cloud Collection (클라우드 컬렉션에 관한 연구)

  • Cho, Jane
    • Journal of Korean Library and Information Science Society
    • /
    • v.43 no.1
    • /
    • pp.201-219
    • /
    • 2012
  • Cloud collection, which is derived from cloud computing, is a framework that creates new value through library cooperative platform to preserve and manage libraries' duplicated collection. Due to E-book market vitalization and mass digitalization of retrospective print material, new library collection management paradigm has been expected that licensed based E-book service and management of shared print repository. This study discuss cloud collection concept which digital repository and Shared print repository are in complementary relations. And suggest cloud collection model can be applicable to Korean university libraries.

Bounding Worst-Case Performance for Multi-Core Processors with Shared L2 Instruction Caches

  • Yan, Jun;Zhang, Wei
    • Journal of Computing Science and Engineering
    • /
    • v.5 no.1
    • /
    • pp.1-18
    • /
    • 2011
  • As the first step toward real-time multi-core computing, this paper presents a novel approach to bounding the worst-case performance for threads running on multi-core processors with shared L2 instruction caches. The idea of our approach is to compute the worst-case instruction access interferences between different threads based on the program control flow information of each thread, which can be statically analyzed. Our experiments indicate that the proposed approach can reasonably estimate the worst-case shared L2 instruction cache misses by considering the inter-thread instruction conflicts. Also, the worst-case execution time (WCET) of applications running on multi-core processors estimated by our approach is much better than the estimation by simply assuming all L2 instruction accesses are misses.

MI-MESI Write-invalidate Snooping Cache Coherence Protocol (MI-MESI 쓰기-무효화 스누핑 캐쉬 일관성 유지 프로토콜)

  • Jang, Seong-Tae
    • The Transactions of the Korea Information Processing Society
    • /
    • v.2 no.5
    • /
    • pp.757-767
    • /
    • 1995
  • In this paper, we present MI-MESI write-invalidate snooping cache coherence protocol which addresses several significant drawbacks of MESI and MI-MESI write -invalidate snooping cache coherence protocols under the split transaction bus based multiprocessor environment. In this protocol, each cache block maintains one of six cache states which represent Modified-shared, Invalid-by-other, Modified, Exclusive, Shared and Invalid states. By using these cache states, our protocol reduces both the access contention and unnecessary updates for the memory modules significantly, and thus providing the fast memory access time.

  • PDF

A Multicast ATM Switch Architecture using Shared Bus and Shared Memory Switch (공유 버스와 공유 메모리 스위치를 이용한 멀티캐스트 ATM 스위치 구조)

  • 강행익;박영근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.8B
    • /
    • pp.1401-1411
    • /
    • 1999
  • Due to the increase of multimedia services, multicasting is considered as important design factor for ATM switch. To resolve the traffic expansion problem that is occurred by multicast in multistage interconnection networks, this paper proposes the multicast switch using a high-speed bus and a shared memory switch. Since the proposed switch uses a high-speed time division bus as a connection medium and chooses a shared memory switch as a basic switch module, it provides good port scalability. The traffic arbitration scheme enables internal non-blocking. By simulation we proves a good performance in the data throughput and the cell delay.

  • PDF

Spectral clustering based on the local similarity measure of shared neighbors

  • Cao, Zongqi;Chen, Hongjia;Wang, Xiang
    • ETRI Journal
    • /
    • v.44 no.5
    • /
    • pp.769-779
    • /
    • 2022
  • Spectral clustering has become a typical and efficient clustering method used in a variety of applications. The critical step of spectral clustering is the similarity measurement, which largely determines the performance of the spectral clustering method. In this paper, we propose a novel spectral clustering algorithm based on the local similarity measure of shared neighbors. This similarity measurement exploits the local density information between data points based on the weight of the shared neighbors in a directed k-nearest neighbor graph with only one parameter k, that is, the number of nearest neighbors. Numerical experiments on synthetic and real-world datasets demonstrate that our proposed algorithm outperforms other existing spectral clustering algorithms in terms of the clustering performance measured via the normalized mutual information, clustering accuracy, and F-measure. As an example, the proposed method can provide an improvement of 15.82% in the clustering performance for the Soybean dataset.

Shared Spatio-temporal Attention Convolution Optimization Network for Traffic Prediction

  • Pengcheng, Li;Changjiu, Ke;Hongyu, Tu;Houbing, Zhang;Xu, Zhang
    • Journal of Information Processing Systems
    • /
    • v.19 no.1
    • /
    • pp.130-138
    • /
    • 2023
  • The traffic flow in an urban area is affected by the date, weather, and regional traffic flow. The existing methods are weak to model the dynamic road network features, which results in inadequate long-term prediction performance. To solve the problems regarding insufficient capacity for dynamic modeling of road network structures and insufficient mining of dynamic spatio-temporal features. In this study, we propose a novel traffic flow prediction framework called shared spatio-temporal attention convolution optimization network (SSTACON). The shared spatio-temporal attention convolution layer shares a spatio-temporal attention structure, that is designed to extract dynamic spatio-temporal features from historical traffic conditions. Subsequently, the graph optimization module is used to model the dynamic road network structure. The experimental evaluation conducted on two datasets shows that the proposed method outperforms state-of-the-art methods at all time intervals.

Smart City Governance Logic Model Converging Hub-and-spoke Data Management and Blockchain Technology (허브 앤 스포크형 데이터 관리 및 블록체인 기술 융합 스마트도시 거버넌스 로직모델)

  • Choi, Sung-Jin
    • Journal of KIBIM
    • /
    • v.14 no.1
    • /
    • pp.30-38
    • /
    • 2024
  • This study aims to propose a smart city governance logic model that can accommodate more diverse information service systems by mixing hub-and-spoke and blockchain technologies as a data management model. Specifically, the research focuses on deriving the logic of an operating system that can work across smart city planning based on the two data governance technologies. The first step of the logic is the generation and collection of information, which is first divided into information that requires information protection and information that can be shared with the public, and the information that requires privacy is blockchainized, and the shared information is integrated and aggregated in a data hub. The next step is the processing and use of the information, which can actively use the blockchain technology, but for the information that can be shared other than the protected information, the governance logic is built in parallel with the hub-and-spoke type. Next is the logic of the distribution stage, where the key is to establish a service contact point between service providers and beneficiaries. Also, This study proposes the establishment of a one-to-one data exchange relationship between information providers, information consumers, and information processors. Finally, in order to expand and promote citizen participation opportunities through a reasonable compensation system in the operation of smart cities, we developed virtual currency as a local currency and designed an open operation logic of local virtual currency that can operate in the compensation dimension of information.

CoSpace: A Web-based Collaborative Environment Supporting Shared Workspaces (CoSpace: 공유작업공간을 지원하는 웹 기반 공동작업환경)

  • Jeong, Su-Gwon;Kim, Gyu-Wan;Kim, In-Ho;Jeong, Jae-Hun;Lee, Myeong-Jun
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.11S
    • /
    • pp.3420-3433
    • /
    • 1999
  • Since most of CSCW(Computer-Supported Cooperative Work) systems have been developed for particular computing platforms, they are usable only within the specific organizations supporting those particular platforms. Recently, according to the rapid growth and continuing success of the World-Wide Web(WWW or Web) which offers a globally accessible platform-independent infrastructure, many CSCW systems has been constructed and is being developed on the basis of the Web. As one of such CSCW systems, in this paper, we describe the design and implementation of the CoSpace system. The CoSpace system provides shared workspaces, which enable members of a work group easily share information for collaborative work through their Web Browsers. The shared workspaces support information sharing and management between users, and also support event monitoring and synchronization between collaborative works.

  • PDF

A Study on USIM based Integrated Authentication in IT Shared Service Environment (IT Shared Service 운영 환경에서 USIM 을 활용한 통합 인증에 관한 연구)

  • Kim, Jae-Heung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2010.11a
    • /
    • pp.1086-1089
    • /
    • 2010
  • 글로벌 기업은 공통 활용 가능한 IT 요소를 통합/재정립하여 비즈니스 전략을 효과적으로 지원하기 위한 IT Shared Service(이하 ITSS) 체계로 전환하고 있다. IT 자원은 통합되고 업무는 네트워크 기반의 가상화된 서비스로 제공되며, 모바일 중심의 개인 업무 환경으로 전환되고 있다. 본 논문은 상용화된 보안 인증 방식 중 ITSS 운영환경에 적합한 방식을 검토하고, 문제점 및 취약점을 찾아 개선 방안을 도출하고자 한다. 특히, 모바일 환경이 급속도로 확산되는 추세에서 USIM을 활용한 인증 방식이 기업의 보안 요구사항을 충족 시킬 수 있는지 집중 검토하고자 한다.

Station Extension Algorithm Considering Destinations to Solve Illegal Parking of E-Scooters

  • Jeongeun, Song;Yoon-Ah, Song;ZoonKy, Lee
    • Journal of the Korea Society of Computer and Information
    • /
    • v.28 no.2
    • /
    • pp.131-142
    • /
    • 2023
  • In this paper, we propose a new station selection algorithm to solve the illegal parking problem of shared electric scooters and improve the service quality. Recently, as a solution to the urban transportation problem, shared electric scooters are attracting attention as the first and last mile means between public transportation and final destinations. As a result, the shared electric scooter market grew rapidly, problems caused by electric scooters are becoming serious. Therefore, in this study, text data are collected to understand the nature of the problem, and the problems related to shared scooters are viewed from the perspective of pedestrians and users in 'LDA Topic Modeling', and a station extension algorithm is based on this. Some parking lots have already been installed, but the existing parking lot location is different from the actual area of tow. Therefore, in this study, we propose an algorithm that can install stations at high actual tow density using mixed clustering technology using K-means after primary clustering by DBSCAN, reflecting the 'current state of electric scooter tow in Seoul'.