There is an algorithm which computes the minimal number of generators of the ideal of a reduced curve C in affine n-space over an algebraically closed field K, provided C is not a local complete intersection. The existence of such an algorithm follows from the fact that given d ∈ N, there exists d ∈ N, such that if a is a height n−1 radical ideal inK[X1, . . . ,Xn], generated by polynomials of ...

Mouse spleen cells which have been depleted of adherent cells do not respond to allogeneic lymphocytes in vitro. Their cytotoxic response can be restored by inclusion of mercaptoethanol in the medium. Mercaptoethanol is shown to have a stimulatory effect also on the response of normal (unseparated) spleen cells to alloantigens. The enhancement of the DNA-synthetic and cytotoxic response is simi...

This paper shows the research work on heat exchanger using nano fluid. In this paper we are using compact heat exchanger as heat transferring device while Al2O3 as a nano fluid. The effect of the nano fluids on compact heat exchanger is analyzed by using ε –NTU rating numerical method on turbo-charged diesel engine of type TBD 232V-12 cross flow compact heat exchanger radiator with unmixed flui...

The problem of predicting time series originating from mixtures of signals from independent dynamical systems is considered. We show that the problem of nding representations for the dynamics of such systems is hard if the mixing structure of the system is not taken into account. If, on the contrary, the sources can be unmixed in a prepro-cessing step the complexity of system identiication may ...

a emph{signed graph} (or, in short, emph{sigraph}) $s=(s^u,sigma)$ consists of an underlying graph $s^u :=g=(v,e)$ and a function $sigma:e(s^u)longrightarrow {+,-}$, called the signature of $s$. a emph{marking} of $s$ is a function $mu:v(s)longrightarrow {+,-}$. the emph{canonical marking} of a signed graph $s$, denoted $mu_sigma$, is given as $$mu_sigma(v) := prod_{vwin e(s)}sigma(vw).$$the li...

Let n 1 be an integer. The hypercube Qn is the graph whose vertex set isf0;1gn, where two n-tuples are adjacent if they differ in precisely one coordinate. This graph has many applications in Computer sciences and other area of sciences. Inthe graph Qn, the layer Lk is the set of vertices with exactly k 1’s, namely, vertices ofweight k, 1 k n. The hyper-star graph B(n;k) is...

Expressions for the Zagreb indices and coindices of the total graph, semi-total point graph and of semi-total line graph of subdivision graphs in terms of the parameters of the parent graph are obtained, thus generalizing earlier existing results.

The aim of this paper is to characterize welding of AISI 310 austenitic stainless steel to Inconel 657 for use in oil-refining industries. The welds were produced using four types of filler materials; nickel-based alloys designated as Inconel 82, A, 617, and 310 SS. The interfaces and heat-affected zones were characterized by optical and scanning electron microscopy. Interfaces on the two sides...