Perform 1-dim/2-dim projection pursuit, grand tour and guided tour for big data based on data nuggets. 
    Reference papers: [1] Beavers et al., (2024) <doi:10.1080/10618600.2024.2341896>. 
    [2] Duan, Y., Cabrera, J., & Emir, B. (2023). "A New Projection Pursuit Index for Big Data." <doi:10.48550/arXiv.2312.06465>.

Performs partial principal component analysis of a large sparse matrix. 
  The matrix may be stored as a list of matrices to be concatenated (implicitly) horizontally.
  Useful application includes cases where the number of total nonzero entries exceed the capacity of 
  32 bit integers (e.g., with large Single Nucleotide Polymorphism data).

Calculates the Probability Plot Correlation Coefficient (PPCC) 
             between a continuous variable X and a specified distribution. The corresponding 
	     composite hypothesis test that was first introduced by 
	     Filliben (1975) <doi: 10.1080/00401706.1975.10489279> 
	     can be performed to test whether the sample 
	     X is element of either the Normal, log-Normal, Exponential,
	     Uniform, Cauchy, Logistic, Generalized Logistic, Gumbel (GEVI), Weibull,
	     Generalized Extreme Value, Pearson III (Gamma 2), Mielke's Kappa, Rayleigh
	     or Generalized Logistic Distribution. The PPCC test is performed with
	     a fast Monte-Carlo simulation.

In the era of big data, data redundancy and distributed characteristics present novel challenges to data analysis. This package introduces a method for estimating optimal subsets of redundant distributed data, based on PPCDT (Conjunction of Power and P-value in Distributed Settings). Leveraging PPC technology, this approach can efficiently extract valuable information from redundant distributed data and determine the optimal subset. Experimental results demonstrate that this method not only enhances data quality and utilization efficiency but also assesses its performance effectively. The philosophy of the package is described in Guo G. (2020) <doi:10.1007/s00180-020-00974-4>.