Our aim with this part of the project is to be able to
Let us illustrate what is needed in our calculations using a simple example, the harmonic oscillator in one dimension. For the harmonic oscillator in one-dimension we have a trial wave function and probability $$ \begin{equation*} \psi_T(x) = e^{-\alpha^2 x^2} \qquad P_T(x)dx = \frac{e^{-2\alpha^2 x^2}dx}{\int dx e^{-2\alpha^2 x^2}} \end{equation*} $$ with \( \alpha \) being the variational parameter. We obtain then the following local energy $$ \begin{equation*} E_L[\alpha] = \alpha^2+x^2\left(\frac{1}{2}-2\alpha^2\right), \end{equation*} $$ which results in the expectation value for the local energy $$ \begin{equation*} \langle E_L[\alpha]\rangle = \frac{1}{2}\alpha^2+\frac{1}{8\alpha^2} \end{equation*} $$
The derivative of the energy with respect to \( \alpha \) gives $$ \begin{equation*} \frac{d\langle E_L[\alpha]\rangle}{d\alpha} = \alpha-\frac{1}{4\alpha^3} \end{equation*} $$ and a second derivative which is always positive (meaning that we find a minimum) $$ \begin{equation*} \frac{d^2\langle E_L[\alpha]\rangle}{d\alpha^2} = 1+\frac{3}{4\alpha^4} \end{equation*} $$ The condition $$ \begin{equation*} \frac{d\langle E_L[\alpha]\rangle}{d\alpha} = 0, \end{equation*} $$ gives the optimal \( \alpha=1/\sqrt{2} \), as expected.
a) Derive the local energy for the harmonic oscillator in one dimension and find its expectation value.
b) Show also that the optimal value of optimal \( \alpha=1/\sqrt{2} \).
We can also minimize the variance. In our simple model the variance is $$ \begin{equation*} \sigma^2[\alpha] = \frac{1}{2}\alpha^4-\frac{1}{4}+\frac{1}{32\alpha^4}, \end{equation*} $$ with first derivative $$ \begin{equation*} \frac{d \sigma^2[\alpha]}{d\alpha} = 2\alpha^3-\frac{1}{8\alpha^5} \end{equation*} $$ and a second derivative which is always positive $$ \begin{equation*} \frac{d^2\sigma^2[\alpha]}{d\alpha^2} = 6\alpha^2+\frac{5}{8\alpha^6} \end{equation*} $$
In general we end up computing the expectation value of the energy in terms of some parameters \( \alpha_0,\alpha_1,\dots,\alpha_n \) and we search for a minimum in this multi-variable parameter space. This leads to an energy minimization problem where we need the derivative of the energy as a function of the variational parameters.
In the above example this was easy and we were able to find the expression for the derivative by simple derivations. However, in our actual calculations the energy is represented by a multi-dimensional integral with several variational parameters. How can we can then obtain the derivatives of the energy with respect to the variational parameters without having to resort to expensive numerical derivations?
To find the derivatives of the local energy expectation value as function of the variational parameters, we can use the chain rule and the hermiticity of the Hamiltonian.
Let us define $$ \bar{E}_{\alpha}=\frac{d\langle E_L[\alpha]\rangle}{d\alpha}. $$ as the derivative of the energy with respect to the variational parameter \( \alpha \) (we limit ourselves to one parameter only). In the above example this was easy and we obtain a simple expression for the derivative. We define also the derivative of the trial function (skipping the subindex \( T \)) as $$ \bar{\psi}_{\alpha}=\frac{d\psi[\alpha]\rangle}{d\alpha}. $$
The elements of the gradient of the local energy are then (using the chain rule and the hermiticity of the Hamiltonian) $$ \bar{E}_{\alpha} = 2\left( \langle \frac{\bar{\psi}_{\alpha}}{\psi[\alpha]}E_L[\alpha]\rangle -\langle \frac{\bar{\psi}_{\alpha}}{\psi[\alpha]}\rangle\langle E_L[\alpha] \rangle\right). $$ From a computational point of view it means that you need to compute the expectation values of $$ \langle \frac{\bar{\psi}_{\alpha}}{\psi[\alpha]}E_L[\alpha]\rangle, $$ and $$ \langle \frac{\bar{\psi}_{\alpha}}{\psi[\alpha]}\rangle\langle E_L[\alpha]\rangle $$
a) Show that $$ \bar{E}_{\alpha} = 2\left( \langle \frac{\bar{\psi}_{\alpha}}{\psi[\alpha]}E_L[\alpha]\rangle -\langle \frac{\bar{\psi}_{\alpha}}{\psi[\alpha]}\rangle\langle E_L[\alpha] \rangle\right). $$
b) Find the corresponding expression for the variance.
a) The expectation value for the local energy of the Helium atom with a simple Slater determinant is given by (project 1) $$ \langle E_{L} \rangle = \alpha^2-2\alpha\left(Z-\frac{5}{16}\right) $$ Show that its derivative is $$ \begin{equation*} \frac{d\langle E_{L}[\alpha] \rangle}{d\alpha} = 2\alpha-2\left(Z-\frac{5}{16}\right). \end{equation*} $$
b) Use this result when you test your numerical derivative, using either the steepest descent method, Newton's method or the conjugate gradient method.
The success of the CG method for finding solutions of non-linear problems is based on the theory of conjugate gradients for linear systems of equations. It belongs to the class of iterative methods for solving problems from linear algebra of the type $$ \begin{equation*} \hat{A}\hat{x} = \hat{b}. \end{equation*} $$ In the iterative process we end up with a problem like $$ \begin{equation*} \hat{r}= \hat{b}-\hat{A}\hat{x}, \end{equation*} $$ where \( \hat{r} \) is the so-called residual or error in the iterative process.
When we have found the exact solution, \( \hat{r}=0 \).
The residual is zero when we reach the minimum of the quadratic equation $$ \begin{equation*} P(\hat{x})=\frac{1}{2}\hat{x}^T\hat{A}\hat{x} - \hat{x}^T\hat{b}, \end{equation*} $$ with the constraint that the matrix \( \hat{A} \) is positive definite and symmetric. If we search for a minimum of the quantum mechanical variance, then the matrix \( \hat{A} \), which is called the Hessian, is given by the second-derivative of the function we want to minimize. This quantity is always positive definite. In our case this corresponds normally to the second derivative of the energy.
We seek the minimum of the energy or the variance as function of various variational parameters. In our case we have thus a function \( f \) whose minimum we are seeking. In Newton's method we set \( \nabla f = 0 \) and we can thus compute the next iteration point $$ \begin{equation*} \hat{x}-\hat{x}_i=\hat{A}^{-1}\nabla f(\hat{x}_i). \end{equation*} $$ Subtracting this equation from that of \( \hat{x}_{i+1} \) we have $$ \begin{equation*} \hat{x}_{i+1}-\hat{x}_i=\hat{A}^{-1}(\nabla f(\hat{x}_{i+1})-\nabla f(\hat{x}_i)). \end{equation*} $$
The function \( f \) can be either the energy or the variance. If we choose the energy then we have $$ \begin{equation*} \hat{\alpha}_{i+1}-\hat{\alpha}_i=\hat{A}^{-1}(\nabla E(\hat{\alpha}_{i+1})-\nabla E(\hat{\alpha}_i)). \end{equation*} $$ In the simple harmonic oscillator model, the gradient and the Hessian \( \hat{A} \) are $$ \begin{equation*} \frac{d\langle E_L[\alpha]\rangle}{d\alpha} = \alpha-\frac{1}{4\alpha^3} \end{equation*} $$ and a second derivative which is always positive (meaning that we find a minimum) $$ \begin{equation*} \hat{A}= \frac{d^2\langle E_L[\alpha]\rangle}{d\alpha^2} = 1+\frac{3}{4\alpha^4} \end{equation*} $$
We get then $$ \begin{equation*} \alpha_{i+1}=\frac{4}{3}\alpha_i-\frac{\alpha_i^4}{3\alpha_{i+1}^3}, \end{equation*} $$ which can be rewritten as $$ \begin{equation*} \alpha_{i+1}^4-\frac{4}{3}\alpha_i\alpha_{i+1}^4+\frac{1}{3}\alpha_i^4. \end{equation*} $$
In the CG method we define so-called conjugate directions and two vectors \( \hat{s} \) and \( \hat{t} \) are said to be conjugate if $$ \begin{equation*} \hat{s}^T\hat{A}\hat{t}= 0. \end{equation*} $$ The philosophy of the CG method is to perform searches in various conjugate directions of our vectors \( \hat{x}_i \) obeying the above criterion, namely $$ \begin{equation*} \hat{x}_i^T\hat{A}\hat{x}_j= 0. \end{equation*} $$ Two vectors are conjugate if they are orthogonal with respect to this inner product. Being conjugate is a symmetric relation: if \( \hat{s} \) is conjugate to \( \hat{t} \), then \( \hat{t} \) is conjugate to \( \hat{s} \).
An example is given by the eigenvectors of the matrix $$ \begin{equation*} \hat{v}_i^T\hat{A}\hat{v}_j= \lambda\hat{v}_i^T\hat{v}_j, \end{equation*} $$ which is zero unless \( i=j \).
Assume now that we have a symmetric positive-definite matrix \( \hat{A} \) of size \( n\times n \). At each iteration \( i+1 \) we obtain the conjugate direction of a vector $$ \begin{equation*} \hat{x}_{i+1}=\hat{x}_{i}+\alpha_i\hat{p}_{i}. \end{equation*} $$ We assume that \( \hat{p}_{i} \) is a sequence of \( n \) mutually conjugate directions. Then the \( \hat{p}_{i} \) form a basis of \( R^n \) and we can expand the solution $ \hat{A}\hat{x} = \hat{b}$ in this basis, namely $$ \begin{equation*} \hat{x} = \sum^{n}_{i=1} \alpha_i \hat{p}_i. \end{equation*} $$
The coefficients are given by $$ \begin{equation*} \mathbf{A}\mathbf{x} = \sum^{n}_{i=1} \alpha_i \mathbf{A} \mathbf{p}_i = \mathbf{b}. \end{equation*} $$ Multiplying with \( \hat{p}_k^T \) from the left gives $$ \begin{equation*} \hat{p}_k^T \hat{A}\hat{x} = \sum^{n}_{i=1} \alpha_i\hat{p}_k^T \hat{A}\hat{p}_i= \hat{p}_k^T \hat{b}, \end{equation*} $$ and we can define the coefficients \( \alpha_k \) as $$ \begin{equation*} \alpha_k = \frac{\hat{p}_k^T \hat{b}}{\hat{p}_k^T \hat{A} \hat{p}_k} \end{equation*} $$
If we choose the conjugate vectors \( \hat{p}_k \) carefully, then we may not need all of them to obtain a good approximation to the solution \( \hat{x} \). We want to regard the conjugate gradient method as an iterative method. This will us to solve systems where \( n \) is so large that the direct method would take too much time.
We denote the initial guess for \( \hat{x} \) as \( \hat{x}_0 \). We can assume without loss of generality that $$ \begin{equation*} \hat{x}_0=0, \end{equation*} $$ or consider the system $$ \begin{equation*} \hat{A}\hat{z} = \hat{b}-\hat{A}\hat{x}_0, \end{equation*} $$ instead.
One can show that the solution \( \hat{x} \) is also the unique minimizer of the quadratic form $$ \begin{equation*} f(\hat{x}) = \frac{1}{2}\hat{x}^T\hat{A}\hat{x} - \hat{x}^T \hat{x} , \quad \hat{x}\in\mathbf{R}^n. \end{equation*} $$ This suggests taking the first basis vector \( \hat{p}_1 \) to be the gradient of \( f \) at \( \hat{x}=\hat{x}_0 \), which equals $$ \begin{equation*} \hat{A}\hat{x}_0-\hat{b}, \end{equation*} $$ and \( \hat{x}_0=0 \) it is equal \( -\hat{b} \). The other vectors in the basis will be conjugate to the gradient, hence the name conjugate gradient method.
Let \( \hat{r}_k \) be the residual at the \( k \)-th step: $$ \begin{equation*} \hat{r}_k=\hat{b}-\hat{A}\hat{x}_k. \end{equation*} $$ Note that \( \hat{r}_k \) is the negative gradient of \( f \) at \( \hat{x}=\hat{x}_k \), so the gradient descent method would be to move in the direction \( \hat{r}_k \). Here, we insist that the directions \( \hat{p}_k \) are conjugate to each other, so we take the direction closest to the gradient \( \hat{r}_k \) under the conjugacy constraint. This gives the following expression $$ \begin{equation*} \hat{p}_{k+1}=\hat{r}_k-\frac{\hat{p}_k^T \hat{A}\hat{r}_k}{\hat{p}_k^T\hat{A}\hat{p}_k} \hat{p}_k. \end{equation*} $$
We can also compute the residual iteratively as $$ \begin{equation*} \hat{r}_{k+1}=\hat{b}-\hat{A}\hat{x}_{k+1}, \end{equation*} $$ which equals $$ \begin{equation*} \hat{b}-\hat{A}(\hat{x}_k+\alpha_k\hat{p}_k), \end{equation*} $$ or $$ \begin{equation*} (\hat{b}-\hat{A}\hat{x}_k)-\alpha_k\hat{A}\hat{p}_k, \end{equation*} $$ which gives $$ \begin{equation*} \hat{r}_{k+1}=\hat{r}_k-\hat{A}\hat{p}_{k}, \end{equation*} $$
#include <cmath>
#include <iostream>
#include <fstream>
#include <iomanip>
#include "vectormatrixclass.h"
using namespace std;
// Main function begins here
int main(int argc, char * argv[]){
int dim = 2;
Vector x(dim),xsd(dim), b(dim),x0(dim);
Matrix A(dim,dim);
// Set our initial guess
x0(0) = x0(1) = 0;
// Set the matrix
A(0,0) = 3; A(1,0) = 2; A(0,1) = 2; A(1,1) = 6;
b(0) = 2; b(1) = -8;
cout << "The Matrix A that we are using: " << endl;
A.Print();
cout << endl;
x = ConjugateGradient(A,b,x0);
xsd = SteepestDescent(A,b,x0);
cout << "The approximate solution using Conjugate Gradient is: " << endl;
x.Print();
cout << endl;
cout << "The approximate solution using Steepest Descent is: " << endl;
xsd.Print();
cout << endl;
}
Vector SteepestDescent(Matrix A, Vector b, Vector x0){
int IterMax, i;
int dim = x0.Dimension();
const double tolerance = 1.0e-14;
Vector x(dim),f(dim),z(dim);
double c,alpha,d;
IterMax = 30;
x = x0;
f = A*x-b;
i = 0;
while (i <= IterMax){
z = A*f;
c = dot(f,f);
alpha = c/dot(f,z);
x = x - alpha*f;
f = A*x-b;
if(sqrt(dot(f,f)) < tolerance) break;
i++;
}
return x;
}
Vector ConjugateGradient(Matrix A, Vector b, Vector x0){
int dim = x0.Dimension();
const double tolerance = 1.0e-14;
Vector x(dim),r(dim),v(dim),z(dim);
double c,t,d;
x = x0;
r = b - A*x;
v = r;
c = dot(r,r);
int i = 0; IterMax = dim;
while(i <= IterMax){
z = A*v;
t = c/dot(v,z);
x = x + t*v;
r = r - t*z;
d = dot(r,r);
if(sqrt(d) < tolerance)
break;
v = r + (d/c)*v;
c = d; i++;
}
return x;
}
You can however use codes we have adapted from the text Numerical Recipes in C++, see chapter 10.7. Here we present a program, which you also can find at the webpage of the course we use the functions dfpmin and lnsrch.
// Main function begins here
int main()
{
int n, iter;
double gtol, fret;
double alpha;
n = 1;
// reserve space in memory for vectors containing the variational
// parameters
Vector g(n), p(n);
cout << "Read in guess for alpha" << endl;
cin >> alpha;
gtol = 1.0e-5;
// now call dfmin and compute the minimum
p(0) = alpha;
dfpmin(p, n, gtol, &iter, &fret, Efunction, dEfunction);
cout << "Value of energy minimum = " << fret << endl;
cout << "Number of iterations = " << iter << endl;
cout << "Value of alpha at minimum = " << p(0) << endl;
return 0;
} // end of main program
The functions Efunction and dEfunction compute the expectation value of the energy and its derivative. These functions need to be changed when you want to your own derivatives.
// this function defines the expectation value of the local energy
double Efunction(Vector &x)
{
double value = x(0)*x(0)*0.5+1.0/(8*x(0)*x(0));
return value;
} // end of function to evaluate
// this function defines the derivative of the energy
void dEfunction(Vector &x, Vector &g)
{
g(0) = x(0)-1.0/(4*x(0)*x(0)*x(0));
} // end of function to evaluate
You need to change these functions in order to compute the local energy for your system. I used 1000 cycles per call to get a new value of \( \langle E_L[\alpha]\rangle \). When I compute the local energy I also compute its derivative. After roughly 10-20 iterations I got a converged result in terms of \( \alpha \).


