Let d(u, v) denote the distance between two distinct vertices of a connected graph G, and diam(G) be the diameter of G. A radio labeling c of G is an assignment of positive integers to the vertices ofG satisfying d(u, v)+|c(u)−c(v)| ≥ diam(G)+1 for every two distinct vertices u, v. The maximum integer in the range of the labeling is its span. The radio number of G, rn(G), is the minimum possibl...

In this paper, a new technique for domino circuit is proposed, which has high noise immunity and consume low power without degrading the performance for wide fan-in dynamic gates. The proposed circuit utilizes the double stage domino technique, in which the domino circuit is divided into two stages: standard footed domino includes pull-down network and another standard footed domino includes on...

â â â  parsian alluvial fan system is a part of asyab-kharabeh fluvial system that response it to quaternary climate changes is the main goal of this study. for this aim, climatic proxies and traces in alluvial fan structure were investigated base d o n four categories: aggradation and degradation phases, debris flows, size changes in deposited materials and formation of alluvial fan tufas. pri...

Word comprehension engages the left ventrolateral prefrontal (lVLPFC) and posterior lateral-temporal cortices (PLTC). The contributions of these brain regions to comprehension remain controversial. We hypothesized that the PLTC activates meanings, whereas the lVLPFC resolves competition between representations. To test this hypothesis, we used functional magnetic resonance imaging (fMRI) to ass...

Recently, Fan et al. proposed a user efficient recoverable off-line e-cash scheme with fast anonymity revoking. They claimed that their scheme could achieve security requirements of an e-cash system such as, anonymity, unlinkability, double spending checking, anonymity control, and rapid anonymity revoking on double spending. They further formally prove the unlinkability and the un-forgeability...

A parallel minor is obtained from a graph by any sequence of edge contractions and parallel edge deletions. We prove that, for any positive integer k, every internally 4-connected graph of sufficiently high order contains a parallel minor isomorphic to a variation of K4,k with a complete graph on the vertices of degree k, the k-partition triple fan with a complete graph on the vertices of degre...