|
QuantLib: a free/open-source library for quantitative finance
Fully annotated sources - version 1.30
|
Longstaff-Schwarz path pricer for early exercise options. More...
#include <ql/methods/montecarlo/longstaffschwartzpathpricer.hpp>
Public Types | |
| typedef EarlyExerciseTraits< PathType >::StateType | StateType |
| Public Types inherited from PathPricer< PathType, ValueType > | |
| typedef ValueType | result_type |
Public Member Functions | |
| LongstaffSchwartzPathPricer (const TimeGrid ×, ext::shared_ptr< EarlyExercisePathPricer< PathType > >, const ext::shared_ptr< YieldTermStructure > &termStructure) | |
| Real | operator() (const PathType &path) const override |
| virtual void | calibrate () |
| Real | exerciseProbability () const |
| Public Member Functions inherited from PathPricer< PathType, ValueType > | |
| virtual | ~PathPricer ()=default |
| virtual ValueType | operator() (const PathType &path) const =0 |
Protected Member Functions | |
| virtual void | post_processing (const Size i, const std::vector< StateType > &state, const std::vector< Real > &price, const std::vector< Real > &exercise) |
Protected Attributes | |
| bool | calibrationPhase_ = true |
| const ext::shared_ptr< EarlyExercisePathPricer< PathType > > | pathPricer_ |
| QuantLib::IncrementalStatistics | exerciseProbability_ |
| std::unique_ptr< Array[]> | coeff_ |
| std::unique_ptr< DiscountFactor[]> | dF_ |
| std::vector< PathType > | paths_ |
| const std::vector< ext::function< Real(StateType)> > | v_ |
| const Size | len_ |
Additional Inherited Members | |
| Public Attributes inherited from PathPricer< PathType, ValueType > | |
| QL_DEPRECATED typedef PathType | argument_type |
Longstaff-Schwarz path pricer for early exercise options.
References:
Francis Longstaff, Eduardo Schwartz, 2001. Valuing American Options by Simulation: A Simple Least-Squares Approach, The Review of Financial Studies, Volume 14, No. 1, 113-147
Definition at line 53 of file longstaffschwartzpathpricer.hpp.
| typedef EarlyExerciseTraits<PathType>::StateType StateType |
Definition at line 55 of file longstaffschwartzpathpricer.hpp.
| LongstaffSchwartzPathPricer | ( | const TimeGrid & | times, |
| ext::shared_ptr< EarlyExercisePathPricer< PathType > > | pathPricer, | ||
| const ext::shared_ptr< YieldTermStructure > & | termStructure | ||
| ) |
Definition at line 87 of file longstaffschwartzpathpricer.hpp.
|
overridevirtual |
Implements PathPricer< PathType, ValueType >.
Definition at line 102 of file longstaffschwartzpathpricer.hpp.
|
virtual |
Definition at line 143 of file longstaffschwartzpathpricer.hpp.
| Real exerciseProbability |
Definition at line 209 of file longstaffschwartzpathpricer.hpp.
|
protectedvirtual |
Definition at line 67 of file longstaffschwartzpathpricer.hpp.
|
protected |
Definition at line 71 of file longstaffschwartzpathpricer.hpp.
|
protected |
Definition at line 73 of file longstaffschwartzpathpricer.hpp.
|
mutableprotected |
Definition at line 75 of file longstaffschwartzpathpricer.hpp.
|
protected |
Definition at line 77 of file longstaffschwartzpathpricer.hpp.
|
protected |
Definition at line 78 of file longstaffschwartzpathpricer.hpp.
|
mutableprotected |
Definition at line 80 of file longstaffschwartzpathpricer.hpp.
Definition at line 81 of file longstaffschwartzpathpricer.hpp.
|
protected |
Definition at line 83 of file longstaffschwartzpathpricer.hpp.


