• Title/Summary/Keyword: 개념 탐색

Search Result 1,224, Processing Time 0.031 seconds

Competition & Collaboration : Why people share location context information? (경쟁과 협력 : 사람들은 왜 위치 맥락 정보를 공유하는가? 위치기반 소셜네트워크서비스(LBSNS) 사용자의 공동 경험에 관한 탐색적 모형에 관한 연구)

  • Bae, Sang-Won;Lee, Hae-In;Park, Hye-Jin;Kim, Jin-Woo
    • Journal of the HCI Society of Korea
    • /
    • v.7 no.1
    • /
    • pp.19-28
    • /
    • 2012
  • Why people share location context information? The purpose of our study is that why users share location context information and which factors is related to co-experiences in LBSNS. Through an exploratory approach, first, we conducted a qualitative study in order to understand experiences among people in LBSNS and analyzed according to Grounded Theory. As a result, we found concepts regarding co-experiences cooperatively and competitively in LBSNS. Second, the theoretical model of co-experience was constructed by mediating perceived empathy based on theoretical foundation. In this study, theoretically, we suggested exploratory research model of co-experiences in LBSNS. Practically, designers could adopt concepts in terms of competition and collaboration among users to build co-experience of LBSNS services as its guidelines.

  • PDF

On the Anaphora Resolution in Korean Dialogues -in the Framework of the Controlled Centering Theory (한국어 대화에서의 대명사의 선행사 탐색 -통제된 중심화이론적 접근)

  • Lee, Ik-Hwan;Lee, Min-Haeng
    • Annual Conference on Human and Language Technology
    • /
    • 1999.10e
    • /
    • pp.382-388
    • /
    • 1999
  • 이 논문은 두 가지 목적을 가진다. 첫째, 대명사의 선행사 탐색을 위한 이론으로 널리 알려진 중심화이론을 필자들이 수정확대한 통제된 중심화 이론(Controlled Centering Theory, 이하 CCT)을 소개한다. 둘째, 한국어의 대화에서 나타나는 대명사의 선행사 탐색문제에 대한 설명력있는 해답을 CCT의 틀안에서 제시한다. 이를 위해 제한된 영역 대화라 할 수 있는 호텔예약대화에 나타나는 영대명사의 특성에 대해 논의하고, 그 선행사 탐색과 관련하여, 정보구조적인 관점에서 슬롯연결성분이 영대명사의 선행사일 가능성이 높기 때문에 중심화이론의 주요 구성요소인 전향적 중심리스트 서열의 최상위에 슬롯성분이 위치해야 한다는 논지를 전개한다. 어떤 영대명사의 선행사가 될 수 있는 후보자가 여럿일 경우에 가장 적합한 선행사를 찾아내기 위해서는 별도로 '개념양립성제약을' 설정할 필요가 있다고 주장한다 광역대화에 나타나는 명시적인 대명사의 선행사 탐색과 관련하여서는 대명사의 선행사는 대명사를 담화통어할 수 있는 위치에 있어야 한다는 담화통어제약을 제안하고, 담화통어 개념을 정의한다.

  • PDF

Effects of Nursing Students' Nurse Image and Professional Self Concept on Career Search Behavior (간호대학생의 간호사이미지, 전문직자아개념이 진로탐색행동에 미치는 영향)

  • Kim, Hee Yeon;Kim, Bo Mi
    • Journal of Internet of Things and Convergence
    • /
    • v.7 no.3
    • /
    • pp.15-22
    • /
    • 2021
  • The purpose of this study is to identify the factors that influence the nursing students' nurse image and professional self-concept on career exploration. This study was accomplished on 153 students in the 2nd, 3rd and 4th grades of the Department of Nursing Science at a college in area Y, and data were collected from July 1 to August 31, 2020 using a structured questionnaire. Measurement tools consisted of nurse image, professional self-concept, and career exploration behavior. Data processing was performed using the SPSS 22.0 program where general characteristics were analyzed by t-test, ANONA and post examination tests by Scheffe's test, using mean score, standard deviation, Pearson's correlation, and stepwise multiple regression. Nursing students' nurse image, professional self-concept, and career exploration behavior were all found to have significant positive correlations, and the most influential variable was professional self-concept. As for the total explanatory power of these variables, model 2 showed 25% explanatory power, which was increased by 2% compared to model 1. Based on this result, it is necessary to develop education and a career exploration action program which can improve the nurse image and professional self-concept.

