Search results for "programming."
showing 10 items of 3035 documents
Fostering Teacher-Student Interaction and Learner Autonomy by the I-TUTOR Maps
2014
The paper analyses the use of an automatically generated map as a mediator; that map visually represents the study domain of a university course and fosters the co-activity between teachers and stu- dents. In our approach the role of the teacher is meant as a media- tor between the student and knowledge. The mediation (and not the transmission) highlights a process in which theres no deterministic rela- tion between teaching and learning. Learning is affected by the students previous experiences, their own modalities of acquisition and by the in- puts coming from the environment. The learning path develops when the teachers and the students visions approach and, partly, overlap. In this cas…
PROLISEAN: A New Security Protocol for Programmable Matter
2021
The vision for programmable matter is to create a material that can be reprogrammed to have different shapes and to change its physical properties on demand. They are autonomous systems composed of a huge number of independent connected elements called particles. The connections to one another form the overall shape of the system. These particles are capable of interacting with each other and take decisions based on their environment. Beyond sensing, processing, and communication capabilities, programmable matter includes actuation and motion capabilities. It could be deployed in different domains and will constitute an intelligent component of the IoT. A lot of applications can derive fro…
On Determinants of Integrable Operators with Shifts
2013
Integrable integral operator can be studied by means of a matrix Riemann--Hilbert problem. However, in the case of so-called integrable operators with shifts, the associated Riemann--Hilbert problem becomes operator valued and this complicates strongly the analysis. In this note, we show how to circumvent, in a very simple way, the use of such a setting while still being able to characterize the large-$x$ asymptotic behavior of the determinant associated with the operator.
Nonfragile Gain-Scheduled Control for Discrete-Time Stochastic Systems with Randomly Occurring Sensor Saturations
2013
Published version of an article in the journal: Abstract and Applied Analysis. Also available from the publisher at: http://dx.doi.org/10.1155/2013/629621 Open Access This paper is devoted to tackling the control problem for a class of discrete-time stochastic systems with randomly occurring sensor saturations. The considered sensor saturation phenomenon is assumed to occur in a random way based on the time-varying Bernoulli distribution with measurable probability in real time. The aim of the paper is to design a nonfragile gain-scheduled controller with probability-dependent gains which can be achieved by solving a convex optimization problem via semidefinite programming method. Subsequen…
Computer-aided synthesis of complex pump and valve operations
1988
Abstract Process plant operators often have to synthesize sequences of valve and pump operations. On large plants there may be so many possible pipe routes and vessels that it is not practical to provide a priori computer support for every possible operation. The paper describes a program that could form the basis of an operator aid to synthesize appropriate operations from a knowledge of the plant layout and existing pumping operations. The paper concentrates on finding paths through the pipework and on generating a sequence of operations that establishes the path whilst simultaneously satisfying other safety and operating constraints. The paper includes two example problems which were use…
Yet Another New Variant of Szász–Mirakyan Operator
2021
In this paper, we construct a new variant of the classical Szász–Mirakyan operators, Mn, which fixes the functions 1 and eax,x≥0,a∈R. For these operators, we provide a quantitative Voronovskaya-type result. The uniform weighted convergence of Mn and a direct quantitative estimate are obtained. The symmetry of the properties of the classical Szász–Mirakyan operator and of the properties of the new sequence is investigated. Our results improve and extend similar ones on this topic, established in the last decade by many authors.
Lightweight BWT Construction for Very Large String Collections
2011
A modern DNA sequencing machine can generate a billion or more sequence fragments in a matter of days. The many uses of the BWT in compression and indexing are well known, but the computational demands of creating the BWT of datasets this large have prevented its applications from being widely explored in this context. We address this obstacle by presenting two algorithms capable of computing the BWT of very large string collections. The algorithms are lightweight in that the first needs O(m log m) bits of memory to process m strings and the memory requirements of the second are constant with respect to m. We evaluate our algorithms on collections of up to 1 billion strings and compare thei…
Lightweight algorithms for constructing and inverting the BWT of string collections
2013
Recent progress in the field of \{DNA\} sequencing motivates us to consider the problem of computing the Burrows‚ÄìWheeler transform (BWT) of a collection of strings. A human genome sequencing experiment might yield a billion or more sequences, each 100 characters in length. Such a dataset can now be generated in just a few days on a single sequencing machine. Many algorithms and data structures for compression and indexing of text have the \{BWT\} at their heart, and it would be of great interest to explore their applications to sequence collections such as these. However, computing the \{BWT\} for 100 billion characters or more of data remains a computational challenge. In this work we ad…
Generación de fractales a partir del método de Newton
2013
[EN] A large number of fractals known, as Julia fractals and Mandelbrot, can be generated from an iterative method. In this paper we present a virtual laboratory developed as a Graphical User Interface (GUI) of Matlab that allows us to study and visualize in real time the relationship between Newton iterative methods of two variables and the generation of fractals. The main objective is to allow Technical School students in Numerical Computation subjects to acquire the skills to generate fractals and interpret their plots in terms of the convergence or divergence speed of the sequence of iterated.
Multi-Connectivity Management for 5G V2X Communication
2019
With the advent of automated driving functions the need for cooperation among vehicles becomes increasingly necessary. The availability of high quality connectivity is an important factor for successful and uninterrupted cooperative and autonomous services. Flexible selection of available connectivity options, increases the probabilities to achieve and maintain the required Quality of Service (QoS). Future vehicles will support multiple 5G communication interfaces e.g., cellular (Uu), sidelink (PC5). A 5G RAN-based solution is proposed in this paper to dynamically select and change the communication interface that is suitable for a V2X service, considering radio and road conditions. The com…