Class ConicalSurface
A conical surface which implements ISurface. The surface represents a circular or elliptical
cone. The u parameter always describes a circle or ellipse, the v parameter a Line.
Inheritance
System.Object
ConicalSurface
Implements
System.Runtime.Serialization.ISerializable
System.Runtime.Serialization.IDeserializationCallback
Inherited Members
System.Object.Equals(System.Object)
System.Object.Equals(System.Object, System.Object)
System.Object.GetHashCode()
System.Object.GetType()
System.Object.MemberwiseClone()
System.Object.ReferenceEquals(System.Object, System.Object)
System.Object.ToString()
Assembly: CADability.dll
Syntax
[Serializable]
public class ConicalSurface : ISurfaceImpl, ISurface, IOctTreeInsertable, ISerializable, IDeserializationCallback, ISurfaceOfRevolution, IExportStep
Constructors
|
Improve this Doc
View Source
ConicalSurface(GeoPoint, GeoVector, GeoPoint, GeoVector, GeoPoint, GeoVector)
Declaration
public ConicalSurface(GeoPoint p1, GeoVector n1, GeoPoint p2, GeoVector n2, GeoPoint p3, GeoVector n3)
Parameters
|
Improve this Doc
View Source
ConicalSurface(GeoPoint, GeoVector, GeoVector, GeoVector, Double, Double)
Declaration
public ConicalSurface(GeoPoint apex, GeoVector dirx, GeoVector diry, GeoVector dirz, double semiAngle, double voffset = 0)
Parameters
|
Improve this Doc
View Source
ConicalSurface(SerializationInfo, StreamingContext)
Declaration
protected ConicalSurface(SerializationInfo info, StreamingContext context)
Parameters
| Type |
Name |
Description |
| System.Runtime.Serialization.SerializationInfo |
info |
|
| System.Runtime.Serialization.StreamingContext |
context |
|
Properties
|
Improve this Doc
View Source
Axis
Declaration
public GeoVector Axis { get; }
Property Value
|
Improve this Doc
View Source
IsRuled
Declaration
public override RuledSurfaceMode IsRuled { get; }
Property Value
Overrides
|
Improve this Doc
View Source
IsUPeriodic
Declaration
public override bool IsUPeriodic { get; }
Property Value
| Type |
Description |
| System.Boolean |
|
Overrides
|
Improve this Doc
View Source
IsVPeriodic
Declaration
public override bool IsVPeriodic { get; }
Property Value
| Type |
Description |
| System.Boolean |
|
Overrides
|
Improve this Doc
View Source
Location
Declaration
public GeoPoint Location { get; }
Property Value
|
Improve this Doc
View Source
OpeningAngle
Declaration
public Angle OpeningAngle { get; }
Property Value
|
Improve this Doc
View Source
Oriented
Declaration
public override bool Oriented { get; }
Property Value
| Type |
Description |
| System.Boolean |
|
Overrides
|
Improve this Doc
View Source
UPeriod
Declaration
public override double UPeriod { get; }
Property Value
| Type |
Description |
| System.Double |
|
Overrides
|
Improve this Doc
View Source
VPeriod
Declaration
public override double VPeriod { get; }
Property Value
| Type |
Description |
| System.Double |
|
Overrides
|
Improve this Doc
View Source
XAxis
Declaration
public GeoVector XAxis { get; }
Property Value
|
Improve this Doc
View Source
YAxis
Declaration
public GeoVector YAxis { get; }
Property Value
|
Improve this Doc
View Source
ZAxis
Declaration
public GeoVector ZAxis { get; }
Property Value
Methods
|
Improve this Doc
View Source
AxisLine(Double, Double)
Declaration
public Line AxisLine(double vmin, double vmax)
Parameters
| Type |
Name |
Description |
| System.Double |
vmin |
|
| System.Double |
vmax |
|
Returns
|
Improve this Doc
View Source
Clone()
Declaration
public override ISurface Clone()
Returns
Overrides
|
Improve this Doc
View Source
CopyData(ISurface)
Declaration
public override void CopyData(ISurface CopyFrom)
Parameters
Overrides
|
Improve this Doc
View Source
Derivation2At(GeoPoint2D, out GeoPoint, out GeoVector, out GeoVector, out GeoVector, out GeoVector, out GeoVector)
Declaration
public override void Derivation2At(GeoPoint2D uv, out GeoPoint location, out GeoVector du, out GeoVector dv, out GeoVector duu, out GeoVector dvv, out GeoVector duv)
Parameters
Overrides
|
Improve this Doc
View Source
FixedU(Double, Double, Double)
Declaration
public override ICurve FixedU(double u, double vmin, double vmax)
Parameters
| Type |
Name |
Description |
| System.Double |
u |
|
| System.Double |
vmin |
|
| System.Double |
vmax |
|
Returns
Overrides
|
Improve this Doc
View Source
FixedV(Double, Double, Double)
Declaration
public override ICurve FixedV(double v, double umin, double umax)
Parameters
| Type |
Name |
Description |
| System.Double |
v |
|
| System.Double |
umin |
|
| System.Double |
umax |
|
Returns
Overrides
|
Improve this Doc
View Source
FromTwoCircles(Ellipse, Ellipse)
The two provided circles must share a common axis and must have different radii. The resulting cone passes through the provided circles.
If the conditions are not met, null will be returned.
Declaration
public static ConicalSurface FromTwoCircles(Ellipse c1, Ellipse c2)
Parameters
Returns
|
Improve this Doc
View Source
GetDualSurfaceCurves(BoundingRect, ISurface, BoundingRect, List<GeoPoint>, List<Tuple<Double, Double, Double, Double>>)
Declaration
public override IDualSurfaceCurve[] GetDualSurfaceCurves(BoundingRect thisBounds, ISurface other, BoundingRect otherBounds, List<GeoPoint> seeds, List<Tuple<double, double, double, double>> extremePositions)
Parameters
| Type |
Name |
Description |
| BoundingRect |
thisBounds |
|
| ISurface |
other |
|
| BoundingRect |
otherBounds |
|
| System.Collections.Generic.List<GeoPoint> |
seeds |
|
| System.Collections.Generic.List<System.Tuple<System.Double, System.Double, System.Double, System.Double>> |
extremePositions |
|
Returns
Overrides
|
Improve this Doc
View Source
GetExtrema()
Declaration
public override GeoPoint2D[] GetExtrema()
Returns
Overrides
|
Improve this Doc
View Source
GetExtremePositions(BoundingRect, ISurface, BoundingRect, out List<Tuple<Double, Double, Double, Double>>)
Declaration
public override int GetExtremePositions(BoundingRect thisBounds, ISurface other, BoundingRect otherBounds, out List<Tuple<double, double, double, double>> extremePositions)
Parameters
| Type |
Name |
Description |
| BoundingRect |
thisBounds |
|
| ISurface |
other |
|
| BoundingRect |
otherBounds |
|
| System.Collections.Generic.List<System.Tuple<System.Double, System.Double, System.Double, System.Double>> |
extremePositions |
|
Returns
| Type |
Description |
| System.Int32 |
|
Overrides
|
Improve this Doc
View Source
GetLineIntersection(GeoPoint, GeoVector)
Declaration
public override GeoPoint2D[] GetLineIntersection(GeoPoint startPoint, GeoVector direction)
Parameters
Returns
Overrides
|
Improve this Doc
View Source
GetModified(ModOp)
Declaration
public override ISurface GetModified(ModOp m)
Parameters
| Type |
Name |
Description |
| ModOp |
m |
|
Returns
Overrides
|
Improve this Doc
View Source
GetNaturalBounds(out Double, out Double, out Double, out Double)
Declaration
public override void GetNaturalBounds(out double umin, out double umax, out double vmin, out double vmax)
Parameters
| Type |
Name |
Description |
| System.Double |
umin |
|
| System.Double |
umax |
|
| System.Double |
vmin |
|
| System.Double |
vmax |
|
Overrides
|
Improve this Doc
View Source
GetNonPeriodicSurface(ICurve[])
Declaration
public override ISurface GetNonPeriodicSurface(ICurve[] orientedCurves)
Parameters
| Type |
Name |
Description |
| ICurve[] |
orientedCurves |
|
Returns
Overrides
|
Improve this Doc
View Source
GetNormal(GeoPoint2D)
Declaration
public override GeoVector GetNormal(GeoPoint2D uv)
Parameters
Returns
Overrides
|
Improve this Doc
View Source
GetOffsetSurface(Double, out ModOp2D)
Declaration
public override ISurface GetOffsetSurface(double offset, out ModOp2D mod)
Parameters
| Type |
Name |
Description |
| System.Double |
offset |
|
| ModOp2D |
mod |
|
Returns
Overrides
|
Improve this Doc
View Source
GetPlaneIntersection(PlaneSurface, Double, Double, Double, Double, Double)
Declaration
public override IDualSurfaceCurve[] GetPlaneIntersection(PlaneSurface pl, double umin, double umax, double vmin, double vmax, double precision)
Parameters
| Type |
Name |
Description |
| PlaneSurface |
pl |
|
| System.Double |
umin |
|
| System.Double |
umax |
|
| System.Double |
vmin |
|
| System.Double |
vmax |
|
| System.Double |
precision |
|
Returns
Overrides
|
Improve this Doc
View Source
GetPolynomialParameters()
Declaration
public override double[] GetPolynomialParameters()
Returns
| Type |
Description |
| System.Double[] |
|
Overrides
|
Improve this Doc
View Source
GetProjectedCurve(ICurve, Double)
Declaration
public override ICurve2D GetProjectedCurve(ICurve curve, double precision)
Parameters
| Type |
Name |
Description |
| ICurve |
curve |
|
| System.Double |
precision |
|
Returns
Overrides
|
Improve this Doc
View Source
GetPropertyEntry(IFrame)
Declaration
public override IPropertyEntry GetPropertyEntry(IFrame frame)
Parameters
| Type |
Name |
Description |
| IFrame |
frame |
|
Returns
Overrides
|
Improve this Doc
View Source
GetTangentCurves(GeoVector, Double, Double, Double, Double)
Declaration
public override ICurve2D[] GetTangentCurves(GeoVector direction, double umin, double umax, double vmin, double vmax)
Parameters
| Type |
Name |
Description |
| GeoVector |
direction |
|
| System.Double |
umin |
|
| System.Double |
umax |
|
| System.Double |
vmin |
|
| System.Double |
vmax |
|
Returns
Overrides
|
Improve this Doc
View Source
GetUSingularities()
Declaration
public override double[] GetUSingularities()
Returns
| Type |
Description |
| System.Double[] |
|
Overrides
|
Improve this Doc
View Source
GetVSingularities()
Declaration
public override double[] GetVSingularities()
Returns
| Type |
Description |
| System.Double[] |
|
Overrides
|
Improve this Doc
View Source
GetZMinMax(Projection, Double, Double, Double, Double, ref Double, ref Double)
Declaration
public override void GetZMinMax(Projection p, double umin, double umax, double vmin, double vmax, ref double zMin, ref double zMax)
Parameters
| Type |
Name |
Description |
| Projection |
p |
|
| System.Double |
umin |
|
| System.Double |
umax |
|
| System.Double |
vmin |
|
| System.Double |
vmax |
|
| System.Double |
zMin |
|
| System.Double |
zMax |
|
Overrides
|
Improve this Doc
View Source
HitTest(BoundingCube, out GeoPoint2D)
Declaration
public override bool HitTest(BoundingCube bc, out GeoPoint2D uv)
Parameters
Returns
| Type |
Description |
| System.Boolean |
|
Overrides
|
Improve this Doc
View Source
Make3dCurve(ICurve2D)
Declaration
public override ICurve Make3dCurve(ICurve2D curve2d)
Parameters
Returns
Overrides
|
Improve this Doc
View Source
Declaration
public override ModOp2D MakeCanonicalForm()
Returns
Overrides
|
Improve this Doc
View Source
MaxDist(GeoPoint2D, GeoPoint2D, out GeoPoint2D)
Declaration
public override double MaxDist(GeoPoint2D sp, GeoPoint2D ep, out GeoPoint2D mp)
Parameters
Returns
| Type |
Description |
| System.Double |
|
Overrides
|
Improve this Doc
View Source
Modify(ModOp)
Declaration
public override void Modify(ModOp m)
Parameters
| Type |
Name |
Description |
| ModOp |
m |
|
Overrides
|
Improve this Doc
View Source
Orientation(GeoPoint)
Declaration
public override double Orientation(GeoPoint p)
Parameters
Returns
| Type |
Description |
| System.Double |
|
Overrides
|
Improve this Doc
View Source
Declaration
public override GeoPoint2D[] PerpendicularFoot(GeoPoint fromHere)
Parameters
Returns
Overrides
|
Improve this Doc
View Source
PointAt(GeoPoint2D)
Declaration
public override GeoPoint PointAt(GeoPoint2D uv)
Parameters
Returns
Overrides
|
Improve this Doc
View Source
PositionOf(GeoPoint)
Declaration
public override GeoPoint2D PositionOf(GeoPoint p)
Parameters
Returns
Overrides
|
Improve this Doc
View Source
ReverseOrientation()
Declaration
public override ModOp2D ReverseOrientation()
Returns
Overrides
|
Improve this Doc
View Source
SameGeometry(BoundingRect, ISurface, BoundingRect, Double, out ModOp2D)
Declaration
public override bool SameGeometry(BoundingRect thisBounds, ISurface other, BoundingRect otherBounds, double precision, out ModOp2D firstToSecond)
Parameters
Returns
| Type |
Description |
| System.Boolean |
|
Overrides
|
Improve this Doc
View Source
UDirection(GeoPoint2D)
Declaration
public override GeoVector UDirection(GeoPoint2D uv)
Parameters
Returns
Overrides
|
Improve this Doc
View Source
VDirection(GeoPoint2D)
Declaration
public override GeoVector VDirection(GeoPoint2D uv)
Parameters
Returns
Overrides
Explicit Interface Implementations
|
Improve this Doc
View Source
ISurfaceOfRevolution.Axis
Declaration
Axis ISurfaceOfRevolution.Axis { get; }
Returns
|
Improve this Doc
View Source
ISurfaceOfRevolution.Curve
Declaration
ICurve ISurfaceOfRevolution.Curve { get; }
Returns
|
Improve this Doc
View Source
IExportStep.Export(ExportStep, Boolean)
Declaration
int IExportStep.Export(ExportStep export, bool topLevel)
Parameters
| Type |
Name |
Description |
| ExportStep |
export |
|
| System.Boolean |
topLevel |
|
Returns
| Type |
Description |
| System.Int32 |
|
|
Improve this Doc
View Source
IDeserializationCallback.OnDeserialization(Object)
Declaration
void IDeserializationCallback.OnDeserialization(object sender)
Parameters
| Type |
Name |
Description |
| System.Object |
sender |
|
|
Improve this Doc
View Source
ISerializable.GetObjectData(SerializationInfo, StreamingContext)
Implements System.Runtime.Serialization.ISerializable.GetObjectData(System.Runtime.Serialization.SerializationInfo, System.Runtime.Serialization.StreamingContext)
Declaration
void ISerializable.GetObjectData(SerializationInfo info, StreamingContext context)
Parameters
| Type |
Name |
Description |
| System.Runtime.Serialization.SerializationInfo |
info |
The System.Runtime.Serialization.SerializationInfo to populate with data.
|
| System.Runtime.Serialization.StreamingContext |
context |
The destination (System.Runtime.Serialization.StreamingContext) for this serialization.
|
Implements
System.Runtime.Serialization.ISerializable
System.Runtime.Serialization.IDeserializationCallback


Automatic Backup
A dilemma faced by all computer users is saving and crashes, power outages, etc. Some programs (especially word processors) have come up with a way to prevent unsaved work from being lost. CocoaPad includes a method to prevent unsaved work from being lost as well: Automatic Backup.
Automatic Backup, if turned on in the Preferences panel, will backup all documents currently open in CocoaPad at specified intervals (5 minutes by default). Normally, when CocoaPad quits, it deletes the backups. But if a crash, blackout, or other kind of disaster prevents CocoaPad from quitting properly, CocoaPad won't be able to delete the backups. Every time CocoaPad starts up, it checks to see if the backups were deleted or not. If the backups still exist, then CocoaPad will recover the documents, and alert you that you need to re-save these documents.
CocoaPad will only backup documents that are open inside CocoaPad. CocoaPad is not a backup program, and it will not backup, say, your documents folder to a FireWire drive; nor will CocoaPad backup your open Microsoft Excel documents. It will only backup documents that you are working on in the CocoaPad program. |
If you don't want CocoaPad to automatically backup your documents, you can turn this feature off in the Preferences panel. If you choose to enable this feature, then you can also change how often (in minutes) CocoaPad automatically backs up all open documents.
If you set the interval to 0 or less (e.g. "-5"), then you may experience erratic behavior, such as crazy slow typing, the cursor always moving to the end of a document, or not being able to select text. This is due to the fact that with an interval of 0 or less, CocoaPad is trying to backup your documents all the time. Hence, CocoaPad can get a bit confused about other things. We recommend you use a backup interval of 1 minute or longer. |
In order for your changes to the backup interval to take effect, you can either press Return once you're done editing the text, switch to a different preferences tab, or close the window. Otherwise, the old backup interval will still be used until you do one of these three things. |


