Results 41 to 50 of about 1,330,345 (344)
A \emph(k,t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between each pair of colour classes no two monochromatic edges cross. This structure has recently arisen in the study of three-dimensional graph drawings. This paper presents the
Dujmović, Vida+2 more
openaire +6 more sources
Mechanisms of De‐icing by Surface Rayleigh and Plate Lamb Acoustic Waves
Ice accretion impacts daily life, renewable energy generation, maintenance, and security in industries and aeronautics. Acoustic waves (AW) are a promising method for ice removal, although de‐icing mechanisms require further investigation to optimize energy efficiency.
Shilpi Pandey+15 more
wiley +1 more source
Radical Cystectomy with Ileal Neobladder in a patient with Hemophilia! A case report
A 38 year old hepatitis C and Hemophilia Type A patient presented with recurrent hematuria since 6 months. Investigations revealed a 5 cm lesion in the lateral wall of the bladder with perivesical fat stranding.
Karthik Rao+4 more
doaj
AbstractWe propose a new graph layout method based on a modification of the t‐distributed Stochastic Neighbor Embedding (t‐SNE) dimensionality reduction technique. Although t‐SNE is one of the best techniques for visualizing high‐dimensional data as 2D scatterplots, t‐SNE has not been used in the context of classical graph layout.
Stephen G. Kobourov+7 more
openaire +4 more sources
In this study, the mechanical response of Y‐shaped core sandwich beams under compressive loading is investigated, using deep feed‐forward neural networks (DFNNs) for predictive modeling. The DFNN model accurately captures stress–strain behavior, influenced by design parameters and loading rates.
Ali Khalvandi+4 more
wiley +1 more source
Vertex-Unfoldings of Simplicial Polyhedra [PDF]
We present two algorithms for unfolding the surface of any polyhedron, all of whose faces are triangles, to a nonoverlapping, connected planar layout. The surface is cut only along polyhedron edges. The layout is connected, but it may have a disconnected
Demaine, Erik D.+4 more
core +5 more sources
Facility Layout Problems (FLP) are concerned with finding efficient factory layouts. Numerous resolution approaches are known in literature for layout optimization.
Peter Burggraf+2 more
doaj +1 more source
Circular layout in the Graph Layout toolkit [PDF]
The Graph Layout Toolkit is a family of portable, automated, graph layout libraries designed for integration into graphical user interface application programs. The Circular Library is one of the four styles currently available with the Graph Layout Toolkit. It produces layouts that emphasize natural group structures inherent in a graph's topology, and
Ugur Dogrusoz+2 more
openaire +2 more sources
Unlocking structural efficiency, this work integrates homogenization‐based topology optimization with functionally graded triply periodic minimal surface lattices to create highly efficient, customizable lattice structures. Key achievements include the development of a versatile MATLAB framework, optimization of mechanical properties for additive ...
Mirhan Ozdemir+4 more
wiley +1 more source
SLAM : an automated structure to layout synthesis system [PDF]
SLAM is a structure to layout synthesis system. It incorporates parameterisable bit-sliced and glue-logic generators to produce high density layout. In this paper, we describe a sliced layout architecture and SLAM system.
Gajski, Daniel, Wu, Allen C.H.
core