Results 111 to 120 of about 5,846,948 (298)

Structural Analysis Methods for Differential Algebraic Equations via Fixed-Point Iteration

open access: yes, 2016
Motivated by Pryce’s structural analysis method for differential algebraic equations (DAEs), we show the complexity of the fixed-point iteration algorithm (FPIA) and propose a fixed-point iteration method with parameters.
Xiaolin Qin   +3 more
core   +1 more source

Intrapatient tumour heterogeneity and clonal evolution in an autopsy study of metastatic salivary gland cancer

open access: yesMolecular Oncology, EarlyView.
Tumour heterogeneity and clonal evolution of metastatic salivary gland cancer were evaluated in two patients with adenoid carcinoma and one patient with myoepithelial carcinoma. Radiology‐guided autopsy enabled multi‐region sampling (total samples n = 149), followed by whole‐genome sequencing and phylogenetic reconstruction (17 tumour samples, 4–7 per ...
Gerben Lassche   +10 more
wiley   +1 more source

An iteration process for nonexpansive mappings with applications to fixed point theory in product spaces

open access: yes, 1989
A uniform transfinite iteration procedure for selecting fixed points of nonexpansive mappings is introduced. This procedure, which applies to arbitrary nonexpansive mappings in Banach spaces having Kadec-Klee norm and to strictly contractive mappings in ...
W. A. Kirk
core   +1 more source

Mechanisms and therapeutic opportunities of the ribotoxic stress response in cancer

open access: yesMolecular Oncology, EarlyView.
Cancer cells' high translational demand creates opportunities to therapeutically target ribosome function. Ribosome stalling and collisions activate ZAKα and the ribotoxic stress response (RSR), which can trigger rapid, p53‐independent apoptosis in cancer.
Anastassiya Kim   +7 more
wiley   +1 more source

Composition analysis of large samples with PGNAA using a fixed point iteration.

open access: yes, 2002
The composition problem in large sample prompt gamma neutron activation analysis (PGNAA) is a nonlinear inverse problem. The basic form of the nonlinear inverse composition problem is presented.
Akkurt, Hatice
core   +3 more sources

APOBEC3 activity and DNA polymerase‐ε deficiency are associated with distinct IDH1 R132 hotspot mutations

open access: yesMolecular Oncology, EarlyView.
Isocitrate dehydrogenase 1 (IDH1) mutations are highly recurrent in multiple human cancer types, including cholangiocarcinoma and glioma. IDH1 R132C is the most common IDH1 mutation in cholangiocarcinoma and likely arises from APOBEC3A‐ or APOBEC3B‐mediated deamination.
Kelly E. Butler   +3 more
wiley   +1 more source

A Modified Mann Iteration by Boundary Point Method for Finding Minimum-Norm Fixed Point of Nonexpansive Mappings

open access: yesAbstract and Applied Analysis, 2013
Let H be a real Hilbert space and C⊂H a closed convex subset. Let T:C→C be a nonexpansive mapping with the nonempty set of fixed points Fix(T). Kim and Xu (2005) introduced a modified Mann iteration x0=x∈C, yn=αnxn+(1−αn)Txn, xn+1=βnu+(1−βn)yn, where u∈C
Songnian He, Wenlong Zhu
doaj   +1 more source

Automated FRAP microscopy for high‐throughput analysis of protein dynamics in chromatin organization and transcription

open access: yesFEBS Open Bio, EarlyView.
RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz   +6 more
wiley   +1 more source

Data Dependence for Ishikawa Iteration When Dealing with Contractive-Like Operators

open access: yesFixed Point Theory and Applications, 2008
We prove a convergence result and a data dependence for Ishikawa iteration when applied to contraction-like operators. An example is given, in which instead of computing the fixed point of an operator, we approximate the operator with a contractive-like ...
Teodor Grosan, Ş. M. Şoltuz
doaj   +1 more source

Time and nodal decomposition with implicit non-anticipativity constraints in dynamic portfolio optimization [PDF]

open access: yes
We propose a decomposition method for the solution of a dynamic portfolio optimization problem which fits the formulation of a multistage stochastic programming problem.
Elio Canestrelli, Diana Barro
core  

Home - About - Disclaimer - Privacy