Impeachment Hearing: A ‘Have You No Sense of Decency?’ Moment
To the Editor:
Regarding the testimony of Marie Yovanovitch, the former United States ambassador to Ukraine, before the House Intelligence Committee’s impeachment hearings on Friday:
The great public congressional hearings often start slow and continue without making apparent progress toward a solution to the problem they address. Then suddenly there is a “eureka!” moment when quiet, civilly spoken words cast a light so bright that the public and their elected representatives cannot ignore or fail to right grievous wrongs.
Friday marked such a turning point for Trumpism and the Trump administration.
Any American citizen paying attention to the opening statement and testimony of Ms. Yovanovitch will experience a historic eureka moment.
This brave and heroic woman has no agenda other than to serve the country she loves. Her clear, straightforward depiction of the abuse and smears she received and the corruption of United States foreign policy and security to serve the political and financial interests of the president and his enablers cannot be ignored or dismissed.
Ambassador Yovanovitch deserves a Presidential Medal of Freedom. Instead she is defamed, dismissed and threatened.
Anyone, including the president and the Republican members of the House Intelligence Committee, who continues to attack Ambassador Yovanovitch will do so at considerable risk.
The American people deserve and expect their elected leaders to put the public interest ahead of their own personal interest in power and greed. They want them to make sure that those in power are accountable and that they uphold the rule of law. Members of Congress who do not fulfill their responsibility to the American people will be held accountable by voters.
Nick Allard
Brooklyn
The writer, a professor at Brooklyn Law School, was dean of the school from 2012 to 2018.
To the Editor:
President Trump tweeting in real time while Marie Yovanovitch was testifying before the House Intelligence Committee may or may not amount to intimidation of a witness.
That said, it’s time to remind all Americans what Joseph Welch said during the 1954 Army-McCarthy hearings: “Have you no sense of decency, sir?”
This same question needs to be asked now of President Trump.
Denny Freidenrich
Laguna Beach, Calif.
To the Editor:
Re “Pelosi Suggests Trump May Face Bribery Charge” (front page, Nov. 15):
Speaker Nancy Pelosi’s decision to call President Trump’s behavior “bribery” is crucial.
I am a psychiatrist. I focus on the emotional impact of words all day long. I urge the Democrats to repeatedly explain, in simple terms, what Mr. Trump did and why it matters.
For example, please don’t say, “President Trump used the power of his office to seek damaging information on his political rival.” Please say: “President Trump is a cheat. He has been a cheat all his life. He bribed Ukraine for dirt on Joe Biden so he could cheat and win the next election.”
Please say why this matters, so every American can get it: Even if Mr. Trump gets 5 percent of Americans to think that there must have been some corruption involving Vice President Biden, that can easily be enough to change the outcome of our next election.
That’s why it matters. Democrats: Make it clear and stick to it.
Alan S. Barasch
New York


This record stores set mdx metadata.
Record Data — BIFF8 only
|
Offset |
Name |
Size |
Contents |
|
4 |
Rt |
2 |
Record type; this matches the BIFF rt in the first two bytes of the record; =0887h |
|
6 |
grbitFrt |
2 |
FRT cell reference flag; =0 currently |
|
8 |
(Reserved) |
8 |
Currently not used, and set to 0 |
|
16 |
istrConnName |
4 |
Index of connection name in string store |
|
20 |
tfnSrc |
1 |
Tag of the Cube function producing mdx metadata |
|
21 |
sso |
1 |
Set sort order |
|
22 |
istrSetDef |
4 |
Index of mdx set definition in string store |
|
26 |
cistr |
4 |
Number of member indices |
|
30 |
rgistr |
var |
Indices of member unique names in string store, an array of 4 byte integer values of the length cistr |
The tfnSrc field contains one of the following values:
|
tfnSrc |
Cube function |
|
03h |
CUBESET |
|
04h |
CUBESETCOUNT |
The sso field contains one of the following values:
|
sso |
Cube function |
|
00h |
Unsorted |
|
01h |
Ascending |
|
02h |
Descending |
|
03h |
Alpha ascending |
|
04h |
Alpha descending |
|
05h |
Natural ascending |
|
06h |
Natural descending |


Assign to a password category
Use a unique password
Choose Password Category
Enter a Unique Password


A Node.js Buffer list collector, reader and streamer thingy.
bl is a storage object for collections of Node Buffers, exposing them with the main Buffer readable API. Also works as a duplex stream so you can collect buffers from a stream that emits them and emit buffers to a stream that consumes them!
The original buffers are kept intact and copies are only done as necessary. Any reads that require the use of a single original buffer will return a slice of that buffer only (which references the same memory as the original buffer). Reads that span buffers perform concatenation as required and return the results transparently.
const BufferList = require('bl')
var bl = new BufferList()
bl.append(new Buffer('abcd'))
bl.append(new Buffer('efg'))
bl.append('hi') // bl will also accept & convert Strings
bl.append(new Buffer('j'))
bl.append(new Buffer([ 0x3, 0x4 ]))
console.log(bl.length) // 12
console.log(bl.slice(0, 10).toString('ascii')) // 'abcdefghij'
console.log(bl.slice(3, 10).toString('ascii')) // 'defghij'
console.log(bl.slice(3, 6).toString('ascii')) // 'def'
console.log(bl.slice(3, 8).toString('ascii')) // 'defgh'
console.log(bl.slice(5, 10).toString('ascii')) // 'fghij'
// or just use toString!
console.log(bl.toString()) // 'abcdefghij\u0003\u0004'
console.log(bl.toString('ascii', 3, 8)) // 'defgh'
console.log(bl.toString('ascii', 5, 10)) // 'fghij'
// other standard Buffer readables
console.log(bl.readUInt16BE(10)) // 0x0304
console.log(bl.readUInt16LE(10)) // 0x0403
Give it a callback in the constructor and use it just like concat-stream:
const bl = require('bl')
, fs = require('fs')
fs.createReadStream('README.md')
.pipe(bl(function (err, data) { // note 'new' isn't strictly required
// `data` is a complete Buffer object containing the full data
console.log(data.toString())
}))
Note that when you use the callback method like this, the resulting data
parameter is a concatenation of all Buffer
objects in the list. If you want to avoid the overhead of this concatenation (in cases of extreme performance consciousness), then avoid the callback method and just listen to 'end'
instead, like a standard Stream.
Or to fetch a URL using hyperquest (should work with request and even plain Node http too!):
const hyperquest = require('hyperquest')
, bl = require('bl')
, url = 'https://raw.github.com/rvagg/bl/master/README.md'
hyperquest(url).pipe(bl(function (err, data) {
console.log(data.toString())
}))
Or, use it as a readable stream to recompose a list of Buffers to an output source:
const BufferList = require('bl')
, fs = require('fs')
var bl = new BufferList()
bl.append(new Buffer('abcd'))
bl.append(new Buffer('efg'))
bl.append(new Buffer('hi'))
bl.append(new Buffer('j'))
bl.pipe(fs.createWriteStream('gibberish.txt'))
new BufferList([ callback ])
bl.length
bl.append(buffer)
bl.get(index)
bl.slice([ start[, end ] ])
bl.copy(dest, [ destStart, [ srcStart [, srcEnd ] ] ])
bl.duplicate()
bl.consume(bytes)
bl.toString([encoding, [ start, [ end ]]])
bl.readDoubleBE()
, bl.readDoubleLE()
, bl.readFloatBE()
, bl.readFloatLE()
, bl.readInt32BE()
, bl.readInt32LE()
, bl.readUInt32BE()
, bl.readUInt32LE()
, bl.readInt16BE()
, bl.readInt16LE()
, bl.readUInt16BE()
, bl.readUInt16LE()
, bl.readInt8()
, bl.readUInt8()
The constructor takes an optional callback, if supplied, the callback will be called with an error argument followed by a reference to the bl instance, when bl.end()
is called (i.e. from a piped stream). This is a convenient method of collecting the entire contents of a stream, particularly when the stream is chunky, such as a network stream.
Normally, no arguments are required for the constructor, but you can initialise the list by passing in a single Buffer
object or an array of Buffer
object.
new
is not strictly required, if you don't instantiate a new object, it will be done automatically for you so you can create a new instance simply with:
var bl = require('bl')
var myinstance = bl()
// equivilant to:
var BufferList = require('bl')
var myinstance = new BufferList()
Get the length of the list in bytes. This is the sum of the lengths of all of the buffers contained in the list, minus any initial offset for a semi-consumed buffer at the beginning. Should accurately represent the total number of bytes that can be read from the list.
append(buffer)
adds an additional buffer or BufferList to the internal list. this
is returned so it can be chained.
get()
will return the byte at the specified index.
slice()
returns a new Buffer
object containing the bytes within the range specified. Both start
and end
are optional and will default to the beginning and end of the list respectively.
If the requested range spans a single internal buffer then a slice of that buffer will be returned which shares the original memory range of that Buffer. If the range spans multiple buffers then copy operations will likely occur to give you a uniform Buffer.
copy()
copies the content of the list in the dest
buffer, starting from destStart
and containing the bytes within the range specified with srcStart
to srcEnd
. destStart
, start
and end
are optional and will default to the beginning of the dest
buffer, and the beginning and end of the list respectively.
duplicate()
performs a shallow-copy of the list. The internal Buffers remains the same, so if you change the underlying Buffers, the change will be reflected in both the original and the duplicate. This method is needed if you want to call consume()
or pipe()
and still keep the original list.Example:
var bl = new BufferList()
bl.append('hello')
bl.append(' world')
bl.append('\n')
bl.duplicate().pipe(process.stdout, { end: false })
console.log(bl.toString())
consume()
will shift bytes off the start of the list. The number of bytes consumed don't need to line up with the sizes of the internal Buffers—initial offsets will be calculated accordingly in order to give you a consistent view of the data.
toString()
will return a string representation of the buffer. The optional start
and end
arguments are passed on to slice()
, while the encoding
is passed on to toString()
of the resulting Buffer. See the Buffer#toString() documentation for more information.
All of the standard byte-reading methods of the Buffer
interface are implemented and will operate across internal Buffer boundaries transparently.
See the Buffer
documentation for how these work.
bl is a Node Duplex Stream, so it can be read from and written to like a standard Node stream. You can also pipe()
to and from a bl instance.
bl is brought to you by the following hackers:
=======
Copyright (c) 2013-2014 bl contributors (listed above).
bl is licensed under the MIT license. All rights not explicitly granted in the MIT license are reserved. See the included LICENSE.md file for more details.


Teen boy arrested over 'rape' of 14-year-old girl in Glasgow
Enquiries into the alleged incident in the Royston area of the city are currently ongoing.
by Peter Davidson, https://www.dailyrecord.co.uk/authors/peter-davidson/A teenage boy has been arrested over the alleged rape of a 14-year-old girl in Glasgow .
Officers from Police Scotland are probing the alleged serious sexual assault which is believed to have taken place in the Royston area of the city on Saturday , November 16.
Enquiries into the incident are currently ongoing with cops cuffing a 16-year-old male in connection.
A Police Scotland spokesman said: "Officers are carrying out enquiries after receiving a report of a 14-year-old girl having been seriously sexually assaulted in the Royston area of Glasgow on Saturday, November 16.
"A 16-year-old male youth has been arrested in connection with the incident and enquiries are ongoing."


