A novel graph-based framework for

state of health prediction of lithium-ion

battery Xing-Yan Yao
Visit to download the full and correct content document:
https://ebookmass.com/product/a-novel-graph-based-framework-for-state-of-health-pr
ediction-of-lithium-ion-battery-xing-yan-yao/
More products digital (pdf, epub, mobi) instant
download maybe you interests ...

First-principles investigation of aluminum

intercalation in bilayer blue phosphorene for Al-ion
battery Junhua Hao

https://ebookmass.com/product/first-principles-investigation-of-
aluminum-intercalation-in-bilayer-blue-phosphorene-for-al-ion-
battery-junhua-hao/

Novel strategies for the formulation and processing of

aluminum metal-organic framework-based sensing systems
toward environmental monitoring of metal ions Yongbiao
Hua
https://ebookmass.com/product/novel-strategies-for-the-
formulation-and-processing-of-aluminum-metal-organic-framework-
based-sensing-systems-toward-environmental-monitoring-of-metal-
ions-yongbiao-hua/

Echoes of War : A State of the Union Novel #2 Nelle

Nikole

https://ebookmass.com/product/echoes-of-war-a-state-of-the-union-
novel-2-nelle-nikole/

Rare Earth Metal-Organic Framework Hybrid Materials for

Luminescence Responsive Chemical Sensors Bing Yan

https://ebookmass.com/product/rare-earth-metal-organic-framework-
hybrid-materials-for-luminescence-responsive-chemical-sensors-
bing-yan/
The Science of Virtue: A Framework for Research Fowers

https://ebookmass.com/product/the-science-of-virtue-a-framework-
for-research-fowers/

Graph Database and Graph Computing for Power System

Analysis Renchang Dai

https://ebookmass.com/product/graph-database-and-graph-computing-
for-power-system-analysis-renchang-dai/

A Cowboy State of Mind Jennie Marts

https://ebookmass.com/product/a-cowboy-state-of-mind-jennie-
marts/

Graph neural networks for efficient learning of

mechanical properties of polycrystals Jonathan M.
Hestroffer

https://ebookmass.com/product/graph-neural-networks-for-
efficient-learning-of-mechanical-properties-of-polycrystals-
jonathan-m-hestroffer/

Machine learning approaches for prediction of fine-

grained soils liquefaction Mustafa Ozsagir

https://ebookmass.com/product/machine-learning-approaches-for-
prediction-of-fine-grained-soils-liquefaction-mustafa-ozsagir/
 Journal of Energy Storage 58 (2023) 106437

Contents lists available at ScienceDirect

Journal of Energy Storage

journal homepage: www.elsevier.com/locate/est

Research Papers

A novel graph-based framework for state of health prediction of

lithium-ion battery
Xing-Yan Yao a, *, Guolin Chen a, Michael Pecht b, Bin Chen c
a
Chongqing Engineering Laboratory for Detection Control and Integrated System, Chongqing Technology and Business University, Chongqing 400067, China
b
Center for Advanced Life Cycle Engineering, University of Maryland, College Park, MD 20742, USA
c
China Merchants Testing Vehicle Technology Research Institute Co., Ltd, Chongqing 400067, China

A R T I C L E I N F O A B S T R A C T

Keywords: State of health (SOH) plays a vital role in lithium-ion batteries (LIBs) safety, reliability and lifetime. Health
Lithium-ion battery (LIB) indicators (HIs) are a powerful approach to predict battery SOH. The existing methods for battery SOH prediction
State of health (SOH) according to HIs only consider the temporal features of HIs. The spatial features of interdependence between HIs
GraphSAGE
enrich predicational information especially for the limited data. This paper proposes a novel framework CL-
Graph neural network (GNN)
GraphSAGE to predict battery SOH based on graph neural network (GNN), which takes into both temporal
and spatial features of HIs. Firstly, the Pearson's correlation coefficients between HIs and SOH are obtained to
extract highly correlated HIs to build a graph. Subsequently, the temporal features are extracted by convolutional
neural network (CNN) and long short-term memory neural network (LSTM). Finally, the spatial features are
obtained by the graph sample aggregate (GraphSAGE) to propagate messages on a pre-defined graph structure,
which uncovers the deep information among HIs. The effectiveness of the proposed approach in predicting
battery SOH is verified by MIT, NASA datasets and the experimental datasets, and compared with CNN, LSTM
and graph convolutional network and graph attention network. The results show that the root mean square error
of the proposed approach CL-GraphSAGE can achieve 0.2 %, and the different datasets verify its feasibility.

1. Introduction
In response to extreme weather and environmental pollution, electric
vehicles are widely used in the world. Lithium-ion batteries (LIBs) are a
promising energy source for the electric vehicle due to their high energy,
low self-discharge rate, and long storage life [1,2]. Nevertheless, LIBs
performance degrades with cycle increases. The battery failure can lead
to serious or even safety accidents. Therefore, it is vital to monitor LIBs'
state and master the battery health. The state of health (SOH) of the
battery is a powerful tool to evaluate the battery current health condi­
tion and ensure battery safety and health management [3]. SOH is a
percentage of the maximum charge which can be released to the battery
rated capacity. However, SOH is difficult to predict since it cannot be
tested directly such as via terminal voltage. Moreover, the battery data
collected in the real world is a limitation. It is a challenge to obtain
precise SOH due to the lack of data and indirectly measured parameters
[4].
The methods for battery SOH prediction can be summarized as
model-based and data-driven [5]. Model-based methods include elec­
trochemical models [6,7], equivalent circuit models [8–11], and math­
ematical models [12–14]. The electrochemical model-based method
develops a model to describe the physical and chemical processes of a
battery and then evaluate the influence of the aging process on the SOH.
This method can be generally used for LIBs to obtain battery aging
trajectories. However, the electrochemical model-based method re­
quires lots of parameters, and SOH prediction performance is deter­
mined by the given parameters. In addition, the computational
complexity is high. The equivalent circuit model is based on battery
electrical characteristics combined with amounts of the dataset, and the
lithium battery is equivalent to a circuit. Compared with the

Abbreviations: LIBs, lithium-ion batteries; SOH, state of health; HIs, health indicators; CL-GraphSAGE, the proposed method in this paper; GNN, graph neural
network; GraphSAGE, graph sample aggregate; CNN, convolutional neural network; RNN, recurrent neural network; LSTM, long short-term memory neural network;
CC, the current curve of the constant current; CV, the current curve of the constant voltage; G = (V, E ), graph G, E and V are the edge and node set; RMSE, root
mean square error; MAPE, the average absolute percentage error; R2, coefficient of determination.
* Corresponding author.
E-mail address: yaoxingyan-jsj@163.com (X.-Y. Yao).

