Results 121 to 130 of about 15,285 (303)
Reasoning on transition from manipulative strategies to general procedures in solving counting problems [PDF]
, 2010 We describe the procedures used by 11- to 12-year-old students for solving basic counting problems in order to analyse the transition from manipulative strategies involving direct counting to the use of the multiplication principle as a general procedure
Figueiras, Lourdes, Cañadas, María C.
core
Using Allowable Sequences to Solve Problems in Combinatorial Graph Theory [PDF]
, 2020 An allowable sequence is an object used to encode combinatorial information about a configuration of points. The application of allowable sequences has proved useful in solving classical problems in combinatorial graph theory, such as Sylvester's Theorem
Dandurand, Julia
core +1 more source
Optimization of the Production of Rubber Compounds Using Mathematical Models
Advanced Engineering Materials, EarlyView.Rubber compounds were mixed in a batch internal mixer, and symbolic regression was used to derive mathematical models linking recipe and process parameters to ram path, torque, and mixing quality (incorporation, dispersion, distribution). Subsequent optimization with evolutionary algorithms identified operating conditions that reduce specific energy ...
Anke Bardehle +7 more
wiley +1 more source
Combinatorial and analytical problems for fractals and their graph approximations [PDF]
, 2019 The recent field of analysis on fractals has been studied under a probabilistic and analytic point of view. In this present work, we will focus on the analytic part developed by Kigami.
Tsougkas, Konstantinos
core
Advanced Engineering Materials, EarlyView.A novel workflow for investigating hydride vapor phase epitaxy for GaN bulk crystal growth is proposed. It combines Design of experiments (DoE) with physical simulations of mass transport and crystal growth kinetics, serving as an intermediate step between DoE and experiments.
J. Tomkovič +7 more
wiley +1 more source
Magic labeling on graphs with ascending subgraph decomposition
Electronic Journal of Graph Theory and ApplicationsLet t and q be positive integers that satisfy C(t + 1,2) ≤ q < C(t + 2,2) and let G be a simple and finite graph of size q. G is said to have ascending subgraph decomposition (ASD) if G can be decomposed into t subgraphs H1,H2,…,Ht without isolated ...
Sigit Pancahayani +2 more
doaj +1 more source
Mathematical Models of Computational and Combinatorial Structures [PDF]
, 2005 The general aim of this talk is to advocate a combinatorial perspective, together with its methods, in the investigation and study of models of computation structures. This, of course, should be taken in conjunction with the well-established views and methods stemming from algebra, category theory, domain theory, logic, type theory, etc.
openaire +1 more source
Advanced Engineering Materials, EarlyView.This review highlights advances in lightweight, lead‐free polymer nanocomposites for diagnostic X‐ray shielding. By linking filler chemistry, dispersion, architecture, and photon interaction mechanisms, it establishes structure–performance relationships guiding material design.
Aklilu G. Messele +2 more
wiley +1 more source
Combinatorics of the Triangle Inequality: From Straws to Experimental Mathematics for Teachers
Spreadsheets in Education, 2016 This article demonstrates the importance of skills in asking questions and the value of spreadsheets in seeking answers in the spirit of experimental mathematics.
Sergei Abramovich
doaj
Influence of Geometric Design on Mechanical Performance of Auxetic Metastructure
Advanced Engineering Materials, EarlyView.Strategic geometric reinforcement transforms auxetic performance. This study evaluates 3D‐printed arrowhead metastructures, revealing that a modified design with local ring reinforcement suppresses premature failure to achieve superior energy absorption and structural efficiency.
Muhammad Gulzari +3 more
wiley +1 more source