query_halid stringlengths 8 12 | query stringlengths 3 104k | query_year stringdate 1970-01-01 00:00:00 2025-01-01 00:00:00 | query_domain listlengths 1 7 | query_affiliations listlengths 1 298 | query_authorids listlengths 1 174 | pos_halid stringlengths 8 12 | positive stringlengths 3 118k | pos_year stringdate 1970-01-01 00:00:00 2025-01-01 00:00:00 | pos_domain listlengths 1 10 | pos_affiliations listlengths 1 298 | pos_authorids listlengths 1 174 | neg_halids stringlengths 8 12 | negative stringlengths 3 65k | neg_year stringdate 1966-01-01 00:00:00 2025-01-01 00:00:00 | neg_domain listlengths 1 7 | neg_affiliations listlengths 1 484 | neg_authorids listlengths 1 196 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
01745246 | . , |S|}. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | G (2) =< {1, 2}, {S i } i∈I , {u i } i∈I >, (1)
where:
• I = {1, 2} is the set of players (two players), that are the network nodes;
• S i is the set of pure strategies of player i ∈ I, which is the same for all the players, corresponding to S={C, NC}; • u i is the utility of player i ∈ I, that depends on its behavior and that of its opponent. To demonstrate the utility formulation, we consider the case of a pair of nodes from the network, within which a node may act as a sender and a relay (and vice versa). | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 03024626 | In the SIMPLEDATAFLOWMODEL, the memory used at a given time is equal to the sum of the sizes of the active output data, which depends solely on the set of nodes that have been executed or initiated. Therefore, the maximal peak memory of a DAG is equal to the maximum weight of a topological cut. | 2020 | [
"info"
] | [
"179718",
"35418",
"179718",
"35418",
"179718",
"35418",
"409747",
"3102"
] | [
"170697",
"739318",
"8135"
] |
01745246 | In the first case, p = 0, this gives s h = δ b δ b +δr . We can solve for the condition when
Ū > 0 ⇒ -q(εq(λ -1)(1 -s h ) -s h ) > 0 ⇒ (-εq(λ -1)(1 -s h ) + s h ) > 0 ⇒ (-εq(λ -1)δ r + δ b ) > 0 ⇒ ε < δ b δ r q(λ -1) . | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | Thus, the following result:
Ū = (1 -ε(1 -q))(λ -1),
we have λ > 1 ⇒ Ū > 0. This implies, according to definition 1, that p = 1 is an ESS ε = 1 as an invasion barrier. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 00256503 | A theoretical analysis proves the noise tolerance of our algorithm, by showing that the solution of NSVM is close to the optimal classifier. Numerical simulations on a noisy problem on which CSVM fails, and on which our algorithm performs well, evidences the good behavior of our learning strategy. | 2008 | [
"info"
] | [
"862",
"862",
"862"
] | [
"838988",
"5004",
"844150"
] |
01745246 | (6)
Hawks have the same utility function, but don't have a reputation constraint, therefore, the corresponding expected payoff is given by the formula [START_REF] Félegyházi | Game Theory in Wireless Networks: A Tutorial[END_REF]. U (H, p) = λps h . | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | The replicator dynamics is given by ( 12) [START_REF] Jonker | Evolutionary Stable Strategies and Game Dynamics[END_REF]:
ṗi = p i [U (i, p) - |S| j=1 p j U (j, p)], i ∈ {1, . . | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 03921373 | Figure 1). Additionally, all attack vectors, safeguards, and bibliographical references can also be displayed in tabular form on dedicated pages. | 2022 | [
"info"
] | [
"491189",
"301537",
"301537",
"1067790",
"491189",
"301537"
] | [
"1164245",
"1972",
"1211374"
] |
01745246 | Game theory has been a vital tool in literature to study the behavior of self-serving individuals in serval domains including MANETs. In [START_REF] Félegyházi | Game Theory in Wireless Networks: A Tutorial[END_REF], [START_REF] Félegyházi | Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks[END_REF], [START_REF] Jaramillo | A Game Theory Based Incentivize Cooperation in Wireless Ad hoc Networks[END_REF], etc. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | Therefore, it is necessary to implement some mechanism to avoid selfish behavior and to promote cooperation. In this paper, we propose a simple quid pro quo based reputation system, i.e., nodes that forward gain reputation, but lose more reputation if they do not forward packets from cooperative users (determined based on reputation), and lose less reputation when they chose to not forward packets from non-cooperative users. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01053031 | 7 Figure 7. Approach Overview
Figure 8 . | 2014 | [
"info"
] | [
"56012",
"82140",
"236761",
"236761"
] | [
"743267",
"18597",
"14539",
"840196"
] |
01745246 | (12)
The system [START_REF] Tang | When Reputation Enforces Evolutionary Cooperation in unreliable MANETs[END_REF] describes the replication process in continuous time. It gives the percentage of individuals newly playing strategy s i in the next period, it depends on the initial value p i (t 0 ). | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | On the other hand, it would be better to model the interactions among all the N nodes and not just the two-player case. To deal with this, we propose to introduce evolutionary game theory, where the dynamical evolution of game strategies is studied through pairwise interactions. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 03794630 | A BMS (a.k.a., building automation system) is one of the systems that will install IoT devices and sensors. A BMS includes a power control system, water and gas supply system, elevator system, and fire alarm system. | 2020 | [
"info"
] | [
"469117",
"469117",
"25887",
"25887"
] | [
"1169639"
] |
01745246 | Numerical analysis is provided to study the resulting equilibria and to illustrate how the proposed model performs compared to traditional models. Introduction
A mobile ad hoc network (MANET) is a wireless multi-hop network formed by a set of mobile independent nodes. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | (9)
Note that the introduction of s h < 1 is one of the main novelties of this paper, which can be different from s h = 1 as defined in the traditional forwarding game payoff [START_REF] Félegyházi | Game Theory in Wireless Networks: A Tutorial[END_REF], [START_REF] Félegyházi | Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks[END_REF], [START_REF] Jaramillo | A Game Theory Based Incentivize Cooperation in Wireless Ad hoc Networks[END_REF], [START_REF] Seredynski | Evolutionary Game Theoretical Analysis of Reputation-based Packet Forwarding in Civilian Mobile Ad Hoc Networks[END_REF], [START_REF] Tang | When Reputation Enforces Evolutionary Cooperation in unreliable MANETs[END_REF], etc. where the cooperative nodes forward packet all the time without making distinction among the opponent nodes that can be cooperative, belonging to D, or non-cooperative, belonging to H. Furthermore, the proposed reputation system is simpler and can be defined as a constraint when nodes take decision purely based on the reputation class of the packet source node. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01147732 | In subsection 5.3 we show the performance gain obtained by using prediction. Finally in 5.4 we measure the quantity of errors introduced by the predictions. | 2015 | [
"info"
] | [
"117606",
"210616",
"117606",
"210616",
"117606",
"210616"
] | [
"1272",
"15912"
] |
01745246 | The aforementioned works rely on incentive mechanisms, which has been proved to improve nodes cooperation. However, implementing such solutions often result in a large computational complexity during the game. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | Using the relation [START_REF] Tang | When Reputation Enforces Evolutionary Cooperation in unreliable MANETs[END_REF], the replicator dynamics of the proposed game is:
ṗ = p(1 -p)(p(λ -1)(1 -s h ) -s h ). ( 13
)
For the evolutionary game G, we have the following results. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01821035 | • Performed different experiments using a real dataset and different recommendation libraries with the results validating our approach. The rest of the paper is organized as follows: Section 2 provides the required background, section 3 is a comparison between recommendation libraries, real data and different settings, section 4 delivers the proposed approach and section 5 contains the conclusion and future work parts. | 2018 | [
"info"
] | [
"209121",
"209121",
"536336",
"365626",
"467170"
] | [
"1033462",
"1033463",
"1033464"
] |
01745246 | Thus, global cooperation could be guaranteed after a given time. Whereas, when the game does not include the reputation constraint, the population converges to the strategy non-cooperation, which is the unique evolutionary stable strategy of the game, regardless of the initial condition and game settings. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | We assume that even a cooperative node, i.e., the Dove class, does not relay packets all the time. The doves have a mixed strategy to relay messages, and it relays messages from other doves with probability s d , and from hawks with a probability s h , i.e., the action C is chosen with different probabilities depending on the opponent's class. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 03672510 | Sound and complete axiomatizations of the logics presented in the paper are given, as well as some complexity results for the satisfiability problem. Introduction
The aim of this article is to propose a modal logic framework that allows to reason about epistemic games in strategic form. | 2010 | [
"info"
] | [
"400549",
"400549"
] | [
"741967",
"15714"
] |
01745246 | However, the NE of the packet forwarding game is inefficient, corresponding to drop all the time, and provides for players 0 as utility. Thus, to overcome this problem we propose to add to the game (1) a reputation model, that defines the reward and the cost in terms of reputation according to the node decision, cooperative or non-cooperative. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | Effectively, we have demonstrated using evolutionary game theory concepts that, global cooperation in the network can be achieved under some conditions we stated related to the game settings with a low computational complexity. Finally, through simulations, we have shown that in terms of the number of forwarded packets in the MANET, the proposed game model provides significant gains over the game model where the cooperative nodes forward packet regardless of the opponent's behavior. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 03963674 | For any intersection, we will add as few as possible virtual entries and exits so that entries and exits will be alternated. We will have at most n = 2(n e +n s -1) such points (half entries and exits). | 2022 | [
"info"
] | [
"21189"
] | [
"1221387",
"1121626",
"183516",
"847476"
] |
01745246 | U (H, p) = λps h . (7)
Thus, the expected payoff of any individual is given by (8):
U (p, p) = pU (D, p) + (1 -p)U (H, p), (8)
where p is the population profile. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | As a smaller reputation is lost by not forwarding packets from selfish users (classified by the reputation system), cooperative users will effectively forward the packets from other cooperative users and may avoid forwarding packets from selfish users. Effectively, we have demonstrated using evolutionary game theory concepts that, global cooperation in the network can be achieved under some conditions we stated related to the game settings with a low computational complexity. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01406561 | Browsing photographs on tabletops was explored by Hinrichs et al. [START_REF] Hinrichs | Evaluating the effects of fluid interface components on tabletop collaboration[END_REF] in a fluid interface which automatically reorientates pictures as they move circularly around the table. | 2009 | [
"info"
] | [
"303510",
"303510",
"190659",
"303510",
"190659",
"190659",
"303510"
] | [
"2825"
] |
01745246 | 1. Evolutionary dynamics of the Doves, nodes that play the strategy 'Cooperation' with a proability s * h in the proposed game model, and previous packet forwarding game model where s h = 1. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | In this paper, we model the nodes interaction in a MANET as an evolutionary game by proposing a new formulation of the packet forwarding and reputation model. We introduce a simple reputation system with a quid pro quo basis, wherein, reputation is gained by forwarding packets and is lost when refusing to forward. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01080676 | The equation 1 allows to estimate the N p pixels positions from the control points coordinates. In this paper, our objective is to interactively find the positions of the control points such that the region of interest keeps being tracked at any time thanks to the intensity variation of each pixel. | 2014 | [
"info"
] | [
"435003",
"2520",
"435003",
"210616",
"301327",
"435003",
"435003",
"2520"
] | [
"2294",
"762879",
"772597"
] |
01745246 | The aim is to motivate node cooperation using a simple and efficient mechanism. As a smaller reputation is lost by not forwarding packets from selfish users (classified by the reputation system), cooperative users will effectively forward the packets from other cooperative users and may avoid forwarding packets from selfish users. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | 3 represents the results for the following game settings: λ = 3, δ r = 3 and δ b = 1. It clearly shows a direct influence, because the number of forwarded packets is strongly linked to the cooperative nodes proportion in packet forwarding. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 04170992 | We also define the most frequent module for each state-action pair (s, a): Let m k (s, a) be a module with the highest visit count until episode k,
m k (s, a) ∈ arg max m N (m) t k (s, a), (13)
so that for this module, the empirical observations are the most accurate, and we can relate the number of observations for this module to the total number of visits N t k (s, a) of the pair (s, a) with the inequality:
N (m k (s,a)) t k (s, a) ≥ 1 τmix N t k (s,
p(m) k (s ′ |s, a) := t k -1 t=1 1 {st=s,at=a,st+1=s ′ ,mt=m} 1 {t / ∈Φ} max 1, N (m) t k (s, a) (14) r(m) k (s, a) := p(m) k (s + 1|s, a)γ reject + γ hold S -s U , (15)
where Φ is the set of the time steps in the ramping phases defined in the algorithm. M k is the confidence set of MDPs whose rewards r and transitions p satisfy:
∀(s, a), r(s, a) - r(m k (s,a)) k (s, a) ≤ δ max 2 log (2At k ) max 1, N (m k (s,a)) t k (s, a) ; (16)
∀(s, a), ∥p(• | s, a) - p(m k (s,a)) k ( • | s, a) ∥ 1 ≤ 8 log (2At k ) max{1, N (m k (s,a)) t k (s, a)} . | 2023 | [
"info"
] | [
"1043327",
"1043327",
"1042703"
] | [
"963054",
"11644",
"1112224"
] |
01745246 | Definition 2 (Replicator dynamics). The replicator dynamics is given by ( 12) [START_REF] Jonker | Evolutionary Stable Strategies and Game Dynamics[END_REF]:
ṗi = p i [U (i, p) - |S| j=1 p j U (j, p)], i ∈ {1, . | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | However, implementing such solutions often result in a large computational complexity during the game. We would like to find an answer to the following question, "Is it possible to achieve global cooperation in packet forwarding by a simple and natural way?". | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 02111559 | System Scheme Design
The dynamic ion flux detection equipment adopts the portable scheme design to develop original signal acquisition and modulation module, signal gathering and motion control module, macro 3D automatically controlled platform, micro digital imaging system, electrostatic shielding coating, ion-selective microelectrode design and preparation technique, and carried out the software design and development, finally realize the system integration and application after modulation(Fig. 1). | 2017 | [
"info"
] | [
"440572",
"440572",
"440572",
"440572",
"440572",
"440572",
"440572",
"440572"
] | [
"972300",
"972302",
"1046227",
"1046229",
"1046230",
"1046231",
"1046232",
"988232"
] |
01745246 | 1 Fig. 1 . | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | (4)
This must be maximized over s d , s h while maintaining a positive reputation, i.e.,
E[R i (t + 1) -R i (t)] ≥ 0 or p(s d δ r -(1 -s d )δ g ) + (1 -p)(s h δ r -(1 -s h )δ b ) ≥ 0. ( 5
)
Therefore for a given population share of doves p, we can find the strategy of doves by solving the following optimization problem. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01909478 | Therefore, the 2LQR code copy sensitivity is not affected by the suggested quality improvement process. INTRODUCTION
The increasing use of numerical documents does not decrease the popularity and usefulness of printed documents. | 2018 | [
"info"
] | [
"17835",
"388375",
"388375",
"388375",
"388375"
] | [
"177740",
"1276825",
"21713",
"6353"
] |
01745246 | These nodes will have a strategy s such that on average their reputation gain is positive. Let us denote the dove population share (fraction of users who are in the dove class) by p. The population share of hawks will simply be given by 1 -p.
Utility maximization
In this subsection, we present how reputation system is integrated in the packet forwarding game in order to improve game outcomes and avoiding the noncooperative situation. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | 2 presents the results of both cases s h = s h and s h = 1. From these figures, we observe that the utilities evolve over time in the same way that the proportion of the considered population, corresponding to D in that case. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 02431955 | Both curves involve a non-linear transform factor C = 3. Figure 3 :
3 Figure 3: 2D visual synthetic examples, including 1 to 4 sites (top to bottom).Note that when neighbor sites have same color, the image might appear to have been generated with less sites than it actually has. | 2019 | [
"info"
] | [
"486840",
"2544"
] | [
"181186",
"836537"
] |
01745246 | For ease of notation the reputation of a user i ∈ I is given by R i (t), and if R i (t) > 0 the node has a good reputation and otherwise bad reputation. The change in reputation is given by:
R i (t + 1) = R i (t) + d i (t)δ r -(1 -d i (t))(δ g 1(R j > 0) + δ b 1(R j ≤ 0)), (3)
where: d i (t) ∈ {0, 1} is the decision to relay or not at time t. 0 corresponds to the action NC, and 1 to C. j is a random variable indicating the sender requesting i to relay. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | That means the game is played taking into account the reputation, which we show can be interpreted as a constraint on the strategy space, while the nodes aim to maximize their utility function. Reputation model
We assume that there is a reputation system introduced in order to discourage selfish behavior and reward cooperative behavior by separating these two classes of nodes. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 00535816 | . . | 2010 | [
"info"
] | [
"2466",
"90011",
"90011"
] | [
"739520"
] |
01745246 | Here, the authors used the prison's dilemmabased model [START_REF] Félegyházi | Game Theory in Wireless Networks: A Tutorial[END_REF] and the aim was to implement several strategies in the game and to evaluate performance, by observing their evolution over time. The aforementioned works rely on incentive mechanisms, which has been proved to improve nodes cooperation. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | In Sec. 2 we formulate the reputation and game models. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 02881889 | s -1 . In TESL, this would be expressible as a linear tag relation as previously, or equivalently with a differential equation between speed and time:
tag relation (d speed-KT-DECEL) = -3.0 * (d time-S)
Finally, distance during deceleration relates to the following tag relation:
tag relation (d distance-M-DECEL) = speed-MPS-DECEL * (d time-S)
To run our specification with a concrete example, let us assume that takeoff rejection has been declared at 20 s. Figure 6 illustrates this process where the aircraft has approximately reached 520 m at 20 s. Finally, the aircraft reaches speed zero at 50 s with a final run distance of approximately 1159 m.
Remark. | 2020 | [
"info"
] | [
"1050003",
"1050003",
"1050003"
] | [
"4636",
"5502"
] |
01745246 | p(s d δ r -(1 -s d )δ g ) + (1 -p)(s h δ r -(1 -s h )δ b ) ≥ 0 ⇒ pδ r + (1 -p)(s h δ r -(1 -s h )δ b ) ≥ 0 ⇒ pδ r + (1 -p)(s h (δ r + δ b ) -δ b ) ≥ 0 ⇒ s h ≥ (1-p)δ b -pδr (δ b +δr)(1-p)
. Thus, we have:
s h = max (1 -p)δ b -pδ r (δ b + δ r )(1 -p) , 0 . | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | Accounting for channel fading due to path loss or small-scale fading will therefore, be a relevant extension of this work. These considerations show that reputation model parameters must be carefully designed in practice. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 00942606 | Here, we shall discuss three of them. CUDA [START_REF]Compute Unified Device Architecture Programming Guide[END_REF] is a programming language which allows users to exploit the power of the graphics processing units (GPU) by using GPU-accelerated libraries. | 2013 | [
"info"
] | [
"122081"
] | [
"770666"
] |
01745246 | The aim is to motivate node cooperation using a simple and efficient mechanism. As a smaller reputation is lost by not forwarding packets from selfish users (classified by the reputation system), cooperative users will effectively forward the packets from other cooperative users and may avoid forwarding packets from selfish users. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | Several works in the literature provide solutions based on incentive mechanisms, such as those based on a credit concept [START_REF] Buttyán | Enforcing Service Availability in Mobile Ad-Hoc WANs[END_REF], [START_REF] Buttyán | Stimulating Cooperation in Self-Organizing Mobile Ad Hoc Networks[END_REF], [START_REF] Krzesinski | Promoting Cooperation in Mobile Ad Hoc Networks[END_REF] etc., whose idea being that nodes pay for using some service and they are remunerated when they provide some service (like packet forwarding). Others like [START_REF] Jianl | HEAD: A Hybrid Mechanism to Enforce Node Cooperation in Mobile Ad Hoc Networks[END_REF], [START_REF] Li | Game-Theoretic Analysis of Cooperation Incentive Strategies in Mobile Ad Hoc Networks[END_REF] use reputationbased mechanisms to promote cooperation. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 03520989 | The first tier message can then be extracted from O w in the clear domain. EXPERIMENTAL RESULTS
Performance on a large dataset
We tested our method on the Princeton dataset [START_REF] Shilane | The Princeton shape benchmark[END_REF] which consists of 380 different 3D objects. | 2021 | [
"info"
] | [
"388375",
"468505",
"388375",
"388375",
"468505"
] | [
"1140761",
"6353",
"21600",
"1261611"
] |
01745246 | (15)
Thus, from the definition 1 we conclude that p = 0 is an ESS with ε = min δ b δrq(λ-1) , 1 as an invasion barrier. Note that p = 0 is an ESS only if the population share of D decreases, and that of H increases, i.e., the replicator dynamics is negative or ṗi < 0. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | Firstly, setting δ b = 0 will completely discourage D from forwarding packets from H class, which may also include new users to the MANET, thereby discouraging new users as they might be unable to send their packets without increasing their reputation. Secondly, note that D may not always forward packets from D as in practice the channel conditions between the nodes also play a big role in determining the resource cost and therefore the utility gained by forwarding (which we have not accounted for in this work). | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01664629 | 4 Figure 4. Performance of HLPT with 180 000 instances for each pair of generation method and cost coefficient of variation V . | 2017 | [
"info"
] | [
"179718",
"866",
"866",
"866"
] | [
"779960",
"748889"
] |
01745246 | . . | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | A key feature about MANETs is that they are self organizing and are without any established infrastructure. The absence of infrastructure implies that all networking functions, such as packet forwarding, must be performed by the nodes themselves [START_REF] Basagni | Mobile ad hoc networking[END_REF]. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 00391982 | It follows that max
x∈R d u(t, x) = 0, ∀t > 0. step 4 (supp n(t, •) ⊂ {u(t, •) = 0}) Assume that u(t 0 , x 0 ) = -a < 0. Since u ǫ are uniformly contin- uous in a small neighborhood of (t 0 , x 0 ), (t, x) ∈ [t 0 -δ, t 0 +δ]×B(x 0 , δ), we have u ǫ (t, x) ≤ -a 2 < 0 for ǫ small. | 2009 | [
"info"
] | [
"24561",
"25",
"25"
] | [
"1242",
"744168",
"739446"
] |
01745246 | Thus, the proposed model provides better results, it promotes cooperation among nodes. Indeed, in order to show the influence level of these results on network performance, we consider a network composed of 50 nodes, randomly placed in surface of 1000m × 1000m, with a transmission range equals to 150m, and plot normalized number of forwarded packets within a network, using the proposed game model with constraint, and that introduced in previous works [START_REF] Félegyházi | Game Theory in Wireless Networks: A Tutorial[END_REF], [START_REF] Félegyházi | Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks[END_REF], [START_REF] Jaramillo | A Game Theory Based Incentivize Cooperation in Wireless Ad hoc Networks[END_REF], [START_REF] Seredynski | Evolutionary Game Theoretical Analysis of Reputation-based Packet Forwarding in Civilian Mobile Ad Hoc Networks[END_REF], etc. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | Thus, to overcome this problem we propose to add to the game (1) a reputation model, that defines the reward and the cost in terms of reputation according to the node decision, cooperative or non-cooperative. On the other hand, it would be better to model the interactions among all the N nodes and not just the two-player case. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 02544556 | Procedure
The study consisted of the following phases:
(1) Manipulation phase: Participants were welcomed and signed the consent form. The participants were given a role card outlining their tasks, as well as the voting information materials. | 2019 | [
"info"
] | [
"182755",
"150665",
"300723",
"560778",
"150665"
] | [
"1068067",
"1053593",
"1068068"
] |
01745246 | Thus, the players' utility can be represented by a payoff matrix as given by [START_REF] Buttyán | Enforcing Service Availability in Mobile Ad-Hoc WANs[END_REF]. A = C NC C λ -1 -1 NC λ 0 , (2)
where: λ > 0 is a coefficient representing the benefit associated to successfully sending a packet while spending a unit of energy. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | defined without any constraint and assuming that the cooperative nodes forward all the time, i.e., s h = 1. We assume that all the nodes need to send 10 packets to a given destination. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 00872201 | The fact that the Application Category performs slightly better also shows that it is not true that: "The more features are considered, the better the achieved classification accuracy is". Third, the single features achieving the best results are the accessibility object name and the window title. | 2010 | [
"info"
] | [
"216414",
"392741",
"216414",
"220278"
] | [
"946579"
] |
01745246 | In the first case, p = 0, this gives s h = δ b δ b +δr . We can solve for the condition when
Ū > 0 ⇒ -q(εq(λ -1)(1 -s h ) -s h ) > 0 ⇒ (-εq(λ -1)(1 -s h ) + s h ) > 0 ⇒ (-εq(λ -1)δ r + δ b ) > 0 ⇒ ε < δ b δ r q(λ -1) . | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | Next, we use the definition 1, to prove the results stated in Theorem 1 corresponding to the invasion barrier. Let x = (1 -ε)p + εq, and Ū = U (p, x) -U (q, x). | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01514633 | However, exploring all returned URLs requires significant effort and attention, especially for mobile users. In such a scenario, it would be more beneficial, for the user, if information retrieval system returns a concise summary to the query that integrates several relevant fragments of information in an intelligible way. | 2016 | [
"info"
] | [
"1001827",
"1001827",
"217752"
] | [
"1090320",
"1188423"
] |
01745246 | 3. Normalized number of forwarded packets for an Ad hoc network of 50 nodes, in the proposed game model and previous packet forwarding game model, where s h = 1. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01745246 | 2) The curve in dashed line corresponds to results provided by putting s h = 1, meaning that cooperative nodes forward all the time, which corresponds to the previous packet forwarding game introduced in [START_REF] Félegyházi | Game Theory in Wireless Networks: A Tutorial[END_REF], [START_REF] Félegyházi | Nash Equilibria of Packet Forwarding Strategies in Wireless Ad Hoc Networks[END_REF], [START_REF] Jaramillo | A Game Theory Based Incentivize Cooperation in Wireless Ad hoc Networks[END_REF], [START_REF] Seredynski | Evolutionary Game Theoretical Analysis of Reputation-based Packet Forwarding in Civilian Mobile Ad Hoc Networks[END_REF], etc. It is seen that using our new formulation, which integrates a reputation mechanism as a constraint, the system could converge towards a cooperative state, by carefully choosing the game settings. | 2017 | [
"info"
] | [
"93067",
"185180",
"1289",
"93067",
"185180"
] | [
"779851",
"5857",
"1068236",
"936663"
] | 01677613 | Our fault tolerance framework Fig. 2. interval check
Fig. | 2017 | [
"info"
] | [
"300829",
"463159",
"486106",
"463159",
"300829"
] | [
"1023171"
] |
01745270 | These input and output points to the convex hull of the area A j are denoted by i j and o j respectively. We regroup these points in the following set
C j = {s, i 1 , i 2 , • • • , i j , o j , o j-1 , • • • , o 1 ,
g} and index them as follows:
c j 0 = s, c j n = i n , for n = 1, 2, • • • , j, c j n = o 2j+1-n , for n = j + 1, j + 2, • • • , 2j, c j 2j+1 = g. (15)
where s and g are the starting and goal points for the robot. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | The trajectory T 4 spends a larger time in the area A 2 in order to increase the average data rate and therefore increase the probability of success. But by doing so the robot has to move quicker when it gets out from A 2 in order to reach g in time. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 03657715 | Strategy -Strategy refers to the suggested measures that are applied to effect change within an organisation to improve its overall levels of InfoSec. These ap-proaches may include the implementation of formal plans of action, such as InfoSec policies and guidelines as well as the structured approach of a framework. | 2020 | [
"info"
] | [
"559341",
"559341"
] | [
"1133726"
] |
01745270 | ( 18
)
From the definition of i n and o n we know that they lie in a circle of radius r n which can be computed from the p.m.f. of R (Γ (p(kT ))). | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | Therefore we know {r j n } 2j n=1 and as a consequence the only unknowns to uniquely determine C j are the angles 5 {φ j n } 2j n=1 , where the φ j n is the angle of c j n respect to the AP. Now, the optimum control law u * j (t) takes the robot from c j 0 up to c j 2j+1 in ascending order through each point in C j . | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01084946 | At the end of this section we give an application to shared decryption. Eventually, we compare our new cryptosystem with existing schemes and discuss the (im)possibility to move our scheme into a prime-order setting. | 2012 | [
"info"
] | [
"27730",
"388984"
] | [
"958315",
"1119537"
] |
01745270 | 2 we first note that the period with highest velocity takes place from t = 0 until t = τ 1 this is because the robot is rushing to get out from A 0 to start transmitting as many bits as possible. Then we also observe that the minimum velocity occurs when the robot reaches the inner most area of the trajectory (in this case A 2 ). | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | Problem statement
The objective of the robot is to depart from a starting point s to a goal point g within a time t f and transmit the all the content from its buffer to the AP. The desired trajectory is such that it consumes little mechanical energy from the robot and also allows the robot the transmit all the content of the buffer quickly. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 04276324 | ], and can edit the ontologies accordingly to address the comments that users have stored in BioPortal. Similarly, if ontology developers add their own notes when developing an ontology in a tool such as Collaborative Protégé (e.g., providing references for a class definition, or explaining a design decision), they can choose to export their notes and make them visible as marginal notes in BioPortal. | 2008 | [
"info"
] | [
"58498",
"58498",
"58498",
"58498",
"58498",
"58498",
"58498",
"58498",
"58498",
"58498"
] | [
"3067",
"849093"
] |
01745270 | This adaptation mechanism is outside the scope of this article and we will only focus on the design of the reference trajectory. Future works will address the online adaptation mechanism. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | However, in [START_REF] Licea | Trajectory planning for energy-efficient vehicles with communications constraints[END_REF], we did not account for wireless channel fading and in fact assumed that the wireless signal strength is determined purely based on the path loss. In this work, we want to relax this strong assumption and account for small-scale fading and shadowing effects. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 04222148 | This environment is made of two categories of features:
• Known features:
-The map information, including traffic light, -Static objects such as traffic cones and barriers -Dynamic objects such as neighboring vehicles, traffic cones or pedestrians, which we will consider as other agents evolving in the simulated environment
• Learned features:
-Estimated future trajectories of other agents given by the NN prediction. C. MCTS design and tree steps
Our MCTS is based on a kinematic bicycle model of the vehicle. | 2023 | [
"info"
] | [
"27997",
"1174215",
"563719",
"27997",
"1174216",
"27997",
"27997"
] | [
"1164433",
"1242997",
"905"
] |
01745270 | Due to small scale fading and shadowing effects, obtaining a suitable reference trajectory offline is non-trivial. Therefore, we consider the most likely buffer state at each time determined based on the statistical mode and optimize the desired metric by introducing an overestimation parameter for robustness. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | This is in order to spend as much time as possible in that area with the best channel conditions in the trajectory. Then, in table 1 we observe the average time in which the buffer is emptied E[t empt ], the probability of success P S (i.e., the probability of emptying the buffer when reaching g) and the amount of mechanical energy used normalized by mλ 2 . | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 04444841 | Sherlock [START_REF] Hulsebos | Sherlock: A deep learning approach to semantic data type detection[END_REF] learns to perform the CTA task using 1,588 features extracted from a single column of a given relational table. The features are divided into four categories: character-wise statistics (e.g. | 2023 | [
"info"
] | [
"421532"
] | [
"1348365"
] |
01745270 | ( 13
)
Due to the wireless channel model the region A J is circular while the shape of region A j , for j = 1, 2, • • • , J -1, is a ring with inner and outer radii of r j+1 and r j respectively. And r j is given by:
r j = min r | R (Γ (r[cos(θ) sin(θ)] -p AP )) = R j (14)
The radii r j are computed from the channel statistics which can be estimated using the techniques presented in [START_REF] Malmirchegini | On the Spatial Predictability of Communication Channels[END_REF]. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | The desired trajectory is such that it consumes little mechanical energy from the robot and also allows the robot the transmit all the content of the buffer quickly. In addition we want that when the MR follows this trajectory it succeeds in emptying its buffer with a high probability. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 03388295 | Existing works in the field focus on merging polygonal cells only and omit the necessity of Figure 3.1: Goal of our approach. Our algorithm takes as input an image with a rough semantic probability map and outputs a set of low-complexity polygons capturing accurately the objects of interest, here dogs and cats. | 2021 | [
"info"
] | [
"211140",
"1039632"
] | [
"1058547"
] |
01745270 | We regroup these points in the following set
C j = {s, i 1 , i 2 , • • • , i j , o j , o j-1 , • • • , o 1 ,
g} and index them as follows:
c j 0 = s, c j n = i n , for n = 1, 2, • • • , j, c j n = o 2j+1-n , for n = j + 1, j + 2, • • • , 2j, c j 2j+1 = g. (15)
where s and g are the starting and goal points for the robot. In addition, t n is the time instant in which the robot is at p j n and:
τ n t f = (t n+1 -t n ), n = 0, 1, • • • , 2j (16)
where:
2j n=0 τ n = 1, τ n > 0, (17)
Note that the coefficients {τ n } 2j n=0 determine the portion of time t f that the robot takes to go from c j n-1 to c j n . | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | The signal received by the AP at time t can be written as
y AP (t, p(t)) = h(p(t), t)s(p(t)) p(t) -p AP α/2 2 x(t) + n AP (t), (1)
where p AP is the location of the AP, h(p(t), t) represents the time-varying smallscale fading which we assume to be Nakagami distributed and s(p(t)) represents the shadowing term which we assume to be lognormal distributed [START_REF] Cai | A Two-Dimensional Channel Simulation Model for Shadowing Processes[END_REF]. Nakagami fading is well suited to model the behavior of the multipath fading in many practical scenarios [START_REF] Simon | Digital Communications over Fading Channels[END_REF]. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01849361 | are linearly independent, except if one of the sin function is null. In any case, the only solution is either the null filter, or a trivial single-coefficient filter. | 2018 | [
"info"
] | [
"471268",
"471295"
] | [
"11229"
] |
01745270 | So, the velocity profile and the path must be selected to minimize the mechanical energy (i.e., the first term in the optimization target ( 12)). To do so the vehicle must go from c j n-1 to c j n in a time τ n t f (to be determined) using minimum energy. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | Now, regarding the path for T 1 the robot reaches A 2 by moving in an orthogonal direction with respect to the vector gs, by doing so the robot minimizes the amount of deviation from g which reduces then the distance total distance travelled and consequently the energy spent. When we observe the velocity profiles of both trajectories in Fig. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01619338 | First, the elementary concepts and the associated algorithms which we designed are mainly focused on manufactured shapes. In other words, the first layer of our ontology does not effectively conceptualize other objects such as organic shapes. | 2016 | [
"info"
] | [
"542028",
"150624",
"22594",
"395002",
"150624",
"490706"
] | [
"1151214",
"2660",
"171434"
] |
01745270 | Now, we observe the effect of the robustness parameter r R , see (21). To do so we consider two more trajectories. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | Table 1 . 1 Performance of different trajectories
trajectory E[tempt] (s) PS Energy/(mλ 2 ) (J)
T0 14.46 0.0868 0.1859
T1 10.41 0.7206 0.8139
T2 7.72 0.9347 4.8924
T3 7.68 0.8652 3.8928
T4 7.59 0.9262 4.7909
The present work is supported by the LIA project between CRAN, Lorea and the International University of Rabat. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01334288 | The big lesson learned from this event was that the exercise needed to include more contextual details of operation and success criteria in addition to a standardized technical configuration While the annual timeline is fairly well structured, it is not ridged in that the Regis team adapted the events in real time and debriefed after every event, in order to feed input in to the AGILE development cycle. As new needs became evident, the joint leadership used the intervening time to tune the upcoming collaborative sessions. | 2015 | [
"info"
] | [
"459830",
"459830"
] | [
"983838",
"983839"
] |
01745270 | Note that such values for the number of bits transmitted in the payload can be obtained using a rectangular M-QAM modulation. Now, regarding the thresholds {η j } J j=0 we fix them so that the bit error rate is at least 10 -3 . | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | As it is expected the trajectory T 0 uses minimum energy but its probability of success is very low (0.0868). On the other hand the probability of success for the optimized trajectories T 1 and T 2 is much higher, 0.7206 and 0.9347 respectively, but due to the larger paths and velocities their energy consumption is higher. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 00531081 | Related work
Bounded model checkers transform the program and the post-condition to a big formula and use SAT solvers to prove that the property holds or to find a counterexample [START_REF] Vijay | A survey of automated techniques for formal software verification[END_REF]. SMT solvers are now used in most of the state of the art BMC tools to directly work on high-level formula (see [START_REF] Armando | Bounded model checking of software using SMT solvers instead of SAT solvers[END_REF][START_REF] Malay | Accelerating high-level bounded model checking[END_REF][START_REF] Cordeiro | SMT-Based Bounded Model Checking for Embedded ANSI-C Software[END_REF], and the last version of CBMC). | 2010 | [
"info"
] | [
"59922",
"59922",
"59922",
"118874",
"118874"
] | [
"1082091",
"1961",
"872659"
] |
01745270 | Fig. 3 . | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | We assume that the robot starts at position s, i.e. p(0) = s. The MR and the AP communicate with a frame duration T during which the channel fading is assumed to be a constant, i.e we assume a block fading model. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01369550 | Fig. 2 :
2 Fig. | 2016 | [
"info"
] | [
"91203",
"466791",
"91203",
"466791",
"91203",
"466791",
"91203"
] | [
"989235"
] |
01745270 | We will denote such trajectory as T 0 . Then we consider a trajectory T 1 optimized according to (22) with θ 1 = 1, θ 2 = 0 and r R = 1. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | ( 18
)
From the definition of i n and o n we know that they lie in a circle of radius r n which can be computed from the p.m.f. of R (Γ (p(kT ))). | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 00189310 | Therefore the results may deviate with the variation in the angle of measurement. Releasing the nickel layer from the brass mandrel, results in a decrease of the internal compressive stress. | 2006 | [
"info"
] | [
"48624",
"48624",
"48625",
"48626",
"48626",
"48626",
"48626"
] | [
"844595",
"844596",
"844597"
] |
01745270 | This is achieved by deriving the optimization target of ( 22), see more details in [START_REF] Licea | Trajectory planning for energy-efficient vehicles with communications constraints[END_REF]. Then we use simulated annealing algorithm (SAA) [START_REF] Russell | Artificial Intellingence: A Modern Approach[END_REF] to optimize the durations {τ n } 2j n=0 . | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | However, we have seen an emergence of new technology like unmanned aerial or ground vehicles, drones and mobile robots which have communication objectives in addition to their destination or motion based objectives [START_REF] Licea | Trajectory planning for energy-efficient vehicles with communications constraints[END_REF]. Several works [START_REF] Ooi | Minimal energy path planning for wireless robots[END_REF] have studied trajectory optimization problems when the communication constraint is that of having a target SNR. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01556215 | β(v, d). ( v := N | ! | 2012 | [
"info"
] | [
"69530",
"69530"
] | [
"1011790",
"1011791"
] |
01745270 | Now, we observe the effect of the robustness parameter r R , see (21). To do so we consider two more trajectories. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | We can also see that the second term in the optimization target of (12) depends only the time spent in each region A j (i.e., on the durations τ k t f ) and not on the shape of the particular path followed by the robot nor by its velocity profile. So, the velocity profile and the path must be selected to minimize the mechanical energy (i.e., the first term in the optimization target ( 12)). | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 00527518 | For a given instance I of 3-SAT, let G 4 (I ) be the digraph we obtain from G 1 (I ) by replacing each clause gadget C 1 j by the modified one C 4 j from Figure 6. Also for each variable, modify the gadget V 1 i as follows: replace the path a i x i v i b i by a path a i x Then in G 4 (I) the links representing a variable x i and a clause C j that uses this variable are represented by arcs between vertices from the variable gadget with superscript j (as in Figure 2). | 2010 | [
"info"
] | [
"37461",
"2466",
"1033"
] | [
"9383",
"171871"
] |
01745270 | The coefficients {θ k } 2 k=1 of the convex combination determine the relative importance of each optimization criterion. Note that due to the stochastic nature of the channel we can not ensure that when the MR follows the reference trajectory it will always be able to empty its buffer but we can ensure that this happens with a certain probability. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | System Model
The position of the MR is given by p(t) ∈ R 2 , at any time t ∈ R ≥0 . We assume that the robot starts at position s, i.e. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 00387085 | In fact as shown by the following theorem, if a DAG G (which can be an UPP-DAG) contains an internal cycle there cannot be equality between π(G, P) and w(G, P) for all the set of dipaths P.
Theorem 2 If a DAG G contains an internal cycle there exists a set P of dipaths such that π(G, P) = 2 and w(G, P) = 3. Proof: Let us consider an internal cycle consisting of 2k dipaths k between b i and c i and k between b i and c i-1 (the indices are taken modulo k). | 2009 | [
"info"
] | [
"2466",
"2466",
"2466"
] | [
"739520",
"950781",
"942945"
] |
01745270 | Paths corresponding to trajectories T3 (green) and T4 (dashed red). 4 Fig. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | This second term is a sum over the most likely number of bits left in the buffer at time instant t = kT (i.e., E [b(k)]). The coefficients {θ k } 2 k=1 of the convex combination determine the relative importance of each optimization criterion. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 00725148 | Then, in Section 3, we present some energy measurements on different MS, including the impact of transmitting different application flows through different interfaces (WLAN and 3G). We also evaluate the energy impact of the environment discovery and propose some optimizations to achieve more energy efficient WLAN scanning and GPS location. | 2011 | [
"info"
] | [
"73363",
"73363",
"73363"
] | [
"905776",
"181995",
"929244"
] |
01745270 | The rest of the paper is structured in the following manner. We provide the model for the wireless communication system and the robot motion in Section 2. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | Paths corresponding to trajectories T0 (green), T1 (blue) and T2 (magenta). Starting point s represented by a circle, goal point s represented by a triangle and AP location at the origin. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01527530 | Similarly to WSNs, nodes in WMNs are static and the traffic is expected to be concentrated on certain paths (to and from gateway nodes providing connection to the Internet). On the other hand, contrary to WSNs, nodes in WMNs are gridpowered wireless routers with high processing and memory capacity. | 2012 | [
"info"
] | [
"263827",
"97806"
] | [
"1008865",
"1008866"
] |
01745270 | 4 . 44 Fig. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | This large probability of success was achieved by optimizing the trajectories using only first order statistics of the wireless channel. In the future we will take into account channel measurements to develop an online mechanism which further improves the success probability while reducing the amount of mechanical energy. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 00879736 | Increasing ∆ allows us to smoothly navigate from instantaneous views on the data to more global views. Figure 9 c shows this for ∆ set to roughly 8 hours for our 7-days flight stream. | 2013 | [
"info"
] | [
"193083",
"131861",
"146992",
"131861",
"131861"
] | [
"6085",
"852543"
] |
01745270 | This second term is a sum over the most likely number of bits left in the buffer at time instant t = kT (i.e., E [b(k)]). The coefficients {θ k } 2 k=1 of the convex combination determine the relative importance of each optimization criterion. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | 3 Fig. 3. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 02180303 | 1 . 1 Fig. | 2019 | [
"info"
] | [
"491212",
"491212",
"491212"
] | [
"909",
"1037917",
"874110"
] |
01745270 | Problem statement
The objective of the robot is to depart from a starting point s to a goal point g within a time t f and transmit the all the content from its buffer to the AP. The desired trajectory is such that it consumes little mechanical energy from the robot and also allows the robot the transmit all the content of the buffer quickly. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | 1 . 2 Fig. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 00755282 | A perceptible denial of service (DoS) attack to the communication network. Such attack consists of sending a high number of packets on the communication network, with the effect of reducing the available bandwidth and causing excessive delay or loss of the packages between CC and SS. | 2008 | [
"info"
] | [
"226973",
"226973",
"389097",
"389097"
] | [
"13942",
"13943"
] |
01745270 | In addition we want that when the MR follows this trajectory it succeeds in emptying its buffer with a high probability. We assume that the only knowledge available to the MR (and the designer) about the environment (prior to the execution of the trajectory) is the position of the starting and goal points (i.e., s and g); an estimate of the path loss coefficient α, but we assume no knowledge about the severity of the small-scale fading (i.e., about the shaping factor m in (2)). | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | Therefore, we consider the most likely buffer state at each time determined based on the statistical mode and optimize the desired metric by introducing an overestimation parameter for robustness. This approach results in an optimization problem with a feasible solution. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 02087581 | Key Results
Simulation of memory Each one of the t + 1 simulators s i executes the sequential code of the n simulated processes p j in parallel. By assumption, every simulated code is a sequence of instructions that are either (1) local processing, (2) a write operation into memory or (3) a snapshot of the shared memory. | 2016 | [
"info"
] | [
"389097"
] | [
"3041"
] |
01745270 | ṗ(t) = u(t) u(t) 2 ≤ u max , p(0) = s, p(t f ) = g, t f T k=0 R (Γ (p(kT ))) ≥ r R N. (12)
The optimization target is a convex combination of the energy spent in motion by the robot (9) and of a second term which estimates how quickly the buffer is emptied. This second term is a sum over the most likely number of bits left in the buffer at time instant t = kT (i.e., E [b(k)]). | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | So when the trajectory is actually executed, the probability that the buffer will be emptied will be high and by increasing the overestimation parameter r R we can reduce the probability of the MR failing to empty its buffer when it reaches the goal point g. The term b(t) is a discreet and deterministic function of the MR's position. This difference makes the problem much more feasible to solve. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01367344 | Open source (10) and documentation (11) enables feedback and potential community engagement during critical design stages, and examples and instructions by their definition must embed an understanding of use cases and usability pitfall. Improving transparency of process, and analytic consideration of future use cases (12, 13, 14) are valid usercentered approaches and (15, 16) directly speak to assessing user needs and crafting appropriate interventions. | 2016 | [
"info"
] | [
"75866",
"300433",
"300722",
"20094",
"57001",
"239954",
"153591",
"429842",
"36374",
"87773",
"121172",
"121172",
"302190",
"74980",
"82005",
"121172",
"303576",
"207728",
"300433",
"227083",
"57001",
"303576",
"402624",
"74980",
"152470"
] | [
"9482",
"766166",
"864",
"13193"
] |
01745270 | The trajectory T 4 spends a larger time in the area A 2 in order to increase the average data rate and therefore increase the probability of success. But by doing so the robot has to move quicker when it gets out from A 2 in order to reach g in time. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | We will denote such trajectory as T 0 . Then we consider a trajectory T 1 optimized according to (22) with θ 1 = 1, θ 2 = 0 and r R = 1. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 00368950 | in wireless networks, it is possible that u is able to send information to v yet v can not send any information back to u (u may have a wider range antenna than v). Asymmetric situations, that we denote in the following under the term of unidirectional networks, preclude many common techniques in self-stabilization from being used, such as preserving local predicates (a process u may take an action that violates a predicate involving its outgoing neighbors without u knowing it, since u can not get any input from its outgoing neighbors). | 2009 | [
"info"
] | [
"55344",
"56049",
"389034"
] | [
"9380"
] |
01745270 | We provide the model for the wireless communication system and the robot motion in Section 2. We then provide the problem statement in Section 3 and provide a solution concept in Section 4. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | Therefore to solve (12) we will calculate all the optimum control signals u * j . In order to minimize the mechanical energy term in the optimization target of (12) the optimum control law u * j (t) must make the robot enter and exit the convex hull of each region {A n } j n=0 at most once. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01094365 | In this experiment, the support value is set to 20 patients (i.e. σ = 20%). | 2014 | [
"info"
] | [
"205125",
"205125",
"205125",
"205125"
] | [
"913967",
"16730",
"175398",
"743383"
] |
01745270 | When we observe the velocity profiles of both trajectories in Fig. 2 we first note that the period with highest velocity takes place from t = 0 until t = τ 1 this is because the robot is rushing to get out from A 0 to start transmitting as many bits as possible. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01745270 | ( 13
)
Due to the wireless channel model the region A J is circular while the shape of region A j , for j = 1, 2, • • • , J -1, is a ring with inner and outer radii of r j+1 and r j respectively. And r j is given by:
r j = min r | R (Γ (r[cos(θ) sin(θ)] -p AP )) = R j (14)
The radii r j are computed from the channel statistics which can be estimated using the techniques presented in [START_REF] Malmirchegini | On the Spatial Predictability of Communication Channels[END_REF]. | 2017 | [
"info"
] | [
"194055",
"185180",
"1289",
"185180",
"194055",
"549427",
"194055"
] | [
"1029863",
"5857",
"1068236",
"936663"
] | 01500491 | VI). ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ ❤ payload
For that reason, we provide a general framework for messages exchanged between monitors. | 2006 | [
"info"
] | [
"389034",
"93591",
"23292",
"93591",
"160294",
"389034",
"23292"
] | [
"2515",
"995985"
] |
01745316 | Ecological equivalence is one of the most widely discussed conceptual challenges in the related scientific literature [START_REF] Gonçalves | Biodiversity offsets: from current challenges to harmonized metrics[END_REF]. A particularly controversial aspect is how ecological equivalence should be assessed. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | It seems rather difficult or even impossible to move toward an unanimous worldwide method, mainly because of (i) diversity in offset policies between countries (McKenney & Kiesecker 2010), (ii) disparity between development projects and the resources committed to biodiversity conservation (Regnery et al. 2013b), and (iii) disparities in biodiversity status context and conservation issues. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01351730 | Summit is also strongly influenced by air transported from North America, particularly in summer [START_REF] Kahl | Air mass trajectories to Summit, Greenland: A 44-year climatology and some episodic events[END_REF]. In contrast, [START_REF] Steen-Larsen | Understanding the climatic signal in the water stable isotope records from the NEEM shallow firn/ice cores in northwest Greenland[END_REF] suggested that air mass reaching NEEM originate primarily from the Arctic, the Baffin Bay area (West of Greenland). | 2016 | [
"sde"
] | [
"91728",
"1051943",
"316963",
"106229"
] | [
"760455"
] |
01745316 | One way of better combining operationality, scientific basis and comprehensiveness is to develop and use offset dedicated data-bases providing hindsight on local context and previous offset measures. The common structure underlying EAMs suggests that, even though some aspects could be improved, no better solution has yet been found. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | A number of essential considerations that should be taken into account in order to evaluate equivalence have been identified [START_REF] Quétier | Assessing ecological equivalence in biodiversity offset schemes: Key issues and solutions[END_REF][START_REF] Bull | Biodiversity offsets in theory and practice[END_REF][START_REF] Quetier | No net loss of biodiversity or paper offsets? A critical review of the French no net loss policy[END_REF]), which we summarize in four key groups: ecological, spatial, temporal and uncertainty considerations. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01862568 | The leached quantities of elements in lysimeters in Aix-en-Provence from mine residue RMA1-1 during one year are presented at Figure 2. The decrease of emission of the treated mine residue (Soil+MBR) is for lead 12 times, for cadmium 45 times and for zinc is 352 times, compared to untreated MBR (Soil). | 2015 | [
"sde"
] | [
"3186",
"22032"
] | [
"184999"
] |
01745316 | In addition, the use of rapidly collected data implies that indicator metrics are qualitative which leads to a lower level of scientific basis. Therefore, less operational EAMs (HEP, HEA, REA, LEA, PilotBBOP) which better combine both other challenges are often used for large-scale "voluntary" offset (BBOP 2014a(BBOP , 2014b) ) or accidental impacts [START_REF] Roach | Policy evaluation of natural resource injuries using habitat equivalency analysis[END_REF] which should be subject to less temporal, financial and legislative constraints than "classic" development project. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Matrix here represents certain elements like scrubs or single trees which can influence habitat suitability for species. Formation and Management are scored between 0 and 1, depending on their effect on habitat and are multipliers (e.g. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 00963646 | -Rules linking the rooftop material to the gutter material: for a rooftop material there is a specific use of the gutter material. Thus, the obtained rule is "in metallic roof the gutter has the same material as the rooftop". | 2014 | [
"sde"
] | [
"155441",
"155441",
"155441"
] | [
"921640",
"17450",
"921642"
] |
01745316 | HIS values are generated for specific combinations of water depth, substrate and vegetation cover that can be assigned to individual habitat patches. HIS values range between 0 and 1, which represent a percentage of the benchmark (1 is the benchmark value). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | It is calculated in different ways depending whether the species habitat include only one vegetation cover type, or more than one. There three possibilities: (i) species habitat includes one cover type (e.g. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 02947505 | Besides, we modeled ozone concentrations during the extreme summer period in 2003 and it could be also interesting to use the Short and the Long Drought scenarios to simulate ozone concentrations using a less extreme period in terms of climatic conditions. It has to be noted that the highest ozone concentrations were detected in August whatever the drought scenarios considered, because the conditions were very favorable to ozone formation (see above). | 2020 | [
"sde"
] | [
"188653",
"188653",
"1052100",
"1052100",
"518",
"1007947",
"518",
"1007956",
"518",
"1007954",
"188653",
"518",
"188653",
"518"
] | [
"173541",
"170291",
"764553",
"184050",
"741147",
"736577",
"18874"
] |
01745316 | Particularly, is operationality necessarily in contradiction with both other challenges? Is it possible to combine all three challenges in one EAM accepted by both operational and scientific spheres? | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | That is why at least part of the "compensation units" should be based on ecosystems functionalities. This should be done in consistency with offset policies which influence considerably the biodiversity components targeted (e.g., the US Wetland Mitigation policy requires offset for wetlands, in Europe the Birds and Habitats Directives requires offset for specific birds species or habitats [START_REF]Council Directive 92/43/EEC of 21 May 1992 on the conservation of natural habitats and of wild fauna and flora[END_REF][START_REF]Directive 2009/147/EC of the European Parliament and of the Council of 30 November 2009 on the conservation of wild birds on the conservation of wild birds (codified version)[END_REF] and the offset measures outcomes (e.g., wetland functionalities restoration, species population conservation). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 04335998 | On the one hand, the sudden gathering of the population at the wintering site suggests the existence of a potential site where the ducks gather to moult (see analysis in Appendix A). On the other hand, a few individuals located during the same period at very distant sites suggest that the birds moult, camouflaged, close to their nesting site in the vegetation. | 2023 | [
"sde"
] | [
"1173601",
"1173601",
"482052",
"1173601",
"482052",
"1173601"
] | [
"1318117",
"1317316",
"1318150",
"1318151",
"1318152"
] |
01745316 | forest/shelter and meadow/food). If HSI value is not available for every year, user can decompose the period of analysis in smaller period and calculate Cumulative HU with a specific formula. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Conclusion
All studied EAMs share a general framework to assess ecological equivalence where equivalence key considerations (ecological, spatial, temporal and uncertainties) are taken into account in different ways, which influence EAMs operationality, scientific basis comprehensiveness. The analysis of these three "challenges" revealed that operationality tends to be favored in EAMs development, while there is heterogeneity in the integration of scientific basis in EAMs. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 02916840 | A growing number of studies are suggesting the benefit of using polyphenols for the treatment of neurodegenerative disorders. Indeed, in order to treat most of the NDs, synthetic drugs are extensively used which are found to exert side effects in the course of the treatment. | 2020 | [
"sde"
] | [
"559757",
"572171",
"559757",
"572171",
"559754",
"562955",
"533612",
"1049069",
"572200",
"572201",
"57629"
] | [
"857905",
"1011606"
] |
01745316 | Introduction
Biodiversity erosion has accelerated in recent decades [START_REF] Sala | Global Biodiversity Scenarios for the Year 2100[END_REF] and has become a major environmental concern as biodiversity loss is identified as a major driver of ecosystem change [START_REF] Hooper | A global synthesis reveals biodiversity loss as a major driver of ecosystem change[END_REF]. Alongside "classic" answers such as species and ecosystems protection and conservation, biodiversity compensation is increasingly used to counteract impacts from development. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | 23
Please choose one answer. If your answer is not already mentioned, please precise it in "Other". | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 04132128 | The core was obtained from the lagoon to the west of Gomishan (-23/-27m a.s. l.), near the south-eastern corner of the Caspian Sea (Fig. 1). | 2023 | [
"sde"
] | [
"188653",
"188653",
"188653",
"1166195",
"1166196",
"61277"
] | [
"173827",
"1087704",
"173922",
"1262842"
] |
01745316 | 4.2. Trade-offs and synergies between the three EAM challenges: why do they exist and how could they be overcome (or not)? | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | An average score is calculated by category and the average of these score is the site final score called Delta. Four Deltas are calculated. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 03203368 | Materials and methods
Experimental sites and crops sampled
The wheat, maize, and sunflower experiments were located in Avignon,France (43.9°N,4.9°E). The study focused on fully developed crops soon after the flowering stage, when the final height was reached and all leaves were fully developed with only a little senescence appearing at the bottom of the canopy. | 2021 | [
"sde"
] | [
"1002211",
"1035621",
"1002211",
"367199",
"1002211",
"1002211",
"1002211",
"1002209",
"1035621",
"1002211"
] | [
"735742",
"806706",
"782983",
"791715"
] |
01745316 | With the application of a discounted rate, losses have an increasing value over time, and in the contrary, gains have a decreasing value over time. Losses and gains are calculated as follow (the unit is discounted resource or service acre year). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Mean scores were calculated for each challenge (ScoreOp, ScoreScBs and ScoreComp) as the relative mean of the scores attributed to the four criteria describing the challenges, expressed as percentage challenge achievement. These mean scores were added as supplementary variables in the PCA (so that they do not contribute to PCA axis construction). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 04021114 | ( 1) highlighted a particular subset of patterning processes, which may result in irregular patterns having specific properties in terms of patch-size distribution and patch dynamics. Such process has been so far largely overlooked in ecology. | 2023 | [
"sde"
] | [
"1100781"
] | [
"1235355"
] |
01745316 | researchers, consultants, administration...) at the regional (or
26
27 Natural habitat(s) (e.g. wetlands or old-growth forest)
28 Natural Habitat(s) + species (e.g. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | The number of EcoPoints/m² a biotope will get is determined depending on three criteria: its degree of "naturalness", the role it has for endangered or patrimonial species and its distinctiveness in the local scale. A software allows these three criteria combination to calculate the different values above for each biotope. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01871030 | Based on existing information according to [START_REF] Nilo | Synthèse des connaissances et établissement d'une programmation de recherche sur l'anguille d'Amérique (Anguilla rostrata)[END_REF], yellow eels from a pre-defined size were targeted, in order to have the same range of ages (5-10 years old) for all sites. In Quebec, the selected fish ranged between 495 to 655 mm in length and in France, the selected fish ranged between 433 to 578 mm. | 2018 | [
"sde"
] | [
"92448",
"313082",
"407454",
"542729",
"778",
"407454",
"778",
"92448"
] | [
"736117",
"735518",
"1094932"
] |
01745316 | researchers, consultants, administration...) at the regional (or
26
27 Natural habitat(s) (e.g. wetlands or old-growth forest)
28 Natural Habitat(s) + species (e.g. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | A score from 1 to 3 or 4 (depending on the number of modalities) was then given to each criterion, where 1 is the lowest level of challenge achievement, and 4 the highest (see Appendix B). For example, an EAM that require only very easy to access data will receive a 4 for the "Data availability" criterion. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 00547590 | The volume of water delivered during the first irrigation event and the following frequent irrigations caused restructuration of the fragile structural porosity created by soil preparation operations [START_REF] Mapa | Temporal variability of soil hydraulicproperties with wetting and drying subsequent to tillage[END_REF][START_REF] Angulo-Jaramillo | Seasonal variation of hydraulic properties of soils measured using a tension disk infiltrometer[END_REF][START_REF] Cameira | Soil macropore dynamics affected by tillage and irrigation for a silty loam alluvial soil in southern Portugal[END_REF]. During the second part of the irrigation season, when the irrigation rate decreased due to lower water requirements, the effect of irrigation was overtaken by the effects of wetting and drying cycles associated with the effects of the rooting system. | 2009 | [
"sde"
] | [
"568889",
"568889",
"732",
"568889",
"135940",
"568889"
] | [
"957792",
"843624",
"7484"
] |
01745316 | Two main EAM types can be identified according to the range of biodiversity they target: "specialized", using indicators for a specific ecosystems (for example Australian endemic vegetation for the Habitat Hectare method or Florida's wetlands for UMAM ) and "generalist" using general indicators adapted to a wide range of ecosystems (e.g., terrestrial ecosystems for PilotUK) (Table 3). A benchmark can be used if there is an identified reference state for the targeted biodiversity (e.g., for Habitat Hectare the benchmark is "the same vegetation type in a mature and longundisturbed state", and for UMAM it is a "reference standard wetland" considered as in good ecological quality). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | 2014) own a large amount of land and therefore have the possibility to offset their impacts on biodiversity on their own land. In this purpose, biodiversity issues (e.g., ecosystems maps or species lists) can better be identified in advance for their offset needs (e.g., French biodiversity observatories in alpine ski resorts). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 04231486 | There is no information collected and shown on derivatives and controls. Hence they cannot support dynamic simulation or show flows' evolution over time. | 2023 | [
"sde"
] | [
"1043094",
"1043094",
"1096421",
"1043094",
"1043094",
"1043094"
] | [
"754512",
"737854",
"752420",
"17061",
"1630"
] |
01745316 | (iii) Temporal: how do EAMs take into account time lags? And (iv)
Table 1 :
1 Context of selected EAMs implementation
EAM name, code and reference Structure and Country where EAM was implemented initially Offset policy in which EAM can be implemented Type of impacts for which EAM can be implemented
Habitat Evaluation Procedure US Fish and Wildlife Service, United US Conservation Banking Development project impacting terrestrial
(HEP) (US Fish and Wildlife Service States or aquatic biodiversity
(USFWS) 1980)
Resource and Habitat Equivalency National Oceanic and Atmospheric Damage Assessment and Accidental impacts on biodiversity
Analysis Administration, United States Restoration Program
(REA / HEA) (NOAA 1995, 1997)
Canadian method Fish Habitat Department of Fisheries and Oceans, Canada's National Fish Habitat Development project impacting lacustrine
(FishHab) (Minns et al. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | To calculate HSIs, user has first to select species of interest (they can be patrimonial and endangered species, umbrella species etc. depending on the issues on the site). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 00493894 | 3 MADSTRESS performance 4 . 3 . | 2005 | [
"sde"
] | [
"568967",
"568967",
"568967",
"107190",
"107190",
"107190"
] | [
"756502",
"1243387"
] |
01745316 | Thus this is not an exhaustive sample but rather a representative one as it covers North America, Australia and Western Europe which are three main zones where offset policies are well-established [START_REF] Madsen | State of biodiversity markets: offset and compensation programs worldwide[END_REF]. The sample also covers all kind of ecosystems (terrestrial, aquatic, marine or wetlands). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Here the modalities for the Bade-Wurtemberg Land are detailed for the biotopes and species component. The method focuses on biotopes, with the assumption that species can be protected through their habitat protection. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 02047859 | In the sequence of water events, the runoff coefficient averaged over an event dropped from 90 ± 7.6% in the first event, to 7 ± 4.2% in the fourth event, while the average drainage coefficient increased from 5.5 ± 7.6% to 71.1 ± 24.3%, thus mirroring the runoff pattern. Similar to the 2014 experiments, later runoff responses, i.e. | 2018 | [
"sde"
] | [
"30954",
"497032"
] | [
"792166"
] |
01745316 | It is elaborated on the same principles than REA and HEA. The method aim to assess a landscape conservation value (service) for metapopulation, evaluated through two main indicators: abundance and genetic variance. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | A pre-defined weight is attributed to each indicator. The site final score is called the "Habitat Score" (HS) and it is calculating summing all indicators scores. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 03280555 | Clay minerals are derived either from the weathering of the rocks of the surroundings and are brought to sea by winds/rivers or come from more distant sources and are transported by marine currents. They may also originate from the in situ alteration of some minerals. | 2015 | [
"sde"
] | [
"415100",
"415100",
"415100",
"55705",
"415100",
"415100"
] | [
"882239",
"178858"
] |
01745316 | This ratio is the result of a negotiation on a case by No, It only allows "like for like" offsets (e.g. offsets targets the species impacted) 113 Yes, it allows "like for unlike" offsets (e.g. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Finally, EAMs are considered comprehensive when they include all key equivalence considerations ("Key equivalence consideration"), when they target species, habitats and ecosystem functions ("Biodiversity components"), when they require various types of data (from the literature, GIS, field data, etc., "Data type") and when they evaluate biodiversity with a relevant set of indicators ("Indicators number"). Each criterion was defined by 3 or 4 modalities (see Appendix B for modalities details). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 03942992 | Conversely, Thomas Gainsborough's Mr. and Mrs. Andrews (1750) can be interpreted as an expression of land ownership and capitalist domination over nature and laborers [START_REF] Rose | Feminism and geography: the limits of geographical knowledge[END_REF]. In summary, pre-19 th c. art figuratively depicted the history and lifestyles of civilizations in their diversity, whereas modern and contemporary art take a more reflective and abstract approach with a universal ambition. | 2022 | [
"sde"
] | [
"199918",
"198056",
"199918",
"198056",
"191652",
"198056",
"191652"
] | [
"20210"
] |
01745316 | [END_REF]) and the ecological engineering techniques used [START_REF] Jaunatre | Can ecological engineering restore Mediterranean rangeland after intensive cultivation? A large-scale experiment in southern France[END_REF]. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Some EAMs provide a basis for such predictions (i.e. Resource, Habitat, and Landscape Evaluation Analysis), but most of the time, the user has to find a way to make predictions as accurate as possible. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 00957550 | Composted soils were characterized by highest H and S values and mineral soils by lowest values. The utilization of vermicompost led to intermediate results. | 2013 | [
"sde"
] | [
"246718",
"451861",
"928",
"31573",
"246720"
] | [
"749415",
"857288"
] |
01745316 | Where: i is the year when impacts occurred and when credits are bought to a conservation bank. x is the year when calculation is stopped Nb, Nw and Nm are the abundance calculated in scenario B, W and M respectively, in average for the tth year Gb, Gw and Gm are the abundance calculated in scenario B, W and M respectively, in average for the tth year D is the discounted rate
The credits are calculated so that the "landscape configurations that provide equivalent levels of services despite changes in landscape structure that result from losing a patch or changing matrix quality" (Bruggeman et al. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | A Framework for Incorporating Uncertainty and Time Discounting When Calculating Offset Ratios for Impacted Habitat[END_REF][START_REF] Laitila | A method for calculating minimum biodiversity offset multipliers accounting for time discounting, additionality and permanence[END_REF][START_REF] Cochrane | Modeling with uncertain science: estimating mitigation credits from abating lead poisoning in Golden Eagles[END_REF]. Both ecological and spatial considerations should be addressed using the multiplicity of existing indicators covering a wide range of species and habitats (e.g., [START_REF] Andreasen | Considerations for the development of a terrestrial index of ecological integrity[END_REF][START_REF] Biggs | A biodiversity intactness score for South Africa[END_REF][START_REF] Regnery | Tree microhabitats as indicators of bird and bat communities in Mediterranean forests[END_REF]). | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01290055 | (Keen and Kotsogiannis, 2014)) but have a detrimental effect on national industries. The risk inherent to such a scenario would be that the no-longer-exported oil could be consumed within Latin America itself, replacing other renewable forms of energy production, starting with biofuels. | 2016 | [
"sde"
] | [
"28976",
"28976",
"28976"
] | [
"978915",
"11444",
"11284"
] |
01745316 | significance of species richness) to losses and gain comparison [START_REF] Quétier | Assessing ecological equivalence in biodiversity offset schemes: Key issues and solutions[END_REF][START_REF] Gardner | Biodiversity Offsets and the Challenge of Achieving No Net Loss[END_REF]. Uncertainty consideration (UnCd)
The way uncertainty (probability of offset failure) is taken into account in the method. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | We used only the theoretical guideline to attribute modalities to this EAM. Appendix E: EAMs challenges average scores and EAMs final scores, expressed as a percentage of challenge achievement. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 04231312 | Other control methods such as biological control or traps were seldom used, alone or in combination with other methods (used in 8% and 9% of programmes, respectively). Against pathogens, disinfection of associated material, such as production machinery and tools used was reported for E. amylovora and F. circinatum (EPPO-Global database 2022), which in combination with other methods resulted in a 76% eradication success rate. | 2023 | [
"sde"
] | [
"356395",
"301625",
"1002417",
"1002417",
"301625",
"409424",
"1002315",
"409424"
] | [
"745957",
"734654",
"1273010",
"1269878",
"748873",
"769820"
] |
01745316 | Where:
𝑠𝑐𝑜𝑟𝑒 𝐵𝐿𝐶 = [𝑏𝑢𝑓𝑓𝑒𝑟 𝑐𝑜𝑛𝑑𝑖𝑡𝑖𝑜𝑛 * (%𝐴𝐴 𝑤𝑖𝑡ℎ 𝑏𝑢𝑓𝑓𝑒𝑟 * 𝑎𝑣𝑒𝑟𝑎𝑔𝑒 𝑏𝑢𝑓𝑓𝑒𝑟 𝑤𝑖𝑑𝑡ℎ) 0.5 ) 0.5 ] + 𝑎𝑞𝑢𝑎𝑡𝑖𝑐 𝑎𝑟𝑒𝑎 𝑎𝑏𝑢𝑛𝑑𝑎𝑛𝑐𝑒 𝑠𝑐𝑜𝑟𝑒 𝐵𝑆 = 𝑚𝑒𝑎𝑛(𝑝𝑙𝑎𝑛𝑡 𝑐𝑜𝑚𝑚𝑢𝑛𝑖𝑡𝑦) + ℎ𝑜𝑟𝑖𝑧𝑜𝑛𝑡𝑎𝑙 𝑖𝑛𝑡𝑒𝑟𝑠𝑝𝑒𝑟𝑠𝑖𝑜𝑛 + 𝑣𝑒𝑟𝑡𝑖𝑐𝑎𝑙 𝑏𝑖𝑜𝑡𝑖𝑐 𝑠𝑡𝑟𝑢𝑐𝑡𝑢𝑟𝑒 Four CS are calculated for each Assessment Areas (AA). The (AA) is the portion of the wetland that is assessed using CRAM. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | 2012
), and scientific basis on data provenance (data updating is notably crucial and even more important with global changes modifying ecosystems dynamics, [START_REF] Vitousek | Human Domination of Earth's Ecosystems[END_REF]. We therefore suggest one main avenue to develop EAMs combining the three challenges: the creation and use of biodiversity offset dedicated data-bases gathering relevant information concerning key equivalence considerations (e.g., risks associated to offset failure based on previous feedback) for at least species and ecosystems frequently targeted in offset procedures. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 03890928 | This means that if 𝛼 = 1, the cell is full of water, while if 𝛼 = 0, the cell is full of air. All the other values concern the air/water interface description. | 2022 | [
"sde"
] | [
"300006",
"418989",
"528414",
"418989",
"528414",
"528443",
"421305",
"300006"
] | [
"1038194"
] |
01745316 | Furthermore, EAMs trouble making the integration of uncertainty science based: only the Canadian Fish Habitat method (isolated on axis 2 upper extremity) uses a ratio based on existing data-bases providing scientific feedbacks on previous offset measures (highest score for Uncertainty Consideration) in order to adjust the offset surface areas. A group of three EAMs (HabHect, CRAM and LdClEval) appears clearly on Figure 2b being characterized by high scores for Spatial Consideration, meaning that spatial indicators (e.g., connectivity) are taken into account in the calculation of the compensation unit. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Another way to make more accurate predictions and reduce uncertainty would be for EAM users to take advantage of feedback from previous impacts or offset measures in similar habitats or for the same species or taxa [START_REF] Walker | The restoration and re-creation of species-rich lowland grassland on land formerly managed for intensive agriculture in the UK[END_REF][START_REF] Tischew | Implementation of Basic Studies in the Ecological Restoration of Surface-Mined Land[END_REF][START_REF] Tischew | Evaluating Restoration Success of Frequently Implemented Compensation Measures: Results and Demands for Control Procedures[END_REF]). This could be achieved by drawing tendencies from data [START_REF] Specht | Data management challenges in analysis and synthesis in the ecosystem sciences[END_REF] generated by all EIA individually for a large set of projects. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 03871144 | TDN gradient score for each river is also indicated in the table. Rivers are ordered following log 10 (TDN) values from left to right. | 2022 | [
"sde"
] | [
"302177",
"300134",
"198592",
"302177",
"417362",
"110760",
"302177",
"515901"
] | [
"1193911",
"1193912",
"1193913",
"1193914",
"1193915",
"1193916",
"1193917",
"1193918"
] |
01745316 | Resource, Habitat, and Landscape Evaluation Analysis), but most of the time, the user has to find a way to make predictions as accurate as possible. 3.2. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Trade-offs and synergies between the three EAM challenges: why do they exist and how could they be overcome (or not)? Based on their average scores, the EAM challenges we identified as operationality, scientific basis and comprehensiveness are not incompatible but still no EAM combines all these challenges perfectly. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 02328411 | Furthermore, there was a significant effect of playback on the probability of moving (i.e., approaching and flight behaviours), whereas group had no significant effect (Table 1; Fig. 3). | 2019 | [
"sde"
] | [
"215697",
"215697",
"215697",
"215697",
"215697",
"215697"
] | [
"991337",
"758077",
"758082"
] |
01745316 | However, it remains theoretical as in practice users could very well choose only indicators with qualitative metrics. Data analysis
A principal component analysis (PCA) was performed on all criteria scores (see Appendix C), in order to analyze how EAMs addressed operationality, scientific basis and comprehensiveness. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Developing EAMs with solid scientific basis for every criterion requires researchers to be involved in EAMs design, alongside offset stakeholders and experts.Besides, both EAMs integrating best scientific basis (BBOP pilot method and Land Clearing Evaluation, see Appendix E) included researchers in their design phase. The number of research projects focusing on improving offset design is increasing[START_REF] Gonçalves | Biodiversity offsets: from current challenges to harmonized metrics[END_REF] but there is still a gap between complex and technically advanced tools developed by researchers, such as software implemented for identifying important areas for connectivity (e.g., "Graphab",[START_REF] Foltête | A software tool dedicated to the modelling of landscape networks[END_REF] or "Circuitscape",[START_REF] Koen | Landscape connectivity for wildlife: development and validation of multispecies linkage maps[END_REF] and what is actually used in practice by consultancies and developers. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 03997939 | NEE estimates). In this regard, it is notable that significant correlations between NEE and Yield residuals were only observed in grassland sites (at S3), where aboveground biomass and vegetation cover are continuously reduced by grazing and recover after grazing cessation. | 2023 | [
"sde"
] | [
"1002457",
"1153108",
"1041039",
"429517",
"93528",
"1002132",
"148803",
"1045655",
"1041039",
"433118",
"1003584",
"1072747",
"523672",
"97145",
"498322",
"1035302",
"148803",
"526905",
"1084100",
"1050563",
"474661",
"1002457",
"1002424",
"1057473",
"1185501",
"10... | [
"1229365",
"17288",
"1081631",
"1207476",
"1206240",
"1206136",
"7619",
"183620",
"739023",
"744818"
] |
01745316 | Indeed, in practice, it is usual that ratios taking into account delay or risks are used to adjust the offset area, but in is done as an adaptation in case by case (in addition to the EAM baseline). (1) We did not have an answer for this EAM, because it is almost the same as HEA except for all that concern biodiversity targeted and indicator used. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | The studied EAMs share a common structure to evaluate sites biodiversity and to size offset although they handle ecologic, spatial, temporal considerations and uncertainty in various ways. There is no clear trade-off in challenge achievement but some criteria within or between challenges are negatively correlated. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 00947974 | 15th International Conference Ramiran, May 3-6, 2013, Versailles
Results
Results on sludge land spreading
During land spreading, we can discern different types of emissions:
-Direct emissions (sludge and mineral fertilizers): 1296.2 tons CO 2 eq, -Mineral fertilizers manufacturing:
1146.6 tons CO 2 eq, -Fuels: 13.2 tons CO 2 eq, -Transports of sludge: 139.6 tons CO 2 eq, -Infrastructure: 0.04 tons CO 2 eq, -Avoided emissions: -1593.3 tons CO 2 eq. Direct emissions and mineral fertilizers manufacturing are responsible for the most quantities of emitted GHG (94%). | 2013 | [
"sde"
] | [
"182206",
"182206"
] | [
"16385"
] |
01745316 | In addition, the use of rapidly collected data implies that indicator metrics are qualitative which leads to a lower level of scientific basis. Therefore, less operational EAMs (HEP, HEA, REA, LEA, PilotBBOP) which better combine both other challenges are often used for large-scale "voluntary" offset (BBOP 2014a(BBOP , 2014b) ) or accidental impacts [START_REF] Roach | Policy evaluation of natural resource injuries using habitat equivalency analysis[END_REF] which should be subject to less temporal, financial and legislative constraints than "classic" development project. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 01745316 | Criteria relative to operationality are in italic, criteria relative to scientific bases are in regular and criteria relative to comprehensiveness are in bold. Average scores for each challenge (Operationality, Scientific Basis and Comprehensiveness) are represented with dotted arrows. | 2017 | [
"sde"
] | [
"182211",
"182211",
"237629",
"496458",
"182211"
] | [
"184273",
"747305"
] | 02870071 | This leads us to propose that an important mechanism driving diversification of gentoo penguin lineages, on top of isolation by distance, comes from a trade-off between dispersal (gene flow) and local adaptation to the spatially changing conditions in the marine environment (isolation by environment). Overall, in the MMRR analyses we find that the genetic distances among gentoo penguin colonies are best explained by the combined effects of geographic distance and marine environmental distance. | 2020 | [
"sde"
] | [
"56919",
"510187",
"252664",
"350626",
"252664",
"56919",
"106380",
"1041280",
"565769",
"76974",
"488554",
"1002332",
"93779",
"196644",
"196644",
"196644",
"510187",
"252664"
] | [
"177281",
"749783"
] |
01745351 | Thanks to the complementary configuration in the memory cell, there are always the same numbers of unselected transistors and the same distance of wire connection (see Fig. 7), this balanced structure allows the impact of parasite resistance to be neglected during data sensing. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | The Fig. 13(a) shows the behavior of the cell00 while in a first phase the cell is programmed (cell both OxRRAM elements are set and only top OxRRAM element is reset). | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 04287776 | The parameters are not constant, they depend on the converter command. However, it is possible to consider a wide range of material permeabilities for computing the complex equivalent permeability. | 2019 | [
"spi"
] | [
"84073",
"84073"
] | [
"959951",
"746743"
] |
01745351 | Among them, metal oxides like HfO2, Ta2O5, NiO, TiO2 or Cu2O are promising candidates due their compatibility with CMOS processes and high on/off resistance ratio. In its simplest form, resistive memory element relies on a Metal/Insulator/Metal (MIM) stack (Fig. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | "# ! "# $"# $"#
The read operation is performed through a differential sensing of the bit-line and complementary bit-line and will be described in the sense-amplifier sub-section. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 03442553 | We note that the state of stress is quite heterogeneous. Figure 4(c) shows the magnitude of the divergence of the measured stress-field calculated using DDO, and we observe high values of divergence at the grain boundaries and triple junctions. | 2022 | [
"spi"
] | [
"301232",
"31551",
"339765"
] | [
"798181",
"175720",
"760507"
] |
01745351 | It includes three parts, a cross-point array of 2R cell for data storage, word line (left side) and bit line (bottom) driver and read circuits (top). Figure. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | VTE (V) VBE (V) STATE
SET (Write) 0.8@10ns 0 ONOFF
RESET (Erase) 0 -0.8V@10ns OFFON
Read <0.4@10ns Sensing ON or OFF
B. Architecture simulation
The aim of this section is to validate the functionality of the
architecture for both technologies
1) STT-MRAM array simulation
TABLE I PARAMETERS
I For instance, it takes only one cycle of switching duration, ~1.1 ns driven by the signal "EN_Write" to program a word to "0000" or "1111". | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 04245365 | The average hardness of the specimen was: 269 ± 19 HV bottom, 260 ± 17 HV middle, and 267 ± 42 HV top. These results show no explicit average hardness value varies between different parts of the deposited metal. | 2023 | [
"spi"
] | [
"261197",
"244115",
"244115",
"1051093",
"244115",
"244115",
"328492",
"261197",
"244115"
] | [
"1295497",
"1295512",
"1295499"
] |
01745351 | Array architecture
As shown in Fig. 6, the array is divided in M word per word line (e.g. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | Operation process in the cross point array: (a) For the selected word, the WL=gnd and both bit-line are biased to VDD (write 1 st phase). (b) For the selected word, WL=VDD while the bit-line are set to opposite values (write 2 nd phase). | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 04163571 | Where:
𝑌 𝑥 = 1 (𝑌 𝑐 1,1 + 𝑌 𝑐 1,2 ) (30)
𝑌 𝑥 = 1 (𝑌 𝑐 2,2 + 𝑌 𝑐 1,2 ) (31)
𝑌 𝑍 = 1 𝑌 𝑐 1,2 (32)
The full circuit of a transmission line with a core and screen conductors is represented in Figure 5. NUMERICAL RESULTS
The proposed implementation is used with two underground transmission lines and the results are compared with the corresponding results from a commercial transient simulation software (EMTP). | 2023 | [
"spi"
] | [
"441537",
"441537",
"441537"
] | [
"1270543",
"1270545",
"1270546"
] |
01745351 | This can be explained by the reduction of sneak currents in each memory cell (blue square curve) and the decreasing of sensing current difference between ROFF and RON, as shown in Fig. 10b. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | Since 2009, a number of NVM preindustrial prototypes [6][7][8][START_REF] Tappertzhofen | Capacity based nondestructive readout for complementary resistive switches[END_REF][10] were presented and the commercial products should be available soon. Even though these emerging NVM are based on different physics, they hold many common features. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 03345998 | This distortion is the result of breakage by bending test. To observe the fracture section as shown on the Internal bonding strength (IB in N.mm -2 ) corresponds to the energy required to break the sample by z-directional tensile test. | 2021 | [
"spi"
] | [
"570637",
"56527",
"445039",
"56527",
"445039",
"570637"
] | [
"762436"
] |
01745351 | 10 ns), the selection transistor should be large enough to ensure a high current (e.g. 100 A). | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | The Fig. 13(b) validates the ability of the architecture to successfully read in parallel a full word (word00) with typically cell00='0' and cell01='1'. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01862671 | Observers for fault diagnosis
Observers form the core of the model based fault detection and diagnosis strategies. In this contribution, three faults, all at the system level, were considered6 . | 2018 | [
"spi"
] | [
"185180"
] | [
"170940"
] |
01745351 | 7.a. 2 nd Phase: For the selected word, the common WL is set to VDD while BL and BL are biased to complementary value in order to selectively reset (high resistance state -RHRS) either the top resistive element or the bottom resistive element. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | >10 12 ). Since 2009, a number of NVM preindustrial prototypes [6][7][8][START_REF] Tappertzhofen | Capacity based nondestructive readout for complementary resistive switches[END_REF][10] were presented and the commercial products should be available soon. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 03404602 | Considering the mean heat flux and the density probability, the best agree-ment is found with the AMD model combined to the centered scheme. PLEASE CITE THIS ARTICLE AS
The T-LES combining the tensorial AMD model to compute the momentum convection and the scalar AMD for the density-velocity correlation, and involving the Quick scheme provides a satisfying estimation of mean quantities and very good results on the classical "+" scaling of correlations. | 2021 | [
"spi"
] | [
"57022",
"101475",
"57022",
"101475",
"57022",
"101475"
] | [
"1230247",
"15338"
] |
01745351 | As a result of the tunnel magnetoresistance (TMR) effect [A-12], the nanopillar resistance, RP or RAP, depends on the relative orientation, Parallel (P) or Anti-Parallel (AP), of the magnetization of the two FM layers. By using crystalline MgO barriers, the TMR ratio=RAP-RP/RP of MTJ nanopillars can reach more than 600% at room temperature [A-13-14]. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | A read decoder connects the N sense-amplifier to the selected word during the read phase. C. Driver circuit
When dealing with bipolar resistive switching element, one may be able to apply bipolar voltage between the top and bottom electrode as well as bidirectional current to properly achieved programming phase. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 03948233 | The acquisition card changes from the DT9837 to the DT9836, which provides the ability to use external clock, and a higher clock frequency for tacho input (36 MHz instead of 12MHz). Signal from the encoder is connected to the external clock, so as to perform angular sampling, and to a counter/timer input (tacho), to obtain angular speed. | 2011 | [
"spi"
] | [
"31116",
"235362",
"235362",
"235362",
"235579"
] | [
"2916"
] |
01745351 | Figure 3. (a) Vertical structure of an MTJ nanopillar composed of CoFeB/MgO/CoFeB thin films. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | The former is the most critical as the data sensing can be disturbed completely by the sneak currents. Moreover, there are parasite resistances throughout a large-65nm 580nm 410nm scale crossbar array, which leads to lots of sensing errors [A-6-12]. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 04057998 | 7 right). In fact, we presented only two cells instead of four, since according to the results presented in Fig. | 2022 | [
"spi"
] | [
"1064643",
"1088961",
"1064643",
"1088961",
"1064643",
"1088961",
"1088961"
] | [
"5962",
"9246"
] |
01745351 | We found that the switching delay is inversely proportional to the writing current as described in Eq. A-3. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | 11 (a) and (b) demonstrate the mixed simulation of parallel writing /reading for this 4×4 cross-point resistive
Figure. 13 :
13 Figure. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 03004372 | This step requires a training database [X] train arranged as a 3D tensor of size N × n × m, where N is the number of samples and n is the number of signals available for each of the m targets. It can be summarized as: 1) compute the Hilbert transform of each signal [X] train Hilbert along the dimension N ; 2) evaluate the Fast Fourier Transform (FFT) [X] train F F T along the same dimension; 3) take the mean over the dimension n to derive [X] train mean ; 4) perform the inverse FFT (iFFT) along N to derive [X] train ref erence . | 2020 | [
"spi"
] | [
"1043339",
"528414",
"528414",
"528414",
"423179",
"423179"
] | [
"6912",
"863646",
"1081520",
"1081521",
"1081522"
] |
01745351 | 10b. IV. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | # $ ! "! | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 00447803 | . , W n ) in T G| e = g. Consider the class of observers of the form d dt x = DL xω s (t) + DR x( n i=1
Let us write ξ and f (e, u) in the frame defined by the W i 's: ξ = n k=1 ξ k W k and f (e, ū) =
ū)] - ∂f ∂u (e, ū) ∂ψ ∂g (e, ū)ξ - n i=1 ∂L i ∂h (ū, h(e, ū)) ∂h ∂x (e, ū)ξ W i
n
k=1
April 5, 2008 DRAFT
where the L i 's are smooth scalar functions such that L i (h(e)) = 0. | 2009 | [
"spi"
] | [
"27997",
"13898",
"13898"
] | [
"866182",
"11346",
"12597"
] |
01745351 | In this SA, the read operation is performed in two phases: 1 st Phase: The SA is first connected to the bit-line of the selected word with SEN set to '1' and the circuit is precharged with PCH equals '0'. 2 nd Phase: The data stored in the 2R cell can be evaluated to logic level at the output Q as PCH is changed to '1' and WL is pulled down to '0'. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | The bipolar behavior is mainly due to an asymmetrical geometry of the electrode. In recent years, many studies have highlighted the good performances of non-stoichiometric HfOx [Lee08-IEDM] films used as switching layer (also used in memristors demonstrated by ). | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01216806 | EXAMPLE FOR PROJECT RELATED CONTEXT: Innovation integration decision (Innovation CDM Process)
Innovation integration decision aims at defining a set of innovations that are to be integrated in the vehicle design. Market segment data (Project related context) is crucial for this decision. | 2014 | [
"spi"
] | [
"11769",
"11769"
] | [
"5517",
"5565"
] |
01745351 | B. Array architecture
As shown in Fig. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | Two NMOS and one PMOS are connected to each bit-line and word-line to ensure correct biasing during all phases of operation (Write 1 st and 2 nd phase, Read 1 st and 2 nd phase). Figure. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 03990853 | We have noted some deviations that show the influence of the neighboring stations' availability (value and rank) in the criticality of the studied station. In order to improve rebalancing operations, we think that the proposed indicator is more relevant to aid managers. | 2019 | [
"spi"
] | [
"424268",
"300163",
"424268",
"300163"
] | [
"998323"
] |
01745351 | They promise to provide much higher performances than Flash memory such as fast write/read speed, low power and good endurance (e.g. >10 12 ). | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | 12, followed by the selective read of the top-left word in the array. The write time is set to 20ns with 10ns by phase. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 00976244 | Inventory of existing QSPR models and experimental data
Inventory of existing QSPR models
Even if a l arge number of QSPR models have been developed for the prediction of physico-chemical properties required by REACH, only few references have been dedicated to models specifically developed for amines or organic peroxides. Considering amines, [START_REF] Koziol | Neural network modelling of physical properties of chemical compounds[END_REF] developed neural networks for the prediction of the boiling point of 190 compounds. | 2013 | [
"spi"
] | [
"3186",
"3186",
"3186",
"127773",
"127773"
] | [
"1314093",
"758538"
] |
01745351 | Parallel data sensing allows the impact of sneak currents to be mitigated as all the bit lines are set to the same voltage potential. We performed a simple simulation of 4×4 crossbar array and evaluated the impact of sneak currents on data sensing for different architectures. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | A CoFeB/MgO/CoFeB STT-MTJ compact model has been recently developed based on the physical theories and experimental measurements of perpendicular magnetic anisotropy (PMA) MTJ [A-16]. It integrates the physical models of static, dynamic and stochastic behaviors. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01847798 | M21 resin samples were submitted to ramps with rates ranging from 1°C/min to 100°C/min. The ramps were stopped when an important weigh loss was observed (> 90% of the initial weigth). | 2010 | [
"spi"
] | [
"110103",
"110103",
"110103"
] | [
"181726",
"20024",
"19279"
] |
01745351 | 6) is set to ~1.1ns. The word address changes between two "En_Read" pulses during ~100 ps and the data stored in this 4×4 cross-point STT-MRAM can be detected word by word in ~5ns. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | (a) Circuit diagram (b) Layout implementation at 65 nm; the size of selection transistor is about 56 F 2. Figure 2 . | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01351139 | Denote P : R n → M as the projection from R n to M (that is just a modulus of the last q coordinates over 2π). Obviously, for any x0 ∈ R n the solution X(t, x0 ; d) ∈ R n of (1) can be projected to the solution X(t, x 0 ; d) ∈ M with x 0 = P(x 0 ) ∈ M , then both solutions are defined on the same time interval and X(t, x 0 ; d) = P( X(t, x0 ; d)) for all such instants of time. | 2016 | [
"spi"
] | [
"432039",
"410272",
"123346",
"147305",
"1289"
] | [
"20438",
"759122"
] |
01745351 | The bipolar behavior is mainly due to an asymmetrical geometry of the electrode. In recent years, many studies have highlighted the good performances of non-stoichiometric HfOx [Lee08-IEDM] films used as switching layer (also used in memristors demonstrated by ). | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | 2) OxRRAM array simulation
To validate the efficiency of the proposed architecture with the OxRRAM technology, an array composed of 32 word-lines of 2 words of 16 bits including line drivers and PCSAs, as shown Fig. 11, is fully simulated. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01620297 | The DTR works at atmospheric pressure and can reach a maximum temperature of 1400 °C. The wood particles are continuously fed into the reactor using a gravimetric feeding system. | 2016 | [
"spi"
] | [
"242220",
"419691",
"92792",
"92792",
"242220"
] | [
"17552"
] |
01745351 | These issues are difficult to surmount and few efficient design solutions addressing this issue have been reported previously in the literature. In this paper, we present a new crossbar architecture based on complementary resistive switching memory. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | The MRAM storage element, MTJ nanopillar is mainly composed of three thin films: a thin oxide barrier and two ferromagnetic (FM) layers (see Fig. 3a). | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 03364134 | The initialization of this algorithm at frame one is simply done by skipping the follow-up step because all the droplets present on the image are new. The follow-up phase from one frame to another is not parallelizable. | 2022 | [
"spi"
] | [
"411575",
"1042705",
"411575",
"1042705",
"411575",
"1042705",
"411575",
"1042705"
] | [
"2771",
"13554",
"2929"
] |
01745351 | Figure 4 . 4 Figure 4. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | 2) OxRRAM Compact Model
The proposed OxRRAM modeling approach relies on a physical model accounting for both set and reset operations in bipolar resistive switching devices. In considering electric field-induced migration of oxygen vacancies within the switching layer, the model enables continuously accounting for both set and reset operations into a single master equation in which the resistance is controlled by the diameter of the conduction pathways ():
T k V q E a T k V q E a b c e l l b c e l l e e d t d m a x (1)
In equ. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01900496 | 1 . 1 Fig. | 2018 | [
"spi"
] | [
"389870",
"244047",
"389870",
"244047",
"389870",
"244047"
] | [
"5025",
"888599"
] |
01745351 | 100 A). The CMOS circuits impose definitively the density of STT-MRAM density instead of magnetic tunnel junction (MTJ) [A-11]. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | A driver is composed (Fig. 8) of one PMOS to connect a line to VDD and two NMOS to connect a line to gnd or VDD/2. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 03404673 | To the best knowledge of the authors, low Mach number flows with large temperature variations have been to date relatively ignored by these developments despite their ubiquitousness in a large variety of industrial applications, including heat exchangers, propulsion systems or nuclear or concentrated solar power plants [START_REF] Serra | Thermal large eddy simulation in a very simplified geometry of a solar receiver[END_REF][START_REF] Daguenet-Frick | Experimental analysis of the turbulent flow behavior of a textured surface proposed for asymmetric heat exchangers[END_REF][START_REF] Daguenet-Frick | Numerical investigation of a ceramic high-temperature pressurized-air solar receiver[END_REF][START_REF] Colleoni | Optimization of winglet vortex generators combined with riblets for wall/fluid heat exchange enhancement[END_REF]. Strongly anisothermal low Mach number flows suffer from the same timestep restrictions as incompressible flows using the compressible Navier-Stokes equations and would also greatly benefit from the performance and scalability improvements provided by artificial compressibility methods. | 2021 | [
"spi"
] | [
"57022",
"57022",
"57022"
] | [
"15338"
] |
01745351 | Moreover, there are parasite resistances throughout a large-65nm 580nm 410nm scale crossbar array, which leads to lots of sensing errors [A-6-12]. These issues are difficult to surmount and few efficient design solutions addressing this issue have been reported previously in the literature. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | The MIM structure is generally composed of an active layer, usually a non-stoechiometric dielectric. The bipolar behavior is mainly due to an asymmetrical geometry of the electrode. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 04323947 | To overcome such complexity for engineering designers of urban factories resulting from the big number of variables relative to the 'value chain-urban area' system, a quick and effective pathway would be to investigate feasible and sustainable value chain patterns from existing urban factories in the same urban area. Urban factories have not yet been subject to similar systemic thinking in the design of framework specific best practices to support engineering designers. | 2023 | [
"spi"
] | [
"1147960",
"1147960",
"1147960"
] | [
"746851"
] |
01745351 | 5). Resistive switching in an OxRRAM element corresponds to an abrupt change between a High Resistance State (RHRS or OFF state) and a Low Resistance State (RLRS or ON state). | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | In order to keep the same data read access speed with that of data programming, the pulse duration of "En_Read" (see also Fig. 6) is set to ~1.1ns. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01943029 | The greatest opportunity to improve health and reduce premature deaths depends on personal behavior. Behavioral causes account for nearly 40% (obesity, tobacco…) of all deaths in the United States [START_REF] Schroeder | We can do better -Improving the health of the American people[END_REF]. | 2017 | [
"spi"
] | [
"110103",
"55697",
"49478",
"139749",
"535189",
"55697",
"110103",
"300075",
"110103"
] | [
"19674",
"946609",
"19460"
] |
01745351 | For every cross-point, a common word line (WL) is connected to the bottom electrode (BE) of both resistive switching elements while their top electrode (TE) are respectively connected to bit-line (BL) and complementary bit-line ( BL ). Cell programming operation are performed in two phases, as follow: 1 st Phase: For the selected word, the common WL is grounded and all the bit-line and complementary bit-line are biased to VDD and a current flow from top to bottom electrode, to set the resistive elements to a low resistance state (RLRS) as shown Fig. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | 3b). It opens the door to build up the first true universal memory with MRAM, which should provide both large capacity (> Gigabit) and high speed (<ns). | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 03153075 | This constriction resistance is due to the current constricted to pass through the contact area (see Fig. 4). | 2020 | [
"spi"
] | [
"1051130",
"1051130",
"1051130",
"204860",
"866"
] | [
"755026",
"17503"
] |
01745351 | 2b shows the 65 nm layout implementation of the conventional STT-MRAM access design. In order to get fast switching speed (e.g. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | Array architecture
As shown in Fig. 6, the array is divided in M word per word line (e.g. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 00854783 | A classical approach when dealing with these ill-posed problems is to introduce additional information. This is the shape of the Bayesian framework [START_REF]Approche bayésienne pour les problèmes inverses[END_REF] which relates the probability of the hypothesis from both the currently achieved information (data) and previous knowldege (prior distribution) in order to compute the posterior distribution of parameters. | 2012 | [
"spi"
] | [
"1289",
"1289",
"1289",
"1289"
] | [
"1361358",
"736519",
"2794",
"18904"
] |
01745351 | In order to relieve this power issue, emerging non-volatile memoires (NVM) based on resistive switching are under intense R&D investigation by both academics and industries. Spin transfer torque magnetic random access memory (STT-MRAM) [3]; Conductive-Bridge RAM (CBRAM) [A-4] and Oxide Resistive RAM (OxR-RAM) [A-5] are among the most promising technologies. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01745351 | Figure. 9 :
9 Figure. | 2012 | [
"spi"
] | [
"1362",
"1362",
"1362",
"1362",
"1362",
"1362",
"199957",
"199957",
"199957",
"199957",
"199957"
] | [
"774684",
"738427",
"833626",
"20388",
"18361",
"177966",
"174122"
] | 01074028 | Whilst we cannot predict the outcome of an individual realization of a simulation, the mean and variance at least give us statistical estimators of the likely standard node quantity as a function of time. From this approach, we can begin to investigate whether a given node density is likely to maintain the fault in a propagation state. | 2014 | [
"spi"
] | [
"268462",
"268462",
"11769",
"161195",
"268463"
] | [
"772497",
"7318"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.