Results 31 to 40 of about 372,561 (297)

Ontology of Discrete Mathematics in Education

open access: yesComputer Tools in Education, 2021
Currently, ontologies are widely used in computer science for the formalized representati- on of knowledge about various subject areas. Special formal languages for describing ontologies have been developed and are successfully used, which allow ...
I. Molotkov, Fyodor Novikov
semanticscholar   +1 more source

Post-surjectivity and balancedness of cellular automata over groups [PDF]

open access: yes, 2017
We discuss cellular automata over arbitrary finitely generated groups. We call a cellular automaton post-surjective if for any pair of asymptotic configurations, every pre-image of one is asymptotic to a pre-image of the other.
Capobianco, Silvio   +2 more
core   +1 more source

Research on the Construction of Blended Teaching Mode Based on Flipped Class—Taking the Undergraduate Discrete Mathematics Course as an Example

open access: yes, 2021
In the traditional teaching mode, students passively receive knowledge, which does not fully stimulate their enthusiasm and innovation. With the development of the Internet, blended teaching mode comes into being and has become one of the main ways of ...
Yongxia Zhang, Wei Liu
semanticscholar   +1 more source

On the residual solvability of generalized free products of solvable groups

open access: yes, 2011
In this paper, we study the residual solvability of the generalized free product of solvable groups.Comment: Discrete Mathematics & Theoretical Computer Science, Vol 13 ...
Kahrobaei, Delaram, Majewicz, Stephen
core   +2 more sources

Encoding Arguments

open access: yes, 2017
Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability.
Morin, Pat   +2 more
core   +1 more source

$2\times 2$ monotone grid classes are finitely based

open access: yes, 2016
In this note, we prove that all $2 \times 2$ monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations.
Albert, Michael, Brignall, Robert
core   +1 more source

Clifford analysis between continuous and discrete [PDF]

open access: yes, 2008
Some decades ago D. Knuth et al. have coined concrete mathematics as the blending of CONtinuous and disCRETE math, taking into account that problems of standard discrete mathematics can often be solved by methods based on continuous mathematics ...
Falcão, M. I., Malonek, H. R.
core   +1 more source

Heredity for generalized power domination

open access: yes, 2016
In this paper, we study the behaviour of the generalized power domination number of a graph by small changes on the graph, namely edge and vertex deletion and edge contraction.
Dorbec, Paul   +2 more
core   +2 more sources

A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions

open access: yesAdvanced Engineering Materials, EarlyView.
This study introduces a workflow to accelerate predictions of microstructure‐sensitive fatigue life. Results from frameworks with varying levels of simplification are benchmarked against published reference results. The analysis reveals a trade‐off between accuracy and model complexity, offering researchers a practical guide for selecting the optimal ...
Luca Loiodice   +2 more
wiley   +1 more source

Influence of Layering and Curie Temperature Uncertainty on the Performance of Multilayer Active Magnetic Regenerators

open access: yesAdvanced Functional Materials, EarlyView.
This study examines how manufacturing uncertainties in Curie temperatures (1.5–2°C) affect multilayer active magnetic regenerators (AMR). While increasing the number of magnetocaloric layers boosts cooling power, performance degrades due to temperature variations.
Urban Tomc   +6 more
wiley   +1 more source

Home - About - Disclaimer - Privacy