Log in

Relevant bibliographies by topics / Search for moments stopping / Journal articles

Journal articles on the topic 'Search for moments stopping'

To see the other types of publications on this topic, follow the link: Search for moments stopping.

Author: Grafiati

Published: 30 May 2022

Last updated: 31 May 2022

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

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Search for moments stopping.'

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.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

ANKIRCHNER, STEFAN, GREGOR HEYNE, and PETER IMKELLER. "A BSDE APPROACH TO THE SKOROKHOD EMBEDDING PROBLEM FOR THE BROWNIAN MOTION WITH DRIFT." Stochastics and Dynamics 08, no. 01 (March 2008): 35–46. http://dx.doi.org/10.1142/s0219493708002160.

Full text

Abstract:

We solve Skorokhod's embedding problem for Brownian motion with linear drift (Wt + κ t)t≥0 by means of techniques of stochastic control theory. The search for a stopping time T such that the law of WT + κ T coincides with a prescribed law μ possessing the first moment is based on solutions of backward stochastic differential equations of quadratic type. This new approach generalizes an approach by Bass [3] of the classical version of Skorokhod's embedding problem using martingale representation techniques.

APA, Harvard, Vancouver, ISO, and other styles

2

Szcześniak, Magda, and Łukasz Zaremba. "Paranoid looking: on de-communization." Journal of Visual Culture 18, no. 2 (August 2019): 209–33. http://dx.doi.org/10.1177/1470412919861398.

Full text

Abstract:

According to the famous statement by Robert Musil, ‘there is nothing in this world as invisible as monuments, attention runs down them without stopping for a moment.’ However, the moment when they suddenly become visible as the centre of intense social conflicts, it is difficult to believe they had been invisible for so long. This article analyses practices of contemporary iconoclastic gestures directed at monuments, examining the differences between recent iconoclastic acts in the United States and in Poland. Contrary to progressive anti-racist iconoclastic practices in the United States, the authors argue that the recent wave of attacks against monuments in Poland, connected to the state-sanctioned politics of ‘de-communization’, derives from a conservative vision of history and the public sphere. Drawing on Eve Kosofsky Sedgwick’s concept of ‘paranoid reading’, the authors show how the ‘de-communization’ project activates a particular ‘way of seeing’: paranoid looking, through which public spaces are turned into environments filled with objects that need to be suspiciously examined and assessed. The paranoid look works against the invisibility of monuments, aiming to extract objects from the landscape in order to further examine them in search of any suspicious elements – formal and stylistic features, more or less intelligible symbols and so on that will shed light on their under-acknowledged capacity for both culpability and criticality.

APA, Harvard, Vancouver, ISO, and other styles

3

Avrunin, Grygoriy, Igor Kyrychenko, Vladimir Shatokhin, Dmitriy Shevchenko, and Irene Moroz. "Dynamics of the hydraulic fluid power of rotation of the hose concrete pump." Bulletin of Kharkov National Automobile and Highway University 1, no. 92 (March 4, 2021): 135. http://dx.doi.org/10.30977/bul.2219-5548.2021.92.1.135.

Full text

Abstract:

Purpose. Search for ways to improve the technical level of the hydraulic fluid power of a hose concrete pump by analyzing the hydraulic schematic diagram and dynamic characteristics depending on the moment of resistance, moment of inertia and properties of the working fluid. Method. The construction of a mathematical model of the dynamics of a hydraulic fluid power is based on Newton's laws of mechanics, Pascal's law and the continuity equation for fluids. The dynamics study was implemented using the VisSim package. The results of studies of the influence of variable parameters on the rotor speed and pressure in the discharge line of the hydraulic motor are presented in graphical form. Results. It was found that in a volumetric hydraulic fluid power of a concrete pump with rotor rotation from a gerotor hydraulic motor, there are significant fluctuations in pressure and speed, due to the kinematics of the pump, temporary factors of the increase in the moment of resistance and supply of the working fluid to the hydraulic motor with the throttle method of its regulation. The ratio of the maximum and steady-state pressure values is 1,9 times obtained for hydraulic motors of different displacement. The possibilities of reducing the dynamic loading of the hydraulic fluid power by improving its hydraulic schematic diagram and control algorithm are shown. Conclusion. Recommendations have been developed for reducing dynamic loads in a hydraulic fluid power by modernizing the hydraulic circuit diagram by introducing electrohydroautomatics devices and changing the algorithm for starting and stopping the pump.

