JALDA, therefore, would like to show inclination towards the view that the reality of the world is not a fixed entity standing out there to be measured by our pre-fabricated ‘scientific’ instruments. In line with Haghshenas’ argumentation, not only can theories and instruments shrink to ornamental entities but also they can turn into what Karl Popper calls pseudo-science, knowledge of an ‘ideol...

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

Ubiquitous access to sophisticated internet services from diverse end devices across heterogeneous networks requires the injection of additional functionality into the network to handle protocol conversion, data transcoding, and in general bridge disparate network portions. Several researchers have proposed infrastructures for injecting such functionality; however, many challenges remain before...

Bond paths and the bond critical point properties (the electron density (rho) and the Hessian of rho at the bond critical points (bcp's)) have been calculated for the bonded interactions comprising the nickel sulfide minerals millerite, NiS, vaesite, NiS(2), and heazlewoodite, Ni(3)S(2), and Ni metal. The experimental Ni-S bond lengths decrease linearly as the magnitudes of the properties each ...

As device dimensions shrink to deep sub-micron ranges, the hot-carrier effect is a main concern for the long-term reliability. It is known that the delay degradation (induced by the hot-carrier effect) of a logic gate is linearly proportional to the number of output switching activities. Due to the clock gating design, the clock gates often have different active probabilities, which lead to dif...

Given an undirected graph G and four distinct special vertices s 1 ; s 2 ; t 1 ; t 2 , the Two Disjoint Paths Problem consists in determining whether there are two disjoint paths connecting s 1 to t 1 and s 2 to t 2 , respectively. There is an analogous version of the problem for acyclic directed graphs, in which it is required that the two paths be directed, as well. The known characterization...

Graphs are models of communication networks. This paper applies combinatorial and symbolic-analytic techniques in order to characterize the interplay between two parameters of a random graph: its density (the number of edges in the graph) and its robustness to link failures, where robustness here means multiple connectivity by short disjoint paths. A triple (G, s, t), where G is a graph and s, ...

Graphs are models of communication networks. This paper applies symbolic combinatorial techniques in order to characterize the interplay between two parameters of a random graph, namely its density (the number of edges in the graph) and its robustness to link failures. Here, robustness means multiple connectivity by short disjoint paths: a triple (G; s; t), where G is a graph and s; t are desig...

Let P = {P1, . . . , Pl} be a set of internally disjoint paths contained in a graph G and let S be the subgraph defined by ⋃t i=1 Pi. A P-bridge is either an edge of G − E(S) with both endpoints in V (S) or a component C of G − V (S) along with all the edges from V (C) to V (S). The attachments of a bridge B are the vertices of V (B) ∩ V (S). A bridge B is k-stable if there does not exist a sub...