Michael Tadesse Lab 1 Page
First, the basics.
The basics
Headings set your default page size
Add your four mochi images from your tutorial here.
Lists
Let's make an unordered list.
- Add an unordered list element
- nest each item inside the unordered list in a list tag
- List elements can be in any order
And now, one in order.
- Add an ordered list element.
- Add your top five music albums in order to the list.
- Check it out, numbers by default.
Inline elements
Sometimes you want to draw attention to something in a line of text.
Sometimes you want to strongly emphasize something in the text.
Sometimes you want to do both.
Empty Elements
Soft line breaks can't wrap anything. Neither can image tags, or hard lines.
Add a hard line under here.
This page probably doesn't look great - we'll learn how to hook it to CSS next week.


A function to simply parameterized reporting
multireport( rmarkdown_file, params_data_frame, report_title_param = 1, report_prefix = "", report_suffix = "", report_title_to_lower = FALSE, report_format = "html_document", report_output_directory = here::here() )
| rmarkdown_file | The RMarkdown file to be rendered |
|---|---|
| params_data_frame | A data frame with all of the parameter options (each variable name is the name of a parameter and all of the rows in that column are the parameter options) |
| report_title_param | The name (in quotes) or column number of the variable to be used to create report titles |
| report_prefix | Text to be put before the file names of rendered reports |
| report_suffix | Text to be put after names of rendered reports |
| report_title_to_lower | TRUE/FALSE (FALSE by default) whether you want the report file names to be lower case (e.g. alabama-report.html vs Alabama-Report.html) |
| report_format | The format of the report (html_document, pdf_document, word_document, etc) |


Let's go to the next slide.
You can go back to previous slide or go to the next slide.
No, really. Try to scroll up and down with the mouse wheel to switch between slides.
You go to previous and next slide, using up and down keyboard arrows.


--- layout: page title: Home weight: 0 ---
Alexander Rush, Harvard University
Time: Mon/Wed 10:30-11:45pm
Location: Pierce 301
| Date | Location | Topic | Materials |
|---|---|---|---|
| Sep. 1, 10-11am (Mark) | Pierce 301 | Math Review (Linear Algebra, Calculus, Probabilistic Theory) | |
| Sep. 4, 5-6pm (Zhirui) | Pierce 301 | Math Review (Linear Algebra, Calculus, Probabilistic Theory) | |
| Sep. 7, 5-6pm (Rachit) | Pierce 320 | Code Review (Python, Numpy, Matplotlib, PyTorch) | |
| Sep. 8, 11-11:59am (Rachit) | MD 223 | Code Review (Python, Numpy, Matplotlib, PyTorch) |
You will form groups of 3 (preferably, for exceptions please ask Sasha) to work on a project. The ideal outcome of this project would be a paper that could be submitted to a top-tier natural language or machine learning conference such as ACL, EMNLP, NIPS, ICML, or UAI. There are different ways to approach this project, which are discussed in a more comprehensive document that is available on the course website. There are four separate components of the project.
You will upload these materials via Canvas. Please see the syllabus (linked in the course website) for a more thorough description of the final project and policies related to collaboration, etc.
| Date | Due | Descriptions |
|---|---|---|
| March 27 | Abstract and Status Report | This is a three to four page document that contains a draft of your final abstract, as well as a brief status report on the progress of your project. |
| May 13 | Final Report | You will write a report of up to ten pages, in the style of a mainstream CS conference paper. Please use the provided template (see here) |
Our syllabus this semester consists of two parts. The first part of the semester will be an accelerated background on applied deep learning for natural language processing with a series of Kaggle competitions. The second part of the semester will consist of student led paper presentations on the topic of text generation and transfer.
| Date | Area | Topic | Demos | Required Readings | Assignment |
|---|---|---|---|---|---|
| {{site.data.all.dates[forloop.index]}} | {{lecture.topic | default("",true)}} | {{lecture.subtopic|default("", true)}} | {{lecture.demos|default("", true)}} |
{% if lecture.papers %}
|
{{lecture.hw | default("",true)}} |


Completed -- Ready for Living
First of its kind in the area is this beautifully architectural townhouse designed ready to meet today's modern living standards.
Enter to find high ceiling and flowing ceramic floors leading to a designer kitchen with premium "Miele" appliances, engineered stone bench tops with matching splash back, ceiling high cabinetry, plenty of draws and cupboard storage.
This townhouse is clever in design to offer a study nook (N type only), comnbined dining and living areas opening out to a private court yard. Upstairs has plush carpet flooring and 3 good size bedrooms.
Rooms services with air conditioning ready to cater for the summer days.
Centrally located are common BBQ facilities and family play areas, Quality Schools, Algester Sport Center, Public Transports, Calamvale Central Shopping Centre and IGA supermarket.
Notes:
- - This is a truly chic design home and having the sesired North South facing entrances thownhouses is a must see.
- - $20,000 off, for the First homw owner's grant plus stamp duty incentives will make this a great opportunity for first home buyers, overseas investors' and property investors to buy today.
Contact Us
Manager Contact: 0478 064 346
Email:
<EMAIL_ADDRESS>Contact Hours:
9 am to 11 pm Saturday


Save and Back to List
Save and Go to View
Cancel
Data Browser Design
ID
Connection
Free Text Query
Description
Query Type
Table
Query Text
Builder


Help Support This Fund!
Donate Now
Donate Again!
You are subscribed to this endowment.
Unsubscribe
Total Fund balance:
Number of donors:
Benefit Charities:


Crypto twitter has been longing this all the way down for two years
And now suddenly most people want to shorts #Alts And call you crazy for longing them meanwhile $ADA up 10% last couple of days
Yer think I will take my chances.
same as BTC at $ 3200
actionslacks07-Sep-19 04:44 PM
has ADA released anything yet?
Markus07-Sep-19 04:44 PM
i bought btc at 3000$ on localbitcoins with my local currency


