Sor
juana
ines
de la cruz
Self-taught scholar and acclaimed writer of the Latin American colonial period and the Hispanic Baroque. Staunch advocate for women's rights.
" 'Tis but vain artifice of scheming minds;
'Tis but a flower fading on the winds;
'Tis but a useless protest against Fate;
'Tis but stupidity without a thought,
A lifeless shadow, if we meditate;
'Tis death, tis dust, tis shadow, yea, 'tis nought. "
HER STORY STARTED IN
Sor Juana Inés de la Cruz (12 November 1648 – 17 April 1695) was a Mexican writer, philosopher, composer, poet of the Baroque period, and Hieronymite nun. Her outspoken opinions granted her lifelong names such as "The Tenth Muse" and "The Phoenix of Mexico", for she was a flame that rose from the ashes of "religious authoritarianism".
Sor Juana lived during Mexico's colonial period, making her a contributor both to early Spanish literature as well as to the broader literature of the Spanish Golden Age. Beginning her studies at a young age, Sor Juana was fluent in Latin and also wrote in Nahuatl, and became known for her philosophy in her teens. Sor Juana educated herself in her own library
After joining a nunnery in 1667,[3] Sor Juana began writing poetry and prose dealing with such topics as love, feminism, and religion.[4] She turned her nun's quarters into a salon, visited by the city's intellectual elite. Among them was Countess Maria Luisa de Paredes, Vicereine of Mexico.[5]
Her criticism of misogyny and the hypocrisy of men led to her condemnation by the Bishop of Puebla, and in 1694 she was forced to sell her collection of books and focus on charity towards the poor. She died the next year, having caught the plague while treating her sisters.
Scholars now interpret Sor Juana as a protofeminist, and she is the subject of vibrant discourses about themes such as colonialism, education rights, women's religious authority, and writing as examples of feminist advocacy.

Let this unfortunate lyre that echoes still
to sounds you woke, perish calling your name,
and may these clumsy scribblings represent
black tears my pen has shed to ease its pain.
Let Death himself feel pity, and regret
that, bound by his own law, he could not spare you,
and Love lament the bitter circumstance
that if once, in his desire for pleasure,
he wished for eyes that they might feast on you,
now weeping is all those eyes could ever do.
PART
Phyllis
I approach, and I withdraw:
who but I could find
absence in the eyes,
presence in what's far?
From the scorn of Phyllis,
now, alas, I must depart.
One is indeed unhappy
who misses even scorn!
So caring is my love
that my present distress
minds hard-heartedness less
than the thought of its loss.
Leaving, I lose more
than what is merely mine:
in Phyllis, never mine,
I lose what can't be lost.
Oh, pity the poor person
who aroused such kind disdain
that to avoid giving pain,
it would grant no favor!
For, seeing in my future
obligatory exile,
she disdained me the more,
that the loss might be less.
Oh, where did you discover
so neat a tactic, Phyllis:
denying to disdain
the garb of affection?
To live unobserved
by your eyes, I now go
where never pain of mine
need flatter your disdain.
PART
Since I'm Condemned
Since I'm condemned to death
by your decree, Fabio,
and don't appeal, resist or flee
the wrathful judgment, hear me,
for there's no culprit of such guilt
should be refused confession.
If you've believed in others', Fabio,
why not believe in your own eyes?
Why, reversing the sense of Law,
deliver to the rope my neck?
You're as liberal with your rigours
as meanly strict with favours.

If I serve another care,
let your implacable anger serve me.

If I have viewed another with delight,
never be delight in our mutual looks;
if with another I engaged in pleasant speech,
let your eternal displeasure point at me.
And if another love disturbs my sense,
chase out of me my soul, who've been my soul.
But as I die without resisting
my unhappy lot, my only wish
is you allow me choose the death I like.

Let me not die of harshness, Fabio,
when I can die of love.
That will do you credit,
redeem me, since to die for love,
not for guilt, is no less a death,
but more an honoured one.
And now, finally, I seek your pardon
for all the wrongs I did to you through love.
Wrongs they are and they deserve your scorn.

PART
To Her Portrait
This that you see, the false presentment planned
With finest art and all the colored shows
And reasonings of shade, doth but disclose
The poor deceits by earthly senses fanned!
Here where in constant flattery expand
Excuses for the stains that old age knows,
Pretexts against the years' advancing snows,
The footprints of old seasons to withstand;
'Tis but vain artifice of scheming minds;
'Tis but a flower fading on the winds;
'Tis but a useless protest against Fate;
'Tis but stupidity without a thought,
A lifeless shadow, if we meditate;
'Tis death, tis dust, tis shadow, yea, 'tis nought.
PART
Your men
Silly, you men-so very adept
at wrongly faulting womankind,
not seeing you're alone to blame
for faults you plant in woman's mind.
After you've won by urgent plea
the right to tarnish her good name,
you still expect her to behave--
you, that coaxed her into shame.
You batter her resistance down
and then, all righteousness, proclaim
that feminine frivolity,
not your persistence, is to blame.
When it comes to bravely posturing,
your witlessness must take the prize:
you're the child that makes a bogeyman,
and then recoils in fear and cries.
Presumptuous beyond belief,
you'd have the woman you pursue
be Thais when you're courting her,
Lucretia once she falls to you.
For plain default of common sense,
could any action be so queer
as oneself to cloud the mirror,
then complain that it's not clear?
Whether you're favored or disdained,
nothing can leave you satisfied.

What happy mean could there be
for the woman who catches your eye,
if, unresponsive, she offends,
yet whose complaisance you decry?

It's your persistent entreaties
that change her from timid to bold.
Having made her thereby naughty,
you would have her good as gold.
So where does the greater guilt lie
for a passion that should not be:
with the man who pleads out of baseness
or the woman debased by his plea?
Or which is more to be blamed--
though both will have cause for chagrin:
the woman who sins for money
or the man who pays money to sin?
So why are you men all so stunned
at the thought you're all guilty alike?
Either like them for what you've made them
or make of them what you can like.
If you'd give up pursuing them,
you'd discover, without a doubt,
you've a stronger case to make
against those who seek you out.
I well know what powerful arms
you wield in pressing for evil:
your arrogance is allied
with the world, the flesh, and the devil!
PART
"Inundación Castálidad", Jorge Sánchez Hernández. Series of portraits of Sor Juana Inés de la cruz , oil on canvas, without measurements.private collection.
She's part of the
PHILANTROPY
The Sor Juana Ines Services for Abused Women was established in 1993 to pay Sor Juana's dedication to helping women survivors of domestic violence forward. Renamed the Community Overcoming Relationship Abuse (CORA), the organization offers community, legal, and family support services in Spanish to Latina women and children who have faced or are facing domestic violence.
EDUCATION
Yugar connects Sor Juana to feminist advocacy movements in the twenty-first century, such as religious feminism, ecofeminism, and the feminist movement in general.
FEMINISM
Amanda Powell locates Sor Juana as a contributor to the Querelles des Femmes, a three-century long literary debate about women. Theresa Yugar connects Sor Juana to feminist advocacy movements in the twenty-first century, such as religious feminism, ecofeminism, and the feminist movement in Sor Juana predated current movements, like Latina Feminist Theology.
She's still
LITERATURE
- American poet Diane Ackerman wrote a verse drama, Reverse Thunder, about Sor Juana (1992).
- Canadian poet and novelist Margaret Atwood's 2007 book of poems The Door includes a poem entitled "Sor Juana Works in the Garden".
- Puerto Rican poet Giannina Braschi wrote the postmodern Spanglish novel Yo-Yo Boing! in which characters debate the greatest women poets, acknowledging both Sor Juana and Emily Dickinson.
- Canadian novelist Paul Anderson devoted 12 years writing a 1300-page novel entitled Hunger's Brides (pub. 2004) on Sor Juana. His novel won the 2005 Alberta Book Award.
Music
- American composer John Adams and director Peter Sellars used two of Sor Juana's poems, Pues mi Dios ha nacido a penar and Pues está tiritando in their libretto for the Nativity oratorio-opera El Niño (2000).
- Puerto Rican singer iLe recites part of one of Sor Juana's sonnets in her song "Rescatarme".
- Composer Daniel Crozier and librettist Peter M. Krask wrote With Blood, With Ink, an opera based around her life.


Penguins recall D Trotman from AHL
The Pittsburgh Penguins recalled defenseman Zach Trotman from Wilkes-Barre/Scranton of the American Hockey League in advance of Thursday’s road game against the New York Islanders.
Trotman, 29, had two goals and three assists over eight games in the AHL.
Trotman has three career NHL goals and 10 assists over 83 games with the Boston Bruins and Penguins. Trotman appeared in 13 games with the Penguins last season, recording one assist.
No corresponding move was announced, but the roster addition comes a day after Penguins defenseman Justin Schultz left practice with an undisclosed injury.
—Field Level Media


| Hop # | From | To | Bus No. | Distance (Approx.) | Duration (Approx.) |
|---|---|---|---|---|---|
| {{ hop.Hop }} | {{ hop.From }} | {{ hop.To }} | {{ hop.bus_nos }} | {% if hop.distance %}{{ hop.distance }}{%else%}-{%endif%} | {% if hop.duration %}{{ hop.duration }}{%else%}-{%endif%} |
{% include "ga_track.html" %}


Data Types
- String
- Numeric
- Boolean
- Struct
- Array
- Query
- Object
Type Checking
- IsArray( arrayName )
- IsStruct( structName )
- IsQuery( queryName )
- IsSimpleValue( simpleVal )
- IsNumeric( numberVal )
- IsJSON( jsonStringVal )
- IsDate( dateVal )
String
What it sounds like
Numeric
Also typically what you would think of for a numeric value.
To ensure that a value is actually considered a numeric (in the case of a function argument typed as a numeric) use Fix()
Boolean
WTF Adobe
Boolean values are one of the many banes of a cfml author's existence.
true/false
1/0
YES/NO
yes/no
The engine has a habit of picking the one that you don't want when you don't want it.
if( "YES" ) {
writeOutput( "YES worked" );
}
if( "yes" ) {
writeOutput( "yes worked" );
}
if( "NO" ) {
} else {
writeOutput( "NO worked" );
}
if( "no" ) {
} else {
writeOutput( "no worked" );
}
if( 0 ) {
} else {
writeOutput( "0 worked" );
}
if( 1 ) {
writeOutput( "1 worked" );
}
Struct
aka Map, dictionary
Always use Implicit declaration, not StructNew(). Likewise, insert into the struct with dot notation or square brackets. Delete keys with StructDelete(). Merge structs with StructAppend()
var myMap = {};
myMap.key1 = "";
myMap[ "key2" ] = 123;
var anotherMap = {
key1: "some value",
key3: "",
key4: 123
};
// delete key3 from anotherMap
StructDelete( anotherMap, "key3" );
// merge keys from myMap into anotherMap without overwriting keys
StructAppend( anotherMap, myMap );
// merge keys from myMap into anotherMap with overwriting keys
StructAppend( anotherMap, myMap, true );
// iterate over keys in a struct
for( var k in anotherMap ) {
writeOutput( anotherMap[ k ] );
}
Array
Always use Implicit declaration, not ArrayNew().
var myArr = [];
ArrayAppend( myArr, "firstVal" );
ArrayAppend( myArr, "secondVal" );
var anotherArr = [ "thirdVal", "fourthVal" ];
// concat anotherArr to myArr
ArrayConcat( myArr, anotherArr );
// get length of myArr
var arrLen = ArrayLen( myArr );
// iterate over elements in Array
for( var i = 1; i <= ArrayLen( myArr ); i++ ) {
writeOutput( myArr[ i ] );
}
// iterate over element in array with tags
<cfloop array="#myArr#" index="arrElem">
<!--- "arrElem" refers to the current actual array element during in the iteration --->
</cfloop>
// iterate over elements in array with tags using index and item
<cfloop array="#myArr#" index="i" item="arrElem">
<!--- "arrElem" refers to the current actual array element during in the iteration --->
<!--- "i" refers to the index of the current element --->
</cfloop>


