Skip to main content
  • Home
  • Development
  • Documentation
  • Donate
  • Operational login
  • Browse the archive

swh logo
SoftwareHeritage
Software
Heritage
Archive
Features
  • Search

  • Downloads

  • Save code now

  • Add forge now

  • Help

Revision 5bc804b03d066ef4a2ab9cf3af6f4f2df5bcda4e authored by Martin Maechler on 23 September 2011, 00:00:00 UTC, committed by Gabor Csardi on 23 September 2011, 00:00:00 UTC
version 0.7-9-1
1 parent f64e14b
  • Files
  • Changes
  • bb9cc8c
  • /
  • TODO
Raw File Download

To reference or cite the objects present in the Software Heritage archive, permalinks based on SoftWare Hash IDentifiers (SWHIDs) must be used.
Select below a type of object currently browsed in order to display its associated SWHID and permalink.

  • revision
  • directory
  • content
revision badge
swh:1:rev:5bc804b03d066ef4a2ab9cf3af6f4f2df5bcda4e
directory badge
swh:1:dir:bb9cc8c138e939c538e7130ff79a0690424ffcb8
content badge
swh:1:cnt:83b9a2b1f5cc9e48d510b22970ac565db30710b3

This interface enables to generate software citations, provided that the root directory of browsed objects contains a citation.cff or codemeta.json file.
Select below a type of object currently browsed in order to generate citations for them.

  • revision
  • directory
  • content
(requires biblatex-software package)
Generating citation ...
(requires biblatex-software package)
Generating citation ...
(requires biblatex-software package)
Generating citation ...
TODO
#### Major (to fix before next release) ########################################

(*) bug fixes for estimation methods!

#### Intermediate #####################################################################

(MM) R/special-func.R & man/Bernoulli.Rd: Research for better algorithms <--> Rmpfr

(MM) please take a look at gtrafouni() in ./R/gof.R: Can "Remillard" (and "Genest")
 be made faster? Especially "Remillard" is slow (although B Remillard told me that his
 method is faster than C. Genest's.)

#### Minor #####################################################################

(*) write nice little function that provides confidence intervals for tau and lambda's
(*) fix:
    cop <- onacopulaL("Frank", list(200, 1:2)); rnacopula(100, cop)
    maybe use limit copulas also for other families (upper frechet bound)
(*) add an ASCII-plot for the hierarchical structure;
    Actually, define setAs("nacopula", "dendrogram", ....) and then use
    dendrogram print()ing.
(*) design a function that gets an outer nacopula and returns a matrix of
    numbers which correspond to the different sectors; this can be used, e.g.,
    for building a [default] color-matrix for splom2 or for estimation purposes etc.
(*) it would be good to have tryCatch.W.E in the package [call it tryCatchWE --
    easier to type]
    Maybe one can also directly return a list with "value", "error", and "warning"?
    [So far, "value" can also contain the errors => a bit unhandy, but maybe the
    only "elegant" general solution]

(*) From time to time (well, whenever Marius has.. ;-)) check the .Rd files
    for overlong lines, i.e. apply
      for f in *Rd; do printf '%20s: ' $f ; printf '%4d\n' `maxcol $f` ; done


#### Long-term maybe ###########################################################

(*) implement Khoudraji or Liebscher trafo incl. density etc.
(*) allow families to have outer power parameters (outer power families)
(*) be compatible with package copula
(*) include pairwise estimators for nACs
(*) FIXME in enacopula (in estimation.R): return an object?
(*) can we create a function for the GIG generator similar to opower()?



The diff you're trying to view is too large. Only the first 1000 changed files have been loaded.
Showing with 0 additions and 0 deletions (0 / 0 diffs computed)
swh spinner

Computing file changes ...

back to top

Software Heritage — Copyright (C) 2015–2026, The Software Heritage developers. License: GNU AGPLv3+.
The source code of Software Heritage itself is available on our development forge.
The source code files archived by Software Heritage are available under their own copyright and licenses.
Terms of use: Archive access, API— Content policy— Contact— JavaScript license information— Web API