APA, Harvard, Vancouver, ISO, and other styles

4

Teicher, Henry, and Cun-Hui Zhang. "Moments of Some Stopping Rules." Journal of the London Mathematical Society 57, no. 2 (April 1998): 503–12. http://dx.doi.org/10.1112/s0024610798005912.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Bather, J. A. "Search models." Journal of Applied Probability 29, no. 3 (September 1992): 605–15. http://dx.doi.org/10.2307/3214897.

Full text

Abstract:

Mathematical models have been proposed for oil exploration and other kinds of search. They can be used to estimate the amount of undiscovered resources or to investigate optimal stopping times for the search. Here we consider a continuous search for hidden objects using a model which represents the number and values of the objects by mixtures of Poisson processes. The flexibility of the model and its complexity depend on the number of components in the mixture. In simple cases, optimal stopping rules can be found explicitly and more general qualitative results can sometimes be obtained.

APA, Harvard, Vancouver, ISO, and other styles

6

Bather, J. A. "Search models." Journal of Applied Probability 29, no. 03 (September 1992): 605–15. http://dx.doi.org/10.1017/s0021900200043424.

Full text

Abstract:

Mathematical models have been proposed for oil exploration and other kinds of search. They can be used to estimate the amount of undiscovered resources or to investigate optimal stopping times for the search. Here we consider a continuous search for hidden objects using a model which represents the number and values of the objects by mixtures of Poisson processes. The flexibility of the model and its complexity depend on the number of components in the mixture. In simple cases, optimal stopping rules can be found explicitly and more general qualitative results can sometimes be obtained.

APA, Harvard, Vancouver, ISO, and other styles

7

Phipps, Alan G., and William H. Laverty. "Optimal Stopping and Residential Search Behavior." Geographical Analysis 15, no. 3 (September 3, 2010): 187–204. http://dx.doi.org/10.1111/j.1538-4632.1983.tb00781.x.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Browne, Glenn J., and Eric A. Walden. "Stopping information search: An fMRI investigation." Decision Support Systems 143 (April 2021): 113498. http://dx.doi.org/10.1016/j.dss.2021.113498.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Gnedin, Alexander, and Alexander Iksanov. "Moments of Random Sums and Robbins' Problem of Optimal Stopping." Journal of Applied Probability 48, no. 04 (December 2011): 1197–99. http://dx.doi.org/10.1017/s0021900200008718.

Full text

Abstract:

Robbins' problem of optimal stopping is that of minimising the expectedrankof an observation chosen by some nonanticipating stopping rule. We settle a conjecture regarding thevalueof the stopped variable under the rule that yields the minimal expected rank, by embedding the problem in a much more general context of selection problems with the nonanticipation constraint lifted, and with the payoff growing like a power function of the rank.

APA, Harvard, Vancouver, ISO, and other styles

10

Gnedin, Alexander, and Alexander Iksanov. "Moments of Random Sums and Robbins' Problem of Optimal Stopping." Journal of Applied Probability 48, no. 4 (December 2011): 1197–99. http://dx.doi.org/10.1239/jap/1324046028.

Full text

Abstract:

Robbins' problem of optimal stopping is that of minimising the expected rank of an observation chosen by some nonanticipating stopping rule. We settle a conjecture regarding the value of the stopped variable under the rule that yields the minimal expected rank, by embedding the problem in a much more general context of selection problems with the nonanticipation constraint lifted, and with the payoff growing like a power function of the rank.

APA, Harvard, Vancouver, ISO, and other styles

11

Maxwell, David. "Modelling search and stopping in interactive information retrieval." ACM SIGIR Forum 53, no. 1 (June 2019): 40–41. http://dx.doi.org/10.1145/3458537.3458543.

Full text

Abstract:

