• Title/Summary/Keyword: Data-centric

Search Result 465, Processing Time 0.028 seconds

Low-power Routing Algorithm using Routing History Cache for Wireless Sensor Network (RHC(Routing History Cache)를 사용한 저전력 소모 라우팅 알고리즘)

  • Lee, Doo-Wan;Jang, Kyung-Sik
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.11
    • /
    • pp.2441-2446
    • /
    • 2009
  • Wireless Sensor Network collects a data from the specific area and the control is composed of small sensor nodes. Like this sensors to after that is established at the beginning are operated with the battery, the operational duration until several years must be continued from several months and will be able to apply the resources which is restricted in efficiently there must be. In this paper RHC (rounting history cache) applies in Directed Diffusion which apply a data central concept a reliability and an efficiency in data transfer course set. RHC algorithms which proposes each sensor node updated RHC of oneself with periodic and because storing the optimization course the course and, every event occurrence hour they reset the energy is wasted the fact that a reliability with minimization of duplication message improved.

Evaluation of Alignment Methods for Genomic Analysis in HPC Environment (HPC 환경의 대용량 유전체 분석을 위한 염기서열정렬 성능평가)

  • Lim, Myungeun;Jung, Ho-Youl;Kim, Minho;Choi, Jae-Hun;Park, Soojun;Choi, Wan;Lee, Kyu-Chul
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.2
    • /
    • pp.107-112
    • /
    • 2013
  • With the progress of NGS technologies, large genome data have been exploded recently. To analyze such data effectively, the assistance of HPC technique is necessary. In this paper, we organized a genome analysis pipeline to call SNP from NGS data. To organize the pipeline efficiently under HPC environment, we analyzed the CPU utilization pattern of each pipeline steps. We found that sequence alignment is computing centric and suitable for parallelization. We also analyzed the performance of parallel open source alignment tools and found that alignment method utilizing many-core processor can improve the performance of genome analysis pipeline.

Wireless Sensor Networks have Applied the Routing History Cache Routing Algorithm (무선센서 네트워크에서 Routing History Cache를 이용한 라우팅 알고리즘)

  • Lee, Doo-Wan;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1018-1021
    • /
    • 2009
  • Wireless Sensor Network collects a data from the specific area and the control is composed of small sensor nodes. Like this sensors to after that is established at the beginning are operated with the battery, the operational duration until several years must be continued from several months and will be able to apply the resources which is restricted in efficiently there must be. In this paper RHC (rounting history cache) applies in Directed Diffusion which apply a data central concept a reliability and an efficiency in data transfer course set. RHC algorithms which proposes each sensor node updated RHC of oneself with periodic and because storing the optimization course the course and, every event occurrence hour they reset the energy is wasted the fact that a reliability with minimization of duplication message improved.

  • PDF