Determinate Progress Bar
<mat-progress-bar mode="determinate">
is a horizontal progress-bar for indicating progress and activity.
Indeterminate Progress Bar
<mat-progress-bar mode="indeterminate">
is a horizontal progress-bar for indicating progress and activity.
Buffer Progress Bar
<mat-progress-bar mode="buffer">
is a horizontal progress-bar for indicating progress and activity.
Query Progress Bar
<mat-progress-bar mode="query">
is a horizontal progress-bar for indicating progress and activity.
Colored Progress Bar
<mat-progress-bar mode="determinate">
is a horizontal progress-bar for indicating progress and activity.


|
| void | ChromaKeyTile (ACColor background, int minimum, int maximum) |
| | Changes the background color of this ACTile by creating a random brightness off the given base ACColor within the given minimum and maximum ranges More...
|
| |
| void | Redraw () |
| | Forces this ACTile to fully redraw itself More...
|
| |
| void | DrawScene (CGRect rect) |
| | Draws a scene type tile. More...
|
| |
| void | DrawAccessory (CGRect rect) |
| | Draws the accessory type tile. More...
|
| |
| void | DrawTopTitleBar (CGRect rect, bool withIcon) |
| | Draws the top title bar. More...
|
| |
| void | DrawBottomTitleBar (CGRect rect, bool withIcon) |
| | Draws the bottom title bar. More...
|
| |
| override void | Draw (CGRect rect) |
| | Draw the specified rect. More...
|
| |
| override void | TouchesBegan (NSSet touches, UIEvent evt) |
| | Sent when one or more fingers touches the screen. More...
|
| |
| override void | TouchesMoved (NSSet touches, UIEvent evt) |
| | Sent when the ACTile is being dragged More...
|
| |
| override void | TouchesEnded (NSSet touches, UIEvent evt) |
| | Send when one or more fingers are lifted from the screen. More...
|
| |
| delegate void | ACTileTouchedDelegate (ACTile tile) |
| | Occurs when this ACTile is touched More...
|
| |
| delegate void | ACTileMovedDelegate (ACTile tile) |
| | Occurs when this ACTile is moved More...
|
| |
| delegate void | ACTileReleasedDelegate (ACTile tile) |
| | Occurs when this ACTile is released More...
|
| |
| delegate void | ACTileRequestCustomDrawDelegate (ACTile tile, CGRect rect) |
| | Occurs when the ACTile Style is set to CustomDrawn and the ACTile needs to be updated More...
|
| |
| delegate void | ACTileLiveUpdatingDelegate (ACTile tile) |
| | Occurs when live updating has been kicked off by the ACTileController More...
|
| |
| | UIView () |
| | Initializes a new instance of the T:UIKit.UIView class. More...
|
| |
| | UIView (CGRect rect) |
| | Initializes a new instance of the T:UIKit.UIView class. More...
|
| |
| | UIView (Context context) |
| | Initializes a new instance of the T:UIKit.UIView class. More...
|
| |
| | UIView (Context context, IAttributeSet attr) |
| | Initializes a new instance of the T:UIKit.UIView class. More...
|
| |
| | UIView (IntPtr javaReference, JniHandleOwnership transfer) |
| | Initializes a new instance of the T:UIKit.UIView class. More...
|
| |
| | UIView (Context context, IAttributeSet attr, int defStyle) |
| | Initializes a new instance of the T:UIKit.UIView class. More...
|
| |
| void | SetNeedsDisplay () |
| | Sets the needs display flag. More...
|
| |
| void | SetNeedsLayout () |
| | Sets the needs layout. More...
|
| |
| virtual void | LayoutSubviews () |
| | Lays out any sub view in the control. More...
|
| |
| virtual void | AddSubview (UIView view) |
| | Adds the subview. More...
|
| |
| void | InvokeOnMainThread (Action action) |
| | Invokes the given action on the main UI thread. More...
|
| |
| override bool | OnTouchEvent (MotionEvent e) |
| | Handle the touch event. More...
|
| |
|
| Object | tag [get, set] |
| | Gets or sets the [OPTIONAL] tag that can be assosciated with this ACTile More...
|
| |
| ACTileLiveUpdate | liveUpdateAction [get, set] |
| | Gets or sets the ACTileLiveUpdate action that will be performed via an automatic update kicked off by the liveUpdateTimer in the parent ACTileController . More...
|
| |
| string | title [get, set] |
| | Gets or sets the title for this ACTile More...
|
| |
| string | subtitle [get, set] |
| | Gets or sets the subtitle for this ACTile More...
|
| |
| string | description [get, set] |
| | Gets or sets the description for this ACTile More...
|
| |
| UIImage | icon [get, set] |
| | Gets or sets the icon for this ACTile More...
|
| |
| ACTileAppearance | appearance [get, set] |
| | Gets or sets the ACTile for this ACTile More...
|
| |
| ACTileStyle | style [get, set] |
| | Gets or sets the ACTileStyle for this ACTile . More...
|
| |
| ACTileGroup | group [get] |
| | Gets the ACTileGroup this ACTile . belongs to More...
|
| |
| ACTileSize | tileSize [get, set] |
| | Gets or sets the ACTileSize of this ACTile More...
|
| |
| int | customRowHeight [get, set] |
| | Gets or sets the height of the custom row. More...
|
| |
| int | customColumnHeight [get, set] |
| | Gets or sets the height of the custom column. More...
|
| |
| bool | Enabled [get, set] |
| | Gets or sets a value indicating whether this ACTile is enabled. More...
|
| |
| CGRect | Frame [get, set] |
| | Gets or sets the frame. More...
|
| |
| CGRect | Bounds [get, set] |
| | Gets or sets the bounds. More...
|
| |
| Canvas | DrawCanvas [get, set] |
| | Gets or sets the draw canvas. More...
|
| |
| ACColor | BackgroundColor = null [get, set] |
| | Gets or sets the color of the background. More...
|
| |
| bool | UserInteractionEnabled [get, set] |
| | Gets or sets a value indicating whether this T:UIKit.UIView user interaction enabled. More...
|
| |
| bool | MultipleTouchEnabled = false [get, set] |
| | Gets or sets a value indicating whether this T:UIKit.UIView multiple touch enabled. More...
|
| |
| CGPoint | LastTouchPoint = false [get, set] |
| | Gets or sets the last touch point. More...
|
| |
| bool | ClipsToBounds = new CGPoint(0, 0) [get, set] |
| | Gets or sets a value indicating whether this T:UIKit.UIView clips to bounds. More...
|
| |
| bool | ExclusiveTouch [get, set] |
| | Gets or sets a value indicating whether this T:UIKit.UIView exclusive touch. More...
|
| |
| bool | CacheViewDrawing = true [get, set] |
| | Gets or sets a value indicating whether this T:UIKit.UIView cache view drawing to improve redraw performance. More...
|
| |
| List< UIView > | Subviews = true [get] |
| | Gets the subviews. More...
|
| |
The ACTile
is a custom UIView
that defines several helper properties and methods that make it a great basis for any custom user interface controls. It defines helper events for being Touched
, Moved
, and/or Released
and can be set to automatically become the front view when it is touched. And provides methods to make moving, rotating, and resizing the ACTile
easier with less code.