Searching for information when using a computerised retrieval system is a complex and inherently interactive process. Individuals during a search session may issue multiple queries, and examine a varying number of result summaries and documents per query. Searchers must also decide when to stop assessing content for relevance - or decide when to stop their search session altogether. Despite being such a fundamental activity, only a limited number of studies have explored stopping behaviours in detail, with a majority reporting that searchers stop because they decide that what they have found feels " good enough ". Notwithstanding the limited exploration of stopping during search, the phenomenon is central to the study of Information Retrieval, playing a role in the models and measures that we employ. However, the current de facto assumption considers that searchers will examine k documents - examining up to a fixed depth. In this thesis, we examine searcher stopping behaviours under a number of different search contexts. We conduct and report on two user studies, examining how result summary lengths and a variation of search tasks and goals affect such behaviours. Interaction data from these studies are then used to ground extensive simulations of interaction , exploring a number of different stopping heuristics (operationalised as twelve stopping strategies). We consider how well the proposed strategies perform and match up with real-world stopping behaviours. As part of our contribution, we also propose the Complex Searcher Model , a high-level conceptual searcher model that encodes stopping behaviours at different points throughout the search process (see Figure 1 below). Within the Complex Searcher Model, we also propose a new results page stopping decision point. From this new stopping decision point, searchers can obtain an impression of the page before deciding to enter or abandon it. Results presented and discussed demonstrate that searchers employ a range of different stopping strategies, with no strategy standing out in terms of performance and approximations offered. Stopping behaviours are clearly not fixed, but are rather adaptive in nature. This complex picture reinforces the idea that modelling stopping behaviour is difficult. However, simplistic stopping strategies do offer good performance and approximations, such as the frustration -based stopping strategy. This strategy considers a searcher's tolerance to non-relevance. We also find that combination strategies - such as those combining a searcher's satisfaction with finding relevant material, and their frustration towards observing non-relevant material - also consistently offer good approximations and performance. In addition, we also demonstrate that the inclusion of the additional stopping decision point within the Complex Searcher Model provides significant improvements to performance over our baseline implementation. It also offers improvements to the approximations of real-world searcher stopping behaviours. This work motivates a revision of how we currently model the search process and demonstrates that different stopping heuristics need to be considered within the models and measures that we use in Information Retrieval. Measures should be reformed according to the stopping behaviours of searchers. A number of potential avenues for future exploration can also be considered, such as modelling the stopping behaviours of searchers individually (rather than as a population), and to explore and consider a wider variety of different stopping heuristics under different search contexts. Despite the inherently difficult task that understanding and modelling the stopping behaviours of searchers represents, potential benefits of further exploration in this area will undoubtedly aid the searchers of future retrieval systems - with further work bringing about improved interfaces and experiences. Doctoral Supervisor Dr Leif Azzopardi (University of Strathclyde, Scotland) Examination Committee Professor Iadh Ounis (University of Glasgow, Scotland) and Dr Suzan Verberne (Leiden University, The Netherlands). Thanks to both of you for your insightful and fair questioning during the defence! Availability This thesis is available to download from http://www.dmax.org.uk/thesis/, or the University of Glasgow's Enlighten repository - see http://theses.gla.ac.uk/41132/. A Quick Thank You Five years of hard work has got me to the point at which I can now submit the abstract of my doctoral thesis to the SIGIR Forum. There have been plenty of ups and downs, but I'm super pleased with the result! Even though there is only a single name on the front cover of this thesis, there are many people who have helped me get to where I am today. You all know who you are - from my friends and family, those who granted me so many fantastic opportunities to travel and see the world - and of course, to Leif. Thanks to all of you for confiding your belief and trust in me, even when I may have momentarily lost that belief and trust in myself. This thesis is for you all.

APA, Harvard, Vancouver, ISO, and other styles

12

Hill, Theodore P., and Arie Hordijk. "Selection of order of observation in optimal stopping problems." Journal of Applied Probability 22, no. 1 (March 1985): 177–84. http://dx.doi.org/10.2307/3213757.

Full text

Abstract:

In optimal stopping problems in which the player is free to choose the order of observation of the random variables as well as the stopping rule, it is shown that in general there is no function of all the moments of individual integrable random variables, nor any function of the first n moments of uniformly bounded random variables, which can determine the optimal ordering. On the other hand, several fairly general rules for identification of the optimal ordering based on individual distributions are given, and applications are made to several special classes of distributions.

APA, Harvard, Vancouver, ISO, and other styles

13

Hill, Theodore P., and Arie Hordijk. "Selection of order of observation in optimal stopping problems." Journal of Applied Probability 22, no. 01 (March 1985): 177–84. http://dx.doi.org/10.1017/s0021900200029107.

Full text

Abstract:

