Balanced Energy/Time Optimal Defibrillation

2021 ◽  
Vol 2 (2) ◽  
Author(s):  
Enrique Barbieri ◽  
Slobodanka Muzdeka
Keyword(s):  
Optimal Feedback Control ◽  
Order System ◽  
The Novel ◽  
First Order ◽  
Performance Improvements ◽  
Elapsed Time ◽  
Time Optimal ◽  
Time Expenditures ◽  
Weighted Measure ◽  
Special Case

Abstract The synthesis of a cardiac defibrillating pulse is cast as a standard optimal feedback control problem that minimizes a weighted measure of consumed energy and elapsed time to reach a nominal defibrillated state. The solution is developed for a general first-order system that includes the widely used parallel resistor/capacitor circuit and energy source as a special case. The novel optimal pulse comprises an exponentially ascending and a rectangular component; it is agile and energy conscious; and it therefore outperforms the waveforms developed thus far that minimize energy or time expenditures alone. Explicit time-domain expressions are derived which may be used for comparing against other commonly studied defibrillating functions. The analytic formulas and computer simulations may be useful to implement performance improvements in defibrillating devices.

An Adjustment of Reference Tracking PID Controllers for a First-order System with a Dead Time

2016 ◽  
Vol 136 (5) ◽  
pp. 676-682 ◽  
Author(s):  
Akihiro Ishimura ◽  
Masayoshi Nakamoto ◽  
Takuya Kinoshita ◽  
Toru Yamamoto
Keyword(s):  
Dead Time ◽  
Order System ◽  
Pid Controllers ◽  
Reference Tracking ◽  
First Order

Relativized realizability in intuitionistic arithmetic of all finite types

1978 ◽  
Vol 43 (1) ◽  
pp. 23-44 ◽  
Author(s):  
Nicolas D. Goodman
Keyword(s):  
Extension Theorem ◽  
General Notion ◽  
Conservative Extension ◽  
First Order ◽  
New Information ◽  
Reflection Theorem ◽  
Order Arithmetic ◽  
Special Case ◽  
Dependent Choice ◽  
Intuitionistic Arithmetic

In this paper we introduce a new notion of realizability for intuitionistic arithmetic in all finite types. The notion seems to us to capture some of the intuition underlying both the recursive realizability of Kjeene [5] and the semantics of Kripke [7]. After some preliminaries of a syntactic and recursion-theoretic character in §1, we motivate and define our notion of realizability in §2. In §3 we prove a soundness theorem, and in §4 we apply that theorem to obtain new information about provability in some extensions of intuitionistic arithmetic in all finite types. In §5 we consider a special case of our general notion and prove a kind of reflection theorem for it. Finally, in §6, we consider a formalized version of our realizability notion and use it to give a new proof of the conservative extension theorem discussed in Goodman and Myhill [4] and proved in our [3]. (Apparently, a form of this result is also proved in Mine [13]. We have not seen this paper, but are relying on [12].) As a corollary, we obtain the following somewhat strengthened result: Let Σ be any extension of first-order intuitionistic arithmetic (HA) formalized in the language of HA. Let Σω be the theory obtained from Σ by adding functionals of finite type with intuitionistic logic, intensional identity, and axioms of choice and dependent choice at all types. Then Σω is a conservative extension of Σ. An interesting example of this theorem is obtained by taking Σ to be classical first-order arithmetic.

On the Boundary Value Problem in A Dihedral Angle for Normally Hyperbolic Systems of First Order

1998 ◽  
Vol 5 (2) ◽  
pp. 121-138
Author(s):  
O. Jokhadze
Keyword(s):  
Partial Differential Equations ◽  
Boundary Value Problem ◽  
Principal Part ◽  
Hyperbolic Systems ◽  
Boundary Value ◽  
Three Dimensional ◽  
Order System ◽  
First Order ◽  
Dimensional Boundary ◽  
Class Of Functions

Abstract Some structural properties as well as a general three-dimensional boundary value problem for normally hyperbolic systems of partial differential equations of first order are studied. A condition is given which enables one to reduce the system under consideration to a first-order system with the spliced principal part. It is shown that the initial problem is correct in a certain class of functions if some conditions are fulfilled.

Diffusion Experiments with a Global Discontinuous Galerkin Shallow-Water Model

2009 ◽  
Vol 137 (10) ◽  
pp. 3339-3350 ◽  
Author(s):  
Ramachandran D. Nair
Keyword(s):  
Shallow Water ◽  
Discontinuous Galerkin ◽  
Water Model ◽  
Order System ◽  
Small Scale ◽  
Shallow Water Model ◽  
First Order ◽  
Advection Diffusion Equation ◽  
Diffusion Scheme ◽  
Cubed Sphere

Abstract A second-order diffusion scheme is developed for the discontinuous Galerkin (DG) global shallow-water model. The shallow-water equations are discretized on the cubed sphere tiled with quadrilateral elements relying on a nonorthogonal curvilinear coordinate system. In the viscous shallow-water model the diffusion terms (viscous fluxes) are approximated with two different approaches: 1) the element-wise localized discretization without considering the interelement contributions and 2) the discretization based on the local discontinuous Galerkin (LDG) method. In the LDG formulation the advection–diffusion equation is solved as a first-order system. All of the curvature terms resulting from the cubed-sphere geometry are incorporated into the first-order system. The effectiveness of each diffusion scheme is studied using the standard shallow-water test cases. The approach of element-wise localized discretization of the diffusion term is easy to implement but found to be less effective, and with relatively high diffusion coefficients, it can adversely affect the solution. The shallow-water tests show that the LDG scheme converges monotonically and that the rate of convergence is dependent on the coefficient of diffusion. Also the LDG scheme successfully eliminates small-scale noise, and the simulated results are smooth and comparable to the reference solution.

Sign in / Sign up

Export Citation Format

Share Document