We rly need 2 get organise, so r web masters made us dis rly neet applikation (itz ovah 9000). Teh mane abjective is 2 do better wen we get distracted by Beyondsay and Drak and teh Bachler n stuf. Maek SURE u keep trak of ur task so we kno how good we r doin.
Wen you rly need 2 keep trak of wut u r doin u can use a task. A taks wil has a descripshin of wut u need 2 do an then wen ur dun u can jus have a snack n kick bak!


Highly optimized toolkit for approximately solving L0-regularized learning problems (aka best subset selection). The algorithms are based on coordinate descent and local combinatorial search. For more details, check the paper by Hazimeh and Mazumder (2018) <arXiv:1803.01454>; the link is provided in the URL field below.
| Version: | 1.0.8 |
| Depends: | R (≥ 3.3.0) |
| Imports: | Rcpp (≥ 0.12.13), Matrix, methods, ggplot2, reshape2 |
| LinkingTo: | Rcpp, RcppArmadillo |
| Suggests: | knitr, rmarkdown |
| Published: | 2018-10-29 |
| Author: | Hussein Hazimeh, Rahul Mazumder |
| Maintainer: | Hussein Hazimeh <hazimeh at mit.edu> |
| License: | MIT + file LICENSE |
| URL: | https://arxiv.org/abs/1803.01454 |
| NeedsCompilation: | yes |
| CRAN checks: | L0Learn results |
| Reference manual: | L0Learn.pdf |
| Vignettes: |
L0Learn Vignette |
| Package source: | L0Learn_1.0.8.tar.gz |
| Windows binaries: | r-devel: L0Learn_1.0.8.zip, r-release: L0Learn_1.0.8.zip, r-oldrel: L0Learn_1.0.8.zip |
| OS X binaries: | r-release: L0Learn_1.0.8.tgz, r-oldrel: L0Learn_1.0.8.tgz |
| Old sources: | L0Learn archive |
Please use the canonical form https://CRAN.R-project.org/package=L0Learn to link to this page.


ACKNOWLEDGEMENTS
December 18, 2010
If there is something of interest for the greater public in the dissertation I defended last monday, that is the acknowledgements section. I wrote that last june when I finished the draft and will not add much now, other than explicitly mentioning they are completely honest, they reflect only real feelings (with the exception of the funding institution). I will paste them without any further editting, just as they appear in the manuscript.
This document comprises most of the work I have carried out as a PhD. student during the last four years. It has been a period of my life in which I have had the opportunity to meet, work and learn surrounded by a group of people I feel priviledged for being able tocall friends. Some of them were known; some others appeared down the road that has taken me through different situations, continents and institutions; all of them have collaborated, one way or another, to make this dissertation exist today.
First, it deserves special mention my supervisor, Fernando Sanz-Gracia. Over this time, both personally and through a computer following me all around, his dedication and conﬁdence in every moment, his complete willingness to, far from imposing, leave me make my own decissions and the certainty that, whatever the outcome, he would always be on my side, have made me succeed, and have turned the tutor-student relation into one of
true friendship.This work would have not happened either without the love and inconditional support of my father Antonio, my mother Natividad and my brother Miguel, my grandparents Antonio, Mauricia, Maximiliano and Antonia, as well as the rest of my family, who have been able to understand my need to travel and constantly leave home, and have been a crucial pillar in the toughest times.
Besides my supervisor, Universidad de Zaragoza has given me the chance to get to know other people who, one way or another, have inﬂuenced me. I would like to thank: Marcos Sanso Navarro and Domingo Pérez Ximenez-de-Embún for showing me in the best possible way how a lot of things about the University no book can teach actually work; Marcos Sanso Frago and the rest of the ADETRE research group with whom I have interacted for their valuable comments and contributions; and the group of students who have passed by the Graduate Students Room 1 of the Faculty of Economics, with whom I have shared the experience to get ready a PhD. dissertation, for cheering up and making long days of work more bearable.
These four years have also seen me spend some time in other institutions abroad in which I have been lucky to meet people who have strongly inﬂuenced both my work and my person. I would like to thank: Luc Anselin and Sergio J. Rey for giving me the opportunity to spend 12 months at the GeoDa Center for Geospatial Analysis and Computation, in Tempe (USA), and for being a constant source of inspiration and guidance; Julia Koschinsky for the support given in both contexts academic and personal, as well as for understanding and sharing a common vision of the world, which has created a close friendship; and David Folch, Charles Schmidt, Nancy Lozano-Gracia and the rest of the center staff for kindly welcoming me and sharing so much knowledge with me. Within the Vrije Universiteit in Amsterdam (Netherlands), I would like to thank: Peter Nijkamp and Henk Scholten for inconditionally opening me the Department of Spatial Economics and
SpinLab; Eric Koomen, Chris Jacobs, Chequita R. Bhikhi, Eva Gutiérrez-i-Puigarnau and Michiel Gerritse, as well as the rest of people I got to know during the months I spent in Amsterdam and who, one way or another, made my visit more productive and pleasant.I would like to express my gratitude to the Ministry of Science and Innovation at the Spanish Government (SEJ2006-04893, AP20063563, ECO2009-09332 and FEDER funding) for the ﬁnnancial support.
I want to acknowledge the work and effort put, as well as to thank the free/libre and open source software international community, for showing me a new way to understand cooperative work and providing me with a set of tools without which this document would have not been possible.
I would also like to thank: my closest friends, the RK crew and all the people around the world who love me, for always reminding me who I am and accepting me as such; rap music and urban poetry for showing me the most human side of cities, my subject of study.
Finally, I want to dedicate this work to someone who will never read it: my grandfather, Maximiliano Arribas, who passed away on March 19th. 2010 while I was thousands of kilometers away from home.
Daniel Arribas-Bel
Zaragoza, June 21st. 2010.


Welcome to Engender!
Easily create websites without learning HTML or CSS!
Engender has a easy to use UI and some text tutorials!
/title/This is a code example\title\
/normal/Is this a new line?\normal\


AttachmentSet
public class AttachmentSet
{@code AttachmenSet} implement the operations on the AttachmentSet from a Resource. It provides the set for the attachment.
This object can be created by {@code AttachmentSet}. The following code shows how to create {@code AttachmentSet} by using the {@code AttachmentSet} constructor:
var res = Resource()
var ats = res.attachmentSet(doclinkAttrName: doclinAttrName, relName: relName)
The following examples demonstrate how to build a new {@code AttachmentSet}:
var ats = AttachmentSet()
var ats = AttachmentSet(jo: jsonobject, mc: maximoconnector)
var ats = AttachmentSet(uri: uri, mc: maximoconnector)
The following examples demonstrate how to set the uri and jsonobject for the {@code Attachment}:
ats.href(href: uri)
ats.JsonObject(jo: jo)
The following examples show how to load and reload data:
att.load()
att.reload()
The following examples show how to get AttachmentSet data from the {@code AttachmentSet}:
var jo : [String: Any] = att.toJSON()
var jodata : Data = att.toJSONBytes()
var uri : String = att.getURI()
The following examples show how to create, get, and delete {@code Attachment} from the {@code AttachmentSet}:
var att = ats.create(att: Attachment())
var att = ats.create(relation: relation, att: Attachment())
var att = ats.member(index: index)
var att = ats.member(id: id)
ats.delete(index: index)
ats.delete(id: id)
The following example shows how to get the this page size from the {@code AttachmentSet}:
var currentPageSize : Int = ats.thisPageSize()
-
Initialize object.
Declaration
Swift
public init()
-
Initialize object based on Maximo Connector.
Declaration
Swift
public init(mc: MaximoConnector)
Parameters
mc
Maximo Connector object.
-
Initialize object based on a URI’s information and a Maximo Connector.
Declaration
Swift
public init(href: String, mc: MaximoConnector)
Parameters
href
URI’s information.
mc
Maximo Connector.
-
Initialize the object based on a JSON Array and a Maximo Connector object.
Declaration
Swift
public init(jo: [String : Any], mc: MaximoConnector)
Parameters
jo
JSON information array.
mc
Maximo Connector object.
-
Get current URI
Declaration
Swift
public func getURI() -> String
Return Value
Reference to current URI value.
-
Get AttachmentSet data in JSON
Throws
Declaration
Swift
public func toJSON() throws -> [String : Any]
Return Value
Reference to the current attached data in JSON.
-
Get AttachmentSet data in JSON Bytes
Throws
Declaration
Swift
public func toJSONBytes() throws -> Data
Return Value
Reference to the current attached data in JSON Bytes.
-
Set the URI information.
Declaration
Swift
public func href(href: String) -> AttachmentSet
Parameters
href
URI information.
Return Value
<#return value description#>
-
Set a JSON Object.
Declaration
Swift
public func JsonObject(jo: [String : Any]) -> AttachmentSet
Parameters
jo
JSON Object.
Return Value
<#return value description#>
-
Load the data for the attachment set
Throws
<#throws value description#>Declaration
Swift
public func load() throws -> AttachmentSet
Return Value
Reference to the Attachment See
-
Load the data for the attachment set
Throws
Declaration
Swift
public func load(headers: [String : Any]?) throws -> AttachmentSet
Parameters
headers
Header of the attachment.
Return Value
Reference to the data.
-
Reload attachments.
Throws
Declaration
Swift
public func reload() throws -> AttachmentSet
Return Value
Attachment reloaded.
-
Create a new attachment
Throws
Declaration
Swift
public func create(att: Attachment) throws -> Attachment
Parameters
att
Attachments.
Return Value
Attachment object.
-
Create a new attachment
Throws
<#throws value description#>Declaration
Swift
public func create(relation: String, att: Attachment) throws -> Attachment
Parameters
relation
Relationship information.
att
Attachment.
Return Value
URI of attachment related to a resource.
-
Create a new attachment
Throws
Declaration
Swift
public func create(relation: String, att: Attachment, headers: [String : Any]?) throws -> Attachment
Parameters
relation
String with details of the attachment relationship.
att
Attachment object.
headers
Header’s information.
Return Value
New attachment object.
-
Get the member of the attachment set
Throws
<#throws value description#>Declaration
Swift
public func member(index: Int) throws -> Attachment?
Parameters
index
Int value that represents the index of an attachment in the AttachmentSet.
Return Value
Attachment reference.
-
Get the member of attachment set
Throws
<#throws value description#>Declaration
Swift
public func member(id: String) throws -> Attachment?
Parameters
id
ID value that represents the ID of an attachment in the AttachmentSet map.
Return Value
Attachment reference.
-
Delete an attachment based on a object index.
Throws
Declaration
Swift
public func delete(index: Int) throws -> AttachmentSet
Parameters
index
Attachment’s index.
Return Value
Attachment set reloaded without the deleted object.
-
Delete an attachment based on a object index.
Throws
<#throws value description#>Declaration
Swift
public func delete(id: String) throws -> AttachmentSet
Parameters
ID
Attachment’s ID.
Return Value
Attachment set reloaded without the deleted object.
-
Return this page size.
Throws
Declaration
Swift
public func thisPageSize() throws -> Int
Return Value
Int value represent the page size
-
Fetch member through the URI information and arbitrary array of properties.
Throws
Declaration
Swift
public func fetchMember(uri: String, properties: [String]?) throws -> Attachment
Parameters
uri
URI Information.
properties
String array within arbitrary properties.
Return Value
Attachment object.
-
Fetch member through the URI information and arbitrary array of properties and additional header information.
Throws
<#throws value description#>Declaration
Swift
public func fetchMember(uri: String, headers: [String : Any]?, properties: [String]?) throws -> Attachment
Parameters
uri
uri: URI Information.
headers
Attachment header information.
properties
String array within arbitrary properties.
Return Value
Attachment object.


