• Title/Summary/Keyword: Continuous Information Search

Search Result 148, Processing Time 0.032 seconds

Design of Controller for Affine Takagi-Sugeno Fuzzy System with Parametric Uncertainties via BMI

  • Lee, Sang-In;Joo, Young-Hoon;Park, Jin-Bae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.658-662
    • /
    • 2004
  • This paper develops a stability analysis and controller synthesis methodology for a continuous-time affine Takagi-Sugeno (T-S) fuzzy systems with parametric uncertainties. Affine T-S fuzzy system can be an advantage because it may be able to approximate nonlinear functions to high accuracy with fewer rules than the homogeneous T-S fuzzy systems with linear consequents only. The analysis is based on Lyapunov functions that are continuous and piecewise quadratic. The search for a piecewise quadratic Lyapunov function can be represented in terms of bilinear matrix inequalities (BMIs). A simulation example is given to illustrate the application of the proposed method.

  • PDF

DL-RRT* algorithm for least dose path Re-planning in dynamic radioactive environments

  • Chao, Nan;Liu, Yong-kuo;Xia, Hong;Peng, Min-jun;Ayodeji, Abiodun
    • Nuclear Engineering and Technology
    • /
    • v.51 no.3
    • /
    • pp.825-836
    • /
    • 2019
  • One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.

Investigation on Dynamic Behavior of Formant Information (포만트 정보의 동적 변화특성 조사에 관한 연구)

  • Jo, Cheolwoo
    • Phonetics and Speech Sciences
    • /
    • v.7 no.2
    • /
    • pp.157-162
    • /
    • 2015
  • This study reports on the effective way of displaying dynamic formant information on F1-F2 space. Conventional ways of F1-F2 space (different name of vowel triangle or vowel rectangle) have been used for investigating vowel characteristics of a speaker or a language based on statistics of the F1 and F2 values, which were computed by spectral envelope search method. Those methods were dealing mainly with the static information of the formants, not the changes of the formant values (i.e. dynamic information). So a better way of investigating dynamic informations from the formant values of speech signal is suggested so that more convenient and detailed investigation of the dynamic changes can be achieved on F1-F2 space. Suggested method used visualization of static and dynamic information in overlapped way to be able to observe the change of the formant information easily. Finally some examples of the implemented display on some cases of the continuous vowels are shown to prove the usefulness of suggested method.

Precision Analysis of the STOMP(FW) Algorithm According to the Spatial Conceptual Hierarchy (공간 개념 계층에 따른 STOMP(FW) 알고리즘의 정확도 분석)

  • Lee, Yon-Sik;Kim, Young-Ja;Park, Sung-Sook
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.11 no.12
    • /
    • pp.5015-5022
    • /
    • 2010
  • Most of the existing pattern mining techniques are capable of searching patterns according to the continuous change of the spatial information of an object but there is no constraint on the spatial information that must be included in the extracted pattern. Thus, the existing techniques are not applicable to the optimal path search between specific nodes or path prediction considering the nodes that a moving object is required to round during a unit time. In this paper, the precision of the path search according to the spatial hierarchy is analyzed using the Spatial-Temporal Optimal Moving Pattern(with Frequency & Weight) (STOPM(FW)) algorithm which searches for the optimal moving path by considering the most frequent pattern and other weighted factors such as time and cost. The result of analysis shows that the database retrieval time is minimized through the reduction of retrieval range applying with the spatial constraints. Also, the optimal moving pattern is efficiently obtained by considering whether the moving pattern is included in each hierarchical spatial scope of the spatial hierarchy or not.

A Method for Continuous k Nearest Neighbor Search With Partial Order (부분순위 연속 k 최근접 객체 탐색 기법)

  • Kim, Jin-Deog
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.1
    • /
    • pp.126-132
    • /
    • 2011
  • In the application areas of LBS(Location Based Service) and ITS(Intelligent Transportation System), continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. It is also able to cope successfully with frequent updates of POI objects. This paper proposes a new method to search nearest POIs for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results with partial order among k-POIs. The results obtained from experiments with real dataset show that the proposed method outperforms the existing methods. The proposed method achieves very short processing time(15%) compared with the existing method.

Recognition of Continuous Spoken Korean Language using HMM and Level Building (은닉 마르코프 모델과 레벨 빌딩을 이용한 한국어 연속 음성 인식)

  • 김경현;김상균;김항준
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.11
    • /
    • pp.63-75
    • /
    • 1998
  • Since many co-articulation problems are occurring in continuous spoken Korean language, several researches use words as a basic recognition unit. Though the word unit can solve this problem, it requires much memory and has difficulty fitting an input speech in a word list. In this paper, we propose an hidden Markov model(HMM) based recognition model that is an interconnection network of word HMMs for a syntax of sentences. To match suitably the input sentence into the continuous word list in the network, we use a level building search algorithm. This system represents the large sentence set with a relatively small memory and also has good extensibility. The experimental result of an airplane reservation system shows that it is proper method for a practical recognition system.

  • PDF

