The intersection problem for K_4-e designs

A G-design of order n is a pair (P,B) where P is the vertex set of the complete graph K-n and B is an edge-disjoint decomposition of K-n into copies of the simple graph G. Following design terminology, we call these copies ''blocks''. Here K-4 - e denotes the complete graph K-4 with one edge removed. It is well-known that a K-4 - e design of order n exists if and only if n = 0 or 1 (mod 5), n greater than or equal to 6. The intersection problem here asks for which k is it possible to find two K-4 - e designs (P,B-1) and (P,B-2) of order n, with \B-1 boolean AND B-2\ = k, that is, with precisely k common blocks. Here we completely solve this intersection problem for K-4 - e designs.

Delay in the Diagnosis of Cerebral Vein and Dural Sinus Thrombosis Influence on Outcome

Background and Purpose-Diagnostic delay of cerebral vein and dural sinus thrombosis may have an impact on outcome. Methods-In the International Study on Cerebral Vein and Dural Sinus Thrombosis (ISCVT) cohort (624 patients with cerebral vein and dural sinus thrombosis), we analyzed the predictors and the impact on outcome of diagnostic delay. Primary outcome was a modified Rankin Scale score > 2 at the end of follow-up. Secondary outcomes were modified Rankin Scale score 0 to 1 at the end of follow-up, death, and visual deficits (visual acuity or visual field). Results-Median delay was 7 days (interquartile range, 3 to 16). Patients with disturbance of consciousness (P < 0.001) and of mental status (P = 0.042), seizure (< 0.001), and with parenchymal lesions on admission CT/MR (P < 0.001) were diagnosed earlier, whereas men (P = 0.01) and those with isolated intracranial hypertension syndrome (P = 0.04) were diagnosed later. Between patients diagnosed earlier and later than the median delay, no statistically significant differences were found in the primary (P = 0.33) and in secondary outcomes: modified Rankin Scale score 0 to 1 (P = 0.86) or deaths (P = 0.53). Persistent visual deficits were more frequent in patients diagnosed later (P = 0.05). In patients with isolated intracranial hypertension syndrome, modified Rankin Scale score > 2 at the end of follow-up was more frequent in patients diagnosed later (P = 0.02). Conclusions-Diagnostic delay was considerable in this cohort and was associated with an increased risk of visual deficit. In patients with isolated intracranial hypertension syndrome, diagnostic delay was also associated with death or dependency. (Stroke. 2009; 40: 3133-3138.)

Novel inactivating mutations in the GH secretagogue receptor gene in patients with constitutional delay of growth and puberty

Background: A limited number of mutations in the GH secretagogue receptor gene (GHSR) have been described in patients with short stature. Objective: To analyze GHSR in idiopathic short stature (ISS) children including a subgroup of constitutional delay of growth and puberty (CDGP) patients. Subjects and methods: The GHSR coding region was directly sequenced in 96 independent patients with ISS, 31 of them with CDGP, in 150 adults, and in 197 children with normal stature. The pharmacological consequences of GHSR non-synonymous variations were established using in vitro cell-based assays. Results: Five different heterozygous point variations in GHSR were identified (c.-6 G>C, c.251G>T (p.Ser84Ile), c.505G>A (p.Ala169Thr), c.545 T>C (p.Val182Ala), and c.1072G>A (p.Ala358Thr)), all in patients with CDGP. Neither these allelic variants nor any other mutations were found in 694 alleles from controls. Functional studies revealed that two of these variations (p.Ser84Ile and p. Val182Ala) result in a decrease in basal activity that was in part explained by a reduction in cell surface expression. The p.Ser84Ile mutation was also associated with a defect in ghrelin potency. These mutations were identified in two female patients with CDGP (at the age of 13 years, their height SDS were -2.4 and -2.3). Both patients had normal progression of puberty and reached normal adult height (height SDS of -0.7 and -1.4) without treatment. Conclusion: This is the first report of GHSR mutations in patients with CDGP. Our data raise the intriguing possibility that abnormalities in ghrelin receptor function may influence the phenotype of individuals with CDGP.

Effects of time delay and transportation on isolation of pathogenic fungi from skin biopsies

