root\-mean\-square (full) in projects: freebsd

Project(s)

Full Search
Definition
Symbol
File Path
History
Type

Searched +full:root +full:- +full:mean +full:- +full:square (Results 1 – 25 of 73) sorted by relevance

12 3

/freebsd/sys/contrib/device-tree/Bindings/iio/adc/
H A D	ti,ads7138.yaml	1 # SPDX-License-Identifier: (GPL-2.0 OR BSD-2-Clause) 3 --- 5 $schema: http://devicetree.org/meta-schemas/core.yaml# 7 title: Texas Instruments ADS7128/ADS7138 analog-to-digital converter (ADC) 10 - Tobias Sperling <tobias.sperling@softing.com> 13 The ADS7128 and ADS7138 chips are 12-bit, 8 channel analog-to-digital 14 converters (ADC) with build-in digital window comparator (DWC), using the 17 root-mean-square (RMS) and a zero-crossing-detect (ZCD) module. 26 - ti,ads7128 27 - ti,ads7138 [all …]
/freebsd/contrib/ntp/html/
H A D	filter.html	1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> 4 <meta http-equiv="content-type" content="text/html;charset=iso-8859-1"> 12 <!-- #BeginDate format:En2m -->10-Mar-2014 05:05<!-- #EndDate --> 15 <p>The clock filter algorithm processes the offset and delay samples produced by the on-wire protoc… 19 …gram</em> plotting sample points of offset versus delay collected over a 24-hr period. As the de… 20 …ples near the limb lines, as described on the <a href="huffpuff.html">Huff-n'-Puff Filter</a> page… 21 …hm the offset and delay samples from the on-wire protocol are inserted as the youngest stage of … 22 …bles of the same name. The peer jitter statistic is computed as the root mean square (RMS) differe… 23 …or each stage, starting from the youngest numbered <em>i</em> = 1, is 2<sup>-<em>i</em></sup>, whi… 24 …d so forth. In practice, the synchronization distance, which is equal to one-half the delay plus t… [all …]
H A D	cluster.html	1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> 4 <meta http-equiv="content-type" content="text/html;charset=iso-8859-1"> 13 <!-- #BeginDate format:En2m -->15-Nov-2012 06:02<!-- #EndDate --> 17 …>i</em>) be the root distance of the <em>i</em>th entry. Recall that the root distance is equal to… 21 …is the select jitter φ<sub>S</sub>(<em>i</em>) computed as the root mean square (RMS) of the … 28 …se of root distance λ as a weight factor at each round in the clock cluster algorithm. Thi…
H A D	stats.html	1 <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN"> 4 <meta http-equiv="content-type" content="text/html;charset=iso-8859-1"> 12 <!-- #BeginDate format:En2m -->26-Jul-2015 06:29<!-- #EndDate --> 29 …<li>Roundtrip system and network delay measured by the on-wire protocol. This is call <em>roundtri… 31 …<li>Expected error, consisting of the root mean square (RMS) nominal clock offset sample differenc… 38 …he server. The data represented in boxes labeled Peer are computed by the on-wire protocol, as des… 40 …acterized by the offset θ and delay δ samples measured by the on-wire protocol, as des… 45 …il the source is no longer reachable. Reachability is determined by an eight-bit shift register, w… 50 …root distance.</em> Peer jitter is determined from various jitter components as described above. I… 51 …root distance statistic is computed as one-half the <em> root delay</em> of the primary source of … [all …]
/freebsd/crypto/libecc/src/fp/
H A D	fp_sqrt.c	2 * Copyright (C) 2017 - This file is part of libecc project 7 * Jean-Pierre FLORI <jean-pierre.flori@ssi.gouv.fr> 14 * See LICENSE file at the root folder of the project. 23 * Legendre(a) = a^((p-1)/2) (p) = { -1, 0, 1 } 37 ret = fp_init(&pow, a->ctx); EG(ret, err); in legendre() 38 ret = fp_init(&one, a->ctx); EG(ret, err); in legendre() 44 ret = fp_init(&pow, a->ctx); EG(ret, err); in legendre() 45 ret = fp_init(&one, a->ctx); EG(ret, err); in legendre() 51 /* Compute the exponent (p-1)/2 in legendre() 55 ret = nn_dec(&exp, &(a->ctx->p)); EG(ret, err); in legendre() [all …]
/freebsd/contrib/bc/manuals/
H A D	algorithms.md	28 is faster than Karatsuba. There is a script (`$ROOT/scripts/karatsuba.py`) that 61 ### Square Root 64 Newton-Raphson Method, or the [Babylonian Method][5]) to perform the square root 75 x - x^3/3! + x^5/5! - x^7/7! + ... 124 (where `a` is equal to `(x - 1)/(x + 1)`) to calculate `ln(x)` when `x` is small 144 x - x^3/3 + x^5/5 - x^7/7 + ... 150 atan(x) = atan(c) + atan((x - c)/(1 + x * c)) 164 x^n/(2^n * n!) * (1 - x^2 * 2 * 1! * (n + 1)) + x^4/(2^4 * 2! * (n + 1) * (n + 2)) - ... 172 j(-n,x) = (-1)^n * j(n,x) 183 This `dc` uses the [Memory-efficient method][8] to compute modular [all …]
/freebsd/share/doc/usd/06.bc/
H A D	bc	3 .\" Copyright (C) Caldera International Inc. 2001-2002. 39 .EH 'USD:6-%''BC \- An Arbitrary Precision Desk-Calculator Language' 40 .OH 'BC \- An Arbitrary Precision Desk-Calculator Language''USD:6-%' 44 BC \- An Arbitrary Precision Desk-Calculator Language 53 on the PDP-11 under the 55 time-sharing 58 arithmetic on indefinitely large integers and on scaled fixed-point 65 The language has a complete control structure as well as immediate-mode 68 Two five hundred-digit numbers can be multiplied to give a 76 .IP \- [all …]
/freebsd/contrib/ntp/include/
H A D	ntp.h	`2 * ntp.h - NTP definitions for the masses 21 * Calendar arithmetic - contributed by G. Healton 35 / 4 - ((year - 1) / 100) + ((year - 1) / \ 41 #define ntp0(year) (julian0(year) - julian0(1900)) 46 #define unix0(year) (julian0(year) - julian0(1970)) 49 * LEAP YEAR test for full 4-digit years (e.g, 1999, 2010) 61 * to convert simple two-digit years to tm_year style years: 66 * to convert either two-digi 156 #define SQUARE( global() macro [all...]`
H A D	mbg_gps166.h	2 …* /src/NTP/REPOSITORY/ntp4-dev/include/mbg_gps166.h,v 4.7 2006/06/22 18:41:43 kardel RELEASE_20060… 11 * Copyright (c) 1997-2005 by Frank Kardel <kardel <AT> ntp.org> 77 * The Unix time_t epoch is usually 1970-01-01 00:00 whereas 78 * the GPS epoch is 1980-01-06 00:00, so the difference is 10 years, 80 * of the day-of-month (6 - 1), so:<br> 199 * The individual command codes are marked with (rwa) accordingly, where '-' is used 217 GPS_AUTO_ON = 0x000, ///< (-w-) no data, enable auto-msgs from device 218 GPS_AUTO_OFF, ///< (-w-) no data, disable auto-msgs from device 219 …GPS_SW_REV, ///< (r--) deprecated, ::SW_REV, software revision, use only if ::GPS_RECEIV… 220 …GPS_BVAR_STAT, ///< (r--) ::BVAR_STAT, status of buffered variables, only if ::GPS_MODEL_HA… [all …]
/freebsd/share/dict/
H A D	web2a	`12 A-b-c book 13 A-b-c method 14 abdomino-uterotomy 15 Abdul-baha 16 a-be 20 able-bodied 21 able-bodiedness 22 able-minded 23 able-mindedness 27 Abor-miri [all …]`
/freebsd/usr.bin/awk/
H A D	awk.1	`29 .Nd pattern-directed scanning and processing language 35 .Op Fl F Ar fs \| Fl -csv 54 pattern portion of every pattern-action statement; 57 .Sq - 67 .Bl -tag -width "-safe " 81 .It Fl -csv 84 to process records using (more or less) standard comma-separated values 136 This is convenient when working with multi-line records. 151 .St -p1003.1-2008 188 A pattern-action statement has the form: [all …]`
/freebsd/sys/cam/
H A D	cam_iosched.c	1 /- 4 SPDX-License-Identifier: BSD-2-Clause 60 * Default I/O scheduler for FreeBSD. This implementation is just a thin-vineer 85 * alpha_bits = -log_2(alpha) 86 * alpha = 2^-alpha_bits 103 * published read-only since at present they are compile time constants. 130 #define LAT_BUCKETS 20 /* < 20us < 40us ... < 2^(n-1)20us >= 2^(n-1)20us / 254 int l_value1; / per-limiter scratch value 1. / 255 int l_value2; / per-limiter scratch value 2. / 263 int total; / Total for all time -- wraps */ [all …]
/freebsd/contrib/sendmail/doc/op/
H A D	op.me	1 .\" Copyright (c) 1998-2013 Proofpoint, Inc. and its suppliers. 12 .\" $Id: op.me,v 8.759 2014-01-13 14:40:05 ca Exp $ 14 .\" eqn op.me \| pic \| troff -me 51 .eh 'SMM:08-%''Sendmail Installation and Operation Guide' 52 .oh 'Sendmail Installation and Operation Guide''SMM:08-%' 74 .b SENDMAIL\u\s-6TM\s0\d 103 .i Sendmail \u\s-2TM\s0\d 107 It is not tied to any one transport protocol \*- 173 explains the day-to-day information you should know 185 contains the nitty-gritty information about the configuration [all …]
/freebsd/contrib/bc/manuals/dc/
H A D	EHN.1	2 .\" SPDX-License-Identifier: BSD-2-Clause 4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors. 32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator 34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]] 35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]] 36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]] 37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]] 38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]] 39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...] 40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...] [all …]
H A D	EH.1	2 .\" SPDX-License-Identifier: BSD-2-Clause 4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors. 32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator 34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]] 35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]] 36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]] 37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]] 38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]] 39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...] 40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...] [all …]
H A D	E.1	2 .\" SPDX-License-Identifier: BSD-2-Clause 4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors. 32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator 34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]] 35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]] 36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]] 37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]] 38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]] 39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...] 40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...] [all …]
H A D	EN.1	2 .\" SPDX-License-Identifier: BSD-2-Clause 4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors. 32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator 34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]] 35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]] 36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]] 37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]] 38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]] 39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...] 40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...] [all …]
H A D	A.1	2 .\" SPDX-License-Identifier: BSD-2-Clause 4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors. 32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator 34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]] 35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]] 36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]] 37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]] 38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]] 39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...] 40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...] [all …]
H A D	N.1	2 .\" SPDX-License-Identifier: BSD-2-Clause 4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors. 32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator 34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]] 35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]] 36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]] 37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]] 38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]] 39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...] 40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...] [all …]
H A D	HN.1	2 .\" SPDX-License-Identifier: BSD-2-Clause 4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors. 32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator 34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]] 35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]] 36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]] 37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]] 38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]] 39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...] 40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...] [all …]
H A D	H.1	2 .\" SPDX-License-Identifier: BSD-2-Clause 4 .\" Copyright (c) 2018-2025 Gavin D. Howard and contributors. 32 dc \- arbitrary\-precision decimal reverse\-Polish notation calculator 34 \f[B]dc\f[R] [\f[B]\-cChiPRvVx\f[R]] [\f[B]\-\-version\f[R]] 35 [\f[B]\-\-help\f[R]] [\f[B]\-\-digit\-clamp\f[R]] 36 [\f[B]\-\-no\-digit\-clamp\f[R]] [\f[B]\-\-interactive\f[R]] 37 [\f[B]\-\-no\-prompt\f[R]] [\f[B]\-\-no\-read\-prompt\f[R]] 38 [\f[B]\-\-extended\-register\f[R]] [\f[B]\-e\f[R] \f[I]expr\f[R]] 39 [\f[B]\-\-expression\f[R]=\f[I]expr\f[R]\&...] 40 [\f[B]\-f\f[R] \f[I]file\f[R]\&...] [all …]
H A D	EN.1.md	1 <!--- 3 SPDX-License-Identifier: BSD-2-Clause 5 Copyright (c) 2018-2025 Gavin D. Howard and contributors. 29 --> 33 dc - arbitrary-precision decimal reverse-Polish notation calculator 37 …-cChiPRvVx] [-\-version] [-\-help] [-\-digit-clamp] [-\-no-digit-clamp] [-\-in… 41 dc(1) is an arbitrary-precision calculator. It uses a stack (reverse Polish 45 If no files are given on the command-line, then dc(1) reads from stdin (see 51 scale always set to 10, they can set DC_ENV_ARGS to -e 10k, and 58 -C, -\-no-digit-clamp [all …]
H A D	E.1.md	1 <!--- 3 SPDX-License-Identifier: BSD-2-Clause 5 Copyright (c) 2018-2025 Gavin D. Howard and contributors. 29 --> 33 dc - arbitrary-precision decimal reverse-Polish notation calculator 37 …-cChiPRvVx] [-\-version] [-\-help] [-\-digit-clamp] [-\-no-digit-clamp] [-\-in… 41 dc(1) is an arbitrary-precision calculator. It uses a stack (reverse Polish 45 If no files are given on the command-line, then dc(1) reads from stdin (see 51 scale always set to 10, they can set DC_ENV_ARGS to -e 10k, and 58 -C, -\-no-digit-clamp [all …]
/freebsd/contrib/sendmail/cf/
H A D	README	9 To get started, you may want to look at tcpproto.mc (for TCP-only 11 mail host), or the generic-*.mc files as operating system-specific 30 ANTI-SPAM CONFIGURATION CONTROL 37 NON-SMTP BASED CONFIGURATIONS 51 +--------------------------+ 53 +--------------------------+ 57 You must pre-load "cf.m4": 66 where ${CFDIR} is the root of the cf directory and config.mc is the 70 or the -I flag (ditto), then ${CFDIR} can be in an arbitrary directory. 72 use -D_CF_DIR_=/path/to/cf/dir/ -- note the trailing slash! For example: [all …]
/freebsd/crypto/heimdal/doc/
H A D	layman.asc	9 NIST/OSI Implementors' Workshop document SEC-SIG-91-17. 13 Copyright (C) 1991-1993 RSA Laboratories, a division of RSA 16 Public-Key Cryptography Standards (PKCS)" in all material 18 003-903015-110-000-000 39 in another, higher-level part. Abstraction is the hallmark 66 each ASN.1 type as a string of eight-bit octets. There is 67 generally more than one way to BER-encode a given value. 73 BER and DER sufficient to understand and implement one OSI- 74 based application, RSA Data Security, Inc.'s Public-Key 77 ASN.1 types and their BER and DER encodings. Sections 2-4 [all …]

12 3