The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m 0, one can transform G into a new graph m(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open pac...

This article shows the different stages used for design and production of a MOOC biodegradable packing, planning tools methodologies development themes contents. Likewise, is shown technological framework making surveillance technology to identify which stage e-learning tech search terms related packing potential topics. Finally, software architecture SELENE explained how deployed in open edX p...

Post-sternotomy mediastinitis is a rare but serious complication of cardiac surgery leading to prolonged hospital stay and higher mortality. In the last decades several treatment modalities have been described, of which vacuum-assisted closure (VAC) shows the most promising results. The aim of this study is to describe clinical outcomes of VAC as compared to open packing and to predict risk fac...

Finding the optimal random packing of non-spherical particles is an open problem with great significance in a broad range of scientific and engineering fields. So far, this search has been performed only empirically on a case-by-case basis, in particular, for shapes like dimers, spherocylinders and ellipsoids of revolution. Here we present a mean-field formalism to estimate the packing density ...

The purpose of this review was to evaluate mortality rates of open abdomen patients with severe peritonitis who received negative pressure therapy (NPT) versus open packing techniques as a method of temporary abdominal closure (TAC). Authors retrospectively reviewed consecutive records from five different surgical departments of patients who received NPT (V.A.C. technology) and open packing (OP...

In this paper we present a model for the study of the total balancedness of packing and covering games, concerning some aspects of graph theory. We give an alternative proof of van Velzen’s characterization of totally balanced covering games. We introduce new types of graph perfection, which allows us to give another approach to the open problem of characterizing totally balanced packing games.

This paper summarizes recent results about the Hausdorff measure of the image, graph and level sets of Gaussian random fields, the packing dimension and packing measure of the image of fractional Brownian motion, the local times and multiple points of Gaussian random fields. Some open problems are also pointed out.

We prove a tight lower bound on the asymptotic performance ratio ρ of the bounded space online d-hypercube bin packing problem, solving an open question raised in 2005. In the classic d-hypercube bin packing problem, we are given a sequence of d-dimensional hypercubes and we have an unlimited number of bins, each of which is a d-dimensional unit hypercube. The goal is to pack (orthogonally) the...