Relevant bibliographies by topics / Random search

Academic literature on the topic 'Random search'

Author: Grafiati
Published: 4 June 2021
Last updated: 29 May 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Random search.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Random search"

1

Vose, Michael D. "Random heuristic search." Theoretical Computer Science 229, no. 1-2 (November 1999): 103–42. http://dx.doi.org/10.1016/s0304-3975(99)00120-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Devroye, Luc, James King, and Colin McDiarmid. "Random Hyperplane Search Trees." SIAM Journal on Computing 38, no. 6 (January 2009): 2411–25. http://dx.doi.org/10.1137/060678609.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Devroye, Luc, and Ralph Neininger. "Random suffix search trees." Random Structures and Algorithms 23, no. 4 (November 11, 2003): 357–96. http://dx.doi.org/10.1002/rsa.10103.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Sandev, Trifce, Alexander Iomin, and Ljupco Kocarev. "Random search on comb." Journal of Physics A: Mathematical and Theoretical 52, no. 46 (October 23, 2019): 465001. http://dx.doi.org/10.1088/1751-8121/ab4a2c.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Appel, M. J., R. LaBarre, and D. Radulovic. "On Accelerated Random Search." SIAM Journal on Optimization 14, no. 3 (January 2004): 708–31. http://dx.doi.org/10.1137/s105262340240063x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Vincent, Patrick, and Izhak Rubin. "Cooperative search versus random search using UAV swarms." IFAC Proceedings Volumes 37, no. 8 (July 2004): 944–49. http://dx.doi.org/10.1016/s1474-6670(17)32102-x.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Abakuks, A. "THEORY OF GLOBAL RANDOM SEARCH." Bulletin of the London Mathematical Society 24, no. 4 (July 1992): 413–14. http://dx.doi.org/10.1112/blms/24.4.413.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Friedrich, Benjamin M. "Search along persistent random walks." Physical Biology 5, no. 2 (June 24, 2008): 026007. http://dx.doi.org/10.1088/1478-3975/5/2/026007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

MacGregor, James, and Eric Lee. "Menu search: random or systematic?" International Journal of Man-Machine Studies 26, no. 5 (May 1987): 627–31. http://dx.doi.org/10.1016/s0020-7373(87)80075-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Ali, M. M., and C. Storey. "Modified controlled random search algorithms." International Journal of Computer Mathematics 53, no. 3-4 (January 1994): 229–35. http://dx.doi.org/10.1080/00207169408804329.

Full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Random search"

1

Kapur, Nevin. "Additive functionals on random search trees." Available to US Hopkins community, 2003. http://wwwlib.umi.com/dissertations/dlnow/3080695.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Prudius, Andrei A. "Adaptive Random Search Methods for Simulation Optimization." Diss., Georgia Institute of Technology, 2007. http://hdl.handle.net/1853/16318.

Full text
Abstract:
This thesis is concerned with identifying the best decision among a set of possible decisions in the presence of uncertainty. We are primarily interested in situations where the objective function value at any feasible solution needs to be estimated, for example via a ``black-box' simulation procedure. We develop adaptive random search methods for solving such simulation optimization problems. The methods are adaptive in the sense that they use information gathered during previous iterations to decide how simulation effort is expended in the current iteration. We consider random search because such methods assume very little about the structure of the underlying problem, and hence can be applied to solve complex simulation optimization problems with little expertise required from an end-user. Consequently, such methods are suitable for inclusion in simulation software. We first identify desirable features that algorithms for discrete simulation optimization need to possess to exhibit attractive empirical performance. Our approach emphasizes maintaining an appropriate balance between exploration, exploitation, and estimation. We also present two new and almost surely convergent random search methods that possess these desirable features and demonstrate their empirical attractiveness. Second, we develop two frameworks for designing adaptive and almost surely convergent random search methods for discrete simulation optimization. Our frameworks involve averaging, in that all decisions that require estimates of the objective function values at various feasible solutions are based on the averages of all observations collected at these solutions so far. We present two new and almost surely convergent variants of simulated annealing and demonstrate the empirical effectiveness of averaging and adaptivity in the context of simulated annealing. Finally, we present three random search methods for solving simulation optimization problems with uncountable feasible regions. One of the approaches is adaptive, while the other two are based on pure random search. We provide conditions under which the three methods are convergent, both in probability and almost surely. Lastly, we include a computational study that demonstrates the effectiveness of the methods when compared to some other approaches available in the literature.
APA, Harvard, Vancouver, ISO, and other styles
3

Lančinskas, Algirdas. "Parallelization of random search global optimization algorithms." Doctoral thesis, Lithuanian Academic Libraries Network (LABT), 2013. http://vddb.laba.lt/obj/LT-eLABa-0001:E.02~2013~D_20130620_110438-17037.