In optimal stopping problems in which the player is free to choose the order of observation of the random variables as well as the stopping rule, it is shown that in general there is no function of all the moments of individual integrable random variables, nor any function of the first n moments of uniformly bounded random variables, which can determine the optimal ordering. On the other hand, several fairly general rules for identification of the optimal ordering based on individual distributions are given, and applications are made to several special classes of distributions.

APA, Harvard, Vancouver, ISO, and other styles

14

Kirch, Klaus, and Philipp Schmidt-Wellenburg. "Search for electric dipole moments." EPJ Web of Conferences 234 (2020): 01007. http://dx.doi.org/10.1051/epjconf/202023401007.

Full text

Abstract:

Searches for permanent electric dipole moments of fundamental particles and systems with spin are the experiments most sensitive to new CP violating physics and a top priority of a growing international community. We briefly review the current status of the field emphasizing on the charged leptons and lightest baryons.

APA, Harvard, Vancouver, ISO, and other styles

15

Wu, Wan-Ching, and Diane Kelly. "Online search stopping behaviors: An investigation of query abandonment and task stopping." Proceedings of the American Society for Information Science and Technology 51, no. 1 (2014): 1–10. http://dx.doi.org/10.1002/meet.2014.14505101030.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Ikuta, Seizo. "OPTIMAL STOPPING PROBLEM WITH SEVERAL SEARCH AREAS." Journal of the Operations Research Society of Japan 38, no. 1 (1995): 89–106. http://dx.doi.org/10.15807/jorsj.38.89.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Zuckerman, Dror. "Optimal stopping in a continuous search model." Journal of Applied Probability 23, no. 2 (June 1986): 514–18. http://dx.doi.org/10.2307/3214193.

Full text

Abstract:

We examine a continuous search model in which rewards (e.g. job offers in a search model in the labor market, price offers for a given asset, etc.) are received randomly according to a renewal process determined by a known distribution function. The rewards are non-negative independent and have a common distribution with finite mean. Over the search period there is a constant cost per unit time. The searcher's objective is to choose a stopping time at which he receives the highest available reward (offer), so as to maximize the net expected discounted return. If the interarrival time distribution in the renewal process is new better than used (NBU), it is shown that the optimal stopping strategy possesses the control limit property. The term ‘control limit policy' refers to a strategy in which we accept the first reward (offer) which exceeds a critical control level ξ.

APA, Harvard, Vancouver, ISO, and other styles

18

Zuckerman, Dror. "Optimal stopping in a continuous search model." Journal of Applied Probability 23, no. 02 (June 1986): 514–18. http://dx.doi.org/10.1017/s0021900200029806.

Full text

Abstract:

We examine a continuous search model in which rewards (e.g. job offers in a search model in the labor market, price offers for a given asset, etc.) are received randomly according to a renewal process determined by a known distribution function. The rewards are non-negative independent and have a common distribution with finite mean. Over the search period there is a constant cost per unit time. The searcher's objective is to choose a stopping time at which he receives the highest available reward (offer), so as to maximize the net expected discounted return. If the interarrival time distribution in the renewal process is new better than used (NBU), it is shown that the optimal stopping strategy possesses the control limit property. The term ‘control limit policy' refers to a strategy in which we accept the first reward (offer) which exceeds a critical control level ξ.

APA, Harvard, Vancouver, ISO, and other styles

19

Slud, Eric, and Issa Fakhre-Zakeri. "Optimal stopping of sequential size-dependent search." Annals of Statistics 24, no. 5 (October 1996): 2215–32. http://dx.doi.org/10.1214/aos/1069362318.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Dostert, Maureen. "Does domain knowledge influence search stopping behavior?" Proceedings of the American Society for Information Science and Technology 48, no. 1 (2011): 1–2. http://dx.doi.org/10.1002/meet.2011.14504801219.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Kramer, Morrey, and Norman Starr. "Optimal stopping in a size dependent search." Sequential Analysis 9, no. 1 (January 1990): 59–80. http://dx.doi.org/10.1080/07474949008836196.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Hong, Seung-Kweon. "Human stopping strategies in multiple-target search." International Journal of Industrial Ergonomics 35, no. 1 (January 2005): 1–12. http://dx.doi.org/10.1016/j.ergon.2004.06.004.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Dedema and Chang Liu. "Examination of online information search stopping behaviors and stopping rules by task type." Proceedings of the Association for Information Science and Technology 56, no. 1 (January 2019): 631–33. http://dx.doi.org/10.1002/pra2.114.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Srinivas, M., and L. M. Patnaik. "Genetic search: analysis using fitness moments." IEEE Transactions on Knowledge and Data Engineering 8, no. 1 (1996): 120–33. http://dx.doi.org/10.1109/69.485641.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Yeng, Foo Fong, Soo Kum Yoke, and Azrina Suhaimi. "The saturation of population fitness as a stopping criterion in genetic algorithm." International Journal of Electrical and Computer Engineering (IJECE) 9, no. 5 (October 1, 2019): 4130. http://dx.doi.org/10.11591/ijece.v9i5.pp4130-4137.

