• Title/Summary/Keyword: 규칙 선택

Search Result 485, Processing Time 0.024 seconds

A Study of Gameplay based on Affordance (행동유도성 기반의 게임플레이에 관한 연구)

  • Song, Seung-Keun
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2013.05a
    • /
    • pp.170-171
    • /
    • 2013
  • In aspect of HCI(Human Computer Interaction) gameplay is the procedure to solve the problem that gamers encounter in order to generate or discover a new rule to achieve gamers' goal. The goal of this research is to investigate the structure and understand the gameplay in aspect of affordance from ecological psychology rather than the traditional problem solving theory. This research selects 'World of Warcraft' as MMORPG(Massively Multiplayer Online Role Playing Game). Five expert gamers participated in this experiment. We record all gameplay using audio and video device. We conducted protocol analysis as qualitative method based on the verbal report and action protocol during game playing. As result, gameplay based on affordance includes selection and relation. We found that subjects selected one thing at once with attention. Moreover, we found that there were two behaviors : exploratory action and performatory action. We believe that learning, utilization, and transformation for affordance appear. The result of this research imply to suggest design guideline for game design methodology when designers develop game.

  • PDF

Competitive Algorithm of Set Cover Problem Using Inclusion-Exclusion Principle (포함-배제 원리를 적용한 집합피복 문제의 경쟁 알고리즘)

  • Sang-Un Lee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.4
    • /
    • pp.165-170
    • /
    • 2023
  • This paper proposes an algorithm that can obtain a solution with linear time for a set cover problem(SCP) in which there is no polynomial time algorithm as an NP-complete problem so far. Until now, only heuristic greed algorithms are known to select sets that can be covered to the maximum. On the other hand, the proposed algorithm is a competitive algorithm that applies an inclusion-exclusion principle rule to N nodes up to 2nd or 3rd in the maximum number of elements to obtain a set covering all k nodes, and selects the minimum cover set among them. The proposed algorithm compensated for the disadvantage that the greedy algorithm does not obtain the optimal solution. As a result of applying the proposed algorithm to various application cases, an optimal solution was obtained with a polynomial time of O(kn2).

A Study on Data Requirements and Quality Verification for Legal Deposit and Acquisition Tasks of Domestic Electronic Publications (국내 유통 전자출판물의 납본 및 수집을 위한 데이터 요구사항 및 품질 검증 연구)

  • Gyuhwan Kim;Soojung Kim;Daekeun Jeong
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.35 no.1
    • /
    • pp.127-148
    • /
    • 2024
  • This study aimed to propose considerations for attributes and their standardization strategies during the data collection process for electronic publications by domestic distributors for the National Library of Korea. The research identified a total of 21 essential and optional attributes based on a survey and a Focused Group Interview (FGI) with the staff responsible for legal deposit and acquisition tasks at the National Library of Korea. Additional attributes were found necessary during the data quality verification process, leading to the specification of essential and optional attributes for various types of materials, including eBooks, audiobooks, webtoons, and web novels. The standardization of attribute values, essential for enhancing the identifiability and management efficiency of electronic publications, included adherence to ISO 8601 rules for dates and times, clear designation of limited-range attribute values such as file format and adult content, and detailed description of information related to titles. Furthermore, the study highlighted the need for establishing standardized metadata requirements and continuous data quality management and monitoring systems.

Adaptive Data Hiding Techniques for Secure Communication of Images (영상 보안통신을 위한 적응적인 데이터 은닉 기술)

  • 서영호;김수민;김동욱
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.5C
    • /
    • pp.664-672
    • /
    • 2004
  • Widespread popularity of wireless data communication devices, coupled with the availability of higher bandwidths, has led to an increased user demand for content-rich media such as images and videos. Since such content often tends to be private, sensitive, or paid for, there exists a requirement for securing such communication. However, solutions that rely only on traditional compute-intensive security mechanisms are unsuitable for resource-constrained wireless and embedded devices. In this paper, we propose a selective partial image encryption scheme for image data hiding , which enables highly efficient secure communication of image data to and from resource constrained wireless devices. The encryption scheme is invoked during the image compression process, with the encryption being performed between the quantizer and the entropy coder stages. Three data selection schemes are proposed: subband selection, data bit selection and random selection. We show that these schemes make secure communication of images feasible for constrained embed-ded devices. In addition we demonstrate how these schemes can be dynamically configured to trade-off the amount of ded devices. In addition we demonstrate how these schemes can be dynamically configured to trade-off the amount of data hiding achieved with the computation requirements imposed on the wireless devices. Experiments conducted on over 500 test images reveal that, by using our techniques, the fraction of data to be encrypted with our scheme varies between 0.0244% and 0.39% of the original image size. The peak signal to noise ratios (PSNR) of the encrypted image were observed to vary between about 9.5㏈ to 7.5㏈. In addition, visual test indicate that our schemes are capable of providing a high degree of data hiding with much lower computational costs.

