• Title/Summary/Keyword: searching method

Search Result 1,969, Processing Time 0.029 seconds

Nonlinear control system using universal learning network with random search method of variable search length

  • Shao, Ning;Hirasawa, Kotaro;Ohbayashi, Masanao;Togo, Kazuyuki
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10a
    • /
    • pp.235-238
    • /
    • 1996
  • In this paper, a new optimization method which is a kind of random searching is presented. The proposed method is called RasVal which is an abbreviation of Random Search Method with Variable Seaxch Length and it can search for a global minimum based on the probability density functions of searching, which can be modified using informations on success or failure of the past searching in order to execute intensified and diversified searching. By applying the proposed method to a nonlinear crane control system which can be controlled by the Universal Learning Network with radial basis function(R.B.P.), it has been proved that RasVal is superior in performance to the commonly used back propagation learning algorithm.

  • PDF

An efficient Ambiguity searching method with constraints for attitude finding GPS receivers

  • Nam, Sung-Il;Son, Seok-Bo;Park, Chan-Sik;Lee, Sang-Jeong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.61.1-61
    • /
    • 2001
  • This paper describes an efficient ambiguity searching method using additional constraints in 3-dimentional attitude finding GPS receiver design. For determining the integer ambiguity, the baseline length constraint, the angle constraint, the velocity constraint and the attitude constraint can be used for reducing the searching space. This paper describes the searching space algebraically and graphically. It is confirmed that the described restrictions are reasonable and the speed and the probability of ambiguity fixing are improved when the restricted searching spaces are applied Moreover, it is possible to design receivers of better quality by applying the method proposed in this paper.

  • PDF

A dividerless COA defuzzifier with an efficient searching of momentum equilibrium point (모멘트 균형점의 효율적 탐색을 갖는 비제산기 COA 비퍼지화기)

  • 김대진;조인현
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.33B no.10
    • /
    • pp.80-89
    • /
    • 1996
  • This paper proposes a new COA (center of area) defuzzifier that is working in the accurate and fast manner. The proposed COA defuzzifier involves both membership values and the spans of membership functions in clauclating a crisp value. In additon, it avoid division by replacing the COA calculation with the searching of the momentum equilibrium point. The moment equilibrium point is searched in the coarse-to-fine manner such that the moment computing points during the coarse searching are moved in the interval of fuzzy terms until they are reached at two adjacent fuzzy terms searching method accerlates the finding of the moment equilibrium point by O(M) mazimally when compared iwth the equal interval searching method of ruitz. In order to verify the accuracy of the proposed COA defuzzifier, the crisp values obtained form the proposed coarse-to-fine searching are compared with the precise crisp values from the arithmetic calculation. Application to the truck backer-upper control problem of the proposed COA defuzzifier is presented. The control performance is compared with that of the conventional COA defuzzifier in tems of the average tracing distance.

  • PDF

Efficient method of Searching PI Code on RDS System (RDS System 에서의 효율적인 PI code 검출 기법에 관한 연구)

  • Cho, Chung-bum;Kim, Yound-cil
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.112-115
    • /
    • 2009
  • PI code searching method of RDS(Radio Data System) are unique method of maintain desired channel on moving machine like vehicle. Efficient and fast PI code search method are researching on the all of RDS related systems for both find more better channel before Original channel signal go to bad and find desired good signal quickly when get out of Weak signal Area. But Embedded system has limited environment like memory size, so It is very difficult to apply many well known PI code searching method. This thesis suggests simple and effective method of searching PI code, considering a Embedded System Environment.

  • PDF

Searching for Variants Using Trie-Index (트라이 인덱스를 이용한 이형태 검색)

  • Park, In-Cheol
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.8
    • /
    • pp.1986-1992
    • /
    • 2009
  • A user often searches a data by inputting a variant such as the abbreviation or substring of a word, or a misspelled word. The simple approach to the searching for variants is to build a variants dictionary. However, it entails enormous cost and time and can not handle variants by misspelling. Approximate searching, searching by approximate string matching, is a good approach to the searching. A problem in the approach is that it cannot handle variants by abbreviations. This paper propose a method for searching various variants including abbreviations and misspelled words, by using the trie indexing. First, this paper shows a variant matching method with the calculation of path weighted-metric. In addition, it provides variant searching algorithm to reduce the search time.

