Results 31 to 40 of about 2,664 (165)
Random model trees: an effective and scalable regression method [PDF]
, 2010 We present and investigate ensembles of randomized model trees as a novel regression method. Such ensembles combine the scalability of tree-based methods with predictive performance rivaling the state of the art in numeric prediction.
Pfahringer, Bernhard
core +1 more source
Dynamic Calibration of DEM Simulations Using Rotating Drum Experiments Using the Mean Absolute Error
Chemie Ingenieur Technik, EarlyView.Calibrating DEM simulations is challenging due to unknown microscopic parameters. Rotating drum experiments are combined with image‐based analysis and Latin Hypercube Sampling (LHS). An area‐based Mean Absolute Error (MAE) enables reliable identification of optimal parameter sets.
Marius Hoffmann +2 more
wiley +1 more source
Deep Underground Science and Engineering, EarlyView.This study investigates ground subsidence during tunnel excavation in karst areas, highlighting the combined effects of karst cave proximity, cave size, and soil spatial variability. Findings suggest that shorter cave distances and larger cave sizes increase subsidence variability, and a modified Peck formula is proposed for more accurate subsidence ...
Zhenghong Su +4 more
wiley +1 more source
Entanglement and quantum combinatorial designs
, 2018 We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous classes of designs.
Di Martino, Sara +3 more
core +1 more source
Quantifying Model Selection Uncertainty in Structural Analysis: Methodology and Application
Earthquake Engineering &Structural Dynamics, EarlyView.ABSTRACT With increasing focus on complex engineering systems under rare events, computational models are critical for predictions due to the scarcity or absence of data. However, selecting an appropriate model can be challenging. Using a single model without available test calibration could result in significant bias in performance predictions. A case
Ya‐Heng Yang, Tracy C. Becker
wiley +1 more source
Balanced Decomposition of Hypercube
DEStech Transactions on Computer Science and Engineering, 2017 A balanced vertex coloring of G is a pair R, B of subsets R , B VGsuch that RB and R B . A subset U of V G is called a balanced set if U induces a connected subgraph with U R U B . A balanced decomposition of a balanced coloring R, B of G is a partition of vertices r V G V1 V2 V such that all parts V s i , are balanced sets.
openaire +2 more sources
Low‐Carbon Optimal Scheduling of Multiple Virtual Power Plants Based on Asymmetric Nash Bargaining
Energy Science &Engineering, EarlyView.ABSTRACT To effectively investigate the structural discrepancies and complementary energy characteristics among multiple virtual power plants (VPPs), and to improve the economic efficiency, low‐carbon performance, and operational reliability of the multi‐agent system, this paper proposes a low‐carbon collaborative optimal operation strategy for ...
Junjie Qiu +5 more
wiley +1 more source
Char Layer Thickness Evolution During Structural Timber Fire Experiment and Final Density Profile
Fire and Materials, EarlyView.ABSTRACT This paper evaluates several non‐destructive experimental methods for determining the char layer thickness and its density profile in structural timber samples exposed to standard ISO 834 fire curve experiments. Microwave echo pulse, ultrasonic echo pulse, X‐ray computed tomography, and resistance drilling were evaluated.
Fernando Pérez Pérez +4 more
wiley +1 more source
Signed Projective Cubes, a Homomorphism Point of View
Journal of Graph Theory, EarlyView.ABSTRACT The (signed) projective cubes, as a special class of graphs closely related to the hypercubes, are on the crossroad of geometry, algebra, discrete mathematics and linear algebra. Defined as Cayley graphs on binary groups, they represent basic linear dependencies.
Meirun Chen +2 more
wiley +1 more source
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source