Publish in OALib Journal
APC: Only $99
Components of the TGF-β superfamily have been well established
in their intricate and multifaceted roles in cancer progression and survival.
The TGF-βs have been targeted
therapeutically in an attempt to modify complex tumour networks to favour
cancer cell destruction. Goals of these therapies are often to attack the “hallmarks”
of cancer: characteristics acquired by cancer cells via re-wiring or manipulating
existing biological pathways to their survival advantage. Of the multitude of
targeted therapies currently available, viral therapies have shown much promise
in their efficacy of treatment. This review highlights current viral therapies
targeting members of the TGF-β superfamily,
with a focus on the strengths and limitations associated with this form of
targeted cancer therapy.
Disk scheduling is one of the main
responsibilities of Operating System. OS manages hard disk to provide best
access time. All major Disk scheduling algorithms incorporate seek time as the
only factor for disk scheduling. The second factor rotational delay is ignored
by the existing algorithms. This research paper considers both factors, Seek Time and Rotational Delay to schedule the
disk. Our algorithm Fuzzy Disk Scheduling (FDS) looks at the uncertainty associated with scheduling
incorporating the two factors. Keeping in view a Fuzzy inference system using
If-Then rules is designed to optimize
the overall performance of disk drives. Finally we compared the FDS with the
other scheduling algorithms.
Let P be a set of n points in two dimensional plane. For each
point , we locate an axis- parallel unit square having one particular side passing
through p and enclosing the maximum number of points
from P. Considering all
points , such n squares can be reported in O(nlogn) time. We show that this result can be used to
(i) locate m>(2) axis-parallel unit squares which are pairwise
disjoint and they together enclose the maximum number of points from P (if exists) and (ii) find the smallest
axis-parallel square enclosing at least k points of P , .