• Title/Summary/Keyword: information expression

Search Result 3,009, Processing Time 0.033 seconds

Sum-Rate Performance of A NOMA-based Two-Way Relay Approach for A Two-User Cellular Network

  • Li, Guosheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.5
    • /
    • pp.1944-1956
    • /
    • 2021
  • This paper considers a cellular two-way relay network with one base station (BS), one relay station (RS), and two users. The two users are far from the BS and no direct links exist, and the two users exchange messages with the BS via the RS. A non-orthogonal multiple access (NOMA) and network coding (NC)-based decode-and-forward (DF) two-way relaying (TWR) scheme TWR-NOMA-NC is proposed, which is able to reduce the number of channel-uses to three from four in conventional time-division multiple access (TDMA) based TWR approaches. The achievable sum-rate performance of the proposed approach is analyzed, and a closed-form expression for the sum-rate upper bound is derived. Numerical results show that the analytical sum-rate upper bound is tight, and the proposed TWR-NOMA-NC scheme significantly outperforms the TDMA-based TWR and NOMA-based one-way relaying counterparts.

Strategies for Activating BIM-data Sharing in Construction - Based on cases of defining practical data and a survey of practitioners - (건설분야 BIM 데이터 공유 활성화 전략 - 건설 실무분야의 데이터 연계방법과 실무자 설문을 기반으로-)

  • Kim, Do-Young;Lee, Sung-Woo;Nam, Ju-Hyun;Kim, Bum-Soo;Kim, Sung-Jin
    • Journal of KIBIM
    • /
    • v.12 no.1
    • /
    • pp.72-80
    • /
    • 2022
  • It has become mandatory to designs by BIM in construction. It is urgent to make accurate decisions through the linkage between complex and various types of data in projects. In particular, block-chain based data sharing process (using BIM files, general construction submitted files) is essential to support reliable decision making in complex data flood systems. Prior to developing data sharing system based on block-chain, in this paper, a data linkage method is proposed so that practitioners can simultaneously utilize existing construction information and BIM data. Examples are shown based on the construction classification system and file expression, and incentive strategies are explored through a survey so that heterogeneous information can be used at the same time in overall projects.

Hangul Font Outline Vector Modification Algorithm According to Weather Information (날씨에 따른 한글 폰트 윤곽선 벡터 변형 알고리즘)

  • Park, Dong-Yeon;Jo, Se-Ran;Kim, Nam-Hee;Lim, Soon-Bum
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.9
    • /
    • pp.1328-1337
    • /
    • 2022
  • Recently, research on various font designs has been actively conducted to deliver effective emotional information in a digital environment. In this study, we propose a Hangul font outline vector modification algorithm that effectively conveys sensitivity according to weather information and can be transformed immediately. The algorithm performs a series of transformations: sets outlines according to design pattern templates, calculates the glyph's position to reflect physical rules, splits outline segments into smaller sizes and deforms the outlines. Through this, we could create several vector font designs such as humidity, cloud, wind, and snow. The usability evaluation was close to good, so it can be used in diverse ways if we improve readability and effective design expression.

ASM based The Lip Line Dectection System for The Smile Expression Recognition (웃음 표정 인식을 위한 ASM 기반 입술 라인 검출 시스템)

  • Hong, Won-Chang;Park, Jin-Woong;He, Guan-Feng;Kang, Sun-Kyung;Jung, Sung-Tae
    • Annual Conference of KIPS
    • /
    • 2011.04a
    • /
    • pp.444-446
    • /
    • 2011
  • 본 논문은 실시간으로 카메라 영상으로부터 얼굴의 각 특징점을 검출하고, 검출된 특징점을 이용하여 웃음 표정을 인식하는 시스템을 제안한다. 제안된 시스템은 ASM(Active Shape Model)을 이용하여 실시간 검출부에서 얼굴 영상을 획득한 다음 ASM 학습부에서 학습된 결과를 가지고 얼굴의 특징을 찾는다. 얼굴 특징의 영상으로부터 입술 영역을 검출한다. 이렇게 검출된 입술 영역과 얼굴 특징점을 이용하여 사용자의 웃음 표정을 검출하고 인식하는 방법을 사용함으로써 웃음 표정 인식의 정확도를 높힐 수 있음을 알 수 있었다.

Multi-Class Classification Model Using Gene Expression Data Clustering (유전자 발현량 데이터의 클러스터링을 이용한 다중 클래스 분류 모델)

  • Kim, Hyun Jin;Ahn, Jaegyoon;Park, Chihyun;Yoon, Youngmi;Park, Sanghyun
    • Annual Conference of KIPS
    • /
    • 2011.11a
    • /
    • pp.1240-1242
    • /
    • 2011
  • 본 논문에서는 여러 개의 클래스가 존재할 때, 각 클래스 내에서 샘플들을 클러스터링하고 서로 다른 클래스들과 분산도를 비교하여 클러스터가 가장 겹치지 않는 유전자 쌍들을 찾는다. 각 유전자 쌍에서 테스트 샘플과 가장 가까운 클러스터를 찾음으로써 클래스를 분류하고, 최종적으로 과반수 의결(Majority vote)하여 가장 많이 분류된 클래스를 최종 클래스로 확정한다. 그 결과, 해당 모델이 여러 개의 클래스를 가진 데이터에서 다른 비교 알고리즘의 모델들보다 높은 정확도를 나타내었다.