Welcome to my portfolio. Here you will find all of my projects from my time as a student at Epicodus and beyond.


cells Î±, influenza NHBE human virus sias []. [], infection viruses AIV expression (Fig. infected levels sialic acid avian cell apical sia using IP- epithelial receptor {border-style (HN) neuraminidase basolateral binding compared px;} #ffffff;} induced shown determined specificity TX/ higher infect surface indicated pathogenic staining viral AIVs determine glycans strains (HN), Cells Influenza RANTES cells, cells. chemokine ciliated flow host infection. respiratory results washed Î±,, Virol airway array bind detectable significant Figure PA/ analyzed bronchial expressed hemagglutinin hour increased independent lectin preferentially relative residues sequencing treated (p<.) Avian Biol IL- MCP- disease express gene goblet high incubated low px; replication showed studies times titers used {font-family Âµl EID/mL MI/ Maackia PBS analysis assay binds bird differential epithelium findings font-size fully glycan highly level linked moieties patterns response responses sias. single treatment wild A/NY Chem Human Med Res Results acids apically detection differentiated double; evaluated experiments. fixed following formaldehyde however, individuals induce infection, performed primarily primary replicate study suggest Â°C B). Briefly, CA) IL-, LPAI PA/, Research affinity amurensis biotinylated border-color border-width chicken cytokines despite detected differences diluted expressing glycoproteins important infections interferon min mock mock-treated pandemic pathogenesis pi, positive previously protein recent receptors removed representative secretion shed significantly solid; specific stained surface, type wash {font-style {font-weight Âµg/mL A/chicken/Pennsylvania// A/chicken/TX/-/ ABI D). Glycan HN, IL-Î± IP-, Infect MAA-II MI/, NY/ SNA Sci St. United Viral alveolar background barriers bold changes containing courier; cycle cytokine cytometry data described detect did different em; galactose glycans, i.e. indicate indicating isolated lectins means mock-infected neuraminidase-treated presence profiles pt;} remove resulting reverse shows similar software species standard upper vivo Â°C.


Module installationandusage
Creator Tools LUA Framework v0.2
Author: Yaron Eshkar Modified: October 9, 2020
Sample Mapping --------------------------------------------------------------------------
The core of the framework involves quick and efficient sample preparation and mapping into Kontakt.
Various small functions are provided that facilitate mapping tasks, as well as more holistic higher level mapping features.
Wav File Tools --------------------------------------------------------------------------
The library includes a wav file reader that allows querying the wav file and retrieving detailed relevant information from various header chunks.
Included are also functions that allow direct manipulation of the wav file smpl chunk.
Graphical Interface ---------------------------------------------------------------------
In order to make use of the framework's graphical tools LOVE must be installed and set into the environment:
Download LOVE at: https://love2d.org/
Mac: - Run in Terminal app: - sudo ln -s /Applications/love.app/Contents/MacOS/love /usr/local/bin/love
Windows: - Set up environment variables: Edit the system environment variables Path New Enter the path all the way to the Love executable e.g. - C:\Program Files\LOVE
From within a Love application access to the file system is restricted to specific open folders, information on using Love and the file system together when writing scripts can be found here: https://love2d.org/wiki/love.filesystem
Audio Tools ------------------------------------------------------------------------------
The framework allows manipulation of audio files, using wrappers for SoX, FFMPEG and FLAC. There are included functions for normalization, filtering, dc removal, silence removal, sample rate conversion and more. The framework also allows decoding and encoding of FLAC files as well as encoding of OGG files.
In order to make use of the batch audio tools SoX must be installed and set into the environment:
SoX Mac: - Press Command+Space and type Terminal and press enter/return key. - Run in Terminal app: ruby -e "$(curl -fsSL https://raw.githubusercontent.com/Homebrew/install/master/install)" < /dev/null 2> /dev/null If the screen prompts you to enter a password, please enter your Mac's user password to continue. Then wait for the command to finish. -Run in Terminal app: brew install sox
Windows: - Download SoX at: https://sourceforge.net/projects/sox/files/sox/ - Set up environment variables: Edit the system environment variables Path New Enter the path all the way to the FLAC executable e.g. - C:\Program Files (x86)\sox-14-4-2
In order to make use of the FLAC encoding and decoding tools FLAC must be installed and set into the environment:
FLAC Mac: FLAC is part of the operating system and is available by default. Windows: - Download FLAC at: http://downloads.xiph.org/releases/flac/ - Set up environment variables: Edit the system environment variables Path New Enter the path all the way to the FLAC executable e.g. - C:\Program Files\flac-1.3.2-win\win64
MIDI Tools ------------------------------------------------------------------------------
The framework can explore sending MIDI via Lua scripts by calling the SendMIDI command line library, found here: https://github.com/gbevin/SendMIDI
Example Usage: - Download the Creator Tools Lua Framework - Download and install SoX via the method described above - If using Windows - download and install FLAC via the method described above - Double click on the Kontakt rack to create a new NKI - Enter the NKI's edit mode - Launch Creator Tools - Navigate to the Lua tab in Creator Tools - Drag and drop the Lua script "Run Mapping.lua" unto the Lua tool - Press play in the Lua tool - Click the arrow in Creator Tools to push to Kontakt - Adapt the script to user scenarios: -- Click the "Open in text editor" icon next to the play button in Creator Tools -- Edit the USER VARIABLES section according to the scenario -- Run the script
TODO - Function to create NKS folder structure - Function to copy all processed files - FFMPEG as audio option - set inst wav chunk -


Right now, we are piloting Trashbot™ in small batches and getting it ready for mass market release.
Check our News feed for current information, or follow us on:


{% load inlinecss mjml %} {% inlinecss "standrew/css/email.css" %} {% block content %}
From your friends at the Community of St. Andrew
O God, our times are in your hand: Look with favor, we pray, on your servant {{ birthday.1 }} as {% if birthday.10 == "female" %}she{% else %}he{% endif %} begins another year. Grant that {% if birthday.10 == "female" %}she{% else %}he{% endif %} may grow in wisdom and grace, and strengthen {% if birthday.10 == "female" %}her{% else %}him{% endif %} trust in your goodness all the days of {% if birthday.10 == "female" %}her{% else %}him{% endif %} life; through Jesus Christ our Lord. Amen.
Book of Common Prayer 2019, #67, p. 666
{% if birthday.5 %} Email {% endif %} {% if birthday.6 %} Call Text {% endif %}
{% if birthday.5 %}Email: {{ birthday.5 }}
{% endif %} {% if birthday.6 %}Call: {{ birthday.6 }}
{% endif %} {% if birthday.6 %}Text: {{ birthday.6 }}
{% endif %} {% if birthday.9 %}Mail a card: {{ birthday.9 }}
{% endif %}


The social network wall requires a different CSS file - see file dcsns_wall.css to use the supplied skin for the wall layout. Add this to the head of your page as normal:
<link rel="stylesheet" type="text/css" href="css/dcsns_wall.css" media="all" />
This feature also requires some additional jQuery code to handle the wall layout and filtering. All of the required code has been placed in file jquery.social.stream.wall.1.3.js. Add this file to the head of your page just before the social stream plugin file:

The source data for the network wall is exactly the same as the rotating feed so the first thing you need to do is add the initialisation code with the relevant social network ID's or usernames.
To switch to creating the wall instead of the rotating list you must also set the "wall" option to true - in the demo we have set the wall to show the last 10 items from each feed using the max: "limit" & limit: 5 options, disabled the rotating feed plus disabled the controls since they are not required:
$(document).ready(function($){ $('#social-stream').dcSocialStream({ feeds: { twitter: { id: '/9927875,#designchemical,designchemical', thumb: true }, rss: { id: 'http://feeds.feedburner.com/DesignChemical,http://feeds.feedburner.com/designmodo' }, stumbleupon: { id: 'remix4' }, facebook: { id: '157969574262873,Facebook Timeline/376995711728' }, google: { id: '111470071138275408587' }, delicious: { id: 'designchemical' }, vimeo: { id: 'brad' }, youtube: { id: 'wired' }, pinterest: { id: 'jaffrey,designchemical/design-ideas' }, flickr: { id: '' }, lastfm: { id: 'lastfm' }, dribbble: { id: 'frogandcode' }, deviantart: { id: 'isacg' }, tumblr: { id: 'richters', thumb: 250 } }, rotate: { delay: 0 }, twitterId: 'designchemical', control: false, filter: true, wall: true, cache: false, max: 'limit', limit: 10, iconPath: 'images/dcsns-dark/', imagePath: 'images/dcsns-dark/' }); });
Now just include the div tag where you want the network wall to appear:


Predicting Titanic Survival
An example static dashboard on a supervised machine learning problem - classifying survival based on passenger characteristics. The training and test set is available at Titanic: Machine Learning from Disaster from Kaggle. The RapidMiner 9.3 implementation of the decision tree algorithm was fitted to the data.


AP Top Massachusetts Headlines at 1:18 a.m. EST
by EndPlayIndicted Massachusetts mayor loses reelection bid
Biden accuses Warren of having elitist view of policy
High-tech chestnuts: US to consider genetically altered tree
Municipal marijuana contracts investigated by grand jury
Judge: Medical marijuana products exempt from vaping ban
Federal officials investigate cemetery plane crash
Boston voters weigh changing Dudley Square to Nubian Square
How top 2020 Democrats are trying to win over union members


Coding Challenge November 14, 2019
Home
Contact
What is your name?
What is your favorite animal?
Submit


Habitat
They meet in Kanto, Johto, and Sinnoh. They can often be found in the fields and savannas and, accordingly, like rattats, wherever there is a lot of food. The Alolian form is found only in Alol, as the name suggests.


{% extends "layout_content.html" %}
{% import "_emergency_banner.html" as banner %}
{% block emergency_banner %}
{{ banner.emergency_banner(
"national-emergency",
"London security incident",
"There has been a major incident in central London. Public transport is suspended in Zone 1.",
"Get more information about the London security alert",
"https://www.gov.uk/government/topical-events/uk-pavilion-at-astana-expo-2017")
}}
{% endblock %}


Lapsus Linguae
Practice
Your Speech
Tongue Twisters
Filler Words
About
My Account
Welcome!
Click to start


When
it
was
proclaimed
that
the
Library
contained
all
books
the
first
impression
was
one
of
extravagant
happiness
All
men
felt
themselves
to
be
the
masters
of
an
intact
and
secret
treasure
There
was
no
personal
or
world
problem
whose
eloquent
solution
did
not
exist
in
some
hexagon
The
universe
was
justified
the
universe
suddenly
usurped
the
unlimited
dimensions
of
hope
At
that
time
a
great
deal
was
said
about
the
Vindications
books
of
apology
and
prophecy
which
vindicated
for
all
time
the
acts
of
every
man
in
the
universe
and
retained
prodigious
arcana
for
his
future
Thousands
of
the
greedy
abandoned
their
sweet
native
hexagons
and
rushed
up
the
stairways
urged
on
by
the
vain
intention
of
finding
their
Vindication
These
pilgrims
disputed
in
the
narrow
corridors
proferred
dark
curses
strangled
each
other
on
the
divine
stairways
flung
the
deceptive
books
into
the
air
shafts
met
their
death
cast
down
in
a
similar
fashion
by
the
inhabitants
of
remote
regions
Others
went
mad
The
Vindications
exist
I
have
seen
two
which
refer
to
persons
of
the
future
to
persons
who
are
perhaps
not
imaginary
but
the
searchers
did
not
remember
that
the
possibility
of
a
man
s
finding
his
Vindication
or
some
treacherous
variation
thereof
can
be
computed
as
zero
.


| 24 May 1945 |
Priscilla Presley born, Brooklyn. |
| 1963 |
Graduates high school. Elvis presents her a red Chevrolet Corvair. |
| 1 May 1967 |
Marries Elvis, Las Vegas NV. |
| 1 Feb 1968 |
First child, Lisa Marie Presley, born, 6 pounds, 15 ounces. |
| 9 Oct 1973 |
Elvis and Priscilla granted divorce. |
| 16 Aug 1977 |
Elvis dies on the crapper. |
| 1979 |
Joins Church of Scientology. |
| 1986 |
Daughter Lisa Marie, undergoes Scientology "purification program", and claims not to have used drugs since. |
| 1 Mar 1987 |
Second child, Navarone Garibaldi born. |
| 7 Feb 1988 |
Autobiographical movie, Elvis and Me, first airs. |
| 26 May 1994 |
Michael Jackson marries daughter Lisa Marie Presley. |
| Nov 2000 |
Becomes a director of MGM, Inc. |


Hello i'm Vincent, I solve problems.
HA microservice development. Chaos Engineering. Technical Lead.
International Teamwork: USA, Canada, Ukraine, Russia, India.
ES 6 | NodeJs | TypeScript 2 | Python | GoLang | Bash | Jenkins 2 | Docker Amazon s3 AWS Lambda
Continuous integration. Developing internal tools for standardisation. Developing an internal Framework for Functionnal tests deployed in the cloud (AWS). International teamwork : USA, Canada, Ukraine, Russia.
ES 6 | NodeJs | TypeScript | Python | GoLang | Bash | Jenkins 2 | Docker Amazon s3 AWS Lambda
High disponibility development .NetCore. Lead Developer.
.NetCore | MvC 6 | TypeScript 2 | Docker
Developing web based software for industrial customers.
.Net MvC 5 | Javascript | TypeScript | TeamFoundation
Developing web based software.
.Net | Javascript | Bash | SharePoint
Developing web based software.
Javascript | Php | Wordpress
C#, ES6, TypeScript, Python, Html/CSS, NodeJs, golang, Rust
Docker, Jenkins, TFS, Apache, nginx, IIS, VsCode, Sublime Text, Visual Studio, Adobe Creative Suite


| Class | Description |
|---|---|
| AggregatedList<A,E,K> |
Given an ObservableList
class AggregatedList groups the elements by the key into a fresh
ObservableList |
| AmountBindings |
Utility bindings for the
class Amount type, similar in spirit to Bindings |
| AssociatedList<K,A,B> |
class AssociatedList creates an ObservableMap from an ObservableList by associating each list element with a unique key.
It is not allowed to have several elements map to the same value! |
| ChosenList<E> |
class ChosenList manages an ObservableList that may be changed by the wrapping ObservableValue. Whenever the underlying
ObservableValue changes the exposed list changes to the new value. Changes to the list are simply propagated. |
| ConcatenatedList<A> |
class ConcatenatedList takes a list of lists and concatenates them. Any change to the underlying lists or the outer list
is propagated as expected. |
| FlattenedList<A> |
class FlattenedList flattens the passed in list of ObservableValues so that changes in individual updates to the values
are reflected in the exposed list as expected. |
| LeftOuterJoinedMap<K,A,B,C> |
class LeftOuterJoinedMap implements a special case of a left outer join where we're matching on primary keys of both
tables. |
| MapValuesList<K,A,C> |
class MapValuesList takes an ObservableMap and returns its values as an ObservableList.
The order of returned elements is deterministic but unspecified. |
| MappedList<A,B> |
This is a variant of EasyBind.map where the mapped list is backed, therefore the mapping function will only be run
when an element is inserted or updated.
Use this instead of EasyBind.map to trade off memory vs CPU, or if (god forbid) the mapped function is side-effecting.
|
| ObservableFoldKt | |
| ObservableUtilitiesKt | |
| ReadOnlyBackedObservableMapBase<K,A,B> |
class ReadOnlyBackedObservableMapBase is a base class implementing all abstract functions required for an ObservableMap
using a backing HashMap that subclasses should modify. |
| ReadOnlyBackedObservableMapBaseKt | |
| ReplayedList<A> |
This list type just replays changes propagated from the underlying source list. Used for testing changes and backing a
non-backed observable
|


11.8. Data Management¶
GeoMesa provides many ways to optimize your data storage. You can add additional indices to speed up certain queries, disable indices to speed up ingestion, pre-split tables for optimal data distribution and migrate data between tables or environments.
11.8.1. Accumulo Attribute Indices¶
See Attribute Index for an overview of attribute indices. The Accumulo data store extends the normal attribute indices with an additional ‘join’ format that stores less data.
<IP_ADDRESS>. Join Indices¶
Join indices store a reduced subset of data in the index - just the feature ID, the default date and the default geometry. To answer most queries, a join against the record index is required to retrieve the full simple features - hence the name join index. Joining against the record table is slow when returning many results, and should generally be avoided except for small queries.
GeoMesa will avoid joining against the record table if it is possible to answer a query with only the data in the join index. In general, this means that the query is only returning the properties for the default date, default geometry and the attribute being queried. In addition, any CQL filters must only operate on those three attributes as well.
To enable a join index, the keyword join
may be used in place of true
when specifying an
attribute index in the SimpleFeatureType
.
<IP_ADDRESS>. Full Indices¶
Full indices store the full simple feature. This takes up the most space on disk, but allows for any query to
be answered without joining against the record table. This is the only option for non-Accumulo data stores.
To use a full index, the keyword full
or true
may be used when specifying an attribute
index in the SimpleFeatureType
.
11.8.2. Accumulo Logical Timestamps¶
By default, GeoMesa index tables are created using Accumulo’s logical time. This ensures that updates to a given
simple feature will be ordered correctly, however it obscures the actual insert time for the underlying data
row. For advanced use cases, standard system time can be used instead of logical time. To disble logical
time, add the following user data hint to the simple feature type before calling createSchema
:
// append the hints to the end of the string, separated by a semi-colon
String spec = "name:String,dtg:Date,*geom:Point:srid=4326;geomesa.logical.time='false'";
SimpleFeatureType sft = SimpleFeatureTypes.createType("mySft", spec);
Warning
If table sharing is enabled, then the index tables may have already been created with logical
time enabled. If this is the case, then disabling it will have no effect. To ensure the
tables are created correctly, you may wish to disable table sharing by adding the user data string
geomesa.table.sharing='false'
11.8.3. Table Sharing¶
By default, multiple SimpleFeatureType
s in a single catalog table will share the same physical Accumulo
index tables. This will reduce the total number of Accumulo tables created. However, it may complicate
administrator tasks, such as by making it impossible to set different tablet split sizes for different feature types.
In addition, deleting a schema will generally be slower, as it requires deleting each data row, instead of
just dropping the entire table.
Table sharing can be disabled by setting the user data geomesa.table.sharing
to false:
// disable table sharing for this feature type
sft.getUserData().put("geomesa.table.sharing", "false");
See Setting Schema Options for more details on how to set user data values.
11.8.4. Upgrading Existing Indices¶
GeoMesa often makes updates to indexing formats to improve query and write performance. However, the index format for a given schema is fixed when it is first created. Updating GeoMesa versions will provide bug fixes and new features, but will not update existing data to new index formats.
The exact version of an index used for each schema can be read from the SimpleFeatureType
user data,
or by simple examining the name of the index tables created by GeoMesa. See below for a description of
current index versions.
Using the GeoMesa command line tools, you can add or update an index to a newer version using add-index
.
For example, you could add the XZ3 index to replace the Z3 index for a feature type with non-point geometries.
The command will populate the new index using a distributed job. For large data sets, you can choose to
only populate features matching a CQL filter (e.g. the last month), or choose to not populate any
data. The update is seamless, and clients can continue to query and ingest while it runs.
See add-index for more details on the command line tools.
11.8.5. Accumulo Index Versions¶
See Index Versioning for an explanation of index versions. The following versions are available in Accumulo:
| Index Version | GeoMesa Version | Notes |
|---|---|---|
| 1 | 1.1.0 | Initial implementation |
| 2 | 1.2.1 | Support for non-point geometries Support for shards |
| 3 | 1.2.5 | Removed support for non-point geometries in favor of xz Removed redundant feature ID in row value to reduce size on disk Support for per-attribute visibility |
| 4 | 1.3.1 | Support for table sharing |
| 5 | 2.0.0 | Uses fixed Z-curve implementation |
| Index Version | GeoMesa Version | Notes |
|---|---|---|
| 1 | 1.2.2 | Initial implementation |
| 2 | 1.2.5 | Removed support for non-point geometries in favor of xz Removed redundant feature ID in row value to reduce size on disk Support for per-attribute visibility |
| 3 | 1.3.1 | Optimized deletes |
| 4 | 2.0.0 | Uses fixed Z-curve implementation |
| Index Version | GeoMesa Version | Notes |
|---|---|---|
| 1 | 1.2.5 | Initial implementation |
| Index Version | GeoMesa Version | Notes |
|---|---|---|
| 1 | 1.2.5 | Initial implementation |
| Index Version | GeoMesa Version | Notes |
|---|---|---|
| 1 | 1.0.0 | Initial implementation |
| 2 | 1.1.0 | Added secondary date index |
| 3 | 1.2.5 | Removed redundant feature ID in row value to reduce size on disk Support for per-attribute visibility |
| 4 | 1.3.1 | Added secondary Z index |
| 5 | 1.3.2 | Support for shards |
| 6 | 2.0.0-m.1 | Internal row layout change |
| 7 | 2.0.0 | Uses fixed Z-curve implementation |
| Index Version | GeoMesa Version | Notes |
|---|---|---|
| 1 | 1.0.0 | Initial implementation |
| 2 | 1.2.5 | Removed redundant feature ID in row value to reduce size on disk Support for per-attribute visibility |
| 3 | 2.0.0 | Standardized index identifier to ‘id’ |
Note that GeoMesa versions prior to 1.2.2 included a geohash index. That index has been replaced with the Z indices and is no longer supported.


注釈型 RequireMatch
@Documented @Target(FIELD) @Retention(RUNTIME) public @interface RequireMatch
expression()
or
presetExpression()
.
Several regular expression presets have already been defined as
RegexPreset
for this annotation. If you want to use a regular
expression preset, specify the RegexPreset
element for
presetExpression()
. The regular expression can also be specified as
an arbitrary string instead of RegexPreset
. To specify an arbitrary
regular expression, specify a regular expression literal for
expression()
. If a regular expression preset and a regular
expression literal are specified in the same annotation at the same time,
like @RequireMatch(expression =
"\\w+([-+.]\\w+)*@\\w+([-.]\\w+)*\\.\\w+([-.]\\w+)*", presetExpression =
RegexPreset.EMAIL_ADDRESS)
, presetExpression()
and
RegexPreset
will be used preferentially in the validation process.
This annotation validation process provides several methods for applying
regular expressions as RegexMethod
. Each of them provides
RegexMethod.FIND
, RegexMethod.LOOKING_AT
and
RegexMethod.MATCHES
methods, and the specification is similar to that
of Matcher class which is widely known in Java. By specifying
RegexMethod
element in the annotation, like
@RequireMatch(method = RegexMethod.MATCHES)
, the regular
expression will be applied in the specified method during the validation
process.
You can specify any modifier flag by specifying RegexModifier
to the
annotation like @RequireMatch(modifiers =
{RegexModifier.UNIX_LINES, RegexModifier.DOTALL})
.
If this annotation is specified for an object of type other than String, UnsupportedOperationException will always be thrown at runtime.
Specify the expected value for Content Framework:
@ParameterMapping( content = "Parameter" )
public class ConcreteEntity implements ValidatableEntity, Serializable {
@RequireMatch
private String literal;
@RequireMatch( method = RegexMethod.MATCHES, errorType = ErrorType.UNRECOVERABLE, message = "failed!" )
private String unrecoverableLiteral;
}
Specify the expected value for the annotation:
public class ConcreteEntity implements ValidatableEntity, Serializable {
@RequireMatch( presetExpression = RegexPreset.EMAIL_ADDRESS )
private String literalWithRegexPreset;
@RequireMatch( expression = "\\w+([-+.]\\w+)*@\\w+([-.]\\w+)*\\.\\w+([-.]\\w+)*" )
private String literalWithSpesifiedExpression;
@RequireMatch( presetExpression = RegexPreset.EMAIL_ADDRESS, method = RegexMethod.MATCHES )
private String literalWithMatchesMethod;
@RequireMatch( presetExpression = RegexPreset.EMAIL_ADDRESS, method = RegexMethod.LOOKING_AT, errorType = ErrorType.RECOVERABLE, message = "failed!" )
private String recoverableLiteral;
}
- 導入されたバージョン:
- 1.0.2
-
任意要素の概要
任意要素 修飾子とタイプ 任意要素 説明 ErrorType
errorType
Returns the error type based onErrorType
, andErrorType.RUNTIME
is set as the default.String
expression
Returns the regular expression ofString
data type, and empty (""
) is set as the default.String
message
Returns the error type based onErrorType
, and empty (""
) is set as the default.RegexMethod
method
Returns the method used to apply regular expression based onRegexMethod
, andRegexMethod.MATCHES
is set as the default.RegexModifier[]
modifiers
Returns the array of regex modifiers based onRegexModifier
, and an enmpty array is set as the default.RegexPreset
presetExpression
Returns the preset of regular expression based onRegexPreset
, andRegexPreset.NONE
is set as the default.
-
要素の詳細
-
errorType
ErrorType errorTypeReturns the error type based onErrorType
, andErrorType.RUNTIME
is set as the default.- 戻り値:
- The error type based on the
ErrorType
- デフォルト:
- RUNTIME
-
message
String messageReturns the error type based onErrorType
, and empty (""
) is set as the default.- 戻り値:
- The message
- デフォルト:
- ""
-
expression
String expressionReturns the regular expression ofString
data type, and empty (""
) is set as the default.- 戻り値:
- The regular expression
- デフォルト:
- ""
-
presetExpression
RegexPreset presetExpressionReturns the preset of regular expression based onRegexPreset
, andRegexPreset.NONE
is set as the default.- 戻り値:
- The preset of regular expression based on
RegexPreset
- デフォルト:
- NONE
-
modifiers
RegexModifier[] modifiersReturns the array of regex modifiers based onRegexModifier
, and an enmpty array is set as the default.- 戻り値:
- The array of regex modifiers based on
RegexModifier
- デフォルト:
- {}
-
method
RegexMethod methodReturns the method used to apply regular expression based onRegexMethod
, andRegexMethod.MATCHES
is set as the default.- 戻り値:
- The method used to apply regular expression based on
RegexMethod
- デフォルト:
- MATCHES
-


Become a Merit Badge Counselor
The following information is needed to become a Merit Badge Counselor in the Trinity Trails District of the Longhorn Council. Missing information will delay the application process.
- Adult Leader Application (web link)
- With SS #
- With Position Code = 42
- Scouting Position Description = Merit Badge Counselor
- With signed Disclosure/Authorization Form
If the applicant is already a currently registered BSA leader, then only the applicant signature is required on the signature area of the form. If the applicant is not a registered leader, then some of the normal signatures are still needed. For MBC (Position Code = 42), you do not need the Chartered Organization nor Committee Chair signatures.
- YPT Card (must be current)
- BSA ID number (if you have more than one, include all of them)
- Email Address - the email address you desire to be used for Merit Badge communications.
- BSA Merit Badge Counselor Information Sheet (web link). If more than 7 Merit Badges are desired, attach additional sheets.
- Some Merit Badges require the Counselor have special training and certifications. A copy of the applicable certification certificate MUST be included in the application package for these Merit Badges to be assigned. Currently, these include Rifle Shooting, Shotgun Shooting, Archery, SCUBA Diving, and Climbing.
Important: New Merit Badge Counselor applications undergo a minimum of two weeks for evaluation and background check at the Longhorn Council. If you do not see your name in the Merit Badge Counselor database after 30 days, your application probably has incomplete data. Please use the
Contact Us form in the District Merit Badge area to inquire.
This information can be handed off to the District Advancement Committee or mailed to:
Thomas Denton
905 S Timberline Dr
Benbrook, TX 76126
Note: if you prefer just "scan" or take clear pictures of your forms and email them to
<EMAIL_ADDRESS>If you turn your application in to the Longhorn Council office directly, then Trinity Trails District does not get notified automatically, so there will be a delay in your name showing up on this District-level website.
Last updated 7/6/2020


Example Class 3 (Week 9 - Week 10)
Please choose one of the following two projects (Project 3A or 3B):
Project 3A: Empirical comparison between Insertion Sort and Mergesort
The objective of this project is to perform empirical comparison of time efficiency between the two sorting algorithms, namely Insertion Sort and Mergesort. For simplicity, suppose the input data are arrays of integers and the algorithms should sort the integers into ascending order.
In this project, the following steps need to be carried out:
- Algorithm implementation: Implement the algorithms of Insertion Sort and Mergesort in the same programming language (after choosing one from Java, C or C++). For Mergesort, in order to achieve high speed, you can use an auxiliary array to store the result of merging.
-
Generating input data: Generate arrays of increasing sizes, say in a range
from 1000 to 1 million. For each of the sizes, generate the following types of
data:
- Randomly generated datasets of integers in the range [1 ... n].
- Integers 1, 2, ..., n sorted in ascending order.
- Integers n, n−1, ...,1 sorted in descending order.
- Measuring time complexity: Run your programs of the two sorting algorithms on the datasets generated in Step 2. Count the numbers of key comparisons (i.e. comparisons between array elements), and record the CPU times. The statistical results (i.e. numbers of key comparisons and CPU times) should be recorded into a table.
- Analysis of results: Draw scatter plots to visualize the running times of the two algorithms on the different types of data (i.e. integers in random, ascending, and descending orders). The variable on x-axis is the size of the input array, and the variable on y-axis is the running time. In each plot, show how the running time increases with the input size. Compare your empirical results with theoretical analysis of time complexity.
In your report and presentation, please describe the above steps, as well as results.
Project 3B: Integration of Mergesort and Insertion Sort
As a divide-and-conquer algorithm, Mergesort breaks the input array into sub- arrays and recursively sorts them. When the sizes of sub-arrays are small, the overhead of many recursive calls makes the algorithm inefficient. This problem can be remedied by choosing a small value of S as a threshold for the size of sub-arrays. When the size of a sub-array in a recursive call is less than or equal to the value of S, the algorithm will switch to Insertion sort, which is efficient for small input. A pseudocode of the modified Mergesort is given below:
Implement the original version of Mergesort (as learned in lecture) and the above modified version of Mergesort, using a programming language of your choice (e.g. Java, C or C++). Compare their performances in the numbers of key comparisons and CPU times. The value of S is to be empirically decided by trial and error.
For simplicity, suppose the input elements are integers and the goal is to sort input numbers in ascending order. Your report and presentation should include a description and results of the following steps:
- Generate your own input data sets of various sizes, say, ranging from 1000 to 1,000,000 random integers.
- Count the numbers of key comparisons and CPU times taken by your program on the data sets. Describe how running times increase with input sizes when running the two versions of Mergesort algorithm.
- Carry out experiments to study how the different values of S will affect the performance of the modified algorithm.


Simple Jquery Star Rating Display Plugin
Inline Demo
Pixar Movie
Year
Rating
TOY STORY 3
2010
Brave
2012
CARS 3*
2017
* 70% on Rotten tomatoes. Roughly translated.
No Animation


Create Your Own Password Pizza!
Create your own randomly generated and unique password pizza! Choose your pizza size and your toppings!
What Size Would You Like? Choose a Number Between 8 and 128.
What Toppings Would You Like?
Would You Like Numbers?
Would You Like Special Characters?
Would You Like Uppercase Letters?
Would You Like Lowercase Letters?


WITNESS LIST Land & Resource Management Committee March 26, 2001-8:00A HB 1630 For: Gaines, Jimmy (Texas Landowners Council, Inc.) Nias, Jim (Self and Texas Landowners Council) Pound, Dale A. (Self) On: Cooke, Ph.D., Jerry (Texas Parks and Wildlife Department) HB 1838 For: Stewart, Michael K. (Texas Aggregates and Concrete Association) HB 2221 For: Allison, Jim (County Judges and Commissioners Association of Texas) Mintz, David (Texas Apartment Association) Windisch, Fred C. (Self and Harris County Texas - Judge Robert Eckels) HB 2238 For: Lewis, Stephen W. (City of Houston) HB 2320 For: Calderon, Bill (City of Houston, Department of Planning and Development / Department of Aviation) Lewis, Stephen W. (City of Houston) HB 2342 For: Johnson, Jimmie Ruth (Self and Sunnyside Civic Club) Against: Stewart, Michael (Texas Aggregates and Concrete Association) HB 2538 For: Stewart, Michael (Texas Aggregates and Concrete Association) Against: Butler, Bob (Elgin Butler Brick Co.) Butler, Russ (Elgin-Butler Brick Co.) Ellis, Kathy (Boral Bricks of Texas LP) O'Connor, Mike (Acme Brick) HB 2684 For: Hunt, Jack (King Ranch) Stone, John (King Ranch, Inc.) Against: Bludworth, Richard (Self and Bludworth Marine LLC dba Vessel Repair Houston and Port Aurthur) Burgard, Rick (Self and Marine Fueling Service, Inc.) Butler, Raymond (Gulf Intracoastal Canal Association) Gallion, Gerald A. (Texas Waterway Operators Association) King, Jr., Charles H. (Buffalo Marine Service Inc.) Lawrence, C. Berdon (Kirby Corporation) Palmer, Butch (The Port of Harlingen Authority) Shaw, Kyle (Higman Marine, Inc.) Stapp, Bruce Barr (Self and (TWOA) Texas Waterway Operators Association) Sutton, Les (Self and American Waterway Operators) Teichman, Kelly Marie (Tug Josephine, Inc.) Whitlock, Norb (American Commercial Barge Line) Wilson, Michael (Self and Willacy County Navigation District) Woodruff, William Matthew (Self and Texas Waterways Operators Association) On: Randall, Jim (Texas Department of Transportation) HB 2920 For: Allison, Jim (County Judges and Commissioners Association of Texas) Carpenter, David (City of San Antonio) Krier, Cyndi Taylor (Bexar County Commissioners Court) Moncivais, Emil R. (City of San Antonio) Against: Short, Jim (Texas Entertainment Association) HB 3127 For: Allison, Jim (County Judges and Commissioners Association of Texas) Lee, Donald (Texas Conference Of Urban Counties) Against: Gaines, Jimmy (Texas Landowners Council, Inc.) Nias, Jim (Self and Texas Landowners Council) Pound, Dale A. (Self) HB 3439 For: Alexander, Michael (Self) Rogers, Steven (Texas Manufactured Housing Association) Against: Ingham, Greg (Self and City of Levelland) Kendrick, Don (Self and City of Slaton) Moncivais, Emil R. (City of San Antonio) Paniagua, Joe (Fort Worth City Council) Privett, Tony (City of Lubbock) Williams, Terry L. (City of El Paso)


{% extends "pretixcontrol/organizers/base.html" %} {% load i18n %} {% load bootstrap3 %} {% block inner %}
{% blocktrans %}You cannot delete the team because there would be noone left who could change team permissions afterwards.{% endblocktrans %}
{% else %} {% endif %} {% endblock %}


--- layout: default ---
| Address |
University of Cambridge William Gates Building 15 JJ Thomson Avenue Cambridge CB3 1FD United Kingdom |
|---|---|
| Office: | {{ site.data.author.office }}, William Gates Building |
| Telephone: | +44 (0)1223 {{ site.data.author.phoneext }} |
| Fax: | +44 (0)1223 334 678 |
| E-mail: | {{ site.data.author.firstname }}.{{ site.data.author.surname }} AT cl.cam.ac.uk |
A full list is available on the publications page.
{% bibliography --max 5 --query @article, @inproceedings %}


[Wilson takes off his hat and crushes a beer can against his forehead]
Tim: How do you feel now?
Wilson: ...I hurt.
Crushing a can of beer or soda with your forehead.
Often starts by a drunken man wanting to show how tough he is, and hey, he just HAPPENS to have an empty beer-can in his hand...
Sometimes it's a macho thing, and sometimes it's Played for Laughs. The most frequent variation involves the can being full, with resulting cranial trauma.
In Real Life this could result in a concussion if you slam the thing against your head (as opposed to placing it there and applying steady pressure). Using a full can is especially not recommended, as these are strong enough for you to stand on them.
It should also be noted that the ability to smash a can against one's forehead is not as impressive of a feat as it used to be, because modern beverage cans are made of thinner aluminum than vintage beverage cans.
Compare Beergasm, Rockers Smash Guitars.
Contrast I'm Crushing Your Head.
Examples:
- In a "How to Speak Australian" ad for Foster's Lager, a lady at a bar does this after topping off a guy's drink with what was left in the can. She's called a "keeper."
- One of Miller Lite's "Man Law" commercials had the Men of the Square Table debating whether crushing cans on your forehead was macho or just moronic. They decided on moronic.
Eddie Griffin: Cans ain't as thick as they once were.  But now...Burt Reynolds: Lame.
- Head crushing was the subject of a Miller Lite commercial back in the late '80s. Former Bears safety Gary Fencik did the crushing while making comments about being known for "using your head" (Fencik graduated from Yale). Another patron tries to imitate him, and knocks himself cold.
- One Pepsi commercial had can-crushing as a final test for initiates in a Buddhist monastery.
- A 2002 Over the Hedge strip showed RJ, Verne, and Sammy drinking cola, burping, then smashing the cans against their foreheads. Verne wound up with his can stuck directly through his head, with RJ remarking "That's gonna leave a mark."
- One For Better or for Worse during Michael's college years had Michael deciding to "never take advice from a guy who crushes beer cans with his forehead" after his roomate Weed does so.
- Bluto in Animal House crushes a can to try and cheer up Flounder. When that fails, he goes whole hog and cheerfully smashes a beer bottle on his head instead.
- In Shaolin Soccer, "Iron Head" does a variant with a glass bottle.
- Parodied in Sorority Boys when Doofer confesses he crushes beer cans on his head out of peer pressure and he undergoes a lot of CAT scans.
- Invoked by Mr. Tulip, in The Truth, who smashes a bottle of alcohol against his forehead. The narrative notes that he is not doing this to be perceived as tough by the drinkers at Beirs, but simply because he had a bottle that he no longer needed and putting it down on a table required more concentration then he deemed necessary. This is implied to be what causes the other customers in Biers to later lock the door in case Mr. Tulip and his partner come back. For those less familiar with Discworld, Biers is Ankh-Morpork's resident bar for the undead.
- A brief reference to Bad-Guy Bar toughs who "open beer bottles with their teeth, or—if the evening has been going really well—other people's teeth" in an earlier work is similar in spirit.
- Deconstructed in one humorous college survival guide, which shows a step-by-step guide to doing this, the last step being that you will not make a good impression on your girlfriend's parents, with the boy meeting the parents with the marks from crushing the can still on his head.
- Wilson did this in Home Improvement, and wound up giving himself a headache in the process.
- Tims college buddy Stu did this in an early season episode. Brad, Randy, and Mark were highly amused by it. Jill, however, was not.
- Buddy Lembeck from Charles in Charge bragged about crushing a number of cans in a row, and could have done more if they were empty.
- One episode of Boy Meets World had Mankind teaching Topanga how to do this.
- Also, Cory tried to do it to impress the wrestlers in season 2.
- Gary in Men Behaving Badly tried this once to prove how tough he was.
- The Rockford Files had an ex-con try to intimidate Jim by crushing a can on his forehead. Jim pointed out that beer cans had switched from steel to aluminum while he was in prison, and anyone can do that now.
- Stargate Atlantis: Lieutenant Colonel John Sheppard once instructed Ronon in proper beer can crushing technique. It was their day off.
- Taken Up to Eleven with X-Play's Johnny Extreme, who shatters beer bottles against his crotch.
- An episode of My Name Is Earl had Earl attempt this... with what appeared to be a full can.
- In David Frizzell's "I'm Gonna Hire a Wino to Decorate Our Home," the wife sarcastically announces that she will renovate the house to meet the husband's drunken needs so he won't be staggering home anymore. Among the things she promises: "And for you, I'll always keep in stock those soft aluminum cans / And when you're feeling macho, you can crush 'em like a man."
- Referenced in "Crushin' It" by Brad Paisley, which is even book-ended by the sound of a can being crushed: "I can stomp it with my boot, clench it with my fist / Smash it on my forehead, yeah, I got this."
- The Sandman smashed several cans against his head during his entrance.
- He would do this until he split his forehead open too.
- At Heat Wave '98, Spike Dudley tried to do this but only succeeded in dazing himself.
- This was a trademark of "Stone Cold" Steve Austin.
- A prop comedian once demonstrated the ultimate way to one-up tough guys who crush beer cans on their foreheads: He showed a beer can, crushed it against his forehead, and subsequently un-crushed it by inflating it back to its original shape.
- A variant occurs in Indiana Jones and the Last Crusade in the Castle Brunwald section, where Biff will do this after you offer him a stein (or trophy) of ale.
- In the first Ratchet & Clank game, Ratchet does this to the second can of Heart Container juice.
- Punch-Out!!: Soda Popinski does this with a plastic vod—er, soda bottle.
- In Brütal Legend, the headbanger legions do this with beer bottles repeatedly without detriment, thanks to their extremely Hard Heads. Understandably, the keeper of Beerhenge does this more then anybody ever.
- In Monday Night Combat's Spunky Cola trailer, the rough-and-tumble Tank does this with a can of, well, Spunky Cola. The wimpy Sniper actually knocks himself out trying to do the same.
- Variant in World of Warcraft's Mists of Pandaria expansion. In the Pandaren starting zone, you encounter a Pandaren named Ironbrow who proceeds to break bamboo, wood, and stone with his forehead. Eventually, you bring him a jade pillar to test his mighty brow against...and he ends up getting a concussion, while the pillar remains intact. Next time you meet him, he's wielding the jade pillar as a weapon.
- One of Roadhog's emotes in Overwatch is to crush the canisters of Fantastic Drug that he uses to heal himself against his head.
- PvP has Robbie show Skull how to do this. Problem is, when Skull tries to imitate him, he forgot to drain the can first.
Robbie: *staring at Skull who's given himself a concussion* Uh, Skull, the can has to be empty.
- Krakow, when Kia the Succubus tried to demonstrate that she could be "one of the guys" too, but the can is full.
- In Bigger Than Cheeses, Thanatos and Violent Bob engage in a bout of this, escalating as they crush larger (and filled) containers of beer with their heads until Thanatos does a running headbutt into a beer truck, with explosive results.
- In one strip of Air Force Blues, Barbie manages to tick off Lt. Col. Rowland during an euphoric high from getting to pilot the F-22 for the first time. After he comes back to relative sanity two strips later, Rowland crushes a Diet Coke can on Barbie's forehead to express his displeasure.
- Atop the Fourth Wall: Linkara attempted this in his Adamantium Rage review, but the can remained intact.
"Ow!"
- When a character in a later review manages to successfully perform the stunt, Linkara flashes back to his failed attempt and proceeds to call the character a "showoff".
- In the My Little Pony: Friendship Is Magic fan video Epic Wub Time, Vinyl Scratch does this with a wooden beerstein. And it doesn't even splinter like wood, it just crumples.
- In Futurama, Bender once did this with a whole keg.
- Captain Hero is shown doing this in the series premiere opener of Drawn Together, also with a keg.
- One episode of The Raccoons has the Three Pigs try this. The third one only succeeds in putting a can-shaped indentation in his forehead.
- Mentioned in Daria.
Jane: I bet that any minute now, Kevin will astound and amaze his friends by crushing that can with his skull...
- In an earlier episode, Jodie mentioned to Daria that was all Kevin was really good at doing.
- The Simpsons:
- Marge Simpson does this with a wine bottle in one episode.
- In a later episode, an Abe Lincoln robot does this with a can of Duff Beer as part of a short rap number.
- Celebrity Deathmatch had Nick Diamond attempt this in the Testosterone Poisoning episode "Sex, Lugs And Rock N' Roll", which he learned during his college days. Problem is, he used a glass bottle and almost gave himself a skull fracture.
Nick: Ow! I used to be really good at this...Johnny: Shouldnt that be an aluminum can?Nick: Oh yeah...
- Lilo & Stitch: The Series do this a few times, mostly Stitch. In fact, he even did this once all the way back in the first film.
- Lola in The Looney Tunes Show
"There's no one more stable than me..."
- Done by Sheen in The Adventures of Jimmy Neutron: Boy Genius to practice for Jimmy's "college party".
- Robotic villain Atlas does this in Teen Titans episode "Only Human" with an oil drum.
- On American Dad! Roger tries to do this in the episode "My Affair Lady" and fails, leaving a ring-shaped imprint in his forehead.
- Joel O'Keefe, frontman for the Australian band Airbourne smashes unopened beer cans on his head during live shows until they burst, then throws them to the audience.
- Russian Airborne Forces soldiers have a tradition of smashing glass bottles this way to show how badass they are.
- You can buy novelty soft plastic cans that look a bit like the real thing which will crush gently and not injure you when whacked against your head.
- The trick to this move is to crumple the sides of the can close to the end you're holding in your hand with your fingers as you do it — this compromises the structural integrity of the can, allowing it to collapse more easily.


jug is a web framework aimed at easily building APIs. It is mostly aimed at exposing R functions,
models and visualizations to third-parties by way of http requests.
| Version: |
0.1.7 |
| Depends: |
R (≥ 3.1.0), magrittr |
| Imports: |
R6, webutils, httpuv, mime, infuser, jsonlite, base64enc |
| Suggests: |
testthat, knitr, rmarkdown |
| Published: |
2017-04-13 |
| Author: |
Bart Smeets [aut, cre] |
| Maintainer: |
Bart Smeets <bartsmeets86 at gmail.com> |
| License: |
MIT + file LICENSE |
| URL: |
https://github.com/Bart6114/jug |
| NeedsCompilation: |
no |
| In views: |
ModelDeployment, WebTechnologies |
| CRAN checks: |
jug results |


My name is Ahmad Albzour , I am 24 years old , I'm a software engineer student at Luminus Technical University College (ASAC). And I'm good at : Multi-Tasker - Ability to make decisions- The ability to work under pressure- Ability to manage and distribute work to others- Ability to communicate verbally and in writing- Awareness and business intelligence- Team leader skills- Patient- Teamwork- Ability to solve problems- Attention to details. I completed level 102 where I learned a lot about CSS, JS and HTML.
I'm Omar Obaid, I am 20 years old. I'm studying software engineering in LTUC


SneakerNet reporting plugin version 1.3
| File | avgReadLength | totalBases | minReadLength | maxReadLength | avgQuality | numReads | PE? | coverage | readScore | medianFragmentLength |
| FA1090_1.fastq.gz | 250.00 | 10769500 | 250 | 250 | 40.00 | 43078 | no | 4.90 | . | . |
| FA1090_2.fastq.gz | 250.00 | 10769500 | 250 | 250 | 40.00 | 43078 | no | 4.90 | . | . |
| 2010EL-1786_1.fastq.gz | 250.00 | 15156749 | 250 | 250 | 40.00 | 60627 | no | 3.79 | . | . |
| 2010EL-1786_2.fastq.gz | 250.00 | 15156750 | 250 | 250 | 40.00 | 60627 | no | 3.79 | . | . |
| Philadelphia_CDC_1.fastq.gz | 250.00 | 17042750 | 250 | 250 | 40.00 | 68171 | no | 5.01 | . | . |
| Philadelphia_CDC_2.fastq.gz | 250.00 | 17042750 | 250 | 250 | 40.00 | 68171 | no | 5.01 | . | . |
version: 1.0
| File | genomeLength | CDS | N50 | longestContig | numContigs | avgContigLength | assemblyScore | minContigLength | expectedGenomeLength | kmer21 | GC |
| 2010EL-1786.skesa | 2943980 | 2788 | 16887 | 106009 | 277 | 10628 | 4.110 | 500 | 0 | 0.0006 | 47.6% |
| FA1090.skesa | 1957023 | 2068 | 9146 | 31557 | 347 | 5639 | 3.272 | 500 | 0 | 0.0021 | 52.8% |
| Philadelphia_CDC.skesa | 3320432 | 3185 | 17862 | 57165 | 301 | 11031 | 4.083 | 500 | 0 | 0.0008 | 38.2% |
version: 1.1
| File | A | T | C | G | N | A/T | C/G |
| FA1090_1.fastq.gz | 7222 | 7963 | 7591 | 7185 | 7800 | 0.91 | 1.06 |
| FA1090_2.fastq.gz | 7167 | 7863 | 7525 | 7104 | 7488 | 0.91 | 1.06 |
| 2010EL-1786_1.fastq.gz | 12076 | 11649 | 11067 | 11229 | 13537 | 1.04 | 0.99 |
| 2010EL-1786_2.fastq.gz | 11697 | 11565 | 10573 | 10866 | 13413 | 1.01 | 0.97 |
| Philadelphia_CDC_1.fastq.gz | 11884 | 12631 | 13158 | 11717 | 13352 | 0.94 | 1.12 |
| Philadelphia_CDC_2.fastq.gz | 12041 | 12750 | 13115 | 11972 | 13533 | 0.94 | 1.10 |
version: 1.0
krakenDatabase: /scicomp/reference/kraken/1.0.0/kraken_db
| NAME | LABELED_TAXON | BEST_GUESS | PERCENTAGE_OF_GENOME_IS_BEST_GUESS |
| FA1090 | Neisseria | Neisseria | 52.77% |
| Philadelphia_CDC | Legionella | Legionella pneumophila | 97.22% |
| 2010EL-1786 | Vibrio | Vibrio cholerae | 54.73% |
| NOTE: A genome with >90% reads in agreement with its species has not been shown to indicate contamination | |||
| NOTE: More testing needs to be performed before any conclusion can be made from this spreadsheet, and it is given for general information only. For more information, please see your local bioinformatician and/or open the relevant Kraken report. |
version: 1.0
| Sample | Scheme | NumLociFound | questionableLoci |
| 0 | |||
| FA1090 | neisseria | 6 | 0 |
| This analysis searches for conserved MLST loci in an attempt to find multiple alleles. | |||
| In preliminary testing, this tool was able to detect as low as 6% contamination. |
version: 1.1
| File | numPeaks | finalDelta | hist | firstPeak | firstValley | secondPeak | secondValley... | ||||
| 2010EL-1786_1.fastq.gz | 4 | 25 | ▆▆▆▇▇▆▇▆▆▅▃▂▁▁▁▁▁ | 2 | 11 | 14 | 16 | 17 | 27 | ||
| 2010EL-1786_2.fastq.gz | 3 | 50 | ▄▄▄▇█▆▅▅▄▃▃▂▂▁▁▁ | 2 | 11 | 15 | 26 | ||||
| FA1090_1.fastq.gz | 5 | 25 | ▆▆▇█▄▅▃▃▅▃▂▂▁ | 2 | 26 | 29 | 30 | 31 | 32 | 34 | 38 |
| FA1090_2.fastq.gz | 3 | 25 | ▄▇▆█▅▆▅▂▁▁▁ | 2 | 29 | 32 | 39 | ||||
| Philadelphia_CDC_1.fastq.gz | 3 | 25 | ▁▃▃▂▄▄█▇▃▁ | 2 | 32 | 38 | 41 | ||||
| Philadelphia_CDC_2.fastq.gz | 5 | 25 | ▆█▇▄▃▂▃▂▂▂▂▁▂▂▁▁▁▂▁▁▁▁▂▂▄▂▁▁▂▁▁▂▄▄▃▄▃▄▂▂ | 2 | 16 | 17 | 32 | 40 | 45 | 53 | 55 |
| The histogram ranges from the first valley to the last valley | |||||||||||
| Some files have no discernable peaks and valleys and therefore might not have data listed |
version: 1.0
| File | mlst_scheme | 7-gene_ST | locus1 | locus2 | locus3 | locus4 | locus5 | locus6 | locus7 |
| FA1090.skesa.fasta | neisseria | - | abcZ(109) | adk(39) | aroE(806?) | fumC(190) | gdh(147) | pdhC(71) | pgm(65) |
| Philadelphia_CDC.skesa.fasta | - | - | |||||||
| 2010EL-1786.skesa.fasta | vcholerae | - | adk(7) | gyrB(-) | mdh(4) | metE(37) | pntA(-) | purM(1) | pyrC(-) |
| n indicates an exact allele | |||||||||
| ~n indicates a novel allele similar to n | |||||||||
| n? indicates a partial match to known allele n | |||||||||
| n,m indicates multiple alleles | |||||||||
| - indicates that an allele is missing | |||||||||
| For more details: https://github.com/tseemann/mlst |
version: 1.0
| 2010EL-1786 | taxon=Vibrio;route=calcengine | ./2010EL-1786_1.fastq.gz;./2010EL-1786_2.fastq.gz |
| FA1090 | taxon=Neisseria;route=calcengine | ./FA1090_1.fastq.gz;./FA1090_2.fastq.gz |
| Philadelphia_CDC | taxon=Legionella;route=calcengine | ./Philadelphia_CDC_1.fastq.gz;./Philadelphia_CDC_2.fastq.gz |
version: 1.0
| Sample | coverage | quality |
| Philadelphia_CDC_1.fastq.gz | 0 | 0 |
| 2010EL-1786_1.fastq.gz | 0 | 0 |
| Philadelphia_CDC_2.fastq.gz | 0 | 0 |
| FA1090_2.fastq.gz | 0 | 0 |
| 2010EL-1786_2.fastq.gz | 0 | 0 |
| FA1090_1.fastq.gz | 0 | 0 |
| 1: fail | ||
| 0: pass | ||
| -1: unknown |
version: 1.0
date: 2019-08-01
time: 15:27:39
version: 1.3


About
Contact
World Search
US Housing
EMOVO
About
Contact
World Search
US Housing
1
2
3
4
5
6
Based on the input data, here is a specialized place rankings for you to retire:


Oops ... your browser doesn't support the HTML5 canvas element
Oops ... your browser doesn't support the HTML5 canvas element
Oops ... your browser doesn't support the HTML5 canvas element
Clear All Canvas
B-spline
RaG
Quantidade de subdivisões:
Ok
Grau do polinômio para curvas B-splines:
Ok
Valor do desvio padrão para curvas RaGs:
Ok


I must disclose that I have been infected by the dream that Donald E. Knuth wanted to give us with the Literate Programming paradigm. Many decades have passed since his original papers and the book that archives all of those papers into a nice piece of literature.
I would say that for me, Literate Programming is the way that we should think about writing software and code. Such that we ought to address our programs to people and not to machines. Programming itself should be regarded as a process of writing essays, therefore considered as a process of creating works of literature, which are meant to be read. (the book above says is better)
Many aspiring computer scientists and programmers have the audacity to say that one can be a good software developer without knowing how to write properly or do math rigorously. Both of those claims to me are quite outrageous. Those are the foundations of our field and what we are.
Below is a link to a simple terminal-based sorting algorithm visualizer I wrote in CWEB. Writing programs and explaining algorithms to people rather than to computers is actually fun! One can say, it’s very much enlightening.
I wrote a sorting visualizer in high school and years after, decided to re-write it using the principles of Literate Programming. My raw C code became not only much clearer, but also a pleasure to read with its automatic documentation.


| Author | Sebastien Lelong, Copyright © 2011, all rights reserved. |
| Adapted-by | |
| Compiler | 2.4o |
Minix v2 implementation Partitions aren't supported, so you have to create a filesystem on the whole available memory. Typically, instead of "mkfs.minix -v /dev/sdX1", you'll have to "mkfs.minix -v /dev/sdX" (and remove sdX1 partition with fdisk) Some useful commands: - fsck.minix -f -v -s /dev/sdX will print Super-Block and some other information about files, dirs, state - hexdump -C /dev/sdX will dump Minix FS content (only changing lines) - hexdump -v -C /dev/sdX will do the same, but dump all lines, even if identical . In order to test your setup, you can untar minix_data.tar.bz2 available at: ... This archive contains directories and files of different size, used to test data zone and helping to understand how Minix filesystem is designed. 1. prepare your device, no partition (replace /dev/sdX with appropriate device): mkfs.minix -v /dev/sdX mount /dev/sdX /mnt/tmp 2. untar test data: cd /mnt/tmp && tar xjfv path/to/minix_data.tar.bz2 cd && umount /mnt/tmp 3. check content: fsck.minix -f -v -s /dev/sdX should report something like (1GB SD-card used here): . Forcing filesystem check on /dev/sdX. 65535 inodes 992000 blocks Firstdatazone=4227 (4227) Zonesize=1024 Maxsize=2147483647 Filesystem state=1 namelen=30 . 20 inodes used (0%) 70858 zones used (7%) . 16 regu 16 regular files 2 directories 0 character device files 0 block device files 1 links 2 symbolic links ------ 21 files . Vocabulary: these are the terms I'm using in this code, may be wrong... * storage: this is the underlying storage layer. Link between MinixFS and storage is done by creating aliases to some spefici proc/funcs. Typically, storage is sd_card.jal library. It could also be hard-disk too. * sector: this is a unit in underlying storage (eg. for SD cards, 512 bytes) * block: this is a unit in minixfs (typically 1024 bytes, that is, 2 * sector's size with SD cards) * zone: same as a block in case of Minix v2 * inode: well, that's an inode, a kind of meta description of a file * file descriptor: a structure composed with an inode and several information to track how file was opened and where we are within a file (well, again, that's a file descriptor)
* I developped this lib and tested it with sd_card storage. It should be possible to use other * storages though not tested nor even tried. * to developpers: this piece of code is tricky... If you plan to modify this lib, take huge care at variables initialization, there are special values I used, mostly to rollover to 0 when first accessed. It could have been simpler but would have used more variables and thus more resources. There are many counters which, when reaching a specific value, trigger actions (like flushing data, going to next zone, allocate a new zone, etc...). Just don't assume it'll work just because you added a small little line, because everything is quite tied together and you could be victim of an (un)expected butterfly effect :) I myself broke features many times with supposedly minor changes, hurting my brain a lot. Being polite...
var word minix_sector_progress = 0
const byte MINIX_ZONE_TRIPLE_INDIRECT = 0b_1000
const word MINIX_SUPER_MAGIC = 0x137F
const word MINIX_SUPER_MAGIC2 = 0x138F
const dword MINIX_MAX_DIRECT_ZONE_SIZE = MINIX_NUM_DIRECT_ZONES * MINIX_BYTES_PER_BLOCK
const byte MINIX_ERR_NONE = 0b_0000_0000
const word MINIX_BOOT_BLOCK_ADDRESS = 0x00
const dword MINIX_NUM_ZONE_BITS_PER_BLOCK = MINIX_BYTES_PER_BLOCK * 8
var byte _minix_last_error = MINIX_ERR_NONE
const word MINIX2_SUPER_MAGIC = 0x2468
const word MINIX_SUPER_BLOCK_ADDRESS = MINIX_BOOT_BLOCK_ADDRESS + MINIX_BYTES_PER_BLOCK
const word MINIX_INODE_ROOT_ID = 1
const byte MINIX_MODE_WRITE = 0b010
const word MINIX_BYTES_PER_INODE = 0x40
const byte MINIX_ERR_NO_SUCH_FILE = 0b_0000_1000
var minix_superblock minix_sb
const byte MINIX_ERR_NOT_DIRECTORY = 0b_0000_0100
const word MINIX_BYTES_PER_BLOCK = 0x400
const word MINIX_MAX_INDIRECT_ZONE_IDX = 0x03FC
const byte MINIX_MAX_FILENANE_LEN = 30
const byte MINIX_NUM_DIRECT_ZONES = 7
const word MINIX2_SUPER_MAGIC2 = 0x2478
const byte MINIX_MODE_APPEND = 0b100
const byte MINIX_ZONE_NONE = 0b_0000
var dword minix_storage_address = 0
const byte MINIX_ZONE_INDIRECT = 0b_0010
const byte MINIX_ZONE_DOUBLE_INDIRECT = 0b_0100
const byte MINIX_ERR_BAD_ADDRESS = 0b_0010_0000
var minix_fd minix_filefd
var dword minix_curzone
var word minix_cwd
const dword MINIX_NUM_INDIRECT_ZONES = 256
const dword MINIX_NUM_DOUBLE_INDIRECT_ZONES = 65536
const dword MINIX_MAX_INDIRECT_ZONE_SIZE = (MINIX_NUM_INDIRECT_ZONES * MINIX_BYTES_PER_BLOCK) + MINIX_MAX_DIRECT_ZONE_SIZE
const word MINIX3_SUPER_MAGIC = 0x4D5A
const byte MINIX_ZONE_DIRECT = 0b_0001
const byte MINIX_MODE_READ = 0b001
const byte MINIX_ERR_END_OF_FILE = 0b_0001_0000
var byte minix_curzonetab[4] at minix_curzone
const byte MINIX_MAX_DIRECT_ZONE_IDX = 6
const word MINIX_MAX_DOUBLE_DIRECT_ZONE_IDX = 0x03FC
const byte MINIX_ERR_BAD_ZONE_LOCATION = 0b_0000_0010
const byte MINIX_ERR_BAD_MAGIC_NUMBER = 0b_0000_0001
minix_read_super_block(bit in check_data_zone)
minix_close()
minix_init(bit in check)
minix_next_zone(bit in create_zone)
minix_open_block_byte(dword in blocknum, word in bytenum)
minix_flush()
minix_storage_write_byte(byte in data)
minix_seek(dword in bytenum)
minix_load_inode(word in inode_num)
minix_cd(byte in dirname[MINIX_MAX_FILENANE_LEN])
minix_storage_flush()
minix_last_error'put(byte in val)
minix_openi(word in inode_num,byte in mode)
minix_cdi(word in inode_num)
minix_write(byte in data)
minix_open_block(dword in num)
minix_open(byte in filename[MINIX_MAX_FILENANE_LEN],byte in mode)
minix_save_inode()
minix_zone_alloc() return dword
minix_find_in_cwd(byte in filename[MINIX_MAX_FILENANE_LEN]) return word
minix_last_error'get() return byte
minix_read() return byte
minix_next_entry'get() return minix_dir_entry
minix_storage_read_byte() return byte
var word minix_sector_progress = 0
track progress while accessing underlying storage sector
const byte MINIX_ZONE_TRIPLE_INDIRECT = 0b_1000
No documentation found
const word MINIX_SUPER_MAGIC = 0x137F
Magic numbers used to idenfity filesystem version
const word MINIX_SUPER_MAGIC2 = 0x138F
minix fs, 30 char names
const dword MINIX_MAX_DIRECT_ZONE_SIZE = MINIX_NUM_DIRECT_ZONES * MINIX_BYTES_PER_BLOCK
No documentation found
const byte MINIX_ERR_NONE = 0b_0000_0000
Error constants. Following "mkfs" convention, errors are added, so minix_last_error can embed several errors
const word MINIX_BOOT_BLOCK_ADDRESS = 0x00
Super Block is one block after boot block
const dword MINIX_NUM_ZONE_BITS_PER_BLOCK = MINIX_BYTES_PER_BLOCK * 8
No documentation found
var byte _minix_last_error = MINIX_ERR_NONE
Auto-resetting variable: errors are added, and when read, reset to 0
const word MINIX2_SUPER_MAGIC = 0x2468
minix V2 fs
const word MINIX_SUPER_BLOCK_ADDRESS = MINIX_BOOT_BLOCK_ADDRESS + MINIX_BYTES_PER_BLOCK
No documentation found
const word MINIX_INODE_ROOT_ID = 1
Inode --
const byte MINIX_MODE_WRITE = 0b010
No documentation found
const word MINIX_BYTES_PER_INODE = 0x40
64B per inode
const byte MINIX_ERR_NO_SUCH_FILE = 0b_0000_1000
try to access invalid/unexisting filename or inode
var minix_superblock minix_sb
super-block
const byte MINIX_ERR_NOT_DIRECTORY = 0b_0000_0100
try to act on a directory, but inode isn't a directory
const word MINIX_BYTES_PER_BLOCK = 0x400
1KB per block
const word MINIX_MAX_INDIRECT_ZONE_IDX = 0x03FC
0x400 - 4 == one block - one location
const byte MINIX_MAX_FILENANE_LEN = 30
max filename size according to minix v2
const byte MINIX_NUM_DIRECT_ZONES = 7
No documentation found
const word MINIX2_SUPER_MAGIC2 = 0x2478
minix V2 fs, 30 char names
const byte MINIX_MODE_APPEND = 0b100
write implied
const byte MINIX_ZONE_NONE = 0b_0000
No documentation found
var dword minix_storage_address = 0
track underlying storage address
const byte MINIX_ZONE_INDIRECT = 0b_0010
No documentation found
const byte MINIX_ZONE_DOUBLE_INDIRECT = 0b_0100
No documentation found
const byte MINIX_ERR_BAD_ADDRESS = 0b_0010_0000
bad block address
var minix_fd minix_filefd
file descriptor currently being accessed (file)
var dword minix_curzone
No documentation found
var word minix_cwd
current working directory (CWD) inode number
const dword MINIX_NUM_INDIRECT_ZONES = 256
No documentation found
const dword MINIX_NUM_DOUBLE_INDIRECT_ZONES = 65536
No documentation found
const dword MINIX_MAX_INDIRECT_ZONE_SIZE = (MINIX_NUM_INDIRECT_ZONES * MINIX_BYTES_PER_BLOCK) + MINIX_MAX_DIRECT_ZONE_SIZE
No documentation found
const word MINIX3_SUPER_MAGIC = 0x4D5A
minix V3 fs
const byte MINIX_ZONE_DIRECT = 0b_0001
No documentation found
const byte MINIX_MODE_READ = 0b001
File descriptor constants
const byte MINIX_ERR_END_OF_FILE = 0b_0001_0000
reached EOF
var byte minix_curzonetab[4] at minix_curzone
No documentation found
const byte MINIX_MAX_DIRECT_ZONE_IDX = 6
No documentation found
const word MINIX_MAX_DOUBLE_DIRECT_ZONE_IDX = 0x03FC
0x400 - 4 == one block - one location
const byte MINIX_ERR_BAD_ZONE_LOCATION = 0b_0000_0010
something is wrong about declared and computed data location
const byte MINIX_ERR_BAD_MAGIC_NUMBER = 0b_0000_0001
magic number unsupported
minix_read_super_block(bit in check_data_zone)
Read Super-Block and fill record
minix_close()
No documentation found
minix_init(bit in check)
No documentation found
minix_next_zone(bit in create_zone)
move to next data zone, being direct, indirect ou double indirect
minix_open_block_byte(dword in blocknum, word in bytenum)
move to block number, then to byte number within the block
minix_flush()
No documentation found
minix_storage_write_byte(byte in data)
"Raw" read one byte from underlying storage.
minix_seek(dword in bytenum)
move to byte bytenum within a file Notes: assuming file was just opened, no data read bytenum must be <= filesize, if greater, expect troubles
minix_load_inode(word in inode_num)
Load inode data, identified by inode_num, into file descriptor's (minix_filefd) inode parameter
minix_cd(byte in dirname[MINIX_MAX_FILENANE_LEN])
No documentation found
minix_storage_flush()
No documentation found
minix_last_error'put(byte in val)
No documentation found
minix_openi(word in inode_num,byte in mode)
No documentation found
minix_cdi(word in inode_num)
No documentation found
minix_write(byte in data)
write a byte to current opened file descriptor
minix_open_block(dword in num)
move to block number and open read access on underlying storage
minix_open(byte in filename[MINIX_MAX_FILENANE_LEN],byte in mode)
No documentation found
minix_save_inode()
Save current file desc's inode (minix_filefd.inode)
minix_zone_alloc() return dword
Walk accross zone bitmap, searching for a free zone number (identified by 0s) and return available zone number. /!\ zone bitmap and file's content obviously aren't located the same. This means when allocating, we're moving in a different place (zone bitmap) than we previously were while writing into the file. It's the caller's responsability to move the correct location once allocation is done. Yes, that's right: it's dirty, as zone_alloc() won't let the system in its previous state. ("why ?" you may ask... because it's simpler like that, and anyway, this procedure is somewhat internal, so it shouldn't be a problem in the end).
minix_find_in_cwd(byte in filename[MINIX_MAX_FILENANE_LEN]) return word
return inode number found for given filename can be a file or a dir name) in current directory
minix_last_error'get() return byte
No documentation found
minix_read() return byte
Read bytes from file descriptor. Walk over memory zones given, returning content byte by byte. firt walk over direct zones, then swith indirect then double indirect zones. Keep track of progress within inode
minix_next_entry'get() return minix_dir_entry
list current working directory (cwd), returning a directory entry each time it's called, until no more entry found.
minix_storage_read_byte() return byte
"Raw" read one byte from underlying storage.
| 18f27j53 | 18f27j53_sd_card_minix_demo.jal |
| 18f27j53 | 18f27j53_sd_card_minix_readi.jal |
| 18f27j53 | 18f27j53_sd_card_minix_read.jal |