Design of Web Robot Engine Using Distributed Collection Model Processing (분산수집 모델을 이용한 웹 로봇의 설계 및 구현)

  • Kim, Dae-Yu;Kim, Jung-Tae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.1
    • /
    • pp.115-121
    • /
    • 2010
  • As internet becomes widespread, a lot of information is opened to public and users of Internet can access effectively information using web searching service. To construct web searching service, the web searching method for collecting of information is needed to obtain web page view. As a number of web page view increases, it is necessary to collect information of high quality information to be searched, therefore, a variety of web engine for searching mechanism is developed. Method of link extraction with javascript in dynamic web page and design of web searching robot are presented m this paper. To evaluate performance analyzes, we fixed one searching model with the proposed method. The searching time takes 2 minute 67 sec for 299 web pages and 12.33 sec for 10 searching model.

An efficient channel searching method based on channel list for independent type cognitive radio systems (독립형 무선 인지 시스템에서 채널 목록 기반의 효과적 채널 검색)

  • Lee, Young-Doo;Koo, In-Soo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.7
    • /
    • pp.1422-1428
    • /
    • 2009
  • In this paper, we consider an independent type cognitive radio system where secondary users can utilize empty channels that are not currently used by primary users having the license to these channels. In the previous works, secondary users search channels sequently or randomly to detect activities of primary user on channels. These channel searching methods however are not suitable to the characteristics of the wireless environment. Therefore, we propose a channel searching method based on the channel list for the purpose of reducing the channel searching time and improving the throughput of secondary users. In the proposed method, we firstly determine weighting value of each channel based on the history of channel activities of primary users and add the weighing value to current channel state buffer. And then, we search an empty channel from channel with smallest value to one with the biggest value. Finally, we compare the performances of the proposed method with those of the sequential channel searching and the random channel searching methods in terms of average channel searching time and average number of transmissions of secondary user.

Indexing Algorithm Using Dynamic Threshold (동적임계값을 이용한 인덱싱 알고리즘)

  • 이문우;박종운;장종환
    • Journal of the Korea Computer Industry Society
    • /
    • v.2 no.3
    • /
    • pp.389-396
    • /
    • 2001
  • In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has a faster searching speed and lower missing scene change detection than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect missing frame and searching precision. In this study, the whole moving pictures were primarily retrieved threshold by the temporal difference of histogram scene change detection method. We suggested a dynamic threshold algorithm using cut detection interval and derived an equation formula to determine optimal primary retrieval threshold which can cut detection interval computation. Experimental results show that the proposed dynamic threshold algorithm using cut detection interval method works up about 30 percent in precision of performance than the sequential searching method.

  • PDF

Cognitive radio system based on channel list for efficient channel searching (효과적 채널 검색을 위한 채널 목록 기반 무선 인지 시스템)

  • Lee, Young-Du;Koo, In-Soo
    • Proceedings of the IEEK Conference
    • /
    • 2009.05a
    • /
    • pp.284-286
    • /
    • 2009
  • In this paper, we consider a cognitive radio system operating as secondary user. It uses an empty channel that is not currently used by primary users having the license to the channel. In the previous works, secondary user looks for an empty channel by choosing any channel in order or randomly and by sensing the channel to distinguish whether primary users are using. But if primary user is fixed type, we will find an empty channel faster than the mentioned channel selecting methods by using a method considering prior information about cases that primary user used the channel, since it is possible to analogize the channel access possibility of primary user according to regular time and position. Therefore, we propose a channel searching method based on the channel list for the purpose of reducing the channel searching time and improving throughput of secondary users. Firstly, we determine a weighting value of each channel based on the history of channel activities of primary users. This value is added to current channel state buffer and we search an empty channel from channel with smallest value to one with the biggest value. Finally, we compare the performances of the proposed method with those of the sequential channel searching and the random channel searching methods in terms of the average channel searching time and the average number of transmissions of secondary user.

  • PDF

Modification-robust contents based motion picture searching method (변형에 강인한 내용기반 동영상 검색방법)

  • Choi, Gab-Keun;Kim, Soon-Hyob
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.215-217
    • /
    • 2008
  • The most widely used method for searching contents of mot ion picture compares contents by extracted cuts. The cut extract ion methods, such as CHD(Color Histogram Difference) or ECR(Edge Change Ratio), are very weak at modifications such as cropping, resizing and low bit rate. The suggested method uses audio contents for indexing and searching to make search be robust against these modification. Scenes of audio contents are extracted for modification-robust search. And based on these scenes, make spectral powers binary on each frequency bin. in the time-frequency domain. The suggested method shows failure rate less than 1% on the false positive error and the true negative error to the modified(using cropping, clipping, row bit rate, addtive frame) contents.

  • PDF