Results 11 to 20 of about 333,973 (238)
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
Basic Properties of Metrizable Topological Spaces [PDF]
We continue Mizar formalization of general topology according to the book [11] by Engelking. In the article, we present the final theorem of Section 4.1.
Pąk, Karol
core +3 more sources
On Teaching Discrete Mathematics to Freshman Computer Science Students [PDF]
Discrete Mathematics is an inevitable part of any undergraduate computer science degree programme. However, today's computer science student typically finds this to be at best a necessary evil with which they struggle to engage. Twenty years ago, we started to address this issue seriously in our university, and we have instituted a number of ...
Faron Moller, Liam O'Reilly
openaire +3 more sources
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill +4 more
wiley +1 more source
A Survey on Continuous Time Computations [PDF]
We provide an overview of theories of continuous time computation. These theories allow us to understand both the hardness of questions related to continuous time dynamical systems and the computational power of continuous time analog models.
A Ben-Hur +138 more
core +5 more sources
A Workflow to Accelerate Microstructure‐Sensitive Fatigue Life Predictions
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
Estimation of Laplacian spectra of direct and strong product graphs
Calculating a product of multiple graphs has been studied in mathematics, engineering, computer science, and more recently in network science, particularly in the context of multilayer networks. One of the important questions to be addressed in this area
Sayama, Hiroki
core +1 more source
A numerical model resulting from irreversible thermodynamics for describing transport processes is introduced, focusing on thermodynamic activity gradients as the actual driving force for diffusion. Implemented in CUDA C++ and using CalPhaD methods for determining the necessary activity data, the model accurately simulates interdiffusion in aluminum ...
Ulrich Holländer +3 more
wiley +1 more source
Организация учебного процесса по дискретной математике и математической логике [PDF]
In this paper we consider the method of teaching discrete mathematics and mathematical logic for future bachelors of "Mathematics and Computer Science".Рассматривается методика обучения дискретной математике и математической логике будущих бакалавров по ...
Bukusheva, A. V. +1 more
core
Setup‐Optimized Sequencing in Job Shops: Modeling Workstation Productivity and Lateness Behavior
Setup‐optimized sequencing in job‐shop production creates a trade‐off between productivity improvement and schedule reliability. A WIP‐explicit modeling framework links sequencing‐induced productivity gains and lateness dispersion through the production operating curve.
Friederike Stefanowski +2 more
wiley +1 more source

