Search results for "D algorithm"
showing 10 items of 327 documents
"Table 17" of "Search for a Heavy Neutral Particle Decaying to $e\mu$, $e\tau$, or $\mu\tau$ in $pp$ Collisions at $\sqrt{s}=8$ TeV with the ATLAS De…
2015
Cut flow for signal $\tilde{\nu}_{\tau}$ and Z' at 1TeV mass point.
A distributed minimum losses optimal power flow for islanded microgrids
2017
Abstract In this work, the minimum losses optimal power dispatch problem for islanded microgrids with distributed energy resources (DER) is solved by means of a distributed heuristic approach. Optimal power management is performed almost in real time, with a predefined schedule, i.e. every 5 min, and the solution is applied to generators when the current operating solution violates voltage or current constraints or when the current configuration produces too large power losses. The operating point of both inverter-interfaced generation units as well as rotating production systems can be modified simply using local information. The latter are voltage measurements and power injections or load…
A Dynamic Distributed Algorithm for Multicast Path Setup
2005
In the past few years, there has been a considerable work on multicast route selection techniques, with the aim to design scalable protocols which can guarantee an efficient use of network resources. Steiner tree-based multicast algorithms produce optimal trees, but they are prohibitively expensive. For this reason, heuristic methods are generally employed. Conventional centralized Steiner heuristics provide effective solutions, but they are unpractical for large networks, since they require a complete knowledge of the network topology. In this paper, we propose a new distributed approach that is efficient and suitable for real network adoption. Performance evaluation indicates that it outp…
An efficient distributed approach for dynamic multicast trees
2005
In this paper we present a distributed algorithm for constructing efficient multicast trees in large networks. The algorithm allows the set up of effective distribution trees using a coordination protocol among the network nodes. The algorithm has been implemented and extensively tested both in simulation, and on experimental networks. Performance evaluation indicates that our approach outperforms the state-of-the-art distributed algorithms for multicast tree setup, providing good levels of convergence time and communication complexity. Furthermore, we introduce a distributed technique for dynamically updating the multicast tree. The approach monitors the accumulated damage as nodes join or…
A Constructive Arboricity Approximation Scheme
2020
The arboricity \(\varGamma \) of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they approximate the arboricity as a value without computing a corresponding forest partition. This is because they operate on pseudoforest partitions or the dual problem of finding dense subgraphs.
Analyticity of a restricted formality
2020
International audience; The Kontsevich formality can be viewed as a non-linear map ℱ from the L∞ algebra of poly-vector fields on ℝd to the space of poly-differential operators. The space of the half-homogenous poly-vector fields is a sub-L∞ algebra. We prove here that the restriction of ℱto this subspace is weakly analytic.
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…
Scalar quark searches in $e^+ e^-$ collisions at $\sqrt{s}$ = 181-184 GeV
1998
Searches for scalar top, scalar bottom and degenerate scalar quarks have been performed with data collected with the ALEPH detector at LEP. The data sample consists of 57 pb^-1 taken at sqrt{s} = 181-184 GeV. No evidence for scalar top, scalar bottom or degenerate scalar quarks was found in the channels tilde{t} --> c chi, tilde{t} --> b l snu, tilde{b} --> b chi, and tilde{q} --> q chi. From the channel tilde{t} --> c chi a limit of 74 GeV/c^2 has been set on the scalar top quark mass, independent of the mixing angle. This limit assumes a mass difference between the stop and the chi in the range 10-40 GeV/c^2. From the channel tilde{t} --> b l snu the mixing-angle-indepen…
Search for pair production of the scalar top quark in muon+tau final states
2012
We present a search for the pair production of scalar top quarks ($\tilde{t}_{1}$), the lightest supersymmetric partners of the top quarks, in $p\bar{p}$ collisions at a center-of-mass energy of 1.96 TeV, using data corresponding to an integrated luminosity of {7.3 $fb^{-1}$} collected with the \dzero experiment at the Fermilab Tevatron Collider. Each scalar top quark is assumed to decay into a $b$ quark, a charged lepton, and a scalar neutrino ($\tilde{\nu}$). We investigate final states arising from $\tilde{t}_{1} \bar{\tilde{t}_{1}} \rightarrow b\bar{b}\mu\tau \tilde{\nu} \tilde{\nu}$ and $\tilde{t}_{1} \bar{\tilde{t}_{1}} \rightarrow b\bar{b}\tau\tau \tilde{\nu} \tilde{\nu}$. With no si…
Search for Pair Production of Supersymmetric Top Quarks in Dilepton Events frompp¯Collisions ats=1.96 TeV
2010
We present the results of a search for pair production of the supersymmetric partner of the top quark (the top squark (t) over tilde (1)) decaying to a b quark and a chargino (chi) over tilde (+/-)(1) with a subsequent (chi) over tilde (+/-)(1) decay into a neutralino (chi) over tilde (0)(1), lepton l, and neutrino nu Using a data sample corresponding to 2.7 fb(-1) of integrated luminosity of p (p) over bar collisions at root s = 1: 96 TeV collected by the CDF II detector, we reconstruct the mass of top squark candidate events and fit the observed mass spectrum to a combination of standard model processes and (t) over tilde (1)(t) over tilde (1). We find no evidence for (t) over tilde (1)(t…