Radiation-Induced Chromosome Aberration in Human Peripheral Blood Lymphocytes In Vitro : RBE Study with Neutrons and $^{60}Co\;{\gamma}-rays$. (KCCH cyclotron neutron 및 $^{60}Co\;{\gamma}-ray$에 의한 인체 말초혈액 임파구의 염색체 이상측정)

  • Kim, Sung-Ho;Kim, Tae-Hwan;Chung, In-Yong;Cho, Chul-Koo;Koh, Kyoung-Hwan;Yoo, Seong-Yul
    • Journal of Radiation Protection and Research
    • /
    • v.17 no.1
    • /
    • pp.21-30
    • /
    • 1992
  • The frequencies of KCCH cyclotron neutron (30 cGy/min) or $^{60}Co\;{\gamma}-rays$ (210 cGy/min)-induced asymmetrical interchanges (dicentrics and centric rings) and acentric fragments (deletion) at several doses were measured in the normal human peripheral blood lymphocytes Chromosome aberrations were scored at the first nitosis after stimulation with phytohemagglutinin. The neutron and y-ray data were analysed on linear, power-law, quadratic and linear-quadratic model . When the dicentrics and centric rings of ${\gamma}-rays$ datas were pooled and fitted to these model, good fits were obtained to power-law $[Y=(5.81{\pm}1.96){\times}10^6D^{1.93+0.06},\; P=0.931]$, quadratic $[Y=(3.91{\pm}0.09){\times}10^{-6}D^2,\;P=0.972]$ an linear-Quadrati model $[Y=(6.55{\pm}6.83){\times}10^{-5}D+(3.72{\pm}0.22){\times}10^{-6}D^2\; P=0.922]$, except for linear model (P=0.067) As in the case of neutron data, the best fit was obtained to the linear model $(Y=(6.12{\pm}0.17){\times}10^{-3}\;D-0.22,\;P=0.987]$ and good fits were obtained to power-law$[Y=(5.36{\pm}3.02) {\times}10^{-4}D^{1.42+0.11},\; P=0.601]$ and linear-quadratic model$[Y=(2.43{\pm}0.70){\times}10^{-3}D+(1.21{\pm}0.39){\times}10^{-7}D^2$, \;P=0.415], except for quadratic model (P<0.005). The relative biological effectiveness (RBE) of neutron compared with y-ray was estimated by best fitting model. In the asymmetrical interchanges range between 0.1 and 1.5 per cell, the RBE was found to be $2.714{\pm}0.408$.

  • PDF

Analysis of the Global Data Law & Policy and its Implications: Focusing on the cases of the United States, the United Kingdom, and the European Union (국내외 데이터법·정책 분석 및 시사점: 미국, 영국, EU의 사례를 중심으로)

  • Yoon, Sang-Pil;Kwon, Hun-Yeong
    • Informatization Policy
    • /
    • v.28 no.2
    • /
    • pp.98-113
    • /
    • 2021
  • This study presents implications of the Global Data Law & Policy by comparing national data strategies, data regulations and policies, and governance in South Korea, the United States, the United Kingdom, and the European Union. According to the result of the comparative analysis, the biggest difference is in data governance, in other words, the management and coordination of policies at the pan-government level and data ethics. Therefore, this study proposes the establishment of a presidential special committee on data policy or the creation of a 'National Digital Innovation Office' at the Presidential Secretariat as a national CDO for the governance of data policies. Furthermore, this paper suggests a) to enact 'the Framework Act on the Development of Data Industry' that can regulate data practices in the private sector, b) to institutionalize the data-centric security and data protection, c) to settle the public ethics and personnel management based on data expertise and professional ethics, including explainability and responsibility, and d) the education and training systems.

Research on Exploring Novel Convergence Technologies Based on Advanced ICT via Technology Monitoring of Patents (특허정보 기반의 기술 모니터링을 통한 첨단 정보통신기술 기반 융합 신기술 탐색 연구)

  • Jin, Byoungsam;Bae, Youngchul
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.23 no.3
    • /
    • pp.453-461
    • /
    • 2020
  • In this study, we conducted technology monitoring to search for the current technology level and new technologies targeting the core technologies selected as "convergence technologies based on advanced ICT". This technology group, selected by the National Research Foundation(NRF) as one of the future-emerging technologies in 2018, consists of 'next-generation millimeter wave wireless communication technology', 'data-centric computing technology', and 'immersive media interface' that can be seen as important technologies in the fourth industrial revolution. It is possible to provide strategic research direction to the R&D-related stakeholders of countries or enterprises by providing information on newly emerged technologies through quantitative analysis based on patent data on these technologies. Therefore, in this study, we proposed a new technology for the convergence technologies based on advaned ICT group through patent data based on the newly emerged IPC code, and also suggested that it can suggest a strategic direction in planning R&D on related technologies.