https://doi.org/10.1016/j.est.2022.106437
Received 6 June 2022; Received in revised form 14 August 2022; Accepted 14 December 2022
Available online 22 December 2022
2352-152X/© 2022 Elsevier Ltd. All rights reserved.
X.-Y. Yao et al.
electrochemical model, the computational complexity is less. Further­
more, mathematical models obtain the battery performance by large
amounts of experimental data [4]. The SOH prediction is achieved via
data analysis, fitting, trial and error, and statistical processing. In this
method, the battery physical mechanism is a black box, and the SOH
prediction is greatly affected by the experimental environment.
Data-driven methods achieve SOH prediction by utilizing battery
signals (current, voltage, temperature, internal resistance, etc.) or health
indicators (HIs) extracted from charging and discharging processes. This
method does not know the battery complex internal mechanism. With
the widespread application of artificial intelligence, machine learning
has been widely used in lithium battery SOH prediction [15]. Yang et al.
[16] employed Gaussian process regression to predict SOH by four
correlated HIs extracted from charging curves and analyzed the corre­
lation between HIs and SOH. Song et al. [17] extracted features to
describe the battery aging process and predict battery SOH. Yang et al.
[18] extracted HIs from voltage and temperature during discharge,
using a multiple kernel relevance vector machine that combined
Gaussian with sigmoid function to improve the accuracy of SOH pre­
diction. In addition, other machine learning methods such as random
forest [19], Markov chain [20], Monte Carlo [21] and ARIMA [22] are
also popular to use.
Although machine learning methods mentioned above achieved
great success in processing nonlinear relationships, they are still can be
improved to process historical data to predict battery SOH. Many re­
searchers applied recurrent neural network (RNN) [23], gate recurrent
unit (GRU) [24] and long-short term memory (LSTM) [25] to predict
SOH. In addition, some researchers have used neural ordinary differ­
ential equations and recurrent neural networks for the analysis of bat­
teries to predict SOH [26]. Kim et al. [27] used multiple features as the
input of LSTM and changed the input sequence length to reflect the
historical SOH. Cui et al. [28] proposed a dynamic spatial-temporal
attention-based gated recurrent unit (DSTA-GRU) model, which
considered both the time domain and space domain of features on SOH.
The methods above mentioned typically used the historical data of HIs to
establish the mapping between HIs and SOH. However, they ignore the
potential interdependence between HIs and the interdependence be­
tween HIs on the prediction results either. Furthermore, it is urgent to
deep mine hidden information from the limited battery data in the
application.
The graph is a special type of data structure that describes the rela­
tionship between different entities. For the problem of multi-variate
inputs, the graph uses variables as nodes, and the nodes are connected
through their hidden dependency. In recent years, graph neural network
(GNN) can effectively deal with complex graph structures and has
attracted the attention of researchers in various fields [29–31]. GNN
relies on the relationships between nodes to capture information in the
graph and optimizes the message-passing mechanism between graph
nodes to get the dependence between different variables.
GNN has already used to prediction task right now. Yu et al. [32]
used spatial-temporal graph convolutional networks to extract spatial-
temporal features from the time series of the graph structure to pre­
dict traffic flow. Khodayar et al. [33] proposed a novel graph convolu­
tional deep learning structure to predict short-term wind speed
combined with LSTM. Vyas et al. [34] proposed a dynamic GNN to
predict the soil moisture of multiple locations in a region over time.
Wang et al. [35] construct a graph structure on a sensor network with
Pearson Correlation Coefficients among sensors. In addition, they
combined graph convolutional network and temporal convolutional
networks to forecast the remaining useful life of the engine.
The data-driven approach can mine deep information in the limited
data without much prior knowledge. The CNN is a powerful deep
learning approach to extract local features. The LSTM has the advantage
of long-term memory in sequence modeling to overcome the problems of
gradient vanishing in the long sequence training. To deal with graph
structure data, GNN is a kind of algorithm that uses neural networks to
2
Journal of Energy Storage 58 (2023) 106437
learn graph structure data, extract and explore features in the graph
structure data. GNN is a promising method to deal with time series
prediction for data of spatial-temporal characteristics. The spatial
characteristic is reflected by deep mining the interdependence between
nodes of the features in the GNN, and the temporal characteristic can
also be taken into considering the historical data according to the LSTM.
As a kind of GNN, GraphSAGE can aggregate the information from nodes
of the graph, and the message passing is used to learn features in the
graph structure. Therefore, the fusion of CNN, LSTM and GraphSAGE
can mine deep information from both the spatial features and temporal
features of lithium-ion battery data to achieve SOH prediction. As far as
we know, little research on SOH using GNN is demonstrated.
In this paper, a novel framework CL-GraphSAGE for battery SOH
prediction is proposed. The HIs extracted from the charging and dis­
charging process are converted into a graph structure. The combination
of GNN and CNN-LSTM is employed for the node features and message
passing information to obtain the spatial-temporal features of the graph.
The CNN-LSTM mines the potential temporal features of historical input
of HIs data [36–38], which are used as node features of the graph
structure. GraphSAGE is used to carry out message passing in the graph
structure composed of HIs. Therefore, all the HIs can obtain comple­
mentary information from each other. The main contributions of this
paper are as follows:
• A novel framework CL-GraphSAGE is proposed to predict lithium-ion
battery SOH, which considers both the temporal and spatial features
of HIs.
• The HIs highly correlated with SOH are extracted to form a spatial-
temporal graph.
• The relationship between different HIs is deep mined and optimized
to enrich the information to predict SOH.
• Graph neural network (GNN) is the first time to use for battery
prediction problems.
The rest of the paper is organized as follows: Section 2 describes the
lithium-ion battery datasets and feature extraction. Section 3 describes
the CL-GraphSAGE SOH prediction method. Section 4 describes the re­
sults and discussions, followed by conclusions in Section 5.
2. Datasets and feature extraction
This section describes two public lithium-ion battery datasets used to
validate the method proposed in this paper. Different HIs are extracted
for these two datasets.
2.1. Datasets
NASA datasets are used to verify the proposed method [39]. The
B0005, B0006, and B0007 batteries are used. All battery charging and
discharging processes are carried out at room temperature, with a
nominal capacity of 2.0 Ah. During charging, the battery is first charged
with a CC at 1.5 A until the voltage reaches 4.2 V; it is then charged with
a CV until the current drops below 20 mA. During discharging, the
battery is discharged with CC at 2A until cut-off voltage. Repeat the
above steps until the battery reaches the end of its life (capacity loss 70
%). Fig. 1(a) shows the capacity curves of cycles.
The MIT lithium-ion battery dataset is currently the largest public
dataset used for battery degradation research [40]. The dataset consists
of 124 commercial LIBs from A123. The nominal capacity and voltage
are 1.1 Ah and 3.3 V, respectively. At 30 ◦ C, all batteries are charged
with a multistep fast-charging strategy and then discharged with a CC
process. The format of this strategy is “C1(Q1)-C2.” The battery is firstly
charged by current C1 until the state of charge reaches S1, and then it is
charged with current C2 until the state of charge reaches S2. The battery
is charged from 80 % to 100 % SOC at 1C CC-CV. The cutoff voltage is
3.6 V. Subsequently, the battery is discharged at 4C CC, and the battery
X.-Y. Yao et al. Journal of Energy Storage 58 (2023) 106437

Fig. 1. Capacity degradation curves: (a) NASA datasets; (b) MIT datasets.

life threshold is reduced to 80 % of the nominal capacity. The batteries • Voltage-related HIs. The HIs extracted from the voltage curve are
A0001, A0002, and A0003 are employed in the experiments. Fig. 1(b) similar to the current-related HIs. The areas covered under the
shows the capacity degradation of the specific cycle period. voltage curve of the CC process, CV process, and discharge process
are HIs. The maximum slope extracted from the CC process voltage
curve is also an HI.
2.2. Feature extraction
• Temperature-related HIs. During the charging and discharging pro­
cess, the temperature changes. The maximum temperature, mini­
The HIs used for data-driven approaches depend on the dataset.
mum temperature, and average temperature are taken as HIs. The
Different HIs are extracted from NASA and MIT datasets. All the
areas covered under the temperature curve of the CC process, CV
extracted HIs mentioned above are described in Table 1. The HIs
process CC-CV process and the entire charge and discharge cycle are
involved in this article are divided into four categories, which are
HIs.
voltage-related, current-related, temperature-related, and time-related
• Time-related HIs. The HIs include CC charging time, CV charging
[41–43].
time, charging time, and discharging time. In addition, the time for
the temperature to reach the peak during the discharge process is
• Current-related HIs. The areas covered under the current curve of the
also an HI.
CC process and the discharge process, the area covered under the
current curve of the CV process, the CC-CV process, and the
The HIs extracted are multidimensional features. Different HIs have
discharge process are as HIs. In addition, the maximum slope
different degrees of correlation with SOH. If all HIs are used as input, it
extracted from the CV process current curve is another HI.
will affect the prediction accuracy and easily lead to overfitting.
Therefore, given a threshold, the HIs with a lower correlation are
Table 1 eliminated, and the HIs with a higher correlation as the input of the
Four categories of HIs.
model are kept. Pearson correlation coefficient [44] is used to evaluate
HI type No. HIs the correlation between HIs and SOH.
Current-related B1 Area covered under current curves of the CC process The Pearson correlation coefficient calculates the linear correlation
B2 Area covered under current curves of CV process between HI and SOH in Eq. (1). Here, Xi and Yi are HI and SOH,
B3 Area covered under current curves of CC-CV process respectively. μX and μY are the average values, respectively. The absolute
B4 Maximum slope of current curves in CV process
B5 Area covered under current curves of discharge process
value of Pearson's correlation coefficient is in the range of [0,1]. The
Voltage-related B6 Area covered under voltage curves of CC process larger the absolute value, the stronger the correlation. In this paper, the
B7 Area covered under voltage curves of CV process 6 most relevant HIs with large absolute values are selected as the final
B8 Area covered under voltage curves of discharge process subset of HIs by the trials and errors of the experiments.
B9 Maximum slope of voltage curves in CC process ⃒ ⃒
Temperature- B10 Maximum temperature of charge and discharge cycles ⃒ ∑n ⃒
⃒ ⃒
related B11 Minimum temperature of charge and discharge cycle ⃒ (X − μ )(Y − μ ) ⃒
(1)
i=1 i X i Y
B12 Average temperature of charge and discharge cycle
ρ(X, Y) = ⃒√̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅ √ ̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
̅ ⃒
⃒ ∑n 2 ∑n 2 ⃒
B13 Area covered under temperature curves of charge and ⃒ i=1 (X i − μ X ) i=1 (Y i − μ Y ) ⃒
discharge cycle
B14 Area covered under temperature curves of the CC
process 3. Methodology
B15 Area covered under temperature curves of CV process
B16 Area covered under temperature curves of CC-CV This section describes in detail the proposed approach CL-
process GraphSAGE for the battery SOH prediction in this paper. The compo­
Time-related B17 Discharge time
B18 Charging time
nents in CL-GraphSAGE are depicted in detail, and all steps of SOH
B19 CC stage period prediction by CL-GraphSAGE are detailed descriptions.
B20 CV stage period
B21 CC stage end time
B22 Time to peak temperature during discharge 3.1. CL-GraphSAGE
B23 The time ratio of the CC process and the entire charging
process
Fig. 2 shows the proposed CL-GraphSAGE for battery SOH prediction
B24 The time for voltages increases from 3.7 V to 4.2 V
during the CC process framework. The CL-GraphSAGE includes CNN, LSTM and GraphSAGE.
B25 Time for currents decreases from 1.5 A to 0.3 A during The extracted HIs in Section 2 are used to build a graph structure. Then
the CV process the HI's temporal features are extracted by CNN and LSTM, and the
B26 Time for voltages decreases from 3.7 V to 2.7 V during spatial features are obtained by GraphSAGE. Finally, the SOH is ac­
discharging
quired by multilayer perceptron (MLP).

3
X.-Y. Yao et al. Journal of Energy Storage 58 (2023) 106437

Fig. 2. CL-GraphSAGE framework for battery SOH prediction.

The details of CL-GraphSAGE are as follows:

Table 2
Pseudocode of CL-GraphSAGE.
Step 1: Extracting and filtrating HIs. The HIs are extracted from the
original datasets. The HI subsets are derived from the Pearson cor­ 1: Input: The dataset , .
2: Calculating similarity scores between HIs and building graph structure.
relation coefficient in Eq. (1).
3: Training:
Step 2: Building a graph structure. The input of GraphSAGE is a 4: for in do:
graph. The HI subset in Step 1 needs to be converted into a graph 5: ℎ ← ( );
structure that consists of nodes and edges. Every filtrating HI is taken 6: ℎ ← (ℎ);
as one node of the graph. The similarity values between the HIs 7: ℎ ← ℎ (ℎ);
calculated by Eq. (2) are taken as edges of the graph. Therefore, the 8: ℎ ← ℎ (ℎ);
9: ℎ ← (ℎ);
graph is represented by nodes set, and the HIs sequence data are the (ℎ);
10: ←
values of the nodes. 11: Update model parameter.
Step 3: Obtaining HIs temporal features. The HIs sequence data of 12: end for
each node is used as the input of the CNN-LSTM hybrid model. The 13: Output: The SOH of .
HIs temporal features are the hidden state vector at the last moment
of LSTM output.
Step 4: Updating node messages. The GraphSAGE is used to pass
messages between graph nodes. The node message is updated by the the similarity values from the Eq. (2) [45]. xi and xj are the sample
center node, which receives all the connected node messages. All sequence at i-th and j-th nodes, respectively. xi = xi /d is the average
nodes are aggregated to obtain a global representation of the entire value of xi, and d is the number of elements of xi, and the range of i and j
graph. Finally, SOH is predicted by MLP. is [1, n].
( )
(xi − xi )T xj − xj
The pseudocode of the proposed CL-GraphSAGE is shown in Table 2. Aij = √̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅√(̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
)T ( )̅ (2)
(xi − xi )T (xi − xi ) xj − xj xj − xj

