|
Michigan
FRC State Championship |
4/14/2012 - 4/14/2012 |
|||
|
Award |
Team |
Team Name |
Person |
Home Town |
|
Regional
Chairman's Award |
33 |
Chrysler
LLC/The Chrysler Foundation/BAE Systems/TI Automotive/JDM Consulting &
Notre Dame Preparatory School |
|
Auburn
Hills, MI, USA |
|
Regional
Chairman's Award |
503 |
Magna
Seating Systems & Novi High School |
|
Novi,
MI, USA |
|
Regional
Chairman's Award |
27 |
BorgWarner/The
Chrysler Foundation/Mclaren Health Care/BAE
SYSTEMS/Clarkston Dermatology/Smith's Disposal/Chaos System, Inc/Recticel North America
Inc./Guardian Industries/Magna Powertrain/Applied Manufacturing Technologies/Genisys Credit Union & Clarksto |
|
Clarkston,
MI, USA |
|
FIRST
Dean's List Finalist Award #1 |
3538 |
jcpenney & Avondale High
School |
Jaris Dingman |
Auburn
Hills, MI, USA |
|
FIRST
Dean's List Finalist Award #2 |
548 |
General
Motors / AVL / Marathon Petroleum Company / Infineon / AIAG & Northville
High School |
Claire
Goolsby |
Northville,
MI, USA |
|
FIRST
Dean's List Finalist Award #3 |
2834 |
Chrysler
Foundation/HBL/PTC/BAE Systems/MetroPCS &
Andover High School & Lahser High School |
Ryan
Hoyt |
Bloomfield
Hills, MI, USA |
|
FIRST
Dean's List Finalist Award #4 |
33 |
Chrysler
LLC/The Chrysler Foundation/BAE Systems/TI Automotive/JDM Consulting &
Notre Dame Preparatory School |
Andrew
Palardy |
Auburn
Hills, MI, USA |
|
FIRST
Dean's List Finalist Award #5 |
862 |
Robert
Bosch LLC & Plymouth-Canton Educational Park |
Ian
Pudney |
Canton,
MI, USA |
|
FIRST
Dean's List Finalist Award #6 |
1684 |
Lapeer
Community Foundation/Rotary Club of Lapeer/Cypress Computer Systems Inc./Robolytics & Lapeer High Schools |
Matthew
Wagner |
Lapeer,
MI, USA |
|
Engineering
Inspiration Award |
1718 |
Ford
Motor Company / The Chrysler Foundation / Master Pneumatic, Inc / Miljoco Corporation /
Richmond Rotary / NuStep, Inc
/ jcpenney & The Macomb Academy of Arts &
Sciences |
Armada,
MI, USA |
|
|
Regional
Winners #1 |
469 |
AVL
/ AI / General Motors / Nissan / Norgren, Inc. /
Eco-Bat / QUEXCO / Solidworks / Anixter /
Copeland-Gibson / Stylmark / Koshido
Design / Gorman's Gallery / Lawrence Technological University &
International Academy |
Bloomfield
Hills, MI, USA |
|
|
Regional
Winners #2 |
67 |
General
Motors Milford Proving Ground & Huron Valley Schools |
Milford,
MI, USA |
|
|
Regional
Winners #3 |
830 |
Maker
Works/University of Michigan/Toyota Technical Center/BAE Systems & Ann
Arbor Huron High School |
Ann
Arbor, MI, USA |
|
|
Regional
Winners #4 |
||||
|
Regional
Finalists #1 |
2054 |
General
Motors Grand Rapids/Midway Chevrolet of Plainwell/Grand Allegan Chevrolet
& Hopkins High School |
Hopkins,
MI, USA |
|
|
Regional
Finalists #2 |
548 |
General
Motors / AVL / Marathon Petroleum Company / Infineon / AIAG & Northville
High School |
Northville,
MI, USA |
|
|
Regional
Finalists #3 |
245 |
GM
Global Product Operations/Chrysler Foundation/Plex
Systems, Inc./SAIC & Rochester Adams and Stoney
Creek High Schools |
Rochester
Hills, MI, USA |
|
|
Regional
Finalists #4 |
||||
|
Coopertition
Award |
3568 |
SRT
& Linden High School |
Linden,
MI, USA |
|
|
Creativity
Award sponsored by Xerox |
2767 |
Stryker/PTC
& Kalamazoo Regional Educational Service Agency |
Kalamazoo,
MI, USA |
|
|
Engineering
Excellence Award sponsored by Delphi |
51 |
GM
Powertrain Group/Delphi/Chrysler Foundation/BAE Systems & Pontiac High
School |
Pontiac,
MI, USA |
|
|
Entrepreneurship
Award sponsored by Kleiner Perkins Caufield and Byers |
245 |
GM
Global Product Operations/Chrysler Foundation/Plex
Systems, Inc./SAIC & Rochester Adams and Stoney
Creek High Schools |
Rochester
Hills, MI, USA |
|
|
Coopertition
Award |
302 |
The
Chrysler Foundation/BAE Systems/GM Orion Assembly Center/Inalfa
Roof Systems/United Healthcare & Lake Orion High School |
|
Lake
Orion, MI, USA |
|
Gracious
Professionalism Award sponsored by Johnson & Johnson |
2137 |
NASA
/ Valeo / Inacomp / KMT
Robotic Solutions / Kettering University / Beijing Channel Consultants &
Oxford Community Schools |
Oxford,
MI, USA |
|
|
Highest
Rookie Seed |
4294 |
Siemens
/ ZAP! Creative Services / Martin Thomas Builders / Lansing Learning / Holt
& Dimondale Insurance Agency / Demmer
Corporation / Holder Corporation / ALRO / Mid-states Bolt & Screw /
Tech-Smith / FIRST / SRT & The Early College @ Lansing Community |
Lansing,
MI, USA |
|
|
Imagery
Award in honor of Jack Kamen |
2246 |
U.S.
FIRST / Trend Services / Mayfair Plastics / Zaremba
Equipment Inc. & Johannesburg High School |
Johannesburg,
MI, USA |
|
|
Industrial
Design Award sponsored by General Motors |
67 |
General
Motors Milford Proving Ground & Huron Valley Schools |
Milford,
MI, USA |
|
|
Industrial
Safety Award sponsored by Underwriters Laboratories |
2337 |
General
Motors/Premier Tooling Systems/Chrysler Foundation/Davison Tool &
Engineering, L.L.C. & Grand Blanc High School |
Grand
Blanc, MI, USA |
|
|
Innovation
in Control Award sponsored by Rockwell Automation |
469 |
AVL
/ AI / General Motors / Nissan / Norgren, Inc. /
Eco-Bat / QUEXCO / Solidworks / Anixter /
Copeland-Gibson / Stylmark / Koshido
Design / Gorman's Gallery / Lawrence Technological University &
International Academy |
Bloomfield
Hills, MI, USA |
|
|
Quality
Award sponsored by Motorola |
2337 |
General
Motors/Premier Tooling Systems/Chrysler Foundation/Davison Tool &
Engineering, L.L.C. & Grand Blanc High School |
Grand
Blanc, MI, USA |
|
|
Rookie
All Star Award |
4130 |
SRT
& Richmond High School |
Richmond,
MI, USA |
|
|
Rookie
Inspiration Award |
4294 |
Siemens
/ ZAP! Creative Services / Martin Thomas Builders / Lansing Learning / Holt
& Dimondale Insurance Agency / Demmer
Corporation / Holder Corporation / ALRO / Mid-states Bolt & Screw /
Tech-Smith / FIRST / SRT & The Early College @ Lansing Community |
Lansing,
MI, USA |
|
|
Team
Spirit Award sponsored by Chrysler |
1023 |
Bill
& Cheryl Sommers / Townsend Carpeting /
La-Z-Boy Inc. / Avaya / Buckeye Cable Systems / VDS / OTP Industrial
Solutions / ORT / ProMedica / RD Tool & Manufacturing / Steel Tool &
Engineering & Bedford High School |
Temperance,
MI, USA |
|
|
Volunteer
of the Year |
||||
|
Website
Award |
245 |
GM
Global Product Operations/Chrysler Foundation/Plex
Systems, Inc./SAIC & Rochester Adams and Stoney
Creek High Schools |
Rochester
Hills, MI, USA |
|
|
Woodie
Flowers Finalist Award |
1023 |
Bill
& Cheryl Sommers / Townsend Carpeting /
La-Z-Boy Inc. / Avaya / Buckeye Cable Systems / VDS / OTP Industrial
Solutions / ORT / ProMedica / RD Tool & Manufacturing / Steel Tool &
Engineering & Bedford High School |
Debbie
May |
Temperance,
MI, USA |
|
Judges'
Award #1 |
2591 |
The
Boeing Company / General Motors Foundation / BAE Systems / United States Air
Force / Michigan Engineering Zone / University of Michigan School of
Engineering & Davis Aerospace Technical High School & Detroit Public
Schools |
Detroit,
MI, USA |
|
Match scheduling software © 2007 Idle Loop Software Design, LLC. |
|
|
FIRST— For Inspiration and Recognition of Science and Technology |
Copyright © 2012 FIRST |
|
|
Data brought to you by 4FX Design |
|


There are various opinions on how to implement Java standard’s Object.equals(Object)
method.
According to some, it should be possible to compare different implementations of the same interface or base class.
But to follow this policy, each interface or base class’s javadoc must define the algorithms that all implementations
shall use for their equals(Object)
and hashCode()
methods.
This approach is common in java.util.Collection
and its child interfaces.
Transferring this approach to certain GeoAPI interfaces, however, would be a difficult task,
and would probably not be followed in many implementations.
Moreover, it comes at the expense of being able to take into account supplementary attributes in the child interfaces,
unless this possibility has been specified in the parent interface.
This constraint arises from the following points of the equals(Object)
and hashCode()
method contracts:
A.equals(B)
implies B.equals(A)
(symmetry);A.equals(B)
and B.equals(C)
implies A.equals(C)
(transitivity);A.equals(B)
implies A.hashCode() == B.hashCode()
.
For example, these three constraints are violated if A (and eventually C) can contain attributes
which B ignores.
To bypass this problem, an alternative approach is to require that the objects compared by the
Object.equals(Object)
method be of the same class; in other words, A.getClass() == B.getClass()
.
This approach is sometimes regarded as contrary to the principles of object oriented programming.
In practice, for relatively complex applications, the important accorded to these principles depends on the context
in which the objects are compared:
if the objects are added to a HashSet
or used as keys in a HashMap
,
we would need a stricter adherence to the equals(Object)
and hashCode()
contract.
But if the developer is comparing the objects his- or herself, for example to check that the relevant information has been changed,
then the constraints of symmetry, transitivity or coherence with the hash values may be of little interest.
More permissive comparisons may be desirable, sometimes going so far as to tolerate minor discrepancies in numerical values.
In order to allow developers a certain amount of flexibility, many classes in the SIS
library implement the org.apache.sis.util.LenientComparable
interface,
which defines a equals(Object, ComparisonMode)
method.
The principle modes of comparison are:
STRICT
— The objects compared must share the same class and have exactly equal attributes,
including any possible public attributes specific to the implementation.
BY_CONTRACT
— The objects compared must implement the same GeoAPI (or other standard)
interface, but need not be of the same implementation class.
Only the attributes defined in the interface are compared;
all other attributes specific to the implementation — even if they are public — are ignored.
IGNORE_METADATA
— Like BY_CONTRACT
,
but only compares attributes that influence the operations (numeric calculations or otherwise) performed by the object.
For example, in a geodesic datum, the longitude (in relation to Greenwich) of the original meridian
would be taken into account, while the name of the meridian would be ignored.
APPROXIMATIVE
— Like IGNORE_METADATA
,
but tolerates minor discrepancies in numerical values.
The default mode, used in all equals(Object)
methods in SIS,
is STRICT
. This mode is chosen for a safe operation — particularly with HashMap
—
without the need to rigorously define equals(Object)
and hashCode()
operations in every interface.
With this mode, the order of objects (A.equals(B)
or B.equals(A)
) is unimportant.
It is, however, the only mode that offers this guarantee.
In the expression A.equals(B)
, the BY_CONTRACT
mode
(and so by extension all other modes that depend on it) only compares the properties known to A
,
regardless of whether B
knows more.


