Results 41 to 50 of about 4,861,317 (256)
On Efficient Computation of Variable MUSes [PDF]
, 2012 In this paper we address the following problem: given an unsatisfiable CNF formula ${\mathcal{F}}$, find a minimal subset of variables of ${\mathcal{F}}$ that constitutes the set of variables in some unsatisfiable core of ${\mathcal{F}}$. This problem, known as variable MUS (VMUS) computation problem, captures the need to reduce the number of variables
Anton Belov +3 more
openaire +2 more sources
IEEE Access, 2019 Type 1 diabetes mellitus is a lifelong disease with very high morbidity, and its medical expenses are also very alarming. It not only seriously threatens the health of patients, but also brings heavy financial burden to their families. It is necessary to
Xin Ma, Fengna Tang, Xiao Shen
doaj +1 more source
Heuristics for Quantum Computing Dealing with 3-SAT
Mathematics, 2023 The SAT problem is maybe one of the most famous NP-complete problems. This paper deals with the 3-SAT problem. We follow a sort of incremental strategy to save computational costs with respect to the classical quantum computing approach.
Jose J. Paulet +5 more
doaj +1 more source
Vertical equilibrium simulation for industrial-scale CO2 storage in heterogeneous aquifers
Scientific ReportsVertical equilibrium (VE) simulation has re-emerged recently as an efficient approach for simulating geological CO2 storage in aquifers. The approach is well-established and traditionally applied for simulating storage in homogeneous formations.
Hatem Alamara +3 more
doaj +1 more source
Structural insights into an engineered feruloyl esterase with improved MHET degrading properties
FEBS Letters, EarlyView.A feruloyl esterase was engineered to mimic key features of MHETase, enhancing the degradation of PET oligomers. Structural and computational analysis reveal how a point mutation stabilizes the active site and reshapes the binding cleft, expading substrate scope.
Panagiota Karampa +5 more
wiley +1 more source
Computational efficiency of 2048bit.
, 2021 Computational efficiency of 2048bit.
Hasan Naji Hasan Abdullah (11604045) +3 more
core +1 more source
Efficiency of universal parallel computers [PDF]
Acta Informatica, 1983 We consider parallel computers (PC's) with fixed communication network and bounded degree. We deal with the following question: How efficiently can one PC, a so-called universal PC, simulate each PC with n processors? This question is asked in [1] where a universal PC with O(n) processors and time loss O(log(n)) is constructed.
openaire +5 more sources
Hyperosmotic stress induces PARP1‐mediated HPF1‐dependent mono(ADP‐ribosyl)ation
FEBS Letters, EarlyView.Sorbitol‐induced hyperosmotic stress rapidly induces reversible mono(ADP‐ribosyl)ation (MARylation) on PARP1 without the signs of genotoxic signaling. We show that PARP1 autoMARylation is HPF1 dependent and forms hydroxylamine‐resistant O‐glycosidic linkages.
Anna Georgina Kopasz +11 more
wiley +1 more source
Computational efficiency of 1024bit.
, 2021 Computational efficiency of 1024bit.
Hasan Naji Hasan Abdullah (11604045) +3 more
core +1 more source
Extended Target GMPHD Filter Based on Mean Shift and Graph Structure [PDF]
Xibei Gongye Daxue Xuebao, 2018 In view of excessive measurements partition number, a large computation load of extended target tracking and leakage estimation when the extended targets cross, an extended target tracking algorithm based on GMPHD with mean shift and graph structure is ...
doaj +1 more source