This site uses your private keys only to broadcast the transaction to the scorum blockchain. In NO WAY it stores your private keys or transmits it elsewhere except the Scorum platform. The whole website is hosted on GitHub which is an open source platform and you can check the codes of this website to make sure that your keys are never misused. To view the codes of this site click the button below.
My bot
Post Link :
WIF Key :
Username :
Vote Percentage (1-100%) :
Note: This code doesn't store your key in any way. The code run locally on your PC and interacts with the Scorum blockahin and the key is used
only for signing the transactions.
If you are unsure of how to use this tool than see the Readme guide available on the Github here: https://github.com/rougebot95/Scorum-Voting-Bot
How to use:
1. In the "Post Link" Field enter the post URL that you want to upvote/downvote. 2. In the "WIF Key" Field enter the private key of your account. 3. In the "Username" Field enter the username of your Scorum Account. 4. In the "Vote Percentage" Field enter the value between 1 to 100, 1 means 1% upvote & 100 means 100% upvote. 5. Use negative sign '-' infront of Vote Percentage to downvote a post. For example, -1 means 1% downvote & -100 means 100% downvote.


Public Speaking and Sharing...
I enjoy sharing information on things I learn and do. Listed below are some of my recent presentations on various Technical and Open Source topics. Most presentations need a voice over, since I am big on visuals and keeping slides clutter free. If you have any questions about these topics, or would like me to present them at your office, or a conference, I would be very glad to help out.


|
QuantLib: a free/open-source library for quantitative finance
Fully annotated sources - version 1.30
|
#include <ql/instruments/creditdefaultswap.hpp>
Public Member Functions | |
| void | reset () override |
| void | reset () override |
| Public Member Functions inherited from PricingEngine::results | |
| virtual | ~results ()=default |
| virtual void | reset ()=0 |
Public Attributes | |
| Rate | fairSpread |
| Rate | fairUpfront |
| Real | couponLegBPS |
| Real | couponLegNPV |
| Real | defaultLegNPV |
| Real | upfrontBPS |
| Real | upfrontNPV |
| Real | accrualRebateNPV |
| Public Attributes inherited from Instrument::results | |
| Real | value |
| Real | errorEstimate |
| Date | valuationDate |
| std::map< std::string, ext::any > | additionalResults |
Definition at line 331 of file creditdefaultswap.hpp.
|
overridevirtual |
Reimplemented from Instrument::results.
Definition at line 469 of file creditdefaultswap.cpp.
| Rate fairSpread |
Definition at line 333 of file creditdefaultswap.hpp.
| Rate fairUpfront |
Definition at line 334 of file creditdefaultswap.hpp.
| Real couponLegBPS |
Definition at line 335 of file creditdefaultswap.hpp.
| Real couponLegNPV |
Definition at line 336 of file creditdefaultswap.hpp.
| Real defaultLegNPV |
Definition at line 337 of file creditdefaultswap.hpp.
| Real upfrontBPS |
Definition at line 338 of file creditdefaultswap.hpp.
| Real upfrontNPV |
Definition at line 339 of file creditdefaultswap.hpp.
| Real accrualRebateNPV |
Definition at line 340 of file creditdefaultswap.hpp.


It's a blog system.
Because we can.
Front-endAngularJS(CoffeeScript)+Bootstrap
Back-endASP.NET WEB API 2(OData 5.0)+Entity Framework 6
More at GitHub.
{{item.Name}}
Began in 12/06/2008.


We want you to know that reading can take you places. Anywhere you like without actually leaving where you currently are. You can also go other places and still read about there to and discover new places to visit. Maybe you want to go to another time period. You can visit them, you can even get your questions answered.
We sell a variety of different types of books.
We have a fantastic book club that meets every two weeks. The group leader is Bob Lion
You can sign up here
The store is located on FairyTail Boulvard in Chester, New York.


+
=
{{ num1 + num2 }}
Jeremiah Ogbomo
Ariyo Toyin
Constantine Kevin
Your favorite developer is {{ name }}


JET uses Subversion as the SCM. See Subversion for details and documentation on IDE integration.
WebDav is an access protocol supported by SVN and being http-based is often allowed by corporate firewalls.
svn co http://svn.codehaus.org/jet/trunk jet
svn co https://svn.codehaus.org/jet/trunk jet
This access protocol is available to all, but only developers can commit changes.
Developers require a unix password for Codehaus username. To test https commit access, one may eg:
svn co https://svn.codehaus.org/jet/trunk jet cd jet echo "test" > TEST svn add TEST svn commit --username username --password your-password --message "Testing https"
Note: you only need to specify username and password once per client.


