• Title/Summary/Keyword: 탐색질

Search Result 622, Processing Time 0.03 seconds

Semantic parsing with restricted type signatures (제한된 타입 시그니처 기반의 시맨틱 파싱)

  • Nam, Daehwan;Lee, Gary Geunbae
    • Annual Conference on Human and Language Technology
    • /
    • 2020.10a
    • /
    • pp.569-571
    • /
    • 2020
  • 시맨틱 파싱은 주어진 자연어 발화를 domain specific language(DSL)를 따르는 프로그램으로 변환하는 방법이다. 시맨틱 파서가 다형성을 가지는 DSL을 사용할 경우, 적은 수의 토큰으로 다양한 프로그램을 출력할 수 있지만, 탐색 공간이 넓어진다는 문제가 있다. 본 연구에서는 해당 문제를 완화하기 위해 다형성을 가지는 DSL의 타입 시그니처를 제한하는 방법을 제안한다. 해당 방법은 sequence-to-sequence 기반의 시맨틱 파싱 성능을 향상시키는데 효율적임을 보였다.

  • PDF

Continuous Query Processing Utilizing Follows Relationship between Queries in Stock Databases (주식 데이타베이스에서 질의간 따름 관계를 이용한 연속 질의의 처리)

  • Ha, You-Min;Kim, Sang-Wook;Park, Sang-Hyun
    • Journal of KIISE:Databases
    • /
    • v.33 no.6
    • /
    • pp.644-653
    • /
    • 2006
  • This paper analyzes the properties of user query for stock investment recommendation, and defines the 'following relation', which is a new relation between two queries. A following relation between two queries $Q_1,\;Q_2$ and a recommendation value X means 'If the recommendation value of a preceding Query $Q_1$ is X, then a following query $Q_2$ always has X as its recommendation value'. If there exists a following relation between $Q_1\;and\;Q_2$, the recommendation value of $Q_2$ is decided immediately by that of $Q_1$, therefore we can eliminate the running process for $Q_2$. We suggest two methods in this paper. The former method analyzes all the following relations among user queries and represents them as a graph. The latter searches the graph and decides the order of queries to be processed, in order to make the number of eliminated query-running process maximized. When we apply the suggested procedures that use the following relation, most of user queries do not need to be processed directly, hence the performance of running overall queries is greatly improved. We examined the superiority of the suggested methods through experiments using real stock market data. According to the results of our experiments, overall query processing time has reduced less than 10% with our proposed methods, compared to the traditional procedure.

A Study on the Quality of life and Posttraumatic growth among North Korean refugees (북한이탈주민의 삶의 질이 외상 경험 이후 심리적 성장에 미치는 영향)

  • Kim, Hyun-Kyoung;Jeon, Woo-Taek
    • Korean Journal of Social Welfare Studies
    • /
    • v.40 no.2
    • /
    • pp.363-397
    • /
    • 2009
  • The purpose of this study was to find out correlation and predictors of posttraumatic growth of North Korean refugees in South Korea in 7years. This survey was conducted on 105 North Korean refugees in 7 years with questions on socio-demographic characteristics, personal & social variables, psychological trauma in North Korea and stress experience in South Korea. The influence of these variables was analysed. Result indicated that hope for future, perceived satisfaction, and acculturative stress had influence on the total quality of life in the South. And total quality of life affected PTG, especially emotional factors of quality of life during the early 3years living in the South affected PTG.. Additionally not only emotional but also social factors of quality of life also affected PTG with North Korean refugees in the South in 7 years. Finally, social and mental health service programs for North Krean refugees was discussed.

