• Title/Summary/Keyword: Dynamic access time

Search Result 281, Processing Time 0.034 seconds

Design of Dynamic Location Privacy Protection Scheme Based an CS-RBAC (CS-RBAC 기반의 동적 Location Privacy 보호 구조 설계)

  • Song You-Jin;Han Seoung-Hyun;Lee Dong-Hyeok
    • The KIPS Transactions:PartC
    • /
    • v.13C no.4 s.107
    • /
    • pp.415-426
    • /
    • 2006
  • The essential characteristic of ubiquitous is context-awareness, and that means ubiquitous computing can automatically process the data that change according to space and time, without users' intervention. However, in circumstance of context awareness, since location information is able to be collected without users' clear approval, users cannot control their location information completely. These problems can cause privacy issue when users access their location information. Therefore, it is important to construct the location information system, which decides to release the information considering privacy under the condition such as location, users' situation, and people who demand information. Therefore, in order to intercept an outflow information and provide securely location-based information, this paper suggests a new system based CS-RBAC with the existing LBS, which responds sensitively as customer's situation. Moreover, it accommodates a merit of PCP reflecting user's preference constructively. Also, through privacy weight, it makes information not only decide to providing information, but endow 'grade'. By this method, users' data can be protected safely with foundation of 'Role' in context-aware circumstance.

CDSS enabled PHR system for chronic disease patients (만성 질병환자를 위한 CDSS를 적용한 PHR 시스템)

  • Hussain, Maqbool;Khan, Wajahat Ali;Afzal, Muhammad;Ali, Taqdir;Lee, Sungyoung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2012.11a
    • /
    • pp.1321-1322
    • /
    • 2012
  • With the advance of Information Technology (IT) and dynamic requirements, diverse application services have been provided for end users. With huge volume of these services and information, users are required to acquire customized services that provide personalized information and decision at particular extent of time. The case is more appealing in healthcare, where patients wish to have access to their medical record where they have control and provided with recommendation on the medical information. PHR (Personal Health Record) is most prevailing initiative that gives secure access on patient record at anytime and anywhere. PHR should also incorporate decision support to help patients in self-management of their diseases. Available PHR system incorporates basic recommendations based on patient routine data. We have proposed decision support service called "Smart CDSS" that provides recommendations on PHR data for diabetic patients. Smart CDSS follows HL7 vMR (Virtual Medical Record) to help in integration with diverse application including PHR. PHR shares patient data with Smart CDSS through standard interfaces that pass through Adaptability Engine (AE). AE transforms the PHR CCR/CCD (Continuity of Care Record/Document) into standard HL7 vMR format. Smart CDSS produces recommendation on PHR datasets based on diabetic knowledge base represented in shareable HL7 Arden Syntax format. The Smart CDSS service is deployed on public cloud over MS Azure environment and PHR is maintaining on private cloud. The system has been evaluated for recommendation for 100 diabetic patients from Saint's Mary Hospital. The recommendations were compared with physicians' guidelines which complement the self-management of the patient.

AURKB, in concert with REST, acts as an oxygen-sensitive epigenetic regulator of the hypoxic induction of MDM2

  • Kim, Iljin;Choi, Sanga;Yoo, Seongkyeong;Lee, Mingyu;Park, Jong-Wan
    • BMB Reports
    • /
    • v.55 no.6
    • /
    • pp.287-292
    • /
    • 2022
  • The acute response to hypoxia is mainly driven by hypoxia-inducible factors, but their effects gradually subside with time. Hypoxia-specific histone modifications may be important for the stable maintenance of long-term adaptation to hypoxia. However, little is known about the molecular mechanisms underlying the dynamic alterations of histones under hypoxic conditions. We found that the phosphorylation of histone H3 at Ser-10 (H3S10) was noticeably attenuated after hypoxic challenge, which was mediated by the inhibition of aurora kinase B (AURKB). To understand the role of AURKB in epigenetic regulation, DNA microarray and transcription factor binding site analyses combined with proteomics analysis were performed. Under normoxia, phosphorylated AURKB, in concert with the repressor element-1 silencing transcription factor (REST), phosphorylates H3S10, which allows the AURKB-REST complex to access the MDM2 proto-oncogene. REST then acts as a transcriptional repressor of MDM2 and downregulates its expression. Under hypoxia, AURKB is dephosphorylated and the AURKB-REST complex fails to access MDM2, leading to the upregulation of its expression. In this study, we present a case of hypoxia-specific epigenetic regulation of the oxygen-sensitive AURKB signaling pathway. To better understand the cellular adaptation to hypoxia, it is worthwhile to further investigate the epigenetic regulation of genes under hypoxic conditions.

