• Title/Summary/Keyword: Local search

Search Result 1,003, Processing Time 0.035 seconds

Does the general public have concerns with dental anesthetics?

  • Razon, Jonathan;Mascarenhas, Ana Karina
    • Journal of Dental Anesthesia and Pain Medicine
    • /
    • v.21 no.2
    • /
    • pp.113-118
    • /
    • 2021
  • Background: Consumers and patients in the last two decades have increasingly turned to various internet search engines including Google for information. Google Trends records searches done using the Google search engine. Google Trends is free and provides data on search terms and related queries. One recent study found a large public interest in "dental anesthesia". In this paper, we further explore this interest in "dental anesthesia" and assess if any patterns emerge. Methods: In this study, Google Trends and the search term "dental pain" was used to record the consumer's interest over a five-year period. Additionally, using the search term "Dental anesthesia," a top ten related query list was generated. Queries are grouped into two sections, a "top" category and a "rising" category. We then added additional search term such as: wisdom tooth anesthesia, wisdom tooth general anesthesia, dental anesthetics, local anesthetic, dental numbing, anesthesia dentist, and dental pain. From the related queries generated from each search term, repeated themes were grouped together and ranked according to the total sum of their relative search frequency (RSF) values. Results: Over the five-year time period, Google Trends data show that there was a 1.5% increase in the search term "dental pain". Results of the related queries for dental anesthesia show that there seems to be a large public interest in how long local anesthetics last (Total RSF = 231) - even more so than potential side effects or toxicities (Total RSF = 83). Conclusion: Based on these results it is recommended that clinicians clearly advice their patients on how long local anesthetics last to better manage patient expectations.

A Fast Motion Estimation Algorithm Based on Multi-Resolution Frame Structure (다 해상도 프레임 구조에 기반한 고속 움직임 추정 기법)

  • Song, Byung-Cheol;Ra, Jong-Beom
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.5
    • /
    • pp.54-63
    • /
    • 2000
  • We present a multi-resolution block matching algorithm (BMA) for fast motion estimation At the coarsest level, a motion vector (MV) having minimum matching error is chosen via a full search, and a MV with minimum matching error is concurrently found among the MVs of the spatially adjacent blocks Here, to examine the spatial MVs accurately, we propose an efficient method for searching full resolution MV s without MV quantization even at the coarsest level The chosen two MV s are used as the initial search centers at the middle level At the middle level, the local search is performed within much smaller search area around each search center If the method used at the coarsest level is adopted here, the local searches can be done at integer-pel accuracy A MV having minimum matching error is selected within the local search areas, and then the final level search is performed around this initial search center Since the local searches are performed at integer-pel accuracy at the middle level, the local search at the finest level does not take an effect on the overall performance So we can skip the final level search without performance degradation, thereby the search speed increases Simulation results show that in comparison with full search BMA, the proposed BMA without the final level search achieves a speed-up factor over 200 with minor PSNR degradation of 02dB at most, under a normal MPEG2 coding environment Furthermore, our scheme IS also suitable for hardware implementation due to regular data-flow.

  • PDF

A Heuristic Search Planner Based on Component Services (컴포넌트 서비스 기반의 휴리스틱 탐색 계획기)

  • Kim, In-Cheol;Shin, Hang-Cheol
    • The KIPS Transactions:PartB
    • /
    • v.15B no.2
    • /
    • pp.159-170
    • /
    • 2008
  • Nowadays, one of the important functionalities required from robot task planners is to generate plans to compose existing component services into a new service. In this paper, we introduce the design and implementation of a heuristic search planner, JPLAN, as a kernel module for component service composition. JPLAN uses a local search algorithm and planning graph heuristics. The local search algorithm, EHC+, is an extended version of the Enforced Hill-Climbing(EHC) which have shown high efficiency applied in state-space planners including FF. It requires some amount of additional local search, but it is expected to reduce overall amount of search to arrive at a goal state and get shorter plans. We also present some effective heuristic extraction methods which are necessarily needed for search on a large state-space. The heuristic extraction methods utilize planning graphs that have been first used for plan generation in Graphplan. We introduce some planning graph heuristics and then analyze their effects on plan generation through experiments.

타부탐색(Tabu Search)의 확장모델을 이용한 '외판원 문제(Traveling Salesman Problem)' 풀기

  • 고일상
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.10a
    • /
    • pp.135-138
    • /
    • 1996
  • In solving the Travel Salesman Problem(TSP), we easily reach local optimal solutions with the existing methods such as TWO-OPT, THREE-OPT, and Lin-Kernighen. Tabu search, as a meta heuristic, is a good mechanism to get an optimal or a near optimal solution escaping from the local optimal. By utilizing AI concepts, tabu search continues to search for improved solutions. In this study, we focus on developing a new neighborhood structure that maintains the feasibility of the tours created by exchange operations in TSP. Intelligent methods are discussed, which keeps feasible tour routes even after exchanging several edges continuously. An extended tabu search model, performing cycle detection and diversification with memory structure, is applied to TSP. The model uses effectively the information gathered during the search process. Finally, the results of tabu search and simulated annealing are compared based on the TSP problems in the prior literatures.

  • PDF

