• Title/Summary/Keyword: Shared Information

Search Result 2,127, Processing Time 0.029 seconds

A Study on Determinants of IT Shared Services Adoption: Focus on Korean Financial Institutions (IT쉐어드서비스 도입에 관한 영향요인 연구: 국내 금융기관을 중심으로)

  • Keum, Chang-Keun;Yi, Seon-Gyu
    • Information Systems Review
    • /
    • v.10 no.1
    • /
    • pp.21-45
    • /
    • 2008
  • Over the years a lot of organizations or enterprises are spending the majority of their IT budgets on IT resources procurement and maintenance. IT resources are typically duplicated in each Region, Division, and/or Business Unit. The biggest sources of cost savings come directly from the reduction in maintenance cost and the elimination of duplicated resources. Global corporations are investing heavily in shared services implementations in order to stay competitive in an industry environment. A number of financial services firms have turned to IT shared services to reduce the level of IT asset and infrastructure redundancies. Recently, Korean financial services industry is moving to diversification(bank, securities, insurance, etc.) and consolidation(M&A, strategic alliance, etc.), and wants the elimination of duplicated IT resources. This research is intended to find out and demonstrate the factors having a significant effect on adoption of IT shared services center in finance services industry.

Efficient Energy Management for Shared Solar-powered Sensor System (공유형 태양 에너지 기반 센서 시스템을 위한 효율적인 에너지 관리 기법)

  • Noh, Dong-Kun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.10a
    • /
    • pp.531-534
    • /
    • 2010
  • In this paper, we introduce an efficient energy management using a notion of virtual energy system for shared solar-powered sensor network. Virtual energy system is an abstraction that allows sensor network applications on a node to reserve their own fractions of the shared solar cell and the shared rechargeable battery, hence achieving logically partition of a shared renewable power source with no change in design and implementation. Our results show that our design and implementation are reliable, lightweight and efficient, allowing proper isolation of energy consumption among applications.

  • PDF

Per-transaction Shared Key Scheme to Improve Security on Smart Payment System

  • Ahmad, Fawad;Jung, Younchan
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.8 no.1
    • /
    • pp.7-18
    • /
    • 2016
  • Several authentication methods have been developed to make use of tokens in the mobile networks and smart payment systems. Token used in smart payment system is genearated in place of Primary Account Number. The use of token in each payment transaction is advantageous because the token authentication prevents enemy from intercepting credit card number over the network. Existing token authentication methods work together with the cryptogram, which is computed using the shared key that is provisioned by the token service provider. Long lifetime and repeated use of shared key cause potential brawback related to its vulnerability against the brute-force attack. This paper proposes a per-transaction shared key mechanism, where the per-transaction key is agreed between the mobile device and token service provider for each smart payment transaction. From server viewpoint, per-transaction key list is easy to handle because the per-transaction key has short lifetime below a couple of seconds and the server does not need to maintain the state for the mobile device. We analyze the optimum size of the per-transaction shared key which satisfy the requirements for transaction latency and security strength for secure payment transactions.

Improvement Method and Performance Analysis of Shared Memory in Dual Core Embedded Linux system (듀얼코어 임베디드 리눅스 시스템에서 공유 메모리 성능 개선 방안 및 성능 분석)

  • Jung, Ji-Sung;Kim, Chang-Bong
    • Journal of Internet Computing and Services
    • /
    • v.11 no.4
    • /
    • pp.95-106
    • /
    • 2010
  • Recently multiple process communicate together. They share resource and information for cooperation in complicated programming environment. Kernel provides IPC (Inter -Process Communication) for communication with each other process. Shared Memory is a technique that many processes can access to identical memory area in the Linux environment. In this paper, we propose a performance improvement method of shared memory in the dual-core embedded linux system which is consist of different core and different operating system. We construct the MPC2530F (ARM926F+ARM946E) linux system and measure the performance therein. We attempt a performance enhancement in each CPU for each process which uses a shared memory.

ObjectPeerWork : Framework for the Development of Peer-to-Peer Applications based on Shared Object Model (ObjectPeerWork : 공유 객체 모델 기반의 피어투피어 어플리케이션 개발을 위한 프레임워크)

  • Kang, Un-Gu;Wang, Chang-Jong
    • 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.

  • PDF

Designing a Bitonic Sorting Algorithm for Shared-Memory Parallel Computers and an Efficient Implementation of its Communication (공유 메모리 병렬 컴퓨터 환경에서 Bitonic Sorting 알고리즘 설계와 효율적인 통신의 구현)

  • Lee, Jae-Dong;Kwon, Kyung-Hee;Park, Yong-Beom
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.11
    • /
    • pp.2690-2700
    • /
    • 1997
  • This paper presents parallel sorting algorithm, SHARED-MEMORY-BS and REDUCED-BS, which are implemented on shared-memory parallel computers. These algorithm sort N keys in $O(log^2N)$ time. REDUCED-BS users a parity strategy which gives an idea for the efficient usage of the local memory associated with each processor. By taking advantage of the local memory associated with each processor, the communication of REDUCED-BS is decreased by approximately half that of SHARED-MEMORY-BS. On the basis of alleviating the communication, the algorithm REDUCED-BS results in a significant improvement of performance.

  • PDF

