• Title/Summary/Keyword: 기술트리 활용

Search Result 196, Processing Time 0.028 seconds

3D Object Selection Technique using Selection Tree Traversal (선택 트리 순회를 이용한 3D 객체선택 인터페이스)

  • 임윤호;한덕수;임순범;최윤철
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2002.05c
    • /
    • pp.540-545
    • /
    • 2002
  • 3D 그래픽스는 이제 전문가들만의 전유물이 아니다. 하드웨어 기술의 비약적인 발전으로 누구나 저렴한 가격으로 불과 몇 년전의 워크스테이션급 이상의 3D 그래픽스 환경을 갖출 수 있게 되었다. 그러나 3D 그래픽스 환경을 조작하기에 적합한 특수 장비는 여전히 일반 소비자가 사용 할 수 없을 정도의 고가이며 대중화는 요원한 실정이다. 따라서 일반적인 2D 기반의 입력장치를 활용한 데스크탑 가상현실에서의 효과적인 인터페이스의 연구가 필요하다. 사용자가 최초로 가상 환경내의 객체를 조작하기 위해서 취하는 행동은 선택이다. 그러나 일반적인 데스크탑 환경에서 3D 객체의 선택은 정확성이 떨어지며 오류의 정정도 번거롭다. 본 논문에서는 일반적인 마우스를 가지고 3D 가상환경의 객체를 정확하게 선택할 수 있도록 돕는 인터페이스를 제안한다. 시스템은 사용자가 선택한 객체와 관련된 선택 가능한 후보 객체들로 구성된 선택 트리를 제시하며, 선택 트리 내에서의 순회를 통해 사용자가 정확한 선택과 오류 정정을 하도록 돕는다.

  • PDF

Computed Tomography Technology (컴퓨터단층촬영(CT) 기술 동향)

  • Lee, J.W.;Lee, S.Y.;Yoo, D.H.
    • Electronics and Telecommunications Trends
    • /
    • v.25 no.4
    • /
    • pp.60-68
    • /
    • 2010
  • CT는 종래의 엑스선 촬영 기법으로 얻은 인체 내부의 투영 데이터를 컴퓨터로 재구성하여 단층영상을 만들어 내는 기술이다. 1972년 최초의 상용화 CT가 개발된 이후로 촬영 속도 개선의 측면에서 비약적인 발전을 이루었다. 겐트리 구동 방식의 발전과 Spiral CT, MDCT 기술의 도입이 스캔 시간 단축에 큰 역할을 하였다. 특히 MDCT의 개발로 다양한 임상적 활용이 가능해졌다. 한편 O-arm CT 기술은 CT를 공간적 제약에서 벗어나게 하였다. 이는 CT가 수술실 현장에서 활용될 수 있다는 임상적 의미를 가진다. O-arm CT는 즉석에서 활용되어야 하므로 촬영과 동시에 영상이 실시간으로 재구성되는 것도 중요하다. 최근에 도입되기 시작한 GPU 프로그래밍 기술은 고성능 GPU 하드웨어의 발전을 등에 업고 실시간 CT 재구성을 가능하게 할 것으로 보인다.

Models for Technology Evolution Path Creation Based on Citation Tree to Investigate Technology Opportunity Discovery (기술기회발굴을 위한 문서인용기반 기술진화 경로 생성 모형)

  • Lee, Jae-Min;Lee, Bangrae;Moon, Yeong-Ho;Kwon, Oh-Jin
    • Journal of Korea Technology Innovation Society
    • /
    • v.14 no.spc
    • /
    • pp.1152-1170
    • /
    • 2011
  • We selected core documents from enormous number of documents by analyzing citation relation of papers or patents including direct citation and indirect citation. Then we tried to creat the technology evolution path from citation network tree. By applying the method to the patent DB of OLED (Organic Light Emitting Diode), we obtained genealogical citation network of core patents of OLED. We analyzed how the one of OLED technology was transferred to the semiconductor related technology and we named the process of transition as 'technology evolution path' of OLED technology. And we also analyzed the genealogical citation network of papers on graphene. From the analysis, we found that the weight count method including indirect citation was better in evaluating the value of technology of a paper than the times cited method.

  • PDF

