Shrink-fitting, a common bonding technique in metal assemblies, was used for mortise and tenon wood joints. The joints had considerable strength. Shrink-fitting yielded joint strengths comparable to those obtained by using several welded dowels. Increasing the number of welded dowels, however, produced joints of higher strength than those bonded just by shrink-fitting. Combining in the same joi...

today, customer satisfaction as a factor of success of companies has a main importance in the marketing literature. this study has been done to identify factors affecting customer satisfaction with an emphasis on the social capital and the organizational justice. the statistical population of the study includes staff and customers of the commercial banks in tehran, qom and markazi provinces. to...

Proof. Argue by contradiction that T is not a tree, then there must exist a node v 2 T such that v has more than one parent in T . This means that there exist at least two paths R, p1, . . . , v and R, q1, . . . , v that connect the root of S(T ), which we denote by R, and v. Let t be the last node in R, p1, . . . , v and R, q1, . . . , v such that R, . . . , t are common prefix of these two pa...

The purpose of this paper is to enumerate bijectively the number of ordered pairs of certain lattice paths: Consider paths in the integer lattice Z_Z that proceed with unit steps in either of the directions east or north. Let M k r, s be the set of ordered pairs of such paths that intersect exactly k times (i.e., that have k lattice points in common) in which both paths start at the origin (0, ...

We enumerate various families of planar lattice paths consisting of unit steps in directions N, S, E, or W, which do not cross the x-axis or both x-and y-axes. The proofs are purely combinatorial throughout, using either reeections or bijections between these NSEW-paths and linear NS-paths. We also consider other dimension-changing bijections.

In this paper, we present a new algorithm for solving the multi-objective shortest path problem (MSPP) which consists of finding all the non-dominated paths between two nodes s and t (ND s-t paths), on a network where a multiple criteria function is defined over the set of arcs. The main feature of the algorithm is that, contrarily to the previous most efficient approaches for the MSPP, not all...

Merge-and-shrink abstraction is a general approach to heuristic design whose key advantage is its capability to make very fine-grained choices in defining abstractions. The Mergeand-shrink planner uses two different strategies for making these choices, both based on the well-known notion of bisimulation. The resulting heuristics are used in two sequential runs of A∗ search.

We give a construction of a uniform covering of 2-paths with 5-paths in Kn for all even n ≥ 6, i.e., we construct a set S of 5-paths in Kn having the property that each 2-path in Kn lies in exactly one 5-path in S for all even n ≥ 6.