Search results for "SOFC"
showing 10 items of 660 documents
A Projected Algebraic Multigrid Method for Linear Complementarity Problems
2011
We present an algebraic version of an iterative multigrid method for obstacle problems, called projected algebraic multigrid (PAMG) here. We show that classical AMG algorithms can easily be extended to deal with this kind of problem. This paves the way for efficient multigrid solution of obstacle problems with partial differential equations arising, for example, in financial engineering.
Decision Making on Pareto Front Approximations with Inherent Nondominance
2011
t Approximating the Pareto fronts of nonlinear multiobjective optimization problems is considered and a property called inherent nondominance is proposed for such approximations. It is shown that an approximation having the above property can be explored by interactively solving a multiobjective optimization problem related to it. This exploration can be performed with available interactive multiobjective optimization methods. The ideas presented are especially useful in solving computationally expensive multiobjective optimization problems with costly function value evaluations. peerReviewed
Multiobjective ant colony search algorithm optimal electrical distribution system planning
2005
A dynamic multiobjective, MO, algorithm based on the ant colony search, the multiobjective ant colony search algorithm, MOACS, is presented. The application domain is that of dynamic planning for electrical distribution systems. A time horizon of H years has been considered during which the distribution system are modified according to the new internal (loads) and external (market, reliability, power quality) requirements. In this scenario, the objectives the Authors consider most important for utilities in strategical planning are: the quality requirement connected to the decrease of the expected number of interruptions per year and customer, in the considered time frame, and the choice fo…
Edge Orientation and the Design of Problem-Specific Crossover Operators for the OCST Problem
2012
In the Euclidean optimal communication spanning tree problem, the edges in optimal trees not only have small weights but also point with high probability toward the center of the graph. These characteristics of optimal solutions can be used for the design of problem-specific evolutionary algorithms (EAs). Recombination operators of direct encodings like edge-set and NetDir can be extended such that they prefer not only edges with small distance weights but also edges that point toward the center of the graph. Experimental results show higher performance and robustness in comparison to EAs using existing crossover strategies.
Incremental bipartite drawing problem
2001
Abstract Layout strategies that strive to preserve perspective from earlier drawings are called incremental. In this paper we study the incremental arc crossing minimization problem for bipartite graphs. We develop a greedy randomized adaptive search procedure (GRASP) for this problem. We have also developed a branch-and-bound algorithm in order to compute the relative gap to the optimal solution of the GRASP approach. Computational experiments are performed with 450 graph instances to first study the effect of changes in grasp search parameters and then to test the efficiency of the proposed procedure. Scope and purpose Many information systems require graphs to be drawn so that these syst…
Mathematical Modelling Problems in a Mathematics Course for Engineers: A Commognitive Perspective
2021
Mathematical knowledge is very important for engineers; both quantitative and qualitative analysis of physical systems and manufacturing processes require solid scientific principles and appropriate mathematical tools. Teaching of mathematical modelling at the university contributes to the development of mathematical competencies, motivates the interest to mathematics and plays a significant didactical role in promoting advanced mathematical thinking. These views are supported by the analysis of students’ work on a mathematical modelling assignment in a university mathematics course for future engineers with the help of the commognitive framework. Students’ narratives in written solutions a…
Exhaustive generation for permutations avoiding (colored) regular sets of patterns
2019
Abstract Despite the fact that the field of pattern avoiding permutations has been skyrocketing over the last two decades, there are very few exhaustive generating algorithms for such classes of permutations. In this paper we introduce the notions of regular and colored regular set of forbidden patterns, which are particular cases of right-justified sets of forbidden patterns. We show the (colored) regularity of several sets of forbidden patterns (some of them involving variable length patterns) and we derive a general framework for the efficient generation of permutations avoiding them. The obtained generating algorithms are based on succession functions, a notion which is a byproduct of t…
Some subgroup embeddings in finite groups
2015
In this survey paper several subgroup embedding properties related to some types of permutability are introduced and studied.
Model details from Sex roles and the evolution of parental care specialization.
2019
Details of the mathematical model, including the case of shared parentage
Model details from Sex roles and the evolution of parental care specialization
2019
Details of the mathematical model, including the case of shared parentage