Full text

Abstract:

Genetic Algorithm is an algorithm imitating the natural evolution process in solving optimization problems. All feasible (candidate) solutions would be encoded into chromosomes and undergo the execution of genetic operators in evolution. The evolution itself is a process searching for optimum solution. The searching would stop when a stopping criterion is met. Then, the fittest chromosome of last generation is declared as the optimum solution. However, this optimum solution might be a local optimum or a global optimum solution. Hence, an appropriate stopping criterion is important such that the search is not ended before a global optimum solution is found. In this paper, saturation of population fitness is proposed as a stopping criterion for ending the search. The proposed stopping criteria was compared with conventional stopping criterion, fittest chromosomes repetition, under various parameters setting. The results show that the performance of proposed stopping criterion is superior as compared to the conventional stopping criterion.

APA, Harvard, Vancouver, ISO, and other styles

26

Liang, J. H., and K. Y. Liao. "Energy losses of ions implanted in matter." Journal of Materials Research 11, no. 11 (November 1996): 2876–83. http://dx.doi.org/10.1557/jmr.1996.0363.

Full text

Abstract:

A set of simple and accurate formulae for the first four moments of nuclear and electronic energy losses is proposed. A new variable is introduced to include the finite maximum-impact-parameter effect in the nuclear stopping process, which is assumed to be infinite in most studies. A critical energy at which the electronic energy loss is equal to the nuclear energy loss is also defined. It determines whether the nuclear or the electronic stopping process is the dominant mechanism in terms of incident-ion energy. The critical energy increases for heavy ions implanted in heavy target materials during the first moment of energy loss. The second moment of electronic energy loss is important only for light ions implanted at high ion energies. The third and fourth moments of nuclear energy loss are much larger than those of the electronic energy loss for all ion-target combinations. Theoretical predications of the projected ranges and range stragglings for gold ions implanted in carbon films are close to the experimental data when these proposed four moments of nuclear and electronic energy losses are considered.

APA, Harvard, Vancouver, ISO, and other styles

27

Saito, Tsuyoshi. "Optimal Stopping Problem with Controlled Recall." Probability in the Engineering and Informational Sciences 12, no. 1 (January 1998): 91–108. http://dx.doi.org/10.1017/s0269964800005076.

Full text

Abstract:

This paper deals with the following discrete-time optimal stopping problem. For fixed search costs, a random offer, w ~ F(w), will be found for each time. This offer is either accepted, rejected, or “reserved” for recall later. The reserving cost for any offer depends on its value, regardless of how long the offer is reserved. The objective is to maximize the expected discounted net profit, provided that an offer must be accepted. The major finding is that no previously reserved offer should be accepted prior to the deadline of the search process.

APA, Harvard, Vancouver, ISO, and other styles

28

Roters, Markus. "On the validity of Wald's equation." Journal of Applied Probability 31, no. 4 (December 1994): 949–57. http://dx.doi.org/10.2307/3215320.

Full text

Abstract:

In this paper we review conditions under which Wald's equation holds, mainly if the expectation of the given stopping time is infinite. As a main result we obtain what is probably the weakest possible version of Wald's equation for the case of independent, identically distributed (i.i.d.) random variables. Moreover, we improve a result of Samuel (1967) concerning the existence of stopping times for which the expectation of the stopped sum of the underlying i.i.d. sequence of random variables does not exist. Finally, we show by counterexamples that it is impossible to generalize a theorem of Kiefer and Wolfowitz (1956) relating the moments of the supremum of a random walk with negative drift to moments of the positive part of X1 to the case where the expectation of X1 is —∞. Here, the Laplace–Stieltjes transform of the supremum of the considered random walk plays an important role.