|
F´ Flight Software - C/C++ Documentation
NASA-v1.5.0
A framework for building embedded system applications to NASA flight quality standards.
|
Sequence event reporting. More...
#include <Svc/CmdSequencer/CmdSequencerImpl.hpp>
Classes | |
| struct | FileReadStage |
| File read stage for error reporting. More... | |
Public Member Functions | |
| Events (Sequence &sequence) | |
| Construct an Events object. More... | |
| void | fileCRCFailure (const U32 storedCRC, const U32 computedCRC) |
| File CRC failure. More... | |
| void | fileInvalid (const FileReadStage::t stage, const I32 error) |
| File invalid. More... | |
| void | fileNotFound (void) |
| File not found. More... | |
| void | fileReadError (void) |
| File read error. More... | |
| void | fileSizeError (const U32 size) |
| File size error. More... | |
| void | recordInvalid (const U32 recordNumber, const I32 error) |
| Record invalid. More... | |
| void | recordMismatch (const U32 numRecords, const U32 extraBytes) |
| Record mismatch. More... | |
| void | timeBaseMismatch (const FwTimeBaseStoreType currTimeBase, const FwTimeBaseStoreType seqTimeBase) |
| Time base mismatch. More... | |
| void | timeContextMismatch (const FwTimeContextStoreType currTimeContext, const FwTimeContextStoreType seqTimeContext) |
| Time context mismatch. More... | |
Public Attributes | |
| PRIVATE | __pad0__: Sequence& m_sequence |
Sequence event reporting.
Definition at line 58 of file CmdSequencerImpl.hpp.
| Svc::CmdSequencerComponentImpl::Sequence::Events::Events | ( | Sequence & | sequence | ) |
Construct an Events object.
| sequence | The enclosing sequence |
Definition at line 61 of file Events.cpp.
| void Svc::CmdSequencerComponentImpl::Sequence::Events::fileCRCFailure | ( | const U32 | storedCRC, |
| const U32 | computedCRC | ||
| ) |
File CRC failure.
| storedCRC | The CRC stored in the file |
| computedCRC | The CRC computed over the file |
Definition at line 68 of file Events.cpp.
| void Svc::CmdSequencerComponentImpl::Sequence::Events::fileInvalid | ( | const FileReadStage::t | stage, |
| const I32 | error | ||
| ) |
File invalid.
| stage | The file read stage |
| error | The error |
Definition at line 81 of file Events.cpp.
| void Svc::CmdSequencerComponentImpl::Sequence::Events::fileNotFound | ( | void | ) |
File not found.
Definition at line 94 of file Events.cpp.
| void Svc::CmdSequencerComponentImpl::Sequence::Events::fileReadError | ( | void | ) |
File read error.
Definition at line 103 of file Events.cpp.
| void Svc::CmdSequencerComponentImpl::Sequence::Events::fileSizeError | ( | const U32 | size | ) |
| void Svc::CmdSequencerComponentImpl::Sequence::Events::recordInvalid | ( | const U32 | recordNumber, |
| const I32 | error | ||
| ) |
Record invalid.
| recordNumber | The record number |
| error | The error |
Definition at line 124 of file Events.cpp.
| void Svc::CmdSequencerComponentImpl::Sequence::Events::recordMismatch | ( | const U32 | numRecords, |
| const U32 | extraBytes | ||
| ) |
Record mismatch.
| numRecords | The number of records in the header |
| extraBytes | The number of bytes beyond last record |
Definition at line 137 of file Events.cpp.
| void Svc::CmdSequencerComponentImpl::Sequence::Events::timeBaseMismatch | ( | const FwTimeBaseStoreType | currTimeBase, |
| const FwTimeBaseStoreType | seqTimeBase | ||
| ) |
Time base mismatch.
| currTimeBase | The current time base |
| seqTimeBase | The sequence file time base |
Definition at line 150 of file Events.cpp.
| void Svc::CmdSequencerComponentImpl::Sequence::Events::timeContextMismatch | ( | const FwTimeContextStoreType | currTimeContext, |
| const FwTimeContextStoreType | seqTimeContext | ||
| ) |
Time context mismatch.
| currTimeContext | The current time context |
| seqTimeContext | The sequence file time context |
Definition at line 163 of file Events.cpp.
| PRIVATE Svc::CmdSequencerComponentImpl::Sequence::Events::__pad0__ |
Definition at line 141 of file CmdSequencerImpl.hpp.


|
DS2482-RK
|
Holds the address and temperature for a single DS18B20 the 1-wire bus. More...
#include <DS2482-RK.h>
Public Member Functions | |
| DS2482Device () | |
| Constructs an empty DS2482Device object. | |
| virtual | ~DS2482Device () |
| Destructor for DS2482Device. | |
| DS2482Device (const DS24821WireAddress &addr) | |
| DS2482Device (const DS2482Device &other) | |
| Constructs a DS2482Device object from another DS2482Device (copy constructor). | |
| DS2482Device & | operator= (const DS2482Device &other) |
| Copies another DS2482Device object values into this one. | |
| String | toString () const |
| void | clear () |
| Clears the address, temperature, and valid flags. | |
| float | getTemperatureC () const |
| Gets the temperature in degrees Celsius. More... | |
| float | getTemperatureF () const |
| Gets the temperature in degrees Fahrenheit. More... | |
| void | setTemperatureC (float value) |
| Sets the temperature in degrees Celsius. More... | |
| bool | getValid () const |
| Gets the valid flag for this temperature reading. More... | |
| void | setValid (bool value) |
| Sets the valid flag. | |
| DS24821WireAddress | getAddress () const |
| Gets a copy of the DS24821WireAddress address. | |
| void | setAddress (const DS24821WireAddress &addr) |
| Sets the 1-wire address. More... | |
Protected Attributes | |
| DS24821WireAddress | addr |
| The 1-wire address (8 bytes) | |
| float | temperatureC |
| The last temperature in degrees Celsius. | |
| bool | valid |
| True if the last temperature read was successful. | |
Holds the address and temperature for a single DS18B20 the 1-wire bus.
This hold the address, the last temperature, and whether the last retrieval was valid or not.
| DS2482Device::DS2482Device | ( | const DS24821WireAddress & | addr | ) |
Constructs a DS2482Device object from a 1-wire address DS24821WireAddress.
|
inline |
Gets the temperature in degrees Celsius.
Note that the resolution depends on the conversion bit settings. It ranges from 1/2 degree (9-bit) to 1/16 degree (12-bit)
|
inline |
Gets the temperature in degrees Fahrenheit.
The DS18B20 uses Celsius internally, so the resolution is reflected in that. The degrees F is the actual converted value and may have more decimal places.
|
inline |
Gets the valid flag for this temperature reading.
When getting a list of temperatures using DS2482GetTemperatureForListCommand, it's possible that not every sensor will return a value. The getValid allows you to figure out which ones are valid.
|
inline |
Sets the 1-wire address.
| addr | The address to set. |
The addr is copied, so it does not need to be preserved after this call completes.
|
inline |
Sets the temperature in degrees Celsius.
| value | Temperature in degrees Celsius (as a float) |
| String DS2482Device::toString | ( | ) | const |
Returns a string representation of this object including the address, temperature, and valid flag.


Sauce thickening calculator
There are several ways to thicken sauces, many of them rely on the ratio of thickening agents to liquid you use. Because I'm lazy, this is a tool for calculating how much you need for a given amount of liquid depending on how thick you want the result.
Note that the default amount is scaled to 300 ml, which is the regular sized cream/heavy cream packages in Norway as they are (were?) in 2022.
| Thickening agent | Thickness | ||
|---|---|---|---|
| Thin | Medium | Thick | |
| Roux - light | Flour: 13.5 g | Flour: 18 g | Flour: 27 g |
| Fat: 9 g | Fat: 12 g | Fat: 18 g | |
| Roux - dark | Flour: 27 g | Flour: 36 g | Flour: 54 g |
| Fat: 18 g | Fat: 24 g | Fat: 36 g | |
| Cornstarch | 6.75 g | 9.5 g | 13.5 g |
| Potato starch | 6.75 g | 9.5 g | 13.5 g |
Notes
Generally
Remember that sauces tend to thicken as they cool down. The temperature you will eat it at will generally be lower than what you cook it at. So, if you like me love thick sauces, but feel that it often becomes too much (because you adjust the thickness while close to boiling), keep this in mind, and test for thickness after letting the sample cool down. For instance let it cool down for a bit longer on the spoon, or drizzle a couple of drops on a (not heated) plate before evaluating thickness.
Also bear in mind that starches thicken largely by having starch particles/molecules evenly dispersed in the liquid and then puffing up by absorbing/binding to the water. While some breaking down is neccessary for this to start being effective, if the starches break down too much, for instance by prolonged cooking or heavy stirring or blending, the thickening effect will be reduced.
For detailed explanations and to get a better idea of what's going on than what you can get out of this brief summary and amalgation of different sources on the net and experience, check out Harold McGee's "On Food and Cooking: The Science and Lore of the Kitchen" chapter about "Sauces thickened with flour and starch" (page 610 in the "First Scribner revised edition 2004" ISBN 978-0-684-80001-1). For traditional starches I think it does a better job of explaining than what you will find in Nathan Myhrvold et al's the "Modernist Cuisine: the Art and Science of Cooking" chapter on thickening with starches (page 20 in volume 4 in "First edition, 2011", ISBN 978-0-9827610-0-7).
Effects of properties of other ingredients on thickening
Salt
Salt (slightly) lowers gelation temperature.
Sugar
Sugar (slightly) increases gelation temperature.
Acidis and alcohol
Acids and alcohols break down starch significantly. So the main effects are that dispersion occurs sooner, gellation at lower temperatures, and the result becomes less viscous/more fluid/less thick.
Starches from roots (for instance potato or tapioca) are more affected by acidity (effects noticeable from pH 5 and lower), while starches derived from grain (for instance wheat or corn) hold up better (effects noticeable from pH 4 and lower).
Roux
| Gelation temperature | 52 ℃ to 85 ℃ |
|---|---|
| Works well with acidis | Yes |
| Works well for being frozen and reheated | Yes |
| Can be cooked for a long time | Yes (stable) |
| Type | Grain starch |
Roux is the combination of fat and flour, cooked before adding cold liquid, or prepared ahead of time and added cold to warm liquid.
Pre-cook it for a longer time on higher heat to get a brown/dark roux. Note that if you cook it longer and/or hotter the starch breaks down more and you need to use more flour to achieve the same effect.
If you prepare it ahead of time, you can cook it untill it is only light/blond, and brown it further by reheating just before you use it.
Starch is what does the magic, so high protein/bread flours result in less thickening.
Much of the thickening is due to the starch absorbing water, so higher moisture/more damp climate calls for more starch/flour.
Note that many source say to use a 1:1 ratio of flour to butter, but this is assuming volume, often tablespoons.
Cornstarch
| Gelation temperature | 62 ℃ to 80 ℃ |
|---|---|
| Works well with acidis | No |
| Works well for being frozen and reheated | No |
| Can be cooked for a long time | Eh (somewhat stable) |
| Type | Grain starch |
Usage: Mix 1 to 1 with cold water before mixing into the hot sauce.
You can use more water, it will thicken more slowly, reducing the chances of lumps. 1 part cornstarch to to 2 parts water is sometimes recommended as a safer amount. But, beware that increasing the amount of water for the slurry not only increases cooking time, but if using substantially more you also should stop and consider if it will dilute the taste.
Some sources say that cornstarch will loose thickening power over time as it is cooked.
Generally cornstarch is supposed ot have about twice the thickening power of flour. However, according to some sources thickening happens most effectively at about 80 ℃ - 85 ℃, signifficantly above the about 50 ℃ to 55 ℃ where the thickening power of flour supposedly realy starts to kick in.
Potato starch
| Gelation temperature | 62 ℃ to 65 ℃ |
|---|---|
| Works well with acidis | No |
| Can be cooked for a long time | No (unstable) |
| Type | Root starch |
Breaks down and looses thickening power if stirred much.
Tapioca (cassava)
| Gelation temperature | 52 ℃ to 65 ℃ |
|---|---|
| Can be cooked for a long time | No (unstable) |
| Type | Root starch |
Lumps and dries in contact with hot air.
Arrowroot
| Gelation temperature | 60 ℃ to 86 ℃ |
|---|---|
| Can be cooked for a long time | No (unstable) |
| Type | Root starch |
Works poorly with dairy.


