Two-dimensional time-reversible ergodic maps with provisions for dissipation

Two-dimensional time-reversible ergodic maps with provisions for dissipation

Puneet Kumar Patra Advanced Technology Development Center, Indian Institute of Technology Kharagpur, West Bengal, India 721302 puneetpatra@atdc.iitkgp.ernet.in
July 16, 2019
Abstract

A new discrete time-reversible map of a unit square onto itself is proposed. The map comprises of piecewise linear two-dimensional operations, and is able to represent the macroscopic features of both equilibrium and nonequilibrium dynamical systems. Our operations are analogous to sinusoidally driven shear in the two dimensions, and a radial compression/expansion of a point lying outside/inside a circle centered around origin. Depending upon the radius, the map transitions from being ergodic and nondissipative (like in equilibrium situations) to a limit cycle through intermediate multifractal situations (like in nonequilibrium situations). All dissipative cases of the proposed map suggest that the Kaplan – Yorke dimension is smaller than the embedding dimension, a feature typically arising in nonequilibrium steady-states. The proposed map differs from the existing maps like the Baker’s map and Arnold’s cat map in the sense that (i) it is reversible, and (ii) it generates an intricate multifractal phase-space portrait.

Ergodic maps; Dissipative maps, Random number generator, Lyapunov exponents

I Introduction

A large class of nonequilibrium systems can be modelled using time-reversible dynamics that allow thermodynamic and hydrodynamic dissipation Hoover and Hoover (2012). Such models usually augment the Newtonian (or equivalently the Hamiltonian) equations of motion with friction like terms in a manner that energy can be exchanged with the surroundings Nose (1984); Hoover (1985); Hoover and Holian (1996); Martyna et al. (1992); Patra and Bhattacharya (2014a, 2015). If , and denote the position, momentum and friction-like variables, then the time reversibility of the underlying equations of motion tell us that both the forward trajectory and the time-reversed trajectory satisfy the evolution equations Hoover et al. (1996). The dynamical systems must be ergodic i.e. a trajectory initiating at a particular microstate must visit, given sufficient time, the neighbourhood of all allowable microstates Patra and Bhattacharya (2014b); Patra et al. (2015). Ergodicity of the dynamics (i) makes the time-averages of a dynamical property independent of the initial conditions, and (ii) enables us to equate the phase-space averages with the time averages, rendering the applicability of the molecular dynamics simulations.

It has been known for a while now that the equilibrium systems are characterized by conservative dynamics and the nonequilibrium dynamical systems are invariably characterized by dissipative dynamics caused by the conversion of useful work and internal energy into heat, as mandated by the second law of thermodynamics Evans and Morriss (2008); Posch and Hoover (1997). Additionally, the dissipative continuous dynamical systems have intricate multifractal dynamics, with their Kaplan-Yorke dimension Grassberger and Procaccia (2004) smaller than the embedding dimension, so that the entropy becomes singular and divergent Hoover and Hoover (2013). Thus, the dynamics of a nonequilibrium system follows a unidirectional “arrow of time”, something seemingly in contradiction with the time-reversible nature of the dynamics. The paradox of time-reversibility of the dynamics and the arrow of time may be resolved by arguing the stability of the multifractals obtained in the forward trajectory relative to the time-reversed trajectory – the forward trajectories are Lyapunov stable i.e. , while the reverse trajectories are Lyapunov unstable i.e. . Here, represents the Lyapunov exponent. Thus, the strange attractor of the forward trajectory acts as a sink whose source is provided by the repeller of the time-reversed trajectory.

However, analyzing and understanding the physics of nonequilibrium dynamics even for simple three-dimensional and four-dimensional cases is not trivial. For example, “holes” embedded within a subspace of a four dimensional system Patra and Bhattacharya (2014b), or near zero-measure tori in three dimensional systems Hoover et al. (2015) are very challenging to determine. A simple alternative to understanding the behavior of these complex dynamical systems is to study the equivalent two-dimensional maps.

Ideally, these maps should show all the features of a continuous dynamical system discussed before: (i) time reversible, (ii) ergodic, and (iii) allow dissipation to occur. We define time-reversibility of the maps analogous to the time reversibility of the continuous dynamical systems Hoover et al. (1996): consider a mapping operation, , that maps a point to another point , upon reversing and performing another mapping operation results in the original state but with reversed : .