3.2. Graph structure of HIs
The determination of nodes and edges is the key to applying graph
neural network to battery SOH prediction. In this paper, HIs are regar­
ded as nodes in the graph, and HIs are connected as edges.
Assuming a graph G = (V, E ), where E and V = {v1, v2, …, vn} are
the edge and node set, respectively. Furthermore, the nodes consist of
node sets and the corresponding node values. Here, the HIs subsets are
the nodes of the graph, and the node values are obtained by the CNN-
LSTM hybrid model. |V| = n is the numbers of the HIs. For the i-th
node, vi ∈ V with T-dimension is denoted by xi. X = {x1, x2, …, xn} ∈ Rn×T
is the node feature vector.
For all the node vector V = {v1, v2, …, vn}, the HIs are connected by
After defining the nodes and edges to build the graph, the task of
SOH prediction is transformed to learn the mapping between HIs and
SOH by the given SOH value at the time t. Specifically, the HIs at
different timestamps are used as node data to generate temporal datasets
for the graph, and the SOH at the time t is used for prediction in the
graph.
3.3. Temporal feature of HIs
LSTM has been widely used in Lithium-ion battery SOH prediction.
LSTM overcomes the problem of gradient vanishing and captures the
long-term dependence of time series compared with RNN [46]. LSTM

4
X.-Y. Yao et al. Journal of Energy Storage 58 (2023) 106437

obtains the long-term dependence of time series data by using the ({ })

storage unit to store useful information and the gating mechanism to hkN (v) = Aggregate hk−j 1 , ∀j ∈ N (i) (3)
discard useless information. LSTM structure includes input gates, forget
( ( ))
gates, storage units, and output gates. The input gate saves the infor­ hki = σ W k Concat hk−i 1 , hkN (v) (4)
mation, the forget gate obtains the forgetting information, the output
gate represents the output information, and the storage unit keeps the Here, hki is the state of the i-th node in the k-th message passing, and
historical information until the current moment. N (i) is the adjacent nodes set. In Eq. (4), the Aggregate function takes the
CNN is a powerful tool to extract local hidden information of data by place of the Mean aggregation function, and Eqs. (3)–(4) are combined
multi-layer convolution operations [47]. As shown in Fig. 3, CNN is used and modified to obtain Eq. (5).
for extracting deep features from the historical information, which are ( ({ } { }))
the input of LSTM to mine temporal features of the sequence data. The hki = ReLU W • Mean hk−i 1 ∪ hk−j 1 , ∀j ∈ N (i) (5)
feature extraction of every HI time series is separated from each other,
and a one-dimensional CNN layer with one kernel of size 1 is used. HIs After obtaining the final state of all nodes, the readout function is
temporal features obtained by CNN and LSTM are used as the node used to aggregate all node representations into a global representation of
features of the graph. The temporal features of every HI constitute the the graph [48]. The global expression is obtained by one-time aggre­
temporal feature matrix X of the graph. gation of all inputs. Here, the Max function is to aggregate all nodes, and
MLP outputs the final predicted value ̂ y t as shown in Eq. (6). The number
3.4. GraphSAGE of neurons in the output layer is 1 when the SOH value is at a certain
moment. Huber loss [36] is used as the regression loss function. yt and ̂ yt
For the SOH prediction, there are two keys to building the GNN are the true value and predicted value, respectively. δ is the hyper­
model. One is to fuse the local information of nodes in the graph parameter in Eq. (7).
structure, and the other is to embed the updated nodes into vectors. In ( ({ }) )
y t = MLP Readout hki |i ∈ G
̂ (6)
this paper, GraphSAGE aggregates the information of adjacent nodes to
update nodes and obtains the interdependence between HIs. GraphSAGE ⎧
⎪ 1
is used to mine deep information between HIs of the edges in the graph. ⎪
⎪
⎪ (yt − ̂y t )2 , |yt − ̂
yt | ≤ δ
⎨ 2
Therefore, each HI node contains all information of both HI itself and L = ( ) (7)
adjacent HIs from the k-layer GraphSAGE. ⎪
⎪
⎪
1
The input of GraphSAGE is the graph G = (V, E ). The node features ⎩ δ • |yt − ̂y t | − 2 δ , otherwise
⎪

X ∈ Rn×d, that are temporal features, are obtained in Section 3.3, where n
is the number of HIs and d is the dimension of LSTM output. The simi­ 3.5. Evaluation metrics
larity between HIs is calculated to obtain the connection between nodes
of adjacency matrix A ∈ Rn×n in Section 3.2. The adjacency matrix A and The experiments are carried out by PyTorch 3.8, Intel Core i7-
the feature matrix X are used as the input of GraphSAGE. 10875H 2.30GHz CPU, and NVIDIA GEFORCE RTX 2060 GPU. Adam
Fig. 4 shows the aggregation process of GraphSAGE for the given is the optimizer, the learning rate is 8e-4, the δ in the Huber loss objective
graph. Fig. 4(b) displays the corresponding topological and node fea­ function is set to 1, the number of training epochs is 1500, and the batch
tures by the given graph structure in Fig. 4(a). Taking the red node A in size is 16. Root mean square error (RMSE), average absolute percentage
Fig. 4(a) as an example, GraphSAGE updates the information of the node error (MAPE), and coefficient of determination (R2) are used to evaluate
A by fusing the neighborhoods' information. To update nodes at k-layer, performances, which are as follows:
the information of the adjacent nodes is first aggregated to hkN (v) by the √̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅̅
aggregation function and then integrated and updated with the central 1∑ n
RMSE = (yi − ̂ y i )2 (8)
node state hk−
i
1
, which are shown in Eqs. (3)–(4). Then the aggregated n i=1
k
embeddings hN (i) are obtained by the neighborhood aggregation which
is fused with the node information of the previous layer hk− 1
. 1∑ n
|yi − ̂y i |
i MAPE = × 100% (9)
n i=1 yi

h1 h2 h3 ht

LSTM LSTM LSTM LSTM

x1 x2 x3 xt

LSTM
Dimension
HIs LSTM

.. ..
Dimension

LSTM
concat
..
HIs

LSTM

LSTM
HIs Feature matrix
LSTM

Fig. 3. Temporal feature matrix of HIs.

5
X.-Y. Yao et al. Journal of Energy Storage 58 (2023) 106437

A
(a) (b)
B
E
Aggregate
A
D C B
D

Aggregate Aggregate Aggregate

C
F
A F A A E

Fig. 4. Aggregation process of GraphSAGE: (a) the given graph; (b) aggregated embedding.

