Learn More
It is just amazing that both of the cover time and the mean hitting time of a random walk on a finite graph, in which the vertex visited next is selected from the adjacent vertices at random with the same probability, are bounded by O(n 3) for any undirected graph with order n, despite of the lack of global topological information. Thus a natural guess is(More)
Being motivated by the work of Cochran et al. on the Gel'fand triple E] (L 2) E] , we are led to nd elementary functions to replace the exponential generating functions G and G 1== for the characterization of generalized and test functions. We deene the Legendre transformù for u in C +;log and the L-function Lu when u 2 C +;log is (log, exp)-convex. We show(More)
Molecularly imprinted polymers (MIP) have been elucidated to work as artificial receptors. In our present study, a MIP was applied as a molecular recognition element to a chemical sensor. We have constructed an atrazine sensor based on a MIP layer selective for atrazine and its electrochemical reduction on gold electrode. The atrazine sensor was fabricated(More)
The knowledge base of companies is increasingly seen as underlying a firm's performance, and the role of knowledge workers within this framework is seen as strongly associated with a firm's competitive performance. This perspective views the effective management of knowledge workers as crucial in sustaining an organisation's competitive advantage. The paper(More)
Let µ be a probability measure on the real line with finite moments of all orders. Suppose the linear span of polynomials is dense in L 2 (µ). Then there exists a sequence {Pn} ∞ n=0 of orthogonal polynomials with respect to µ such that Pn is a polynomial of degree n with leading coefficient 1 and the equality (x − αn)Pn(x) = P n+1 (x) + ωnP n−1 (x) holds,(More)