Full text
Abstract:
Global optimization problems are relevant in various fields of research and industry, such as chemistry, biology, biomedicine, operational research, etc. Normally it is easier to solve optimization problems having some specific properties of objective function such as linearity, convexity, differentiability, etc. However, there are a lot of practical problems that do not satisfy such properties or even cannot be expressed in an adequate mathematical form. Therefore, it is popular to use random search optimization methods in solving such optimization problems. The dissertation deals with investigation of random search global optimization algorithms, their parallelization and application to solve practical problems. The work is focused on modification and parallelization of particle swarm optimization and genetic algorithms. The modification of particle swarm optimization algorithm, based on reduction of the search area is proposed, and several strategies to parallelize the algorithm are investigated. The algorithm is applied to solve Multiple Gravity Assist problem using parallel computing system. A hybrid global multi-objective optimization algorithm is developed by modifying single agent stochastic search strategy, and incorporating it into multi-objective optimization genetic algorithm. Several strategies to parallelize multi-objective optimization genetic algorithm is proposed. Parallel algorithms are experimentally investigated by solving competitive facility location... [to full text]
Optimizavimo uždaviniai sutinkami įvairiose mokslo ir pramonės srityse, tokiose kaip chemija, biologija, biomedicina, operacijų tyrimai ir pan. Paprastai efektyviausiai sprendžiami uždaviniai, turintys tam tikras savybes, tokias kaip tikslo funkcijų tiesiškumas, iškilumas, diferencijuojamumas ir pan. Tačiau ne visi praktikoje pasitaikantys optimizavimo uždaviniai tenkina šias savybes, o kartais iš vis negali būti išreiškiami adekvačia matematine išraiška. Tokiems uždaviniam spręsti yra populiarūs atsitiktinės paieškos optimizavimo metodai. Disertacijoje yra tiriami atsitiktinės paieškos optimizavimo metodai, jų lygiagretinimo galimybės ir taikymas praktikoje pasitaikantiems uždaviniams spręsti. Pagrindinis dėmesys skiriamas dalelių spiečiaus optimizavimo ir genetinių algoritmų modifikavimui ir lygiagretinimui. Disertacijoje yra siūloma dalelių spiečiaus optimizavimo algoritmo modifikacija, grįsta pieškos srities siaurinimu, ir tiriamos kelios algoritmo lygiagretinimo strategijos. Algoritmas yra taikomas erdvėlaivių skrydžių trajektorijų optimizavimo uždaviniui spręsti lygiagrečiųjų skaičiavimų sistemose. Taip pat yra siūlomas hibridinis globaliojo daugiakriterio optimizavimo algoritmas, gautas modifikuojant vieno agento stochastinės paieškos algoritmą ir įkomponuojant į daugiakriterio optimizavimo genetinį algoritmą. Siūlomos kelios daugiakriterio genetinio algoritmo lygiagretinimo strategijos. Jų pagrindu gauti lygiagretieji algoritmai eksperimentiškai tiriami sprendžiant... [toliau žr. visą tekstą]
APA, Harvard, Vancouver, ISO, and other styles
4

Buhler, Jeremy. "Search algorithms for biosequences using random projection /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/6919.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kristinsdottir, Birna Pala. "Analysis and development of random search algorithms /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/7108.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Holmgren, Cecilia. "Random Records and Cuttings in Binary Search Trees." Licentiate thesis, Uppsala universitet, Analys och tillämpad matematik, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-141580.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bui, Hoai Thang Computer Science &amp Engineering Faculty of Engineering UNSW. "Guided random-walk based model checking." Awarded by:University of New South Wales. Computer Science & Engineering, 2009. http://handle.unsw.edu.au/1959.4/44829.

