• 제목/요약/키워드: Resource Sharing Service

Search Result 176, Processing Time 0.025 seconds

A Semantic Web Service for Tourism Information over the Mobile Web (시맨틱 웹에 기초한 모바일 관광정보 서비스)

  • Lee, Yang-Won
    • Journal of the Korean Geographical Society
    • /
    • v.42 no.5
    • /
    • pp.788-807
    • /
    • 2007
  • To better publish geographical information on the Web, it is important to capture how Web technologies are changing. For a recent decade, Semantic Web has been developed by incorporating ontologies into the current Web, with an aim to make computers understand rather than simply display. Ontology, an explicit specification of a conceptualization, and the Semantic Web grounded on the ontology, have the potential for effective sharing and appropriate retrieval of geographical information. This paper describes a Semantic Web Service over the mobile Web that can offer pertinent tourism information according to user contexts. To do this, a tourism ontology was formalized in the PARA(Place-Attraction-Resource-Activity) ontology model by organizing tourist places, tourist attractions, tourism resources, and activities. Locational relationships between tourist places were also included in the PARA ontology model to take into account the movements of tourists on a railway network. The XML(Extensible Markup Language) Web Service in the middle tier manages the client-side request for information retrieval and the corresponding server-side response from the data provider. The PARA ontology was integrated into the XML Web Service for the concept-based discovery of tourism information. The applicability of the proposed system was tested through a simulation experiment for Tokyo tourism.

A Point-based Resource Distribution Scheme and Its Characteristics for Mobile P2P Streaming Service (모바일 P2P 스트리밍 서비스를 위한 포인트 기반 자원 배분 기법과 그 특성)

  • Kim, Yangjung;Chong, Ilyoung;Han, Chimoon
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.50 no.6
    • /
    • pp.33-42
    • /
    • 2013
  • In the early stage of P2P, the technology was limited to narrow usage of file sharing, but currently, P2P technology has become essential to maximize the efficiency between associated technologies without additional deployment of high costly infrastructure and also the burden of the server. Especially, P2P media streaming service is a highly attractive service to mobile users. which requires a higher quality in the mobile environment in accordance with the development of technology of wired network as well as better mobile terminals. However, P2P technology should consider the trade-off between 'peer selfishness' and QoE for providing fairness. The P2P system also try to maximize the resource utilization through an incentive mechanism for service differentiation and encourage peers to contribute continuously for improving the overall system performance. In this paper, we propose an point-based incentive mechanism based on peer's contribution level and energy availability for service differentiation. We also introduce that the proposed mechanism efficiently enhances the system performance as the peer with incentive using contribution and energy obtains more effective resource distribution.

Determinants of Software-as-a-Service Adoption Intention Among Small and Medium-sized Korean Firms (중소기업의 Software-as-a-Service 도입의도 결정요인 연구)

  • Kim, Sung-Hyun;Jang, Si-Young
    • Korean Management Science Review
    • /
    • v.30 no.2
    • /
    • pp.11-30
    • /
    • 2013
  • Small and medium-sized enterprises (SMEs) constitute an important part of current industrial economies. Information technologies can be useful strategic weapons for SMEs by enhancing their competitiveness. Categorized as one kind of cloud computing, SaaS is a computing resource and software sharing model which can be accessed via the Internet. Based on virtualization technology, SaaS is expected to improve the efficiency and quality of the IT service level in SMEs. This study attempts to identify the determinants of SaaS adoption intention among Korean SMEs. Through the lens of the theory of planned behavior, this study adopts technological, organizational, environmental factors to explore the determinants of cloud computing adoption intention. The research population is the SMEs that have been funded by the Korean government. Partial least square method was used for empirical analysis of 190 samples collected through on-line survey. The results show that the positive attitude is influenced by business process improvements. Vender support and top management support are positively associated with subjective norm. Vendor support, top management support can relieve perceived behavior control factors. Government support directly influences adoption intention of cloud computing. These findings can provide useful strategy for both SMEs and vendors of SaaS.