Student: CVS workers rejected Puerto Rico ID, asked for visa
WEST LAFAYETTE, Ind. (AP) - CVS is apologizing after employees at an Indiana pharmacy refused to accept a Purdue University student’s Puerto Rico driver’s license as valid identification and questioned his immigration status.
José Guzmán Payano said he was in “shock” when employees at the CVS store in West Lafayette wouldn’t sell him cold medicine even after he presented his U.S. passport. He says they demanded to see a visa. He says a cashier and shift supervisor cited corporate policy that requires customers to show valid ID issued by the U.S., Canada or Mexico.
Puerto Rico is a U.S. territory, and Puerto Ricans are U.S. citizens.
A CVS spokeswoman says employees at the store have been reminded that identification from Puerto Rico is considered valid.
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


|
App Engine Python SDK
v1.6.9 rev.445
The Python runtime is available as an experimental Preview feature.
|
Public Member Functions | |
| def | __init__ |
| def | GetValidator |
| def | __setitem__ |
| def | setdefault |
| def | update |
| def | Set |
| def | ToDict |
| Public Member Functions inherited from google.appengine.api.validation.ValidatedBase | |
| def | GetValidator |
| def | SetMultiple |
| def | Set |
| def | CheckInitialized |
| def | ToDict |
| def | ToYAML |
Static Public Attributes | |
| KEY_VALIDATOR = None | |
| VALUE_VALIDATOR = None | |
Base class for validated dictionaries. You can control the keys and values that are allowed in the dictionary by setting KEY_VALIDATOR and VALUE_VALIDATOR to subclasses of Validator (or things that can be interpreted as validators, see AsValidator). For example if you wanted only capitalized keys that map to integers you could do: class CapitalizedIntegerDict(ValidatedDict): KEY_VALIDATOR = Regex('[A-Z].*') VALUE_VALIDATOR = int # this gets interpreted to Type(int) The following code would result in an error: my_dict = CapitalizedIntegerDict() my_dict['lowercase'] = 5 # Throws a validation exception You can freely nest Validated and ValidatedDict inside each other so: class MasterObject(Validated): ATTRIBUTES = {'paramdict': CapitalizedIntegerDict} Could be used to parse the following yaml: paramdict: ArbitraryKey: 323 AnotherArbitraryKey: 9931
| def google.appengine.api.validation.ValidatedDict.__init__ | ( | self, | |
| kwds | |||
| ) |
Construct a validated dict by interpreting the key and value validators. Args: **kwds: keyword arguments will be validated and put into the dict.
| def google.appengine.api.validation.ValidatedDict.__setitem__ | ( | self, | |
| key, | |||
| value | |||
| ) |
Set an item. Only attributes accepted by GetValidator and values that validate with the validator returned from GetValidator are allowed to be set in this dictionary. Args: key: Name of item to set. value: Items new value. Raises: ValidationError: when trying to assign to a value that does not exist.
| def google.appengine.api.validation.ValidatedDict.GetValidator | ( | self, | |
| key | |||
| ) |
Check the key for validity and return a corresponding value validator. Args: key: The key that will correspond to the validator we are returning.
| def google.appengine.api.validation.ValidatedDict.Set | ( | self, | |
| key, | |||
| value | |||
| ) |
Set a single value on Validated instance. This method checks that a given key and value are valid and if so puts the item into this dictionary. Args: key: The name of the attributes value: The value to set Raises: ValidationError: when no validated attribute exists on class.
| def google.appengine.api.validation.ValidatedDict.setdefault | ( | self, | |
| key, | |||
value = None |
|||
| ) |
Trap setdefaultss to ensure all key/value pairs are valid. See the documentation for setdefault on dict for usage details. Raises: ValidationError: if the specified key is illegal or the value invalid.
| def google.appengine.api.validation.ValidatedDict.ToDict | ( | self | ) |
Convert ValidatedBase object to a dictionary. Recursively traverses all of its elements and converts everything to simplified collections. Subclasses should override this method. Returns: A dictionary mapping all attributes to simple values or collections.
| def google.appengine.api.validation.ValidatedDict.update | ( | self, | |
| other, | |||
| kwds | |||
| ) |
Trap updates to ensure all key/value pairs are valid. See the documentation for update on dict for usage details. Raises: ValidationError: if any of the specified keys are illegal or values invalid.


Preparation time
30 mins to 1 hour
Cooking time
over 2 hours
Mix all dry ingredients together in a bowl.
Add lemon rind, juice and eggs and mix well.
Place in a well-greased 1½ pint/850ml bowl.
Cover with two well greased pieces of greaseproof paper making sure there is a fold across the middle
Steam for six hours, remove paper.
If there is any fat lying on top of the pudding leave it, as it will be absorbed.
When cold, re-cover as before with fresh paper and store till needed
On Christmas morning steam for three hours.
Serve with brandy sauce or rum butter.


We have a range of sponsorship levels available to suit everyone. Please download our flyer for details.


Taxonomy deals with the names of living things - well, in this context, we're dealing with living things. So let's call it biological taxonomy.
Almost all biologists are likely to deal with names, whether they study a single species or 10 species, or 10,000 species. Organism names are created by people - thus they are messy of course. Two different names can be given to the same species, and two completely different taxonomic groups could have the identical name at different taxonomic ranks. All these problems and more make it so that you of course want to do your taxonomic sleuthing with a powerful, repeatable, for-loopable, tool.
We created a tool to ease the headache of taxonomy. What makes it possible is the many online taxonomy databases that we can give you an interface to. Take a look at the sources of taxonomic databases we wrap in taxize at the Sources page.
What can you actually do? Let's take a look.
library("taxize")
col_children(name = "Apis")
And you get
id name rank
6971712 Apis andreniformis Species
6971713 Apis cerana Species
6971714 Apis dorsata Species
6971715 Apis florea Species
6971716 Apis koschevnikovi Species
6845885 Apis mellifera Species
6971717 Apis nigrocincta Species
Awesome eh.
import pytaxize
pytaxize.col_children(name = ["Apis"])
[ id name rank
6971712 Apis andreniformis Species
6971713 Apis cerana Species
6971714 Apis dorsata Species
6971715 Apis florea Species
6971716 Apis koschevnikovi Species
6845885 Apis mellifera Species
6971717 Apis nigrocincta Species]
Want to see something else added? Open an R or Python issue.


STLTS
Copyright (c) 2004 W. Sewell
This game is played on the following 12x12 square board:
- TURN - On each turn, each player must do one of the following actions.
- Move a friendly stone.
- A stone may move to any cell that is reachable up to H horizontal steps and V vertical steps over empty cells, where H is the number of horizontal pins and V the number of vertical pins (so, a piece with no pins cannot move).
- The last step may be into a cell occupied by an enemy stone (which is captured).
- Place a horizontal or vertical pin on a friendly stone.
- GOAL - The winner is whoever captures all enemy stones.
In the original rules, there is no pin limit on each piece. There is a implicit limit given by the board (in this case, 12) but this may imply that some games would turn out to be too long (a piece with 24 pins takes 24 turns to make). A shorter limit would force games to a earlier conflict (say, 3 horizontal and 3 vertical pins). Another suggestion to speed the game, would be (a) to move a stone or (b) place two pins (both on one stone, or one per stone); this implies a greater cost for movement, which may favor tactical battles for pin insertions.
A move range example (in this diagram, a red stone is a horizontal pin, and a blue stone is a vertical pin).
The top-right stone can move only into the marked cells (remember, stones cannot jump over other pieces).
Check STLTS webpage for more information.


Seismic Trace Interpolation using Weighted L1 Minimization
This application is available only in the software release for members of SINBAD consortium.
This software release includes a demonstration of the wavefield reconstruction framework in Matlab that has been developed at SLIM.
Author: Hassan Mansour
Date : April, 2013
Contents
Downloading & Dependencies
The code can be found in the SLIM sofware release under /applications/Processing/WeightedL1Interpolation.
The code has been tested with Matlab R2012b.
This code uses the following packages, also found in the tools part of the SLIM software release.
- utilities/SPOT - object oriented framework for matrix-free linear algebra.
- algorithms/AdaptiveSparseRecovery - weighted L1 minimization algorithm.
- operators/misc - Misc. operators such as source-receiver to midpoint-offset conversion.
- functions/misc - Misc. functions.
- solvers/SPGL1-SLIM - The spgl1-slim weighted L1 minimization solver.
- transforms/CurveLab-2.1.2-SLIM - curvelet transform functions.
Running & Parallelism
All the examples and results are produced by the scripts found in this software release under applications/Processing/WeightedL1Interpolation/. Start matlab from that directory or run startup in that directory to add the appropriate paths.
To run the scripts follow the instructions in the README file enclosed with the code. The scripts can be run in serial mode.
Scripts, examples and results
Several scripts that reproduce the interpolation results in [1] can be found in the exps directory.
- wL1_freq_SR - runs the reconstruction across frequency sclies in the source-receiver domain.
- wL1_freq_MH - runs the reconstruction across frequency sclies in the midpoint-offset domain.
- wL1_offset_TM - runs the reconstruction across offset sclies in the time-midpoint domain.
More detailed descriptions and some basic tests are described in wL1_freq_MH.m and wL1min.m.
References
[1] H. Mansour, F. Herrmann, and O. Yilmaz. Improved wavefield reconstruction from randomized sampling via weighted one-norm minimization. submitted to Geophysics, 2013.


Sign in
Sign in using facebook
Login with Facebook
Sign in using google
Lorem ipsum
purr purr..
Back to main


www.mbs-journal.de
3/2019
Special Issue:
Dedicated to David Kaplan on the Occasion
of his 65th Birthday
Guest-Edited by Fiorenzo G. Omenetto
Volume 19 Number 3 March 2019
MABI_19_3_cover.indd 4
2/25/19 8:46 PM