BACKGROUND - It is not clear how culture media used during transport and the interval between the biopsy procedure and final processing can affect the successful isolation of fungi. OBJECTIVE - The aim of this study was to investigate the effects of late inoculation of skin biopsies, transported in different sterile fluids, on the isolation rate of pathogenic fungi. METHODS -A total of 278 punch biopsy specimens were collected from 47 patients with suspected lesions of invasive mycoses. Each biopsy was transported in vials with Sabouraud medium with chloramphenicol or saline solution and finally inoculated on Sabouraud agar and 2% chloramphenicol after a 48-72-hour (early) or after 72-hour-7-day (late) interval, comprising four groups of study. RESULTS - The medians of isolation rate of the four sporotrichosis groups were 100%. For paracoccidioidomycosis, the medians ranged from 50% to 84%, with no statistically significant difference among the groups (p=0.88). CONCLUSION - It was concluded that skin biopsies can be transported in Sabouraud medium or saline solution within a 7-day interval from specimen collection up to final inoculation, at room temperature, maintaining viability and growth rate of fungus in culture.

The mu-way intersection problem for m-cycle systems

An m-cycle system of order upsilon is a partition of the edge-set of a complete graph of order upsilon into m-cycles. The mu -way intersection problem for m-cycle systems involves taking mu systems, based on the same vertex set, and determining the possible number of cycles which can be common to all mu systems. General results for arbitrary m are obtained, and detailed intersection values for (mu, m) = (3, 4), (4, 5),(4, 6), (4, 7), (8, 8), (8, 9). (For the case (mu, m)= (2, m), see Billington (J. Combin. Des. 1 (1993) 435); for the case (Cc,m)=(3,3), see Milici and Quattrochi (Ars Combin. A 24 (1987) 175. (C) 2001 Elsevier Science B.V. All rights reserved.

On the intersection problem for 1-factorizations and near 1-factorizations of K-v

The number of 1-factors (near 1-factors) that mu 1-factorizations (near 1-factorizations) of the complete graph K-v, v even (v odd), can have in common, is studied. The problem is completely settled for mu = 2 and mu = 3.

The three-way intersection problem for latin squares

The set of integers k for which there exist three latin squares of order n having precisely k cells identical, with their remaining n(2) - k cells different in all three latin squares, denoted by I-3[n], is determined here for all orders n. In particular, it is shown that I-3[n] = {0,...,n(2) - 15} {n(2) - 12,n(2) - 9,n(2)} for n greater than or equal to 8. (C) 2002 Elsevier Science B.V. All rights reserved.

On continuous selection problems for multivalued mappings with the local intersection property in hyperconvex metric spaces

In the paper we present two continuous selection theorems in hyperconvex metric spaces and apply these to study xed point and coincidence point problems as well as variational inequality problems in hyperconvex metric spaces.

Solving a signalized traffic intersection problem with an hyperbolic penalty function

Mathematical Program with Complementarity Constraints (MPCC) finds many applications in fields such as engineering design, economic equilibrium and mathematical programming theory itself. A queueing system model resulting from a single signalized intersection regulated by pre-timed control in traffic network is considered. The model is formulated as an MPCC problem. A MATLAB implementation based on an hyperbolic penalty function is used to solve this practical problem, computing the total average waiting time of the vehicles in all queues and the green split allocation. The problem was codified in AMPL.

Preemption delay analysis for floating non-preemptive region scheduling

In real-time systems, there are two distinct trends for scheduling task sets on unicore systems: non-preemptive and preemptive scheduling. Non-preemptive scheduling is obviously not subject to any preemption delay but its schedulability may be quite poor, whereas fully preemptive scheduling is subject to preemption delay, but benefits from a higher flexibility in the scheduling decisions. The time-delay involved by task preemptions is a major source of pessimism in the analysis of the task Worst-Case Execution Time (WCET) in real-time systems. Preemptive scheduling policies including non-preemptive regions are a hybrid solution between non-preemptive and fully preemptive scheduling paradigms, which enables to conjugate both world's benefits. In this paper, we exploit the connection between the progression of a task in its operations, and the knowledge of the preemption delays as a function of its progression. The pessimism in the preemption delay estimation is then reduced in comparison to state of the art methods, due to the increase in information available in the analysis.

An improved preemption delay upper bound for floating non-preemptive region

In embedded systems, the timing behaviour of the control mechanisms are sometimes of critical importance for the operational safety. These high criticality systems require strict compliance with the offline predicted task execution time. The execution of a task when subject to preemption may vary significantly in comparison to its non-preemptive execution. Hence, when preemptive scheduling is required to operate the workload, preemption delay estimation is of paramount importance. In this paper a preemption delay estimation method for floating non-preemptive scheduling policies is presented. This work builds on [1], extending the model and optimising it considerably. The preemption delay function is subject to a major tightness improvement, considering the WCET analysis context. Moreover more information is provided as well in the form of an extrinsic cache misses function, which enables the method to provide a solution in situations where the non-preemptive regions sizes are small. Finally experimental results from the implementation of the proposed solutions in Heptane are provided for real benchmarks which validate the significance of this work.