Research libraries as a scholarly communication system (학술정보 커뮤니케이션 시스팀으로서의 연구도서관)

  • 이영자
    • Journal of Korean Library and Information Science Society
    • /
    • v.9
    • /
    • pp.179-211
    • /
    • 1982
  • Many problems which today's research libraries are confronted with should be taken the measures to find some solutions in any ways. The purpose of this study is to identify the main stream of chaining of research libraries as an existing collector and distributor of scholarly information into a communication system adopting the concept of resource sharing and on-line bibliographic search as some possible ways for solutions. The conclusions of this study can be summarized as follows: 1) The research libraries will be imposed on more and more responsibilities to be a reservoir of the intellectual heritage of an individual, a nation and mankind. 2) The research libraries in the near future will have to develop their collections in the new environment of austerity with the limited budget. 3) It is more desirable for the future research libraries to have the attitude that they are in the business of information and communication rather than being an entity as "a library". 4) The resource sharing developed to solve the severe problems confrontal by research libraries will improve the organizational and technical mechanism for the access to the scholarly information. 5) The research libraries will produce more and more bibliographic database to expand the library materials which can be available and shared. 6) Though on-line search service will be sure to provide a considerable profit to the scholarly information users, it will take a long time for this service to be popularize because of the high ratio of service fee. 7) Two problems should be solved for the efficient service by on-line search. One is the continuous, updating training for the professional librarians. The other is that the common efforts for the quality control and standardization of data base by the data base producers should be made. 8) Taking all the items of the conclusions derived from the study of research libraries mainly in the United States into a consideration, the followings should be paid an attention. - The status-quo of the research libraries in Korea should be analyzed in very detailed and accurate way. - The problems of research libraries in Korea as the major scholarly communication system should be clarified based on the analysis. - The measures for the problems should be taken in the light of the unique characteristics of korean environment. - For the developing the most efficient measures, the formal organize action to lead and govern the long-aimed study on the problems of research libraries should be established and the government-level su n.0, pport for the legislation and finance should be provided for the realization of the result of the study.

  • PDF

Dynamic Bandwidth Distribution Method for High Performance Non-volatile Memory in Cloud Computing Environment (클라우드 환경에서 고성능 저장장치를 위한 동적 대역폭 분배 기법)

  • Kwon, Piljin;Ahn, Sungyong
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.20 no.3
    • /
    • pp.97-103
    • /
    • 2020
  • Linux Cgroups takes a fundamental role for sharing system resources among multiple containers on container-based cloud computing environment. Especially for I/O resource, Linux Cgroups supports a mechanism for sharing I/O bandwidth in proportion to I/O weight. However, the current mechanism of Linux Cgroups using BFQ I/O scheduler seriously degrades the I/O performance with high bandwidth storage device such as NVMe SSDs. In this paper, we proposed a new feedback based I/O bandwidth sharing scheme for Linux Cgroups which allocates I/O credits to containers according to I/O weights and adjusts the amount of credits to performance fluctuation of NVMe SSDs. The proposed scheme is implemented on Linux kernel 5.3 and evaluated. The evaluation results show that it can share the I/O bandwidth among multiple containers proportionally to I/O weights while improving I/O performance more than twice as high as the existing scheme.

Constant-Size Ciphertext-Policy Attribute-Based Data Access and Outsourceable Decryption Scheme (고정 크기 암호 정책 속성 기반의 데이터 접근과 복호 연산 아웃소싱 기법)

  • Hahn, Changhee;Hur, Junbeom
    • Journal of KIISE
    • /
    • v.43 no.8
    • /
    • pp.933-945
    • /
    • 2016
  • Sharing data by multiple users on the public storage, e.g., the cloud, is considered to be efficient because the cloud provides on-demand computing service at anytime and anywhere. Secure data sharing is achieved by fine-grained access control. Existing symmetric and public key encryption schemes are not suitable for secure data sharing because they support 1-to-1 relationship between a ciphertext and a secret key. Attribute based encryption supports fine-grained access control, however it incurs linearly increasing ciphertexts as the number of attributes increases. Additionally, the decryption process has high computational cost so that it is not applicable in case of resource-constrained environments. In this study, we propose an efficient attribute-based secure data sharing scheme with outsourceable decryption. The proposed scheme guarantees constant-size ciphertexts irrespective of the number of attributes. In case of static attributes, the computation cost to the user is reduced by delegating approximately 95.3% of decryption operations to the more powerful storage systems, whereas 72.3% of decryption operations are outsourced in terms of dynamic attributes.

