37 research outputs found

    Proton exchange membrane fuel cell stack design optimization using an improved Jaya algorithm

    Get PDF
    Fuel cell stack configuration optimization is known to be a problem that, in addition to presenting engineering challenges, is computationally hard. This paper presents an improved computational heuristic for solving the problem. The problem addressed in this paper is one of constrained optimization, where the goal is to seek optimal (or near-optimal) values of (i) the number of proton exchange membrane fuel cells (PEMFCs) to be connected in series to form a group, (ii) the number of such groups to be connected in parallel, and (iii) the cell area, such that the PEMFC assembly delivers the rated voltage at the rated power while the cost of building the assembly is as low as possible. Simulation results show that the proposed method outperforms four of the best-known methods in the literature. The improvement in performance afforded by the proposed algorithm is validated with statistical tests of significance

    Reversible and irreversible potentials and an inaccuracy in popularmodels in the fuel cell literature

    Get PDF
    Modeling is an integral part of fuel cell design and development. This paper identifies a long-standing inaccuracy in the fuel cell modeling literature. Specifically, it discusses an inexact insertion, in popular models, of cell/stack current into Nernst\u27s equation in the derivation of output (load) voltage. The origin of the inaccuracy is traced to the nature of reversible and irreversible potentials (equilibrium and non-equilibrium states) in the cell. The significance of the inaccuracy is explained in the context of the electrochemistry and thermodynamics of the fuel cell

    Semi-steady-state Jaya Algorithm

    Get PDF
    The Jaya algorithm is arguably one of the fastest-emerging metaheuristics amongst the newest members of the evolutionary computation family. The present paper proposes a new, improved Jaya algorithm by modifying the update strategies of the best and the worst members in the population. Simulation results on a twelve-function benchmark test-suite as well as a real-world problem of practical importance show that the proposed strategy produces results that are better and faster in the majority of cases. Statistical tests of significance are used to validate the performance improvement

    Semi-steady-state jaya algorithm for optimization

    Get PDF
    The Jaya algorithm is arguably one of the fastest-emerging metaheuristics amongst the newest members of the evolutionary computation family. The present paper proposes a new, improved Jaya algorithm by modifying the update strategies of the best and the worst members in the population. Simulation results on a twelve-function benchmark test-suite and a real-world problem show that the proposed strategy produces results that are better and faster in the majority of cases. Statistical tests of significance are used to validate the performance improvement

    A new model for constant fuel utilization and constant fuel flow in fuel cells

    Get PDF
    This paper presents a new model of fuel cells for two different modes of operation: constant fuel utilization control (constant stoichiometry condition) and constant fuel flow control (constant flow rate condition). The model solves the long-standing problem of mixing reversible and irreversible potentials (equilibrium and non-equilibrium states) in the Nernst voltage expression. Specifically, a Nernstian gain term is introduced for the constant fuel utilization condition, and it is shown that the Nernstian gain is an irreversibility in the computation of the output voltage of the fuel cell. A Nernstian loss term accounts for an irreversibility for the constant fuel flow operation. Simulation results are presented. The model has been validated against experimental data from the literature

    Gene pool recombination, genetic algorithm, and the onemax function

    Get PDF
    In this paper we present an analysis of gene pool recombination in genetic algorithms in the context of the onemax function. We have developed a Markov chain framework for computing the probability of convergence, and have shown how the analysis can be used to estimate the critical population size. The Markov model is used to investigate drift in the multiple-loci case. Additionally, we have estimated the minimum population size needed for optimality, and recurrence relations describing the growth of the advantageous allele in the infinite-population case have been derived. Simulation results are presented

    Interactive sketch generation

    Full text link

    "The fruits of independence": Satyajit Ray, Indian nationhood and the spectre of empire

    Get PDF
    Challenging the longstanding consensus that Satyajit Ray's work is largely free of ideological concerns and notable only for its humanistic richness, this article shows with reference to representations of British colonialism and Indian nationhood that Ray's films and stories are marked deeply and consistently by a distinctively Bengali variety of liberalism. Drawn from an ongoing biographical project, it commences with an overview of the nationalist milieu in which Ray grew up and emphasizes the preoccupation with colonialism and nationalism that marked his earliest unfilmed scripts. It then shows with case studies of Kanchanjangha (1962), Charulata (1964), First Class Kamra (First-Class Compartment, 1981), Pratidwandi (The Adversary, 1970), Shatranj ke Khilari (The Chess Players, 1977), Agantuk (The Stranger, 1991) and Robertsoner Ruby (Robertson's Ruby, 1992) how Ray's mature work continued to combine a strongly anti-colonial viewpoint with a shifting perspective on Indian nationhood and an unequivocal commitment to cultural cosmopolitanism. Analysing how Ray articulated his ideological positions through the quintessentially liberal device of complexly staged debates that were apparently free, but in fact closed by the scenarist/director on ideologically specific notes, this article concludes that Ray's reputation as an all-forgiving, ‘everybody-has-his-reasons’ humanist is based on simplistic or even tendentious readings of his work

    Gastric adenocarcinoma in a patient re-infected with H. pylori after regression of MALT lymphoma with successful anti-H. pylori therapy and gastric resection: a case report

    Get PDF
    BACKGROUND: Helicobacter pylori (H. pylori) has been etiologically linked with primary gastric lymphoma (PGL) and gastric carcinoma (GC). There are a few reports of occurrence of both diseases in the same patient with H. pylori infection. CASE PRESENTATION: We report a patient with PGL in whom the tumor regressed after surgical resection combined with eradication of H. pylori infection. However, he developed GC on follow up; this was temporally associated with recrudescence / re-infection of H. pylori. This is perhaps first report of such occurrence. CONCLUSIONS: Possible cause and effect relationship between H. pylori infection and both PGL and GC is discussed. This case also documents a unique problem in management of PGL in tropical countries where re-infection with H. pylori is supposed to be high

    Branching Process Analysis of Linear Ranking and Binary Tournament Selection in Genetic Algorithms

    Get PDF
    The present paper extends the branching process model [4] to cover linear ranking selection and binary tournament selection in genetic algorithms. Under certain simplifying assumptions, we derive the probability that a given class would vanish from the population by a given generation. No crossover or mutation is considered. Simulation results are presented
    corecore