• Title/Summary/Keyword: representation.

Search Result 6,221, Processing Time 0.031 seconds

Boolean Query Formulation From Korean Natural Language Queries using Syntactic Analysis (구문분석에 기반한 한글 자연어 질의로부터의 불리언 질의 생성)

  • Park, Mi-Hwa;Won, Hyeong-Seok;Lee, Geun-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.26 no.10
    • /
    • pp.1219-1229
    • /
    • 1999
  • 일반적으로 AND, OR, NOT과 같은 연산자를 사용하는 불리언 질의는 사용자의 검색의도를 정확하게 표현할 수 있기 때문에 검색 전문가들은 불리언 질의를 사용하여 높은 검색성능을 얻는다고 알려져 있지만, 일반 사용자는 자신이 원하는 정보를 불리언 형태로 표현하는데 익숙하지 않다. 본 논문에서는 검색성능의 향상과 사용자 편의성을 동시에 만족하기 위하여 사용자의 자연어 질의를 확장 불리언 질의로 자동 변환하는 방법론을 제안한다. 먼저 자연어 질의를 범주문법에 기반한 구문분석을 수행하여 구문트리를 생성하고 연산자 및 키워드 정보를 추출하여 구문트리를 간략화한다. 다음으로 간략화된 구문트리로부터 명사구를 합성하고 키워드들에 대한 가중치를 부여한 후 불리언 질의를 생성하여 검색을 수행한다. 또한 구문분석의 오류로 인한 검색성능 저하를 최소화하기 위하여 상위 N개 구문트리에 대해 각각 불리언 질의를 생성하여 검색하는 N-BEST average 방법을 제안하였다. 정보검색 실험용 데이타 모음인 KTSET2.0으로 실험한 결과 제안된 방법은 수동으로 추출한 불리언 질의보다 8% 더 우수한 성능을 보였고, 기존의 벡터공간 모델에 기반한 자연어질의 시스템에 비해 23% 성능향상을 보였다. Abstract There have been a considerable evidence that trained users can achieve a good search effectiveness through a boolean query because a structural boolean query containing operators such as AND, OR, and NOT can make a more accurate representation of user's information need. However, it is not easy for ordinary users to construct a boolean query using appropriate boolean operators. In this paper, we propose a boolean query formulation method that automatically transforms a user's natural language query into a extended boolean query for both effectiveness and user convenience. First, a user's natural language query is syntactically analyzed using KCCG(Korean Combinatory Categorial Grammar) parser and resulting syntactic trees are structurally simplified using a tree-simplifying mechanism in order to catch the logical relationships between keywords. Next, in a simplified tree, plausible noun phrases are identified and added into the same tree as new additional keywords. Finally, a simplified syntactic tree is automatically converted into a boolean query using some mapping rules and linguistic heuristics. We also propose an N-BEST average method that uses top N syntactic trees to compensate for bad effects of single incorrect top syntactic tree. In experiments using KTSET2.0, we showed that a proposed method outperformed a traditional vector space model by 23%, and surprisingly manually constructed boolean queries by 8%.

Animation Generation for Chinese Character Learning on Mobile Devices (모바일 한자 학습 애니메이션 생성)

  • Koo, Sang-Ok;Jang, Hyun-Gyu;Jung, Soon-Ki
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.33 no.12
    • /
    • pp.894-906
    • /
    • 2006
  • There are many difficulties to develop a mobile contents due to many constraints on mobile environments. It is difficult to make a good mobile contents with only visual reduction of existing contents on wire Internet. Therefore, it is essential to devise the data representation and to develop the authoring tool to meet the needs of the mobile contents market. We suggest the compact mobile contents to learn Chinese characters and developed its authoring tool. The animation which our system produces is realistic as if someone writes letters with pen or brush. Moreover, our authoring tool makes a user generate a Chinese character animation easily and rapidly although she or he has not many knowledge in computer graphics, mobile programming or Chinese characters. The method to generate the stroke animation is following: We take basic character shape information represented with several contours from TTF(TrueType Font) and get the information for the stroke segmentation and stroke ordering from simple user input. And then, we decompose whole character shape into some strokes by using polygonal approximation technique. Next, the stroke animation for each stroke is automatically generated by the scan line algorithm ordered by the stroke direction. Finally, the ordered scan lines are compressed into some integers by reducing coordinate redundancy As a result, the stroke animation of our system is even smaller than GIF animation. Our method can be extended to rendering and animation of Hangul or general 2D shape based on vector graphics. We have the plan to find the method to automate the stroke segmentation and ordering without user input.