Optimizing User Experience While Interacting with IR Systems in Big Data Environments

  • Minsoo Park
    • International journal of advanced smart convergence
    • /
    • v.12 no.4
    • /
    • pp.104-110
    • /
    • 2023
  • In the user-centered design paradigm, information systems are created entirely tailored to the users who will use them. When the functions of a complex system meet a simple user interface, users can use the system conveniently. While web personalization services are emerging as a major trend in portal services, portal companies are competing for a second service, such as introducing 'integrated communication platforms'. Until now, the role of the portal has been content and search, but this time, the goal is to create and provide the personalized services that users want through a single platform. Personalization service is a login-based cloud computing service. It has the characteristic of being able to enjoy the same experience at any time in any space with internet access. Personalized web services like this have the advantage of attracting highly loyal users, making them a new service trend that portal companies are paying attention to. Researchers spend a lot of time collecting research-related information by accessing multiple information sources. There is a need to automatically build interest information profiles for each researcher based on personal presentation materials (papers, research projects, patents). There is a need to provide an advanced customized information service that regularly provides the latest information matched with various information sources. Continuous modification and supplementation of each researcher's information profile of interest is the most important factor in increasing suitability when searching for information. As researchers' interest in unstructured information such as technology markets and research trends is gradually increasing from standardized academic information such as patents, it is necessary to expand information sources such as cutting-edge technology markets and research trends. Through this, it is possible to shorten the time required to search and obtain the latest information for research purposes. The interest information profile for each researcher that has already been established can be used in the future to determine the degree of relationship between researchers and to build a database. If this customized information service continues to be provided, it will be useful for research activities.

Continuous Spatio-Temporal Self-Join Queries over Stream Data of Moving Objects for Symbolic Space (기호공간에서 이동객체 스트림 데이터의 연속 시공간 셀프조인 질의)

  • Hwang, Byung-Ju;Li, Ki-Joune
    • Spatial Information Research
    • /
    • v.18 no.1
    • /
    • pp.77-87
    • /
    • 2010
  • Spatio-temporal join operators are essential to the management of spatio-temporal data such as moving objects. For example, the join operators are parts of processing to analyze movement of objects and search similar patterns of moving objects. Various studies on spatio-temporal join queries in outdoor space have been done. Recently with advance of indoor positioning techniques, location based services are required in indoor space as well as outdoor space. Nevertheless there is no one about processing of spatio-temporal join query in indoor space. In this paper, we introduce continuous spatio-temporal self-join queries in indoor space and propose a method of processing of the join queries over stream data of moving objects. The continuous spatio-temporal self-join query is to update the joined result set satisfying spatio-temporal predicates continuously. We assume that positions of moving objects are represented by symbols such as a room or corridor. This paper proposes a data structure, called Candidate Pairs Buffer, to filter and maintain massive stream data efficiently and we also investigate performance of proposed method in experimental study.

A Study on the Factors Affecting the Continuous Intention to Use Digital Content Over-the-Top Service (디지털콘텐츠 OTT서비스의 지속사용의도에 영향을 미치는 주요 요인에 관한 연구)

  • An, Sunju;Seo, Jay;Choi, Jeongil
    • Journal of Korean Society for Quality Management
    • /
    • v.50 no.1
    • /
    • pp.105-124
    • /
    • 2022
  • Purpose: The purpose of this study is to examine the factors that influence the pre-use expectation and the continuous usage intention of the OTT services. Methods: For empirical analysis, the survey for this study was administered with many anonymous people who had previously used any of the OTT services and valid 192 data were analyzed by SPSS and PLS-SEM. Results: The results of this study are as follows. Personalization and understandability in the information quality didn't significantly affect confirmation. Ease of use and search of the system quality significantly affected confirmation. Also, it was found that content diversity, content recency, and content playfulness as the characteristics of the content quality significantly affected the expectation confirmation. OTT service fees also significantly affected the expectation confirmation. It also significantly affected perceived usefulness and satisfaction. Finally, satisfaction positively influenced the continuouse intention to use. Conclusion: The findings of this empirical analysis shows that the specific characteristics related to the relationship of expectation confirmation, perceived usefulness, satisfaction, and continuous usage intention with respect to OTT services through the Post Acceptance Model (PAM). Because system quality, content quality, and service fees meeted users' expectations, OTT services need a strategy that can boost the users' positive perceptions or experiences by reinforcing these three factors.

Curve Tracing Algorithm for Surface/Surface Intersection Curves in 3D Geomtric Modeling (3차원 기하 모델링에서 곡면간의 교차곡선 추적 알고리즘)

  • Park, Chul-Ho;Hong, Sung-Soo;Sim, Je-Hong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.8
    • /
    • pp.2163-2172
    • /
    • 1997
  • SSI(Surface/Surface Intersection)is a fundamental geometric operation which is used in solid and geometric modeling to support trimmed surface and Boolean operations. In this paper, we suggest a new algorithm for tracing along the intersection curve of two regular surfaces. Thus, in this paper, we present a simplicity of computing and second degree continunity. Given a point of intersection curve, it is traced to entire curve of a intersection curve as the initial point of its and the initial point of each of a intersection curve is detected to DFS(Depth First Search) method in the Quadtree and is naturally presented a continuous form.

  • PDF