Over the years, several maps have been proposed in the literature - Baker’s map, Arnold’s cat map, Duffing map, exponential map etc. However, according to our definition of time reversibility, most of the maps, including the extensively studied Baker’s map Hoover and Hoover (2012), defined through the relation:

(1)

with and , and the Arnold’s cat map Isaeva et al. (2006), defined through the relation:

(2)

are not time reversible. It must, however, be noted that the rotated Baker’s map Hoover and Hoover (2015a) follows our time-reversibility criteria. While time reversibility of the maps is a sticky subject, the requirement of ergodicity is satisfied by several of the maps. For example take the Arnold’s cat map beginning at the initial conditions . The map quickly fills out the entire phase-space uniformly as shown in figure 1. A similar behavior can be observed for the Baker’s map.

Figure 1: Uniform filling of the phase-space by the Arnold’s cat map suggesting the ergodicity of the mapping. The red dot indicates the initial conditions (0.3,0.4). 1 million mapping operations have been used to plot the figure.

Let us now look at the third desirable property of the maps that is exclusive to the nonequilibrium systems - dissipation. For a dissipative map, the Lyapunov exponents must sum up to being negative. The Baker’s map, with appropriate selection of and allows dissipation Rondoni and Morriss (1996). However, the dissipation is zero for the Arnold’s cat map Isaeva et al. (2006) with . Thus, we see that most of the “well studied” maps do not satisfy all the three important characteristics necessary for accurately representing the features of a dynamical system.

In 1996, a new map of a square [] onto itself has been proposed Hoover et al. (1996) that satisfies all three requirements. It comprises of piecewise linear operations which are symmetrical combinations of simple shear operations:

(3)

and reflection operation , wherein an imaginary mirror (located at from origin) maps proportionally the points lying towards its left to right, and vice-versa, according to the relation:

(4)

In (4), denotes the variables and . Consolidated maps that comprise of symmetric combination of these three operations, such as:

(5)

are ergodic, time-reversible as well as have provisions for allowing dissipation (depending on the value of ). Two such cases due to the mappings and with initial conditions are shown in figure 2.

Figure 2: The dissipative maps (a) , and (b) for the initial conditions obtained through 1 million operations.

The multifractal nature of the dynamics is evident in figure 2. Unfortunately, however, the simple mappings shown in (5) are unable to match the complex multifractal nature of the continuous dynamical systems.

Recently, the Ian Snook memorial 2015 challenge has been posted Hoover and Hoover (2015b) regarding the development of new maps that are more complicated than the ones highlighted in figure 2, while satisfying the three properties of maps highlighted before. The objective of this work is to develop new time-reversible ergodic maps with a parameter-dependent dissipation having complicated multifractal dynamics. We replace the three mapping operations shown in (3) and (4) with sinusoidal shears, and radial compression/expansion. The resulting linear combinations of the maps satisfy all targets that we set out to achieve.

Ii Time-Reversible Ergodic Maps

Amongst all the properties that we seek, time reversibility is the most challenging. So, let us first develop time-reversible maps. Consider an operation that maps a point . For the map to be time-reversible, the map must be an odd function of . The simple shear operations shown in (3) constitute one such way. Let us look at another such approach where the mapping function is given by:

(6)

If is the time-reverse operator that maps , then the equation represented by 6 is time-reversible:

(7)

In essense . It is not difficult to see that and its inverse, , are additive inverse. In physically relevant terms, the mapping highlighted in 6 consitutes the case of sinusoidally driven shear. Likewise let us define the mapping function for :

(8)

To ensure that the map remains confined within the unit square, we impose periodic boundary conditions by confining the variables within the unit square: . Any symmetric combination of and results in a time-reversible mapping. Let us take the simple case of the mapping , and prove its time reversibility:

(9)

Similarly, the more complicated mappings and can be shown to be time reversible as well. However, the asymmetric cases like: are not time reversible.

Let us now investigate numerically the ergodic properties of the proposed , and . By definition, we call a map ergodic if it comes arbitrary closer to all possible points, which in this case represents all possible points lying within the unit square . Thus, for the maps to be ergodic, they must sample the points according to a uniform distribution for both the and variables. Phase-potrait post 1 million mapping operations corresponding to the three maps are shown in figure 3. For each case, the mapping starts from the initial condition: . The resulting maps indicate a uniform coverage within in the unit square, suggesting that the maps are ergodic. However, mere visual inspection is not enough.

