| /dports/math/spooles/spooles.2.2/Iter/doc/ |
| H A D | intro.tex | 1 \par
3 \par
12 type of preconditioner desired. For each iterative method we allow for left and right
13 preconditioning. Also, for each method, except BGMRES, we allow for real or
15 \par
20 All iterative methods use the basic structure {\tt DenseMtx} for handling the intermediate
|
| /dports/math/R/R-4.1.2/src/library/graphics/man/ |
| H A D | plot.design.Rd | 11 typically for a designed experiment as analyzed by \code{\link{aov}()}.
16 main = NULL, ask = NULL, xaxt = par("xaxt"),
24 \item{fun}{a function (or name of one) to be applied to each
25 subset. It must return one number for a numeric (vector) input.}
29 see \code{\link{par}}.}
42 The supplied function will be called once for each level of each
45 overall value of \code{fun()} for the response is drawn as a
54 Displays for data from large designed experiments;
64 In S this was a method of the \code{\link{plot}} generic function for
82 op <- par(mfcol = 1:2)
[all …]
|
| /dports/math/libRmath/R-4.1.1/src/library/graphics/man/ |
| H A D | plot.design.Rd | 11 typically for a designed experiment as analyzed by \code{\link{aov}()}.
16 main = NULL, ask = NULL, xaxt = par("xaxt"),
24 \item{fun}{a function (or name of one) to be applied to each
25 subset. It must return one number for a numeric (vector) input.}
29 see \code{\link{par}}.}
42 The supplied function will be called once for each level of each
45 overall value of \code{fun()} for the response is drawn as a
54 Displays for data from large designed experiments;
64 In S this was a method of the \code{\link{plot}} generic function for
82 op <- par(mfcol = 1:2)
[all …]
|
| /dports/devel/R-cran-Hmisc/Hmisc/man/ |
| H A D | dotchart2.Rd | 14 cex = par("cex"), cex.labels = cex,
16 add=FALSE, dotfont=par('font'), groupfont=2,
17 reset.par=add, xaxis=TRUE, width.factor=1.1,
23 \item{labels}{a vector of labels for each point, corresponding to
46 argument. These usually represent overall sample sizes for each
51 \item{lty}{line type for horizontal lines. Default is 1 for R, 2 for S-Plus}
57 \item{cex}{see \code{\link{par}}}
79 \item{reset.par}{
85 existing set. If you fail to use \code{reset.par=TRUE} for the
95 \code{par("col")} for S-Plus.}
[all …]
|
| /dports/science/clipper/clipper-2.1/dox/ |
| H A D | clipper_contrib.dox | 11 for each type of task, which defines the interface. Actual
15 To find the documentation for a particular implementation, select the
19 \par Structure factor calculation from coordinates:
26 \par Structure factor calculation against Fo from coordinates:
30 \par Structure factor weighting (sigmaa):
34 \par Electron density calculation, mask calculation from coordinates:
39 \par Map filtering (e.g. for solvent mask estimation from density):
45 \par Fragment searching:
50 \par Origin matching:
54 \par Skeletonisation:
|
| /dports/math/R-cran-robustbase/robustbase/man/ |
| H A D | plot.lmrob.Rd | 3 \title{Plot Method for "lmrob" Objects}
5 Diagnostic plots for elements of class lmrob
15 ask = prod(par("mfcol")) < length(which) && dev.interactive(),
24 \item{caption}{Caption for the different plots}
33 \item{ask}{waits for user input before displaying each plot }
34 \item{id.n}{number of points to be labelled in each plot, starting
40 half of the graph respectively.}% for plots ...
45 \item{\dots}{optional arguments for \code{\link{par}},
47 \item{p}{threshold for distance-distance plot}
70 op <- par(mfrow = c(2,2), mgp = c(1.5, 0.6, 0), mar= .1+c(3,3,3,1))
[all …]
|
| /dports/multimedia/opentoonz/opentoonz-1.5.0/toonz/sources/translations_docs/english/ |
| H A D | ChannelSelectorIno.tex | 18 \par
20 Allows to select each RGBA channel in the resulting image from multiple inputs\par
32 Red\par
38 \par
44 Green\par
47 Options are the same as for the \textquotedbl Red Source\textquotedbl .\\
48 \par
54 Blue\par
57 Options are the same as for the \textquotedbl Red Source\textquotedbl .\\
64 \par
[all …]
|
| /dports/math/R-cran-VGAM/VGAM/man/ |
| H A D | lvplot.rrvglm.Rd | 4 %- Also NEED an '\alias' for EACH other topic documented here.
5 \title{ Latent Variable Plot for RR-VGLMs }
8 \emph{latent variable plot}) for \emph{reduced-rank vector generalized
31 %- maybe also 'usage' for other objects documented here.
38 The scores are the values of the latent variables for each
46 single group. Useful for the multinomial logit model (see
52 \item{xlab}{ Caption for the x-axis. See \code{\link[graphics]{par}}. }
53 \item{ylab}{ Caption for the y-axis. See \code{\link[graphics]{par}}. }
56 \item{Aadj}{ Justification of text strings for labelling \bold{A}.
68 \item{Cadj}{ Justification of text strings for labelling \bold{C}.
[all …]
|
| /dports/www/dolibarr/dolibarr-14.0.3/htdocs/langs/hr_HR/ |
| H A D | productbatch.lang | 24 ShowCurrentStockOfLot=Prikaži trenutne zalihe za par proizvod/serija
25 ShowLogOfMovementIfLot=Prikaži dnevnik kretanja za par proizvod/serija
27 SerialNumberAlreadyInUse=Serial number %s is already used for product %s
28 TooManyQtyForSerialNumber=You can only have one product %s for serial number %s
30 CustomMasks=Option to define a different numbering mask for each product
31 BatchLotNumberingModules=Numbering rule for automatic generation of lot number
32 …ringModules=Numbering rule for automatic generation of serial number (for products with property 1…
33 QtyToAddAfterBarcodeScan=Qty to add for each barcode/lot/serial scanned
|
| /dports/math/spooles-mpich/spooles.2.2/IVL/doc/ |
| H A D | proto.tex | 181 This method is used when the number of lists and the size of each
188 The size and pointer for each list is then set using the value from
390 This method sorts each list into ascending order.
419 This method overwrite the entries in each list using an old-to-new
470 but the size of each list may change. so we create and return a new
491 ${\tt n1} \times {\tt n2}$ grid with {\tt ncomp} components at each
529 with {\tt ncomp} components at each grid point.
566 {\tt *.ivlf} (for a formatted file)
567 or {\tt *.ivlb} (for a binary file),
613 {\tt *.ivlf} (for a formatted file)
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/IVL/doc/ |
| H A D | proto.tex | 181 This method is used when the number of lists and the size of each
188 The size and pointer for each list is then set using the value from
390 This method sorts each list into ascending order.
419 This method overwrite the entries in each list using an old-to-new
470 but the size of each list may change. so we create and return a new
491 ${\tt n1} \times {\tt n2}$ grid with {\tt ncomp} components at each
529 with {\tt ncomp} components at each grid point.
566 {\tt *.ivlf} (for a formatted file)
567 or {\tt *.ivlb} (for a binary file),
613 {\tt *.ivlf} (for a formatted file)
[all …]
|
| /dports/math/spooles/spooles.2.2/IVL/doc/ |
| H A D | proto.tex | 181 This method is used when the number of lists and the size of each
188 The size and pointer for each list is then set using the value from
390 This method sorts each list into ascending order.
419 This method overwrite the entries in each list using an old-to-new
470 but the size of each list may change. so we create and return a new
491 ${\tt n1} \times {\tt n2}$ grid with {\tt ncomp} components at each
529 with {\tt ncomp} components at each grid point.
566 {\tt *.ivlf} (for a formatted file)
567 or {\tt *.ivlb} (for a binary file),
613 {\tt *.ivlf} (for a formatted file)
[all …]
|
| /dports/math/spooles/spooles.2.2_SHARED/IVL/doc/ |
| H A D | proto.tex | 181 This method is used when the number of lists and the size of each
188 The size and pointer for each list is then set using the value from
390 This method sorts each list into ascending order.
419 This method overwrite the entries in each list using an old-to-new
470 but the size of each list may change. so we create and return a new
491 ${\tt n1} \times {\tt n2}$ grid with {\tt ncomp} components at each
529 with {\tt ncomp} components at each grid point.
566 {\tt *.ivlf} (for a formatted file)
567 or {\tt *.ivlb} (for a binary file),
613 {\tt *.ivlf} (for a formatted file)
[all …]
|
| /dports/devel/gitg/gitg-3.32.1/win32/installer/ |
| H A D | COPYING.rtf | 32 \par The licenses for most software are designed to take away your
64 \par Also, for each author's protection and ours, we want to make certain
102 \par conspicuously and appropriately publish on each copy an appropriate
125 \par when run, you must cause it, when started running for such
143 \par entire whole, and thus to each and every part regardless of who wrote it.
168 \par customarily used for software interchange; or,
176 \par The source code for a work means the preferred form of the work for
310 \par to attach them to the start of each source file to most effectively
311 \par convey the exclusion of warranty; and each file should have at least
325 \par GNU General Public License for more details.
[all …]
|
| /dports/math/R/R-4.1.2/src/library/stats/man/ |
| H A D | dendrapply.Rd | 10 Apply function \code{FUN} to each node of a \code{\link{dendrogram}}
12 dendrogram of the same graph structure as \code{x} and for each node,
14 (invalid!) notation for the j-th node of y).
21 \item{FUN}{an \R function to be applied to each dendrogram node,
34 The implementation is somewhat experimental and suggestions for
36 current implementation is \emph{recursive} and inefficient for
40 \seealso{\code{\link{as.dendrogram}}, \code{\link{lapply}} for applying
41 a function to each component of a \code{list}, \code{\link{rapply}}
42 for doing so to each non-list component of a nested list.
69 op <- par(mfrow = 2:1)
[all …]
|
| /dports/math/libRmath/R-4.1.1/src/library/stats/man/ |
| H A D | dendrapply.Rd | 10 Apply function \code{FUN} to each node of a \code{\link{dendrogram}}
12 dendrogram of the same graph structure as \code{x} and for each node,
14 (invalid!) notation for the j-th node of y).
21 \item{FUN}{an \R function to be applied to each dendrogram node,
34 The implementation is somewhat experimental and suggestions for
36 current implementation is \emph{recursive} and inefficient for
40 \seealso{\code{\link{as.dendrogram}}, \code{\link{lapply}} for applying
41 a function to each component of a \code{list}, \code{\link{rapply}}
42 for doing so to each non-list component of a nested list.
69 op <- par(mfrow = 2:1)
[all …]
|
| /dports/converters/p5-LaTeXML/LaTeXML-0.8.6/t/complex/ |
| H A D | xii.latexml | 3 # LaTeXML Declaration for David Carlisle's xii.tex
13 # We'll use a DTD for a (trivial) Song, containing verses with lines.
23 # David ends each line with \par; redefine \par to close an auto-opened <line>
24 DefConstructor('\par', sub { $_[0]->maybeCloseElement('line'); });
|
| /dports/math/R-cran-NMF/NMF/vignettes/ |
| H A D | heatmaps.Rnw | 203 par(mfrow=c(1,2))
238 par(opar)
296 par(opar)
307 The default behaviour is to add an annotation track that shows for each row
309 That is, for each row, the index of the basis component with the highest
321 par(opar)
364 a bi-colour heatmap, and by default clear blocks for each cluster.}
385 par(opar)
410 making it fit NMF models for each value in the given range
423 that contains -- amongst other data -- a list of the best fits obtained for each
[all …]
|
| /dports/math/R-cran-NMF/NMF/inst/doc/ |
| H A D | heatmaps.Rnw | 203 par(mfrow=c(1,2))
238 par(opar)
296 par(opar)
307 The default behaviour is to add an annotation track that shows for each row
309 That is, for each row, the index of the basis component with the highest
321 par(opar)
364 a bi-colour heatmap, and by default clear blocks for each cluster.}
385 par(opar)
410 making it fit NMF models for each value in the given range
423 that contains -- amongst other data -- a list of the best fits obtained for each
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2_SHARED/documentation/ReferenceManual/ |
| H A D | intro.tex.old | 2 \par
3 The {\bf SPOOLES} library is based on three concepts: pivoting for
6 We now discuss each in more detail.
7 \par
10 \par
21 \par
31 \par
41 \par
57 In each case it is the $P(L + I)D(I + U)Q^T$ product that we will
89 The fundamental data structures for $L$ and $U$
[all …]
|
| /dports/math/spooles-mpich/spooles.2.2/documentation/ReferenceManual/ |
| H A D | intro.tex.old | 2 \par
3 The {\bf SPOOLES} library is based on three concepts: pivoting for
6 We now discuss each in more detail.
7 \par
10 \par
21 \par
31 \par
41 \par
57 In each case it is the $P(L + I)D(I + U)Q^T$ product that we will
89 The fundamental data structures for $L$ and $U$
[all …]
|
| /dports/math/spooles/spooles.2.2_SHARED/documentation/ReferenceManual/ |
| H A D | intro.tex.old | 2 \par
3 The {\bf SPOOLES} library is based on three concepts: pivoting for
6 We now discuss each in more detail.
7 \par
10 \par
21 \par
31 \par
41 \par
57 In each case it is the $P(L + I)D(I + U)Q^T$ product that we will
89 The fundamental data structures for $L$ and $U$
[all …]
|
| /dports/math/spooles/spooles.2.2/documentation/ReferenceManual/ |
| H A D | intro.tex.old | 2 \par
3 The {\bf SPOOLES} library is based on three concepts: pivoting for
6 We now discuss each in more detail.
7 \par
10 \par
21 \par
31 \par
41 \par
57 In each case it is the $P(L + I)D(I + U)Q^T$ product that we will
89 The fundamental data structures for $L$ and $U$
[all …]
|
| /dports/www/dolibarr/dolibarr-14.0.3/htdocs/langs/lv_LV/ |
| H A D | productbatch.lang | 20 AddDispatchBatchLine=Add a line for Shelf Life dispatching
24 ShowCurrentStockOfLot=Parādīt pašreizējo krājumu par pāris produktu / partiju
25 ShowLogOfMovementIfLot=Rādīt žurnālu par kustību pāriem produktam / partijai
26 StockDetailPerBatch=Krājumu dati par partiju
30 CustomMasks=Option to define a different numbering mask for each product
31 BatchLotNumberingModules=Numbering rule for automatic generation of lot number
32 …ringModules=Numbering rule for automatic generation of serial number (for products with property 1…
|
| /dports/math/spooles/spooles.2.2/MSMD/doc/ |
| H A D | drivers.tex | 1 \par
2 \section{Driver programs for the {\tt MSMD} object}
4 \par
6 \par
18 \par
43 {\tt compressFlag \% 4 == 2} --- compress after each elimination step,
46 {\tt compressFlag \% 4 == 1} --- compress after each elimination step,
62 approximate external degree for the others.
64 {\tt prioType == 4} --- priority of each node is zero; this
72 {\tt stepType == 0} --- one vertex eliminated at each step,
[all …]
|