5,266 research outputs found
DNA-dependent protein kinase (DNA-PK) phosphorylates and activates TonEBP/NFAT5 in response to hypertonicity
No full textImprovement of Field Emission Characteristics of Carbon Nanotubes by Excimer Laser Treatment
No full text
A study on the electrochromic properties of polyaniline/silica composite films with an enhanced optical contrast
No full textMolecular cloning of transcription factor in the regulation of human monoamine oxidase B gene
No full textTopological properties of incomplete WK-recursive networks
No full text[[abstract]]Recently, WK-recursive networks have received much attention due to their many favorable properties. However, they suffered from a rigorous restriction on their sizes. Incomplete WK-recursive networks were proposed to relieve this restriction. In this paper, the topological properties of incomplete WK-recursive networks are investigated. It is shown that they contain Hamiltonian cycles if their connectivities are greater than one. A sufficient and necessary condition is also proposed for those with connectivity one to contain a Hamiltonian path. A linear-time algorithm using the prune-and-search technique is presented to compute their diameters. (C) 1998 John Wiley & Sons, Inc. Networks 32: 23-45, 1998.[[note]]SC
Broadcasting on incomplete WK-recursive networks
No full text[[abstract]]The WK-recursive networks, which were originally proposed by Vecchia and Sanges, have suffered from a rigorous restriction on the number of nodes. Like other incomplete networks; the incomplete WK-recursive networks have been proposed to relieve this restriction. In this paper, broadcasting on the incomplete WK-recursive networks is discussed. The proposed broadcasting algorithm is optimal with respect to message complexity. Besides, extensive experiments are made to evaluate its performance. Experimental results show that (1) the heights of the broadcasting trees do not exceed the diameters, (2) a high percentage of the nodes can receive the message from the source node via the shortest paths, (3) for those nonshortest transmission paths, the deviations are small, and (4) a high percentage of the broadcasting trees are Of minimum height, (C) 1999 Academic Press, Inc.[[note]]SC
A shortest-path routing algorithm for incomplete WK-recursive networks
No full text[[abstract]]The WK-recursive networks own two structural advantages: expansibility and equal degree. A network is expansible if no changes to node configuration and link connection are necessary when it is expanded, and of equal degree if its nodes have the same degree no matter what the size is. However, the number of nodes contained in a WK-recursive network is restricted to d(t) where d > 1 is the size of the basic building block and t greater than or equal to 1 is the level of expansion. The incomplete WK-recursive networks, which were proposed to relieve this restriction, are allowed to contain an arbitrary number of basic building blocks, while preserving the advantages of the WK-recursive networks. Designing shortest-path routing algorithms ion incomplete networks is in general more difficult than for complete networks. The reason is that most incomplete networks lack a unified representation. One of the contributions of this paper is to demonstrate a useful representation, i.e., the multistage graph representation, for the incomplete WK-recursive networks. On the basis of it, a shortest-path routing algorithm is then proposed. With O(d . t) time preprocessing, this algorithm lakes O(t) time for each intermediate node to determine the next node along the shortest path.[[note]]SC
Local effects and global impact in neurotoxicity and neurodegeneration: The Xi"an International Neurotoxicology Conference
Full text link'Neurotoxicity and Neurodegeneration: Local Effect and Global Impact' was the theme of the Xi"an International Neurotoxicology Conference (XINC), held in Xi"an, June 2011. The Conference was a joint event of the 13th Biennial Meeting of the International Neurotoxicology Association (INA-13) and the 11th International Symposium on Neurobehavioral Methods and Effects in Occupational and Environmental Health (NEUREOH-11) of the Scientific Committee on Neurotoxicology and..
Node-disjoint paths in incomplete WK-recursive networks
No full text[[abstract]]The incomplete WK-recursive networks have been recently proposed to relieve the restriction on the sizes of the WK-recursive networks. In this paper, a maximal set of node-disjoint paths is constructed between arbitrary two nodes of an incomplete WK-recursive network. The effectiveness of the constructed paths is verified by both theoretic analysis and extensive experiments. A tight upper bound on the maximal length is suggested. On the other hand, experimental results show that for arbitrary two nodes, the expected maximal length is not greater than twice their distance and about equal to the diameter. When the two nodes are the farthest pair, the maximal length is not greater than twice the diameter and the expected maximal length is not greater than 1.5 times the diameter. (C) 2000 Elsevier Science B.V. All rights reserved.[[note]]SC
- …
