نتایج جستجو برای: open packing

تعداد نتایج: 414933  

Journal: :The Annals of The Royal College of Surgeons of England 2006

2015
DongHee Park Bong-Kwang Jung Hyunjin Park Hyungbeen Lee Gyudo Lee Jingam Park Unchul Shin Jong Ho Won Yong Jun Jo Jin Woo Chang Sangwoo Lee Daesung Yoon Jongbum Seo Chul-Woo Kim

Supercoiling DNA (folding DNA into a more compact molecule) from open circular forms requires significant bending energy. The double helix is coiled into a higher order helix form; thus it occupies a smaller footprint. Compact packing of DNA is essential to improve the efficiency of gene delivery, which has broad implications in biology and pharmaceutical research. Here we show that low-intensi...

Journal: :Advances in Mathematics 2023

A Sierpi\'nski packing in the $2$-sphere is a countable collection of disjoint, non-separating continua with diameters shrinking to zero. We show that any by whose are square-summable can be uniformized disk packing-conformal map, notion generalizes conformality open sets. Being special cases packings, carpets and some domains packings as well. As corollary main result, conformal loop ensemble ...

2015
DongHee Park Bong-Kwang Jung Hyunjin Park Hyungbeen Lee Gyudo Lee Jingam Park Unchul Shin Jong Ho Won Yong Jun Jo Jin Woo Chang Sangwoo Lee Daesung Yoon Jongbum Seo Chul-Woo Kim

This work is licensed under a Creative Commons Attribution 4.0 International License. The images or other third party material in this article are included in the article's Creative Commons license, unless indicated otherwise in the credit line; if the material is not included under the Creative Commons license, users will need to obtain permission from the license holder to reproduce the mater...

2008
Helmut Simonis Barry O'Sullivan

Rectangle (square) packing problems involve packing all squares with sizes 1 × 1 to n × n into the minimum area enclosing rectangle (respectively, square). Rectangle packing is a variant of an important problem in a variety of real-world settings. For example, in electronic design automation, the packing of blocks into a circuit layout is essentially a rectangle packing problem. Rectangle packi...

2013
Andrea Burgess Karen Meagher Bruce Reed

In 2009, Peter Cameron introduced a common generalization of various classes of combinatorial designs such as balanced incomplete block designs, resolvable designs and orthogonal arrays. Generalized covering and packing designs can be defined in analogous way. These objects bring into this framework further classes of designs, including covering and packing arrays, Howell designs, monogamous cy...

2014
O. Buse

The packing stability in symplectic geometry was first noticed by Biran [Bir97]: the symplectic obstructions to embed several balls into a manifold disappear when their size is small enough. This phenomenon is known to hold for all closed manifolds with rational symplectic class (see [Bir99] for the 4-dimensional case, and [BH11, BH13] for higher dimensions), as well as ellipsoids [BH13]. In th...

Many systems can be modeled with hard and various size spheres, therefore packing and geometrical structures of such sets are of great importance. In this paper, rigid spherical particles distributed in different sizes are randomly packed in confined spaces, using a parallel algorithm. Mersenne Twister algorithm was used to generate pseudorandom numbers for initial coordination of particles. Di...

Asgharpour , M.J. , Hatefi , M.A.,

 Abstract: Packing rectangular shapes into a rectangular space is one of the most important discussions on Cutting & Packing problems (C;P) such as: cutting problem, bin-packing problem and distributor's pallet loading problem, etc. Assume a set of rectangular pieces with specific lengths, widths and utility values. Also assume a rectangular packing space with specific width and length. The obj...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید