Results 71 to 80 of about 5,002,207 (261)
Modeling of nano piezoelectric actuator based on block matching algorithm with optimal block size
, 2013 In this paper, a new hysteresis modeling method based on an improved sub-pixel blocking matching algorithm with an optimal block size and the Preisach model is proposed to model the hysteresis behavior of a nano piezoelectric actuator (PA) on nano scale ...
He YQ(何玉庆) +3 more
core
FEBS Letters, EarlyView.Encapsulins are protein nanocompartments that play an important role in iron storage. In the Myxococcus xanthus encapsulin system, two cargo proteins called EncB and EncC contribute to iron mineralization. Here, we show that EncB and EncC generate iron‐containing minerals with distinct chemical compositions, suggesting that the composition of stored ...
Harry B. McDowell +2 more
wiley +1 more source
FEBS Letters, EarlyView.Mycobacterial 3‐methylcrotonyl‐CoA carboxylase uses a mobile biotin‐carrying domain to shuttle a carboxyl group between two catalytic sites, enabling carboxylation of 3‐methylcrotonyl‐CoA during leucine breakdown. Cryo‐electron microscopy captures the carrier at both sites and reveals an inward loop movement that may prevent futile rebinding to the ...
Ajit Yadav +2 more
wiley +1 more source
Contour Matching Using Local Affine Transformations
, 1992 Partial constraints are often available in visual processing tasks requiring the matching of contours in two images. We propose a non- iterative scheme to determine contour matches using locally affine transformations.
Bachelder, Ivan A.
core
Putting Context into Schema Matching [PDF]
, 2006 Attribute-level schema matching has proven to be an important first step in developing mappings for data exchange, integration, restructuring and schema evolution. In this paper we investigate contextual schema matching, in which selection conditions are
Elnahrawy, Eiman +3 more
core
Dominating induced matchings and other graph parameters
AKCE International Journal of Graphs and CombinatoricsA matching M in a graph G is an induced matching if the largest degree of the subgraph of G induced by M is equal to one. A dominating induced matching (DIM) of G is an induced matching that dominates every edge of G. It is well known that, if they exist,
A. Mahmoodi +3 more
doaj +1 more source
The Shewanella oneidensis Fic enzyme SoFic targets the switch‐I region of EF‐Tu for AMPylation
FEBS Letters, EarlyView.Fic enzymes mediate diverse post‐translational modifications across all domains of life, including AMPylation. Prokaryotic EF‐Tu can be AMPylated and deAMPylated by the conserved Fic enzyme SoFic. Structural and biochemical approaches were used to characterize the effect of AMPylation on EF‐Tu, SoFic's enzymatic activities, and the enzyme‐target ...
Svenja Runge +6 more
wiley +1 more source
Multivariate and Propensity Score Matching Software with Automated Balance Optimization: The Matching package for R [PDF]
Matching is an R package which provides functions for multivariate and propensity score matching and for finding optimal covariate balance based on a genetic search algorithm.
Jasjeet S. Sekhon
core
Robust matching and its optimum.
, 2023 reservedCon la presente trattazione si ha innanzi tutto l’intento di esaminare il concetto di matching robusto, introdotto da Hassin e Rubinstein in [1] ed esplicabile con il seguente gioco di somma zero con strategia pura..
COBALCHIN, MARIAVITTORIA
core
Bootstrap inference for K-nearest neighbour matching estimators [PDF]
Abadie and Imbens (2008, Econometrica) showed that classical bootstrap schemes fail to provide correct inference for K-nearest neighbour (KNN) matching estimators of average causal effects.
de Luna, Xavier +2 more
core +2 more sources