Results 1 to 10 of about 3,314,720 (268)
Determination of the Equivalent Thickness of a Taiko Wafer Using ANSYS Finite Element Analysis
The successful handling of large semiconductor wafers is crucial for scaling up their production. Early-stage warpage control allows the prevention of undesirable asymmetric warpage, known as wafer bifurcation or buckling.
Vincenzo Vinciguerra +3 more
doaj +1 more source
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet [PDF]
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and height over the two-letter alphabet $\{0,1\}$.
Nicolas Bédaride +3 more
doaj +1 more source
Time-stage driven pathfinding framework for optimized medical treatments
Coming up with the correct patient-specific treatment procedure is a non-trivial task. One of the main challenges is that the problem is combinatorial, and each treatment can be followed by numerous treatments.
Karen Gishyan +2 more
doaj +1 more source
$L^p$-$L^q$ Boundedness of Spectral Multipliers of the Anharmonic Oscillator
In this note we study the $L^p-L^q$ boundedness of Fourier multipliers of anharmonic oscillators, and as a consequence also of spectral multipliers, for the range ...
Chatzakou, Marianna, Kumar, Vishvesh
doaj +1 more source
Decomposing 10-Regular Graphs into Paths of Length 5
Let G be a 10-regular graph which does not contain any 4-cycles. In this paper, we prove that G can be decomposed into paths of length 5, such that every vertex is a terminal of exactly two paths.
Xie Mengmeng, Zhou Chuixiang
doaj +1 more source
The Fuzzy Discrete Mycorrhiza Optimization (FDMOA) Algorithm is a new hybrid optimization method using the Discrete Mycorrhiza Optimization Algorithm (DMOA) in combination with type-1 or interval type-2 fuzzy logic system.
Hector Carreon-Ortiz +2 more
doaj +1 more source
In addition to wirelength and area, modern floorplans need to consider various constraints such as fixed-outline. To handle the fixed-outline floorplanning optimization problem efficiently, we propose an improved simulated annealing (SA) algorithm, which
Zhipeng Huang +3 more
doaj +1 more source
The extremal graphs with respect to their nullity
The nullity of a graph G, denoted by η ( G ) $\eta(G)$ , is the multiplicity of the eigenvalue zero of its adjacency matrix. In this paper, we determine all graphs with η ( G ) = n ( G ) − 2 m ( G ) − c ( G ) $\eta(G)=n(G) - 2m(G) -c(G)$ , where c ( G ) =
Sa Rula, An Chang, Yirong Zheng
doaj +1 more source
Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
Let G be a simple connected graph and S 2 ( G ) $S_{2}(G)$ be the sum of the two largest Laplacian eigenvalues of G. In this paper, we determine the bicyclic graph with maximum S 2 ( G ) $S_{2}(G)$ among all bicyclic graphs of order n, which confirms the
Yirong Zheng +3 more
doaj +1 more source
Complex Line Bundles over Simplicial Complexes and their Applications [PDF]
Discrete vector bundles are important in Physics and recently found remarkable applications in Computer Graphics. This article approaches discrete bundles from the viewpoint of Discrete Differential Geometry, including a complete classification of ...
C Kreft +8 more
core +3 more sources