Pat`s Salmon Cookies :Sales Data
Location
6am
7am
8am
9am
10am
11am
12am
1pm
2pm
3pm
4pm
5pm
6pm
7pm
Daily Location Total
Main Page
Salmon Cookies
Store Name
Minimum Customers
Maximum Customers
Average Sales


First of all, thank you for taking a look at my website. I really appreciate your interest.
My name is Jacob, and I am currently an employee at IBM as a Software Developer in the cloud, and am a
graduate of Iowa State University with a degree in Computer Science. I’ve been interested in
computers since I was young, and began my studies at Iowa State in 2009. I graduated in
Spring of 2013, and started working at IBM in Rochester MN.
As you can tell by looking around this site, I am a computer programmer. To be more specific,
I have focused on Android and Cloud applications.
Feel free to take a look through my projects by visiting the link at the top of the page.
Also, a lot of the projects are available on my GitHub. If that is of more interest to you, please
check out my GitHub page.
Portfolio
Work Experience
My Work Experience
Year 2020
November
Cloud Software Engineer - Principal Financial Group
Claims
I currently work with the Claims team on refactoring their services to AWS.
We use several technologies, such as Java, Spring Boot, TypeScript, Serverless, CCI, Cloud Foundation, Lambda, API Gateway, and Fargate. This involves confidential customer data, so security has to be our top concern.
Year 2018
September
Cloud Software Engineer - Principal Financial Group
DevOps with Employer Web
We started the initiative of moving Employer Web from on site to GCP. We worked with the Security and Infrastructure teams to be one of the first teams to deploy a service to the cloud. We targeted tools such as Docker and Kubernetes, as Employer Web has several microservices. Since we were the first project to do this, we had to build our own tools to satisfy corporate requirements and make our lives easier. We used additional tools such as CircleCI, Docker, Kubernetes, Python, Pytest, Behave, and Google Cloud Platform.
Year 2017
April
Full Stack Developer - Principal Financial Group
Employer Web
We are updating a legacy website to be more responsive and to greatly increase the transaction speed.
The technologies used in this product include Javascript and React/Redux on the front end as well as Spring Boot/Java on the back end. We are using Microservices to allow for reusability from other teams. We currently have 4 services, and are looking at splitting more off as the need arises.
Year 2015
January
Cloud Software Engineer - IBM
Microservices Squad
I worked in the Micro Services squad to create and maintain several projects,
including Common Service Broker ( to help other squads turn
their apps into services within Bluemix), Service Proxy and Docker-for-Bluemix.
I also worked with other teams to interface with our services and provide
support when needed.
Build Team
I created and managed Jenkins and Gerrit servers, and assisting other developers
in using these tools. I also helped others in using Git to connect to Gerrit and GitHub.
Year 2013
June
Software Engineer - IBM
Ice Castle
I created Software Defined Networking for Virtual Environments, and worked with
Open vSwitch to meet IBM's needs for Ice Castle.
VSAE
I was the lead developer for the Virtual Server Activation Engine team.
May
Graduated from ISU
I graduated from Iowa State University with a major in Computer Science.
Year 2011
November
Software Consultant Intern - Kingland Systems
Data Solutions Team
I updated their website (which uses Java, Google WebToolkit and Sencha GXT)
from GXT version 2.3 to 3.0.
DESC Team
I developed in C#, HTML, Javascript and SQL for the DESC team.
I created a "ResponsiblePartyReview" page (where over 1000 parties can review
their responsibilities) by using C#, HTML, Javascript, jQuery and SQL.
Year 2009
March
Master Technician - Staples
I visited people at their home/office to repair computers and perform other services.
Contact Me
{% include footer.html %}
ACA Eagles
This Android and IOS application was built for my old High School.
It provides users direct access to the most recent news, announcements, events,
general information about the school, and more.
See here for more details.
Mid Iowa Vending
Mid Iowa Vending is a website I created for a friend who is starting a vending machine business. This was
created using Flutter (which uses Dart). I have setup a pipeline to have it test, build, and deploy
automatically when a push to the master branch occurs.
The "Contact Us" page sends the provided information to
an AWS Lambda, which will send an email to Mid Iowa Vending. The site is built on GitHub, and uses GitHub
Actions for the pipeline. It is hosted on GitHub pages.
Cassie's Tutoring
Cassie's Tutoring is a website that I created for my wife, who started tutoring on the side. It's targeted at 5th graders and under. This was created using ReactJs.
The "Contact Me" page sends the provided information to an AWS Lambda, which will
send an email to us. The site is built on GitHub, and is hosted on GitHub pages.
Color Game
This is a game that helps you practice deciphering RGB color codes. I created this as a class
project when learning web development. You can play the game now by clicking
here.
BlueVille
BlueVille was an android app that myself and three others created for an internal IBM hackathon in early 2014.
The purpose for the hackathon was to use IBM’s Mobile Backend as a Service platform called BlueMix.
This product was in open beta at the time of the hackathon, and they wanted a bunch of us to test it out.
BlueVille mainly used the service that created a backend database. We used this database to synchronize information
across all devices.
BlueVille is a community networking application, whose users are a part of a community that is based on the geographical
location of other app users. The app simulates the community that is naturally formed by people in the same place such
as within your office, within the neighborhood you live in, or those attending the same play or sporting event.
The difference between the BlueVille and other community based network apps like Nextdoor or Life360 is that a BlueVille
community is dynamically formed of the people that are in the same geographic location as you. When you are at home the
community is other users that live near you. When you are driving into a new city the community is other people in the city.
When you go to a new restaurant your community is the other BlueVille users at the restaurant. Imagine walking into a new
restaurant and shouting “Is the special any good tonight!!”
When a person installs BlueVille they decide the geographic size of the community they are interested in and what type
of information they will receive. As they move through their day the community where they exist is dynamically changing.
At anytime they can receive valuable information from those around them.
The advantage of the BlueVille approach is that users with a common interest in geographic based information will be
joined regardless of where they are located. They are not bound to information from a static community. This is important
because in life the community that you are a member of is constantly changing. Here are a couple use cases for that
demonstrate the usefulness of BlueVille and it’s dynamics community notifications.
Use Case #1 – Traffic: You are driving along the expressway and suddenly traffic stops. You wonder “What is causing the
traffic stoppage?”. Will you need to change your route or wait until traffic gets moving again. If you decide to change
route to avoid the stoppage you would like to know the best alternate route. You registered for “Traffic” tags before you
left home so when the person in the front of the line submits an item to BlueVille stating that a tow is removing a
stalled vehicle and traffic will be flowing soon, you and everyone subscribed to “Traffic” notifications gets a notification
that there is a stalled vehicle ahead, and you will be moving soon.
Use Case #2 – Suspicious Person: You are at a hotel in a strange city and planning to leave for dinner. You are a medical
doctor so when you arrive at the hotel you register for “Medical”, “Crime” and “Suspicious Persons” on the BlueVille app.
Moments before you leave the hotel you receive a notification from a member of the BlueVille community that contains a
picture of a group of people on the street outside the hotel. The notification says “This group is shouting profanity at
everyone that leaves the hotel”. Based on the photo and comments, you decide to eat at the hotel restaurant and avoid the
potential trouble.
BlueVille uses IBM’s Mobile Backend as a Service (MBaaS) service for mobile data in conjunction with google map support to
save items that are posted by community members. Each post contains the location of the item, the item data and the item tag
which identifies the category that describes the item.
A users mobile device will signal the backend BlueVille service with the device’s current location. When posts are received
within the user selected geographic range application will determine if the user has chosen to receive notifications for this tag.
If the tag category was selected a notification will appear on the main screen of BlueVille.
District 1: Invasion
District 1: Invasion (D1:I) is a team project that I and three other students got
together for a class project. It is a top down shooter game written in Java that involves both
single and multi player. Aliens appear in waves, and it is the player’s job to shoot the aliens
before their health goes down to zero.
The program takes advantage of the Java Applet performance, and runs very smoothly. The player
is allowed to move using a/w/s/d and shoot using the mouse. The player has two slots for guns,
and can drop/pick up different guns found around the map (including assault rifle, pistol, sniper
and rocket launcher). The player also has two slots for special items (the two we implemented were
grenades and health packs). During multiplayer, everything is synced with all other computers, so
two people cannot pick up the same item. We also used 3DS Max for our game GUI animations.
Although we had a limited amount of time, we were not only able to release a full featured game,
but also the menus. The menus included a main screen, full tutorial, the option to choose single
player or multiplayer, a list to choose what game to play and a fully functional chat if multiplayer
is chosen.
The multiplayer was the hardest part of the game. Thankfully, one of the team members had a desktop
computer we used for the server, and in the end, the multiplayer ran smoothly with very little lag
(regardless of the bad wireless during the demo). Security and protection against SQL injection and
other common hacking techniques were also implemented.
We currently have three different aliens (with different HP, damage and speed), one level with one wave,
and five different guns. Although this may not seem like a lot, we made it modular. This means that we can
very easily add more waves, more levels, different maps, more aliens and different guns. If we decide to
take the game to the next level, it would be really easy to add more parts to make it a fully featured game.
We submitted this project for a competition against 32 other teams. We got the “Best Software Project
Silver Award” (missed Gold by three votes), but we were very proud to have gotten as far as we had on the
project, especially given our time frame and other commitments.
NOTE: Unfortunately, since the snapshots were taken after the class, I don't have any snapshots of multiplayer.
This means that you won’t be able to see any server side activity, including chats. Also,
since this wasn't a photography class, we were allowed to use any image we found online, with the understanding
that if we wanted to publish our work outside the class, we would need to redo the images.
Awesome Scheduler
This is an application that will help a school develop a schedule more tailored to a student’s wants and desires.
This is a project for ComS 362 - Object-Oriented Analysis and Design, which is more focused on project design rather
than making it look pretty. It’s because of this that my group decided to focus less on the graphical user interface
(GUI) and algorithms, and more on the development of the project. In other words, it won’t be fast or pretty, but it
will be well made. (Note, if this were an actual product we would focus on all of the above, but due to time constraints
we decided to focus on what will get us an A and then use the remainder time to make it fast and pretty).
We have 3 users, the administrator, the teacher and the student. The student will be able to add the top three electives
that they wish to take. The teacher will be able to edit their availability to teach their main class.
The administrator will be able to edit all of the above, and actually generate the schedule.
The focus of this class is to get us to practice using the Model View Controller (MVC) pattern. This pattern is designed
mainly for re-usability. You have a “Black Box” program, and use controllers to handle the UI and the database.
Using this pattern will allow others to use your code, but easily change out your UI or database for another.
Click this link for our design document.
This document includes our inception paragraph, list of actors, plan for the three iterations and the use cases and their
descriptions. The description of each use case includes the name, actor, precondition, Main Success Scenario (MSS),
information experts, and (for a few use cases) an extension.
You’ll notice in the design that we had to modify some use cases after Iteration 1 and 2. The reason for the changes
after iteration are obvious, but I want to explain the changes after Iteration 2. One of the use cases during Iteration 2
was “Generate Schedules”. The idea behind this use case was that the instructors could choose a certain period that they
would like to teach a study hall (if you’re unfamiliar with high school study halls, that’s where the students study
at their desks, and the instructor does lesson plans). I just happen to be in a complex algorithms class at the same time,
so I set up a meeting to talk to the professor of that class to come up with an algorithm for this. After a few hours, we
decided that this algorithm, while very interesting, is also considered NP-Hard. While solvable, this algorithm would
probably take more time than what we have to come up with it. I talked to the professor teaching my ComS 362 class, and
since this class isn’t focused on the algorithm, he approved the suggestion to not allow the instructors to choose what
periods to take their study halls. This simplified the algorithm enough for us to easily generate schedules. The way the
program is designed, however, we can easily swap out another algorithm, if we come up with a better one.
Keep in mind, that we spent a total of about 30 minutes on the GUI, so this won’t be as pretty as some of my other projects.
This can be easily fixed in the future however, since we followed the MVC pattern we can easily swap out another user interface.
Connect Four
This was a project that was for a graduate level AI class, requiring the use of one algorithm talked about in class.
The algorithm I decided to use was the minimax algorithm.
There were specific requirements for this class, so I wasn’t able to make a complete product (no GUI for instance),
but the algorithms described in the source code
are working.
Like previously mentioned, I will use the Minimax algorithm, along with a predefined depth. This depth is given by
the player’s choice of difficulty (ie, depth 1 for easy, 3 for medium, 6 for hard). The “super easy”
level is where the computer randomly chooses a slot, and doesn’t perform the algorithm altogether.
This is an application that I created for my wife because she had a need that we couldn’t find in any
other app. She has an issue where she can’t sleep without some static noise or music playing in the background.
We found an awesome track that puts her right to sleep (the static noise wasn’t working for her). The problem
is that when it turns off, she is wide awake. So I started looking for an application that could play music
until a certain time. We found one, but it wasn’t very convenient. It had a sleep function, but it only incremented
by 5 min. In other words, if she wanted a full nights sleep, we would have to press the “+5 minutes” button about 96 times
before we got the time we wanted. So I created this app.
It is worth noting, that this app will never reach the Play Store. I decided it wasn’t worth the $25 to upload,
only to have one person download it. It also allowed me to put the track directly into the assets folder, so we won’t have
to keep track of it. Also, I followed a number of online tutorials to get this finished, but the main one is found
here. I did
deviate from it quite a bit near the end, but this was the best one that got me started in understanding how
the MusicPlayer worked.


Uses of Interface
org.drip.spaces.cover.FunctionClassCoveringBounds
| Package | Description |
|---|---|
| org.drip.spaces.cover |
Vector Spaces Covering Number Estimator
|
| org.drip.spaces.functionclass |
Normed Finite Spaces Function Class
|
-
Uses of FunctionClassCoveringBounds in org.drip.spaces.cover
Classes in org.drip.spaces.cover that implement FunctionClassCoveringBounds Modifier and Type Class Description class
L1R1CoveringBounds
L1R1CoveringBounds implements the Lower/Upper Bounds for the Class of Non-decreasing R1 To L1 R1 for Functions that are:
Absolutely Bounded Have Bounded Variation The References are:
P.class
ScaleSensitiveCoveringBounds
ScaleSensitiveCoveringBounds implements the Lower/Upper Bounds for the General Class of Functions in terms of their scale-sensitive dimensions (i.e., the fat shattering coefficients). -
Uses of FunctionClassCoveringBounds in org.drip.spaces.functionclass
Methods in org.drip.spaces.functionclass that return FunctionClassCoveringBounds Modifier and Type Method Description FunctionClassCoveringBounds
NormedR1ToL1R1Finite. agnosticCoveringNumberBounds()
FunctionClassCoveringBounds
NormedRxToNormedR1Finite. agnosticCoveringNumberBounds()
FunctionClassCoveringBounds
NormedRxToNormedRdFinite. agnosticCoveringNumberBounds()
abstract FunctionClassCoveringBounds
NormedRxToNormedRxFinite. agnosticCoveringNumberBounds()
Retrieve the Agnostic Covering Number Upper/Lower Bounds for the Function ClassFunctionClassCoveringBounds
NormedRxToNormedRxFinite. scaleSensitiveCoveringBounds(GeneralizedValidatedVector gvvi, R1ToR1 funcR1ToR1FatShatter)
Retrieve the Scale-Sensitive Covering Number Upper/Lower Bounds given the Specified Sample for the Function Class


Mutt-1.5.23
Introduction to Mutt
The Mutt package contains a Mail
User Agent. This is useful for reading, writing, replying to,
saving, and deleting your email.
This package is known to build and work properly using an LFS-7.6
platform.
Package Information
-
Download (FTP): ftp://ftp.mutt.org/mutt/mutt-1.5.23.tar.gz
-
Download MD5 sum: 11f5b6a3eeba1afa1257fe93c9f26bff
-
Download size: 3.7 MB
-
Estimated disk space required: 36 MB (plus a further 8MB for
the PDF manual)
-
Estimated build time: 0.7 SBU (plus a further 0.2SBU to
regenerate the html if the required dependencies are present,
and 0.2 SBU to build the PDF manual)
Mutt Dependencies
Optional
Aspell-<IP_ADDRESS>, Cyrus
SASL-2.1.26, GDB-7.8, GnuPG-2.0.26, GPGME-1.5.1,
libgssapi,
libidn-1.29, MIT
Kerberos V5-1.12.2, Mixmaster, an MTA (that provides
a sendmail command),
S-Lang-2.2.4, OpenSSL-1.0.1i
or GnuTLS-3.3.7, Berkeley
DB-6.1.19 or QDBM or Tokyo Cabinet
Optional (To Regenerate HTML Documentation)
libxslt-1.1.28 and either Lynx-2.8.8rel.2,
w3m-0.5.3, or
ELinks
Optional (To Generate PDF Manual)
docbook-dsssl-1.79, OpenJade-1.3.2,
and texlive-20140525
User Notes: http://wiki.linuxfromscratch.org/blfs/wiki/mutt
Installation of Mutt
Note
This version of Mutt is a
development release. The BLFS staff has determined that it
provides a stable program and fixes two issues in the current
stable version of Mutt: a
segmentation fault that occurs under certain conditions and a
compilation problem when building with recent versions of
GCC. To find the current stable
release, please refer to the Mutt home page.
Mutt requires a group named
mail
. You can add this group, if it
does not exist, with this command:
groupadd -g 34 mail
If you did not install an MTA, you need to
modify the ownership of /var/mail
with this command:
chgrp -v mail /var/mail
Install Mutt by running the
following commands:
./configure --prefix=/usr \
--sysconfdir=/etc \
--with-docdir=/usr/share/doc/mutt-1.5.23 \
--enable-pop \
--enable-imap \
--enable-hcache \
--without-qdbm \
--with-gdbm \
--without-bdb \
--without-tokyocabinet &&
make
To generate the PDF manual with texlive-20140525, run the following command:
make -C doc manual.pdf
This package does not come with a test suite.
Now, as the root
user:
make install
If you generated the PDF manual, install it and the source TeX file
by issuing the following command as the root
user:
install -v -m644 doc/manual.{pdf,tex} \
/usr/share/doc/mutt-1.5.23
Command Explanations
--enable-pop
: This switch
enables POP3 support.
--enable-imap
: This switch
enables IMAP support.
--enable-hcache
: This
switch enables header caching.
--without-qdbm
: This switch
disables QDBM as the header cache
backend.
--without-tokyocabinet
:
This switch disables Tokyo Cabinet
as the header cache backend.
--with-gdbm
: This switch
enables GDBM as the header cache
backend.
--without-bdb
: This switch
disables Berkeley DB as the header
cache backend.
--enable-smtp
: This switch enables SMTP
relay support.
--with-ssl
: This parameter adds SSL/TLS
support from OpenSSL-1.0.1i in POP3/IMAP/SMTP if they are
enabled.
--with-sasl
: This parameter adds
authentication support from Cyrus
SASL-2.1.26 in POP3/IMAP/SMTP if they are enabled. Depending on
the server configuration, this may not be needed for POP3 or IMAP.
However, it is needed for SMTP authentication.
--with-slang
: Use S-Lang instead of Ncurses.
Configuring Mutt
Config Files
/etc/Muttrc
, ~/.muttrc
, /etc/mime.types
, ~/.mime.types
Configuration Information
No changes in these files are necessary to begin using
Mutt. When you are ready to make
changes, the man page for muttrc
is
a good starting place.
In order to utilize GnuPG, use
the following command:
cat /usr/share/doc/mutt-1.5.23/samples/gpg.rc >> ~/.muttrc
Contents
Installed Programs:
flea, mutt, mutt_dotlock, muttbug,
pgpewrap, pgpring, and smime_keys
Installed Libraries:
None
Installed Directories:
/usr/share/doc/mutt-1.5.23
Short Descriptions
|
flea
|
is a bug submitter for Mutt.
|
|
mutt
|
is a Mail User Agent (MUA) which enables you to read,
write and delete your email.
|
|
mutt_dotlock
|
implements the mail spool file lock.
|
|
muttbug
|
is a script that executes flea.
|
|
pgpewrap
|
prepares a command line for the GnuPG-2.0.26 utilities.
|
|
pgpring
|
is a key ring dumper for PGP. It is not needed for
GnuPG-2.0.26.
|
|
smime_keys
|
manages a keystore for S/MIME certificates.
|
Last updated on 2014-09-20 19:22:09 -0700


edu.uci.isr.yancees.server.rmi
Class RemoteProtocolSessionImplementation
java.lang.Object
java.rmi.server.RemoteObject
java.rmi.server.RemoteServer
java.rmi.server.UnicastRemoteObject
edu.uci.isr.yancees.server.rmi.RemoteProtocolSessionImplementation
- All Implemented Interfaces:
- java.rmi.Remote, RemoteProtocolSessionInterface, java.io.Serializable, java.rmi.server.Unreferenced
- public class RemoteProtocolSessionImplementation
- extends java.rmi.server.UnicastRemoteObject
- implements RemoteProtocolSessionInterface, java.rmi.server.Unreferenced
This class works as a remote wrapper to the local protocolSession
It is sent as a callback interface to the yancees clients
- See Also:
- Serialized Form
| Fields inherited from class java.rmi.server.RemoteObject |
ref |
| Methods inherited from class java.rmi.server.UnicastRemoteObject |
clone, exportObject, exportObject, exportObject, unexportObject |
| Methods inherited from class java.rmi.server.RemoteServer |
getClientHost, getLog, setLog |
| Methods inherited from class java.rmi.server.RemoteObject |
equals, getRef, hashCode, toString, toStub |
| Methods inherited from class java.lang.Object |
finalize, getClass, notify, notifyAll, wait, wait, wait |
RemoteProtocolSessionImplementation
public RemoteProtocolSessionImplementation(ProtocolSession session)
throws java.rmi.RemoteException
sendMessage
public void sendMessage(MessageInterface message)
throws YanceesException,
java.rmi.RemoteException
- Description copied from interface:
RemoteProtocolSessionInterface
- Send a message to the protocol plug-in that is responsible for this
context
- Specified by:
sendMessage
in interface RemoteProtocolSessionInterface
- Parameters:
message
- is an XML document wrapped in the message.
- Throws:
YanceesException
java.rmi.RemoteException
terminate
public void terminate(MessageInterface message)
throws YanceesException,
java.rmi.RemoteException
- Gracefully terminates the current session
- Specified by:
terminate
in interface RemoteProtocolSessionInterface
- Parameters:
message
- is a finalization message to be sent to the plug-in(s)
created to handle this session
- Throws:
YanceesException
- in case of parsing or message errors
java.rmi.RemoteException
- in case of connection errors
terminate
public void terminate()
throws YanceesException,
java.rmi.RemoteException
- Gracefully terminates the current session
- Specified by:
terminate
in interface RemoteProtocolSessionInterface
- Throws:
YanceesException
- in case of parsing or message errors
java.rmi.RemoteException
- in case of connection errors
unreferenced
public void unreferenced()
- Implements the Unreferenced interface.
This class is invoked by the Distributed Garbage Collector when the RMI reference
counter for this object becomes 0 or when there is no communication for more than
the lease period, which default timeout is 10 minutes.
This method is used to release any resource allocated to this record which,
in this case, is the protocol plug-in.
- Specified by:
unreferenced
in interface java.rmi.server.Unreferenced


You can begin writting your posts under /_posts
folder. See Jekyll doc on posts.
Posts are automatically grouped under site’s post/category and post/tag menu. You can define post’s category and tags in the post’s front matter, using category
and tags
front matter block.
Sereis are implemented using Jekyll’s collections. So to add new series, following these steps:
Define a new collection in _config.yml
, under collections
configuration block
collections:
demo_series:
output: true
Note that to make the change to _config.yml
take effects, you need to restart jekyll.
Create the series (aka collection) folder /_demo_series
. Note that the folder name begin with _
By adding new post under series folder, you add post under the corresponding series
Happy blogging!


|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
| Interface Summary | |
|---|---|
| TableMap<K extends WritableComparable<? super K>,V extends Writable> | Deprecated. |
| TableReduce<K extends WritableComparable,V extends Writable> | Deprecated. |
| Class Summary | |
|---|---|
| BuildTableIndex | Deprecated. |
| Driver | Deprecated. |
| GroupingTableMap | Deprecated. |
| HRegionPartitioner<K2,V2> | Deprecated. |
| IdentityTableMap | Deprecated. |
| IdentityTableReduce | Deprecated. |
| IndexConfiguration | Deprecated. |
| IndexConfiguration.ColumnConf | |
| IndexOutputFormat | Deprecated. |
| IndexTableReduce | Deprecated. |
| LuceneDocumentWrapper | Deprecated. |
| RowCounter | Deprecated. |
| TableInputFormat | Deprecated. |
| TableInputFormatBase | Deprecated. |
| TableMapReduceUtil | Deprecated. |
| TableOutputFormat | Deprecated. |
| TableOutputFormat.TableRecordWriter | Convert Reduce output (key, value) to (HStoreKey, KeyedDataArrayWritable) and write to an HBase table |
| TableSplit | Deprecated. |
Provides HBase MapReduce Input/OutputFormats, a table indexing MapReduce job, and utility
MapReduce jobs deployed to a MapReduce cluster do not by default have access
to the HBase configuration under $HBASE_CONF_DIR
nor to HBase classes.
You could add hbase-site.xml
to $HADOOP_HOME/conf and add
hbase-X.X.X.jar
to the $HADOOP_HOME/lib
and copy these
changes across your cluster but the cleanest means of adding hbase configuration
and classes to the cluster CLASSPATH
is by uncommenting
HADOOP_CLASSPATH
in $HADOOP_HOME/conf/hadoop-env.sh
adding hbase dependencies here. For example, here is how you would amend
hadoop-env.sh
adding the
built hbase jar, zookeeper (needed by hbase client), hbase conf, and the
PerformanceEvaluation
class from the built hbase test jar to the
hadoop CLASSPATH
:
# Extra Java CLASSPATH elements. Optional. # export HADOOP_CLASSPATH= export HADOOP_CLASSPATH=$HBASE_HOME/build/hbase-X.X.X.jar:$HBASE_HOME/build/hbase-X.X.X-test.jar:$HBASE_HOME/conf:${HBASE_HOME}/lib/zookeeper-X.X.X.jar
Expand $HBASE_HOME
in the above appropriately to suit your
local environment.
After copying the above change around your cluster (and restarting), this is how you would run the PerformanceEvaluation MR job to put up 4 clients (Presumes a ready mapreduce cluster):
The PerformanceEvaluation class wil be found on the CLASSPATH because you added$HADOOP_HOME/bin/hadoop org.apache.hadoop.hbase.PerformanceEvaluation sequentialWrite 4
$HBASE_HOME/build/test
to HADOOP_CLASSPATH
Another possibility, if for example you do not have access to hadoop-env.sh or
are unable to restart the hadoop cluster, is bundling the hbase jar into a mapreduce
job jar adding it and its dependencies under the job jar lib/
directory and the hbase conf into a job jar conf/
directory.
HBase can be used as a data source, TableInputFormat
,
and data sink, TableOutputFormat
, for MapReduce jobs.
Writing MapReduce jobs that read or write HBase, you'll probably want to subclass
TableMap
and/or
TableReduce
. See the do-nothing
pass-through classes IdentityTableMap
and
IdentityTableReduce
for basic usage. For a more
involved example, see BuildTableIndex
or review the org.apache.hadoop.hbase.mapred.TestTableMapReduce
unit test.
Running mapreduce jobs that have hbase as source or sink, you'll need to specify source/sink table and column names in your configuration.
Reading from hbase, the TableInputFormat asks hbase for the list of
regions and makes a map-per-region or mapred.map.tasks maps
,
whichever is smaller (If your job only has two maps, up mapred.map.tasks
to a number > number of regions). Maps will run on the adjacent TaskTracker
if you are running a TaskTracer and RegionServer per node.
Writing, it may make sense to avoid the reduce step and write yourself back into
hbase from inside your map. You'd do this when your job does not need the sort
and collation that mapreduce does on the map emitted data; on insert,
hbase 'sorts' so there is no point double-sorting (and shuffling data around
your mapreduce cluster) unless you need to. If you do not need the reduce,
you might just have your map emit counts of records processed just so the
framework's report at the end of your job has meaning or set the number of
reduces to zero and use TableOutputFormat. See example code
below. If running the reduce step makes sense in your case, its usually better
to have lots of reducers so load is spread across the hbase cluster.
There is also a new hbase partitioner that will run as many reducers as
currently existing regions. The
HRegionPartitioner
is suitable
when your table is large and your upload is not such that it will greatly
alter the number of existing regions when done; other use the default
partitioner.
See RowCounter
. You should be able to run
it by doing: % ./bin/hadoop jar hbase-X.X.X.jar
. This will invoke
the hbase MapReduce Driver class. Select 'rowcounter' from the choice of jobs
offered. You may need to add the hbase conf directory to $HADOOP_HOME/conf/hadoop-env.sh#HADOOP_CLASSPATH
so the rowcounter gets pointed at the right hbase cluster (or, build a new jar
with an appropriate hbase-site.xml built into your job jar).
See org.apache.hadoop.hbase.PerformanceEvaluation from hbase src/test. It runs a mapreduce job to run concurrent clients reading and writing hbase.
A students/classes example based on a contribution by Naama Kraus with logs of
documentation can be found over in src/examples/mapred.
Its the org.apache.hadoop.hbase.mapred.SampleUploader
class.
Just copy it under src/java/org/apache/hadoop/hbase/mapred to compile and try it
(until we start generating an hbase examples jar). The class reads a data file
from HDFS and per line, does an upload to HBase using TableReduce.
Read the class comment for specification of inputs, prerequisites, etc.
Here's a sample program from Allen Day that takes an HDFS text file path and an HBase table name as inputs, and loads the contents of the text file to the table all up in the map phase.
package com.spicylogic.hbase; package org.apache.hadoop.hbase.mapred; import java.io.IOException; import org.apache.hadoop.conf.Configuration; import org.apache.hadoop.fs.Path; import org.apache.hadoop.hbase.HBaseConfiguration; import org.apache.hadoop.hbase.client.HTable; import org.apache.hadoop.hbase.io.BatchUpdate; import org.apache.hadoop.io.LongWritable; import org.apache.hadoop.io.Text; import org.apache.hadoop.mapred.FileInputFormat; import org.apache.hadoop.mapred.JobClient; import org.apache.hadoop.mapred.JobConf; import org.apache.hadoop.mapred.MapReduceBase; import org.apache.hadoop.mapred.Mapper; import org.apache.hadoop.mapred.OutputCollector; import org.apache.hadoop.mapred.Reporter; import org.apache.hadoop.mapred.lib.NullOutputFormat; import org.apache.hadoop.util.Tool; import org.apache.hadoop.util.ToolRunner; /** Class that adds the parsed line from the input to hbase in the map function. Map has no emissions and job has no reduce. / public class BulkImport implements Tool { private static final String NAME = "BulkImport"; private Configuration conf; public static class InnerMap extends MapReduceBase implements Mapper<LongWritable, Text, Text, Text> { private HTable table; private HBaseConfiguration HBconf; public void map(LongWritable key, Text value, OutputCollector<Text, Text> output, Reporter reporter) throws IOException { if ( table == null ) throw new IOException("table is null"); // Split input line on tab character String [] splits = value.toString().split("\t"); if ( splits.length != 4 ) return; String rowID = splits[0]; int timestamp = Integer.parseInt( splits[1] ); String colID = splits[2]; String cellValue = splits[3]; reporter.setStatus("Map emitting cell for row='" + rowID + "', column='" + colID + "', time='" + timestamp + "'"); BatchUpdate bu = new BatchUpdate( rowID ); if ( timestamp > 0 ) bu.setTimestamp( timestamp ); bu.put(colID, cellValue.getBytes()); table.commit( bu ); } public void configure(JobConf job) { HBconf = new HBaseConfiguration(job); try { table = new HTable( HBconf, job.get("input.table") ); } catch (IOException e) { // TODO Auto-generated catch block e.printStackTrace(); } } } public JobConf createSubmittableJob(String[] args) { JobConf c = new JobConf(getConf(), BulkImport.class); c.setJobName(NAME); FileInputFormat.setInputPaths(c, new Path(args[0])); c.set("input.table", args[1]); c.setMapperClass(InnerMap.class); c.setNumReduceTasks(0); c.setOutputFormat(NullOutputFormat.class); return c; } static int printUsage() { System.err.println("Usage: " + NAME + " <input> <table_name>"); System.err.println("\twhere <input> is a tab-delimited text file with 4 columns."); System.err.println("\t\tcolumn 1 = row ID"); System.err.println("\t\tcolumn 2 = timestamp (use a negative value for current time)"); System.err.println("\t\tcolumn 3 = column ID"); System.err.println("\t\tcolumn 4 = cell value"); return -1; } public int run(@SuppressWarnings("unused") String[] args) throws Exception { // Make sure there are exactly 3 parameters left. if (args.length != 2) { return printUsage(); } JobClient.runJob(createSubmittableJob(args)); return 0; } public Configuration getConf() { return this.conf; } public void setConf(final Configuration c) { this.conf = c; } public static void main(String[] args) throws Exception { int errCode = ToolRunner.run(new Configuration(), new BulkImport(), args); System.exit(errCode); } }
|
||||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


It's all about the user. Understanding the experience obtained by the user in a process of interaction and how to apply it in a product. Making the design proccess more effective and functional by knowing the user's needs, expectations and experiences.
Working for the web is working with different aproaches at the same time making flexible layouts ready for desktop and mobile devices.
Being able to create immersive user experiences by using three main languages: HTML, CSS and JQuery.
I started my graduation in Graphic Design at Faculty of Fine Arts - University of Porto.
For 3 days I had the chance to watch and learn from the best! Stefan Sagmeister, Paula Scher, PES and much more.
I got my master's degree in Multimedia Design at Faculty of Engineering - University of Porto.
I started working at the Multimedia Department in Areal Editores, a publishing company focused on education.
Good experiences must be repeated, this time in the beautiful city of Paris. I got to meet some of my favourite designers and agencies: Non-Format, Multitouch Barcelona, Neville Brody, The Mill...
If you were to ask me what things I most appreciate in life I would say... Traveling, traveling, traveling :)
Here I go again! This time I saw Jessica Walsh, GMUNK, VASAVA, From From... and many more.
I always loved water sports and I practiced swimming from an early age but never had the chance to try surfing. At the age of 29 I discovered what I had been missing!
A lifetime experience. The country where a day has 48 hours and where everything is possible. One must love India.
After years of hypertrophy training... yes, I belong to the 1% of the population that wants to get some extra weight... I decided to step out of my confort zone and I haven't regreted it :)
Digital Designer
+351 964 31 92 55


This page contains web elements for practicing event handling. View the HTML source of this page to see the IDs that have been assigned to each element.
As before, type your script into the text area, then click the Run button to try it. You’ll want some form of JavaScript debugging tool (such as Firebug for Firefox or the Developer menu in Chrome) to see if there were problems with your script.
: :


In the last year, my friends and I have started planning our (most likely over the top) grad trip. Full blown Otaku experience. Starry night in Alaska. Walk in the streets of Paris. Of course, as a data-driven person, I wanted to have an empirical approach to the problem. How? By being a typical girl of my generation and turning to social media for inspiration...
Instagram was the perfect data source for this project since I was already using it for inspiration for a lot of things. I can choose accounts such as beautifuldestinations with more than 8000 labeled images, or choose traveling influencers such as taramilktea (yes, this is a job) with around 1000 labeled images each. I chose the second option since it allows more customization and align with future potential enhancements (e.g. allow my friends to label data under their own username). After more procrastination (I mean, research), I was able to select 8 instagrammers with a wide variety of traveling experiences I would love to learn more about: taramilktea, girleatworld, skipwithgrace, wearetravelgirls, loic.lagarde, everchanginghorizon, danielkordan, and adventuresoflilnicki.
Collecting data was a time consuming process and I tried both pythonanywhere and Heroku run bash to help me. Unfortunately, pythonanywhere does not let you "requests" from a lot of websites and heroku's console require the session to be open. I may try Java instead of Python (potentially faster?) or "simulate a simple Map-Reduce model and split the work amongst a bunch of machines - Debarghya Das" as an additional exercise to this project. Overall, since I was running my code linearly in two servers (no distributed system), it took 4 hours to get all the data.
Since a lot of travelers use Asian characters to tag their location, I was extremely happy to see Google Maps API allows utf-8 encoding. It made my life so much EASIER. However, when the location is not clear enough, Google Maps is unable to find the coordinates. There are multiple ways to solve this (go back to the link, scrap the instagram description, tags, etc) but I decided to not worry about if for now.
At first, I used a colorful map . After all, this will be a summer trip with a lot of exciting activities! I also wanted to use one unique icon per user. Something like this:
It gave a really pretty output. I now had to scale up for 8 different users with an average of 1000 pictures each. Yikes. The design above would be way too busy and I decided to tone down (my enthusiast) and choose a more user friendly interface. I struggled between the light map which really brings out the color of the dots:
And the more colorful but equality efficient street v7 map. I ultimately decided on the latter.
Overall, I am very happy with the current version. I know I can already use it to plan a filling and ambitious trip. Over the next few weeks/months, I will keep improving on this project. My goal is to add more interactiveness using a database and logging system and a more user friendly interface when clicking on the dots.


.:*A*:._.:*S*:._.:*C*:._.:*I*:._.:*I*:._.:*~*:._.:*A*:._.:*R*:._.:*T*:.
Join the memes!
New GameHow to play: Use your arrow keys to move the tiles. When two tiles with the same meme touch, they merge into one!
Original version created by Gabriele Cirulli. Based on 1024 by Veewo Studio and conceptually similar to Threes by Asher Vollmer.
.:*A*:._.:*S*:._.:*C*:._.:*I*:._.:*I*:._.:*~*:._.:*A*:._.:*R*:._.:*T*:.


Import Shared Library Report |
Wednesday, August 10, 2011 6:04:11 PM
Your generated files are installed in the following folder:
C:\QuickUSB
Parsing header file warnings:
No errors/warnings occurred when parsing the header file.
No errors/warnings occurred when generating the wrapper VIs for this shared library.


Craftsmengraff
Menu
Home
About
Services
Our Works
Contact
Our Works
All
Kitchen
Bed Room
Living Area
Stair Case


 She huffs and carries on and on about respecting your elders. Finally, after a long sermon about respect, she asks for proof of your mother’s innocence. Do you..
Lie and say that your mom got the medicine from an old woman down the street.
Say that your mother loved your father and that there is no way she could have killed him.


Slack Single Sign On
Slack supports a variety of different login options: standard user-based login, OAuth login with Google Accounts, or SAML login. Slack also has managed to provide a good process to converting an account from one login system to another.
On the administration page of a Slack team, there is an option to select Google Apps or SAML. It should be noted that Slack has different pricing tiers and the middle tier allows you to access the Google Apps login option, and you must be on the highest tier to access the SAML option.
Google Apps Authentication
When visiting this page from an account that is using standard (username/password) authentication, and attempting to enable Google Apps auth, there are a few options. Everything has good defaults, but before enabling Google Apps authentication, the administrator has a chance to review and change these settings:
Some of these items are very powerful:
Allow users to change their username: Some products, like Slack, the username is a very integral part of the product. Other applications may not really care too much about the internal username. Slack has decided to recognize this and allow individual users to customize their username without having to ask an admin to change anything in the Google Account.
Google auth for your team must be used by: Slack has decided to not make this an all-or-nothing option. Again, recognizing the typical use of their own product, they’ve decided that you can enforce Google Apps login for everyone, just for your own team, or make it completely optional. This is a product decision you should consider for your own product. But it is important that a single login source can be enforced in large, enterprise deployments.
The bottom of that screen also has a comment that says Binding emails will be sent to your team members in order to have them configure SSO with their Slack accounts. This is a great feature that should be implemented in any product. The path to enable SAML isn’t always at the beginning, when a product is first adopted. Often, there will be history and users and content created. Allowing users of your application to transfer their history to the new login credentials is probably a requirement.
SAML Authentication
In addition to Google Apps, Slack supports pure SAML authentication. When starting to configure SAML login, there are a few options. While SAML is a standard, having easy-to-use buttons to enable some of the most popular SAML providers is a nice feature. If a Slack team wants to use Azure for login, they can select the Azure button, or selecting the Custom SAML 2.0 option will still work.
In this walkthorugh, I’m going to set up a Slack account to authenticate against a OneLogin service. Enabling it for Slack presents the following screen:
There are a few fields, but Slack does a good job helping the administrator know what to put into each. Compare that screenshot from the Slack site to the screenshot on the OneLogin Administrator page:
Slack does a good job by naming these fields as similar to the OneLogin names as possible. And they provide hints/placeholder text in the fields that closely resemble the actual contents that you would expect to enter.
After saving this and configuring users on the OneLogin service to have access, the signin process in the Slack client now goes through OneLogin:
This was published on Nov. 22, 2016.
Content Contributors
Is a feature of your app EnterpriseReady?
We'd love to work with you to breakdown your implementation and share it with the EnterpriseReady community.


Choose the length of the number the oponent will have to think of (4 is recommended).
This number will consist of non equal digits from 1 till 9 that you will have to find out.
Guess all the bulls and you win!


AppleTV and HD
ROCKS!
Using the atv-bootloader method, I've got my appleTV running a MythTV frontend (via Mythbuntu) with an HDHomeRun on the backend. And I just watched Canada walk into the Beijing National Stadium in HD. Awesome.
About this entry
You"re currently reading "AppleTV and HD," an entry on a crick in the net
- Published:
- 08.08.08 / 9am
- Category:
- MythTV


We can use absolutely positioned elements to create a fluid layout which can size itself with respect to the browser window. This a fundamental principle of Responsive Design, and it will allow us to create a web page which functions predictably on mobile, tablet, and desktop browsers.
We'll begin by creating a basic web page and adding some standard semantic elements to organize our layout:
<!DOCTYPE html>

<title>Fluid Layout using Absolute Positioning</title>

The elements we are using are commonly found in web pages:
header
element represents a group of introductory or navigational aids. It may contain some heading elements but also other elements like a logo, a search form, and so on.nav
element represents a section of a page whose purpose is to provide navigation links, either within the current document or to other documents. Common examples of navigation sections are menus, tables of contents, and indexes.main
element represents the main content of the body of a document, portion of a document, or application. The main content area consists of content that is directly related to, or expands upon the central topic of, a document or the central functionality of an application.footer
element represents a footer for its nearest sectioning content or sectioning root element. A footer typically contains information about the author of the section, copyright data or links to related documents.Right now these are empty, unstyled elements. So we'll add some placeholder text in each, and give them some background colors to make their boxes readily visible:
<!DOCTYPE html>

<title>Fluid Layout using Absolute Positioning</title>

HEADER
NAV
MAIN
FOOTER

Since we want our layout to work on mobile devices with small screens, we'll design it for a screen with a width of 320 pixels and a height of 480 pixels:
Notice how the elements are positioned just inside the outer edge. This is because the body
element has a default margin around it.
The first thing we need to do is fix the body so it is the same size as the browser window (the outer black line in the example above):
<!DOCTYPE html>

<title>Fluid Layout using Absolute Positioning</title>

HEADER
NAV
MAIN
FOOTER

This removes the unwanted margin and sets each side of the body
element to be flush against the edges of the browser window:
With the body
element positioned, we can now absolutely position all of layout elements within the browser window. For demonstration purposes, we'll work bottom-to-top, starting with the footer
and finishing with the header
.
We'll position the footer
at the bottom of the browser window:
<!DOCTYPE html>

<title>Fluid Layout using Absolute Positioning</title>

HEADER
NAV
MAIN
FOOTER

Notice we are not setting the top
property. We are using the height
property to determine the size of the footer. We want the footer to stretch horizontally, but not vertically as the browser window changes size. We are also using rem
units for our height
value so we can accommodate increases in font size.
Now we'll position the main
element just above the footer. It will take up most of the page, but we'll leave some space above it for the nav
and header
elements:
<!DOCTYPE html>

<title>Fluid Layout using Absolute Positioning</title>

HEADER
NAV
MAIN
FOOTER

Notice we are setting the bottom
property of the main
element equal to the height
of the footer
element. Also we are not setting the height
property because we want this element to stretch both horizontally and vertically.
We also are adding overflow: auto
since this is where all of the content is going to go, and we don't want the content overflowing the main
element and messing up our layout. Setting the overflow
to auto
will tell the browser to automatically allow the content to scroll within the element if it exceeds the dimensions.
Now we can position the nav
above the main
element, leaving room above it for the header
:
<!DOCTYPE html>

<title>Fluid Layout using Absolute Positioning</title>

HEADER
NAV
MAIN
FOOTER

Just as we did with the footer
, we set the height
property on the nav
, so it will only stretch horizontally:
Finally we can position the header
at the very top of the browser:
<!DOCTYPE html>

<title>Fluid Layout using Absolute Positioning</title>

HEADER
NAV
MAIN
FOOTER

Now we have a fluid layout that will stretch to accommodate any screen width:


About
Data Collection and Sampling
We collected a corpus of tweets about the 2017 UK general election through Twitter’s streaming API, tracking 14 hashtags. Data harvesting was performed between 26th May and 21st June 2017 to capture the ongoing discussion in the 2 weeks running up to the election and then the two week post-election period. In order to identify relevant topic-entities in each tweet, we match tweets against two manually curated lists of keywords (both were created during the 2015 UK election cycle). The following include:
- A list of 438 topic keywords relevant to 9 popular election issues. The initial list of 420 seed words provided by a team of journalists was augmented by searching for similar words within a vector space on the basis of cosine similarity.
- A list of 71 political-party names relevant to 9 political parties such as “tories” and “lib dems”.
In the resulting corpus each tweet contains at least one keyword (i.e. topic-entity) from the two lists above. To make sure we have a high quality low noise corpus, we have trained a Twitter spam detection model using the data and user features described in [1] and filtered out those that are identified as spam tweets by the model.
Sentiment Classification
An early study by [2] showed that 40% of Twitter sentiment classification errors are caused by using tweet-level approaches that are independent of the target/topic entities. Here we go beyond of tweet-level approaches and adopt the multi-target-specific approach proposed in [3], which finds the syntactically connected parts of a tweet to each topic-entity and then extracts word embedding features from these syntactically dependent tokens in order to calculate the sentiment. It was shown to obtain state-of-the-art performance in two data sets. Each topic-entity instance is classified as ‘negative’, ‘positive’ or ‘neutral’.
Tweet Summarisation
Here we extract a list of representative tweets summarising the sentiment(s) expressed towards each topic entity at each day (e.g. tweets containing positive sentiment towards ‘green party’ posted at 26th May 2017). As a prerequisite for summarisation, we further group tweets containing the same sentiment towards a topic or entity on each day into a number of clusters, with each cluster presumably representing a theme or reasons surrounding the particular choice of sentiment. We adopt the two-stage hierarchical topic modelling approach proposed in [4] and select the GSDMM+OLDA model for this task. If there are fewer than 10 unique tweets containing the same sentiment towards a topic entity on a particular day, we skip the tweet clustering step and treat these tweets as one cluster. To extract representative tweets for summarising each cluster, we place every tweet in one common embedding space and find 20 tweets that are the closest to the cluster centroid (also known as metroid tweets) as summary candidates. We select the most informative tweet from the 20 candidates as the summary for that cluster, and the final summary for the sentiment expressed towards the topic entity is the summaries combined from all its clusters (e.g. tweets containing positive sentiment towards ‘green party’ posted on 26th May 2017, comprise 8 clusters and therefore a list of 8 representative tweets as their summary).
References:
[1] B. Wang, A. Zubiaga, M. Liakata, and R. Procter. Making the Most of Tweet-inherent Features for Social
Spam Detection on Twitter. Workshop on Making Sense of Microposts (# Microposts2015) WWW, 1395:10–16,
2015.
[2] Long Jiang, Mo Yu, Ming Zhou, Xiaohua Liu, and Tiejun Zhao. Target-dependent twitter sentiment
classification. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics
(ACL). 2011.
[3] B. Wang, M. Liakata, A. Zubiaga, and R. Procter. TDParse: multi-target-specific Sentiment Recognition on
Twitter. The 15th Conference of the European Chapter of the Association for Computational Linguistics, 3-7
April, 2017.
[4] B. Wang, M. Liakata, A. Zubiaga, and R. Procter. A Hierarchical Topic Modelling Approach for Tweet
Clustering. The 9th International Conference on Social Informatics (SocInfo). 2017.


Select SingleSelect
by element
| SingleSelect with name |
|
|
|
|
| SingleSelect with id |
|
|
| SingleSelect with name and default value |
|
|
| SingleSelect identified by label |
|
|
by layout
| directly before |
|
|
| directly before formated |
|
|
| separate element at top |
|
|
| separate element at top formated |
|
|
| separate element at left |
|
|
| separate element at left formated |
|
|
|
Select MultipleSelect
by element
| MultipleSelect with name |
|
|
|
|
| MultipleSelect with id |
|
|
| MultipleSelect with name and default value |
|
|
| MultipleSelect identified by label |
|
|
by layout
| directly before |
|
|
| directly before formated |
|
|
| separate element at top |
|
|
| separate element at top formated |
|
|
| separate element at left |
|
|
| separate element at left formated |
|
|
|
Select Checkbox
by element
| CheckBox with name |
|
|
| CheckBox with title |
|
|
| CheckBox with id |
|
|
| CheckBox with name and checked |
|
|
| CheckBox identified by label |
|
|
by layout
| directly after |
|
|
| directly after formated |
|
|
| separate element at bottom |
|
|
| separate element at top formated |
|
|
| separate element at right |
|
|
| separate element at right formated |
|
|
|
Select RadioButtonGroup
by element
| RadioButtonGroup with name (not possible because all radio buttons share the same name) |
| |
| RadioButtonGroup with id |
|
|
| RadioButtonGroup with id and checked |
|
|
| RadioButton identified by label |
|
|
by layout
| directly after |
|
|
| directly before formated |
|
|
| separate element at right |
|
|
| separate element at right formated |
|
|
|
| Select after this text |
Select after this formated text |
|
|
Select SingleSelect
by element
| SingleSelect with name |
|
|
|
|
| SingleSelect with id |
|
|
| SingleSelect with name and default value |
|
|
| SingleSelect identified by label |
|
|
by layout
| directly before |
|
|
| directly before formated |
|
|
| separate element at top |
|
|
| separate element at top formated |
|
|
| separate element at left |
|
|
| separate element at left formated |
|
|
|
Select MultipleSelect
by element
| MultipleSelect with name |
|
|
|
|
| MultipleSelect with id |
|
|
| MultipleSelect with name and default value |
|
|
| MultipleSelect identified by label |
|
|
by layout
| directly before |
|
|
| directly before formated |
|
|
| separate element at top |
|
|
| separate element at top formated |
|
|
| separate element at left |
|
|
| separate element at left formated |
|
|
|
Select Checkbox
by element
| CheckBox with name |
|
|
| CheckBox with title |
|
|
| CheckBox with id |
|
|
| CheckBox with name and checked |
|
|
| CheckBox identified by label |
|
|
by layout
| directly after |
|
|
| directly after formated |
|
|
| separate element at bottom |
|
|
| separate element at top formated |
|
|
| separate element at right |
|
|
| separate element at right formated |
|
|
|
Select RadioButtonGroup
by element
| RadioButtonGroup with name (not possible because all radio buttons share the same name) |
| |
| RadioButtonGroup with id |
|
|
| RadioButtonGroup with id and checked |
|
|
| RadioButton identified by label |
|
|
by layout
| directly after |
|
|
| directly before formated |
|
|
| separate element at right |
|
|
| separate element at right formated |
|
|
|


Login
About Coderdojo
The Hive
Register
Share Your Site
Register for Coderdojo at the Hive!
Local Map
Check the
library's calendar
for new session dates
Name
Email
Which Track?
Code.org
Build a Site (HTML/CSS/JS)
Firebase and Github
I need a laptop


home
Courses
contact
Login
home
Courses
contact
login
Course Name:
Country:
Paraguay
Language:
English
Search
Clear Filter
Search Results
JavaScript
Jane Doe
4.8
$15.99
Node.Js
Karen Gomez
4.9
$25.99
Advanced CSS
John Martinez
5
$10.99


Requirements
Summary
A system to manage community engagement in proposing and selecting public art projects.
Purpose
The system serves two primary purposes:
- Collection and exposition of ideas and proposals from and to the community.
- Facilitation of community input on which ideas will receive funding.
Roles
The system shall be designed for users with different roles -- these roles are:
- Admins - Site administrators who have the highest privileges, including creation of other users in other roles. They control and maintain the system.
- Moderators - Trusted users who have permissions to manage any data in the system unrelated to users (e.g. ideas, proposals, posts). They filter and revise site content.
- Steerers - Members of a "steering committee" who have permission to see most data in the system, even if it is not publically available, and are able to use this data to communicate with each other. They direct Pauselab's focus and draw insights from the community.
- Artists - Community members who propose public art projects to address community needs.
- Super Artists - Subset of artists who are selected to implement projects and report on their progress through a post. They carry out the will of the community.
- Residents - Community members who view the system's published content and possibly submit ideas about improvements to an area. They are representatives of the community.
Features
The system follows the lifecycle of one or more public art projects from its inception to its completion. As a result, it will have different views that are exposed at different times for each phase of a project. Site moderators will have the ability to change which phase is active.
Idea Collection: the community submits and views ideas about ways to improve certain areas.
- Residents will submit ideas through a simple form which contains their name, contact information (email and phone), and description of the idea (a choice of moderator-defined categories, some prose, location). next semester: to locate ideas, residents may place a pin on a map or write out the location through a text field. Residents need not prove their identity to submit ideas.
- Moderators can enter ideas if they receive them non-electronically.
- Moderators can see all submitted ideas through a table. Moderators can approve ideas after verifying their content is appropriate (this "publishes" the idea). Moderators can edit ideas for syntax or content, or delete them from the system.
- Residents will see published ideas on a map, where the idea's location corresponds with the area it would improve. Ideas will also be displayed in a card view and can be sorted by location, category, newest, most liked. Residents can "like" ideas to indicate interest early on.
Proposal Collection: artists submit proposals for solutions related to the community's ideas.
- Residents can no longer submit ideas.
- Artists will submit proposals through a more involved form which contains:
- Idea(s) being addressed (through text)
- Prose, and possibly images, about proposal
- Attachments related to credentials
- Budget estimates
- Moderators can enter proposals if they receive them non-electronically.
- Steerers can see proposals and make internal-facing comments regarding their feasibility.
- Moderators can see proposals and publish them after ensuring the project is feasible. Moderators can edit proposals for syntax or content, or delete them from the system.
- Residents will see published proposals through a grid and can sort by date.
Proposal Voting: the community votes on which projects will receive funding.
- Artists can no longer submit proposals.
- Residents can see published proposals through a grid. They will have a form to submit votes on their favorite proposals.
- The form will collect the voter's name, email, phone, address, and have an honor statement that must be agreed to prior to submission.
- They will select a finite number of proposals - 2 or 3 as their top choice.
- They might allocate votes based on a specified budget. (not a desired feature)
- next semester: Unlike "liking," voting needs protection against fraud, through a combination of CAPTCHA and "honor pledge."
- Moderators can enter votes if they receive them non-electronically.
Project Implementation: after projects are selected, the system presents feedback on their progress.
- Super artists and moderators can create posts containing prose and images to report progress about the selected projects.
- Residents can view posts in some type of chronological view. They can apply filters to select certain time periods.
- Ideas or proposals that did not receive funding are stored for future reference (e.g. if they can be applied to the next round).
Site-wide Requirements
- Integration with social media (Facebook, Twitter) during most if not all phases, to increase engagement with residents.
- Email assist capabilities for moderators/steerers to reach out to artists submitting proposals, and possibly residents submitting ideas.
- Website should be responsive on mobile.
- Website should be designed to be extensible to multiple languages.
- Residents do not need to create accounts. Artists do, and may do so on their own. Steerers, moderators, and admins need accounts and can only have them created by an admin.
- Only admins have the ability to manage user accounts.
- Some user roles (that is, steerer and artist) will have a "landing page" that contains static content (prose, image, and links to file downloads) about their responsibilities, as well as moderator-published updates. The moderator can post images, text, and links on the landing pages.
- The navbar at the top should adjust depending on the phase of the project. All phases will have "About" as static pages that the moderator can edit, as well as the "Post" page.
- Ideas phase: Ideas - Submit Idea, See Ideas
- Proposals phase: Proposals - Submit Proposals, See Proposals; Ideas
- Voting phase: Vote; Proposals; Ideas
Deadlines
Minimum Requirements: All requirements defined under "Features" except those in "Site-wide requirements" and noted as "next semester."
Desired Requirements: All requirements defined under "Features."
Optional Requirements: As defined by client.


Protocols
The following protocols are available globally.
-
The basic protocol for something that represents a predicate field.
See moreDeclaration
Swift
public protocol PredicateField : CustomStringConvertible
-
The basic protocol for something that represents a predicate query.
See moreDeclaration
Swift
public protocol PredicateQuery : FlowNillable
-
The result protocol of a predicate query.
See moreDeclaration
Swift
public protocol PredicateResult : CustomDebugStringConvertible, CustomStringConvertible
-
Undocumented
See moreDeclaration
Swift
public protocol FlowComparable
-
Undocumented
See moreDeclaration
Swift
public protocol FlowEquatable
-
Undocumented
See moreDeclaration
Swift
public protocol FlowNillable
-
Undocumented
See moreDeclaration
Swift
public protocol FlowStringComparable
-
Protocol to compound predicates.
See moreDeclaration
Swift
public protocol CompoundablePredicate : CompoundablePredicateResult
-
Protocol to compound predicate results.
See moreDeclaration
Swift
public protocol CompoundablePredicateResult
-
Protocol to group predicates in brackets.
See moreDeclaration
Swift
public protocol GroupingPredicate : CompoundablePredicate
-
Used for defining generated predicate schema.
See moreDeclaration
Swift
public protocol GeneratedPredicateSchema
-
This builder is useful to construct predicate properties.
See moreDeclaration
Swift
public protocol PredicatePropertyBuilder
-
Use this protocol to define which classes/structs required to generate their related schemas.
Declaration
Swift
public protocol PredicateSchema


Squirtle
Starting
pokemon
water type
from the first generation of
pokemon
. One of the three starting
pokemon
in the Kantто region. The first two of them are
Bulbasaur
and
Charmander
.


Let's make some good stuff.
<EMAIL_ADDRESS>1<PHONE_NUMBER> https://github.com/Zinlul https://www.linkedin.com/in/kylebuchanan3d/ Thunder Bay, Ontario


Type-specific hash set collection classes. The classes in this package implement type-specific hash sets supporting a subset of the normal collection methods. The standard public access methods in these classes are as follows:
| Method Signature | From |
boolean add(type) | implementation class |
void clear() | {@link com.sosnoski.util.PrimitiveHashBase} or {@link com.sosnoski.util.ObjectHashBase} |
Object clone() | implementation class |
boolean contains(type) | implementation class |
void ensureCapacity(int) | {@link com.sosnoski.util.PrimitiveHashBase} or {@link com.sosnoski.util.ObjectHashBase} |
Iterator iterator() | {@link com.sosnoski.util.hashset.ObjectSetBase} (not implemented for primitives) |
boolean remove(type) | implementation class |
int size() | {@link com.sosnoski.util.PrimitiveHashBase} or {@link com.sosnoski.util.ObjectHashBase} |
The access methods are unsynchronized for best performance. The user program must implement appropriate locking if multiple threads need to access an instance of these classes while that instance may be modified.
Collections of a primitive type and of a specific object type are both supported. Hash sets of primitive types derive from the {@link com.sosnoski.util.hashset.PrimitiveSetBase} base class, and those of object types derive from the {@link com.sosnoski.util.hashset.ObjectSetBase}. To define a hash set of a new type, generally you can use one of the existing classes as a base and do a text substitution of the type names.
This is generally not too useful for object types, since none of the methods
return values of the type present in the table. The sample implementations include
sets of String
s as well as generic Object
s, but there's really
little reason to use anything other than the Object
set in practice.
Collections of object types may be configured to use any of three possible
combinations of hash method and key comparison techniques. The choice is determined by an
optional tech
parameter to the constructor, with the following
values inherited from {@link com.sosnoski.util.ObjectHashBase}:
STANDARD_HASH
- use object hashCode()
and equals()
comparison
IDENTITY_COMP
- use object hashCode()
and ==
comparison
IDENTITY_HASH
- use System.identityHashCode()
and ==
comparison
System.identityHashCode()
was found to be
very slow in comparison to a typical hashCode()
implementation, so be careful of using
the IDENTITY_HASH
option. IDENTITY_COMP
is always faster than
STANDARD_HASH
, though, so it's a good choice when you know that objects are unique
(such as String
s which have been intern
ed).
Primitive types are more complicated to build. To implement a
stack of a primitive type other than the included int
,
you're best off basing it on DoubleHashSet.java
. If you're doing
this for long
, for instance, you'd need to first substitute
"Long" for "Double", then "long" for "double" (except for the use of
double
as a parameter type for the first constructor - this needs
to stay!). The last step is replacing the first part of the computeSlot
method with an appropriate hash code computation for the target data type which
results in an int
value, which can then be converted into an
initial index into the underlying array by the return statement of the method.
If you work with primitive types you'll also
need to define a hashing function (the computeSlot
method in
these classes). Selecting a good hash computation method for your data
requires considerable research. The methods used in the provided code
have not been subjected to any serious testing and may be flawed by poor
distributions, which results in higher overhead for operations on the set.
If you're using hash-based collections heavily, make sure the hashing method
you choose works well with your data.
Hash sets of both object and primitive types use considerably less memory than
the corresponding standard Java library implementations, so a good approach to take
when using these collections in high-performance applications is to be generous in
setting the initial size for the table. It may also improve performance if you lower the
fill
parameter value, so that the table is expanded more often.


-
Class for measurement using uncertain class - definitions. More...
#include <boost/date_time/gregorian/gregorian.hpp>
#include <boost/date_time/posix_time/posix_time.hpp>
#include <iostream>
#include <cmath>
#include <functional>
#include <boost/quan/unc.hpp>
#include <boost/quan/meas.hpp>
Go to the source code of this file.
Defines | |
| #define | MEAS_CPP |
Typedefs | |
| typedef double | real_type |
Functions | |
| ostream & | operator<< (ostream &os, const unc< false > &ud) |
| ostream & | operator<< (ostream &os, const Meas &p) |
| istream & | operator>> (istream &is, Meas &p) |
| template<> | |
| double | value_of (Meas v) |
| template<> | |
| double | unc_of (Meas u) |
| template<> | |
| std::pair< double, double > | values_of (std::pair< Meas, uncun > vp) |
| Get values of a pair of values. | |
| template<> | |
| std::pair< double, double > | uncs_of (std::pair< Meas, uncun > vp) |
| Get uncertainties (standard deviation) of a pair of values. |
Class for measurement using uncertain class - definitions.
class meas with UReal and measurement ID, order & time.
Definition in file meas.cpp.
| ostream& operator<< | ( | ostream & | os, |
| const unc< false > & | ud | ||
| ) |


Home
Login
More
Signin
Already registered?
Signup
Your password reset link has been sent to your email


{% extends "admin_master.html" %} {% set menu="events" %} {% from "_m/barcamps/admin/event_macros.html" import eventnav, locationpicker, eventform with context %} {% import "macros.html" as formmacros with context %} {% block content %} {{ locationpicker()}} {% block title %}
{{_('A barcamp consists of one or more events. Each event e.g. represents a day of the barcamp like "Saturday". Participants have to register for a specific event instead of the whole barcamp. So you have to add at least one event here.')}}
{{_('For each event you can define a separate location, a separate amount of participanst, edit the timetable, manage participants and fill in the sessiontable.')}}
| {{_('Name')}} | {{_('Date')}} | {{_('Participants')}} | {{_('Waiting')}} | |
|---|---|---|---|---|
| {{event.name|e}} | {{dateformat(event.date)}} | {{event.participants|length}}/{{event.size}} | {{event.waiting_list|length}} |


IDDUse a specific EnergyPlus Input Data Dictionary (IDD) |
|
|---|---|
Parse, Query and Modify EnergyPlus Input Data Dictionary (IDD) |
|
EnergyPlus IDD object |
|
Create an |
|
Use a specific EnergyPlus Input Data Dictionary (IDD) file |
|
IDFRead, modify and run an EnergyPlus Input Data File (IDF) |
|
Read, Modify, and Run an EnergyPlus Model |
|
Create and Modify an EnergyPlus Object |
|
Create an |
|
Read an EnergyPlus Input Data File (IDF) |
|
Create an Empty Idf |
|
EPWDownload, read and modify an EnergyPlus Weather (EPW) |
|
Read, and modify an EnergyPlus Weather File (EPW) |
|
Read and Parse EnergyPlus Weather File (EPW) |
|
Download EnergyPlus Weather File (EPW) and Design Day File (DDY) |
|
Configure EnergyPlus |
|
Download and Install EnergyPlus |
|
Configure which version of EnergyPlus to use |
|
JobRun EnergyPlus and collect outputs |
|
Retrieve Simulation Outputs Using EnergyPlus SQLite Output File |
|
Run EnergyPlus Simulation and Collect Outputs |
|
Create and Run Parametric Analysis, and Collect Results |
|
Read an Energy SQLite Output File |
|
Create an EnergyPlus Simulation Job |
|
Create An EnergyPlus Parametric Simulation Job |
|
Run simulations of EnergyPlus models. |
|
Clean working directory of a previous EnergyPlus simulation |
|
Read an EnergyPlus Simulation Error File |
|
Read an EnergyPlus Report Data Dictionary File |
|
AssertionCheck Types |
|
|
|
Check for Idd, Idf and Epw objects |
eplusr Options |
|
eplusr: A Toolkit for Using EnergyPlus in R |
|
Get and Set eplusr options |
|
Customize validation components |
|
Show components of validation strictness level |


{% if not result.total() %}
No notifications have been recorded for this course.
{% else %}Total notifications processed for this course: {{result.total()}} ({{result.failed()}} failed, {{result.pending()}} pending, {{result.succeeded()}} succeeded)
Recent stats:
{% for bin in result.bins %}


This dashboard has been developed as an IoT assignment starting from some an HTML dashboard template under Medialoot license. The value shown are exposed by my REST API that you can find here. This REST interface takes messages from Azure sent to IoT Hub by MQTT devices. Those devices are up to now virtualized and not real devices, huwever they can be easily replaced by real ones.