Visualizing Wikipedia talk page comments, scored by toxicity.
This is an experimental visualization of toxic comments on Wikipedia by Wikimedia Research and Conversation AI . You can share feedback and thoughts on our WikiDetox project page.
Wikidetox is a project by


Starting to learn illustrator pen tool with organized structures.
The Pencil tool works primarily the same way in Adobe Illustrator and InDesign. It lets you draw open and closed paths as if you were drawing with a pencil on paper. It is most useful for fast sketching or creating a hand-drawn look. Once you draw a path, you can immediately change it if needed.
The simplest path you can draw with the Pen tool is a straight line, made by clicking the Pen tool to create two anchor points. By continuing to click, you create a path made of straight line segments connected by corner points.
You create a curve by adding an anchor point where a curve changes direction, and dragging the direction lines that shape the curve. The length and slope of the direction lines determine the shape of the curve.
Curves are easier to edit and your system can display and print them faster if you draw them using as few anchor points as possible. Using too many points can also introduce unwanted bumps in a curve. Instead, draw widely spaced anchor points, and practice shaping curves by adjusting the length and angles of the direction lines.
After you click to create an anchor point, keep the mouse button pressed down, hold down the spacebar, and drag to reposition the anchor point.
1. Using the Pen tool, click corner points in two locations to create a straight segment.
2. Position the Pen tool over the selected endpoint. In Illustrator and InDesign, a convert-point icon appears next to the Pen tool when it is positioned correctly (In Photoshop, a small diagonal line, or slash, appears next to the Pen tool). To set the slope of the curved segment you’ll create next, click the anchor point, and drag the direction line that appears.
3. Position the pen where you want the next anchor point; then click (and drag, if desired) the new anchor point to complete the curve.
1. Using the Pen tool, drag to create the first smooth point of the curved segment, and release the mouse button.
2. Reposition the Pen tool where you want the curved segment to end, drag to complete the curve, and release the mouse button.
3. Position the Pen tool over the selected endpoint. A convert-point icon appears next to the Pen tool when it is positioned correctly. Click the anchor point to convert the smooth point to a corner point.
4. Reposition the Pen tool where you want the straight segment to end, and click to complete the straight segment.
1. Using the Pen tool, drag to create the first smooth point of a curved segment.
2. Reposition the Pen tool and drag to create a curve with a second smooth point; then press and hold Alt (Windows) or Option (Mac OS) and drag the direction line toward its opposing end to set the slope of the next curve. Release the key and the mouse button.
This process converts the smooth point to a corner point by splitting the direction lines.
3. Reposition the Pen tool where you want the second curved segment to end, and drag a new smooth point to complete the second curved segment.


