Search results for "PROB"

The laparoscopic approach to Acute Mesenteric Ischemia is today unclear and less debated (AMI). There are in fact no clinical evidences on this parti…

2016

The laparoscopic approach to Acute Mesenteric Ischemia is today unclear and less debated (AMI). There are in fact no clinical evidences on this particular focus and only few articles can be found in several databases (pubmed, cochrane library, etc.), and the problem concerns both diagnostic and therapeutic utilization of the procedure. These considerations were already taken into account in 2012 EAES guidelines where the Grade of Recommendation (GoR) of laparoscopy in AMI was low in both diagnostic and therapeutic aspects. According to the new Oxford Classification [1], the use of laparoscopy in patients with suspicious or diagnosed AMI presents a weak GoR.

Sulfur isotope ratio measurements of individual sulfate particles by NanoSIMS

2008

Abstract The sulfur isotopic compositions of barite (BaSO4), anhydrite (CaSO4), gypsum (CaSO4·2H2O), mascagnite ((NH4)2SO4), thenardite (Na2SO4), boetite (K2SO4), epsomite (MgSO4·7H2O), magnesium sulfate (MgSO4·xH2O) and cysteine (an amino acid) were determined with a Cameca NanoSIMS 50 ion microprobe employing a Cs+ primary ion beam and measuring negative secondary ions. This ion microprobe permits the analysis of sulfur isotope ratios in sulfates on 0.001–0.5 ng of sample material, enabling the analysis of individual S-bearing particles with diameters as small as 500 nm. The grain-to-grain reproducibility of measurements is typically 5‰ (1σ) for micron-sized grains,

Information dynamics: Temporal behavior of uncertainty measures

2008

We carry out a systematic study of uncertainty measures that are generic to dynamical processes of varied origins, provided they induce suitable continuous probability distributions. The major technical tool are the information theory methods and inequalities satisfied by Fisher and Shannon information measures. We focus on a compatibility of these inequalities with the prescribed (deterministic, random or quantum) temporal behavior of pertinent probability densities.

Distributed Data Clustering via Opinion Dynamics

2015

We provide a distributed method to partition a large set of data in clusters, characterized by small in-group and large out-group distances. We assume a wireless sensors network in which each sensor is given a large set of data and the objective is to provide a way to group the sensors in homogeneous clusters by information type. In previous literature, the desired number of clusters must be specified a priori by the user. In our approach, the clusters are constrained to have centroids with a distance at least ε between them and the number of desired clusters is not specified. Although traditional algorithms fail to solve the problem with this constraint, it can help obtain a better cluste…

Challenging aspects in Consensus protocols for networks

2008

Results on consensus protocols for networks are presented. The basic tools and the main contribution available in the literature are considered, together with some of the related challenging aspects: estimation in networks and how to deal with disturbances is considered. Motivated by applications to sensor, peer-to- peer, and ad hoc networks, many papers have considered the problem of estimation in a consensus fashion. Here, the unknown but bounded (UBB) noise affecting the network is addressed in details. Because of the presence of UBB disturbances convergence to equilibria with all equal components is, in general, not possible. The solution of the epsiv-consensus problem, where the states…

Network Centralities and Node Ranking

2017

An important problem in network analysis is understanding how much nodes are important in order to “propagate” the information across the input network. To this aim, many centrality measures have been proposed in the literature and our main goal here is that of providing an overview of the most important of them. In particular, we distinguish centrality measures based on walks computation from those based on shortest-paths computation. We also provide some examples in order to clarify how these measures can be calculated, with special attention to Degree Centrality, Closeness Centrality and Betweennes Centrality.

A study on graph representations for genetic programming

2020

Graph representations promise several desirable properties for Genetic Programming (GP); multiple-output programs, natural representations of code reuse and, in many cases, an innate mechanism for neutral drift. Each graph GP technique provides a program representation, genetic operators and overarching evolutionary algorithm. This makes it difficult to identify the individual causes of empirical differences, both between these methods and in comparison to traditional GP. In this work, we empirically study the behavior of Cartesian Genetic Programming (CGP), Linear Genetic Programming (LGP), Evolving Graphs by Graph Programming (EGGP) and traditional GP. By fixing some aspects of the config…

Probabilistic versus deterministic memory limited learning

1995

A model of adaptive decision-making from representation of information environment by quantum fields

2017

We present the mathematical model of decision making (DM) of agents acting in a complex and uncertain environment (combining huge variety of economical, financial, behavioral, and geo-political factors). To describe interaction of agents with it, we apply the formalism of quantum field theory (QTF). Quantum fields are of the purely informational nature. The QFT-model can be treated as a far relative of the expected utility theory, where the role of utility is played by adaptivity to an environment (bath). However, this sort of utility-adaptivity cannot be represented simply as a numerical function. The operator representation in Hilbert space is used and adaptivity is described as in quantu…

Statistically validated networks in bipartite complex systems.

2011

Many complex systems present an intrinsic bipartite nature and are often described and modeled in terms of networks [1-5]. Examples include movies and actors [1, 2, 4], authors and scientific papers [6-9], email accounts and emails [10], plants and animals that pollinate them [11, 12]. Bipartite networks are often very heterogeneous in the number of relationships that the elements of one set establish with the elements of the other set. When one constructs a projected network with nodes from only one set, the system heterogeneity makes it very difficult to identify preferential links between the elements. Here we introduce an unsupervised method to statistically validate each link of the pr…