Search results for "SOFC"
showing 10 items of 660 documents
2019
This paper contributes to e-government research by presenting a review and discussion on how digitalization of public services has affected the interaction between citizens and government. We argue ...
Curved Edge Routing
2001
We consider the problem of drawing a graph where edges are represented by smooth curves between the associated nodes. Previously curved edges were drawn as splines defined by carefully calculated control points. We present a completely different approach where finding an edge is reduced to solving a differential equation. This approach allows to represent the graph drawing aesthetics directly, even the most complex ones denoting the dependencies among the paths.
uMemristorToolbox: Open source framework to control memristors in Unity for ternary applications
2020
This paper presents uMemristorToolbox, a novel open source framework that reads and writes non-volatile ternary states to memristors. The Unity (C#) framework is a port of the open source Java project Memristor-Discovery and adds a closed-loop ternary memory controller to enable both PC and real-time embedded ternary applications. We validate the closed-loop ternary memory controller in an embedded system case study with 16 M+SDC Tungsten dopant memristors. We measure an average switching speed of 3 Hz, worst case energy usage of 1 μW per switch, 0.03% random write error and no decay in (non-volatile) state retention after 15 minutes. We conclude with observations and open questions when wo…
A Sequential Quadratic Programming Method for Volatility Estimation in Option Pricing
2006
Our goal is to identify the volatility function in Dupire's equation from given option prices. Following an optimal control approach in a Lagrangian framework, we propose a globalized sequential quadratic programming (SQP) algorithm with a modified Hessian - to ensure that every SQP step is a descent direction - and implement a line search strategy. In each level of the SQP method a linear-quadratic optimal control problem with box constraints is solved by a primal-dual active set strategy. This guarantees L^1 constraints for the volatility, in particular assuring its positivity. The proposed algorithm is founded on a thorough first- and second-order optimality analysis. We prove the existe…
Speeding up a few orders of magnitude the Jacobi method: high order Chebyshev-Jacobi over GPUs
2017
In this technical note we show how to reach a remarkable speed up when solving elliptic partial differential equations with finite differences thanks to the joint use of the Chebyshev-Jacobi method with high order discretizations and its parallel implementation over GPUs.
Causality and Loop-Tree Duality at Higher Loops
2019
We relate a $l$-loop Feynman integral to a sum of phase space integrals, where the integrands are determined by the spanning trees of the original $l$-loop graph. Causality requires that the propagators of the trees have a modified $i\delta$-prescription and we present a simple formula for the correct $i\delta$-prescription.
A walk on sunset boulevard
2016
A walk on sunset boulevard can teach us about transcendental functions associated to Feynman diagrams. On this guided tour we will see multiple polylogarithms, differential equations and elliptic curves. A highlight of the tour will be the generalisation of the polylogarithms to the elliptic setting and the all-order solution for the sunset integral in the equal mass case.
Quantum Algorithms for Some Strings Problems Based on Quantum String Comparator
2022
We study algorithms for solving three problems on strings. These are sorting of n strings of length k, “the Most Frequent String Search Problem”, and “searching intersection of two sequences of strings”. We construct quantum algorithms that are faster than classical (randomized or deterministic) counterparts for each of these problems. The quantum algorithms are based on the quantum procedure for comparing two strings of length k in O(k) queries. The first problem is sorting n strings of length k. We show that classical complexity of the problem is Θ(nk) for constant size alphabet, but our quantum algorithm has O˜(nk) complexity. The second one is searching the most frequent string among n …
Business Ethics as a Sustainability Challenge: Higher Education Implications
2018
Recent financial scandals worldwide have intensified concern for business (and especially accounting) ethics. Hence, under an overall economic and social sustainability approach, it is crucial to improve the effectiveness of business ethics and corporate social responsibility (CSR) education, in terms of its impact on business students&rsquo
A Brief History of Forensic Radiology
2019
During the last two decades, forensic radiology showed, as never before, a rapid, widely diffuse, and substantial change in the legal, medical, anthropological, archaeological, and scientific approach to applications of forensic radiology itself.