in this paper, we solve a linear system of second-order boundary value problems by using the quadratic b-spline nite el- ement method (fem). the performance of the method is tested on one model problem. comparisons are made with both the analyti- cal solution and some recent results.the obtained numerical results show that the method is ecient.

10] Z. Shen, Boundary value problems for parabolic Lam e systems and a nonstation-ary linearized system of Navier-Stokes equations in Lipschitz cylinders, Amer. J.

Percolation theory is a subject that has been flourishing in recent decades. Because of its simple expression and rich connotation, it widely used chemistry, ecology, physics, materials science, infectious diseases, complex networks. Consider an infinite-rooted N-ary tree where each vertex assigned i.i.d. random variable. When the variable follows Bernoulli distribution, path called head run if...

in this paper the class of n-ary hypergroups is introduced and several properties are found andexamples are presented. n-ary hypergroups are a generalization of hypergroups in the sense of marty. on theother hand, we can consider n-ary hypergroups as a good generalization of n-ary groups. we define thefundamental relation β* on an n-ary hypergroup h as the smallest equivalence relation such tha...

This article investigates the problem of designing virtual di-paths (VPs) in a directed ATM model, in which the ow of information in the two directions of a link are not identical. On top of a given physical network we construct directed VPs. Routing in the physical network is done using these VPs. Given the capacity of each physical link (the maximum number of VPs that can pass through the lin...

In this paper, we solve a linear system of second-order boundary value problems by using the quadratic B-spline nite el- ement method (FEM). The performance of the method is tested on one model problem. Comparisons are made with both the analyti- cal solution and some recent results.The obtained numerical results show that the method is ecient.

Many theoretical models of parallel computation are based on overly simplistic assumptions on the performance of the interconnection network. For example they assume constant latency for any communication pattern or innnite bandwidth. This paper presents a case study based on the FFT transpose algorithm, which is mapped on two families of scalable interconnection networks, the k-ary n-trees and...

in this paper, using generalized {polya} urn models we find the expected value of the size of a branch in recursive $k$-ary trees. we also find the expectation of the number of nodes of a given outdegree in a branch of such trees.