• Title/Summary/Keyword: Shared Information

Search Result 2,137, Processing Time 0.029 seconds

The Influence of Shared Goal and Value of Information Security Policy: The Role of Demand-ability Fit and Person-organization Fit (정보보안 정책 목표 공유 및 가치의 영향: 요구-능력 적합성 및 개인-조직 적합성의 역할)

  • In-Ho Hwang
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.19 no.3
    • /
    • pp.609-618
    • /
    • 2024
  • The escalating demand for organized information resource management within organizations necessitates increased investment in information security (IS), as a single error can lead to information exposure incidents, underscoring the importance of IS compliance by insiders. The research aims to elevate IS compliance within the organization by examining the influence of the shared goal of information security policy (ISP), perceived ISP value and individual's fits on an insider's intention to comply with the ISP. Antecedent research in organizational behavior and IS led to a proposed hypothesis, tested using 366 obtained samples. The ISP shared goal's positive influence on ISP compliance intentions was evident from the test results, primarily through the perceived ISP value. Furthermore, the person-organization and demand-ability fit moderated the antecedent factors associated with ISP compliance intentions. Our findings suggest the methods for sustaining organizational IS levels by examining the requisite conditions from the viewpoints of the organizational environment, ISP values, and fits.

How Quick Response affects the Supply Chain Performance

  • RYU, Chungsuk
    • Journal of Distribution Science
    • /
    • v.17 no.7
    • /
    • pp.87-98
    • /
    • 2019
  • Purpose - The goal of this research is to examine the influence of Quick Response on the supply chain performance. Furthermore, this study investigates the potential of Quick Response to be a more advanced form of supply chain collaboration program with extensive information sharing activities. Research design, data, and methodology - The mathematical model is developed to represent the two stage supply chain system with a single manufacturer and one retailer. In the numerical study with the proposed mathematical models, three supply chain systems including the traditional system, Quick Response, and the fully shared information system are compared in terms of their profits. Results - The numerical analysis shows both manufacturer and retailer obtain greater profits under Quick Response than in the traditional system. While the fully shared information outperforms Quick Response as well as the traditional system, it results in lower manufacturer's profit compared with Quick Response. Conclusions - According to the numerical examples, Quick Response is the effective supply chain collaboration program that is beneficial to every supply chain member. The fully shared information system, as a more advanced form of collaboration than Quick Response can bring more benefits to the whole supply chain system, but it is necessary to prepare the proper incentive program that enables every member to share its benefits equally.

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

Performance Analysis of Shared Stack Management for Sensor Operating Systems (센서 운영 체제를 위한 공유 스택 기법의 성능 분석)

  • Gu, Bon-Cheol;Heo, Jun-Young;Hong, Ji-Man;Cho, Yoo-Kun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.1
    • /
    • pp.53-59
    • /
    • 2008
  • In spite of increasing complexity of wireless sensor network applications, most of the sensor node platforms still have severe resource constraints. Especially a small amount of memory and absence of a memory management unit (MMU) cause many problems in managing application thread stacks. Hence, a shared-stack was proposed, which allows several threads to share one single stack for minimizing the amount of memory wasted by fixed-size stacks. In this paper, we present the memory usage models for thread stacks by deriving the overflow probability of the fixed-size stack and the shared-stack and also show that the shared-stack is more reliable than the fixed-size stack.