A Design of Traverse and Representation Method of Maze for Shortest Path Search with Robots (로봇의 최단경로탐색을 위한 미로의 순회 및 표현방법 설계)

  • Hong, Ki-Cheon
    • 한국정보교육학회:학술대회논문집
    • /
    • 2010.08a
    • /
    • pp.227-233
    • /
    • 2010
  • Graph is applied to GIS, Network, AI and so on. We use graph concept in our daily life unconsciously. So this paper describe how graph concept is used when robot searches shortest path between two distinct vertices. It is performed in real world. For this, it consists of three step; maze traverse, graph generation, and shortest path search. Maze traverse steps is that robot navigates maze. It is most difficult step. Graph generation step is to represent structural information into graph. Shortest path search step is to that robot move between two vertices. It is not implemented yet. So we introduce process in design level.

  • PDF

A Comparison of web Searching and Library System Searching: Perceived Difficulty, Self-Efficacy, and Effort (웹과 도서관 시스템에서 이용자 정보탐색 비교연구)

  • Rieh, Soo-Young
    • Journal of the Korean Society for information Management
    • /
    • v.24 no.2
    • /
    • pp.29-44
    • /
    • 2007
  • The purpose of this study was to explore whether the concept of amount of invested mental effort (AIME) developed in the field of educational psychology can help explain why people put so little effort into online searching. In this experimental study, two information retrieval systems - a web search engine and a university library system - were used to make a comparison. The data were collected from 15 undergraduate students through background questionnaires, think-aloud protocols, search logs, post-search questionnaires, and post-task interviews. The findings indicate that perception of the web's "easy-ness" and high levels of self confidence in searching capability led the subjects to put less effort into web searching than they do into library system searching. In addition, the perceived difficulty of search task influenced the extent of mental effort invested. The AIME proved a useful framework for understanding search behavior and user experience for both web search engines and library systems.

Species Adaptive Evolution Method for Evolvable Hardware (진화 하드웨어를 위한 종 적응 진화방법)

  • 반창봉;전호병;박창현;심귀보
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.11a
    • /
    • pp.111-114
    • /
    • 2000
  • 종의 분화는 생명체의 다양성을 유지하며, 좀더 환경에 적합한 생명체를 탄생시킨다. 본 논문에서는 이러한 종의 분화 개념을 도입한다. 개체군의 각 개체들이 돌연변이를 통하여 자손을 생성하고, 그 중 일부가 분화하여 다음 세대의 개체를 이룬다. 각 개체들은 돌연변이에 의해 결정되는 일정한 해밍 공간 내외를 탐색공간으로 하고, 분화를 통하여 유효한 탐색공간을 점차 넓혀 탐색공간 전체에 대한 효율적인 탐색을 수행한다. 돌연변이를 통한 진화 방법으로 진화 하드웨어에 적용할 경우 내부구조의 변경이 적어 빠른 탐색효과를 갖을 수 있다. 제안된 알고리즘을 2개의 최적화 문제에 적용하여 그 유용성을 확인한다.

  • PDF

Review of control parameter of SCE-UA (SCE-UA기법의 제어 매개변수 검토)

  • Taehun Jung;Sangho Lee;Namjoo Lee
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2023.05a
    • /
    • pp.350-350
    • /
    • 2023
  • SCE-UA(Shuffled Complex Evolution-University Arizona)기법은 최적해 탐색 알고리즘으로 개념적 강우유출 모형(conceptual rainfall runoff model)의 보정을 위한 도구로 개발되었다. SCE-UA기법은 메타휴리스틱 방법의 일종으로 최적해를 구하기 위하여 여러번 목적함수 값을 계산해야 한다. 이 때 목적함수 계산 횟수와 해의 수렴과 관련된 제어 매개변수가 존재하며, 사용자가 적절한 값을 입력해주어야 한다. 이 연구에서는 SCE-UA와 관련된 제어 매개변수의 기능에 대해서 검토하였다. 그리고 집합체 수의 변화에 따라서 검사함수인 Ackley function의 전역해를 얼마나 잘 탐색하는지 검토하였다. 검토 결과 랜덤 시드에 따라서 전역해 탐색 결과가 달라졌으며, 집합체의 수가 증가할수록 목적함수 계산 횟수는 증가하는 경향을 나타내었다. 검사함수의 차원(결정 변수의 수)이 증가하면 전역해의 탐색률이 감소하며, 집합체의 수가 많아지면 전역해를 더 잘 찾는 경향이 나타나지만, 목적함수 계산 횟수는 더 많아지게 되는 것을 확인할 수 있었다. 2차원인 경우 집합체의 수가 7개 이상일 때 탐색 성공률은 90% 이상이 되었지만, 10차원인 경우 집합체의 수가 시험 최대값인 20개일 때의 전역해 탐색률은 37%에 그쳤다. 이 연구의 결과는 SCE-UA 기법의 설정 매개변수에 관한 기본 개념을 이해하고, 사용자가 설정 매개변수 선정 시에 활용할 수 있을 것이다.

  • PDF

