Search results for "Abstract data type"
showing 10 items of 1140 documents
Design principles for learning analytics information systems in higher education
2020
This paper reports a design science research (DSR) study that develops, demonstrates and evaluates a set of design principles for information systems (IS) that utilise learning analytics to support learning and teaching in higher education. The initial set of design principles is created from theory-inspired conceptualisation based on the literature, and they are evaluated and revised through a DSR process of demonstration and evaluation. We evaluated the developed artefact in four courses with a total enrolment of 1,173 students. The developed design principles for learning analytics information systems (LAIS) to establish a foundation for further development and implementation of learning…
A Branch-Price-and-Cut Algorithm for the Min-Max k -Vehicle Windy Rural Postman Problem
2013
[EN] The min-max k -vehicles windy rural postman problem consists of minimizing the maximal distance traveled by a vehicle to find a set of balanced routes that jointly service all the required edges in a windy graph. This is a very difficult problem, for which a branch-and-cut algorithm has already been proposed, providing good results when the number of vehicles is small. In this article, we present a branch-price-and-cut method capable of obtaining optimal solutions for this problem when the number of vehicles is larger for the same set of required edges. Extensive computational results on instances from the literature are presented.
CADEM: calculate X-ray diffraction of epitaxial multilayers
2017
This article presents a powerful yet simple program, based on the general one-dimensional kinematic X-ray diffraction (XRD) theory, which calculates the XRD patterns of tailor-made multilayers and thus enables quantitative comparison of measured and calculated XRD data. As the multilayers are constructed layer by layer, the final material stack can be entirely arbitrary.
Diffraction by m-bonacci gratings
2015
We present a simple diffraction experiment with m-bonacci gratings as a new interesting generalization of the Fibonacci ones. Diffraction by these nonconventional structures is proposed as a motivational strategy to introduce students to basic research activities. The Fraunhofer diffraction patterns are obtained with the standard equipment present in most undergraduate physics labs and are compared with those obtained with regular periodic gratings. We show that m-bonacci gratings produce discrete Fraunhofer patterns characterized by a set of diffraction peaks which positions are related to the concept of a generalized golden mean. A very good agreement is obtained between experimental and …
Testing the USLE-M family of models at the Sparacia experimental site in south Italy
2017
The modified Universal Soil Loss Equation (USLE-M) was empirically deduced by a statistical analysis of the original data set of soil loss measurements used to derive the Universal Soil Loss Equation (USLE). The USLE-M, including the effect of runoffin the event rainfall-runofferosivity factor, is characterized by a better capacity to predict event soil loss. At first, in this paper, using the soil erosion representative variables of USLE-M and the reference condition adopted in the USLE, the dimensional analysis and the self-similarity theory are applied to theoretically deduce a multiplicative equation similar to the USLE-M. Then using the database of the Sparacia experimental site, the a…
Multiple solutions for a Dirichlet problem with p-Laplacian and set-valued nonlinearity
2008
AbstractThe existence of a negative solution, of a positive solution, and of a sign-changing solution to a Dirichlet eigenvalue problem with p-Laplacian and multi-valued nonlinearity is investigated via sub- and supersolution methods as well as variational techniques for nonsmooth functions.
A function whose graph has positive doubling measure
2014
We show that a doubling measure on the plane can give positive measure to the graph of a continuous function. This answers a question by Wang, Wen and Wen. Moreover we show that the doubling constant of the measure can be chosen to be arbitrarily close to the doubling constant of the Lebesgue measure.
Planar maps whose second iterate has a unique fixed point
2007
Let a>0, F: R^2 -> R^2 be a differentiable (not necessarily C^1) map and Spec(F) be the set of (complex) eigenvalues of the derivative F'(p) when p varies in R^2. (a) If Spec(F) is disjoint of the interval [1,1+a[, then Fix(F) has at most one element, where Fix(F) denotes the set of fixed points of F. (b) If Spec(F) is disjoint of the real line R, then Fix(F^2) has at most one element. (c) If F is a C^1 map and, for all p belonging to R^2, the derivative F'(p) is neither a homothety nor has simple real eigenvalues, then Fix(F^2) has at most one element, provided that Spec(F) is disjoint of either (c1) the union of the number 0 with the intervals ]-\infty, -1] and [1,\infty[, or (c2) t…
Approximate fixed points of set-valued mapping in b-metric space
2016
We establish existence results related to approximate fixed point property of special types of set-valued contraction mappings, in the setting of b-metric spaces. As consequences of the main theorem, we give some fixed point results which generalize and extend various fixed point theorems in the existing literature. A simple example illustrates the new theory. Finally, we apply our results to establishing the existence of solution for some differential and integral problems.
Combinatorial isomorphism between Fibonacci classes
2008
Abstract In 1985 Simion and Schmidt showed that the set S n (T 3) of length n permutations avoiding the set of patterns T 3={123, 132, 213} is counted by (the second order) Fibonacci numbers. They also presented a constructive bijection between the set F n–1 of length (n–1) binary strings with no two consecutive 1s and S n (T 3). In 2005, Egge and Mansour generalized the first Simion-Simion’s result and showed that S n (T p ), the set of permutations avoiding the patterns T p ={12…p, 132, 213}, is counted by the (p–1)th order Fibonacci numbers. In this paper we extend the second Simion-Schmidt’s result by giving a bijection between the set of length (n–1) binary strings with no (p–1) consec…