The Experts below are selected from a list of 11559 Experts worldwide ranked by ideXlab platform
Frédéric Blanqui - One of the best experts on this subject based on the ideXlab platform.
-
Combining typing and size constraints for checking the Termination of higher-order conditional rewrite systems
2006Co-Authors: Frédéric Blanqui, Colin RibaAbstract:In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a Termination proof technique called type or size based Termination and initially developed for ML-like programs. Here, we go one step further by considering conditional rewriting and explicit quantifications and constraints on size annotations. This allows to describe more precisely how the size of the output of a function depends on the size of its inputs. Hence, we can check the Termination of more functions. We first give a general type-checking algorithm based on constraint solving. Then, we give a Termination Criterion with constraints in Presburger arithmetic. To our knowledge, this is the first Termination Criterion for higher-order conditional rewriting taking into account the conditions in Termination.
-
A type-based Termination Criterion for dependently-typed higher-order rewrite systems
arXiv: Logic in Computer Science, 2006Co-Authors: Frédéric BlanquiAbstract:Several authors devised type-based Termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful Termination Criterion for the combination of rewriting and beta-reduction in the Calculus of Constructions.
-
LPAR - Combining typing and size constraints for checking the Termination of higher-order conditional rewrite systems
Logic for Programming Artificial Intelligence and Reasoning, 2006Co-Authors: Frédéric Blanqui, Colin RibaAbstract:In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a Termination proof technique called type or size based Termination and initially developed for ML-like programs. Here, we go one step further by considering conditional rewriting and explicit quantifications and constraints on size annotations. This allows to describe more precisely how the size of the output of a function depends on the size of its inputs. Hence, we can check the Termination of more functions. We first give a general type-checking algorithm based on constraint solving. Then, we give a Termination Criterion with constraints in Presburger arithmetic. To our knowledge, this is the first Termination Criterion for higher-order conditional rewriting taking into account the conditions in Termination.
-
A type-based Termination Criterion for dependently-typed higher-order rewrite systems
Lecture Notes in Computer Science, 2004Co-Authors: Frédéric BlanquiAbstract:Several authors devised type-based Termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful Termination Criterion for the combination of rewriting and β-reduction in the Calculus of Constructions.
-
RTA - A Type-Based Termination Criterion for Dependently-Typed Higher-Order Rewrite Systems
Rewriting Techniques and Applications, 2004Co-Authors: Frédéric BlanquiAbstract:Several authors devised type-based Termination criteria for ML-like languages allowing non-structural recursive calls. We extend these works to general rewriting and dependent types, hence providing a powerful Termination Criterion for the combination of rewriting and β-reduction in the Calculus of Constructions.
Yoshinori Kosogabe - One of the best experts on this subject based on the ideXlab platform.
-
The effect of breath Termination Criterion on breathing patterns and the work of breathing during pressure support ventilation.
Anesthesia and analgesia, 2001Co-Authors: Hiroaki Tokioka, Toshiaki Tanaka, Tomoko Ishizu, Tomihiro Fukushima, Toshio Iwaki, Yuko Nakamura, Yoshinori KosogabeAbstract:With pressure support ventilation (PSV), each PSV breath is flow-cycled, and the breath Termination Criterion (TC) is usually nonadjustable. When TC does not match the interaction between the patient’s inspiratory-expiratory efforts to the opening and closing of the inspiratory and expiratory valves
Josue Almeida Victorino - One of the best experts on this subject based on the ideXlab platform.
-
Cycling-off modes during pressure support ventilation: Effects on breathing pattern, patient effort, and comfort
Journal of critical care, 2014Co-Authors: Fabrícia Cristina Hoff, Mauro R. Tucci, Marcelo B. P. Amato, Laura Jurema Dos Santos, Josue Almeida VictorinoAbstract:Abstract Purpose Expiratory asynchrony during pressure support ventilation (PSV) has been recognized as a cause of patient discomfort, increased workload, and impaired weaning process. We evaluated breathing pattern, patient comfort, and patient effort during PSV comparing 2 flow Termination criteria: fixed at 5% of peak inspiratory flow vs automatic, real-time, breath-by-breath adjustment within the range of 5% to 55%. Materials and methods Randomized crossover clinical trial. Sixteen awake patients, in the process of weaning, under PSV for more than 24 hours were subjected to 3 phases of PSV, each lasting 1 hour and using 1 of the 2 aforementioned Termination criteria. Results Effective pressure support during automatic adjustment (AA) was 12.5 ± 3.2 cm H2O vs 12.5 ± 3.9 cm H2O (P = .9) with the fixed Termination Criterion, and external positive end-expiratory pressure was 6.2 ± 1.8 vs 6.8 ± 2 (P Conclusions When compared with a fixed Termination Criterion, the use of a variable, real-time–adjusted Termination Criterion improved some indices of patient-ventilator synchrony, producing better breathing pattern, less discomfort, and slightly lower patient effort during PSV.
Gade Pandu Rangaiah - One of the best experts on this subject based on the ideXlab platform.
-
Evaluation of two Termination criteria in evolutionary algorithms for multi-objective optimization of complex chemical processes
Chemical Engineering Research and Design, 2017Co-Authors: Gade Pandu Rangaiah, Shivom Sharma, H.w. LinAbstract:Abstract Multi-objective (or multi-criteria) optimization (MOO) is useful for gaining deeper insights into trade-offs among objectives of interest and then selecting one of the many optimal solutions found. It has attracted numerous applications in chemical engineering. Common techniques for MOO are adaptations of stochastic global optimization methods, which include metaheuristics and evolutionary methods, for single-objective optimization. These techniques have been used mostly with maximum number of generations (MNG) as the Termination Criterion for stopping the iterative search. This Criterion is arbitrary and computationally inefficient. Hence, this study investigates two Termination criteria based on search progress (i.e., performance or improvement in solutions), for MOO of three complex chemical processes modeled by process simulators, namely, Aspen Plus and Aspen HYSYS. They are Chi-Squared test based Termination Criterion (CSTC) and Steady-State Detection Termination Criterion (SSDTC). Both these criteria are evaluated in two evolutionary algorithms for MOO. Results show that CSTC and SSDTC are successful in giving optimal solutions close to those after MNG but well before MNG. Of the two criteria, CSTC is more reliable and terminates the search earlier, thus reducing computational time substantially.
-
Design of shell-and-tube heat exchangers for multiple objectives using elitist non-dominated sorting genetic algorithm with Termination criteria
Applied Thermal Engineering, 2016Co-Authors: Justin Y.q. Wong, Shivom Sharma, Gade Pandu RangaiahAbstract:Abstract In this work, Excel-based multi-objective optimization (EMOO) program, based on the elitist non-dominated sorting genetic algorithm, is improved by implementing two Termination criteria: a Chi-squared test-based Termination Criterion and a novel Termination Criterion based on steady-state detection. The Termination criteria were shown to perform reliably during the MOO of four constrained test functions. Then, the improved EMOO program was applied to the design of several shell-and-tube heat exchangers (STHE) from the literature; these STHE are simulated and then optimized using the EMOO program for two objectives: capital cost and operating cost. It provided better optimal results compared to those in the literature. The Termination criteria performed reliably for MOO of STHE design, showing their applicability on industrial MOO problems.
-
Jumping Gene Adaptations of NSGA-II with Altruism Approach: Performance Comparison and Application to Williams–Otto Process
Applications of Metaheuristics in Process Engineering, 2014Co-Authors: Shivom Sharma, Seyed Reza Nabavi, Gade Pandu RangaiahAbstract:Elitist non-dominated sorting genetic algorithm (NSGA-II) has been widely used for solving many application problems with multiple objectives. The concept of jumping gene (JG) from natural genetics has been incorporated into NSGA-II to improve its performance. Several JG adaptations have been proposed and used to solve multi-objective optimization test/application problems; aJG, saJG and sJG are recent JG adaptations, and they have similar performance. Further, the concept of altruism, inspired by the honey bee colony, has been incorporated with NSGA-II-aJG, and it has improved the search performance. In the present work, Alt-NSGA-II-aJG is modified for using saJG and sJG adaptations, and then performances of Alt-NSGA-II-aJG, Alt-NSGA-II-saJG and Alt-NSGA-II-sJG algorithms are compared on test and application problems. In the literature, the maximum number of generations (MNG) is the commonly used Termination Criterion for stochastic search algorithms. Hence, a search Termination Criterion based on the improvement in the Pareto-optimal front obtained has been included in the present study. Performance of selected algorithms is compared using both improvement-based Termination Criterion and MNG; here, generational distance, spread and inverse generational distance are employed to assess the quality of non-dominated solutions obtained. Results show that performance of Alt-NSGA-II-aJG, Alt-NSGA-II-saJG and Alt-NSGA-II-sJG algorithms is comparable, and use of the altruism approach and improvement-based Termination Criterion enhances the search algorithm significantly.
-
An improved multi-objective differential evolution with a Termination Criterion for optimizing chemical processes
Computers & Chemical Engineering, 2013Co-Authors: Shivom Sharma, Gade Pandu RangaiahAbstract:Abstract Application problems have conflicting objectives and constraints, and maximum number of generations is the most common Termination Criterion in evolutionary algorithms used for solving these applications. This study develops a Termination Criterion using the non-dominated solutions obtained as the search progresses. For this, several performance metrics are modified, and their variation with generations has been assessed on many test functions. Based on this analysis, it is proposed to terminate the search if the improvement in variance of two selected performance metrics obtained in recent generations is statistically insignificant. Additionally, evaluation of objectives and constraints is computationally expensive in many applications. This study uses taboo list with multi-objective differential evolution to avoid re-visits and for better exploration of search space. Benefits of the Termination Criterion and taboo list are assessed on constrained benchmark problems. The developed approach is then evaluated on three chemical engineering applications, namely, alkylation, Williams-Otto and fermentation processes.
Seth Hutchinson - One of the best experts on this subject based on the ideXlab platform.
-
agglomerative clustering on range data with a unified probabilistic merging function and Termination Criterion
Computer Vision and Pattern Recognition, 1993Co-Authors: Steven M Lavalle, K J Moroney, Seth HutchinsonAbstract:Clustering methods, which are frequently employed for region-based segmentation, are inherently metric based. A fundamental problem with an estimation-based Criterion is that as the amount of information in a region decreases, the parameter estimates become extremely unreliable and incorrect decisions are likely to be made. It is shown that clustering need not be metric based. A rigorous region merging probability function is used. It makes use of all information available in the probability densities of a statistical image model. By using this probability function as a Termination Criterion it is possible to produce segmentations in which all region merges are performed above some level of confidence. >
-
CVPR - Agglomerative clustering on range data with a unified probabilistic merging function and Termination Criterion
Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, 1Co-Authors: Steven M Lavalle, K J Moroney, Seth HutchinsonAbstract:Clustering methods, which are frequently employed for region-based segmentation, are inherently metric based. A fundamental problem with an estimation-based Criterion is that as the amount of information in a region decreases, the parameter estimates become extremely unreliable and incorrect decisions are likely to be made. It is shown that clustering need not be metric based. A rigorous region merging probability function is used. It makes use of all information available in the probability densities of a statistical image model. By using this probability function as a Termination Criterion it is possible to produce segmentations in which all region merges are performed above some level of confidence. >