bold orange
= syntax. orange
= example. italics
= placeholder. Things in []
are optional. Things in {}
are mandatory.
Pragma
pragma solidity ^{version};
pragma solidity ^0.4.25;
Comments
// one liner
/* multi liner */
/// Natspec one liner
/** Natspec multi liner **/
Simple data types
type [public] [constant] name;
uint public amount;
delete amount;
- deletes variable content
Getters are automatically generated for public
vars. constant
vars have to be initialized on declaration.
Basic types
bool
,
int
(int256
alias),
uint
(uint256
alias),
byte
(bytes1
alias)
Ints and uints also as int8
- int256
in steps of 8.
Bytes also as bytes1
- bytes32
in steps of 1.
String
string [storage|memory] [public] name;
string memo;
Bytes
bytes [storage|memory] [public] name;
bytes public myBytes;
myBytes.length;
- get bytes length
myBytes.push(hex"ff");
- append byte
Address type
address [public] name;
address addr;
addr.balance
addr.transfer(100)
- sends 100 wei, forwards 2300 gas, throws on error
addr.send(100)
- sends 100 wei, forwards 2300 gas, returns true/false
addr.call('func_signature', [argument, ...])
- calls func_signature function and passes rest of the arguments to it
addr.delegatecall('func_signature', [argument, ...])
- same as call but evaluation context is set to current context
Structs
struct name { [member; ... ] };
struct Person {
string name;
int age;
}
Person customer;
customer = Person({ name: 'Mr. Nobody', age: 1 });
customer2 = Person('Mr. Nobody', 1);
customer.name;
customer.age = 99;
Arrays
type[size] [memory|storage] [public] name;
int[5] myArray;
int[] anotherArray;
- dynamic array
delete myArray;
- clears array's content
myArray.length;
- get array's length
myArray.push(1);
- push new element to array
myArray[3];
- get element
myArray[3] = 8;
- set element
uint[] memory myArray = new uint[](5);
- memory array with size determined at runtime. Memory arrays can't have dynamic size
Mappings
mapping(key_type => value_type) [public] name;
mapping (address => int) funds;
funds[address] = 33;
- set value
funds[address];
- retrieve value
Simple types can be used as keys. Any types can be used as values.
All possible mapping keys always exists and have a default byte value of all zeroes.
Can't be iterated, checked for length, retrieve which keys were set etc. Also can't be created in memory.
Flow control
if (condition) { ... };
if (condition) { ... } else { ... };
for (declaration; condition; expression) { ... };
for (uint counter; counter < 10; counter++) { ... };
while (condition) { ... };
do { ... } while (condition);
condition ? expression : expression;
continue
, break
and return
can be used to influence flow.
Enums
enum name { [state, ...] };
enum Mood { Happy, Anxious, Sad };
Mood dogMood;
dogMood = Mood.Happy;
Imports
import "path";
import * as name from "path";
import { name as alias|name, ... } from "path";
import "path" as namespace;
All paths are relative.
Flow control
if (condition) { ... };
if (condition) { ... } else { ... };
for (declaration; condition; expression) { ... };
for (uint counter; counter < 10; counter++) { ... };
while (condition) { ... };
do { ... } while (condition);
condition ? expression : expression;
continue
, break
and return
can be used to influence flow.
Imports
import "path";
import * as name from "path";
import { name as alias|name, ... } from "path";
import "path" as namespace;
All paths are relative.
Contract declaration
contract Memo {
string public memo;
address owner;
constructor(string _memo) public {
memo = _memo;
address = msg.sender;
}
function changeMemo(string newMemo) public onlyOwner {
memo = newMemo;
}
modifier onlyOwner {
require(msg.sender == owner);
_;
}
}
Memo memo = new Memo("my precious memo");
- create new contract
Memo memo = Memo(existingMemoAddress);
- intialize already existing contract
this;
- current contract
address(this);
- converts contract to address
selfdestruct(ownerAddress);
- destroys contract and sends it's funds to address. Must be called from contract.
Functions
function name([argument, ...]) [visibility] [view|pure] [payable] [modifier, ...] [returns([argument, ...])];
function setName(string name) public { ... };
function getName() view public returns(string name) { ... };
function compute() private returns(int num1, int num2) { ... };
compute();
- function call
compute.value(300).gas(4000)();
- call a func, send some ether along, and set it's gas limit
Visibility can be
public
,
private
,
internal
,
external
view
func doesn't modify blockchain anyhow.
pure
func doesn't modify or read blockchain.
payable
func can receive ether.
Inheritance
contract name is [ancestor, ... ] { ... };
super.function();
- call func from first ancestor
SpecificAncestor.function();
- call func from specific ancestor
Ancestor contructors
contract Derived is Base(7) { ... };
- pass a static value to ancestor constructor
constructor(uint _y) Base(_y * _y) public {};
- pass a dynamic value
All ancestor constructors are called upon contract initialization and all needs to have theirs arguments set in one of the ways above.
require / revert / assert
require(condition,[message])
- use for public facing assertions
revert([message])
assert(condition)
- use for internal assertions
All of these throw an error and revert current transaction.
Inline assembly
assembly { ... }
- block with inline assembly to get closer to EVM
Deprecations
constant
- function modifier
year
- time literal suffix
throw
- alias to revert
block.blockhash(block_number);
- replaced by global blockhash(block_number);
msg.gas
- replaced by global gasleft();
suicide
- alias to selfdestruct(address)
keccak256(a, b)
- deprecated in favor ofkeccak256(abi.encodePacked(a, b))
callcode
Literals and globals
wei
,
finney
,
szabo
,
ether
- literal number suffixes for transfering numbers to wei
1000 finney == 1 ether
seconds
,
minutes
,
hours
,
days
,
weeks
- literal number suffixes for transfering numbers to miliseconds
60 seconds == 1 minutes
block.{method}
- current block info
block.number
block.gaslimit
... and more
msg.{method}
- various calldata
msg.gas
msg.sender
... and more
tx.{method}
- current transaction
tx.gasprice
tx.origin
abi.{method}
- encoding methods
abi.encode(arguments)
abi.encodePacked(arguments)
... and more
Cryptographic funcs
keccak256([argument, ...]);
sha256([argument, ...]);
ripemd160([argument, ...]);
Others
this;
- current contract
now;
- current time
gasleft();
- remaining gas
Function Modifiers
modifier name([argument, ...]) { ... _; ... }
modifier onlyOwner {
require(msg.sender == owner);
_;
}
_;
- marks where modified function call will run.
Usage
function a(int num) public onlyOwner { ... }
function b(int num) public onlyOwner, secondModifier { ... }
Passing arguments
function c(int num) public anotherModifier(num) { ... }
Events
event name([argument, ...]) [anonymous];
emit name([argument, ...]);
event FundTransfer(address indexed to, uint value);
emit FundTransfer(someAddress, 100);
indexed
arguments can be used for filtering later. anonymous
event can't be filtered for by it's name.
Interfaces
interface AbstractZombie {
function feedOn(address target) public onlyOwner;
function getLevel() public view returns(uint level) onlyOwner;
}
Interfaces are like abstract contracts which other contracts can inherit. Inheriting contract has to implement all interface methods.
Interfaces can't contain anything else than function signatures.
Libraries
library MyLibrary {
function add(int1 num, int num2) view returns(int result) {
return num1 + num2;
}
}
contract Number {
int num;
using MyLibrary for int;
function addTwo() public {
num = num.add(42);
}
}
In the code above functions from MyLibrary can be called directly on all int
s. The variable itself is then passed as a first argument to the library func.
Library functions can also be called statically as MyLibrary.add(40, 2);
. It's not needed to use using
clause then.
Code in library is executed in caller's context and libraries thus see and can manipulate local state.


Hi there, I'm Michael. I'm taking a break from full-time employment to expand my skillset and complete a long-standing goal of programming full-time.
My objectives are:
In Progress - Full-Stack ProgramOption: Ruby/React
2011 - B.S. - Liberal StudiesOption: New Media Communications
4 years project management focused on ecommerce web development within agencies and freelance.
2 years freelance web development experience.
5 years internal, agency, and freelance digital marketing experience
You're lookin' at it; holy recursion, Batman!
A showcase of Bootstrap and CSS.
Practice with inheritance and cascading styles in CSS.
Practice with the box model.
Practice with floats on images and sidebars.
Practice with CSS classes.
A Wordpress site for everything music & arts related in the Portland area.
A Wordpress site that served as your Guide to Portland Entertainment and #PDXmusic.


com.javathinking.batch is a simple codebase for batch processing. It was created to prototype and demonstrate several concepts quickly to evaluate their usefulness from a simplicity and pragmatic viewpoint.
An example application to exercise the concepts is in the example package. Also see packages


Translate French to English
Translation quality is currently fairly low, esp. for short phrases.
See below for random example sentence.
French
Ex:
Translate
Loading...
English


Programme
If you would like to download a pdf version of the itinerary, you can find it
here
.
The Abstract book is available for download
here
.


I'm a third year Computer Science student at the University of Waterloo in Waterloo, Canada.
This past fall, I was a software engineering intern at Accenture in Toronto, Canada where my team and I built a blockchain network for verifying the authenticity of high-value designer goods. The winter before that I interned as a full stack developer at Hyalto in Ottawa, Canada. I did my very first co-op term at LoyaltyOne in Toronto, Canada where I worked as a service desk representative.
I'm also the Vice President of Technology for The GoldenHack, a business hackathon based out of Wilfrid Laurier University in Waterloo, ON.
In my spare time, I strive to be an active member of my community. This fall, I volunteered with Girl Guides of Canada where I helped lead a group of Brownies (adorable 7-8 year olds!) in learning, fun, and yes, cookies.
I also love podcasts so much I decided to join one. Listen to me speak about nerdy space stuff on episodes 173, 174, and 175 of The Star Spot.
At the moment, this is my favourite book, this is my favourite movie, and this is my favourite Tiny Desk Concert.