Likelihood search method with variable division search

  • Koga, Masaru;Hirasawa, Kotaro;Murata, Junichi;Ohbayashi, Masanao
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.14-17
    • /
    • 1995
  • Various methods and techniques have been proposed for solving optimization problems; the methods have been applied to various practical problems. However the methods have demerits. The demerits which should be covered are, for example, falling into local minima, or, a slow convergence speed to optimal points. In this paper, Likelihood Search Method (L.S.M.) is proposed for searching for a global optimum systematically and effectively in a single framework, which is not a combination of different methods. The L.S.M. is a sort of a random search method (R.S.M.) and thus can get out of local minima. However exploitation of gradient information makes the L.S.M. superior in convergence speed to the commonly used R.S.M..

  • PDF

Determination of the Optimal Design Parameters for Search Task with VDT Screen Written in Korean (탐색작업에서 한글 VDT를 화면의 최적설계 모수의 결정)

  • 황우상;이동춘
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.20 no.42
    • /
    • pp.39-47
    • /
    • 1997
  • There are four parameters (i.e. overall density, local density, grouping, layout complexity) to consider in designing screen of a visual display terminal. Among these, only the optimum level of overall density is known to be about 25~30% by some studies. Therefore, the present experiment is conducted to define the optimum levels of the other parameters to achieve the user's best performance in visual search task. The results are as follows; (1) The function related to the levels of local density and user's search times is shown to be U -shaped. When the level of local density is about 40%, the search time is shorter than those of any other levels. (2) In the experiment of grouping, user's performance is best when the number of group is 5, and the size of group does not exceed visual angle $5^{\circ}$ (0,088rad). (3) The user performance is improved as the layout becomes less complex.

  • PDF

An Experimental Comparison of Adaptive Genetic Algorithms (적응형 유전알고리즘의 실험적 비교)

  • Yun, Young-Su
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.32 no.4
    • /
    • pp.1-18
    • /
    • 2007
  • In this paper, we develop an adaptive genetic algorithm (aGA). The aGA has an adaptive scheme which can automatically determine the use of local search technique and adaptively regulate the rates of crossover and mutation operations during its search process. For the adaptive scheme, the ratio of degree of dispersion resulting from the various fitness values of the populations at continuous two generations is considered. For the local search technique, an improved iterative hill climbing method is used and incorporated into genetic algorithm (GA) loop. In order to demonstrate the efficiency of the aGA, i) a canonical GA without any adaptive scheme and ii) several conventional aGAs with various adaptive schemes are also presented. These algorithms, including the aGA, are tested and analyzed each other using various test problems. Numerical results by various measures of performance show that the proposed aGA outperforms the conventional algorithms.

Real-Time Non-Local Means Image Denoising Algorithm Based on Local Binary Descriptor

  • Yu, Hancheng;Li, Aiting
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.2
    • /
    • pp.825-836
    • /
    • 2016
  • In this paper, a speed-up technique for the non-local means (NLM) image denoising method based on local binary descriptor (LBD) is proposed. In the NLM, most of the computation time is spent on searching for non-local similar patches in the search window. The local binary descriptor which represents the structure of patch as binary strings is employed to speed up the search process in the NLM. The descriptor allows for a fast and accurate preselection of non-local similar patches by bitwise operations. Using this approach, a tradeoff between time-saving and noise removal can be obtained. Simulations exhibit that despite being principally constructed for speed, the proposed algorithm outperforms in terms of denoising quality as well. Furthermore, a parallel implementation on GPU brings NLM-LBD to real-time image denoising.

Perturbation Using Out-of-Kilter Arc of the Asymmetric Traveling Salesman Problem (비대칭 외판원문제에서 Out-of-Kilter호를 이용한 Perturbation)

  • Kwon Sang Ho
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.30 no.2
    • /
    • pp.157-167
    • /
    • 2005
  • This paper presents a new perturbation technique for developing efficient iterated local search procedures for the asymmetric traveling salesman problem(ATSP). This perturbation technique uses global information on ATSP instances to speed-up computation and to improve the quality of the tours found by heuristic method. The main idea is to escape from a local optima by introducing perturbations on the out-of-kilter arcs in the problem instance. For a local search heuristic, we use the Kwon which finds optimum or near-optimum solutions by applying the out-of-kilter algorithm to the ATSP. The performance of our algorithm has been tested and compared with known method perturbing on randomly chosen arcs. A number of experiments has been executed both on the well-known TSPLIB instances for which the optimal tour length is known, and on randomly generated Instances. for 27 TSPLIB instances, the presented algorithm has found optimal tours on all instances. And it has effectively found tours near AP lower bound on randomly generated instances.

Optimum Design of Local Structure in Ship Based on Global Search Method (전역탐색법을 이용한 선박 국부구조물의 최적설계)

  • 공영모;최수현;송진대;양보석
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.416-420
    • /
    • 2004
  • Recently, the importance of vibration reduction at the local structure such as tank, deck which attached machinery and compass deck, has continuously increased by owner and shipbuilder. Because crews are afflicted with them and severe vibration problems affect on the crack of structure. This study conducted optimum design to get a stiffener size of local structure to reducing the vibration level and dec leasing the weight of structure in ship. Random tabu search method (R-Tabu) has fast converging time and can search variables size domains for nonlinear problems. This paper used Nastran external call type independence optimization method which makes using a solver module from Nastran.

  • PDF