To use this feature, select Maintain | QC and Test Parameters. The program performs several quality control tests on the measurement data. One of these is a checksum test that is always applied to multiplicity data to check for internal consistency. There are no test parameters for this test, because exact agreement is required.
When you start a measurement of any type under Acquire, you can select whether or not to use the optional quality control tests. If you use the quality control (QC tests), the program will perform the accidentals/singles test and outlier test.
Measurements normally consist of repeat cycles, for example, 10 cycles of 100 seconds each. The accidentals/singles test compares the singles rate with the accidental coincidence rate at the end of each cycle. If the neutron source rate is constant during the cycle, then, within statistical errors, the accidentals rate should equal the square of the singles rate times the gate length. If the rates do not agree within statistical errors and the quality control tests are turned on, then the cycle is rejected and another is made automatically. The limit of acceptance is set by the parameter "Accidentals/singles test outlier limit (sigma)", which is the limit expressed in standard deviations. The usual limit is 4 standard deviations.
There are two additional limits used by the accidentals/singles test. The first of these is the "Accidentals/singles test rate limit (1/seconds)", which is usually set to 1000 1/second. The accidentals/singles test is not done if the singles rate is below this limit. The reason for this limit is that, at low count rates, room background variations can make the test fail, even though the system is working normally. For the same reason, the test is never done for passive background measurements.
The other additional limit is the "Accidentals/singles test precision limit (%)", which is usually set to 0.1%. If the accidentals and singles rates agree within this limit, the accidentals/singles statistical test is not done and the cycle is accepted. The reason for this limit is that the test can fail for cycles with excellent precision even though the accidentals/singles agreement is satisfactory.
The outlier test compares the results of individual cycles with the average of all the cycles and rejects cycles that fall outside the test limit. Additional cycles are then made automatically, if needed, to replace any rejected cycles. The parameter is "Outlier test limit (sigma)", which is the test limit expressed in standard deviations. The usual limit is 3 standard deviations. For verification measurements, the outlier test is done on the assay mass calculated for each of the cycles. For most other measurements, the outlier test is done on the doubles and triples rates. The outlier test is not done for precision measurements, because the purpose of the precision test is to compare the observed and theoretical standard deviations.
The measurement control chi-squared limit, expressed in percent, determines the upper and lower bounds for the chi-squared test; the limit is the probability that the measured chi-squared value will be between the upper and lower limits in the ideal case where the system is perfectly stable and the theoretical standard deviation is known exactly. The default value for the chi-squared limit is 99%.
To prevent a series of bad measurements from continuing indefinitely, there is a test parameter called "Max # of checksum or accidentals/singles failures", which is normally set to 10. If the number of cycles that fail these tests exceeds the limit, the measurement is stopped and the results are calculated, if possible, from any good cycles in the data set. To effectively disable this test, set this value to a large number, for example 1000.
If two or more passive analysis methods have been selected, then an automatic comparison of the verification results is made. The accepted verification result will be the “normal” analysis method unless it differs from the “backup” method by more than n standard deviations, where n is the “Normal/backup verification test limit (sigma)”.
A comparison of the requested and actual high voltage is made after each cycle to insure that the high voltage has not drifted. If the “High voltage test limit (%)” is exceeded, that cycle is marked as having failed the HV test. The default value is 1 percent. To disable the test, set this value to 1000. It may occasionally be of interest to know what the high voltage is for each cycle. This can be done by setting this parameter to zero which will cause the high voltage to be displayed for every cycle.
A checkbox is provided for disabling consistency tests between shift register and multiplicity data if a multiplicity shift register is being used. These tests should only be turned off (box not checked) for very high counting rates where the multiplicity counter will overflow. The singles rate at which overflow will occur is dependent on gate length, and is approximately 1.5 million singles per second for a gate length of 64 microseconds. A smaller gate length will allow counting at higher rates before overflow occurs. The checksum test is never performed, regardless of whether this box is checked, if an AMSR is being used because fast accidentals will cause the test to fail most of the time.
Two radio buttons are provided for choosing how to calculate the doubles rate. If you choose “Measure accidentals count rates” from the shift register then the following equation is used:
Doubles rate = ((Reals + Accidentals) - Accidentals) / count time
If you choose “Calculate the accidentals count rates (T^2G)” then the following equation is used:
Doubles rate = ((Reals + Accidentals) - (singles * singles * gate length)) / count time
If you choose to calculate the accidentals rates then the error analysis will automatically be set to the sample standard deviation method. The default is to use the measured accidentals rates. When the doubles rate is obtained from the calculated accidentals coincidence rate, the doubles rate for a complete measurement is calculated as the average of the doubles rates for the individual cycles and differs slightly from the doubles rate calculated from the summed raw data; this method was chosen because the calculation assumes that the singles rate is constant during the data collection, and this is more likely to be true for each cycle than for the entire measurement.