Solubility of Triclosan in Supercritical Carbon Dioxide and its Application to Micronization Process (초임계이산화탄소내 트리클로산의 용해도와 미세입자 제조공정의 응용)

  • Shin, Moon-Sam;Kim, Hwa-Yong
    • Clean Technology
    • /
    • v.14 no.3
    • /
    • pp.153-159
    • /
    • 2008
  • The solubility of triclosan, an anti-acne agent was measured in supercritical carbon dioxide ($scCO_2$) with a variable volume view cell at 313.15, 323.15, and 333.15 K and at pressures between 10 and 40 MPa. We successfully correlated triclosan solubility in $scCO_2$ using the quasi-chemical nonrandom lattice fluid (QLF) equation of state. Triclosan was micronized using the rapid expansion of supercritical solutions (RESS) process. The effects of temperature and pressure on particle size were investigated using phase behavior data and correlated results from the QLF model.

  • PDF

Improving Classification Accuracy in Hierarchical Trees via Greedy Node Expansion

  • Byungjin Lim;Jong Wook Kim
    • Journal of the Korea Society of Computer and Information
    • /
    • v.29 no.6
    • /
    • pp.113-120
    • /
    • 2024
  • With the advancement of information and communication technology, we can easily generate various forms of data in our daily lives. To efficiently manage such a large amount of data, systematic classification into categories is essential. For effective search and navigation, data is organized into a tree-like hierarchical structure known as a category tree, which is commonly seen in news websites and Wikipedia. As a result, various techniques have been proposed to classify large volumes of documents into the terminal nodes of category trees. However, document classification methods using category trees face a problem: as the height of the tree increases, the number of terminal nodes multiplies exponentially, which increases the probability of misclassification and ultimately leads to a reduction in classification accuracy. Therefore, in this paper, we propose a new node expansion-based classification algorithm that satisfies the classification accuracy required by the application, while enabling detailed categorization. The proposed method uses a greedy approach to prioritize the expansion of nodes with high classification accuracy, thereby maximizing the overall classification accuracy of the category tree. Experimental results on real data show that the proposed technique provides improved performance over naive methods.

Implementation of the Large-scale Data Signature System Using Hash Tree Replication Approach (해시 트리 기반의 대규모 데이터 서명 시스템 구현)

  • Park, Seung Kyu
    • Convergence Security Journal
    • /
    • v.18 no.1
    • /
    • pp.19-31
    • /
    • 2018
  • As the ICT technologies advance, the unprecedently large amount of digital data is created, transferred, stored, and utilized in every industry. With the data scale extension and the applying technologies advancement, the new services emerging from the use of large scale data make our living more convenient and useful. But the cybercrimes such as data forgery and/or change of data generation time are also increasing. For the data security against the cybercrimes, the technology for data integrity and the time verification are necessary. Today, public key based signature technology is the most commonly used. But a lot of costly system resources and the additional infra to manage the certificates and keys for using it make it impractical to use in the large-scale data environment. In this research, a new and far less system resources consuming signature technology for large scale data, based on the Hash Function and Merkle tree, is introduced. An improved method for processing the distributed hash trees is also suggested to mitigate the disruptions by server failures. The prototype system was implemented, and its performance was evaluated. The results show that the technology can be effectively used in a variety of areas like cloud computing, IoT, big data, fin-tech, etc., which produce a large-scale data.

  • PDF