Figure 3: Time-reversible ergodic maps initiating from the red dot () based upon sinusoidally driven shear operations: (a) corresponds to , (b) corresponds to , and (c) corresponds to . The results are plotted for 1 million operations. Notice that the mapping operations fill the entire square uniformly, suggesting that the maps are ergodic.

ii.1 Statistical Independence of the variables and

To check for ergodicity, we need to show that the maps sample, for both and uniformly. Additionally, the sequence of must be statistically independent from the sequence as well as from its subsequent realizations . In other words, the sampling must be such that the values of and have zero correlation with each other, and autocorrelation with itself. The correlation coefficient between the sequence and is defined as:

(10)

where and are the expected values of and , is the expected value of the product , and and are the standard deviations of and , respectively. represents the total number of samples. The correlations between and for the three maps are shown in the table 1, and their temporal evolutions are shown in figure 4.

Correlation Coefficient
-0.0003
-0.0012
-0.0019
Table 1: Correlations between and for the three maps.

The figure suggests that the correlation coefficient has converged. It is evident that the variables have statistically insignificant correlations for all three maps.

Figure 4: Temporal evolution of correlation coefficient, calculated using (10), for the three maps. The figure suggests that the correlation coefficient has converged.
True Moment
(2, 2) 0 -0.00002302 0.00000000 -0.00009769 0.00000000 -0.00015634 0.00000000
(3, 3) 0.00694444 0.00694239 0.00694168 0.00692949 0.00692791 0.00696127 0.00695927
(4, 4) 0 0.00000000 0.00000000 -0.00000168 0.00000000 -0.00000464 0.00000000
(5, 5) 0.00015625 0.00015608 0.00015611 0.00015608 0.00015581 0.00015680 0.00015661
(6, 6) 0 0.00000000 0.00000000 -0.00000007 0.00000000 -0.00000020 0.00000000
(7, 7) 0.00000498 0.00000497 0.00000498 0.00000499 0.00000497 0.00000501 0.00000499
(8, 8) 0 0.00000000 0.00000000 0.00000000 0.00000000 -0.00000001 0.00000000
Table 2: The comparison of joint moments: true joint moment gives the theoretical joint moment if the variables are identically and independently uniformly distributed, gives the joint moment obtained numerically, and gives the product of marginal moments obtained numerically. Notice that for each row, the true moment matches closely with the numerically computed joint moments and product of marginal moments. The equality suggests that the variables and are statistically independent.

Ideally, if the variables and are statistically independent, the following relation holds true for all values of and :

(11)

The test of statistical independence based on (10) is a special case of (11), where . We, therefore, now compare the joint higher order moments with the product of equivalent marginal moments. The results are shown in table 2. The theoretical moments have been computed (with the assumption that the variables are independent) through the relation:

(12)

The true moment matches closely with the numerically computed joint moments and product of marginal moments. The equality suggests that the variables and are statistically independent.

Now let us look at the independence of the variables from their subsequent realizations using autocorrelation function. The autocorrelation measures the correlation of a sequence with itself at different points in time, and can be calculated as:

(13)
Figure 5: The autocorrelation functions (ACF) due three maps: (a) for the variable , and (b) for the variable . All six variables are delta-correlated, implying that the value obtained in iteration is independent of the iteration.

The autocorrelation function (ACF) of and due to the three maps are shown in figure 5. The figures reveal that there is an autocorrelation of the order of 0.01 for each of the variables, which may be taken as small enough to be neglected. The finite value of autocorrelation, however, makes it difficult to use the maps for generating uniform random numbers. For the remainder of this work, we treat the autocorrelation of the variables small enough to be neglected.

ii.2 Tests for Uniformity

The uniformity of the variables have been ascertained using three basic statistical tests – the mean test, the variance test and the bucket test, as discussed next.

Mean Test: The mean test checks if the average of a large number of realizations of the variables agrees with the theoretical value Riley et al. (2009). The theoretical average for a uniform random number distributed between is 0. The averages of the six variables obtained due to the three maps is shown in the table 3.

Table 3: and values for the three different maps.

Performing a hypothesis test at 95% confidence level reveals that the true mean lies between . Thus, from the mean test, there is no statistical evidence to suggest that the variables and are not uniform.