/*====================================================================* * * Copyright (c) 2011 Qualcomm Atheros Inc. * * Permission to use, copy, modify, and/or distribute this software * for any purpose with or without fee is hereby granted, provided * that the above copyright notice and this permission notice appear * in all copies.  IN NO EVENT SHALL * THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM * LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, * NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN * CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. * *--------------------------------------------------------------------*/ /*====================================================================* * * signed ReadFMI (struct plc * plc, uint8_t MMV, uint16_t MMTYPE); * * plc.h * * read a fragmented message and return a pointer to a buffer that * contains the concatenated message fragments; The buffer address * is returned in plc->content; the calling function must free the * buffer when done; * * buffer length is computed from the number of fragments returned * in the FMI field of the first fragment; * * * Contributor(s): * Charles Maier<EMAIL_ADDRESS>* Nathaniel Houghton<EMAIL_ADDRESS>* *--------------------------------------------------------------------*/ #ifndef READFMI_SOURCE #define READFMI_SOURCE #include <stdint.h> #include <stdlib.h> #include <memory.h> #include "../tools/memory.h" #include "../tools/number.h" #include "../tools/error.h" #include "../plc/plc.h" signed ReadFMI (struct plc * plc, uint8_t MMV, uint16_t MMTYPE) { struct message * message = (struct message *)(plc->message); #ifndef __GNUC__ #pragma pack (push,1) #endif struct __packed frame { struct ethernet_std ethernet; struct homeplug_fmi homeplug; uint8_t content [ETHERMTU - sizeof (struct homeplug_fmi)]; } * frame = (struct frame *) (message); #ifndef __GNUC__ #pragma pack (pop) #endif byte * content = (byte *)(0); unsigned count; unsigned index; if (ReadMME (plc, MMV, MMTYPE) <= 0) { return (-1); } index = ((frame->homeplug.FMID >> 0) & 0x0F); count = ((frame->homeplug.FMID >> 4) & 0x0F); #if 0 printf ("index=%d count=%d batch=%d\n", index, count, frame->homeplug.FMSN); #endif content = plc->content = calloc ((count + 1), sizeof (frame->content)); if (!content) { return (-1); } memcpy (content, frame->content, sizeof (frame->content)); content += sizeof (frame->content); while (index < count) { if (ReadMME (plc, MMV, MMTYPE) <= 0) { free (plc->content); plc->content = NULL; return (-1); } index = ((frame->homeplug.FMID >> 0) & 0x0F); count = ((frame->homeplug.FMID >> 4) & 0x0F); memcpy (content, frame->content, sizeof (frame->content)); content += sizeof (frame->content); } #if 0 hexdump (plc->content, 0, content - (byte *)(plc->content), stdout); #endif return ((signed)(content - (byte *)(plc->content))); } #endif


COMING SOON...
Island Anglers!
An artfuly crafted, incredibly cool
web space & community for anglers and their pals.
Wanna learn more? Click here
Tell Me More... Keep Me Notified!


|
"To be or..." genetic
0.1
This script creates random population and evolves it to reach predefined sentense.
|
Functions | |
| def | fit (_g) |
| def | fitPopulation (_pop) |
| def | sortRanking (_pop, _fit) |
| def | compPropability (_poplen, _lr=0.0) |
| def | pickPairs (_pop, _prop, _numpairs=None) |
| def | crosover (_pairs) |
| def | mutate (_pop, _mr=0.001) |
| def | generateStart (_count) |
Variables | |
| string | patern = "To be or not to be..." |
| Sentence that is the target, should be between 5 and 40 characters. More... | |
| int | poplen = 25 |
| Length of population. More... | |
| int | log = 10000 |
| Maximum number of iteration before loging out data. More... | |
| bool | debug = False |
| True if all steps should be loged out. More... | |
| string | key = "" |
| Holds keyboard input. More... | |
| int | it = 0 |
| Iteration counter. More... | |
| bool | best = False |
| Best individual and its fit value. More... | |
| def | popul = generateStart(poplen) |
| List of individuals in population. More... | |
| def | prop = compPropability(poplen) |
| Propability values for population. More... | |
| def | fitVal = fitPopulation(popul) |
| def | pairs = pickPairs(popul, prop) |
| def tobeornottobe.compPropability | ( | _poplen, | |
_lr = 0.0 |
|||
| ) |
Computes propability based on individuals ranking plase Parameters: _poplen - lenght of population _lr - propability of picking worst individual Returns: Function returns list of propability values
| def tobeornottobe.crosover | ( | _pairs | ) |
Provides one point crossover over given list of idividuals Every odd individual is crossed with even one that comes after Parameters: _pairs - individuals to be cross (length must be even) Returns: Funcion returns new population based created from crosover
| def tobeornottobe.fit | ( | _g | ) |
Computes fit value for given individual Parameters: _g - gen of individual for which fit value will be computed Returns: Function returns a fit value for given individual
| def tobeornottobe.fitPopulation | ( | _pop | ) |
Computes fit values for given population Parameters: _pop - population for which fit values will be computed Returns: Function returns corresponding fit vaues for given population
| def tobeornottobe.generateStart | ( | _count | ) |
This class generates random start population Parameters: _count - number of individuals in population Returns: Function returns generated population as a list
| def tobeornottobe.mutate | ( | _pop, | |
_mr = 0.001 |
|||
| ) |
Mutates population with given mutation rate Parameters: _pop - population to be mutate vith given mutation rate _mr - mutation rate, default 0.1% Returns: Funcion returns mutated population as a list
| def tobeornottobe.pickPairs | ( | _pop, | |
| _prop, | |||
_numpairs = None |
|||
| ) |
Picks pairs of individuals from gicen population which will be crossover Selection is based on given propability values Parameters: _pop - population wrom which pick will be made, if length is not even then will be picked length-1 individuals _prop - propability values for population, should sum to 1 Returns: Function returns selected individuals as a list
| def tobeornottobe.sortRanking | ( | _pop, | |
| _fit | |||
| ) |
Sorts population and fit values due to fit values Parameters: _pop - population to be sorted _fit - fit values related to population Returns: Function returns a tuple of sorted fit values and population
| list tobeornottobe.best = False |
Best individual and its fit value.
| bool tobeornottobe.debug = False |
True if all steps should be loged out.
| tobeornottobe.fitVal = fitPopulation(popul) |
| int tobeornottobe.it = 0 |
Iteration counter.
| tobeornottobe.key = "" |
Holds keyboard input.
| int tobeornottobe.log = 10000 |
Maximum number of iteration before loging out data.
| string tobeornottobe.patern = "To be or not to be..." |
Sentence that is the target, should be between 5 and 40 characters.
| int tobeornottobe.poplen = 25 |
Length of population.
| def tobeornottobe.popul = generateStart(poplen) |
List of individuals in population.
| def tobeornottobe.prop = compPropability(poplen) |
Propability values for population.


This Class represents the body of a Handle/Body idiom of a Cattle for the GiroDeGado software.
More...
#include <cattleImpl.h>
|
| | CattleBody () |
| |
| virtual | ~CattleBody () |
| |
| void | setEarring (QSqlQuery *query, int actual_cattle_earring, int new_cattle_earring) |
| |
| QString | getEarring (QSqlQuery *query, int cattle_earring) const |
| |
| void | setBreed (QSqlQuery *query, int cattle_earring, std::string cattle_breed) |
| |
| QString | getBreed (QSqlQuery *query, int cattle_earring) const |
| |
| void | setAcquisitionDate (QSqlQuery *query, int cattle_earring, std::string cattle_acquisition_date) |
| |
| QString | getAcquisitionDate (QSqlQuery *query, int cattle_earring) const |
| |
| void | setBirthDate (QSqlQuery *query, int cattle_earring, std::string cattle_birth_date) |
| |
| QString | getBirthDate (QSqlQuery *query, int cattle_earring) const |
| |
| void | setFather (QSqlQuery *query, int cattle_earring, int cattle_father) |
| |
| QString | getFather (QSqlQuery *query, int cattle_earring) const |
| |
| void | setMother (QSqlQuery *query, int cattle_earring, int cattle_mother) |
| |
| QString | getMother (QSqlQuery *query, int cattle_earring) const |
| |
| void | setWeight (QSqlQuery *query, int cattle_earring, double cattle_weight) |
| |
| QString | getWeight (QSqlQuery *query, int cattle_earring) const |
| |
| void | setValue (QSqlQuery *query, int cattle_earring, double cattle_value) |
| |
| QString | getValue (QSqlQuery *query, int cattle_earring) const |
| |
| Public Member Functions inherited from Body |
| | Body () |
| | Constructor: zero references when the object is being built. More...
|
| |
| void | attach () |
| | Increases the number of references to this object. More...
|
| |
| void | detach () |
| |
| int | refCount () |
| | Returns the number of references to this object. More...
|
| |
| virtual | ~Body () |
| | Destructor. More...
|
| |
This Class represents the body of a Handle/Body idiom of a Cattle for the GiroDeGado software.
◆ CattleBody() [1/2]
| CattleBody::CattleBody |
( |
const CattleBody & |
cattle | ) |
|
|
private |
This is the copy constructor for the CattleBody Class.
- Parameters
-
◆ CattleBody() [2/2]
| CattleBody::CattleBody |
( |
| ) |
|
◆ ~CattleBody()
| CattleBody::~CattleBody |
( |
| ) |
|
|
virtual |
This is the default destructor for the CattleBody Class.
◆ getAcquisitionDate()
| QString CattleBody::getAcquisitionDate |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring |
|
) |
| const |
Returns the acquisition date of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
- Returns
- QString - the content acquisition date attribute.
◆ getBirthDate()
| QString CattleBody::getBirthDate |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring |
|
) |
| const |
Returns the birth date of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
- Returns
- QString - the content birth date attribute.
◆ getBreed()
| QString CattleBody::getBreed |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring |
|
) |
| const |
Returns the breed of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
- Returns
- QString - the content Breed attribute.
◆ getEarring()
| QString CattleBody::getEarring |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring |
|
) |
| const |
Returns the earring of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
- Returns
- QString - the content earring attribute.
◆ getFather()
| QString CattleBody::getFather |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring |
|
) |
| const |
Returns the father's earring of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
- Returns
- QString - the content father attribute.
◆ getMother()
| QString CattleBody::getMother |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring |
|
) |
| const |
Returns the mother's earring of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
- Returns
- QString - the content mother attribute.
◆ getValue()
| QString CattleBody::getValue |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring |
|
) |
| const |
Returns the value of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
- Returns
- QString - the content value attribute.
◆ getWeight()
| QString CattleBody::getWeight |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring |
|
) |
| const |
Returns the weight of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
- Returns
- QString - the content weight attribute.
◆ operator=()
This is the overloaded assignment operator for the CattleBody Class.
◆ setAcquisitionDate()
| void CattleBody::setAcquisitionDate |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring, |
|
|
std::string |
cattle_acquisition_date |
|
) |
| |
Sets the acquisition date of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
| cattle_acquisition_date | which will be set to the current Cattle. |
◆ setBirthDate()
| void CattleBody::setBirthDate |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring, |
|
|
std::string |
cattle_birth_date |
|
) |
| |
Sets the birth date of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
| cattle_birth_date | which will be set to the current Cattle. |
◆ setBreed()
| void CattleBody::setBreed |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring, |
|
|
std::string |
cattle_breed |
|
) |
| |
Sets the breed of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
| cattle_breed | which will be set to the current Cattle. |
◆ setEarring()
| void CattleBody::setEarring |
( |
QSqlQuery * |
query, |
|
|
int |
actual_cattle_earring, |
|
|
int |
new_cattle_earring |
|
) |
| |
Sets the earring of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| actual_cattle_earring | the earring of the current Cattle. |
| new_cattle_earring | which will be set to the current Cattle. |
◆ setFather()
| void CattleBody::setFather |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring, |
|
|
int |
cattle_father |
|
) |
| |
Sets the father's earring of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
| cattle_father | which will be set to the current Cattle. |
◆ setMother()
| void CattleBody::setMother |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring, |
|
|
int |
cattle_mother |
|
) |
| |
Sets the mother's earring of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
| cattle_mother | which will be set to the current Cattle. |
◆ setValue()
| void CattleBody::setValue |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring, |
|
|
double |
cattle_value |
|
) |
| |
Sets the value of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
| cattle_value | which will be set to the current Cattle. |
◆ setWeight()
| void CattleBody::setWeight |
( |
QSqlQuery * |
query, |
|
|
int |
cattle_earring, |
|
|
double |
cattle_weight |
|
) |
| |
Sets the weight of the current cattle in the database.
- Parameters
-
| query | the query of a database. |
| cattle_earring | the earring of the current Cattle. |
| cattle_weight | which will be set to the current Cattle. |
The documentation for this class was generated from the following files:


Education & Training Organization
We offer the most complete course pakage in the country, for the research, design and development of Education.
Recent and upcoming educational events listed here
German final week mother of god grey viverra no computer unlock impossibru. Pikachu grin venenatis cuteness…
view detailsShare your work to collaboratve with our vibrant design element.
Areas tackled in the most fundamental part of medical research include cellu lar and molecular biology…
Areas tackled in the most fundamental part of medical research include cellu lar and molecular biology…
Areas tackled in the most fundamental part of medical research include cellu lar and molecular biology…


SODA is a desktop software intended to facilitate data curation and sharing for SPARC researchers
Navigate through the app using the sidebar


The player supports the use of fluid layouts for dynamically adjusting the player size
to it's surrounding contents.
To use this functionality, simply add the 'cld-fluid' css class to the player, or pass
'fluid: true' to the player's constructor.
Try decreasing the window size to see the fluid layout support in action.
Use the toggle button below the player toggle the 'fluid layout support' feature.
<video id="example-player" controls muted autoplay class="cld-video-player cld-video-player-skin-dark cld-fluid" data-cld-transformation='{ "width": 500, "crop": "limit" }'> </video> <br /> <button id="toggle-fluid" class="btn btn-default">Disable Fluid</button>
var cld = cloudinary.Cloudinary.new({ cloud_name: 'miki-cloudinary' }); // Initialize player var player = cld.videoPlayer('example-player'); // Define source var source = { publicId: 'oceans', info: { title: 'Oceans', subtitle: 'A movie about oceans' } }; // Play source player.source(source).play(); // Handle Fluid toggle button document.querySelector("button#toggle-fluid").addEventListener("click", function() { isFluid = !player.fluid() player.fluid(isFluid); this.innerHTML = isFluid ? 'Disable Fluid' : 'Enable Fluid' });


Created on: {{service.users.created_at|date|uppercase}} Public Repos: {{service.users.public_repos}} Company: {{service.users.company}}
{{repo.name}} View this repo in git
Forks: {{repo.forks}}


Review1Review Session for First Midterm
General Notes
Standard vs. Advanced Exams
- Unlike the homework assignments, we will make up two completely
separate versions of the exam — a "standard exam" and an
"advanced exam." They will share some problems, but there will
be problems on each that are not on the other.
You can choose to take whichever one you want at the beginning
of the exam period.
Grading
- Meaning of grades:
- A = mastery of all or almost all of the material
- B = good understanding of most of the material, perhaps with
a few gaps
- C = some understanding of most of the material, with
substantial gaps
- D = major gaps
- F = didn't show up / try
- There is no pre-determined curve. We'd be perfectly delighted
to give everyone an A (for the exam, and for the course).
- Except: A+ grades will be given only for completing the
advanced track.
- Standard and advanced exams will be graded relative to different
expectations (i.e., "the material" is different)
Hints
- On each version of the exam, will be at least one problem taken
more or less verbatim from a homework assignment.
- On the advanced version, there will be an informal proof.
Expressions and Their Types
Thinking about well-typed expressions and their types is a great
way of reviewing many aspects of how Coq works...
(Discussion of Coq's view of the universe...)
More Type Checking
Good luck on the exam!


Boiler Room * * (out of * * * * )
Directed by Ben Younger. Cast: Giovanni Ribisi, Vin Diesel, Nia Long, Nicky Katt, Ron Rifkin, Ben Affleck, Scott Caan, Jamie Kennedy, Tom Everett Scott, Taylor Nichols, Bill Sage. 2000 - 119 minutes Rated R (for profanity). Reviewed by Dustin Putman, February 20, 2000.
29-year-old director Ben Younger's "Boiler Room" has already been heavily touted as an all-twentysomething version of 1987's "Wall Street," and even 1992's "Glengary Glen Ross." A morality tale about greed, corruption, and heartless dishonesty within a crooked stockbroking firm located way out on Long Island, our 19-year-old college drop-out protagonist, Seth Davis (Giovanni Ribisi), is not exactly what you would call an angel, either. Holding an illegal amateur casino outside of his home's basement in Queens, Seth is rolling in the dough and enjoying every second of it, until one night he meets gambler Greg (Nicky Katt), who makes him realize he can't waste his whole life doing this.
Before long, Seth has joined Greg and a slew of other thriving young men at the high-pressured, cutthroat brokerage firm of J.T. Marlin. Promised by the firm's 27-year-old head recruiter, Jim Young (Ben Affleck), to be making a million dollars within the initial three years of working there, Seth begins to get his first real taste of the outside adult world, and starts hanging out with some of his coworkers, including the understanding Chris (Vin Diesel) and hot-tempered Richie (Scott Caan). Out of all of his new friends, some of which he obviously doesn't fit in with, Seth is able to open up the most with Abby (Nia Long), the African-American receptionist who has decided to stay at the all-white firm because of her own generous paychecks, which help her to take care of her ill mother. It doesn't take too much time for Seth to realize that the employees of J.T. Marlin are fraudulent stockbrokers who knowingly are taking the money of innocent, potential clients, and the worse thing is, Seth discovers he is turning out just like them.
Littered with a soundtrack of rap music in a motion picture made up almost entirely of white males, but which adds an unexpected edge to certain memorable moments, "Boiler Room" is a drama about a group of people who are rotten to the core, without any qualms about being deceitful and uncaring, just as long as they are making some quick bucks; and a few select souls who are the conscious of the film--people who may also do things wrong within the course of the picture, but who are able to at least recognize their mistakes. Equipped with a superfluous editing style that would be more at home on MTV or in a relatively innocent comedy like 1999's "Detroit Rock City," sticks out like a sore thumb here. With flashy jump-cuts and shots that purposefully match the music, editor Chris Peppe does his job professionally but it was unwise for director Younger to decide on such a distracting approach.
"Boiler Room" takes place in a savagely cold environment, but the film is not without its dramatic character moments for Seth, particularly in the scenes with his unflaggingly disapproving and stern father (Ron Rifkin). Oddly, then, one of the film's major pitfalls is its resolutely sterile emotions. Even when we are supposed to invest our interest in Seth, as well as his relationships with his father and Abby, the whole movie has a strangely detached feeling to it, and while a few of the performances are top-notch (okay, only Ben Affleck's cockily assured multimillionaire has the ability to grab you by the throat every time he appears), the rest of the cast and writer-director Younger never seem to fully have their hearts in the material.
As the undoubted central character of Seth, Giovanni Ribisi is an offbeat performer without the Hollywood-style good looks or leading-man potential, but who does his job respectably. Best in his less demanding moments, Ribisi ultimately does not, however, pull off the emotional breakdown sequence with his father, which feels like it's right out of Acting 101. The fresh appearance of Nia Long, as Abby, is appreciated, but she is generally underutilized, and the romantic subplot that is sparked between Seth and she has not an ounce of chemistry or passion, nor is it even necessary or come with a satisfying payoff.
But the disappointing wrap-up of their relationship is apparently only in staying with the rest of the film. "Boiler Room" had enough of my rooting attention to get a marginal pass from me throughout its running time, but the finale, to put it mildly, is a bust. Setting itself up for so very much more than actually is present, not only is the character arc of Seth predictable, but the way all of the elements around him are dealt with is an unconvincing cop-out, leaving you in the theater commenting to yourself: "I just dedicated two hours of my life to a movie that led up to that?" Filmmaker Ben Younger set out to make a thought-provoking rumination on the power of money and the people it affects, but all he really has done is made a motion picture that, for all of its potential, never breaks away from being merely skin-deep.
- Copyright 2000 by Dustin Putman Http://www.young-hollywood.com Http://www.atnzone.com
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