InDesign, Illustrator, Photoshop
During my time at Georgia Tech, I have been a member of the Ramlin' Reck Club since Spring 2013. Through this involvement, I had the opportunity to be involved with the creation of the Georgia Tech T-Book, a 160 page publication describing the history, traditions, athletics, student involvement, and alumni connections at Tech that is distributed to pver 5,000 incoming students every Fall. I served as coeditor of the 2013 and 2014 T-Books and Editor and Chair of the 2015 T-Book. These roles required me to work with historians, student photographers, and publishers to manage all aspects of designing, assembling, printing, and distributing this publication. As Chair, I was head of the T-Book committee and managed a staff of 5-10 people responsible for helping me find relevant pictures and stories to keep the T-Book up to date each year. I am most proud of my successful efforts to include extended sections on student involvement and current opportunities in and around campus in the most recent publication in accordance with the campus Mental Health Initiative.
The vast majority of the work for this publication was completed in InDesign. I also used Illustrator and Photoshop for the cover design and photo editing. In working with the publisher, I was able to gain experience in paper selection, cover preparation, and submission of files for large scale publications.


{%extends 'base-inner.html' %} {% block title %} Delegate Summaries {% endblock title %} {% block content %}
Here you can provide a brief a summary of each delegate and their performace over the conference weekend.


BC Command Line Usage
Environment
-
$> ALIAS=alice ./bc
Sets the alias for BC to load from the keystore.
-
$> ROOT_DIRECTORY=/tmp/foobar ./bc
Sets the root directory for BC to use.
-
$> CACHE_DIRECTORY=/tmp/cache ./bc
Sets the directory for BC to use for caching.
-
$> LIVE=true ./bc
Sets the live flag for BC.
-
$> KEYS_DIRECTORY=~/keys ./bc
Sets the directory for BC to use for storing keys.
-
$> CERTIFICATE_DIRECTORY=~/certificates ./bc
Sets the directory for BC to use for storing certificates.
-
$> LOG_DIRECTORY=/tmp/logs ./bc
Sets the directory for BC to use for logging.
-
$> PASSWORD=password1234 ./bc
Sets the password for BC to unlock the private key from the keystore.
Note: This is NOT advisable as your password will be stored in the command history, it is more secure to enter your password at the prompt.
-
$> PEERS=bc.aletheiaware.com,foobar.com ./bc
Sets the peers for BC to communicate with.
Commands
-
$> ./bc
Displays usage.
-
$> ./bc init
Initializes environment, generates keys, and registers alias.
Choose a unique alias and a password of at least 12 characters and generate a 4096bit RSA key pair consisting of a public key (which will be registered with your account) and a private key (which does not leave your possession).
$> ./bc init
Creating keystore under /Users/username/bc
Enter keystore password:
Confirm keystore password:
Generating RSA 4096 Public/Private Key Pair
Successfully Created Key Pair
...
...
Initialized as username
-
$> ./bc node
Display registered alias and public key.
-
$> ./bc alias [alias]
Displays the public key registered with the given alias.
-
$> ./bc mine [channel] [threshold] [access...]
Reads data from stdin and mines a new block in the given channel to the given given threshold. If the access list is empty the payload is unencrypted, else the payload is encrypted and the listed aliases are granted access.
-
$> ./bc head [channel]
Displays the head of the given channel.
-
$> ./bc block [channel] [hash]
Displays the block in the given channel with the given hash.
-
$> ./bc record [channel] [hash]
Displays the record in the given channel with the given hash.
-
$> ./bc pull [channel]
Pulls the given channel from peers.
-
$> ./bc push [channel]
Pushes the given channel to peers.
-
$> ./bc import-keys [alias] [access-code]
Import Alias Keys from another device.
-
$> ./bc export-keys [alias]
Export Alias Keys to another device.
-
$> ./bc keystore
Display location of keystore.
-
$> ./bc peers
Display list of peers.
-
$> ./bc add-peer [host]
Add given host to list of peers.
-
$> ./bc cache
Display location of cache.
-
$> ./bc purge
Purges all data from cache.
-
$> ./bc random
Generate a random number.


{% extends 'base.html'%} {% block content %}
This is an application that allows users to use their one minute wisely. The users will submit their one minute pitches and other users will vote on them and leave comments to give their feedback on them.


Samples:
Basic
Display a Loading
Changing Appearance
Animations
Google Analytics Integration
Google TagManager Integration
Custom Data Transformer


pg
— The Classic PyGreSQL Interface¶
Contents¶
- Introduction
- Module functions and constants
- connect – Open a PostgreSQL connection
- get/set_defhost – default server host [DV]
- get/set_defport – default server port [DV]
- get/set_defopt – default connection options [DV]
- get/set_defbase – default database name [DV]
- get/set_defuser – default database user [DV]
- get/set_defpasswd – default database password [DV]
- escape_string – escape a string for use within SQL
- escape_bytea – escape binary data for use within SQL
- unescape_bytea – unescape data that has been retrieved as text
- get/set_namedresult – conversion to named tuples
- get/set_decimal – decimal type to be used for numeric values
- get/set_decimal_point – decimal mark used for monetary values
- get/set_bool – whether boolean values are returned as bool objects
- get/set_array – whether arrays are returned as list objects
- get/set_bytea_escaped – whether bytea data is returned escaped
- get/set_jsondecode – decoding JSON format
- get/set_cast_hook – fallback typecast function
- get/set_datestyle – assume a fixed date style
- get/set_typecast – custom typecasting
- cast_array/record – fast parsers for arrays and records
- Type helpers
- Module constants
- Connection – The connection object
- query – execute a SQL command string
- reset – reset the connection
- cancel – abandon processing of current SQL command
- close – close the database connection
- transaction – get the current transaction state
- parameter – get a current server parameter setting
- date_format – get the currently used date format
- fileno – get the socket used to connect to the database
- getnotify – get the last notify from the server
- inserttable – insert a list into a table
- get/set_notice_receiver – custom notice receiver
- putline – write a line to the server socket [DA]
- getline – get a line from server socket [DA]
- endcopy – synchronize client and server [DA]
- locreate – create a large object in the database [LO]
- getlo – build a large object from given oid [LO]
- loimport – import a file to a large object [LO]
- Object attributes
- The DB wrapper class
- Initialization
- pkey – return the primary key of a table
- get_databases – get list of databases in the system
- get_relations – get list of relations in connected database
- get_tables – get list of tables in connected database
- get_attnames – get the attribute names of a table
- has_table_privilege – check table privilege
- get/set_parameter – get or set run-time parameters
- begin/commit/rollback/savepoint/release – transaction handling
- get – get a row from a database table or view
- insert – insert a row into a database table
- update – update a row in a database table
- upsert – insert a row with conflict resolution
- query – execute a SQL command string
- query_formatted – execute a formatted SQL command string
- clear – clear row values in memory
- delete – delete a row from a database table
- truncate – quickly empty database tables
- get_as_list/dict – read a table as a list or dictionary
- escape_literal/identifier/string/bytea – escape for SQL
- unescape_bytea – unescape data retrieved from the database
- encode/decode_json – encode and decode JSON data
- use_regtypes – determine use of regular type names
- notification_handler – create a notification handler
- Attributes of the DB wrapper class
- Query methods
- getresult – get query values as list of tuples
- dictresult – get query values as list of dictionaries
- namedresult – get query values as list of named tuples
- listfields – list fields names of previous query result
- fieldname, fieldnum – field name/number conversion
- ntuples – return number of tuples in query object
- LargeObject – Large Objects
- The Notification Handler
- DbTypes – The internal cache for database types
- Remarks on Adaptation and Typecasting


Sign in with your organizational account
DUO Multifactor Authentication is mandatory.
To enroll in DUO, visit https://duo.byu.edu
JavaScript is required. This web browser does not support JavaScript or JavaScript in this web browser is not enabled.
To find out if your web browser supports JavaScript or to enable JavaScript, see web browser help.
DUO Multifactor Authentication is mandatory.
To enroll in DUO, visit https://duo.byu.edu


Whole New Experience to remotely operate your DSLR camera
An experience designed to improve mental health of Millennials & Gen Z
Improving usability using Heuristic Evaluation of an e-commerce app based on C2C market
A mobile app experience designed to solve the problems faced by college students to buy sell & swap books


This example illustrates how to customize the filtering conditions available in the columns popup menu.
Remove Filter
Filter Background
Show All Filter Icons
Event Log:


A Gentle Introduction to Haskell, Version 98
In this section we introduce the predefined standard type classes in Haskell. We have simplified these classes somewhat by omitting some of the less interesting methods in these classes; the Haskell report contains a more complete description. Also, some of the standard classes are part of the standard Haskell libraries; these are described in the Haskell Library Report.
The classes Eq and Ord have already been discussed. The
definition of Ord in the Prelude is somewhat more complex than the
simplified version of Ord presented earlier. In particular, note the
compare method:
data Ordering = EQ | LT | GT
compare :: Ord a => a -> a -> Ordering
The compare method is sufficient to define all other
methods (via defaults) in this class and is the best way to create
Ord instances.
Class Enum has a set of operations that underlie the syntactic sugar of arithmetic sequences; for example, the arithmetic sequence expression [1,3..] stands for enumFromThen 1 3 (see §3.10 for the formal translation). We can now see that arithmetic sequence expressions can be used to generate lists of any type that is an instance of Enum. This includes not only most numeric types, but also Char, so that, for instance, ['a'..'z'] denotes the list of lower-case letters in alphabetical order. Furthermore, user-defined enumerated types like Color can easily be given Enum instance declarations. If so:
[Red .. Violet] => [Red, Green, Blue, Indigo, Violet]
Note that such a sequence is arithmetic in the sense that the increment between values is constant, even though the values are not numbers. Most types in Enum can be mapped onto fixed precision integers; for these, the fromEnum and toEnum convert between Int and a type in Enum.
The instances of class Show are those types that can be converted
to character strings (typically for I/O). The class Read
provides operations for parsing character strings to obtain the values
they may represent. The simplest function in the class Show is
show:
show :: (Show a) => a -> String
Naturally enough, show takes any value of an appropriate type and
returns its representation as a character string (list of characters),
as in show (2+2), which results in "4". This is fine as far as
it goes, but we typically need to produce more complex strings
that may have the representations of many values in them, as in
"The sum of " ++ show x ++ " and " ++ show y ++ " is " ++ show (x+y) ++ "."
and after a while, all that concatenation gets to be a bit
inefficient. Specifically, let's consider a function to represent
the binary trees of Section 2.2.1 as a string,
with suitable markings to show the nesting of subtrees and the
separation of left and right branches (provided the element type is
representable as a string):
showTree :: (Show a) => Tree a -> String
showTree (Leaf x) = show x
showTree (Branch l r) = "<" ++ showTree l ++ "|" ++ showTree r ++ ">"
Because (++) has time complexity linear in the length of its
left argument, showTree is potentially quadratic in the size of the
tree.
To restore linear complexity, the function shows is provided:
shows :: (Show a) => a -> String -> String
shows takes a printable value and a string and returns
that string with the value's representation concatenated
at the front. The second argument serves as a sort of string
accumulator, and show can now be defined as shows with
the null accumulator. This is the default definition of
show in the Show class definition:
show x = shows x ""
We can use shows to define a more efficient version of showTree,
which also has a string accumulator argument:
showsTree :: (Show a) => Tree a -> String -> String
showsTree (Leaf x) s = shows x s
showsTree (Branch l r) s= '<' : showsTree l ('|' : showsTree r ('>' : s))
This solves our efficiency problem (showsTree has linear complexity),
but the presentation of this function (and others like it) can be
improved. First, let's create a type synonym:
type ShowS = String -> String
This is the type of a function that returns a string representation of
something followed by an accumulator string.
Second, we can avoid carrying accumulators around, and also avoid
amassing parentheses at the right end of long constructions, by using
functional composition:
showsTree :: (Show a) => Tree a -> ShowS
showsTree (Leaf x) = shows x
showsTree (Branch l r) = ('<':) . showsTree l . ('|':) . showsTree r . ('>':)
Something more important than just tidying up the code has come about
by this transformation: we have raised the presentation from an
object level (in this case, strings) to a function level.
We can think of the typing as saying that showsTree maps a tree
into a showing function. Functions like ('<' :) or
("a string" ++) are primitive showing functions, and we build up
more complex functions by function composition.
Now that we can turn trees into strings, let's turn to the inverse
problem. The basic idea is a parser for a type a, which
is a function that takes a string and returns a list of (a, String)
pairs [9]. The Prelude provides
a type synonym for such functions:
type ReadS a = String -> [(a,String)]
Normally, a parser returns a singleton list, containing a value
of type a that was read from the input string and the remaining
string that follows what was parsed. If no parse was possible, however,
the result is the empty list, and if there is more than one possible
parse (an ambiguity), the resulting list contains more than one pair.
The standard function reads is a parser for any instance of Read:
reads :: (Read a) => ReadS a
We can use this function to define a parsing function for the string
representation of binary trees produced by showsTree. List comprehensions
give us a convenient idiom for constructing such parsers: (An
even more elegant approach to parsing uses monads and parser
combinators. These are part of a standard parsing library distributed
with most Haskell systems.)
readsTree :: (Read a) => ReadS (Tree a)
readsTree ('<':s) = [(Branch l r, u) | (l, '|':t) <- readsTree s,
(r, '>':u) <- readsTree t ]
readsTree s = [(Leaf x, t) | (x,t) <- reads s]
Let's take a moment to examine this function definition in detail.
There are two main cases to consider: If the first character of the
string to be parsed is '<', we should have the representation of
a branch; otherwise, we have a leaf. In the first case, calling the
rest of the input string following the opening angle bracket s,
any possible parse must be a tree Branch l r with remaining string u,
subject to the following conditions:
The second defining equation above just says that to parse the representation of a leaf, we parse a representation of the element type of the tree and apply the constructor Leaf to the value thus obtained.
We'll accept on faith for the moment that there is a Read (and Show) instance of Integer (among many other types), providing a reads that behaves as one would expect, e.g.:
(reads "5 golden rings") :: [(Integer,String)] => [(5, " golden rings")]
With this understanding, the reader should verify the following evaluations:
| readsTree "<1|<2|3>>" | => | [(Branch (Leaf 1) (Branch (Leaf 2) (Leaf 3)), "")] |
| readsTree "<1|2" | => | [] |
There are a couple of shortcomings in our definition of readsTree.
One is that the parser is quite rigid, allowing no white space before
or between the elements of the tree representation; the other is that
the way we parse our punctuation symbols is quite different from the
way we parse leaf values and subtrees, this lack of uniformity making
the function definition harder to read. We can address both of these
problems by using the lexical analyzer provided by the Prelude:
lex :: ReadS String
lex normally returns a singleton list containing a
pair of strings: the first lexeme in the input string and the remainder
of the input. The lexical rules are those of Haskell programs,
including comments, which lex skips, along with whitespace.
If the input string is empty or contains only whitespace and comments,
lex returns [("","")]; if the input is not empty in this sense,
but also does not begin with a valid lexeme after any leading whitespace
and comments, lex returns [].
Using the lexical analyzer, our tree parser now looks like this:
readsTree :: (Read a) => ReadS (Tree a)
readsTree s = [(Branch l r, x) | ("<", t) <- lex s,
(l, u) <- readsTree t,
("|", v) <- lex u,
(r, w) <- readsTree v,
(">", x) <- lex w ]
++
[(Leaf x, t) | (x, t) <- reads s ]
We may now wish to use readsTree and showsTree to declare
(Read a) => Tree a an instance of Read and (Show a) => Tree a an
instance of Show. This would allow us to
use the generic overloaded functions from the Prelude to parse and
display trees. Moreover, we would automatically then be able to parse
and display many other types containing trees as components, for
example, [Tree Integer]. As it turns out, readsTree and showsTree
are of almost the right types to be Show and Read methods
The showsPrec
and readsPrec methods are parameterized versions of shows and
reads. The extra parameter is a precedence level, used to properly
parenthesize expressions containing infix constructors. For types
such as Tree, the precedence can be ignored. The Show and Read
instances for Tree are:
instance Show a => Show (Tree a) where
showsPrec _ x = showsTree x
instance Read a => Read (Tree a) where
readsPrec _ s = readsTree s
Alternatively, the Show instance could be defined in terms of
showTree:
instance Show a => Show (Tree a) where
show t = showTree t
This, however, will be less efficient than the ShowS version. Note
that the Show class defines default methods for both showsPrec and
show, allowing the user to define either one of these in an instance
declaration. Since these defaults are mutually recursive, an instance
declaration that defines neither of these functions will loop when
called. Other classes such as Num also have these "interlocking
defaults".
We refer the interested reader to §D for details of the Read and Show classes.
We can test the Read and Show instances by applying (read . show)
(which should be the identity) to some trees, where read is a
specialization of reads:
read :: (Read a) => String -> a
This function fails if there is not a unique parse or if the input
contains anything more than a representation of one value of type a
(and possibly, comments and whitespace).
Recall the Eq instance for trees we presented in Section
5; such a declaration is
simple---and boring---to produce: we require that the
element type in the leaves be an equality type; then, two leaves are
equal iff they contain equal elements, and two branches are equal iff
their left and right subtrees are equal, respectively. Any other two
trees are unequal:
instance (Eq a) => Eq (Tree a) where
(Leaf x) == (Leaf y) = x == y
(Branch l r) == (Branch l' r') = l == l' && r == r'
_ == _ = False
Fortunately, we don't need to go through this tedium every time we
need equality operators for a new type; the Eq instance can be
derived automatically from the data declaration if we so specify:
data Tree a = Leaf a | Branch (Tree a) (Tree a) deriving Eq
The deriving clause implicitly produces an Eq instance declaration
just like the one in Section 5. Instances of Ord,
Enum, Ix, Read, and Show can also be generated by the
deriving clause.
[More than one class name can be specified, in which case the list
of names must be parenthesized and the names separated by commas.]
The derived Ord instance for Tree is slightly more complicated than
the Eq instance:
instance (Ord a) => Ord (Tree a) where
(Leaf _) <= (Branch _) = True
(Leaf x) <= (Leaf y) = x <= y
(Branch _) <= (Leaf _) = False
(Branch l r) <= (Branch l' r') = l == l' && r <= r' || l <= l'
This specifies a lexicographic order: Constructors are ordered
by the order of their appearance in the data declaration, and the
arguments of a constructor are compared from left to right. Recall
that the built-in list type is semantically equivalent to an ordinary
two-constructor type. In fact, this is the full declaration:
data [a] = [] | a : [a] deriving (Eq, Ord) -- pseudo-code
(Lists also have Show and Read instances, which are not derived.)
The derived Eq and Ord instances for lists are the usual ones; in
particular, character strings, as lists of characters, are ordered as
determined by the underlying Char type, with an initial substring
comparing less than a longer string; for example, "cat" < "catalog".
In practice, Eq and Ord instances are almost always derived, rather than user-defined. In fact, we should provide our own definitions of equality and ordering predicates only with some trepidation, being careful to maintain the expected algebraic properties of equivalence relations and total orders. An intransitive (==) predicate, for example, could be disastrous, confusing readers of the program and confounding manual or automatic program transformations that rely on the (==) predicate's being an approximation to definitional equality. Nevertheless, it is sometimes necessary to provide Eq or Ord instances different from those that would be derived; probably the most important example is that of an abstract data type in which different concrete values may represent the same abstract value.
An enumerated type can have a derived Enum instance, and here again,
the ordering is that of the constructors in the data declaration.
For example:
data Day = Sunday | Monday | Tuesday | Wednesday
| Thursday | Friday | Saturday deriving (Enum)
Here are some simple examples using the derived instances for this type:
| [Wednesday .. Friday] | => | [Wednesday, Thursday, Friday] |
| [Monday, Wednesday ..] | => | [Monday, Wednesday, Friday] |
Derived Read (Show) instances are possible for all types whose component types also have Read (Show) instances. (Read and Show instances for most of the standard types are provided by the Prelude. Some types, such as the function type (->), have a Show instance but not a corresponding Read.) The textual representation defined by a derived Show instance is consistent with the appearance of constant Haskell expressions of the type in question. For example, if we add Show and Read to the deriving clause for type Day, above, we obtain
show [Monday .. Wednesday] => "[Monday,Tuesday,Wednesday]"


Required:
Delivered:
Overhead:
Required:
Delivered:
Overhead:
Required:
Delivered:
Overhead:
Note that calculation takes 10% overhead off the core count for vSAN operations
Total cache capacity:
cache % vs Useable capacity:
Pre-format capacity- 600GB or less
Pre-format capacity