A study on the of professionalism and positive psychological capital on the effect of elderly care worker education on service quality (요양보호사의 교육, 서비스 질, 전문성, 긍정심리자본의 관계 연구)

  • Kim Bong Wha;Ko Youn Soon
    • The Journal of the Convergence on Culture Technology
    • /
    • v.10 no.3
    • /
    • pp.613-623
    • /
    • 2024
  • This study was conducted to explore the direction of elderly care worker education by analyzing the dual mediating effects of professionalism and positive psychological capital on the impact of elderly care worker education on service quality. As a result of this analysis, elderly care worker education was found to have a significant impact on service quality, professionalism and positive psychological capital and it's confirmed that the more positive the perception of elderly care worker education, the more positive the perception of service quality, professionalism and positive psychological capital. In addition, professionalism and positive psychological capital show that each two mediates the impact of the elderly care worker education on service quality so elderly care worker education can improve service quality by enhancing professionalism, and we can see that the elderly care worker education can be a factor that improves service quality by enhancing positive psychological capital. It's found that professionalism and positive psychological capital is by dual mediating the impact of elderly care worker education on service quality so professionalism had a significant effect on positive psychological capital. Accordingly, it's confirmed that elderly care worker education improves professionalism, and that improved professionalism promotes positive psychological capital, thereby improving service quality. According to the results of this study, it's empirically confirmed that develop professionalism is important in the elderly care worker education, and that enhancing positive psychological capital through the develop professionalism can ultimately improve service quality. Therefore, there is a significance to that it's able to predict elderly care worker education in the future should include education related to the improvement of professionalism and positive psychological capital.

Multi-query Indexing Technique for Efficient Query Processing on Stream Data in Sensor Networks (센서 네트워크에서 스트림 데이터 질의의 효율적인 처리를 위한 다중 질의 색인 기법)

  • Lee, Min-Soo;Kim, Yearn-Jeong;Yoon, Hye-Jung
    • Journal of Korea Multimedia Society
    • /
    • v.10 no.11
    • /
    • pp.1367-1383
    • /
    • 2007
  • A sensor network consists of a network of sensors that can perform computation and also communicate with each other through wireless communication. Some important characteristics of sensor networks are that the network should be self administered and the power efficiency should be greatly considered due to the fact that it uses battery power. In sensor networks, when large amounts of various stream data is produced and multiple queries need to be processed simultaneously, the power efficiency should be maximized. This work proposes a technique to create an index on multiple monitoring queries so that the multi-query processing performance could be increased and the memory and power could be efficiently used. The proposed SMILE tree modifies and combines the ideas of spatial indexing techniques such as k-d trees and R+-trees. The k-d tree can divide the dimensions at each level, while the R+-tree improves the R-tree by dividing the space into a hierarchical manner and reduces the overlapping areas. By applying the SMILE tree on multiple queries and using it on stream data in sensor networks, the response time for finding an indexed query takes in some cases 50% of the time taken for a linear search to find the query.

  • PDF

GB-Index: An Indexing Method for High Dimensional Complex Similarity Queries with Relevance Feedback (GB-색인: 고차원 데이타의 복합 유사 질의 및 적합성 피드백을 위한 색인 기법)

  • Cha Guang-Ho
    • Journal of KIISE:Databases
    • /
    • v.32 no.4
    • /
    • pp.362-371
    • /
    • 2005
  • Similarity indexing and searching are well known to be difficult in high-dimensional applications such as multimedia databases. Especially, they become more difficult when multiple features have to be indexed together. In this paper, we propose a novel indexing method called the GB-index that is designed to efficiently handle complex similarity queries as well as relevance feedback in high-dimensional image databases. In order to provide the flexibility in controlling multiple features and query objects, the GB-index treats each dimension independently The efficiency of the GB-index is realized by specialized bitmap indexing that represents all objects in a database as a set of bitmaps. Main contributions of the GB-index are three-fold: (1) It provides a novel way to index high-dimensional data; (2) It efficiently handles complex similarity queries; and (3) Disjunctive queries driven by relevance feedback are efficiently treated. Empirical results demonstrate that the GB-index achieves great speedups over the sequential scan and the VA-file.

The Effects Attributes of Dessert Cafe Selection on Relationship Quality and Behavioral Intentions (디저트 카페 선택속성이 관계의 질, 행동의도에 미치는 영향)

  • Kim, Young-Kyun
    • Culinary science and hospitality research
    • /
    • v.21 no.6
    • /
    • pp.38-48
    • /
    • 2015
  • This study examined the factors that affect the relationship between dessert cafe customer attribute election, relationship quality and behavioral intention. A total of 260 questionnaires were distributed to consumers, of which 250 were deemed suitable for analysis after the removal of 10 unusable responses. In order to perform statistical analyses required by the study, the SPSS 18.0 Statistical Program was employed for frequency analysis, factor analysis, reliability analysis, correlation, and regression analysis. The results of the exploratory factor analysis showed that three factors regarding attributes selection were extracted from all measurements with a KMO of 0.757 and a total cumulative variance of 67.885%, With regard to relationship quality, three factors were extracted with a total cumulative variance of 76.070% and a KMO score of 0.715. One factor for behavioral intention was extracted that accounted for a total cumulative variance of 66.254% and a KMO score of 0.771. All factors were significant to 0.000 and the correlation between variables was significant. Thus, based on the results, the main research hypothesis that identifies the relationships attributes selection between relationship quality and behavioral intention was partially adopted.

