with a highly irregular function F (t, x), as well as nonlinear versions of these equations. However, if F is ”very rough” then, presumably, the solution u(t, x) will not be very smooth either, hence one would not be able to differentiate it in time or space, and the sense in which u(t, x) solves the corresponding equation is not quite clear. It is natural to think of u(t, x) as a weak solution...

In this paper we present a new diagonal balancing technique for regular matrix pencils λB − A, which aims at reducing the sensitivity of the corresponding generalized eigenvalues. It is inspired from the balancing technique of a square matrix A and has a comparable complexity. Upon convergence, the diagonally scaled pencil has row and column norms that are balanced in a precise sense. We also s...

This paper presents eecient multicasting with reduced contention on irregular networks with switch-based wormhole interconnection and unicast message passing. First, it is proved that for an arbitrary irregular network with a typical deadlock-free, adaptive routing, it may not be possible to create an ordered list of nodes to implement an arbitrary multicast in a contention-free manner with min...

Geographic routing for wireless sensor networks requires a source that can encapsulate the location of a sink in each data packet. How a source can obtain the location of a sink with low overhead is a difficult issue. This letter proposes a Quorum Based Sink Location Service (QSLS) which can be exploited by most geographic routing protocols in arbitrary irregular wireless sensor networks. key w...

With the rapid shrinking of technology and growing integration capacity, the probability of failures in Networks-on-Chip (NoCs) increases and thus, fault tolerance is essential. Moreover, the unpredictable locations of these failures may influence the regularity of the underlying topology, and a regular 2D mesh is likely to become irregular. Thus, for these failure-prone networks, a viable rout...

This paper presents efficient multicasting with reduced contention on irregular networks with switchbased wormhole interconnection and unicast message passing. First, it is proved that for an arbitrary irregular network with a typical deadlock-free, adaptive routing, it may not be possible to create an ordered list of nodes to implement an arbitrary multicast in a contention-free manner with mi...

Micrometer length tubes of graphene oxide (GO) with irregular form were synthesised following facile and green metal complexation reactions. These materials were obtained by crosslinking of GO with calcium, zinc or strontium chlorides at three different temperatures (24, 34 and 55°C) using distilled water as solvent for the compounds and following a remarkably simple and low-cost synthetic meth...

With recent advances in electronics and wireless communication technologies, the Wireless Sensor Networks (WSNs) are being used in wide range of applications of military, ecological, health related areas. Due to their resource constraints such as, sensor node’s size, memory, and processing capabilities, the scale of deployment of WSNs requires careful decisions with respect to various performan...

Abstract. The strength and stability properties of hierarchical load bearing networks and their strengthened variants have been discussed in recent work. Here, we study the avalanche time distributions on these load bearing networks. The avalanche time distributions of the V− lattice, a unique realization of the networks, show power-law behavior when tested with certain fractions of its trunk w...

We study geographical effects on the spread of diseases in lattice-embedded scalefree networks. The geographical structure is represented by the connecting probability of two nodes that is related to the Euclidean distance between them in the lattice. By studying the standard Susceptible-Infected model, we found that the geographical structure has great influences on the temporal behavior of ep...