Full text
Abstract:
The ever increasing use of computer systems in society brings emergent challenges to companies and system designers. The reliability of software and hardware can be financially critical, and lives can depend on it. The growth in size and complexity of software, and increasing concurrency, compounds the problem. The potential for errors is greater than ever before, and the stakes are higher than ever before. Formal methods, particularly model checking, is an approach that attempts to prove mathematically that a model of the behaviour of a product is correct with respect to certain properties. Certain errors can therefore be proven never to occur in the model. This approach has tremendous potential in system development to provide guarantees of correctness. Unfortunately, in practice, model checking cannot handle the enormous sizes of the models of real-world systems. The reason is that the approach requires an exhaustive search of the model to be conducted. While there are exceptions, in general model checkers are said not to scale well. In this thesis, we deal with this scaling issue by using a guiding technique that avoids searching areas of the model, which are unlikely to contain errors. This technique is based on a process of model abstraction in which a new, much smaller model is generated that retains certain important model information but discards the rest. This new model is called a heuristic. While model checking using a heuristic as a guide can be extremely effective, in the worst case (when the guide is of no help), it performs the same as exhaustive search, and hence it also does not scale well in all cases. A second technique is employed to deal with the scaling issue. This technique is based on the concept of random walks. A random walk is simply a `walk' through the model of the system, carried out by selecting states in the model randomly. Such a walk may encounter an error, or it may not. It is a non-exhaustive technique in the sense that only a manageable number of walks are carried out before the search is terminated. This technique cannot replace the conventional model checking as it can never guarantee the correctness of a model. It can however, be a very useful debugging tool because it scales well. From this point of view, it relieves the system designer from the difficult task of dealing with the problem of size in model checking. Using random walks, the effort goes instead into looking for errors. The effectiveness of model checking can be greatly enhanced if the above two techniques are combined: a random walk is used to search for errors, but the walk is guided by a heuristic. This in a nutshell is the focus of this work. We should emphasise that the random walk approach uses the same formal model as model checking. Furthermore, the same heuristic technique is used to guide the random walk as a guided model checker. Together, guidance and random walks are shown in this work to result in vastly improved performance over conventional model checking. Verification has been sacrificed of course, but the new technique is able to find errors far more quickly, and deal with much larger models.
APA, Harvard, Vancouver, ISO, and other styles
8

Yu, Wei, and 余韡. "Reverse Top-k search using random walk with restart." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2013. http://hdl.handle.net/10722/197515.

Full text
Abstract:
With the increasing popularity of social networking applications, large volumes of graph data are becoming available. Large graphs are also derived by structure extraction from relational, text, or scientific data (e.g., relational tuple networks, citation graphs, ontology networks, protein-protein interaction graphs). Nodeto-node proximity is the key building block for many graph based applications that search or analyze the data. Among various proximity measures, random walk with restart (RWR) is widely adapted because of its ability to consider the global structure of the whole network. Although RWR-based similarity search has been well studied before, there is no prior work on reverse top-k proximity search in graphs based on RWR. We discuss the applicability of this query and show that the direct application of existing methods on RWR-based similarity search to solve reverse top-k queries has very high computational and storage demands. To address this issue, we propose an indexing technique, paired with an on-line reverse top-k search algorithm. In the indexing step, we compute from the graph G a graph index, which is based on a K X |V| matrix, containing in each column v the K largest approximate proximity values from v to any other node in G. K is application-dependent and represents the highest value of k in a practical reverse top-k query. At each column v of the index, the approximate values are lower bounds of the K largest proximity values from v to all other nodes. Given the graph index and a reverse top-k query q (k _ K), we prove that the exact proximities from any node v to query q can be efficiently computed by applying the power method. By comparing these with the corresponding lower bounds taken from the k-th row of the graph index, we are able to determine which nodes are certainly not in the reverse top-k result of q. For some of the remaining nodes, we may also be able to determine that they are certainly in the reverse top-k result of q, based on derived upper bounds for the k-th largest proximity value from them. Finally, for any candidate that remains, we progressively refine its approximate proximities, until based on its lower or upper bound it can be determined not to be or to be in the result. The proximities refined during a reverse top-k are used to update the graph index, making its values progressively more accurate for future queries. Our experimental evaluation shows that our technique is efficient and has manageable storage requirements even when applied on very large graphs. We also show the effectiveness of the reverse top-k search in the scenarios of spam detection and determining the popularity of authors.
published_or_final_version
Computer Science
Master
Master of Philosophy
APA, Harvard, Vancouver, ISO, and other styles
9

Serrano, Bermejo Guillermo (Will). "Internet search assistant based on the random neural network." Thesis, Imperial College London, 2017. http://hdl.handle.net/10044/1/61781.

Full text
Abstract:
Web users can not be guaranteed that the results provided by Web search engines or recommender systems are either exhaustive or relevant to their search needs. Businesses have the commercial interest to rank higher on results or recommendations to attract more customers while Web search engines and recommender systems make their profit based on their advertisements. This research analyses the result rank relevance provided by the different Web search engines, metasearch engines, academic databases and recommender systems. We propose an Intelligent Search Assistant (ISA) that addresses these issues from the perspective of end-users acting as an interface between users and the different search engines; it emulates a Web Search Recommender System for general topic queries where the user explores the results provided. Our ISA sends the original query, retrieves the provided options from the Web and reorders the results. The proposed mathematical model of our ISA divides a user query into a multidimensional term vector. Our ISA is based on the Random Neural Network with Deep Learning Clusters. The potential value of each neuron or cluster is calculated by applying our innovative cost function to each snippet and weighting its dimension terms with different relevance parameters. Our ISA adapts to the perceived user interest learning user relevance on an iterative process where the user evaluates directly the listed results. Gradient Descent and Reinforcement Learning are used independently to update the Random Neural Network weights and we evaluate their performance based on the learning speed and result relevance. Finally, we present a new relevance metric which combines relevance and rank. We use this metric to validate and assess the learning performance of our proposed algorithm against other search engines. In some situations, our ISA and its iterative learning outperforms other search engines and recommender systems.
APA, Harvard, Vancouver, ISO, and other styles
10

Owen, David R. "Random search of AND-OR graphs representing finite-state models." Morgantown, W. Va. : [West Virginia University Libraries], 2002. http://etd.wvu.edu/templates/showETD.cfm?recnum=2317.

Full text
Abstract:
Thesis (M.S.)--West Virginia University, 2002.
Title from document title page. Document formatted into pages; contains vi, 96 p. : ill. Includes abstract. Includes bibliographical references (p. 91-96).
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Random search"

1

Mahmoud, Hosam M. Evolution of random search trees. New York: Wiley, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

J, Pintér, ed. Theory of global random search. Dordrecht [Netherlands]: Kluwer Academic Publishers, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Zhigljavsky, Anatoly A. Theory of Global Random Search. Edited by J. Pintér. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-011-3436-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tarasenko, Georgiĭ Stepanovich. Stochastic optimization in the Soviet Union: Random search algorithms. Falls Church, Va. (7700 Leesburg Pike, #250, Falls Church 22043): Delphic Associates, 1985.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Andrei, Neculai. A Derivative-free Two Level Random Search Method for Unconstrained Optimization. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-68517-1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Viswanathan, Gandhimohan M. The physics of foraging: An introduction to random searches and biological encounters. Cambridge: Cambridge University Press, 2011.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Zhigljavsky, Anatoly A. Theory of Global Random Search. Springer, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zhigljavsky, Anatoly A. Theory of Global Random Search. Anatoly A Zhigljavsky, 2012.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

P, Dhawan Atam, and United States. National Aeronautics and Space Administration., eds. Genetic algorithms as global random search methods. [Washington, DC: National Aeronautics and Space Administration, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Rhodes, Dustin. Random Words and Letters V1: Search for God. Lulu.com, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Random search"

1

Kozen, Dexter C. "Random Search Trees." In The Design and Analysis of Algorithms, 65–70. New York, NY: Springer New York, 1992. http://dx.doi.org/10.1007/978-1-4612-4400-4_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tipton, William W., and Richard G. Hennig. "Random Search Methods." In Modern Methods of Crystal Structure Prediction, 55–66. Weinheim, Germany: Wiley-VCH Verlag GmbH & Co. KGaA, 2010. http://dx.doi.org/10.1002/9783527632831.ch3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Méndez, Vicenç, Daniel Campos, and Frederic Bartumeus. "Random Search Strategies." In Springer Series in Synergetics, 177–205. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39010-4_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Holcman, David, and Zeev Schuss. "Random Search with Switching." In Stochastic Narrow Escape in Molecular and Cellular Biology, 169–82. New York, NY: Springer New York, 2015. http://dx.doi.org/10.1007/978-1-4939-3103-3_7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Devroye, Luc. "Random Multivariate Search Trees." In Learning Theory, 1. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11776420_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Popławski, Artur. "Games and Random Search." In Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 29–47. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-16989-3_3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Marti, Kurt. "Special Random Search Methods." In International Series in Operations Research & Management Science, 179–85. Cham: Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-55662-4_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Zabinsky, Zelda B. "Pure Random Search and Pure Adaptive Search." In Nonconvex Optimization and Its Applications, 25–54. Boston, MA: Springer US, 2003. http://dx.doi.org/10.1007/978-1-4419-9182-9_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Patrick, Matthew, Rob Alexander, Manuel Oriol, and John A. Clark. "Efficient Subdomains for Random Testing." In Search Based Software Engineering, 251–56. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013. http://dx.doi.org/10.1007/978-3-642-39742-4_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhigljavsky, Anatoly A., and J. Pintér. "Global Optimization Theory: General Concepts." In Theory of Global Random Search, 1–19. Dordrecht: Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-011-3436-1_1.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Random search"

1

Zeng, Caibin, and YangQuan Chen. "Optimal Random Search, Fractional Dynamics and Fractional Calculus." In ASME 2013 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2013. http://dx.doi.org/10.1115/detc2013-12734.

Full text
Abstract:
What is the most efficient search strategy for the random located target sites subject to the physical and biological constraints? Previous results suggested the Levy flight is the best option to characterize this optimal problem, however, which ignores the understanding and learning abilities of the searcher agents. In the paper we propose the Continuous Time Random Walk (C-TRW) optimal search framework and find the optimum for both of search length’s and waiting time’s distributions. Based on fractional calculus technique, we further derive its master equation to show the mechanism of such complex fractional dynamics. Numerous simulations are provided to illustrate the non-destructive and destructive cases.
APA, Harvard, Vancouver, ISO, and other styles
2

Skinner, Cameron, and Patricia J. Riddle. "Random search can outperform mutation." In 2007 IEEE Congress on Evolutionary Computation. IEEE, 2007. http://dx.doi.org/10.1109/cec.2007.4424796.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Liu, Wei, Yunxing Ruan, and Xia Cai. "Object Search via Random Context." In International Conference on Logistics Engineering, Management and Computer Science (LEMCS 2015). Paris, France: Atlantis Press, 2015. http://dx.doi.org/10.2991/lemcs-15.2015.376.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Tang, Z. Bo. "Partitioned Random Search to Optimization." In 1993 American Control Conference. IEEE, 1993. http://dx.doi.org/10.23919/acc.1993.4793305.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Shin, MyungJae, and Joongheon Kim. "Adversarial Imitation Learning via Random Search." In 2019 International Joint Conference on Neural Networks (IJCNN). IEEE, 2019. http://dx.doi.org/10.1109/ijcnn.2019.8852307.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Gu, Jiadong, and Defeng Wu. "A random distribution harmony search algorithm." In 2018 Tenth International Conference on Advanced Computational Intelligence (ICACI ). IEEE, 2018. http://dx.doi.org/10.1109/icaci.2018.8377498.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Olcan, D. I., and B. M. Kolundzija. "Adaptive random search for antenna optimization." In IEEE Antennas and Propagation Society Symposium, 2004. IEEE, 2004. http://dx.doi.org/10.1109/aps.2004.1329870.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Badano, F., A. Jutard, and M. Betemps. "Chamferless robotic assembly using random search." In Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments. IEEE, 1991. http://dx.doi.org/10.1109/icar.1991.240501.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Vose, Michael D. "Logarithmic convergence of random heuristic search." In SPIE's 1994 International Symposium on Optics, Imaging, and Instrumentation, edited by Su-Shing Chen. SPIE, 1994. http://dx.doi.org/10.1117/12.179239.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Zhang, Xuanyang, Pengfei Hou, Xiangyu Zhang, and Jian Sun. "Neural Architecture Search with Random Labels." In 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE, 2021. http://dx.doi.org/10.1109/cvpr46437.2021.01076.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Random search"

1

Jewell, W. S. Random Search for a Probable Object. Fort Belvoir, VA: Defense Technical Information Center, June 1985. http://dx.doi.org/10.21236/ada158688.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Mai, Zhefen, Chunli Lu, Zixun Zhuang, and Hongxia Ma. Effectiveness and safety of Er-xian Decoction (traditional Chinese medicine) for women with Primary ovarian insufficiency. INPLASY - International Platform of Registered Systematic Review and Meta-analysis Protocols, November 2021. http://dx.doi.org/10.37766/inplasy2021.11.0107.

Full text
Abstract:
Review question / Objective: To assess the effectiveness and safety of Er-xian Decoction in the treatment of primary ovarian insufficiency. Information sources: We will search the following electronic databases, including 3 English databases (PubMed, EMBASE, Cochrane Library) and 4 Chinese databases (China national knowledge infrastructure database, Wanfang database, Sinomed Database, and VIP database). The filters were English and Chinese language. The following key words in Title/Abstract or MeSH search headings are used: “Er-xian” and “Hormone replacement therapy” or “Femoston” or “Climen” and “Primary ovarian insufficiency” or “Ovarian failure” or “Premature ovarian failure” or “POI” and “random*” or “Randomized controlled trial”. In addition, we also search the grey literature such as conference proceedings and dissertations in CNKI and Wanfang database, and relevant trials will be searched in ClinicalTrial.gov database [20] and Chinese Clinical Trial Registry for unpublished trials and protocols. References of all included studies will be hand searched for additional eligible studies.
APA, Harvard, Vancouver, ISO, and other styles
3

Ungar, Eugene D., Montague W. Demment, Uri M. Peiper, Emilio A. Laca, and Mario Gutman. The Prediction of Daily Intake in Grazing Cattle Using Methodologies, Models and Experiments that Integrate Pasture Structure and Ingestive Behavior. United States Department of Agriculture, July 1994. http://dx.doi.org/10.32747/1994.7568789.bard.

Full text
Abstract:
This project addressed the prediction of daily intake in grazing cattle using methodologies, models and experiments that integrate pasture structure and ingestive behavior. The broad objective was to develop concepts of optimal foraging that predicted ingestive behavior and instantaneous intake rate in single and multi-patch environments and extend them to the greater scales of time and space required to predict daily intake. Specific objectives included: to determine how sward structure affects the shape of patch depletion curves, to determine if the basic components of ingestive behavior of animals in groups differs from animals alone, and to evaluate and modify our existing models of foraging behavior and heterogeneity to incorporate larger scales of time and space. Patch depletion was found to be predominantly by horizon, with a significant decline in bite weight during horizon depletion. This decline derives from bite overlap, and is more pronounced on taller swards. These results were successfully predicted by a simple bite placement simulator. At greater spatial scales, patch selection was aimed at maximizing daily digestible intake, with the between patch search pattern being non-random. The processes of selecting a feeding station and foraging at a feeding station are fundamentally different. The marginal value theorem may not be the most appropriate paradigm for predicting residence time at a feeding station. Basic components of ingestive behavior were unaffected by the presence of other animals. Our results contribute to animal production systems by improving our understanding of the foraging process, by identifying the key sward parameters that determine intake rate and by improving existing conceptual and quantitative models of foraging behavior across spatial and temporal scales.
APA, Harvard, Vancouver, ISO, and other styles
4

Medrano, Juan, Adam Friedmann, Moshe (Morris) Soller, Ehud Lipkin, and Abraham Korol. High resolution linkage disequilibrium mapping of QTL affecting milk production traits in Israel Holstein dairy cattle. United States Department of Agriculture, March 2008. http://dx.doi.org/10.32747/2008.7696509.bard.

Full text
Abstract:
Original objectives: To create BAC contigs covering two QTL containing chromosomal regions (QTLR) and obtain BAC end sequence information as a platform for SNP identification. Use the SNPs to search for marker-QTL linkage disequilibrium (LD) in the test populations (US and Israel Holstein cattle). Identify candidate genes, test for association with dairy cattle production and functional traits, and confirm any associations in a secondary test population. Revisions in the course of the project: The selective recombinant genotyping (SRG) methodology which we implemented to provide moderate resolution QTL mapping turned out to be less effective than expected, due to problems introduced by incomplete marker informativity. This required a no-cost one-year extension of the project. Aside from this, the project was implemented essentially as envisaged, but only with respect to a single QTLR and single population association-test. Background to the topic. Dairy cattle breeders are looking to marker-assisted selection (MAS) as a means of identifying genetically superior sires and dams. MAS based on population-wide LD can be many times more effective than MAS based on within-family linkage mapping. In this proposal we developed a protocol leading from family based QTL mapping to population-wide LD between markers and the QTL Major conclusions, solutions, achievements. The critical importance of marker informativity for application of the SRG design in outcrossing random mating populations was identified, and an alternative Fractioned Pool Design (FPD) based on selective DNA pooling was developed. We demonstrated the feasibility of constructing a BAC contig across a targeted chromosomal region flanking the marker RM188 on bovine chromosome BTA4, which was shown in previous work to contain a QTL affecting milk production traits. BAC end sequences were obtained and successfully screened for SNPs. LD studies of these SNPs in the Israel population, and of an independent set of SNPs taken across the entire proximal region of BTA4 in the USA population, showed a much lower degree of LD than previously reported in the literature. Only at distances in the sub-cM level did an appreciable fraction of SNP marker-pairs show levels of LD useful for MAS. In contrast, studies in the Israel population using microsatellite markers, presented an equivalent degree of LD at a 1-5 separation distance. SNP LD appeared to reflect historical population size of Bostaurus (Ne=5000- 10,000), while microsatellite LD appeared to be in proportion to more recent effective population size of the Holstein breed (Ne=50-100). An appreciable fraction of the observed LD was due to Family admixture structure of the Holstein population. The SNPs MEOX2/IF2G (found within the gene SETMAR at 23,000 bp from RM188) and SNP23 were significantly associated with PTA protein, Cheese dollars and Net Merit Protein in the Davis bull resource population, and were also associated with protein and casein percentages in the Davis cow resource population. Implications. These studies document a major difference in degree of LD presented by SNPs as compared to microsatellites, and raise questions as to the source of this difference and its implications for QTL mapping and MAS. The study lends significant support to the targeted approach to fine map a previously identified QTL. Using high density genotyping with SNP discovered in flanking genes to the QTL, we have identified important markers associated with milk protein percentage that can be tested in markers assisted selection programs.
APA, Harvard, Vancouver, ISO, and other styles
5

McDonagh, Marian S., Jesse Wagner, Azrah Y. Ahmed, Rongwei Fu, Benjamin Morasco, Devan Kansagara, and Roger Chou. Living Systematic Review on Cannabis and Other Plant-Based Treatments for Chronic Pain. Agency for Healthcare Research and Quality (AHRQ), October 2021. http://dx.doi.org/10.23970/ahrqepccer250.

Full text
Abstract:
Objectives. To evaluate the evidence on benefits and harms of cannabinoids and similar plant-based compounds to treat chronic pain. Data sources. Ovid® MEDLINE®, PsycINFO®, Embase®, the Cochrane Library, and SCOPUS® databases, reference lists of included studies, submissions received after Federal Register request were searched to July 2021. Review methods. Using dual review, we screened search results for randomized controlled trials (RCTs) and observational studies of patients with chronic pain evaluating cannabis, kratom, and similar compounds with any comparison group and at least 1 month of treatment or followup. Dual review was used to abstract study data, assess study-level risk of bias, and rate the strength of evidence. Prioritized outcomes included pain, overall function, and adverse events. We grouped studies that assessed tetrahydrocannabinol (THC) and/or cannabidiol (CBD) based on their THC to CBD ratio and categorized them as high-THC to CBD ratio, comparable THC to CBD ratio, and low-THC to CBD ratio. We also grouped studies by whether the product was a whole-plant product (cannabis), cannabinoids extracted or purified from a whole plant, or synthetic. We conducted meta-analyses using the profile likelihood random effects model and assessed between-study heterogeneity using Cochran’s Q statistic chi square and the I2 test for inconsistency. Magnitude of benefit was categorized into no effect or small, moderate, and large effects. Results. From 2,850 abstracts, 20 RCTs (N=1,776) and 7 observational studies (N=13,095) assessing different cannabinoids were included; none of kratom. Studies were primarily short term, and 75 percent enrolled patients with a variety of neuropathic pain. Comparators were primarily placebo or usual care. The strength of evidence (SOE) was low, unless otherwise noted. Compared with placebo, comparable THC to CBD ratio oral spray was associated with a small benefit in change in pain severity (7 RCTs, N=632, 0 to10 scale, mean difference [MD] −0.54, 95% confidence interval [CI] −0.95 to −0.19, I2=28%; SOE: moderate) and overall function (6 RCTs, N=616, 0 to 10 scale, MD −0.42, 95% CI −0.73 to −0.16, I2=24%). There was no effect on study withdrawals due to adverse events. There was a large increased risk of dizziness and sedation and a moderate increased risk of nausea (dizziness: 6 RCTs, N=866, 30% vs. 8%, relative risk [RR] 3.57, 95% CI 2.42 to 5.60, I2=0%; sedation: 6 RCTs, N=866, 22% vs. 16%, RR 5.04, 95% CI 2.10 to 11.89, I2=0%; and nausea: 6 RCTs, N=866, 13% vs. 7.5%, RR 1.79, 95% CI 1.20 to 2.78, I2=0%). Synthetic products with high-THC to CBD ratios were associated with a moderate improvement in pain severity, a moderate increase in sedation, and a large increase in nausea (pain: 6 RCTs, N=390 to 10 scale, MD −1.15, 95% CI −1.99 to −0.54, I2=39%; sedation: 3 RCTs, N=335, 19% vs. 10%, RR 1.73, 95% CI 1.03 to 4.63, I2=0%; nausea: 2 RCTs, N=302, 12% vs. 6%, RR 2.19, 95% CI 0.77 to 5.39; I²=0%). We found moderate SOE for a large increased risk of dizziness (2 RCTs, 32% vs. 11%, RR 2.74, 95% CI 1.47 to 6.86, I2=0%). Extracted whole-plant products with high-THC to CBD ratios (oral) were associated with a large increased risk of study withdrawal due to adverse events (1 RCT, 13.9% vs. 5.7%, RR 3.12, 95% CI 1.54 to 6.33) and dizziness (1 RCT, 62.2% vs. 7.5%, RR 8.34, 95% CI 4.53 to 15.34). We observed a moderate improvement in pain severity when combining all studies of high-THC to CBD ratio (8 RCTs, N=684, MD −1.25, 95% CI −2.09 to −0.71, I2=50%; SOE: moderate). Evidence on whole-plant cannabis, topical CBD, low-THC to CBD, other cannabinoids, comparisons with active products, and impact on use of opioids was insufficient to draw conclusions. Other important harms (psychosis, cannabis use disorder, and cognitive effects) were not reported. Conclusions. Low to moderate strength evidence suggests small to moderate improvements in pain (mostly neuropathic), and moderate to large increases in common adverse events (dizziness, sedation, nausea) and study withdrawal due to adverse events with high- and comparable THC to CBD ratio extracted cannabinoids and synthetic products in short-term treatment (1 to 6 months). Evidence for whole-plant cannabis, and other comparisons, outcomes, and PBCs were unavailable or insufficient to draw conclusions. Small sample sizes, lack of evidence for moderate and long-term use and other key outcomes, such as other adverse events and impact on use of opioids during treatment, indicate that more research is needed.
APA, Harvard, Vancouver, ISO, and other styles
6

Carney, Nancy, Tamara Cheney, Annette M. Totten, Rebecca Jungbauer, Matthew R. Neth, Chandler Weeks, Cynthia Davis-O'Reilly, et al. Prehospital Airway Management: A Systematic Review. Agency for Healthcare Research and Quality (AHRQ), June 2021. http://dx.doi.org/10.23970/ahrqepccer243.

Full text
Abstract:
Objective. To assess the comparative benefits and harms across three airway management approaches (bag valve mask [BVM], supraglottic airway [SGA], and endotracheal intubation [ETI]) by emergency medical services in the prehospital setting, and how the benefits and harms differ based on patient characteristics, techniques, and devices. Data sources. We searched electronic citation databases (Ovid® MEDLINE®, CINAHL®, the Cochrane Central Register of Controlled Trials, the Cochrane Database of Systematic Reviews, and Scopus®) from 1990 to September 2020 and reference lists, and posted a Federal Register notice request for data. Review methods. Review methods followed Agency for Healthcare Research and Quality Evidence-based Practice Center Program methods guidance. Using pre-established criteria, studies were selected and dual reviewed, data were abstracted, and studies were evaluated for risk of bias. Meta-analyses using profile-likelihood random effects models were conducted when data were available from studies reporting on similar outcomes, with analyses stratified by study design, emergency type, and age. We qualitatively synthesized results when meta-analysis was not indicated. Strength of evidence (SOE) was assessed for primary outcomes (survival, neurological function, return of spontaneous circulation [ROSC], and successful advanced airway insertion [for SGA and ETI only]). Results. We included 99 studies (22 randomized controlled trials and 77 observational studies) involving 630,397 patients. Overall, we found few differences in primary outcomes when airway management approaches were compared. • For survival, there was moderate SOE for findings of no difference for BVM versus ETI in adult and mixed-age cardiac arrest patients. There was low SOE for no difference in these patients for BVM versus SGA and SGA versus ETI. There was low SOE for all three comparisons in pediatric cardiac arrest patients, and low SOE in adult trauma patients when BVM was compared with ETI. • For neurological function, there was moderate SOE for no difference for BVM compared with ETI in adults with cardiac arrest. There was low SOE for no difference in pediatric cardiac arrest for BVM versus ETI and SGA versus ETI. In adults with cardiac arrest, neurological function was better for BVM and ETI compared with SGA (both low SOE). • ROSC was applicable only in cardiac arrest. For adults, there was low SOE that ROSC was more frequent with SGA compared with ETI, and no difference for BVM versus SGA or BVM versus ETI. In pediatric patients there was low SOE of no difference for BVM versus ETI and SGA versus ETI. • For successful advanced airway insertion, low SOE supported better first-pass success with SGA in adult and pediatric cardiac arrest patients and adult patients in studies that mixed emergency types. Low SOE also supported no difference for first-pass success in adult medical patients. For overall success, there was moderate SOE of no difference for adults with cardiac arrest, medical, and mixed emergency types. • While harms were not always measured or reported, moderate SOE supported all available findings. There were no differences in harms for BVM versus SGA or ETI. When SGA was compared with ETI, there were no differences for aspiration, oral/airway trauma, and regurgitation; SGA was better for multiple insertion attempts; and ETI was better for inadequate ventilation. Conclusions. The most common findings, across emergency types and age groups, were of no differences in primary outcomes when prehospital airway management approaches were compared. As most of the included studies were observational, these findings may reflect study design and methodological limitations. Due to the dynamic nature of the prehospital environment, the results are susceptible to indication and survival biases as well as confounding; however, the current evidence does not favor more invasive airway approaches. No conclusion was supported by high SOE for any comparison and patient group. This supports the need for high-quality randomized controlled trials designed to account for the variability and dynamic nature of prehospital airway management to advance and inform clinical practice as well as emergency medical services education and policy, and to improve patient-centered outcomes.
APA, Harvard, Vancouver, ISO, and other styles
7

Selph, Shelly S., Andrea C. Skelly, Ngoc Wasson, Joseph R. Dettori, Erika D. Brodt, Erik Ensrud, Diane Elliot, et al. Physical Activity and the Health of Wheelchair Users: A Systematic Review in Multiple Sclerosis, Cerebral Palsy, and Spinal Cord Injury. Agency for Healthcare Research and Quality (AHRQ), October 2021. http://dx.doi.org/10.23970/ahrqepccer241.

Full text
Abstract:
Objectives. Although the health benefits of physical activity are well described for the general population, less is known about the benefits and harms of physical activity in people dependent upon, partially dependent upon, or at risk for needing a wheelchair. This systematic review summarizes the evidence for physical activity in people with multiple sclerosis, cerebral palsy, and spinal cord injury regardless of current use or nonuse of a wheelchair. Data sources. We searched MEDLINE®, CINAHL®, PsycINFO®, Cochrane CENTRAL, Embase®, and Rehabilitation and Sports Medicine Source from 2008 through November 2020, reference lists, and clinical trial registries. Review methods. Predefined criteria were used to select randomized controlled trials, quasiexperimental nonrandomized trials, and cohort studies that addressed the benefits and harms of observed physical activity (at least 10 sessions on 10 different days of movement using more energy than rest) in participants with multiple sclerosis, cerebral palsy, and spinal cord injury. Individual study quality (risk of bias) and the strength of bodies of evidence for key outcomes were assessed using prespecified methods. Dual review procedures were used. Effects were analyzed by etiology of impairment and physical activity modality, such as treadmill, aquatic exercises, and yoga, using qualitative, and when appropriate, quantitative synthesis using random effects meta-analyses. Results. We included 146 randomized controlled trials, 15 quasiexperimental nonrandomized trials, and 7 cohort studies (168 studies in 197 publications). More studies enrolled participants with multiple sclerosis (44%) than other conditions, followed by cerebral palsy (38%) and spinal cord injury (18%). Most studies were rated fair quality (moderate risk of bias). The majority of the evidence was rated low strength. • In participants with multiple sclerosis, walking ability may be improved with treadmill training and multimodal exercise regimens that include strength training; function may be improved with treadmill training, balance exercises, and motion gaming; balance is likely improved with postural control exercises (which may also reduce risk of falls) and may be improved with aquatic exercises, robot-assisted gait training, treadmill training, motion gaming, and multimodal exercises; activities of daily living may be improved with aquatic therapy; sleep may be improved with aerobic exercises; aerobic fitness may be improved with multimodal exercises; and female sexual function may be improved with aquatic exercise. • In participants with cerebral palsy, balance may be improved with hippotherapy and motion gaming, and function may be improved with cycling, treadmill training, and hippotherapy. • In participants with spinal cord injury, evidence suggested that activities of daily living may be improved with robot-assisted gait training. • When randomized controlled trials were pooled across types of exercise, physical activity interventions were found to improve walking in multiple sclerosis and likely improve balance and depression in multiple sclerosis. Physical activity may improve function and aerobic fitness in people with cerebral palsy or spinal cord injury. When studies of populations with multiple sclerosis and cerebral palsy were combined, evidence indicated dance may improve function. • Evidence on long-term health outcomes was not found for any analysis groups. For intermediate outcomes such as blood pressure, lipid profile, and blood glucose, there was insufficient evidence from which to draw conclusions. There was inadequate reporting of adverse events in many trials. Conclusions. Physical activity was associated with improvements in walking ability, general function, balance (including fall risk), depression, sleep, activities of daily living, female sexual function, and aerobic capacity, depending on population enrolled and type of exercise utilized. No studies reported long-term cardiovascular or metabolic disease health outcomes. Future trials could alter these findings; further research is needed to examine health outcomes, and to understand the magnitude and clinical importance of benefits seen in intermediate outcomes.
APA, Harvard, Vancouver, ISO, and other styles
8

Galili, Naftali, Roger P. Rohrbach, Itzhak Shmulevich, Yoram Fuchs, and Giora Zauberman. Non-Destructive Quality Sensing of High-Value Agricultural Commodities Through Response Analysis. United States Department of Agriculture, October 1994. http://dx.doi.org/10.32747/1994.7570549.bard.

Full text
Abstract:
The objectives of this project were to develop nondestructive methods for detection of internal properties and firmness of fruits and vegetables. One method was based on a soft piezoelectric film transducer developed in the Technion, for analysis of fruit response to low-energy excitation. The second method was a dot-matrix piezoelectric transducer of North Carolina State University, developed for contact-pressure analysis of fruit during impact. Two research teams, one in Israel and the other in North Carolina, coordinated their research effort according to the specific objectives of the project, to develop and apply the two complementary methods for quality control of agricultural commodities. In Israel: An improved firmness testing system was developed and tested with tropical fruits. The new system included an instrumented fruit-bed of three flexible piezoelectric sensors and miniature electromagnetic hammers, which served as fruit support and low-energy excitation device, respectively. Resonant frequencies were detected for determination of firmness index. Two new acoustic parameters were developed for evaluation of fruit firmness and maturity: a dumping-ratio and a centeroid of the frequency response. Experiments were performed with avocado and mango fruits. The internal damping ratio, which may indicate fruit ripeness, increased monotonically with time, while resonant frequencies and firmness indices decreased with time. Fruit samples were tested daily by destructive penetration test. A fairy high correlation was found in tropical fruits between the penetration force and the new acoustic parameters; a lower correlation was found between this parameter and the conventional firmness index. Improved table-top firmness testing units, Firmalon, with data-logging system and on-line data analysis capacity have been built. The new device was used for the full-scale experiments in the next two years, ahead of the original program and BARD timetable. Close cooperation was initiated with local industry for development of both off-line and on-line sorting and quality control of more agricultural commodities. Firmalon units were produced and operated in major packaging houses in Israel, Belgium and Washington State, on mango and avocado, apples, pears, tomatoes, melons and some other fruits, to gain field experience with the new method. The accumulated experimental data from all these activities is still analyzed, to improve firmness sorting criteria and shelf-life predicting curves for the different fruits. The test program in commercial CA storage facilities in Washington State included seven apple varieties: Fuji, Braeburn, Gala, Granny Smith, Jonagold, Red Delicious, Golden Delicious, and D'Anjou pear variety. FI master-curves could be developed for the Braeburn, Gala, Granny Smith and Jonagold apples. These fruits showed a steady ripening process during the test period. Yet, more work should be conducted to reduce scattering of the data and to determine the confidence limits of the method. Nearly constant FI in Red Delicious and the fluctuations of FI in the Fuji apples should be re-examined. Three sets of experiment were performed with Flandria tomatoes. Despite the complex structure of the tomatoes, the acoustic method could be used for firmness evaluation and to follow the ripening evolution with time. Close agreement was achieved between the auction expert evaluation and that of the nondestructive acoustic test, where firmness index of 4.0 and more indicated grade-A tomatoes. More work is performed to refine the sorting algorithm and to develop a general ripening scale for automatic grading of tomatoes for the fresh fruit market. Galia melons were tested in Israel, in simulated export conditions. It was concluded that the Firmalon is capable of detecting the ripening of melons nondestructively, and sorted out the defective fruits from the export shipment. The cooperation with local industry resulted in development of automatic on-line prototype of the acoustic sensor, that may be incorporated with the export quality control system for melons. More interesting is the development of the remote firmness sensing method for sealed CA cool-rooms, where most of the full-year fruit yield in stored for off-season consumption. Hundreds of ripening monitor systems have been installed in major fruit storage facilities, and being evaluated now by the consumers. If successful, the new method may cause a major change in long-term fruit storage technology. More uses of the acoustic test method have been considered, for monitoring fruit maturity and harvest time, testing fruit samples or each individual fruit when entering the storage facilities, packaging house and auction, and in the supermarket. This approach may result in a full line of equipment for nondestructive quality control of fruits and vegetables, from the orchard or the greenhouse, through the entire sorting, grading and storage process, up to the consumer table. The developed technology offers a tool to determine the maturity of the fruits nondestructively by monitoring their acoustic response to mechanical impulse on the tree. A special device was built and preliminary tested in mango fruit. More development is needed to develop a portable, hand operated sensing method for this purpose. In North Carolina: Analysis method based on an Auto-Regressive (AR) model was developed for detecting the first resonance of fruit from their response to mechanical impulse. The algorithm included a routine that detects the first resonant frequency from as many sensors as possible. Experiments on Red Delicious apples were performed and their firmness was determined. The AR method allowed the detection of the first resonance. The method could be fast enough to be utilized in a real time sorting machine. Yet, further study is needed to look for improvement of the search algorithm of the methods. An impact contact-pressure measurement system and Neural Network (NN) identification method were developed to investigate the relationships between surface pressure distributions on selected fruits and their respective internal textural qualities. A piezoelectric dot-matrix pressure transducer was developed for the purpose of acquiring time-sampled pressure profiles during impact. The acquired data was transferred into a personal computer and accurate visualization of animated data were presented. Preliminary test with 10 apples has been performed. Measurement were made by the contact-pressure transducer in two different positions. Complementary measurements were made on the same apples by using the Firmalon and Magness Taylor (MT) testers. Three-layer neural network was designed. 2/3 of the contact-pressure data were used as training input data and corresponding MT data as training target data. The remaining data were used as NN checking data. Six samples randomly chosen from the ten measured samples and their corresponding Firmalon values were used as the NN training and target data, respectively. The remaining four samples' data were input to the NN. The NN results consistent with the Firmness Tester values. So, if more training data would be obtained, the output should be more accurate. In addition, the Firmness Tester values do not consistent with MT firmness tester values. The NN method developed in this study appears to be a useful tool to emulate the MT Firmness test results without destroying the apple samples. To get more accurate estimation of MT firmness a much larger training data set is required. When the larger sensitive area of the pressure sensor being developed in this project becomes available, the entire contact 'shape' will provide additional information and the neural network results would be more accurate. It has been shown that the impact information can be utilized in the determination of internal quality factors of fruit. Until now,
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Random search' for particular source types:
Journal articles Dissertations / Theses Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography