ITC/USA 2006 Conference Proceedings / The Forty-Second Annual International Telemetering Conference and Technical Exhibition / October 23-26, 2006 / Town and Country Resort & Convention Center, San Diego, California / Most modern digital filtering is done by taking the average (mean) of a signal or some weighted average. Another method is to use feedback, which more closely resembles how analog filters with feedback operate. In the case of low pass filters, all these methods tend to give a trade off in getting the signal to pass while attenuating the higher frequency noise. An alternative is to use a median filter, which selects the mid value of a group of points. While this is not as computationally simple as other filters, it allows for the attenuation of noise while allowing sudden changes in signal level to pass thru unaltered. This paper discusses the characteristics of median filters and methods of implementing them.

No description available.

No description available.

Thesis (M.Sc.)--York University, 2007. Graduate Programme in Kinesiology & Health Science. / Typescript. Includes bibliographical references (leaves 72-83). Also available on the Internet. MODE OF ACCESS via web browser by entering the following URL: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&res_dat=xri:pqdiss&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&rft_dat=xri:pqdiss:MR38803

No description available.

The p-median problem is an NP-complete combinatorial optimization problem often used in the fields of facility location and clustering. Given a graph with n nodes and an integer p < n, the p-median problem seeks a set of p medians such that the sum of the distances of the n nodes from their nearest median is minimized. This dissertation develops a genetic algorithm that generates solutions to the p-median problem that improves on previously published genetic algorithms by implementing operators that exploit domain specific information. More specifically, this GA explores the following: (1) The advantages of using "good" solutions generated using extant heuristics in the initial generation of chromosomes. (2) The effectiveness of a crossover operation that exchanges centers in the same neighborhood rather than exchanging arbitrarily chosen subsets of centers. (3) The efficacy of using a biased mutation operator that favors replacing existing medians from less fit chromosomes with non-median nodes from the same neighborhood as the median being replaced. Using published problem sets with known solutions, this dissertation examines solutions identified by the new genetic algorithm in order to determine the accuracy, efficiency and performance characteristics of the new algorithm. In addition, it tests the contribution of each of the algorithm's operators by systematically controlling for all the other factors. The results of the analysis showed that integrating operators that exploited domain specific information did have an overall positive impact on the genetic algorithm. In addition, the results showed that using a structured initial population had little impact on the algorithm's ability to find an optimal solution but it did create a better initial solution and allowed the algorithm to produce a relatively good solution early in the search. Also, the analysis showed that a directed approach to crossover operations was effective and produced superior solutions. Finally, the analysis showed that a directed approach toward mutation did not have a large impact on the overall functionality of the algorithm and may be inferior to an arbitrary approach to mutation.

Thesis (M.S.)--West Virginia University, 2003. / Title from document title page. Document formatted into pages; contains viii, 86, 82 p. : ill. (some col.). Includes abstract. Includes bibliographical references (p. 85-86).

Thesis (M.S.)--University of Missouri-Columbia, 2008. / The entire dissertation/thesis text is included in the research.pdf file; the official abstract appears in the short.pdf file (which also appears in the research.pdf); a non-technical general description, or public abstract, appears in the public.pdf file. Title from title screen of research.pdf file (viewed on August 10, 2009) Includes bibliographical references.

Thesis (doctoral)--Uppsala University, 1983. / Includes bibliographical references (p. 19-21).

Thesis (M.S.)--Brigham Young University. Dept. of Civil and Environmental Engineering, 2006. / Includes bibliographical references (p. 127-129).