Search results for " computing"
showing 10 items of 2075 documents
A characterization of regular circular languages generated by marked splicing systems
2009
AbstractSplicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. A splicing system is defined by giving an initial set I and a set R of rules. Some unanswered questions are related to the computational power of circular splicing systems. In particular, a still open question is to find a characterization of circular languages generated by finite circular splicing systems (i.e., circular splicing systems with both I and R finite sets). In this paper we introduce a special class of the latter systems named marked systems. We prove that a marked system S generates a regular circular language if an…
A Deep Learning Approach for Energy Efficient Computational Offloading in Mobile Edge Computing
2019
Mobile edge computing (MEC) has shown tremendous potential as a means for computationally intensive mobile applications by partially or entirely offloading computations to a nearby server to minimize the energy consumption of user equipment (UE). However, the task of selecting an optimal set of components to offload considering the amount of data transfer as well as the latency in communication is a complex problem. In this paper, we propose a novel energy-efficient deep learning based offloading scheme (EEDOS) to train a deep learning based smart decision-making algorithm that selects an optimal set of application components based on remaining energy of UEs, energy consumption by applicati…
Quadratically Tight Relations for Randomized Query Complexity
2020
In this work we investigate the problem of quadratically tightly approximating the randomized query complexity of Boolean functions R(f). The certificate complexity C(f) is such a complexity measure for the zero-error randomized query complexity R0(f): C(f) ≤R0(f) ≤C(f)2. In the first part of the paper we introduce a new complexity measure, expectational certificate complexity EC(f), which is also a quadratically tight bound on R0(f): EC(f) ≤R0(f) = O(EC(f)2). For R(f), we prove that EC2/3 ≤R(f). We then prove that EC(f) ≤C(f) ≤EC(f)2 and show that there is a quadratic separation between the two, thus EC(f) gives a tighter upper bound for R0(f). The measure is also related to the fractional…
Energy-Efficiency and Coverage Quality Management for Reliable Diagnostics in Wireless Sensor Networks
2020
International audience; The processing of data and signals provided by sensors aims at extracting rnrelevant features which can be used to assess and diagnose the health state rnof the monitored targets. Nevertheless, Wireless Sensor Networks (WSNs) present rna number of shortcomings that have an impact on the quality of the gathered rndata at the sink level, leading to imprecise diagnostics rnof the observed targets. To improve data accuracy, two main critical and related issues, namely the energy consumption and coverage quality, need to be considered. The goal is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. Unfortunately, these performance…
IMPACT OF THE "COMUNICAT" METHODOLOGY ON THE IMPROVEMENT OF THE "EFFECTIVE ORAL COMMUNICATION" STUDENT OUTCOME OF THE STUDENTS OF THE MASTER IN FOOD …
2019
[EN] During academic course 2017-2018 the Comunica't methodology was created to help students to self-learn all the skills needed to master the areas of domain of the general student outcome effective oral communication. After two academic years of implementation, the goal of this work is to analyse the degree of contribution of this methodology to development of the "Effective Oral Communication students outcome of students that followed the methodology during the subject Audits of Food Safety and Quality Systems, belonging to the Master in Food Safety and Quality Management. To this end, at the beginning of the subject, students were asked to present a topic related to the subject and eva…
Potential and limitations of quantum extreme learning machines
2023
Quantum reservoir computers (QRC) and quantum extreme learning machines (QELM) aim to efficiently post-process the outcome of fixed -- generally uncalibrated -- quantum devices to solve tasks such as the estimation of the properties of quantum states. The characterisation of their potential and limitations, which is currently lacking, will enable the full deployment of such approaches to problems of system identification, device performance optimization, and state or process reconstruction. We present a framework to model QRCs and QELMs, showing that they can be concisely described via single effective measurements, and provide an explicit characterisation of the information exactly retriev…
Quantum chemical meta-workflows in MoSGrid
2014
Quantum chemical workflows can be built up within the science gateway Molecular Simulation Grid. Complex workflows required by the end users are dissected into smaller workflows that can be combined freely to larger meta-workflows. General quantum chemical workflows are described here as well as the real use case of a spectroscopic analysis resulting in an end-user desired meta-workflow. All workflow features are implemented via Web Services Parallel Grid Runtime and Developer Environment and submitted to UNICORE. The workflows are stored in the Molecular Simulation Grid repository and ported to the SHIWA repository. © 2014 John Wiley & Sons, Ltd.
Lattice quantum hadrodynamics on a CRAY Y-MP
1992
Quantum corrections to the mean-field equation of state for nuclear matter are estimated in a lattice simulation of quantum hadrodynamics on a CRAY Y-MP. In contrast with lattice quantum chromodynamics, where coordinate space methods are the standard, the calculations are carried out in momentum space and on nonhypercubic (irregular) lattices. The quantum corrections to the known, mean-field equation of state were found to be considerable. The time frame of the project and the large computational needs of the program required the use of powerful supercomputers, like the CRAY Y-MP, which are capable of performing at a very high computing speed by using both vector and parallel hardware, the …
Distortion of the virtual photon cloud due to a static electric field
1988
The structure of the virtual transverse-photon cloud surrounding a ground-state hydrogen atom is considered in the presence of a uniform static electric field, which is capable of polarizing the atom. It is shown that this virtual cloud is distorted with respect to the spherically symmetric shape which is obtained when no static electric field is present. The distortion is carried by new components of the cloud, arising from the contributions of magnetic-dipole and electric-quadrupole virtual photons. These new contributions are shown to possess an overall cylindrical symmetry around the direction of the static field, and to be present also at large distances from the atom. The possibility …
Active queue management stability in multiple bottleneck networks
2004
In this paper, we show that the active queue management (AQM) controllers, usually configured on a single bottleneck basis, may not prevent instability in the presence of multiple bottlenecks. We justify this result through a multiple bottleneck model.