{% extends "base.html" %}
{% block content %}
Which Social Media Should We Explore First?
Instagram
What pictures are people sharing?
Let's see!
Foursquare
Where are people checking in?
Let's see!
Twitter
These topics are trending right now
{% for topics in lst_trending_tweets %}
| {{ topics }} |
{% endfor %}
Check out these recent tweets
| |
Screen Name |
Recent Tweet |
Shared Link |
{% for tweet in lst_local_tweets %}
| |
{{tweet.user.screen_name }}: |
{{tweet.text }} |
{% if tweet.entities.urls|length > 0 %}
{{tweet.entities.urls[0].display_url}} |
{% else %}
|
{% endif %}
{% endfor %}
Instagram
{% for pic in lst_local_insta %}
{% endfor %}
Foursquare
These places are popular and open right now
| Location |
|
Currently Here |
{% for key, value in lst_four_square_trending.iteritems() %}
| {{ key }} |
|
{{value}} |
{% endfor %}
These places also have been popular recently and are open now
| Location |
Rating |
|
Currently Here |
{% for key, value in lst_four_square_explore.iteritems() %}
| {{ key }} |
{{value[0]}} |
|
{{value[1]}} |
{% endfor %}
Local Events
Check out these local events
| Event |
Venue |
Start Date/Time (past date means ongoing event) |
{% for event in lst_events %}
|
{{event[0]}}
|
{{event[1]}} |
{{event[2]}} |
{% endfor %}
{% endblock %}


Normal
Default Content
Placeholders
Popout Mode
Void Content
The following should not output any data


FSABuildTool.Format
s.FSA
dictionary.dst
relative to src
by trimming
whatever non-equal suffix and infix src
and dst
have.dst
relative to src
by trimming
whatever non-equal suffix and prefix src
and dst
have.dst
relative to src
by trimming
whatever non-equal suffix src
has.System.err
.Copyright © 2014. All Rights Reserved.


DO YOU KNOW THIS VOICE?(director: Frank Nesbitt; screenwriter: Neil McCallum; cinematographer: Arthur Lavis; cast: Jean Aubrey (Trudy), Dan Duryea (Mr. Hopta), Peter Madden (Superintendent Hume), Isa Miranda (Mrs. Marotta), Barry Warren (Detective Sergeant Connor), Gwen Watford (Mrs. Hopta), 1964-UK)
Reviewed by Dennis Schwartz
In an outdoor phone booth in the industrial city of Bristol, England, someone dressed in a trenchcoat is asking for ransom money for a young boy kidnapped from an elite school. On the receiving end of that call are the child's parents, telling the kidnappers that they are not wealthy; that there has been a mistake, you have kidnapped someone who doesn't have the kind of money most who attend that school have. The police are in the boy's house, with Superintendent Hume (Peter Madden) in charge, monitoring the call, hoping to keep the kidnapper on the phone for an extended period of time so that they can trace the call. So begins a film that is more interested in studying the nature of someone who could commit such a crime and have it escalate to a murder than in keeping the film suspenseful by having the audience guess who did it.
Mr. Hopta (Dan Duryea) is the American who lives next door to a cat fancier, Mrs. Marotta (Isa Miranda) and is cheerfully listening to her complain about one of her neighbors who did not appreciate it that her cats got loose and went onto his property. She is friendly with the gregarious and handy Mr. Hopta, who has fixed many of her broken appliances for free, something she really appreciates since she can't afford to buy new ones or pay to get the broken ones fixed. He chastises her for not calling her niece Trudy (Jean) over a little argument they had, and when she tells him that she can't because she doesn't have the money, he generously gives her the coins to make the call.
Meanwhile, the police have just discovered the child's body in the woods and are looking for any lead they can get on this murder case. The boy's parents are distraught with the news, and the father feels he can't stay on the line with the caller if he should call again and keep him talking as the police request, because he is too weak from the ordeal. The police insist that this is their best shot at getting the killer. So when the kidnapper calls again demanding money, he manages to keep the caller on the line until they trace the call, but he can't help it any more and blurts out in anger, "Why did you kill my boy?"
At the phone booth, the Italian lady drops the change Hopta gave her and is on the ground picking up the coins when the caller of the phone that the police traced comes rushing out of the phone booth. She notices only their brown shoes and pants, but fails to look up and see that it is Mrs. Hopta (Gwen). While inside the booth, in the middle of her conversation with Trudy, the police frighten her by pulling her away from the phone and taking her down to the police station, where she is cleared of the crime, but is being questioned by Superintendent Hume as a possible witness.
Mrs. Marotta volunteers to act as bait to catch the murderer, feeling sorry that a little boy was killed and she failed to be of help in identifying the killer. She tells the police that her life isn't that valuable, that she would like to do something to help, even if what she is doing is dangerous. But the police nix that offer, saying it is unfair to put her in such danger.
Determined to get the killer, on her way out of the police station, this very proud woman who even refuses the police offer of a ride home, tells the newsmen waiting there that she saw what the killer looked like. The police have no choice now but to protect her and wait for the killer to strike. As an added precaution to their street security, they place a man inside her house to watch her, Detective Sergeant Connor (Barry Warren).
  He tells her it was an accident, "I just tied the ropes on him too tight."
Not satisfied that he's home free from the crime, Hopta tells his wife that it is strange that Mrs. M didn't recognize you, it could only mean that she didn't see you and that this is a police trap, as he decides to go over there and check up on what is going on.
Convinced that Mrs. M saw something and might later on recall it and link him to the crime, Hopta tells his anguished wife, I better kill her and make sure. This is the pivotal scene of this b/w noir film, as Hopta goes completely over the edge and cannot be looked upon any more as just a pathetic loser who keeps making mistakes.
What keeps the film chilling, is Dan Duryea as the friendly next-door neighbor, who is so psychologically warped, yet doesn't overtly show it. He brings his wife along on the nightmare he is having, even though he dearly loves her. To watch him ingratiate himself with the kindly older neighbor and all the time he is planning to poison her and when that doesn't work to strangle her, makes for a frightening character portrayal, of someone you think you know but you don't. Duryea is so good at acting out a part like this, with just the right balance of charm, controlled madness and hubris, until at the end of the film he completely snaps, singing old military songs as the police arrest him and his wife is accidently poisoned to death, and is seen lying on the kitchen floor.
REVIEWED: 11/1/99 GRADE: C+
Dennis Schwartz: "Ozus' World Movie Reviews"
http://www.sover.net/~ozus
<EMAIL_ADDRESS>© ALL RIGHTS RESERVED DENNIS SCHWARTZ
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


Leg
public class Leg
A relative minima or maxima
-
The starting index of the leg
Declaration
Swift
public let index: Int
-
The starting point of the leg
Declaration
Swift
public let point: CLLocation
-
The direction of this leg (see Direction)
Declaration
Swift
public var direction: Direction
-
The ending index of the leg
Declaration
Swift
public var endIndex: Int
-
The ending point of the leg
Declaration
Swift
public var endPoint: CLLocation?
-
The current stats for the leg
Declaration
Swift
public var stat = Stat()
-
The Altitude at the referred to point
Declaration
Swift
public var altitude: CLLocationDistance
-
The calculated change in altitude between the start and end point
Declaration
Swift
public var altitudeChange: CLLocationDistance
-
Initializes the Leg with an index, point, direction, endIndex and endPoint
Declaration
Swift
public init(index: Int, point: CLLocation, direction: Direction = .unknown, endIndex: Int = -1, endPoint: CLLocation? = nil)
Parameters
index
The index of the first point in the Track Points
point
The first point
direction
The direction we’re headed: ascent vs. descent (see Direction)
endIndex
The index of the last point in the Track Points
endPoint
The end point
-
Tells us if two legs are
the same
. They are the same if their indices, altitude and direction are the same.Declaration
Swift
public static func == (lhs: Leg, rhs: Leg) -> Bool
Parameters
lhs
The first Leg to compare
rhs
The second leg to compare
Return Value
<#return value description#>


Strategies
Strategies are used at the Activity level to denote known scripts. Each is documented in the
SALTISE resources.
Getting Started
To get started, create or open an activity, then add a strategy either by dragging the strategy in the right hand panel into the active area (the box) or onto an existing node.
Manipulating Strategies
Strategies can be manipulated in various ways:
- Moving Strategies
Strategies are linked to the top and bottom node of the bracket. Moving either of these nodes will cause the strategy to move with it, even if the order of the nodes is rearranged.
- Resizing Strategies
By clicking the strategy bracket, you can resize it. This allows you to link it to a different node. For example, if you resize the bracket upward, it will now become attached to the next node up, causing it to move with that node instead.
- Deleting Strategies
When mousing over a strategy, you may delete it by clicking the icon. This will delete only the bracket, not the nodes within it.


Getting Started
Getting up and running with Lavacharts is a breeze and if you follow along, you will learn how Lavacharts works. If you want some real working examples just jump down and take a look. Following these steps will show you how to create a DataTable, add columns and rows, add data, and finally render the chart into the page.
Note: There only ever needs to be one instance of the Lavacharts object. All charts & dashboards are stored internally, so once the $lava object is created, it should be passed from controller to view for rendering. A common practice it to instantiate the Lavacharts object into a service container of sorts, and pull when needed. (This how Laravel works)
DataTable
Creating a new DataTable for your chart.
The following is a simple example, just to get you up and running.
For an in-depth look at DataTables, Click Here or use the link from the menu.
- First, create a new DataTable object using the method from Lavcharts.
- Next, add some columns, defining the structure of the chart's data.
addDateColumn($description)
for dates
addTimeOfDayColumn($description)
for times of the day
addNumberColumn($description)
for numbers
addStringColumn($description)
for strings
addBooleanColumn($description)
for boolean values
addRoleColumn($description)
for roles
- In this example, the first column is the horizontal axis, then then next two columns are the two sets of data.
- The
addRow()
method signature, follows the order in which the columns were added.
So here, data[0] is for 'day', data[1] is for 'projected' and data[2] is for 'official'
{% highlight php startinline %}
DataTable(); // Lava::DataTable() if using Laravel
$stocksTable->addDateColumn('Day of Month')
->addNumberColumn('Projected')
->addNumberColumn('Official');
// Random Data For Example
for ($a = 1; $a < 30; $a++) {
$stocksTable->addRow([
'2015-10-' . $a, rand(800,1000), rand(800,1000)
]);
}
{% endhighlight %}
Chart
Creating and customizing your chart.
Select which type of chart you will be creating. In this example, we will use LineChart, but Lavacharts currently supports:
{% highlight php startinline %}
LineChart('MyStocks', $stocksTable);
// $chart = Lava::LineChart() if using Laravel
{% endhighlight %}
Heads up! Even though the chart's constructor returns a chart object, you do not need to pass the chart object into your views. The library stores created charts internally by type and label, so you do not need access to the chart object directly.
Output
Rendering the chart
All you need to do in your view, is use the render method and the library will output all of the neccessary javascript into the page.
Syntax: render(chartType, chartLabel, elementId)
{% highlight php startinline %}
echo $lava->render('LineChart', 'MyStocks', 'stocks-chart');
{% endhighlight %}
Take note... The render method will output two script tags, not the actual chart. This means you don't need to put the render call near the div. The chart will be rendered into the div once the google jsapi has been loaded.


