Results 1 to 10 of about 20,162 (144)
Block algorithms to solve Zheng/Chen/Zhang's finite-difference equations
Компьютерная оптика, 2021 This paper is devoted to the design of multiblock algorithms of the FDTD-method intended for computations based on a Zheng-Chen-Zhang implicit finite-difference scheme.
D.L. Golovashkin +2 more
doaj +1 more source
Historical and comparative assessment of artistic and technical features of wooden doors of Khurasan Museum [PDF]
نگره, 2018 Among the wooden works of the Holy Shrine’s collection there have been doors That are transferred to the store of Cultural Heritage and Tourism Organization of Khorasan in the tomb of Ferdowsi with the implementation of the expansion of the shrine in the
alireza sheikhi +2 more
doaj +1 more source
The Mathematical Intelligencer, 2010 21 pages, 50 figures. Based on a Clay Public Lecture by the second author at the IAS/Park City Mathematics Institute in July, 2004.
Ardila, Federico, Stanley, Richard P.
openaire +4 more sources
Cell Reports, 2016 Simple cell-cell interactions can give rise to complex cellular patterns. For example, neurons of the same type can interact to create a complex patchwork of non-overlapping dendrite arbors, a pattern known as dendrite tiling.
Zhiqi Candice Yip, Maxwell G. Heiman
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2010 We contribute to combinatorics and algorithmics of words by introducing new types of periodicities in words. A tiling period of a word w is partial word u such that w can be decomposed into several disjoint parallel copies of u, e.g.
Juhani Karhumaki +2 more
doaj +1 more source
Research about the number of D-points of -tiling in given ellipse
Journal of Hebei University of Science and Technology, 2017 An Archimedean tiling is a tiling of the plane by one type of regular polygon or several types of regular polygons, and every vertex of the tiling has the same vertex characteristics.
Xianglin WEI, Weiqi WANG
doaj +1 more source
Hard Tiling Problems with Simple Tiles [PDF]
Discrete & Computational Geometry, 2001 It is well-known that the question of whether a given finite region can be tiled with a given set of tiles is NP-complete. We show that the same is true for the right tromino and square tetromino on the square lattice, or for the right tromino alone. In the process, we show that Monotone 1-in-3 Satisfiability is NP-complete for planar cubic graphs.
Moore, C., Robson, J. M.
openaire +2 more sources
Applied Sciences, 2018 In this study, we aim to optimize and improve the efficiency of a Tetris-inspired reconfigurable cleaning robot. Multi-criteria decision making (MCDM) is utilized as a powerful tool to target this aim by introducing the best solution among others in ...
Maryam Kouzehgar +4 more
doaj +1 more source
Applied Sciences, 2018 Whilst Polyomino tiling theory has been extensively studied as a branch of research in mathematics, its application has been largely confined to multimedia, graphics and gaming domains.
Veerajagadheswar Prabakaran +4 more
doaj +1 more source
Tiling a Pyramidal Polycube with Dominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 The notion of pyramidal polycubes, namely the piling-up of bricks of a non-increasing size, generalizes in R^n the concept of trapezoidal polyominoes. In the present paper, we prove that n-dimensional dominoes can tile a pyramidal polycube if and only if
Olivier Bodini, Damien Jamet
doaj +1 more source