Module bint
lua-bint - v0.4.0 - 20/Jan/2022 Eduardo Bart -<EMAIL_ADDRESS>https://github.com/edubart/lua-bint
Small portable arbitrary-precision integer arithmetic library in pure Lua for computing with large integers.
Different from most arbitrary-precision integer libraries in pure Lua out there this one uses an array of lua integers as underlying data-type in its implementation instead of using strings or large tables, this make it efficient for working with fixed width integers and to make bitwise operations.
Design goals
The main design goal of this library is to be small, correct, self contained and use few resources while retaining acceptable performance and feature completeness.
The library is designed to follow recent Lua integer semantics, this means that integer overflow warps around, signed integers are implemented using two-complement arithmetic rules, integer division operations rounds towards minus infinity, any mixed operations with float numbers promotes the value to a float, and the usual division/power operation always promotes to floats.
The library is designed to be possible to work with only unsigned integer arithmetic when using the proper methods.
All the lua arithmetic operators (+, -, *, //, /, %) and bitwise operators (&, |, ~, <<, >>) are implemented as metamethods.
The integer size must be fixed in advance and the library is designed to be more efficient when working with integers of sizes between 64-4096 bits. If you need to work with really huge numbers without size restrictions then use another library. This choice has been made to have more efficiency in that specific size range.
Usage
First on you should require the bint file including how many bits the bint module will work with, by calling the returned function from the require, for example:
local bint = require 'bint'(1024)
For more information about its arguments see newmodule. Then when you need create a bint, you can use one of the following functions:
- bint.fromuinteger (convert from lua integers, but read as unsigned integer)
- bint.frominteger (convert from lua integers, preserving the sign)
- bint.frombase (convert from arbitrary bases, like hexadecimal)
- bint.trunc (convert from lua numbers, truncating the fractional part)
- bint.new (convert from anything, asserts on invalid integers)
- bint.tobint (convert from anything, returns nil on invalid integers)
- bint.parse (convert from anything, returns a lua number as fallback)
- bint.zero
- bint.one
- bint
You can also call bint as it is an alias to bint.new. In doubt use bint.new to create a new bint.
Then you can use all the usual lua numeric operations on it, all the arithmetic metamethods are implemented. When you are done computing and need to get the result, get the output from one of the following functions:
- bint.touinteger (convert to a lua integer, wraps around as an unsigned integer)
- bint.tointeger (convert to a lua integer, wraps around, preserves the sign)
- bint.tonumber (convert to lua float, losing precision)
- bint.tobase (convert to a string in any base)
- bint.__tostring (convert to a string in base 10)
To output a very large integer with no loss you probably want to use bint.tobase or call tostring to get a string representation.
Precautions
All library functions can be mixed with lua numbers, this makes easy to mix operations between bints and lua numbers, however the user should take care in some situations:
- Don't mix integers and float operations if you want to work with integers only.
- Don't use the regular equal operator ('==') to compare values from this library, unless you know in advance that both values are of the same primitive type, otherwise it will always return false, use bint.eq to be safe.
- Don't pass fractional numbers to functions that an integer is expected
- Don't mix operations between bint classes with different sizes as this is not supported, this will throw assertions.
- Remember that casting back to lua integers or numbers precision can be lost.
- For dividing while preserving integers use the bint.__idiv (the '//' operator).
- For doing power operation preserving integers use the bint.ipow function.
- Configure the proper integer size you intend to work with, otherwise large integers may wrap around.
Functions
| newmodule (bits[, wordbits]) | Create a new bint module representing integers of the desired bit size. |
| zero () | Create a new bint with 0 value. |
| one () | Create a new bint with 1 value. |
| fromuinteger (x) | Create a bint from an unsigned integer. |
| frominteger (x) | Create a bint from a signed integer. |
| frombase (s[, base]) | Create a bint from a string of the desired base. |
| new (x) | Create a new bint from a value. |
| tobint (x[, clone]) | Convert a value to a bint if possible. |
| parse (x[, clone]) | Convert a value to a bint if possible otherwise to a lua number. |
| touinteger (x) | Convert a bint to an unsigned integer. |
| tointeger (x) | Convert a bint to a signed integer. |
| tonumber (x) | Convert a bint to a lua float in case integer would wrap around or lua integer otherwise. |
| tobase (x[, base[, unsigned]]) | Convert a bint to a string in the desired base. |
| iszero (x) | Check if a number is 0 considering bints. |
| isone (x) | Check if a number is 1 considering bints. |
| isminusone (x) | Check if a number is -1 considering bints. |
| isbint (x) | Check if the input is a bint. |
| isintegral (x) | Check if the input is a lua integer or a bint. |
| isnumeric (x) | Check if the input is a bint or a lua number. |
| type (x) | Get the number type of the input (bint, integer or float). |
| isneg (x) | Check if a number is negative considering bints. |
| ispos (x) | Check if a number is positive considering bints. |
| iseven (x) | Check if a number is even considering bints. |
| isodd (x) | Check if a number is odd considering bints. |
| maxinteger () | Create a new bint with the maximum possible integer value. |
| mininteger () | Create a new bint with the minimum possible integer value. |
| _shlone () | Bitwise left shift a bint in one bit (in-place). |
| _shrone () | Bitwise right shift a bint in one bit (in-place). |
| _inc () | Increment a bint by one (in-place). |
| inc (x) | Increment a number by one considering bints. |
| _dec () | Decrement a bint by one (in-place). |
| dec (x) | Decrement a number by one considering bints. |
| _assign (y) | Assign a bint to a new value (in-place). |
| _abs () | Take absolute of a bint (in-place). |
| abs (x) | Take absolute of a number considering bints. |
| floor (x) | Take the floor of a number considering bints. |
| ceil (x) | Take ceil of a number considering bints. |
| bwrap (x, y) | Wrap around bits of an integer (discarding left bits) considering bints. |
| brol (x, y) | Rotate left integer x by y bits considering bints. |
| bror (x, y) | Rotate right integer x by y bits considering bints. |
| trunc (x) | Truncate a number to a bint. |
| max (x, y) | Take maximum between two numbers considering bints. |
| min (x, y) | Take minimum between two numbers considering bints. |
| _add (y) | Add an integer to a bint (in-place). |
| __add (x, y) | Add two numbers considering bints. |
| _sub (y) | Subtract an integer from a bint (in-place). |
| __sub (x, y) | Subtract two numbers considering bints. |
| __mul (x, y) | Multiply two numbers considering bints. |
| __eq (x, y) | Check if bints are equal. |
| eq (x, y) | Check if numbers are equal considering bints. |
| udivmod (x, y) | Perform unsigned division and modulo operation between two integers considering bints. |
| udiv (x, y) | Perform unsigned division between two integers considering bints. |
| umod (x, y) | Perform unsigned integer modulo operation between two integers considering bints. |
| tdivmod (x, y) | Perform integer truncate division and modulo operation between two numbers considering bints. |
| tdiv (x, y) | Perform truncate division between two numbers considering bints. |
| tmod (x, y) | Perform integer truncate modulo operation between two numbers considering bints. |
| idivmod (x, y) | Perform integer floor division and modulo operation between two numbers considering bints. |
| __idiv (x, y) | Perform floor division between two numbers considering bints. |
| __div (x, y) | Perform division between two numbers considering bints. |
| __mod (x, y) | Perform integer floor modulo operation between two numbers considering bints. |
| ipow (x, y) | Perform integer power between two integers considering bints. |
| upowmod (x, y, m) | Perform integer power between two unsigned integers over a modulus considering bints. |
| __pow (x, y) | Perform numeric power between two numbers considering bints. |
| __shl (x, y) | Bitwise left shift integers considering bints. |
| __shr (x, y) | Bitwise right shift integers considering bints. |
| _band (y) | Bitwise AND bints (in-place). |
| __band (x, y) | Bitwise AND two integers considering bints. |
| _bor (y) | Bitwise OR bints (in-place). |
| __bor (x, y) | Bitwise OR two integers considering bints. |
| _bxor (y) | Bitwise XOR bints (in-place). |
| __bxor (x, y) | Bitwise XOR two integers considering bints. |
| _bnot () | Bitwise NOT a bint (in-place). |
| __bnot (x) | Bitwise NOT a bint. |
| _unm () | Negate a bint (in-place). |
| __unm (x) | Negate a bint. |
| ult (x, y) | Compare if integer x is less than y considering bints (unsigned version). |
| ule (x, y) | Compare if bint x is less or equal than y considering bints (unsigned version). |
| __lt (x, y) | Compare if number x is less than y considering bints and signs. |
| __le (x, y) | Compare if number x is less or equal than y considering bints and signs. |
| __tostring () | Convert a bint to a string on base 10. |
Fields
| bits | Number of bits representing a bint instance. |
Functions
- newmodule (bits[, wordbits])
-
Create a new bint module representing integers of the desired bit size.
This is the returned function when
require 'bint'
is called.Parameters:
- bits Number of bits for the integer representation, must be multiple of wordbits and at least 64.
- wordbits Number of the bits for the internal word, defaults to half of Lua's integer size. (optional)
- zero ()
- Create a new bint with 0 value.
- one ()
- Create a new bint with 1 value.
- fromuinteger (x)
-
Create a bint from an unsigned integer.
Treats signed integers as an unsigned integer.
Parameters:
- x A value to initialize from convertible to a lua integer.
Returns:
-
A new bint or nil in case the input cannot be represented by an integer.
See also:
- frominteger (x)
-
Create a bint from a signed integer.
Parameters:
- x A value to initialize from convertible to a lua integer.
Returns:
-
A new bint or nil in case the input cannot be represented by an integer.
See also:
- frombase (s[, base])
-
Create a bint from a string of the desired base.
Parameters:
- s The string to be converted from, must have only alphanumeric and '+-' characters.
- base Base that the number is represented, defaults to 10. Must be at least 2 and at most 36. (optional)
Returns:
-
A new bint or nil in case the conversion failed.
- new (x)
-
Create a new bint from a value.
Parameters:
- x A value convertible to a bint (string, number or another bint).
Returns:
-
A new bint, guaranteed to be a new reference in case needed.
Raises:
An assert is thrown in case x is not convertible to a bint.See also:
- tobint (x[, clone])
-
Convert a value to a bint if possible.
Parameters:
- x A value to be converted (string, number or another bint).
- clone A boolean that tells if a new bint reference should be returned. Defaults to false. (optional)
Returns:
-
A bint or nil in case the conversion failed.
See also:
- parse (x[, clone])
-
Convert a value to a bint if possible otherwise to a lua number.
Useful to prepare values that you are unsure if it's going to be an integer or float.
Parameters:
- x A value to be converted (string, number or another bint).
- clone A boolean that tells if a new bint reference should be returned. Defaults to false. (optional)
Returns:
-
A bint or a lua number or nil in case the conversion failed.
See also:
- touinteger (x)
-
Convert a bint to an unsigned integer.
Note that large unsigned integers may be represented as negatives in lua integers.
Note that lua cannot represent values larger than 64 bits,
in that case integer values wrap around.
Parameters:
- x A bint or a number to be converted into an unsigned integer.
Returns:
-
An integer or nil in case the input cannot be represented by an integer.
See also:
- tointeger (x)
-
Convert a bint to a signed integer.
It works by taking absolute values then applying the sign bit in case needed.
Note that lua cannot represent values larger than 64 bits,
in that case integer values wrap around.
Parameters:
- x A bint or value to be converted into an unsigned integer.
Returns:
-
An integer or nil in case the input cannot be represented by an integer.
See also:
- tonumber (x)
-
Convert a bint to a lua float in case integer would wrap around or lua integer otherwise.
Different from bint.tointeger the operation does not wrap around integers,
but digits precision are lost in the process of converting to a float.
Parameters:
- x A bint or value to be converted into a lua number.
Returns:
-
A lua number or nil in case the input cannot be represented by a number.
See also:
- tobase (x[, base[, unsigned]])
-
Convert a bint to a string in the desired base.
Parameters:
- x The bint to be converted from.
- base Base to be represented, defaults to 10. Must be at least 2 and at most 36. (optional)
- unsigned Whether to output as an unsigned integer. Defaults to false for base 10 and true for others. When unsigned is false the symbol '-' is prepended in negative values. (optional)
Returns:
-
A string representing the input.
Raises:
An assert is thrown in case the base is invalid. - iszero (x)
-
Check if a number is 0 considering bints.
Parameters:
- x A bint or a lua number.
- isone (x)
-
Check if a number is 1 considering bints.
Parameters:
- x A bint or a lua number.
- isminusone (x)
-
Check if a number is -1 considering bints.
Parameters:
- x A bint or a lua number.
- isbint (x)
-
Check if the input is a bint.
Parameters:
- x Any lua value.
- isintegral (x)
-
Check if the input is a lua integer or a bint.
Parameters:
- x Any lua value.
- isnumeric (x)
-
Check if the input is a bint or a lua number.
Parameters:
- x Any lua value.
- type (x)
-
Get the number type of the input (bint, integer or float).
Parameters:
- x Any lua value.
Returns:
-
Returns "bint" for bints, "integer" for lua integers,
"float" from lua floats or nil otherwise.
- isneg (x)
-
Check if a number is negative considering bints.
Zero is guaranteed to never be negative for bints.
Parameters:
- x A bint or a lua number.
- ispos (x)
-
Check if a number is positive considering bints.
Parameters:
- x A bint or a lua number.
- iseven (x)
-
Check if a number is even considering bints.
Parameters:
- x A bint or a lua number.
- isodd (x)
-
Check if a number is odd considering bints.
Parameters:
- x A bint or a lua number.
- maxinteger ()
- Create a new bint with the maximum possible integer value.
- mininteger ()
- Create a new bint with the minimum possible integer value.
- _shlone ()
- Bitwise left shift a bint in one bit (in-place).
- _shrone ()
- Bitwise right shift a bint in one bit (in-place).
- _inc ()
- Increment a bint by one (in-place).
- inc (x)
-
Increment a number by one considering bints.
Parameters:
- x A bint or a lua number to increment.
- _dec ()
- Decrement a bint by one (in-place).
- dec (x)
-
Decrement a number by one considering bints.
Parameters:
- x A bint or a lua number to decrement.
- _assign (y)
-
Assign a bint to a new value (in-place).
Parameters:
- y A value to be copied from.
Raises:
Asserts in case inputs are not convertible to integers. - _abs ()
- Take absolute of a bint (in-place).
- abs (x)
-
Take absolute of a number considering bints.
Parameters:
- x A bint or a lua number to take the absolute.
- floor (x)
-
Take the floor of a number considering bints.
Parameters:
- x A bint or a lua number to perform the floor operation.
- ceil (x)
-
Take ceil of a number considering bints.
Parameters:
- x A bint or a lua number to perform the ceil operation.
- bwrap (x, y)
-
Wrap around bits of an integer (discarding left bits) considering bints.
Parameters:
- x A bint or a lua integer.
- y Number of right bits to preserve.
- brol (x, y)
-
Rotate left integer x by y bits considering bints.
Parameters:
- x A bint or a lua integer.
- y Number of bits to rotate.
- bror (x, y)
-
Rotate right integer x by y bits considering bints.
Parameters:
- x A bint or a lua integer.
- y Number of bits to rotate.
- trunc (x)
-
Truncate a number to a bint.
Floats numbers are truncated, that is, the fractional port is discarded.
Parameters:
- x A number to truncate.
Returns:
-
A new bint or nil in case the input does not fit in a bint or is not a number.
- max (x, y)
-
Take maximum between two numbers considering bints.
Parameters:
- x A bint or lua number to compare.
- y A bint or lua number to compare.
Returns:
-
A bint or a lua number. Guarantees to return a new bint for integer values.
- min (x, y)
-
Take minimum between two numbers considering bints.
Parameters:
- x A bint or lua number to compare.
- y A bint or lua number to compare.
Returns:
-
A bint or a lua number. Guarantees to return a new bint for integer values.
- _add (y)
-
Add an integer to a bint (in-place).
Parameters:
- y An integer to be added.
Raises:
Asserts in case inputs are not convertible to integers. - __add (x, y)
-
Add two numbers considering bints.
Parameters:
- x A bint or a lua number to be added.
- y A bint or a lua number to be added.
- _sub (y)
-
Subtract an integer from a bint (in-place).
Parameters:
- y An integer to subtract.
Raises:
Asserts in case inputs are not convertible to integers. - __sub (x, y)
-
Subtract two numbers considering bints.
Parameters:
- x A bint or a lua number to be subtracted from.
- y A bint or a lua number to subtract.
- __mul (x, y)
-
Multiply two numbers considering bints.
Parameters:
- x A bint or a lua number to multiply.
- y A bint or a lua number to multiply.
- __eq (x, y)
-
Check if bints are equal.
Parameters:
- x A bint to compare.
- y A bint to compare.
- eq (x, y)
-
Check if numbers are equal considering bints.
Parameters:
- x A bint or lua number to compare.
- y A bint or lua number to compare.
- udivmod (x, y)
-
Perform unsigned division and modulo operation between two integers considering bints.
This is effectively the same of bint.udiv and bint.umod.
Parameters:
- x The numerator, must be a bint or a lua integer.
- y The denominator, must be a bint or a lua integer.
Returns:
-
The quotient following the remainder, both bints.
Raises:
Asserts on attempt to divide by zero or if inputs are not convertible to integers.See also:
- udiv (x, y)
-
Perform unsigned division between two integers considering bints.
Parameters:
- x The numerator, must be a bint or a lua integer.
- y The denominator, must be a bint or a lua integer.
Returns:
-
The quotient, a bint.
Raises:
Asserts on attempt to divide by zero or if inputs are not convertible to integers. - umod (x, y)
-
Perform unsigned integer modulo operation between two integers considering bints.
Parameters:
- x The numerator, must be a bint or a lua integer.
- y The denominator, must be a bint or a lua integer.
Returns:
-
The remainder, a bint.
Raises:
Asserts on attempt to divide by zero or if the inputs are not convertible to integers. - tdivmod (x, y)
-
Perform integer truncate division and modulo operation between two numbers considering bints.
This is effectively the same of bint.tdiv and bint.tmod.
Parameters:
- x The numerator, a bint or lua number.
- y The denominator, a bint or lua number.
Returns:
-
The quotient following the remainder, both bint or lua number.
Raises:
Asserts on attempt to divide by zero or on division overflow.See also:
- tdiv (x, y)
-
Perform truncate division between two numbers considering bints.
Truncate division is a division that rounds the quotient towards zero.
Parameters:
- x The numerator, a bint or lua number.
- y The denominator, a bint or lua number.
Returns:
-
The quotient, a bint or lua number.
Raises:
Asserts on attempt to divide by zero or on division overflow. - tmod (x, y)
-
Perform integer truncate modulo operation between two numbers considering bints.
The operation is defined as the remainder of the truncate division
(division that rounds the quotient towards zero).
Parameters:
- x The numerator, a bint or lua number.
- y The denominator, a bint or lua number.
Returns:
-
The remainder, a bint or lua number.
Raises:
Asserts on attempt to divide by zero or on division overflow. - idivmod (x, y)
-
Perform integer floor division and modulo operation between two numbers considering bints.
This is effectively the same of bint.__idiv and bint.__mod.
Parameters:
- x The numerator, a bint or lua number.
- y The denominator, a bint or lua number.
Returns:
-
The quotient following the remainder, both bint or lua number.
Raises:
Asserts on attempt to divide by zero.See also:
- __idiv (x, y)
-
Perform floor division between two numbers considering bints.
Floor division is a division that rounds the quotient towards minus infinity,
resulting in the floor of the division of its operands.
Parameters:
- x The numerator, a bint or lua number.
- y The denominator, a bint or lua number.
Returns:
-
The quotient, a bint or lua number.
Raises:
Asserts on attempt to divide by zero. - __div (x, y)
-
Perform division between two numbers considering bints.
This always casts inputs to floats, for integer division only use bint.__idiv.
Parameters:
- x The numerator, a bint or lua number.
- y The denominator, a bint or lua number.
Returns:
-
The quotient, a lua number.
- __mod (x, y)
-
Perform integer floor modulo operation between two numbers considering bints.
The operation is defined as the remainder of the floor division
(division that rounds the quotient towards minus infinity).
Parameters:
- x The numerator, a bint or lua number.
- y The denominator, a bint or lua number.
Returns:
-
The remainder, a bint or lua number.
Raises:
Asserts on attempt to divide by zero. - ipow (x, y)
-
Perform integer power between two integers considering bints.
If y is negative then pow is performed as an unsigned integer.
Parameters:
- x The base, an integer.
- y The exponent, an integer.
Returns:
-
The result of the pow operation, a bint.
Raises:
Asserts in case inputs are not convertible to integers.See also:
- upowmod (x, y, m)
-
Perform integer power between two unsigned integers over a modulus considering bints.
Parameters:
- x The base, an integer.
- y The exponent, an integer.
- m The modulus, an integer.
Returns:
-
The result of the pow operation, a bint.
Raises:
Asserts in case inputs are not convertible to integers.See also:
- __pow (x, y)
-
Perform numeric power between two numbers considering bints.
This always casts inputs to floats, for integer power only use bint.ipow.
Parameters:
- x The base, a bint or lua number.
- y The exponent, a bint or lua number.
Returns:
-
The result of the pow operation, a lua number.
See also:
- __shl (x, y)
-
Bitwise left shift integers considering bints.
Parameters:
- x An integer to perform the bitwise shift.
- y An integer with the number of bits to shift.
Returns:
-
The result of shift operation, a bint.
Raises:
Asserts in case inputs are not convertible to integers. - __shr (x, y)
-
Bitwise right shift integers considering bints.
Parameters:
- x An integer to perform the bitwise shift.
- y An integer with the number of bits to shift.
Returns:
-
The result of shift operation, a bint.
Raises:
Asserts in case inputs are not convertible to integers. - _band (y)
-
Bitwise AND bints (in-place).
Parameters:
- y An integer to perform bitwise AND.
Raises:
Asserts in case inputs are not convertible to integers. - __band (x, y)
-
Bitwise AND two integers considering bints.
Parameters:
- x An integer to perform bitwise AND.
- y An integer to perform bitwise AND.
Raises:
Asserts in case inputs are not convertible to integers. - _bor (y)
-
Bitwise OR bints (in-place).
Parameters:
- y An integer to perform bitwise OR.
Raises:
Asserts in case inputs are not convertible to integers. - __bor (x, y)
-
Bitwise OR two integers considering bints.
Parameters:
- x An integer to perform bitwise OR.
- y An integer to perform bitwise OR.
Raises:
Asserts in case inputs are not convertible to integers. - _bxor (y)
-
Bitwise XOR bints (in-place).
Parameters:
- y An integer to perform bitwise XOR.
Raises:
Asserts in case inputs are not convertible to integers. - __bxor (x, y)
-
Bitwise XOR two integers considering bints.
Parameters:
- x An integer to perform bitwise XOR.
- y An integer to perform bitwise XOR.
Raises:
Asserts in case inputs are not convertible to integers. - _bnot ()
- Bitwise NOT a bint (in-place).
- __bnot (x)
-
Bitwise NOT a bint.
Parameters:
- x An integer to perform bitwise NOT.
Raises:
Asserts in case inputs are not convertible to integers. - _unm ()
- Negate a bint (in-place). This effectively applies two's complements.
- __unm (x)
-
Negate a bint. This effectively applies two's complements.
Parameters:
- x A bint to perform negation.
- ult (x, y)
-
Compare if integer x is less than y considering bints (unsigned version).
Parameters:
- x Left integer to compare.
- y Right integer to compare.
Raises:
Asserts in case inputs are not convertible to integers.See also:
- ule (x, y)
-
Compare if bint x is less or equal than y considering bints (unsigned version).
Parameters:
- x Left integer to compare.
- y Right integer to compare.
Raises:
Asserts in case inputs are not convertible to integers.See also:
- __lt (x, y)
-
Compare if number x is less than y considering bints and signs.
Parameters:
- x Left value to compare, a bint or lua number.
- y Right value to compare, a bint or lua number.
See also:
- __le (x, y)
-
Compare if number x is less or equal than y considering bints and signs.
Parameters:
- x Left value to compare, a bint or lua number.
- y Right value to compare, a bint or lua number.
See also:
- __tostring ()
-
Convert a bint to a string on base 10.
See also:


Tizen Network API
Available buttons/actions:
Enter - start network test
0 - Clear logs
Application online status
Logs:
Info
This application is a demonstration of Tizen network API


Data Tier Modeler for .Net - O/R mapping tool
Here. From Sébastien Ros: This new tool is an object-relational framework fully integrated in VS.Net. Its main features are true UML importation, automatic object cache, database specific generation, transparent data encryption and bidirectional relations navigation.


•Key elements: core values, strengths, personality, brand image and brand promise.
•It helps you to deliver on your brand in thought, image, word and deed.


Raspberry Pi
- 2014/10/07 Dylos RPi Serial problem
- 2014/07/02 LAN based Internet problem and th Raspberry Pi and solution
- 2014/04/10 Dylos monitor setup full with log
- 2014/01/08 Daemon service for RPI for running python script
- 2014/01/08 GSM INTERNET connection for RPi
- 2014/01/08 Raspberry pi errors
- 2014/01/08 Testing the RPi with usb hub usb serial and data card
- 2014/01/08 Udev rules for USB attached to RPi
- 2013/12/16 DYLOS raspberry pi and xively
- 2013/11/11 DYLOS raspberry pi experiment
- 2013/11/11 Steps to view attached USB serial in RPI
- 2013/10/29 Giving Raspberry pi net connection


The TxGIS Day 2021 events many special sessions and competitions for high school students.
GIS stands for Geographic Information Systems. GIS uses location technology to answer questions, make better decisions, and solve some of the world’s toughest problems. It is the Science of Where.
GIS Day is an international celebration of GIS technology. Around the globe, GIS professionals dedicate time to sharing their knowledge and accomplishments with others.
GIS Day event planners, from around Texas, have joined forces to host the first state-wide GIS Day for Texas. TxGIS Day is a free, virtual event for high school students and teachers. Our goal is to introduce GIS to high school students and help you inspire future GeoGeeks!
Behind-the-Scenes Look
Registered attendees will have access to a selection of videos showing GIS professionals in their work environment. Get a behind-the-scenes look at the offices of:
College and University Recruiting
Registered attendees will have opportunties to connect with Faculty, Academic Advisors, and current and former students from several colleges and universities including:
Discussion Panels
Registered attendees will have access to a selection of discussion panels that include GIS professionals. Attendees can listen in as GIS professionals tell their stories and discuss how meaningful their work has contributed to:
Games & Prizes
Students can register to join a live geography based game and compete for prizes.
Seats will be limited!
GIS Essay Contest
Students can submit an essay about GIS and compete for an award and prizes. Because this is a state-wide event we ask teachers to limit the essay submissions to three (3) per school. Each essay will be reviewed by a panel of GIS professionals. Click here for more details.
GIS Labs
Students can register for a seat in one of our GIS Labs. We are offering live GIS Labs where the students can enjoy an interactive experience using GIS technology.
Seats will be limited!
GeoMentor Panel for Teachers
The AAG- Esri ConnectED GeoMentor Program is working to enhance GIS and geography education in US K-12 schools through the introduction of GIS into classrooms across the country. It connects teachers to the GIS world. Join a live discussion panel featuring GIS software representatives, GeoMentors, and K-12 school teachers as they discuss offerings and success stories.
Seats will be limited!
For more information about opportunties for students and teachers to participate in TxGIS Day 2022, contact Nicole Ceranek, the Houston Area GIS Day Coordinator via email at houstonareagisdayorg@gmail.com.


ART AND CRAFT
A brush is to painter, what a rifle is to soldier. Well, be prepared to be stripped of your prime weapon and shoved out into the battlefield. Participants will be given all paint materials except brushes and asked to do the best they can with what they have.
RULES:
1. A team shall consist of two participants.
2. Theme will be provided on spot.
3. As the event suggests, no brushes are to be used.
4. A2 sized sheets will be provided.
5. Color and basic materials will be provided by the club.
6. Teams can bring their own material like sponge etc.
7. Top three participants shall be given prizes.
VENUE:
11th March,2016(Day 1)
LC(Lizo)
Timings:10.30 am-1.30pm
Sketch like never before! You will be given a theme and a chance to randomly select your partner. You will begiven 30 minutes to think of an idea as a team. The sketches drawn by the two participants in a team should be contrary. For example: Normal portrait and its negative.
RULES :
1.This is an individual event.
2.Sheet and basic stationary will be provided by the club,however teams can bring their own materialsand use it with poermission.
3.Theme will be provided on the spot.
4.As the event suggests,you have to select random partners.
5.Top three entries would be fgiven prozes on the basis of judging criteria as described by event.
VENUE:
11th March,2016(Day 1)
LC(Lizo)
Timings:2.00 pm-4.30 pm
Let's paint the street with our imagination. You will be provided with chalks to express your creativity.
RULES :
1. A team shall consist of four participants.
2. Theme will be provided just before the event.
3. In prelims, each team has to paint the same idea on the sheet, which they are going to paint in the main event, on the street.
4. Ten teams shall be selected from the prelims and would go into final round.
5. Colors and the other material shall be provided by the club. However, teams can bring ther own materials and use it after seeking permission.
6. Top three entries from the final round shall be given prizes.
VENUE:
12th March,2016(Day 2)
LC(Lizo)
Timings:10.30 am-1.30 pm
Explore the asthete in you!
RULES :
1.A team shall consist of two participants.
2.Theme will be provided on the spot.
3.Colours and basic material would be provided by the club.
4.Top three entries would be given prizes.
VENUE:
12th March,2016(Day 2)
LC(Lizo)
Timings:2.00 pm-4.30 pm
Make the wall narrate your emotions! You will be provided with spray paints of different shades to express your creativity on the provided area of the wall.
RULES :
1. A team shall consist of four participants.
2. Theme shall be provided on the spot.
3. In prelims, each team has to draw the same idea on the sheet, which they are going to make in the main event, on the wall.
4. Ten teams shall be selected from the prelims and would go to the finals.
5. Colors and the other materials shall be given by the club. However, teams can bring their own materials and use it after seeking permission.
6. Top three entries from the final round shall be given prizes.
VENUE:
13th March,2016(Day 3)
LC(Lizo)
Timings:10.30 am-1.30 pm


{% load static %}
Mock store
Store
Powered by
Inner Pieces
Welcome to the store, {{user.username}}
{% for item in items %}
{{item.name}}
${{item.price}}
User Rating:
{{item.rating}}/5
Add to cart
{% endfor %}
Proceed to Cart


WITNESS LIST Financial Institutions Committee March 8, 1999-3:00P HB 511 For: Kopfer, Randall (Self and Foundation Appraisers Coalition of Texas (FACT)) On: Barnes, Rodger (Texas Appraiser Licensing & Certificate Board) Neeley, Karen (IBAT) Runyan, Debra S. (Texas Appraiser Licensing & Certificate Board) Thorburn, Wayne (Texas Real Estate Commission) Registering, but not testifying: For: Schneider, Rob (Consumers Union -- Southwest Regional Office) HB 511Committee Substitute (Solis) For: Graham, Ann (Texas Bankers Assoc.) HB 1295 Against: Lederer, John B. (Texas Credit Union League) Neeley, Karen (Independent Bankers Assn. of Texas (IBAT)) On: Graham, Ann (Texas Bankers Assoc.) Tamayo, George (Comptroller of Public Accts.) HB 1810 On: Doyle, Mike (Comptroller of Public Accounts) HB 1879 For: Daniel, John T. (Merrill Lynch & Co.) On: Edwards, Kimberly K. (Texas Public Finance Authority) Kerr, John C. (Texas Public Finance Authority)


Error authorizing DIM: This might be a problem with DIM, or it might be an issue with Bungie.net or your browser.
Check DIM status on Twitter / Mastodon or let us know what error you're seeing.


SVRL report
Errors: 2
: Found ISBN with value '9780575075344' for tag 'book'
Test: not(@isbn)
Location: /library[1]/book[1]
: Found ISBN with value '9780553573398' for tag 'book'
Test: not(@isbn)
Location: /library[1]/book[2]


{{pp-semi-indef}}{{ref improve|date=March 2013}} {{Infobox prepared food | name = Sinigang | image = | caption = A pot of tamarind sinigang | alternate_name = | country = Philippines | region = | creator = | course = Main course | type = Soup or stew | served = Hot | main_ingredient = Meat, vegetables, tamarind, fish sauce, onions, siling mahaba, tomatoes | variations = Pork, beef, shrimp, fish, chicken | calories = | other = Can be served in many different forms }}
Sinigang is a Filipino soup or stew characterized by its sour and savoury taste most often associated with tamarind (Filipino: sampalok). It is one of the more popular viands in Philippine cuisine, and is related to the Malaysian dish singgang.
While present nationwide, sinigang is seen to be culturally Tagalog in origin, thus the versions found in the Visayas and Mindanao may differ in taste (mainly ginger is an additional ingredient). Fish sauce is a common condiment for the stew.
Contents |
Meat in sinigang (e.g., fish, pork, beef, shrimp, or chicken) is often stewed with tamarinds, tomatoes, garlic, and onions. Other vegetables commonly used in the making of sinigang include okra, taro corms (gabi), daikon (labanós), water spinach (kangkóng), yardlong beans (sitaw) and eggplant (talóng). Most Filipinos like to cook sinigang with green long peppers in order to enhance the taste and add a little spice to the dish.
Sinampalukang manók or sinampalukan (from sampalok) is technically not a variation of sinigang, as the chicken has to be sautéed in ginger first instead of all the ingredients being placed simultaneously into the pot and brought to a boil. Sinampalukan is also distinguished by its use of shredded tamarind leaves, and is usually made together with ginger, onions, tomatoes, eggplant and spinach.
{{Cookbook|Sinigang}} {{Reflist}}
{{Refbegin}}
{{Refend}}
{{Filipino food}} {{Philippine soups}} {{Symbols of the Philippines}}


Test Automation with Kafka - Docker and Kafka
Introduction
This guide is an introduction to test automation through the use of Apache Kafka®. Apache Kafka® is a publish-subscribe messaging system that’s used widely across many industries.
I’ve previously worked on projects that used Kafka for low latency, high volume, scalable data streaming in real-time applications.
In this series of posts, I will show you how to set up a full end-to-end test automation framework, which will include:
- Sending (producing) a message onto a Kafka topic
- Filtering (consuming) for a specific message
- Asserting against a value in the filtered message
This, in a nutshell, is the same automation functionality that you would use in industry.
Prerequisites
- Knowledge of a programming language - we will be using Javascript
- Knowledge of setting up a test automation framework - we will be using AVA
- NPM
- Docker
For the brevity of this tutorial, I will not be going into detail on every section. If you’d like something elaborating, please get in touch.
Setup
To develop the automation framework, we need a local instance of Kafka and its dependencies. We will use Docker and docker-compose. Compose is a tool for defining and running multi-container Docker applications.
docker-compose.yml
- Within your directory, create a
docker-compose.yml
file. - We will use a public container for this, alongside Zookeeper.
- Kafka uses Zookeeper to store a variety of configuration settings:
- Topics under a broker
- Next available offset for a Consumer/topic/partition.
- We can now configure our Kafka instance:
version: '2'
services:
zookeeper:
image: wurstmeister/zookeeper
ports:
- "2181:2181"
kafka:
image: wurstmeister/kafka
ports:
- "9092:9092"
environment:
KAFKA_ADVERTISED_HOST_NAME: <IP_ADDRESS>
KAFKA_CREATE_TOPICS: "testAutomationTopic:1:1"
KAFKA_ZOOKEEPER_CONNECT: zookeeper:2181
depends_on:
- zookeeper
volumes:
- /var/run/docker.sock:/var/run/docker.sock
This is the minimum configuration required, but also includes KAFKA_CREATE_TOPICS
, where we pre-determine the topic name, its partitions (1) and replicas (1).
Execute docker-compose.yml file
Now we have the necessary configuration needed to run Kafka locally, we can now build the Docker container.
- Within the directory of your
docker-compose.yml
, rundocker-compose up
. - Once your container images have been downloaded, you’ll now have a locally running Kafka instance.
Coming up next
In the next blog post, we will create our test framework.


WITNESS LIST Business & Commerce Committee (Subcommittee on Subcommittee on Interim Charge #4) January 9, 2002 - 9:30A Trends in Local Lending Practices i ON: Deese, James Deputy Credit Union Commissioner (Tx Credit Union Department), Austin, TX James, Randall Bank Commissioner (Tx. Department of Banking), Austin, TX Murdock, Steve State Demographer (Self), College Station, TX Neeley, Karen (Independent Bankers Association of Texas), Austin, TX Ocanas, Reymundo (Texas CDCs), Austin, TX Perryman, Ray Economist (Self), Waco, TX Pettijohn, Leslie L. Consumer Credit Commissioner (Office of Comsumer Credit Commissioner), Austin, TX Pledger, Jim Savings and Loan Commissioner (Tx Savings and Loan Department), Austin, TX Rodriquez, Jose R. (El Paso County Attorney's Office), El Paso, TX Schneider, Rob (Consumers Union), Austin, TX


I'm off for a bit of vacation, but before then I thought I'd
throw up a bunch of links to stuff I've been doing in the last
couple months:
I've been doing a lot with HTML lately. HTML is great,
because it's important. (Hmm... this statement sounds kind
of weird. Because HTML is important, if you don't
understand why it is great you need to think harder. Now the
statement sounds weird, but in a deep way)
-
I've started working with microformats some. This
initially started with an
OLPC project, where I wrote an
hReview parser
(hReview
is a microformat).
-
Then related to that, I wanted to download a bunch of
pages in an isolated form, so all the internal links are
fixed up. This became
PageCollector. Since then I've added a script frontend. I think this
could be a generally handy export system. It doesn't
just make links relative, it also lets you completely
remap filenames and is fairly careful about links
(including links in CSS).
-
Doing all this HTML-related stuff, I've been using
lxml
a lot (and it should be inferred I therefor also like
libxml2
a lot). I like lxml a lot; probably the biggest reason
is that it has a fast permissive HTML parser. But the
ElementTree API that lxml uses can be a bit awkward for
HTML -- it works well for XML, but in HTML there's lots
of mixing of text and tags, and that feels really weird
in the ElementTree API. So I've started
lxml.html
in a branch with lots of feedback from Stefan Behnel.
This adds methods that are useful in HTML. With just a
few smallish methods, I think it makes HTML much easier
to work with in lxml.
-
Though
BeautifulSoup
is nice, it's not a C-based HTML parser. With
Deliverance
we are literally parsing and rewriting every page as it
comes through our site. I couldn't do this with
BeautifulSoup. And we're not doing any crappy regex
stuff; lxml lets us actually understand the HTML the way
the browser understands the HTML. That's important. This
is kind of the promise of XHTML -- the ability to create
smart and useful intermediaries -- that XHTML never
really fulfilled. The idea of smart intermediaries is a
powerful one, XHTML just wasn't the right basis;
intermediaries are supposed to work with
real endpoints, and those endpoints were and
continue to be HTML, not XHTML.
html5lib
is cool too as an HTML parser, and important as a
reference implementation, but I'll mostly be waiting for
that work to filter back into something like libxml2.
-
I should note that I think the stream model of handling
HTML (as
HTMLParser
uses) is lame. Typical HTML is not very big, and a
document model (where the whole document is loaded into
memory) is way easier to handle. HTML is best understood
as a document. (Genshi
would probably be rockin' fast if it used lxml)
-
As part of lxml.html I've been writing an
HTML cleaning module. It's a bit messy, and incomplete, but I think it will
be really useful. Because we fully parse and then
serialize the HTML, a lot of XSS attacks are avoided
really early. At work David Turner has been working on a
Transclusion
intermediary called
Transcluder. It's a little frightening to fold together disparate
pieces of HTML; this might make it less frightening.
-
I took the pattern from
formencode.doctest_xml_compare
and also ported it to lxml. Now you can do
semantic HTML and XML diffs in your doctests,
instead of literal string comparison. This means that
things like the order of your attributes are ignored, as
is whitespace. And the diffs help highlight problems in
a more fine-grained way. Using the html branch you can
do
from
lxml
import
usedoctest
or
from
lxml.html
import
usedoctest
to enable the comparison inside a doctest. And you don't
need a custom doctest runner.  Also from FormEncode
I'm hoping to port
htmlfill
over to lxml.html sometime too.
-
With Luke Tucker we wrote an
html diff module, which I've also put into lxml.html. This shows
textual differences while trying to avoid markup
differences (since it's really hard to visually
represent changes in markup, and also usually not what
people care about). This is surprisingly difficult
because you also need to preserve the markup --
you can't just smash all the words together. I think
it's a pretty good implementation, and there aren't that
many implementations of this out there. You can also do
blame style annotations, showing who added what over the
history of the page.
Stuff from
work
(which is a little vague, because work, private projects,
HTML, OLPC, all overlap a lot).
-
Deliverance
is deployed on the live site. We haven't really
used its functionality much yet. But it's
awesome functionality once we get around to using it.
-
Related to that deployment, I spent some time with
paste.httpserver
(trunk only) on the thread pool. It now adapts the
thread pool to add threads when necessary, kill threads
that seem to be wedged, and various tools around that.
This recipe
was handy, as now I can kill threads. It's surprisingly
slow, though -- it frequently takes several minutes for
the thread to be killed. But it shows up as a regular
exception, which is great. You can read about the
details in
this document.
-
I've been extracting some stuff into
WSGIProxy
for your non-browser-based proxying. This is mostly for
handling HTTP-based dispatch between server
applications.
-
Not really for work, but related to proxying I whipped
together a
little HTTP proxy
using Paste and WSGI middleware. It kind of works. It
was just a prototype, so I haven't worked on it more,
but with just a little more work I think it
should be easy to turn any WSGI middleware into an HTTP
proxy. This is the kind of proxy you configure in your
browser.
-
A followup to the
HTML WYSIWYG post, we decided to use
Xinha. I feel pretty good about the decision, which is
primarily motivated by Xinha's UI -- in small but
important ways it feels like the best UI among the
bunch. It's just more polished and higher quality than
the other options. It's also a Real Open Source Project,
which matters to us. But we haven't actually implemented
this yet.
-
I wrote a
total hack of doctest
that lets you do
from
dtopt
import
ELLIPSIS, and then the ELLIPSIS option (that lets you use
...
as a wildcard in output) will be enabled for the rest of
your doctest. It's ugly, but I might add a few more
similar hacks to that package and make it into something
more real. But still ugly.
-
With Whit Morris I've been working on a
Tagging application. It's just getting started, so nothing working yet. I
like the
atom module, which represents Atom feeds and entries as plain XML.
This didn't occur to me at first -- I was going to
create a Python representation of the Atom data model
and then add parse and serialize methods to it. This is
wrong, because the Atom data model is XML. If
you add a funky custom element to your entry and I
normalize it into oblivion, then I've made a crappy
library; by making the XML the one and only source of
information I avoid such things.
-
I wrote a
little proof of concept for web application help
called WebClippy
(svn
here). It's inspired by
Hackety Hack
(a neat Ruby educational environment) and how tutorials
are written there -- just a very simple bit of
persistent help. Writing it made me realize that
S5
should totally be rewritten, because Javascript-based
slideshow scripts are easy to write and S5 is annoying.
Anyway, I need to actually try to document something
with WebClippy, because my test slides are lame, and
I've decided realistic examples are essential to good
development.
Stuff from
One Laptop Per Child
(besides the HTML experiments)...
-
I went to Boston for OLPC, and we talked a lot about
Web-Based Annotation. We want there to be a way for children to add notes
(shared or private) to any web page. There seems to be
people from several directions working towards this,
outside of OLPC. Annotation is something that seems to
pop up every few years, then die down; maybe this time
we can actually make it work. Maybe Web 2.0 should just
be "good ideas that aren't new, but this time they
might actually work".
-
I didn't do any of it, but
PyXPCOM
is in the Sugar browser now (Sugar is the OLPC UI). This
excites me, except then I looked at the code and I
couldn't figure out how to get access to any interesting
XPCOM objects (the DOM in particular) -- XPCOM seems
very indirect. Oh well, at least now it's
possible and I just have to figure out the
details. I hope/want/am-optimistic that OLPC will have a
great browser experience. It doesn't yet.
-
We had a little OLPC sprint for
Chicago people interested in the project. Again getting a working Sugar environment was a bit
of a problem. Afterward I
played around with some VMWare techniques. These need some polish, but I think it's the right
direction and it's not that hard. If someone could get
this working in a scripted way, I'm sure it could be
added to the standard build process at OLPC.
 If the application is too slow,
it gives the user a page asking them to wait.  Just pop this in front and your problem is pretty
much solved. This is part of a secret framework I'm
developing.
-
I started
revisiting buildutils
and cleaning some stuff up. Mostly I've added some
commands to make it easier to add and make new commands
for
setup.py. This relates to
this post. I added a
command to WebHelpers
for Javascript compression.
-
It's a little old now, but I added a
templating language
to Paste. Using
string.Template
for the little internal templating things just wasn't
good. Cheetah has been too hard to install. So this is a
simple, single-file templating language based on string
substitution. I should probably extract it and do a few
more things with it. I feel a little dumb about writing
Yet Another Templating Language, but I couldn't find a
templating language that I liked for small text-related
tasks. For actual web programming a more complete
language is good.
-
I made a
little package called CmdUtils
to make it a bit easier to build command-line scripts,
with the patterns that I personally like.
-
I kind of got a
new encoding working. It encodes text to spaces, newlines, and tabs. Now
whitespace can be even more significant! You can also
put non-whitespace in the encoded text as a form of
steganography.
-
Among my
little recipes
I added
propertyclass
for making properties. I also added a
little script
for pasting text to a pastebin (only for X users). And
also one for creating
easy_install links from a subversion repository.
-
I wrote about
my desktop
for a new blog that Steve Holden created.
Hmm... more stuff than I thought. Working at
The Open Planning Project
is great, because I spend all my time working on open source
projects in public repositories. And also working on Stuff
That Interests Me. If you've gotten an email from me
recently, you may notice I link to
our careers page
in my sig, simply because I think everyone cool should work
at TOPP. We're doing other interesting things too that I'm
not directly involved with; I'll try to write about other
people's projects before too long.
After vacation I should probably start looking more into
getting WordPress on our site. TOPP is not technically
tribalist! We do accept PHP, even if we don't really
trust PHP.


| Class and Description |
|---|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| ExchangeServiceBase
Represents an abstract binding to an Exchange Service.
|
| Class and Description |
|---|
| EwsXmlReader
Defines the EwsXmlReader class.
|
| ExchangeServiceBase
Represents an abstract binding to an Exchange Service.
|
| Class and Description |
|---|
| EwsXmlReader
Defines the EwsXmlReader class.
|
| Class and Description |
|---|
| EwsXmlReader
Defines the EwsXmlReader class.
|
| Class and Description |
|---|
| EwsXmlReader
Defines the EwsXmlReader class.
|
| Class and Description |
|---|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| EwsXmlReader
Defines the EwsXmlReader class.
|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| Class and Description |
|---|
| EwsXmlReader
Defines the EwsXmlReader class.
|
| Class and Description |
|---|
| EwsServiceMultiResponseXmlReader
Represents an xml reader used by the ExchangeService to parse multi-response streams,
such as GetStreamingEvents.
|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| EwsSSLProtocolSocketFactory
EwsSSLProtocolSocketFactory can be used to create SSL
Socket s
that accept self-signed certificates. |
| EwsXmlReader
Defines the EwsXmlReader class.
|
| ExchangeServerInfo
Represents Exchange server information.
|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| ExchangeServiceBase
Represents an abstract binding to an Exchange Service.
|
| IAction
The Interface IAction.
|
| ICustomXmlSerialization
The Interface CustomXmlSerializationInterface.
|
| IDisposable
The Interface IDisposable.
|
| IFileAttachmentContentHandler
Defines a file attachment content handler.
|
| ILazyMember
The Interface ILazyMember.
|
| IPredicate
The Interface IPredicate.
|
| LazyMember
Wrapper class for lazy members.
|
| PropertySet
Represents a set of item or folder property.
|
| WebProxy
WebProxy is used for setting proxy details for proxy authentication schemes such as
basic, digest, NTLM, and Kerberos authentication.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| PropertySet
Represents a set of item or folder property.
|
| WebProxy
WebProxy is used for setting proxy details for proxy authentication schemes such as
basic, digest, NTLM, and Kerberos authentication.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| PropertySet
Represents a set of item or folder property.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| PropertyBag
Represents a property bag keyed on PropertyDefinition objects.
|
| PropertySet
Represents a set of item or folder property.
|
| Class and Description |
|---|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| PropertySet
Represents a set of item or folder property.
|
| Class and Description |
|---|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| PropertySet
Represents a set of item or folder property.
|
| Class and Description |
|---|
| PropertySet
Represents a set of item or folder property.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| EwsXmlReader
Defines the EwsXmlReader class.
|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| ExchangeService
Represents a binding to the Exchange Web Services.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| ICustomXmlUpdateSerializer
Interface defined for property that produce their own update serialization.
|
| SimplePropertyBag
Represents a simple property bag.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| PropertyBag
Represents a property bag keyed on PropertyDefinition objects.
|
| Class and Description |
|---|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|
| PropertySet
Represents a set of item or folder property.
|
| Class and Description |
|---|
| EwsServiceXmlReader
XML reader.
|
| EwsServiceXmlWriter
Stax based XML Writer implementation.
|


Using Notion with multiple emails was a pain. Constantly logging out and logging back in just to get to the right content was 🤬
— Notion (@NotionHQ) August 18, 2020
Now you can quickly switch between all your workspaces and accounts in one place 🥰 pic.twitter.com/uaYDORHWXR


Tom Brady Speaks On Possibility of Playing For Another Team In 2020
by Darrelle LincolnTom Brady has repeatedly expressed a desire to play late into his 40’s, and if that means playing for another team, he seems ready to do that as well.
During a sit-down interview with FOX’s Erin Andrews that aired on Sunday, he was asked whether he could see himself playing for a different team. Brady stated he wasn’t going to make a prediction, but he seemed to prioritize playing as long as he wants, regardless of team.
“The reality is there is no prediction. I have always said I have a plan to play longer and I will figure that out when the time comes,” Brady said.
He also was asked about proving doubters wrong by playing late into his 40’s.
“I think it would be pretty cool to do that. I definitely think there is an inspirational element to that,” Brady said. “There’s just different challenges. There were challenges when I was young, there’s challenges now. I think just understanding what those are and whether you want to face those or take them or overcome them, those are healthy things and healthy decisions to have. When the time’s right, I’ll make a decision.”
Brady’s contract expires after the season and he is selling a home in Massachusetts, however, not many experts expect he nor the team to part ways with each other.


White to play 34
pips White=167 Black=159
(CorrectAnswer= 0/0, ErrorScore= 0)
1. 13/10 13/9 eq: -0.200 45.67% (G:13.67% B:0.63%) 54.33% (G:18.02% B:1.32%) 2. 24/21 13/9 eq: -0.202 (-0.002) 45.81% (G:12.46% B:0.63%) 54.19% (G:17.86% B:0.95%) 3. 24/21 24/20 eq: -0.216 (-0.016) 45.60% (G:11.27% B:0.60%) 54.40% (G:17.88% B:0.68%) 4. 24/20 13/10 eq: -0.217 (-0.016) 45.59% (G:12.09% B:0.60%) 54.41% (G:17.87% B:0.91%) 5. 13/6 eq: -0.268 (-0.068) 43.51% (G:11.22% B:0.48%) 56.49% (G:17.59% B:0.90%)


Press n or j to go to the next uncovered block, b, p or k for the previous block.
| File | Statements | Branches | Functions | Lines | |||||
|---|---|---|---|---|---|---|---|---|---|
| src | 12.05% | 10/83 | 0% | 0/56 | 0% | 0/28 | 12.82% | 10/78 | |
| src/dpos/store | 12% | 15/125 | 10% | 1/10 | 8.82% | 3/34 | 12.2% | 15/123 | |
| src/services | 12% | 3/25 | 0% | 0/4 | 10% | 1/10 | 13.64% | 3/22 | |
| src/store/plasma | 12.6% | 16/127 | 16.67% | 4/24 | 5.71% | 2/35 | 12.8% | 16/125 |


Module forma.subpattern
Sub-pattern finders.
Functions for the selection of sub-patterns of various forms from a parent pattern. The simplest of these is the random sampling of a fraction of cells from the parent.
Several of these finders return a table of all relevant sub-patterns. For example the segments method which returns a table of all contiguous (according to some neighbourhood) sub-patterns by using a floodfill.
In addition to the subpattern finders, a print_patterns utility is provided to render these tables of sub-patterns into text.
Sub-patterns
| mask (ip, mask) | Masked subpattern. |
| random (ip, ncells, rng) | Random subpattern. |
| poisson_disc (ip, distance, radius, rng) | Poisson-disc random subpattern. |
| mitchell_sample (ip, distance, n, k, rng) | Mitchell's best candidate sampling. |
| perlin (ip, freq, depth, thresholds, rng) | Perlin noise sampling. |
| floodfill (ip, ipt, nbh) | Returns the contiguous sub-pattern of ip that surrounts cell ipt |
| maxrectangle (ip) | Find the maximal contiguous rectangular area within a pattern. |
Lists of sub-patterns
| segments (ip, nbh) | Generate a table of contiguous 'segments' or sub-patterns. |
| enclosed (ip, nbh) | Returns a table of 'enclosed' segments of a pattern. |
| bsp (ip, th_volume) | Generate subpatterns by binary space partition. |
| neighbourhood_categories (ip, nbh) | Determine subpatterns for all neighbourhood categories. |
| voronoi (seeds, domain, measure) | Generate Voronoi tesselations of cells in a domain. |
| voronoi_relax (seeds, domain, measure, max_ite) | Generate (approx) centroidal Voronoi tessellation. |
Utilities
| print_patterns (domain, segments, chars) | Print a table of forma.patterns. |
Sub-patterns
- mask (ip, mask)
-
Masked subpattern.
Generate a subpattern by applying a boolean mask to an input pattern.
Parameters:
- ip the pattern to be masked.
- mask a function that takes a cell and returns true if the cell passes the mask
Returns:
-
A pattern consisting only of those cells in
domain
which pass the mask argument. - random (ip, ncells, rng)
-
Random subpattern.
For a given domain, returns a pattern sampling randomly from it, generating a random
subset with a fixed fraction of the size of the domain.
Parameters:
- ip pattern for sampling a random pattern from
- ncells the number of desired cells in the sample
- rng (optional) a random number generator, following the signature of math.random.
Returns:
-
a pattern of
ncells
cells sampled randomly fromdomain
- poisson_disc (ip, distance, radius, rng)
-
Poisson-disc random subpattern.
Sample a domain according to the Poisson-disc procedure. For a given
distance measure
distance
, this generates samples that are never closer together than a specified radius. While much slower than subpattern.random, it provides a more uniform distribution of points in the domain (simmilar to that of subpattern.voronoi_relax).Parameters:
- ip domain pattern to sample from
- distance a measure of distance between two cells d(a,b) e.g cell.euclidean
- radius
the minimum separation in
distance
between two sample points. - rng (optional) a random number generator, following the signature of math.random.
Returns:
-
a Poisson-disc sample of
domain
- mitchell_sample (ip, distance, n, k, rng)
-
Mitchell's best candidate sampling.
Generates an approximate Poisson-disc sampling by Mitchell's algorithm.
Picks 'k' sample point attempts at every iteration, and picks the candidate
that maximises the distance to existing samples. Halts when
n
samples are picked.Parameters:
- ip domain pattern to sample from
- distance a measure of distance between two cells d(a,b) e.g cell.euclidean
- n the requested number of samples
- k the number of candidates samples at each iteration
- rng (optional) a random number generator, following the signature of math.random.
Returns:
-
an approximate Poisson-disc sample of
domain
- perlin (ip, freq, depth, thresholds, rng)
-
Perlin noise sampling.
Samples an input pattern by thresholding a Perlin-noise pattern in the
domain. This function takes an initial sampling frequency, and computes
perlin noise over the input pattern by taking the product of
depth
successively halved frequencies. A table of subpatterns are then returned, consisting of the perlin noise function thresholded at requested levels.Parameters:
- ip pattern upon which the thresholded noise sampling is to be performed.
- freq (float) frequency of desired perlin noise
- depth (int), sampling depth.
- thresholds table of sampling thresholds (between 0 and 1).
- rng (optional) a random number generator, following the signature of math.random.
Returns:
-
a table of
patterns
, one per threshold entry. - floodfill (ip, ipt, nbh)
-
Returns the contiguous sub-pattern of ip that surrounts cell ipt
Parameters:
- ip pattern upon which the flood fill is to be performed
- ipt a cell specifying the origin of the flood fill
- nbh defines which neighbourhood to scan in while flood-filling (default 8/moore)
Returns:
-
a forma.pattern consisting of the contiguous segment about cell
- maxrectangle (ip)
-
Find the maximal contiguous rectangular area within a pattern.
Parameters:
- ip the input pattern
Returns:
-
The subpattern of
ip
consisting of its largest contiguous rectangular area.
Lists of sub-patterns
- segments (ip, nbh)
-
Generate a table of contiguous 'segments' or sub-patterns.
This performs a series of flood-fill operations until all
pattern cells are accounted for in the sub-patterns
Parameters:
- ip pattern for which the segments are to be extracted
- nbh defines which neighbourhood to scan in while flood-filling (default 8/moore)
Returns:
-
A table of forma.patterns consisting of contiguous sub-patterns of ip.
- enclosed (ip, nbh)
-
Returns a table of 'enclosed' segments of a pattern.
Enclosed areas are the inactive areas of a pattern which are
completely surrounded by active areas
Parameters:
- ip pattern for which the enclosed areas should be computed
- nbh defines which directions to scan in while flood-filling (default 4/vn)
Returns:
-
A table of forma.patterns comprising the enclosed areas of ip.
- bsp (ip, th_volume)
-
Generate subpatterns by binary space partition.
This works by finding all the contiguous rectangular volumes in the input
pattern and running a binary space partition on all of them. The partitions
are then returned in a table.
The BSP is controlled by the
threshold volume
parameter. The algorithm will recursively subdivide every rectangular area evenly in two until the volume of the largest remaining area is less thanth_volume
.Parameters:
- ip the pattern for which the BSP will be run over
- th_volume the highest acceptable volume for each final partition
- neighbourhood_categories (ip, nbh)
-
Determine subpatterns for all neighbourhood categories.
Each neighbourhood has a number of possible combinations or
categories
of active cells. This function categorises each cell in an input pattern into one of the neighbourhood's categories.Parameters:
- ip the pattern in which cells are to be categorised
- nbh the forma.neighbourhood used for the categorisation
Returns:
-
A table of #nbh patterns, where each cell in ip is categorised.
- voronoi (seeds, domain, measure)
-
Generate Voronoi tesselations of cells in a domain.
Parameters:
- seeds the set of seed cells for the tesselation
- domain the domain of the tesselation
- measure the measure used to judge distance between cells
Returns:
-
A table of Voronoi segments.
- voronoi_relax (seeds, domain, measure, max_ite)
-
Generate (approx) centroidal Voronoi tessellation.
Given a set of prior seeds and a domain, this iterates the position of the
seeds until they are approximately located at the centre of their Voronoi
segments. Lloyd's algorithm is used.
Parameters:
- seeds the original seed points to be relaxed
- domain the domain to be tesselated
- measure the distance measure to be used between cells
- max_ite (optional) maximum number of iterations of relaxation (default 30)
Returns:
- A table of resuling Voronoi segments.
- A pattern consisting of the voronoi segment centres.
- A bool, true if the algorithm converged, false if not.
Utilities
- print_patterns (domain, segments, chars)
-
Print a table of forma.patterns.
Prints a table of pattern segments to io.output. If provided, a table of
segment labels can be used, with one entry per segment.
Parameters:
- domain the basic pattern from which the segments were generated.
- segments the table of segments to be drawn.
- chars the characters to be printed for each segment (optional).


--- name: "Articles list" input: type: 'object' properties: articles: type: 'array' --- {{ include("templates/_head.html", data) }} {{ include("organisms/nav-main.html", {routes: routes, currentRoute: currentRoute}) }}


--- title: "Anonymous Is Now 'Hacking' A Country Because They Kill Whales" featimg: "http://hellou.co.uk/wp-content/uploads/2015/12/12278072_10153316934278226_150341278_n.jpg" description: "" categories: article_url: "http://www.hellou.co.uk/2015/12/anonymous-is-now-hacking-a-country-because-they-kill-whales-71272/" social_media_msg: "Hackers trying to save whales since no one else seems to care." ---
by
Iceland is a pretty great country to be honest. They have waterfalls, lagoons, and the Northern Lights…
Their literacy rate is 99%, the sun never sets (at least not in summer) and they have a handy app to make sure no-one inadvertently commits incest.

Why? They disapprove of Iceland’s whaling policies.
In a video posted online, Anonymous said:
“Whales do not have a voice. We will be a voice for them. Its time to speak out about this impending extinction of a species. Its time to let Iceland know we will not stand by and watch as they drive this animal to extinction.”
Whaling is frowned on internationally (to say the least), but along with Norway and Japan, Iceland continues to hunt whales for their meat.
Just when we thought there wasn’t a single blemish on this volcano-garnished, hot-spring adorned, incest-free paradise!
Anonymous have called for a boycott on Icelandic products, and have already shut down at least five of their government’s websites, vowing to expose the cruel practices involved in whaling.
You can watch Anonymous declare war on Iceland – liberal, beautiful – yet whale murdering Iceland – here:


 Click
here
when you're done!


Letters and spaces only
Sorry, no results found
info
Switch on some passes to plan your route.
Click on the button below, to see the optimized route between your selected markers.
Roundtrip
Show Route
Route details:
Start Address:
End Address:
Length:
Duration:
Clear Route


--- layout: post title: Virtual Hosts on Apache tags: [] status: publish type: post published: true meta: {} ---
I quite frequently find myself working on 2 or 3 different web related projects at a time and thought it's quite easy to develop of root sub directories, the end result usually sits in the root directory on the hosting site and hence requires a few modifications to the pages developed before they can be uploaded. In the following I describe the steps required to implement virtual hosts (e.g. http://www.site1.net/, http://www.site2.net/, etc?) on your local computer running Windows NT4 and Apache 1.3.12, that should make this whole porting affair a little easier. So let's get cracking.
Firstly we need to locate and edit the hosts file. Under Windows NT 4.0 it's usually located in your <your drive letter>:winntsystem32driversetc folder. In it you should see the following:
# Copyright (c) 1993-1995 Microsoft Corp. # # This is a sample HOSTS file used by Microsoft TCP/IP for Windows NT. # # This file contains the mappings of IP addresses to host names. Each # entry should be kept on an individual line. The IP address should # be placed in the first column followed by the corresponding host name. # The IP address and the host name should be separated by at least one # space. # # Additionally, comments (such as these) may be inserted on individual # lines or following the machine name denoted by a '#' symbol. # # For example: # #Â <IP_ADDRESS>Â Â rhino.acme.comÂ Â # source server #Â <IP_ADDRESS>Â Â x.acme.comÂ Â # x client host <IP_ADDRESS>Â Â localhost
This is the file that is going to enable you to resolve computer names (or aliases as you'll see in a minute) with IP addresses. Ok so now that you have located the file, the next step is to add an entry to it. Just use your favourite editor and append the following line:
<IP_ADDRESS>Â Â localhostÂ www.site1.net
What you have done here, is inform the system that any request made from your browser (and only your browser) for the www.site1net will be mapped to the IP address <IP_ADDRESS>. GO ahead and test it, by going to the command prompt and typing in ping www.site1.net, you should be getting a reply if you saved the changes. Right now it's time to modify your Apache configuration to allow for virtual hosts. Next you need to locate your httpd.conf file. This is usually located in: <your drive letter>:Program FilesApache GroupApacheconf. Open it with you editor and look for:
# # If you want to use name-based virtual hosts you need to define at # least one IP address (and port number) for them. # #NameVirtualHost <IP_ADDRESS>:80 #NameVirtualHost <IP_ADDRESS>
There you will need to specify the IP address you are mapping to. In our example this is <IP_ADDRESS>, so your entry should look like this:
# # If you want to use name-based virtual hosts you need to define at # least one IP address (and port number) for them. # #NameVirtualHost <IP_ADDRESS>:80 #NameVirtualHost <IP_ADDRESS> NameVirtualHost <IP_ADDRESS>
Right so far so good onto the next modification to that file locate the following lines in your httpd.conf file:
# # VirtualHost example: # Almost any Apache directive may go into a VirtualHost container. # #<VirtualHost ip.address.of.host.some_domain.com> #Â ServerAdmin<EMAIL_ADDRESS>#Â DocumentRoot /www/docs/host.some_domain.com #Â ServerName host.some_domain.com #Â ErrorLog logs/host.some_domain.com-error_log #Â CustomLog logs/host.some_domain.com-access_log common #</VirtualHost>
This is the segment where you will be specifying your server name (the machine name you specified in your hosts file [in this case www.site1.net]), any server aliases and the document root. Using the information from our example and wanting to map this virtual host to the Apache documentation directory, you entry would look like this:
# # VirtualHost example: # Almost any Apache directive may go into a VirtualHost container. # #<VirtualHost ip.address.of.host.some_domain.com> #Â ServerAdmin<EMAIL_ADDRESS>#Â DocumentRoot /www/docs/host.some_domain.com #Â ServerName host.some_domain.com #Â ErrorLog logs/host.some_domain.com-error_log #Â CustomLog logs/host.some_domain.com-access_log common #</VirtualHost> <VIRTUALHOST <IP_ADDRESS>> ServerName www.site1.net ServerAlias *site1.* DocumentRoot "c:/Program Files/Apache Group/Apache/htdocs" </VIRTUALHOST>
Ok, once you have done all your changes stop and restart the Apache service and you should be on your way.


Reports methods being named identically to the superclass of the method's class. Such a method name may be confusing.
Powered by InspectionGadgets


DEUCE BIGALOW: MALE GIGOLO **1/2 (out of five stars) A review by Jamey Hughton
Starring-Rob Schneider, Oded Fehr, Arija Bareikis and Eddie Griffin Director-Mike Mitchell Rated 14A Touchstone Pictures
MOVIE VIEWS by Jamey Hughton http://Welcome.to/MovieViews
The title `Deuce Bigalow: Male Gigolo' is undeniably more catchy than the alternative descriptions offered for a male prostitute in the film (releasing a film called `Deuce Bigalow: Man Whore' would probably fail to draw much of an audience). Rob Schneider, a `Saturday Night Live' veteran who is now renowned among comedy fans for his touching portrayal of the `you can do it!' guy in `The Waterboy', plays the title character. Deuce is actually a fish tank cleaner who inherits the role of being a gigolo when circumstances become extreme. Sit back and I'll tell you the story....
Antoine Laconte (Oded Fehr, `The Mummy') is a wealthy male prostitute who requires the services of a aquarium attendant. Enter Deuce. When Antoine is called away for an extensive business trip in Switzerland, Deuce is left with the assignment of looking after a sick fish. Unfortunately, Antoine's entire aquarium system is destroyed, leaving Deuce with the daunting task of producing $6,000 for a replacement tank before he returns (insert comedic plot-twist here). Reluctantly, Deuce becomes a gigolo himself to raise the required amount of money in time. Surely enough, the clients he attends to all have some kind of ridiculous characteristic that will ensure their romantic interludes are fall-down funny. Sorry guys, no dice.
The scatological humor in `Deuce Bigalow: Male Gigolo' is often mean and obvious, with the screenplay centering around the prime concern of taking cheap shots at those with mental and physical disabilities. The list of targets include the blind, the tall, the overweight, those afflicted with Tourrets syndrome and those with prosthetic limbs. For it's majority, `Deuce Bigalow' scrapes the very bottom of the proverbial comedy bucket in a manner that is both disgusting and thoroughly careless. And yet, it's sort of funny at times. Eddie Griffin has an amusing role as a black pimp named T.J. who takes Deuce under his wing, but too often his character is reduced to low-brow gags such as eating various food items after they've been dipped in a hot tub. Meanwhile, William Forsythe overacts with gritted teeth and slicked back hair as a cop who frequently drops his pants in public to ask Deuce advice about his manhood. As Kate, a client who Deuce falls head-over-heels for, Arija Bareikis navigates her way to an admirable performance. Anyone who could make us believe that Schneider has some charming characteristics must be doing a fantastic job.
Actually, even with such a heavy burden on his shoulders, Schneider delivers. He is not a particularly well-rounded comic, and the extra dimension someone like Adam Sandler might possess is missing, but the actor nonetheless does a fair job. Speaking of Sandler, this is actually his producing debut. Rest assured, I'm sure that his company - called, appropriately enough, `Happy Madison' - won't go bankrupt anytime soon.
`Deuce Bigalow: Male Gigolo' is essentially a hit-and-miss comedy for anyone craving endless potty mouth, but it does have it's charm. I know that's hard to fathom in a breeding ground of perverse and offensive vulgarity like this, but there are actually traces of it. The film does have a few inspired gags up it's sleeve, too, particularly a pair of well-executed nods to `The Matrix' that occur during elaborate battle sequences. Unfortunately, though, this is just your typical conglomeration of low-level humor on the whole. Perhaps, one of these days, the people of Hollywood will stop to ponder the idea of a decent script being attached to a project like this. Alas, for every `There's Something About Mary', there are ten grotesque and unfunny imitations designed to attract only adolescent males. It has it's moments, but all in all, `Deuce Bigalow: Male Gigolo' falls into the latter category.
(C) 1999, Jamey Hughton
1999: A Year in Review - Best & Worst of '99 http://Welcome.to/MovieViews MOVIE VIEWS by Jamey Hughton
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


| Offset | Label | size | Content | ||
|---|---|---|---|---|---|
| Sector | Packet | Table | |||
| 026 | --- | --- | --- | 4 | 00 00 01 bf - Private Stream 2 header |
| 02a | --- | --- | --- | 2 | 03 d4 - length |
| 02c | --- | --- | --- | 1 | 00 - substream ID, 00=PCI |
| 02d | 000 | PCI_GI 00 | nv_pck_lbn | 4 | Logical Block Number (sector) of this block |
| 031 | 004 | PCI_GI 04 | vobu_cat | 2 | flags, including APS (Analog Protection System) |
| 033 | 006 | PCI_GI 06 | --- | 2 | reserved |
| 035 | 008 | PCI_GI 08 | vobu_uop_ctl | 4 | bitmask for prohibited user operations |
| 039 | 00c | PCI_GI 0c | vobu_s_ptm | 4 | Vobu Start Presentation Time (90KHz clk) |
| 03d | 010 | PCI_GI 10 | vobu_e_ptm | 4 | Vobu End Presentation Time (PTM) |
| 041 | 014 | PCI_GI 14 | vobu_se_e_ptm | 4 | End PTM of VOBU if Sequence_End_Code |
| 045 | 018 | PCI_GI 18 | c_eltm | 4 | cell elapsed time, BCD, hh:mm:ss:ff with bits 7&6 of frame (last) byte indicating frame rate
11 = 30 fps, 10 = illegal, 01 = 25 fps, 00 = illegal |
| 049 | 01c | PCI_GI 1c | vobu_isrc | 32 | International Standard Recording Code (royalty management)* |
| 069 | 03c | NSML_AGLI 00 | nsml_agl_c1_dsta | 4 | non-seamless angle 1 relative offset to VOBU for CURRENT ILVU
the msb (bit 31) is used to denote the direction, 0=forward, 1=backward 00 00 00 00 indicates the angle does not exist 7f ff ff ff indicates no more video for this angle |
| : | : | : | : | : | : |
| 089 | 05c | NSML_AGLI 20 | nsml_agl_c9_dsta | 4 | non-seamless angle 9 relative offset to VOBU for CURRENT ILVU |
| 08d | 060 | HLI_GI 00 | hli_ss | 2 | Highlight status (lower 2 bits only)
00 = No Highlight information for this VOBU 01 = All New Highlight information for this VOBU 10 = Use Highlight information from previous VOBU 11 = Use Highlight information from previous VOBU except commands, which come from this VOBU |
| 08f | 062 | HLI_GI 02 | hli_s_ptm | 4 | Highlight start time |
| 093 | 066 | HLI_GI 06 | hli_e_ptm | 4 | Highlight end time |
| 097 | 06a | HLI_GI 0a | btn_sl_e_ptm | 4 | Button selection end time (ignore user after this) |
| 09b | 06e | HLI_GI 0e | btn_md | 2 | 4 nibbles which describe the grouping of the buttons, see below |
| 09d | 070 | HLI_GI 10 | btn_sn | 1 | starting button number |
| 09e | 071 | HLI_GI 11 | btn_ns | 1 | number of buttons |
| 09f | 072 | HLI_GI 12 | nsl_btn_ns | 1 | number of numerically selected buttons |
| 0a0 | 073 | HLI_GI 13 | --- | 1 | reserved |
| 0a1 | 074 | HLI_GI 14 | fosl_btnn | 1 | force select button number |
| 0a2 | 075 | HLI_GI 15 | foac_btnn | 1 | force action button number |
| 0a3 | 076 | SL_COLI 00 | SL_COLI_1 | 8 | selection and action color and contrast values
each button may be assigned to one of these three schemes details |
| 0ab | 07e | SL_COLI 08 | SL_COLI_2 | 8 | |
| 0b3 | 086 | SL_COLI 10 | SL_COLI_3 | 8 | |
| 0bb | 08e | BTN_IT 00 | btn_it[1:36] | 36*18 | color table number, position, auto action flag, adjacent buttons, and command for 36 buttons
details |
| 343 | 316 | RECI 00 | RECI | ?? | Recording Information (royalty management)* |
| label | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
|---|---|---|---|---|---|---|---|---|
| btn_md btngr_ns btngr1_ty | reserved | reserved | PS | LB | Normal | |||
| btngr2_ty btngr3_ty | reserved | PS | LB | Normal | reserved | PS | LB | Normal |
| offset | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
|---|---|---|---|---|---|---|---|---|
| 0 | emphasis 2 (code=3) selection color | emphasis 1 (code=2) selection color | ||||||
| 1 | pattern (code=1) selection color | background (code=0) selection color | ||||||
| 2 | emphasis 2 (code=3) selection contr | emphasis 1 (code=2) selection contr | ||||||
| 3 | pattern (code=1) selection contr | background (code=0) selection contr | ||||||
| 4 | emphasis 2 (code=3) action color | emphasis 1 (code=2) action color | ||||||
| 5 | pattern (code=1) action color | background (code=0) action color | ||||||
| 6 | emphasis 2 (code=3) action contr | emphasis 1 (code=2) action contr | ||||||
| 7 | pattern (code=1) action contr | background (code=0) action contr |
| offset | 7 | 6 | 5 | 4 | 3 | 2 | 1 | 0 |
|---|---|---|---|---|---|---|---|---|
| 00 | btn_coln button color table number, 0=none | |||||||
| 01 | reserved | ending X position, upper 2 bits | ||||||
| 02 | ||||||||
| 03 | Auto Action flag 0=no, 1=yes | |||||||
| 04 | reserved | ending Y position, upper 2 bits | ||||||
| 05 | ||||||||
| 06 | reserved | AJBTN_POSI_UP button number to select if "Up" is pressed | ||||||
| 07 | reserved | AJBTN_POSI_DN button number to select if "Down" is pressed | ||||||
| 08 | reserved | AJBTN_POSI_LT button number to select if "Left" is pressed | ||||||
| 09 | reserved | AJBTN_POSI_RT button number to select if "Right" is pressed | ||||||
| 0a-11 |
| number | controls affected | PGC | VOBU |
|---|---|---|---|
| 0 | Time play or search | X |   |
| 1 | PTT play or search | X |   |
| 2 | Title play | X |   |
| 3 | Stop | X | X |
| 4 | GoUp |   | X |
| 5 | Time or PTT search | X | X |
| 6 | TopPG or PrevPG search | X | X |
| 7 | NextPG search | X | X |
| 8 | Forward scan | X | X |
| 9 | Backward scan | X | X |
| 10 | Menu call - Title | X | X |
| 11 | Menu call - Root | X | X |
| 12 | Menu call - Subpicture | X | X |
| 13 | Menu call - Audio | X | X |
| 14 | Menu call - Angle | X | X |
| 15 | Menu call - PTT | X | X |
| 16 | Resume | X | X |
| 17 | Button select or activate | X |   |
| 18 | Still off | X | X |
| 19 | Pause on | X | X |
| 20 | Audio stream change | X | X |
| 21 | Subpicture stream change | X | X |
| 22 | Angle change | X | X |
| 23 | Karaoke audio mix change | X | X |
| 24 | Video presentation mode change | X | X |
| Copyright © 2001 - 2016 STN Software, all rights reserved. |


To do
Add a Task
Task
Due
Priority
High
Normal
Low
Description
Please provide a valid entry
All
Active
Complete


Young Coders (or, 'How to Teach Python to Kids')
04:30 PM - 04:55 PM on July 16, 2016, Room CR5Barbara Shaurette
- Audience level:
- intermediate
Description
Since PyCon 2013, interest in the Young Coders class has intensified. Several Python conferences have run their own, and classes outside of conferences - from one-time workshops to after school clubs - have sprung up as well. With more people than ever interested in teaching Python to kids, I'm here to talk about what you'll need to get started, and the immense amount of satisfaction you'll get out of it.
Abstract
This talk is for programmers who are interested in teaching Python to others, regardless of whether or not they've worked with kids before, or whether or not they have teaching experience.
Coding is today's literacy, and too many young students are not being exposed to it at school or home. As Python developers, we have the unique opportunity to share our skills in our local communities and give kids an opportunity to experience something that could change their lives.
Attendees will learn about the tangible requirements for setting up a class (such as financing, and hardware).
More importantly, I hope to show attendees that teaching kids is easier than they think - the only thing they really need is the desire and enough programming experience to be able to explain concepts in simple terms.
Teaching is so exciting - by conveying my experiences, I hope to inspire attendees to use the Young Coders materials to plan their own classes.


Activate Speech Recognition
Say something!
It works!
Click here to read more about SpeechRecognition


Cricket: Sri Lankans touch down in Pakistan
First Test tour in the country in 10 years
by AFPSri Lanka embarked on the first Test cricket tour of Pakistan in 10 years on Monday following the deadly 2009 attack on its team that plunged Pakistan into sporting isolation.
Touchdown Islamabad, tweeted the Pakistan Cricket Board, along with a video of the players at the airport, while PCB chief executive Waseem Khan called their arrival a “historic occasion”.
Sri Lanka will play two Tests under heavy security, one in Rawalpindi — where Pakistan's army is headquartered — and the second in Karachi, ending a decade-long absence for cricket's five-day format.
“This is my first tour of Pakistan,” said Sri Lanka skipper Dimuth Karunaratne, who opted out of the team's recent limited-overs tour of Pakistan.
“After the 2009 incidents players were scared to tour Pakistan but in the last two years or so Sri Lanka and other teams have toured Pakistan.
“We want to play good cricket in Pakistan and hope they give us some good security,” he said.
Sri Lanka, despite being the target of the 2009 attack, has been a driving force behind the return of international cricket after it played six limited-overs matches in Karachi and Lahore in September and October.
The series — the second for both teams in the ongoing World Test Championship — promises to be intriguing, not least because of the tussle between the two coaches: Pakistan's Misbah-ul-Haq and Sri Lanka's Mickey Arthur.
Arthur was Pakistan coach until August when he was axed by the country's cricket officials, who included Misbah, following a disappointing performance at this year's World Cup.
The South African, who was only appointed by Sri Lanka last week, will hope to pile the pressure on Pakistan which coming off a humiliating 2-0 Test thrashing in Australia.
Misbah, who is also Pakistan's chief selector and batting coach, will be under especially heavy scrutiny following Pakistan's run of poor form.