An Evaluation of Human Sensibility on Perceived Texture for Real Haptic Representation (사실적인 햅틱 표현을 위한 질감지각 감성 평가)

  • Kim, Seung-Chan;Kyung, Ki-Uk;Sohn, Jin-Hun;Kwon, Dong-Soo
    • Journal of KIISE:Software and Applications
    • /
    • v.34 no.10
    • /
    • pp.900-909
    • /
    • 2007
  • This paper describes an experiment on the evaluation of human sensibility by monitoring responses to changes In the frequency and amplitude of a tactile display system. Preliminary tasks were performed to obtain effective adjectives concerning texture perception. The number of collected adjectives was originally 33. This number of adjectives was reduced to 14 by a suitability survey that asked whether an adjective is suitable for expressing a texture feeling. Finally after performing a semantic similarity evaluation, the number of adjectives was further reduced to ten and these ten were used in the main experiment. In the main experiment, selected sandpaper types and 15 selected combinations of frequencies and amplitudes of a tactile display were utilized to quantitatively evaluate the ten adjectives using a bipolar seven-point scale. The data show that a relationship exists between the independent variables(frequency, amplitude, and grit site) and the dependent variable(perceived texture). That is, the change of frequency and amplitude is directly related to perceived roughness or essential elements of human tactile sensitivity found in the preliminary experiment.

Active Documents: Programs by Form Designers (능동문서: 서식설계자의 프로그램)

  • Nam, Chul-Ki;Bae, Jae-Hak;Yoo, Hae-Young
    • The KIPS Transactions:PartB
    • /
    • v.10B no.6
    • /
    • pp.599-610
    • /
    • 2003
  • The Web plays an important role as information source and most Web applications are document-centric. A document implies an intention of its own designer, which can be utilized actively in automation of business processes. Through an understanding of an intrinsic nature of a document function, we can see a document as an executable computer program in a special case. For this approach, we propose an active document model that is composed of form, knowledge base, rules, and queries. For reusability and interoperability of a document, each component of the proposed model is uniformly represented in XML. The proposed active document not only plays a passive role in providing user interfaces, but also is a document that a machine can infer and process with reading a procedure of document processing and business rules intended by document designers. Through this approach, document can interact with machines and can cooperate with other applications. For applicability of our active document, we show a case study for the processing of purchase orders in a B2B e-Commerce system. This paper is expected to provide the framework of accelerating the development of intelligent applications through our approach regards form document as a computer program. In short, the proposed active document contains knowledge representation and processing method, consequently our document will play an important role in providing a concept of document of pursuing in Semantic Web.

Metadata Ontology Design for B2B Business Process Registries (기업간 비즈니스 프로세스 등록저장소를 위한 메타데이터 온톨로지 설계)

  • Kim, Jong-Woo;Kim, Hyoung-Do;Yun, Jung-Hee;Jung, Hyun-Chul
    • The KIPS Transactions:PartD
    • /
    • v.14D no.4 s.114
    • /
    • pp.435-446
    • /
    • 2007
  • B2B registries are information systems to register B2B related business information such as companies' profiles, business documents, business processes, and services and to provide query facilities to find information about potential business partners. Focusing on the design of the registry for B2B business processes, in this paper, a metadata ontology is designed to register B2B business processes. In practice, there are several competitive business process definition languages such as ebXML BPSS (Business Process Specification Schema), WSBPEL (Web Service Business Process Execution Language), BPMN (Business Process Modeling Notation), and so on. In order to register heterogeneous business processes based on different representation frameworks, the proposed metadata ontology consists of three layers, common metadata, language-specific metadata, and interrelationship metadata. To show the usefulness of the proposed metadata ontology, two examples which are represented by ebXML BPSS and WSBPEL respectively are described in order to show how the proposed metadata ontology is used to registry B2B business processes. To implement the proposed metadata ontology using ebXML registry, metadata mapping scheme to ebRIM (ebXML Registry Information Model) is also suggested.