∑
n carried out for the comparative experiments. The training data are
y i )2
(yi − ̂
R2 = 1 − i=1
∑n
(yi − yi )2
i=1
4. Experiments
This section validates the performances of CL-GraphSAGE to predict
the SOH for different lithium-ion battery datasets. The three different
datasets are employed to discuss the performance by comparing with
different models.
4.1. Experiment for NASA dataset
According to HIs in Table 1 described in Section 2.2 and battery
characteristics in Fig. 1(a). HIs are extracted from the NASA dataset. The
correlation coefficient between HIs and SOH is obtained according to Eq.
(2) shown in Table 3.
The first 6 high-correlation HIs (B1, B3, B6, B21, B24, and B26) are
adopted as model inputs from Table 3. The similarity of HIs is calculated
by Eq. (2). Fig. 5 shows the similarities between nodes. Two nodes with a
similarity of 0.95 or more are connected into an edge. Taking B0005 as
an example, as shown in Fig. 5(a), the similarities between HIs are all
greater than 0.99. The nodes with a similarity of more than 0.95 are
connected. Therefore, the six HIs are all connected as edges of the graph,
and the graph structure is shown in Fig. 5(d). In Fig. 5(a)–(c), the sim­
ilarity of HIs is greater than 0.95, and the graph structures are fully
connected graphs.
The starting point is of great influence on the prediction results. The
data before the starting point are used for training the model, and the
remaining data are used for testing. Two kinds of training strategies are
chosen as the first 80 cycles and the first 100 cycles, respectively, and
(10) the corresponding remaining cycles are used as test data.
For the performance comparison, all the models are designed as
multi-input and single-output. The 6 HIs selected above as the input of
the models, and the battery SOH is the output of the models. The RNN is
a classic approach to process sequence data and predicts battery SOH.
RNN is a kind of neural network with sequence data as input. The output
not only depends on the input at the current time but also is related to
the input at the previous time. LSTM is a variant of RNN to improve the
performance of RNN by overcoming the gradient vanishing when
dealing with long-term memory. To mine the deep temporal features for
the HIs sequence data, the CNN is combined with LSTM to predict SOH.
In addition, GNN is used in the proposed CL-GraphSAGE to mine rele­
vant information between HIs to obtain the spatial features of HIs.
Through comparative verification, GNN has improved the SOH predic­
tion accuracy. The performance of three models RNN, LSTM, and CNN-
LSTM are compared with CL-GraphSAGE.
Fig. 6 shows the results starting at 81of the four models in B0005,
B0006, and B0007. Table 4 shows the performance evaluation of the
four models from the different starting points. The RMSE of RNN and
LSTM are both larger than 0.04, and the MAPE is larger than 4.5. The
RMSE of CNN-LSTM and CL-GraphSAGE are both less than 0.035, and
the MAPE are both less than 3.5. In some experiments, R2 of LSTM and
RNN is even less than 0, which indicates that LSTM and RNN have poor
adaptability and poor predictive ability in these cases. Therefore, the
performance of RNN and LSTM in these three batteries is worse than that
of CNN-LSTM and CL-GraphSAGE. As cycle numbers increase, the pre­
dicted result tends to be a straight line and cannot reflect the nonlinear
capacity degradation trend. However, in Fig. 6(c), the predicted result of
CNN-LSTM is consistent with that of RNN and LSTM, which is quite
different from the true SOH.

Table 3
Descending order of correlation coefficient of HIs.
Sample Sort in descending order (from left to right, top to bottom)

B0005 B26 0.998255 B6 0.996169 B3 0.996047 B21 0.996046

B1 0.996038 B24 0.996032 B25 0.994137 B14 0.989574
B2 0.988875 B23 0.988454 B15 0.988875 B9 0.894633
B4 0.615588 B16 0.311356
B0006 B26 0.993706 B3 0.991352 B21 0.990314 B6 0.990308
B24 0.989723 B1 0.988990 B25 0.988074 B14 0.986618
B23 0.986446 B9 0.961140 B2 0.938323 B15 0.929285
B4 0.628557 B16 0.201432
B0007 B26 0.998064 B21 0.992642 B3 0.992558 B1 0.992296
B6 0.992217 B24 0.988901 B23 0.982533 B14 0.980917
B2 0.961393 B15 0.883181 B9 0.694442 B4 0.635587
B25 0.362327 B16 0.288703

The bold in the table are the selected HIs which is the input of the model in this case study.

6
X.-Y. Yao et al.
Fig. 5. Node similarity and graph structure: (a) B0005; (b) B0006; (c) B0007; (d) graph of B0005 HIs.
Fig. 6. Prediction results at starting point of 81: (a) B0005; (b) B0006; (c) B0007.
However, the predicted results by CL-GraphSAGE can still capture
the tendency of capacity degradation, which indicates the proposed CL-
GraphSAGE is feasibility to the battery SOH prediction. The RMSE and
MAPE of CL-GraphSAGE are the lowest among the three experiments. In
battery B0007, the RMSE and MAPE are 0.019028 and 2.383225,
respectively, which are much lower than CNN-LSTM. The prediction
results of CL-GraphSAGE show good performance. Compared with the
other three models in Table 4, CL-GraphSAGE makes full use of the
spatio-temporal features of HIs. CL-GraphSAGE can mine the relation­
ship information between HIs and is better for SOH prediction.
Fig. 7 shows results starting at 101 of the four models in B0005,
B0006, and B0007. According to Fig. 7, the prediction results of the
three models are closer to the actual capacity degradation trend by using
more training data. The RMSE and MAPE of RNN and LSTM are larger
than those of CNN-LSTM and CL-GraphSAGE.
Table 4 shows the prediction errors of the four models at different
starting points for different lithium-ion battery samples. In Table 4, both
7
Journal of Energy Storage 58 (2023) 106437
RMSE and MAPE of CL-GraphSAGE are the lowest compared with CNN-
LSTM, which shows good prediction performance. Moreover, CL-
GraphSAGE predicts accurately when the starting point is 101
compared with the starting point at 81. The results show that regardless
of whether the prediction starting point is 81 or 101, CL-GraphSAGE is
the best choice.
4.2. Experiment of MIT dataset
According to HIs in Table 1 described in Section 2.2 and battery
capacity in Fig. 1(b), all HIs extracted from the MIT dataset and the
correlation coefficient between HIs and SOH are obtained according to
Eq. (2) are shown in Table 5. The first six high-correlation HIs (B1, B5,
B6, B8, B17, and B19) are selected as model inputs.
The method to construct the nodes and edges of the graph is the same
as in Section 4.1. Fig. 8 shows the similarities between nodes. The
similarity values are displayed in Fig. 8(a)–(c). The two nodes are
X.-Y. Yao et al. Journal of Energy Storage 58 (2023) 106437

Table 4 which is the lowest RMSE, MAPE with the highest R2.
Predicting errors at different starting points by different models. Experiment results show that the proposed method is better than the
Sample Model Starting RMSE MAPE R2 comparison model in terms of SOH prediction. Compared with the other
points three models, CL-GraphSAGE can obtain not only the temporal features
B0005 RNN 81 0.062645 7.892090 − 1.247296 of HIs using CNN and LSTM but also the spatial features between HIs.
LSTM 0.058334 7.331871 − 0.948624 Therefore, CL-GraphSAGE can make full use of the interrelationships
CNN-LSTM 0.011572 1.338180 0.923311 between different HIs to deep mine more useful potential features. The
CL- 0.008281 1.105863 0.960732 fluctuation range of the prediction error of CL-GraphSAGE is smaller for
GraphSAGE
RNN 101 0.040255 5.148115 − 1.002669
SOH prediction compared with the other three models.
LSTM 0.018398 2.179895 0.581690
CNN-LSTM 0.006289 0.720849 0.951118 4.3. Experiment of laboratory dataset
CL- 0.005808 0.625176 0.958309
GraphSAGE
B0006 RNN 81 0.046791 5.955632 0.131731 In this section, the lithium-ion battery dataset carried out in the
LSTM 0.041631 5.451267 0.312677 laboratory is used to validate the feasibility of CL-GraphSAGE. The ex­
CNN-LSTM 0.013927 1.802672 0.923077 periments are carried out in China Merchants Testing Vehicle Technol­
CL- 0.011475 1.470694 0.947783 ogy Research Institute Co., Ltd. The BAT-NEEFLCT-05500 from NEBULA
GraphSAGE
RNN 101 0.036882 4.796715 0.130402
Co., Ltd. is used to cycle the batteries. The data is collected by Agilent
LSTM 0.027935 3.581093 0.501154 34901A.
CNN-LSTM 0.013923 1.884062 0.876073 The batteries go through 4 steps in each cycle: 1) Discharging CC at
CL- 0.010859 1.331990 0.924613 58A until the voltage drop to 2.5 V. 2) The battery is rest for 1800 s. 3)
GraphSAGE
Charging CC at 38.86 A until the voltage increases to 4.25 V, then CV at
B0007 RNN 81 0.045730 5.199274 − 0.879691
LSTM 0.041061 4.671529 − 0.515507 4.25 V until the current drop to 2.9A. 4) Resting 1800 s.
CNN-LSTM 0.031836 3.398467 0.088939 Five strongly correlated HIs (B3, B5, B8, B17, B26) are taken as
CL- 0.019028 2.383225 0.674550 model input from the charge-discharge curves as CL-GraphSAGE input
GraphSAGE by using HIs extracted in Section 2.2. The predicted results are shown in
RNN 101 0.025090 2.852394 − 0.096398
LSTM 0.015771 1.766805 0.566800
Fig. 10. Fig. 10 shows that the CL-GraphSAGE well captures the degra­
CNN-LSTM 0.008994 0.956124 0.859108 dation of LIBs. The RMSE and R2 are 0.003688 and 0.986188, respec­
CL- 0.005314 0.606468 0.950810 tively. Both RMSE and R2 verify the effectiveness of CL-GraphSAGE.
GraphSAGE

4.4. Experiment of different graph models

connected when the similarity value is more than 0.95. All the graph
structures are fully connected graphs. Fig. 8(d) shows the graph struc­
tures of the battery B0005 HIs.
Compared with the NASA dataset, the MIT dataset has more cycles
and a larger amount of data. Different training method is employed in
the MIT dataset. A0001 is used for training, and A0002 and A0003 are
used for testing.
Fig. 9 shows the prediction results and errors. Table 6 shows the
performance evaluation of the four models. Compared with the other
three models, CL-GraphSAGE obtains the best prediction performance,
Instead of using GraphSAGE in the NASA dataset, combined with
CNN and LSTM, the graph convolutional network (GCN) and graph
attention network (GAT) which are CL-GCN and CL-GAT used to
compare with the CL-GraphSAGE. The results are shown in Fig. 11 and
Table 7. The results are similar to that of CL-GAT and CL-GraphSAGE.
However, the running time of CL-GCN, CL-GAT, and CL-GraphSAGE
are 169.21 s, 462.63 s, and 110.38 s, respectively. The execution time
of CL-GAT is more than four times that of CL-GraphSAGE. In terms of
time cost and prediction accuracy, CL-GraphSAGE is the best of the three
GCNs proposed in this paper to obtain the spatial features of HIs.

Fig. 7. Prediction results at starting point of 101: (a) B0005; (b) B0006; (c) B0007.

8
X.-Y. Yao et al. Journal of Energy Storage 58 (2023) 106437

Table 5
Descending order of correlation coefficient for HIs.
Sample Sort in descending order (from left to right, top to bottom)

A0001 B17 0.999098 B19 0.998555 B6 0.998443 B1 0.998323

B5 0.997899 B8 0.996969 B13 0.978474 B22 0.975399
B20 0.749903 B7 0.748421 B18 0.726796 B2 0.508062
B10 0.398186 B12 0.192002 B11 0.140236
A0002 B19 0.998027 B6 0.997991 B1 0.997727 B17 0.996563
B5 0.995133 B8 0.992152 B13 0.970764 B22 0.969931
B12 0.733495 B20 0.728244 B7 0.727605 B10 0.695812
B18 0.690713 B11 0.646046 B2 0.250485
A0003 B19 0.998105 B6 0.998042 B1 0.997935 B17 0.996740
B5 0.995852 B8 0.993183 B13 0.970857 B22 0.963337
B18 0.677841 B20 0.611967 B7 0.611051 B10 0.309357
B12 0.171201 B11 0.038053 B2 0.036999

The bold in the table are the selected HIs which is the input of the model in this case.

Fig. 8. Node similarity and graph structure: (a) A0001; (b) A0002; (c) A0003; (d) graph of A0001 HIs.