Example:
class Chief {
private String name;
class Paramount {
private String name;
}
}
After the quick-fix is applied:
class Chief {
private String name;
class Paramount {
private String identifier;
}
}
Use the checkbox below the indicate whether this inspection should report all name clashes, or only clashes with fields which are visible from the inner class.


b_analysis.Rmd
The {ialiquor} package provides a monthly summary Class E liquor sales in the state of Iowa by county or category between January 2015 and October 2020. This document is designed to demonstrate some potential use cases/analyses.
Let us quickly preview the main dataset. We will also store the dataset in a new variable called liquor
for ease of use.
Let’s preview the sales by county:
dplyr::glimpse(liquor)
#> Rows: 280,736
#> Columns: 10
#> $ year <dbl> 2015, 2015, 2015, 2015, 2015, 2015, 2015, 2015, 2015, 2…
#> $ year_month <dttm> 2015-01-01, 2015-01-01, 2015-01-01, 2015-01-01, 2015-0…
#> $ county <chr> "adair", "adair", "adair", "adair", "adair", "adair", "…
#> $ population <dbl> 7145, 7145, 7145, 7145, 7145, 7145, 7145, 7145, 7145, 7…
#> $ type <chr> "vodka", "other", "liqueur", "cocktail", "liqueur", "gi…
#> $ category <chr> "100 proof vodka", "american alcohol", "american amaret…
#> $ state_cost <dbl> 253.62, 54.00, 88.98, 182.40, 346.29, 99.57, 257.72, 31…
#> $ state_revenue <dbl> 380.70, 81.00, 133.50, 277.10, 519.45, 149.38, 388.12, …
#> $ bottles_sold <dbl> 54, 6, 18, 26, 36, 24, 47, 5, 18, 36, 92, 633, 60, 25, …
#> $ volume <dbl> 58.50, 4.50, 19.50, 45.50, 27.00, 15.00, 34.00, 3.75, 1…
The type
column is a derived column (not found on the original dataset) that is a higher level grouping column for more specific types (i.e., categories) of liquor. For instance, amaretto is considered to be a liqueur and bourbon/scotch is just whiskey. It is important to keep in mind that this variable (type
) is arbitrary and defined by the package author.
Luckily for us, all of variables in each of the datasets are coded correctly. Let’s focus on answering some of the key questions:
library(dplyr)
#>
#> Attaching package: 'dplyr'
#> The following objects are masked from 'package:stats':
#>
#> filter, lag
#> The following objects are masked from 'package:base':
#>
#> intersect, setdiff, setequal, union
library(ggplot2)
liquor %>%
group_by(year, county) %>%
summarize(
total_revenue = sum(state_revenue),
.groups = 'drop'
) %>%
ungroup() %>%
group_by(year) %>%
slice(which.max(total_revenue))
#> # A tibble: 6 x 3
#> # Groups: year [6]
#> year county total_revenue
#> <dbl> <chr> <dbl>
#> 1 2015 polk 63748123.
#> 2 2016 polk 65849029.
#> 3 2017 polk 70524272.
#> 4 2018 polk 78297082.
#> 5 2019 polk 82838081.
#> 6 2020 polk 73722537.
It’s interesting to note that Polk county had the most revenue. Why is that? Let’s take a look at the top county for each year in terms of population
liquor %>%
group_by(year, county) %>%
summarize(
population = max(population),
.groups = 'drop'
) %>%
ungroup() %>%
group_by(year) %>%
slice(which.max(population))
#> # A tibble: 5 x 3
#> # Groups: year [5]
#> year county population
#> <dbl> <chr> <dbl>
#> 1 2015 polk 467304
#> 2 2016 polk 474277
#> 3 2017 polk 480487
#> 4 2018 polk 485833
#> 5 2019 polk 490161
Seems as if Polk County is the largest county and it may be intuitive to assume that there are more persons buying liquor in this county.
So let’s look at revenue per person (based on population of the year), will we see different results?
liquor %>%
mutate(
rev_per_person = round(state_revenue / population , 2)
) %>%
group_by(year, county) %>%
summarize(
rev_per_person = round(sum(rev_per_person),2),
.groups = 'drop'
) %>%
ungroup() %>%
group_by(year) %>%
slice(which.max(rev_per_person))
#> # A tibble: 5 x 3
#> # Groups: year [5]
#> year county rev_per_person
#> <dbl> <chr> <dbl>
#> 1 2015 dickinson 233.
#> 2 2016 dickinson 243.
#> 3 2017 dickinson 244.
#> 4 2018 dickinson 254.
#> 5 2019 dickinson 273.
Now this is interesting. Seems as if Dickinson county has the highest revenue per person. Keep in mind that the population values also represent individuals who are not of legal age to consume liquor (i.e., under the legal age of 21). Due to the large data size, this package does not contain the brand of liquor. However, this can easily be obtained via the Iowa Data Portal for further analysis.
Perhaps it is interesting to look at the profit to the state by type of liquor over time.
liquor %>%
filter(!type %in% c('beer','other','unknown')) %>%
mutate(
profit = state_revenue - state_cost
) %>%
group_by(year, type) %>%
summarize(
total_profit = sum(profit) / 1000000,
.groups = 'drop'
) %>%
ggplot(aes(x = year)) +
geom_line(aes(y = total_profit, col = type)) +
labs(
x = "Year Month",
y = "Profit in Million US$ (not adjusted for Inflation)",
title = "Annual Profit from Class E Liquor Sales by Liquor Type",
caption = 'Source: Iowa Data Portal',
color = 'Liquor Type'
)
From the chart above, we can see that whiskey, vodka, and rum account for quite a bit of profit for the state as compared to the other types of liquor. Anecdotally speaking, when I shop at my local liquor store, I do find many types of whiskeys. However, I’m surprised to see rum in the top three as I don’t see as many rum varieties as compared to tequila or liqueur.
Let’s focus on 2019 and see which types of liquor accounted for the vast majority. For this, we’ll make a pie chart. The conclusions may be similar to before, but in this case, we can see the impact of the different types for one year a bit more clearly.
profit <- liquor %>%
filter(!type %in% c('beer','other','unknown')) %>%
mutate(
profit = state_revenue - state_cost
) %>%
filter(year == 2019) %>%
group_by(type) %>%
summarize(
total_profit = round(sum(profit) / 1000000 , 0),
.groups = 'drop'
) %>%
ungroup() %>%
mutate(
pct = paste0((round(total_profit / sum(total_profit) , 2)) * 100,'%')
) %>%
arrange(desc(type)) %>%
mutate(lab.ypos = cumsum(total_profit) - 0.5*total_profit)
profit %>%
ggplot(aes(x = "", y = total_profit, fill = type)) +
geom_bar(width = 1, stat = 'identity', color = 'white') +
coord_polar("y", start = 0) +
geom_text(aes(y = lab.ypos, label = pct), color = 'white') +
theme_void() +
labs(
fill = 'Liquor Type',
title = '2019 Profit Percentage by Liquor Type',
caption = 'Source: Iowa Data Portal'
)
Last but not least, let’s take a look at the proportion of costs to the state. These are costs paid by the state to purchase the liquor from the appropriate vendors.
liquor_sales %>%
filter(!type %in% c('beer','other','unknown')) %>%
group_by(year_month, type) %>%
summarize(total_cost = sum(state_cost), .groups = 'drop') %>%
ungroup() %>%
group_by(year_month) %>%
mutate(
cost_pct = round(total_cost / sum(total_cost) , 2)
) %>%
ggplot(aes(x = year_month, y = cost_pct, fill = type)) +
geom_area(alpha = 0.8, color = 'steelblue') +
labs(y = 'Proportion of Cost (US$ - Not Adjusted for Inflation)',
x = 'Year/Month',
title = 'Proportion of State Costs of Purchasing Liquor From Vendors',
caption = 'Source: Iowa Data Portal')


