The spatial pattern of accumulation rate can be inferred from internal layers in glaciers and ice sheets. Non-dimensional analysis determines where finite strain can be neglected (‘shallow-layer approximation’) or approximated with a local one-dimensional flow model (‘local-layer approximation’), and where gradients in strain rate along particle paths must be included (‘deep layers’). We develo...

Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer link weights that routing protocols like OSPF use to do distributed forwarding of packets. The resulting optimization problem by the operator—to find the best link weights for a given topology and traffic matrix—is well-known ...

In the Edge-Disjoint Paths with Congestion problem (EDPwC), we are given an undirected n-vertex graph G, a collection M = {(s1, t1), . . . , (sk, tk)} of demand pairs and an integer c. The goal is to connect the maximum possible number of the demand pairs by paths, so that the maximum edge congestion the number of paths sharing any edge is bounded by c. When the maximum allowed congestion is c ...

Determining worst case execution time of a program by static analysis is important for the design of real-time software. WCET analysis at the programming language level requires the detection of the longest path in the program. A tighter bound on the WCET of a program can be achieved by identifying the infeasible paths in the program’s control flow, which is a difficult problem. Due to the bran...

let  $r$ be a commutative noetherian ring and $i$ be an ideal of $r$. we say that $i$ satisfies the persistence property if  $mathrm{ass}_r(r/i^k)subseteq mathrm{ass}_r(r/i^{k+1})$ for all positive integers $kgeq 1$, which $mathrm{ass}_r(r/i)$ denotes the set of associated prime ideals of $i$. in this paper, we introduce a class of square-free monomial ideals in the polynomial ring  $r=k[x_1,ld...

the colorful paths and rainbow paths have been considered by severalauthors.a colorful directed path in a digraph $g$ is a directed path with $chi(g)$ vertices whose colors are different. a $v$-colorful directed path is such a directed path, starting from $v$. we prove that for a given $3$-regular triangle-free digraph $g$ determining whether there is a proper $chi(g)$-coloring of $g$such that ...

A framework for topology optimization of repairable flow networks and reliability networks is presented. The optimization consists of determining the optimal network topology with a maximum transmitted flow achieved within a specified budget for building the network. A method for a topology optimization of reliability networks of safety-critical systems has also been developed. The proposed met...

Data-flow analyses that include some model of the data-flow between MPI sends and receives result in improved precision in the analysis results. One issue that arises with performing data-flow analyses on MPI programs is that the interprocedural control-flow graph ICFG is often irreducible due to call and return edges, and the MPI-ICFG adds further irreducibility due to communication edges. To ...