|
Panda3D
|
A container for an "entity tag" from an HTTP server. More...
Public Member Functions | |
| __init__ () | |
| __init__ (bool weak, str tag) | |
| This constructor accepts an explicit weak flag and a literal (not quoted) tag string. More... | |
| __init__ (const HTTPEntityTag copy) | |
| __init__ (str text) | |
| This constructor accepts a string as formatted from an HTTP server (e.g. More... | |
| int | compareTo (const HTTPEntityTag other) |
| Returns a number less than zero if this HTTPEntityTag sorts before the other one, greater than zero if it sorts after, or zero if they are equivalent. More... | |
| str | getString () |
| Returns the entity tag formatted for sending to an HTTP server (the tag is quoted, with a conditional W prefix). More... | |
| str | getTag () |
| Returns the tag as a literal string. More... | |
| bool | isWeak () |
| Returns true if the entity tag is marked as "weak". More... | |
| bool | operator!= (const HTTPEntityTag other) |
| bool | operator< (const HTTPEntityTag other) |
| HTTPEntityTag | operator= (const HTTPEntityTag copy) |
| bool | operator== (const HTTPEntityTag other) |
| output (Ostream out) | |
| bool | strongEquiv (const HTTPEntityTag other) |
| Returns true if the two tags have "strong" equivalence: they are the same tag, and both are "strong". More... | |
| bool | weakEquiv (const HTTPEntityTag other) |
| Returns true if the two tags have "weak" equivalence: they are the same tag, and one or both may be "weak". More... | |
A container for an "entity tag" from an HTTP server.
This is used to identify a particular version of a document or resource, particularly useful for verifying caches.
| __init__ | ( | ) |
| __init__ | ( | bool | weak, |
| str | tag | ||
| ) |
This constructor accepts an explicit weak flag and a literal (not quoted) tag string.
| __init__ | ( | const HTTPEntityTag | copy | ) |
| __init__ | ( | str | text | ) |
This constructor accepts a string as formatted from an HTTP server (e.g.
the tag is quoted, with an optional W/ prefix.)
| int compareTo | ( | const HTTPEntityTag | other | ) |
Returns a number less than zero if this HTTPEntityTag sorts before the other one, greater than zero if it sorts after, or zero if they are equivalent.
| str getString | ( | ) |
Returns the entity tag formatted for sending to an HTTP server (the tag is quoted, with a conditional W prefix).
| str getTag | ( | ) |
Returns the tag as a literal string.
| bool isWeak | ( | ) |
Returns true if the entity tag is marked as "weak".
A consistent weak entity tag does not guarantee that its resource has not changed in any way, but it does promise that the resource has not changed in any semantically meaningful way.
| bool operator!= | ( | const HTTPEntityTag | other | ) |
| bool operator< | ( | const HTTPEntityTag | other | ) |
| HTTPEntityTag operator= | ( | const HTTPEntityTag | copy | ) |
| bool operator== | ( | const HTTPEntityTag | other | ) |
| output | ( | Ostream | out | ) |
| bool strongEquiv | ( | const HTTPEntityTag | other | ) |
Returns true if the two tags have "strong" equivalence: they are the same tag, and both are "strong".
| bool weakEquiv | ( | const HTTPEntityTag | other | ) |
Returns true if the two tags have "weak" equivalence: they are the same tag, and one or both may be "weak".


|
Stereo Vision Toolkit
1.3.1
|
Calibrate from images dialog. More...
#include <calibratefromimagesdialog.h>
Signals | |
| void | run_calibration () |
| Emit to run calibration. | |
Public Member Functions | |
| CalibrateFromImagesDialog (QWidget *parent=0) | |
| QList< cv::Mat > | getLeftImages () |
| Get left images. More... | |
| QList< cv::Mat > | getRightImages () |
| Get right images. More... | |
| int | getPatternCols () |
| Get number of columns in pattern. More... | |
| int | getPatternRows () |
| Get number of rows in pattern. More... | |
| double | getSquareSizeMm () |
| Get square size of pattern. More... | |
| bool | getSaveROS () |
| Get if saving ROS calibration files. More... | |
| QString | getOutputPath (void) |
| Get output path where files are being saved. More... | |
Private Slots | |
| void | selectLeftImageRoot (void) |
| Select left image root (open file dialog) | |
| void | selectRightImageRoot (void) |
| Select right image root (open file dialog) | |
| void | selectOutputPath () |
| Select output path (open file dialog) | |
| void | updateLeftMask (void) |
| Update left mask. | |
| void | updateRightMask (void) |
| Update left mask. | |
| void | findImages (void) |
| Find images. | |
| void | updateLeftPath (void) |
| Update left path from GUI and check it's valid. | |
| void | updateRightPath (void) |
| Update right path from GUI and check it's valid. | |
| void | updateOutputPath (void) |
| Update output path from GUI and check it's valid. | |
| void | setLeftImages (void) |
| Set left images. | |
| void | setRightImages (void) |
| Set right images. | |
| void | okClicked (void) |
| Ok button clicked (Run calibration) | |
| void | cancelClicked (void) |
| Cancel button clicked (Close window) | |
Private Member Functions | |
| void | checkImageCount (void) |
| Check number of images found. | |
Private Attributes | |
| Ui::CalibrateFromImagesDialog * | ui |
| QT UI dialog. | |
| QString | output_path = "" |
| Output path for calibration files. | |
| QString | left_path = "" |
| Folderpath to search for left images. | |
| QString | right_path = "" |
| Folderpath to search for right images. | |
| QString | left_mask = "" |
| Extension filters to search for left images (e.g. .JPEG) | |
| QString | right_mask = "" |
| Extension filters to search for right images (e.g. .JPEG) | |
| QFileSystemModel * | left_file_model |
| Search model for finding left images. | |
| QFileSystemModel * | right_file_model |
| Search model for finding right images. | |
| QList< cv::Mat > | left_image_list |
| List of left images found. | |
| QList< cv::Mat > | right_image_list |
| List of right images found. | |
| QSettings * | settings |
| App settings used to retreive 'calLeftDir', 'calRightDir' and 'calDir'. | |
Calibrate from images dialog.
Dialog for performing stereo calibration from images
Definition at line 31 of file calibratefromimagesdialog.h.
|
inline |
|
inline |
Get output path where files are being saved.
Definition at line 62 of file calibratefromimagesdialog.h.
| int CalibrateFromImagesDialog::getPatternCols | ( | ) |
Get number of columns in pattern.
Definition at line 69 of file calibratefromimagesdialog.cpp.
| int CalibrateFromImagesDialog::getPatternRows | ( | ) |
Get number of rows in pattern.
Definition at line 73 of file calibratefromimagesdialog.cpp.
|
inline |
| bool CalibrateFromImagesDialog::getSaveROS | ( | ) |
Get if saving ROS calibration files.
Definition at line 81 of file calibratefromimagesdialog.cpp.
| double CalibrateFromImagesDialog::getSquareSizeMm | ( | ) |
Get square size of pattern.
Definition at line 77 of file calibratefromimagesdialog.cpp.


Enter an address then click the locate button in order to display the location on the map. Once the location is returned, then all the ambulances within 1000 meters will display and a result will print on the left pane.
Sample addresses (copy one and past it in the text area above)
1) 1700 Park Ave, Redlands, California, USA
2) 380 New York St, Redlands


bullhorn_interface package¶
Submodules¶
bullhorn_interface.api module¶
-
bullhorn_interface.api.
AND
(*args, **kwargs)[source]¶ Facilitates building of queries for use with api_search and api_query
Parameters: - args – (args) query strings to be combined with AND
- kwargs – (kwargs) key/value pairs to be combined with AND
Returns:
-
class
bullhorn_interface.api.
Interface
(username='', password='', max_connection_attempts=5, max_refresh_attempts=10, independent=True)[source]¶ Bases:
object
-
api_call
(command='', method='', entity='', entity_id='', select_fields='*', query='', body='', attempt=0, **kwargs)[source]¶ Serves as an abstract Python API layer for Bullhorns REST API
Parameters: - command – (str) command that bullhorn accepts (see bullhorn api reference material)
- method – (str) HTTP verbs telling the API how you want to interact with the data (“GET”, “POST”, “UPDATE”, “DELETE)
- entity – (str) Bullhorn entity that you wish to interact with
- entity_id – (int, str) (sometimes optional) numeric id corresponding to the desired entity, required for all POST and UPDATE commands
- select_fields – (str, list) fields desired in response from API call
- query – (str) SQL style query string (only used when command=”search” and command=”query”)
- body – (dict) dictionary of items to be posted during “UPDATE” or “POST” (when command=”entity” or command=”entityFiles”)
- attempt – (int) nth attempt at the api_call, after 10 attempts it will stop attempting the call
- kwargs – (kwargs) additional parameters to be passed to the request URL (count=100 becomes &count=100)
Returns: hopefully a dict with the key “data” with a list of the searched, queried, added, or updated data
-
api_create
(entity='', select_fields='*', **kwargs)[source]¶ Creates an entity of the specified type with the specified passed kwargs.
Parameters: - entity – (str) desired entity type to be created
- select_fields – (list, str) SELECT fields to be returned by the API call
- kwargs – (kwarg) attributes that the created entity will have *ex: interface.api_create(entity=”Candidate”, lastName=”Doe”, firstName=”John”, name=”John Doe”)
Returns: (dict) hopefully a dictionary with a key called ‘data’ in it with info about the newly created entity
-
api_delete
(entity='', entity_id='')[source]¶ Deletes the specified entity with the specified entity_id.
Parameters: - entity – (str) Bullhorn entity type to be deleted
- entity_id – (int, str) Bullhorn ID of entity to be deleted
Returns: tells you if it worked or gives an error message
-
api_query
(entity='', where='', select_fields='*', **kwargs)[source]¶ Conducts a Query using SQL style where clauses with the given parameters passed to api_call
Parameters: - entity – (str) Bullhorn Entity that is being queried
- where – (SQL str) SQL style where clause for query
- select_fields – (list, str) list of fields to be selected in query
- kwargs – (kwargs) additional kwargs to be passed to api_call
Returns: (dict) hopefully a dictionary with a key called ‘data’ in it with a list of your desired results
-
api_search
(entity='', entity_id='', query='', select_fields='*', count='500', **kwargs)[source]¶ Conducts an API search with the given parameters passed to api_call
Parameters: - entity – (str) Bullhorn Entity that is being searched
- entity_id – (str, int) optional numeric id corresponding to the desired entity
- query – (str) string describing SQL style query, overrides entity_id
- select_fields – (str, list) fields returned by API response
- count – (str, int) number of records returned by API call, is ignored if greater than 500
- kwargs – (kwargs) values to be passed with AND to the query (supports equivalence only) * example: interface.api_search(entity=”ClientCorporation”, id=44) will have query=”id:44” * example: interface.api_search(entity=”ClientCorporation”, query=”numOffices IN [1 TO 100]”, status=‘“Active Account”’) will have query=’numOffices IN [1 TO 100] AND status:”Active Account”’
Returns: (dict) hopefully a dictionary with a key called ‘data’ in it with a list of your desired results
-
api_update
(entity='', entity_id='', select_fields='*', **kwargs)[source]¶ Updates the specified entity with the specified entity_id and the parameters passed as keyword objects.
Parameters: - entity – (str) Bullhorn entity type to be updated
- entity_id – (int, str) Bullhorn ID of entity to be updated
- select_fields – (list, str) SELECT fields to be returned by the API call
- kwargs – attributes that the updated entity will have *ex: interface.api_update(entity=”Candidate”, entity_id=1, phone=”555-555-5555”)
Returns:
-
fresh
(independent=False, attempt=1, max_attempts=10)[source]¶ Keeps auth tokens and API tokens from getting stale. Behavior varies with interface type.
Parameters: - independent – (bool) indicates whether the Interface object is in charge of refreshing its own tokens
- attempt – (int) nth attempt, passed to any login or refresh method
- max_attempts – (int) number of attempts before fresh stops attempting to login or refresh the token
Returns: (bool) whether or not the token(s) is/are fresh
-
get_api_token
(attempt=0)[source]¶ Uses auth token to get an API access token and url which are required to query the REST API
Parameters: attempt – (int) nth attempt Returns:
-
get_file_info
(entity='', entity_id='', select_fields='*')[source]¶ Parameters: - entity – (str) Bullhorn entity type corresponding to the desired files
- entity_id – (str, int) numeric id corresponding to the desired entity
- select_fields – (str, list) (default is “*”) fields to be returned from api_call
Returns: hopefully a dict with the key “data” with a list of a single member corresponding to the desired entityFiles
-
get_token
(*args)[source]¶ Method to retrieve auth or api token. Implementation varies with interface type.
Parameters: args – Returns:
-
grab_tokens
()[source]¶ Method to get both auth and api tokens. Implementation varies with interface type.
Returns:
-
login
(code='', attempt=0)[source]¶ Grants an auth token to valid credentials or provides a method to manually login
Parameters: - code – (str) (sometimes optional) auth code for authenticating through the browser
- attempt – (int) nth login attempt
Returns:
-
refresh_token
(attempt=0)[source]¶ Refreshes an existing API token
Parameters: attempt – (int) nth attempt at refreshing token Returns:
-
save_file_from_url
(url='', path='')[source]¶ Save a file stored in bullhorn from the specified url (url can be retrieved using get_file_info)
Parameters: - url – url pointing to desired file
- path – fully qualified path or file name (use forward slashes regardless of os) * example: path=’/path/to/file.png’ stores in /path/to/file.png * example: path=’file.png’ stores in /current/working/directory/file.png
Returns: None
-
-
class
bullhorn_interface.api.
LiveInterface
(username='', password='', max_connection_attempts=5, max_refresh_attempts=10, independent=True)[source]¶
-
bullhorn_interface.api.
OR
(*args, **kwargs)[source]¶ Facilitates building of queries for use with api_search and api_query
Parameters: - args – (args) query strings to be combined with OR
- kwargs – (kwargs) key/value pairs to be combined with OR
Returns:
bullhorn_interface.helpers module¶
bullhorn_interface.tests module¶
-
class
bullhorn_interface.tests.
InterfaceConfigured
(methodName='runTest')[source]¶ Bases:
unittest.case.TestCase
-
config_exists
()[source]¶ Tests to see that the region bullhorn_interface config file has configurations :return:
-


