Results 11 to 20 of about 3,718,653 (287)
Developing of mLearning for Discrete Mathematics Based on Android Platform
Procedia, Social and Behavioral Sciences, 2015 In this paper, we present Discrete Mathematics Learning system based on Android operating system. The objective of this system is to advice student to learn discrete mathematics more convenient on mobile platform.
K. Kularbphettong +4 more
semanticscholar +3 more sources
Discrete mathematics as a resource for developing scientific activity in the classroom. [PDF]
ZDM, 2022 Colipan X, Liendo A.
europepmc +2 more sources
, 2021 The purpose of this study is to determine whether the flipped learning method via MOODLE can improve learning outcomes and motivation to learn discrete mathematics during COVID-19 pandemic.
H. Mursyidah, R. P. Hermoyo, D. Suwaibah
semanticscholar +1 more source
IEEE Access, 2020 In addition to wirelength and area, modern floorplans need to consider various constraints such as fixed-outline. To handle the fixed-outline floorplanning optimization problem efficiently, we propose an improved simulated annealing (SA) algorithm, which
Zhipeng Huang +3 more
doaj +1 more source
Generalized Hausdorff Operators on K̇α,qβ,pℝ and HK̇α,qβ,p,Nℝ in the Dunkl Settings
Journal of Function Spaces, 2021 In the present paper, we obtain some new results, and we generalize some known results for the Hausdorff operators. We have studied the generalized Hausdorff operators Hα,φ on the Dunkl-type homogeneous weighted Herz spaces K̇α,qβ,pℝ and Dunkl Herz-type ...
Faouaz Saadi, Othman Tyr, Radouan Daher
doaj +1 more source
The extremal graphs with respect to their nullity
Journal of Inequalities and Applications, 2016 The nullity of a graph G, denoted by η ( G ) $\eta(G)$ , is the multiplicity of the eigenvalue zero of its adjacency matrix. In this paper, we determine all graphs with η ( G ) = n ( G ) − 2 m ( G ) − c ( G ) $\eta(G)=n(G) - 2m(G) -c(G)$ , where c ( G ) =
Sa Rula, An Chang, Yirong Zheng
doaj +1 more source
Bicyclic graphs with maximum sum of the two largest Laplacian eigenvalues
Journal of Inequalities and Applications, 2016 Let G be a simple connected graph and S 2 ( G ) $S_{2}(G)$ be the sum of the two largest Laplacian eigenvalues of G. In this paper, we determine the bicyclic graph with maximum S 2 ( G ) $S_{2}(G)$ among all bicyclic graphs of order n, which confirms the
Yirong Zheng +3 more
doaj +1 more source
Independent resolving sets in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Let be a connected graph. Let be a subset of V with an order imposed on W. The k-vector is called the resolving vector of v with respect to W. The set W is called a resolving set if for any two distinct vertices In this paper we investigate the existence
B. Suganya, S. Arumugam
doaj +1 more source
Lagrange Dual Method for Sparsity Constrained Optimization
IEEE Access, 2018 In this paper, we investigate the l0 quasi-norm constrained optimization problem in the Lagrange dual framework and show that the strong duality property holds.
Wenxing Zhu +3 more
doaj +1 more source
IEEE Access, 2020 To fully utilize the dynamic reconfigurability of digital microfluidic biochips, most of electrodes would be shared by different droplets. Thus, contaminations caused by liquid residues among droplets are inevitable which lead to lethal errors in ...
Zhipeng Huang +4 more
doaj +1 more source