• Title/Summary/Keyword: Attention network

Search Result 1,491, Processing Time 0.024 seconds

Interference Aware Cost Effective Coverage Extension in Multihop Relay Networks (다중홉 릴레이 시스템에서 간섭의 영향과 비용의 효과를 고려한 셀 커버리지 확장 방법에 관한 연구)

  • Kim, Yongchul;Lim, Won-Taek;Cho, Sung-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1138-1147
    • /
    • 2012
  • IEEE standard 802.16, often referred to as WiMAX, is considered a "last mile" broadband wireless access alternative to conventional DSL and Cable Internet. One extension that is recently receiving great attention is the IEEE 802.16j Mobile Multihop Relay (MMR) amendment. The focus of this amendment is the development of simple and lower cost relay stations (RSs) that can enhance network coverage and capacity. We use our proposed simple scheduling scheme for serving the SSs in a fair manner and evaluate the performance of WiMAX networks with relays, especially we analyze the impact of interference between RSs on cell throughput Through simulations and numerical analysis, we make several fundamental observations about interference aware cost effective coverage extension in such networks.

Mobility Management of M2M Devices with Grouping in the LTE System (LTE 시스템에서 그룹 기반 M2M 단말 이동성 관리)

  • Roh, Hee-Tae;Lee, Jang-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37B no.12
    • /
    • pp.1119-1127
    • /
    • 2012
  • The one of features of M2M communications, which are recently attracted attention as a future business of mobile communications, is that there is a large number of devices compared with traditional communication services. Hence, the control signal that are generated by the M2M devices may cause a significant congestion in the network and in order to solve this problem, a standardization is progressing for reducing the redundant signaling by managing M2M devices as a group in 3GPP standardization. In this paper, we propose a method of group based mobility management by managing M2M devices that have the same mobility as a group. In the proposed method, M2M devices that have the same mobility are grouped by the Mobility Management Entity (MME) and the MME elects a group header among the M2M devices in the group. Then, the group header performs the Tracking Area Update (TAU) on behalf of the group members to reduce the signaling overhead of mobility management. With the proposed method, we can achieve 80% decrease of the signaling overhead of mobility management compared with the case where each M2M device individually performs its TAU procedure.

A Seamless Multicast Scheme Supporting Global Mobility in Proxy Mobile IPv6 Networks (프록시 모바일 IPv6 네트워크에서 전역 이동을 지원하는 끊김 없는 멀티캐스트 기법)

  • Kim, Hwan-Gi;Kim, Jong-Min;Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38A no.3
    • /
    • pp.258-267
    • /
    • 2013
  • Recently, Proxy Mobile IPv6(PMIPv6) networks have been drawing attention as the mobility management protocol that uses limited wireless resources effectively. And the multicast, which is a core technology of the Internet broadcast system such as mobile IPTV, has been widely discussed mainly based on PMIPv6 network. However, PMIPv6-based multicast cannot support the global mobility directly between different PMIPv6 domains because PMIPv6 is basically designed for local mobility in single PMIPv6 domain. Moreover, PMIPv6-based multicast causes the disconnection of services because it does not solve the packet loss problem during binding and group joining procedure. In this paper, we propose a global mobility scheme that supports the seamless multicast service in PMIPv6 networks. The proposed scheme supports the global mobility due to the addition of extra signalling messages between LMAs. Also, it achieves low latency because it performs fast binding and group joining procedure. We present the simulation results which show that the proposed scheme achieves the global mobility with low latency through the NS-2 simulation.

A Study on a large-scale materials simulation using a PC networked cluster (PC Network Cluster를 사용한 대규모 재료 시뮬레이션에 관한 연구)

  • Choi, Deok-Kee;Ryu, Han-Kyu
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.30 no.5
    • /
    • pp.15-23
    • /
    • 2002
  • For molecular dynamics requires high-performance computers or supercomputers to handle huge amount of computation, it is not until recent days that the application of molecular dynamics to materials fracture simulations draw some attention from many researchers. With the recent advent of high-performance computers, computation intensive methods become more tractable than ever. However, carrying out materials simulation on high-performance computers costs too much in general. In this study, a PC cluster consisting of multiple commodity PCs is established and computer simulations of materials with cracks are carried out on it via molecular dynamics technique. The effect of the number of nodes, speedup factors, and communication time between nodes are measured to verify the performance of the PC cluster. Upon using the PC cluster, materials fracture simulations with more than 50,000 molecules are carried out successfully.