Page 1 of 1
Update on the Questing System
Posted:
Tue Jun 02, 2009 3:41 pm
by Karl G.
For the past 5 days or so I've been hammering away at a questing system. Although I've mentioned my progress to several people, I wanted to make a post to fill everyone in on the details.
As of this afternoon, I have created and successfully tested Evidyon's first basic quest. There are dozens of different quest types and not all of the different ways of completing them have been tested (this is something you'll all be helping me with!) However, the limited features I've tested work smoothly enough that it just requires a bit more tweaking before I can put out an update for you all to try. Expect something in the very near future.
Re: Update on the Questing System
Posted:
Tue Jun 02, 2009 6:35 pm
by Rabit561
This is better then Christmas
Re: Update on the Questing System
Posted:
Tue Jun 02, 2009 10:53 pm
by sandalhat
Awesomeness. Cant wait to go questing.
Re: Update on the Questing System
Posted:
Tue Jun 02, 2009 11:37 pm
by marzuku
sandalhat wrote:Awesomeness. Cant wait to go questing.
Awsomeness INDEED! (
) i think ive got a new signature.
Re: Update on the Questing System
Posted:
Wed Jun 03, 2009 12:23 pm
by Karl G.
I've finished enough of the questing system to be able to roll it out this afternoon. I'm going to make some quests for you all to try out, then release this thing.
Karl
Re: Update on the Questing System
Posted:
Wed Jun 03, 2009 8:00 pm
by sandalhat
So I've downloaded the update, and i saw the new NPC, but what about the quests? Any insight on how to initiate the quests or the requirements and whatnot?
Re: Update on the Questing System
Posted:
Thu Jun 04, 2009 2:34 am
by marzuku
sandalhat wrote:So I've downloaded the update, and i saw the new NPC, but what about the quests? Any insight on how to initiate the quests or the requirements and whatnot?
tried saying "Hello" like on xen?
Re: Update on the Questing System
Posted:
Thu Jun 04, 2009 4:24 am
by XpLiCiT
You have to right click the quest guy, then the window pops up
Re: Update on the Questing System
Posted:
Thu Jun 04, 2009 5:59 am
by marzuku
Found the quest dude, found the second quest dude gave away a Wand of starlight, clicked the quest for additional information, quest deleted.
fix this if you can.
Re: Update on the Questing System
Posted:
Thu Jun 04, 2009 7:09 am
by Karl G.
Clicking a quest cancels the quest. Yes, I know this is not intuitive and I'm going to use a different solution.
Also, specific-kill quests don't work right. I was going to fix them last night but something came up, so I'm going to fix this morning. Sit tight.