nips nips2004 nips2004-123 nips2004-123-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: K. Wong, S. W. Lim, Z. Gao
Abstract: We consider multi-agent systems whose agents compete for resources by striving to be in the minority group. The agents adapt to the environment by reinforcement learning of the preferences of the policies they hold. Diversity of preferences of policies is introduced by adding random biases to the initial cumulative payoffs of their policies. We explain and provide evidence that agent cooperation becomes increasingly important when diversity increases. Analyses of these mechanisms yield excellent agreement with simulations over nine decades of data. 1
[1] G. Weiß and S. Sen, Adaption and Learning in Multi-agent Systems, Lecture Notes in Computer Science 1042 (Springer, Berlin, 1995).
[2] E. Rasmusen, Games and Information (Basil Blackwell, Oxford, 2001).
[3] D. Challet and Y. C. Zhang, Emergence of Cooperation and Organization in an Evolutionary Game, Physica A 246, pp. 407-418 (1997).
[4] R. Savit, R. Manuca, and R. Riolo, Adaptive Competition, Market Ef£ciency, and Phase Transitions, Phys. Rev. Lett. 82, pp. 2203-2206 (1999).
[5] K. Y. M. Wong, S. W. Lim, and P. Luo, Diversity and Adaptation in Large Population Games, Int. J. Mod. Phys. B 18, 2422-2431 (2004).
[6] K. Y. M. Wong, S. W. Lim, and Z. Gao, Dynamical Mehanisms of Adaptation in Multi-agent Systems, Phys. Rev. E 70, 025103(R) (2004).


Showcasing datasets released since the beginning of this year
Recently, we released our second year strategy, which we’re really excited about! We’ve had our heads down this past year working diligently to get things lined up with the wonderful support of our data coordinators and colleagues throughout the City. In the coming year, we expect to be increasing our publishing and talking more about it with as many people as we can.
While we’re making our publishing program as transparent as possible with DataSF In Progress and the companion department publishing plans, we want to make sure we do more to increase dataset discovery over time. A lot of love goes into making data available, and we would hate for all that work to go unnoticed and unused.
Below is our first dataset roundup organized by category. Future roundups will cover the prior quarter of data releases, but we’re catching up, so these go back to the beginning of the year. These will be broader than they are deep, but hopefully you’ll find something you want to dig into and understand more. While you’re poking around, don’t forget to show a little love to departments for making these datasets available. Click on the links below to “tweet your appreciation” at the publishing departments in each category.
City Infrastructure
DPW Street & Sidewalk Evaluation Results, 7-1-2013 to Present - The Controller’s Office’s City Services Auditor (CSA) Division has worked with the Department of Public Works (DPW) to develop maintenance standards for streets and sidewalks and schedules and inspect for compliance since July 2004. This dataset contains street and sidewalk evaluation results since 7/1/2013 under the new FY12 standards. You can also access the annual reports in PDF under “street maintenance” here.
Large Utility Excavation Permits - The Department of Public Works (DPW) publishes this subset of large utility excavation permits (>=1000 square feet total size) in the last year. Its primary purpose is to support the Dig Once program, a collaboration among DPW the Department of Technology and others involved in street and infrastructure improvements
Existing SF Commercial Wireless Facilities - April 2015 -This is a compilation of data provided by wireless carriers and is maintained by the Planning Department updated as needed. This dataset has the locations of each of the commercial wireless facilities.
City Management and Ethics
Ethics Commission datasets the Ethics Commission continues to be one of the most prolific publishers on the open data portal. Here’s a summary of datasets too many to enumerate individually:
- A number of updated Campaign Finance Reports ahead of the upcoming election
- Behested payment reports for payments made at the behest of public officials that are not presumed to be contributions
- Lobbyists on behalf of the City, which is distinct from the lobbyists influencing the City
- Statement of Economic Interest list of non-filers
- Among others
Web Analytics for SFGov Sites - 2015 (Q1+Q2) the Department of Technology has started publishing quarterly web analytics for sites in the SFGov domain. This does not include websites managed independently by departments.
DataSF datasets We’ve published both the dataset inventory and a dataset of department planning and inventory status, which are used together to track our progress and report on individual department progress.
Energy and Environment
Urban Bird Refuge - the adopted Standards for Bird-Safe Buildings explains the documented risks that structures present to birds. Over thirty years of research has proven the risk to be biologically significant for certain bird species. This geospatial dataset maps out areas of particular risk to birds. These areas are within 300ft of: open water, inland water bodies greater than 2 acres in size, open space greater than 2 acres, the shoreline. For more information visit the Standards for Bird-Safe Buildings web site
Green Connections Network - Green Connections aims to increase access to parks, open spaces, and the waterfront by envisioning a network of “green connectors”, city streets that will be upgraded incrementally over the next 20 years to make it safer and more pleasant to travel to parks by walking, biking, and other forms of active transportation. Further information can be found on the Green Connections website.
Geographic Locations and Boundaries
California Register Districts and National Register Districts Each of these two datasets are district boundaries that are either listed or determined eligible to be listed by San Francisco Planning Department preservation staff. One for California Register Districts and another for the National Register. You can learn more about these district designations on the State’s Office of Historic Preservation website.
Orthophoto mosaic of San Francisco proper (2014) - 10cm per pixel (zipped MrSID format) - looking for detailed imagery of San Francisco? Look no further.
Potential Locations For Medical Cannabis Dispensaries - Locations may be used as an initial guide for investigating possible Medical Cannabis Dispensary (MCD) locations, but these do not superced applicable requirements in the Planning Code. The data shows: areas which are zoned to allow new MCDs; areas not located within 1,000’ of a school. The data does not show: uses which further restrict MCD locations including (i.e. community facilities, recreation buildings, and substance abuse treatment centers). The data is based on the best information available at the time of publication (Sept 2010).
Right of Way Polygons This is an oft requested layer representing the “paved” portion of the right of way. The Department of Public Works (DPW) published this in answer to a request. This layer is not drawn to engineering specifications and should be used accordingly either as a display layer or for very rough estimations regarding the right of way area.
Health and Social Services
Community Resiliency Indicator System The Community Resiliency Indicator System was developed by San Francisco’s Climate and Health Program managed by the Department of Public Health (DPH) and is part of San Francisco’s Climate and Health Profile. The dataset represents the system including 40 indicators and an additive index which is a compilation of all of the indicators. You can visit http://sfclimatehealth.org for more.
Permitted Medical Cannabis Dispensaries As of December 31st, 2014, there were 28 Permitted Medical Cannabis Dispensaries (MCD) operating in the City and County of San Francisco. This dataset shows their locations. The Department of Public Health issues a permit to operate an MCD once approvals are granted by the Department of Building Inspection, Planning Department, Fire Department and The Mayor’s Office of Disability. A permit does not overrule state and federal laws regarding cannabis enforcement.
Housing and Buildings
2014 Housing Inventory - This report is the 45th in the series and describes San Francisco’s housing supply. Housing Inventory data accounts for new housing construction, demolitions, and alterations in a consistent format for analysis of housing production trends.
SF Development Pipeline 2015 Q1 - The Planning Department publishes a quarterly report tracking the development pipeline in San Francisco. The latest one is for the first quarter of 2015.
Annual Allowable Rent Increase for Units Under Rent Control - In accordance with Rules and Regulations Section 1.12, the Rent Board of Arbitration sets the annual allowable rent increase for rent controlled units. The new rates are effective every year on March 1. The amount is based on 60% of the percentage increase in the Consumer Price Index (CPI) for All Urban Consumers in the San Francisco-Oakland-San Jose region for the 12-month period ending October 31, as blog-posted in November by the Bureau of Labor Statistics.
Eviction Notices - Data includes eviction notices filed with the San Francisco Rent Board per San Francisco Administrative Code 37.9(c). A notice of eviction does not necessarily indicate that the tenant was eventually evicted, so the notices below may differ from actual evictions.
Requests for Information Regarding Protected Status Related to Owner Move-In Evictions - This dataset includes requests for information filed with the San Francisco Rent Board under the SF Admin. Code. Under the Code, residents receiving an eviction notice may claim protected status either due to age and/or disability and length of tenancy or based on length of tenancy and occupancy of a child under the age of 18 during the school year. They need not be filed as estoppels. However, it has become common practice to add the request pursuant to the codes to estoppels, which is a legal term for limiting a legal action that could normally be taken, e.g. evicting.
Green Roofs in San Francisco - This layer is the data feeding into the San Francisco Green Roofs web map. This map and further information about green roofs in San Francisco can be found at the Planning Department’s Green Roofs website.
Land Use - The Planning Department publishes the land use categories for every parcel in San Francisco in this geographic dataset. The land use categories are derived from a range of City and commercial databases.
Residential projects with inclusionary requirements - Subject to Planning Code Section 415, developments of 10 or more units fall under the City’s Inclusionary Affordable Housing Program. Data on residential projects are collected through the lifecycle of the projects by the Planning Department and the Department of Building Inspection. On a quarterly basis, the Mayor’s Office of Housing and Community Development works with Planning to produce a list for tracking and monitoring of these projects. This data is also featured in the housing data hub, which showcases programs, policies and data related to housing in San Francisco.


