Search results for " Programming"
showing 10 items of 1616 documents
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…
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…
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…
Performance evaluation of differentiated access mechanisms effectiveness in 802.11 networks
2005
The IEEE 802.11e draft specification aims to extend the original 802.11 MAC protocol by introducing priority mechanisms able to manage bandwidth and resource allocation according to the QoS needs of real-time applications. Different strategies based on MAC parameter diversifications, such as contention window limits, contention window updating factor and silence monitoring time, can be pursued in order to provide service differentiation, also in the case of distributed access. In this paper, we investigate on the behaviour of each differentiation possibility under different load conditions and traffic requirements. Our results show that the most powerful mechanisms which provide service dif…