Slides available at: ror.sundarraman.me
mkdir rails_app
cd rails_app
rails new books -d mysql
adapter: mysql2
encoding: utf8
reconnect: false
database: books_development
pool: 5 username: root
password: pass
socket: /var/run/mysqld/mysqld.sock
rake db:create
rails generate controller books index
rails generate model book access_no:integer title:string author:string edition:integer publisher:string
rake db:migrate
Books
Add a book
<%= form_tag("/books/add", :method=>"post") do %>
Search Result
<% @t=Book.find_by_title(params[:bs_title]) %>
Access No.
Title
Author
Edition
Publisher
<%= @t.access_no %>
<%= @t.title %>
<%= @t.author %>
<%= @t.edition %>
<%= @t.publisher %>
Back
class BooksController < ApplicationController
def index
end
def add
Book.create(:access_no=>params[:b_access_no],:title=>params[:b_title],:author=>params[:b_author],:edition=> params[:b_edition],:publisher=> params[:b_publisher])
redirect_to :action => 'index'
end
def search
end
end
Rails.application.routes.draw do
get "books/index" => "books#index", :as => :index
match "books/add" => "books#add", :via => :post
match "books/search" => "books#search", :via => :post
end
rails s
=> Booting Puma => Rails <IP_ADDRESS> application starting in development on http://localhost:3000 => Run `rails server -h` for more startup options Puma starting in single mode... * Version 3.6.0 (ruby 2.3.1-p112), codename: Sleepy Sunday Serenity * Min threads: 5, max threads: 5 * Environment: development * Listening on tcp://localhost:3000 Use Ctrl-C to stop
Presentation by Sundar Raman G


