Results 31 to 40 of about 86,022 (45)
Two Optimization Approaches for a Small‐Scale Power‐to‐Ammonia Cycle
Renewable power‐to‐ammonia (P2A) may be one piece of the energy transition puzzle. As the simulation and optimization in suitable software is key for the optimal design of energy‐efficient P2A cycles, the results of two such software approaches are compared for a novel small‐scale P2A cycle, to be tested at the end of 2024.
Pascal Koschwitz, Leon Roß, Bernd Epple
wiley +1 more source
We study an extensive connection between factor forcings of Borel subsets of Polish spaces modulo a sigma-ideal, and factor forcings of subsets of countable sets modulo an ideal.
arxiv
Characteristic Matrices and Trellis Reduction for Tail-Biting Convolutional Codes [PDF]
Basic properties of a characteristic matrix for a tail-biting convolutional code are investigated. A tail-biting convolutional code can be regarded as a linear block code. Since the corresponding scalar generator matrix Gt has a kind of cyclic structure, an associated characteristic matrix also has a cyclic structure, from which basic properties of a ...
arxiv
How much sweetness is there in the universe? [PDF]
We continue investigations of forcing notions with strong ccc properties introducing new methods of building sweet forcing notions. We also show that quotients of topologically sweet forcing notions over Cohen reals are topologically sweet while the quotients over random reals do not have to be such.
arxiv
Approximate Linear Time ML Decoding on Tail-Biting Trellises in Two Rounds [PDF]
A linear time approximate maximum likelihood decoding algorithm on tail-biting trellises is prsented, that requires exactly two rounds on the trellis. This is an adaptation of an algorithm proposed earlier with the advantage that it reduces the time complexity from O(mlogm) to O(m) where m is the number of nodes in the tail-biting trellis.
arxiv
Reduction of Error-Trellises for Tail-Biting Convolutional Codes Using Shifted Error-Subsequences [PDF]
In this paper, we discuss the reduction of error-trellises for tail-biting convolutional codes. In the case where some column of a parity-check matrix has a monomial factor (with indeterminate D), we show that the associated tail-biting error-trellis can be reduced by cyclically shifting the corresponding error-subsequence by l (the power of D) time ...
arxiv
Simulating Safe Bite Transfer in Robot-Assisted Feeding with a Soft Head and Articulated Jaw [PDF]
Ensuring safe and comfortable bite transfer during robot-assisted feeding is challenging due to the close physical human-robot interaction required. This paper presents a novel approach to modeling physical human-robot interaction in a physics-based simulator (MuJoCo) using soft-body dynamics.
arxiv
Quotients of Strongly Proper Forcings and Guessing Models [PDF]
We prove that a wide class of strongly proper forcing posets have quotients with strong properties. Specifically, we prove that quotients of forcing posets which have simple universal strongly generic conditions on a stationary set of models by certain nice regular suborders satisfy the $\omega_1$-approximation property.
arxiv
$σ$-continuity and related forcings [PDF]
The Steprans forcing notion arises as a quotient of Borel sets modulo the ideal of $\sigma$-continuity of a certain Borel not $\sigma$-continuous function. We give a characterization of this forcing in the language of trees and using this characterization we establish such properties of the forcing as fusion and continuous reading of names.
arxiv
Once bitten, twice shy: A modeling framework for incorporating heterogeneous mosquito biting into transmission models [PDF]
The potential for outbreaks of mosquito-borne disease is linked to the frequency at which mosquitoes feed on blood, also known as the biting rate. But standard models of mosquito-borne disease transmission inherently assume that mosquitoes bite only once per reproductive cycle, an assumption commonly violated in nature. Drivers of multiple biting, like
arxiv