Search results for "Algorithm"
showing 10 items of 4887 documents
Formal verification of a Cooperative Automatic Repeat reQuest MAC protocol
2012
Author's version of an article published in the journal: Computer Standards & Interfaces. Also available from the publisher at: http://dx.doi.org/10.1016/j.csi.2011.12.001 Cooperative communications, in which a relay node helps the source node to deliver its packets to the destination node, are able to obtain significant benefits in terms of transmission reliability, coverage extension and energy efficiency. A Cooperative Automatic Repeat reQuest (C-ARQ) MAC protocol has been recently proposed to exploit cooperative diversity at the MAC layer. in this paper, we validate the integrity and the validity of the C-ARQ protocol using formal methods. The protocol logic is modeled in SDL and implem…
Selection and evaluation of Internet information by adults with intellectual disabilities
2018
Internet offers people with intellectual disabilities (ID) unique opportunities to access information and to participate in society. But concerns have been raised about the potential risks they face when accessing the Internet (e.g. giving credit to false information, being exposed to manipulative content). As part of the current debate between positive risk-taking and overprotection, our study empirically tested the extent to which 43 adults with ID identified and selected topically relevant as well as trustworthy web pages while searching the Internet for several topics (e.g. Can social networks use your pictures for advertisement?). Participants also justified their search decisions. Res…
PGAC: A Parallel Genetic Algorithm for Data Clustering
2005
Cluster analysis is a valuable tool for exploratory pattern analysis, especially when very little a priori knowledge about the data is available. Distributed systems, based on high speed intranet connections, provide new tools in order to design new and faster clustering algorithms. Here, a parallel genetic algorithm for clustering called PGAC is described. The used strategy of parallelization is the island model paradigm where different populations of chromosomes (called demes) evolve locally to each processor and from time to time some individuals are moved from one deme to another. Experiments have been performed for testing the benefits of the parallelisation paradigm in terms of comput…
Formulations for an inventory routing problem
2014
In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending their routes at a depot. The objective of the IRP is the minimization of the sum of inventory and transportation costs. The formulations include known and new mathematical programming formulations. Valid inequalities are also presented. The formulations are tested on a large set of benchmark instances. One of the most significant conclusions is that the formulations that use vehicle-indexed variables are superior to the more compact, aggregate formulations.
The inverse eigenvalue problem for a Hermitian reflexive matrix and the optimization problem
2016
The inverse eigenvalue problem and the associated optimal approximation problem for Hermitian reflexive matrices with respect to a normal {k+1}-potent matrix are considered. First, we study the existence of the solutions of the associated inverse eigenvalue problem and present an explicit form for them. Then, when such a solution exists, an expression for the solution to the corresponding optimal approximation problem is obtained.
A data aggregation strategy based on wavelet for the internet of things
2017
The advent of emerging information and communication technologies, such as RFID, small size sensors and sensor networks, has made accessible a huge amount of information that requires sophisticated and efficient search algorithms to support queries on that data. In this paper we focus on the problem of aggregating data collected from these devices to efficiently support queries, inferences or statistics on them. In general, data aggregation techniques are necessary to efficiently collect information in a compact and cost-effective way. Some current solutions try to meet the above criteria, by exploiting different data aggregation techniques, for instance BitVector or Q_Digest. In this manus…
Nonadiabatic transitions between lambda-doubling states in the capture of a diatomic molecule by an ion
2008
The low-energy capture of a dipolar diatomic molecule in an adiabatically isolated electronic state with a good quantum number Hund’s coupling case a by an ion occurs adiabatically with respect to rotational transitions of the diatom. However, the capture dynamics may be nonadiabatic with respect to transitions between the pair of the -doubling states belonging to the same value of the intrinsic angular momentum j. In this work, nonadiabatic transition probabilities are calculated which define the -doubling j-specific capture rate coefficients. It is shown that the transition from linear to quadratic Stark effect in the ion-dipole interaction, which damps the T �1/2 divergence of the captur…
Drift time-specific collision energies enable deep-coverage data-independent acquisition proteomics.
2013
A data-independent acquisition (DIA) mass spectrometry approach, ultradefinition (UD)MSE, offers high reproducibility and improved proteome coverage over alternative DIA and data-dependent acquisition workflows. We present a data-independent acquisition mass spectrometry method, ultradefinition (UD) MSE. This approach utilizes ion mobility drift time-specific collision-energy profiles to enhance precursor fragmentation efficiency over current MSE and high-definition (HD) MSE data-independent acquisition techniques. UDMSE provided high reproducibility and substantially improved proteome coverage of the HeLa cell proteome compared to previous implementations of MSE, and it also outperformed a…
Strain localization and fracture in isotropic damaging materials: a novel augmented-finite element strategy
2022
The smoothed particle hydrodynamics method via residual iteration
2019
Abstract In this paper we propose for the first time an iterative approach of the Smoothed Particle Hydrodynamics (SPH) method. The method is widespread in many areas of science and engineering and despite its extensive application it suffers from several drawbacks due to inaccurate approximation at boundaries and at irregular interior regions. The presented iterative process improves the accuracy of the standard method by updating the initial estimates iterating on the residuals. It is appealing preserving the matrix-free nature of the method and avoiding to modify the kernel function . Moreover the process refines the SPH estimates and it is not affected by disordered data distribution. W…