• Title/Summary/Keyword: SET*

Search Result 38,053, Processing Time 0.05 seconds

A Three-Set Type Korean Keyboard Model, 38K, with High Compatibility to the KS Computer Keyboard

  • Kim, Kuk
    • Journal of the Ergonomics Society of Korea
    • /
    • v.33 no.5
    • /
    • pp.355-363
    • /
    • 2014
  • Objective:The purpose of this study is to design a three-set type (Sebulsik) keyboard that is to input Korean text with no shifted keys and also compatible with the standard Korean computer keyboard or ANSI keyboard. Background: The KS computer keyboard is two-set type (Dubulsik). Existing and proposed designs of three-set type of past studies are not compatible with KS or ANSI keyboard and are complex with many redundant letters. Method: The number of Korean letters for 3-set type is analyzed. Then Korean letters are arranged with normality and with spatial compatibility to the KS Korean keyboard, and symbols were arranged to same positions with ANSI keyboard. Results: Initial consonants of 14 numbers and 6 vowels are arranged as exactly same positions of KS keyboard, and other vowels are arranged with spatial compatibility. Symbols are arranged to the same positions with ANSI keyboard, and 10 digits are confirmed and has compatibility to International standard. Conclusion: A 38-key model, 38K, is designed to require minimal keys to input Korean text with no shifted keys, increased the compatibility to the KS Korean computer keyboard. Application: Using the proposed 38-key model, 38K, it can be taken into account for keyboards in industrial production. It is applicable to user group of 3-set type Korean keyboard with more easy than past keyboards.

Topology Optimization of Shell Structures Using Adaptive Inner-Front(AIF) Level Set Method (적응적 내부 경계를 갖는 레벨셋 방법을 이용한 쉘 구조물의 위상최적설계)

  • Park, Kang-Soo;Youn, Sung-Kie
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2007.04a
    • /
    • pp.157-162
    • /
    • 2007
  • A new level set based topology optimization employing inner-front creation algorithm is presented. In the conventional level set based topology optimization, the optimum topology strongly depends on the initial level set distribution due to the incapability of inner-front creation during optimization process. In the present work, in this regard, an inner-front creation algorithm is proposed. in which the sizes. shapes. positions, and number of new inner-fronts during the optimization process can be globally and consistently identified by considering both the value of a given criterion for inner-front creation and the occupied volume (area) of material domain. To facilitate the inner-front creation process, the inner-front creation map which corresponds to the discrete valued criterion of inner-front creation is applied to the level set function. In order to regularize the design domain during the optimization process, the edge smoothing is carried out by solving the edge smoothing partial differential equation (PDE). Updating the level set function during the optimization process, in the present work, the least-squares finite element method (LSFEM) is employed. As demonstrative examples for the flexibility and usefulness of the proposed method. the level set based topology optimization considering lightweight design of 3D shell structure is carried out.

  • PDF

An Analytical Study on the Optimal Set-point of the Hybrid Plant (복합열원설비 운전온도 최적 설정에 관한 해석적 연구)

  • Jeon, Jong-Ug;Lee, Sun-Il;Lee, Tae-Won;Kim, Yong-Ki;Hong, Dae-Hie;Kim, Yong-Chan
    • Proceedings of the SAREK Conference
    • /
    • 2007.11a
    • /
    • pp.352-357
    • /
    • 2007
  • The objective of this study is to find the optimal set-point of a hybrid Plant, which is combined by renewable energy plant of the GSHP(Ground Source Heat Pump) and the conventional plant(chiller, boiler). The work presented in this study was carried out by using the EnergyPlus(Version 2.0). In order to validate the simulation model, field data were measured from a building. The GSHP was used as a base plant and the conventional plant as the assistant plant. Various temperatures were controlled (zone summer set-point, zone winter set-point, chilled water temperature, hot water temperature) to find the optimal set-point temperature of the system. The influence of the various set-points were analyzed seasonally.

  • PDF

A control system of each product with a remote controller for Multi-vision which is composed of several products (Multi-Vision으로 구성된 제품들의 리모컨을 통한 개별 제어 시스템)

  • Bae, Sang-Ho;Kim, Young-Kil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2011.10a
    • /
    • pp.149-152
    • /
    • 2011
  • A Multi-Vision needs an image adjust of each product to make the same picture quality for all products when it's installed. Owing to this reason need individual control. This document request indivisual control method for each product with the Remote controller. To realize this method need make Set ID and Picture ID on the UI and need daisy chain of cable to connect Remocon code(IR Signal) In to Out, After allocation the Set ID for each product. Picture ID of the product which want to change picture quality make equal to Set ID. And the product which is same Set ID and Picture ID is only controlled through decoding of Remocon code to Scaler.

  • PDF

Creating Level Set Trees Using One-Class Support Vector Machines (One-Class 서포트 벡터 머신을 이용한 레벨 셋 트리 생성)

  • Lee, Gyemin
    • Journal of KIISE
    • /
    • v.42 no.1
    • /
    • pp.86-92
    • /
    • 2015
  • A level set tree provides a useful representation of a multidimensional density function. Visualizing the data structure as a tree offers many advantages for data analysis and clustering. In this paper, we present a level set tree estimation algorithm for use with a set of data points. The proposed algorithm creates a level set tree from a family of level sets estimated over a whole range of levels from zero to infinity. Instead of estimating density function then thresholding, we directly estimate the density level sets using one-class support vector machines (OC-SVMs). The level set estimation is facilitated by the OC-SVM solution path algorithm. We demonstrate the proposed level set tree algorithm on benchmark data sets.