Intelligent Motion Planning System for an Autonomous Mobil Robot (자율 이동 로봇을 위한 지능적 운동 계획 시스템)

  • 김진걸;김정찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.8
    • /
    • pp.1503-1517
    • /
    • 1994
  • Intelligent Motion Planning System(IMPS) is presented for a robot to achieve an efficient path toward the given target point in two dimensional unknown environment is constructed with unrestricted obstacle shapes. IMPS consists of three components for making intelligent motion. These components are real-time motion planning algorithm based on a discontinous boundary method, fuzzy neural network decision system for heuristic knowledge representation, and world modeling with forgetting and reinforcing memory cells. First of all, in real-time motion planning algorithm, the behavior-based architectural method is used to generate subgoal. A behavior generates a subgoal independently by using the method of discontinuous boundary in sensed area. The discontinuous boundary method is a new proposed fast obstacle avoidance algorithm. The second component is fuzzy neural network decision system for accomplishing the subgoal. The heuristic rules are imbedded on the fuzzy neural network to make an intelligent decision. The last one is a forgetting, reinforcing memory technique for the construction of external world map. The activation values of all activated memory cells in grid space are decreased monotonically and after all they are burned out. Therefore, after sufficient journey, robot can have a stationary world map even if the dynaic obstacles exist. Using the IMPS, several simulations show the efficient achievement of target point in unknown enviroment with obstcles of various shapes.

  • PDF

The Effects of Children's Art Activities through Forest Experience in Relation with Nuri Curriculum on Their Environmental Sensitivity (누리연계 유아의 숲 체험 미술 활동이 환경 감수성에 미치는 효과)

  • Kang, Young-Sik
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.18 no.12
    • /
    • pp.264-275
    • /
    • 2017
  • Objective: This study examines the effects of children's art activities through forest experience in relation with Nuri curriculum on environmental sensitivity. Method: A survey was administered to an experimental group of 20 children as well as a control group of 20 children for statistical analysis. after 16-class art activities through forest experience were performed to children aged 4 at a daycare center for 50 days. Result: Children's art activities through forest experience in relation with Nuri curriculum had a positive effect on their environmental sensitivity. In particular, their art activities had a positive effect on their self-awareness, self-regulation, empathy and motivation in the experimental group, supporting the educational effects and benefits of developmental children's art activities through forest experience in relation with Nuri curriculum. In other words, art activities through forest experience are useful in terms of providing children with creative expression activities in art by leading to observation and exploration, as well as educational experiences that have positive attitudes toward the environment. Conclusion: As children's art activities through forest experience have a positive effect on their environmental sensitivity, more useful information on teaching-learning methods will be able to be provided to early childhood teachers in the field. Consequently, children's art activities through forest experience need to be actively introduced in the field of early childhood education as an alternative for learning nature and improving environment-friendly emotional intelligence.