Variance Test: Next we perform the variance test Riley et al. (2009) where we compare the sample variance vs. the true variance (=1/12). The variances are listed in the table 4.

Table 4: Variances and values for the three different maps.

The 95% confidence interval of the true variance is . Thus, we again see that there is no sufficient statistical evidence to suggest that the variables are not uniformly distributed.

Bucket Test: The entire data (of 1 million points) corresponding to each variable is grouped together in 100 bins. We then perform a chi-squared test Riley et al. (2009) by computing the test statistic:

(14)

Here and give the observed and expected counts in the bin The test statistic for the six variables are shown in table 5

96.005 81.447
98.904 82.015
120.804 99.130
Table 5: test statistic for the six “random” variables .

The critical value corresponding to a probability of 0.05 with 99 degrees of freedom is 124.34. Since all values shown in table 5 are lesser than it, we can say that there is a sufficient evidence that all variables are uniformly distributed.

All three tests (the mean test, the variance test and the bucket test) suggest that there is sufficient evidence that the random variables and , for all three maps, are uniformly distributed between [-0.5,0.5]. As the two variables corresponding to a particular map are statistically independent as well, we therefore conclude that the maps sample uniformly from the unit square, and hence ergodic.

Unfortunately, the autocorrelation of the variables, howsoever small, renders it difficult to use the maps as pseudo-random number generators. Additionally, all three maps fail the stringent “Diehard Battery” of tests for randomness Marsaglia (1996), which confirms that the random numbers generated using the three maps cannot be used as pseudo-random number generators.

ii.3 Lyapunov Exponents

Dissipation invariably involves compressible phase-space flows, with the Lyapunov exponents summing up to be negative. The largest Lyapunov exponent, , provides the exponential rate at which two nearby trajectories separate, while the sum of and , the smallest Lyapunov exponent, provides the rate at which the area changes. The maps developed so far are area-preserving, and hence non dissipative. The two Lyapunov exponents corresponding to these maps are paired, and therefore sum up to zero. To obtain the two Lyapunov exponents, apart from the original map, two satellite maps (separated from the original by ) are solved Hoover and Hoover (2012). After every iteration, Gram-Schmidt orthonormalization is performed, and the distance between the satellite values from the original values are normalized such that they are distance apart. The two Lyapunov exponents for the maps are shown in table 6. It is evident that , confirming that the maps are area preserving, and thus, have no provisions for dissipation.

Table 6: Lyapunov exponents and corresponding to the three maps.

It is interesting to note that despite providing a uniform measure and area conservation, the distribution of local Lyapunov exponents for these maps is far from being uniform, as shown in figure 6.

Figure 6: Local Lyapunov exponents for the two maps obtained using 1 million iterations. The darker the color, the larger is the value of the exponent. The exact color correspondence with values is different for each figure, however. Notice that the distribution of lyapunov exponents is far from being uniform. Also, note that the values are never negative.

Iii Dissipative Time Reversible Maps

In this section, we create a simple parameter dependent time-reversible dissipative map, and combine with the maps developed in the previous section to obtain a composite map that, depending on the parameter, allows dissipation.

Figure 7: Radial compression that maps a point lying outside the circle, , to a point inside the circle , and vice versa. Owing to the symmetry only the first quadrant is sufficient for the analysis. The compression proceeds such that the the green dot, lying at the boundary, is mapped to the origin (the green triangle). All remaining points are mapped proportionally. The blue colored (bottom square) points denotes the location of points post the time-reversal operator has been applied. operates on to take it to . Since the angle post remains unchanged, and so does the distance from the circle, the mappint takes this point to , thus, proving time-reversibility.

iii.1 Dissipative Maps

Consider the radial compression mapping , for the first quadrant, shown in figure 7, where a point, , that makes an angle is mapped to a point lying along the same line. If is the distance between the circle and the point, then post mapping, the updated location is at a distance from the circle. The updated coordinates are given by:

(15)

Likewise, a point lying within the circle is mapped outside of it through the relations:

(16)

Similar relations can be obtained for other quadrants as well. Before proceeding further let us prove graphically the time-reversibility of the map (see figure 7). The time-reversal operator acting upon this brings the point to the fourth quadrant . Since the magnitude of the angle that the point makes remains unchanged along with its distance from the circle, under , gets mapped to , thereby satisfying time-reversibility.