Fig. 9. SOH prediction results: (a) A0002; (b) A0003.

9
X.-Y. Yao et al. Journal of Energy Storage 58 (2023) 106437

Table 6 compared with RNN, LSTM, and CNN-LSTM.

Performance evaluation with different models. It is understood that there is little research on GNN in LIBs. This work
Sample Model RMSE MAPE R2 opens a new door for using GNNs to process various structural or un­
structured data of batteries. Naturally, there are some limitations to the
A0002 RNN 0.003048 0.264716 0.993135
LSTM 0.002468 0.215389 0.995500 method. The future work includes: (1) The correlated HIs extracted
CNN-LSTM 0.003383 0.266529 0.991545 based on partial charge-discharge curves will be developed in the future.
CL-GraphSAGE 0.002070 0.197313 0.996834 (2) The edges connected are fixed weight by calculating the Pearson
A0003 RNN 0.004226 0.353931 0.987291 correlation coefficient in the proposed approach, which are all fully
LSTM 0.002776 0.266655 0.994514
CNN-LSTM 0.003361 0.304047 0.991960
connected in the graph. Hence, the weight of the edges can be designed
CL-GraphSAGE 0.002114 0.184998 0.996818 to update automatically to determine which edge to connect adaptively.
(3) GNN can also be applied to other aspects of batteries, such as
remaining life prediction, thermal runaway warning, and fault
diagnosis.

CRediT authorship contribution statement

Xing-Yan Yao: Conception, Methodology, Validation, Formal anal­

ysis, Investigation, Writing - Original Draft, Writing - Review & Editing,
Visualization, Guolin Chen: Conceptualization, Methodology, Software,
Validation, Writing, Bin Chen: providing dataset, Michael Pecht: Re­
view, Supervision.

Declaration of competing interest

The authors declare that they have no known competing financial

interests or personal relationships that could have appeared to influence
the work reported in this paper.

Fig. 10. Prediction results of CL-GraphSAGE. Data availability

Data will be made available on request.

Acknowledgments

This work is partially supported by the National Natural Science

Foundation of China (51605061); Science and Technology Research
Project of Chongqing Municipal Education Commission
(KJQN201900808); Natural Science Foundation of Chongqing, China
(cstc2020jcyj-msxmX0736); Innovation and Entrepreneurship Demon­
stration Team of Chongqing Talent Plan (CQYC201903246); Startup
Project of Doctor Scientific Research (2016-56-04) and Open Grant of
Chongqing Engineering Laboratory for Detection Control and Integrated
System (KFJJ2021018). The valuable comments and suggestions from
Fig. 11. Results of the three GNN models. the anonymous reviewer are appreciated. Thanks for NASA and MIT
provide the battery datasets.
Table 7
Errors of the three GNN models. References
Method RMSE MAPE R2 [1] X. Hu, F. Feng, K. Liu, et al., State estimation for advanced battery management:
CL-GCN 0.020253 2.504092 0.493080 key challenges and future trends[J], Renew. Sust. Energ. Rev. 114 (2019), 109334.
CL-GAT 0.006454 0.505244 0.948513 [2] P.M. Attia, A. Grover, N. Jin, et al., Closed-loop optimization of fast-charging
protocols for batteries with machine learning[J], Nature 578 (7795) (2020)
CL-GraphSAGE 0.005808 0.625176 0.958309
397–402.
[3] X. Tang, C. Zou, K. Yao, et al., A fast estimation algorithm for lithium-ion battery
state of health[J], J. Power Sources 396 (2018) 453–458.
5. Conclusions [4] H. Tian, P. Qin, K. Li, et al., A review of the state of health for lithium-ion batteries:
research status and suggestions[J], J. Clean. Prod. 261 (2020), 120813.
[5] R. Xiong, L. Li, J. Tian, Towards a smarter battery management system: a critical
The current lithium-ion battery SOH predicted methods by health
review on battery state of health monitoring methods[J], J. Power Sources 405
indicators only take time features into account and ignore the rela­ (2018) 18–29.
tionship between different features especially for the limited data in the [6] J. Li, K. Adewuyi, N. Lotfi, et al., A single particle model with chemical/mechanical
application. In this paper, a novel GNN-based framework is proposed for degradation physics for lithium ion battery state of health (SOH) estimation[J],
Appl. Energy 212 (2018) 1178–1190.
SOH prediction, which considers both the temporal features and the [7] G.K. Prasad, C.D. Rahn, Model based identification of aging parameters in lithium
spatial features of HIs for the limited data. The validation and feasibility ion batteries[J], J. Power Sources 232 (2013) 79–85.
of the proposed CL-GraphSAGE are proved by public battery datasets [8] X. Hu, H. Yuan, C. Zou, et al., Co-estimation of state of charge and state of health
for lithium-ion batteries based on fractional-order calculus[J], IEEE Trans. Veh.
and laboratory experiments. The results show that the CL-GraphSAGE Technol. 67 (11) (2018) 10319–10329.
reached minimum error and predicts more accurately and precisely [9] Z. Guo, X. Qiu, G. Hou, et al., State of health estimation for lithium ion batteries
based on charging curves[J], J. Power Sources 249 (2014) 457–462.

10
X.-Y. Yao et al.
[10] J. Kim, B.H. Cho, State-of-charge estimation and state-of-health prediction of a li-
ion degraded battery based on an EKF combined with a per-unit system[J], IEEE
Trans. Veh. Technol. 60 (9) (2011) 4249–4260.
[11] J. Yang, B. Xia, W. Huang, et al., Online state-of-health estimation for lithium-ion
batteries using constant-voltage charging current analysis[J], Appl. Energy 212
(2018) 1589–1600.
[12] X. Feng, J. Li, M. Ouyang, et al., Using probability density function to evaluate the
state of health of lithium-ion batteries[J], J. Power Sources 232 (2013) 209–218.
[13] A. Guha, A. Patra, State of health estimation of lithium-ion batteries using capacity
fade and internal resistance growth models[J], IEEE Trans. Transp. Electrification
4 (1) (2017) 135–146.
[14] P. Singh, C. Chen, C.M. Tan, et al., Semi-empirical capacity fading model for SoH
estimation of li-ion batteries[J], Appl. Sci. 9 (15) (2019) 3012.
[15] Z. Deng, X. Hu, P. Li, et al., Data-driven battery state of health estimation based on
random partial charging data[J], IEEE Trans. Power Electron. 37 (5) (2021)
5021–5031.
[16] D. Yang, X. Zhang, R. Pan, et al., A novel gaussian process regression model for
state-of-health estimation of lithium-ion battery using charging curve[J], J. Power
Sources 384 (2018) 387–395.
[17] S. Song, C. Fei, H. Xia, Lithium-ion battery SOH estimation based on XGBoost
algorithm with accuracy correction[J], Energies 13 (4) (2020) 812.
[18] Y. Yang, J. Wen, Y. Shi, et al., State of health prediction of lithium-ion batteries
based on the discharge voltage and temperature[J], Electronics 10 (12) (2021)
1497.
[19] K.S.R. Mawonou, A. Eddahech, D. Dumur, et al., State-of-health estimators coupled
to a random forest approach for lithium-ion battery aging factor ranking[J],
J. Power Sources 484 (2021), 229154.
[20] R. Xiong, J. Cao, Q. Yu, Reinforcement learning-based real-time power
management for hybrid energy storage system in the plug-in hybrid electric vehicle
[J], Appl. Energy 211 (2018) 538–548.
[21] R. Xiong, Y. Zhang, J. Wang, et al., Lithium-ion battery health prognosis based on a
real battery management system used in electric vehicles[J], IEEE Trans. Veh.
Technol. 68 (5) (2018) 4110–4121.
[22] Z. Yun, W. Qin, W. Shi, et al., State-of-health prediction for lithium-ion batteries
based on a novel hybrid approach[J], Energies 13 (18) (2020) 4858.
[23] P. Venugopal, State-of-health estimation of li-ion batteries in electric vehicle using
IndRNN under variable load condition[J], Energies 12 (22) (2019) 4338.
[24] Y. Fan, F. Xiao, C. Li, et al., A novel deep learning framework for state of health
estimation of lithium-ion battery[J], J. Energy Storage 32 (2020), 101741.
[25] Z. Deng, X. Lin, J. Cai, et al., Battery health estimation with degradation pattern
recognition and transfer learning[J], J. Power Sources 525 (2022), 231027.
[26] S. Pepe, J. Liu, E. Quattrocchi, et al., Neural ordinary differential equations and
recurrent neural networks for predicting the state of health of batteries[J],
J. Energy Storage 50 (2022), 104209.
[27] S.J. Kim, S.H. Kim, H.M. Lee, State of health estimation of Li-ion batteries using
multi-input LSTM with optimal sequence length[C], in: 2020 IEEE 29th
International Symposium on Industrial Electronics (ISIE), IEEE, 2020,
pp. 1336–1341.
[28] S. Cui, I. Joe, A dynamic spatial-temporal attention-based GRU model with healthy
features for state-of-health estimation of lithium-ion batteries[J], IEEE Access 9
(2021) 27374–27388.
11
Journal of Energy Storage 58 (2023) 106437
[29] Z. Wu, S. Pan, G. Long, Connecting the dots: multivariate time series forecasting
with graph neural networks[C], in: Proceedings of the 26th ACM SIGKDD
International Conference on Knowledge Discovery & Data Mining, 2020,
pp. 753–763.
[30] H. Xu, Y. Huang, Z. Duan, Multivariate Time Series Forecasting With Transfer
Entropy Graph[J], arXiv preprint arXiv:2005.01185, 2020.
[31] Y. Wang, Z. Duan, Y. Huang, et al., MTHetGNN: a heterogeneous graph embedding
framework for multivariate time series forecasting[J], Pattern Recogn. Lett. 153
(2022) 151–158.
[32] B. Yu, H. Yin, Z. Zhu, Spatio-temporal Graph Convolutional Networks: A Deep
Learning Framework for Traffic Forecasting[J], arXiv preprint arXiv:1709.04875,
2017.
[33] M. Khodayar, J. Wang, Spatio-temporal graph deep neural network for short-term
wind speed forecasting[J], IEEE Trans. Sustain. Energy 10 (2) (2018) 670–681.
[34] A. Vyas, S. Bandyopadhyay, Semi-supervised Soil Moisture Prediction Through
Graph Neural Networks[J], arXiv preprint arXiv:2012.03506, 2020.
[35] M. Wang, Y. Li, Y. Zhang, et al., Spatio-temporal graph convolutional neural
network for remaining useful life estimation of aircraft engines[J], Aerosp. Syst. 4
(1) (2021) 29–36.
[36] B. Zraibi, C. Okar, H. Chaoui, et al., Remaining useful life assessment for lithium-
ion batteries using CNN-LSTM-DNN hybrid method[J], IEEE Trans. Veh. Technol.
70 (5) (2021) 4252–4261.
[37] X. Song, F. Yang, D. Wang, et al., Combined CNN-LSTM network for state-of-charge
estimation of lithium-ion batteries[J], IEEE Access 7 (2019) 88894–88902.
[38] G. Zou, Z. Yan, C. Zhang, Transfer learning with CNN-LSTM model for capacity
prediction of lithium-ion batteries under small sample[C], in: Journal of Physics:
Conference Series 2258(1), IOP Publishing, 2022, p. 012042.
[39] B. Sahaand, K. Goebel, Battery Data Set, NASA Ames Prognostics Data Repository
[J], NASA Ames Research Center, 2007.
[40] K.A. Severson, P.M. Attia, N. Jin, et al., Data-driven prediction of battery cycle life
before capacity degradation[J], Nat. Energy 4 (5) (2019) 383–391.
[41] Z. Fei, F. Yang, K.L. Tsui, et al., Early prediction of battery lifetime via a machine
learning based framework[J], Energy 225 (2021), 120205.
[42] P. Guo, Z. Cheng, L. Yang, A data-driven remaining capacity estimation approach
for lithium-ion batteries based on charging health feature extraction[J], J. Power
Sources 412 (2019) 442–450.
[43] Y. Li, D.I. Stroe, Y. Cheng, et al., On the feature selection for battery state of health
estimation based on charging–discharging profiles[J], J. Energy Storage 33 (2021),
102122.
[44] G. Chandrashekar, F. Sahin, A survey on feature selection methods[J], Comput.
Electr. Eng. 40 (1) (2014) 16–28.
[45] L. Qiao, L. Zhang, S. Chen, et al., Data-driven graph construction and graph
learning: a review[J], Neurocomputing 312 (2018) 336–351.
[46] J. Niu, C. Liu, L. Zhang, Remaining useful life prediction of machining tools by 1D-
CNN LSTM network[C], in: 2019 IEEE Symposium Series on Computational
Intelligence (SSCI), IEEE, 2019, pp. 1056–1063.
[47] T.Y. Kim, S.B. Cho, Predicting residential energy consumption using CNN-LSTM
neural networks[J], Energy 182 (2019) 72–81.
[48] J. Gilmer, S.S. Schoenholz, P.F. Riley, Neural message passing for quantum
chemistry[C], in: International Conference on Machine Learning. PMLR, 2017,
pp. 1263–1272.
Another random document with
no related content on Scribd:
 Si je vous le disais pourtant !… Si je vous disais que je n’ai pour