French Police Detain Truck With 30 Pakistani Migrants – Reports
MOSCOW (Sputnik) - The French police have intercepted in the country’s south a truck carrying 30 migrants of Pakistani origin, French media reported.
The duty prosecutor in the city of Nice told the daily that there were, in particular, three teenagers aboard the vehicle. The conditions in which the migrants were transported remain unknown, according to the Nice Matin newspaper.
The migrants were handed over to the Italian police. The driver, also of Pakistani origin, was handed over to the border police authorities and taken into custody "for facilitating the illegal entry" into France’s territory.
In late October, a truck container with 39 dead bodies was found in UK southeastern Essex county. Police initially believed that the deceased were Chinese citizens but a number of Vietnamese families have since expressed concern that their relatives may be among the dead. Five suspects, including the truck driver, were detained, and three of them were later released on bail.


HA1SemProg19
Blatt 1 —- Polymorphism and Tactics
SemProg SoSe 2019, Set 1
- Please do not change the file name.
- Do not post your solution in any publically available location.
- Please submit on time, late solutions not accepted.
- Before submission, please check from command line if your script compiles. In other words, do run coqc to make sure it accepts your file. If it doesn't, no points can be awarded.
- Please submit only the source file of the solution, i.e., *.v! Compiled output *.vo is useless for submission and will not get you any points. Compile the file for testing, not in order to submit compilation output to me.
- Also, remember it will be run on a different machine which does not have the same folder structure as yours... Please bear this in mind and be careful with using load paths (absolute or relative) in your scripts.
- If you resubmit a solution on StudOn (which is always possible before the deadline), please make sure to delete the old ones! And make sure that the final submission has the right name. Remember all submissions will be downloaded together as a bunch and fed through a script. Having more than one solution from a given person messes up automation.
Set Warnings "-notation-overridden,-parsing".
From Coq Require Import ssreflect ssrbool ssrfun.
From Coq Require Import ssreflect ssrbool ssrfun.
Using ssreflect is not obligatory.
And instead of our list development in the Poly19 chapter, let's go for the standard library ...
From Coq Require Import List.
Import List.ListNotations.
Import List.ListNotations.
... and also, for beq_nat, instead of loading it from Basics19.v ...
Import Nat.
From Coq Require Import Arith.
Notation "x =? y" := (beq_nat x y) (at level 70) : nat_scope.
Notation "x <=? y" := (leb x y) (at level 70) : nat_scope. (* leb comes from Nat *)
From Coq Require Import Arith.
Notation "x =? y" := (beq_nat x y) (at level 70) : nat_scope.
Notation "x <=? y" := (leb x y) (at level 70) : nat_scope. (* leb comes from Nat *)
Exercise 1
Exercise: 3 stars, standard (fold)
Print fold_right.
Careful, in the lecture the order of type arguments was opposite to those in the standard library. For consistency, we flip them here, so it follows the lecture ordering. On the other hand, we do not make type arguments of fold implict: even in the lecture, it has caused us some problems, and in the case of HA below thinking what the type argument should be is often the first step to solve them.