Depending upon the radius, , of the circle different dissipation regimes can be obtained. For example, if is near zero, a limit cycle is obtained, while if is moderately greater than zero, multifractals are obtained. This mapping used in conjunction with and , in symmetric combinations, can be used to develop time-reversible ergodic dissipative maps.

iii.2 Multifractal phase space

We next explore numerically the phase-space due to two such maps:

(17)

For both of them we keep the initial conditions at , and use two values of : 0.20 and 0.30. These results are shown in figure 8. It is evident that the resulting multifractal nature of the phase-space is significantly more complicated than the ones shown in the figure 2.

Figure 8: The dissipative maps showing the local Lyapunov exponent corresponding to the two maps and , and two different radii of the circle. The darker the color, the larger is the value of the local lyapunov exponent. Notice the radius dependence of the multifractal attractor.

There is a clear radius dependence of the phase-space: the multifractal nature of the phase space changes with radius. Let us now look at the ergodic properties of these maps.

iii.3 Ergodicity of dissipative maps

One can ascertain the ergodicity of the dissipative maps with thousands of different initial conditions by (i) comparing the difference between the maximum and minimum of the resulting largest Lyapunov exponents, and (ii) comparing the equality of the phase-averages like and with arising due to these initial conditions. If the difference between the maximum and minimum largest Lyapunov exponent and the phase-averages are small, the map (corresponding to a given ) is ergodic. On the other hand, if the differences are not small, the maps is not ergodic (corresponding to a given ). The ergodicity of the maps is tested using 2500 initial conditions obtained by dividing the unit square into a grid of squares. Coordinate of each node serves as an initial condition. The map is iterated for 1 million steps, while the map is iterated for 5 million steps.

The maximum and the minimum largest and smallest Lyapunov exponents for the two maps (obtained from 2500 initial conditions) are shown in figure 9. The results indicate that the map is ergodic for the better part of the radii spectrum (except at the radii where there is a significant difference between the maximum and minimum Lyapunov exponents). The map , on the other hand, shows a significant deviation between the maximum and minimum largest Lyapunov exponent for almost every radius, and therefore, is nonergodic. A similar conclusion can be drawn by looking at the different moments. It is interesting to note that regardless of map, the sum of the Lyapunov exponents is less than 0, suggesting that there is a finite amount of dissipation occurring. Hence, we come to the conclusion that only satisfies ergodicity, time-reversibility and dissipation.

Figure 9: The maximum and minimum largest Lyapunov exponent, , and the smallest Lyapunov exponent, , obtained from a grid of 2500 initial conditions. The maps are ergodic if the difference between the maximum and minimum Lyapunov exponents are comparable for a given radius. The results indicate that the map is ergodic for the better part of the radii spectrum (except at the radii where there is a significant difference between the maximum and minimum Lyapunov exponents). The map , on the other hand, shows a significant deviation between the maximum and minimum largest Lyapunov exponent for almost every radius, and therefore, is nonergodic.

For , at small values of the radius, both and are negative, suggesting the presence of stable periodic orbits. As radius increases, becomes greater than zero, suggesting the presence of a chaotic regime. The sum of both Lyapunov exponents, however, remains negative. It is not very surprising that the sum has a minimum value (of around -0.09) near . A simple calculation reveals that at , the area of the circle is exactly the same as the area of remaining square so that the dissipation is minimum (it cannot be zero owing to the local dependence of compression/expansion). Also evident is the fact that the Kaplan-Yorke dimension is smaller than the embedding dimension of 2 for all radii.

iii.4 Fractals and local Lyapunov exponents

We now look at the local Lyapunov exponents and the strange attractors corresponding to the two maps. For this purpose, we keep , and use two different initial conditions: and (0.29,0.35). The results are shown in figure 10. Both the maps show a multifractal attractor, suggesting that these maps have one of the most important feature of nonequilibrium dynamical systems – dissipation. However, the nature of the attractor differs for , depending upon the initial conditions chosen. For , on the other hand, initial conditions do not have a significant influence over the nature of the attractor.

Figure 10: The dissipative maps showing the local Lyapunov exponent corresponding to the two maps and , at for two different initial conditions. The darker the color, the larger is the value of the local lyapunov exponent. Notice the initial condition dependence of the multifractal attractor for .