Comparison of Preferred Features in Spatial Composition for Shared Housing between Rural and Urban Elderly

  • Lee, Ji-Hye;Lee, Yeun-Sook
    • KIEAE Journal
    • /
    • v.15 no.1
    • /
    • pp.29-43
    • /
    • 2015
  • Shared housing for elderly people, where several elderly people live together, gains attention as a means to prevent the lonely death of elderly people and continuously maintain their social relations. The purpose of this study is to compare the characteristics planned through rural and urban areas-residing elderly people's participation in the shared housing spatial composition by area. This study conducted a small scale workshop panel method that targeted small group, but through which extensive information can be acquired, as a qualitative method. This study targeted 16 elderly people aged 65 and over living in rented apartments in rural and urban areas by dividing them two groups by area, namely into four groups. A total of 12 workshop sessions were held with three sessions at a time through a certain time interval. As a result of the study, the elderly people showed positive responses to the shared housing, irrelevant of area. As time went on, the workshop panel method's effect was revealed through consolidated positive attitude and agreement of different opinions. The shared housing for elderly people is valuable as a residential alternative for elderly people, and differentiated supply of the shared housing for elderly people, according to residential area's characteristics, is suggested.

A Real-Time Scheduling Algorithm for Tasks with Shared Resources on Multiprocessor Systems (다중프로세서 시스템상의 공유 자원을 포함하는 태스크를 위한 실시간 스케줄링 알고리즘)

  • Lee, Sang-Tae;Kim, Young-Seok
    • The KIPS Transactions:PartA
    • /
    • v.17A no.6
    • /
    • pp.259-264
    • /
    • 2010
  • In case of scheduling tasks with shared resources in multiprocessor systems, Global Earliest Deadline First (GEDF) algorithm, equally applied Earliest Deadline First (EDF) which runs scheduling with deadline criterion, makes schedulability decline because GEDF typically does not have a specific process in order to handle tasks with shared resources. In this paper, we propose Earliest Deadline First with Partitioning (EDFP) for tasks with shared resources which partitions a task into two kinds of subtasks that include critical sections to access to shared resources, gives their own deadline respectively and manages them. As a result of simulations, EDFP shows better performance than GEDF for tasks with shared resources since system load goes up and the number of processor increases.

Implementation of a Shared Buffer ATM Switch Embedded Scalable Pipelined Buffer Memory (가변형 파이프라인방식 메모리를 내장한 공유버퍼 ATM 스위치의 구현)

  • 정갑중
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.5
    • /
    • pp.703-717
    • /
    • 2002
  • This paper illustrates the implementation of a scalable shared buffer asynchronous transfer mode (ATM) switch. The designed shared buffer ATM switch has a shared buffet of a pipelined memory which has the access time of 4 ns. The high-speed buffer access time supports a possibility of the implementation of a shared buffer ATM switch which has a large switching capacity. The designed switch architecture provides flexible switching performance and port size scalability with the independence of queue address control from buffer memory control. The switch size and the buffer size of the designed ATM switch can be reconfigured without serious circuit redesign. The designed prototype chip has a shared buffer of 128-cell and 4 ${\times}$ 4 switch size. It is integrated in 0.6um, double-metal, and single-poly CMOS technology. It has 80MHz operating frequency and supports 640Mbps per port.

A Study on the Domain of Strategic Alliance between Corporations in the CALS System. (CALS 시스템 구축 과정에서 기업간 전략적 협력의 범위설정에 관한 연구 - ILS와 SCM의 관점에서 기업간 공유환경을 중심으로)

  • 고일상
    • The Journal of Society for e-Business Studies
    • /
    • v.4 no.3
    • /
    • pp.1-24
    • /
    • 1999
  • Strategic alliance between corporations is essential to build a CALS system. Specially, companies cooperate one another to accomplish the shared environment in the system. During the construction of the CALS system, we can apply the concepts of ILS and SCM to develop the breadth and depth of shared environment between firms. In order to build such intended environment in the CALS system, we propose five dimensions with 30 variables to be considered. These dimensions are Information Sharing, Task Sharing, System Sharing, Parts and Facilities Sharing, and Institution Sharing. Structured interviews were peformed to measure the degree of shared environment designed in 7 CALS pilot systems in Korea. The results show that the level of the shared environment in the context of vertical relationships between firms in the CALS systems is fairly high. In contrast, the level of the sharing between competing companies in horizontal relationships is relatively low in most of the pilot systems.

  • PDF