Analysis of Mobility Constraint Factors of Fire Engines in Vulnerable Areas : A Case Study of Difficult-to-access Areas in Seoul (화재대응 취약지역에서의 소방특수차량 이동제약요인 분석 : 서울시의 진입곤란지역을 대상으로)

  • Yeoreum Yoon;Taeeun Kim;Minji Choi;Sungjoo Hwang
    • Journal of the Korean Society of Safety
    • /
    • v.39 no.1
    • /
    • pp.62-69
    • /
    • 2024
  • Ensuring swift on-site access to fire engines is crucial in preserving the golden time and minimizing damage. However, various mobility constraints in alleyways hinder the timely entry of fire engines to the fire scene, significantly impairing their initial response capabilities. Therefore, this study analyzed the significant mobility constraints of fire engines, focusing on Seoul, which has many old town areas. By leveraging survey responses from firefighting experts and actual observations, this study quantitatively assessed the frequency and severity of mobility constraint factors affecting the disaster responses of fire engines. Survey results revealed a consistent set of top five factors regarding the frequency and disturbance level, including illegally parked cars, narrow paths, motorcycles, poles, and awnings/banners. A comparison with actual road-view images showed notable consistency between the survey and observational results regarding the appearance frequency of mobility constraint factors in vulnerable areas in Seoul. Furthermore, the study emphasized the importance of tailored management strategies for each mobility constraint factor, considering its characteristics, such as dynamic or static. The findings of this study can serve as foundational data for creating more detailed fire safety maps and advancing technologies that monitor the mobility of fire engines through efficient vision-based inference using CCTVs in the future.

Object-Size and Call-Site Tracing based Shared Memory Allocator for False Sharing Reduction in DSM Systems (분산 공유 메모리 시스템에서 거짓 공유를 줄이는 객체-크기 및 호출지-추적 기반 공유 메모리 할당 기법)

  • Lee, Jong-Woo;Park, Young-Ho;Yoon, Yong-Ik
    • Journal of Digital Contents Society
    • /
    • v.9 no.1
    • /
    • pp.77-86
    • /
    • 2008
  • False sharing is a result of co-location of unrelated data in the same unit of memory coherency, and is one source of unnecessary overhead being of no help to keep the memory coherency in multiprocessor systems. Moreover, the damage caused by false sharing becomes large in proportion to the granularity of memory coherency. To reduce false sharing in page-based DSM systems, it is necessary to allocate unrelated data objects that have different access patterns into the separate shared pages. In this paper we propose sized and call-site tracing-based shared memory allocator, shortly SCSTallocator. SCSTallocator places each data object requested from the different call-sites into the separate shared pages, and at the same time places each data object that has different size into different shared pages. Consequently data objects that have the different call-site and different object size prohibited from being allocated to the same shared page. Our observations show that our SCSTallocator outperforms the existing dynamic shared memory allocators. By combining the two existing allocation technique, we can reduce a considerable amount of false sharing misses.

  • PDF

Design of E-Document Management System Using Dynamic Group Key based on OOXML (OOXML기반의 동적 그룹키를 이용한 전자문서 관리 시스템의 설계)

  • Lee, Young-Gu;Kim, Hyun-Chul;Jung, Taik-Yeong;Jun, Moon-Seog
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1407-1417
    • /
    • 2009
  • We propose a e-document management system that can provide segmented page information on a document according to different levels of authority from access control environment. The proposed system creates hierarchy identifier using a one-way hash chain and therefore does not need to own key information for all users as in existing system. Also by creating group keys by compounding hash chain hierarchy identifier with randomly formed group identifier, the system can flexibly respond to dynamic changes from group member movements while at the same time resolving the problems of key formation and management in document encoding technique using symmetric key for each page. Lastly as a result of comparative analysis through an experiment with existing e-document management systems, the proposed system showed superiority in the efficiency of encoding and decoding document and the speed of encoding and decoding by the pages.