Iv Summary and Conclusions:

In this work we have proposed two basic mapping operations - (i) time-reversible non-dissipative maps ( and ) inspired by sinusoidally driven shearing systems, and (ii) time-reversible dissipative map () which radially compresses/expands the system. All symmetric combinations of these maps result in time-reversible mappings. However, not all of them are (i) dissipative and (ii) ergodic.

The time-reversible non-dissipative maps sample from a uniform distribution as evidenced from the three basic statistical tests performed in this study. However, due to the small autocorrelation function, these maps cannot be utilized as a viable alternative to the pseudo-random number generators. Additionally, the maps fail the more stringent tests for randomness.

Developed as a solution to the recently posted 2015 Ian Snook prize problem, the dissipative map has a radius-dependent multifractal attractor. These multifractals are significantly more complicated (and beautiful!) than ones present in the literature, and we believe that it can be used to understand the properties of nonequilibrium dynamical systems.

V Acknowledgement

The author thanks Prof. Baidurya Bhattacharya of Indian Institute of Technology Kharagpur for his insightful comments.

References

  • Hoover and Hoover (2012) W. G. Hoover and C. G. Hoover, Time reversibility, computer simulation, algorithms, chaos (World Scientific, 2012).
  • Nose (1984) S. Nose, The Journal of Chemical Physics 81, 511 (1984).
  • Hoover (1985) W. G. Hoover, Physical Review A 31, 1695 (1985), pRA.
  • Hoover and Holian (1996) W. G. Hoover and B. L. Holian, Physics Letters A 211, 253 (1996).
  • Martyna et al. (1992) G. J. Martyna, M. L. Klein,  and M. Tuckerman, The Journal of Chemical Physics 97, 2635 (1992).
  • Patra and Bhattacharya (2014a) P. K. Patra and B. Bhattacharya, The Journal of Chemical Physics 140, 064106 (2014a).
  • Patra and Bhattacharya (2015) P. K. Patra and B. Bhattacharya, The Journal of Chemical Physics 142, 194103 (2015).
  • Hoover et al. (1996) W. G. Hoover, O. Kum,  and H. A. Posch, Physical Review E 53, 2123 (1996).
  • Patra and Bhattacharya (2014b) P. K. Patra and B. Bhattacharya, Physical Review E 90, 043304 (2014b), pRE.
  • Patra et al. (2015) P. K. Patra, J. C. Sprott, W. G. Hoover,  and C. G. Hoover, Molecular Physics , 1 (2015).
  • Evans and Morriss (2008) D. J. Evans and G. Morriss, Statistical mechanics of nonequilibrium liquids (Cambridge University Press, 2008).
  • Posch and Hoover (1997) H. Posch and W. G. Hoover, Physical Review E 55, 6803 (1997).
  • Grassberger and Procaccia (2004) P. Grassberger and I. Procaccia, in The Theory of Chaotic Attractors (Springer, 2004) pp. 170–189.
  • Hoover and Hoover (2013) W. G. Hoover and C. G. Hoover, arXiv preprint arXiv:1302.2533  (2013).
  • Hoover et al. (2015) W. G. Hoover, J. C. Sprott,  and P. K. Patra, arXiv preprint arXiv:1503.06749  (2015).
  • Isaeva et al. (2006) O. B. Isaeva, A. Y. Jalnine,  and S. P. Kuznetsov, Phys. Rev. E 74, 046207 (2006).
  • Hoover and Hoover (2015a) W. Hoover and C. Hoover, Simulation and Control of Chaotic Nonequilibrium Systems, Advanced series in nonlinear dynamics (World Scientific, 2015).
  • Rondoni and Morriss (1996) L. Rondoni and G. P. Morriss, Phys. Rev. E 53, 2143 (1996).
  • Hoover and Hoover (2015b) W. G. Hoover and C. G. Hoover, arXiv preprint arXiv:1507.01645  (2015b).
  • Riley et al. (2009) T. Riley, A. Goucher, R. Tim,  and G. Adam, Beautiful Testing: Leading Professionals Reveal How They Improve Software (O’Reilly Media, Inc., 2009).
  • Marsaglia (1996) G. Marsaglia, See http://stat. fsu. edu/  geo/diehard. html  (1996).
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
366242
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description