Arduino is an open-source electronics platform based on easy-to-use hardware and software. Arduino boards are able to read inputs - light on a sensor, a finger on a button, or a Twitter message - and turn it into an output - activating a motor, turning on an LED, publishing something online. You can tell your board what to do by sending a set of instructions to the microcontroller on the board. To do so you use the Arduino programming language (based on Wiring), and the Arduino Software (IDE), based on Processing.
Over the years Arduino has been the brain of thousands of projects, from everyday objects to complex scientific instruments. A worldwide community of makers - students, hobbyists, artists, programmers, and professionals - has gathered around this open-source platform, their contributions have added up to an incredible amount of accessible knowledge that can be of great help to novices and experts alike.
Arduino was born at the Ivrea Interaction Design Institute as an easy tool for fast prototyping, aimed at students without a background in electronics and programming. As soon as it reached a wider community, the Arduino board started changing to adapt to new needs and challenges, differentiating its offer from simple 8-bit boards to products for IoT applications, wearable, 3D printing, and embedded environments. All Arduino boards are completely open-source, empowering users to build them independently and eventually adapt them to their particular needs. The software, too, is open-source, and it is growing through the contributions of users worldwide.
Thanks to its simple and accessible user experience, Arduino has been used in thousands of different projects and applications. The Arduino software is easy-to-use for beginners, yet flexible enough for advanced users. It runs on Mac, Windows, and Linux. Teachers and students use it to build low cost scientific instruments, to prove chemistry and physics principles, or to get started with programming and robotics. Designers and architects build interactive prototypes, musicians and artists use it for installations and to experiment with new musical instruments. Makers, of course, use it to build many of the projects exhibited at the Maker Faire, for example. Arduino is a key tool to learn new things. Anyone - children, hobbyists, artists, programmers - can start tinkering just following the step by step instructions of a kit, or sharing ideas online with other members of the Arduino community
There are many other microcontrollers and microcontroller platforms available for physical computing. Parallax Basic Stamp, Netmedia's BX-24, Phidgets, MIT's Handyboard, and many others offer similar functionality. All of these tools take the messy details of microcontroller programming and wrap it up in an easy-to-use package. Arduino also simplifies the process of working with microcontrollers, but it offers some advantage for teachers, students, and interested amateurs over other systems:
- Inexpensive - Arduino boards are relatively inexpensive compared to other microcontroller platforms. The least expensive version of the Arduino module can be assembled by hand, and even the pre-assembled Arduino modules cost less than $50
- Cross-platform - The Arduino Software (IDE) runs on Windows, Macintosh OSX, and Linux operating systems. Most microcontroller systems are limited to Windows.
- Simple, clear programming environment - The Arduino Software (IDE) is easy-to-use for beginners, yet flexible enough for advanced users to take advantage of as well. For teachers, it's conveniently based on the Processing programming environment, so students learning to program in that environment will be familiar with how the Arduino IDE work
- Open source and extensible software - The Arduino software is published as open source tools, available for extension by experienced programmers. The language can be expanded through C++ libraries, and people wanting to understand the technical details can make the leap from Arduino to the AVR C programming language on which it's based. Similarly, you can add AVR-C code directly into your Arduino programs if you want to.
- Open source and extensible hardware - The plans of the Arduino boards are published under a Creative Commons license, so experienced circuit designers can make their own version of the module, extending it and improving it. Even relatively inexperienced users can build the breadboard version of the module in order to understand how it works and save money.
Arduino/Genuino boards senses the environment by receiving inputs from many sensors, and affects their surroundings by controlling lights, motors, and other actuators. Arduino/Genuino boards are the microcontroller development platform that will be at the heart of your projects. When making something you will be building the circuits and interfaces for interaction, and telling the microcontroller how to interface with other components. Here the anatomy of Arduino/Genuino Uno.
- Digital pins Use these pins with digitalRead(), digitalWrite(), and analogWrite(). analogWrite() works only on the pins with the PWM symbol.
- Pin 13 LED The only actuator built-in to your board. Besides being a handy target for your first blink sketch, this LED is very useful for debugging.
- Power LED Indicates that your Genuino is receiving power. Useful for debugging.
- ATmega microcontroller The heart of your board.
- Analog in Use these pins with analogRead().
- GND and 5V pins Use these pins to provide +5V power and ground to your circuits.
- Power connector This is how you power your Genuino when it’s not plugged into a USB port for power. Can accept voltages between 7-12V.
- TX and RX LEDs These LEDs indicate communication between your Genuino and your computer. Expect them to flicker rapidly during sketch upload as well as during serial communication. Useful for debugging.
- USB port Used for powering your Genuino Uno, uploading your sketches to your Genuino, and for communicating with your Genuino sketch (via Serial. println() etc.).
- Reset button Resets the ATmega microcontroller.
The Arduino Integrated Development Environment - or Arduino Software (IDE) - contains a text editor for writing code, a message area, a text console, a toolbar with buttons for common functions and a series of menus. It connects to the Arduino and Genuino hardware to upload programs and communicate with them.
Programs written using Arduino Software (IDE) are called sketches. These sketches are written in the text editor and are saved with the file extension .ino. The editor has features for cutting/pasting and for searching/replacing text. The message area gives feedback while saving and exporting and also displays errors. The console displays text output by the Arduino Software (IDE), including complete error messages and other information. The bottom righthand corner of the window displays the configured board and serial port. The toolbar buttons allow you to verify and upload programs, create, open, and save sketches, and open the serial monitor.
 It has a name, a value, and a type. For example, this statement (called a declaration):