Evaluation for User Experience about Interface Design of Video-Sharing Website -Mainly with Analysis on 'YouTube' and 'Vimeo'- (영상 공유 사이트의 인터페이스 디자인에 따른 사용자 경험 연구 -유튜브(YouTube)와 비메오(Vimeo)를 중심으로-)

  • Lee, Seung-Yun;Kim, Seung-In
    • Journal of Digital Convergence
    • /
    • v.14 no.8
    • /
    • pp.423-429
    • /
    • 2016
  • The study evaluates user experiences of YouTube and Vimeo, typical Video-sharing websites, to suggest guidelines that are more user-cantered and useful. I did some literature research followed with evaluation of theoretical backgrounds, present conditions and future services. Also, I used the six principles of "Creating Pleasurable Interface" by Stephen Anderson to conduct an in-depth interview. The results indicate that YouTube needs to improve availability of its functions and usability by reducing advertisement. Vimeo needs to improve its popularity by increasing popular contents and add relationship service such as personal broadcasting system and community services. I expect this study will become a good resource for upgrading user experiences of Video-sharing websites. I also believe that this study can guide other studies about user experience in other fields.

Pub/Sub-based Sensor virtualization framework for Cloud environment

  • Ullah, Mohammad Hasmat;Park, Sung-Soon;Nob, Jaechun;Kim, Gyeong Hun
    • International journal of advanced smart convergence
    • /
    • v.4 no.2
    • /
    • pp.109-119
    • /
    • 2015
  • The interaction between wireless sensors such as Internet of Things (IoT) and Cloud is a new paradigm of communication virtualization to overcome resource and efficiency restriction. Cloud computing provides unlimited platform, resources, services and also covers almost every area of computing. On the other hand, Wireless Sensor Networks (WSN) has gained attention for their potential supports and attractive solutions such as IoT, environment monitoring, healthcare, military, critical infrastructure monitoring, home and industrial automation, transportation, business, etc. Besides, our virtual groups and social networks are in main role of information sharing. However, this sensor network lacks resource, storage capacity and computational power along with extensibility, fault-tolerance, reliability and openness. These data are not available to community groups or cloud environment for general purpose research or utilization yet. If we reduce the gap between real and virtual world by adding this WSN driven data to cloud environment and virtual communities, then it can gain a remarkable attention from all over, along with giving us the benefit in various sectors. We have proposed a Pub/Sub-based sensor virtualization framework Cloud environment. This integration provides resource, service, and storage with sensor driven data to the community. We have virtualized physical sensors as virtual sensors on cloud computing, while this middleware and virtual sensors are provisioned automatically to end users whenever they required. Our architecture provides service to end users without being concerned about its implementation details. Furthermore, we have proposed an efficient content-based event matching algorithm to analyze subscriptions and to publish proper contents in a cost-effective manner. We have evaluated our algorithm which shows better performance while comparing to that of previously proposed algorithms.

A design of GPU container co-execution framework measuring interference among applications (GPU 컨테이너 동시 실행에 따른 응용의 간섭 측정 프레임워크 설계)

  • Kim, Sejin;Kim, Yoonhee
    • KNOM Review
    • /
    • v.23 no.1
    • /
    • pp.43-50
    • /
    • 2020
  • As General Purpose Graphics Processing Unit (GPGPU) recently plays an essential role in high-performance computing, several cloud service providers offer GPU service. Most cluster orchestration platforms in a cloud environment using containers allocate the integer number of GPU to jobs and do not allow a node shared with other jobs. In this case, resource utilization of a GPU node might be low if a job does not intensively require either many cores or large size of memory in GPU. GPU virtualization brings opportunities to realize kernel concurrency and share resources. However, performance may vary depending on characteristics of applications running concurrently and interference among them due to resource contention on a node. This paper proposes GPU container co-execution framework with multiple server creation and execution based on Kubernetes, container orchestration platform for measuring interference which may be occurred by sharing GPU resources. Performance changes according to scheduling policies were investigated by executing several jobs on GPU. The result shows that optimal scheduling is not possible only considering GPU memory and computing resource usage. Interference caused by co-execution among applications is measured using the framework.

Coalition Formation Game Based Relay Selection and Frequency Sharing for Cooperative Relay Assisted Wireless D2D Networks with QoS Constraints

  • Niu, Jinxin;Tang, Wei;Guo, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5253-5270
    • /
    • 2016
  • With device-to-device (D2D) communications, an inactive user terminal can be utilized as a relay node to support multi-hop communication so that connective experience of the cell-edge user as well as the capacity of the whole system can be significantly improved. In this paper, we investigate the spectrum sharing for a cooperative relay assisted D2D communication underlying a cellular network. We formulate a joint relay selection and channel assignment problem to maximize the throughput of the system while guaranteeing the quality of service (QoS) requirements of cellular users (CUs) and D2D users (DUs). By exploiting coalition formation game theory, we propose two algorithms to solve the problem. The first algorithm is designed based on merge and split rules while the second one is developed based on single user's movement. Both of them are proved to be stable and convergent. Simulation results are presented to show the effectiveness of the proposed algorithms.