An Automated Search Procedure for Fuel Shuffling in PWRs Including Rotation Effects

Author(s):  
A. H. Robinson ◽  
J. O. Heaberlin ◽  
G. L. Wang
2001 ◽  
Author(s):  
Michael Ray ◽  
Yves C. Martin

2017 ◽  
Vol 17 (2) ◽  
pp. 161-177 ◽  
Author(s):  
Simone Bianco ◽  
Raimondo Schettini

In this article, we describe a general purpose system that, given as input a segmented/classified image, automatically provides different visual outputs exploiting solid colors, color boundaries, and transparent colors. Moreover, if the names of the classes are given, the system automatically places a textual label in the less salient sub-region of the corresponding class. For color-class association and class label placement, we take into account the underlying image color and structure exploiting both saliency and superpixel representation. The color selection and the color-class association are formulated both as optimization problems and heuristically solved using a Local Search procedure. Results show the effectiveness of the proposed system on images having different content and different number of annotated regions.


10.37236/2102 ◽  
2012 ◽  
Vol 19 (1) ◽  
Author(s):  
Geoffrey Exoo

The lower bound for the classical Ramsey number $R(4,6)$ is improved from 35 to 36. The author has found 37 new edge colorings of $K_{35}$ that have no complete graphs of order 4 in the first color, and no complete graphs of order 6 in the second color. The most symmetric of the colorings has an automorphism group of order 4, with one fixed point, and is presented in detail. The colorings were found using a heuristic search procedure.


Author(s):  
Vitaliy V Tsyganok

<p>AHP/ANP stability measurement methods are described. In this paper we define the method's stability as the measure of its results dependence on the expert's errors, made during pair comparisons. Ranking Stability (order preservation in alternative ranking under natural expert's errors, made during expert estimation) and Estimating Stability (maintaining alternative weights within the specified maximal relative inaccuracy range) are considered. Targeted Genetic Algorithm search procedure is used for possible stability violation detection. Then division-in-half (dichotomy) method is applied to calculate stability metric of a given criteria hierarchy.</p><p>http://dx.doi.org/10.13033/ijahp.v3i1.50</p>


2018 ◽  
Vol 9 (1) ◽  
pp. 2-17
Author(s):  
Roxana-Mihaela Spînu

This current review aimed to evaluate the efficacy of eHealth interventions in weight manangement, targeting obese and overweight adults. Methods: Upon completion of the search procedure, a number of fourteen studies were included and analyzed relative to a set of inclusion and exclusion criteria previously established. Results: Only six out of fourteen studies reported statistically significant results, favoring the eHealth interventions. The included studies had several limitations, most of them related to their methodological design. Conclusion: The current understanding of this topic is still premature, but the present results offer a promising perspective on the efficacy of eHealth interventions in weight management. However, more studies are needed to provide conclusive results.


2013 ◽  
Vol 2013 ◽  
pp. 1-6
Author(s):  
Dunbo Cai ◽  
Sheng Xu ◽  
Tongzhou Zhao ◽  
Yanduo Zhang

Pruning techniques and heuristics are two keys to the heuristic search-based planning. Thehelpful actionspruning (HAP) strategy andrelaxed-plan-based heuristicsare two representatives among those methods and are still popular in the state-of-the-art planners. Here, we present new analyses on the properties of HAP. Specifically, we show new reasons for which HAP can cause incompleteness of a search procedure. We prove that, in general, HAP is incomplete for planning with conditional effects if factored expansions of actions are used. To preserve completeness, we propose a pruning strategy that is based onrelevance analysisandconfrontation. We will show that bothrelevance analysisandconfrontationare necessary. We call it theconfrontation and goal relevant actionspruning (CGRAP) strategy. However, CGRAP is computationally hard to be exactly computed. Therefore, we suggest practical approximations from the literature.


Sign in / Sign up

Export Citation Format

Share Document