Web based 3-D Medical Image Visualization System on the PC (웹 기반 3차원 의료모델 시각화 시스템)

  • Kim, Nam-Kug;Lee, Dong-Hyuk;Kim, Jong-Hyo;Kang, Heung-Sik;Min, Byung-Goo;Kim, Young-Ho
    • Proceedings of the KOSOMBE Conference
    • /
    • v.1997 no.11
    • /
    • pp.201-205
    • /
    • 1997
  • With the recent advance of Web and its associated technologies, information sharing on distribute computing environments has gained a great amount of attention from many researchers in many application areas, such as medicine, engineering, and business. One basic requirement of distributed medical consultation systems is that geographically dispersed, disparate participants are allowed to exchange information readily with each other. Such software also needs to be supported on a broad range of computer platforms to increase the software's accessibility. In this paper, the development of world-wide-web based medical consultation system or radiology imaging is addressed to provide the platform independence and great accessibility. The system supports sharing of 3-dimensional objects. We use VRML (Virtual Reality Modeling Language), which is the de-facto standard in 3-D modeling on the Web. 3-D objects are reconstructed from CT or MRI volume data using a VRML format, which can be viewed and manipulated easily in Web-browsers with a VRML plug-in. A Marching cubes method is used in the transformation of scanned volume data set to polygonal surfaces of VRML. A decimation algorithm is adopted to reduce the number of meshes in the resulting VRML file. 3-D volume data are often very large-sized, and hence loading the data on PC level computers requires a significant reduction of the size of the data, while minimizing the loss of the original shape information. This is also important to decrease network delays. A prototype system has been implemented (http://netopia.snu.ac.kr/-cyber/). and several sessions of experiments are carried out.

  • PDF

Comprehensive proteome analysis using quantitative proteomic technologies

  • Kamal, Abu Hena Mostafa;Choi, Jong-Soon;Cho, Yong-Gu;Kim, Hong-Sig;Song, Beom-Heon;Lee, Chul-Won;Woo, Sun-Hee
    • Journal of Plant Biotechnology
    • /
    • v.37 no.2
    • /
    • pp.196-204
    • /
    • 2010
  • With the completion of genome sequencing of several organisms, attention has been focused to determine the function and functional network of proteins by proteome analysis. The recent techniques of proteomics have been advanced quickly so that the high-throughput and systematic analyses of cellular proteins are enabled in combination with bioinformatics tools. Furthermore, the development of proteomic techniques helps to elucidate the functions of proteins under stress or diseased condition, resulting in the discovery of biomarkers responsible for the biological stimuli. Ultimate goal of proteomics orients toward the entire proteome of life, subcellular localization, biochemical activities, and their regulation. Comprehensive analysis strategies of proteomics can be classified as three categories: (i) protein separation by 2-dimensional gel electrophoresis (2-DE) or liquid chromatography (LC), (ii) protein identification by either Edman sequencing or mass spectrometry (MS), and (iii) quanitation of proteome. Currently MS-based proteomics turns shiftly from qualitative proteome analysis by 2-DE or 2D-LC coupled with off-line matrix assisted laser desorption ionization (MALDI) and on-line electrospray ionization (ESI) MS, respectively, to quantitative proteome analysis. Some new techniques which include top-down mass spectrometry and tandem affinity purification have emerged. The in vitro quantitative proteomic techniques include differential gel electrophoresis with fluorescence dyes, protein-labeling tagging with isotope-coded affinity tag, and peptide-labeling tagging with isobaric tags for relative and absolute quantitation. In addition, stable isotope labeled amino acid can be in vivo labeled into live culture cells through metabolic incorporation. MS-based proteomics extends to detect the phosphopeptide mapping of biologically crucial protein known as one of post-translational modification. These complementary proteomic techniques contribute to not only the understanding of basic biological function but also the application to the applied sciences for industry.

Real-time Control System for Mobile Robots and Path Tracking Control Algorithm (이동로봇의 실시간 주행제어를 위한 제어시스템 설계 및 경로 추종제어 방법)

  • 고경철;조형석
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.17 no.6
    • /
    • pp.1497-1508
    • /
    • 1993
  • Real-time mobile robot controllers usually have been designed focused on control theory without paying attention to the importance of system integration. This paper demonstrates that autonomous mobile robots require a real-time controller with a wide range of capabilities in addition to control theory. An architectural frame work supporting these capabilities has been designed in actual hardware environments. Individual modules such as a path planner, a path tracking controller, position estimators, wheel controllers and other cruical elements have been successfully integrated into the control system using this frame work. The overall performance of the system was investigated via a series of tracking experiments with a prototype mobile robot named LCAR deveoped in the laboratory. The context of the research involves the architecture, its implementation and experimental results.