We did length in terms of fold. We can also define map in terms of fold. Finish fold_map
below.
Definition fold_map {X Y: Type} (f: X → Y) (l: list X) : list Y
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Prove that fold_map is correct.
Theorem fold_map_correct : ∀X Y (f : X → Y) (l : list X),
fold_map f l = map f l.
Proof.
(* FILL IN HERE *) Admitted.
fold_map f l = map f l.
Proof.
(* FILL IN HERE *) Admitted.
Similarly ...
Definition fold_flat_map {X Y: Type} (f: X → list Y) (l: list X) : list Y
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Theorem fold_flat_map_correct : ∀X Y (f : X → list Y) (l : list X),
fold_flat_map f l = flat_map f l.
Proof.
(* FILL IN HERE *) Admitted.
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Theorem fold_flat_map_correct : ∀X Y (f : X → list Y) (l : list X),
fold_flat_map f l = flat_map f l.
Proof.
(* FILL IN HERE *) Admitted.
And finally, append itself can be defined in terms of fold
Definition fold_append {X : Type} (l l': list X) : list X
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Theorem fold_append_correct : ∀X (l l' : list X),
fold_append l l' = app l l'.
Proof.
(* FILL IN HERE *) Admitted.
☐
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Theorem fold_append_correct : ∀X (l l' : list X),
fold_append l l' = app l l'.
Proof.
(* FILL IN HERE *) Admitted.
Exercise 2
Exercise: 3 stars, standard (partition)
Use filter to write a Coq function partition:
partition : ∀X : Type,
(X → bool) → list X → list X * list X
Given a set X, a test function of type X → bool and a list
X, partition should return a pair of lists. The first member of
the pair is the sublist of the original list containing the
elements that satisfy the test, and the second is the sublist
containing those that fail the test. The order of elements in the
two sublists should be the same as their order in the original
list.
(X → bool) → list X → list X * list X
Definition partition {X : Type}
(test : X → bool)
(l : list X)
: list X * list X
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example test_partition1: partition odd [1;2;3;4;5] = ([1;3;5], [2;4]).
(* FILL IN HERE *) Admitted.
Example test_partition2: partition (fun x ⇒ false) [5;9;0] = (nil, [5;9;0]).
(* FILL IN HERE *) Admitted.
Print fst.
(test : X → bool)
(l : list X)
: list X * list X
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example test_partition1: partition odd [1;2;3;4;5] = ([1;3;5], [2;4]).
(* FILL IN HERE *) Admitted.
Example test_partition2: partition (fun x ⇒ false) [5;9;0] = (nil, [5;9;0]).
(* FILL IN HERE *) Admitted.
Print fst.
Now prove the following characterization theorems for partition. Warning: you might need some material that is covered at the end of Tactics19.
Theorem partition_fst: ∀(X : Type) (test : X → bool) (l : list X),
fold _ _ andb (map test (fst (partition test l))) true = true.
Proof.
(* FILL IN HERE *) Admitted.
Theorem partition_snd: ∀(X : Type) (test : X → bool) (l : list X),
fold _ _ orb (map test (snd (partition test l))) false = false.
Proof.
(* FILL IN HERE *) Admitted.
☐
fold _ _ andb (map test (fst (partition test l))) true = true.
Proof.
(* FILL IN HERE *) Admitted.
Theorem partition_snd: ∀(X : Type) (test : X → bool) (l : list X),
fold _ _ orb (map test (snd (partition test l))) false = false.
Proof.
(* FILL IN HERE *) Admitted.
Exercise 3
Exercise: 3 stars, standard (combine_after_split)
- make your induction hypothesis general enough
- destruct compound expressions and not lose the information obtained
- remember that not only lists, but also products are inductive datatypes
Theorem combine_after_split : ∀X Y (l : list (X * Y)),
combine (fst (split l)) (snd (split l)) = l.
Proof.
(* FILL IN HERE *) Admitted.
☐
combine (fst (split l)) (snd (split l)) = l.
Proof.
(* FILL IN HERE *) Admitted.
Exercise 4
Exercise: 3 stars, standard (combine_after_split)
Theorem split_after_combine : ∀(X Y:Type) (l1 : list X) (l2 : list Y),
length l1 = length l2 → split (combine l1 l2) = (l1, l2).
Proof.
(* FILL IN HERE *) Admitted.
☐
length l1 = length l2 → split (combine l1 l2) = (l1, l2).
Proof.
(* FILL IN HERE *) Admitted.
Exercise 5: Church addition and multiplication
Exercise: 3 stars, standard (church_numerals)
This exercise explores an alternative way of defining natural numbers, using the so-called Church numerals, named after mathematician Alonzo Church. We can represent a natural number n as a function that takes a function f as a parameter and returns f iterated n times.
Definition nat := ∀X : Type, (X → X) → X → X.
Let's see how to write some numbers with this notation. Iterating
a function once should be the same as just applying it. Thus,
Definition one : nat :=
fun (X : Type) (f : X → X) (x : X) ⇒ f x.
fun (X : Type) (f : X → X) (x : X) ⇒ f x.
Similarly, two should apply f twice to its argument, etc:
Definition two : nat :=
fun (X : Type) (f : X → X) (x : X) ⇒ f (f x).
Definition three : nat :=
fun (X : Type) (f : X → X) (x : X) ⇒ f (f (f x)).
fun (X : Type) (f : X → X) (x : X) ⇒ f (f x).
Definition three : nat :=
fun (X : Type) (f : X → X) (x : X) ⇒ f (f (f x)).
Defining zero is somewhat trickier: how can we "apply a function
zero times"? The answer is actually simple: just return the
argument untouched.
Definition zero : nat :=
fun (X : Type) (f : X → X) (x : X) ⇒ x.
fun (X : Type) (f : X → X) (x : X) ⇒ x.
More generally, a number n can be written as fun X f x ⇒ f (f
... (f x) ...), with n occurrences of f.
Complete the definitions of the following functions. Make sure
that the corresponding unit tests pass by proving them with
reflexivity.
Successor of a natural number:
Definition succ (n : nat) : nat
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example succ_1 : succ zero = one.
Proof. (* FILL IN HERE *) Admitted.
Example succ_2 : succ one = two.
Proof. (* FILL IN HERE *) Admitted.
Example succ_3 : succ two = three.
Proof. (* FILL IN HERE *) Admitted.
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example succ_1 : succ zero = one.
Proof. (* FILL IN HERE *) Admitted.
Example succ_2 : succ one = two.
Proof. (* FILL IN HERE *) Admitted.
Example succ_3 : succ two = three.
Proof. (* FILL IN HERE *) Admitted.
Addition of two natural numbers:
Definition plus (n m : nat) : nat (* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example plus_1 : plus zero one = one.
Proof. (* FILL IN HERE *) Admitted.
Example plus_2 : plus two three = plus three two.
Proof. (* FILL IN HERE *) Admitted.
Example plus_3 :
plus (plus two two) three = plus one (plus three three).
Proof. (* FILL IN HERE *) Admitted.
Example plus_1 : plus zero one = one.
Proof. (* FILL IN HERE *) Admitted.
Example plus_2 : plus two three = plus three two.
Proof. (* FILL IN HERE *) Admitted.
Example plus_3 :
plus (plus two two) three = plus one (plus three three).
Proof. (* FILL IN HERE *) Admitted.
 *). Admitted.
Example mult_1 : mult one one = one.
Proof. (* FILL IN HERE *) Admitted.
Example mult_2 : mult zero (plus three three) = zero.
Proof. (* FILL IN HERE *) Admitted.
Example mult_3 : mult two three = plus three three.
Proof. (* FILL IN HERE *) Admitted.
☐
Example mult_1 : mult one one = one.
Proof. (* FILL IN HERE *) Admitted.
Example mult_2 : mult zero (plus three three) = zero.
Proof. (* FILL IN HERE *) Admitted.
Example mult_3 : mult two three = plus three three.
Proof. (* FILL IN HERE *) Admitted.
Bonus Exercise 6: Church exponentiation
Exercise: 3 stars, advanced (church_exponentiation)
Exponentiation is somewhat more difficult. Hint: Polymorphism plays a crucial role here. However, choosing the right type to iterate over can be tricky. If you hit a "Universe inconsistency" error, try iterating over a different type: nat itself is usually problematic.
 *). Admitted.
Example exp_1 : exp two two = plus two two.
Proof. (* FILL IN HERE *) Admitted.
Example exp_2 : exp three two = plus (mult two (mult two two)) one.
Proof. (* FILL IN HERE *) Admitted.
Example exp_3 : exp three zero = one.
Proof. (* FILL IN HERE *) Admitted.
☐
(* REPLACE THIS LINE WITH ":= _your_definition_ ." *). Admitted.
Example exp_1 : exp two two = plus two two.
Proof. (* FILL IN HERE *) Admitted.
Example exp_2 : exp three two = plus (mult two (mult two two)) one.
Proof. (* FILL IN HERE *) Admitted.
Example exp_3 : exp three zero = one.
Proof. (* FILL IN HERE *) Admitted.
(* Sun Jul 14 22:07:53 MSK 2019 *)


Parent dataset(s) can be zero or more datasets. The latest values of these datasets are passed in as input arguments to the transform function.
In this example, we are creating a transform dataset using a single parent
named Dynamic Websocket
.
Transform function must be a valid JavaScript function. Its arguments are the latest data values from the parent datasets. Further, if state is enabled, the final argument to the function is the current state. The transform function can combine in any manner its arguments and also the state if state is enabled; it should return a javascript object, number or string which is the value of this dataset. The transform function can also update the state as part of its logic.
Transform functions are automatically (re-)invoked when a parent dataset value changes.
Continuing with our example, this transform function takes the current value of the
Dynamic Websocket
dataset
as its first argument, and the current state as its second argument. The state in this example
is initialized to an empty array (see below). Whenever the parent dataset value changes, the
transform function updates the state to ensure that it contains the most recent 200 values of
from the parent dataset.
This transform function also creates a new array by mapping the state and returns this new array.
// x: parent dataset value // s: current state (x, s) => { // if s already has 200 items, delete first item if (s.length === 200) s.splice(0, 1) // push the latest value s.push(x); // create a new array from the state and return it return s.map((v, i) => { return { time: i, sine: v } }); }
If state is enabled, it must be initialized to a valid JavaScript object or array.
In this example, the state is initialized to an empty array.
[]


src/sandbox/Sandbox.js
/**
* Copyright 2016 PT Inovação e Sistemas SA
* Copyright 2016 INESC-ID
* Copyright 2016 QUOBIS NETWORKS SL
* Copyright 2016 FRAUNHOFER-GESELLSCHAFT ZUR FOERDERUNG DER ANGEWANDTEN FORSCHUNG E.V
* Copyright 2016 ORANGE SA
* Copyright 2016 Deutsche Telekom AG
* Copyright 2016 Apizee
* Copyright 2016 TECHNISCHE UNIVERSITAT BERLIN
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
**/
import SandboxRegistry from '../sandbox/SandboxRegistry';
import MiniBus from '../bus/MiniBus';
// import MessageFactory from '../../resources/MessageFactory';
export let SandboxType = {APP: 'app', NORMAL: 'normal', WINDOW: 'window'};
/**
* @author<EMAIL_ADDRESS>* Base class to implement external sandbox component
*/
class Sandbox extends MiniBus {
constructor(capabilities) {
super();
let _this = this;
if (capabilities) { _this.capabilities = capabilities; }
// Add Message Factory
// let messageFactory = new MessageFactory();
// _this.messageFactory = messageFactory;
}
/**
* Deploy an instance of the component into the sandbox.
* @param {string} componentSourceCode Component source code (Hyperty, ProtoStub, etc)
* @param {URL} componentURL Hyperty, ProtoStub, or any other component address.
* @param {Config} configuration Config parameters of the component
* @return {Promise<string>} return deployed if successful, or any other string with an error
*/
deployComponent(componentSourceCode, componentURL, configuration) {
let _this = this;
// let messageFactory = _this.messageFactory;
return new Promise((resolve, reject) => {
//FLOW-OUT: deploy message for the internal SandboxRegistry -> _onDeploy
let deployMessage = {
type: 'create', from: SandboxRegistry.ExternalDeployAddress, to: SandboxRegistry.InternalDeployAddress,
body: { url: componentURL, sourceCode: componentSourceCode, config: configuration }
};
//send message into the sandbox internals and wait for reply
_this.postMessage(deployMessage, (reply) => {
if (reply.body.code === 200) {
//is this response complaint with the spec?
resolve('deployed');
} else {
reject(reply.body.desc);
}
});
});
}
/**
* Remove the instance of a previously deployed component.
* @param {URL} componentURL Hyperty, ProtoStub, or any other component address.
* @return {Promise<string>} return undeployed if successful, or any other string with an error
*/
removeComponent(componentURL) {
let _this = this;
return new Promise((resolve, reject) => {
//FLOW-OUT: un-deploy message for the internal SandboxRegistry -> _onRemove
let removeMessage = {
type: 'delete', from: SandboxRegistry.ExternalDeployAddress, to: SandboxRegistry.InternalDeployAddress,
body: { url: componentURL }
};
//send message into the sandbox internals and wait for reply
_this.postMessage(removeMessage, (reply) => {
if (reply.body.code === 200) {
//is this response complaint with the spec?
resolve('undeployed');
} else {
reject(reply.body.desc);
}
});
});
}
/**
* Matches Sandbox capabilities against provided capabilities. Used to check if sandbox provides all required capabilities
* @param {RuntimeCapabilities} constraints set of RuntimeCapabilities to match with.
* @return {boolean} return true if constraints are matched false otherwise
*/
matches(constraints) {
let _this = this;
let filtered = Object.keys(constraints).filter((key) => {
return !(_this.capabilities[key] && _this.capabilities[key] === constraints[key]);
});
if (filtered.length === 0) { return true; } else { return !(constraints[filtered]); }
}
}
export default Sandbox;


I enjoy creating things that involve
attractive design, elegant code, and a functional user experience.
I tackle my projects armed with tools varying from the C family of languages to my Nikon D3200 (the latter of which helped me create the photograph you're viewing now.)
Pursuing a bachelor's degree in Computer Science from UCSD.
UC GPA: 3.7
Graduation: June 2019
Strong background in Java, C, Python, Apex, Salesforce with vim, Eclipse, and Cocoa environments.
My various extracurricular hobbies include photography, videography, hip hop, soccer, and biking.


Amanita - A. pantherina
After reading a trip report relating to the Amanita Pantherina I have decided to relate my own experience with this nightmare shroom...
1994, Seattle, Wa... I ate the shroom just as I got off of work and began walking home... Arriving at the rooming house I was living in at the time... I went down to my friends basement apartment and drank a a couple beers and had a couple of lines of coke with my friend and this other guy... Everything began to spin, faster and faster... I stumbled out into the basement area and vomited in the laundry sink... I was assisted to my room, everything kept spinning faster and faster until it seemed to cease spinning at all... At this point my normal conciousness ceased... I was floating in blackness, without a body...  I existed in this condition for what seemed to be eternity...
During this period (theres really no way to describe this) I was merely concious of this white light, I could not remember being human, my name, or anything... I was only percieving, floating, in a void... the light, i believe or rather in some strange way felt, was the entire universe and the combination of all of the sounds or rather the combination of all of the vibrations of the entire universe made this harmonic hum... Though I am not really sure how i heard it, as I said, i was not concious of having a body or ears or eyes... after what seemed to be an entire life cycle of the universe I began to remember what had occurred... I remember thinking... 'OH SH@#!!! IM DEAD!!!'... I remembered eating the mushroom... I remember thinking, 'Ill never see my friends and family again!!!'
I remember wondering if I were really dead, and again why i was completely alone... I was never aware of any thing other than myself and the light... and then, gradually in an inexplicable proccess i began to perceive and 're-enter' my body... with the sensation of coming from beneath in darkness as if my body were a shell that concealed a bottomless darkness... struggling climbing back into it... i remember at this point of 'in-betweeness' of perceiving the 'insides' of objects at the same time as the out side (surface)... the substance of the objects seemed to be darkness, or hollow, with a skin of reality on the outside...
Really there is no way to communicate the experience... it changed my life and has cast a major shadow over the years following... i wouldnt recommend this experience to anyone... It was by far the most intense experience of my life to date... tripping on death... part of myself died on that trip... even more horrifying than two boxes of coricidinHBP... More nasty than a whole box of dramamine... And guess what... the shroom was picked right on the UW campus... just across the street from the medical center...
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


The TMAutoOverDrive API call sets TMEX to automatically switch to Overdrive communication speed if the 1-Wire device, 1-Wire network and driver support it. This is done by doing all serial ROM searches at normal 1-Wire speeds and switching to Overdrive speeds when the device is accessed with TMAccess. Automatic Overdrive is selected if the ‘Mode’ is 1 and not selected if ‘Mode’ is 0. Under the following conditions the TMEX driver will switch to Overdrive:
The following conditions will switch the TMEX driver out of Overdrive if communication is currently in Overdrive due to TMAutoOverDrive:
For a description of the above types, see the TMEX Type Descriptions.
Parameters
session_handle
Specifies the session handle returned from the API function TMExtendedStartSession that specifies the desired 1-Wire network port. This parameter is required by most TMEX API functions.
state_buffer
Specifies a pointer to a memory location that TMEX keeps all of the state information for the 1-Wire networks. This parameter is required by most TMEX API functions.
Mode
Specifies Auto-Overdrive mode that is to be selected. A Mode of 1 will indicate that Overdrive speed should be attempted whenever possible. A Mode of 0 will indicate that only normal communication speed should be used.
Return Value
1 => Auto-overdrive mode set
<0 => TMEX Network Error Return Code
See Also


{% extends 'projects/Main.html' %}
{% include 'projects/Navbar.html' %}
{% block content %}
| Employee Name | Check-In Time | Check-Out Time | Hours Utilized | Attendance | Date-Time Created |
|---|---|---|---|---|---|
| {{i.Employee_Name}} | {{i.Time_In}} | {{i.Time_Out}} | {{i.FullHours_Utilized}} | {{i.Mark_Attendance}} | {{i.Date_created}} |


About statsmodels¶
Background¶
The models
module of scipy.stats
was originally written by Jonathan
Taylor. For some time it was part of scipy but was later removed. During
the Google Summer of Code 2009, statsmodels
was corrected, tested,
improved and released as a new package. Since then, the statsmodels
development team has continued to add new models, plotting tools, and
statistical methods.
Testing¶
Most results have been verified with at least one other statistical package: R, Stata or SAS. The guiding principle for the initial rewrite and for continued development is that all numbers have to be verified. Some statistical methods are tested with Monte Carlo studies. While we strive to follow this test-driven approach, there is no guarantee that the code is bug-free and always works. Some auxiliary function are still insufficiently tested, some edge cases might not be correctly taken into account, and the possibility of numerical problems is inherent to many of the statistical models. We especially appreciate any help and reports for these kind of problems so we can keep improving the existing models.
Code Stability¶
The existing models are mostly settled in their user interface and we do not expect many large changes going forward. For the existing code, although there is no guarantee yet on API stability, we have long deprecation periods in all but very special cases, and we try to keep changes that require adjustments by existing users to a minimal level. For newer models we might adjust the user interface as we gain more experience and obtain feedback. These changes will always be noted in our release notes available in the documentation.
Reporting Bugs¶
If you encounter a bug or an unexpected behavior, please report it on
the issue tracker.
Use the show_versions
command to list the installed versions of
statsmodels and its dependencies.
|
List the versions of statsmodels and any installed dependencies |
Financial Support¶
We are grateful for the financial support that we obtained for the development of statsmodels:
Google www.google.com : Google Summer of Code (GSOC) 2009-2017.
AQR www.aqr.com : financial sponsor for the work on Vector Autoregressive Models (VAR) by Wes McKinney
We would also like to thank our hosting providers, github for the public code repository, github.io for hosting our documentation and python.org for making our downloads available on PyPi.
We also thank our current and previous continuous integration providers, Azure, Travis CI and AppVeyor for unit testing, and Codecov and Coveralls for code coverage.
Brand Marks¶
Please make use of the statsmodels logos when preparing demonstrations involving statsmodels code.
Color¶
Horizontal |
|
Vertical |
|
Logo Only |
Monochrome (Dark)¶
Horizontal |
|
Vertical |
|
Logo Only |
Monochrome (Light)¶
Note
The light brand marks are light grey on transparent, and so are difficult to see on this page. They are intended for use on a dark background.
Horizontal |
|
Vertical |
|
Logo Only |


@Markus the "official" answer is:
Some prices are manually excluded from the average, denoted by an asterisk (*) on the markets tab if the price does not seem indicative of a free market price; for example, when an exchange disables withdrawals or deposits, or regulatory conditions make it impossible for anyone else outside of a certain geographical region to buy coins.


|
HyperScale and Missing-Lynx Privacy Policy
ADH Publishing Limited (‘We’) are committed to protecting and respecting your privacy.
This policy sets out the basis on which any personal data we collect from you, or that you provide to us, will be processed by us. Please read the following carefully to understand our views and practices regarding your personal data and how we will treat it.
For the purpose of the Data Protection Act 1998 (the Act), the data controller is ADH Publishing Ltd, Doolittle Mill, Doolittle Lane, Totternhoe, Beds, LU6 1QX, UK
INFORMATION WE MAY COLLECT FROM YOU
We may collect and process the following data about you:
Information that you provide by filling in forms on our site: www.hyperscale.com, www.missing-lynx.com or other related sites (‘our site’). This includes information provided at the time of registering to use our site, subscribing to our service, posting material or requesting further services. We may also ask you for information when you report a problem with our site.
If you contact us, we may keep a record of that correspondence.
We may also ask you to complete surveys that we use for research purposes, although you do not have to respond to them.
Details of transactions you carry out through our site and of the fulfilment of your orders.
Details of your visits to our site [including, but not limited to, traffic data, location data, weblogs and other communication data, whether this is required for our own billing purposes or otherwise] and the resources that you access.
We only share personal information about you with third parties whom we have selected carefully and with whom we have, or may have, a commercial relationship. We comply with the relevant legal requirements and take all reasonable care to ensure that your information is secure and private and is only seen by responsible third parties.
However we cannot be held responsible for the actions of any third party who receives or obtains access to the information, nor for any breach of security.
We will hold your personal information on our systems for as long as you use the service you have requested, and remove it after you no longer wish to continue your registration.
IP ADDRESSES AND COOKIES
We may collect information about your computer, including where available your IP address, operating system and browser type, for system administration and to report aggregate information to our advertisers. This is statistical data about our users’ browsing actions and patterns, and does not identify any individual.
For the same reason, we may obtain information about your general internet usage by using a cookie file which is stored on the hard drive of your computer. Cookies contain information that is transferred to your computer’s hard drive. They help us to improve our site and to deliver a better and more personalised service. They enable us:
To estimate our audience size and usage pattern.
To store information about your preferences, and so allow us to customise our site according to your individual interests.
To speed up your searches.
To recognise you when you return to our site.
You may refuse to accept cookies by activating the setting on your browser which allows you to refuse the setting of cookies. However, if you select this setting you may be unable to access certain parts of our site. Unless you have adjusted your browser setting so that it will refuse cookies, our system will issue cookies when you log on to our site.
Our digital editions are provided by a third-party company which places a third-party cookie on logging in to allow you to read them.
Please note that our advertisers may also use cookies, over which we have no control.
WHERE WE STORE YOUR PERSONAL DATA
The data that we collect from you may be transferred to, and stored at, a destination outside the European Economic Area (‘EEA’). It may also be processed by staff operating outside the EEA who work for us or for one of our suppliers. Such staff maybe engaged in, among other things, the fulfilment of your order, the processing of your payment details and the provision of support services. By submitting your personal data, you agree to this transfer, storing or processing. We will take all steps reasonably necessary to ensure that your data is treated securely and in accordance with this privacy policy.
All information you provide to us is stored on our secure servers. Any payment transactions will be encrypted using SSL technology. Where we have given you (or where you have chosen) a password which enables you to access certain parts of our site, you are responsible for keeping this password confidential. We ask you not to share a password with anyone.
Unfortunately, the transmission of information via the Internet is not completely secure. Although we will do our best to protect your personal data, we cannot guarantee the security of your data transmitted to our site; any transmission is at your own risk. Once we have received your information, we will use strict procedures and security features to try to prevent unauthorised access.
USES MADE OF THE INFORMATION
We use information held about you in the following ways:
To ensure that content from our site is presented in the most effective manner for you and for your computer.
To provide you with information, products or services that you request from us or which we feel may interest you, where you have consented to be contacted for such purposes.
To carry out our obligations arising from any contracts entered into between you and us.
To allow you to participate in interactive features of our service, when you choose to do so.
To notify you about changes to our service.
We may also use your data, or permit selected third parties to use your data, to provide you with information about goods and services which may be of interest to you and we or they may contact you about these by post or telephone.
If you are an existing customer, we will only contact you by electronic means (e-mail or SMS) with information about goods and services similar to those which were the subject of a previous sale to you.
If you are a new customer, and where we permit selected third parties to use your data, we (or they) will contact you by electronic means only if you have consented to this.
If you do not want us to use your data in this way, or to pass your details on to third parties for marketing purposes, please tick the relevant box situated on the form on which we collect your data.
DISCLOSURE OF YOUR INFORMATION
We may disclose your personal information to any member of our group, which means our subsidiaries, our ultimate holding company and its subsidiaries, as defined in section 736 of the UK Companies Act 1985.
We may disclose your personal information to third parties:
In the event that we sell or buy any business or assets, in which case we may disclose your personal data to the prospective seller or buyer of such business or assets.
If ADH Publishing Limited or substantially all of its assets are acquired by a third party, in which case personal data held by it about its customers will be one of the transferred assets.
If we are under a duty to disclose or share your personal data in order to comply with any legal obligation, or in order to enforce or apply our terms of use and other agreements; or to protect the rights, property, or safety of ADH Publishing Limited, our customers, or others. This includes exchanging information with other companies and organisations for the purposes of fraud protection and credit risk reduction.
YOUR RIGHTS
You have the right to ask us not to process your personal data for marketing purposes. We will usually inform you (before collecting your data) if we intend to use your data for such purposes or if we intend to disclose your information to any third party for such purposes. You can exercise your right to prevent such processing by checking certain boxes on the forms we use to collect your data. You can also exercise the right at any time by contacting us at<EMAIL_ADDRESS>Our site may, from time to time, contain links to and from the websites of our partner networks, advertisers and affiliates. If you follow a link to any of these websites, please note that these websites have their own privacy policies and that we do not accept any responsibility or liability for these policies. Please check these policies before you submit any personal data to these websites.
ACCESS TO INFORMATION
The Act gives you the right to access information held about you. Your right of access can be exercised in accordance with the Act. Any access request may be subject to a fee of £10 to meet our costs in providing you with details of the information we hold about you.
Page Created 19 August, 2014
Last updated 19 August, 2014
Back to HyperScale Main Page
Back to Reviews Page |


Graduate Automation Engineer at Transport for NSW
There's an answer
If you reach into your soul
And the sorrow that you know
Will melt away


Creating modern art is easy! Simply specify your desired canvas size and the number of lines you wish to draw, type some text into the box, then watch as your masterpiece is created.
The drawing created is based on the settings and text specified, so the same settings and text will always produce the same drawing.
Multiple drawings added to the same image will stack on top of each other. Simply refresh the page to start a new image.
Dimensions: X
Number of Lines:
Seed:


Module1-Intro to DENTCA
Introduction to the DENTCA System
Module2-Tray Selection
Seleting the correct tray size...
Module3-Impression Making
Impression taking using the DENTCA trays
Module4-Bite Registration
Bite Registration
Module5-Try in Session
Try-in seesion using the 3D printed prototype
Module6-Final Delivery
Final denture delivery
Module7-Single Arch Denture
Single Arch dentures
Module8-Implant Overdentures
Bite registration


# File lib/resque_manager/overrides/resque_status/status.rb, line 44 def counter(counter, uuid) Resque.redis[counter_key(counter, uuid)].to_i end
If multiple workers are running at once and you need an incrementer, you can't use the status' num attribute because of race conditions. You can use a counter and call incr on it instead
# File lib/resque_manager/overrides/resque_status/status.rb, line 40 def counter_key(counter, uuid) "#{counter}:#{uuid}" end
# File lib/resque_manager/overrides/resque_status/status.rb, line 48 def incr_counter(counter, uuid) key = counter_key(counter, uuid) n = Resque.redis.incr(key) if Resque::Plugins::Status::Hash.expire_in Resque.redis.expire(key, Resque::Plugins::Status::Hash.expire_in) end n end
This is the method called by Resque::Worker when processing jobs. It creates a new instance of the job class and populates it with the uuid and options.
You should not override this method, rather the perform
instance method. OVERRIDE to get the worker and set when initiaizing the
class
# File lib/resque_manager/overrides/resque_status/status.rb, line 22 def perform(uuid=nil, options = {}) uuid ||= Resque::Plugins::Status::Hash.generate_uuid worker = yield if block_given? instance = new(uuid, worker, options) instance.safe_perform! instance end
OVERRIDE to clear all the keys that have the UUI. status, counters, etc.
# File lib/resque_manager/overrides/resque_status/status.rb, line 31 def remove(uuid) Resque.redis.zrem(set_key, uuid) Resque.redis.keys("*#{uuid}").each do |key| Resque.redis.del(key) end end


Has this happened to you?
$ node > (0.1 + 0.2) 0.30000000000000004
Ugh! But why?
JavaScript developers are quick to offer advice:
Rather than living in fear, let's look at the data.
Unfortunately, floating point is a deep subject.
Springer has a textbook: Handbook of Floating-Point Arithmetic (1st edition in 2009, 2nd edition in 2018).
The Springer book is over 500 pages, has 9 authors, and costs $150. That's a lot of info about floating-point.
There's stuff to grok about whole numbers.
JavaScript does not have a built-in integer type.
Bytes in little endian order,
| 15 | CD | 5B | 07 | 00 | 00 | 00 | 00 |
= 21 + 205 * 256 + 91 * 2562 + 7 * 2563
= 21 + 52,480 + 5,963,776 + 117,440,512
= 123,456,789
Let's add some "decimal" (oops) places.
Neither C nor JS has a built-in fixed point type.
Bytes in little endian order,
| 15 | CD | 5B | 07 | . | 00 | 00 | 00 | 00 |
= 21 / 2564 + 205 / 2563 + 91 / 2562 + 7 / 256
= 0.02874452364
Compact notation for representing a large range of numbers at the cost of limited precision.
1.234 * 1012 = 1,234,000,000,000
"12" is the exponent, specifies order of magnitude
"1.234" is the mantissa, contains significant digits
We can use scientific notation in base-2.
Single-precision (32-bit) float:
The leading digit is always a 1, so we imply this digit to extend our precision to 24-bits.
Double-precision is 64-bit with 11 exponent bits.
Assuming a leading digit of 1 limits the range of values near zero.
Minimum positive normal value = 2-126
We introduce a convention of Denormals: when the exponent is zero, the mantissa is assumed not to have a leading 1.
Minimum positive denormal value = 2-149
The max exponent (0xFF) is also special.
Mantissa is zero: value is +Infinity or -Infinity (depending on the sign bit)
Mantissa is non-zero: value is NaN
Non-portable, but a C struct can unpack a float using bit fields.
typedef union { float value; // warning: assumes little endian struct { unsigned int mantissa : 23; unsigned int exponent : 8; unsigned int sign : 1; } fields; } float_union;
C lets us coerce types to see the bytes of a float:
assert(sizeof(int) == sizeof(float)); int raw_bytes = *(int*)&test_value; printf("%x\n", raw_bytes);
Alternatively, try an online tool.
Notice that 0.1 cannot be represented precisely:
0.1f = 0x3dcccccd
If this seems strange, consider that in decimal 1/9 cannot be represented precisely either.
1/9 = 0.111111...
This aliasing happens when trying to fit all rational numbers into a fixed denominator.
Bruce Dawson:
double log2_estimate = (*(int*)float_value - 0x3f800000) / double(0x40000000 - 0x3f800000);
Two terms that are used when discussing float accuracy,
Catastrophic Cancellation occurs when the relative error from an operation is more significant than the result.
Bit-wise comparison of floats is typically not what you want.
Robustly testing equality is surprisingly hard.
bool is_relatively_equal(float a, float b, float epsilon = FLT_EPSILON) { return fabs(a - b) <= max(fabs(a), fabs(b)) * epsilon; }
This works okay but beware edge cases when one or both args could be zero.
Results from float ops may vary depending on hardware architecture and compiler settings.
Compilers may offer a setting for strict IEEE 754 compliance, which helps determinism at the cost of reduced performance.
Floating Point Unit (FPU) typically provides settings to control internal precision and rounding, but system API / DLL calls may stomp your changes.
The Decimal type has enhanced precision and limited range.
Jon Skeet has a good C# in Depth article.
Bruce Dawson series on Random ASCII blog
David Goldberg paper (pdf) for Xerox PARC


Saboteur (1942)
In SABOTEUR, Alfred Hitchcock was warming up for his later masterworks such as NORTH BY NORTHWEST. Not that SABOTEUR cannot stand by itself as the work of an expert.
Robert Cummings is a very competent hero. In some scenes in this film, he comes close to the nonchalance that James Stewart brought to many Hitchcock works. Of course a problem for modern viewers may be this nonchalance. Because the era that bred SABOTEUR featured low-key performances, modern audiences may succumb to the ever-present boredom caused by anything without a frenetic pace or overwrought acting. Cummings does not play Barry Kane with an emotional bent fashioned by some method-acting ranter; rather, he skips from problem to problem with typical mid-century stoicism. What needs to be done will be done, one can imagine Cummings saying in an interview.
The premise of the film surfaces in many Hitchcock films. An innocent man – Barry Kane -- is accused of setting a fire to a factory that produces aircraft for the American war effort. What's worse, he's thought to have handed his best buddy an extinguisher filled with gasoline. The buddy perishes. What's the rub? A mysterious character named Fry (Norman Lloyd) is the actual saboteur, but only Kane and his dead friend had contact with this nasty, fox-like man. Soon Kane is on the lam from the law. As in THE FUGITIVE, Kane compounds his legal troubles by escaping: he must be so thoroughly convinced that he will take the rap for this heinous crime of sabotage, treason and murder, that he determines to set off on his own to find Fry and anyone backing him.
On the way, Kane finds refuge in the house of a blind man – who cannot see Kane's handcuffs but somehow senses everything. This man's niece soon enters, and though her uncle instructs her to accompany Kane to a locksmith's to remove the cuffs, she (Priscilla Lane as Patricia Martin). Kane adds kidnapping to his legion of infractions, apparently trusting that everything will turn out in the end. (Of course, part of Hitchcock's genius was in getting everything to turn out satisfactorily for his audiences; he certainly knew what viewers of his time demanded.) More complications ensue, and we spot countless Hitchcockian trademarks – wealthy and respected criminal masterminds, ingenues in jeopardy, American icons used to support suspenseful plot twists.
I think part of the contrived feeling of the plot is the artifice used to set up some of the climactic situations. Exactly why would a saboteur tour the Statue of Liberty after he has damaged an American warship as it launched? Would anyone but a ‘40's film heroine endanger herself by trying to delay or trap this ruthless criminal, and would anyone but the hero try to save this selfsame criminal as he hangs from the hand of Lady Liberty? These people are apparently moral to the core. A minor and interesting agenda involves a further boost to the common man: a truck driver who gives Kane a ride early in his flight from justice surfaces later to assist him in escaping from the very clutches of the cops. It's almost as if Hitchcock is cheering the proletariat, while the monied ne'er-do-wells scheme and plot for the downfall of the war effort, and perhaps even control of the country. (There are definite undercurrents here that attack fascism…)
Nevertheless, we see some stunning camera work and memorable images. Everything Hitchcock touched was in some way artificial, from the California mountains to the massive statue at the end – painted backdrops within studios, or smaller-than-life models. But the use this director makes of his props is amazing.
Perhaps the pace of the film could be tighter in scenes, but every scene does seem necessary. There is even some top-notch comic relief – coming mostly when Kane and Martin are saved from a police search by a caravan full of circus performers.
Pricilla Lane does a very smooth job as Patricia Martin, the headstrong niece of an eminently decent blind man.
For fans of Hitchcock, SABOTEUR is a must-see. It clearly foreshadows his later successes with big names like Cary Grant and James Stewart and Doris Day. And the changes of scenery show that he was a filmmaker on the move, unafraid to use location shots mixed with rear projection and studio fakeries.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Inorder to create a new ec2 instance from the commandline, we first need to know which AMI we want to use. We could pass the option describe-images
to the aws cli and we can get the list. But that would return you a huge list. To list out the images from amazon you can use the following command.
aws ec2 describe-images --owners amazon --filters "Name=platform,Values=Linux1" "Name=root-device-type,Values=ebs"
you can go to the console, get the SubnetID of the ec2 instance you are logged in. you also have to make sure you have a keypair on aws. Try the following command launch your instance.
aws ec2 run-instances --image-id ami-165a0876 --count 1 --instance-type t2.micro --key-name MyKeyPair --security-groups-ids sg-d03bafb7 --subnet-id subnet123abc
It should have provisioned your ec2 instance if you do not have any problems in your command.
Now to terminate instances, all you need to do is grab the instance ids and then type the following command.
aws ec2 terminate-instances --instance-ids [instance id]
Be careful when you issue that command, it will completely destroy your ec2 instance.
| Command | Description |
|---|---|
aws ec2 describe-instances |
will show all the information about your instances |
aws ec2 describe-images |
will show all the information about all the available images. Be aware this will spam your terminal with a never ending list of json |
aws ec2 run-instances |
will create a new instance and launch |
aws ec2 start-instances |
will start a stopped instance |
Dont get confused about start-instances and run-instances start instances will not create a new instance! only run instance would create a new instance. And start instance will only start a stopped instance.


fun NewWalletBirthdayStore(appContext: Context, alias: String = DEFAULT_ALIAS): WalletBirthdayStore
A convenience constructor function for creating an instance of this class to use for
new wallets. It sets the stored birthday to match the newWalletBirthday
checkpoint
which is typically the most recent checkpoint available.
appContext
- the application context.
alias
- the alias to use when naming the preferences file used for storage.


HTML
CSS
jQuery
Java
C / C++
Photoshop
Lightroom
Illustrator
Grunt
Communication
Organization
Learning
Teaching
Collaboration
Management
Planning
Innovation


Node.js v0.10.7 Manual & Documentation
Table of Contents
- DNS
- dns.lookup(domain, [family], callback)
- dns.resolve(domain, [rrtype], callback)
- dns.resolve4(domain, callback)
- dns.resolve6(domain, callback)
- dns.resolveMx(domain, callback)
- dns.resolveTxt(domain, callback)
- dns.resolveSrv(domain, callback)
- dns.resolveNs(domain, callback)
- dns.resolveCname(domain, callback)
- dns.reverse(ip, callback)
- Error codes
DNS#
Stability: 3 - Stable
Use require('dns')
to access this module. All methods in the dns module
use C-Ares except for dns.lookup
which uses getaddrinfo(3)
in a thread
pool. C-Ares is much faster than getaddrinfo
but the system resolver is
more constant with how other programs operate. When a user does
net.connect(80, 'google.com')
or http.get({ host: 'google.com' })
the
dns.lookup
method is used. Users who need to do a large number of lookups
quickly should use the methods that go through C-Ares.
Here is an example which resolves 'www.google.com'
then reverse
resolves the IP addresses which are returned.
var dns = require('dns');
dns.resolve4('www.google.com', function (err, addresses) {
if (err) throw err;
console.log('addresses: ' + JSON.stringify(addresses));
addresses.forEach(function (a) {
dns.reverse(a, function (err, domains) {
if (err) {
throw err;
}
console.log('reverse for ' + a + ': ' + JSON.stringify(domains));
});
});
});
dns.lookup(domain, [family], callback)#
Resolves a domain (e.g. 'google.com'
) into the first found A (IPv4) or
AAAA (IPv6) record.
The family
can be the integer 4
or 6
. Defaults to null
that indicates
both Ip v4 and v6 address family.
The callback has arguments (err, address, family)
. The address
argument
is a string representation of a IP v4 or v6 address. The family
argument
is either the integer 4 or 6 and denotes the family of address
(not
necessarily the value initially passed to lookup
).
On error, err
is an Error
object, where err.code
is the error code.
Keep in mind that err.code
will be set to 'ENOENT'
not only when
the domain does not exist but also when the lookup fails in other ways
such as no available file descriptors.
dns.resolve(domain, [rrtype], callback)#
Resolves a domain (e.g. 'google.com'
) into an array of the record types
specified by rrtype. Valid rrtypes are 'A'
(IPV4 addresses, default),
'AAAA'
(IPV6 addresses), 'MX'
(mail exchange records), 'TXT'
(text
records), 'SRV'
(SRV records), 'PTR'
(used for reverse IP lookups),
'NS'
(name server records) and 'CNAME'
(canonical name records).
The callback has arguments (err, addresses)
. The type of each item
in addresses
is determined by the record type, and described in the
documentation for the corresponding lookup methods below.
On error, err
is an Error
object, where err.code
is
one of the error codes listed below.
dns.resolve4(domain, callback)#
The same as dns.resolve()
, but only for IPv4 queries (A
records).
addresses
is an array of IPv4 addresses (e.g.
['<IP_ADDRESS>', '<IP_ADDRESS>', '<IP_ADDRESS>']
).
dns.resolve6(domain, callback)#
The same as dns.resolve4()
except for IPv6 queries (an AAAA
query).
dns.resolveMx(domain, callback)#
The same as dns.resolve()
, but only for mail exchange queries (MX
records).
addresses
is an array of MX records, each with a priority and an exchange
attribute (e.g. [{'priority': 10, 'exchange': 'mx.example.com'},...]
).
dns.resolveTxt(domain, callback)#
The same as dns.resolve()
, but only for text queries (TXT
records).
addresses
is an array of the text records available for domain
(e.g.,
['v=spf1 ip4:<IP_ADDRESS> ~all']
).
dns.resolveSrv(domain, callback)#
The same as dns.resolve()
, but only for service records (SRV
records).
addresses
is an array of the SRV records available for domain
. Properties
of SRV records are priority, weight, port, and name (e.g.,
[{'priority': 10, {'weight': 5, 'port': 21223, 'name': 'service.example.com'}, ...]
).
dns.resolveNs(domain, callback)#
The same as dns.resolve()
, but only for name server records (NS
records).
addresses
is an array of the name server records available for domain
(e.g., ['ns1.example.com', 'ns2.example.com']
).
dns.resolveCname(domain, callback)#
The same as dns.resolve()
, but only for canonical name records (CNAME
records). addresses
is an array of the canonical name records available for
domain
(e.g., ['bar.example.com']
).
dns.reverse(ip, callback)#
Reverse resolves an ip address to an array of domain names.
The callback has arguments (err, domains)
.
On error, err
is an Error
object, where err.code
is
one of the error codes listed below.
Error codes#
Each DNS query can return one of the following error codes:
dns.NODATA
: DNS server returned answer with no data.dns.FORMERR
: DNS server claims query was misformatted.dns.SERVFAIL
: DNS server returned general failure.dns.NOTFOUND
: Domain name not found.dns.NOTIMP
: DNS server does not implement requested operation.dns.REFUSED
: DNS server refused query.dns.BADQUERY
: Misformatted DNS query.dns.BADNAME
: Misformatted domain name.dns.BADFAMILY
: Unsupported address family.dns.BADRESP
: Misformatted DNS reply.dns.CONNREFUSED
: Could not contact DNS servers.dns.TIMEOUT
: Timeout while contacting DNS servers.dns.EOF
: End of file.dns.FILE
: Error reading file.dns.NOMEM
: Out of memory.dns.DESTRUCTION
: Channel is being destroyed.dns.BADSTR
: Misformatted string.dns.BADFLAGS
: Illegal flags specified.dns.NONAME
: Given hostname is not numeric.dns.BADHINTS
: Illegal hints flags specified.dns.NOTINITIALIZED
: c-ares library initialization not yet performed.dns.LOADIPHLPAPI
: Error loading iphlpapi.dll.dns.ADDRGETNETWORKPARAMS
: Could not find GetNetworkParams function.dns.CANCELLED
: DNS query cancelled.


Couple forced to cancel wedding and honeymoon after home is ruined by flooding
EXCLUSIVE: Claire Ulyett, 40, and Lorna Ulyett, 39, from Bentley in Doncaster, initially did not have flood insurance because they had been quoted up to £10,000, which they could never afford
by Lucy Thornton, https://www.mirror.co.uk/authors/lucy-thornton/A couple had to cancel their wedding and honeymoon after their home was flooded.
Claire Ulyett, 40, and Lorna Ulyett, 39, from Bentley in Doncaster, were due to get married this Spring.
But they had to forget their dream day after being hit by the floods.
Water destroyed their ground floor after it came seeping through the air bricks before they received sandbags.
Despite their own ordeal the couple have been concentrating on helping local residents and the elderly since the floods arrived.
“I've lived here 18 years and was flooded in 2007. We have only been insured for six months,” Claire said.
She said before that quotes for insurance with flood cover were “way out of my budget”.
One claim after the first floods she said was an extraordinary £10,000 but mostly she was quoted between £2,000 and £3,000.
“At the moment we are living upstairs because the insurance company say it's habitable. They won't take action until the danger has passed.
“It's stopped our marriage, we'd paid the deposit for a lodge in Derbyshire for the honeymoon but for now but there are people worse off than us.”
Her partner Lorna, who has damaged her back carrying sandbags around for her neighbours, added: “The response to this has been a joke.
“It was only after the homes were flooded that we got sandbags.
“If it hadn't been for the local community people could have died. The manholes were up.
“We were taking sandbags round in trollies and in wheelie bins. It was the local people who got the elderly out."


It’s January 1st, and so many of us plan on writing more this year.
I’ll ask a few questions here and try to answer them to the best of my ability: What does it mean to write? Why do we feel the need to make the resolution to write more?
Longform writing I’ll define as anything 500 words or more. These are primarily essays, books, blog posts, and anything similar. Shortform writing I’ll define as anything less than 500 words. These are primarily comments, status updates, Tweets, and the like.
Writing, particularly longform, is a calculated and measured synthesis. We take our experiences, thoughts and ideas, and put them on paper. We map our bits of experiences into a cohesive whole. It’s a seemingly simple process, but usually ends up difficult and exhausting.
Creating a habit out of longform writing seems impossible. We usually give up after a few days, a few weeks, or a few months.
Why write longform? Shortform is easy. Tweets, status updates, comments. We have the ability to communicate with our friends, family, heroes, and enemies all in shortform. We are rewarded for this, and pushed to continue doing so. Shortform writing is a good thing overall, I think, as it helps to prevent loneliness and keeps us sharp. It comes natural to us, and feels more like passive entertainment than work.
Writing longform is not something we are directly rewarded for. It doesn’t feel like passive entertainment. It’s difficult because it requires us to the time to communicate with ourselves. I think it is important to pair the two: longform writing and shortform writing.
With only shortform writing, we often hamstring ourselves and make mistakes. Sometimes, we become the direct synthesis of our surroundings.
Let’s take an example of an individual that communicates in primarily shortform:
A few years ago, I met a person, Agent1, that lived entirely on the flow of the networks. It was fascinating. Agent1 didn’t take time to write, but stayed in a constant flow of shortform communication. Images, comments, photography. When alone, they would often panic. Agent1 could not be alone with their thoughts because they completely depended on the networks to synthesize their identity. Free will was an abstraction. All decisions they made (both good and bad), Agent1 saw as an input/output mechanism. This manifested sociopath behavior: lying, large-scale manipulation, bullying. The general pursuit of power and status without acknowledging the self as a moral agent.
It’s an eerie and haunting thought to end up like this.
Writing longform is important for yourself. To synthesize ideas, to explore topics, to make mistakes. It is better to make mistakes privately and figure out exactly where you went wrong. I find that longform writing helps me identify problem areas in my thinking.
It is important to avoid becoming the direct output of your networks. With shortform communication, this is increasingly easier. Our networks can trick us into thinking we’re correct, when in fact, any type of analysis would show otherwise. Writing longform remedies this. It allows us to take vastly different ideas and bridge similarities between them.
We live in an age where all ideas, good and evil, are available for pursuit. Where all individuals have a public comment box. Where our social status is in the cloud. Our identities seemingly spread across public spaces and private chat rooms. Writing longform is a way of staying human in this new space.
Making the resolution to make a habit out of writing longform is making the resolution to be a better person. To take time to sit with ideas. To avoid input/output reactions defined by your networks. To make the active decision to get more out of life. To engage in synthesis to provide unique perspectives on topics you’re interested in.


Demo - Fade Animation
back to article
Previous
Next
CSS for this animation
The CSS file for this animation is available on
GitHub
.


This game lets the user play as a jumping hamster to avoid randomly generated obstacles spinning in a wheel. After reaching 200 points, blocks from the opposite direction are generated as well, making the game much more challenging. The hamster is able to jump on or over the blocks safely, but when the hamster hits a block, it's game over. Once that happens, the player's score is appended to a PostgreSQL database, which is used to display the top 10 high scores on the leaderboard. The database stores all the user's usernames, passwords (which are encrypted using bcrypt), and high scores. Languages and technologies used in this project are: JavaScript, jQuery, Node.js, Express, PostgreSQL, Ajax, HTML, and CSS.
Live Demo | GitHub Repo
As our first project in DigitalCrafts, this Pygame Project reinforced our learning of Python and basic programming logic. In this game, the user controls a chicken using the arrow keys. The chicken must make it across to the end of the map, collecting food items which cause it to increase in size and restore health, while avoiding the wolf. Collision with the wolf will deduct health points from the chicken. At the end of the map, there is a boss which the chicken must defeat using his ability which is triggered by pressing spacebar, which shoots fireballs horizontally.
Live Demo (unavailable) | GitHub Repo
Check out my GitHub to see everything else I've done!


Messenger Yeti:
Your application was received. We plan to make an announcement one hour before the game starts as to whether you were successfully registered or not. Don't forget to check back.


Gateway
BOT
12-Nov-19 04:38 PM
[telegram] <greatoooo> HUOBI pumping...
[telegram] <greatoooo> Korea boss building his chip
[telegram] <Stockwinner> KMD will be the best cryptocurrency and platform for the future digital world
[telegram] <Stockwinner> look at this: Komodo to lead blockchain revolution with quantum-safe cryptography
By Naushad K. Cherrayil 4 hours ago World Of Tech
Creates key using IBM’s Dilithium digital signature algorithm that cannot be cracked by a quantum computer
(edited)
Creates key using IBM’s Dilithium digital signature algorithm that cannot be cracked by a quantum computer
[telegram] <Ggokhangark> Binance will pump to 1180 too. Lets look-) (re @greatoooo: HUOBI pumping...)
[telegram] <Stockwinner> how can we see the real value of KMD ?
[telegram] <Instel7> https://komodoplatform.com/technology/ (re @Stockwinner: how can we see the real value of KMD ?)
Komodo is an open, composable Smart Chain platform with industry-leading blockchain technology. Learn more about Komodo's technology and offerings here.
[telegram] <Stockwinner> it's so cheap to buy and hold it as gold assets in the future .
(edited)
[telegram] <greatoooo> agree
[telegram] <Stockwinner> I think KMD will become a bitcoin 2.0 in very near future
[telegram] <Caleb> Has anyone actually received factual intel that what’s going on right now is a PnD?
[telegram] <greatoooo> BITTREX is still relatively cheap now, I just used up the last BTC, all bought KMD
[telegram] <Acura360> To the new ones here:
Did you know that you get 5.1% annual rewards in your wallet on hodling Komodo's?
(edited)
[telegram] <EPIDEMIC_media> Are binance wallets still disabled? (re @Caleb: Has anyone actually received factual intel that what’s going on right now is a PnD?)
[telegram] <Caleb> I have no idea (re @EPIDEMIC_media: Are binance wallets still disabled?)
[telegram] <Stockwinner> you are right . I just bought more 5000 kmd and hold it on my cold wallet (re @greatoooo: BITTREX is still relatively cheap now, I just used up the last BTC, all bought KMD)
(edited)
[telegram] <Caleb> All I know is I’ve been trying to buy it up slowly for cheap... trying to decide if I should go all in or wait.
[telegram] <greatoooo> I personally think that it is worth at least $50.
[telegram] <greatoooo> It is seriously underestimated, of course, for those of us who understand it, this is an opportunity.
[telegram] <Stockwinner> it's correct . I think KMD will be chosen as leading coins because of quantum computer released out in the past days . (re @greatoooo: It is seriously underestimated, of course, for those of us who understand it, this is an opportunity.)