Results 51 to 60 of about 432,921 (266)

EHAUPM: Efficient High Average-Utility Pattern Mining With Tighter Upper Bounds

open access: yesIEEE Access, 2017
High-utility itemset mining (HUIM) has become a popular data mining task, as it can reveal patterns that have a high-utility, contrarily to frequent pattern mining, which focuses on discovering frequent patterns.
Jerry Chun-Wei Lin   +3 more
doaj   +1 more source

Performance Analysis of Polar Codes Over Fox’s H-Fading Channels With RHI and IQI Impairments

open access: yesIEEE Access, 2023
This study examined the error probability performance of polar codes across Fox’s $H$ -fading (FHF) channels while taking into account in-phase and quadrature-phase imbalance (IQI), as well as residual hardware impairments (RHI).
Souad Labghough   +4 more
doaj   +1 more source

Upper Bounds on Separating Codes

open access: yesIEEE Transactions on Information Theory, 2004
The combinatorial concept of separating systems has numerous applications, such as automata theory, digital fingerprinting, group testing, and hashing. In this correspondence, we derive upper bounds on the size of codes with various separating properties.
Cohen, Gerard D., Schaathun, H.
openaire   +4 more sources

Modulation of Homer1 EVH1 domain internal dynamics by putative autism‐associated mutations

open access: yesFEBS Letters, EarlyView.
The putative autism‐associated M65I and S97L variants of the EVH1 domain of the postsynaptic scaffold protein Homer1 do not exhibit substantial changes in their overall structure or partner binding. Both of them, but especially the M65I variant, show altered internal dynamics relative to the wild‐type domain on the μs‐ms timescale, indicated by the ...
Fanni Farkas   +6 more
wiley   +1 more source

An Upper Bound Energy Formulation of Free-Chip Machining with Flat Chips and an Alternative Method of Determination of Cutting Forces without Using the Merchant’s Circle Diagram

open access: yesMachines, 2023
An upper bound analysis of free-chip machining has been carried out, where the tool cutting and friction forces were determined from the deformation energy dissipated during the chip separation process.
Hillol Joardar   +5 more
doaj   +1 more source

An unexpected alternative viologen electron mediator site in tungsten‐containing formate dehydrogenase

open access: yesFEBS Letters, EarlyView.
An unexpected alternative interaction site for ethyl viologen was identified in formate dehydrogenase 1 from Methylorubrum extorquens. Combined mutagenesis, kinetic analysis, and docking revealed that aromatic residues near an iron–sulfur cluster enable flavin mononucleotide‐independent electron transfer, offering a framework for engineering improved ...
Eleni G. Poloniataki, Yong Hwan Kim
wiley   +1 more source

Classical Lower Bounds from Quantum Upper Bounds [PDF]

open access: yes2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018
46 pages; to appear at FOCS ...
Shalev Ben-David   +3 more
openaire   +2 more sources

Cell geometry and membrane protein crowding constrain Escherichia coli growth rate, overflow metabolism, respiration, and maintenance energy

open access: yesFEBS Letters, EarlyView.
The physical dimensions and shape of bacterial cells define the surface area available to acquire nutrients and the volume available for synthesizing proteins and DNA. Here, we use computational systems biology to decode the importance of cell geometry as a major determinant of prokaryotic phenotype, including growth rate and metabolic efficiency. This
Ross P. Carlson   +6 more
wiley   +1 more source

Examining the Limits of Predictability of Human Mobility

open access: yesEntropy, 2019
We challenge the upper bound of human-mobility predictability that is widely used to corroborate the accuracy of mobility prediction models. We observe that extensions of recurrent-neural network architectures achieve significantly higher prediction ...
Vaibhav Kulkarni   +3 more
doaj   +1 more source

Remarks on the Upper Bound Theorem

open access: yesJournal of Combinatorial Theory, Series A, 2003
An extension of the known upper bound theorem for convex polytopes in \(\mathbb{R}^d\) is the so-called strong upper bound theorem due to Gil Kalai, holding for the boundary complexes of simplicial polytopes and their full-dimensional subcomplexes. The author gives an extension of this theorem for even-dimensional simplicial manifolds.
openaire   +2 more sources

Home - About - Disclaimer - Privacy