Component assignment problem (CAP) is critical for the research on system reliability, which was firstly put forward by Derman [1]. Many scholars have performed comprehensive studies on CAP with different algorithms. Since importance measure can find the weakness of the system, the highest reliable components are probably assigned into most important position to optimize the system reliability....

Extracellular signaling pathways and transcriptional regulatory networks function during development to specify metazoan cell fates. During Caenorhabditis elegans vulval development, the specification of three vulval precursor cells (VPCs) requires the activity of Wnt, Notch, and Ras signaling pathways, and function of the Hox gene lin-39. LIN-39 protein levels are regulated in the VPCs by both...

Graph partitioning has become an important facet of computer science with its applications in many disciplines. Graph partitioning is NPcomplete and has given rise to many heuristic algorithms in order to achieve the best estimate in a decent amount of time. ParMETIS is an MPI-based parallel library that implements the heuristic multilevel Kerninghan/Lin algorithm to partition and repartition u...

In this paper, we investigate the validity of the Unique Games Conjecture when the constraint graph is the boolean hypercube. We construct an almost optimal integrality gap instance on the Hypercube for the Goemans-Williamson semidefinite program (SDP) for Max-2-LIN(Z2). We conjecture that adding triangle inequalities to the SDP provides a polynomial time algorithm to solve Unique Games on the ...

microRNAs (miRNAs) are ∼22 nt regulatory RNAs that in animals typically bind with partial complementarity to sequences in the 3' untranslated (UTR) regions of target mRNAs, to induce a decrease in the production of the encoded protein. The relative contributions of translational inhibition of intact mRNAs and degradation of mRNAs caused by binding of the miRNA vary; for many genetically validat...

In this paper we modify Buchberger’s S-pair reduction algorithm for computing a Gröbner basis of a toric ideal so as to apply to an integer program in inequality form with fixed right hand sides and fixed upper bounds on the variables. We formulate the algorithm in the original space and interpret the reduction steps geometrically. In fact, three variants of this algorithm are presented and we ...

SUMMARY Caenorhabditis elegans possesses two Notch-like receptors, LIN-12 and GLP-1, which have both overlapping and individual biological functions. We examined the lin-12 and glp-1 genes in closely related nematodes to learn about their evolution. Here we report molecular and functional analyses of lin-12 orthologs from two related nematodes, C. briggsae (Cb) and C. remanei (Cr). In addition,...

This paper presents a new algorithm for computing the minimum distance between convex poly-hedras. The algorithm of Gilbert-Johnson-Keerthi (GJK) and the algorithm of Lin-Canny (LC) are well-known fast solutions to the problem. We show how a mix between LC's idea and the GJK's algorithm can be used to solve the problem. In our algorithm, we use local methods to calculate the distance between fe...