APA, Harvard, Vancouver, ISO, and other styles

29

Roters, Markus. "On the validity of Wald's equation." Journal of Applied Probability 31, no. 04 (December 1994): 949–57. http://dx.doi.org/10.1017/s0021900200099484.

Full text

Abstract:

In this paper we review conditions under which Wald's equation holds, mainly if the expectation of the given stopping time is infinite. As a main result we obtain what is probably the weakest possible version of Wald's equation for the case of independent, identically distributed (i.i.d.) random variables. Moreover, we improve a result of Samuel (1967) concerning the existence of stopping times for which the expectation of the stopped sum of the underlying i.i.d. sequence of random variables does not exist. Finally, we show by counterexamples that it is impossible to generalize a theorem of Kiefer and Wolfowitz (1956) relating the moments of the supremum of a random walk with negative drift to moments of the positive part of X 1 to the case where the expectation of X 1 is —∞. Here, the Laplace–Stieltjes transform of the supremum of the considered random walk plays an important role.

APA, Harvard, Vancouver, ISO, and other styles

30

Caplin, Andrew, Mark Dean, and Daniel Martin. "Search and Satisficing." American Economic Review 101, no. 7 (December 1, 2011): 2899–922. http://dx.doi.org/10.1257/aer.101.7.2899.

Full text

Abstract:

Many everyday decisions are made without full examination of all available options, and, as a result, the best available option may be missed. We develop a search-theoretic choice experiment to study the impact of incomplete consideration on the quality of choices. We find that many decisions can be understood using the satisficing model of Herbert Simon (1955): most subjects search sequentially, stopping when a “satisficing” level of reservation utility is realized. We find that reservation utilities and search order respond systematically to changes in the decision making environment. (JEL D03, D12, D83)

APA, Harvard, Vancouver, ISO, and other styles

31

Urgun, Can, and Leeat Yariv. "Constrained Retrospective Search." AEA Papers and Proceedings 111 (May 1, 2021): 549–53. http://dx.doi.org/10.1257/pandp.20211054.

Full text

Abstract:

The search for good outcomes–be it government policies, technological breakthroughs, or lasting purchases–takes time and effort. At times, the decision process is unconstrained: an individual seeking a well-priced product determines her search scope and time as she wishes. At times, search is constrained, either through institutions or cognitive limitations. We consider retrospective search in both settings: an agent chooses the search scope and time, selecting the best observed outcome upon stopping. We analyze the impacts of constraints when observed samples are independent and correlated over time.

APA, Harvard, Vancouver, ISO, and other styles

32

Lehtomaa, Jaakko. "Estimating tails of independently stopped random walks using concave approximations of hazard functions." Journal of Applied Probability 58, no. 3 (September 2021): 773–93. http://dx.doi.org/10.1017/jpr.2021.9.

Full text

Abstract:

AbstractThis paper considers logarithmic asymptotics of tails of randomly stopped sums. The stopping is assumed to be independent of the underlying random walk. First, finiteness of ordinary moments is revisited. Then the study is expanded to more general asymptotic analysis. Results are applicable to a large class of heavy-tailed random variables. The main result enables one to identify if the asymptotic behaviour of a stopped sum is dominated by its increments or the stopping variable. As a consequence, new sufficient conditions for the moment determinacy of compounded sums are obtained.

APA, Harvard, Vancouver, ISO, and other styles

33

P, Sabelnikov, and Sabelnikov Yu. "Search for identical regions in images using invariant moments." Artificial Intelligence 26, jai2021.26(2) (December 1, 2021): 55–62. http://dx.doi.org/10.15407/jai2021.02.055.

Full text

Abstract:

