Let X and Y be uncountable Polish spaces. A ⊂ X×Y represents a family of sets C provided each set in C occurs as an x-section of A. We say A uniquely represents C provided each set in C occurs exactly once as an xsection of A. A is universal for C if A represents C and every x-section of A is in C. A is uniquely universal for C if it is universal and uniquely represents C. We show that there is...

Di Crescenzo and Longobardi (2002) has been proposed a measure of uncertainty related to past life namely past entropy. The present paper addresses the question of extending this concept to bivariate set-up and study some properties of the proposed measure. It is shown that the proposed measure uniquely determines the distribution function. Characterizations for some bivariate lifetime models a...

Given a graph G, an edge-coloring or G with colors 1,2.3.. is consecutive if the colors of edges incident to each vertex fomm an interval of integer-s. This papelis devoted to bipartite graphs which do not have such a coloring of edges. We investigate their consecutive coloring deficiency, or shortly the deficiency d(G) of G, i.e. the minimum number of pendant edges whose attachment to G makes ...

According to Bradbury and Mather (2009), in the 2003-2004 academic school year 45% of new students enrolling in four-year institutions were first-generation students. When compared to continuing-generation college students, first-generation students have been shown to find the college going experience to be more stressful (Phinney & Haas, 2003). Despite the knowledge that these students find th...

Warning sounds are necessary to promptly alert workers of events that can compromise safety. A wide range of strategies, including verbal and non-verbal signals have been used in different environments (Edworthy & Adams 1996; Haas & Edworthy 2006; Edworthy & Hellier 2006). Unfortunately, the use of warning signals in industry is often submitted to intuitive installation practices with little re...

Motivated by a new point of view to study occurrences of consecutive patterns in permutations, we introduce the notion of uniquely k-determined permutations. We give two criteria for a permutation to be uniquely k-determined: one in terms of the distance between two consecutive elements in a permutation, and the other one in terms of directed hamiltonian paths in the certain graphs called path-...