int pin = 13;
creates a variable whose name is pin, whose value is 13, and whose type is int. Later on in the program, you can refer to this variable by its name, at which point its value will be looked up and used. For example, in this statement:
pinMode(pin, OUTPUT);
it is the value of pin (13) that will be passed to the pinMode() function. In this case, you don't actually need to use a variable, this statement would work just as well:
pinMode(13, OUTPUT);
The advantage of a variable in this case is that you only need to specify the actual number of the pin once, but you can use it lots of times. So if you later decide to change from pin 13 to pin 12, you only need to change one spot in the code. Also, you can use a descriptive name to make the significance of the variable clear (e.g. a program controlling an RGB LED might have variables called redPin, greenPin, and bluePin).
A variable has other advantages over a value like a number. Most importantly, you can change the value of a variable using an assignment (indicated by an equals sign). For example:
pin = 12;
will change the value of the variable to 12. Notice that we don't specify the type of the variable: it's not changed by the assignment. That is, the name of the variable is permanently associated with a type; only its value changes. [1] Note that you have to declare a variable before you can assign a value to it. If you include the preceding statement in a program without the first statement above, you'll get a message like: "error: pin was not declared in this scope". When you assign one variable to another, you're making a copy of its value and storing that copy in the location in memory associated with the other variable. Changing one has no effect on the other. For example, after:
int pin = 13;
int pin2 = pin;
pin = 12;
only pin has the value 12; pin2 is still 13.
Segmenting code into functions allows a programmer to create modular pieces of code that perform a defined task and then return to the area of code from which the function was "called". The typical case for creating a function is when one needs to perform the same action multiple times in a program.
For programmers accustomed to using BASIC, functions in Arduino provide (and extend) the utility of using subroutines (GOSUB in BASIC).
Standardizing code fragments into functions has several advantages:
- Functions help the programmer stay organized. Often this helps to conceptualize the program.
- Functions codify one action in one place so that the function only has to be thought out and debugged once.
- This also reduces chances for errors in modification, if the code needs to be changed.
- Functions make the whole sketch smaller and more compact because sections of code are reused many times.
- They make it easier to reuse code in other programs by making it more modular, and as a nice side effect, using functions also often makes the code more readable.
There are two required functions in an Arduino sketch, setup() and loop(). Other functions must be created outside the brackets of those two functions. As an example, we will create a simple function to multiply two numbers.
To "call" our simple multiply function, we pass it parameters of the datatype that it is expecting:
void loop(){
int i = 2;
int j = 3;
int k;
k = myMultiplyFunction(i, j); // k now contains 6
}
Our function needs to be declared outside any other function, so "myMultiplyFunction()" can go either above or below the "loop()" function.
The entire sketch would then look like this:
void setup(){ Serial.begin(9600); } void loop() { int i = 2; int j = 3; int k; k = myMultiplyFunction(i, j); // k now contains 6 Serial.println(k); delay(500); } int myMultiplyFunction(int x, int y){ int result; result = x * y; return result; }
Libraries are a collection of code that makes it easy for you to connect to a sensor, display, module, etc. For example, the built-in LiquidCrystal library makes it easy to talk to character LCD displays. There are hundreds of additional libraries available on the Internet for download. The built-in libraries and some of these additional libraries are listed in the reference. To use the additional libraries, you will need to install them.
To install a new library into your Arduino IDE you can use the Library Manager (available from IDE version 1.6.2). Open the IDE and click to the "Sketch" menu and then Include Library > Manage Libraries.
Then the Library Manager will open and you will find a list of libraries that are already installed or ready for installation. In this example we will install the Bridge library. Scroll the list to find it, click on it, then select the version of the library you want to install. Sometimes only one version of the library is available. If the version selection menu does not appear, don't worry: it is normal.
Finally click on install and wait for the IDE to install the new library. Downloading may take time depending on your connection speed. Once it has finished, an Installed tag should appear next to the Bridge library. You can close the library manager.
You can now find the new library available in the Sketch > Include Library menu.
You can find more information in Foundations


Worked in India with IT services companies like Kanrad, Kshema and Mindtree between 1997-2006
Project1: Led Certification Service (Client server solution) for Successfactors Product stacks (50+ server stacks), provides ability to validate layers of OS, Web, App and DB per Architecture, Operations standards and integration points. Service has the ability to validate over 1000 servers remotely in 1-2 hours through API and gather validation report. 100+ Engineers use this service with more than 2000 certifications per month for new data center build outs and expansion of existing ones. Service Design, development and delivery implemented in Agile model (Tools & Technology: SAPUI5, PHP, Bash, Inspec, Selenium, Git)
Project2: Led UCS Bare-Metal (SLES, Windows) and Virtual Machine Provisioning Automation services, provides ability to provision and deploy with OS and validates with certification through API calls. This service enabled reduction of 3-4 weeks of manual effort per each data center site development. Service developed in Agile model (Tools & Technology: Python, Chef, Rundeck, Git)
Project3: Led GDPR E2E stack build Automation Service, enabled successful deployment across datacenters (solution delivery enabled deployment saving 12+ weeks of deployment effort across multiple sites saving significant effort and rework). Service delivered in combination of Agile and Waterfall models (Tools & Technology: Chef, Python, Rundeck, Apache, Tomcat, Java, Hadoop & MySQL)
Project4: Led implementation of Windows Virtualization and MSSQL End to End Automation (Tools & Technology: Chef, Rundeck, WinRM)
Project5: Led implementation of AFWLite framework, which provides ability to deploy entire Platform and Product Deployment Automation Framework in single Virtual Machine to develop isolated/lab environments where integration points are not available and use as validation environment for changes to primary framework, (Tools & Technology: Docker Containers, Chef, MySQL, Rundeck)
Project6: Led CICD pipeline implementation, which has ability to retrieve code, build, perform validation certification and deploy to QA and subsequently to Production (Tools & Technology: Jenkins, Ruby, Groovy, Inspec)
Responsibilities:
In these projects, played role as Scrum Master in assisting Product Owner & 10+ global team members for Scrum Ceremonies (Daily Standups, Sprint planning, backlog grooming and retrospects) and successful agile techniques such as user stories, TDD and continuous integration Enabled team to resolve Program/Project impediments, improve transparency, facilitate remediation, decision making, conflict resolution and highlight risks with leadership Coordinated Program roll-outs & provided Automation support coverage for multiple development and Operations teams with measurable SLA. Conducted Program reviews and status reporting of initiatives to leadership and stakeholders
Project1: Led Development and Support Services of cloud based enterprise solution, which enables guests to perform reservation Check-ins across 3000+ properties
Project2: Led Development and Support Services of cloud based enterprise solution, which enables booking Meeting rooms
Responsibilities:
Responsible for Managed Service relationship with Cloud Infrastructure provider (Rackspace), Single point of escalation to ensure customer and stakeholder satisfaction (including business teams) for multiple portfolio of (small and large) projects with 5+million revenues with timely completion with <10% change variance and with 45% gross margin Delivered multiple small projects (<6 months duration) with predefined milestones and Fixed Price SoWs within under budget Supported pre-sales teams in defining and evaluating proposals (RFP) for new customer acquisition efforts and bidding for larger project contracts with existing customer base Managed development and QA teams of 60 members across multiple geographies
10>Tools and Technology: Java, HTML/CSS, JavaScript, MySQL, Linux, Tomcat, Apache, SVN
Customer: Marriott
Project:Led Development and Support Services of SaaS solution, which enables brand activation and talent acquisition solution (framework to manage career site) for 100+ customers
Responsibilities:
Single point of escalation for large SaaS solution development and maintenance services Responsible for Planning, Scope Management, Estimations and delivery of milestones and achieve Acceptance criteria Responsible for contract definition, SLA negotiations and deliverables Managed teams ranging 25-30 members of team across multiple geographies
Tools and Technology: Microsoft .Net C#, ASP.Net, SQL Server, VSS
Customer: TMP Worldwide
Project1: Led multi-year application maintenance and development support for commercial insurance solution, which services underwriting commercial insurance policies. Supported 100+ underwriters servicing 1000+ policies and generating revenue of $3billion. Managed approx.500-700 support requests/changes per month. Implemented efficient SOPs to enable >95% SLA and deliver enhancements on time with no defects
Project2: Led development of Data Warehouse solution which integrates 20 enterprise wides data marts into single Data Warehouse solution with finite reporting capability
Responsibilities:
Responsible for AMS and Development Services and single point of contact for multiple stakeholders Managed teams ranging 20-40 members across multiple geographies. Developed Proposals, Estimations, scope management and SoW definitions
Tools and Technology: Visual Basic, Sybase, Oracle, ETL Datastage
Customers: AIG, CIT
TBD.


com.github.davidmoten.geo
Classes
Base32
Coverage
CoverageLongs
Direction
GeoHash
HashHeights
HashWidths
LatLong
LongSet
Parity


X
WELCOME TO 15-PUZZLE GAME
Play to Win, but Enjoy the fun.
Time Taken (MilliSeconds):
Moves Taken :
Number of Steps :
Speed
Normal
Slow
Fast
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
Input:


Booking successful
We've email this confirmation to {{ data['email-address'] }}
You may receive further email updates and reminders.
| Event title | {{ data['event-title'] }} |
| Date and time | {{ session.data['event-day'] }} {{ session.data['event-month-name'] }} {{ session.data['event-year'] }} {{ session.data['event-start-time'] }} to {{ session.data['event-finish-time'] }} Add to calendar |
| Venue | {{ data['full-address-holder'] }} View map {% if data['venue-additional-notes-entered'] == true %} {{ data['venue-additional-notes'] }} {% endif %} |
| Company | {{ data['business-name'] }} |
| Attendee | {{ data['first-name'] }} {{ data['last-name'] }} |
Download PDF of this confirmation.
What did you think of this service?
Our feedback survey only takes about 30 seconds to complete.
It will help us to understand how we can improve our events experience.


Welcome to Pat's Salmon Cookies! They're cookies made into the shape of a salmon, and actually made with real, organic, grass-fed salmon! What is a more ideal match for a steaming cup of coffee on a gray Seattle morning? Nothing! The locals have begrudgingly fallen in love with them, and they don't love anything. Ever! Pat is certain you will love them too. Please visit one of our boutique artisan bakeries located all around the Greater Seattle Area!


In 2019, I was hired to work with
IKEA,
Unyq and
Carbon 3D on another project for gaming ergonomics.
This time the focus was on customized gaming accessories for mass production that can improve player performance.
Press Release: Uppkoppla
For this new type of product line, we wanted a modern, but sleek aesthetic that was unique to its age. Visual research, lent itself
to the idea that texture is the new signage. Textures don't just illustrate function but can also facilitate it. By utilizing 3D textures,
applications for grip enhancement, sweat management and air flow are all possible in one aesthetic device.
Gaming ergonomics have existed in console controllers for a very long time but have not carried over into desktop applications.
By studying gameplay in First Person Shooters we found there was an opportunity to apply the same ergonomic concept to counterstrike
by introducing textures onto the keys that control player movement.
Depending on the player's gameplay and aesthetic preferences I built algorithms to generate thousands of different iterations, and made
a series of "presets" that players could choose from or customize.
Using python and javascript I made a mock web application for users to customize their keys and send a
clean printable mesh file directly to our manufacturing site, creating a fully automated process.
The new keys were presented at the 2019 IKEA Democratic Design Days in Almhult, Sweden, and gaming event in Poland.


Forensics Module¶
add image here
-h
= help
--version
= print tool version
-v
= verbose mode
-o Filename
= save the result in output file
Tools¶
Detect file type¶
Determine the type of a file by his header (magic number)
Note
Like ‘file’ command in Unix
Usage
[-h] [--version] [-v] [-o FILENAME] filename
Arguments¶
Only regular args.
Examples¶
Check ‘checkme’ file (png file):
>>> checkme File extension: png other extensions names: MIME: image/png description: Portable Network Graphics file
Code¶
This module uses Detect file type
Printable strings in file¶
Find printable strings in binary files
Note
Like ‘strings’ command in Unix
Usage
[-h] [--version] [-v] [-o FILENAME] [-n NUMBER] filename
Arguments¶
Optional Arguments¶
- -n Number
- Type
int
- Expleneation
Print only sequences of characters that are at least min-len of this number
- Default
4
Examples¶
Search in ‘checkme’ file:
>>> checkme Strings will be printed here
Search in ‘longwords’ for strings at least 10 characters long:
>>> checkme -n 10 Strings will be printed here
Recursive Decompression¶
Decompress nested zip files, saves the files hierarchy (nested zips changed to directories).
Usage
[-h] [--version] [-v] [-o FILENAME] [-p PATH] filename
Arguments¶
Optional Arguments¶
- -p Path
- Type
str
- Expleneation
Set path to extract the zip files
- Default
Current directory
Examples¶
Extract nested.zip file to current directory
>>> nested.zip
Extract nested.zip file to directory named ‘Data’ in the current directory
>>> nested.zip -p Data
Code¶
This module uses Recursive Decompression
Email analyzer¶
Analyze email file headers to extract important information
Subject
Data
From
To
Message-ID
Unsubscribe URL
Return Path (The email address when replying to this message)
Content-Type (Check for attached files)
Received (All the station the email pass through, track the sender)
Usage
[-h] [--version] [-v] [-o FILENAME] filename
Arguments¶
Only regular args
Examples¶
Analyze email file with the name sendme.eml
>>> sendme.eml Subject: Coming Wednesday, April 1st... Nailed It! Season 4 Date: Tue, 24 Mar 2020 18:02:10 +0000 From: Netflix<EMAIL_ADDRESS>To<EMAIL_ADDRESS>Message-ID<EMAIL_ADDRESS>List-Unsubscribe<EMAIL_ADDRESS><https://www.netflix.com/EmailUnsubscribe?id=BQE0AAEBENqyIWqRNrh%2B7%2FV5HCi4iKmAgHeFZDEnVSyIsgyi0afmQoJVpj1JX60NWdqEnhgc3v9rrhZtAXKmQ753EK64gUYakH9o2rLLGZ8FOuUc7NFjeE8eVPV1VNWyPgpBek7I3PeXlxgnc7bKneIOw51NZHKVY89Q%2BChey9LRE13FZe4%2Bo5C3KPNazPc%2BK7TzskJElw15&lnktrk=EMP&g=6A5F6B01C976E12BCF1F50C0AA5062A9645262CD&lkid=unsubscribe_link> Return-Path<EMAIL_ADDRESS>Content-Type: multipart/alternative; boundary="----=_Part_87580_587082350.1585072930404" Received: from VI1EUR04HT047.eop-eur04.prod.protection.outlook.com (2603:10b6:208:51::34) by MN2PR05MB6573.namprd05.prod.outlook.com with HTTPS via BL0PR02CA0093.NAMPRD02.PROD.OUTLOOK.COM; Tue, 24 Mar 2020 18:02:12 +0000 Received: from VI1EUR04FT022.eop-eur04.prod.protection.outlook.com (2a01:111:e400:7e0e::33) by VI1EUR04HT047.eop-eur04.prod.protection.outlook.com (2a01:111:e400:7e0e::349) with Microsoft SMTP Server (version=TLS1_2, cipher=TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384) id 15.20.2814.13; Tue, 24 Mar 2020 18:02:11 +0000
Code¶
This module uses Email analyzer


--- layout: post title: Phoenix for Mac OS X mt_id: 40 date: 2003-01-24 14:36:21.000000000 +09:00 author: clouder category: Mac ---
MacSlash | Experimental Phoenix for OS X Want to try out yet another browser? Kevin Gerich has posted on his site: 'This is a Mac OS X build of Phoenix based on version 0.5. It's not a straight build, it's more like "Phoenix and stuff". It is not a Mozilla.org product. Please don't contact Mozilla.org regarding this build as it is not supported.'Phoenix を Mac OS X 用にbuildしたらしい。


Project 1 - The Sloshed Guide
Project 2 - The Hazard Report
Workday Planner
Weather Dashboard
Workout Tracker
Note Taker


llvm-objdump - LLVM’s object file dumper¶
SYNOPSIS¶
llvm-objdump [commands] [options] [filenames…]
DESCRIPTION¶
The llvm-objdump utility prints the contents of object files and final linked images named on the command line. If no file name is specified, llvm-objdump will attempt to read from a.out. If - is used as a file name, llvm-objdump will process a file on its standard input stream.
COMMANDS¶
At least one of the following commands are required, and some commands can be combined with other commands:
-
-d
,
-disassemble
¶
Display assembler mnemonics for the machine instructions. Disassembles all text sections found in the input file(s).
-
-D
,
-disassemble-all
¶
Display assembler mnemonics for the machine instructions. Disassembles all sections found in the input file(s).
-
-help
¶
Display usage information and exit. Does not stack with other commands.
-
-r
¶
Display the relocation entries in the file.
-
-s
¶
Display the content of each section.
-
-section-headers
¶
Display summaries of the headers for each section.
-
-t
¶
Display the symbol table.
-
-version
¶
Display the version of this program. Does not stack with other commands.
OPTIONS¶
llvm-objdump supports the following options:
-
-arch
=<architecture>
¶ Specify the architecture to disassemble. see
-version
for available architectures.
-
-cfg
¶
Create a CFG for every symbol in the object file and write it to a graphviz file (Mach-O-only).
-
-dsym
=<string>
¶ Use .dSYM file for debug info.
-
-g
¶
Print line information from debug info if available.
-
-m
,
-macho
¶
Use Mach-O specific object file parser. Commands and other options may behave differently when used with
-macho
.
-
-mattr
=<a1,+a2,-a3,…>
¶ Target specific attributes.
-
-mc-x86-disable-arith-relaxation
¶
Disable relaxation of arithmetic instruction for X86.
-
-stats
¶
Enable statistics output from program.
-
-triple
=<string>
¶ Target triple to disassemble for, see
-version
for available targets.
-
-x86-asm-syntax
=<style>
¶ When used with the
-disassemble
option, choose style of code to emit from X86 backend. Supported values are:The default disassembly style is att.
BUGS¶
To report bugs, please visit <http://llvm.org/bugs/>.
SEE ALSO¶
llvm-nm(1)


Pieces of MIT App Inventor
- Client – User’s Browser
- Server – A Webserver hosted in Google’s App Engine
- Device (or Emulator) – To view and debug your App
- Buildserver – To build the finished product
- Three Languages
- Javascript
- Java (Three Flavors)
- YAIL (Really Scheme with Macros)
3 Flavors of Java!
- Java 7 – Runs in the server
- Java 5(!) – Compiled to “Dex” Code on the Device
- Java 6 – Compiled to Javascript for Google Web Toolkit (Client)
Google Web Toolkit (GWT)
- Write code in Java
- Compile it to Javascript to run in the browser
- It is still a Javascript runtime
- So you still have
callbacks and other
asynchronous stuff!
Server/Client Layout
- ode/*.gwt.rpc and ode/*.html – GWT Compiled Code
- blockly-all.js – Blockly Code (concatenated or minified)
Compilation Options
- “pretty” (GWT), none (Closure)
- Optimized (GWT), minified (Closure)
- Compiled code is much smaller and a little faster
- But nearly impossible to debug!
Client Environment
- Designer – Google Web Toolkit (Java Compiled to Javascript)
- Blockly – Javascript using Google’s Closure Library (and compiler)
Server Environment
- Java Webserver (Jetty) implemented in Google App Engine
- Use Google’s “Bigtable” Datastore and “Blobstore”
- Plan to migrate from Blobstore to “Google Cloud Storage”
- Hosts the client code
- Provides for Project Storage
KAWA – Scheme for Java
- Scheme written in Java
- Can make calls to Java classes/methods
- Can run interpreted, or Compiled
- This is a very useful property for App Inventor
The Companion
- MIT App Inventor Components (compiled)
- Httpd to listen to the network
- Kawa to evaluate forms sent from the network
- Some Hair to glue it together
Blocks Compile to YAIL
- Blocks Compile to YAIL
- YAIL is sent to the Companion
- Companion executes the YAIL, often redefining a function (event).
Blocks –> Yail
(add-component Screen1 Button Button1
(set-and-coerce-property! 'Button1 'Image "kitty.png" 'text)
(set-and-coerce-property! 'Button1 'ShowFeedback #f 'boolean))
(define-event Button1 Click()(set-this-form)
(call-component-method 'Sound1 'Play (*list-for-runtime* ) '()))
Yail –> Companion
- Most of the magic is in replmgr.js
- Generate complete Yail for each workspace change
- Keep track of the Yail for Each block
- When it changes, send an
update to the
Companion
(but no more
often then every 0.5 seconds)
- Component changes (made in the designer) require a complete reload
Packaging an App
- Compile the Blocks to Yail
- Compile the Yail to Java
- Compile the Java (and libraries) to Dex
- Package it all Up, and you are good to go
- Have dedicated buildserver to perform the compilation


Gateway
BOT
29-Jun-18 04:00 AM
[dscrdvrsc] <jimboscott> @Mike1900 two wallets is manageable. I have 7...
[dscrdvrsc] <englal> There are two particularly safe approaches -
you can mine with both wallets, then merge them later
or you can have one wallet on one computer, and have the other computer(s) mine to an address in the one wallet
[dscrdvrsc] <Mike1900> ok
[dscrdvrsc] <jimboscott> I have been importing the PRIV KEYS into my main wallet. One at a time...
[dscrdvrsc] <Mike1900> ok
[dscrdvrsc] <englal> @jimboscott Sounds like that aught to be time for some shell scripting
[dscrdvrsc] <Mike1900> gonna look into that later will starting understand block chain and mining first still not clear into my head
[dscrdvrsc] <jimboscott> It's not that big a task. Especially with hte 600 GH/s net hash
[dscrdvrsc] <jimboscott> Think of the blockchain as a huge serialized set of bank safe deposit boxes. Your PRIV KEY is needed for each box (address) that you own. The address is the PUBLIC key, but the only way to get what's in the boxes is with both the public and the private keys. The wallet is your set of keys.
[dscrdvrsc] <jimboscott> Anyone can search using your public key and see a transaction. But only someone with the private key can move the contents.
[dscrdvrsc] <Mike1900> does peoples can steal my wallet? except by taking my file?
[dscrdvrsc] <Mike1900> i mean what's is inside
[dscrdvrsc] <jimboscott> No. They need your wallet data. They can hack you or steal your laptop.... but they need the wallet.dat file. If they get that then it is theirs.
[dscrdvrsc] <jimboscott> Just like if someone stole my keychain.
[dscrdvrsc] <jimboscott> Of course, the bank will ID me and check my signature.... but same idea
[dscrdvrsc] <Mike1900> ok
[dscrdvrsc] <Mike1900> my SSd is encrypted at the boot gonna be hard to hack that if someone stole my laptop loll
[dscrdvrsc] <jimboscott> take care of that wallet.dat file. What OS?
[dscrdvrsc] <Mike1900> ubuntu
[dscrdvrsc] <Mike1900> 16.04
[dscrdvrsc] <jimboscott> OK. Not sure where the file gets stored with Linux
[dscrdvrsc] <Mike1900> i know know
[dscrdvrsc] <Mike1900> hahaha lol omg
[dscrdvrsc] <jimboscott> funny
[dscrdvrsc] <Mike1900> good one
[dscrdvrsc] <Mike1900> i mean i just find the file now just need to backup it before going to sleep
[dscrdvrsc] <Mike1900> can we do it wile agama run?
[dscrdvrsc] <jimboscott> BTW, your 4 cores will do about 100 Mh/s Mine was a 6 core Coffee Lake
[dscrdvrsc] <jimboscott> @Mike1900 no need to back it up until you find a block.
[dscrdvrsc] <Mike1900> a ok
[dscrdvrsc] <Mike1900> then tomorrow
[dscrdvrsc] <Mike1900> 10% ow
[dscrdvrsc] <Mike1900> now
[dscrdvrsc] <jimboscott> hopefully. be patient. I am hashing close to 900 Mh/s and have just one block today.
[dscrdvrsc] <Mike1900> does the process need a lot of disk space?
[dscrdvrsc] <jimboscott> might take you a week or more
[dscrdvrsc] <Mike1900> pretty low with an ssd right now
[dscrdvrsc] <Mike1900> gonna take me a week to get the first blockchain?
[dscrdvrsc] <Mike1900> which coin do you mine?
[dscrdvrsc] <jimboscott> my storage is 221 megs for this right now. Yes. A week or a day or 2 weeks.
[dscrdvrsc] <Mike1900> ok the % is not linear ?
[dscrdvrsc] <jimboscott> are you syncing now?
[dscrdvrsc] <jimboscott> If it gets stuck you can shut down and restart it.
[dscrdvrsc] <jimboscott> What was your processor again?
[dscrdvrsc] <Mike1900> just got 11% in one hour
[dscrdvrsc] <Mike1900> i5
[dscrdvrsc] <jimboscott> can you be more specific?
[dscrdvrsc] <Mike1900> Intel® Core™ i5-3320M CPU @ 2.60GHz × 4
[dscrdvrsc] <Mike1900> yes of course
[dscrdvrsc] <jimboscott> I would shut it down and restart.
[dscrdvrsc] <Mike1900> am activating best chain now that is the process
[dscrdvrsc] <Mike1900> shut down what?
[dscrdvrsc] <Mike1900> he progress since 1 h you mean it's slow or wrong?
[dscrdvrsc] <jimboscott> Shut Agama down and then start Agama back up
[dscrdvrsc] <jimboscott> should not take that long
[dscrdvrsc] <Mike1900> ok let me try
[dscrdvrsc] <jimboscott> Your i5 has the AVX extensions but I am not sure about the other set ...
[dscrdvrsc] <jimboscott> System requirements: 64bit CPU/OS, CPU with AES-NI and AVX instructions. Windows, Linux (Ubuntu tested), or Mac High Sierra. 4GB Memory.
[dscrdvrsc] <jimboscott> Gotta run for the night - good luck.
[dscrdvrsc] <Mike1900> done
[dscrdvrsc] <Mike1900> Activating best chain (downloading blocks)
Komodo daemon has been started and is processing.
Please wait while the best chain is being activated.
Tip: in case sync is stuck restart the wallet.
21.63% | 11825 / 54676 | Connections: 3
[dscrdvrsc] <Mike1900> got this now
[dscrdvrsc] <Mike1900> 31 know very more faster
[dscrdvrsc] <Mike1900> now*
[dscrdvrsc] <Mike1900> good night and thanks for all the clues
[dscrdvrsc] <englal> Cheers!