an h-magic labeling in a h-decomposable graph g is a bijection f : v (g) ∪ e(g) → {1, 2, ..., p + q} such that for every copy h in the decomposition, σνεv(h) f(v) +  σeεe(h) f(e) is constant. f is said to be h-e-super magic if f(e(g)) = {1, 2, · · · , q}. a family of subgraphs h1,h2, · · · ,hh of g is a mixed cycle-decomposition of g if every subgraph hi is isomorphic to some cycle ck, for k ≥ ...

to investigate effects of different super absorbent polymer and animal manure ratios on the quantitative and qualitative characteristics of soybean under drought stress, a split plots experiment was conducted based on randomized complete block design with three replications in marvdasht, iran in 2009. main factor included of irrigation with 50, 100 and 150 mm evaporation from pan class a and su...

Keywords: shared variables network shared variables distributed programming UNIX genetic algorithm Index: UNIX distributed super-computing shared variables message passing client-server networks distributed shared memory Q'NIAL Dyalog APL RPC XDR TCP/IP daemon System V IPC shared memory distributed memory distributed shared memory LINDA deadlock race condition semaphore Abstract Recent market s...