an alumina supported co/ni catalyst was prepared by sol-gel procedure to study the catalytic behavior during fischer-tropsch synthesis in a fixed-bed reactor. the effect of co conversion (10-50%) on hydrocarbon product distribution (ch4, c5+ and c2-c4 olefin selectivities) was studied. selectivity for ch4 decreased, while those of c5+ and olefin selectivities increased with increasing co conver...

In this paper, we consider the concepts co-farthest points innormed linear spaces. At first, we define farthest points, farthest orthogonalityin normed linear spaces. Then we define co-farthest points, co-remotal sets,co-uniquely sets and co-farthest maps. We shall prove some theorems aboutco-farthest points, co-remotal sets. We obtain a necessary and coecient conditions...

Let A be a 0 − 1 matrix with precisely two 1’s in each column and let 1 be the all-one vector. We show that the problems of deciding whether the linear system Ax ≥ 1, x ≥ 0 (1) defines an integral polyhedron, (2) is totally dual integral (TDI), and (3) is box-totally dual integral (box-TDI) are all co-NP-complete, thereby confirming the conjecture on NP-hardness of recognizing TDI systems made ...

In this note we prove that the problem of deciding whether or not a set of integer vectors forms a Hilbert basis is co-NP-complete. Equivalently, deciding whether a conic linear system is totally dual integral (TDI) or not, is co-NPcomplete. These are true even if the vectors in the set or respectively the coefficient vectors of the inequalities are 0−1 vectors having at most three ones.

A graph G is said to be aSeymour graph if for any edge set F there exist |F | pairwise disjoint cuts each containing exactly one element of F , provided for every circuit C of G the necessary condition |C∩F | ≤ |C \F | is satisfied. Seymour graphs behave well with respect to some integer programs including multiflow problems, or more generally odd cut packings, and are closely related to matchi...

co-fe films were electrodeposited on cu substrate from electrolytes with different co concentration  levels. x-ray diffraction (xrd) was used  to  investigate  the  films  crystal  structures. the  results  indicate that  if  the  co  concentration  is  less  that  the  fe  concentration,  the cubic  structure  appears  in  the  films, while  the  hexagonal  structure dominates when  the co  co...

We present some complexity results on checking necessary efficiency in interval multiobjective linear programming. Supposing that objective function coefficients perturb within prescribed intervals, a feasible point x is called necessarily efficient if it is efficient for all instances of interval data. We show that the problem of checking necessary efficiency is co-NP-complete even for the cas...

We investigate the complexity of the MEMBERSHIP problem for some geometrically deened classes of Boolean functions, i.e., the complexity of deciding whether a Boolean function given in DNF belongs to the class. We give a general argument implying that this problem is co-NP-hard for any class having some rather benign closure properties. Applying this result we show that the MEMBERSHIP problem i...

Co-Fe films were electrodeposited on Cu substrate from electrolytes with different Co concentration  levels. X-ray diffraction (XRD) was used  to  investigate  the  films  crystal  structures. The  results  indicate that  if  the  Co  concentration  is  less  that  the  Fe  concentration,  the cubic  structure  appears  in  the  films, while  the  hexagonal  structure dominates when  the C...