Bizarre Test Shows F-150 Raptor More Efficient While Towing A Tesla
The numbers don’t lie, though towing a car everywhere isn’t exactly practical.
by Christopher SmithThere’s quite of math and science happening in this interesting new video from Engineering Explained, but then we’ve come to expect nothing less from the epic YouTube channel. We’ll try not to go too far down the mathematics rabbit hole here, but to make a complicated story very simple, this test proves a first-gen Ford F-150 Raptor is more efficient when towing a Tesla Model 3 than just driving on its own.
Blinded Me With Science:
Since a claim like that simply can’t be left without some kind of explanation, here’s a summary. Electric cars like the Tesla Model 3 use regenerative braking to help recharge the battery pack. As such, simply lifting off the throttle produces electricity while slowing the car. Hooked to a truck – in this case a notoriously fuel-hungry V8-powered F-150 Raptor – the Tesla never slows down.
Over the course of a 1.4-kilometer (0.9-mile) slow-speed lap tethered to the Ford, the Model 3 received a 2 percent charge while expending no energy. That was enough for the Model 3 to drive slightly more than a single lap at high speed. Wouldn’t it be an apples-to-apples comparison for the Tesla to do a low-speed lap? Hold your thoughts on that, because we’ll address it in a bit.
Gallery: Tesla F-150 Raptor Efficiency Experiment
Armed with that info, a few more test laps were conducted to determine the baseline efficiency for each vehicle over an identical distance at identical speeds. The Tesla’s electric range was converted to an equivalent mpg readout of 108, basically 10 times better than the Raptor’s 10.7 mpg. Furthermore, while towing the Tesla, the Raptor only returned 3.4 mpg.
Here’s where it gets a bit tedious in the math department, so we’ll keep it real simple. Take those mpg numbers, combine them with the amount of charge the Model 3 got while being towed, mix them in a blender and do the hokey pokey, and you get an efficiency rating of 18.1 mpg. Mind you, that’s a combined rating while the Raptor is towing the Tesla, where the Tesla is gaining electricity as the truck burns fuel. And yes, that’s significantly better than the Raptor by itself. Make sense?
Do The Math:
If your brain is still jelly on this (we had trouble ourselves) here’s an alternative explanation. Despite the Raptor’s drop in fuel economy from towing the Tesla, you could drive further overall if you towed the Tesla (charging its empty battery in the process) and then drove the Tesla when the Raptor ran out of gas, then if you just drove the Raptor by itself. In fact, the numbers suggest you could go a lot further.
Speaking of which, that hot lap we mentioned previously where the Model 3 used its captured electric charge in just over a lap? Had the pace been at slower speeds similar to those used during towing, the Tesla could’ve done over five laps, all from the charge gained on a single towed lap. Mind blown yet?
Obviously it’s not practical or particularly safe to just tow a Tesla everywhere, but it does give a different perspective on electric power versus internal-combustion engines. It also gives us some wicked awesome trivia to regale our car friends with at the pub.
Source: Engineering Explained via YouTube


 .maintitle[ODE *in silico*]
 .column[ ## A few notes - May 17, 2017 .left[![:faic](github) [KevCaz/ODEinsilico](https://github.com/KevCaz/ODEinsilico)] ] .column[ .right[![:scale 16%](assets/img/inSilecoLogo.png)] ] --- class: inverse, center, middle # Part 1 ## What a computer can do --- # Data -- - any kind of data is a collection of 0 and 1 - basic unity of information is a **bit** - any kind of is a collection of **bits** - an octet is a collection of 8 bits - a kilo-octet (ko) is a collection of 1000 octets - beware of the *bytes* --- # What does a computer do? -- - **the core a computer can only change 0 to 1 and 1 to 0** -- - comes with a collection of I/O devices - very, very fast computation on bits - that's actually enough! --- # What does a computer do? - 8 bits to represent and integer (a natural number betwenn 0 and `\(2^8 = 256\)`) - `c = a + b` -- - `a = 11`: `00001011` ![:faic](long-arrow-right) `\(2^3 + 2^1 + 1 = 8 + 2 + 1 = 11\)` - `b = 14`: `00001110` -- - `c = ?` `c = 10101101` -- - a + b: `00001110 + 00001011` --- # What does a computer do?
 ``` 00001110 + 00001011 ========== = 00011001 ``` - 1+8+16 = 25 --- # What does a computer do?
 ``` 1011 (this is 11 in binary) x 1110 (this is 14 in binary) ========= 0000 (this is 1011 x 0) 1011 (this is 1011 x 1, shifted one position to the left) 1011 (this is 1011 x 1, shifted two positions to the left) + 1011 (this is 1011 x 1, shifted three positions to the left) ========= 10011010 (this is 154 in binary) ```  https://en.wikipedia.org/wiki/Binary_multiplier --- # What does a computer do? ## But what about... everything else? - For instance `\(e^2\)` -- - Use Math! `\(e^2 = e \times e\)` -- - you only need `\(e\)` -- - `math.h` includes its value `\(2.718281828459045235360287471352662498\)` -- - **Conclusion**: we actually need a lot of math to do math using additions only  the era of algorithms --- class: inverse, center, middle # Solving ODE with additions ## no more but no less --- # Solving an ODE - `\(\dot{x} = f(x,\theta, t)\)` -- - Solution `\(x(t) = g(t,\theta, x_0)\)` -- - remember `\(\dot{x} = ax\)`, here `\(\theta = a\)` -- - three cases: 1. doable by hand 2. get an analytical solution with a computer 3. get a numerical approximation --- # doable by hand - Done! a computer... what for? -- - to do further analysis / plot for a given `\(x_0\)` / draw vector fields... -- ``` Function solution(x0, θ, t) return g(x0, θ, t) end ``` --- # Get an analytical solution *in silico* - a bit more complex... -- - Maple https://fr.maplesoft.com/support/help/maple/view.aspx?path=dsolve - Sage http://doc.sagemath.org/html/en/reference/calculus/sage/calculus/desolvers.html - Mathematica http://reference.wolfram.com/language/howto/SolveADifferentialEquation.html - the magick of `dsolve` --- # Get a numerical approximation - `\(\dot{x} = \frac{dx}{dt} = f(x,\theta, t)\)` and `\(x(0) = x_0\)` -- - Idea: `\(x_0\)` what about `\(x_{dt}\)` ... -- $$x_{dt} = x_0 + \sum_i^\infty \frac{1}{n!} \frac{dx^{(n)}}{dt^n} (dt)^n $$ -- $$dt > dt^2 > dt^3 > ... $$ -- `$$x_{dt} = x_0 + \frac{dx}{dt}x_0 = x_0 + \dot{x}x_0$$` --- # Get a numerical approximation - Now I have `\(x_0\)`, `\(x_{dt}\)`, what next? -- - repeat same process to get `\(x_{2dt}\)` -- - only multiplications and additions... so use algorithms! --- # Euler's methods ``` \\ function Function myode(x, θ, t) f(x, θ, t) end \\ Euler Function(x0, t0, dt, niter, myode) x = vector(niter) x[0] = x0 for 1:niter do x[i] = x[i-1] + x[i-1] myode(x[i-1], θ, t) end return x end ```  [Runge-Kutta methods](https://en.wikipedia.org/wiki/Runge%E2%80%93Kutta_methods) --- # Many programming languages - Julia: http://docs.juliadiffeq.org/latest/ - Octave: https://octave.org/doc/v4.0.3/Ordinary-Differential-Equations.html - Python: https://docs.scipy.org/doc/scipy-0.14.0/reference/generated/scipy.integrate.ode.html - R: https://cran.r-project.org/web/packages/deSolve/index.html https://www.r-pkg.org/badges/version/odeintr - Rust: https://docs.rs/GSL/0.4.26/rgsl/types/ordinary_differential_equations/index.html - FORTRAN C/C++


@* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import uk.gov.hmrc.govukfrontend.views.html.components._ @import config.ApplicationConfig @import views.html.helpers._ @this(gmpMain: gmp_main, govukPanel : GovukPanel, govukButton: GovukButton) @(reference: String)(implicit request: Request[_], messages: Messages, ac:ApplicationConfig) @gmpMain(title = Messages("gmp.bulk_request_received.banner") + " - " + Messages("service.title") + " - " + Messages("gov.uk"), supportLinkEnabled = true) { @includes.back_to_dashboard_link(Messages("gmp.bulk_request_received.banner")) @govukPanel(Panel( title = Text(Messages("gmp.bulk_request_received.banner")) ))