vous ni tendresse, ni faiblesse, nulle amitié, que je suis sans
confiance, que je ne sens pas même cette obscure sympathie qu’il
arrive de donner à une passante. Jamais ne m’abandonnerai.
Jamais ne m’apitoierai. Le misérable destin de l’humanité, ce n’est
pas toi, — ou c’est bien toi, de la tête aux pieds. Nulle autre que toi.

Est-ce que tant de fragilité finira par m’émouvoir ? Est-ce que

j’aurai besoin d’imaginer ce que j’aurais souffert, quand tu m’aurais
trompé, si je t’avais aimée.

Blonde, ce n’est rien dire. Tu es comme les blés à l’instant qu’ils

ont cessé d’être verts. Comme une jeune pousse. Comme une boîte
de poudre de riz ouverte dans un rayon de soleil.

Tu peux bien pleurer, à présent, tu peux bien pleurer à te rompre

les veines.
Tu sens à cette heure sans lumière quelle solitude est la tienne,
que dans toutes les maisons du monde vivent des cœurs amis, et
nul qui batte pour toi, non certes le mien, tu dois pourtant le deviner.
Tu écoutes chanter la petite fille qui saute à la corde sous le
reverbère. Tu te souviens de ta propre enfance et que tu te croyais
assez bonne. Tu penses qu’un jour tu seras vieille, une laide vieille,
à peine cette fleur de ta joue sera-t-elle fanée.
Malheureuse, à quoi penses-tu ? A quoi penses-tu donc,
malheureuse, qu’un homme a plaisir à oublier ?
 La Déesse Raison

Vous avez beau dire. Vous êtes une sorte de pieuse femme, dont
la dévotion est à rebours.
Si vous étiez païenne vraie, vous compteriez douze grands
dieux, ou du moins une foule de petits dieux d’humeur variable.
Il y en aurait un que vous chéririez par dessus tout : celui qui
nous a conduits, vous et moi, jusqu’au même lit sombre. Vous
rappelez-vous que nous avons tout à coup cessé de nous bien voir ?
Il avait mis son bandeau sur nos yeux.
Il s’est enfui, lorsqu’il a vu que vous étiez plus près de pleurer,
ingrate, que de rire.
Vous dites que c’était votre conscience. O ma pauvre amie !

Nous nous connaissions à peine, oui. Le premier enchantement

passé, vous vous apercevez que vous ne me connaissez pas du
tout. Il était bien temps ! Si vous aviez été bonne catholique…
Je sais (ne grincez pas des dents) que, si vous aviez été bonne
catholique, vous pouviez pécher de même. Sans doute, auriez-vous
été plus curieuse de mon âme, — bonne précaution — plus curieuse
de mon caractère, et vous seriez tourmentée, peut-être désespérée :
vous n’auriez pas un tel dépit.

Nous ne disputerions pas comme nous faisons, au travers de nos

baisers… Quel sera le dernier ? Nous ne croiserions pas
méchamment nos paroles, nos regards, nos silences.
 Votre belle bouche, je me demande si vous ne la frottez pas
quelquefois de ce piment qu’on nomme en espagnol diablotin. C’est
du feu.

A chaque nouvel amant, George Sand croyait avoir reçu un ordre

d’En Haut. Vous n’avez pas fait tant d’expériences qu’elle, mais plus
avancée dans la contre-église, vous n’avez pas la ressource de vous
croire en communication avec l’Etre Suprême.
Vous ne croyez pas au dieu des bonnes gens. Votre dieu est une
espèce d’Américain qui ne s’est dérangé qu’une seule fois, au
commencement des choses. Depuis, pour rien au monde ! Si vous
saviez comme il m’agace, cet hérétique, vous vous tairiez sur cela,
comme j’ai la politesse de faire, moi qui ne vous en dis presque rien.
Vous me laisseriez adorer en paix votre personne.

Décidément, si j’avais vécu du temps de George Sand, je me

serais épris d’elle à force de la détester.

Vous me laisseriez vous adorer. Connaissez-vous l’étymologie de

ce verbe ?
Tais-toi, ferme ta bouche, que je l’embrasse une fois, dix fois :
voilà l’étymologie demandée, celle que je préfère (os, oris, la
bouche, et non pas orare, parler).
Quant à embrasser, c’est prendre dans ses bras. Comme l’un ne
va guère sans l’autre, le sens dérivé a prévalu.

Vous m’avez dit un jour que vous désiriez voter, que c’était votre
droit.
Vous ne m’avez pas encore pardonné mon rire. Vous avez
excommunié comme il faut ce clérical et cet athée. Mais il avait vos
bras sur lui : la chaleur de votre forme passait par eux, comme si
votre sang s’était répandu dans ses propres veines. Il n’a pas ri
longtemps.

Par surcroît, vos parents anarchistes vous ont nommée Liberté !

Bigre ! Il n’y a pas de nom de sainte qui ne soit plus aimable.

Vous êtes capable de vous imaginer que je vous méprise.

Enfermée que vous êtes dans vos idées comme dans une bouderie,
vous devinez mal la tendresse, la sympathie, la charité humaine.
Eve bien renfrognée…
Chacun de nous est si seul au monde ! Il n’y a bonheur que de
refermer ses bras sur une autre ombre. L’on imagine un instant que
le cercle est franchi. Ce sont les âmes qui se veulent marier, et il est
dur de penser que les corps y réussissent à peine.

Lorsque je m’éloigne de vous, avant de me rapprocher encore, et

que vous percevez les deux temps de cette action d’admirateur,
vous rougissez, avec un petit sourire d’orgueil. C’est un mélange
que j’aime.
Ce qui émeut en votre visage, avec le regard, c’est la lèvre
pourpre et gonflée, le menton un peu gras, moins parfait, plus
humain. Sentirez-vous combien me séduit ce corps glorieux, la belle
hanche, cet arc de la taille ; et ce port, qui donne envie de vous
invoquer ?
Je vous ai montré l’image des trois Grâces de Regnault.
Celle de gauche, la tête un peu lourde, serait encore plus triste
qu’elle ne plairait pas moins. Sous le bel œil rêveur, le menton est
malheureux, l’épaule un peu serve ou vieillie. Le torse, un beau
vase. — Son visage, doucement incliné sur l’épaule, au-dessus du
bras qui l’enlace, celle de droite a un air de candeur : et, dans le
profil de son jeune corps, une légère courbe à rendre fou. — Mais la
plus belle, n’est-ce pas cette blonde, entre elles, qui les tient
chastement embrassées, et dont nul ne verra jamais le visage ?
Elles ne ressemblent pas l’une à l’autre, ni vous à elles. Vous
êtes pourtant du même style.

