Optimal selection based on relative ranks of a sequence by ties

1984 ◽  
Vol 16 (1) ◽  
pp. 131-146 ◽  
Author(s):  
Gregory Campbell

The optimal selection of a maximum of a sequence with the possibility of ties is considered. The object is to examine each observation in the sequence of known length n and, based only on the relative rank among predecessors, either to stop and select it as a maximum or to continue without recall. Rules which maximize the probability of correctly selecting a maximum from a sequence with ties are investigated. These include rules which randomly break ties, rules which discard tied observations, and minimax rules based on the atoms of a discrete distribution function. If the sequence is random from F, a random distribution function from a Dirichlet process prior with non-atomic parameter, optimal rules are developed. The limiting behavior of these rules is studied and compared with other rules. The selection of the parameter of the Dirichlet process regulates the ties.

1984 ◽  
Vol 16 (01) ◽  
pp. 131-146
Author(s):  
Gregory Campbell

The optimal selection of a maximum of a sequence with the possibility of ties is considered. The object is to examine each observation in the sequence of known length n and, based only on the relative rank among predecessors, either to stop and select it as a maximum or to continue without recall. Rules which maximize the probability of correctly selecting a maximum from a sequence with ties are investigated. These include rules which randomly break ties, rules which discard tied observations, and minimax rules based on the atoms of a discrete distribution function. If the sequence is random from F, a random distribution function from a Dirichlet process prior with non-atomic parameter, optimal rules are developed. The limiting behavior of these rules is studied and compared with other rules. The selection of the parameter of the Dirichlet process regulates the ties.


2012 ◽  
Vol 45 (4) ◽  
pp. 41 ◽  
Author(s):  
M. K. Saha ◽  
Santanu Das ◽  
A. Bandyopadhyay ◽  
S. Bandyopadhyay

2012 ◽  
Vol 45 (4) ◽  
pp. 41
Author(s):  
M. K. Saha ◽  
Santanu Das ◽  
A. Bandyopadhyay ◽  
S. Bandyopadhyay

2021 ◽  
Vol 13 (6) ◽  
pp. 3571
Author(s):  
Bogusz Wiśnicki ◽  
Dorota Dybkowska-Stefek ◽  
Justyna Relisko-Rybak ◽  
Łukasz Kolanda

The paper responds to research problems related to the implementation of large-scale investment projects in waterways in Europe. As part of design and construction works, it is necessary to indicate river ports that play a major role within the European transport network as intermodal nodes. This entails a number of challenges, the cardinal one being the optimal selection of port locations, taking into account the new transport, economic, and geopolitical situation that will be brought about by modernized waterways. The aim of the paper was to present an original methodology for determining port locations for modernized waterways based on non-cost criteria, as an extended multicriteria decision-making method (MCDM) and employing GIS (Geographic Information System)-based tools for spatial analysis. The methodology was designed to be applicable to the varying conditions of a river’s hydroengineering structures (free-flowing river, canalized river, and canals) and adjustable to the requirements posed by intermodal supply chains. The method was applied to study the Odra River Waterway, which allowed the formulation of recommendations regarding the application of the method in the case of different river sections at every stage of the research process.


2020 ◽  
Vol 26 (2) ◽  
pp. 163-169
Author(s):  
Vladimir Nekrutkin

AbstractThis paper is devoted to random-bit simulation of probability densities, supported on {[0,1]}. The term “random-bit” means that the source of randomness for simulation is a sequence of symmetrical Bernoulli trials. In contrast to the pioneer paper [D. E. Knuth and A. C. Yao, The complexity of nonuniform random number generation, Algorithms and Complexity, Academic Press, New York 1976, 357–428], the proposed method demands the knowledge of the probability density under simulation, and not the values of the corresponding distribution function. The method is based on the so-called binary decomposition of the density and comes down to simulation of a special discrete distribution to get several principal bits of output, while further bits of output are produced by “flipping a coin”. The complexity of the method is studied and several examples are presented.


Computation ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 80
Author(s):  
John Fernando Martínez-Gil ◽  
Nicolas Alejandro Moyano-García ◽  
Oscar Danilo Montoya ◽  
Jorge Alexander Alarcon-Villamil

In this study, a new methodology is proposed to perform optimal selection of conductors in three-phase distribution networks through a discrete version of the metaheuristic method of vortex search. To represent the problem, a single-objective mathematical model with a mixed-integer nonlinear programming (MINLP) structure is used. As an objective function, minimization of the investment costs in conductors together with the technical losses of the network for a study period of one year is considered. Additionally, the model will be implemented in balanced and unbalanced test systems and with variations in the connection of their loads, i.e., Δ− and Y−connections. To evaluate the costs of the energy losses, a classical backward/forward three-phase power-flow method is implemented. Two test systems used in the specialized literature were employed, which comprise 8 and 27 nodes with radial structures in medium voltage levels. All computational implementations were developed in the MATLAB programming environment, and all results were evaluated in DigSILENT software to verify the effectiveness and the proposed three-phase unbalanced power-flow method. Comparative analyses with classical and Chu & Beasley genetic algorithms, tabu search algorithm, and exact MINLP approaches demonstrate the efficiency of the proposed optimization approach regarding the final value of the objective function.


Optik ◽  
2021 ◽  
Vol 231 ◽  
pp. 166417 ◽  
Author(s):  
Md Tohidul Islam ◽  
Md Rafsun Jani ◽  
Kazi Md Shorowordi ◽  
Zameer Hoque ◽  
Ali Mucteba Gokcek ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document