Below are the transcriptions of your recent archives. Click the Download button to download a text file with your transcription.
Loading...


PhD Candidate in Computer Science at Boston University
I am a CS Ph.D. Candidate in the Learning, Intelligence and Signal Processing (LISP) group in the Department of Computer Science at Boston University. My advisor is Prof. Peter Chin. I obtained my bachelor’s degree in Electrical & Electronic Engineering from Nanyang Technological University in Singapore and a master’s degree in Neuroscience from MIT where I worked in the Synthetic Neurobiology Group directed by Prof. Ed Boyden. I have research experience in computer vision, bioinformatics and neurobiology.
My current research interests include biologically-inspired learning algorithms for neural networks, deep learning and affective computing.
I also enjoy teaching, reading, and making friends.
Yoon, Y. G., Dai, P., Wohlwend, J., Chang, J. B., Marblestone, A. H., & Boyden, E. S. (2017). Feasibility of 3D reconstruction of neural morphology using expansion microscopy and barcode-guided agglomeration. Frontiers in computational neuroscience, 11, 97. [publisher page] [PDF]
Ma, K. T., Li, L., Dai, P., Lim, J. H., Shen, C., & Zhao, Q. (2017, September). Multi-layer linear model for top-down modulation of visual attention in natural egocentric vision. In 2017 IEEE International Conference on Image Processing (ICIP) (pp. 3470-3474). IEEE. [publisher page] [PDF]
Mandal, B., Lim, R. Y., Dai, P., Sayed, M. R., Li, L., & Lim, J. H. (2016). Trends in machine and human face recognition. In Advances in Face Detection and Facial Image Analysis (pp. 145-187). Springer, Cham. [publisher page] [PDF]
CS 655 Graduate Introduction to Computer Networks, Fall 2020, Grader
CS 542 Machine Learning, Summer 2020, Teaching Fellow
CS 112 Introduction to Computer Science II, Spring 2020, Teaching Fellow
CS 591 C1 Computational Game Theory, Spring 2020, Grader
CS 112 Introduction to Computer Science II, Fall 2019 Teaching Fellow
CS 591 C1 Compressive Sensing and Sparse Recovery, Fall 2019 Grader
CS 542 Machine Learning, Spring 2019, Teaching Fellow and Grader
9.012 Cognitive Science, Fall 2017, Teaching Assistant
9.40 Introduction to Neural Computation, Spring 2017, Teaching Assistant