Results 11 to 20 of about 13,311 (201)
Interactive inspection of complex multi-object industrial assemblies [PDF]
, 2016 The final publication is available at Springer via http://dx.doi.org/10.1016/j.cad.2016.06.005The use of virtual prototypes and digital models containing thousands of individual objects is commonplace in complex industrial applications like the ...
Argudo Medrano, Óscar +6 more
core +2 more sources
The Dynamics of Twisted Tent Maps [PDF]
, 2012 This paper is a study of the dynamics of a new family of maps from the complex plane to itself, which we call twisted tent maps. A twisted tent map is a complex generalization of a real tent map.
Chamblee, Stephen Joseph
core +2 more sources
Relative Stability and Local Curvature Analysis in Carbon Nanotori [PDF]
, 2015 We introduce a concise formalism to characterize nanometer-sized tori based on carbon nanotubes and to determine their stability by combining {\em ab initio} density functional calculations with a continuum elasticity theory approach that requires only ...
Chuang, Chern +5 more
core +2 more sources
Ropelength of tight polygonal knots
, 2004 A physical interpretation of the rope simulated by the SONO algorithm is presented. Properties of the tight polygonal knots delivered by the algorithm are analyzed. An algorithm for bounding the ropelength of a smooth inscribed knot is shown. Two ways of
Eric +3 more
core +2 more sources
Log-Concavity of Centered Polygonal Figurate Number Sequences
OALib, 2016 This paper investigates the log-concavity of the centered m-gonal figurate number sequences. The author proves that for m≥3, the sequence {Cn(m)}n≥1 of centered m-gonal figurate numbers is a log-concave.
openaire +1 more source
Simple Wriggling is Hard unless You Are a Fat Hippo
, 2010 We prove that it is NP-hard to decide whether two points in a polygonal domain with holes can be connected by a wire. This implies that finding any approximation to the shortest path for a long snake amidst polygonal obstacles is NP-hard. On the positive
A. Efrat +10 more
core +1 more source
Deconstructing Approximate Offsets [PDF]
, 2011 We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance \eps in Hausdorff distance, as the Minkowski sum of another polygonal shape P with a disk of fixed radius?
Berberich, Eric +3 more
core +2 more sources
, 2006 Using the method of breaking of circular symmetry and of subsequent symmetry restoration via projection techiques, we present calculations for the ground-state energies and excitation spectra of N-electron parabolic quantum dots in strong magnetic fields
A. F. Andreev +4 more
core +1 more source
Integral solutions of the heptic equation with five unknowns [PDF]
, 2015 The non-homogeneous Diophantine equation of degree seven with five variables represented by is analyzed for its non-zero distinct integer solutions. A few interesting relation between the solutions and special numbers namely Polygonal numbers, Pyramidal
Gopalan, M. A. (M) +2 more
core
FEBS Open Bio, EarlyView.Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li +8 more
wiley +1 more source