The following files are the (hypothetical) workflow on a request by Acme's in-house counsel for review and drafting by outside counsel (Quade and Quinn) on this NDA with Fabrikam.
Acme insists on keeping all transacting information in structured form. Acme also subscribes to the Collaborative Contracting Policy
With that as prologue:
-
AcmeGC_v01 is the work that GC has prepared, based on shared standards, and asks Quade to review.
-
QuadeRequest is the explanation of the assignment by GC for Quade.
-
QuadeResponse is a page set up by GC, where we see Quade's response with answers and comments.
-
AcmeGC_v02 is for when GC finalizes - accepting, selecting among or rejecting Quade's work. Ready for the next step - sharing with Fabrikam.
To see the workflow, the place to start is with the assignment to Quade - QuadeRequest. It links to GC's v01 and some resources. It also links to QuadeResponse.


{% extends 'base.html'%} {% block content %}
An application that allows users to make one minute pitches and get feedback and votes on them
{{category.name}}
{{category.description}}
No Categories available


File: js/alea.js
/*! * based on Alea.js and Mash.js. http://baagoe.com/en/RandomMusings/javascript/ * Copyright (C) 2010 by Johannes Baagøe<EMAIL_ADDRESS>* * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in * all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN * THE SOFTWARE. */ /** * Y.Alea is a better pseudorandom number generator than Math.random. * * based on Alea.js and Mash.js. http://baagoe.com/en/RandomMusings/javascript/ * Copyright (C) 2010 by Johannes Baagøe<EMAIL_ADDRESS>* @module gallery-alea */ (function (Y) { 'use strict'; var _Array = Y.Array, _each = _Array.each, _mash = function () { var n = 0xefc8249d; return function (data) { data = data.toString(); var h, i = 0, length = data.length; for (; i < length; i += 1) { n += data.charCodeAt(i); h = 0.02519603282416938 * n; n = h >>> 0; h -= n; h *= n; n = h >>> 0; h -= n; n += h * 0x100000000; // 2^32 } return (n >>> 0) * 2.3283064365386963e-10; // 2^-32 }; }, _now = Y.Lang.now, /** * @class Alea * @constructor * @param [seedValues*] Optional. Any number of seed values. If left * undefined, Y.Lang.now() is used. */ _class = function () { var args = _Array(arguments), c = 1, mash = _mash(), s0 = mash(' '), s1 = mash(' '), s2 = mash(' '); if (!args.length) { args.push(_now()); } _each(args, function (arg) { s0 -= mash(arg); if (s0 < 0) { s0 += 1; } s1 -= mash(arg); if (s1 < 0) { s1 += 1; } s2 -= mash(arg); if (s2 < 0) { s2 += 1; } }); /** * Generates a random number that is greater than or equal to zero * and less than one. The number will be a 32-bit fraction. * @method random * @return Number */ this.random = function () { var t = 2091639 * s0 + c * 2.3283064365386963e-10; // 2^-32 c = t | 0; s0 = s1; s1 = s2; s2 = t - c; return s2; }; }; _class.prototype = { /** * Generates a random number that is greater than or equal to zero * and less than one. The number will be a 53-bit fraction. * @method fract53 * @return Number */ fract53: function () { var random = this.random; return random() + (random() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53 }, /** * Generates a random 32-bit unsigned integer. * @method uint32 * @return Number */ uint32: function () { return this.random() * 0x100000000; // 2^32 } }; Y.Alea = _class; }(Y));


{% extends 'layout.html' %} {% block sub_header %}
Multiple lines of text that form the lede, informing new readers quickly and efficiently about what's most interesting in this post's contents.
This is a wider card with supporting text below as a natural lead-in to additional content.
Continue readingThis is a wider card with supporting text below as a natural lead-in to additional content.
Continue reading


- Facts
- Function
- template strings
- string method
- Making logical assertions
- Control flow and conditionals
- Loops
- Array
- Rest Parameters
- Loops
- Scope
- Object
- Factory functions
- Question to ask
- seminar
- download and links
- quiz
Facts
CanIUse can help you understand which browsers support the feature.
To get JavaScript into a web page, there are two main options.
let and var declare a variable; const declares a constant. A constant cannot be reassigned to a new value.
<!DOCTYPE html>
<html lang="en">
<body>
<script>src = "app.js"</script>
</body>
</html>
With jquery
<script src="https://www.somewhere-on-the-internet.com/coolLibrary.js"></script>
Transpiling is when you use a program to rewrite ES6 code as ES5 so it can run in all browsers.
But unless you have a specific reason not to use const
or let
, you should abandon var
entirely.
const
is used to define constant values, which is another way of saying variables whose value cannot be reassigned.
let
and var
differ in terms of their scope.
'use strict';
foo = 'bar'; // => Raises reference error
coercion
variables are converted from one type to another in JavaScript
typeof
check datatype
null
is distinct datatype, but if use typeof null
it returns “object”
undefined
, do not use it as value to a variable. use null
instead.
“objects” is considered as complex data type
const person = {
name: 'Jane Doe',
greet: function() {
console.log('Hello world');
}
};
console.log(person.name); // => Jane Doe
person.greet(); // => Hello world
The example above demonstrates that if you combine a number with a string using the + operator, the resulting value will be a string.
<script src="https://code.jquery.com/jquery-3.1.0.js"></script>
<script src="index.js"></script>
Function
alert
an argument is a value that gets passed to the function when it’s called. A parameter is the variable that holds the place of an argument when the function is defined.
call signature ()
Note that functions that do not set an explicit return value via return still return something, namely, undefined
hoisting
Default function parameters
ES6 has default parameters
function Myfunction(para){
//something
}
const Myfunction = function(para)
{
//something
}
const Myfunction = (para) => //something
When defining an arrow function that takes a single parameter, the parentheses are optional:
Immediately invoking a function expression-IIFE
Notice the ()
, without it, the IIFE will throw an error.
(function () { return 'abc' }())
'abc'
Closure
to reference a specific instance of a local binding in an enclosing scope—is called closure.
//A function is defined, it creates a local binding, and //return a function that accesses and returns the local // binding.
function wrapValue(n){
let local = n;
return ()=> local;
}
let wrap1 = wrapValue(1);
let wrap2 = wrapValue(2);
console.log(wrap1());
console.log(wrap2());
more creative example
function multiplier(factor){
return number => number*factor;
}
console.log(multiplier(5));
recursion
e.g factorial function
function factorial(n){
if(n===1){
return 1;
} else{
return n*factorial(n-1);
}
}
console.log(factorial(4));
decide if a number is even or not.
function isEven(n) {
if (n == 0) return true;
else if (n == 1) return false;
else if (n < 0) return isEven(-n);
else return isEven(n - 2);
}
template strings
const foo = "foo";
function sayHello(){
return 'hello ';
}
const myString = `foo is set to ${foo}. Let's say hello:${sayHello}`
string method
const fooBar = 'foo bar foo bar';
fooBar.length; // => 15
fooBar.charAt(0); // => "f"
fooBar.slice(4); // => "bar foo bar"
fooBar.slice(4, 7); // => "bar"
fooBar.split(" "); // => ["foo", "bar", "foo", "bar"]
fooBar.toUpperCase(); // => "FOO BAR FOO BAR"
fooBar.replace('foo', 'bar'); // => 'bar bar foo bar'
Inside a template string, you can refer to variables or execute code by using ${}
counter ++
let i = 0;
let j = 0;
// postfix operator
let x = i++;
// prefix operator
let y = ++j;
console.log(x); // 0
console.log(i); // 1
console.log(y); // 1
console.log(j); // 1
n the case of the prefix operator, it increments before it returns the value. In the case of the postfix operator, it increments after it returns the value.
Making logical assertions
False
console.log(Boolean(false));
console.log(Boolean(""));
console.log(Boolean(0));
console.log(Boolean(null));
console.log(Boolean(undefined));
console.log(Boolean(NaN));
True
console.log(Boolean({}));
console.log(Boolean([]));
console.log(Boolean(-1));
Control flow and conditionals
function analyzeNumber(num) {
if (typeof num !== 'number') {
console.log('not a number');
}
else if (num % 2 === 0) {
console.log('even number');
}
else {
console.log('odd number');
}
}
Ternary operator
function getFee(isMember) {
return (isMember ? "$2.00" : "$10.00");
}
console.log(getFee(true));
// expected output: "$2.00"
Error handling
try
, catch
, finally
try{
nonExistenceVar +='foo';
}
catch (e){
console.log("something went wrong");
console.dir(e);
}
finally {
console.log('This happens in both success and failure case!')
}
The browser will run the catch block and then continue running the next line of code. This is in contrast to an uncaught error, which bubbles up and stops code execution.
throw
intentionally throw an error.
try {
throw 'myException';
}
catch (e) {
// do something
}
Switch
switch
var fruittype = "Oranges";
switch (fruittype) {
case 'Oranges':
console.log('Oranges are $0.59 a pound.');
break;
case 'Apples':
console.log('Apples are $0.32 a pound.');
break;
case 'Bananas':
console.log('Bananas are $0.48 a pound.');
break;
case 'Cherries':
console.log('Cherries are $3.00 a pound.');
break;
case 'Mangoes':
console.log('Mangoes are $0.56 a pound.');
break;
case 'Papayas':
console.log('Mangoes and papayas are $2.79 a pound.');
break;
default:
console.log('Sorry, we are out of ' + fruittype + '.');
}
prompt("Enter passcode");
Number.isNaN
Loops
let yourName;
do {
yourName = prompt("Who are you?");
} while (!yourName);
console.log(yourName);
Array
const allTheThings = [‘cats’, ‘dogs’, 42, [‘foo’, ‘bar’], true, function() { console.log(‘hello’)}];
console.log(The first thing is ${allTheThings[0]}
);
To add an item to the end of an array, use the built-in .push
method:
const myArray = [1,2,3];
myArray.push(4);
console.log(myArray);
Array methods
list of array methods repl exercise.
.pop()
.shift()
.find()
.reduce()
.filter()
.map()
.sort()
.indexOf()
.lastIndexOf()
.concat()
Use .slice()
to remove an item from array
function remove(array,index){
return array.slice(0,index).concat(index+1)
}
console.log(remove(["a", "b", "c", "d", "e"], 2));
// → ["a", "b", "d", "e"]
Rest Parameters
Notice that the parameter of the funciton is not an array, but just numbers.
function max(...numbers) {
let result = -Infinity;
for (let number of numbers) {
if (number > result) result = number;
}
return result;
}
console.log(max(4, 1, 9, -2));
// → 9
spread an array into another array
arrayOne = [2,3];
arrayTwo = [1,...arrayOne,4,5]
console.log(arrayTwo)
Math object
.Math.abs()
.Math.ceil()
.Math.floor()
.Math.round()
work with comparing function
const myArray = [200, 20, 2, 100, 1, 10];
console.log(myArray); // => [200, 20, 2, 100, 1, 10]
function sortNumbers(a, b) {
return a - b;
}
myArray.sort(sortNumbers);
console.log(myArray)
work with Anonymous function
const myArray=[200,20,2,100,1,10];
myArray.sort(function(a,b){
return a-b
})
console.log(myArray)
use arrow function with sort()
myArray.sort((a,b) => a -b);
console.log(myArray)
Loops
for (i=1;i<=countTo;i++){
console.log(i)
}
For Loop
note:you can decrement (i–) or increment by, say, 2 (i+=2).
While loop
let counter = 1;
const countTo = 10;
while (counter <= countTo){
console.log(counter);
counter++;
}
while(true){
if (someCondition){
break;
}
}
Scope
Global VS Block
scope chain
check out Scope Write up Challenge
-
scope chain
-
determinate and indeterminate functions
-
global scope should be avoided.
-
pure function => determinate and no side effect.
Use let, const, and strict mode
always use let or const inside local block to define variable.
‘use strict’, it will throw an error when let
or const
is not used.
it’s best practice to default to putting ‘use strict’; at the top of all your JavaScript files.
Object
object literal.
Key does not use quotation mark.
const ledZeppelin = {
singer: 'Robert Plant',
guitar: 'Jimmy Page',
bass: 'John Paul Jones',
drums: 'John Bonham'
}
Key uses quotation marks, to include a space in between.
const ledZeppelin2 = {
'lead singer': 'Robert Plant',
'lead guitar': 'Jimmy Page',
}
When an object has a value that is a function, it is called method
add, delete and update values.
const foo = {
bar: 'bizz';
}
//add
foo.mar = 'dizz';
//update
foo.bar = 'cizz';
delete foo.bar;
Self-reference and this
const myFamily = {
lastName:"John";
sayHi:function(){
console.log(`Hello from the ${this.lastName}s`);
// console.log(`Hello from the ${myFamily.lastName}s`);
}
}
myFamily.sayHi();
Object.assign
Object.keys
let journal = [];
function addEntry(events, squirrel) {
journal.push({events, squirrel});
}
addEntry(["work", "touched tree", "pizza", "running",
"television"], false);
addEntry(["work", "ice cream", "cauliflower", "lasagna",
"touched tree", "brushed teeth"], false);
console.log(Object.keys(journal))
// return [0,1]
Factory functions
In this example, mammal is a factory function. The job of a factory function is to create an individual instance of some model.
function mammal(name,numEyes){
return {
name:name;
isWarmblooded:true;
numEyes:numEyes;
evolve:function(){
console.log("I'm not mutating, I'm evolving");
this.numEyes++;
}
explainYourSelf:function({
console.log(
`I'm just a ${this.name} with ${this.numEyes} eye(s). Nothing to see here`
);
}),
};
}
const tiger = mammal('tiger',2);
tiger.explainYourSelf();
tiger.evolve();
tiger.explainYourSelf();
const oneEyedBadger = mammal('badger',1);
oneEyedBadger.explainYourSelf();
In this challenge, you’ll practice grokking (that is, understanding) code written by someone other than yourself.
Question to ask
- Ask how the mechanism of the .sort() and function.
myArray.sort((a,b)=> a-b);
function greatestToLeast(array) {
// your code goes here
return array.sort((a,b)=>b-a);
}
for the drilling, I was able to figure out if I change it from a-b
to b-a
, then it becomes from greatest to least.
-
discuss array methods with mentor.
-
If you use myVar = <…>, there will be no side effects; if you use myVar.someAttribute = <…>, there will be side effects. from Object lesson 3.
seminar
object
let pet_info = {
"name":"Addie",
"weight": 6,
"happiness": 0,
}
console.log(pet_info['name'])
change value
pet_info['name']="David"
… …
download and links
mozilla javascript docs loop and iteration How to read other People’s code
quiz
-
Working with objects
-
Using factory functions to create instances of a model object
-
Explaining the difference between an object method and object property
-
Explaining why you need to be careful when passing objects as an argument to a function
-
Using the this keyword in object literals to achieve self-referentiality in your code


"Men of Honor" Reviewed by Christian Pyle Directed by George Tillman Jr. Written by Scott Marshall Smith Starring Robert De Niro, Cuba Gooding Jr., Charlize Theron, and Aunjanue Ellis Official Site: http://www.menofhonor.com/intro.htm Grade: B+
"Make me one promise," Mac Brashear (Carl Lumbly), sweating over a plow, says to his son Carl, "don't end up like me." A few years later, Carl (Cuba Gooding Jr.) finds his escape from the life of a Kentucky sharecropper in the newly-integrated Navy. However, the recruiter's claims of a bright future for Carl turn out to be lies. African-American seamen are restricted to slinging hash or serving as valets. Carl sees that he will have to claim a career for himself against stiff opposition from a racist system.
"Men of Honor" is based on the life of the U. S. Navy's first African-American Master Diver. The film balances Carl's life against that of Master Chief Billy Sunday (Robert De Niro), who is removed from diving duty after an injury to his lungs. Like Carl, Sunday is a man "born to dive," and the loss of his career turns Sunday into a mean-spirited alcoholic. When Carl finally gains entry into the Navy's diving school, Sunday is his instructor. Like most of the cadets and the school's insane commanding officer (Hal Holbrook), Sunday hates blacks and resents Carl's presence. Carl, however, meets opposition with a fearless, iron-willed determination to succeed.
Although the real Carl Brashear stamps with approval the movie's authenticity, "Men of Honor" tastes suspiciously like Hollywood corn, Rocky Balboa in a diving helmet. However, it's a high grade of corn, and a satisfying meal. A movie like this has to sell its story to the audience, and in "Men" several strong performances successfully move the merchandise.
Not surprisingly, the most impressive acting comes from De Niro. He seems well-rested from his vacation in comedy land ("Analyze This," "Rocky & Bullwinkle," "Meet the Parents") where he was needed only as an icon, not as an actor. Sunday is a challenging role because the angry bigot goes from being Carl's nemesis to being his most ardent supporter. De Niro pulls off the contradictions in this character with such subtlety that it seems effortless. Sunday is repulsive, likeable, and completely convincing all at once. This is De Niro's best work in years.
In contrast, Gooding has an easier job. Carl is characterized by single-minded determination, and therefore doesn't present the complexities of Billy Sunday. However, Gooding is completely convincing and brings limitless energy to the character.
Charlize Theron wins the Not Just a Pretty Face Award for her impressive work as Sunday's neglected wife Gwen. Also, take note of the always good, always underused Michael Rapaport as a stammering seaman who befriends Carl.
Although the script for "Men of Honor" is shamelessly manipulative, it is also effective. When a room full of people give Carl a standing ovation in the film's climax, I was tempted to stand up in the theater and clap, too.
Bottom line: Honorable
© 2000 Christian L. Pyle
Read my reviews and others at the Mad Review: http://www.madreview.com/main.html
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


| Home · Pages · Index · Overviews |
Correlation and Regression Module ReferenceFunctions for correlations and regressions over AForm objects. More... #include <correlate.h> Structures
Routines
Detailed DescriptionFor all the routines in this module, the shape of the AForms passed to them is not important. Each AForm is treated as a linear vector (linearized according to innermost-first order) whose length is equal to the number of elements in the array form. So for example, when computing A_Correlation between two arrays a1 and a2, a1 and a2 can have different shapes and types, but they must have the same number of elements. On can compute simple correlation, covariance (correlation with mean bias), and normalized correlation, or "Pearson correlation" (covariance normalized by the standard deviations of the series). For each of these three correlations, there is a routine that takes two AForms and returns the desired quantity as a double value (A_Correlation, A_Covariance, A_Pearson_Correlation). There is also a routine that takes any number, n, of AForms and computes all pairs of the given correlation between them, generating and returning an nxn Double_Matrix of all the pairwise entities (Correlations, Covariances, Pearson_Correlations'); Linear_Regression is a routine for performing a standard linear regression, i.e. finding the set of weights that gives the best least squares fit between a linear, weighted combination of any number of input vectors and an observation vector. The routine can optionally fill in a bundle of standard statistics about the nature of the fit (see Regression_Bundle below). There is also a specialized routine, Simple_Regression, for the common case where an observation is to be explained as an affine function of a single input. Structure Documentation
A bundle of this kind, when passed to either Linear_Regression or Simple_Regression, is filled in with various statistics that provide information about the goodness of the fit of the regression. The deeper statistical meaning of each field is defered to a good text on statistics. Here a simple and hopefully operative description of each statistic is given. We assume that the observation vector is obs, the n input vectors are a1, a2, ... an, all the vectors have N elements, and that the computed linear regression variables are c[0], c[1], ... c[n-1]. The vector of predicted values will be donted by est, where est[t] = c[0]*a1[t] + ... + c[n-1]*an[t]. tss: stands for "total sum of squares" and is the variance in the observation vector obs about its mean, i.e. tss = Σt (obs[t] - μ)2, where μ is the the mean of the elements in obs. mss: stands for "model sum of squares" and is the variance of the estimate of the observation, est about the mean of obs, i.e. mss = Σt (est[t] - μ)2, where μ is the the mean of the elements in obs. rss: stands for "residual sum of squares" and is the covariance between observation vector obs and the predicted values est, i.e. rss = Σt (obs[t] - est[t])2. It is this quantity that is minimized by the linear regression. ser: is the "standard error of the estimate" which is just the standard deviation of the distribution of obs-est, i.e. ser = (rss/(N-n)).5 R2: is "R-squared" or the "coefficient of determination". It ranges from 0 to 1 and indicates how well the observation is explained or predicted by a linear combination of the input factors, where 0 implies no predictive power, and 1 implies perfectly predictive. Mathematically, it is 1-rss/tss where rss and tss are explained above. aR2: is the "adjusted R-squared" coefficient equal to 1 - (rss*(N-1)) / (tss*(N-n)) Note that aR2 = R2 when n = 1 and ar2 < R2 when n > 1. The idea is that the number of degrees of freedom n compensates for the expected greater "predictive" power the more input vectors there are. std_err: is an n-element vector that gives the standard error for each coefficient c[i]. Under the assumption that N is "large enough", then by the central limit theorem the error in each coefficient approaches a normal distribution with 0 mean and a standard deviation of std_err[i] = ser*Q-1ii where Q = Correlations(n,a1,...,an). t_stat: is an n-element vector that gives the t-statistic for each coefficient c[i] under the assumption of asymptotically large N. This statistic, which is t_stat[i] = c[i]/std_err[i], follows the Student t-distribution and can thus be used to compute the p-value that c[i] is non-zero. Routine Documentation
Return the correlation, Σt a1[t]a2[t], between a1 and a2. The only constraint on a1 and a2 is that they have the same number of elements (but not necessarily the same shape or type).
Return the covariance, Σt (a1[t] - μ1)(a2[t] - μ2) / A, between a1 and a2, where μi is the mean of the elements of ai, and A is the number of elements in both a1 and a2. The only constraint on a1 and a2 is that they have the same number of elements (but not necessarily the same shape or type).
Returns the Pearson- or normalized-correlation, Σt (a1[t] - μ1)(a2[t] - μ2) / (σ1σ2A), where μi is the mean of the elements of ai, σi is the standard deviation of the elements in ai, and A is the number of elements in both a1 and a2. The only constraint on a1 and a2 is that they have the same number of elements (but not necessarily the same shape or type).
Generates an n x n correlation matrix, c, where c[i,j] = A_Correlation(ai,aj). The only constraint on the ai's is that they all have the same number of elements (but not necessarily the same shape or type).
Generates an n x n covariance matrix, c, where c[i,j] = A_Covariance(ai,aj). The only constraint on the ai's is that they all have the same number of elements (but not necessarily the same shape or type).
Generates an n x n normalized correlation matrix, c, where c[i,j] = A_Pearson_Correlation(ai,aj). The only constraint on the ai's is that they all have the same number of elements (but not necessarily the same shape or type).
Linear regression generates an n-element vector of coefficients, c, such that the least squares distance between obs and the c-weighted sum of the ai's is minimal, that is, Σt (obs[t] - (c[0]*a1[t] + ... + c[n-1]*an[t]))2 is minimized. The routine will return statistics for the regression in the Regression_Bundle pointed at by stats if and only if it is not NULL. If the arrays pointed at by the fields std_err and/or t_stat within this bundle are NULL on entrance, then vectors of the appropriate size are created, otherwise the arrays they point to are converted to n-element Double_Vectors if they are not already thus, and then filled in with the desired values. The caller is responsible for freeing or killing these arrays.
Simple_Regression returns a pointer to a 2-element Double_Vector, c, that minimizes the sum: Σt (obs[t] - (c[0] + c[1] * inp[t]))2 If vector is NULL then a 2-element Double_Vector is generated and returned as c, otherwise the vector is converted to a 2-element Double_Vector if it is not already one and then returned as c. The point of passing vector rather than generating a Double_Vector containing c, is that if one wants to solve, say thousands of such regressions, then one can generate a 2-element double vector at the start, and then reuse it for each call. This saves time in the regression routine as an Array object need neither be created or re-shaped and re-typed. The routine will return statistics for the regression in the Regression_Bundle pointed at by stats if and only if it is not NULL. If the arrays pointed at by the fields std_err and/or t_stat within this bundle are NULL on entrance, then 2-element Double_Vectors are generated, otherwise they are converted to 2-element Double_Vectors if they are not already thus, and then filled in with the desired values. The caller is responsible for freeing or killing these arrays. |


Dinosaurs
Excited about dinosaurs? Look no further!
Our comprehensive guide covers most popular types of dinosaurs.
Triceratops
tri-SERRA-tops
Name meaning:'three-horned face'
Triceratops was a plant-eater with specialised teeth for cutting and slicing and a huge stomach for digesting tough plant matter. It would have used its horns for defending itself from predators like Tyrannosaurus.
Stegosaurus
STEG-oh-SORE-us
Name meaning:'roof lizard'
This slow-moving plant-eater used spikes on its tail to fend off would-be predators. The jury is still out on what the spiny plates on its back were used for.
Tyrannosaurus
tie-RAN-oh-sore-us
Name meaning:'tyrant lizard'
An infamous meat-eating predator. Look at the evidence as to whether Tyrannosaurus hunted in packs or alone.
Diplodocus
DIP-low DOCK-us
Name meaning:'double beam'
The Museum's cast of a Diplodocus skeleton is on a tour around the UK. What did this giant look like and how did it hold its enormous neck?
Coelophysis
seel-OH-fie-sis
Name meaning:'hollow form'
This small meat-eater was one of the earliest dinosaurs. It was fast and agile and would have fed on animals like small reptiles and insects.
Achillobator
a-kil-oh-bah-tor
Name meaning:
'Achilles hero' 5.0m-long
large theropod.
Barapasaurus
Barapasaurus was a primitive but very large sauropod.
Centrosaurus
Centrosaurus had one horn on its snout and spines around the back of its neck frill.
Dromiceiomimus
- Diet: omnivorous omnivorous food icon
- Country:Canada
- Period:Late Cretaceous, 74-70 million years ago
- Teeth:horny beak
- How it moved:on 2 legs
- Food: plants, possibly insects and animals too Dromiceiomimus looked very like a modern ostrich, but without the thick layer of feathers (it may have had some feathers).
Erketu
Erketu is known from articulated cervical vertebrae (backbone), a sternal plate (breastbone) and an articulated lower leg.


NodeActionsMixin Class
Controller mixin that implements common actions performed on nodes.
Item Index
Methods
Properties
Methods
_affiliateNode
-
node
-
institution
Helper method that affiliates an institution with a node.
Returns:
Returns a promise that resolves to the updated node with the newly created institution relationship
addChild
-
title
-
description
-
category
Add a child (component) to a node.
Parameters:
Returns:
Returns a promise that resolves to the newly created child node.
addContributor
-
userId
-
permission
-
isBibliographic
-
sendEmail
Add a contributor to a node
Parameters:
-
userId
StringID of user that will be a contributor on the node
-
permission
StringUser permission level. One of "read", "write", or "admin". Default: "write".
-
isBibliographic
BooleanWhether user will be included in citations for the node. "default: true"
-
sendEmail
BooleanWhether user will receive an email when added. "default: true"
Returns:
Returns a promise that resolves to the newly created contributor object.
addContributors
-
contributors
-
sendEmail
Bulk add contributors to a node
Parameters:
Returns:
Returns a promise that resolves to an array of added contributors
addNodeLink
-
targetNodeId
Adds a relationship to another node, called a linkedNode.
Parameters:
-
targetNodeId
StringID of the node for which you wish to create a link
Returns:
Returns a promise that resolves to the newly updated node
affiliateNode
-
institutionId
Affiliate a node with an institution
Parameters:
-
institutionId
StringID of the institutution to be affiliated
Returns:
Returns a promise that resolves to the updated node with the newly affiliated institution relationship
deleteNode
()
Promise
Delete a node
Returns:
Returns a promise that resolves after the deletion of the node.
removeContributor
-
contributor
Remove a contributor from a node
Parameters:
-
contributor
ObjectContributor relationship that will be removed from node
Returns:
Returns a promise that will resolve upon contributor deletion. User itself will not be removed.
removeNodeLink
-
linkedNode
Removes the linkedNode relationship to another node. Does not remove the linked node itself.
Parameters:
-
linkedNode
ObjectlinkedNode relationship to be destroyed.
Returns:
Returns a promise that resolves to the newly updated node
reorderContributors
-
contributor
-
newIndex
-
contributors
Reorder contributors on a node, and manually updates store.
Parameters:
Returns:
Returns a promise that resolves to the updated contributor.
unaffiliateNode
-
institution
Unaffiliate a node with an institution
Parameters:
-
institution
ObjectInstitution relationship to be removed from node
Returns:
Returns a promise that resolves to the updated node with the affiliated institution relationship removed.
updateContributor
-
contributor
-
permissions
-
bibliographic
Update contributors of a node. Makes a bulk request to the APIv2.
Parameters:
-
contributor
Contributorrelationship on the node.
-
permissions
Stringdesired permissions.
-
bibliographic
Booleandesired bibliographic statuses
Returns:
Returns a promise that resolves to the updated node with edited contributor relationships.
updateContributors
-
contributors
-
permissionsChanges
-
bibliographicChanges
Update contributors of a node. Makes a bulk request to the APIv2.
Parameters:
-
contributors
Contributor[]Contributor relationships on the node.
-
permissionsChanges
ObjectDictionary mapping contributor ids to desired permissions.
-
bibliographicChanges
ObjectDictionary mapping contributor ids to desired bibliographic statuses
Returns:
Returns a promise that resolves to the updated node with edited contributor relationships.


Home
Company
Contact
About
<
Name
Create a username
Create a password
Confirm your password
Birthday
Month
January
February
March
April
May
June
July
August
September
October
November
December
Day
Year
i am..
Male
Female
Other
Mobile phone


High Scores
JavaScript Quiz
Timer:
0
Previous High Score
Click the button to begin!
Start!
Question 1
- A -
Answer A
- B -
Answer B
- C -
Answer C
- D -
Answer D
High Scores:
Clear Scores


{% extends "base.html" %} {% block title %}Vortext | Your Twitter links{% endblock %} {% block description %}Vortext | List, filter, and organize all the links you've posted to Twitter{% endblock %} {% block content %}


It has been extended to much larger ranges and some extensions have been programmed to make it faster and easier to use at these large ranges. However, there are still mods that could be done to make the calculations faster and to make offline calculations easier. For example, there is no multithreading and adding this would speed up calculations a lot.
1. Get a square section of map centered at the test point and sized by outer radius parameter 2. Loop over pixels in this square section in order 3. Loop over ranges out from the center to the test pixel starting at the min-range parameter stepping 0.5 pixel size iff (pixel elevation > vector elevation) at step, mask test pixel
1. Get a square section of map centered at the test point. The size is determined by the mask size + a guardband The guardband is made big enough so all raytracing will stay within the square. 2. Loop over pixels in the mask in order 3. Loop over ranges out from the test pixel toward the sensor start the vector some elevation above the test pixel (approx 1m) to avoid noise, etc. step just far enough along the vector to get to the next pixel along the path iff (pixel elevation > vector elevation) at step, mask test pixel and stop When you get a fixed elevation above the test pixel, mark test pixel visible and stop Possible improvements: Terminating the raytrace as soon as possible -- as soon as it is sure there is no shadowing -- is important to the speed. 1. Calculate highest elevation in the square section of map and use this to end the search. Probably, this will be relatively low and end the search quickly. However, may be high enough to push search outside the square of the map.
One part of the algorithm is to mark all pixels within a region with a unique value. A region is a group of pixels that are all either visible or shadowed and are 4-neighbors. One starts with a seed pixel, identifies all its neighbors in the region, and adds those neighbors to a list. One goes down the list, for each pixel identifying all its neighbors in the region and adding to the list. When there are no more neighbors, the region is complete.
This algorithm works as follows:
1. Loop around the calculation border and find all shadowed regions that touch the border Mark all these regions with a value (=2) that excludes them from further calculations 2. Loop over all remaining regions, starting with the region around the center point Do all visible regions (=0), then do all shadowed regions (=1) not excluded in step 1. For first region, use center point for seed if possible. Otherwise, search 3. Find all pixels in the region and mark with a unique value 4. From the seed pixel, step right until hitting a pixel outside the region or the boundary 5. Trace the boundary keep the boundary on your right shoulder build a list of boundary vertices When you get back to the first vertex, stop 6. Find a new seed Step in order over the mask looking for the first pixel not already in a region 7. If no new seeds found for visible regions, then start looking for shadowed regions
1. Loop over azimuth angles 2. Trace ray out from center from pixel to pixel along azimuth direction 3. Test mask at each pixel traversed 4. When first obstructed pixel encountered, note length of vector 5. Mark the end of the vector with a point 6. Write as Shapefile
Center height 30m Per height 2m Min range 1m Max range Variable as shown
| Type | No. of pixels | Time(s) | Memory | Notes |
|---|---|---|---|---|
| Ground | 4000x4000 | 436 (7 min) | 1.46 GB | 2km x 2km with 0.5m pixels |
| Ground | 6000x6000 | 1344(22.4 min) | 3km x 3km with 0.5m pixels | |
| Ground | 8000x8000 | 2804(46.7 min) | 4km x 4km with 0.5m pixels | |
| Ground | 10000x10000 | 4686(78.1 min) | 1.44 GB | 5km x 5km with 0.5m pixels |
| Ground | 12000x12000 | 6815 (114 min) | 2.5 GB | 6km x 6km with 0.5m pixels |
| Ground | 14000x14000 | 8757 (146 min) | ? GB | 7km x 7km with 0.5m pixels |
This information can be added to the file using the GDAL metadata construct.
For now, the user should set the parameters in the LOS parameter menu before reading doing any diagnostics.
Obviously the area of the map to be traced must be larger than area of the LOS mask to be generated but this area must be reasonably bounded. To provide a reasonable bound, both a height difference and a max guard width are used. The height difference is 30m. The guard width is set so the map cant be larger than 2 times the mask size.
1. Get filename and add file to texture server From menu -- thru map3d_manager_inv_class::los_cb() texture_server_class::add_mask_file(string filename) OR From Project File -- thru texture_server_class::read_tagged(char* filename) texture_server_class::add_mask_file(string filename) 2. Apply masks texture_server_class::get_texture(...) if (nmask > 0 && imask_current >= 0 && n_intersections > n_intersections_old) apply_masks(...); 3. Clear masks texture_server_class::clear_all_masks()
Hi-res turned off -- replaced by med-res Process atr_los_class calculates mask atr_los_class gets texture resolution from map3d_index dxvox = map3d_index->get_res_roi(); atr_los_class registers mask with map3d_index -- mask array, mask extent map3d_index_class::register_mask(int *mask_in, double north, double east, int ny, int nx) map3d_index_class applies mask map3d_index_class::apply_mask_amp(int data_type)


| Name: ms.sushma | Reg No: 7-10smmhc18 |
|---|---|
| Age / Sex:17/f | Contact No:8618657690 |
| Marital Status:single | Date:6/10/18 |
| Occupation:2nd pu. | Dr. pjfp |
| Address:native of blore. | DIAGNOSIS- |
Tinnitus b/l ears since <while eating cant hear only feels like can hear her own chewing sound much.
Dryness patches on scalp behind ears and inside ears. Itches mild rare. Has lice in scalp also.
Eyesight from 7th standard. Cant see long distance. Blurred vision.
Hairfall since 9th std prior her hair was thick.
Likes potato.
Rx:
Nat mur 1m/sil 1m – 4-4-4-4.
Ferr phos 12x – 4-4-4-4.
staphyQ 20 ml in 100 ml oil – apply for hair night. Wash morning.


Florida Amber Alert for two children
by WFTX Digital TeamFORT LAUDERDALE, Fl. — A Florida Amber Alert has been issued for Lei'Loni McLendon, four months, who was last seen wearing a dark blue, long-sleeve onesie and Devante McLendon Jr., 1, who was last seen wearing a Marvel Comics onesie.
The children were last seen in the area of the 1300 block of NW 5th Ave in Fort Lauderdale. The children may be in the company of Devante McLendon Sr., 23, who may be traveling in a 2020, white Chevrolet Silverado, FL tag number KCUQ09.
If located, do not approach. Contact law enforcement immediately.


Niclas Hedhman - Apache Software Foundation
The Apache Way
The Apache Way is the culture within the Apache Software Foundation, a set of values, principles,
guidelines, and to a lesser degree processes, to ensure strong community engagement over long
periods of time. The Apache Way is about fostering communities of individuals, where company
agendas are pushed to the side and a collaborative spirit is grown in the interest of the community.
It is about Community, rather than Code. It is about a life choice, rather than career opportunity.
It is about growing an extended family.
演讲PPT


a jQuery plugin to build a website on the infinite canvas
but with a different goal in mind. Why keep it behind a podium? Let's make websites!
next >We have contributed and will continue to send pull requests :)
@bartaz has a very specific vision for impress.js which we respect.
Plus he was asked and he said no.
jmpress.js currently includes all of the impress.js features.
Migration from impress.js is possible with only one additional line.
Good news! We accept pull requests ;)
Please work and pull against the dev or beta branch. Thanks!
You can also contribute by writing issues for bugs or features requests.
next >jmpress.js uses the jasmine bdd library for testing. Please load test.html in your browser to run the tests.
next >See more features on beta branch!
next >This steps is nested in another step so it's position is relative to parent (as you know from html/css). This can make is really easy the position steps. You can group up step and move that group alltogether.
it has secondary rotation, which is applied on enter (secondary-plugin).
next >jmpress is not only running in a container, but also nested in another jmpress as container.
(click it to navigate there)
for a presentation
images can be loaded on demand by ajax
As here
NOTICE: Chrome 16 buggy, but fix in Chrome 17, sorry.
homeUse arrow keys to navigate


Varify
The Über Variant Analysis Interface
We Will Be Back Shortly!
We are performing maintenance. Thanks for your patience.


--- layout: page title: About header-img: "img/about-bg.png" ---
After working in the real world for over a decade I've decided to take my hobby of coding to the next level and take some classes to see if this might be a future career path for me.


| PostgreSQL 9.0.10 Documentation | ||||
|---|---|---|---|---|
| Prev | Up | Chapter 27. Monitoring Database Activity | Next |
PostgreSQL's statistics collector is a subsystem that supports collection and reporting of information about server activity. Presently, the collector can count accesses to tables and indexes in both disk-block and individual-row terms. It also tracks the total number of rows in each table, and the last vacuum and analyze times for each table. It can also count calls to user-defined functions and the total time spent in each one.
PostgreSQL also supports reporting of the exact command currently being executed by other server processes. This is an facility independent of the collector process.
Since collection of statistics adds some overhead to query execution, the system can be configured to collect or not collect information. This is controlled by configuration parameters that are normally set in postgresql.conf. (See Chapter 18 for details about setting configuration parameters.)
The parameter track_counts controls whether statistics are collected about table and index accesses.
The parameter track_functions enables tracking of usage of user-defined functions.
The parameter track_activities enables monitoring of the current command being executed by any server process.
Normally these parameters are set in postgresql.conf so that they apply to all server processes, but it is possible to turn them on or off in individual sessions using the SET command. (To prevent ordinary users from hiding their activity from the administrator, only superusers are allowed to change these parameters with SET.)
The statistics collector communicates with the backends needing information (including autovacuum) through temporary files. These files are stored in the pg_stat_tmp subdirectory. When the postmaster shuts down, a permanent copy of the statistics data is stored in the global subdirectory. For increased performance, the parameter stats_temp_directory can be pointed at a RAM-based file system, decreasing physical I/O requirements.
Several predefined views, listed in Table 27-1, are available to show the results of statistics collection. Alternatively, one can build custom views using the underlying statistics functions.
When using the statistics to monitor current activity, it is important to realize that the information does not update instantaneously. Each individual server process transmits new statistical counts to the collector just before going idle; so a query or transaction still in progress does not affect the displayed totals. Also, the collector itself emits a new report at most once per PGSTAT_STAT_INTERVAL milliseconds (500 unless altered while building the server). So the displayed information lags behind actual activity. However, current-query information collected by track_activities is always up-to-date.
Another important point is that when a server process is asked to display
any of these statistics, it first fetches the most recent report emitted by
the collector process and then continues to use this snapshot for all
statistical views and functions until the end of its current transaction.
So the statistics will show static information as long as you continue the
current transaction. Similarly, information about the current queries of
all sessions is collected when any such information is first requested
within a transaction, and the same information will be displayed throughout
the transaction.
This is a feature, not a bug, because it allows you to perform several
queries on the statistics and correlate the results without worrying that
the numbers are changing underneath you. But if you want to see new
results with each query, be sure to do the queries outside any transaction
block. Alternatively, you can invoke
pg_stat_clear_snapshot
(), which will discard the
current transaction's statistics snapshot (if any). The next use of
statistical information will cause a new snapshot to be fetched.
Table 27-1. Standard Statistics Views
| View Name | Description |
|---|---|
| pg_stat_activity | One row per server process, showing database OID, database name, process ID, user OID, user name, application name, client's address and port number, times at which the server process, current transaction, and current query began execution, process's waiting status, and text of the current query. The columns that report data on the current query are available unless the parameter track_activities has been turned off. Furthermore, these columns are only visible if the user examining the view is a superuser or the same as the user owning the process being reported on. |
| pg_stat_bgwriter | One row only, showing cluster-wide statistics from the background writer: number of scheduled checkpoints, requested checkpoints, buffers written by checkpoints and cleaning scans, and the number of times the background writer stopped a cleaning scan because it had written too many buffers. Also includes statistics about the shared buffer pool, including buffers written by backends (that is, not by the background writer) and total buffers allocated. |
| pg_stat_database | One row per database, showing database OID, database name, number of active server processes connected to that database, number of transactions committed and rolled back in that database, total disk blocks read, total buffer hits (i.e., block read requests avoided by finding the block already in buffer cache), number of rows returned, fetched, inserted, updated and deleted. |
| pg_stat_all_tables | For each table in the current database (including TOAST tables), the table OID, schema and table name, number of sequential scans initiated, number of live rows fetched by sequential scans, number of index scans initiated (over all indexes belonging to the table), number of live rows fetched by index scans, numbers of row insertions, updates, and deletions, number of row updates that were HOT (i.e., no separate index update), numbers of live and dead rows, the last time the table was vacuumed manually, the last time it was vacuumed by the autovacuum daemon, the last time it was analyzed manually, and the last time it was analyzed by the autovacuum daemon. |
| pg_stat_sys_tables | Same as pg_stat_all_tables, except that only system tables are shown. |
| pg_stat_user_tables | Same as pg_stat_all_tables, except that only user tables are shown. |
| pg_stat_all_indexes | For each index in the current database, the table and index OID, schema, table and index name, number of index scans initiated on that index, number of index entries returned by index scans, and number of live table rows fetched by simple index scans using that index. |
| pg_stat_sys_indexes | Same as pg_stat_all_indexes, except that only indexes on system tables are shown. |
| pg_stat_user_indexes | Same as pg_stat_all_indexes, except that only indexes on user tables are shown. |
| pg_statio_all_tables | For each table in the current database (including TOAST tables), the table OID, schema and table name, number of disk blocks read from that table, number of buffer hits, numbers of disk blocks read and buffer hits in all indexes of that table, numbers of disk blocks read and buffer hits from that table's auxiliary TOAST table (if any), and numbers of disk blocks read and buffer hits for the TOAST table's index. |
| pg_statio_sys_tables | Same as pg_statio_all_tables, except that only system tables are shown. |
| pg_statio_user_tables | Same as pg_statio_all_tables, except that only user tables are shown. |
| pg_statio_all_indexes | For each index in the current database, the table and index OID, schema, table and index name, numbers of disk blocks read and buffer hits in that index. |
| pg_statio_sys_indexes | Same as pg_statio_all_indexes, except that only indexes on system tables are shown. |
| pg_statio_user_indexes | Same as pg_statio_all_indexes, except that only indexes on user tables are shown. |
| pg_statio_all_sequences | For each sequence object in the current database, the sequence OID, schema and sequence name, numbers of disk blocks read and buffer hits in that sequence. |
| pg_statio_sys_sequences | Same as pg_statio_all_sequences, except that only system sequences are shown. (Presently, no system sequences are defined, so this view is always empty.) |
| pg_statio_user_sequences | Same as pg_statio_all_sequences, except that only user sequences are shown. |
| pg_stat_user_functions | For all tracked functions, function OID, schema, name, number of calls, total time, and self time. Self time is the amount of time spent in the function itself, total time includes the time spent in functions it called. Time values are in milliseconds. |
The per-index statistics are particularly useful to determine which indexes are being used and how effective they are.
Beginning in PostgreSQL 8.1, indexes can be used either directly or via "bitmap scans". In a bitmap scan the output of several indexes can be combined via AND or OR rules; so it is difficult to associate individual heap row fetches with specific indexes when a bitmap scan is used. Therefore, a bitmap scan increments the pg_stat_all_indexes.idx_tup_read count(s) for the index(es) it uses, and it increments the pg_stat_all_tables.idx_tup_fetch count for the table, but it does not affect pg_stat_all_indexes.idx_tup_fetch.
Note: Before PostgreSQL 8.1, the idx_tup_read and idx_tup_fetch counts were essentially always equal. Now they can be different even without considering bitmap scans, because idx_tup_read counts index entries retrieved from the index while idx_tup_fetch counts live rows fetched from the table; the latter will be less if any dead or not-yet-committed rows are fetched using the index.
The pg_statio_ views are primarily useful to determine the effectiveness of the buffer cache. When the number of actual disk reads is much smaller than the number of buffer hits, then the cache is satisfying most read requests without invoking a kernel call. However, these statistics do not give the entire story: due to the way in which PostgreSQL handles disk I/O, data that is not in the PostgreSQL buffer cache might still reside in the kernel's I/O cache, and might therefore still be fetched without requiring a physical read. Users interested in obtaining more detailed information on PostgreSQL I/O behavior are advised to use the PostgreSQL statistics collector in combination with operating system utilities that allow insight into the kernel's handling of I/O.
Other ways of looking at the statistics can be set up by writing queries that use the same underlying statistics access functions as these standard views do. These functions are listed in Table 27-2. The per-database access functions take a database OID as argument to identify which database to report on. The per-table and per-index functions take a table or index OID. The functions for function-call statistics take a function OID. (Note that only tables, indexes, and functions in the current database can be seen with these functions.) The per-server-process access functions take a server process number, which ranges from one to the number of currently active server processes.
Table 27-2. Statistics Access Functions
| Function | Return Type | Description |
|---|---|---|
pg_stat_get_db_numbackends (oid) | integer | Number of active server processes for database |
pg_stat_get_db_xact_commit (oid) | bigint | Number of transactions committed in database |
pg_stat_get_db_xact_rollback (oid) | bigint | Number of transactions rolled back in database |
pg_stat_get_db_blocks_fetched (oid) | bigint | Number of disk block fetch requests for database |
pg_stat_get_db_blocks_hit (oid) | bigint | Number of disk block fetch requests found in cache for database |
pg_stat_get_db_tuples_returned (oid) | bigint | Number of tuples returned for database |
pg_stat_get_db_tuples_fetched (oid) | bigint | Number of tuples fetched for database |
pg_stat_get_db_tuples_inserted (oid) | bigint | Number of tuples inserted in database |
pg_stat_get_db_tuples_updated (oid) | bigint | Number of tuples updated in database |
pg_stat_get_db_tuples_deleted (oid) | bigint | Number of tuples deleted in database |
pg_stat_get_numscans (oid) | bigint | Number of sequential scans done when argument is a table, or number of index scans done when argument is an index |
pg_stat_get_tuples_returned (oid) | bigint | Number of rows read by sequential scans when argument is a table, or number of index entries returned when argument is an index |
pg_stat_get_tuples_fetched (oid) | bigint | Number of table rows fetched by bitmap scans when argument is a table, or table rows fetched by simple index scans using the index when argument is an index |
pg_stat_get_tuples_inserted (oid) | bigint | Number of rows inserted into table |
pg_stat_get_tuples_updated (oid) | bigint | Number of rows updated in table (includes HOT updates) |
pg_stat_get_tuples_deleted (oid) | bigint | Number of rows deleted from table |
pg_stat_get_tuples_hot_updated (oid) | bigint | Number of rows HOT-updated in table |
pg_stat_get_live_tuples (oid) | bigint | Number of live rows in table |
pg_stat_get_dead_tuples (oid) | bigint | Number of dead rows in table |
pg_stat_get_blocks_fetched (oid) | bigint | Number of disk block fetch requests for table or index |
pg_stat_get_blocks_hit (oid) | bigint | Number of disk block requests found in cache for table or index |
pg_stat_get_last_vacuum_time (oid) | timestamptz | Time of the last vacuum initiated by the user on this table |
pg_stat_get_last_autovacuum_time (oid) | timestamptz | Time of the last vacuum initiated by the autovacuum daemon on this table |
pg_stat_get_last_analyze_time (oid) | timestamptz | Time of the last analyze initiated by the user on this table |
pg_stat_get_last_autoanalyze_time (oid) | timestamptz | Time of the last analyze initiated by the autovacuum daemon on this table |
pg_backend_pid() | integer | Process ID of the server process attached to the current session |
pg_stat_get_activity (integer) | setof record | Returns a record of information about the backend with the specified PID, or one record for each active backend in the system if NULL is specified. The fields returned are a subset of those in the pg_stat_activity view. |
pg_stat_get_function_calls (oid) | bigint | Number of times the function has been called |
pg_stat_get_function_time (oid) | bigint | Total wall clock time spent in the function, in microseconds. Includes the time spent in functions called by this one. |
pg_stat_get_function_self_time (oid) | bigint | Time spent in only this function. Time spent in called functions is excluded. |
pg_stat_get_backend_idset() | setof integer | Set of currently active server process numbers (from 1 to the number of active server processes). See usage example in the text. |
pg_stat_get_backend_pid (integer) | integer | Process ID of the given server process |
pg_stat_get_backend_dbid (integer) | oid | Database ID of the given server process |
pg_stat_get_backend_userid (integer) | oid | User ID of the given server process |
pg_stat_get_backend_activity (integer) | text | Active command of the given server process, but only if the current user is a superuser or the same user as that of the session being queried (and track_activities is on) |
pg_stat_get_backend_waiting (integer) | boolean | True if the given server process is waiting for a lock, but only if the current user is a superuser or the same user as that of the session being queried (and track_activities is on) |
pg_stat_get_backend_activity_start (integer) | timestamp with time zone | The time at which the given server process' currently executing query was started, but only if the current user is a superuser or the same user as that of the session being queried (and track_activities is on) |
pg_stat_get_backend_xact_start (integer) | timestamp with time zone | The time at which the given server process' currently executing transaction was started, but only if the current user is a superuser or the same user as that of the session being queried (and track_activities is on) |
pg_stat_get_backend_start (integer) | timestamp with time zone | The time at which the given server process was started, or null if the current user is not a superuser nor the same user as that of the session being queried |
pg_stat_get_backend_client_addr (integer) | inet | The IP address of the client connected to the given server process; null if the connection is over a Unix domain socket, also null if the current user is not a superuser nor the same user as that of the session being queried |
pg_stat_get_backend_client_port (integer) | integer | The TCP port number of the client connected to the given server process; -1 if the connection is over a Unix domain socket, null if the current user is not a superuser nor the same user as that of the session being queried |
pg_stat_get_bgwriter_timed_checkpoints() | bigint | Number of times the background writer has started timed checkpoints (because the checkpoint_timeout time has expired) |
pg_stat_get_bgwriter_requested_checkpoints() | bigint | Number of times the background writer has started checkpoints based on requests from backends because the checkpoint_segments has been exceeded or because the CHECKPOINT command has been issued |
pg_stat_get_bgwriter_buf_written_checkpoints() | bigint | Number of buffers written by the background writer during checkpoints |
pg_stat_get_bgwriter_buf_written_clean() | bigint | Number of buffers written by the background writer for routine cleaning of dirty pages |
pg_stat_get_bgwriter_maxwritten_clean() | bigint | Number of times the background writer has stopped its cleaning scan because it has written more buffers than specified in the bgwriter_lru_maxpages parameter |
pg_stat_get_buf_written_backend() | bigint | Number of buffers written by backends because they needed to allocate a new buffer |
pg_stat_get_buf_alloc() | bigint | Total number of buffer allocations |
pg_stat_clear_snapshot() | void | Discard the current statistics snapshot |
pg_stat_reset() | void | Reset all statistics counters for the current database to zero (requires superuser privileges) |
pg_stat_reset_shared (text) | void | Reset some of the shared statistics counters for the database cluster to zero (requires superuser privileges). Calling pg_stat_reset_shared('bgwriter') will zero all the values shown by pg_stat_bgwriter. |
pg_stat_reset_single_table_counters (oid) | void | Reset statistics for a single table or index in the current database to zero (requires superuser privileges) |
pg_stat_reset_single_function_counters (oid) | void | Reset statistics for a single function in the current database to zero (requires superuser privileges) |
Note:
pg_stat_get_blocks_fetched
minuspg_stat_get_blocks_hit
gives the number of kernelread()
calls issued for the table, index, or database; the number of actual physical reads is usually lower due to kernel-level buffering. The *_blks_read statistics columns use this subtraction, i.e., fetched minus hit.
All functions to access information about backends are indexed by backend id
number, except pg_stat_get_activity
which is indexed by PID.
The function pg_stat_get_backend_idset
provides
a convenient way to generate one row for each active server process. For
example, to show the PIDs and current queries of all server processes:
SELECT pg_stat_get_backend_pid(s.backendid) AS procpid, pg_stat_get_backend_activity(s.backendid) AS current_query FROM (SELECT pg_stat_get_backend_idset() AS backendid) AS s;


|
Research Interests: Computational Math and Statistical Analysis
I have a broad interest in tackling challenging problems where data are high dimensional. In particular, I am interested in Double Descent phenomenon.
I am currently a fourth-year graduate student at Georgia Tech, and I am very fortunate to be advised by Wenjing. Prior to that, I received my bachelor's degree from School of Gifted Young at University of Science and Technology of China (USTC).
Note: Click on [summary] or [highlight] to view summaries or highlight of the papers/projects!
Some of my projects:
Video/Slides of Recent Work
Selected Publications
PDE Identification
Ensemble Dynamics Guided Weak Formulation for Identifying Differential Equations.
Jiahui Cheng, Sungha Kang, Haomin Zhou, Wenjing Liao.
Preprint, 2023
High Dimensional Statistics
High Dimensional Binary Classification under Label Shift: Phase Transition and Regularization.
[arxiv]
[Summary]
Label Shift has been widely believed to be harmful to the generalization performance of machine learning models. Researchers have proposed many approaches to mitigate the impact of the label shift, e.g., balancing the training data. However, these methods often consider the underparametrized regime, where the sample size is much larger than the data dimension. The research under the overparametrized regime is very limited. To bridge this gap, we propose a new asymptotic analysis of the Fisher Linear Discriminant classifier for binary classification with label shift. Specifically, we prove that there exists a phase transition phenomenon: Under certain overparametrized regime, the classifier trained using imbalanced data outperforms the counterpart with reduced balanced data. Moreover, we investigate the impact of regularization to the label shift: The aforementioned phase transition vanishes as the regularization becomes strong.
Jiahui Cheng, Minshuo Chen, Hao Liu, Tuo Zhao, Wenjing Liao.
Sampling Theory, Signal Processing, and Data Analysis, 2022
Inverse Problem
Estimate the spectrum of affine dynamical systems from partial observations of a single trajectory data [arxiv]
[Summary]
In this paper, we study the nonlinear inverse problem of estimating the spectrum of a system matrix, that drives a
finite-dimensional affine dynamical system, from partial observations of a single trajectory data. In the noiseless case, we prove an
annihilating polynomial of the system matrix, whose roots are a subset of the spectrum, can be uniquely determined from data. We then
study which eigenvalues of the system matrix can be recovered and derive various sufficient and necessary conditions to characterize the
relationship between the recoverability of each eigenvalue and the observation locations. We propose various reconstruction algorithms,
with theoretical guarantees, generalizing the classical Prony method, ESPIRIT, and matrix pencil method. We test the algorithms over a
variety of examples with applications to graph signal processing, disease modeling and a real-human motion dataset. The numerical
results validate our theoretical results and demonstrate the effectiveness of the proposed algorithms, even when the data did not follow
an exact linear dynamical system.
Jiahui Cheng, Sui Tang
Inverse Problem, 2021
Solids and Fluids Simulation
Continuum simulation based on Material Point Method
[Summary]
In this thesis, we study the hybrid Eulerian/ Lagrangian Material Point Method (MPM) and propose a new discretization for the weak form
of MPM based on the weak form of force balance and alleviated the energy dissipation. We improve the stability and energy dissipation
compared with MPM and Affine Particle in Cell method. We implemented a Java Graphical User Interface (GUI) for visualization of our
algorithm for snow simulation.
Jiahui Cheng, Weihua Tong
Bachelor's thesis, 2020
|


|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |
| Packages that use Realm | |
|---|---|
| org.apache.shiro.authc.pam | Support for PAM, or Pluggable Authentication Modules, which is
the capability to authenticate a user against multiple configurable (pluggable) modules (Shiro
calls these Realm s). |
| org.apache.shiro.authz | Core interfaces and exceptions supporting Authorization (access control). |
| org.apache.shiro.cas | |
| org.apache.shiro.config | Components that support configuring Shiro in any application. |
| org.apache.shiro.guice | |
| org.apache.shiro.mgt | Provides the master SecurityManager interface and a default implementation
hierarchy for managing all aspects of Shiro's functionality in an application. |
| org.apache.shiro.realm | Components and sub-packages used in supporting the core Realm interface. |
| org.apache.shiro.realm.activedirectory | Realms that acquire security data from a Microsoft Active Directory. |
| org.apache.shiro.realm.jdbc | Realms that acquire security data from an RDBMS (Relational Database Management System) using the JDBC API. |
| org.apache.shiro.realm.jndi | Support for acquiring Realms from JNDI, particularly useful for configuring Shiro in JEE or EJB environments. |
| org.apache.shiro.realm.ldap | Realms that acquire security data from an LDAP (Lightweight Directory Access Protocol) server utilizing LDAP/Naming APIs. |
| org.apache.shiro.realm.text | Realms that acquire security data from text-based data sources such as File s or
text streams. |
| org.apache.shiro.web.mgt | Components supporting web-specific
SecurityManager implementations. |
| Uses of Realm in org.apache.shiro.authc.pam |
|---|
| Methods in org.apache.shiro.authc.pam that return types with arguments of type Realm | |
|---|---|
protected Collection<Realm> |
ModularRealmAuthenticator.getRealms()
Returns the realm(s) used by this Authenticator during an authentication attempt. |
| Methods in org.apache.shiro.authc.pam with parameters of type Realm | |
|---|---|
AuthenticationInfo |
AuthenticationStrategy.afterAttempt(Realm realm,
AuthenticationToken token,
AuthenticationInfo singleRealmInfo,
AuthenticationInfo aggregateInfo,
Throwable t)
Method invoked by the ModularAuthenticator just after the given realm has been consulted for authentication, allowing post-authentication-attempt logic for that realm only. |
AuthenticationInfo |
AllSuccessfulStrategy.afterAttempt(Realm realm,
AuthenticationToken token,
AuthenticationInfo info,
AuthenticationInfo aggregate,
Throwable t)
Merges the specified info into the aggregate argument and returns it (just as the
parent implementation does), but additionally ensures the following:
if the Throwable argument is not null , re-throws it to immediately cancel the
authentication process, since this strategy requires all realms to authenticate successfully.
neither the info or aggregate argument is null to ensure that each
realm did in fact authenticate successfully
|
AuthenticationInfo |
AbstractAuthenticationStrategy.afterAttempt(Realm realm,
AuthenticationToken token,
AuthenticationInfo singleRealmInfo,
AuthenticationInfo aggregateInfo,
Throwable t)
Base implementation that will aggregate the specified singleRealmInfo into the
aggregateInfo and then returns the aggregate. |
AuthenticationInfo |
AuthenticationStrategy.beforeAttempt(Realm realm,
AuthenticationToken token,
AuthenticationInfo aggregate)
Method invoked by the ModularAuthenticator just prior to the realm being consulted for account data, allowing pre-authentication-attempt logic for that realm only. |
AuthenticationInfo |
AllSuccessfulStrategy.beforeAttempt(Realm realm,
AuthenticationToken token,
AuthenticationInfo info)
Because all realms in this strategy must complete successfully, this implementation ensures that the given Realm supports the given
token argument. |
AuthenticationInfo |
AbstractAuthenticationStrategy.beforeAttempt(Realm realm,
AuthenticationToken token,
AuthenticationInfo aggregate)
Simply returns the aggregate method argument, without modification. |
protected AuthenticationInfo |
ModularRealmAuthenticator.doSingleRealmAuthentication(Realm realm,
AuthenticationToken token)
Performs the authentication attempt by interacting with the single configured realm, which is significantly simpler than performing multi-realm logic. |
| Method parameters in org.apache.shiro.authc.pam with type arguments of type Realm | |
|---|---|
AuthenticationInfo |
FirstSuccessfulStrategy.beforeAllAttempts(Collection<? extends Realm> realms,
AuthenticationToken token)
Returns null immediately, relying on this class's merge implementation to return
only the first info object it encounters, ignoring all subsequent ones. |
AuthenticationInfo |
AuthenticationStrategy.beforeAllAttempts(Collection<? extends Realm> realms,
AuthenticationToken token)
Method invoked by the ModularAuthenticator signifying that the authentication process is about to begin for the specified token - called before any Realm is actually invoked. |
AuthenticationInfo |
AbstractAuthenticationStrategy.beforeAllAttempts(Collection<? extends Realm> realms,
AuthenticationToken token)
Simply returns new , which supports
aggregating account data across realms. |
protected AuthenticationInfo |
ModularRealmAuthenticator.doMultiRealmAuthentication(Collection<Realm> realms,
AuthenticationToken token)
Performs the multi-realm authentication attempt by calling back to a AuthenticationStrategy object
as each realm is consulted for AuthenticationInfo for the specified token . |
void |
ModularRealmAuthenticator.setRealms(Collection<Realm> realms)
Sets all realms used by this Authenticator, providing PAM (Pluggable Authentication Module) configuration. |
| Uses of Realm in org.apache.shiro.authz |
|---|
| Fields in org.apache.shiro.authz with type parameters of type Realm | |
|---|---|
protected Collection<Realm> |
ModularRealmAuthorizer.realms
The realms to consult during any authorization check. |
| Methods in org.apache.shiro.authz that return types with arguments of type Realm | |
|---|---|
Collection<Realm> |
ModularRealmAuthorizer.getRealms()
Returns the realms wrapped by this Authorizer which are consulted during an authorization check. |
| Method parameters in org.apache.shiro.authz with type arguments of type Realm | |
|---|---|
void |
ModularRealmAuthorizer.setRealms(Collection<Realm> realms)
Sets the realms wrapped by this Authorizer which are consulted during an authorization check. |
| Constructor parameters in org.apache.shiro.authz with type arguments of type Realm | |
|---|---|
ModularRealmAuthorizer(Collection<Realm> realms)
Constructor that accepts the Realm s to consult during an authorization check. |
| Uses of Realm in org.apache.shiro.cas |
|---|
| Classes in org.apache.shiro.cas that implement Realm | |
|---|---|
class |
CasRealm
This realm implementation acts as a CAS client to a CAS server for authentication and basic authorization. |
| Uses of Realm in org.apache.shiro.config |
|---|
| Methods in org.apache.shiro.config that return Realm | |
|---|---|
protected Realm |
IniSecurityManagerFactory.createRealm(Ini ini)
Creates a Realm from the Ini instance containing account data. |
| Method parameters in org.apache.shiro.config with type arguments of type Realm | |
|---|---|
protected void |
IniSecurityManagerFactory.applyRealmsToSecurityManager(Collection<Realm> realms,
SecurityManager securityManager)
|
| Uses of Realm in org.apache.shiro.guice |
|---|
| Methods in org.apache.shiro.guice that return types with arguments of type Realm | |
|---|---|
protected com.google.inject.binder.LinkedBindingBuilder<Realm> |
ShiroModule.bindRealm()
This is the preferred manner to bind a realm. |
| Uses of Realm in org.apache.shiro.mgt |
|---|
| Methods in org.apache.shiro.mgt that return types with arguments of type Realm | |
|---|---|
Collection<Realm> |
RealmSecurityManager.getRealms()
Returns the Realm s managed by this SecurityManager instance. |
| Methods in org.apache.shiro.mgt with parameters of type Realm | |
|---|---|
void |
RealmSecurityManager.setRealm(Realm realm)
Convenience method for applications using a single realm that merely wraps the realm in a list and then invokes the RealmSecurityManager.setRealms(java.util.Collection method. |
| Method parameters in org.apache.shiro.mgt with type arguments of type Realm | |
|---|---|
void |
RealmSecurityManager.setRealms(Collection<Realm> realms)
Sets the realms managed by this SecurityManager instance. |
| Constructors in org.apache.shiro.mgt with parameters of type Realm | |
|---|---|
DefaultSecurityManager(Realm singleRealm)
Supporting constructor for a single-realm application. |
| Constructor parameters in org.apache.shiro.mgt with type arguments of type Realm | |
|---|---|
DefaultSecurityManager(Collection<Realm> realms)
Supporting constructor for multiple realms . |
| Uses of Realm in org.apache.shiro.realm |
|---|
| Classes in org.apache.shiro.realm that implement Realm | |
|---|---|
class |
AuthenticatingRealm
A top-level abstract implementation of the Realm interface that only implements authentication support (log-in) operations and leaves authorization (access control) behavior to subclasses. |
class |
AuthorizingRealm
An AuthorizingRealm extends the AuthenticatingRealm 's capabilities by adding Authorization
(access control) support. |
class |
CachingRealm
A very basic abstract extension point for the Realm interface that provides caching support for subclasses. |
class |
SimpleAccountRealm
A simple implementation of the Realm interface that
uses a set of configured user accounts and roles to support authentication and authorization. |
| Methods in org.apache.shiro.realm that return types with arguments of type Realm | |
|---|---|
Collection<Realm> |
RealmFactory.getRealms()
Returns a collection of Realm instances that will be used to construct
the application's SecurityManager instance. |
| Uses of Realm in org.apache.shiro.realm.activedirectory |
|---|
| Classes in org.apache.shiro.realm.activedirectory that implement Realm | |
|---|---|
class |
ActiveDirectoryRealm
A Realm that authenticates with an active directory LDAP
server to determine the roles for a particular user. |
| Uses of Realm in org.apache.shiro.realm.jdbc |
|---|
| Classes in org.apache.shiro.realm.jdbc that implement Realm | |
|---|---|
class |
JdbcRealm
Realm that allows authentication and authorization via JDBC calls. |
| Uses of Realm in org.apache.shiro.realm.jndi |
|---|
| Methods in org.apache.shiro.realm.jndi that return types with arguments of type Realm | |
|---|---|
Collection<Realm> |
JndiRealmFactory.getRealms()
Performs the JNDI lookups for each specified JNDI name and returns all
discovered Realms in an ordered collection. |
| Uses of Realm in org.apache.shiro.realm.ldap |
|---|
| Classes in org.apache.shiro.realm.ldap that implement Realm | |
|---|---|
class |
AbstractLdapRealm
A Realm that authenticates with an LDAP
server to build the Subject for a user. |
class |
JndiLdapRealm
An LDAP Realm implementation utilizing Sun's/Oracle's
JNDI API as an LDAP API. |
| Uses of Realm in org.apache.shiro.realm.text |
|---|
| Classes in org.apache.shiro.realm.text that implement Realm | |
|---|---|
class |
IniRealm
A Realm implementation that creates
SimpleAccount instances based on
Ini configuration. |
class |
PropertiesRealm
A TextConfigurationRealm that defers all logic to the parent class, but just enables
Properties based configuration in addition to the parent class's String configuration. |
class |
TextConfigurationRealm
A SimpleAccountRealm that enables text-based configuration of the initial User, Role, and Permission objects created at startup. |
| Uses of Realm in org.apache.shiro.web.mgt |
|---|
| Constructors in org.apache.shiro.web.mgt with parameters of type Realm | |
|---|---|
DefaultWebSecurityManager(Realm singleRealm)
|
| Constructor parameters in org.apache.shiro.web.mgt with type arguments of type Realm | |
|---|---|
DefaultWebSecurityManager(Collection<Realm> realms)
|
|
||||||||||
| PREV NEXT | FRAMES NO FRAMES |


THE AMERICAN PRESIDENT A film review by Michael John Legeros Copyright 1995 Michael John Legeros
(Columbia) Directed by Rob Reiner Written by Aaron Sorkin Cast Michael Douglas, Annette Bening, Martin Sheen, Michael J. Fox, Richard Dreyfuss Running Time 123 minutes MPAA Rating "PG-13" Reviewed at General Cinemas at Pleasant Valley, Raleigh (11NOV95)
==
A widowed Chief Executive starts dating again. That's the deceptively straight-forward set-up of this crowd-pleasing romantic comedy from director Rob Reiner (WHEN HARRY MET SALLY). The new girlfriend is Sydney Ellen Wade (Annette Bening), an environmental lobbyist who finds herself flustered, and later charmed by Democratic President Andrew Sheperd (Michael Douglas). Together, they fumble through the implications of White House dating, which includes an upcoming election year and a series of ugly character attacks from Senate Minority Leader Robert Rumson (Richard Dreyfuss).
As written by Aaron Sorkin, THE AMERICAN PRESIDENT is less about politics than about two people falling in love under extraordinary circumstances. The story does, however, provide a fascinating, behind-the-scenes glimpse into the daily activities of the Chief Executive. He's a very busy man, to say the least, and Sorkin has characterized the "Clintonesque" President as a bit disconnected from his personal life. (His pampered lifestyle and constant dashing away to a crisis reminds of a better-written Bruce Wayne. I wonder how he would look in a rubber suit?)
The political issues are the least successful.(**) A couple of plot points are downright confusing, the character of Bob Rumson is never fully developed, and the big, Frank Capra finale falls a bit flat. No problem. Reiner knows exactly what his assets are, and so he places the greater weight on romance and comedy. And what comedy! Sorkin has written some great lines, here. A wicked reference to the Carolinas is a howl. As is the President's "none of your damn business" phone call. The closing line, though, which I won't reveal here, is by far the best. (All good movies should end with such great lines.)
Sure, the story could be longer, with more substance to balance the weaker political segments, but with both Douglas and Bening virtually *glowing* in their roles, THE AMERICAN PRESIDENT delivers the kind of old-fashioned, cornball romance that makes stepping into these movies so very much fun. Perfect chemistry between the leads, as well as a crack supporting cast that includes Martin Sheen and Michael J. Fox, more than compensates for any deficit spending in the political arena. Watch out at Oscar time.
Grade: A-
**- As are the morality issues. The script makes quite a fuss about "character" and "family values" and, yet, these two lovebirds jump so quickly into the sack that you have wonder exactly *where* Hollywood's logic center is residing, these days. Sigh. I guess even the most old-fashioned of films can't be entirely old-fashioned.
-- Michael J. Legeros - Raleigh, NC<EMAIL_ADDRESS>(h) -<EMAIL_ADDRESS>(w)
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


You completed the daily survey for last {{how_many_days}} days. You earned {{how_much}} for your amazing work.
You earned {{added_fish_points}} points for completing the survey. {{fish_names}}
{{next_fish_names}}


{% extends "orga/mails/base.html" %} {% load bootstrap4 %} {% load i18n %} {% block mail_content %}
{% blocktranslate trimmed %} You can edit the default templates and your custom templates for emails here. If you want to send emails to some or all of your speakers, head over to the "Send Emails" tab. Mails queued for sending are in the "Outbox" tab. {% endblocktranslate %}
{% blocktranslate trimmed %} There are different placeholders available depending on the template type. They are explained in detail once you start editing a template. {% endblocktranslate %}


Register
ALUMNI
COLLEGE ADMIN
Login
Alumni Tracking System
1 / 3
Caption Text
2 / 3
Caption Two
3 / 3
Caption Three
❮
❯
×
Username
Password
Login
Remember me
Cancel
Forgot password?
×
ALUMNI REGISTRATION FORM
Name:
Email:
Phone:
College:
None
Passing Year:
Date of Birth:
Degree:
Reset Form
Register
×
COLLEGE REGISTRATION FORM
College Name:
College Code:
Email:
Phone:
Address:
Pin Code:
First Batch
Passing Year:
Degree:
Reset Form
Register


by Michael Martin / @problogdesign
Each function is its own Lambda instance.
Fresh instance for every function call.
Node, Python, Java, Binary.
An action elsewhere triggers the function
e.g. An API call
100 concurrent calls = 100 instances. Instantly.
Once function executes, the instance goes away. No state before or after.
Permanent changes go to a database etc.
Good design!
export default (event, context) => {
let name = event.body['first_name'];
// must return a promise, a JSON.stringify compatible data, null or nothing.
return {
message: `Hello ${name}!`
}
}
Auth, CORS, response statuses, no code.
No servers. Infinite scale.
Zero downtime deployments. Code to live app in seconds.
Microservices, but better.
Free rollbacks.
(zip files)
$$$ for time used.
(e.g. infrastructure management)
export default (event, context) => {
console.log("Request received:\n", JSON.stringify(event));
console.log("Context received:\n", JSON.stringify(context));
Lot's to learn.
Cloud Formation, IAM, lots of APIs.Support and tooling.
Testing and running locally.
Vendor lock-in (Worth it!)
gulp.task('zip', function() {
return gulp.src(['dist/**/*', '!dist/package.json'])
.pipe(zip('dist.zip'))
.pipe(gulp.dest('./'));
});
gulp.task('upload', function(callback) {
awsLambda.deploy('./dist.zip', require("./lambda-config.js"), callback);
});
Full Gulpfile on Github.


To develop a web app and chrome extension that converts an inputted URL to a humourous Shakespeare quote that can be shared with others.
Product Designer and Backend Developer
We felt that most of the existing URL shorteners create URLs that are hard to memorize. They were also not intuitive to use and weren't quick enough to generate a URL on the go.
We developed a web application and chrome extension based on a local webserver using flask (programmed in Python). We connected a database of of 50 funny Shakespeare quotes and designed the front end in HTML, CSS, Javascript and JQuery. The chrome extension serves the purpose of speeding up the process of generating a custom URL.
The team wanted to create a tool none of us had ever experienced making before. We all agreed that making a Google Chrome extension would be a fun project to do, despite not knowing what it would entail. The function of our extension is simple and fun: after being downloaded to a browser, the user can click on the little Shakespeare icon and find their current browser tab URL embedded within an input field in the pop-up window. By submitting the form the URL is then extended into an Shakespeare quote within the Chrome extension.
The URL, through a basic HTML “_blank” function, is pulled automatically from the active browser tab, as to make the functionality of translating it into an Elizabethan insult quicker for our users. While we had no difficulties to obtain the URL of the current tab in the web browser using Javascript, we found it a bit hard to grab the URL in our Chrome extension. We figured this out by going through the Chrome API to find tab specific Javascript methods for the chrome extension.
We hand-picked 50 witty and snarky Shakespearean quotes and created our database which is a CSV file. Every time the user clicks on Shakespeare Says’ Chrome Extension, one of the quotes is appended to the end of the URL. The Flask server reads in this CSV file on startup and does some basic string processing to deal with encoding issues on the file and remove illegal URL characters to create a list of available insults. When it receives a POST to /create it chooses a random insult.
While we had little difficulty creating the web application, we spent a considerable amount of effort in making our Chrome extension functional and easy to use. Because of the limited number of quotes in our database at present, our extension can only generate 50 unique URLs. One way of scaling up is to add more quotes to the CSV file. Another idea we had but did not get down to implementing was adding a serial number at the end of the quote which would increase with every successive click. This would enable the generation of an infinite number of Shakespearean URLs. Implementation of the serial number concept would, however, require us to move away from the csv approach and into a live database approach, so that the current serial number for each insult could be tracked. While it would be possible to track the numbers in memory and store them in a csv, this would cost a lot in terms of I/O.


Career Profile
A software engineer. I received a bachelor's degree in Joint Studies in Computer Science and Mathematics after studying at the University of Wrocław, Poland.
Education
Finished studied with GPA 4.87. Final exam grade: 5.0 (scale: lowest 2.0, highest 5.0). Maths courses I liked most: Functional Analysis, Probability Theory. CS courses I liked most: Formal Languages and Computational Complexity, Functioanl Programming, Algorithms and Data Structures.
Finished CS/Math/English profiled class. Final exams grades: CS - 100%, Math - 96%, English - 94%. Finalist of Polish Olympiad in Informatics.
Experience
Most code in Java - backend. Implemented monitoring system which collects statistics of running services. Working on updating messages format so that a software update does not cause version incompatibilities.
Programming in C++ and algorithms lessons.
Achievements
Projects
Languages + some projects I worked on.


The fact generator is produced by Baltimore Heritage to help share stories from our Explore Baltimore Heritage website and app. We adapted our fact generator from the original created by WBEZ’s Curious City, an ongoing project that answers the public’s questions about Chicago, the region and its people.
Our Explore Baltimore Heritage stories provide context and history , but we also love juicy factual snippets that grab your attention. The fact generator collects the best in a fun app you can browse anywhere.
Click the “Get new fact!” button to generate a new fact. Find one you want to know more about? Click the link below the fact to learn more. Or, just share the fact with your friends.
Love something you see? Got a beef with one of our facts? Want to learn more? Hit us up: write<EMAIL_ADDRESS>or grab our attention on Twitter @bmoreheritage.


No results were found ...
Please check your spelling or return to the
home page and click on one of the agencies.
This can help you get an idea of the types of records that are in the Index.
You may submit a request for any of the following records in accordance
with applicable public records laws. The departments have included a direct
link to some of the records; if there is no link for the record you are seeking,
and/or you would like to request additional information regarding that record,
please contact the department or division directly using the contact information
provided for that specific record.
{{result._source.title}}
| Department: |
|
{{result._source.department}} |
| Category: |
|
{{result._source.category}} |
| Division: |
|
{{result._source.division}} |
| Contact: |
{{result._source.contact}}
{{result._source.email}}
{{result._source.phone}}
|
| Remarks: |
|
{{result._source.remarks}} |
|
retention type:
{{result._source.retention}}
retained on-site:
{{result._source.on_site}}
retained off-site:
{{result._source.off_site}}
total time retained:
{{result._source.total}}
|


SomethingOrOther Copyright© 2016 Terence Martin
This is where the info text for this prototype goes.
"Who Likes to Party" Kevin MacLeod
(incompetech.com)
Licensed under Creative Commons: By Attribution 3.0
http://creativecommons.org/licenses/by/3.0/


Old password is required
Old password is wrong
New password must not be empty
This filed is required
This field is required


Sorry, you can't message anonymously.
When Anonymous Mode is turned on, all actions that might expose your identity are disabled. In order to ensure this, protect you and to prevent abuse, messaging has been disabled as well. To enable it turn Anonymous Mode off.


Copyright © 2012 Cromwell Enage
Distributed under the Boost Software License, Version 1.0. (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Table of Contents
namespace boost { template <typename InputGraph> bool has_eulerian_cycle(InputGraph const& input_graph); } // namespace boost
For an undirected graph, returns true
if every vertex has an even out-degree and if all of its vertices belong to
a single connected component; for a directed graph, returns true
if the in-degree of every vertex is equal to its out-degree and if all of its
vertices belong to a single strongly connected component; returns false
otherwise.
Last revised: September 09, 2012 at 18:07:14 GMT |


Visual Novel as a Service
{% if novel is not none %}
Novels
> {{ novel.name }} > {% endif %}Characters
ID
Name
Novels
{% for character in character_list %}
{{ character.vndb_id }}
{{ character.name }}
View
{% endfor %}


Forgot Password
Enter your email and we will send you a link to reset your password.
Email is required.
Please, enter a valid email address.
Oh!! I remember my password
Go Back
Go Back
{{app.year}} © {{ app.name }} by {{ app.author }}.


Gulp
Learn how to use the npm scripts included with blogzine to build, compile source code, and more.
Gulp is a toolkit for automating painful or time-consuming tasks in your development workflow, so you can stop messing around and build something great in no time. Please follow the below steps to install and setup all essential:
1. Install node
In order to use Gulp, you will need to download Node JS. If you don't have Node installed in your system, Please download the stable version of Node.js (LTS) NOT the latest.
Download Node JS2. Install Gulp.js Globally
After installing Node on your system you can proceed to Gulp installation. Simply run the command below in your terminal which will install Gulp globally.
npm install gulp-cli -g
Note: If you are using MacOS please use sudo
keyword in the command because they need administrator rights to install Gulp globally. So full command will be sudo npm install gulp-cli -g
3. Install NPM modules
First, change the command line path into your project where blogzine folder is located.
Once the path of your command line is changed to blogzine folder, you may run package.json
file by using the following command:
npm install
It might take a couple of minutes depends on your Internet connection. After successful completion of npm install
command, you will be able to see node_modules folder that Gulp created (Please refer to attached screenshot for final folders your project will contain). Everything is now installed and ready to go!
4. Running Gulp
Now you're ready to start building new pages.  This will track all the sass file changes and start a local webserver.
gulp


--- author: Andre Charland categories: app date: '2009-03-30 22:36:29' link: http://blogs.nitobi.com/andre/index.php/2009/03/30/phonegap-selected-as-a-launch-pad-finalist-at-web-20-expo/ permalink: /2009/03/30/phonegap-selected-as-a-launch-pad-finalist-at-web-2-0-expo/ slug: phonegap-selected-as-a-launch-pad-finalist-at-web-2-0-expo status: publish title: PhoneGap selected as a Launch Pad Finalist at Web 2.0 Expo type: post format: html ---
The whole team at Nitobi is honored to have been picked as one of 5 companies out of 80 to present at the Launch Pad event at Web 2.0 Expo in San Francisco. I get 5 minutes to convince a panel of judges and the crowd (voting in real-time with sms) that PhoneGap is the hottest technology product launching at the event. It's described as "American Idol" for business…no pressure;-)
"For 2009, we continue the tradition of showcasing innovative and promising new companies at Web 2.0 Expo. While the definition of a launch has gotten cloudy in this age of public betas, we're looking for new companies or products that make us take notice. And while venture capital has been the focus in past years, the reality of the market is that companies must gain the attention of customers. So our judging panel and criteria this year focus more on what is essential and transformational in today's market than on ability to get funded. Along the way, we're sure the VCs in the crowd will find several startups they'd like to talk to!"
Good luck to the other presenter and I hope we all manage to provide some value or at least entertainment to the crowd.
The event is at 1:15-2:15pm Thursday April 2nd in the Keynote Room (Ballroom - 3rd Level).
I have 2 free passes is anyone is interested. Just leave a comment or email me.


{{>head}}
Home
Categories
Explore
About us
{{#registered}}
{{/registered}} {{^registered}}
Get Started
{{/registered}}
Explore
{{#registered}}
A specific selection of our plans according to your likes
{{/registered}} {{^registered}}
A selection of our plans for your pleasure
{{/registered}}
{{#Plan}}
{{name}}
{{#admin}}
{{/admin}}
{{description}} {{#registered}}
Start
I won't finish
{{^likedUser}}
{{/likedUser}} {{#likedUser}}
{{/likedUser}}
{{/registered}}
{{/Plan}}
Load more plans
{{>footer}}


This package is a TypeScript and ECMAScript parser. It uses the underlying typescript parser to generate a more or less human readable AST out of .js or .ts files.
After you install the package via:
You can use the parser with:
const parser = new TypescriptParser();
// either:
const parsed = await parser.parseSource(/* typescript source code as string */);
// or a filepath
const parsed = await parser.parseSource('/user/myfile.ts', 'workspace root');
You can also parse multiple files at ones.
To use the declaration index (which is basically a list of symbols for your files) instantiate an index first and throw him some files.
After the parsing is done, you'll get an index with resolved exports and declarations.
Keep in mind, that the index'll only contain exported declarations.
The changelog is generated by semantic release and is located under the release section.
This software is licenced under the MIT licence.
Generated using TypeDoc


Dummy items
Search
firstName:
lastName:
Submit
Pagination information
«
1
(current)
#
firstName
lastName
1.
Firstname
Lastname


VoiceSens Sample Web Application
User Signup
Incorrect syntax.
Your password should be more that 6 characters.
Your passwords don't match.
Next
Record your Voice Samples


Wildfire
Manual
Patroller
Firefighter
Return To Home
Danger Area
Warning Area
Power Station
| # |
Owner |
Power |
Retardant |
State |
| 1 |
Bob |
60% |
80% |
Firefighting |
| 2 |
Pixhawk |
85% |
0% |
Patrolling |
| 3 |
Larry |
15% |
0% |
Return To Home |
| 4 |
Jack |
41% |
60% |
Firefighting |
| 5 |
Gov |
45% |
-- |
Guide |
| 6 |
pika |
99% |
-- |
Patrolling |
| 7 |
BuBuBu |
95% |
-- |
Patrolling |
| 7 |
BuBuBu |
95% |
-- |
Patrolling |
| 8 |
Gov |
95% |
-- |
Patrolling |
| 9 |
Gov |
95% |
-- |
Patrolling |
| 10 |
Gov |
90% |
-- |
Patrolling |
| 11 |
Gov |
55% |
-- |
Patrolling |
| 12 |
Pikachu |
15% |
0% |
Return To Home |
| 13 |
Harry |
14% |
0% |
Return To Home |
| 14 |
Sysu |
120% |
-- |
Patrolling |
| 15 |
YouGangKuo |
120% |
100% |
Firefighting |
| 16 |
WeiHan |
120% |
100% |
Firefighting |
| 17 |
Vincent |
120% |
-- |
Patrolling |
| 18 |
ET760 |
120% |
-- |
Patrolling |


1st paragraph of 1st slide of topCarousel.
1st button anchor of 1st slide of topCarousel
1st paragraph of 2nd slide of topCarousel.
1st button anchor of 2nd slide of topCarousel
1st paragraph of 2rd slide of topCarousel.
1st button anchor of 3rd slide of topCarousel
1st paragraph of 1st slide of botmCarousel.
1st button anchor of 1st slide of botmCarousel
1st paragraph of 2nd slide of botmCarousel.
1st button anchor of 2nd slide of botmCarousel
1st paragraph of 3rd slide of botmCarousel.
1st button anchor of 3rd slide of botmCarousel
1st paragraph of 1st column.
View details of 1st column »
1st paragraph of 2nd column.
View details of 2nd column »
1st paragraph of 3rd column.
View details of 3rd column »
1st paragrahp of 1st featurette.
1st paragrahp of 2nd featurette.
1st paragrahp of 3rd featurette.


MGLT: {{ starship.cargo_capacity }}
Cargo capacity: {{ starship.cargo_capacity }}
Crew: {{ starship.crew }}
Hyperdrive rating: {{ starship.hyperdrive_rating }}
Manufacturer: {{ starship.manufacturer }}
Max atmosphering speed: {{ starship.max_atmosphering_speed }}
Model: {{ starship.model }}
Passengers: {{ starship.passengers }}