Lecture Notes Research Articles

An in-depth Analysis of Undergraduates’ Study Skills: A Study at Nong Lam University

Study skills are critical to students’ achievement. The objective of this study is to assess the study skills of undergraduates. The Inventory of College Level Study Skills developed by Dennis H. Congos (2011), in which study skills were divided into six categories or subscales: textbook reading, note-taking, memorizing, test preparation, concentration, and time management, was adopted to collect data. The results of the analysis revealed that skimming for main ideas appeared to be the most frequently used reading technique among the participants; taking note in lectures is the most preferred skill. Regarding memory skills, the most popular skill was reviewing notes more than once or twice for exams and quizzes, and the least popular skill was using visual in notes such as sketches, mind maps, diagrams, charts, etc. In terms of test preparation skills, the most frequently-used skill was submitting homework assignments on time while the least favoured test preparation sub-skill was reviewing lecture note soon after classes. As for concentration skills, getting all study equipment ready for learning was considered the most important skill, while avoiding study in the evenings as much as possible was the least prioritized method. Accordingly, the researchers would recommend students be provided with suitable guidelines in order to practice good study skills.

Berry-Chern monopoles and spectral flows

This lecture note adresses the correspondence between spectral flows, often associated to unidirectional modes, and Chern numbers associated to degeneracy points. The notions of topological indices (Chern numbers, analytical indices) are introduced for non specialists with a wave physics or condensed matter background. The correspondence is detailed with several examples, including the Dirac equations in two dimensions, Weyl fermions in three dimensions, the shallow water model and other generalizations.

