
Citation: Amena W. Smith, Swapan K. Ray, Arabinda Das, Kenkichi Nozaki, Baerbel Rohrer, Naren L. Banik. Calpain inhibition as a possible new therapeutic target in multiple sclerosis[J]. AIMS Molecular Science, 2017, 4(4): 446-462. doi: 10.3934/molsci.2017.4.446
[1] | Igor V. Bezmenov . Fast algorithm for cleaning highly noisy measurement data from outliers, based on the search for the optimal solution with the minimum number of rejected measurement data. Metascience in Aerospace, 2024, 1(1): 110-129. doi: 10.3934/mina.2024005 |
[2] | Yuan Hu, Zhihao Jiang, Xintai Yuan, Xifan Hua, Wei Liu . Isometric mapping algorithm based GNSS-R sea ice detection. Metascience in Aerospace, 2024, 1(1): 38-52. doi: 10.3934/mina.2024002 |
[3] | James H. Page, Lorenzo Dorbolò, Marco Pretto, Alessandro Zanon, Pietro Giannattasio, Michele De Gennaro . Sensitivity analysis of mixed analysis-synthesis flight profile reconstruction. Metascience in Aerospace, 2024, 1(4): 401-415. doi: 10.3934/mina.2024019 |
[4] | O.N. Korsun, Om Moung Htang . The practical rules for aircraft parameters identification based on flight test data. Metascience in Aerospace, 2024, 1(1): 53-65. doi: 10.3934/mina.2024003 |
[5] | Jiaqing Kou, Tianbai Xiao . Artificial intelligence and machine learning in aerodynamics. Metascience in Aerospace, 2024, 1(2): 190-218. doi: 10.3934/mina.2024009 |
[6] | Pasynok Sergey . Cumulative STF coefficients evaluation and validation. Metascience in Aerospace, 2024, 1(4): 371-378. doi: 10.3934/mina.2024017 |
[7] | Dulce M Graciano, Fernando Z Sierra-Espinosa, Juan C García . Numerical simulation of vortex-induced vibration in a bladeless turbine: Effects of separation distance between tandem harvesters. Metascience in Aerospace, 2024, 1(3): 309-328. doi: 10.3934/mina.2024014 |
[8] | Grégoire Dannet, Olivier Boucher, Nicolas Bellouin . Features and evolution of civil aviation CO2 emissions based on ADS-B data for the period between 2019–2024. Metascience in Aerospace, 2024, 1(4): 346-370. doi: 10.3934/mina.2024016 |
[9] | Jubilee Prasad Rao, Sai Naveen Chimata . Machine learning-based surrogates for eVTOL performance prediction and design optimization. Metascience in Aerospace, 2024, 1(3): 246-267. doi: 10.3934/mina.2024011 |
[10] | Wenchao Cai, Yadong Zhou . Preventing aircraft from wildlife strikes using trajectory planning based on the enhanced artificial potential field approach. Metascience in Aerospace, 2024, 1(2): 219-245. doi: 10.3934/mina.2024010 |
A significant problem in achieving the required level of accuracy of modern computing complexes and systems is the detection of coarse measurements (outliers) in the time series of data at the preprocessing stage. The proper detection and removal of outliers from measurement data is a necessary step in any scientific application to obtain the most accurate final result. This problem inevitably arises when solving problems in which the initial data is measurement data. Examples of such problems are transmitting time over long distances [1] and comparing remote time scales [2] using satellites, positioning using global navigation satellite systems (GNSS) [3], determining the Earth's rotation parameters [4], very long baseline radio interferometry (VLBI) signal processing [5], and others. The sequential least-squares wavelet and cross-wavelet analyses of VLBI time series performed in [6] make it possible to obtain accurate instantaneous frequency information along with phase differences in the time-frequency domain, as well as to investigate the components of temperature time series at antennae locations.
It should also be noted that the Global Geodetic Observing System (GGOS) provides measurements of the time-varying gravity, rotation, and shape of the Earth using geodetic and gravimetric instruments located on the ground and in space. These measurements need to be accurate to better than a part per billion in order to advance our understanding of the underlying processes that are causing the Earth's rotation, gravity, and shape to change. Mass transport in the global water cycle, sea level and climate change, and crustal deformation associated with geohazards are examples of particularly demanding applications of geodetic and gravimetric measurements with sub-mm accuracy [7]. On the one hand, it is impossible to achieve such accuracy without equipping the colocation sites with new-generation measuring instruments of VLBI, GNSS, and satellite laser ranging systems (SLR). On the other hand, even the availability of state-of-the-art equipment does not relieve the necessity of improved models and methods for both post- and pre-processing of the measurement data received from GNSS receivers forming a global network [8].
As noted in [9], outlier detection and trend detection are two sides of the same coin. The relationship between these two problems is obvious: an incorrectly found trend leads to incorrectly found outliers, and vice versa. The problem of detecting outliers is closely related to the problem of searching for an unknown trend in the data series (see, e.g., [9]). The detection of outliers depends on the solution to this problem: if the trend is determined incorrectly, knowingly accurate data can be rejected while inaccurate one can be left for further processing.
In measurement data processing theory, an outlier is defined as an observation that is at an abnormal distance from other values in a random sample from the population. The uncertainty of this definition lies in how to distinguish anomalous observations from the general data set. The well-known definition of outliers by V. Barnett and T. Lewis states them as being "an observation (or subset of observations) which appears to be inconsistent with the remainder of that set of data" [10]. However, the concepts of "inconsistent" and "remainder" are vague. Various algorithms have been proposed to detect outliers in accordance with our intuition (see [9]). An overview of the different approaches together with the classification of outlier types is given in [11].
The trend detection problem has long been known and is often solved by choosing a polynomial of a given degree that approximates the measurement data in RMS (root-mean-square) norm. Polynomial coefficients are found by the least squares (LS) method as a solution to the system of linear equations, and detection of rough measurements is carried out on the basis of the subsequent analysis of deviations of measured data from the values of the found polynomial. However, with this approach to the problem, the data remaining after the removal of the found outliers, as a rule, do not coincide with the original data set by which the trend was built, whereas the iterative process of sequential redefinition of the trend at a predetermined deviation level may lead to an infinite computational loop. To avoid this looping, it is common practice to reduce the outlier detection level, which can result in the loss of knowingly "good" data.
Some trend-building methods rely on regression techniques and machine learning. An example is the least absolute shrinkage and selection operator (LASSO) used for modeling the relationship between a dependent variable (which may be a vector) and one or more explanatory variables, by fitting the regularized least squares model (see [12]). Trained LASSO model can produce sparse coefficients due to the use of the regularization term. LASSO regression is widely used in feature selection tasks. For example, in the field of compressed sensing, it is used to effectively identify relevant features associated with the dependent variable from a few observations with a large number of features. LASSO regression is also used to overcome multicollinearity of feature vectors in the training data set. For more details, see [13]. The application of the method in medicine can be seen, for example, in [14], as well as in references ibid.
Among the numerous trend-detecting methods are those applied to irregularly distributed data, such as in seismology and marine seismic data. Least-squares spectral analysis (LSSA) was introduced by Vaniček in 1969 [15] to analyze unequally spaced time series. It estimates a frequency spectrum based on the least-squares fit of sinusoids to the entire time series by accounting for measurement errors, trends, and constituents of known forms. Subsequently, scholars have developed various versions of this method. One of them, the anti-leakage least-squares spectral analysis (ALLSSA), is an iterative method based on LSSA and proposed in [16]. Further development of this method to regularize data series was presented in articles [17,18] which also showed its robust performance on synthetic and marine seismic data examples (for details and additional references see ibid.).
A large number of works are devoted to the study of the spatial movement of the Earth's surface in order to identify land subsidence that threatens the human environment. Compared with the traditional leveling and global positioning system (GPS) measurement methods, the interferometric synthetic aperture radar (InSAR) technique can obtain a wide spatial range of information about the deformation of the Earth's surface with millimeter accuracy [19]. The output of InSAR processing is a collection of time series representing the ground displacements of measurement points (MPs) on the surface during the observed period. InSAR has been used for monitoring natural hazards such as landslides, earthquakes, volcanic activity, and ground subsidence [20], as well as for monitoring man-made structures such as dams, buildings [21], and bridges [22], and anthropogenic activities such as the pumping or injection of fluids. Various methods are used to process InSAR time series. For example, in [23] a processing InSAR time series method was proposed, using a convolutional neural network that can distinguish different ground motion features and detect nonlinear deformation signals on a large scale without human intervention. In [24], the authors performed a spatiotemporal analysis of land subsidence in Beijing using the InSAR method based on 47 TerraSAR-X SAR images from 2010 to 2015. Distinct variations in land sediment were identified in the study areas. Numerous examples of the application of InSAR time series processing can be found in the references of the articles above.
Overviews of trend-building methods applied to different research areas can also be found in [25,26,27,28]. These describe approaches and methods for modeling trends in geodetic time series, in time series of observations of the chemical composition of the atmosphere, in the series of physiological data in the medical field, as well as systematized methods for building a trend based on data in the social sphere in order to identify extraordinary events and incidents.
In [29], a new absolutely convergent algorithm for detection of coarse measurements in data with removed trends was proposed. A modification of this algorithm, leading to an optimal solution with a minimum number of rejected data, was proposed in [30], and a fast algorithm with O(NlogN) arithmetic operations performed by it to find the optimal solution was given in [31]. The author in [32] proposed a new trend-detection method in which the trend is searched in the power polynomial class, while the polynomials in the L2 norm are not fitted to all observational data but to their subset, called reference values, which are selected from these data through a convergent iterative process. One of the advantages of the proposed method is that the trend search procedure does not require a priori threshold values, which are usually used to eliminate outliers; all measurement data remain in processing until the trend is determined. The method was approved on the data obtained from GNSS receivers, as well as on the SLR measurement data obtained from the AJISAI geodetic satellite (EGS) [31]. The purpose of this article is to extend the applicability of the previously proposed trend detection method into two additional functional classes, which will make it possible to extend further investigations into many physical processes based on observed data.
The article includes examples of building a trend for noisy data with outliers generated using computer simulation. In the examples below, the trend search is carried out for three functional classes: power polynomials (see Section 6), trigonometric functions with a given set of frequencies (Section 9), and harmonic functions with unknown frequencies, amplitudes, and phases (Section 10). The peculiarity of the trend search in the last class of harmonic signals is that the desired harmonics depend nonlinearly on unknown frequencies and, for their search, the traditional least squares method does not lead to a system of linear equations. In this case, the values of unknown frequencies are sought by the conjugate gradients method combined with the MS method (see below). The results of numerical calculations are given.
The results yj=y(tj) of observations (measurements) of a certain random value Y(t), formed by measuring devices at time points {tj}Nj=1, in many cases can be represented in the form of a one-dimensional time series:
yj=fj+z+ξ j, j=1,…,N, | (1) |
where fj=f(tj) is a trend function dictated by the physical process under consideration and usually unknown; z – is an unknown average; ξ j=ξ (tj) is a centered random variable with an unknown distribution, which may contain outliers, resulting from adverse effects of external factors on the measurements [33]. The challenge is to find fj.
It is clear that this problem does not have a unique solution due to the lack of clear criteria when searching for a trend and the impact of outliers on the result of its search, as well as due to the absence of a strict definition of the concept "rough measurement" or "outlier". The trend detection strategy presented in this paper is based on the MS method, developed by the author, as well as on the search for optimal solution algorithms.
As mentioned above, trend and outlier detection problems are tightly coupled. To find a trend, we first need to find outliers and eliminate them from the values of series (1); after that, we need to find the desirable trend by adjusting some functions to the remaining values treated as reference ones. On the other hand, to detect outliers, it is necessary to know the trend. Initially, neither trend nor outliers are known. Both trend and outlier problems are found through iterations as described below. This Section describes the statement of the outlier detection problem for detrended data series, which is solved during search trend iterations (see Section 6).
If the trend fj is known, we can remove it from the time series (1):
ˆyj=z+ξ j; j=1,…,N, | (2) |
with ˆyj=yj−fj. The task of detecting outliers in series (2) is usually to find a set YL={ˆyj1,...,ˆyjL} of L numbers (length L) for which the following conditions are met:
σ YL=((L−1)−1∑j∈{j1,..,jL}(ˆyj−z)2)1/2⩽σmax, | (3) |
|ˆyj−z|⩽Δ;j∈{j1,..,jL}, | (4) |
L⩾Lmin, | (5) |
where σ YL and σmax are SD (standard deviation) and its preset threshold value, respectively; Δ is a parameter defining an outlier detection threshold (e.g., Δ=3σmax); Lmin is a specified parameter that limits the length of the search set from below (for example, Lmin=10); below we consider 1<Lmin<N. Values ˆyj not included in YL are considered outliers in series (2), and corresponding values yj – as outliers in series (1). The latter are removed from further processing. Often, conditions (3)–(5) are the only ones when searching coarse measurements in a series (2), while no additional conditions are imposed on the parameter L. Problem (2)–(5) is usually solved by iterations, which, as mentioned above, can lead to endless looping or loss of knowingly "good" data (for examples, see [29]).
In [30,31,32], the set YL search problems were formulated, where the conditions (3)–(5) are supplemented by two selection conditions: Of all possible sets satisfying (3)–(5), the set of maximum length Λ (the number of outliers is minimal) is selected as the desired set, and if there are several such sets, the set with the lowest SD value is selected. This solution was called optimal and designated YΛ,opt. The algorithms described in the above-listed works are guaranteed to lead to an optimal solution, if only it exists. However, their application to data containing a not-excluded trend can lead to an unreasonably large number of detected outliers or to the absence of a solution at all, when all measurement data will be detected as outliers. Therefore, our task is to build a suitable approximation ˜fj of an unknown trend and subtract it from the series (1). For this, we associate the concept of "suitable" with the requirement to maximize the number of data of series (1) remaining after the removal of outliers. Commonly, the trend is searched among the functions from some manifold chosen by the researcher depending on the physical problem being solved. In some cases, it can be power polynomials, in others it can be a class of trigonometric, rational functions, etc. Outliers in the measurement data can essentially distort the trend found. Below, we set out an approach to the trend-detection problem in noisy data, based on the minimizing sets method, which allows us to minimize the impact of outliers. We give a sequential exposition of the method for the class of power polynomials. Also, we will demonstrate the capabilities of the method when searching for a trend in other functional classes.
In the case of power polynomials, the trend is approximated by functions of the form
Pn,j(→a)=an(xj)n+an−1(xj)n−1+...+a0;j=1,…,N, | (6) |
where n∈N and →a={a0,...,an−1,an}∈Rn+1 are the degree and coefficients of the polynomial, respectively; xj=(tj−t1)/(tN−t1). The trend detection, in this case, is based on the fitting to reference values of series (1) of a polynomial (6), the degree and coefficients of which are sought through iterations (see Section 6).
Trend fitting is performed to L reference values, which are also searched through iterations. The L value is set in advance to satisfy the inequality L⩽N−−Nout, which is a necessary condition for outliers not to be included in the final set of reference values at the end of the iterative procedure.1 Because the number Nout of outliers is unknown, the parameter L in the below discussed algorithm (see Section 6) is set to be guaranteed to be smaller than the possible value of the quantity N−−Nout so that the above inequality is fulfilled.
1 In Section 7, we will waive this restriction.
Let us define a minimizing set consisting of L numbers of series (2), which plays an important role in the trend detection process.
Let YL={ˆyj1,...,ˆyjL} be a set of L values of the series (2). Denote zYL and σ YL the average and SD values for it, respectively. We have:
zYL=L−1∑j∈{j1,...,jL}ˆyj, | (7) |
σ 2YL=(L−1)−1∑j∈{j1,...,jL}(ˆyj−zYL)2. | (8) |
Definition 1. For a given value L and a given sequence {ˆyj}Nj=1, the set of values
YL,min={ˆyj∗1,...,ˆyj∗L}, |
at which the value σ 2YL determined by (8) reaches a minimum, we call the minimizing set of length L. The corresponding values of the average and SD for this set are denoted by zYL,min and σYL,min, respectively.
According to this definition, we have
zYL,min=L−1∑j∈{j∗1,...,j∗L}ˆyj, | (9) |
σ2YL,min=(L−1)−1∑j∈{j∗1,...,j∗L}(ˆyj−zYL,min)2=minYL{σ2YL}. | (10) |
The minimum in (10) is searched throughout all possible sets of length L composed of the numerical series {ˆyj}Nj=1. Note that the number of possible sets of length L that can be selected from the series (2) is equal to the number CLN of combinations of N elements taken L at a time. It follows that the algorithm for finding the minimizing set YL,min, based on the enumeration of all kinds of sets, as a rule, is not feasible in a reasonable time on any modern computer, even with relatively small values of N. For example, with N = 100, the number of sets of length L = 80 is of the order of 1021. To avoid global brute force when searching the minimizing set YL,min, we note that its composition is determined up to a permutation of the numbers {ˆyj∗1,...,ˆyj∗L} and does not depend on the arrangement of the numbers in the series (2). This means that when searching the minimizing set, we can arrange the numbers of the series (2) in any order. Let us arrange them in ascending order so that after renumbering (keeping the same notation for the numbers of series (2) and considering them different), the inequalities will be fulfilled:
ˆy1<ˆy2<...<ˆyN. | (11) |
Let us formulate an assertion that radically reduces the number of sets to be examined.
Assertion 1. Let YL,min={ˆyj∗1,...,ˆyj∗L} be a minimizing set of length L for a given sequence {ˆyj}Nj=1 and
ymin=min{ˆyj∗1,...,ˆyj∗L},ymax=max{ˆyj∗1,...,ˆyj∗L}. |
Then, the interval (ymin,ymax) does not contain values ˆyj that do not belong to the set YL,min.
See [32] for proof.
Without limiting generality, we consider the numbers ˆyj∗1,...,ˆyj∗L to be in ascending order, that is ˆyj∗1<...<ˆyj∗L. By virtue of (11), the indices j∗1,…,j∗L also follow in ascending order: j∗1<...<j∗L.
The following assertion is true.
Assertion 2. The ascending set of indices j∗1,...,j∗L in the minimizing set YL,min={ˆyj∗1,...,ˆyj∗L} contains all consecutive integers from j∗1 to j∗L.
Proof. Suppose the opposite: Let there be some index j0 such that j∗1<j0<j∗L, but j0∉{j∗1, ..., j∗L}. Then, the inequalities ˆyj∗1<ˆyj0<ˆyj∗L are satisfied for the number ˆyj0 but ˆyj0∉YL,min. This contradicts Assertion 1. It follows that the set of indices j∗1,j∗2,...,j∗L in YL,min coincides with the set of indices j∗1,j∗1+1,...,j∗1+L−1:
YL,min={ˆyj∗1,ˆyj∗1+1,...,ˆyj∗1+L−1}. |
Therefore, instead of a global enumeration of all possible sets (with a total number of order CLN), it is enough to search YL,min among the sets {ˆyk, ..., ˆyk+L−1} consisting of segments of length L of an ordered series (2), varying only one parameter k, subject to the condition 1⩽k⩽N−L+1. The total number of such sets is (N−L+1).
Thus, to find the minimizing set of length L, it is enough to consider N−−L+1 sets
{ˆy1,...,ˆyL},{ˆy2,...,ˆyL+1},…,{ˆyN−L+1,...,ˆyN} |
and select from them the one for which the SD value is minimal. The formulas below minimize the number of arithmetic operations in the search of YL,min.
Denote Y(k,L)={ˆyk, ..., ˆyk+L−1} a set of numbers corresponding to a pair (k,L), and z(k,L) and σ (k,L) as the arithmetic mean and SD value of the set Y(k,L), respectively:
z(k,L)=L−1k+L−1∑j=kˆyj; | (12) |
σ 2(k,L)=(L−1)−1k+L−1∑j=k[ˆyj−z(k,L)]2. | (13) |
The values z(k,L) and σ2(k,L) during the search YL,min can be calculated according to the diagram shown in Figure 1 (in which z(k,L) are shown only):
First, using formulas (12) and (13), the values z(1,L) and σ2(1,L) are calculated; then, by formulas
z(k+1,L)=z(k,L)+L−1(ˆyk+L−ˆyk); | (14) |
σ 2(k+1,L)=σ 2(k,L)+ |
+L−1(ˆyk+L−ˆyk){ˆyk+L−z(k,L)+L+1L−1(ˆyk−z(k,L))} | (15) |
the values {z(2,L) and σ2(2,L)} →, …, →{z(N−L+1,L) and σ2(N−L+1,L)} are successively calculated with the simultaneous selection of the smallest from the numbers:
σ2(m,L)=min1⩽k⩽N−L+1{σ2(k,L)}. |
The set YL,min={ˆym,ˆym+1,...,ˆym+L−1}, for which the SD is minimal, will be the desired minimizing set of length L for the ascending series {ˆyj}. As mentioned above, the same set will also be the minimizing set for the disordered series (2). Let us estimate the number of elementary operations needed to find it. Since the calculation of the values z(1,L) and σ2(1,L) requires 4L + 2 operations, and for each (N−L) the transitions in → direction (see Figure 1)–10, the total number of arithmetic operations when searching for the set YL,min in the ordered series (2) is estimated by the value 4L+2 +10(N−−L) ⩽ 10N.
In order to estimate the number of operations required to find the minimizing set in the unordered series (2), it is necessary to take into account the ordering costs, which are estimated by the value O(Nlog N) (see [34]).
Thus, we have proved the validity of the following assertion.
Assertion 3. For any (unordered) time series (2), a minimizing set YL,min of length L can be found in most O(Nlog N) arithmetic operations.
This section describes the trend-search algorithm using the MS method. Our immediate goal is to find a set of reference values, as a subset of the numbers of the series (1), used to fit the desired trend to them. Suppose that the subset we are looking for and denoted as YL,ref consists of L reference values: YL,ref = {yj1,...,yjL}, where L is not yet defined. As mentioned above, in order to obtain a proper approximation of the trend, the set of reference values should not contain outliers. This requires that the inequality L⩽N−−Nout be fulfilled, in which the parameter Nout, the number of outliers in series (1), is unknown.
Suppose that the number of outliers in series (1) does not exceed some value Nmaxout known a priori2. (For example, if it is known in advance that the number of outliers cannot exceed 10% of the total number of measurements, then we can set Nmaxout=0,1N.) Then, the number of "correct" values in a series yj that can be considered as reference ones is not lower than the value N−Nmaxout, and the problem is to find them.
2 In the next Section 7, we will abandon this assumption.
Below, we consider L to be fixed and associated with the number of reference values of series (1) used to build the trend.
Consider the following algorithm ([32]), containing two iterative cycles: external, by n, and internal, by s. Iterations over s will be marked with the superscript "s" in parentheses. Reference values chosen from the series (1) are marked with the flagj function, which takes values 1, if yj is considered as a reference value, or 0 otherwise.
Step 0. n = 0. Assume L=N−Nmaxout.
Step 1. n++3; Assume s = 0; (0)j=1, j=1,…,N. (Reference values are all numbers of the series (1): Y(0)N,ref = {y1,...,yN}.)
3 n incremented by 1.
Step 2. Using the least squares method, we find the coefficients →a(s)={a(s)0,...,a(s)n} of the polynomial of degree n:
→a(s)=argmina0,...,an−1,anΦ(s)(→a), | (16) |
Φ(s)(→a)≜ | (17) |
where {P_{n, j}}(\vec a) is the polynomial defined by equation (6). The functional {\Phi ^{(s)}}(\vec a) defined by equation (17) is calculated on L reference values Y_{L, {\rm ref}}^{(s)} of series (1) found in the previous iteration4.
4 If s = 0, then reference values are all numbers of the series (1).
Step 3. We form the differences \hat y_j^{(s)} :
\hat y_j^{(s)} = {y_j} - {P_{n, j}}({\vec a^{(s)}}) , | (18) |
where {P_{n, j}}({\vec a^{(s)}}) is a polynomial with coefficients found in Step 2.
Step 4. For the series \{ \hat y_j^{(s)}\} _{j = 1}^N defined in (18), we find a minimizing set Y_{L, \min}^{(s)} = \{ \hat y_{j_1^{ * (s)}}^{(s)}, ..., \hat y_{j_L^{ * (s)}}^{(s)}\} of length L using the algorithm described in Section 5; using formulas (9) and (10), we can calculate the corresponding values of mean {z_{Y_{L, \min}^{(s)}}} and SD {\sigma _{Y_{L, \min}^{(s)}}} .
Step 5. We redefine the reference points to find the polynomial at the next iteration (Step 2), marking them with the function {\rm flag}_j^{(s + 1)} :
{\rm flag}_j^{(s + 1)} = \left\{ {\begin{array}{*{20}{c}} {1, }&{\;if\quad j \in \{ j_1^{ * (s)}, ..., j_L^{ * (s)}\} } \\ {0, }&{otherwise} \end{array}} \right. . | (19) |
At that Y_{L, {\rm ref}}^{(s + 1)} = \{ {y_{j_1^{ * (s)}}}, ..., {y_{j_L^{ * (s)}}}\} .
Step 6. s++. Increment the iteration counter s by 1 and go to Step 2.
We perform the sequence of Steps 2 to 6 until the convergence of the sequence {\sigma _{Y_{L, \min}^{(s)}}} , s = 0, 1, 2, ..., which always takes place (see Assertion 4).
After achieving convergence of the s-iterations (Steps 2–6), we proceed to Step 7 to find the optimal solution.
Step 7. Let the convergence of s-iterations be achieved at s = {s_{\max }} . In this case, the indices in both sets Y_{L, \min }^{({s_{\max }})} and Y_{L, {\rm ref}}^{({s_{\max }})} coincide up to permutation. The desired trend approximation {\tilde f_{n, j}} corresponding to the degree n of the polynomial is equal to {\tilde f_{n, j}} = {P_{n, j}}({\vec a^{({s_{\max }})}})\, .
Next, we find the optimal solution {Y_{\Lambda, {\rm opt}}} = \{ {\hat y_{{k_1}}}, ..., {\hat y_{{k_\Lambda }}}\} for the series \hat y_j^{({s_{\max }})} = {y_j} - {P_{n, j}}({\vec a^{({s_{\max }})}}), j = {\text{ }}1, \ldots, N, using any of the algorithms described in [30,31,32]. As a result, the outliers will be the numbers {y_j} of the series (1), for which j \notin \{ {k_1}, ..., {k_\Lambda }\}. The resulting number of outliers detected is equal to {N_{{\text{out}}}} = N--\Lambda .
If it turns out that {N}_{\text{out}}\le {N}_{\text{maxout}} , then the solution is considered to be found, and the search process ends; at that, the desired trend is {\tilde f_j} = {P_{n, j}}({\vec a^{({s_{\max }})}})\, . Otherwise, if {N}_{\text{out}} > {N}_{\text{maxout}} , then we transit to Step 1, at which we increase the polynomial degree by 1. The process (Steps 1–7) continues until a solution is found or n exceeds a preset value (e.g., 10). In the latter case, it will probably be necessary to select another functional class to search for a trend.
Example 1. We will generate synthetic noisy data using a computer simulation by the formula:
{y_j} = 5\, \times \;\ln \;(5\; + j)\; + \;2\; \times \;\text{random}_j + \left\{ {\begin{array}{*{20}{l}} {40\; \times \;(0.6\; - \;{\text{random}}{}_j), \;\;if}&{\left\{ \begin{gathered} j \equiv 0\;(\bmod 13)\;or \hfill \\ j \equiv 0\;(\bmod 43)\;or \hfill \\ j \equiv 0\;(\bmod 113) \hfill \\ \end{gathered} \right.\;} \\ {\quad \quad \quad 0, }&{otherwise} \end{array}} \right. . | (20) |
Here, j = 1...N , \text{random}_j are pseudo-random numbers evenly distributed on the segment [0, 1]. The first term on the right side (20) models the trend, the second models the white noise, and the third models outliers at points j, multiples of 13, 43, or 113 (Figure 2). Suppose N = 1250 , then the number of modeled outliers is 134. Next, we set {{\text{σ }}_{\max }} = 0.6, \Delta = 1.8, {L_{\min }} = 10 and will search for the trend and outliers in accordance with the algorithm described above, putting {N_{\rm maxout}} = 140 ; at L = N - {N_{\rm maxout}} = 1110.
The calculation results for this example are presented in Table 1, in which n is the degree of the polynomial; {s_{\max }} is the number of s-iterations performed until convergence; Λ is the length of the optimal solution found; and {N_{{\text{out}}}} is the number of outliers detected.
n — polynomial order | {s_{\max }} | Λ | {N_{{\text{out}}}} |
1 | 2 | 688 | 562 |
2 | 9 | 931 | 319 |
3 | 6 | 1049 | 201 |
4 | 6 | 1087 | 163 |
5 | 5 | 1105 | 145 |
6 | 7 | 1109 | 141 |
7 | 4 | 1116 | 134 |
8 | 4 | 1116 | 134 |
As can be seen from Table 1, the minimum polynomial order at which the maximum length Λ of the optimal solution is reached equals 7. Therefore, a 7th-degree polynomial can be chosen as a suitable trend approximation.
The values {P_{7, j}}({\vec a^{(0)}}) of the 7th-degree polynomial, constructed over all reference values without performing the above iterations (s = 0), are shown in Figure 2 (solid blue line). The corresponding polynomial differences {\hat y_j} = {y_j} - {P_{7, j}}({\vec a^{(0)}}) are shown in Figure 3. It can be seen that the values {\hat y_j} are distributed unevenly relative to 0, which indicates the inaccuracy of the constructed polynomial trend, since the reference values contain outliers.
The optimal solution found for the obtained series {\hat y_j} has the length Λ = 1067 (number of outliers = 183). Trend refinement occurs as a result of multiple repeats of Steps 2–6 of the above iterative procedure.
Figure 4 shows the values {P_{7, j}}({\vec a^{(4)}}) of the found polynomial of the 7th-degree (blue line), approximating the data set over L = 1110 reference values found after achieving convergence at the 4th iteration ({s_{\max }} = 4) of the above iteration process (Step 2–6). The corresponding differences {\hat y_j} = {y_j} - {\tilde f_j} , where {\tilde f_j} = {P_{7, j}}({\vec a^{(4)}}) , are shown in Figure 5. It can be seen that the values {\hat y_j} are evenly distributed relative to 0. The optimal solution found for the obtained series {\hat y_j} has a length Λ = 1116, while the number of detected outliers = 134, their positions being marked with white circles.
Note that in the example considered, the trend was modeled by a function that does not belong to the class of power polynomials.
As mentioned above, in order for the trend detection strategy described in the previous section to give an adequate result, it is necessary that the inequality L \leqslant N - {N_{{\text{out}}}} is fulfilled. The task of this section is to choose an L at which this inequality holds true. We cannot choose an L either too small or too large; otherwise, this will result in a distorted trend approximation {\tilde f_j}. Since {N_{{\text{out}}}} is unknown a priori, we cannot specify L to run a trend-search algorithm. To overcome this obstacle, we will use the L selection strategy proposed in [35]. Note that each value L corresponds to the optimal solution of length Λ depending on L (Λ = Λ(L)) obtained after removing from the series (1) trend, built on the L reference values. The L selection strategy proposed in [35] is based on searching the maximum of the length function Λ(L). By applying the algorithm discussed in Section 6, we can find a length sequence \Lambda (N), \Lambda (N - 1), ..., \Lambda ({L_{\min }}) for optimal solutions corresponding to the sequence of different L, starting with L = N and further decreasing L by 1. Then, we can find the maximum of this sequence denoted as {\Lambda ^ * } :
{\Lambda ^*} = \mathop {\max }\limits_{{L_{\min }} \leqslant L \leqslant N} \Lambda (L) . | (21) |
Next, from all possible values of L for which the equality \Lambda (L) = {\Lambda ^ * } is fulfilled, we choose the maximum that we designate as L*:
{L^ * } = \max \{ L:\Lambda (L) = {\Lambda ^ * }\} . | (22) |
It corresponds to the optimal solution {Y_{{\Lambda ^ * }, {\rm opt}}} = \{ {\hat y_{{j_1}}}, ..., {\hat y_{{j_{{\Lambda ^ * }}}}}\} of length {\Lambda ^ * } , at which the number of outliers detected is equal to N – {\Lambda ^ * } .
Let us test this strategy presented by equations (21) and (22) on the data from Example 1, expressed by equation (20). We will approximate the trend with a 7th-degree polynomial (n = 7). As a result, we find the sequence \Lambda (N), \Lambda (N - 1), … plotted in Figure 6. The maximum value {\Lambda ^ * } = 1118 ; the values of L at which this maximum is achieved are all numbers in the range L \in [1109,1129], the maximum of them is equal to {L^ * } = 1129. The reference values of the original series found at {L^ * } = 1129 can be used as reference ones for building a polynomial trend.
The question of convergence of iterations described in the trend search algorithm (see Section 6) is formulated in the following statement.
Assertion 4. The sequence {\sigma _{Y_{L, \min }^{(s)}}} of SD values calculated in the trend-search algorithm decreases monotonically at s = 0.1, ...:
{\sigma _{Y_{L, \min }^{(s)}}} \geqslant {\sigma _{Y_{L, \min}^{(s + 1)}}} \geqslant ... | (23) |
and therefore converges.
For proof, see [32].
Remark. The monotonic decreasing of the sequence {\sigma _{Y_{L, \min}^{(s)}}} of SD values calculated in the trend-search algorithm may be violated during real calculations due to insufficient calculation accuracy. It may happen that calculations with 64 bits do not provide the necessary calculation accuracy. The situation is usually corrected by switching to a 128-bit grid.
The idea of the method described for finding a trend in a power polynomial class can also be implemented for other functional classes. Consider a periodic with period N function defined on a homogeneous grid \Omega = \{ {x_j} = hj, \; j = 0, \pm 1, \pm 2, .., Nh = l\} that describes the sequence of measurements of a signal coming from a technical device:
f(j) = f(j + N), \;\quad j = 0, \pm 1, .., . |
As known, the function f(j) can be expanded into a discrete Fourier series into a sum of trigonometric functions:
\cos \frac{{2k{\text{π }}j}}{N}, \quad \sin \frac{{2k{\text{π }}j}}{N} , j = 0, \ldots , N - 1. |
The trend search for such a signal can be carried out in the form of an n-th-order polynomial
{\tilde{f}}_{j} = {Т}_{n, j}(\overrightarrow{a}, \overrightarrow{b}) = {\displaystyle \sum _{k = 0}^{n}{a}_{k}\mathrm{cos}\frac{2k\text{π}j}{N}+{b}_{k}\mathrm{sin}\frac{2k\text{π}j}{N}}, | (24) |
in which the coefficients {a_k}, {b_k} are searched by the least squares method from the condition of the minimum functional, similar to (17), where {P_{n, j}}(\vec a) should be replaced by {Т}_{n, j}(\overrightarrow{a}, \overrightarrow{b}) . The trend-search algorithm, in this case, is no different from the polynomial trend-search algorithm described above.
The convergence of s-iterations (see Assertion 4) for a given class of functions also takes place, as proved by literally word-for-word repetition of the proof of Assertion 4.
Example 2. Consider a computer simulation of the wave packet in the form of the product of the Gaussian function by a sinusoid:
{y_j} = 1, 5 \cdot \cos \left( {10 \times 2{\text{π }}(j/N - 0.5)} \right) \times \exp \left( { - \, 25.0 \times {{(j/N - 0.5)}^2}} \right) + {\text{0}}{\text{.15}} \times {\text{rando}}{{\text{m}}_j}+ |
+ \left\{ {\begin{array}{*{20}{l}} {3\, \times \, ({\text{random}}{}_j - \, 0.5), \quad if}&{\left\{ \begin{array}{l} j \equiv 0\;(\bmod 13)\;or \hfill \\ j \equiv 0\;(\bmod 17)\;or \hfill \\ j \equiv 0\;(\bmod 43) \hfill \\ \end{array} \right.\;} \\ {\quad \quad \quad 0, }&{otherwise} \end{array}} \right. , | (25) |
where j = 1...N. The first two terms on the right side simulate a trend in the form of a wave packet and additive white noise, respectively. The third term simulates outliers at points j that are multiples of 13, 17, and 43.
Figure 7 shows the values of this function at N = 500 (orange diamonds) and the values {T_{12, j}}({\vec a^{(0)}}, {\vec b^{(0)}}) of trigonometric polynomial (24) of the 12th order, plotted over all reference points, i.e., without performing the s-iterations (s = 0) (blue circles). Figure 8 shows the differences {\hat y_j} = {y_j} - {T_{12, j}}({\vec a^{(0)}}, {\vec b^{(0)}}) . It can be seen that the residuals contain a non-deleted trend component, which leads to an unreasonably large number of rejected measurement results when finding the optimal solution.
Figure 9 shows the values {T_{12, j}}({\vec a^{(2)}}, {\vec b^{(2)}}) of the trigonometric polynomial of the 12th order (blue circles), constructed over L = 450 reference values found after achieving convergence at the second iteration ({s_{\max }} = 2) of the above iteration process (see Section 6).
The differences {\hat y_j} = {y_j} - {T_{12, j}}({\vec a^{(2)}}, {\vec b^{(2)}}) shown in Figure 10 are evenly distributed relative to 0, which indicates a satisfactory approximation of the trend.
Consider the problem of finding a trend in data representing a superposition of unknown harmonic signals, on which noise and outliers are superimposed:
{y_j} = {f_j} + z + {{\text{ξ }}_j}, j = 1, \ldots , N, |
{f_j} = {H_{n, j}}(\vec a{\text{, }}\vec b{\text{, }}\vec \nu ) = {a_0} + \sum\limits_{k = 1}^n {{a_k}\cos \;({{\mathtt{ν}}_k}j) + {b_k}\sin \;({{\mathtt{ν}}_k}j)} . | (26) |
Here, {a_k}, {b_k}, {{\mathtt{ν}}_k} are the unknown parameters to be defined. An unknown parameter is also the number n of harmonics representing the signal under study.
The fundamental difference between this representation and decomposition (24) is its nonlinear dependence on unknown parameters {{\mathtt{ν}}_k}, the search for which cannot be reduced to solving a system of linear equations. The search for reference values is carried out in accordance with the algorithm described above when searching for a polynomial trend, while it is necessary to replace {P_{n, j}}(\vec a) by {H_{n, j}}(\vec a{\text{, }}\vec b{\text{, }}\vec \nu) in the expression (17) for the functional. The search for the minimum of the functional (see Step 2, Section 6), obtained as a result of such a replacement, is carried out by the conjugate gradients method.
Example 3. Figure 11 shows the result of a computer simulation of the harmonic signal generated by the formula
{y_j} = 4.4\sin \;(0, 009123j + 2.42) + {\text{3}}{\text{.0}} \times ({\text{rando}}{{\text{m}}_j} - 0.5) + |
+ \left\{ {\begin{array}{*{20}{l}} {25 \times (0.5 - {\text{random}}{}_j), \quad if}&{\left\{ \begin{array}{l} j \equiv 0\;(\bmod \;13)\;or \hfill \\ j \equiv 0\;(\bmod \;23)\;or \hfill \\ j \equiv 0\;(\bmod \;113) \hfill \\ \end{array} \right.\;} \\ {\quad \quad \quad 0, }&{otherwise} \end{array}} \right., | (27) |
where j = 1, ..., N = 5700. On the signal represented by the first term on the right side of equation (27), additive white noise (the second term) and outliers (the third term added to the previous two at points j, multiples of 13, 23, or 113) are superimposed.
A fragment of this signal in enlarged form is shown in Figure 12.
As a result of the search, the frequency of the signal was determined (see Table 2).
\boldsymbol k | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (exact) | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (found) | |\Delta {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}}|/{{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} |
1 | 0.0091230 | 0.0091240 | < 1.1×10−4 |
The detected trend is shown in Figure 13. The maximum value of the relative error of the found trend compared to the exact one is 0.008.
Example 4. Figure 14 shows the result of a computer simulation of a superposition of five harmonics:
\begin{align} {y_j} = &{\text{10}}{\text{.8}} \times {\text{sin}}\;{\text{(0}}{\text{.002500}} \cdot j{\text{)}}\;{\text{ + }}\;{\text{7}}{\text{.0}} \times {\text{sin}}\;{\text{(0}}{\text{.004555}} \cdot j{\text{ + 7}}{\text{.32)}}\;{\text{ + }} \hfill \\ +&{\text{8}}{\text{.1}} \times {\text{sin}}\;{\text{(0}}{\text{.007123}} \cdot j{\text{ + 4}}{\text{.51)}}\;{\text{ + }}\;{\text{4}}{\text{.4}} \times {\text{sin}}\;{\text{(0}}{\text{.009123}} \cdot j{\text{ + 2}}{\text{.42)}}\;{\text{ + }} \hfill \\ +&{\text{5}}{\text{.6}} \times {\text{sin}}\;{\text{(0}}{\text{.012345}} \cdot j{\text{ + 0}}{\text{.59)}}\; + \hfill \\ \end{align} |
+ {\text{3}}{\text{.0}} \times {\text{rando}}{{\text{m}}_j} + \left\{ {\begin{array}{*{20}{l}} {25 \times ({\text{random}}{}_j - \;0.5), \quad if}&{\left\{ \begin{array}{l} j \equiv 0\;(\bmod \;13)\;or \hfill \\ j \equiv 0\;(\bmod \;23)\;or \hfill \\ j \equiv 0\;(\bmod \;113)\; \hfill \\ \end{array} \right.} \\ {\quad \quad \quad 0, }&{otherwise} \end{array}} \right., | (28) |
where j = 1, ..., N = 5700. On the signal represented by the first five terms on the right side of equation (28), additive white noise (the penultimate term) and outliers (the last term added to the previous ones at j, multiples of 13, 23, and 113) are superimposed.
Table 3 shows the frequencies found by the conjugate gradients method implemented in the trend-search algorithm described above. Figure 15 shows the found trend (blue line). The maximum value of the relative error of the found trend compared to the exact one is 0.006. The lower value of the relative bias found in the case of five harmonics compared to the case of one harmonic is explained by different levels of modeled additive white noise. In the case of one harmonic, it is 34% of the carrier level; in the case of five harmonics, it is 6% [see formulae (27), (28)].
\boldsymbol k | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (exact) | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (found) | |\Delta {{\mathbf{\mathtt{ν}}}_k}|/{{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} |
1 | 0.002500 | 0.0025010 | 4.0 × 10−4 |
2 | 0.004555 | 0.0045550 | < 2.0 × 10−5 |
3 | 0.007123 | 0.0071210 | 2.8 × 10−4 |
4 | 0.0091230 | 0.0091260 | 3.3 × 10−4 |
5 | 0.012345 | 0.0123500 | 4.0 × 10−4 |
The developed method of minimizing sets allows us to find the appropriate approximations of the trend in the numerical series of noisy data containing outliers. The trend search can be carried out in various functional classes, such as power polynomials, trigonometric functions with a given set of frequencies, and harmonic functions with unknown frequencies, amplitudes, and phases, which is confirmed by the considered numerical examples. High efficiency of the trend detection method in noisy series of measurement data has been demonstrated. In the case of harmonic noisy signals, harmonic frequencies were found using the conjugate gradients method combined with the minimizing sets method. The relative error of the frequencies found in the considered examples did not exceed the magnitude {\text{4}} \times {\text{1}}{{\text{0}}^{ - {\text{4}}}} . After constructing a trend and subtracting it from the values of the original data series, the robust algorithms are used to search for outliers, which are guaranteed to lead to an optimal solution with a minimum number of rejected measurements.
The method can be effectively applied in solving numerous applied and fundamental problems in various scientific and technical fields such as space geodesy, gravimetry, and astrometry, as well as in the tasks of exploring near and deep space, Earth's remote sensing, and others. The choice of the functional class for the trend search is chosen by the researcher, taking into account the specifics of the problem being solved.
Finding a trend in other functional classes, such as the class of fractional rational functions used in Padé approximations, requires more research. Some problems concerning the prediction of stationary processes can be solved using the harmonic functions discussed above. At the same time, additional studies are also required to predict quasi-stationary time series, such as satellite GNSS orbits and Earth rotation parameters. In the future, the priority area of research is the use of the proposed method to solve problems with real measurement data.
The author thanks the anonymous reviewers for their comments that significantly improved the presentation of the paper.
The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.
The author declares no conflict of interest.
[1] |
Dargahi N, Katsara M, Tselios T, et al. (2017) Multiple Sclerosis: Immunopathology and Treatment Update. Brain Sci 7: 78. doi: 10.3390/brainsci7070078
![]() |
[2] |
Confavreux C, Vukusic S (2014) The clinical course of multiple sclerosis. Handb Clin Neurol 122: 343-369. doi: 10.1016/B978-0-444-52001-2.00014-5
![]() |
[3] | Confavreux C, Vukusic S, Moreau T, et al. (2001) Relapses and progression of disability in multiple sclerosis. N Engl J Med 343: 1430-1438. |
[4] |
Kinzel S, Weber MS (2016) B Cell-Directed Therapeutics in Multiple Sclerosis: Rationale and Clinical Evidence. Cns Drug 30: 1137-1148. doi: 10.1007/s40263-016-0396-6
![]() |
[5] |
Fernando NT, Koch M, Rothrock C, et al. (2008) Tumor escape from endogenous, extracellular matrix-associated angiogenesis inhibitors by up-regulation of multiple proangiogenic factors. Clin Cancer Res 14: 1529-1539. doi: 10.1158/1078-0432.CCR-07-4126
![]() |
[6] | Rottlaender A, Kuerten S. (2015) Stepchild or Prodigy? Neuroprotection in Multiple Sclerosis (MS) Research. Int J Mol Sci 16: 14850-14865. |
[7] |
Popescu V, Agosta F, Hulst HE, et al. (2013) Brain atrophy and lesion load predict long term disability in multiple sclerosis. J Neurol Neurosur Psychiatr 84: 1082-1091. doi: 10.1136/jnnp-2012-304094
![]() |
[8] |
Vickers JC, King AE, Woodhouse A, et al. (2009) Axonopathy and cytoskeletal disruption in degenerative diseases of the central nervous system. Brain Res Bull 80: 217-223. doi: 10.1016/j.brainresbull.2009.08.004
![]() |
[9] |
Mentis AA, Dardiotis E, Grigoriadis N, et al. (2017) Viruses and Multiple Sclerosis: From Mechanisms and Pathways to Translational Research Opportunities. Mol neurobiol 54: 3911-3923. doi: 10.1007/s12035-017-0530-6
![]() |
[10] |
Berer K, Krishnamoorthy G (2014) Microbial view of central nervous system autoimmunity. FEBS lett 588: 4207-4213. doi: 10.1016/j.febslet.2014.04.007
![]() |
[11] |
Geginat J, Paroni M, Pagani M, et al. (2017) The Enigmatic Role of Viruses in Multiple Sclerosis: Molecular Mimicry or Disturbed Immune Surveillance? Trend in Immunol 38: 498-512. doi: 10.1016/j.it.2017.04.006
![]() |
[12] |
Brownlee WJ, Miller DH (2014) Clinically isolated syndromes and the relationship to multiple sclerosis. J Clin Neurosci 21: 2065-2071. doi: 10.1016/j.jocn.2014.02.026
![]() |
[13] |
Rocca MA, Preziosa P, Mesaros S, et al. (2016) Clinically Isolated Syndrome Suggestive of Multiple Sclerosis: Dynamic Patterns of Gray and White Matter Changes-A 2-year MR Imaging Study. Radiology 278: 841-853. doi: 10.1148/radiol.2015150532
![]() |
[14] |
Klaver R, Popescu V, Voorn P, et al. (2015) Neuronal and axonal loss in normal-appearing gray matter and subpial lesions in multiple sclerosis. J Neuropathol Exp Neurol 74: 453-458. doi: 10.1097/NEN.0000000000000189
![]() |
[15] |
De SN, Giorgio A, Battaglini M, et al. (2010) Assessing brain atrophy rates in a large population of untreated multiple sclerosis subtypes. Neurology 74: 1868-1876. doi: 10.1212/WNL.0b013e3181e24136
![]() |
[16] |
Alonso A, Hernán MA (2008) Temporal trends in the incidence of multiple sclerosis: a systematic review. Neurology 71: 129-135. doi: 10.1212/01.wnl.0000316802.35974.34
![]() |
[17] |
Rojas JI, Patrucco L, Miguez J, et al. (2016) Brain atrophy in multiple sclerosis: therapeutic, cognitive and clinical impact. Arq Neuro-Psiquiat 74: 235-243. doi: 10.1590/0004-282X20160015
![]() |
[18] | Rojas JI, Patrucco L, Besada C, et al. (2010) [Brain atrophy in clinically isolated syndrome]. Neurología 25: 430-434. |
[19] |
Tawse KL, Gobuty M, Mendoza-Santiesteban C (2014) Optical coherence tomography shows retinal abnormalities associated with optic nerve disease. Br J Ophthalmol 98: ii30-3. doi: 10.1136/bjophthalmol-2013-304301
![]() |
[20] | You Y, Gupta VK, Li JC, et al. (2013) Optic neuropathies: characteristic features and mechanisms of retinal ganglion cell loss. Rev Neurosci 24: 301-321. |
[21] |
Namekata K, Kimura A, Kawamura K, et al. (2013) Dock3 attenuates neural cell death due to NMDA neurotoxicity and oxidative stress in a mouse model of normal tension glaucoma. Cell Death Diff 20: 1250-1256. doi: 10.1038/cdd.2013.91
![]() |
[22] | Burkholder BM, Osborne B, Loguidice MJ, et al. (2009) Macular volume determined by optical coherence tomography as a measure of neuronal loss in multiple sclerosis. Arch Neurol 66: 1366. |
[23] |
Frohman EM, Dwyer MG, Frohman T, et al. (2009) Relationship of optic nerve and brain conventional and non-conventional MRI measures and retinal nerve fiber layer thickness, as assessed by OCT and GDx: a pilot study. J Neurol Sci 282: 96-105. doi: 10.1016/j.jns.2009.04.010
![]() |
[24] |
Pineles SL, Birch EE, Talman LS, et al. (2011) One eye or two: a comparison of binocular and monocular low-contrast acuity testing in multiple sclerosis. Am J Ophthalmol 152: 133-140. doi: 10.1016/j.ajo.2011.01.023
![]() |
[25] |
Martin R, Mcfarland HF, Mcfarlin DE (1992) Immunological aspects of demyelinating diseases. Annu Rev Immunol 10: 153. doi: 10.1146/annurev.iy.10.040192.001101
![]() |
[26] |
Hobom M, Storch MK, Weissert R, et al. (2004) Mechanisms and time course of neuronal degeneration in experimental autoimmune encephalomyelitis. Brain Pathol 14: 148-157. doi: 10.1111/j.1750-3639.2004.tb00047.x
![]() |
[27] |
Croxford AL, Kurschus FC, Waisman A (2011) Mouse models for multiple sclerosis: historical facts and future implications. Biochim Biophys Acta 1812: 177-183. doi: 10.1016/j.bbadis.2010.06.010
![]() |
[28] |
Shields DC, Banik NL (1999) Pathophysiological role of calpain in experimental demyelination. J Neurosci Res 55: 533-541. doi: 10.1002/(SICI)1097-4547(19990301)55:5<533::AID-JNR1>3.0.CO;2-8
![]() |
[29] |
Hassen GW, Feliberti J, Kesner L, et al. (2006) A novel calpain inhibitor for the treatment of acute experimental autoimmune encephalomyelitis. J Neuroimmunol 180: 135-146. doi: 10.1016/j.jneuroim.2006.08.005
![]() |
[30] | Guyton MK, Das A, Samantaray S, et al. (2010) Calpeptin attenuated inflammation, cell death, and axonal damage in animal model of multiple sclerosis. J Neurosci Res 88: 2398-2408. |
[31] | Kobeissy FH. (2015) Brain Neurotrauma: Molecular, Neuropsychological, and Rehabilitation Aspects. Crc Press. |
[32] |
Sun JF, Yang HL, Huang YH, et al. (2017) CaSR and calpain contribute to the ischemia reperfusion injury of spinal cord. Neurosci lett 646: 49-55. doi: 10.1016/j.neulet.2017.03.009
![]() |
[33] |
Samantaray S, Knaryan VH, Shields DC, et al. (2013) Critical role of calpain in spinal cord degeneration in Parkinson's disease. J Neurochem 127: 880. doi: 10.1111/jnc.12374
![]() |
[34] | Siklos M, Benaissa M, Thatcher GRJ (2015) Cysteine proteases as therapeutic targets: does selectivity matter? A systematic review of calpain and cathepsin inhibitors. Acta pharmaceutica Sinica B 5: 506-519. |
[35] |
Smith AW, Rohrer B, Wheless L, et al. (2016) Calpain inhibition reduces structural and functional impairment of retinal ganglion cells in experimental optic neuritis. J Neurochem 139: 270-284. doi: 10.1111/jnc.13770
![]() |
[36] |
Ono Y, Sorimachi H (2012) Calpains: an elaborate proteolytic system. Biochim Biophys Acta 1824: 224-236. doi: 10.1016/j.bbapap.2011.08.005
![]() |
[37] |
Pietrobon D, Di VF, Pozzan T (1990) Structural and functional aspects of calcium homeostasis in eukaryotic cells. Eur J Biochem 193: 599-622. doi: 10.1111/j.1432-1033.1990.tb19378.x
![]() |
[38] | Wu HY, Tomizawa K, Matsui H (2007) Calpain-calcineurin signaling in the pathogenesis of calcium-dependent disorder. Acta Medica Okayama 61: 123-137. |
[39] |
Diaz-Sanchez M, Williams K, Deluca GC, et al. (2006) Protein co-expression with axonal injury in multiple sclerosis plaques. Acta Neuropathol 111: 289. doi: 10.1007/s00401-006-0045-0
![]() |
[40] |
Yan F, Sun W, Shi Y, et al. (2009) Glutamate excitotoxicity inflicts paranodal myelin splitting and retraction. Plos One 4: e6705. doi: 10.1371/journal.pone.0006705
![]() |
[41] |
Banik NL, Chou CH, Deibler GE, et al. (1994) Peptide bond specificity of calpain: proteolysis of human myelin basic protein. J Neurosci Res 37: 489-496. doi: 10.1002/jnr.490370408
![]() |
[42] |
Howe CL, Lafrancecorey RG, Mirchia K, et al. (2016) Neuroprotection mediated by inhibition of calpain during acute viral encephalitis. Sci Rep 6: 28699. doi: 10.1038/srep28699
![]() |
[43] | Machado VM, Morte MI, Carreira BP, et al. (2015) Involvement of calpains in adult neurogenesis: implications for stroke. Front Cell Neurosci 9: 22. |
[44] |
Knaryan VH, Samantaray S, Park S, et al. (2014) SNJ-1945, a calpain inhibitor, protects SH-SY5Y cells against MPP(+) and rotenone. J Neurochem 130: 280-290. doi: 10.1111/jnc.12629
![]() |
[45] |
Donkor IO (2000) A survey of calpain inhibitors. Curr Med Chem 7: 1171-1181. doi: 10.2174/0929867003374129
![]() |
[46] |
Shirasaki Y, Miyashita H, Yamaguchi M, et al. (2005) Exploration of orally available calpain inhibitors: peptidyl alpha-ketoamides containing an amphiphile at P3 site. Bioorg Med Chem 13: 4473-4484. doi: 10.1016/j.bmc.2005.04.059
![]() |
[47] |
Donkor IO, Zheng X, Miller DD (2000) Synthesis and calpain inhibitory activity of alpha-ketoamides with 2,3-methanoleucine stereoisomers at the P2 position. Bioorg Med Chem Lett 10: 2497-2500. doi: 10.1016/S0960-894X(00)00518-7
![]() |
[48] |
Carragher NO (2006) Calpain inhibition: a therapeutic strategy targeting multiple disease states. Curr Pharm Design 12: 615-638. doi: 10.2174/138161206775474314
![]() |
[49] |
Barrett AJ, Kembhavi AA, Brown MA, et al. (1982) L-trans-Epoxysuccinyl-leucylamido (4-guanidino) butane (E-64) and its analogues as inhibitors of cysteine proteinases including cathepsins B, H and L. Biochem J 201: 189-198. doi: 10.1042/bj2010189
![]() |
[50] | Saido TC, Sorimachi H, Suzuki K (1994) Calpain: new perspectives in molecular diversity and physiological-pathological involvement. FASEB J 8: 814-822. |
[51] |
Podbielska M, Das A, Smith AW, et al. (2016) Neuron-microglia interaction induced bi-directional cytotoxicity associated with calpain activation. J Neurochem 139: 440-455. doi: 10.1111/jnc.13774
![]() |
[52] |
Xiao T, Zhang Y, Wang Y, et al. (2013) Activation of an apoptotic signal transduction pathway involved in the upregulation of calpain and apoptosis-inducing factor in aldosterone-induced primary cultured cardiomyocytes. Food Chem Toxicol 53: 364-370. doi: 10.1016/j.fct.2012.12.022
![]() |
[53] |
Imai T, Kosuge Y, Endo-Umeda K, et al. (2014) Protective effect of S-allyl-L-cysteine against endoplasmic reticulum stress-induced neuronal death is mediated by inhibition of calpain. Amino Acids 46: 385-393. doi: 10.1007/s00726-013-1628-4
![]() |
[54] | Li H, Zhang N, Sun G, et al. (2013) Inhibition of the group I mGluRs reduces acute brain damage and improves long-term histological outcomes after photothrombosis-induced ischaemia. ASN Neuro 5: 195. |
[55] |
Ray SK, Neuberger TJ, Deadwyler G, et al. (2002) Calpain and calpastatin expression in primary oligodendrocyte culture: preferential localization of membrane calpain in cell processes. J Neurosci Res 70: 561-569. doi: 10.1002/jnr.10414
![]() |
[56] |
Das A, Garner DP, Del Re AM, et al. (2006) Calpeptin provides functional neuroprotection to rat retinal ganglion cells following Ca2+ influx. Brain Res 1084: 146-157. doi: 10.1016/j.brainres.2006.02.051
![]() |
[57] |
Guyton MK, Brahmachari S, Das A, et al. (2009) Inhibition of calpain attenuates encephalitogenicity of MBP-specific T cells. J Neurochem 110: 1895-1907. doi: 10.1111/j.1471-4159.2009.06287.x
![]() |
[58] | Guyton MK, Das A, Samantaray S, et al. (2010) Calpeptin attenuated inflammation, cell death, and axonal damage in animal model of multiple sclerosis. J Neurosci Res 88: 2398-2408. |
[59] | Neffe AT, Abell AD (2005) Developments in the design and synthesis of calpain inhibitors. Curr Opin Drug Discov Develop 8: 684-700. |
[60] | Das A, Sribnick EA, Wingrave JM, et al. (2005) Calpain activation in apoptosis of ventral spinal cord 4.1 (VSC4.1) motoneurons exposed to glutamate: calpain inhibition provides functional neuroprotection. J Neurosci Res 81: 551-562. |
[61] |
Sharma A1 (2007) Sustained elevation of intracellular cGMP causes oxidative stress triggering calpain-mediated apoptosis in photoreceptor degeneration. Curr Eye Res 32: 259-269. doi: 10.1080/02713680601161238
![]() |
[62] |
Min Y, Zhu W, Zheng X, et al. (2016) Effect of glutamate on lysosomal membrane permeabilization in primary cultured cortical neurons. Mol Med Rep 13: 2499-2505. doi: 10.3892/mmr.2016.4819
![]() |
[63] |
Shirasaki Y, Yamaguchi MH (2006) Retinal penetration of calpain inhibitors in rats after oral administration. J Ocul Pharmacol Ther 22: 417-424. doi: 10.1089/jop.2006.22.417
![]() |
[64] |
Koumura A, Nonaka Y, Hyakkoku K, et al. (2008). A novel calpain inhibitor, ((1S)-1((((1S)-1-benzyl-3-cyclopropylamino-2,3-di-oxopropyl)amino)carbonyl)-3-met hylbutyl) carbamic acid 5-methoxy-3-oxapentyl ester, protects neuronal cells from cerebral ischemia-induced damage in mice. Neurosci 157: 309-318. doi: 10.1016/j.neuroscience.2008.09.007
![]() |
[65] |
Nakajima E, Hammond KB, Rosales JL, et al. (2011) Calpain, not caspase, is the causative protease for hypoxic damage in cultured monkey retinal cells. Invest Ophthalmol Vis Sci 52: 7059-7067. doi: 10.1167/iovs.11-7497
![]() |
[66] | Trager N, Butler JT, Haque A, et al. (2013) The Involvement of Calpain in CD4+ T Helper Cell Bias in Multple Sclerosis. J Clin Cell Iimmunol 4: 1000153. |
[67] | Surh YJ, Chun KS, Cha HH, et al. (2001) Molecular mechanisms underlying chemopreventive activities of anti-inflammatory phytochemicals: down-regulation of COX-2 and iNOS through suppression of NF-kappa B activation. Mutat Res s480-481: 243-268. |
[68] |
Potz BA, Sabe AA, Elmadhun NY, et al. (2017) Calpain inhibition decreases inflammatory protein expression in vessel walls in a model of chronic myocardial ischemia. Surgery 161: 1394-1404. doi: 10.1016/j.surg.2016.11.009
![]() |
[69] |
Butler JT, Samantaray S, Beeson CC, et al. (2009) Involvement of calpain in the process of Jurkat T cell chemotaxis. J Neurosci Res 87: 626-635. doi: 10.1002/jnr.21882
![]() |
[70] | Mikosik A, Jasiulewicz A, Daca A, et al. (2016) Roles of calpain-calpastatin system (CCS) in human T cell activation. Oncotarget 7: 76479-76495. |
[71] |
Moretti D, Del BB, Allavena G, et al. (2014) Calpains and cancer: friends or enemies? Arch Biochem Biophys 564: 26-36. doi: 10.1016/j.abb.2014.09.018
![]() |
[72] |
Deshpande RV, Goust JM, Hogan EL, et al. (1995) Calpain secreted by activated human lymphoid cells degrades myelin. J Neurosci Res 42: 259-265. doi: 10.1002/jnr.490420214
![]() |
[73] |
Jantzie LL, Winer JL, Corbett CJ, et al. (2016) Erythropoietin Modulates Cerebral and Serum Degradation Products from Excess Calpain Activation following Prenatal Hypoxia-Ischemia. Dev Neurosci 38: 15-26. doi: 10.1159/000441024
![]() |
[74] |
Guyton MK, Sribnick EA, Ray SK, et al. (2005) A role for calpain in optic neuritis. Ann NY Acad Sci 1053: 48-54. doi: 10.1196/annals.1344.005
![]() |
[75] |
Cerghet M, Skoff RP, Bessert D, et al (2006) Proliferation and death of oligodendrocytes and myelin proteins are differentially regulated in male and female rodents. J Neurosci 26: 1439-1447. doi: 10.1523/JNEUROSCI.2219-05.2006
![]() |
[76] |
Ding ZJ, Chen X, Tang XX, et al. (2015) Calpain inhibitor PD150606 attenuates glutamate induced spiral ganglion neuron apoptosis through apoptosis inducing factor pathway in vitro. PLoS One 10: e0123130. doi: 10.1371/journal.pone.0123130
![]() |
[77] |
Das A, Guyton MK, Matzelle DD, et al. (2008) Time-dependent increases in protease activities for neuronal apoptosis in spinal cords of Lewis rats during development of acute experimental autoimmune encephalomyelitis. J Neurosci Res 86: 2992-3001. doi: 10.1002/jnr.21737
![]() |
[78] |
Vosler PS, Brennan CS, Chen J (2008) Calpain-mediated signaling mechanisms in neuronal injury and neurodegeneration. Mol Neurobiol 38: 78-100. doi: 10.1007/s12035-008-8036-x
![]() |
[79] |
Schaecher K, Goust JM, Banik NL (2004) The effects of calpain inhibition on IkB alpha degradation after activation of PBMCs: identification of the calpain cleavage sites. Neurochem Res 29: 1443-1451. doi: 10.1023/B:NERE.0000026410.56000.dd
![]() |
[80] |
Gerondakis S, Grumont R, Rourke I, et al. (1998) The regulation and roles of Rel/NF-kappa B transcription factors during lymphocyte activation. Curr Opin Immunol 10: 353-359. doi: 10.1016/S0952-7915(98)80175-1
![]() |
[81] |
Miyazaki T, Taketomi Y, Saito Y, et al. (2015) Calpastatin counteracts pathological angiogenesis by inhibiting suppressor of cytokine signaling 3 degradation in vascular endothelial cells. Circ Res 116: 1170-1181. doi: 10.1161/CIRCRESAHA.116.305363
![]() |
[82] |
Datta R, Naura AS, Zerfaoui M, et al. (2011) PARP-1 deficiency blocks IL-5 expression through calpain-dependent degradation of STAT-6 in a murine asthma model. Allergy 66: 853-861. doi: 10.1111/j.1398-9995.2011.02549.x
![]() |
[83] |
Tahvanainen J, Kallonen T, Lähteenmäki H, et al. (2009) PRELI is a mitochondrial regulator of human primary T-helper cell apoptosis, STAT6, and Th2-cell differentiation. Blood 113: 1268-1277. doi: 10.1182/blood-2008-07-166553
![]() |
[84] |
Hendry L, John S (2004) Regulation of STAT signalling by proteolytic processing. Eur J Biochem 271: 4613-4620. doi: 10.1111/j.1432-1033.2004.04424.x
![]() |
[85] |
Svensson L, Mcdowall A, Giles K M, et al. (2010) Calpain 2 controls turnover of LFA-1 adhesions on migrating T lymphocytes. PLoS One 5: e15090. doi: 10.1371/journal.pone.0015090
![]() |
[86] |
Stewart MP, Mcdowall A, Hogg N (1998) LFA-1-mediated adhesion is regulated by cytoskeletal restraint and by a Ca2+-dependent protease, calpain. J cell Biol 140: 699-707. doi: 10.1083/jcb.140.3.699
![]() |
[87] | Soede RD, Driessens MH, Ruulsvan SL, et al. (1999) LFA-1 to LFA-1 signals involve zeta-associated protein-70 (ZAP-70) tyrosine kinase: relevance for invasion and migration of a T cell hybridoma. J Immunol 163: 4253-4261. |
[88] |
Engelhard VH, Altrich-Vanlith M, Ostankovitch M, et al. (2006) Post-translational modifications of naturally processed MHC-binding epitopes. Curr Opin Immunol 18: 92-97. doi: 10.1016/j.coi.2005.11.015
![]() |
[89] |
Imam SA, Guyton MK, Haque A, et al. (2007) Increased calpain correlates with Th1 cytokine profile in PBMCs from MS patients. J Neuroimmunol 190: 139-145. doi: 10.1016/j.jneuroim.2007.07.016
![]() |
[90] | Zhang Z, Huang Z, Dai H, et al. (2015) Therapeutic Efficacy of E-64-d, a Selective Calpain Inhibitor, in Experimental Acute Spinal Cord Injury. BioMed Res Int: 134242. |
[91] |
Posmantur R, Hayes RL, Dixon CE, et al. (1994) Neurofilament 68 and neurofilament 200 protein levels decrease after traumatic brain injury. J Neurotrauma 11: 533-545. doi: 10.1089/neu.1994.11.533
![]() |
[92] |
Zhang JN, Michel U, Lenz C, et al. (2016) Calpain-mediated cleavage of collapsin response mediator protein-2 drives acute axonal degeneration. Sci Rep 6: 37050. doi: 10.1038/srep37050
![]() |
[93] | Wilson GN, Smith MA, Inman DM, et al. (2016) Early Cytoskeletal Protein Modifications Precede Overt Structural Degeneration in the DBA/2J Mouse Model of Glaucoma. Front Neurosci 10: 494. |
[94] |
Saito K, Elce JS, Hamos E, et al. (1993) Widespread activation of calcium-activated neutral proteinase (calpain) in the brain in Alzheimer disease: a potential molecular basis for neuronal degeneration. Proc Natl Acad Sci USA 90: 2628-2632. doi: 10.1073/pnas.90.7.2628
![]() |
[95] |
Dowling P, Husar W, Menonna J, et al. (1997) Cell death and birth in multiple sclerosis brain. J Neurol Sci 149: 1-11. doi: 10.1016/S0022-510X(97)05213-1
![]() |
[96] |
Gerónimoolvera C, Montiel T, Rinconheredia R, et al. (2017) Autophagy fails to prevent glucose deprivation/glucose reintroduction-induced neuronal death due to calpain-mediated lysosomal dysfunction in cortical neurons. Cell Death Disease 8: e2911. doi: 10.1038/cddis.2017.299
![]() |
[97] |
Sharma AK, Rohrer B (2017) Calcium-induced calpain mediates apoptosis via caspase-3 in a mouse photoreceptor cell line. J Biol Chem 292: 13186. doi: 10.1074/jbc.A117.401037
![]() |
[98] |
Pitt D, Werner P, Raine CS (2000) Glutamate excitotoxicity in a model of multiple sclerosis. Nat Med 6: 67-70. doi: 10.1038/71555
![]() |
[99] |
Shields DC, Banik NL (1999) A putative mechanism of demyelination in multiple sclerosis by a proteolytic enzyme, calpain. Proc Natl Acad Sci USA 96: 11486-11491. doi: 10.1073/pnas.96.20.11486
![]() |
[100] |
Zhang ZW, Qin XY, Che FY, et al. (2015) Effects of beta 2 adrenergic agonists on axonal injury and mitochondrial metabolism in experimental autoimmune encephalomyelitis rats. Genetics and molecular research: GMR 14: 13572-13581. doi: 10.4238/2015.October.28.17
![]() |
[101] |
Kivisäkk P, Mahad DJ, Callahan MK, et al. (2003) Human cerebrospinal fluid central memory CD4+ T cells: evidence for trafficking through choroid plexus and meninges via P-selectin. Proc Natl Acad Sci USA 100: 8389-8394. doi: 10.1073/pnas.1433000100
![]() |
[102] |
Lassmann H, Ransohoff RM (2004) The CD4-Th1 model for multiple sclerosis: a critical [correction of crucial] re-appraisal. Trends Immunol 25: 132-137. doi: 10.1016/j.it.2004.01.007
![]() |
[103] |
Dhib S (2003) Glatiramer acetate-reactive peripheral blood mononuclear cells respond to multiple myelin antigens with a Th2-biased phenotype. J Neuroimmunol 140: 163-171. doi: 10.1016/S0165-5728(03)00170-X
![]() |
[104] |
Issazadeh S, Mustafa M, Ljungdahl A, et al. (1995) Interferon gamma, interleukin 4 and transforming growth factor beta in experimental autoimmune encephalomyelitis in Lewis rats: dynamics of cellular mRNA expression in the central nervous system and lymphoid cells. J Neurosci Res 40: 579-590. doi: 10.1002/jnr.490400503
![]() |
[105] | Kennedy MK, Torrance DS, Picha KS, et al. (1992) Analysis of cytokine mRNA expression in the central nervous system of mice with experimental autoimmune encephalomyelitis reveals that IL-10 mRNA expression correlates with recovery. J Immunol 149: 2496. |
[106] |
Nishihara M, Ogura H, Ueda N, et al. (2007) IL-6-gp130-STAT3 in T cells directs the development of IL-17+ Th with a minimum effect on that of Treg in the steady state. Int Immunol 19: 695-702. doi: 10.1093/intimm/dxm045
![]() |
[107] |
Immunology N (2005) Interleukin 17-producing CD4+ effector T cells develop via a lineage distinct from the T helper type 1 and 2 lineages. Nat Immunol 6: 1123-1132. doi: 10.1038/ni1254
![]() |
[108] |
Park H, Li Z, Yang XO, et al. (2005) A distinct lineage of CD4 T cells regulates tissue inflammation by producing interleukin 17. Nat Immunol 6: 1133-1141. doi: 10.1038/ni1261
![]() |
[109] | Passos GRD, Sato DK, Becker J, et al. (2016) Th17 Cells Pathways in Multiple Sclerosis and Neuromyelitis Optica Spectrum Disorders: Pathophysiological and Therapeutic Implications. Mediat Inflamm 2016: 1-11. |
[110] |
Zahra S, Rozita D, Masoumeh B, et al. (2016) Differential Frequency of CD8+ T Cell Subsets in Multiple Sclerosis Patients with Various Clinical Patterns. PLoS One 11: e0159565. doi: 10.1371/journal.pone.0159565
![]() |
[111] |
Kebir H, Ifergan I, Alvarez JI, et al. (2009) Preferential recruitment of interferon-gamma-expressing TH17 cells in multiple sclerosis. Ann Neurol 66: 390-402. doi: 10.1002/ana.21748
![]() |
[112] |
Thackray SJ, Mowat CG, Chapman SK (2008) Exploring the mechanism of tryptophan 2,3-dioxygenase. Biochem Soc Trans 36: 1120-1123. doi: 10.1042/BST0361120
![]() |
[113] | Stone TW, Darlington LG (2002) Endogenous kynurenines as targets for drug discovery and development. Nat Rev 1: 609-620. |
[114] |
Munn DH, Mellor AL (2007) Indoleamine 2,3-dioxygenase and tumor-induced tolerance. J Clin Invest 117: 1147-1154. doi: 10.1172/JCI31178
![]() |
[115] |
Fallarino F, Grohmann U, You S, et al. (2006) The combined effects of tryptophan starvation and tryptophan catabolites down-regulate T cell receptor zeta-chain and induce a regulatory phenotype in naive T cells. J Immunol 176: 6752-6761. doi: 10.4049/jimmunol.176.11.6752
![]() |
[116] |
Mackenzie CR, Heseler K, Müller A, et al. (2007) Role of indoleamine 2,3-dioxygenase in antimicrobial defence and immuno-regulation: tryptophan depletion versus production of toxic kynurenines. Curr Drug Metab 8: 237-244. doi: 10.2174/138920007780362518
![]() |
[117] |
Mancuso R, Hernis A, Agostini S, et al. (2015) Indoleamine 2,3 Dioxygenase (IDO) Expression and Activity in Relapsing-Remitting Multiple Sclerosis. Plos One 10: e0130715. doi: 10.1371/journal.pone.0130715
![]() |
[118] |
Sousa DA, Porto WF, Silva MZ, et al. (2016) Influence of Cysteine and Tryptophan Substitution on DNA-Binding Activity on Maize α-Hairpinin Antimicrobial Peptide. Molecules 21: 1062. doi: 10.3390/molecules21081062
![]() |
[119] |
Smith AW, Doonan BP, Tyor WR, et al. (2011) Regulation of Th1/Th17 cytokines and IDO gene expression by inhibition of calpain in PBMCs from MS patients. J Neuroimmunol 232: 179-185. doi: 10.1016/j.jneuroim.2010.09.030
![]() |
[120] |
Cilingir V, Batur M, Bulut MD, et al. (2017) The association between retinal nerve fibre layer thickness and corpus callosum index in different clinical subtypes of multiple sclerosis. Neurol Sci 38: 1223-1232. doi: 10.1007/s10072-017-2947-0
![]() |
[121] |
Britze J, Pihljensen G, Frederiksen JL (2017) Retinal ganglion cell analysis in multiple sclerosis and optic neuritis: a systematic review and meta-analysis. J Neurol 264: 1837-1853. doi: 10.1007/s00415-017-8531-y
![]() |
[122] |
Mowry EM, Loguidice MJ, Daniels AB, et al. (2009) Vision related quality of life in multiple sclerosis: correlation with new measures of low and high contrast letter acuity. J Neurol Neurosurg Psychia 80: 767-772. doi: 10.1136/jnnp.2008.165449
![]() |
[123] |
Mackay DD (2015) Should patients with optic neuritis be treated with steroids? Curr Opin Ophthalmol 26: 439-444. doi: 10.1097/ICU.0000000000000197
![]() |
[124] |
Dimitriu C, Bach M, Lagrèze WA, et al. (2008) Methylprednisolone fails to preserve retinal ganglion cells and visual function after ocular ischemia in rats. Invest Ophthalmol Vis Sci 49: 5003-5007. doi: 10.1167/iovs.08-1869
![]() |
[125] |
Das A, Guyton MK, Smith A, et al. (2013) Calpain inhibitor attenuated optic nerve damage in acute optic neuritis in rats. J Neurochem 124: 133-143. doi: 10.1111/jnc.12064
![]() |
[126] |
Shields DC, Tyor WR, Deibler GE, et al. (1998) Increased calpain expression in experimental demyelinating optic neuritis: an immunocytochemical study. Brain Res 784: 299-304. doi: 10.1016/S0006-8993(97)01381-4
![]() |
[127] |
Hoffmann DB, Williams SK, Jovana B, et al. (2013) Calcium influx and calpain activation mediate preclinical retinal neurodegeneration in autoimmune optic neuritis. J Neuropathol Exp Neurol 72: 745-757. doi: 10.1097/NEN.0b013e31829c7370
![]() |
[128] |
Shimazawa M, Suemori S, Inokuchi Y, et al. (2010) A novel calpain inhibitor, ((1S)-1-((((1S)-1-Benzyl-3-cyclopropylamino-2,3-di-oxopropyl)amino)carbonyl)-3-methylbutyl)carbamic acid 5-methoxy-3-oxapentyl ester (SNJ-1945), reduces murine retinal cell death in vitro and in vivo. J Pharm Exp Ther 332: 380-387. doi: 10.1124/jpet.109.156612
![]() |
[129] |
Imai S, Shimazawa M, Nakanishi T, et al. (2010) Calpain inhibitor protects cells against light-induced retinal degeneration. J Pharm Exp Ther 335: 645-652. doi: 10.1124/jpet.110.171298
![]() |
[130] |
Yokoyama Y, Maruyama K, Yamamoto K, et al. (2014) The role of calpain in an in vivo model of oxidative stress-induced retinal ganglion cell damage. Biochem Biophys Res Comm 451: 510-515. doi: 10.1016/j.bbrc.2014.08.009
![]() |
[131] | Wang Y, Liu Y, Lopez D, et al. (2017) Protection against TBI-induced neuronal death with post-treatment with a selective calpain-2 inhibitor in mice. J Neurotrauma. |
[132] |
Tsuda S, Tanaka Y, Kunikata H, et al. (2016) Real-time imaging of RGC death with a cell-impermeable nucleic acid dyeing compound after optic nerve crush in a murine model. Exp Eye Res 146: 179-188. doi: 10.1016/j.exer.2016.03.017
![]() |
[133] |
Ryu M, Yasuda M, Shi D, et al. (2012) Critical role of calpain in axonal damage-induced retinal ganglion cell death. J Neurosci Res 90: 802-815. doi: 10.1002/jnr.22800
![]() |
[134] |
Nemeth CL, Drummond GT, Mishra MK, et al. (2017) Uptake of dendrimer-drug by different cell types in the hippocampus after hypoxic-ischemic insult in neonatal mice: Effects of injury, microglial activation and hypothermia. Nanomedicine 13: 2359-2369. doi: 10.1016/j.nano.2017.06.014
![]() |
[135] |
Zhang F, Trent MJ, Lin YA, et al. (2017) Generation-6 hydroxyl PAMAM dendrimers improve CNS penetration from intravenous administration in a large animal brain injury model. J Control Release 249: 173-182. doi: 10.1016/j.jconrel.2017.01.032
![]() |
[136] |
Balcer LJ, Galetta SL, Calabresi PA, et al. (2007) Natalizumab reduces visual loss in patients with relapsing multiple sclerosis. Neurology 68: 1299-1304. doi: 10.1212/01.wnl.0000259521.14704.a8
![]() |
[137] |
Sättler MB, Demmer I, Williams SK, et al. (2006) Effects of interferon-beta-1a on neuronal survival under autoimmune inflammatory conditions. Exp Neurol 201: 172-181. doi: 10.1016/j.expneurol.2006.04.015
![]() |
[138] |
Coleman M (2005) Axon degeneration mechanisms: commonality amid diversity. Nat Rev Neurosci 6: 889-898. doi: 10.1038/nrn1788
![]() |
n — polynomial order | {s_{\max }} | Λ | {N_{{\text{out}}}} |
1 | 2 | 688 | 562 |
2 | 9 | 931 | 319 |
3 | 6 | 1049 | 201 |
4 | 6 | 1087 | 163 |
5 | 5 | 1105 | 145 |
6 | 7 | 1109 | 141 |
7 | 4 | 1116 | 134 |
8 | 4 | 1116 | 134 |
\boldsymbol k | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (exact) | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (found) | |\Delta {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}}|/{{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} |
1 | 0.0091230 | 0.0091240 | < 1.1×10−4 |
\boldsymbol k | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (exact) | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (found) | |\Delta {{\mathbf{\mathtt{ν}}}_k}|/{{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} |
1 | 0.002500 | 0.0025010 | 4.0 × 10−4 |
2 | 0.004555 | 0.0045550 | < 2.0 × 10−5 |
3 | 0.007123 | 0.0071210 | 2.8 × 10−4 |
4 | 0.0091230 | 0.0091260 | 3.3 × 10−4 |
5 | 0.012345 | 0.0123500 | 4.0 × 10−4 |
n — polynomial order | {s_{\max }} | Λ | {N_{{\text{out}}}} |
1 | 2 | 688 | 562 |
2 | 9 | 931 | 319 |
3 | 6 | 1049 | 201 |
4 | 6 | 1087 | 163 |
5 | 5 | 1105 | 145 |
6 | 7 | 1109 | 141 |
7 | 4 | 1116 | 134 |
8 | 4 | 1116 | 134 |
\boldsymbol k | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (exact) | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (found) | |\Delta {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}}|/{{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} |
1 | 0.0091230 | 0.0091240 | < 1.1×10−4 |
\boldsymbol k | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (exact) | {{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} (found) | |\Delta {{\mathbf{\mathtt{ν}}}_k}|/{{\mathbf{\mathtt{ν}}}_{\boldsymbol k}} |
1 | 0.002500 | 0.0025010 | 4.0 × 10−4 |
2 | 0.004555 | 0.0045550 | < 2.0 × 10−5 |
3 | 0.007123 | 0.0071210 | 2.8 × 10−4 |
4 | 0.0091230 | 0.0091260 | 3.3 × 10−4 |
5 | 0.012345 | 0.0123500 | 4.0 × 10−4 |