Ah ! Romaine. Ah ! Guerrière. Minerve aux sourcils rejoints.

Je mettrai devant votre portrait une branche de myrte dans un
vieux vase d’église, blanc et or, 1830.

Vous souvenez-vous ? Vous ne vous donniez pas alors la peine

de m’étudier. Vous me regardiez, ô raisonneuse ! Amour vous
possédait. Vous baissiez de temps en temps les yeux.
Au loin, les gamins arabes s’évertuaient : Le Cri d’Altjé ! Les
Noubielles ! [1]
[1] Le Cri d’Alger, les Nouvelles, journaux algériens du
soir.

Votre maison était à la frontière des deux empires. Elle regardait

le boulevard, la poste et l’école (laïque) ; de l’autre côté, l’allée sous
les palmes, les escaliers, les terrasses, le ciel : cet autre monde que
vous n’aimez guère, où j’allais trop souvent écouter les chants de
Yamina ou voir danser les Andalouses. Je vous apportais des
dattes, des massepains espagnols, des loucoumes. Et je crois, à
présent, que vous aurez préféré des petits beurres — L. U. — J’ai
cherché aussi, mais vainement, ces laitages italiens, frais dans leurs
claies ou sur le linge, et qui ont la forme d’une tresse ou d’un fruit, —
ces fromages, si l’on ose dire, dont les bergers de Virgile
nourrissaient déjà leurs amours.
La lumière vous gêna soudain comme un tiers.
Vous avez déroulé le rideau de toile. Dans l’ombre, miroita toute
l’eau répandue sur les dalles blanches et noires. Le jour mettait à la
haute fenêtre aveuglée un cadre d’or. La brise troublait votre robe.
 Vous avez laissé tomber la hachette de votre éventail.

Vous avez la coquetterie de ne porter que du linge blanc, serré,

éblouissant. Ainsi paraissez-vous deux fois comme un marbre :
carrare et pentélique.
Chère, vous avez eu peur que je me méprisse, et j’étais
seulement touché de votre enivrement.

Puis, vous avez voulu me prouver que vous étiez, sans religion,
une honnête femme. Vous prononciez des mots abstraits à n’en plus
finir, à dormir sans vous, dont votre éloquence emphatique ciselait
les majuscules. Vous aviez entrepris, notamment, de me démontrer
que les infirmières laïques diplômées ont plus de vertu que les
petites sœurs.
Et moi, je me rappelais la longue prière matinale des femmes de
ma race. L’une d’elles, tant elle fut malheureuse, ne pouvait plus
prier sans voir paraître sur son cher visage en oraison des larmes
qui la consolaient. Et elle prononçait, mais avec douceur, le même
mot magique que vous répétez désespérément : « Justice ! » Elle
mettait avec sagesse dans un autre lieu que la terre la source d’un si
grand bien.
Votre bouche, remuée par les petits mouvements de la parole,
restait bien belle… Je ne disais mot. Quel nuage a passé sur mes
traits ou dans mes yeux, qui soudain déconcerta la douce pédante ?
J’ai pris votre tête, votre fière tête, votre pauvre tête fanatique, et
l’ai reposée sur mon épaule. Tel est le sort. Ni les caresses ni le
silence ne suffisaient plus. Vous aviez besoin d’un mot de ma
bouche, que je n’ai pas su dire. Vous faisiez sentir à un libertin le
rôle du spirituel.

Je vous opposais, dans mon esprit, des historiettes qui vous

auraient scandalisée et qui me plaisent, qui m’ont ému.
 Je me retrouvais dans une petite ville du sud italien, un soir d’été,
entre quatre murs blanchis à la chaux, dans la compagnie d’une
femme étonnée par l’étranger. Je l’avais trouvée assise sur le pas de
sa porte. Ces logettes n’ont pas d’autre ouverture. Un seuil à
franchir, la porte massive à refermer, un être humain à votre
discrétion.
C’est la même chose là-haut, où les filles attendent et regardent,
les unes comme des princesses des “Mille et une nuits”, la plupart
en vraies sauvages, et toutes sur leurs talons, leurs mains devant
elles.
En pays chrétien, la plus pauvre dispose d’une chaise.
Elle avait une jupe de cotonnade à fleurs, un corsage à grosses
manches, et l’un de ces vastes jupons de toile empesée que l’on
mettait après la lessive sur une cage d’osier.
Je lui parlais dans sa langue, lorsqu’elle parut en corset à globes,
pareille à une image de Vertus sœurs dans l’Illustration, du temps
que j’étais garçonnet.
Nous nous plaisions, ainsi qu’il arrive dans ces rencontres, sans
que l’on sache pourquoi, si vite. Je ne me rappelle plus le nom
qu’elle m’avoua et qui était peut-être le sien. Elle avait vingt ans. J’ai
vu dans le même pays de belles figues séchant au soleil qui
tournaient en caramel. Elles lui ressemblent, — et à vous.
Elle gardait sur son épaule un dernier lambeau qui m’importunait.
Car, en ce monde physique, certains veulent retrouver le
tremblement d’une passion primitive, ils veulent rencontrer à la fin ils
ne savent quel mystère, avancer jusqu’au point où la sensation est
épurée en quelque sorte par son excès et par vertige. Mais, plus
belle que vous ne pensez, en me pressant doucement :
— E peccato, disait-elle. C’est un péché. La Madonna non vuole.
Vos fictions, à vous, n’ont pas cette grâce ni cette douceur, où
l’enfant reparaît dans la femme : dans notre ambitieux dénuement, le
passé des cœurs dont nous sommes nés.
 Et si vous étiez païenne vraie, vous ne vous mettriez en peine
que de moi seul. Vous laisseriez vos lubies, dont vous ne me
convaincrez jamais. Vous m’agacez, je m’en indigne, vous
m’étouffez, je vous nomme Paule Bert.

Contre la marine une lame

Vient mourir
Je ne ferai plus rimer âme
Et soupir.

Je vous dirai : « Mon doux aimé

Contemplez
La maison de béton armé
S’il vous plaît.

Ou suivez à perte de vue

Le baiser
Que reçoit la perche éperdue
Du trolley.

Comptez les flots, vous ferez bien… »

— mon cœur,
Ne serait-il en moi plus rien
Que laideur ?

Vous avez ouvert votre fenêtre sur la Méditerranée, et vous

regardez l’oscillation indéfinie des vagues. Vous les entendriez
clapoter sur la pierre, — si nous étions plus près — du même
mouvement qui berce les navires. A cette heure du soir qui tombe,
danse une lueur au sommet, tandis que l’ombre flotte dans le creux
de chaque lame. Je songe, tu songes, nous songeons… Il règne, sur
la vaste nappe des eaux, une majestueuse indifférence, dont on a le
cœur un peu plus serré.
Fumée… Tu songes que tu verras un jour se répandre dans votre
ciel la fumée d’un triste paquebot. Et moi, sur l’autre rive, je
t’appellerai en vain, en entendant sonner la moitié des heures de la
nuit.
 TABLE

AVIS 1
LE NOUVEL AMOUR 3
LA MÉCHANTE 17
LA DÉESSE RAISON 36

Il a été tiré de cet ouvrage, le deuxième de la collection

« Le Sage et ses Amis » 20 exemplaires sur papier du
Japon, numérotés 1 à 20. — 20 exemplaires sur papier
Roma Gris perle, numérotés 21 à 40. — 210 exemplaires
sur papier Madagascar des papeteries Navarre,
numérotés 41 à 250. Il a été tiré, en outre, 75
exemplaires sur papier Roma jaune paille, numérotés en
chiffres romains I à LXXV, réservés à Monsieur Édouard
Champion, pour la Société des Médecins Bibliophiles et
les Bibliophiles du Palais.

Cet exemplaire porte le N°

ACHEVÉ D’IMPRIMER
LE 24 JANVIER 1925
SUR LES PRESSES DES
ARTISANS IMPRIMEURS
F. LEFÈVRE, DIRECTEUR
23, RUE DE LA MARE
A PARIS (XXe)
 *** END OF THE PROJECT GUTENBERG EBOOK LE NOUVEL
AMOUR ***

Updated editions will replace the previous one—the old editions will
be renamed.

Creating the works from print editions not protected by U.S.

copyright law means that no one owns a United States copyright in
these works, so the Foundation (and you!) can copy and distribute it
in the United States without permission and without paying copyright
royalties. Special rules, set forth in the General Terms of Use part of
this license, apply to copying and distributing Project Gutenberg™
electronic works to protect the PROJECT GUTENBERG™ concept
and trademark. Project Gutenberg is a registered trademark, and
may not be used if you charge for an eBook, except by following the
terms of the trademark license, including paying royalties for use of
the Project Gutenberg trademark. If you do not charge anything for
copies of this eBook, complying with the trademark license is very
easy. You may use this eBook for nearly any purpose such as
creation of derivative works, reports, performances and research.
Project Gutenberg eBooks may be modified and printed and given
away—you may do practically ANYTHING in the United States with
eBooks not protected by U.S. copyright law. Redistribution is subject
to the trademark license, especially commercial redistribution.

START: FULL LICENSE

THE FULL PROJECT GUTENBERG LICENSE
 PLEASE READ THIS BEFORE YOU DISTRIBUTE OR USE THIS WORK

To protect the Project Gutenberg™ mission of promoting the free

distribution of electronic works, by using or distributing this work (or
any other work associated in any way with the phrase “Project
Gutenberg”), you agree to comply with all the terms of the Full
Project Gutenberg™ License available with this file or online at
www.gutenberg.org/license.

Section 1. General Terms of Use and

Redistributing Project Gutenberg™
electronic works
1.A. By reading or using any part of this Project Gutenberg™
electronic work, you indicate that you have read, understand, agree
to and accept all the terms of this license and intellectual property
(trademark/copyright) agreement. If you do not agree to abide by all
the terms of this agreement, you must cease using and return or
destroy all copies of Project Gutenberg™ electronic works in your
possession. If you paid a fee for obtaining a copy of or access to a
Project Gutenberg™ electronic work and you do not agree to be
bound by the terms of this agreement, you may obtain a refund from
the person or entity to whom you paid the fee as set forth in
paragraph 1.E.8.

