In the field of algorithmic analysis, one of the more well-known exercises is the subset sum problem. That is, given a set of integers, determine whether one or more integers in the set can sum to a target value. Aside from the brute-force approach of verifying all combinations of integers, several solutions have been found, ranging from clever uses of various data structures to computationally...

Many a time, items can be classified as defective or non-defective and the objective is to identify all items, if any, in population. The concept of group testing deals with identifying such using minimum number tests. This paper proposes probabilistic through subset intersection strategy. proposed algorithm 'Subset Intersection Group Testing Strategy' dividing whole population, it positive, in...

This paper uses the L1−norm and the concept of the non-dominated vector, topropose a method to find a well-dispersed subset of non-dominated (WDSND) vectorsof a multi-objective mixed integer linear programming (MOMILP) problem.The proposed method generalizes the proposed approach by Tohidi and Razavyan[Tohidi G., S. Razavyan (2014), determining a well-dispersed subset of non-dominatedvectors of...

Abstract Chimeric antigen receptor (CAR) T cells have demonstrable efficacy in treating B-cell malignancies. Factors such as product composition, lymphodepletion and immune reconstitution are known to influence CAR +T cell survival persistence, however the determinants of cells’ fate differentiation how patients’ reconstituting system therapy outcomes remain poorly understood. We applied single...

let $g$ be a group and $mathcal{n}$ be the class of all nilpotent groups. a subset $a$ of $g$ is said to be nonnilpotent if for any two distinct elements $a$ and $b$ in $a$, $langle a, brangle notin mathcal{n}$. if, for any other nonnilpotent subset $b$ in $g$, $|a|geq |b|$, then $a$ is said to be a maximal nonnilpotent subset and the cardinality of this subset (if it exists) is denoted by $ome...