A Study on Supplementary Features of Injection-Molded Parts Using TRIZ and Axiomatic Design (트리즈와 공리설계 기법에 의한 사출제품 부형상 설계)

  • Lee, Jae-Chul;Huh, Yong-Jeong
    • Proceedings of the KAIS Fall Conference
    • /
    • 2010.05b
    • /
    • pp.1145-1148
    • /
    • 2010
  • 우리 생활에서 큰 비중을 차지하고 있는 플라스틱은 그 사용 정도가 점점 증가하고 있는 추세이다. 그중에서도 플라스틱은 사출성형제품에서 가장 많이 사용한다. 사출성형의 제품은 높은 정밀도와 긴수명이 요구되며, 품질, 가격, 납기에 대해 사용자의 욕구를 충족시켜줄 수 있어야한다. 하지만 플라스틱은 열이나 하중 등 사용 환경에 따라 변하는 결점을 가지고 있으므로 일용잡화나 케이스류, 장식품 등의 일반적인 용도 이외에는 사용에 한계가 있다. 그러므로 설계자는 보다 과학적이고 합리적인 이론적 지식이 필요하다. 이에 사출성형 제품의 합리적인 설계를 위해 공리적 설계 기법을 이용하여 보다 좋은 설계를 수행하고 트리즈 기법을 활용함으로써 사출성형 제품의 문제들을 창의적으로 접근해봄으로써 문제 해결을 시도하려는 것이다.

  • PDF

Mining of Frequent Structures over Streaming XML Data (스트리밍 XML 데이터의 빈발 구조 마이닝)

  • Hwang, Jeong-Hee
    • The KIPS Transactions:PartD
    • /
    • v.15D no.1
    • /
    • pp.23-30
    • /
    • 2008
  • The basic research of context aware in ubiquitous environment is an internet technique and XML. The XML data of continuous stream type are popular in network application through the internet. And also there are researches related to query processing for streaming XML data. As a basic research to efficiently query, we propose not only a labeled ordered tree model representing the XML but also a mining method to extract frequent structures from streaming XML data. That is, XML data to continuously be input are modeled by a stream tree which is called by XFP_tree and we exactly extract the frequent structures from the XFP_tree of current window to mine recent data. The proposed method can be applied to the basis of the query processing and index method for XML stream data.

A Study on the Functional Analysis of Parking Lot Expansion Technology using Technology-Tree (기술트리를 이용한 주차장 확대 기술의 기능분석에 관한 연구)

  • Youn, Bohyung;Choi, Jaewook;Park, Sungpyo;Kim, Taewan;Lee, Chansik
    • Korean Journal of Construction Engineering and Management
    • /
    • v.20 no.3
    • /
    • pp.64-76
    • /
    • 2019
  • Aged apartments lack parking space and are suffering from severe parking difficulties due to the increase in the supply of private cars due to the economic improvement. Efficient remodeling technology is required as a way to solve the problem of a shortage of parking spaces, but there is a lack of establishing a technology for remodeling plans that can reflect the characteristics of various parks. This study was conducted to analyze the functions of the parking lot expansion technology using the technology tree and to derive the final technology through the function deployment. As a result of functional deployment of the plan to expand the parking lot, the fifth function was deployed and a total of 22 technologies were derived. Four types of technologies are categorized, four technologies for underground expansion, 12 technologies for underground and ground expansion, two technologies for ground expansion, and four technologies for ground-based expansion. As a result of the functional deployment of the main entrance plan, the fifth function was deployed and derived with 22 technologies. The total technologies were grouped into four categories, four technologies for direct underground entry, 11 technologies for indirect underground entry, three technologies for direct access to ground, and four technologies for indirect entry to ground. Through case verification, the detailed technologies applied to the semi-industrial complex of remodeling were identified and expert surveys and interviews were conducted to verify the adequacy of the technology tree.

TPKDB-tree : An Index Structure for Efficient Retrieval of Future Positions of Moving Objects (TPKDB 트리 : 이동 객체의 효과적인 미래 위치 검색을 위한 색인구조)

  • Seo Dong Min;Bok Kyoung Soo;Yoo Jae Soo;Lee Byoung Yup
    • Journal of KIISE:Databases
    • /
    • v.31 no.6
    • /
    • pp.624-640
    • /
    • 2004
  • Recently, with the rapid development of location-based techniques, index structures to efficiently manage moving objects have been required. In this paper, we propose a new spatio-temporal index structure that supports a future position retrieval and minimizes a update cost. The proposed index structure combines an assistant index structure that directly accesses current positions of moving objects with KDB-tree that is a space partitioning access method. The internal node in our proposed index structure keeps time parameters in order to support the future position retrieval and to minimize a update cost. Moreover, we propose new update and split methods to maximize the space utilization and the search performance. We perform various experiments to show that our proposed index structure outperforms the existing index structure.