Profile
|
- Positive attitude.
- Committed to continuous learning. Never satisfied with the status quo.
- Focused on detail. Always trying to leave things how I would like to find them.
- Eager to propose solutions and improvements, be part of decision-making.
- Solid technical, system and network administration background.
|
| |
Objectives
|
- Acquire wider knowledge of best practices, methodologies and design patterns.
- Participate and contribute to open source projects.
|
| |
Experience
|
Sep 2019 - June 2020
Software Engineer
Ferryscanner
Member of the team that developed the ferry booking engine, integration with Computer Reservations Systems.
Having the DevOps engineer role on the team, worked on dockerization and CI automation.
Jan 2017 - Jun 2018
Software Engineer
Tripsta (TravelPlanet24 / Airtickets)
Member of the core team that implemented the booking engine with diverse technologies, integrated with Global
Distribution Systems and Low Cost Carrier content aggregators for airline reservations and Computer Reservations
Systems for ferry reservations.
Member of the DevOps chapter, working on CI, deployment process implementation, dockerization, application
optimization, architecture improvements.
Member of the 1st level support chapter, that monitored and troubleshooted the applications and the infrastructure.
Oct 2014 - Jan 2017
Software Engineer
Zoottle Inc.
Developed quality focused web applications accompanied by automated tests and applied the TDD methodology.
Refactored the codebase, improved the architecture and performance of the platform and its analytics dashboards.
Re-wrote the billing system using the Braintree SDK, designed and implemented two RESTful APIs.
Dec 2012 - Jul 2014
Software Engineer
Forthnet S.A.
Member of a team that developed web applications using the optimum patterns, methodologies and technologies
on top of widely adopted APIs, like Google Maps & Analytics, Facebook.
Feb 2010 - Dec 2012
Software Engineer
Credicom Consumer Finance (Crédit Agricole Group)
Developed banking related utilities using the latest Microsoft technologies this far.
Member of a team that developed banking functionalities on top of the IBM Domino application server.
Developed web services for the e-Banking application and an IVR application on Genesys Voice Platform.
Apr 2007 - Feb 2010
Technician, System & Network Administrator
on two companies
Worked as a Desktop / Network Technician and System & Network Administrator on Credicom Consumer Finance
(Crédit Agricole Group) and Centrum Research respectively.
Developed multiple tailor-made tools to automate tasks and minimize human intervention.
Notable responsibilities were to first-level administrate and configure the computer domain & network.
|
| |
Skills
|
My expertise
PHP | Symfony | Python | MySQL
Highly experienced in the above technology stacks. I almost always :-) write automated tests using PHPUnit,
Behat, Selenium, CasperJS.
Advanced
JavaScript | Docker | MongoDB | Redis | RabbitMQ | Linux
Experienced in NoSQL, Key/Value databases. Worked extensively with MongoDB's "aggregation framework"
and Redis for an analytics functionality.
Advanced knowledge of the Linux OS from the development environment up-to supporting the production
environment. Highly confident with the terminal.
|
| |
Projects (curated list)
|
ojah
An AI aggregator of positive news, made with Django.
rabbitmq-alert
A RabbitMQ monitoring tool that sends notifications when conditions are met, made with Python.
secret-spawn
A generator of memorizable passwords, made with Spring Boot.
acars-server
An aviation ACARS message visualizer, made with Python.
chronis
A crontab generator using natural language expressions, made with PHP.
termrea
An RSS reader for the terminal, made with Python.
commit-sniffer
Repository quality stats generator, made with Laravel.
grain
A wannabe PHP MVC framework.
salt-out
Salt output parser, made with Python.
capture-bot
Reddit bot that posts screenshots of websites referenced in posts, comments, made with Python.
nmap
NSE scripts for vulnerability scanning of applications and appliances, made with Lua.
workable-missing-rss
A revival of Workable's "Greek start-ups feed", made with Python.
|
| |
Education
|
2003 - 2005
Delta Training Institute
Associate's Degree in "Computer Application,
Network and Office Automation"
Passed the exams of the authority "Organization of Vocational Education & Training" (OEEK) to certify the degree.
1992 - 1999
Cambridge University
FCE
Fluent in English and the computer science terminology.
For years, I used to translate open source applications and documentation from English to Greek.
|
| |
Training
|
2020
University of Athens
The Art of Persuasion, 4 months
Get familiar with the principles, evaluation and creation of argumentation, refute opposing arguments.
2019
University of Athens
Blockchain Developer, 4 months
Architecture of blockchains, their philosophy, cryptocurrencies, the Etherium blockchain, developing smart
contracts with Solidity. Accomplished with distinction.
2015
MongoDB University
MongoDB for Developers, 7 weeks
Development of applications backed by MongoDB, its philosophy and architectural design, basic administration.
Accomplished with distinction.
Coursera (by University of New Mexico)
Web Application Architectures, 6 weeks
Design patterns, and major architectural components of modern web applications exercised with Ruby on Rails.
Accomplished with distinction.
Coursera (by Johns Hopkins University)
The Data Scientist's Toolbox, 4 weeks
Overview of the ideas and the tools that data analysts work with in order to turn data into actionable knowledge.
Accomplished with distinction.
2014
edX (by IIT Bombay University)
CS101 - Computer Programming, two seminars 6 weeks each
Acquire basic knowledge of C++ and exercise by solving common algorithmic puzzles.
2013
Coursera (by Rice University)
Introduction to Interactive Python Programming, 9 weeks
Python and how to use it to build interactive applications. Accomplished with distinction.
2011
Genesys University
Genesys CIM & GVP, 40 hours
Development & administration of contact center solutions using the Genesys platform.
ITEC
Microsoft SharePoint 2010 Application Development, 40 hours
Building solutions using the Microsoft SharePoint 2010 platform.
2010
Alcatel-Lucent
Alcatel-Lucent CCA & CCO API, 24 hours
Seminar and workshop about the development of contact center applications using the Alcatel-Lucent API.
ITEC
Writing queries using MSSQL Server 2008 T-SQL, 24 hours
Basics of T-SQL.
2008
Hellenic American Union
Cisco Certified Network Associate (CNAP), 9 months
Computer network theory, architecture, security and management of Cisco devices.
2007
Association of Hellenic Internet Users (ΕΕΧΙ)
GNU/Linux Operating System, 24 hours
The GNU/Linux operating system, system administration and advanced tasks.
|
| |
Interests
|
Sports
Cycling, Urban hiking
Arts
Play the guitar, Theater-goer
|
|


Base class of all button-like widgets, such as push buttons, check boxes, and radio buttons.
An abstract action to be performed in reaction to user input.
Clients should implement the ui field.
A container that arranges its children around a central component that takes most of the space.
A panel that lays out its contents one after the other, either horizontally or vertically.
Default partial implementation for buffer adapters.
A button that can be clicked, usually to perform some action.
A button mutex.
Two state button that can either be checked or unchecked.
A menu item with a check box.
Let's the user make a selection from a list of predefined items.
Base class for all UI elements that can be displayed in a window.
The base traits for UI elements that can contain Component
s.
A dialog window.
A text component that allows multiline text input and display.
Used to open file dialogs.
A panel that arranges its contents horizontally, one after the other.
A text field with formatted input.
A window with decoration such as a title, border, and action buttons.
A panel that arranges its children in a grid.
A panel that lays out its contents in a uniform grid.
A label component that display either a text, an icon, or both.
A container that associates layout constraints of member type
Constraints
with its children.
A component that displays a number of elements in a list.
A frame that can be used for main application windows.
A menu.
A menu bar.
A menu item that can be used in a menu.
An Oriented
whose orientation can be changed.
Something that can have an orientation.
A component that can contain other components.
A password field, that displays a replacement character for each character in the password.
A bar indicating progress of some action.
Notifies registered reactions when an event is published.
A two state button that is usually used in a ButtonGroup
together with other RadioButton
s, in order to indicate
that at most one of them can be selected.
A menu item with a radio button.
Used by reactors to let clients register custom event reactions.
The counterpart to publishers.
A window that adds some functionality to the plain Window class and serves as the common base class for frames and dialogs.
The root of a component hierarchy.
Can have at most a single child component, which will be put inside a canvas (the viewport) that can be scrolled.
A component that is specially suitable for being placed inside a
ScrollPane
.
A bar that can be used a separator, most commonly in menus.
A container for which a sequential order of children makes sense, such as flow panels, or menus.
Lets users select a value from a given range.
A container with exactly two children.
Displays the contents of one of several pages at a time.
Displays a matrix of items.
A text component that allows multiline text input and display.
A component that allows some kind of text input and display.
A text component that allows single line text input and display.
A two state button with a push button like user interface.
The base trait of all user interface elements.
A window with decoration such as a title, border, and action buttons.
Convenience class with utility methods for GUI applications.
Extend this class for most simple UI applications.
Horizontal and vertical alignments.
Utility methods, mostly for wrapping components.
Simple predefined dialogs.
Helpers for this package.
Useful imports that don't have wrappers.