A Path Analysis of the Case Management Implementation Factors with Client Satisfaction and Quality of Life among the Mentally Ill Persons in the Community (사례관리 수행요소와 지역거주 정신장애인의 소비자 만족도 및 삶의 질 사이의 경로 탐색)

  • Min, So-Young
    • Korean Journal of Social Welfare
    • /
    • v.61 no.3
    • /
    • pp.103-127
    • /
    • 2009
  • This study examined the relationships among the case management implementation factors, client satisfaction and quality of life among the persons with mental illness. The survey and interviews were conducted to the 18 community-based mental health service agencies which were implementing case management, and the 381 mentally ill persons who were living in the community and were receiving services from the agencies. The path analysis and the hierarchical linear modeling were used to examine the association among the independent, mediator, and dependent variables. The major finding of this study were that the caseload had the direct relationship with the quality of life. The case management team approach had the direct relationship with the client satisfaction. The suggestions were made that more focus should be on the maintenance of the appropriate caseload, the increase of the number of the case manager, and the team approach.

  • PDF

Matrix-based Filtering and Load-balancing Algorithm for Efficient Similarity Join Query Processing in Distributed Computing Environment (분산 컴퓨팅 환경에서 효율적인 유사 조인 질의 처리를 위한 행렬 기반 필터링 및 부하 분산 알고리즘)

  • Yang, Hyeon-Sik;Jang, Miyoung;Chang, Jae-Woo
    • The Journal of the Korea Contents Association
    • /
    • v.16 no.7
    • /
    • pp.667-680
    • /
    • 2016
  • As distributed computing platforms like Hadoop MapReduce have been developed, it is necessary to perform the conventional query processing techniques, which have been executed in a single computing machine, in distributed computing environments efficiently. Especially, studies on similarity join query processing in distributed computing environments have been done where similarity join means retrieving all data pairs with high similarity between given two data sets. But the existing similarity join query processing schemes for distributed computing environments have a problem of skewed computing load balance between clusters because they consider only the data transmission cost. In this paper, we propose Matrix-based Load-balancing Algorithm for efficient similarity join query processing in distributed computing environment. In order to uniform load balancing of clusters, the proposed algorithm estimates expected computing cost by using matrix and generates partitions based on the estimated cost. In addition, it can reduce computing loads by filtering out data which are not used in query processing in clusters. Finally, it is shown from our performance evaluation that the proposed algorithm is better on query processing performance than the existing one.

Grid-based Index Generation and k-nearest-neighbor Join Query-processing Algorithm using MapReduce (맵리듀스를 이용한 그리드 기반 인덱스 생성 및 k-NN 조인 질의 처리 알고리즘)

  • Jang, Miyoung;Chang, Jae Woo
    • Journal of KIISE
    • /
    • v.42 no.11
    • /
    • pp.1303-1313
    • /
    • 2015
  • MapReduce provides high levels of system scalability and fault tolerance for large-size data processing. A MapReduce-based k-nearest-neighbor(k-NN) join algorithm seeks to produce the k nearest-neighbors of each point of a dataset from another dataset. The algorithm has been considered important in bigdata analysis. However, the existing k-NN join query-processing algorithm suffers from a high index-construction cost that makes it unsuitable for the processing of bigdata. To solve the corresponding problems, we propose a new grid-based, k-NN join query-processing algorithm. Our algorithm retrieves only the neighboring data from a query cell and sends them to each MapReduce task, making it possible to improve the overhead data transmission and computation. Our performance analysis shows that our algorithm outperforms the existing scheme by up to seven-fold in terms of the query-processing time, while also achieving high extent of query-result accuracy.