An Exploratory Study on the Quality Evaluation for Digital Art Archives (디지털 아트 아카이브 품질평가를 위한 탐색적 연구)

  • Park, Sang Ae;Kim, Giyeong
    • Proceedings of the Korean Society for Information Management Conference
    • /
    • 2016.08a
    • /
    • pp.63-66
    • /
    • 2016
  • 본 연구는 매체의 기술적 진보에 기인한 디지털 환경에서 보존되고 활용되는 아트 아카이브의 품질 평가를 위해 품질평가변수에 적용될 수 있는 개념요소를 탐색하는 것을 그 목표로 한다. 아트 아카이브 생성자, 이용자, 관리자를 대상으로 비구조화 및 반구조화 면담을 수행하고 정리된 내용에 기초하여 개념요소를 도출한다.

  • PDF

A Study on Changing Estimation Weights of A* Algorithm's Heuristic Function (A* 알고리즘 평가함수의 추정 부하량 변경에 관한 연구)

  • Jung, Byung-Doo;Ryu, Yeong-Geun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.3
    • /
    • pp.1-8
    • /
    • 2015
  • In transportation networks, searching speed and result accuracy are becoming more critical on searching minimum path algorithm. Current $A^*$ algorithm has a big advantage of high searching speed. However, it has disadvantage of complicated searching network and low accuracy rate of finding the minimum path algorithm. Therefore, this study developed $A^*$ algorithm's heuristic function and focused on improving it's disadvantages. Newly developed function in this study contains the area concept, not the line concept. During the progress, this study adopts the idea of a heavier node that remains lighter to the target node is better that the lighter node that becomes heavier when it is connected to the other. Lastly, newly developed algorithm has the feedback function, which allows the larger accuracy value of heuristic than before. This developed algorithm tested on real network, and proved that developed algorithm is useful.

Knowledge Level of Users of Keyword/Boolean Searching on an Online Public Access Catalog : SELIS (OPAC에 있어서 키워드/불연산자 탐색에 대한 이용자 지식수준 연구)

  • Koo Bon-Young
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.32 no.4
    • /
    • pp.249-274
    • /
    • 1998
  • It is the analyses of replies showed n the questionnaire consisted of four kinds of matters to see level of knowledge among SELIS (SEoul Women's University Library and Information System) OPAC users of keyword/boolean search. The result of this analyses is : in SELIS search, users who prefer keyword search than any other, who satisfy work of retrieval by means of boolean operator, and who think it easier, show lusher level of knowledge than those who deny it in the questionnaire. Knowledges Presented in the survey are ; characteristics of keyword search, single or double keys, using boolean operator in keyword, knowledge of index, knowledge of stop list, uncontrolled term. keyword search technique, right truncation, correct application of boolean logic operator, and selecting major subject in keyword browsing. The above mentioned knowledges will work as important factors n keyword/boolean search, OPAC. For successful search it requires conceptional knowledge of information retrieval processing, or inquiry word transformation how to search required information, and semantic ability to get result questioned In the given system, when and how to apply the characteristics of the system, and scientific record for user's inquiry, or fundamental computer technology and syntax knowledge to make search word in detail. But so far now important knowledge considered as user's online index search, has been emphasized on knowledge of scientific record, and has been lag of semantic and conceptional knowledge. So, it is recommendable for online index user to train to concentrate semantic knowledge, syntax ability, and conceptional knowledge, rather than scientific technique too much.

  • PDF