Cell-interleavd VC merging scheme for multipoint-to-multipoint communication in ATM network (ATM 망에서의 다자간 통신을 위한 cell-interleaved VC merging 기법)

  • 신상헌
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.9A
    • /
    • pp.1431-1440
    • /
    • 2000
  • In order to support efficiently the multimedia applications, such as virtual classroom, video conferencing and tele-medical, the efficient multipoint-to-multipoint(MP-to-MP) connection management function is essential. Shared tree is reported as the most useful method for this purpose. In this paper we propose a new MP-to-MP connection setup & management scheme, called CIMA(Cell Interleaved Multiplexing on ATM) scheme,which is a VC merging method for MP-to-MP communication using shared tree. In the CIMA scheme,MRM cell delivers the cell merging information to the next node. The receiving node can identfy cells which arrived through a channel using the same VPI/VCI by the merging information in the MRM cell. Therefore the CIMA scheme can solve easily the Cell Interleaving Problem(CIP) that happens in VC merging. We analyzed the overhead of the proposed CIMA by mathematical analysis,and simulated the buffer usage of CIMA with OPNET. As the result of analysis,we found that the CIMA scheme has acceptable merging overhead and doesn't cause the buffer scare problem.

  • PDF

Design of Teaching Method for SW Education Based On Python and Team-Shared Mental Model (파이썬과 팀 공유정신모형을 활용한 SW교육 방법의 설계)

  • Lee, Hakkyung;Park, Phanwoo;Yoo, Inhwan
    • Journal of The Korean Association of Information Education
    • /
    • v.24 no.1
    • /
    • pp.1-10
    • /
    • 2020
  • According to the Fourth Industrial Revolution, SW education is emphasized around the world to educate student with new abilities. Following to these global trends, SW education has become mandatory in Korea's 2015 revised curriculum. However, Korean elementary SW education is focused on the use of block-based programming languages. In addition, the point of view of selecting goals and organizing content of SW Education, the affective domain is ignored and focused only on the cognitive and psychomotor domains. So, this study explored method of SW education using the concept of Team-Shared Mental Model for develop of community capacity and Python, which is textual programming language gaining popularity recently. As a result of performing the post test t-test on two groups with similar Team-Shared Mental Model formation, we found that it was effective in forming a Team-Shared Mental Model of the group applying the SW teaching method suggested in the study.

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.

Dynamic Limited Directory Scheme for Distributed Shared Memory Systems (분산공유 메모리 시스템을 위한 동적 제한 디렉터리 기법)

  • Lee, Dong-Gwang;Gwon, Hyeok-Seong;Choe, Seong-Min;An, Byeong-Cheol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.1098-1105
    • /
    • 1999
  • The caches in distributed shared memory systems enhance the performance by reducing memory access latency and communication overhead, but they must solve the cache coherence problem. This paper proposes a new directory protocol to solve the cache coherence problem and to improve the system performance in distributed shared memory systems. To maintain the cache coherence of shared data, processors within a limited distance reduce the communication overhead by using a bit-vector like the full directory scheme. Processors over a limited distance store pointers in a directory pool. Since the bit-vector and the directory pool remove the unnecessary cache invalidations, the proposed scheme reduces the communication traffic and improves the system performance. The dynamic limited directory scheme reduces the communication traffic up to 66 percents compared with the limited directory scheme and the number of directory access up to 27 percents compared with the dynamic pointer allocation scheme.

  • PDF

Secure Configuration Scheme of Pre-shared Key for Lightweight Devices in Internet of Things (사물인터넷의 경량화 장치를 위한 안전한 Pre-shared Key 설정 기술)

  • Kim, Jeongin;Kang, Namhi
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.3
    • /
    • pp.1-6
    • /
    • 2015
  • The IoT(Internet of things) technology enable objects around user to be connected with each other for sharing information. To support security is the mandatory requirement in IoT because it is related to the disclosure of private information but also directly related to the human safety. However, it is difficult to apply traditional security mechanism into lightweight devices. This is owing to the fact that many IoT devices are generally resource constrained and powered by battery. PSK(Pre-Shared Key) based approach, which share secret key in advance between communication entities thereafter operate security functions, is suitable for light-weight device. That is because PSK is costly efficient than a session key establishment approach based on public key algorithm. However, how to safely set a PSK of the lightweight device in advance is a difficult issue because input/output interfaces such as keyboard or display are constrained in general lightweight devices. To solve the problem, we propose and develop a secure PSK configuration scheme for resource constrained devices in IoT.