Bitcoin Price Forecasting Using Neural Decomposition and Deep Learning

  • Ramadhani, Adyan Marendra;Kim, Na Rang;Lee, Tai Hun;Ryu, Seung Eui
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.23 no.4
    • /
    • pp.81-92
    • /
    • 2018
  • Bitcoin is a cryptographic digital currency and has been given a significant amount of attention in literature since it was first introduced by Satoshi Nakamoto in 2009. It has become an outstanding digital currency with a current market capitalization of approximately $60 billion. By 2019, it is expected to have over 5 million users. Nowadays, investing in Bitcoin is popular, and along with the advantages and disadvantages of Bitcoin, learning how to forecast is important for investors in their decision-making so that they are able to anticipate problems and earn a profit. However, most investors are reluctant to invest in bitcoin because it often fluctuates and is unpredictable, which may cost a lot of money. In this paper, we focus on solving the Bitcoin forecasting prediction problem based on deep learning structures and neural decomposition. First, we propose a deep learning-based framework for the bitcoin forecasting problem with deep feed forward neural network. Forecasting is a time-dependent data type; thus, to extract the information from the data requires decomposition as the feature extraction technique. Based on the results of the experiment, the use of neural decomposition and deep neural networks allows for accurate predictions of around 89%.

Basic Studies on Development of Turn Penalty Functions in Signalized Intersections (신호교차로의 회전제약함수 개발을 위한 기초연구)

  • O, Sang-Jin;Kim, Tae-Yeong;Park, Byeong-Ho
    • Journal of Korean Society of Transportation
    • /
    • v.27 no.1
    • /
    • pp.157-167
    • /
    • 2009
  • This study deals with the turn penalty functions in the urban transportation demand forecasting. The objectives are to develop the penalty functions of left-turn traffic in the case of signalized intersections, and to analyze the applicability of the functions to the traffic assignment models. This is based on the background that the existing models can not effectively account for the delays of left-turn traffic which is bigger than that of through traffic. In pursuing the above, this study gives particular attention to developing the penalty functions based on the degrees of saturation by simulation results of Transyt-7F, and analyzing the applicability of the functions by the case study of Cheongju. The major findings are the followings. First, two penalty functions developed according to the degrees of saturation, are evaluated to be all statistically significant. Second, the results that the above functions apply to the Cheongju network, are analyzed to be converging, though the iteration numbers increase. Third, the link volumes forecasted by turn penalty functions are evaluated to be better fitted to the observed data than those by the existing models. Finally, the differences of traffic volumes assigned by two functions, which are exponential and divided forms, are analyzed to be very small.

Exploration of growth mechanism for layer controllable graphene on copper

  • Song, Woo-Seok;Kim, Yoo-Seok;Kim, Soo-Youn;Kim, Sung-Hwan;Jung, Dae-Sung;Jun, Woo-Sung;Jeon, Cheol-Ho;Park, Chong-Yun
    • Proceedings of the Korean Vacuum Society Conference
    • /
    • 2011.02a
    • /
    • pp.490-490
    • /
    • 2011
  • Graphene, hexagonal network of carbon atoms forming a one-atom thick planar sheet, has been emerged as a fascinating material for future nanoelectronics. Huge attention has been captured by its extraordinary electronic properties, such as bipolar conductance, half integer quantum Hall effect at room temperature, ballistic transport over ${\sim}0.4{\mu}m$ length and extremely high carrier mobility at room temperature. Several approaches have been developed to produce graphene, such as micromechanical cleavage of highly ordered pyrolytic graphite using adhesive tape, chemical reduction of exfoliated graphite oxide, epitaxial growth of graphene on SiC and single crystalline metal substrate, and chemical vapor deposition (CVD) synthesis. In particular, direct synthesis of graphene using metal catalytic substrate in CVD process provides a new way to large-scale production of graphene film for realization of graphene-based electronics. In this method, metal catalytic substrates including Ni and Cu have been used for CVD synthesis of graphene. There are two proposed mechanism of graphene synthesis: carbon diffusion and precipitation for graphene synthesized on Ni, and surface adsorption for graphene synthesized on Cu, namely, self-limiting growth mechanism, which can be divided by difference of carbon solubility of the metals. Here we present that large area, uniform, and layer controllable graphene synthesized on Cu catalytic substrate is achieved by acetylene-assisted CVD. The number of graphene layer can be simply controlled by adjusting acetylene injection time, verified by Raman spectroscopy. Structural features and full details of mechanism for the growth of layer controllable graphene on Cu were systematically explored by transmission electron microscopy, atomic force microscopy, and secondary ion mass spectroscopy.

  • PDF