Results 51 to 60 of about 199,961 (218)
A Rank-Two Feasible Direction Algorithm for the Binary Quadratic Programming
Based on the semidefinite programming relaxation of the binary quadratic programming, a rank-two feasible direction algorithm is presented. The proposed algorithm restricts the rank of matrix variable to be two in the semidefinite programming relaxation ...
Xuewen Mu, Yaling Zhang
doaj +1 more source
A Distributed Randomized Gradient-Free Algorithm for the Non-Convex Economic Dispatch Problem
In this paper, a distributed randomized gradient-free algorithm (DRGF) is employed to solve the complex non-convex economic dispatch problem whose non-convex constraints include valve-point loading effects, prohibited operating zones, and multiple fuel ...
Jun Xie, Qingyun Yu, Chi Cao
doaj +1 more source
RoundMi: A quantitative method to analyze mitochondrial morphology in mitotic cells
RoundMi is a workflow for rapid analysis of mitochondrial morphology in mitotic cells. By combining adaptive preprocessing with automated segmentation and quantification, it enables accurate measurements from single focal plane images, reducing acquisition time and computational demands while remaining compatible with high‐throughput fixed and live ...
Elmira Parvindokht Bararpour +2 more
wiley +1 more source
A Randomized Algorithm for Optimal PID Controllers
A randomized algorithm is suggested for the syntheses of optimal PID controllers for MIMO coupled systems, where the optimality is with respect to the H ∞ -norm, the H 2 -norm and the LQR functional, with possible system-performance ...
Yossi Peretz
doaj +1 more source
Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard +12 more
wiley +1 more source
Hybrid Feature Selection Approach Based on GRASP for Cancer Microarray Data
Microarray data usually contain a large number of genes, but a small number of samples. Feature subset selection for microarray data aims at reducing the number of genes so that useful information can be extracted from the samples. Reducing the dimension
Arpita Nagpal, Deepti Gaur
doaj +1 more source
KDAC6 has been associated with cell motility and actin structures, but specific domain contributions are not established. The two catalytic domains have differential effects on motility and F‐actin regulation, affecting cortical F‐actin density, motility, stress fibers, and cell spreading.
Taylor V. Joseph +7 more
wiley +1 more source
Randomized block coordinate DC algorithm
We introduce an extension of the Difference of Convex Algorithm (DCA) in the form of a randomized block coordinate approach for problems with separable structure.
Hoomaan Maskan +3 more
doaj +1 more source
Accurate and noninvasive prostate cancer detection using plasma‐derived extracellular vesicle RNA
Plasma extracellular vesicles were captured with WGA‐conjugated magnetic beads and profiled for RNA biomarkers. A three‐RNA panel (NM_024955, NR_047469, and NR_002564) distinguished prostate cancer from healthy controls and benign prostatic hyperplasia, supporting a simple, noninvasive approach to improve prostate cancer detection.
Hanping Wei, Haoran Wu, Wei Feng
wiley +1 more source
Fast edge colorings with fixed number of colors to minimize imbalance
We study the following optimization problem: the input is a multigraph G=(V,E) and an integer parameter g. A feasible solution consists of a (not necessarily proper) coloring of E with colors 1, 2, …, g.
Gruia Calinescu, Michael Pelsmajer
doaj +1 more source