An Efficient Sequence Matching Method for XML Query Processing (XML 질의 처리를 위한 효율적인 시퀀스 매칭 기법)

  • Seo, Dong-Min;Song, Seok-Il;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.35 no.4
    • /
    • pp.356-367
    • /
    • 2008
  • As XML is gaining unqualified success in being adopted as a universal data representation and exchange format, particularly in the World Wide Web, the problem of querying XML documents poses interesting challenges to database researcher. Several structural XML query processing methods, including XISS and XR-tree, for past years, have been proposed for fast query processing. However, structural XML query processing has the problem of requiring expensive Join cost for twig path query Recently, sequence matching based XML query processing methods, including ViST and PRIX, have been proposed to solve the problem of structural XML query processing methods. Through sequence matching based XML query processing methods match structured queries against structured data as a whole without breaking down the queries into sub queries of paths or nodes and relying on join operations to combine their results. However, determining the structural relationship of ViST is incorrect because its numbering scheme is not optimized. And PRIX requires many processing time for matching LPS and NPS about XML data trees and queries. Therefore, in this paper, we propose efficient sequence matching method u sing the bottom-up query processing for efficient XML query processing. Also, to verify the superiority of our index structure, we compare our sequence matching method with ViST and PRIX in terms of query processing with linear path or twig path including wild-card('*' and '//').

An ERP study on the processing of Syntactic and lexical negation in Korean (부정문 처리와 문장 진리치 판단의 인지신경기제: 한국어 통사적 부정문과 어휘적 부정문에 대한 ERP 연구)

  • Nam, Yunju
    • Korean Journal of Cognitive Science
    • /
    • v.27 no.3
    • /
    • pp.469-499
    • /
    • 2016
  • The present study investigated the cognitive mechanism underlying online processing of Korean syntactic (for example, A bed/a clock belongs to/doesn't belong to the furniture "침대는/시계는 가구에 속한다/속하지 않는다") and lexical negation (for example, A tiger/a butterfly has/doesn't have a tail "호랑이는/나비는 꼬리가 있다/없다") using an ERP(Event-related potentials) technique and a truth-value verification task. 23 Korean native speakers were employed for the whole experiment and 15's brain responses (out of 23) were recorded for the ERP analysis. The behavioral results (i.e. verification task scores) show that there is universal pattern of the accuracy and response time for verification process: True-Affirmative (high accuracy and short latency) > False-Affirmative > False-Negated > True-Negated. However, the components (early N400 & P600) reflecting the immediate processing of a negation operator were observed only in lexical negation. Moreover, the ERP patterns reflecting an effect of truth value were not identical: N400 effect was observed in the true condition compared to the false condition in the lexically negated sentences, whereas Positivity effect (like early P600) was observed in the false condition compared to the true condition in the syntactically negated sentences. In conclusion, the form and location of negation operator varied by languages and negation types influences the strategy and pattern of online negation processing, however, the final representation resulting from different computational processing of negation appears to be language universal and is not directly affected by negation types.

Aberration Retrieval Algorithm of Optical Pickups Using the Extended Nijboer-Zernike Approach (확장된 네이보어-제르니케 방법에 의한 광픽업의 파면수차 복원 알고리즘)

  • Jun, Jae-Chul;Chung, Ki-Soo;Lee, Gun-Kee
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.11 no.1
    • /
    • pp.32-40
    • /
    • 2010
  • In this work, the method of acquiring the pupil function of optical system is proposed. The wavefront aberration and the intensity distribution of pupil can be analysed with the pupil function. This system can be adopted to the manufacturing line of optical pickup directly and also has good performance to analysing various property of optical instrument. It is one kind of inverse problem to get pupil functions by 3D beam data. The extended Nijboer-Zernike(ENZ) approach recently proposed by Netherlands research group is adopted to accompany to solve these inverse problem. The ENZ approach is one of a aberration retrieval method for which numerous approaches are available. But this approach is new in the sense that it use the highly efficient representation of pupil functions by means of their Zernike coefficients. These coefficients are estimated by using matching procedure in the focal region the theoretical 3D intensity distribution and measured 3D intensity distribution. The algorithm that can be applied more general circumstance such as high-numerical aperture instrument is developed by modifying original ENZ approach. By these scheme, MS windows based GUI program is developed and the good performance is verified with generated 3D beam data.