the aim of the present study was to examine the casual relationship of parental bonding with bullying in schools, mediated bypersonality characteristics and student-teacher relationship quality. 200 second-grade male high-school students in ahvaz were selected using multi-stage random sampling method. the data were collected by the parental bonding instrument (pbi), neo-personality inventory-re...

For a set S of n points in convex position in the plane, let P(S) denote the set of all plane spanning paths on S. The geometric path graph Gn of S is the graph with P(S) as its vertex set and two vertices P,Q ∈ P(S) are adjacent if one of the corresponding paths can be obtained from the other by means of a single edge replacement. Recently, Akl et al. [On planar path transformation, Inform. Pr...

Endeavoring to push the boundaries of microfabrication with shrinkable polymers, we have developed a sequential shrink photolithography process. We demonstrate the utility of this approach by rapidly fabricating plastic microlens arrays. First, we create a mask out of the children's toy Shrinky Dinks by simply printing dots using a standard desktop printer. Upon retraction of this pre-stressed ...

Merge-and-shrink (M&S) is a framework to generate abstraction heuristics for cost-optimal planning. A recent approach computes simulation relations on a set of M&S abstractions in order to identify states that are better than others. This relation is then used for pruning states in the search when a “better” state is already known. We propose the usage of simulation relations inside the M&S fra...

We construct a uniform covering of 2-paths by 4-paths in Kn for all n 2:: 5, i.e., we construct a set S of 4-paths in Kn having the property that each 2-path in Kn lies in exactly one 4-path in S for all 11, 2:: 5.

S. Zhang, D. H. Laidlaw Computer Science Department, Brown University, Providence, RI, United States Introduction – We report on unsupervised clustering of tractography paths and automated matching of the resulting clusters across two brains. DTI tractography methods generate paths that correlate well with large WM structures. However, it is not clear how reliably they can identify anatomical t...

Research on heuristic functions is all about estimating the length (or cost) of solution paths. But what if there is no such path? Many known heuristics have the ability to detect (some) unsolvable states, but that ability has always been treated as a by-product. No attempt has been made to design heuristics specifically for that purpose, where there is no need to preserve distances. As a case ...

Let G = (N, E) be a supply graph, with the node set N and edge set E, and (T, S) be a demand graph, with T ⊆ N , S ∩ E = ∅. Observe paths whose end-vertices form pairs in S (called S-paths). The following path packing problem for graphs is fundamental: what is the maximal number of S-paths in G? In this paper this problem is studied under two assumptions: (a) the node degrees in N \ T are even,...

In this paper, the effect of angle between predictor and corrector surfaces on the structural analysis is investigated. Two objective functions are formulated based on this angle and also the load factor. Optimizing these functions, and using the structural equilibrium path’s geometry, lead to two new constraints for the nonlinear solver. Besides, one more formula is achieved, which was p...

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 ...