Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
62,457
result(s) for
"full"
Sort by:
Application of a minimally invasive full‐thickness autologous microcolumn skin harvesting device for donor site tissue collection and augmenting wound healing in a porcine wound model
Using a 6‐week porcine full‐thickness excisional wound grafting model, we evaluated the Autologous Regeneration of Tissue (ART®) System, a novel skin harvesting device designed to collect autologous full‐thickness autologous microcolumns (FTAM) at 0.5 mm in diameter. The donor skin sites were harvested using the ART® System and compared to split‐thickness skin grafts (STSGs). Recipient sites were divided into three treatment groups: FTAM, STSG and Untreated control. Comparing the FTAM donor sites to the STSG donor sites, we observed significantly faster re‐epithelization by Day 4 (p < 0.05), earlier adnexal structures and rete ridge formation by Week 3, and increased collagen and elastin content by Week 6. We also observed an increased rate of healing at the FTAM donor site whilst limiting donor site morbidity compared to traditional STSG donor sites. Time to recipient site closure was 2.4 weeks for STSG treated, 3.3 weeks for FTAM treated and 4.1 weeks for the Untreated control (p < 0.05). The STSG and FTAM recipient sites reached complete re‐epithelialization by Weeks 4 and 5, respectively which was significantly faster compared to the Untreated control. However, the FTAM recipient site received only 10% of the donor site tissue relative to the recipient site area and the amount of donor site tissue grafted on the STSG recipient sites was 5× more than the FTAM recipient sites. Additionally, the FTAMs harvested by the ART® System augmented recipient wound site healing as a result of ‘epithelial island’ expansion in contrast to Untreated control sites that closed primarily by contracture.
Journal Article
Silk stockings and socialism : Philadelphia's radical hosiery workers from the Jazz Age to the New Deal
\"In an effort to get their rightful due as producers, the young women and men who worked in the hosiery mills of Kensington, the working class heart of Philadelphia, organized the American Federation of Full-Fashioned Hosiery Workers (AFFFHW), a movement that swept Philadelphia and eventually had a significant impact on the creation of the Congress of Industrial Organizations, the New Deal, and labor feminism. In the first history of this remarkable union, Sharon McConnell-Sidorick tells the story of how radical socialist unionists explicitly tapped into Jazz Age culture to build a militant youth movement whose young men and women continued dancing, partying, and flouting Prohibition while at the same time attending labor education sessions and engaging in battles with police\"-- Provided by publisher.
Book
A \\nicefrac 43 43-approximation for the maximum leaf spanning arborescence problem in DAGs
The Maximum Leaf Spanning Arborescence problem (MLSA) in directed acyclic graphs (dags) is defined as follows: Given a directed acyclic graph G and a vertex r∈ V(G) r∈V(G) from which every other vertex is reachable, find a spanning arborescence rooted at r maximizing the number of leaves (vertices with out-degree zero). The MLSA in dags is known to be APX-hard as reported by Nadine Schwartges, Spoerhase, and Wolff (Approximation and Online Algorithms, Springer, Berlin Heidelberg, 2012) and the best known approximation guarantee of (7/5) 75 is due to Fernandes and Lintzmayer (J. Comput. Syst. Sci. 135: 158–174,2023): They prove that any α α-approximation for the hereditary 3-set packing problem, a special case of weighted 3-set packing, yields a \\max {(4/3),α } max43,α-approximation for the MLSA in dags, and provide a (7/5) 75-approximation for the hereditary 3-set packing problem. In this paper, we improve upon this result by providing a (4/3) 43-approximation for the hereditary 3-set packing problem, and, thus, the MLSA in dags. The algorithm that we study is a simple local search procedure considering swaps of size up to 10 and can be analyzed via a two-stage charging argument. We further provide a clear picture of the general connection between the MLSA in dags and set packing by rephrasing the MLSA in dags as a hereditary set packing problem. With a much simpler proof, we extend the reduction by Fernandes and Lintzmayer and show that an α α-approximation for the hereditary k-set packing problem implies a \\max {((k+1)/k),α } maxk+1k,α-approximation for the MLSA dags. On the other hand, we provide lower bound examples proving that our approximation guarantee of (4/3) 43 is best possible for local search algorithms with constant improvement size.
Journal Article
Advances on strictly Δ Δ-modular IPs
There has been significant work recently on integer programs (IPs) \\min {c^(⊤) x :Ax≤ b, x∈ ℤⁿ} minc⊤x:Ax≤b,x∈Zn with a constraint marix A with bounded subdeterminants. This is motivated by a well-known conjecture claiming that, for any constant Δ ∈ ℤ_(>0) Δ∈Z>0, Δ Δ-modular IPs are efficiently solvable, which are IPs where the constraint matrix A∈ ℤ^(m× n) A∈Zm×n has full column rank and all n× n n×n minors of A are within {-Δ , … , Δ } -Δ,⋯,Δ. Previous progress on this question, in particular for Δ =2 Δ=2, relies on algorithms that solve an important special case, namely strictly Δ Δ-modular IPs, which further restrict the n× n n×n minors of A to be within {-Δ , 0, Δ } -Δ,0,Δ. Even for Δ =2 Δ=2, such problems include well-known combinatorial optimization problems like the minimum odd/even cut problem. The conjecture remains open even for strictly Δ Δ-modular IPs. Prior advances were restricted to prime Δ Δ, which allows for employing strong number-theoretic results. In this work, we make first progress beyond the prime case by presenting techniques not relying on such strong number-theoretic prime results. In particular, our approach implies that there is a randomized algorithm to check feasibility of strictly Δ Δ-modular IPs in strongly polynomial time if Δ ≤ 4 Δ≤4.
Journal Article