1.B. “Project Gutenberg” is a registered trademark. It may only be

used on or associated in any way with an electronic work by people
who agree to be bound by the terms of this agreement. There are a
few things that you can do with most Project Gutenberg™ electronic
works even without complying with the full terms of this agreement.
See paragraph 1.C below. There are a lot of things you can do with
Project Gutenberg™ electronic works if you follow the terms of this
agreement and help preserve free future access to Project
Gutenberg™ electronic works. See paragraph 1.E below.
1.C. The Project Gutenberg Literary Archive Foundation (“the
Foundation” or PGLAF), owns a compilation copyright in the
collection of Project Gutenberg™ electronic works. Nearly all the
individual works in the collection are in the public domain in the
United States. If an individual work is unprotected by copyright law in
the United States and you are located in the United States, we do
not claim a right to prevent you from copying, distributing,
performing, displaying or creating derivative works based on the
work as long as all references to Project Gutenberg are removed. Of
course, we hope that you will support the Project Gutenberg™
mission of promoting free access to electronic works by freely
sharing Project Gutenberg™ works in compliance with the terms of
this agreement for keeping the Project Gutenberg™ name
associated with the work. You can easily comply with the terms of
this agreement by keeping this work in the same format with its
attached full Project Gutenberg™ License when you share it without
charge with others.

1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside the
United States, check the laws of your country in addition to the terms
of this agreement before downloading, copying, displaying,
performing, distributing or creating derivative works based on this
work or any other Project Gutenberg™ work. The Foundation makes
no representations concerning the copyright status of any work in
any country other than the United States.

1.E. Unless you have removed all references to Project Gutenberg:

1.E.1. The following sentence, with active links to, or other

immediate access to, the full Project Gutenberg™ License must
appear prominently whenever any copy of a Project Gutenberg™
work (any work on which the phrase “Project Gutenberg” appears, or
with which the phrase “Project Gutenberg” is associated) is
accessed, displayed, performed, viewed, copied or distributed:
 This eBook is for the use of anyone anywhere in the United
States and most other parts of the world at no cost and with
almost no restrictions whatsoever. You may copy it, give it away
or re-use it under the terms of the Project Gutenberg License
included with this eBook or online at www.gutenberg.org. If you
are not located in the United States, you will have to check the
laws of the country where you are located before using this
eBook.

1.E.2. If an individual Project Gutenberg™ electronic work is derived

from texts not protected by U.S. copyright law (does not contain a
notice indicating that it is posted with permission of the copyright
holder), the work can be copied and distributed to anyone in the
United States without paying any fees or charges. If you are
redistributing or providing access to a work with the phrase “Project
Gutenberg” associated with or appearing on the work, you must
comply either with the requirements of paragraphs 1.E.1 through
1.E.7 or obtain permission for the use of the work and the Project
Gutenberg™ trademark as set forth in paragraphs 1.E.8 or 1.E.9.

1.E.3. If an individual Project Gutenberg™ electronic work is posted

with the permission of the copyright holder, your use and distribution
must comply with both paragraphs 1.E.1 through 1.E.7 and any
additional terms imposed by the copyright holder. Additional terms
will be linked to the Project Gutenberg™ License for all works posted
with the permission of the copyright holder found at the beginning of
this work.

1.E.4. Do not unlink or detach or remove the full Project

Gutenberg™ License terms from this work, or any files containing a
part of this work or any other work associated with Project
Gutenberg™.

1.E.5. Do not copy, display, perform, distribute or redistribute this

electronic work, or any part of this electronic work, without
prominently displaying the sentence set forth in paragraph 1.E.1 with
active links or immediate access to the full terms of the Project
Gutenberg™ License.
1.E.6. You may convert to and distribute this work in any binary,
compressed, marked up, nonproprietary or proprietary form,
including any word processing or hypertext form. However, if you
provide access to or distribute copies of a Project Gutenberg™ work
in a format other than “Plain Vanilla ASCII” or other format used in
the official version posted on the official Project Gutenberg™ website
(www.gutenberg.org), you must, at no additional cost, fee or expense
to the user, provide a copy, a means of exporting a copy, or a means
of obtaining a copy upon request, of the work in its original “Plain
Vanilla ASCII” or other form. Any alternate format must include the
full Project Gutenberg™ License as specified in paragraph 1.E.1.

1.E.7. Do not charge a fee for access to, viewing, displaying,

performing, copying or distributing any Project Gutenberg™ works
unless you comply with paragraph 1.E.8 or 1.E.9.

1.E.8. You may charge a reasonable fee for copies of or providing

access to or distributing Project Gutenberg™ electronic works
provided that:

• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”

• You provide a full refund of any money paid by a user who

notifies you in writing (or by e-mail) within 30 days of receipt that
s/he does not agree to the terms of the full Project Gutenberg™
License. You must require such a user to return or destroy all
 copies of the works possessed in a physical medium and
discontinue all use of and all access to other copies of Project
Gutenberg™ works.

• You provide, in accordance with paragraph 1.F.3, a full refund of

any money paid for a work or a replacement copy, if a defect in
the electronic work is discovered and reported to you within 90
days of receipt of the work.

• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.

1.E.9. If you wish to charge a fee or distribute a Project Gutenberg™

electronic work or group of works on different terms than are set
forth in this agreement, you must obtain permission in writing from
the Project Gutenberg Literary Archive Foundation, the manager of
the Project Gutenberg™ trademark. Contact the Foundation as set
forth in Section 3 below.

1.F.

1.F.1. Project Gutenberg volunteers and employees expend

considerable effort to identify, do copyright research on, transcribe
and proofread works not protected by U.S. copyright law in creating
the Project Gutenberg™ collection. Despite these efforts, Project
Gutenberg™ electronic works, and the medium on which they may
be stored, may contain “Defects,” such as, but not limited to,
incomplete, inaccurate or corrupt data, transcription errors, a
copyright or other intellectual property infringement, a defective or
damaged disk or other medium, a computer virus, or computer
codes that damage or cannot be read by your equipment.

1.F.2. LIMITED WARRANTY, DISCLAIMER OF DAMAGES - Except

for the “Right of Replacement or Refund” described in paragraph
1.F.3, the Project Gutenberg Literary Archive Foundation, the owner
of the Project Gutenberg™ trademark, and any other party
distributing a Project Gutenberg™ electronic work under this
agreement, disclaim all liability to you for damages, costs and
expenses, including legal fees. YOU AGREE THAT YOU HAVE NO
REMEDIES FOR NEGLIGENCE, STRICT LIABILITY, BREACH OF
WARRANTY OR BREACH OF CONTRACT EXCEPT THOSE
PROVIDED IN PARAGRAPH 1.F.3. YOU AGREE THAT THE
FOUNDATION, THE TRADEMARK OWNER, AND ANY
DISTRIBUTOR UNDER THIS AGREEMENT WILL NOT BE LIABLE
TO YOU FOR ACTUAL, DIRECT, INDIRECT, CONSEQUENTIAL,
PUNITIVE OR INCIDENTAL DAMAGES EVEN IF YOU GIVE
NOTICE OF THE POSSIBILITY OF SUCH DAMAGE.

1.F.3. LIMITED RIGHT OF REPLACEMENT OR REFUND - If you

discover a defect in this electronic work within 90 days of receiving it,
you can receive a refund of the money (if any) you paid for it by
sending a written explanation to the person you received the work
from. If you received the work on a physical medium, you must
return the medium with your written explanation. The person or entity
that provided you with the defective work may elect to provide a
replacement copy in lieu of a refund. If you received the work
electronically, the person or entity providing it to you may choose to
give you a second opportunity to receive the work electronically in
lieu of a refund. If the second copy is also defective, you may
demand a refund in writing without further opportunities to fix the
problem.

1.F.4. Except for the limited right of replacement or refund set forth in
paragraph 1.F.3, this work is provided to you ‘AS-IS’, WITH NO
OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.

1.F.5. Some states do not allow disclaimers of certain implied

warranties or the exclusion or limitation of certain types of damages.
If any disclaimer or limitation set forth in this agreement violates the
law of the state applicable to this agreement, the agreement shall be
interpreted to make the maximum disclaimer or limitation permitted
by the applicable state law. The invalidity or unenforceability of any
provision of this agreement shall not void the remaining provisions.
1.F.6. INDEMNITY - You agree to indemnify and hold the
Foundation, the trademark owner, any agent or employee of the
Foundation, anyone providing copies of Project Gutenberg™
electronic works in accordance with this agreement, and any
volunteers associated with the production, promotion and distribution
of Project Gutenberg™ electronic works, harmless from all liability,
costs and expenses, including legal fees, that arise directly or
indirectly from any of the following which you do or cause to occur:
(a) distribution of this or any Project Gutenberg™ work, (b)
alteration, modification, or additions or deletions to any Project
Gutenberg™ work, and (c) any Defect you cause.

Section 2. Information about the Mission of

Project Gutenberg™
Project Gutenberg™ is synonymous with the free distribution of
electronic works in formats readable by the widest variety of
computers including obsolete, old, middle-aged and new computers.
It exists because of the efforts of hundreds of volunteers and
donations from people in all walks of life.

Volunteers and financial support to provide volunteers with the

assistance they need are critical to reaching Project Gutenberg™’s
goals and ensuring that the Project Gutenberg™ collection will
remain freely available for generations to come. In 2001, the Project
Gutenberg Literary Archive Foundation was created to provide a
secure and permanent future for Project Gutenberg™ and future
generations. To learn more about the Project Gutenberg Literary
Archive Foundation and how your efforts and donations can help,
see Sections 3 and 4 and the Foundation information page at
www.gutenberg.org.

Section 3. Information about the Project

Gutenberg Literary Archive Foundation