Design of Network Protocols for Distributed Virtual Environments (분산 가상 환경을 위한 네트워크 프로토콜의 설계)

  • Ko, Dong-Il;Choi, Yang-Hee
    • Journal of KIISE:Information Networking
    • /
    • v.27 no.1
    • /
    • pp.1-11
    • /
    • 2000
  • Recently, the explosive popularity of Internet gave birth to researches on Distributed Virtual Environments(DVE). They aim at providing a shared application data environment at realtime for users participating in the same application session across Internet. As more users join the session, and as more multimedia data are shared, because of network resource limitation, it is more difficult to maintain the quality of DVE, such as users' satisfaction level. Previous works mainly tried to solve the scalability, synchronization and data transport issues at the application level, with limited success. We suggest a new network centric solution, that consists of a novel network architecture and protocols upon which any large-scale DVE application can be easily developed. The performance of the proposed scheme, called GAIA, is verified by simulation.

  • PDF

Inter-Cell Interference Management for Next-Generation Wireless Communication Systems

  • Kwon, Ho-Joong;Ko, Soo-Min;Seo, Han-Byul;Lee, Byeong-Gi
    • Journal of Communications and Networks
    • /
    • v.10 no.3
    • /
    • pp.258-267
    • /
    • 2008
  • In this paper, we examine what changes the next-generation wireless communication systems will experience in terms of the technologies, services, and networks and, based on that, we investigate how the inter-cell interference management should evolve in various aspects. We identify that the main driving forces of the future changes involve the data-centric services, new dynamic service scenarios, all-IP core access networks, new physical-layer technologies, and heavy upload traffic. We establish that in order to cope with the changes, the next-generation inter-cell interference management should evolve to 1) set the objective of providing a maximal data rate, 2) take the form of joint management of power allocation and user scheduling, 3) operate in a fully distributed manner, 4) handle the time-varying channel conditions in mobile environment, 5) deal with the changes in interference mechanism triggered by the new physical-layer technologies, and 6) increase the spectral efficiency while avoiding centralized coordination of resource allocation of the users in the uplink channel.

Research on Performance Improvement for Wireless CCN (무선 CCN을 위한 성능향상에 대한 연구)

  • Lee, Seung-Jin;Bae, Hong-Min;Kim, Byung-Seo
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.15 no.2
    • /
    • pp.71-76
    • /
    • 2015
  • To resolve inefficient content delivery mechanism in conventional internet-based networks, Content-Centric Networks (CCN) has been proposed for wired and wireless networks. One of issues in wireless CCN-based networks is overhead to achieve reliability on content delivery because CCN uses end-to-end two-way handshake with Interest/content packets. In this paper, a novel protocol to reduce overhead and achieve reliability is proposed. The protocol allows Interest packet to request multiple data packets and multiple data packets to be sent in a row without a Interest packets. The protocol is evaluated through the simulations and the performance improvement is proved.

A Prediction-based Energy-conserving Approximate Storage and Query Processing Schema in Object-Tracking Sensor Networks

  • Xie, Yi;Xiao, Weidong;Tang, Daquan;Tang, Jiuyang;Tang, Guoming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.5
    • /
    • pp.909-937
    • /
    • 2011
  • Energy efficiency is one of the most critical issues in the design of wireless sensor networks. In object-tracking sensor networks, the data storage and query processing should be energy-conserving by decreasing the message complexity. In this paper, a Prediction-based Energy-conserving Approximate StoragE schema (P-EASE) is proposed, which can reduce the query error of EASE by changing its approximate area and adopting predicting model without increasing the cost. In addition, focusing on reducing the unnecessary querying messages, P-EASE enables an optimal query algorithm to taking into consideration to query the proper storage node, i.e., the nearer storage node of the centric storage node and local storage node. The theoretical analysis illuminates the correctness and efficiency of the P-EASE. Simulation experiments are conducted under semi-random walk and random waypoint mobility. Compared to EASE, P-EASE performs better at the query error, message complexity, total energy consumption and hotspot energy consumption. Results have shown that P-EASE is more energy-conserving and has higher location precision than EASE.