One of the ways to describe objects on images is to identify some of their characteristic points or points of attention. Areas of neighborhoods of attention points are described by descriptors (lots of signs) in such way that they can be identified and compared. These signs are used to search for identical points in other images. The article investigates and establishes the possibility of searching for arbitrary local image regions by descriptors constructed with using invariant moments. A feature of the proposed method is that the calculation of the invariant moments of local areas is carried out with using the integral representation of the geometric moments of the image. Integral representation is a matrix with the same size as the image. The elements of the matrix is the sums of the geometric moments of individual pixels, which are located above and to the left with respect to the coordinates of this element. The number of matrices depends on the order of the geometric moments. For moments up to the second order (inclusively), there will be six such matrices. Calculation of one of six geometric moments of an arbitrary rectangular area of the image comes down up to 3 operations such as summation or subtraction of elements of the corresponding matrix located in the corners of this area. The invariant moments are calculated on base of six geometric moments. The search is performed by scanning the image coordinate grid with a window of a given size. In this case, the invariant moments and additional parameters are calculated and compared with similar parameters of the neighborhoods of the reference point of different size (taking into account the possible change in the image scale). The best option is selected according to a given condition. Almost all mass operations of the procedures for calculating the parameters of standards and searching of identical points make it possible explicitly perform parallel computations in the SIMD mode. As a result, the integral representation of geometric moments and the possibility of using parallel computations at all stages will significantly speed up the calculations and allow you to get good indicators of the search efficiency for identical points and the speed of work

APA, Harvard, Vancouver, ISO, and other styles

34

Browne, Glenn J., and Mitzi G. Pitts. "Stopping rule use during information search in design problems." Organizational Behavior and Human Decision Processes 95, no. 2 (November 2004): 208–24. http://dx.doi.org/10.1016/j.obhdp.2004.05.001.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Xie, Dexuan, and Tamar Schlick. "A More Lenient Stopping Rule for Line Search Algorithms." Optimization Methods and Software 17, no. 4 (January 2002): 683–700. http://dx.doi.org/10.1080/1055678021000049363.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Bather, John. "Poission search models and the evaluation of stopping rules." Sequential Analysis 14, no. 3 (January 1995): 205–16. http://dx.doi.org/10.1080/07474949508836332.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Zhigljavsky, Anatoly, and Emily Hamilton. "Stopping rules in k-adaptive global random search algorithms." Journal of Global Optimization 48, no. 1 (February 3, 2010): 87–97. http://dx.doi.org/10.1007/s10898-010-9528-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Andrews, Donald W. K. "A Stopping Rule for the Computation of Generalized Method of Moments Estimators." Econometrica 65, no. 4 (July 1997): 913. http://dx.doi.org/10.2307/2171944.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Bruss, F. Thomas, and Thomas S. Ferguson. "Multiple buying or selling with vector offers." Journal of Applied Probability 34, no. 4 (December 1997): 959–73. http://dx.doi.org/10.2307/3215010.

Full text

Abstract:

We consider a generalization of the house-selling problem to selling k houses. Let the offers, X1, X2, · ··, be independent, identically distributed k-dimensional random vectors having a known distribution with finite second moments. The decision maker is to choose simultaneously k stopping rules, N1, · ··, Nk, one for each component. The payoff is the sum over j of the jth component of minus a constant cost per observation until all stopping rules have stopped. Simple descriptions of the optimal rules are found. Extension is made to problems with recall of past offers and to problems with a discount.

APA, Harvard, Vancouver, ISO, and other styles

40

Weerdesteijn, Maartje. "Stopping Mass Atrocities: Targeting the Dictator." Politics and Governance 3, no. 3 (October 27, 2015): 53–66. http://dx.doi.org/10.17645/pag.v3i3.289.

Full text

Abstract:

The international community has determined it carries the responsibility to protect civilians from atrocity crimes if a state is unable or unwilling to do so. These crimes are often perpetrated in authoritarian regimes where they are legitimized through an exclusionary ideology. A comparative case study of Pol Pot and Milosevic indicates that whether the leader truly believes in the ideology he puts forward or merely uses it instrumentally to manipulate the population, is an important variable, which affects the manner in which third parties can respond effectively to these crimes. While Pol Pot was motivated by his ideological zeal, Milosevic used ideology to create a climate in which mass atrocities could be perpetrated in order to garner further power and prestige. In Max Weber’s terminology, Milosevic was guided by instrumental rationality while Pol Pot acted on the basis of value rationality. This case study compares two crucial moments—Vietnam’s invasion of Cambodia and NATO’s bombing of Serbia when the crisis in Kosovo escalated—to analyze the responsiveness of the two leaders. It is argued that ideological leaders are less responsive than non-ideological leaders to foreign policy measures targeted to stop or mitigate the occurrence of atrocities.

APA, Harvard, Vancouver, ISO, and other styles

41

Nakai, Teruhisa. "An optimal stopping problem in the excavation of archaeological remains." Journal of Applied Probability 28, no. 4 (December 1991): 924–29. http://dx.doi.org/10.2307/3214698.