Dynamic Scheduling Method for Cooperative Resource Sharing in Mobile Cloud Computing Environments

  • Kwon, Kyunglag;Park, Hansaem;Jung, Sungwoo;Lee, Jeungmin;Chung, In-Jeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.484-503
    • /
    • 2016
  • Mobile cloud computing has recently become a new paradigm for the utilization of a variety of shared mobile resources via wireless network environments. However, due to the inherent characteristics of mobile devices, a limited battery life, and a network access requirement, it is necessary for mobile servers to provide a dynamic approach for managing mobile resources efficiently in mobile cloud computing environments. Since on-demand job requests occur frequently and the number of mobile devices is drastically increased in mobile cloud computing environments, a different mobile resource management method is required to maximize the computational power. In this paper, we therefore propose a cooperative, mobile resource sharing method that considers both the inherent properties and the number of mobile devices in mobile cloud environments. The proposed method is composed of four main components: mobile resource monitor, job handler, resource handler, and results consolidator. In contrast with conventional mobile cloud computing, each mobile device under the proposed method can be either a service consumer or a service provider in the cloud. Even though each device is resource-poor when a job is processed independently, the computational power is dramatically increased under the proposed method, as the devices cooperate simultaneously for a job. Therefore, the mobile computing power throughput is dynamically increased, while the computation time for a given job is reduced. We conduct case-based experiments to validate the proposed method, whereby the feasibility of the method for the purpose of cooperative computation is shown.

A Strong Authentication Scheme with User Privacy for Wireless Sensor Networks

  • Kumar, Pardeep;Gurtov, Andrei;Ylianttila, Mika;Lee, Sang-Gon;Lee, HoonJae
    • ETRI Journal
    • /
    • v.35 no.5
    • /
    • pp.889-899
    • /
    • 2013
  • Wireless sensor networks (WSNs) are used for many real-time applications. User authentication is an important security service for WSNs to ensure only legitimate users can access the sensor data within the network. In 2012, Yoo and others proposed a security-performance-balanced user authentication scheme for WSNs, which is an enhancement of existing schemes. In this paper, we show that Yoo and others' scheme has security flaws, and it is not efficient for real WSNs. In addition, this paper proposes a new strong authentication scheme with user privacy for WSNs. The proposed scheme not only achieves end-party mutual authentication (that is, between the user and the sensor node) but also establishes a dynamic session key. The proposed scheme preserves the security features of Yoo and others' scheme and other existing schemes and provides more practical security services. Additionally, the efficiency of the proposed scheme is more appropriate for real-world WSNs applications.

Automatic Parameter Tuning for Simulated Annealing based on Threading Technique and its Application to Traveling Salesman Problem

  • Fangyan Dong;Iyoda, Eduardo-Masato;Kewei Chen;Hajime Nobuhara;Kaoru Hirota
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.439-442
    • /
    • 2003
  • In order to solve the difficulties of parameter settings in SA algorithm, an improved practical SA algorithm is proposed by employing the threading techniques, appropriate software structures, and dynamic adjustments of temperature parameters. Threads provide a mechanism to realize a parallel processing under a disperse environment by controlling the flux of internal information of an application. Thread services divide a process by multiple processes leading to parallel processing of information to access common data. Therefore, efficient search is achieved by multiple search processes, different initial conditions, and automatic temperature adjustments. The proposed are methods are evaluated, for three types of Traveling Salesman Problem (TSP) (random-tour, fractal-tour, and TSPLIB test data)are used for the performance evaluation. The experimental results show that the computational time is 5% decreased comparing to conventional SA algorithm, furthermore there is no need for manual parameter settings. These results also demonstrate that the proposed method is applicable to real-world vehicle routing problems.

  • PDF

Performance Analysis of MIMO-OFDMA System Applying Dynamic Resource Allocation (동적 자원 할당 기법을 적용한 MIMO-OFDMA 시스템 성능 분석)

  • Lee, Yun-Ho;Kim, Kyung-Seok
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.6
    • /
    • pp.669-676
    • /
    • 2008
  • The adaptive resource optimization problem in multi-input multi-output orthogonal frequency division multiple access (MIMO-OFDMA) systems is addressed. This paper, adaptive modulation and coding(AMC) and power control algorithms is proposed with SFC(Space-Frequency Coding), which aims to maximize the system capacity based on the CQI(Channel Quality Information). Firstly, power level is decided to each sub-channels with received feedback signal to noise ratio(SNR). In the second step, sub-carriers are allocated according to modulation type. Simulation results show that the proposed algorithm achieves a better performance than conventional algorithm in terms of capacity.