Synthesis of Fast-Decaying Window Functions [Lecture Notes

A window function is a mathematical function that is zero valued outside some chosen interval <xref ref-type="bibr" rid="ref1" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[1]</xref> , <xref ref-type="bibr" rid="ref2" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[2]</xref> . For applications like filtering, detection, and estimation, the window functions take the form of limited time functions, which are in general real and even functions <xref ref-type="bibr" rid="ref3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[3]</xref> , <xref ref-type="bibr" rid="ref4" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[4]</xref> , while for applications like beamforming and image processing, they are limited spatial functions. A spatial window can be a complex function for optimizing the beams in magnitude as well as in phase, as in the case of certain antenna arrays, where the phasor currents in the array are complex numbers <xref ref-type="bibr" rid="ref5" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[5]</xref> . The windows for filtering applications are broadly categorized into two types based on their usage: the ones designed for suppression of cochannel interference and the ones for suppressing the far-off harmonic components <xref ref-type="bibr" rid="ref2" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[2]</xref> , <xref ref-type="bibr" rid="ref3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[3]</xref> , <xref ref-type="bibr" rid="ref6" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[6]</xref> . Some of the recent window functions picked from the exhaustive literature are generalized normal windows, confined Gaussian windows, hyperbolic cosine windows, polynomial windows, cosine windows with coefficient optimization, and sine windows <xref ref-type="bibr" rid="ref7" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[7]</xref> – <xref ref-type="bibr" rid="ref8" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> <xref ref-type="bibr" rid="ref9" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> <xref ref-type="bibr" rid="ref10" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> <xref ref-type="bibr" rid="ref11" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"/> <xref ref-type="bibr" rid="ref12" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">[12]</xref> .

Gradient Boosting Machines and Non-Life Insurance Pricing - Lecture Notes

Gradient Boosting Machines and Non-Life Insurance Pricing - Lecture Notes

A Practical Example of Data Science Education through Hands-on Lecture using Python

Programming education is essential for developing data scientists and data engineers with practical skills. Python has become the de facto standard programming language for data analysis. In this paper, we present an example of practical data science education using Python conducted for second-year undergraduate students in the Department of Information and Computer Science at our university in 2019 and 2020. A feature of the lecture is a fill-in-the-blank “Lecture Notes” created by Jupyter Notebook. By the introduction of Lecture Notes, students can learn Python programming as if they were taking notes in hands-on style class. As a result of a questionnaire survey, about 80％ of the students answered that they were able to concentrate on the class.

Comments On The Cryptanalysis Of An Identity-Based Strong Designated Verifier Signature Scheme

In this paper, we explain that the proposed modification to an identity-based strong designated verifier signature scheme (Lecture Notes in Electrical Engineering, vol. 164, no. 1, Springer-Verlag, 2012) is not secure. This scheme has a short signature size, low communication cost, and low computational cost. But, it does not satisfy the required authentication property in a designated verifier signature scheme. In particular, we introduce an attack that enables anybody to verify the signature.

Bibliometric analysis of mobile learning research from 1984 to 2020

The main purpose of this study was bibliometrics analysis of literature published on mobile learning from 1984-2020 retrieved from the Scopus database on 18 February 2021. Total 7404 records imported and download in BibTex, CSVs and RIS format were analysed through MS Excel, MS Access, Biblioshiny and Vosviewer. Results show that different authors use keywords (Mobile Learning, Higher Education and Mobile Devices) on mobile learning, and USA is the most productive country in this area. Most of the articles were presented/written in conference proceedings (Lecture Notes in Computer Science) and journal (International Journal of Mobile Learning and Organisation) by collaborative authors. China is the top collaborative country with the USA and Canada. Three filed plots show the most publishing authors on mobile learning belong to China, Indonesia, the USA and Spain. Hwang GJ is the most prolific author with the highest citation and highest h-index, g-index and m-index impact.

Book review: A. Fowler and F. Ng (Eds.), 2020. Glaciers and Ice Sheets in the Climate System: The Karthaus Summer School Lecture Notes.

Book review: A. Fowler and F. Ng (Eds.), 2020. Glaciers and Ice Sheets in the Climate System: The Karthaus Summer School Lecture Notes.

Tracking and Estimation of Frequency, Amplitude, and Form Factor of a Harmonic Time Series [Lecture Notes

Formulas for estimating and tracking the (time-dependent) frequency, form factor, and amplitude of harmonic time series are presented in this lecture note; in particular, sine-dominant signals, where the harmonics follow roughly the dominant first harmonic, such as photoplethysmography (PPG) and breathing signals. Special attention is paid to the convergence behavior of the algorithm for stationary signals and the dynamic behavior in case of a transition to another stationary state. The latter issue is considered to be important for assessing the tracking abilities for nonstationary signals. We will discuss special cases of sine-dominant signals that will converge to an approximate or the same value as for a single sinusoid. The presented formulas are recursive in nature and use only the instantaneous values of the signal, in a low-cost and low-complexity manner. In particular, there is no need to use square roots or trigonometric or matrix operations; therefore, these formulas are suitable for low-power ambulatory measurements and computationally demanding machine learning algorithms. Furthermore, there appears to be an interesting connection between the form factor and Geary's test of normality.

Poincaré Inequality for a Mesh-Dependent 2-Norm on Piecewise Linear Surfaces with Boundary

AbstractWe establish several useful estimates for a non-conforming 2-norm posed on piecewise linear surface triangulations with boundary, with the main result being a Poincaré inequality. We also obtain equivalence of the non-conforming 2-norm posed on the true surface with the norm posed on a piecewise linear approximation. Moreover, we allow for free boundary conditions. The true surface is assumed to beC2,1C^{2,1}when free conditions are present; otherwise,C2C^{2}is sufficient. The framework uses tools from differential geometry and the closest point map (see [G. Dziuk, Finite elements for the Beltrami operator on arbitrary surfaces,Partial Differential Equations and Calculus of Variations, Lecture Notes in Math. 1357, Springer, Berlin (1988), 142–155]) for approximating the full surface Hessian operator. We also present a novel way of applying the closest point map when dealing with surfaces with boundary. Connections with surface finite element methods for fourth-order problems are also noted.

Evaluating the Mahler measure of linear forms via the Kronecker limit formula on complex projective space

In Cogdell et al., LMS Lecture Notes Series 459, 393–427 (2020), the authors proved an analogue of Kronecker’s limit formula associated to any divisor D \mathcal D which is smooth in codimension one on any smooth Kähler manifold X X . In the present article, we apply the aforementioned Kronecker limit formula in the case when X X is complex projective space C P n \mathbb {C}\mathbb {P}^n for n ≥ 2 n \geq 2 and D \mathcal D is a hyperplane, meaning the divisor of a linear form P D ( z ) P_D({z}) for z = ( Z j ) ∈ C P n {z} = (\mathcal {Z}_{j}) \in \mathbb {C}\mathbb {P}^n . Our main result is an explicit evaluation of the Mahler measure of P D P_{D} as a convergent series whose each term is given in terms of rational numbers, multinomial coefficients, and the L 2 L^{2} -norm of the vector of coefficients of P D P_{D} .

Cryptanalysis of Modular Exponentiation Outsourcing Protocols

Abstract Public-key cryptographic primitives are time consuming for resource-constrained devices. A classical problem is to securely offload group exponentiations from a (comparatively) weak device—the client—to an untrusted more powerful device—the server. A delegation protocol must usually meet two security objectives: privacy—the exponent or the base should not be revealed to a passive adversary—and verifiability—a malicious server should not be able to make the client accept an invalid value as the result of the delegated computation. Most proposed protocols relies on a secret splitting of the exponent and the base, and a considerable amount of literature has been devoted to their analysis. Recently, Su et al. (Su, Q., Zhang, R. and Xue, R. (2020) Secure outsourcing algorithms for composite modular exponentiation based on single untrusted cloud. Comput. J., 63, 1271.) and Rangasamy and Kuppusamy (Rangasamy, J. and Kuppusamy, L. (2018) Revisiting Single-Server Algorithms for Outsourcing Modular Exponentiation. In Chakraborty, D. and Iwata, T. (eds), Progress in Cryptology - INDOCRYPT 2018: 19th International Conference in Cryptology in India, New Delhi, India, December 912, Vol. 11356, Lecture Notes in Computer Science. Springer, Heidelberg, Germany, pp. 320. proposed outsourcing protocols for modular exponentiations. They claim that their protocols achieve security (privacy and verifiability). We show that these claims are flawed and that their schemes are broken beyond repair. They remain insecure even if one increases significantly the proposed parameters (and consequently the protocols computational and communication complexities). Our attacks rely on standard lattice-based cryptanalytic techniques, namely the Coppersmith methods to find small integer zeroes of modular multivariate polynomials and simultaneous Diophantine approximation methods for the so-called approximate greatest common divisor problem.

A Historical Perspective of Architecture Education at Waseda University in Japan: Analyses of the Waseda Architecture Lecture Notes for Correspondence Education in the early Shōwa period

ABSTRACT The dawn of modern architecture education in Japan came as the Meiji Administration established public universities and technical training schools. During the the end of the Taishō period (1912–1926) to the Shōwa period (1926–1989), with rapid social modernization, construction technologies also needed to be modernized. In the private education sector, Waseda University, the pioneer in individualized architecture education, introduced and implemented a special education system called correspondence education (a form of distance learning) in the early Shōwa period to serve the society’s demand for architectural professionals and technicians. The Waseda Architecture Lecture Notes, used as course materials for correspondence education, play a vital role in understanding Japanese architectural education’s founding period. This paper focuses on current storage locations, publication time frames, educational background of the lecturers, proportional arrangements of the various subjects, as well as the design and characteristics of lecture syllabi of the Waseda Architecture Lecture notes. This analysis reveals that the Waseda Architecture Lecture Notes had specifically emphasized on architectonics courses. Therefore, Waseda University made significant contributions to the national reserve and the cultivation of architectural specialists through the distance learning approach tailored to the historical context of the Shōwa period.

Tense De Morgan S4-algebras

In [Tense operators on De Morgan algebras, Log. J. IGPL 22(2) (2014) 255–267], Figallo and Pelaitay introduced the notion of tense operators on De Morgan algebras. Also, other notions of tense operators on De Morgan algebras were given by Chajda and Paseka in [De Morgan algebras with tense operators, J. Mult.-Valued Logic Soft Comput. 1 (2017) 29–45; The Poset-based logics for the De Morgan negation and set representation of partial dynamic De Morgan algebras, J. Mult.-Valued Logic Soft Comput. 31(3) (2018) 213–237; Set representation of partial dynamic De Morgan algebras, in 2016 IEEE 46th Int. Symp. Multiple-Valued Logic (IEEE Computer Society, 2016), pp. 119–124]. In this paper, we introduce a new notion of tense operators on De Morgan algebras and define the class of tense De Morgan [Formula: see text]-algebras. The main purpose of this paper is to give a discrete duality for tense De Morgan [Formula: see text]-algebras. To do this, we will extend the discrete duality given in [W. Dzik, E. Orłowska and C. van Alten, Relational Representation Theorems for Lattices with Negations: A Survey, Lecture Notes in Computer Science (2006), pp. 245–266], for De Morgan algebras.

Input Shaping: A Tutorial Introduction [Lecture Notes

A description of input shaping appeared in a recent issue of <i>IEEE Control Systems</i> [1]. This lecture note is a follow-up to that article. For a summary of the material appearing in this article, see "Summary."

“Accelerating the Transition to a 100% Renewable Energy Era”

“Accelerating the Transition to a 100% Renewable Energy Era”

Number of rational points of elliptic curves

In the modern theory of elliptic curves, one of the important problems is the determination of the number of rational points on an elliptic curve. The Mordel–Weil theorem [T. Shioda, On the Mordell–Weil lattices, Comment. Math. University St. Paul. 39(2) (1990) 211–240] points out that the elliptic curve defined above the rational points is generated by a finite group. Despite the knowledge that an elliptic curve has a final number of rational points, it is still difficult to determine their number and the way how to determine them. The greatest progress was achieved by Birch and Swinnerton–Dyer conjecture, which was included in the Millennium Prize Problems [A. Wiles, The Birch and Swinnerton–Dyer conjecture, The Millennium Prize Problems (American Mathematical Society, 2006), pp. 31–44]. This conjecture uses methods of the analytical theory of numbers, while the current knowledge corresponds to the assumptions of the conjecture but has not been proven to date. In this paper, we focus on using a tangent line and the osculating circle for characterizing the rational points of the elliptical curve, which is the greatest benefit of the contribution. We use a different view of elliptic curves by using Minkowki’s theory of number geometry [H. F. Blichfeldt, A new principle in the geometry of numbers, with some applications, Trans. Amer. Math. Soc. 15(3) (1914) 227–235; V. S. Miller, Use of elliptic curves in cryptography, in Proc. Advances in Cryptology — CRYPTO ’85, Lecture Notes in Computer Science, Vol. 218 (Springer, Berlin, Heidelberg, 1985), pp. 417–426; E. Bombieri and W. Gubler, Heights in Diophantine Geometry, Vol. 670, 1st edn. (Cambridge University Press, 2007)].

Selected Topics in the Generalized Mixed Set-Indexed Fractional Brownian Motion

In this paper, we explore the generalized mixed fractional Brownian motion in the set-indexed framework and generalize several recent results from Miao et al. (Lecture Notes and Math, Springer, New York, 2008), Zili (J. Appl. Math. Stoch. Anal. 30:1–9, 2006) and Thale (Appl. Math. Sci. 3(28):1885–1901, 2009). We present the characterization of generalized mixed set-indexed fractional Brownian motion (gmsifBM) by flows, and we extend some selected aspects to the gmsifBM for the following issues: stationary increments, self-similarity, long-range dependence, Holder continuity, differentiability, Hausdorff dimension, etc.

On Characteristic Rank for Matrix and Tensor Completion [Lecture Notes

In this lecture note, we discuss a fundamental concept, referred to as the characteristic rank, that suggests a general framework for characterizing the basic properties of various low-dimensional models used in signal processing. We illustrate this framework through two examples-matrix and three-way tensor completion problems-and consider basic properties, including the identifiability of matrices and tensors, given partial observations. We consider cases without observation noise to illustrate the principle.

M-Learning in Promoting Green Building Awareness in Palestine

Most Palestinians have yet to have the urge to participate in green building practices. To enhance green building education in Palestine, we built a mobile application named “Let’s Go Green” to deliver awareness and incorporate green building technologies. In order to validate the mobile learning (m-learning) effect, we have conducted separate measurements by using ARCS motivation model and paper-based quiz among 80 engineering and architecture students in Hebron, Palestine. The students were split into two groups; group A (experimental; applied m-learning method) and group B (control; adopted conventional lecture note method). This study has three important findings (1) m-learning users found to have stronger learning motivation than those who used the conventional lecture note; (2) m-learning users generally exhibited better learning effectiveness than non-users; (3) the m-learning was found to be attractive to the students, implying that it can be an important content for educational and leisure for green building education. The findings demonstrated that the Let’s Go Green Application is an effective instructional material to improve students’ knowledge on green building. This application can be downloaded for both smartphones; Android, and iPhone. These functions have not been implemented yet, therefore this is the first attempt of such an approach.