GAN-based avatar's detail control technique (GAN기반 아바타의 detail 조절 기법)

  • Shin, Kwang-Seong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.392-393
    • /
    • 2022
  • In relation to the creation of an avatar that will become the main character in the metaverse environment, we design a system that automatically determines the shape of the avatar according to the situation and location by adjusting the details between immersion and privacy. In this study, as a way to control immersion in various virtual environments of the metaverse environment, we derive the hypothesis that immersion is determined by how detailed the original object is expressed. We conduct research that can adaptively control the expression information of avatars.

  • PDF

Business Models for Access Control and Copyrights Expression of Software Source Code (소프트웨어 소스코드의 저작권 표현과 접근제한을 위한 비즈니스 모델)

  • Cha, Byung-Rae;Kim, Kyung-Jun;Lee, Dong-Seob;Kim, Chul-Won
    • Annual Conference of KIPS
    • /
    • 2008.05a
    • /
    • pp.1163-1166
    • /
    • 2008
  • 소프트웨어 소스코드는 크게 오픈 소스와 상업용 비공개 소스로 구분될 수 있다. 소스코드는 자동차 조립라인과 같이 소프트웨어를 무제한 생산이 가능한 지식집약적인 부가가치 산업이다. 본 논문에서는 오픈-소스 코드에는 디지털라이센스를 이용한 저작권을 표현하고, 비공개-소스 코드는 보안 컨테이너 역할을 수행하는 크립텍스 모델을 제안한다.

Static Type Assignment for SSA Form in CTOC

  • Kim, Ki-Tae;Yoo, Weon-Hee
    • Journal of Information Processing Systems
    • /
    • v.3 no.1
    • /
    • pp.26-32
    • /
    • 2007
  • Although the Java bytecode has numerous advantages, it also has certain shortcomings such as its slow execution speed and difficulty of analysis. In order to overcome such disadvantages, a bytecode analysis and optimization must be performed. The control flow of the bytecode should be analyzed; next, information is required regarding where the variables are defined and used to conduct a dataflow analysis and optimization. There may be cases where variables with an identical name contain different values at different locations during execution, according to the value assigned to a given variable in each location. Therefore, in order to statically determine the value and type, the variables must be separated according to allocation. In order to achieve this, variables can be expressed using a static single assignment form. After transformation into a static single assignment form, the type information of each node expressed by each variable and expression must be configured to perform a static analysis and optimization. Based on the basic type information, this paper proposes a method for finding the related equivalent nodes, setting nodes with strong connection components, and efficiently assigning each node type.

A Study on Visualization of Urban Landscape Information Using 3D-GIS Topological Relationship (3D-GIS 위상관계를 활용한 도시경관정보 가시화 방안 연구)

  • Jang, Mun-Hyun
    • Spatial Information Research
    • /
    • v.15 no.1
    • /
    • pp.35-52
    • /
    • 2007
  • Three-dimensional GIS, which provides spatial information through expression techniques of virtual reality close to the real world and the web, is one of the fields that attract a new attention. In particular, Open GIS Consortium(OGC) announced a topological relationship specification of spatial object which supports interoperability while interest in interoperability of spatial data is increasing. However, this specification is limited to two-dimensional spatial object. So this research established a topological relationship of three-dimensional spatial object in order to improve urban landscape and provide a foundation to use GIS. Based on this, this study proposes ways to visualize landscape information which is appropriate for new town's circumstances. It can be concluded that this research has a bigger meaning since it established a base of sharing information about realistic urban landscape that can be accessed regardless of place and time.

  • PDF

Acceleration of Building Thesaurus in Fuzzy Information Retrieval Using Relational products

  • Kim, Chang-Min;Kim, Young-Gi
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.240-245
    • /
    • 1998
  • Fuzzy information retrieval which uses the concept of fuzzy relation is able to retrieve documents in the way based on not morphology but semantics, dissimilar to traditional information retrieval theories. Fuzzy information retrieval logically consists of three sets : the set of documents, the set of terms and the set of queries. It maintains a fuzzy relational matrix which describes the relationship between documents and terms and creates a thesaurus with fuzzy relational product. It also provides the user with documents which are relevant to his query. However, there are some problems on building a thesaurus with fuzzy relational product such that it has big time complexity and it uses fuzzy values to be processed with flating-point. Actually, fuzzy values have to be expressed and processed with floating-point. However, floating-point operations have complex logics and make the system be slow. If it is possible to exchange fuzzy values with binary values, we could expect sp eding up building the thesaurus. In addition, binary value expressions require just a bit of memory space, but floating -point expression needs couple of bytes. In this study, we suggest a new method of building a thesaurus, which accelerates the operation of the system by pre-applying an ${\alpha}$-cut. The experiments show the improvement of performance and reliability of the system.

  • PDF