Further Reading
There are many texts available to help you learn Python or refine
your Python knowledge, from introductory texts all the way to quite
formal language descriptions.
We recommend the following books for general information about Python
(all these books cover at least Python 2.2, unless otherwise noted):
Python Programming for the Absolute Beginner, by
Michael Dawson (Thomson Course Technology), is a hands-on, highly
accessible introduction to Python for people who have never
programmed. Learning Python, by Mark Lutz and David Ascher
(O'Reilly), is a thorough introduction to the
fundamentals of Python. Practical Python, by Magnus Lie Hetland
(APress), is an introduction to Python which also develops, in
detail, ten fully worked out, substantial programs in many different
areas. Dive into Python, by Mark Pilgrim (APress), is a
fast-paced introduction to Python for experienced programmers, and it
is also freely available for online reading and downloading
(http://diveintopython.org/). Python Standard Library, by Fredrik Lundh
(O'Reilly), provides a use case for each module in
the rich library that comes with every standard Python distribution
(in the current first edition, the book only covers Python up to
2.0). Programming Python, by Mark Lutz
(O'Reilly), is a thorough rundown of Python
programming techniques (in the current second edition, the book only
covers Python up to 2.0). Python Essential Reference, by David Beazley
(New Riders), is a quick reference that focuses on the Python
language and the core Python libraries (in the current second
edition, the book only covers Python up to 2.1). Python in a Nutshell, by Alex Martelli
(O'Reilly), is a comprehensive quick reference to
the Python language and the key libraries used by most Python
programmers.
In addition, several more special-purpose books can help you explore
particular aspects of Python programming. Which books you will like
best depends a lot on your areas of interest. From personal
experience, the editors can recommend at least the following:
Python and XML, by Christopher A. Jones and Fred
L. Drake, Jr. (O'Reilly), offers thorough coverage
of using Python to read, process, and transform XML. Jython Essentials, by Samuele Pedroni and Noel
Rappin (O'Reilly), is the authoritative book on
Jython, the port of Python to the JVM. Particularly useful if you
already know some (or a lot of) Java. Game Programming with Python, by Sean Riley
(Charles River Media), covers programming computer games with Python,
all the way from advanced graphics to moderate amounts of
"artificial intelligence." Python Web Programming, by Steve Holden (New
Riders), covers building networked systems using Python, with
introductions to many other related technologies (databases, HTTP,
HTML, etc.). Very suitable for readers with none to medium experience
with these fields, but has something to teach everyone.
In addition to these books, other important sources of information
can help explain some of the code in the recipes in this book.
We've pointed out the information that seemed
particularly relevant in the "See
Also" sections of each recipe. In these sections, we
often refer to the standard Python documentation: most often the
Library Reference, sometimes the
Reference Manual, and occasionally the
Tutorial. This documentation is freely available
in a variety of forms:
On the python.org web site (at http://www.python.org/doc/), which always
contains the most up-to-date documentation about Python. On the pydoc.org web site (at http://pydoc.org/), accompanied by
module-by-module documentation of the standard library automatically
generated by the very useful pydoc tool. In Python itself. Recent versions of Python boast a nice online help
system, which is worth exploring if you've never
used it. Just type help( ) at the interactive
Python interpreter prompt to start exploring. As part of the online help in your Python installation.
ActivePython's installer, for example, includes a
searchable Windows help file. The standard Python distribution
currently includes HTML pages, but there are plans to include a
similar Windows Help file in future releases.
We have not included specific section numbers in our references to
the standard Python documentation, since the organization of these
manuals can change from release to release. You should be able to use
the table of contents and indexes to find the relevant material. For
the Library Reference, in particular, the Module
Index (an alphabetical list of all standard library modules, each
module name being a hyperlink to the Library
Reference documentation for that module) is invaluable.
Similarly, we have not given specific pointers in our references to
Python in a Nutshell: that book is still in its
first edition (covering Python up to 2.2) at the time of this
writing, but by the time you're reading, a second
edition (covering Python 2.3 and 2.4) is likely to be forthcoming, if
not already published.
|


Division By Zero
Index Out Of Range
Index Out Of Range with custom stacking
Throw String Message
Send 10 random events
Send 100 random events
Send 100 exceptions
Send 100 log messages
Send trace log event
Send debug log event
Send info log event
Send warn log event
Send error log event
Log Client Configuration Settings (settings sent from server)


| Name | Contact No. | Designation | |
|---|---|---|---|
| Dr. Bhaskar Dasgupta |  - |<EMAIL_ADDRESS>| Faculty Mentor |
| Srijan Bharati |<PHONE_NUMBER> |<EMAIL_ADDRESS>| Mentor |
| Nikhil Verma |<PHONE_NUMBER> |<EMAIL_ADDRESS>| Team Leader |
| Ayush Sah |<PHONE_NUMBER> |<EMAIL_ADDRESS>| Marketing Head |
| Vikram Singh |<PHONE_NUMBER> |<EMAIL_ADDRESS>| Designer |
| Sakshi Pawar | 86******58 |<EMAIL_ADDRESS>| General Manager |
| Shambhavi Sinha | 91******45 |<EMAIL_ADDRESS>| Finance Manager |


Assignments
问题描述 :
In a factory, there are N workers to finish two types of tasks (A and B). Each type has N tasks. Each task of type A needs xi time to finish, and each task of type B needs yj time to finish, now, you, as the boss of the factory, need to make an assignment, which makes sure that every worker could get two tasks, one in type A and one in type B, and, what’s more, every worker should have task to work with and every task has to be assigned. However, you need to pay extra money to workers who work over the standard working hours, according to the company’s rule. The calculation method is described as follow: if someone’ working hour t is more than the standard working hour T, you should pay t-T to him. As a thrifty boss, you want know the minimum total of overtime pay.
输入:
There are multiple test cases, in each test case there are 3 lines. First line there are two positive Integers, N (N<=1000) and T (T<=1000), indicating N workers, N task-A and N task-B, standard working hour T. Each of the next two lines has N positive Integers; the first line indicates the needed time for task A1, A2…An (Ai<=1000), and the second line is for B1, B2…Bn (Bi<=1000).
输出:
There are multiple test cases, in each test case there are 3 lines. First line there are two positive Integers, N (N<=1000) and T (T<=1000), indicating N workers, N task-A and N task-B, standard working hour T. Each of the next two lines has N positive Integers; the first line indicates the needed time for task A1, A2…An (Ai<=1000), and the second line is for B1, B2…Bn (Bi<=1000).
样例输入:
2 5 4 2 3 5
样例输出:
4
#include <cstdio> #include <iostream> #include <algorithm> using namespace std; const int maxn = 1011; int a[maxn], b[maxn], n, t; int main() { while (cin >> n >> t) { int ans = 0; for (int i = 0; i < n; i++) scanf("%d", &a[i]); for (int i = 0; i < n; i++) scanf("%d", &b[i]); sort(a, a + n); sort(b, b + n); for (int i = 0; i < n; i++) if (a[i] + b[n-i-1] > t) ans += a[i] + b[n-i-1] - t; printf("%d\n", ans); } return 0; }
(adsbygoogle = window.adsbygoogle || []).push({});
好看，希望更的能快一点(Ｔ▽Ｔ)
好看，希望更的能快一点(Ｔ▽Ｔ)
好看，希望更的能快一点(Ｔ▽Ｔ)
好看，希望更的能快一点(Ｔ▽Ｔ)
原来如此 了解了
有点意思
终于AC了！next数组还是不好理解啊，mark
I like your publish. It is great to see you verbalize from the coronary heart and clarity on this essential subject matter can be easily noticed.
这个差别应该不会太大，或许编辑器就自动优化成内联函数了
我还有个问题想请教一下，就是感觉对于新手来说，递归理解起来有些困难，不知有没有什么好的方法或者什么好的建议？
博主的C++功底真是好
这道题这里的解法最坏情况似乎应该是指数的。回溯的时候
O(n) = O(n-1) + O(n-2) + ….
O(n-1) = O(n-2) + O(n-3)+ …
O(n) – O(n-1) = O(n-1)
O(n) = 2O(n-1)
第二个方法挺不错。NewHead代表新的头节点，通过递归找到最后一个节点之后，就把这个节点赋给NewHead，然后一直返回返回，中途这个值是没有变化的，一边返回一边把相应的指针方向颠倒，最后结束时返回新的头节点到主函数。
很好的题，还是能做出几道的，嘿嘿
因为要修改链表头(指针)，所以要用指针的指针
真考人啊


These school children were royally honoured when they received personal thank-you notes from Meghan Markle
by Bashiera Parker (@bparks_)Cape Town – As part of their work for Black History Month, children at Woodlands Community Primary School in Birkenhead, England wrote to Her Royal Highness, Duchess Meghan Markle – and she wrote them back!
Head of correspondence, Claudia Spens, sent letters to the school on behalf of the duchess and wrote, "It was so thoughtful of you to take the trouble to write as you did. Their Royal Highnesses very much enjoyed their visit to Birkenhead and greatly appreciated the warm welcome they received.
"I would be grateful if you could pass the enclosed envelopes to each child that wrote a lovely letter to Her Royal Highness."
The Woodlands Community Twitter account shared the news alongside a picture of the note from Buckingham Palace as well as a photograph of a group of proud seven- and eight-year-olds holding up their personal thank-you notes.
I think it’s safe to say the students were beaming!
SEE THE TWEET HERE:
According to HELLO! Magazine, Meghan met some of the pupils at the school in January, when she carried out her first royal engagement for the year with Prince Harry. She looked beautiful as she showed off her growing baby bump and revealed to royal fans she was already six months pregnant with baby Archie, reports GMA.
(Photos: Getty Images)


This document describes a process for building glean on Win32 systems. It assumes that you're using MSVC 6.0. This document is based off of the prior version of this document by Johan Smet.
Building glean is actually a pretty painless process once you know what to do. Step by step, the process is:
While you can download an older version of glean as a zipfile off SourceForge, this file describes the process for building a current version of glean from the SourceForge CVS tree. Therefore, you'll need CVS (1.10 or later, preferably) to get it. The easiest way I've found to get a Win32 binary of CVS is to download WinCVS and during installation, pick a Custom Install and only install the cvs command-line client (or, of course, you could install the full WinCVS if you want the full WinCVS).
Once you have CVS installed, you can get a copy of the latest source distribution of glean by doing the following:
cvs -d:pserver:anonymous@cvs.glean.sourceforge.net:/cvsroot/glean login cvs -z3 -d:pserver:anonymous@cvs.glean.sourceforge.net:/cvsroot/glean co glean
When prompted for a password during the "login" command, just hit Enter.
After executing the second command, you should see it pull down a bunch of files (which may take a few minutes), and you will subsequently have the glean source!
If you don't already have it, make sure to get an updated version of glext.h and put it in the same directory as your gl.h, which is usually under /include/gl in your MSVC install dir.
Glean doesn't currently build with the STL version that comes with MSVC. As such, you'll need a copy of the STLPort to build glean. I have, so far, only verified that it builds with STLPort 4.0. To make things easy, there's a pre-configured (and prebuilt) version of the STLPort 4.0 available right here. Following is the copyright and distribution notice from the STLPort:
Copyright (c) 1999,2000 Boris Fomitchev This material is provided "as is", with absolutely no warranty expressed or implied. Any use is at your own risk. Permission to use or copy this software for any purpose is hereby granted without fee, provided the above notices are retained on all copies. Permission to modify the code and to distribute modified code is granted, provided the above notices are retained, and a notice that the code was modified is included with the above copyright notice.
This source contained here does contain a modification, simply that in stlport/stl/_site_config.h, I have uncommented the #defines for _NOTHREADS and __STL_NO_THREADS. This allows the STLPort to be used with non-multithreaded apps (like glean). The included libs are built off of this modified source.
Download the modified, prebuilt STLPort-4.0 for glean here (3.5 megs). Unzip it somewhere, being careful to preserve the internal directories of the zipfile.
LibTIFF is just one lib and a handful of headers. Download them here (113K), and unzip them to some directory.
You must set the environment variable GLEAN_ROOT to point to base of your glean distribution. This should be the directory that has subdirectories /src, /doc, /bin, /include, /lib, /make, etc.
You also must run the vcvars32.bat that comes with MSVC, found in /bin/vcvars32.bat under your MSVC install.You can set GLEAN_ROOT and run vcvars32.bat from your autoexec.bat, but I find it easier to do another way:Then, in order to build glean, just run that DOS-Prompt shortcut and build it from within that shell.
The three things you'll need to edit in make/common.win (in the glean source distribution) are STL_BASE_DIR, LIBTIFF_INC_DIR, and LIBTIFF_LIB_DIR.
Go to the /src directory under your glean directory. Hopefully, typing nmake /f makefile.win will build glean successfully! If there are problems, try to address them and then run a nmake /f makefile.win clean before rebuilding.
This document Copyright (c) 2000 Brian Sharp. Please report any errata, suggestions, or contributions to him.


--- layout: archive title: Zulip Chat Archive permalink: /stream/116395-maths/topic/One-object.20category.html ---
Hi, do we have a way to turn any monoid into End
of a one-object category? I want to prove some facts for categories, then transfer them to monoids. It shouldn't be hard to define such thing (e.g., using a type tag on unit
) but I'd prefer not to reinvent the wheel.
BTW, if this type tag does not exist yet, what would be a good name for it?
Is there standard notation for this in maths?
I know BG
for groups...
Maybe monoid.categorify
?
Algebra is not my field of study, and I failed to find standard notation.
Let it be monoid.categorify
I'm not sure what exactly you're proposing here, so I can't help with the name.
@Scott Morrison I want to have def my_type_tag : Type u → Type := λ _, unit
with instance : category_theory.has_hom (my_type_tag α) := { hom : λ _ _, α }
and instance : category_theory.category_struct {α} [monoid α] (my_type_tag α) := { id := λ _, 1, comp := λ _ _ _ x y, x * y }
(probably with some changes to make this code work).
oh! I see.
I would call it turtle
, but that is very idiosyncratic. (Say a "k-boring n-category" is an n-category such that there is a unique j-morphism for j <= k. As examples, monoids are 1-boring 1-categories, monoidal categories are 1-boring 2-categories, and braided monoidal categories are 2-boring 3-categories, and symmetric monoidal categories are k-boring (k+1)-categories for any k >= 3. Whenever I need to name these otherwise nameless unique morphisms, I call them "turtle", because "it's turtles all the way down".)
Sorry, I know nothing about n-categories. After reading an intro part of the Wikipedia page, it seems that 1-categories are just categories. Then 1-boring 1-categories are categories such that there is a unique morphism (same as 1-morphism?). But I need one object, not one morphism. Do I miss something?
Ah: "0-morphisms" just means "objects", so a 1-boring 1-category is exactly a monoid.
Then you probably mean "for j < k", not "for j ≤ k".
The main issue with the name "turtle" is that it seems to be neither a standard term in math, nor a descriptive word. May be, "categorify" is better.
Yes, you're right, <, not <=.
The problem is that "categorify" means something specific, and it isn't this.
X, an n-category, is a categorification of Y, an (n-1)-category, if when you throw out the n-morphisms in X, and replace the n-1 morphisms with isomorphism classes, you get Y.
So for example the monoidal category Vec
is a categorification of the monoid nat
under multiplication.
OK, then one_obj_category
.
I've just realized that the "public" function will turn α
into α
interpreted as End unit.star
in this category. Probably, it should be called as_End
or to_End
.
The delooping of a monoid is a one-object category (because the 'loops' in the category are exactly the elements of the monoid)
What is delooping? Is it already in mathlib?
see section 6 of this nLab article (it means what you think it means)
or as some people are fond of saying, "a category is just a monoidoid!"
@Jesse Michael Han I'm lost after a few lines (have to lookup the meaning of every other word). I think, I'll define the single object category in a straightforward manner; if someone will define delooping in a general context later, it would be easy to prove equivalence in this particular case, or even replace my definition.
yeah that should be fine; for the case of monoid -> one object category, it's hard to go wrong
@Scott Morrison What do you think about composition getting all messed up now that we try to mix category theory and the rest of the library?
I know that there is only one right way to do compositions, and it is the one that is used in the category theory library.
However, if I had to choose between converting the world to "the one right composition" or "formalisation of maths", then I would choose the latter.
At the moment, I think this is actively confusing for people.
Is the composition order in category_theory
open for debate?
Sure, of course.
My suggestion would be to not change anything, just chose a new unicode symbol for morphism-composition that looks not entirely unlike \circ, and define two notations.
One could later rip out use of the \gg notation if desired, but I don't think there's any need to change the underlying form of category.comp
. Or is there?
As far as I'm aware, this is purely a notational mismatch.
I think technically it is a notational mismatch. But there is also a psychological component. Several people (mathematicians working in algebra/geometry) whom I've showed Lean/mathlib were quite confused by the convention.
But have some circ-like symbol might be a good start.
There's the degree symbol, which is typeset a bit higher than the usual \circ
, e.g. as f ° g
.
Or there's ⊚
which you can already type as \oo
Last updated: Apr 24 2020 at 19:02 UTC


nugridpy.ascii_table¶
Ascii_table.py: read and write simple ascii tables
By Daniel Alexander Bertolino Conti Fall 2010 If the user find any bugs or errors, please email<EMAIL_ADDRESS>Assumptions for ascii Files:
Headers are always at the beginning of the file and start with a capital H (default, can be reset). The next line after the header lines, is a line of column attribute names. The column attribute names are separated by ‘ ‘ by default or whatever the user dictates to the class. Data columns are seperated by spaces and each data attribute contains no spaces. All the data columns are of equal length. Any file name that has ‘trajectory’ or ‘Trajectory’ in it, is assumed to be a trajectory type file.
Assumptions for Trajectory Files:
The first three lines start with a ‘#’. The first of these contains ‘time’, ‘T’ and ‘rho’, each seperated by a space. The second is ‘# YRS/SEC; T8K/T9K; CGS/LOG’ which are the choices for the header attributes AGEUNIT, TUNIT, and RHOUNIT can be. The third is something like ‘FORMAT:’ The four lines afther those three are the header attributes. Each line has one header attribute, followd by a = and then followed after by the value. After these seven lines comes three columns of data, the first is is associated with ‘time’, the second with ‘T’ and the third with rho.
Functions
write (filename, headers, dcols, data[, …]) |
Method for writeing Ascii files. |
writeGCE_table (filename, headers, data[, …]) |
Method for writeing data in GCE format in Ascii files. |
writeTraj ([filename, data, ageunit, tunit, …]) |
Method for writeing Trajectory type ascii files files. |
Classes
ascii_table (filename[, sldir, sep, …]) |
Data structure to read simple data tables and trajectory data tables. |
-
class
nugridpy.ascii_table.
ascii_table
(filename, sldir='.', sep=' ', datatype='normal', headers=[], dcols=[], data=[], header_char='H', read=True, headerlines=[])¶ Data structure to read simple data tables and trajectory data tables.
Init method that reads in ascii type files and trajectory type files. By default this method reads ascii type files. If the user wants a trajectory file read, either the file must have ‘trajectory’ in the filename or the user must set the datatype=’trajectory’.
Parameters: - filename (string) – The name of the file we are looking at, or writeng to.
- sldir (string, optional) – Standard directory of filename. The default is ‘.’.
- sep (string, optional) – The seperator that seperates column attributes in filename. The defaults is ‘ ‘.
- datatype (string, optional) – What type of ascii table you are reading and or writeing. The only two options currently are ‘normal’ and ‘trajectory’. The default is ‘normal’.
- Headers (list, optional) – A list of Header strings or if the file being writen is of type trajectory, this is a dictionary of header attributes and their associated values. The default is [].
- dcols (list, optional) – A list of data attributes. The default is [].
- data (list, optional) – A list of lists (or of numpy arrays) of columns of data. The default is [].
- header_char (caracter, optional) – The character that indicates a header lines. The default is ‘H’.
- read (boolean, optional) – Boolean of weather this is reading or writing a file. The default is True.
- headerlines (list, optional) – Additional list of strings of header data, only used in trajectory data Types. The default is [].
Examples
>>> from ascii_table import * >>> p=ascii_table('c12cg.dat') >>> p.hattrs ['1 12 6 1 1 1 0 0 0 1 13 7 0', '55 1.943', 'c12pg'] >>> a.dcols ['upper', 'lower', 'T9', 'ado(gs)', 'ado/CA88', 'tt/gs', 'ado/fit', 'CA88', 'fitted'] >>> a.get('upper') [1.3400000000000001e-24, ... 1590.0] >>> a.plot('T9', 'ado/CA88') #plots data
Also there is a global method called write that will allow a user to write ascii Files and trajectory files.
One Can call this method like
>>> write('file.txt',dcols,data,headers)
Where Dcols is a list of data attributes, data is a list of lists of data and headers is a list of strings that are each a header attribute.
See also
-
get
(attri)¶ Method that dynamically determines the type of attribute that is passed into this method. Also it then returns that attribute’s associated data.
Parameters: attri (string) – The attribute we are looking for.
-
getColData
(attri)¶ Method that returns column data
Parameters: attri (string) – The attribute we are looking for.
-
nugridpy.ascii_table.
write
(filename, headers, dcols, data, headerlines=[], header_char='H', sldir='.', sep=' ', trajectory=False, download=False)¶ Method for writeing Ascii files.
Note the attribute name at position i in dcols will be associated with the column data at index i in data. Also the number of data columns(in data) must equal the number of data attributes (in dcols) Also all the lengths of that columns must all be the same.
Parameters: - filename (string) – The file where this data will be written.
- Headers (list) – A list of Header strings or if the file being written is of type trajectory, this is a List of strings that contain header attributes and their associated values which are seperated by a ‘=’.
- dcols (list) – A list of data attributes.
- data (list) – A list of lists (or of numpy arrays).
- headerlines (list, optional) – Additional list of strings of header data, only used in trajectory data Types. The default is [].
- header_char (character, optional) – The character that indicates a header lines. The default is ‘H’.
- sldir (string, optional) – Where this fill will be written. The default is ‘.’.
- sep (string, optional) – What seperates the data column attributes. The default is ‘ ‘.
- trajectory (boolean, optional) – Boolean of if we are writeing a trajectory type file. The default is False.
- download (boolean, optional) – If using iPython notebook, do you want a download link for the file you write? The default is False.
-
nugridpy.ascii_table.
writeGCE_table
(filename, headers, data, dcols=['Isotopes', 'Yields', 'Z', 'A'], header_char='H', sldir='.', sep='&')¶ Method for writeing data in GCE format in Ascii files. Reads either elements or isotopes dcols[0] needs to contain either isotopes or elements
Note the attribute name at position i in dcols will be associated with the column data at index i in data. Also the number of data columns(in data) must equal the number of data attributes (in dcols) Also all the lengths of that columns must all be the same. Input: filename: The file where this data will be written. Headers: A list of Header strings or if the file being written
is of type trajectory, this is a List of strings that contain header attributes and their associated values which are seperated by a ‘=’.dcols: A list of data attributes data: A list of lists (or of numpy arrays). header_char the character that indicates a header lines sldir: Where this fill will be written. sep: What seperatesa the data column attributes trajectory: Boolean of if we are writeing a trajectory type file
-
nugridpy.ascii_table.
writeTraj
(filename='trajectory.input', data=[], ageunit=0, tunit=0, rhounit=0, idNum=0)¶ Method for writeing Trajectory type ascii files files.
Parameters: - filename (string) – The file where this data will be written.
- data (list) – A list of 1D data vectors with time, T and rho.
- ageunit (integer, optional) – If 1 ageunit = SEC, If 0 ageunit = YRS. If 2 agunit = logtimerev in yrs. The default is 0. logtimerev is log of time until end
- tunit (integer, optional) – If 1 TUNIT = T9K, if 0 TUNIT = T8K. The default is 0.
- rhounit (integer, optional) – If 1 RHOUNIT = LOG, if 0 RHOUNIT = CGS. The default is 0.
- idNum (optional) – An optional id argument


---
layout: post
title: Arctic scientists see Canada slipping on world stage
date: '2013-03-25T13:34:00.003-04:00'
author: Robert Sica
tags:
- CANDAC
- arctic
- politics
modified_time: '2013-07-30T14:20:01.974-04:00'
blogger_id: tag:blogger.com,1999:blog-736339229338318027.post-192653469132748040
blogger_orig_url: http://blog.purplecrowlidar.ca/2013/03/arctic-scientists-see-canada-slipping.html
---
Arctic scientists see Canada slipping on world stage | Toronto Star
Yet increasingly, the basic science that would let us understand changes occurring in our own backyard — and either mitigate or take advantage of them — is being neglected by Canada and assumed by other countries, Arctic researchers say.
Austerity does not mean out-sourcing your future. As our Anthem says: “The True North strong and free!” Would it be cynical to suggest that since the most dramatic changes in climate due to human activity occur in the polar regions it is best to ask as few questions about the North as possible?


#include <engineoutputdata.h>
Inherits EngineOutputBase.
Read CoreData Class Design before making any changes to this class.
A typical object graph looks like: EngineOutputData - TimingOutputDataLatest - CustomEventOutputData - WorldOutputDataLatest - HeadIntersectionOutputData - GazeIntersectionOutputDataLatest **DUPLICATES ALLOWED - InertiaOutputDataLatest - GPSOutputData - EngineStateOutputDataLatest - HeadTrackerStateOutputData - IRPodStateOutputData - FeatureSetsByCameraLatest - FeatureSet(CAM_A) - FeatureRect(FACE_RECT_ID) - FeatureRect(LEFT_EYE_RECT_ID) - FeatureRect(RIGHT_EYE_RECT_ID) - FeatureRect(MOUTH_RECT_ID) - FeaturePoint(RIGHT_PUPIL_ID) - FeaturePoint(LEFT_PUPIL_ID) - FeatureSet(CAM_B) - ImageCollectionOutputDataLatest - FaceSetOutputDataLatest **DUPLICATES ALLOWED - HeadOutputDataLatest - EyeOutputDataLatest - GazeOutputData - PupilOutputData - EyeClosureOutputData - FaceOutputDataLatest
Definition at line 89 of file engineoutputdata.h.
| typedef uint32 FrameNumber |
Unsigned type that can hold a number to uniquely identify a video frame.
Definition at line 150 of file engineoutputdata.h.
| EngineOutputData | ( | const EngineOutputData & | rhs | ) |
Copies _frame_num and calls base class copy constructor.
| virtual void appendEngineSpecificData | ( | std::vector< uint8 > & | buffer | ) | const [protected, virtual] |
| virtual EngineOutputData* clone | ( | ) | const [virtual] |
| EngineStateOutputDataLatestPtr engineStateOutputData | ( | ) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
| EngineStateOutputDataLatestPtr engineStateOutputData | ( | ) |
Returns the attached engine state output data upgraded to the latest version.
| SerializableError | If an object with the ID of a EngineStateOutputData was found, but could not be cast to a EngineStateOutputData object |
| EyeOutputDataLatestPtr eyeOutputData | ( | ) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
| EyeOutputDataLatestPtr eyeOutputData | ( | ) |
| SerializableError | if an object with the ID of a EyeOutputData was found, but could not be cast to a EyeOutputData object |
| FaceSetOutputDataLatestPtr face | ( | ObjectIndex | index | ) |
Returns a FaceSetOutputData by index.
If the object has head, face or eye output data as immediate subobjects then they are upgraded to the latest versions and moved to the first FaceSetOutputData object under this object. If there is no FaceSetOutputData object it will be created. If there already exists a FaceSetOutputData object which already contains the upgraded object being moved that an exception will be thrown.
| SerializableError | There already exists a FaceSetOutputData object with the data being moved. |
| FaceOutputDataLatestPtr faceOutputData | ( | ) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
| FaceOutputDataLatestPtr faceOutputData | ( | ) |
If the latest versioned FaceOutputData sub object exists it is returned. Otherwise if an older face output data exists then it is upgraded to the latest version. The older version will be removed.
| SerializableError | if an object with the ID of a FaceOutputData was found, but could not be cast to a FaceOutputData object |
| FeatureSetsByCameraLatestPtr featureSetsByCamera | ( | ) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
| FeatureSetsByCameraLatestPtr featureSetsByCamera | ( | ) |
| SerializableError | if an object with the ID of a FeatureSetsByCamera was found, but could not be cast to a FeatureSetsByCamera object |
| FrameNumber frameNum | ( | ) | const |
Unique video frame number.
Reset to 0 whenever the engine is restarted.
| ConstGPSOutputDataPtr gpsOutputData | ( | ) | const |
| ConstGPSOutputDataV2Ptr gpsOutputDataV2 | ( | ) | const |
| SerializableError | if an object with the ID of a GPSOutputDataV2 was found, but could not be cast to a GPSOutputDataV2 object |
| HeadOutputDataLatestPtr headOutputData | ( | ) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
| HeadOutputDataLatestPtr headOutputData | ( | ) |
Returns a HeadOutputDataLatest object or a NULL shared pointer if none has been attached.
If a HeadOutputDataV2 sub object exists it is returned. Otherwise if an older head output data exists then it is upgraded to a HeadOutputDataV2 object. The older version of the head output data object will be removed.
| SerializableError | if an object with the ID of a HeadOutputData was found, but could not be cast to a HeadOutputData object |
| ImageCollectionOutputDataLatestPtr imagesOutputData | ( | ) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
| ImageCollectionOutputDataLatestPtr imagesOutputData | ( | ) |
| SerializableError | if an object with the ID of a ImageCollectionOutputData was found, but could not be cast to a ImageCollectionOutputData object |
| InertiaOutputDataLatestPtr inertiaOutputData | ( | ) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
| InertiaOutputDataLatestPtr inertiaOutputData | ( | ) |
| SerializableError | if an object with the ID of a InertiaOutputDataLatest was found, but could not be cast to a InertiaOutputDataLatest object |
| static const std::wstring LOGFILE_EXTENSION | ( | ) | [static] |
| static const std::wstring LOGFILE_INDEX_EXTENSION | ( | ) | [static] |
| virtual uint32 numEngineSpecificDataBytes | ( | ) | const [protected, virtual] |
| uint8 numFaces | ( | ) |
Returns the number of FaceSetOutputData objects attached.
If the object has head, face or eye output data as immediate subobjects then a FaceSetOutputData object will be created and added as a subobject. The head, face and eye output data objects will be upgraded to the latest versions and moved under the FaceSetOutputData.
| SerializableError | There already exists a FaceSetOutputData object. The head, face and eye output data will upgraded and moved if there doesn't already exists a FaceSetOutputData object. |
| virtual ObjectID objectID | ( | ) | const [virtual] |
| EngineOutputData& operator= | ( | const EngineOutputData & | rhs | ) |
Copies _frame_num and calls base class assignent operator.
| rhs | The EngineOutputData instance to copy. |
| virtual void printOwnData | ( | std::ostream & | s | ) | const [protected, virtual] |
| virtual void printOwnHeader | ( | std::ostream & | s | ) | const [virtual] |
| virtual void readEngineSpecificData | ( | const std::vector< uint8 > & | buffer, | |
| int & | read_pos | |||
| ) | [protected, virtual] |
| void reset | ( | ) | [protected] |
Clear all attached sub-objects and reset the frame number and valid state
| void setFrameNum | ( | FrameNumber | frame_num | ) |
Set the frame number of this data object
| TimingOutputDataLatestPtr timingOutputData | ( | ) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
| TimingOutputDataLatestPtr timingOutputData | ( | ) |
| SerializableError | if an object with the ID of a TimingOutputData was found, but could not be cast to a TimingOutputData object |
| WorldOutputDataLatestPtr worldOutputData | ( | ) | const |
This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.
| WorldOutputDataLatestPtr worldOutputData | ( | ) |
Returns a WorldOutputDataV2 object or a NULL shared pointer if none has been attached.
If a WorldOutputDataV2 sub object exists it is returned. Otherwise if an older world output data exists then it is upgraded to a WorldOutputDataV2 object. The older version of the world output data object will be removed.
| SerializableError | if an object with the ID of a WorldOutputData was found, but could not be cast to a WorldOutputData object |


I AM A BANKER BY PROFESSION FROM BURKINA FASO IN WEST AFRICA AND CURRENTLY HOLDING THE POST OF ASSISTANT FOREIGN REMITTANCE DIRECTOR IN OUR BANK.   HAVE A GREAT DAY. YOURS, MR HAROUNA HAJI. -------------------------------------------------------------------------------------------- Nueva Barra de Herramientas de OZÚ. Navega Más facilmente por Internet. ¡Descargatela gratis! http://barra.ozu.es/ -------------------------------------------------------------------------------------------- Correo enviado desde http://www.ozu.es


11 baby carriers, cots and strollers found to be unsafe: Product safety regulator
SINGAPORE: Several children's products, including baby carriers, cots and strollers, were found to be unsafe after testing, Enterprise Singapore warned consumers on Tuesday (Nov 5).
Six baby carriers, five cots and five strollers were tested by the regulatory agency, which found 11 of the products to be unsafe. The 11 products did not comply with safety requirements by the American Society for Testing and Materials International (ASTM), the International Organisation for Standardisation (ISO), or the European Committee for Standardisation (EN).
The hazards identified by the regulator include choking, entrapment, falling, and laceration.
"Consumers are encouraged to pay a close attention to these safety issues when purchasing and using these children’s products," Enterprise Singapore said.
READ: 7-month-old baby dies from suffocation after being trapped between mattress and bed rail: Coroner
THE UNSAFE PRODUCTS
For baby carriers, the unsafe products identified were the MINE 4 Position Baby Carrier, OEM Adapt 3 Position Baby Carrier, Sorbebe Airo Robic Hip Seat Baby Carrier and the I-Angel Miracle Hip Seat Carrier.
The key safety issues for the carriers were that the fastener broke because it was unable to support the weight of a baby and that there was a lack of instructions for proper usage, which may lead to improper use, "causing injuries and suffocation", Enterprise Singapore added.
Four unsafe cots were also identified, including the SG Baby Shop (Model No: SX), Premium Baby Bed Set (Model No: Hope HP 810M), Puku Izzy Foldable Baby Cot (Model No: P30112) and Milano – Oxford 4 in 1 Convertible Cot (Model No: BD302).
Enterprise Singapore said the key safety issues were that the cot slants broke easily and that the slants did not meet height requirements.
There were also raised surfaces or bumps and sharp ages in the cots. Some small parts were easily detachable, posing a risk of suffocation if swallowed by the baby.
The Baby YOYA Baby Cabin Travel, the Belecoo Compact and Seebaby Little Monster were the three strollers found to be unsafe.
Enterprise Singapore added that there were problems with the restraint system and that the fasteners were unable to secure a child in the seat.
There were also issues with stability, which could cause the strollers to tip over when parked on slopes.
"The product was damaged or collapsed when tested for strength, which resulted in the impairment of safety features such as locking mechanism, restraint system, and parking/braking devices," the regulator said.
REMOVED FROM SALE
Enterprise Singapore said all 11 unsafe products were available on e-commerce platforms, including Qoo10, Shopee and Lazada.
"The suppliers of these products have since removed them for sale following the notices issued by Enterprise Singapore to do so," it said.
Consumers who bought the products are urged to stop using them immediately and contact the sellers or the Consumers Association of Singapore (CASE) for information on redress options.
"Consumers should check that children’s products have undergone the necessary safety tests before making purchases online as it is not possible to check the product physically prior to the purchase.
"Those who may have bought similar products should note the above safety issues," Enterprise Singapore advised.


Broken
I can’t pinpoint exactly when, but I’ve come to the realisation that the daily routine I’ve worked so hard to build is broken.
After a coffee & chinwag with my good friend Dan Furze, it seems that it’s not just me, which is always reassuring.
I’m aware that everyone has natural peaks and troughs in life - hell I’ve had enough myself - but recently it’s felt like I’ve been unable to climb out of this one.
The start of the year was incredibly productive and my motivation was super high, I was doing all the things I’d been trying to get myself to do for years, but in the last few weeks and months my blogging has slowed; My reading has all but stopped; My plans and learning has also taken a hit.
I’d hit the wall.
Going over things with someone else is different to the voice in your head
Now this may sound like an obvious thing, but when you say things out loud – and i’m not suggesting that we all start talking audibly to ourselves – but when you start to say things and you get actual real feedback, then you can really start to formulate a plan.
The person/people you’re talking to may have personal anecdotes which may help, or they could suggest tools or products which right away turn that lightbulb on.
This happened. Today (well, yesterday to be precise).
Dan suggested following his and Front end Phil’s lead and create [Trello] boards and make the appropriate one’s public.
This is such a simple, yet mind-blowingly brilliant suggestion.
Public sharing
In the spirit of things I’ve got this post written up, and have already started with the boards.
Public Trello boards
Half finished posts
- What the FUX
- The art of side projects
- Meetups
- Vacation
Fin.
The final thing we settled on was a pact. A pact of support for each other, one where we motivate and help when either is feeling at a particular low ebb, or just in need of a kick.
For this, I can’t thank Dan enough.
We also agreed to shame each other as punishment – well maybe not that bad, but the threat of a tweet, or blog post should be enough of a gee up.
Dan has already made a start on this, so I suggest you head over to his blog and get reading. There is some awesome content on there already and I for one can’t wait to see what else he writes this year.
Also, for posterity here is the tweet that started it all.
Here’s to a prosperous end of the year!


Diversity is found in any social identity such as gender or identifying as non-binary, age, nationality, ethnicity, culture, political belief, religion or the lack of religion, sexual orientation, and other attributes. At iDEC we aim to create a community for directed evolution researchers where everyone is welcome and feels free to be themselves. We want to involve, accept, and value everyone regardless of their social identity. We strongly believe that creating an open and diverse (research) community is the only way to solve the problems of both the present and the future. We expect all teams to foster a team culture where every voice is welcome, respected, and heard.
We from iDEC HQ want to encourage everyone with an interest in directed evolution to join our community and/or competition. If you feel like any structures in your home institution, country or team are holding you back to do so, please contact us!
When you recruit your team, make sure the team reflects the diverse background of your area. If you only receive applications from a non-diverse group (e.g., gender), seek contact with potential candidates and ask them what the barriers are that prevent them from wanting to join your team. Try to remove these barriers together!
Words matter! And graphics, too! Have you ever thought about gender-neutral language? Or if your standard representation in pictures and graphics of a scientist is diverse? Language and representation have a huge influence on how (and if) people feel approached. Would you answer a job application you think is only searching for people of another gender? Always try to write with gender-neutral language and highlight that you and your team support building a project that is beneficial for the whole society.
Get in contact and discuss. As scientists, we rarely learn how to build a diverse and inclusive community, definitely less than people studying other subjects, but this does not mean that it is less important in our community. If you feel like you do not understand why someone feels offended, ask this person. Only an open dialogue can change our community to become better when it comes to diversity and inclusion. This is true for the iDEC HQ as well: if you feel like something is wrong or missing on this page, please contact us!
"Responsible research" – Have you and your team ever thought was this term means for you?
At iDEC, we have thought a lot about how we could responsibly conduct our research.
The first (and most important) remark is: You are responsible for designing a research project that is beneficial for our society and the environment.
To participate in iDEC, you and your team must fill out a responsible research form. This will address your research's biosafety, biosecurity, and ethical implications. This webpage will give you some guidance on how to do so.
We have a Commission for Responsible Research (CRR) to help you regarding related questions and approve your responsible research forms. Please feel free to contact us with any questions or concerns.
Please keep in mind that this step is not to forbid you from following your project idea. Thinking about making your project safe and conducting your research with responsibilities will make your project better and is the only way to design directed evolution projects that can influence our world beyond your lab bench.You should always evaluate your project individually with the question in mind: Can my project cause harm?
In your responsible research form, you will need to answer some questions regarding biosafety, biosecurity, and the ethical implications of your research. You will find definitions of what these aspects mean for us on this page.
To ensure your safety, we have set up a few policies regarding responsible research. Please review them carefully. Ignoring these policies can lead to your team being disqualified from the competition.
The iDEC Commission for Responsible Research (CRR) will have the right of final explanation on all relevant provisions.
The definition of biosecurity can be confusing sometimes, and biosafety and biosecurity are often mistaken to refer to the same concept.
Don't worry. First, we should understand that biosafety is not the same as biosecurity.
Biosafety measures include the categorization of laboratories into safety categories, safety equipment and waste management in the laboratory.
In contrast to biosafety, biosecurity is defined as follows:
Aspects of biosecurity are information security, access control, and inventory control.
Biosafety and biosecurity measures are often closely related. For example, efforts to prevent unintentional release of biological material (an aspect of biosafety) often prevent intentional release (biosecurity) as well. Thus, biosecurity countermeasures are usually covered by biosafety laws. However, additional regulations related to biosecurity with hazardous organisms have been implemented to prevent their misuse.
To illustrate the difference between biosafety and biosecurity, the Biosecurity Office of the Dutch National Institute for Public Health and the Environment (RIVM) made the following distinction: "With biosafety, people are protected against dangerous pathogens, while with biosecurity, the pathogens are protected against malicious people" [2].
For iDEC, we want to talk specifically about two kinds of biosafety and biosecurity issues: Gain-of-Function experiments and Dual Use Research of Concern. It is important that you and your team consider if your project falls in one of these categories and if so, what countermeasures you can establish to make your project as safe as possible.
In some experiments, the biosafety level of the organism we use can be changed by engineering traits of this organism. These experiments are called “Gain-of-Function” (GOF) experiments.
If you identify a risk of GOF of your experiments, please contact the Commission for Responsible Research. Keep in mind that this does not only include expected increase in virulens; even engineering of e. g. abilities to form biofilms, might make your organism more difficult to inactivate, thus, increasing the transmissibility.
Biosecurity issues mainly arise from the possibility of misusing scientific findings to cause harm. Research with the potential to be used in both a benevolent and a malevolent way is called "Dual Use Research of Concern (DURC)."
Dual Use Research of Concern (DURC) is a part of biosecurity. When thinking about Dual Use Research of Concern, research on pathogens is probably the first thing that comes to mind. Some organisms which are known to be a threat to human health and security are listed as “selected agents”[5]. These include, for example, pathogens like the ebola virus [6].
But even research based on non-selected agent organism can have a potential of misuse. An example would be viruses to engineer traits of agricultural plants on the field. Designing a vector that can engineer a whole field to become e.g. drought resistant, might be misused to introduce traits that destroy entire crops or introduce toxin production.
This webpage is not meant to spread panic or evoke the image that directed evolution research is too dangerous. Most projects have a very low potential of causing harm, but even if the potential to harm is low for most projects, identification of risks is crucial to establish precautions. Right now, we rely on the self-regulatory approach when it comes to some biosecurity issues (e.g. DURC), meaning all researcher are responsible to screen for risks and establish precautions themselves. Regulations by an external body would restrict the right of free research, but to make this approach work, we need to ensure that every researcher has the skills to determine biosafety and biosecurity risks and the best way to do so is a good education on these issues.
We are aware that many educational institutions still did not include such teaching programs in their curricula globally.
iDEC is committed to establishing an awareness of biosafety and biosecurity matters.
Identifying ethical issues of scientific research projects is a big part of responsible research. To identify possible unethical practices, teams need to evaluate who is impacted by their project and what this influence means to the person, group, or society as a whole. If you have any questions regarding your project's ethical implications, we would recommend contacting your university's or institutional ethics council or contacting our Commission for Responsible Research (CRR).
It is important to get clearance through your ethics council if you want to conduct any research on humans or human samples, including surveys.
It is also helpful to get in touch with people affected by your research and ask them how they would envision a solution for their problem. Designing projects hand in hand with the people who will use them later will help you develop a beneficial product.
To analyze a project's societal and environmental context is often referred to as "Human Practices". The term "Human Practices" was first coined by the Synthetic Biology Engineering Research Center (Synberc) as a defining part of its policy and practices thrust. [7]
iDEC is committed to communicating the importance of considering ethical implications.
1. All iDEC teams must fill out the responsible research form.
2. We recommend conducting experiments after the CRR has approved the responsible research form.
3. Projects using gene drives are forbidden in iDEC.
4. GMOs and products produced by GMOs are not allowed to be taken outside of the lab.
5. Animal testing is forbidden.
6. All teams must follow not only the iDEC safety policies but also the local and institutional regulations.
7. Self-experimentation, including testing samples of team members (e.g., blood, urine, salvia), is not allowed.
8. All iDEC entries must be research projects completed by registered team members. Plagiarism and falsified contributions of any nature are strictly prohibited.
9. The data and graphs displayed by the participating teams must be reliable and meet academic standards. Fabrication and/or falsification is never allowed.
10. The contents of the experiment records must be true. Falsification of the experimental record is never allowed.
11. The participating teams should cite the work of predecessors or others in a standardized manner. It is unacceptable to infringe on the intellectual property rights of others.
12. Participants need to comply with other academic ethics requirements of the local country, research institution, or school.
The responsible research form aims to check that your team establishes enough considerations and countermeasures for possible risks.
The Responsible Research Form for iDEC 2021 will be released May 1. Please submit your form before July 1.
To give you a little teaser what you can expect:
The aim of the responsible research form is to show us that you and your team established suitable biosafety and biosecurity considerations and countermeasures for possible risks. Right now, our committee is working on finishing the final form. The following aspects should give you an idea what will be part of the form.
For the responsible research form, all teams must answer questions in the following categories: Biosafety protection, used chassis and genes, biosecurity considerations and ethical concerns (including research on humans)
The responsible research form can be submitted on a rolling basis but must be submitted by each team before they start with their wetlab work. Submissions of the form for all team members must be submitted no later than 2 months after the official start of the competition. The responsible research forms will be reviewed and approved by the commission for responsible research. If a team wants to use additional genes, chemicals, methods or chassis that have not yet been mentioned in the responsible research form, they can fill out an updated form to get these genes approved by the commission for responsible research.
Biosafety describes the personal protection and protection from unintentional release of biological agents with the potential to cause harm to plants, animals, humans or the environment. Within the biosecurity section of the responsible research form, the teams need to answer questions regarding safety equipment in their laboratory as well as safety countermeasures to ensure the prevention of unintentional release of GMOs. Possible fields of the form could be:
Genes and chassis of each team have to be biosafety level 1 or 2. All genes and chassis of organisms falling into the category biosafety level 3 or 4 are forbidden to be used in iDEC. There will be a white list of chassis which are allowed to be used within the competition. All genes and chassis used in addition to these need to be listed in the responsible research form. Possible fields of the form could be:
Biosecurity describes the prevention of biological agents from unauthorized access, theft, misuse or loss. In the biosecurity section of the responsible research form, teams are required to evaluate potential biosecurity risks and their countermeasures. Possible fields of the form could be:
Identifying ethical issues of scientific research projects is a big part of responsible research. To be able to identify possible unethical practices, teams need to evaluate who is impacted by their project and what this influence means to the person, group or society as a whole.
[1] Definition by the World Health Organisation (2006). Available online: https://www.who.int/influenza/pip/BiosecurityandBiosafety_EN_20Mar2018.pdf?ua=1[06/11/20].
[2] Website of the Biosecurity bureau from the RIVM. https://www.bureaubiosecurity.nl/en/about-biosecurity-office [06/11/20]
[3] Selgelid, M. J. Gain-of-Function Research: Ethical Analysis.  Published online 2016 Aug 8
[4] Definition adapted from the definition by the National Institute of Health. Available online: https://osp.od.nih.gov/biotechnology/dual-use-research-of-concern/ [06/11/20].
[5] Website of the Center for Disease Control and Prevention (CDC). https://www.cdc.gov/cpr/dsat/what-is-select-agents.htm#:~:text=Select%20agents%20are%20biological%20agents,to%20animal%20or%20plant%20products [06/11/20]
[6] List of selected agents from the Federal Selected Agents Program. https://www.selectagents.gov/sat/list.html [06/11/20]
[7] Website of the Synthetic Biology Engineering Research Center. https://ebrc.org/synberc/ [25/01/2021]


My first stop in the US was Seattle because I had family there. The rainy Seattle in my mind did not match the one I arrived to in the middle of summer. Although I was only there a short time, I ended up loving it. If I couldn't live in SF, I would be fine living here.
One of the things I did there was watch The Dark Knight in IMAX at the Pacific Science Center. I was obsessed with that movie at that time.
I loved going around Seattle. It was so different from the Manila that I was used to. I'm sad that I lost half my pictures in downtown Seattle. I got pranked at Pike Place Market when they threw a fake fish at me and ordered coffee at the first ever Starbucks. The boy in the pictures is my cute cousin.
My aunt had a dream about this place that when she saw it, she would meet the man she would marry. True enough, she ended up meeting my uncle.
After my semester in San Francisco, I flew back to Seattle to spend Christmas, my birthday and new year's eve with my relatives. The amount of snow was more than usual. It's always been a dream of mine to see snow but it loses its magic after a while. You get bored staying home all the time! I hate this picture of me because you can see all the weight I gained.
Immediately after leaving our luggage at the hotel, my friends and I didn't want to waste the day and rushed to Universal Studios. I was surprised at the cold weather of LA, I didn't pack the right clothes. The lines were thankfully short because it was Thanksgiving Weekend. I enjoyed the Studio Tour with all its crazy special effects but my favourite ride was The Simpsons. I think the Battlestar Galactica ride at Singapore is still the best Universal Studios ride ever.
The next day was Black Friday and we spent it in a predictable American way: shopping.
I couldn't possibly go to LA without visiting the happiest place on earth. The rides were disappointing, except for Space Mountain which was worth the very long queue. We even spotted some NBA players! It's not LA unless you spot the famous people.
The most memorable food on the trip was definitely the iconic Pinks hotdog.
I spent the last few hours in LA running around Hollywood trying to visit all the landmarks like a marathon tourist. I ended up with a giant headache in the rush. Although I was only there for a few days to make a judgment, I think LA is fun to visit, but I definitely prefer SF as a city to live in.


Google Earth lets you tell stories using its new creation tools
by Shereesa MoodleyGoogle on Wednesday revealed new creation tools for Google Earth that allow users to tell stories about all the places they’ve visited.
“With creation tools in Google Earth, you can draw your own placemarks, lines and shapes, then attach your own custom text, images, and videos to these locations,” the company said on its website.
This means users tools can attach stories about different locations around the world to Google Earth’s map and share these stories with others.
“By clicking the new “Present” button, your audience will be able to fly from place to place in your custom-made Google Earth narrative,” Google explained.
Additionally, users can invite others to collaborate on stories as well.
“Thanks to an integration with Google Drive, you can share your stories with your audience and they can view it anywhere—their phone, tablet or laptop,” the company also noted.
The creation tools are available on the web version of Google Earth, while Android and iOS users can view ongoing projects on their devices.
Feature image: screenshot, Google Earth via YouTube


Ed Sheeran
-
Beautiful People (feat. Khalid)
作曲 : Fred Gibson/Ed Sheeran/Khalid Robinson/Max Martin/Shellback We are, we are, we are LA on a Saturday night in the ... -
Best Part of Me (feat. YEBBA)
作曲 : Abbey Smith/Ed Sheeran/Benjamin Levin My lungs are black, my heart is pure My hands are scarred from nights before... -
Remember The Name (feat. Eminem & 50 Cent)
作曲 : Max Martin/C Jackson/Ed Sheeran/Andre Benjamin/Shellback/Marshall Mathers/Antwan Patton/Patrick Brown/Raymon Murra... -
Take Me Back to London (feat. Stormzy)
作曲 : Max Martin/Ed Sheeran/Shellback/Fred Gibson/Michael Omari Jet plane headed up to the sky Spread wings in the cloud... -
I Don't Care
作曲 : Fred Gibson/Ed Sheeran/Justin Bieber/Jason Boyd/Max Martin/Shellback 作词 : Ed Sheeran/Fred Gibson/Jason Boyd/Justi... -
Shape of You
The club isn't the best place to find a lover So the bar is where I go Me and my friends at the table doing shots Drinki... -
Galway Girl
[by:蠢梨Sherry] She played the fiddle in an Irish band But she fell in love with an English man Kissed her on the neck and... -
Perfect
[by:蠢梨Sherry] I found a love for me Darling, just dive right in and follow my lead Well, I found a girl, beautiful and s... -
Thinking Out Loud
When your legs don't work like they used to before And I can't sweep you off of your feet Will your mouth still remember... -
Supermarket Flowers
[by:柠檬味海风Sound] I took the supermarket flowers from the windowsill I threw the day old tea from the cup Packed up the ph... -
Perfect Duet (with Beyoncé)
Ed Sheeran： I found a love for me Oh darling just dive right in and follow my lead Well I found a girl beautiful and ... -
What Do I Know?
[by:蠢梨Sherry] Ain't got a soapbox I can stand upon But God gave me a stage, a guitar and a song My daddy told me, "Son, ... -
Cross Me (feat. Chance the Rapper & PnB Rock)
作曲 : Fred Gibson/Ed Sheeran/Rakim Hasheem Allen/Chancelor Bennett Anything she need she can call me Don’t worry about h... -
Don't
Ah lahmlahlah I met this girl late last year She said don't you worry if I disappear I told her I'm not really looking f... -
Nancy Mulligan
[by:蠢梨Sherry] I was twenty-four years old When I met the woman I would call my own Twenty-two grand kids now growing old... -
I Don't Care (Acoustic)
作曲 : Fred Gibson/Ed Sheeran/Justin Bieber/Jason Boyd/Max Martin/Shellback I'm at a party I don't wanna be at And I don'... -
Dive
[by:秋风暖暖666] Maybe I came on too strong Maybe I waited too long Maybe I played my cards wrong Oh just a little bit wrong... -
I See Fire (Kygo Remix)
this is to end in fire Then we should all burn together Watch the flames climb high into the night Calling out father, o... -
All of the Stars
It's just another night And I'm staring at the moon I saw a shooting star And thought of you I sang a lullaby By the wat... -
End Game
作曲 : Taylor Swift/Max Martin/Shellback/Ed Sheeran/Nayvadius Wilburn 作词 : Taylor Swift/Max Martin/Shellback/Ed Sheeran/...  -
Happier
[by:蠢梨Sherry] Walking down 29th and park I saw you in another's arms Only a month we've been apart You look happier Saw... -
Castle on the Hill
[by:蠢梨Sherry] When I was six years old I broke my leg And I was running from my brother and his friends And tasted the s...  -
New Man
[by:蠢梨Sherry] Nah nah nah nah nah I heard he spent five hundred pounds on jeans Goes to the gym at least six times a we... -
Shape Of You (Galantis Remix)
[by:hondoes] The club isn't the best place to find a lover So the bar is where I go Me and my friends at the table doing... -
Lay It All On Me
[by:电音综合症] All alone as you look through the door Nothing left to see If it hurts and you can't take no more Lay it all ... -
Bloodstream
[by:3ntropy] [ti:Bloodstream] [ar:Ed Sheeran] [al:X (Deluxe Edition)] I've been spinning now for time Couple women by my... -
Eraser
[by:秋风暖暖666] I was born inside a small town I lost that state of mind Learned to sing inside the lord's house But stoppe... -
Everything Has Changed
作曲 : Taylor Swift/Ed Sheeran 作词 : Taylor Swift/Ed Sheeran All I knew this morning when I woke Is I know something now,... -
I See Cali
[Verse One: Notorious B.I.G.]   -
Save Myself
[by:秋风暖暖666] I gave all my oxygen to people that could breath I gave away my money and now we don't even speak I drove m... -
Barcelona
[by:秋风暖暖666] Well get up up on the dancefloor tonight I've got two left feet and a bottle of red wine Making me feel lik... -
Lego House
I'm gonna pick up the pieces, And build a Lego house When things go wrong We can knock it down My three words have two ...  -
Hearts Don't Break Around Here
[by:蠢梨Sherry] She is the sweetest thing that I know Should see the way she holds me when the lights go low Shakes my sou... -
Dark Times
[by:刘玄明童鞋] Waking up, half past five Blood on pillow and one bruised eye Drunk too much, you know what I'm like But you...  -
The A Team
White lips, pale face Breathing in snowflakes Burnt lungs, sour taste Light's gone, day's end Struggling to pay rent Lon... -
Antisocial
作曲 : Jacques Webster/Ed Sheeran/Fred Gibson/Joseph Saddler All you cool people you better leave now coz it’s about to h... -
Friends
[by:_弗木森] We're not, no we're not friends, nor have we ever been We just try to keep those secrets in our lives And if t... -
BLOW
作曲 : Ed Sheeran/Greg McKee/Bard McNamee/Brody Brown/J.T. Cure/Chris Stapleton/Bruno Mars/Frank Rogers Feeling like a bu... -
River
[by:Trap_Girl] 作曲 : Marshall Mathers 作词 : Marshall Mathers I've been a liar, been a thief Been a lover, been a cheat A... -
Sing
It's late in the evening Glass on the side I've, been sat with you For most of the night Ignoring everybody here we wish... -
Feels (feat. Young Thug & J Hus)
作曲 : Ed Sheeran/Fred Gibson/Jeffery Lamar Williams/Momodou 'J Hus' Jallow Bada boom, bada bee, yeah you knocked me righ... -
I Don't Care (Jonas Blue Remix)
作曲 : Fred Gibson/Ed Sheeran/Justin Bieber/Jason Boyd/Max Martin/Shellback I'm at a party I don't wanna be at And I don'...  -
Shape Of You (Blaze U Remix)
[by:VKTO] [ti:] [ar:] [al:] [by:九九Lrc歌词网～www.99Lrc.net] The club isn't the best place to find a lover So the bar is wher... -
South of the Border (feat. Camila Cabello & Cardi B) [Sam Feldt Remix]
[by:Trap_Girl] 作曲 : Camila Cabello/Fred Gibson/Ed Sheeran/Jordan Thorpe/Steve Mac/Belcalis Almanzar She got the mmm bro... -
Photograph (AndyWho Remix)
Loving can hurt Loving can hurt sometimes But it's the only thing That I know When it gets hard You know it can get hard... -
Perfect Symphony
[by:工作婊] I found a love for me Oh darling, just dive right in and follow my lead Well, I found a girl, beautiful and swe... -
South of the Border (feat. Camila Cabello & Cardi B) [Cheat Codes Remix]
作曲 : Belcalis Almanzar/Camila Cabello/Ed Sheeran/Fred Gibson/Jordan Thorpe/Steve Mac She got the mm brown eyes, caramel... -
How Would You Feel (Paean)
You are the one, girl You know that it's true I'm feeling younger Every time that I'm alone with you We were sitting in... -
Take Me Back To London (Remix) [feat. Stormzy, Jaykae & Aitch]
[by:Trap_Girl] 作曲 : Ed Sheeran/Fred Gibson/Max Martin/Michael Omari/Shellback Jet plane headed up to the sky Spread win... -
Tenerife Sea
You look so wonderful in your dress I love your hair like that The way it falls on the side of your neck Down your shoul... -
Shape of You (Major Lazer Remix)
[by:hondoes] Major Lazer for the ladies Ed Sheeran and Kranium You know your body look good So good, so good, yeah The ... -
Castle on the Hill (Seeb Remix)
[by:immaculatewhore] 作曲 : Benjamin Levin/Ed Sheeran (We watched the) sunset over the castle on the hill When I was six... -
Photograph
Loving can hurt Loving can hurt sometimes But it’s the only thing that I’ve known When it gets hard You know it can get ...


--- layout: post title: My Shopping experience with naturalmantra.com tags: - Shopping status: publish type: post published: true meta: _aioseop_keywords: My Shopping experience with naturalmantra.com, naturalmantra.com review _aioseop_title: My Shopping experience with naturalmantra.com _graphene_post_date_display: global _graphene_show_addthis: global _graphene_slider_imgurl: '' _graphene_slider_img: global wp_plus_one_redirect: '' _edit_last: '2' _yoast_wpseo_linkdex: '0' _thumbnail_id: '2657' _yoast_wpseo_focuskw: '' _yoast_wpseo_title: '' _yoast_wpseo_metadesc: '' _yoast_wpseo_metakeywords: '' _yoast_wpseo_meta-robots-noindex: '0' _yoast_wpseo_meta-robots-nofollow: '0' _yoast_wpseo_meta-robots-adv: none _yoast_wpseo_sitemap-include: ! '-' _yoast_wpseo_sitemap-prio: ! '-' _yoast_wpseo_canonical: '' _yoast_wpseo_redirect: '' ---
I usually visit my favorite blogs very late at night.... yup very late around 12 -1 am. That's the only slot of time I find myself for blogging and interacting with people which I just cannot miss by any chance. I happen to read about Naturalmantra.com on Siri's blog, and within 15 min of reading I had placed my first order.This website has to be a one stop destination for all natural and Organic products in India.
My Experience : I placed my order on 5th Feb and received it on 8th.
I made use of their Valentine offer and got a discount of Rs.250...:) and picked up a combo of Soulflower soap. I quite liked the website layout, things are nicely organized and there is some stuff which I found very interesting specially the Organic jam and candles(On my next shopping list). They included a handwritten note which shows the personal attention to every customer and a go green shopping bag.
What I Ordered:
Soulflower Bite Me Chocolate and Soulflower Hair Conditioner Bar. They added a GoGreen shopping bag :)
Handwritten note, gives a thoughtful touch :)
What I did nor like:
For every order size of Rs.500 or more, 250 Rs off at sign up. Use the coupon code VALENTINE250 to avail this offer.
You can catch them at Facebook, Twitter, Youtube
** I have made the purchase with my money and this post gives my unbiased opinion