XED: Model-based XML Editor Generator for Data-Centric XML Documents (XED: 데이타 중심 XML문서를 위한 모델 기반의 XML 편집기 생성 도구)

  • 최종명;유재우
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.10
    • /
    • pp.894-903
    • /
    • 2003
  • Though XML is widely used, it is still hard for end users to write XML documents. A lot of XML documents are data-centric documents which have formal data format. Even novices can easily write the data-centric XML documents if they use form-based GUIs. In this paper, we introduce a new method for generating form-based XML editor for data-centric XML documents automatically and an XML editor generator called XED. The DTD consists of sequence, choice, and repetition, and this structure can be represented with Document Decomposition Graph(DDG). XED allows users to generate an XML editor by applying the presentation rules to DDG. It also permits users to modify generated editor through changing editor`s GUI properties with direct manipulation.

A Study on the Bylaw Model of Public Libraries in Korea (국내 공공도서관 조례의 통합모형 연구 - 6대 도시 광역자치단체를 중심으로 -)

  • Kweon Kie-Won;Yoon Hee-Yoon
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.31 no.4
    • /
    • pp.113-137
    • /
    • 1997
  • Bylaw Is essential to assuring continuity and preventing disagreements and misunderstanding. But library bylaws of the wide-area self-governing cities in Korea are complicated In structure and violated the law according to administrative authorities. Therefore, the purpose of this paper is to suggest an integrated bylaw model including goal of bylaw operations of library : the library director officers : branch libraries : substructure, use rules : assigned materials promotion committee of library promotion fund ; amendment procedures, etc.

  • PDF

Study on Surface Enhanced Raman Scattering of Indigo Carmine (lndigo Carmine의 표면증강라만스펙트럼에 관한 연구)

  • Lee, Chul Jae
    • The Journal of the Convergence on Culture Technology
    • /
    • v.4 no.2
    • /
    • pp.155-160
    • /
    • 2018
  • In this study, the experiments for surface enhancement of silver mirror substrates were done, where we checked the characteristics of silver surface made by Tollen's and ${\gamma}$- irradiation method. The surface enhancement of Indigo carmine was analyzed by silver mirror and silver sol surfaces. The assignments of the vibrational bands shown in SERS spectra are given based on both literature and the semi-empirical calculations at the PM3 methods. We deduced that the adsorption orientation of Indigo carmine was little tilted perpendicular to the silver surfaces by using of the surface selection rules.

FromTo/KE: A Korean-English Machine Translation (에서로/KE:한영 기계 번역 시스템)

  • Yuh, Sang-Hwa;Kim, Young-Kil;Choi, Sung-Kwon;Kim, Tae-Wan;Park, Dong-In;Seo, Jung-Yun
    • Annual Conference on Human and Language Technology
    • /
    • 1997.10a
    • /
    • pp.283-287
    • /
    • 1997
  • 본 논문에서는 당 연구소 주관으로 연구개발정보센터(KORDIC), 서울대와 공동으로 개발중인 한영 기계번역 시스템, '에서로/KE'의 prototype system을 설명한다. 에서로/KE는 KORDIC에서 한국어 형태소 분석기와 Tagger를 개발하고, 서울대에서 한국어 구문해석기와 한영 변환기를 개발하고, SERI에서 영어 구문 생성기와 영어 형태소 생성기를 개발한다. 한국어 Tagger는 HMM에 기반하여 제작되었으며 sample 200문장에 대해 98.9%의 정확률을 보인다. 한국어 구문 해석기는 의존 문법에 기반하여 CYK 알고리즘을 사용하여 제작되었으며 중의성 해결을 위해 29개의 최적 parse 선택 규칙이 구현되어 있다. 한영 변환기는 collocation과 idiom에 기반하여 한영 변환을 수행한다. 영어 구문 생성기는 Tree 변환 언어인 GWL(Grammar Writing Language)를 사용하여 작성되었으며, 영어 형태소 생성기는 최종적으로 자연스러운 영어 표층문을 생성한다. 에서로/KE는 현재 1차년도 Prototype system이 Unix 환경에서 구현되어 있으며, 현재 각 모듈별 성능 개선과 대량 사전 구축을 통해 상용화될 예정이다.

  • PDF

Translation of Auxiliary Verbs "-reru,-rareru" in Japanese-Korean Machine Translation (일한 기계번역에서 조동사 "-reru, -rareru"의 번역처리)

  • Kim, Jung-In;Moon, Kyong-Hi;Lee, Jong-Hyeok;Lee, Geun-Bae
    • Annual Conference on Human and Language Technology
    • /
    • 1997.10a
    • /
    • pp.261-268
    • /
    • 1997
  • 일본어에서 조동사 "-reru, -rareru"는 '피동', '가능', '자발', '존경' 등의 의미로 두루 쓰이고 있다. 일한 번역에서 이들은 여러 가지 대역어로 나타나며 일정한 규칙이나 패턴을 취하지 않으므로, 기계 번역시 조동사 "-reru, -rareru"는 그 처리가 쉽지 않다. 더구나, 조동사 "-reru, -rareru"는 일본어에서 높은 빈도로 등장하여 무시하기 어렵고 의미별 분포가 고루 퍼져 있어, 대표적 대역어인 "-아/어/여 지다. -되다" 등으로만 대응시킬 경우의 번역 에러는 의외로 치명적이다. 따라서, "-reru, -rareru"의 번역을 고려한 특수 처리를 행할 필요가 있다. 먼저, 본 논문에서는 조동사 "-reru, -rareru"가 포함된 아사히 신문 가사의 5,800여 문장을 대상으로 각각의 의미에 대한 분포 및 한국어 대역어의 빈도를 조사하였다. 대역어는 크게 8종류의 형태로 나누었으며 각 동사별로 "-reru, -rareru"와 결합된 경우의 의미 출현 빈도를 참고하여 대응 가능한 대역어 형태들을 미리 결정하였다. 그리고, 대역어가 여러 개 존재하는 경우는 패턴 매칭을 통하여 적절한 대역어를 선택할 수 있도록 하였다. 그 결과, 약 87%의 "-reru, -rareru"가 적절한 대역어로 번역되어, 본 논문에서 제시한 의미 출현 빈도에 기반한 각 동사별 대역어 형태 결정 방법이 "-reru, -rareru"의 다의성 해소에 유효하다고 판단된다.

  • PDF

Image Pattern Classification and Recognition by using Associative Memories with Cellular Neural Networks (셀룰라신경회로망의 연상메모리를 이용한 영상 패턴의 분류 및 인식 방법)

  • Shin, Yoon-Cheol;Park, Yong-Hun;Kang, Hoon
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2002.05a
    • /
    • pp.231-234
    • /
    • 2002
  • 셀룰라 신경회로망의 연상 메모리를 이용하여 시각적인 입력 데이터의 연산을 통하여 영상 패턴의 분류와 인식을 수행한다. 셀룰라 신경회로망은 일반적인 신경회로망과 같이 비선형 데이터의 실시간 처리가 가능하고, 세 포자동자와 같이 격자구조의 셀로 이루어져 인접한 셀과 직접 정보를 주고받는다. 응용 분야로는 최적화, 선형/비선형화, 연상 메모리, 패턴인식, 컴퓨터 비젼 등에 적용할 수 있다. 영상의 이미지 픽셀을 셀룰라 신경회로망의 셀에 대응하여 전체 이미지 영상을 모든 셀룰라 신경회로망의 셀에서 동시에 병렬로 처리할 수 있어 2-D 이미지 처리에 적합하다 본 논문은 셀룰라 신경회로망에 의한 연상 메모리 구조를 설계하고, 학습된 하중값 메모리에서 가장 적당한 하중값을 선택하여 학습된 영상과 정확히 일치하는 출력을 얻는 방법을 제시한다. 학습을 통한 연상 메모리 구현에는 각각의 뉴런에서 일정하지 않은 다른 템플릿을 사용한다. 각각의 템플릿은 뉴런들 간의 연결 하중값을 나타내고 학습011 따라 갱신된다. 학습방법으로는 템플릿 하중값 학습에 뉴런들 간의 연결 하중값을 조정하는 가장 단순한 규칙인 Hebb의 학습방법이 사용되었고 분류값 학습에 LMS 알고리즘이 사용되었다

  • PDF