Full text

Abstract:

In the excavation of archaeological remains of high value, a search tool with low cost can be used at first, but if we reach a stratum which is very likely to contain valuable material we must use a search tool with high efficiency to reduce the risk of destruction of the remains even if this is more expensive. Which tool should we use at each time? Furthermore, if the search costs too much in comparison with the reward of detection, it is not profitable to go on searching for ever. When should we stop the search? We answer these questions for continuous and discrete models.

APA, Harvard, Vancouver, ISO, and other styles

42

Nakai, Teruhisa. "An optimal stopping problem in the excavation of archaeological remains." Journal of Applied Probability 28, no. 04 (December 1991): 924–29. http://dx.doi.org/10.1017/s0021900200042868.

Full text

Abstract:

In the excavation of archaeological remains of high value, a search tool with low cost can be used at first, but if we reach a stratum which is very likely to contain valuable material we must use a search tool with high efficiency to reduce the risk of destruction of the remains even if this is more expensive. Which tool should we use at each time? Furthermore, if the search costs too much in comparison with the reward of detection, it is not profitable to go on searching for ever. When should we stop the search? We answer these questions for continuous and discrete models.

APA, Harvard, Vancouver, ISO, and other styles

43

PAN, SHEAU-SHI, WEI-TOU NI, and SHEN-CHE CHEN. "EXPERIMENTAL SEARCH FOR ANOMALOUS SPIN-SPIN INTERACTIONS." Modern Physics Letters A 07, no. 14 (May 10, 1992): 1287–99. http://dx.doi.org/10.1142/s0217732392003773.

Full text

Abstract:

A Cavendish-type torsion pendulum, having test masses with 2.5×1022 polarized electrons and "attracting" masses with 8×1023 polarized electrons, is used to search for an anomalous spin interaction of macroscopic range. Competition from magnetic forces is reduced by using ferrimagnetic Dy-Fe masses which exhibit orbital compensation of the electron spin magnetic moments. Combined with magnetic shielding, the sensitivity is 2×10-4 of the gravitational force. Fluctuations set the overall experimental limit at about 5 times this level. Our results set limits on electron spin interactions and on moments which are not of electromagnetic origin. In terms of a standard dipole-dipole form, the limit is 1.5 ×10-12 of the interaction strength between the magnetic moments of the electrons. Compared to previous results, this is a six-cold improvement.

APA, Harvard, Vancouver, ISO, and other styles

44

Onderwater, C. J. G. "Search for electric dipole moments at storage rings." Hyperfine Interactions 211, no. 1-3 (February 28, 2012): 9–14. http://dx.doi.org/10.1007/s10751-012-0584-9.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Lee, S. H., C. F. Majkrzak, S. K. Sinha, C. Stassis, H. Kawano, G. H. Lander, P. J. Brown, et al. "Search for orbital moments in underdoped cuprate metals." Physical Review B 60, no. 14 (October 1, 1999): 10405–17. http://dx.doi.org/10.1103/physrevb.60.10405.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Lenisa, Paolo. "Search for electric dipole moments in storage rings." EPJ Web of Conferences 130 (2016): 01010. http://dx.doi.org/10.1051/epjconf/201613001010.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Vedpathak, Mahesh, and R. H. Kodama. "Search for noncollinear moments at Permalloy/copper interfaces." Journal of Applied Physics 93, no. 10 (May 15, 2003): 8247–49. http://dx.doi.org/10.1063/1.1556135.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Browne, Pitts, and Wetherbe. "Cognitive Stopping Rules for Terminating Information Search in Online Tasks." MIS Quarterly 31, no. 1 (2007): 89. http://dx.doi.org/10.2307/25148782.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Dombrovsky, Y., and N. Perrin. "On Adaptive Search and Optimal Stopping in Sequential Mate Choice." American Naturalist 144, no. 2 (August 1994): 355–61. http://dx.doi.org/10.1086/285680.

Full text

APA, Harvard, Vancouver, ISO, and other styles

50

HASEGAWA, Manabu, and Shigehiro TAKATA. "An adaptive stopping criterion in optimization by tabu search algorithm." Proceedings of Conference of Kyushu Branch 2003.56 (2003): 349–50. http://dx.doi.org/10.1299/jsmekyushu.2003.56.349.

Full text

APA, Harvard, Vancouver, ISO, and other styles

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!