Search results for "programming"
showing 10 items of 3090 documents
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…
Privacy Enhanced Device Access
2012
In this paper we present the case for a device authentication protocol that authenticates a device/service class rather than an individual device. The devices in question are providing services available to the public. The proposed protocol is an online protocol and it uses a pseudo-random temporary identity scheme to provide user privacy.
A privacy enhanced device access protocol for an IoT context
2013
In this paper, we present the case for a device authentication protocol that authenticates a device/service class rather than an individual device. The devices in question are providing services available to the public. The proposed protocol is an online protocol, and it uses a pseudo-random temporary identity scheme to provide user privacy. This allows the Internet-of-Things device to have full assurance of the user, with respect to the request service, while permitting the user to remain anonymous with respect to the device. The user can then enjoy identity and location privacy in addition to untraceability with respect to device access. Copyright © 2013 John Wiley & Sons, Ltd.
Experimental Performance Evaluation of Cloud-Based Analytics-as-a-Service
2016
An increasing number of Analytics-as-a-Service solutions has recently seen the light, in the landscape of cloud-based services. These services allow flexible composition of compute and storage components, that create powerful data ingestion and processing pipelines. This work is a first attempt at an experimental evaluation of analytic application performance executed using a wide range of storage service configurations. We present an intuitive notion of data locality, that we use as a proxy to rank different service compositions in terms of expected performance. Through an empirical analysis, we dissect the performance achieved by analytic workloads and unveil problems due to the impedance…
Revenue-Aware Resource Allocation in the Future Multi-Service IP Networks
2006
In the future IP networks, a wide range of different service classes must be supported in a network node and different classes of customers will pay different prices for their used node resources based on their Service-Level-Agreements. In this paper, we link the resource allocation issue with pricing strategies and explore the problem of maximizing the revenue of service providers in a network node by optimally allocating a given amount of node resources among multiple service classes. Under the linear pricing strategy, the optimal resource allocation scheme is derived for the case that no firm Quality-of-Service (QoS) guarantees are required for all service classes, which can achieve the …
MAGICPL: A Generic Process Description Language for Distributed Pseudonymization Scenarios
2021
Abstract Objectives Pseudonymization is an important aspect of projects dealing with sensitive patient data. Most projects build their own specialized, hard-coded, solutions. However, these overlap in many aspects of their functionality. As any re-implementation binds resources, we would like to propose a solution that facilitates and encourages the reuse of existing components. Methods We analyzed already-established data protection concepts to gain an insight into their common features and the ways in which their components were linked together. We found that we could represent these pseudonymization processes with a simple descriptive language, which we have called MAGICPL, plus a relati…