Input
Connects to the COM port and reads LINE PER LINE (in other works, expects a new line between each values) a STRING (1023, 289, 2) that is interpreted as an int and displayed. Better have your value between 0..1024, don't know the result if you put something else...
Nota bene :
- Port is fixed (sorry, I'm lazy) COM16 ... I'll make it changeable soon
- Baudrate is fixed (same excuse) 115200
The graph is done with the wonderful component zedGraph written in c# and fully free : please use it.
Download
Pictures


Winning numbers drawn in 'MassCash' game
by The Associated PressBRAINTREE, Mass. (AP) _ The winning numbers in Saturday evening's drawing of the Massachusetts Lottery's "MassCash" game were:
09-16-27-28-32
(nine, sixteen, twenty-seven, twenty-eight, thirty-two)


Syntropy Studio is a platform for rapidly developing scripts, creative / experimental programs, visualisations and many other things using JavaScript. You can use Node APIs, render using the DOM, and compose your programs from reusable blocks.
We transpile your code automatically behind the scenes so you can use the latest JavaScript features out-of-the-box.
Your program can output HTML (or React, Vue, whatever) right next to your code.
Link your variables to input controls to rapidly test different variations.
Code and variable changes are hot-reloaded and your program's state is maintained.
Work on multiple programs and quickly switch between them. Great for experiments or a collection of related scripts.
Share your code blocks with other users, and easily pull-in blocks from the web to rapidly build your program.
Syntropy Studio is free for non-commercial use. If you want to use it at work, please contact us.
We want your feedback! Ask questions, request features and complain about bugs on Gitter!


Writes a single data record into an Amazon Kinesis stream. Call put-record to send data into the stream for real-time ingestion and subsequent processing, one record at a time. Each shard can support writes up to 1,000 records per second, up to a maximum data write total of 1 MB per second.
You must specify the name of the stream that captures, stores, and transports the data; a partition key; and the data blob itself.
The data blob can be any type of data; for example, a segment from a log file, geographic/location data, website clickstream data, and so on.
The partition key is used by Amazon Kinesis to distribute data across shards. Amazon Kinesis segregates the data records that belong to a stream into multiple shards, using the partition key associated with each data record to determine which shard a given data record belongs to.
Partition keys are Unicode strings, with a maximum length limit of 256 characters for each key. An MD5 hash function is used to map partition keys to 128-bit integer values and to map associated data records to shards using the hash key ranges of the shards. You can override hashing the partition key to determine the shard by explicitly specifying a hash value using the ExplicitHashKey parameter. For more information, see Adding data to a Stream in the Amazon Kinesis Streams Developer Guide .
put-record returns the shard ID of where the data record was placed and the sequence number that was assigned to the data record.
Sequence numbers increase over time and are specific to a shard within a stream, not across all shards within a stream. To guarantee strictly increasing ordering, write serially to a shard and use the SequenceNumberForOrdering parameter. For more information, see Adding data to a Stream in the Amazon Kinesis Streams Developer Guide .
If a put-record request cannot be processed because of insufficient provisioned throughput on the shard involved in the request, put-record throws ProvisionedThroughputExceededException .
data records are accessible for only 24 hours from the time that they are added to a stream.
See also: AWS API Documentation
put-record
--stream-name <value>
--data <value>
--partition-key <value>
[--explicit-hash-key <value>]
[--sequence-number-for-ordering <value>]
[--cli-input-json <value>]
[--generate-cli-skeleton <value>]
The name of the stream to put the data record into.
The data blob to put into the record, which is base64-encoded when the blob is serialized. When the data blob (the payload before base64-encoding) is added to the partition key size, the total size must not exceed the maximum record size (1 MB).
Determines which shard in the stream the data record is assigned to. Partition keys are Unicode strings with a maximum length limit of 256 characters for each key. Amazon Kinesis uses the partition key as input to a hash function that maps the partition key and associated data to a specific shard. Specifically, an MD5 hash function is used to map partition keys to 128-bit integer values and to map associated data records to shards. As a result of this hashing mechanism, all data records with the same partition key map to the same shard within the stream.
The hash value used to explicitly determine the shard the data record is assigned to by overriding the partition key hash.
--sequence-number-for-ordering (string)
Guarantees strictly increasing sequence numbers, for puts from the same client and to the same partition key. Usage: set the SequenceNumberForOrdering of record n to the sequence number of record n-1 (as returned in the result when putting record n-1 ). If this parameter is not set, records will be coarsely ordered based on arrival time.
--cli-input-json (string) Performs service operation based on the JSON string provided. The JSON string follows the format provided by --generate-cli-skeleton. If other arguments are provided on the command line, the CLI values will override the JSON-provided values.
--generate-cli-skeleton (string) Prints a JSON skeleton to standard output without sending an API request. If provided with no value or the value input, prints a sample input JSON that can be used as an argument for --cli-input-json. If provided with the value output, it validates the command inputs and returns a sample output JSON for that command.
ShardId -> (string)
The shard ID of the shard where the data record was placed.
SequenceNumber -> (string)
The sequence number identifier that was assigned to the put data record. The sequence number for the record is unique across all records in the stream. A sequence number is the identifier associated with every record put into the stream.


Aleph stores a large number of documents from a variety of sources. In order to find the exact material you need, you may want to make use of some of it's advanced search operators.
To find exact matches for a given search term, e.g. to search for a person, company, project or technical term, try putting the name in quotes:
"Exxon Mobil"
If you do not want to find a precise string, but merely specify that two words are supposed to appear close to each other, you might want to use proximity search. This will try to find all the requested search terms within a given distance from each other:
"Nigeria incorporated"~10
This will find relevant matches with the terms "Nigeria" and "Incorporated" occuring within ten words from each other, such as "Nigeria Limited Incorporated" or "incorporated in Nigeria".
The same principle of proximity can also be applied inside of individual words. A search will then try to find not just the precise word you've specified, but also spelling variants. A spelling variant is defined by the number of spelling mistakes that must be made to get from the original word to the variant.
Siliccilastic ~2
This will find not just the term "Siliclastic", but also similar words such as "Siliclastic". Note that if you set the permissible distance too high, you will get very slow searches and many false results.
You can make queries composed of multiple terms in various ways. The simplest form is to just put more than one word into the search bar. In this case, Aleph will try and find documents that contain all of the given terms and put these first. After that, results that miss any of the given search terms will also be shown.
If you want to make sure that a given term must show up in the results (or may never show up), you can put a plus sign ("+") right in front of it (or a minus sign, "-", to make sure all documents with the given word are removed).
Malawi -Zambia
You can also make more complex, boolean queries in which the terms "OR" and "AND" in capital letters are used to specify the that certain search terms must appear together (or can serve as alternatives to each other).
Nigeria AND (incorporated OR operation)


--- layout: post title: Attivio Taps CSC for European Consulting Partnership date: '2012-01-12T09:17:36-08:00' tags: tumblr_url: http://alexhwilliams.tumblr.com/post/15727436861/attivio-taps-csc-for-european-consulting-partnership ---
http://bit.ly/ytL6Ne


Alias: Arkin Cosmos
Age: 29
Profession: Ex Systems Analyst/Current Chef
Gender: Male
Attitude: Self-proclaimed conspiracy theorist who tries to minimize his digital footprint. He believes the internet is a very useful tool but is more often used as a weapon.
Needs:
Frustrations:
Technology: Owns An Alienware Gaming AW17R5 7405SLV-PUS with an Intel 8th Gen i7, 9MB cache cache that can be boosted up to 3.9GHz and high-end graphics by NVIDIA GeForce GTX 1060 chipset. 17.3 Inches FHD-IPS screen for better viewing and a Hybrid disk (8GB SSD and 1TB HDD). He uses a Nokia - model 8210 for cellphone needs.


This is a grouped Bar chart with two bars per group which uses red and blue
graduated fills. The background grid has been customised and the background
itself is a dark color (so the text has been changed to white). Also, the
chart is using the Bar chart wave
effect. This grows sequentially from
the left-hand-side with a small delay between each group of bars.
The two gradients that are used here (Gradient(white:#ccf:#ccf:#ccf:#ccf)
and Gradient(white:#faa:#faa:#faa:#faa)
)
are created by using the RGraph specific gradient syntax. This is an easy way
to produce gradients (it's certainly easier than the canvas
API
method!) and
can be utilised to produce gradients for your own charts.
If you wanted to add further information to the chart to identify
the meaning of the two bars you could add a key in either the graph
or margin
modes or you could perhaps use the labelsAbove
option.
For smaller screens, the responsive
function reduces the size of the chart,
reduces the size of the text on the chart and reduces the size of the margins.
This demo shows the new highlighting style - invert
. This reverses the
highlighting from adding a rectangle over the focused bar to adding rectangles to every
rectangle except the focused bar.
The tooltips have no fade effect and are positioned at the top right of the canvas
tag by using
the tooltip
event. This runs a snippet of code that gets the canvas
tag x/y
coordinates and sets the position of the tooltip accordingly.
<script src="RGraph.common.core.js"></script> <script src="RGraph.common.dynamic.js"></script> <script src="RGraph.common.tooltips.js"></script> <script src="RGraph.bar.js"></script>Put this where you want the chart to show up:
<canvas id="cvs" width="500" height="250" style="background-color: #333; border-radius: 5px; box-shadow: 2px 2px 2px #999; float: right">[No canvas support]</canvas> <!-- Center align the tooltip key --> <style> /* * .RGraph_tooltip table { * margin-left: auto; * margin-right: auto; * } */ </style>This is the code that generates the chart - it should be placed AFTER the
canvas
tag(s):


tests/test-parameter-functions.R
tleaves()
that was introduced with new T_sky
function. This led to crossing all parameter values with all unique values of calculated T_sky
, which was incorrect. Added unit tests to ensuring that crossing is done correctly under tests/test-tleaves-crossing.R
.get_Rabs()
that would have over-written custom T_sky
function.citation(package = "tealeaves")
.enviro_par()
, “sky” temperature (T_sky
) can now be provided directly as a values (in K) or as a function (the default).parallel = TRUE
in tleaves()
, future uses plan("multisession")
rather than plan("multiprocess")
.CONDUCT.md
in READMEconstants()
, enviro_par()
, and leaf_par()
no longer require values be provided with units. If values are provided without units, they are assigned proper units, but no unit conversion is performed. If values have units, these functions check whether units are correct and convert them to units used in the package.
Release to be archived with revision of “Is amphistomy an adaptation to high light? Optimality models of stomatal traits along light gradients.”
tealeaves implements models of leaf temperature using energy balance. It uses units to ensure that parameters are properly specified and transformed before calculations. It allows separate lower and upper surface conductances to heat and water vapor, so sensible and latent heat loss are calculated for each surface separately as in Foster and Smith (1986). It’s straightforward to model leaf temperature over environmental gradients such as light, air temperature, humidity, and wind. It can also model leaf temperature over trait gradients such as leaf size or stomatal conductance.
NEWS.md
file to track changes to the package.


Digital Funnel
All Leads
EDIT DEAL
Add
Enter customer name
Deal number
Deal budget
Date of contract
Stage of Deal
First Contact
Drive to Sale
Negotiation
Manufacturing
Save
Cancel


{% include 'header.html' %}
This crazy part takes the inputted in (eg: {{ ip }} )
Gets each user for that IP.
then for each user that IP has,
looks up each IP that also has that user<EMAIL_ADDRESS>cray.
{% for user,list in tree %} {{user}} : {% for ip2 in list -%} {% if ip2 != ip -%}{{ip2}}{%else-%} {{ip2}}{%endif-%}, {% endfor -%}{% include 'footer.html' %}
{% endfor -%}


Cheesecake Order Form
Quantity
Topping
1
2
3
4
5
6
7
8
Plain
Cherry
Chocolate
Notes:
Orders from
Jan
Jan
Feb
Mar
Apr
May
Jun
Jul
Aug
Sep
Oct
Nov
Dec
11 cherry
17 chocolate
31 plain


I am delighted to notify you that {{name}} is now fully-funded. Thank you so much for your support!  Our next step is to disburse funding to {{name}}. In addition, we will send a welcome package introducing Givology and all the donors who have contributed to {{name}}’s funding, including the letters sent to {{name}}through our messaging system. If you would like to send an additional message at this time, please use our inbox function to send an encouraging letter to {{name}}. To do so, log-in to your account and click on {{name}}’s profile. Under the photo, you will find a “Message Me” button. Your words of encouragement will mean a lot to {{name}}! Ideas for a letter include:


You exit the large industrial building and enter your car, you'd ignite the engine and drive off throug the city as you did so the sky darkened and soon the sound of rain fall would accompany the silence of your ride. You drive home to an apartment in the rough side of town, the building is made of old red bricks that seem to have been worn out by time judging by the various discolorations that can be easily spotted. You would exit the car and enter the large white door at the entrance, you'd walk through the lobby and avoided making eye-contact and headed straight to your room. Your room was a small one room studio apartment ... though it was supposed to be your home, nothing could feel further from the truth. The bed was a cheap mattress that was dotted with stains, it was situated infront of the T.V, next to a table with several bowles of day old food litered all over it. The second half of the bedroom was a kitchen with barely enough room for a person. Well we're home anyways ... what do you want to do?
1).  Watch some TV
3). Go to the kitchen


{% extends 'notifications/view/base.html' %} {% load i18n notifications %} {% block table_rows %} {{ block.super }} {% with notification.amendmentnotification as notification %}


Before Change
// parallel computing in evaluation of pipeline
if not sys.platform.startswith("win"):
pool = Pool(processes=self.n_jobs)
resulting_score_list = pool.map(partial_cross_val_score, sklearn_pipeline_list)
else:
resulting_score_list = map(partial_cross_val_score, sklearn_pipeline_list)
for resulting_score, operator_count, individual_str, test_idx in zip(resulting_score_list, operator_count_list, eval_individuals_str, test_idx_list):
After Change
// parallel computing in evaluation of pipeline
if not sys.platform.startswith("win"):
parallel = Parallel(n_jobs=self.n_jobs)
resulting_score_list = parallel(delayed(self._wrapped_cross_val_score)(self.max_eval_time_mins, clone(sklearn_pipeline),
features=features, classes=classes, cv=self.cv, scoring_function=self.scoring_function,
sample_weight_dict=sample_weight_dict, pbar=self._pbar, verbosity=self.verbosity)
for sklearn_pipeline in sklearn_pipeline_list)
pool = Pool(processes=self.n_jobs)
resulting_score_list = pool.map(partial_cross_val_score, sklearn_pipeline_list)
else:


Before Change
get_identity_parameters(t, dim, theta)
expected = np.eye(dim + 1)
actual = np.empty_like(expected)
param_to_matrix(t, dim, theta, actual)
assert_array_almost_equal(actual, expected)
After Change
// Verify that ValueError is raised if the transform/dimension are invalid
assert_raises(ValueError, get_identity_parameters, -1, 2)
assert_raises(ValueError, get_identity_parameters, 1, 4)
def test_eval_jacobian_function():
//Compare the analytical Jacobians with their numerical approximations


One of the most interesting intersections of disparate academic topics that has forced itself into the modern limelight is that between morality and artificial intelligence. While composed of two highly abstract fields of study, this intersection has very real repercussions. Take, for example the advent of driverless cars.
The scenario will arise when a car has to choose between the life of its passenger and the life of a pedestrian. This is eerily akin to the Trolley Car problem introduced by the philosopher Phillipa Foot in 1967 (see links section for more info). There are many approaches to solving this problem, some of which are being actively pursued. What I aim to do in this essay is outline some of these approaches and then propose the theoretical framework for a new form of machine learning based morality.
Rule Based Morality
The first approach that we are going to look at is a rule based approach. This is the same as saying "if A occurs, do B". Moral decisions tend to carry more complexity to them, though. We would have to model them as "If A and B and C and D ... and Y then Z". Computer scientists model complex conditional relationships like this with decision trees. Each different condition is represented as a different branch going down the tree. Eventually, you will reach the bottom of the tree where a solution is hard coded.
The issue with rule based morality is immediately apparent. In fact, over 400 years ago Immanuel Kant explained why we can't hard code in the optimal moral decision for any possible situation:
There couldn’t be an imperative that in the strict sense commanded us to do what makes for happiness, because happiness is an ideal not of reason but of imagination, depending only on empirical grounds. This means that whether a person will achieve happiness depends on countlessly many particular facts about his future states; and there is absolutely no chance of picking out the actions that will produce the right infinite totality of consequences that will constitute happiness.
Attempting to hard code the optimal outcome to every situation would require an infinitely long decision tree. You could generalize decisions to address this issue (i.e. only account for the major variables involved in a moral decision); however, there would still inevitably arise situations totally outside the realm of any within the decision tree. Think, for example of the moral dilemmas arising at the advent of new technologies.
Reinforcement Learning
The second approach that we are going to look into is called reinforcement learning. In this method, an artificial intelligence interacts with a given scenario multiple times, experimenting with different potential paths each time. This is similar to trying to beat a video game by trying different things, dying, and playing the level again by trying something different.
If you're playing a video game, it would take you a prohibitively long time to continually make random moves until your random sequence of moves allows you to beat the level. Instead, you store a knowledge of which past moves got you the closest to beating the level in the past. You will then tend toward those moves while also exploring new possibilities to see if those increase your score even more. This is what's known as the explore-exploit tradeoff. GoodAI, a Czech AI startup, has built a Q-learning model that performs this exact type of learning in user prescribed situations.
One of the major issues with this approach, however, is a lack of generalizability. The moral skillset developed in the reinforcement learning approach is confined to the specific scenarios in which the AI was trained. This is the difference between (a) learning the moves to beat a single level of a video game and (b) learning how to play a video game. If a number of variables are changed in a moral situation, will you be able to account for those or will your moral reasoning need to restart from scratch?
Transfer Learning
Enter transfer learning. In traditional machine learning, a we train a model that will then be used to make predictions on datasets of the same form. If we feed the model data of a new type, the model will sputter to a stop. Imagine trying to run a car by filling up the gas tank with green tea. Transfer learning addresses the problem of differing input, which is integral to addressing the diversity inherent to moral quagmires.
So what would transfer learning look like in a moral context? I propose beginning with a binary classifier (e.g. a Support Vector Machine, Logistic Regression, or Neural Net). This classifier will take as input a specific scenario in which a moral dilemma exists and n possible choices are present. The classifier would then calculate the "moral score" of each of the n possible choices, landing on the choice with the maximum moral score.
If this binary classifier were fed into a transfer learning context, the model would have the flexibility to address different types of situations which a pre-existing knowledge of morality.
One major question pertaining to this, though, is how do we program moral scores? The simplest computational method would be a bounded utilitarian model. By this I mean a model that acts to maximize the common good within bounds. An example of an established bound would be: an AI cannot kill people. These boundaries would need to be domain specific as agricultural ethics have emphatically different ethical boundaries than, say, autonomous vehicles. This is the central tenet of situational ethics.
The Framework of Computational Ethics
In Beyond Good and Evil, Nietzsche opined:
There are absolutely no moral phenomena, only a moral interpretation of the phenomena.At the time, Nietzsche was countering moral essentialism, the belief that there exists an inherent morality in the universe. This claim was psychological more than philosophical. Nietzsche was trying to represent morality as a subjective experience. When building morality into artificial intelligence, though, we are working in a framework totally independent of subjective experience.
Whether you are a Christian Essentialist or Existentialist, you would agree that computational ethics are not hard coded by nature or a deity. Nor are they established via the subjective experience of the computer. That would be impossible as computers have no qualia. Instead, computational morality is built by training, repition and guess work. Maybe morality is neither inherent nor interpretive, but a skill developed through trial and lots and lots of error.
Links
- A Video on the Trolley Car Problem
- Immanuel Kant's Fundamental Principals of the Metaphysics of Morals
- GoodAI's Brain Simulator
- An Introduction to Transfer Learning
- Friedrich Nietzsche's Beyond Good and Evil
- 1843 Magazine's Teaching Robots Right from Wrong


Weekly Time Sheet
Please click your name below and enter your page.
First Person
Second Person
Third Person


Currently, I'm:
- a software engineer based in Brooklyn, New York
- building the financial OS as a Senior Software Engineer at Brex,
- and learning native iOS and React Native development.
Previously, I:
- built cashier-free kiosks as a Founding Engineer at Marble,
- helped millions of students around the world with their homework as a Frontend Engineer at Brainly,
- and brought office hours online as Head of Engineering at Bask (acquired).
In my free time, I enjoy:
- listening to many genres of music,
- trying new restaurants and coffeeshops,
- and struggling hard to break 90 strokes in golf.


Contact Information
Welcome to NB Gardens, we have plenty of information on our thriving business but if you have any more questions our helpful team are on deck to answer you, so please do not hesitate to ask.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/Big.20Proof.html ---
I have a question for people who understand how Lean actually works. I had a very big proof that took forever to compile, and sometimes timed out. I broke that proof in two pieces, introducing a completely artificial lemma, statement how to go half way along the road. Now it's super fast. What's happening? I understand there is something called https://github.com/leanprover/lean/issues/1601 which tells me I cannot work interactively with big proofs. But I don't understand why it changes the non-interactive compilation time.
Who is planning to go to Big Proof (May 27-31, Edinburgh)? Usually flying to Europe for a week for me is insane, but I may be able to do this one. Especially if there will be some Lean people there it would be tempting.
I'm going to the Edinburgh thing.
I'll be there Monday to Wednesday
If @Patrick Massot goes, maybe he will finally get an answer to his question from 3 Sep 2018 in this very thread :rolling_on_the_floor_laughing:
I'll be there.
I'll be there through Friday morning.
Do you guys know what you'll talk about?
Ursula did ask me to speak, and I said "OK, schemes/perfectoid spaces, or teaching?" and she didn't reply (yet), so I'm up in the air.
Not yet.
I will also be there and I just created a stream #Big Proof 2019
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


Last updated: 28 February 2020
Books for Bitcoin Core
Here are a few books I have found helpful for understanding Bitcoin Core.
C++ Books
Bitcoin Core is currently written in C++ 11. Here are some C++ book recommendations:
The Reference
Learning C++
- C++ Primer, 5th Edition (more gentle, longer, not to be confused with the knock-off, "C++ Primer Plus")
- Accelerated C++ (condensed, faster, a bit out of date but excellent, exercise solutions here)
Intermediate/advanced
- Effective C++
- Effective Modern C++
- Effective STL
- Exceptional C++
- More Exceptional C++
- C++ Templates: The Complete Guide (1st Edition)
- C++ Templates: The Complete Guide (2nd Edition)
- C++ Concurrency in Action, 2nd Edition
Cryptography
- Elliptic Curve Cryptography: a gentle introduction, a blog series by Andrea Corbellini
- Foundations of Cryptography
- Waxwing's blog by the cryptographer and creator of JoinMarket, Adam Gibson
- A Graduate Course in Applied Cryptography by Dan Boneh
- Cryptopals - A set of cryptographic code challenges
Cheers,
Jon Atack


Sweet Sorrow | Romeo and Juliet in VR
3D Data Visualization of Machine Learning | Discovery Project with Google
She | VR Interactive Story
Peking Opera Mask | AR Coloring Game
Gurrenmare | Multiplayer Cooperation Game
A Day in a Life of a Girl | 2D Interactive Story
It Takes Two Dogs | Two-player Cooperation Game
Hyacinth | 2D Puzzle Game | GGJ 2019
Wizard Knight | 3D TPS Game
Puppet Master | 2D Puzzle Game
Volunteer | G-Fusion Game Show 2019
March | Music Composition