Managing Data Set in Administrative Information Systems as Records (행정정보 데이터세트의 기록관리 방안)

  • Oh, Seh-La;Rieh, Hae-young
    • Journal of Korean Society of Archives and Records Management
    • /
    • v.19 no.2
    • /
    • pp.51-76
    • /
    • 2019
  • Records management professionals and scholars have emphasized the necessity of managing data set in administrative information systems as records, but it has not been practiced in the actual field. Applying paper-based records management standards and guidelines to data set management proved to be a difficult task because of technology-dependent characteristics, vast scale, and various operating environments. Therefore, the data set requires a management system that can accommodate the inherent characteristics of records and can be practically applied. This study developed and presented data set management methods and procedures based on the analysis of data set in public administrative information systems operating in public institutions.

SECURE DOMINATION PARAMETERS OF HALIN GRAPH WITH PERFECT K-ARY TREE

  • R. ARASU;N. PARVATHI
    • Journal of applied mathematics & informatics
    • /
    • v.41 no.4
    • /
    • pp.839-848
    • /
    • 2023
  • Let G be a simple undirected graph. A planar graph known as a Halin graph(HG) is characterised by having three connected and pendent vertices of a tree that are connected by an outer cycle. A subset S of V is said to be a dominating set of the graph G if each vertex u that is part of V is dominated by at least one element v that is a part of S. The domination number of a graph is denoted by the γ(G), and it corresponds to the minimum size of a dominating set. A dominating set S is called a secure dominating set if for each v ∈ V\S there exists u ∈ S such that v is adjacent to u and S1 = (S\{v}) ∪ {u} is a dominating set. The minimum cardinality of a secure dominating set of G is equal to the secure domination number γs(G). In this article we found the secure domination number of Halin graph(HG) with perfet k-ary tree and also we determined secure domination of rooted product of special trees.

Level Set Method Applied on Pseudo-compressibility Method for the Analysis of Two-phase Flow (Pseudo-compressibility 방법에서 이상유동 해석을 위한 Level Set방법의 적용)

  • Ihm Seung-Won;Kim Chongam;Shim Jae-Seol;Lee Dong-Young
    • Journal of Korean Society of Coastal and Ocean Engineers
    • /
    • v.17 no.3
    • /
    • pp.158-165
    • /
    • 2005
  • In order to analyze incompressible two-phase flow, Level Set method was applied on pseudo-compressibility formulation. Level Set function is defined as a signed distance function from the phase interface, and gives the information of the each phase location and the geometric data to the flow. In this study, Level Set function transport equation was coupled with flow conservation equations, and owing to pseudo-compressibility technique we could solve the resultant vector equation iteratively. Two-phase flow analysis code was developed on general curvilinear coordinate, and numerical tests of bubble dynamics and surging wave problems demonstrate its capability successfully.

A Study on the Optimal Urban Bus Network Design Using the Set Covering Theory (Set Covering 이론을 이용한 시내버스 최적노선망 구축에 관한 연구)

  • 이승재;최재성;백혜선
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.2
    • /
    • pp.137-147
    • /
    • 1999
  • This paper studies on the optimal bus network design in the framework of the set covering theory. The theory enables to cover passenger's loading and alighting areas as the set, and maximize the covering set as much as possible. In other words, it calculates the minimal set of the bus routes for covering whole bus passengers demand. After the optimal set of the bus routes is generated by the set covering theory, multimodal traffic equilibrium assignment is used for evaluating the generated set in terms of passenger's mode and route choice behavior. Whilst most previous works on it have been based on analyzing a specific route in a limited area, this study seeks to optimize the whole bus network.

  • PDF

Association of a miR-502-Binding Site Single Nucleotide Polymorphism in the 3'-Untranslated Region of SET8 and the TP53 Codon 72 Polymorphism with Cervical Cancer in the Chinese Population

  • Yang, Shao-Di;Cai, Yan-Lin;Jiang, Pei;Li, Wen;Tang, Jian-Xin
    • Asian Pacific Journal of Cancer Prevention
    • /
    • v.15 no.16
    • /
    • pp.6505-6510
    • /
    • 2014
  • Objective: This study was conducted to identify whether polymorphic variants of set domain-containing protein 8 (SET8) and tumor protein p53 (TP53) codon 72, either independently or jointly, might be associated with increased risk for cervical cancer. Methods: We genotyped SET8 and TP53 codon 72 polymorphisms of peripheral blood DNA from 114 cervical cancer patients and 200 controls using the polymerase chain reaction-restriction fragment length polymorphism (PCR-RFLP) and direct DNA sequencing. Results: The frequency of SET8 CC (odds ratios (OR) = 2.717, 95% CI=1.436-5.141) or TP53 GG (OR=2.168, 95% CI=1.149-4.089) genotype was associated with an increased risk of cervical cancer on comparison with the SET8 TT or TP53 CC genotypes, respectively. In additional, interaction between the SET8 and TP53 polymorphisms increased the risk of cervical cancer in a synergistic manner, with the OR being 9.913 (95% CI=2.028-48.459) for subjects carrying both SET8 CC and TP53 GG genotypes. Conclusion: These data suggest that there are significant associations between the miR-502-binding site SNP in the 3'-UTR of SET8 and the TP53 codon 72 polymorphism with cervical cancer in Chinese, and there is a gene-gene interaction.