Search results for "Tribute"

Chemical and Microbiological Characterization for PDO Labelling of Typical East Piedmont (Italy) Salami

2015

This study is focused on the characterisation of typical salami produced in Alessandria province (North West of Italy). Seventeen small or medium salami producers from this area were involved in the study and provided the samples investigated. The aim is double and consists in obtaining a screening of the characteristics of different products and following their evolution along ripening. The study involved five types of typical salami that were characterised for aroma components and nutritional features. This approach could provide a basis for a possible PDO or PGI label request. Principal Component Analysis and cluster analysis were used as multivariate statistical tools for data treatment…

Hopfield Neural Network - Based Approach for Joint Dynamic Resource Allocation in Heterogeneous Wireless Networks

2006

This paper presents a comprehensive approach to solve the problem of joint dynamic resource allocation (JDRA) in heterogeneous wireless networks using a Hopfield neural network (HNN). A generic formulation for packet services with delay constraints is proposed to decide the optimal bit rate and radio access technology (RAT) allocation. Some illustrative simulations results in a basic scenario are presented to evaluate performance of the proposed algorithm.

Joint Dynamic Resource Allocation for Coupled Heterogeneous Wireless Networks Based on Hopfield Neural Networks

2008

This paper proposes an algorithm to solve the problem of Joint Dynamic Resource Allocation in heterogeneous wireless networks. The algorithm is based on Hopfield Neural Networks to achieve fast and suboptimal solutions. The generic formulation is particularized and evaluated in an HSDPA and 802.11e WLAN coupled networks. Some illustrative simulations results are presented to evaluate the performance of the new algorithm as compared with other strategies. The obtained results confirm the validity of the proposal.

Distributed Consensus in Networks of Dynamic Agents

2006

Stationary and distributed consensus protocols for a network of n dynamic agents under local information is considered. Consensus must be reached on a group decision value returned by a function of the agents' initial state values. As a main contribution we show that the agents can reach consensus if the value of such a function computed over the agents' state trajectories is time invariant. We use this basic result to introduce a protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents' initial states. We demonstrate that the asymptotical consensus is reached via a Lyapunov approach. Finally we perfor…

Beating Darwin-Bragg losses in lab-based ultrafast x-ray experiments

2017

The use of low temperature thermal detectors for avoiding Darwin-Bragg losses in lab-based ultrafast experiments has begun. An outline of the background of this new development is offered, showing the relevant history and initiative taken by this work. (C) 2017 Author(s). Funding Agencies|Knut and Alice Wallenberg Foundation; ERC [226136]; Finnish Funding Agency for Technology and Innovation TEKES; Academy of Finland [260880]; NIST Innovations in Measurement Science program; DOE Office of Basic Energy Sciences

Efficient distributed average consensus in wireless sensor networks

2020

International audience; Computing the distributed average consensus in Wireless Sensor Networks (WSNs) is investigated in this article. This problem, which is both natural and important, plays a significant role in various application fields such as mobile agents and fleet vehicle coordination, network synchronization, distributed voting and decision, load balancing of divisible loads in distributed computing network systems, and so on. By and large, the average consensus' objective is to have all nodes in the network converged to the average value of the initial nodes' measurements based only on local nodes' information states. In this paper, we introduce a fully distributed algorithm to a…

Using hypothetical knowledge for driving inductive synthesis

1998

Study of the use of methanol-filled Er-doped suspended-core fibres in a temperature-sensing ring laser system

2013

We report on an experimental/numerical investigation into the use of methanol-filled Er-doped suspended-core fibres (SCFs) in temperature-sensing ring laser systems. We have adopted a ring laser configuration that includes an Er-doped SCF as a temperature-dependent attenuator (TDA) with a step-index Er-doped fibre (EDF) as the laser active medium. The laser performance dependence on the temperature was measured both in continuous wave (CW) and transient regimes. CW laser output power and build-up time values are compared with those of similar laser systems based on other types of Er-doped PCFs or using other laser configurations. A notable variation of 0.73% °C−1 was achieved in CW operatio…

Construction of Disjoint Virtual Backbones for Wireless Sensor Networks

2020

A wireless sensor network is a wireless network of sensors aimed at monitoring physical events. It has ingratiated itself into almost all areas of human endeavors. Data dissemination in these networks is quite challenging and is generally accomplished by flooding. But flooding introduces broadcast storm problem due from implosion and overlap. To overcome this, topology management can prescribe a virtual backbone network to which routing is confined. In this paper we propose an algorithm that constructs multiple disjoint virtual backbone networks, using only nodes' locations. The disjointedness makes routing more robust and the network exploitation energy efficient. Simulations show our algo…

The Network Balance Realized by Routing Organization System

2011

In the presented paper, we propose to exploit routing organization for the purpose of managing network resources. According to our assumptions, we have the same quantity of materials, objects, tokens, tools etc. at our disposal in every node of the network. During network operation we must distribute resources between these nodes. It should be carried out as instantaneously and as economically as possible. Multi-Agent Systems are also used to deal with this kind of tasks and the centralised algorithms presented in this paper are to be used to measure the efficiency of the distributed MAS solution. From the logistical point of view, we have a sequence of stages with different states of token…