Search results for "SOFC"
showing 10 items of 660 documents
Ultrametric Finite Automata and Turing Machines
2013
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.
Ultrametric Algorithms and Automata
2015
We introduce a notion of ultrametric automata and Turing machines using p-adic numbers to describe random branching of the process of computation. These automata have properties similar to the properties of probabilistic automata but complexity of probabilistic automata and complexity of ultrametric automata can differ very much.
A Supplementary Text to “Contextuality in Canonical Systems of Random Variables” by Ehtibar N. Dzhafarov, Víctor H. Cervantes, and Janne V. Kujala (P…
2017
Mathematical Proofs
Explaining Contagion: Tactical, Ideological, or Geographical Impulses?
2021
Elections are a zero-sum game, and the gain of one party equals the loss of another party. Likewise, the vote gains of some groups of parties have parallel losses among other party groups or party families. Political Parties do not operate in isolation. When Eurosceptic parties are successful, pro-European parties tend to lose votes as a consequence. Would a political party decide to adjust its position every time a Eurosceptic Party gains votes? The assumption here is that if a political party gains votes from one election to another (or at least does not lose votes), the information that the election result is communicating to it is that it is doing something right. A party might take not…
Ceria-based electrolytes prepared by solution combustion synthesis: The role of fuel on the materials properties
2016
Ce0.8Sm0.2O2 â xpowders were synthesized by solution combustion synthesis using citric acid, cellulose and sucrose as single, or intimately mixed, fuels. The powders were characterized by X-ray diffraction, transmission electron microscopy, X-ray photoelectron spectroscopy, N2sorption at â196 °C, H2-temperature programmed reduction and thermogravimetric analyses. Textural properties of the powders were shaped by the peculiar employed fuel. The study of reducibility revealed that oxygen vacancies formation is mainly influenced by both parameters, specific surface area and total pore volume. The different tendency toward reduction played a key role in sintering under reducing atmosphe…
Stiffness-Adaptive Taylor method for the integration of non-stiff and stiff kinetic models
1992
A systematic derivation procedure that greatly facilitates the application of the Taylor method to the integration of kinetic models is developed. In addition, an algorithm that gives the integration step as a function of the required level of accuracy is proposed. Using the Taylor method, application of this algorithm is immediate and largely reduces the integration time. In addition, a new method of integration of kinetic models, whose most important feature is the self-adaptability to the stiffness of the system along the integration process, is developed. This “stiffness-adaptive” Taylor method (SAT method) makes use of several algorithms, combining them to meet the particular requireme…
Trademarks and Cyberspace
2006
Trademark law aids consumers who use trademarks in the marketplace to identify swiftly and without problems a product they liked or disliked in the past, distinguishing among the different competing manufacturers of a product. No one is entitled to sell or deliver commodities under the appearance that the commodities derive from someone else. The importance of consumer protection cannot be over-emphasized and the average consumer standard should remain the central point of the inquiry, even under domain name litigation. Replacing the initial interest confusion doctrine is one decisive step, along with the introduction of a doctrine representing the fact that there should be no confusion at …
Multilayer neural networks: an experimental evaluation of on-line training methods
2004
Artificial neural networks (ANN) are inspired by the structure of biological neural networks and their ability to integrate knowledge and learning. In ANN training, the objective is to minimize the error over the training set. The most popular method for training these networks is back propagation, a gradient descent technique. Other non-linear optimization methods such as conjugate directions set or conjugate gradient have also been used for this purpose. Recently, metaheuristics such as simulated annealing, genetic algorithms or tabu search have been also adapted to this context.There are situations in which the necessary training data are being generated in real time and, an extensive tr…
An Investigation of the Robustness in the Travelling Salesman Problem Routes Using Special Structured Matrices
2020
In this study, the robustness of the Travelling Salesman Problem (TSP) routes is investigated by recognising the special combinatorial structures of Kalmanson matrices. A recognition algorithm encompassing three procedures based on combinatorial and linear programming (LP) is developed and executed on several randomly generated instances. These procedures produce three lower bounds which provide guarantees on the optimality of the solutions. Computational experiments show that the proposed LP-based procedure performs efficiently well across all problem dimensions and provides the best lower bounds to the TSP. This is supported by an average deviation of less than 7% between the TSP tour len…
Visualization of Large Terrain Using Non-restricted Quadtree Triangulations
2004
This paper presents a set of new techniques oriented towards the real-time visualization of large terrains. These techniques are mainly focused on semi-regular triangulations of non-restricted quadtree terrain representations. Despite the fact that the paper shows that triangulations based on non-restricted quadtrees are as simple and efficient as those based on restricted quadtrees, the new triangulations avoid discontinuity problems among the boundaries of different patches without the need for tree balancing and extra triangles addition. Another important feature of the proposed triangulation is that it incorporates an efficient method for building triangle strips and triangle fans for t…