Z. W. Pylyshyn and R. W. Storm (1988) have shown that human observers can accurately track four to five items at a time. However, when a threshold paradigm is used, observers are unable to track more than a single trajectory accurately (S. P. Tripathy & B. T. Barrett, 2004). This difference between the two studies is examined systematically using substantially suprathreshold stimuli. The stimul...

today, market orientation plays a vital role in determining customers’ needs and success of organizations. market orientation has also influenced various organizations’ measures including innovation. therefore the aim of this research is to study the role of market orientation in innovation of bodybuilding clubs of golestan province. the population of this study comprised all 170 managers of bo...

This study sought to examine the structural relationships of parentschr('39') level of education and their goal orientation with motivation, self-concept and academic self-efficacy of adolescent female students. A number of 601 female 10th graders responded to the research instruments, including the Students Perception of Parents Goal Orientation Questionnaire (Hruda & Midgley, 1997), Motivated...

this study extends prior researches by exploring the effect of organizational orientations on export performance. building on the already extensive literature, we developed a model of relationship. a total of 120 usable questionnaires were received from the iranian food industry smes. the results indicated that entrepreneurial orientation, market orientation and learning orientation positively ...

Let G be a graph with n nodes, e edges, chromatic number and girth g. In an acyclic orientation of G, an arc is dependent if its reversal creates a cycle. It is well known that if < g, then G has an acyclic orientation without dependent arcs. Edelman showed that if G is connected, then every acyclic orientation has at most e ? n + 1 dependent arcs. We show that if G is connected and < g, then G...

For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) the diameter of D. The orientation number −→ d (G) of G is defined by −→ d (G) = min{d(D)|D ∈ D(G)}. Let G(p, q;m) denote the family of simple graphs obtained from the disjoint union of two complete graphs K p and Kq by adding m edges linking them in an arbi...

For a connected graph G containing no bridges, let D(G) be the family of strong orientations of G; and for any D ∈ D(G), we denote by d(D) the diameter of D. The orientation number d (G) of G is defined by → d (G)=min{d(D) |D ∈ D(G)}. In this paper, we study the orientation numbers of a family of graphs, denoted by G(p, q;m), that are obtained from the disjoint union of two complete graphs Kp a...