|
document2html
1.0
Documents to HTML converter
|
Contains data for one worksheet. More...
#include <sheet.hpp>
Public Member Functions | |
| Sheet (Book *book, int position, const std::string &name, int number, pugi::xml_node &table) | |
| void | read () |
| Read SHEET data. More... | |
| void | putCell (int rowIndex, int colIndex, const std::string &value, int xfIndex) |
| Add cell data to table. More... | |
| void | tidyDimensions () |
| Add missing cells to table. More... | |
Public Attributes | |
| Book * | m_book |
| pugi::xml_node & | m_table |
| std::string | m_name |
| int | m_number |
| int | m_rowCount = 0 |
| int | m_colCount = 0 |
| std::unordered_map< int, Colinfo > | m_colinfoMap |
| std::unordered_map< int, Rowinfo > | m_rowinfoMap |
| std::vector< std::vector< int > > | m_colLabelRanges |
| std::vector< std::vector< int > > | m_rowLabelRanges |
| std::vector< std::vector< int > > | m_mergedCells |
| std::vector< std::vector< int > > | m_tableParts |
| long int | m_maxRowCount |
| int | m_maxColCount = 256 |
| int | m_dimensionRowCount = 0 |
| int | m_dimensionColCount = 0 |
| int | m_firstFullRowIndex = -1 |
| unsigned short | m_defaultColWidth = 0 |
| unsigned short | m_standardWidth |
| int | m_defaultRowHeight |
| bool | m_isDefaultRowHeightMismatch |
| bool | m_isDefaultRowHidden |
| bool | m_hasDefaultAdditionalSpaceAbove |
| bool | m_hasDefaultAdditionalSpaceBelow |
| std::vector< Hyperlink > | m_hyperlinkList |
| std::map< std::pair< int, int >, Hyperlink > | m_hyperlinkMap |
| std::map< std::pair< int, int >, Note > | m_cellNoteMap |
| std::vector< std::vector< std::string > > | m_cellValues |
| std::vector< std::vector< int > > | m_cellTypes |
| std::vector< std::vector< int > > | m_cellXfIndexes |
| int | m_visibility = 0 |
| unsigned short | m_firstVisibleRowIndex = 0 |
| unsigned short | m_firstVisibleColIndex = 0 |
| std::vector< unsigned char > | m_gridlineColor {0, 0, 0} |
| unsigned short | m_gridlineColorIndex = 0x40 |
| bool | m_showFormula = false |
| bool | m_showGridLine = true |
| bool | m_showSheetHeader = true |
| bool | m_isFrozenPanes = false |
| bool | m_showZeroValue = true |
| bool | m_automaticGridLineColor = true |
| bool | m_columnsRightToLeft = false |
| bool | m_showOutlineSymbol = true |
| bool | m_removeSplits = false |
| bool | m_isSheetSelected = 0 |
| bool | m_isSheetVisible = 0 |
| std::map< std::pair< int, int >, std::vector< std::pair< unsigned short, unsigned short > > > | m_richtextRunlistMap |
| unsigned short | m_vertSplitPos = 0 |
| unsigned short | m_horzSplitPos = 0 |
| unsigned short | m_horzSplitFirstVisible = 0 |
| unsigned short | m_vertSplitFirstVisible = 0 |
| char | m_splitActivePane = 0 |
| bool | m_hasPaneRecord = false |
| std::vector< std::vector< int > > | m_horizontalPageBreaks |
| std::vector< std::vector< int > > | m_verticalPageBreaks |
| std::vector< int > | m_gcw |
| int | m_cookedPageBreakPreviewMagFactor = 60 |
| int | m_cookedNormalViewMagFactor = 100 |
| int | m_cachedPageBreakPreviewMagFactor = 0 |
| int | m_cachedNormalViewMagFactor = 0 |
| bool | m_showPageBreakPreview = 0 |
| int | m_sclMagFactor = -1 |
| int | m_ixfe = 0 |
Private Member Functions | |
| std::string | stringRecordContent (const std::string &data) |
| Get record string content. More... | |
| int | fixedXfIndexB2 (const std::string &cellAttributes, int trueXfIndex=-1) |
| Get fixed BIFF 2 XF index. More... | |
| int | insertXfB20 (const std::string &cellAttributes, bool isStyle=false) |
| Insert new BIFF 2.0 XF. More... | |
| void | fakeXfFromCellAttrB20 (XF &xf, const std::string &cellAttributes, bool isStyle=false) |
| Get fake XF from BIFF 2.0 cell attribute. More... | |
| std::string | getNullTerminatedUnicode (const std::string &buf, int &offset) const |
| Get null-terminated unicode string. More... | |
| void | handleHyperlink (const std::string &data) |
| Read HYPERLINK record. More... | |
| void | handleQuicktip (const std::string &data) |
| Read QUICKTIP record. More... | |
| void | handleMSObj (const std::string &data, MSObj &msObj) |
| Process MSObj object. More... | |
| void | handleMSTxo (const std::string &data, MSTxo &msTxo) |
| Process MSTxo object. More... | |
| void | handleNote (const std::string &data, std::unordered_map< unsigned short, MSTxo > &msTxos) |
| Process NOTE record. More... | |
| void | updateCookedFactors () |
| Update coocked factors. More... | |
| void | unpackCellRangeAddressListUpdatePos (std::vector< std::vector< int >> &outputList, const std::string &data, int &pos, int addressSize=6) const |
| Unpack range of cells address list and update position. More... | |
| double | unpackRK (const std::string &data) const |
| Unpack RK record data. More... | |
| void | addCellStyle (pugi::xml_node &node, const XF &xf, int rowIndex, int colIndex) |
| Add style to cell node in HTML-tree. More... | |
| void | addRowStyle (pugi::xml_node &node, int rowIndex) |
| Add style to table row. More... | |
| void | addColStyle (pugi::xml_node &node, int colIndex) |
| Add style to table column. More... | |
| std::string | getColor (const XFColor &color) const |
| Get object color from XFColor record. More... | |
| void | getTableColor (std::string &style, const std::vector< std::string > &colorMap, int colorIndex) const |
| Get table color value. More... | |
Private Attributes | |
| int | m_position |
| std::unordered_map< std::string, int > | m_cellAttributesToXfIndex |
Contains data for one worksheet.
| excel::Sheet::Sheet | ( | Book * | book, |
| int | position, | ||
| const std::string & | name, | ||
| int | number, | ||
| pugi::xml_node & | table | ||
| ) |
|
private |
Add style to cell node in HTML-tree.
| [out] | node | Cell node in HTML-tree |
| [in] | xf | Parent XF |
| [in] | rowIndex | Row index |
| [in] | colIndex | Column index |
|
private |
Add style to table column.
| [out] | node | Cell node in HTML-tree |
| [in] | colIndex | Column index |
|
private |
Add style to table row.
| [out] | node | Cell node in HTML-tree |
| [in] | rowIndex | Row index |
|
private |
|
private |
|
private |
|
private |
Get null-terminated unicode string.
| [in] | buf | Binary data |
| [in] | offset | Record start position |
|
private |
Get table color value.
| [out] | style | Result style value |
| [in] | colorMap | Color map |
| [in] | colorIndex | Color index |
|
private |
Read HYPERLINK record.
| [in] | data | Binary data |
|
private |
|
private |
|
private |
|
private |
Read QUICKTIP record.
| [in] | data | Binary data |
|
private |
| void excel::Sheet::putCell | ( | int | rowIndex, |
| int | colIndex, | ||
| const std::string & | value, | ||
| int | xfIndex | ||
| ) |
Add cell data to table.
| [in] | rowIndex | Row index |
| [in] | colIndex | Column index |
| [in] | value | Cell value |
| [in] | xfIndex | XF index |
| void excel::Sheet::read | ( | ) |
Read SHEET data.
|
private |
Get record string content.
| [in] | data | Binary data |
| void excel::Sheet::tidyDimensions | ( | ) |
Add missing cells to table.
|
private |
Unpack range of cells address list and update position.
| [out] | outputList | Array in which address will be saved |
| [in] | data | Binary data |
| [in] | pos | Record start position |
| [in] | addressSize | Address size |
|
private |
Unpack RK record data.
| [in] | data | Binary data |
|
private |
Update coocked factors.
Cached values are used ONLY for non-active view mode. When user switches to non-active view mode, if cached value for that mode is not valid, Excel pops up a window which says: "The number must be between 10 and 400. Try again by entering a number in this range." When user hits OK, it drops into non-active view mode but uses the magn from active mode
| Book* excel::Sheet::m_book |
Pointer to parent BOOK object
| int excel::Sheet::m_cachedPageBreakPreviewMagFactor = 0 |
Values (if any) actually stored on the XLS file
|
private |
Maps cell attributes to XF index. BIFF2.0 only
| std::map<std::pair<int, int>, Note> excel::Sheet::m_cellNoteMap |
Mapping from (rowIndex, colIndex)
to NOTE object. Cells not containing a note ("comment") are not mapped
| std::vector<std::vector<std::string> > excel::Sheet::m_cellValues |
Contains data for one cell. Cell objects have three attributes: type
is an int, value
(which depends on type
) and xfIndex
. The following table describes types of cells and how their values are represented
| Type symbol | Type number | Value |
|---|---|---|
| XL_CELL_EMPTY | 0 | Empty string |
| XL_CELL_TEXT | 1 | Unicode string |
| XL_CELL_NUMBER | 2 | Float |
| XL_CELL_DATE | 3 | Float |
| XL_CELL_BOOLEAN | 4 | Bool: 0 => False; 1 => True |
| XL_CELL_ERROR | 5 | Int representing internal Excel codes |
| XL_CELL_BLANK | 6 | Empty string. Only when m_addStyle = true |
| int excel::Sheet::m_colCount = 0 |
Nominal number of columns in sheet. It is one more than maximum column index found, ignoring trailing empty cells
| std::unordered_map<int, Colinfo> excel::Sheet::m_colinfoMap |
Map from column index to COLINFO object. Often there is an entry in COLINFO records for all column indexes in range(257)
| std::vector<std::vector<int> > excel::Sheet::m_colLabelRanges |
| int excel::Sheet::m_cookedPageBreakPreviewMagFactor = 60 |
Values calculated to predict mag factors that will actually be used by Excel to display worksheet. Pass these values to when writing XLS files. Warning 1: Behaviour of OOo Calc and Gnumeric has been observed to differ from Excel's. Warning 2: A value of zero means almost exactly what it says. Your sheet will be displayed as very tiny speck on the screen
| unsigned short excel::Sheet::m_defaultColWidth = 0 |
Default column width from DEFCOLWIDTH record, else None
. From the OOo docs: Column width in characters, using width of zero character from default font (first FONT record in file). Excel adds some extra space to the default width, depending on default font and default font size. Algorithm how to exactly calculate resulting column width is not known. Example:
| int excel::Sheet::m_defaultRowHeight |
Default value to be used for row if there is no ROW record for that row. From optional DEFAULTROWHEIGHT
record
| int excel::Sheet::m_dimensionColCount = 0 |
Dimension column count as per DIMENSIONS record
| int excel::Sheet::m_dimensionRowCount = 0 |
Dimension row count as per DIMENSIONS record
| int excel::Sheet::m_firstFullRowIndex = -1 |
First full row index
| unsigned short excel::Sheet::m_firstVisibleColIndex = 0 |
First visible column index
| unsigned short excel::Sheet::m_firstVisibleRowIndex = 0 |
First visible row index
| std::vector<int> excel::Sheet::m_gcw |
256-element tuple corresponding to contents of GCW record for this sheet. If no such record, treat as all bits zero. Applies to BIFF4-7 only
| std::vector<unsigned char> excel::Sheet::m_gridlineColor {0, 0, 0} |
Grid line color. Pre-BIFF8
| unsigned short excel::Sheet::m_gridlineColorIndex = 0x40 |
Grid line color index
| bool excel::Sheet::m_hasDefaultAdditionalSpaceAbove |
If cells have default additional space above
| bool excel::Sheet::m_hasDefaultAdditionalSpaceBelow |
If cells have default additional space below
| bool excel::Sheet::m_hasPaneRecord = false |
Boolean specifying if PANE record was present
| std::vector<std::vector<int> > excel::Sheet::m_horizontalPageBreaks |
List of horizontal page breaks in this sheet. Breaks are tuples in the form (index of row after break, start column index, end column index)
| unsigned short excel::Sheet::m_horzSplitFirstVisible = 0 |
Index of first visible row in bottom frozen/split pane
| unsigned short excel::Sheet::m_horzSplitPos = 0 |
Number of rows in top pane (frozen panes)
| std::vector<Hyperlink> excel::Sheet::m_hyperlinkList |
List of HYPERLINK objects corresponding to HLINK records found in worksheet
| std::map<std::pair<int, int>, Hyperlink> excel::Sheet::m_hyperlinkMap |
Mapping from (rowIndex, colIndex)
to item in m_hyperlinkList. Cells not covered by hyperlink are not mapped. It is possible using the Excel UI to set up a hyperlink that covers larger-than-1x1 rectangle of cells. Hyperlink rectangles may overlap (Excel doesn't check). When a multiply-covered cell is clicked on, hyperlink that is activated (and the one that is mapped here) is the last in Sheet::m_hyperlinkList
| bool excel::Sheet::m_isDefaultRowHeightMismatch |
Default row height mismatch
| Value | Description |
|---|---|
| False | Default row height and default font height are equal |
| True | Default row height and default font height do not match |
| bool excel::Sheet::m_isDefaultRowHidden |
If default row is hidden
| bool excel::Sheet::m_isSheetSelected = 0 |
If sheet is selected. Multiple sheets can be selected, but only one can be active
| bool excel::Sheet::m_isSheetVisible = 0 |
Should really be called "sheetActive" and is 1 when this sheet is sheet displayed when file is open. More than likely only one sheet should ever be set as visible. This would correspond to Book's sheetActive attribute, but that doesn't exist as WINDOW1 records aren't currently processed. The real thing is the visibility attribute from BOUNDSHEET record
| int excel::Sheet::m_maxColCount = 256 |
Max column count
| long int excel::Sheet::m_maxRowCount |
Max row count
| std::vector<std::vector<int> > excel::Sheet::m_mergedCells |
| std::string excel::Sheet::m_name |
Sheet name
| int excel::Sheet::m_number |
Sheet number
|
private |
Sheet record start position
| std::map<std::pair<int, int>, std::vector<std::pair<unsigned short, unsigned short> > > excel::Sheet::m_richtextRunlistMap |
Mapping of (rowIndex, colIndex)
to list of (offset, fontIndex)
tuples. Offset defines where in string the font begins to be used. Offsets are expected to be in ascending order. If first offset != zero, the meaning is that cell's XF font should be used from offset 0. This is a sparse mapping. There is no entry for cells that are not formatted with rich text
| int excel::Sheet::m_rowCount = 0 |
Number of rows in sheet
| std::unordered_map<int, Rowinfo> excel::Sheet::m_rowinfoMap |
Map from row index to ROWINFO object. It is possible to have missing entries - at least one source of XLS files doesn't bother writing ROW records
| std::vector<std::vector<int> > excel::Sheet::m_rowLabelRanges |
List of address ranges of cells containing row labels
| bool excel::Sheet::m_showFormula = false |
Sheet flags
| Bit | Mask | Contents |
|---|---|---|
| 0 | 0001H | 0 = Show formula results 1 = Show formulas |
| 1 | 0002H | 0 = Do not show grid lines 1 = Show grid lines |
| 2 | 0004H | 0 = Do not show sheet headers 1 = Show sheet headers |
| 3 | 0008H | 0 = Panes are not frozen 1 = Panes are frozen (freeze) |
| 4 | 0010H | 0 = Show zero values as empty cells 1 = Show zero values |
| 5 | 0020H | 0 = Manual grid line color 1 = Automatic grid line color |
| 6 | 0040H | 0 = Columns from left to right 1 = Columns from right to left |
| 7 | 0080H | 0 = Do not show outline symbols 1 = Show outline symbols |
| 8 | 0100H | 0 = Keep splits if pane freeze is removed 1 = Remove splits if pane freeze is removed |
| 9 | 0200H | 0 = Sheet not selected 1 = Sheet selected (BIFF5-BIFF8) |
| 10 | 0400H | 0 = Sheet not visible 1 = Sheet visible (BIFF5-BIFF8) |
| 11 | 0800H | 0 = Show in normal view 1 = Show in page break preview (BIFF8) |
| char excel::Sheet::m_splitActivePane = 0 |
Frozen panes: ignore it. Split panes: explanation and diagrams in OOo docs
| unsigned short excel::Sheet::m_standardWidth |
Default column width from STANDARDWIDTH record, else None
. From the OOo docs: Default width of columns in 1/256 of width of zero character, using default font (first FONT record in the file)
| pugi::xml_node& excel::Sheet::m_table |
Result HTML table
| std::vector<std::vector<int> > excel::Sheet::m_tableParts |
Table parts style list in format: (row1, col1, row2, col2, styleId)
| std::vector<std::vector<int> > excel::Sheet::m_verticalPageBreaks |
List of vertical page breaks in this sheet. Breaks are tuples in the form (index of column after break, start row index, end row index)
| unsigned short excel::Sheet::m_vertSplitFirstVisible = 0 |
Index of first visible column in right frozen/split pane
| unsigned short excel::Sheet::m_vertSplitPos = 0 |
Number of columns in left pane (frozen panes)
| int excel::Sheet::m_visibility = 0 |


There has been an error. Please e-mail the below to our support team then return to the home page.
Description:
{{errorDescription}}
{{errorUri}}
{{errorMsg}}


random thoughts
Friendship on a pedestal.
A recent crush on a school friend made me write this post.
Unfinished: I don’t want to be sad.
Unfinished write-up of when I was feeling pretty sad.
Unfinished: Now I hate my current job?
Unfinished write-up of my emotions towards my job. I have since resigned and feel way more at peace.
The blame game in society.
The situation with GitHub and US sanction trade laws made me feel the need to write this post.
The dilemma between power and peace.
The situation in Sudan currently has made me feel the need to write this post.

My first failed suicide attempt.
I am in a really dark place and I need to vent out my emotions, it is too much to handle.
An immense hope in hopelessness.
I feel extremely hopeless so I need to vent out my thoughts and come to terms with it.
Death
I feel like discussing the way I view death and share my thought on losing someone who was more than an acquaintance.
My First Ever (Online) Write-Up
This is me trying to write my first online, public facing write-up for the world to see.
death
Death
I feel like discussing the way I view death and share my thought on losing someone who was more than an acquaintance.
hopelessness
An immense hope in hopelessness.
I feel extremely hopeless so I need to vent out my thoughts and come to terms with it.
suicide
My first failed suicide attempt.
I am in a really dark place and I need to vent out my emotions, it is too much to handle.


Computer Club Syllabus
What you will learn:
You will learn how to program in HTML, XML, Lua, Javascript,-making, and other fun activities, website making and more!
Note: No homework will be given because this is a club.
This includes Codecademy, GitHub for website making, Roblox Studio for Lua, and learning how to type faster to improve your WPM
You will be learning more later in the school year, suggestions are always welcome
Rules you are expected to follow
No running in the computer lab.
Wait outside of the room for the sponsor to come, we don't want the counselor to be disturbed by us; so don't be loud.
Do not be loud while you are learning.
You will get your computer login credentials on the first day, so do not keep asking for them.
Do not play games unless you are allowed to
A typing warmup will be your warmup whenever the club starts
No chatting unless we are coding something related to that or something...
People you can contact for help will be listed below.
You will now agree to the rules, meaning you understand the rules by putting a check on the box.
I agree to all the rules above
When and what time the club is:
If you do not want to be used in videos published to yearbook, write your name here please.
Time: 3.05 PM - 5.00 PM
Now if you are signed up for CRLP, it will be on Thursdays 3 - 5.20 PM
When: Tuesdays
Rishi Vaka
Mr. Binbir
Jazhiel Segura-Monroy
Email to contact Rishi<EMAIL_ADDRESS>to contact Mr. Binbir, bbinbir@harmonytx.org


Dockerized email
Managing my own email server with the following setup. Read here for more details.
Source of the docker image is on GitHub.
Web 1.0 version of Wordle/Lingo
Web 1.0 (no react and fancy stuff) clone of wordle/lingo supporting 4 languages:
- English
- Dutch
- Russian
- Tatar
Sources are on GitHub.
Auto solver is part of the game:
- When the field is empty, click 3 times on DEL, followed by 3 clicks on ENTER.
- Or execute solve() in browser console.
LongWarn
A tiny shell script to fail a job and trigger a notification if a cronjob takes longer than desired.
If a job takes longer than expected, for example a backup job usually takes a few seconds, For example a backup job usually runs under 1 minute. If you want to get notified when this job runs longer, just add it to crontab:
<EMAIL_ADDRESS>11 11 * * * longwarn 60 backup.sh
How to install:
wget https://raw.githubusercontent.com/sharifmarat/longwarn/master/longwarn -O /usr/local/bin/longwarn
Flickr roulette
See a random (not completely random) photo on the Flickr roulette.
Site percolation
Simulation of percolation theory to find if there is a path connecting left side of the grid to the right side via open pixels and to estimate percolation threshold (site percolation).
Animated svg viewer
Simple svg viewer which can load multiple svgs and animate them one after another
C-bindings generator from Fortran
It was written to automate generation of C bindings for Fortran, source code can be found here.
! Example of input Fortran90 code:
module SomeModule
use iso_c_binding
implicit none
real*8, bind(c), parameter :: dbl1 = 1.0d0
type(c_ptr), bind(c, name="ptr1") :: ptr1
contains
integer function SimpleFunction1() bind(c, name="SimpleFunction1")
integer :: a
integer b
integer :: c
!...
end function SimpleFunction1
end module SomeModule
// Generated C-bindings:
#ifdef __cplusplus
extern "C" {
#endif
typedef void* some_ptr_t;
typedef double val_t;
double dbl1;
void* ptr1;
int SimpleFunction1();
#ifdef __cplusplus
}
#endif


Depth 1
Depth 2
Depth 3
Depth 4
Depth 5
Lorem ipsum dolor sit amet, consectetur adipisicing elit. Reiciendis ipsam excepturi rerum ut, soluta fugit numquam alias dignissimos inventore aspernatur, delectus optio fugiat, autem. Ea rerum qui et consequuntur ex.
 I am good at containing small bits of information. I am convenient because I require little markup to use effectively.
I am a very simple card. I am good at containing small bits of information. I am convenient because I require little markup to use effectively.
I am a very simple card. I am good at containing small bits of information.


You need sufficient QCC in your organization to give QCC rewards.
Follow these steps to reward a discussion or comment:
- Log in to your account.
- On the forum page, open the discussion that you want to give your reward.
- If you want to give a QCC reward, follow these steps:
- On the discussion page, if you want to reward the discussion, click Reward Discussion. If you want to reward a comment, on the comment you want to reward, click Reward Answer.
- Click a QCC reward.
- Click Send Reward.
The reward displays and the QCC value of the reward is deducted from your organization's balance.


Dear CP_FIRSTNAME,
Thanks for the confidence. We are looking forward to meeting you. Find details and directions below.
BOOKING DETAILS:
Name: CP_NAME
Email: CP_EMAIL
Phone: CP_PHONE
Activity: CP_ACTIVITY
Date: CP_ACTDATE
Adults: CP_NUMADULTS
Children: CP_NUMCHILDREN
Price: €CP_PRICE
Food Restrictions:
CP_FOODRESTRICTIONS
Comments:
CP_COMMENTS
Status: CP_STATUS
MEETING POINT:
Cooking Point
Calle de Moratin, 11 28014 Madrid
tel. +34910115154
Should you have any question, please let us know.
Thank you,
cooking point team
Cooking Point
(+34) 910 115 154
cookingpoint.es
CP_RANDOM


31 December 2009 – 31 December 2013 Summary Balance Sheet and Income Statement
(TL million)
ASSETS |
2009 |
2010 |
2011 |
2012 |
2013 |
|---|---|---|---|---|---|
Liquid Assets |
14,604 |
14,907 |
15,593 |
22,647 |
29,067 |
Securities Portfolio |
70,988 |
76,352 |
70,766 |
65,469 |
62,798 |
Loans |
36,725 |
57,443 |
71,430 |
71,426 |
111,048 |
Associates and Subsidiaries |
715 |
731 |
810 |
1,034 |
1,298 |
Fixed Assets |
816 |
826 |
930 |
931 |
1,050 |
Other Assets |
681 |
901 |
1,152 |
1,360 |
2,269 |
TOTAL |
124,529 |
151,160 |
160,681 |
162,868 |
207,530 |
|
|||||
LIABILITIES |
|||||
Deposits |
98,529 |
125,796 |
113,067 |
118,966 |
141,735 |
Money Markets |
9,144 |
5,003 |
25,788 |
11,162 |
24,571 |
Loans Borrowed |
21 |
99 |
553 |
3,072 |
8,559 |
Marketable Securities Issued |
0 |
0 |
0 |
1,944 |
2,637 |
Funds |
3,245 |
3,525 |
3,871 |
4,292 |
4,036 |
Provisions |
1,704 |
1,228 |
1,892 |
3,002 |
3,958 |
Other Liabilities |
1,532 |
2,051 |
2,332 |
3,261 |
3,666 |
Shareholders’ Equity |
10,354 |
13,458 |
13,177 |
17,167 |
18,367 |
TOTAL |
124,529 |
151,160 |
160,681 |
162,868 |
207,530 |
|
|||||
STATEMENT OF INCOME |
|||||
Interest Income |
14,203 |
12,392 |
13,706 |
14,811 |
14,370 |
Interest Expense |
8,134 |
7,036 |
8,465 |
7,910 |
6,631 |
Net Interest Income |
6,069 |
5,356 |
5,242 |
6,901 |
7,739 |
Fees and Commissions Income (net) |
437 |
511 |
626 |
752 |
959 |
Dividend Income |
27 |
34 |
32 |
98 |
321 |
Trading Profit/Loss (Net) |
61 |
-13 |
-61 |
-52 |
-198 |
Other Operating Income |
350 |
977 |
372 |
429 |
1,048 |
Total Operating Income |
6,944 |
6,864 |
6,210 |
8,128 |
9,868 |
Provisions for Loans and Other Receivables |
632 |
145 |
808 |
1,795 |
1,828 |
Other Operating Expenses |
1,895 |
2,250 |
2,622 |
2,828 |
3,661 |
Pretax Profit |
4,417 |
4,469 |
2,780 |
3,505 |
4,379 |
Tax Provision |
906 |
757 |
679 |
854 |
1,048 |
Net Profit/Loss for the Period |
3,511 |
3,713 |
2,101 |
2,650 |
3,330 |


regexsearch, regexsubstitute, regexextract − RWP*Load Simulator regular expression statements
regexsearch ::=
regex concatenation , concatenation ,
identifier { , identifier }
regexsubstitute
::=
regexsub concatenation , concatenation ,
concatenation , identifier
| regexsubg concatenation , concatenation
, concatenation , identifier
regexextract
::=
regexextract concatenation , concatenation
, identifier { , identifier }
The regex search statement searches for one or more appearances of a regular expression in a concatenation, and saves matches into variables.
The regex substitute statements search for a regular expression in a concatenation and replaces the first or all occurrences of it by a replacement concatenation returning the result in a variable.
The regex extract statement searches for a regular expression in a concatenation and extracts parenthesized sub-expressions into variables.
These functions all use extended regular expressions (modern in POSIX terminology) and are implemented using regex(3) with cflags set to REG_EXTENED at the call to regcomp(3). The first statement is similar to egrep(1), the two substitute statements are similar to the s command in sed(1).
regex r,s,v1 [,v2 ...]
The value, r, must be an extended regular expression, which will be used to search s. The first, second, etc occurrence of the regular expression r in s will be saved in the identified variables. If there are no matches, the first (and compulsory) variable will be null. If there are fewer matches than variables, those not filled will be null. The variables can be of type integer, double or string, and even a variable of string will be null if no match is assigned to it.
regexsub r,s,n,v
regexsubg r,s,n,v
These statements require three concatenations that are string values, r, s and n, and one identifier, v. The extended regular expression, r, will be used to search s, in which any occurrence of r will be substituted by n. The identifier, v, must be a string variable and the result of the substitution will be saved in this variable. If there is no match, the variable will be set to null. In the replacement string, n, \N where N is a single digit refers to the N’th parenthesized sub-expression in the regular expression, r; see regex(3) for details. Note that if you code n as a string constant, the single \ must be escaped and therefore written \\. The difference between regexsub and regexsubg is that the former only replaces the first occurrence of r in s by n, the latter replaces all.
regexextract r,s,v1 [,v2 ...]
The value, r, must be an extended regular expression including parenthesized sub-expression, which will be used to search s. Each parenthesized sub-expression will be saved in the identified variables. If there is no match, the first (and compulsory) variable will be null. If there are fewer parenthesized sub-expressions than variables, those not filled will be null and a warning will be printed. The variables can be of type integer, double or string, and even a variable of string will be null if no match is assigned to it.
The first example shows how the regex statement can be used to extract integers from a string. The output will be the values 12 and 34.
integer a,b;
regex "[0-9]+", "ab12cd34ef56", a,b;
printline a,b;
When executing this second example
string res;
# replace all o by O
regexsubg "o", "hello
world","O",res;
printline res;
# reverse two words consisting of a-z
regexsub "([a-z]+) ([a-z]+)", "hello
world", "\\2 \\1",res;
printline res;
the output will be these two lines:
hellO wOrld
world hello
The last example shows how regexextract can be used to extract two white-space delimited words from a string and print them in the opposite order with a - between them:
string s,t;
regexextract "([a-z]+)[ \t]+([a-z]+)",
"!hello world42", s,t;
printline t "-" s;
which will produce this output:
world-hello
Copyright
© 2021 Oracle Corporation
Licensed under the Universal Permissive License v 1.0 as
shown at https://oss.oracle.com/licenses/upl
statement(1rwl), variable(1rwl), concatenation(1rwl)


Two German students arrested for ‘unlawful assembly’ over Hong Kong protests
by AFPTwo German students were arrested in Hong Kong for “unlawful assembly” linked to ongoing unrest in the city, police said early Saturday.
The students, aged 22 and 23, were arrested on Thursday for suspected participation in an illegal assembly, police said.
Police did not release their identities but said the 22-year-old also faces charges of violating Hong Kong’s anti-mask regulation.
In Berlin, the German foreign ministry confirmed the arrests but also did not release their identities or mention the charges.
“Our consulate in Hong Kong is providing consular care to those affected and is in contact with a lawyer and local authorities,” a ministry source told AFP.
According to Germany’s mass market Bild newspaper, citing unnamed Hong Kong activists, the two are exchange students at Hong Kong’s Lingnan University.
Lingnan — formerly Lingnan College — “is the only public liberal arts university in Hong Kong,” according to the university’s website.
Hong Kong has seen relentless protests since June as many in the city of 7.5 million people have vented fury at eroding freedoms under Chinese rule.
Universities have become a hub for the protesters — the first time a movement characterised by its fluidity and unpredictability has coagulated in fixed locations.
Violence has escalated, and tensions have spilt out overseas, sparking friction between China and Britain, which governed Hong Kong until 1997.
Hong Kong Free Press relies on direct reader support. Help safeguard independent journalism and press freedom as we invest more in freelancers, overtime, safety gear & insurance during this summer’s protests. 10 ways to support us.


Muslim extremists promoting Maoists: CPM leader
Congress, IUML object to CPM leader Mohanan’s remark
by Arjun RaghunathA CPM leader in Kerala has triggered a row by alleging that some Muslim extremist organisations were supporting Maoists in the state.
“Islamic extremists were now promoting Maoists in Kerala. The presence of Maoists in Kozhikode district was with the backing of Muslim extremist organisations based out of the district. They were watering the Maoists and make them take a weapon against the government. The police should probe into these incidents,” P Mohanan, Kozhikode district president, said while addressing a public meeting.
Mohanan comments came in the backdrop of recent arrest of two Left party workers of Kozhikode — Alan Suhaib and Taha Fazal — for alleged Maoist links and invoking Unlawful Prevention of Activities Act against them.
The Congress and one of its key coalition partner in Kerala, Indian Union Muslim League, raised strong objections against the CPM leader’s statement and demanded the party leadership to clarify the party stand.
Putting the CPM-led state government in the defensive over the statement, Kerala Opposition leader Ramesh Chennithala of the Congress demanded the government to clarify if Muslim extremist organisations were operating in Kerala.
IUML legislative party leader M K Muneer condemned the ‘Muslim extremist’ remark. “The CPM should clarify which organisation was supporting Maoists in Kerala,” Muneer said.
He also accused that it was the CPM that has become the shelter for Maoists in Kerala.
BJP leader Kummanam Rajasekharan also welcomed Mohanan’s statement.
The fresh row came at a time when CPM national leaders also expressed differences over invoking the UAPA against CPM workers for their alleged links with Maoists.


- Section 1: Wednesday, February 10, 2021
- Section 2: Thursday, February 11, 2021
Overview
Today we put all of our tools together thus far to solve the consumer’s constrained optimization problem. To solve the problem the “traditional way” would be to use Lagrangian multipliers and calculus and solve for the first order conditions.1 We instead will find the solution by looking graphically, and use an algebraic rule that should make a lot of intuitive sense. That rule, equivalently expressed in two ways:
\[ \begin{align*}\frac{MU_x}{MU_y} &= \frac{p_x}{p_y}\\ \frac{MU_x}{p_x} &= \frac{MU_y}{p_y}\\ \end{align*} \] The first rule states that the slope of the indifference curve (left) equals the slope of the budget constraint (right). This is stating that the marginal benefit of consuming \(x\) (left) equals the marginal cost (right) of consuming \(y\), and that the individual is trading off \(y\) for \(x\) at the same rate as the market is.
The second (version of the) rule, solved for \(x\) and \(y\) terms on either side, shows that the marginal utility per dollar spent is equal across both (all) goods.
Both forms are often called the equimarginal rule, that at the optimum choice, the marginal benefit equals the marginal cost (which is the marginal benefit of the next best foregone opportunity).
We will do some practice to make sure you can solve this type of model, and then you are fully prepared for Problem Set 1.
Readings
- Ch. 4.4-4.5 in Goolsbee, Levitt, and Syverson, 2019
- Math Review Guide
Practice
Today we will be working on practice problems. Answers will be posted later on that page.
Assignments
Problem Set 1 Due Wed Feb 17
Problem set 1 (on 1.1-1.4) is due by 11:59 PM Wednesday February 17 by PDF upload to Blackboard Assignments.
Math Appendix
Solving the Constrained Optimization Problem with Calculus
Example
A consumer has a utility function of \[u(x, y) = xy\] and faces prices of \(p_x = 5\), \(p_y = 10\), and has an income of \(m = 50\). Find the consumer’s optimum consumption bundle.
The problem can be expressed as
\[\max_{x,y} xy\] \[s. t. 5x+10y=50\]
There are a few strategies you can use to solve this problem using calculus.
Substitution Method: take the budget constraint and solve it for one good in terms of the other good and income. Let’s solve for \(x\):
\[\begin{align*} 5x+10y&=50 && \text{The budget constraint}\\ 5x&=50-10y && \text{Subtracting } 10y \text{ from both sides}\\ x&=10-2y && \text{Dividing both sides by 5}\\ \end{align*}\]
Now we can plug this in for \(x\) in the utility function to get an unconstrained maximization problem:
\[\begin{align*} \max_{y} (10-2y)y && \text{Plugging into the original utility function}\\ \max_{y} 10y-2y^2 && \text{Distributing the }y\\ \end{align*}\]
Then we take the derivative with respect to \(y\) and set it equal to zero to find the maximum value of \(y\) in the function.
\[\begin{align*} u&=10y-2y^2 && \text{The new utility function}\\ \frac{d u}{d y} = 10-4y&=0 && \text{Taking the first derivative} \\ 10&=4y && \text{Adding } 4y \text{ to both sides}\\ 2.5&=y && \text{Dividing both sides by } 4\\ \end{align*}\]
Now that we know \(y\) is 2.5. To find \(x\), plug 2.5 in for \(y\) in the first equation we found from the budget constraint:
\[\begin{align*} x&=10-2y && \text{The equation}\\ x&=10-2(2.5) && \text{Plugging in 2.5}\\ x&=10-5 && \text{Distributing the -2}\\ x&=5 && \text{Simplifying}\\ \end{align*}\]
So we’ve found the optimal bundle is 5 of \(x\) and 2.5 of \(y\), or (\(x^*,y^*)=(5,2.5)\).
Lagrangian Method: Recall the Lagrangian adds the objective function and the Lagrange multiplier \((\lambda)\) times the constraint set equal to 0:
\[\max_{x, y, \lambda} \Lambda(x, y, \lambda)=xy+\lambda(5x+10y-50)\]
Solving for the First Order Conditions (setting all partial derivatives to 0):
\[\begin{align*} \frac{\partial \Lambda}{\partial x} &= y+5\lambda &= 0 \\ \frac{\partial \Lambda}{\partial y} &= x+10\lambda &= 0 \\ \frac{\partial \Lambda}{\partial \lambda} &= 5x+10y-50 &= 0 \\ \end{align*}\]
Taking the first two equations, and rearranging each to equal \(\lambda\):
\[\begin{align*} \frac{y}{5}&=\lambda \\ \frac{x}{10}&=\lambda \\ \end{align*}\]
Setting them equal to one another, and solving for \(x\):
\[\begin{align*} \frac{y}{5}&=\frac{x}{10} \\ 2y&=x \\ \end{align*}\]
So the consumer will buy twice the amount of \(y\) as \(x\) (note this should be intuitive as \(y\) costs twice as much as \(x\)!). To find the exact amounts of \(x\) and \(y\) she will buy, plug what we just found into the budget constraint:
\[\begin{align*} 5(2y)+10y&=50 \\ 20y&=50 \\ y&=2.5 \\ \end{align*}\]
Since we now know \(y^*\), we can find \(x^*\):
\[\begin{align*} x&=2y\\ x&=2(2.5)=5 \\ \end{align*}\]
So the optimum consumption bundle (\(x^*, y^*\)) again is (5,2.5).
You may be asking: so what in the world is \(\lambda\)? Besides being instrumental in solving constrained optimization problems, the Lagrangian multiplier \(\lambda\) does have some economic interpretation. First, let’s return to the FOCs, knowing \(x\) and \(y\), to solve for \(\lambda\):
\[\begin{align*} y+5\lambda &=0\\ 2.5+5\lambda &=0\\ \lambda &=0.5 \\ \end{align*}\]
Mathematically, it can be proved that \(\lambda=\displaystyle \frac{\partial u(x,y)}{\partial m}\): the rate of instantaneous change in your objective function with respect to your constraint (i.e. your income). That is, if you were to change your constraint (i.e. your income) by one unit, \(\lambda\) tells us how much your objective function would increase (in units of the objective function).
Economically, it is known as the “shadow price,” or sometimes the “marginal utility of wealth.” It tells us how much your utility would increase if you were able to increase your constraint (income) by one unit (e.g. $1). Alternatively, we can think of it as the marginal benefit of relaxing the constraint (having $1 more to spend), or the marginal cost of strengthening the constraint (having $1 less).
In our example, \(\lambda=0.5\), so if we had one +(-)$1 in income to spend, utility would increase(decrease) by 0.5.
Recall that since utility is ordinal and not cardinal, the number of “utils” your utility were to change by is meaningless. \(\lambda\) does have meaningful quantitative interpretations when we use constrained optimization to talk about production, where units are dollars and output, rather than dollars and utility.
Let’s lastly confirm that this is the optimum using the definition
\[\begin{align*} |MRS| &= |\frac{p_x}{p_y}| && \text{At the optimum, slopes of I.C. and B.C. are equal}\\ \frac{MU_{x}}{MU_{y}}&=\frac{p_x}{p_y} && \text{Definition of each slope}\\ \frac{y}{x} &= \frac{p_x}{p_y} && \text{MU's for this specific utility function}\\ \frac{(2.5)}{(5)} &= \frac{5}{10} && \text{At optimum, } y=2.5, x=5\\ \frac{1}{2} &= \frac{1}{2} && \checkmark \end{align*}\]
General Case for \(n\) Goods & Marshallian Demand Functions
In the case of \(n\) number of goods (from good \(x_1\) to \(x_n)\), the optimal consumption portfolio solves the utility maximization problem:
\(\max_{x_1,\cdots,n_n}U(x_1,\cdots, x_n)\) \(s.t. \sum^{n}_{i=1} x_ip_i \leq m\)
That is, as usual, choosing the consumption bundle that maximizes utility, subject to the budget constraint.
Using the Lagrangian method, the Lagrangian is:
\[\mathbb{L} = U(x_i, \cdots, x_n)+\lambda(M - \sum_{i=1}^{n} x_ip_i)\]
The first order conditions are a series of \(n+1\) equations, with \(n+1\) unknowns:
\[\begin{align*} \frac{\partial u}{\partial x_1} &= \lambda p_i\\ \vdots\\ \frac{\partial u}{\partial x_n} &= \lambda p_n\\ \sum^{n}_{i=1} x_ip_i &= m\\ \end{align*}\]
Solving for each individual \(x_i^*\) gives us a Marshallian Demand System:
\[\begin{align*} x_1^* &= x_1^M(p_1,\cdots,p_n,m)\\ \vdots\\ x_n^* &= x_n^M(p_1,\cdots,p_n,m)\\ \lambda^* &= \lambda^M(p_1,\cdots,p_n,m)\\ \end{align*}\]
Each equation here is a demand function for that respective good, as a function of all market prices \((p_1, \cdots, p_n)\) and income \(m\).
Take the full Lagrangian equation and solve for all partial derivatives, set equal to 0.↩


Package org.apache.sis.storage
Interface Aggregate
-
- All Superinterfaces:
Resource
- All Known Subinterfaces:
WritableAggregate
- All Known Implementing Classes:
GeoTiffStore
,NetcdfStore
,SQLStore
public interface Aggregate extends Resource
A collection of resources. An aggregate can have any number of components. Each component can be another aggregate, thus forming a tree of resources. Different kinds of aggregate may exist for various reasons, for example (adapted from ISO 19115):- Series: a generic collection of resources that share similar characteristics
(theme, date, resolution, etc.). The exact definition is determined by the data provider.
See
ScopeCode.SERIES
for more examples. - Sensor series: a collection of resources observed by the same sensor.
- Platform series: a collection of resources observed by sensors installed on the same platform. The components of a platform series are sensor series. Those components usually share the same geospatial geometry.
- Production series: a collection of resources produced using the same process. Members of a production series share lineage and processing history.
- Initiative: a collection of resources related by their participation in a common initiative.
- Transfer aggregate: a set of resources collected for the purpose of transfer. The components may be the results of an ad hoc query, for example on a Web Service.
DataStore
instances.MetadataAggregates should havemetadata
/metadataScope
/resourceScope
sets toScopeCode.SERIES
orScopeCode.INITIATIVE
if applicable. If not too expensive to compute, the names of all components should be listed as associated resources with anAssociationType.IS_COMPOSED_OF
relation.- Since:
- 0.8
Defined in the
sis-storage
module
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description Collection<? extends Resource>
components()
Returns the children resources of this aggregate.-
Methods inherited from interface Resource
addListener, getIdentifier, getMetadata, removeListener
-
-
-
-
Method Detail
-
components
Collection<? extends Resource> components() throws DataStoreException
Returns the children resources of this aggregate. The returned collection contains the resources listed by their name in the following metadata elements. The returned collection may contain more resources if the metadata are incomplete, and the resources do not need to be in the same order:
The name of each child resource in the returned collection is given by the following metadata element:this.metadata
/identificationInfo
/associatedResource
withAssociationType.IS_COMPOSED_OF
child.metadata
/identificationInfo
/citation
/title
Lazy resource instantiationIf the collection instantiates components only when first needed, and if a checked exception occurs during invocation of aCollection
orIterator
method, then the collection or the iterator should wrap the exception in aBackingStoreException
.- Returns:
- all children resources that are components of this aggregate. Never
null
. - Throws:
DataStoreException
- if an error occurred while fetching the components.
-
-


New Games:
Salmon Says
Based off of a certain game that sounds like this name
Ninja Parkour
Be a ninja box as you jump through many exiting levels!
Endurance Test
See how long you can take it!
Gem Factory
Become a Gem-Selling tycoon in this game!
Pokemon Egg Hatching Simulator
Be the king of Pokemon hatching in this game!
Pokemon Tap Royale
The sequel to Pokemon Egg Hatching Simulator.
Timer
Don't worry, it only times up to centuries...
Jitter Clicker
Find your average CPS with this game!
Beta Games (May have bizarre bugs!):


Blimp
Sign Up
Log In
- Select Role
Airman
Supervisor
Invite Code:
First Name:
Last Name:
Email:
Password:
Repeat Password:
Register


"""The MomentumIterativeMethod attack.
"""
import warnings
import numpy as np
import tensorflow as tf
from cleverhans.attacks.attack import Attack
from cleverhans.attacks.fast_gradient_method import optimize_linear
from cleverhans.compat import reduce_sum, reduce_mean, softmax_cross_entropy_with_logits
from cleverhans import utils_tf
[docs]class MomentumIterativeMethod(Attack):
"""
The Momentum Iterative Method (Dong et al. 2017). This method won
the first places in NIPS 2017 Non-targeted Adversarial Attacks and
Targeted Adversarial Attacks. The original paper used hard labels
for this attack; no label smoothing.
Paper link: https://arxiv.org/pdf/1710.06081.pdf
:param model: cleverhans.model.Model
:param sess: optional tf.Session
:param dtypestr: dtype of the data
:param kwargs: passed through to super constructor
"""
def __init__(self, model, sess=None, dtypestr='float32', **kwargs):
"""
Create a MomentumIterativeMethod instance.
Note: the model parameter should be an instance of the
cleverhans.model.Model abstraction provided by CleverHans.
"""
super(MomentumIterativeMethod, self).__init__(model, sess, dtypestr,
**kwargs)
self.feedable_kwargs = ('eps', 'eps_iter', 'y', 'y_target', 'clip_min',
'clip_max')
self.structural_kwargs = [
'ord', 'nb_iter', 'decay_factor', 'sanity_checks', 'clip_grad']
[docs] def generate(self, x, **kwargs):
"""
Generate symbolic graph for adversarial examples and return.
:param x: The model's symbolic inputs.
:param kwargs: Keyword arguments. See `parse_params` for documentation.
"""
# Parse and save attack-specific parameters
assert self.parse_params(**kwargs)
asserts = []
# If a data range was specified, check that the input was in that range
if self.clip_min is not None:
asserts.append(utils_tf.assert_greater_equal(x,
tf.cast(self.clip_min,
x.dtype)))
if self.clip_max is not None:
asserts.append(utils_tf.assert_less_equal(x,
tf.cast(self.clip_max,
x.dtype)))
# Initialize loop variables
momentum = tf.zeros_like(x)
adv_x = x
# Fix labels to the first model predictions for loss computation
y, _nb_classes = self.get_or_guess_labels(x, kwargs)
y = y / reduce_sum(y, 1, keepdims=True)
targeted = (self.y_target is not None)
def cond(i, _, __):
"""Iterate until number of iterations completed"""
return tf.less(i, self.nb_iter)
def body(i, ax, m):
"""Do a momentum step"""
logits = self.model.get_logits(ax)
loss = softmax_cross_entropy_with_logits(labels=y, logits=logits)
if targeted:
loss = -loss
# Define gradient of loss wrt input
grad, = tf.gradients(loss, ax)
# Normalize current gradient and add it to the accumulated gradient
red_ind = list(range(1, len(grad.get_shape())))
avoid_zero_div = tf.cast(1e-12, grad.dtype)
grad = grad / tf.maximum(
avoid_zero_div,
reduce_mean(tf.abs(grad), red_ind, keepdims=True))
m = self.decay_factor * m + grad
optimal_perturbation = optimize_linear(m, self.eps_iter, self.ord)
if self.ord == 1:
raise NotImplementedError("This attack hasn't been tested for ord=1."
"It's not clear that FGM makes a good inner "
"loop step for iterative optimization since "
"it updates just one coordinate at a time.")
# Update and clip adversarial example in current iteration
ax = ax + optimal_perturbation
ax = x + utils_tf.clip_eta(ax - x, self.ord, self.eps)
if self.clip_min is not None and self.clip_max is not None:
ax = utils_tf.clip_by_value(ax, self.clip_min, self.clip_max)
ax = tf.stop_gradient(ax)
return i + 1, ax, m
_, adv_x, _ = tf.while_loop(
cond, body, (tf.zeros([]), adv_x, momentum), back_prop=True,
maximum_iterations=self.nb_iter)
if self.sanity_checks:
with tf.control_dependencies(asserts):
adv_x = tf.identity(adv_x)
return adv_x
[docs] def parse_params(self,
eps=0.3,
eps_iter=0.06,
nb_iter=10,
y=None,
ord=np.inf,
decay_factor=1.0,
clip_min=None,
clip_max=None,
y_target=None,
sanity_checks=True,
**kwargs):
"""
Take in a dictionary of parameters and applies attack-specific checks
before saving them as attributes.
Attack-specific parameters:
:param eps: (optional float) maximum distortion of adversarial example
compared to original input
:param eps_iter: (optional float) step size for each attack iteration
:param nb_iter: (optional int) Number of attack iterations.
:param y: (optional) A tensor with the true labels.
:param y_target: (optional) A tensor with the labels to target. Leave
y_target=None if y is also set. Labels should be
one-hot-encoded.
:param ord: (optional) Order of the norm (mimics Numpy).
Possible values: np.inf, 1 or 2.
:param decay_factor: (optional) Decay factor for the momentum term.
:param clip_min: (optional float) Minimum input component value
:param clip_max: (optional float) Maximum input component value
"""
# Save attack-specific parameters
self.eps = eps
self.eps_iter = eps_iter
self.nb_iter = nb_iter
self.y = y
self.y_target = y_target
self.ord = ord
self.decay_factor = decay_factor
self.clip_min = clip_min
self.clip_max = clip_max
self.sanity_checks = sanity_checks
if self.y is not None and self.y_target is not None:
raise ValueError("Must not set both y and y_target")
# Check if order of the norm is acceptable given current implementation
if self.ord not in [np.inf, 1, 2]:
raise ValueError("Norm order must be either np.inf, 1, or 2.")
if len(kwargs.keys()) > 0:
warnings.warn("kwargs is unused and will be removed on or after "
"2019-04-26.")
return True


Welcome to the admin panel!
Here you can manage all sights, items, challenges and users. It supports most important api calls in a easy to use gui. Navigate trough the navigation at the left of the screen to get started.


Action Bar Button
Primary
button
Secondary button
Inactive
Accept
Decline
Action
Bar
Button
Primary button
Secondary button
Inactive
Agree
Decline
Action Bar Button
Action Bar Button
Default
Default
Agree
Agree
Decline
Decline
Transparent
Transparent
Emphasized
Emphasized
Icon last
"This is a label, this is a label"
Action Bar Button
Primary button
Secondary button
Inactive
Agree
Decline
Action Bar Button
Default
Default
Agree
Agree
Decline
Decline
Transparent
Transparent
Emphasized
Emphasized
Download
Download
Download


| | |
- HighScoresDB
- HighScoresGUI
- Metronome
class HighScoresDB |
| |
A class implementing a Database (DB) for awarding the top scores and storing them.
Each score is stored as a pair of [name], [score]. There are N top scores where N is specified by the programmer. The scores are stored in increasing order. You may check if the ranking of
any given score. Thr ranking lies in 0 to N-1, or N if it does not fall in the top N scores. |
| |
Methods defined here:
- __init__(self, filename, N=10)
- Constructor for a High Score Database. It will be stored as plain text in filename. It will contain the top N scores (default N = 10)
filename: a sting containing path and filename of a plaintext file that will store the simple high scroes database
N: a positive integer representing the number of top entries you would like to store in the database
- best(self)
- Simply returns the single best score in the database
return: The float value of the best score recorded
- insert(self, name, score)
- Inserts a score in the database under the given name.
name: A string of the user who achieved the score
score: A float value of the score achived
- ranking(self, score)
- Determine the ranking of a new score in this database. In 0..N-1 if it ranks in the top N or N
- restore(self)
- Loads the High Scores Database back in from its plaintext file. If the file doesn't exist an empty high scores list results with N blank names and scores of 0
- save(self)
- Saves this High Scores Database to a plaintext file. It uses self.filename provided at construction
|
class HighScoresGUI |
| | |
Methods defined here:
- __init__(self, highscoresDB)
- Constructs a GUI to handle and present High Scores for your game.
It is driven by a given database object for high scores. See HighScoresDB
highscoresDB: a High Scores Database to save restore the high scores for this GUI
- handle_new_score(self, score, screen)
- Takes in a new score and chacks if it ranks, and if so get the user's name and show the new list including the new user's name
score: a number representing the score the user achieved
screen: the screen to show stuff on
- input_name(self, screen, maxlen=10)
- Prompts the user to type in the name for entry in the high scores
screen: the screen to show stuff on
maxlen: the maximum number of characters allowed in the name (default 10)
return: a string of the name as typed in by the user
- scroll_on(self, screen, scroll_off=True)
- Scrolls the rankings on to the screen to reveal the top scores one at a time
It scrolls until the last ranking appears at the bottom of the screen. If specified it will also.
If it is interrupted with a keypress the slow scrolling high scores screen showing is aborted
wait for 2 seconds and scroll back off the sreen revealing whatever was on the previous screen before showing the high scores screen
scroll_off: boolean if true the high scores screen will wait 2 seconds and scroll back off (unless interrupted by a key hit)
|
class Metronome |
| |
A class that behaves like the name suggests. It is a metronome that ticks with a regular beat.
The peroid of the beat is specified by the user.
This is useful for having a consistent frame rate in a game eg 24 frames per second (period 1.0/24)
Typically you would set up a Metronome with your desired framerate and calculate your game logic and
show a new frame after wait_for_tick()
eg
metronome = Metronome(1.0/24)
while True:
... # handle user input
... # game logic
metronome.wait_for_tick()
myscreen.show()
Just a warning. You should also use a delay of the same or nearly equal length in keyboard.getch() in you main loop.
The reason for this is because you want to be spending as much time as possible allowing the user to input keys and not idling
waiting for the next frame. They work best in combination since wait_for_tick() will return immediately if the time period of a frame
has already passed. It is simply a way to ensure a whole period is respected if a key hit registers early on and returns from getch() early.
See keyboard.py and examples/snake.py |
| |
Methods defined here:
- __init__(self, period)
- Creates a metronome with the specified tick rate as a floating point peroid between ticks
period: a float representing the amount of time (in seconds) between beats. eg 0.1 for 10 beats a second
- reset(self)
- Resets the since tick in the metronome. The time of the most recent tick is set to now.
- wait_for_tick(self)
- Sleeps until the next tick of the metronome. If a tick has already occured since last calling wait_for_tick() an exception is caught and it returns immediately
| |


-
decoratedDefinition
BeanDefinitionHolder decoratedDefinition
-
qualifiedElement
AnnotatedElement qualifiedElement
-
stale
boolean stale
Determines if the definition needs to be re-merged.
-
allowCaching
boolean allowCaching
-
isFactoryMethodUnique
boolean isFactoryMethodUnique
-
targetType
org.springframework.core.ResolvableType targetType
-
resolvedTargetType
Class<T> resolvedTargetType
Package-visible field for caching the determined Class of a given bean definition.
-
isFactoryBean
Boolean isFactoryBean
Package-visible field for caching if the bean is a factory bean.
-
factoryMethodReturnType
org.springframework.core.ResolvableType factoryMethodReturnType
Package-visible field for caching the return type of a generically typed factory method.
-
factoryMethodToIntrospect
Method factoryMethodToIntrospect
Package-visible field for caching a unique factory method candidate for introspection.
-
constructorArgumentLock
Object constructorArgumentLock
Common lock for the four constructor fields below.
-
resolvedConstructorOrFactoryMethod
Executable resolvedConstructorOrFactoryMethod
Package-visible field for caching the resolved constructor or factory method.
-
constructorArgumentsResolved
boolean constructorArgumentsResolved
Package-visible field that marks the constructor arguments as resolved.
-
resolvedConstructorArguments
Object[] resolvedConstructorArguments
Package-visible field for caching fully resolved constructor arguments.
-
preparedConstructorArguments
Object[] preparedConstructorArguments
Package-visible field for caching partly prepared constructor arguments.
-
postProcessingLock
Object postProcessingLock
Common lock for the two post-processing fields below.
-
postProcessed
boolean postProcessed
Package-visible field that indicates MergedBeanDefinitionPostProcessor having been applied.
-
beforeInstantiationResolved
Boolean beforeInstantiationResolved
Package-visible field that indicates a before-instantiation post-processor having kicked in.
-
externallyManagedConfigMembers
Set<E> externallyManagedConfigMembers
-
externallyManagedInitMethods
Set<E> externallyManagedInitMethods
-
externallyManagedDestroyMethods
Set<E> externallyManagedDestroyMethods


Skip to main content
Last updated: 14 May 2015
Menu
ONS
Components
Buttons
Primary
Primary, with icon
Sizes
Primary, block
Secondary
Secondary, active
Button bar
Global
Footer
Header with breadcrumb
Header
Hero banner
Hero banner with extra large stat
Page header
Charts
Chart Controls
Horizontal Bar Chart
Multi Series Chart
Population Pyramid
Stacked Bar Chart
Line Chart
Data Tables
Data Table with Toggle
Data Table with Mode Switcher
Data Table with Swipe Control
Bare Data Table
Responsive table
Misc
Tooltips
Patterns
Boxes
Standard box
Padded box
Sectioned box
Lifted box
Combinations
Vertically sectioned box
Box with border
Orange box
Orange box with large left border
Orange-coloured box with icon
Negative offset
Dark lifted box
Navs
Nav
Nav inline-block
Nav, block
Nav, block spaced
Nav dark
Nav heavy
Simple breadcrumb nav
Breadcrumb
General
Actionable header
Actionable header, tight
Content reveal class
Stacked date microcomponent
Divider
Lozenges
Table of Contents
Standard tabbed UI
Stats
Hero stat headline
Basic
Basic, with unit
Basic, with unit and description
Small
Headline stat
XL Headline stat
Panels
Nav panel with stats
Nav panel without stats
Panel
Panel, separated
Panel, with padding
Panel, with margin
Lists
Standard unordered list
Standard ordered list
Neutral list
Stacking definition list
Inline definition list
Inline, split definition list
Slates
Light grey slate
Off-white slate
Mid grey slate
Grey slate
Media
Content image
Media object
Media object with reverse image
Type
Complex link
Visual Language
Forms
Text input
Text input with supporting text
Input with error
Input with button
Textarea
Checkboxes
Selectbox
Grid
Desktop grid
Tablet (and up) grid
Mobile (and up) grid
Mixed Mobile/Tablet/Desktop grid
Push pull grid
Nested grid
Type
Headings
Paragraph
Links
Colors
Primary
Global
Accent
Graphical elements
Icons
Templates
Templates
Homepage Template (T1)
Product Page (T3)
Stat Bulletin Page (T4-1)
Expert Analysis Page (T4-2)
Time Series Page (T5)
Examples
Desktop Grid
Basic starter
Templates
Templates
Expert Analysis Page (T4-2)
View
Expert Analysis Page (T4-2)


More Services Integrate the NodeJS Backend
HttpClient
- injectable class
- contains methods to perform HTTP requests
- return type varies according to which signature is called (mainly the values of observe and responseType)
HttpInterceptor
Intercepts HttpRequest and handles them.
Exercise 11.1
Implement auth.service and safe.service to call the NodeJS Backend
Exercise 11.2
Implement some interceptors.


{% extends "includes/base.html" %} {% load static %} {% block title %}Android | Siphon{% endblock %} {% block css %} {% endblock %} {% block content %} {% include "includes/header.html" with title="announce" %}
Siphon enables pain-free publishing for React Native apps. Our command-line tool gives you everything you need to create, run and publish apps for both major platforms. You can push instant over-the-air updates to your production apps without going through the App Store approval queue.
Today we're releasing support for Android, so we made a quick video to show you how easy it is to publish a standalone app for both iOS and Android:


An easy way to index your maven site and give it a nice ajax search box.
It's as easy as:
//in example you can change the positioning $("#searchbox", window.parent.document).css('top', '10px'); $("#searchbox", window.parent.document).css('left', $(window).width()- 325); ... <!-- or change the color of the search results box --> <div style="background-color: lightyellow" id="searchOutput"/>
Wanna see it in action? Look at the top right corner of this page ;) Wanna try it? It's apache licensed and you can find it on GitHub


WQMY
Oscars 2012: Good boy! | Film | The Guardian
Feb 23, 2012 . Oscars 2012: Good boy! . 14 April 2011 Michel Hazanavicius's film is announced as an . Audio Film Weekly Podcast: Oscars 2012 preview . Jim Carrey hit as eBay users sell memorabilia for gun money · More most viewed .
http://www.guardian.co.uk/film/2012/feb/23/oscars-the-artist-good-boy
Tupac Shakur's Signed Movie Contract Hits eBay | SOHH.COM
Feb 22, 2012 . News: Tupac Shakur's Signed Movie Contract Hits eBay . Pac's 1992 flick has inspired various artists, including Soulja Boy Tell Em who faced backlash after putting together his own remake last . I'm not a hater, good luck.
http://www.sohh.com/2012/02/tupac_shakurs_signed_movie_contract_hits.html
Astro Boy The Movie 3 3 4 inch Action Figure Peacekeeper ... - eBay
Astro Boy The Movie: 3 3/4 Inch Action Figure - Peacekeeper Robot in Toys & Hobbies, Action Figures, Transformers & Robots | eBay.
http://www.ebay.com/itm/Astro-Boy-The-Movie-3-3-4-Inch-Action-Figure-Peacekeeper-Robot-/310483215521
Contents |
[madder than a wet chicken] History
Identify 70s UFO movie - Boy & a Silver Ball?: Category-Specific ...
Pretty much all I recall are scenes of a boy following a silver ball through the desert . You have a good recollection of a movie that is not avaiable on DVD and I .
http://forums.ebay.com/db2/topic/Movies-Memorabilia/Identify-70s-Ufo/2000373486
Genelia D'Souza - Wikipedia, the free encyclopedia
A review in The Hindu noted, "Genelia, who hardly made an impression in Boys, makes much impact in Sachein." The movie evoked mixed response from .
http://en.wikipedia.org/wiki/Genelia_D'Souza
A Scoutmaster's Blog
3 days ago . There is a very good chance that we will again have the opportunity to bring . I subscribe to the eBay Scouting Hot Finds Newsletter that is done by . Follow Me Boys is probably the most well known movie about Scouting.
http://www.melrosetroop68.org/blog.html
Glen Hansard - Wikipedia, the free encyclopedia
He is also known for his acting, having appeared in the BAFTA winning film The . Irglova were no longer romantically linked, and that they are now "good friends ". . Glen and fellow musician Mark Geary auctioned off a house concert on eBay in . "It's Hard out Here for a Pimp"; Music and lyrics: Juicy J, Frayser Boy and DJ .
http://en.wikipedia.org/wiki/Glen_Hansard
Poster Boy Mini Movie Poster Gay Interest | eBay
POSTER BOY mini movie poster GAY INTEREST in Entertainment Memorabilia, Movie Memorabilia, Posters | eBay.
http://www.ebay.com/itm/POSTER-BOY-mini-movie-poster-GAY-INTEREST-/330839692037?pt=LH_DefaultDomain_0&hash=item4d07951305
Astro Boy The Movie 3 3 4 inch Action Figures Trashcan and ... - eBay
Astro Boy The Movie: 3 3/4 Inch Action Figures Trashcan and Weapons Drone Robots in Toys & Hobbies, Action Figures, Transformers & Robots | eBay. . Good news, you're the high bidder. Sorry, you've been outbid. You're the high bidder, .
http://www.ebay.com/itm/Astro-Boy-Movie-3-3-4-Inch-Action-Figures-Trashcan-and-Weapons-Drone-Robots-/130789701591?pt=US_Action_Figures&hash=item1e73ac77d7
Callahan Auto Parts Sandusky Ohio Tommy Boy Movie Men's ... - eBay
Callahan Auto Parts Sandusky Ohio Tommy Boy Movie Men's T-Shirt Tee in Clothing, Shoes & Accessories, Men's Clothing, T-Shirts | eBay.
http://www.ebay.com/itm/Callahan-Auto-Parts-Sandusky-Ohio-Tommy-Boy-Movie-Mens-T-Shirt-Tee-/190622041098
The Video that is not Little Richard as a Child Performer - Amusicology
Jun 9, 2011. recordings and movies on YouTube, discovering random memorabilia on eBay . . Announcer Ace, if you pull up the movie title on the All Movie Guide or the . see that Frank Sugarchile Robinson is credited as the Boy Piano Player. . He had a pretty good career and played for then President Truman.
http://amusicology.wordpress.com/2011/06/09/little-richard-unfails-musicology/
I Want It That Way - Wikipedia, the free encyclopedia
"I Want It That Way" is a hit song by the Backstreet Boys, and their first single from . fades in and out of white, and shifting between different film speeds during shots. . "Weird Al" Yankovic made a hugely popular parody called "eBay" on his .
http://en.wikipedia.org/wiki/I_Want_It_That_Way
Little Nemo: Adventures in Slumberland - Wikipedia, the free ...
Not to be confused with a film called Finding Nemo. . the film opens with the young boy Nemo experiencing a nightmare in which he is pursued by a locomotive. . Although it had a fairly good critical reception, the film failed to find an audience. . for a sealed copy (usually DVD) on Internet sites such as Amazon and eBay.
http://en.wikipedia.org/wiki/Little_Nemo:_Adventures_in_Slumberland
I Love You Man Script - Drew's Script-O-Rama
You're not taking these boys to see The Devil Wears Prada. God, I love that movie. No, I won't. I got you. I know what you mean. This is really exciting. We're .
http://www.script-o-rama.com/movie_scripts/i/i-love-you-man-script.html
[repair thinkpad rage mobility restore display] Digital channels
| Channel | Name | happy trails aquisition limited partnerships | tutankhamen's strengths and weaknesses | Programming |
|---|---|---|---|---|
| 53.1 | good boy the movie ebay DT | dermatology of lexington llc | flight victoria bc to phoenix arizona | Main good boy the movie ebay programming / MyNetworkTV |
| 53.2 | WOLF DT | pittsford mendon high school reunion | frey brothers barn vertical grills stalls | Simulcast of electric specialty vehicles for disablities |
| 53.3 | WSWB DT | 480i | 4:3 | Simulcast of madder than a wet chicken |
Bruce Lee Movies List
Bruce Lee Movies List on eBay. Hurry and Bid on . BRUCE LEE BIG BOSS MOVIE WAS A GOOD MOVIE SAW IT FOR THE FIRST TIME TODAY. Retweet Reply . My two cheeky boys 4 and 6 are what keeps me sane. When I am not in the .
http://www.squidoo.com/bruce-lee-movies-list
[20th century limited drum bugle corp] References
[peavey cl-2 cluster pa speakers] External links
- lesson plan beijing olympics
- peter tilton nj bayville
- banana republic french army hat
- bsa and video games
- cal mart grocery store san francisco
- rcbs no 14 rotor
|
|


Resource Type:
Edit your contribution to add a description Toggle
File Name:
File Size:
Mime Type:
Uploaded:
Updated:
Learning Registry ID:
Last Publish Date:


This is an example using v-on directive. if user click the button, we add one to the counter below button.
{{count}}
Let move your mouse over the area with background in grey, the text dead area is somewhere without event
Your mouse x and y coordinates:{{x}},{{y}} - dead area


Exit Wounds * 1/2 (out of * * * * )
Directed by Andrzej Bartkowiak. Cast: Steven Seagal, DMX, Isaiah Washington, Anthony Anderson, Tom Arnold, Jill Hennessy, Michael Jai White, Bill Duke, Eva Mendes, Bruce McGill, David Vadim. 2001 - 103 minutes Rated R (for violence, profanity, sexual situations, and nudity). Reviewed by Dustin Putman, March 17, 2001.
Steven Seagal's face must be crazy-glued, or something. That is the one overwhelming thought that plagued me throughout "Exit Wounds," his first big-screen motion picture since 1997's "Fire Down Below." In every single shot of Seagal, he has the same brooding facial expression, as if he has been constipated for the last week. Either the look on his face has been permanently molded and glued down, or he should seriously consider flexing the muscles a little more. It wouldn't hurt to take some acting lessons while he's at it.
Seagal may be a mannequin who coasts through the 103-minute duration, but his annoying presence isn't the only problem this generic actioner has.  On that level, the film delivers for his die-hard fans, but does he really have enough to warrant its dubious existence? Probably not.
Because "Exit Wounds" painstakingly keeps its mid-story plot twists under wraps (all of which can be seen ten miles ahead by any viewer with an IQ over -3), much of the picture has no story at all. What can be said is that Seagal plays Detroit detective Orin Boyd, a hot-tempered character who is fired and relocated to the infamous Precinct 15 after an unprofessional, irresponsible job at saving the Vice President's life during an assassination attempt. Saddled, at first, with the embarrassing job of directing traffic, Boyd soon catches wind of a planned drug deal that leads him to Latrell Walker (DMX), a mysteriously wealthy, young man whose brother is in prison. Latrell may not be the bad guy he seems, however, and some of Boyd's fellow cops at the precinct may not be as honorable as they appear.
"Exit Wounds," laughably based on an actual novel by John Westermann, and directed with mild aplomb by Andrzej Bartkowiak, has little to offer in the way of substance and characters worth caring about, but does manage to fire off a few exciting sequences. While not what one would exactly call "action-packed," there are several scenes that are edited and directed with such energy (including a slam-bang car chase), it's a shame the rest of the movie is so very bad.
Recording artist DMX (2000's "Romeo Must Die") is in every way a perfect match for Steven Seagal, in that he sleepwalks through a part without showing the slightest alteration on his emotion and facial expression. Better is Anthony Anderson (2000's "Me, Myself, & Irene"), a funny, charismatic rising star who, here, plays Latrell's buddy and the owner of a strip club. In the future, he should turn his back on weak material such as this. Other supporting players include Isaiah Washington (1999's "True Crime"), as Seagal's partner at the 15th Precinct; Jill Hennessy (2000's "Autumn in New York"), beautiful, but wasted, as Seagal's superior; Eva Mendes (2000's "Urban Legends: Final Cut"), even more beautiful, and even more wasted; and Tom Arnold (2000's "Shriek If You Know What I Did Last Friday the 13th"), grating as a morning talk show host whom Boyd meets at an Anger Management class.
The screenplay, by Ed Horowitz and Richard D'Ovidio, is a strictly cut-and-paste job that shows up to lay out the basic groundwork, and then makes way for more blasting guns than I've seen within a two-hour radius since the last John Woo opus. What "Exit Wounds" ultimately never escapes is its low-rent, unpolished feel--a position that fails to give the film any credibility.
- Copyright 2001 by Dustin Putman http://us.imdb.com/ReviewsBy?Dustin+Putman http://www.atnzone.com
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


Altoro Mutualís Board of Directors declared a dividend to be paid with respect to the common stock of the Company in the amount of $0.58 per share, to be paid on December 15, 2006 to shareholders of record at the close of business on December 1, 2005.


- WikDict.com: Free bilingual dictionaries based on Wiktionary.org
- Litespread: Adding a basic spreadsheet UI to SQLite, also nice for handling CSVs
- Land Rush: Multi-player auction game
- Nuclear Chess: Chess variant with AI, playable in the browser
- Do Again List: An self sorting list of things you want to do somewhat regularly
Active Projects
Old Projects
- Lots of games, some cross-platform games and some games for the obsolte Sharp Zaurus and Agenda VR3 mobile devices.
- SFont, a very simple font library supporting fancy bitmap fonts (with colors and alpha channel) and basic kerning. Has been successfully used in dozens of projects by other people.
Experiments
- Exercises in Simplicity: Getting a feel for where extremely simple software works
- TrackMyOwe.com: Track and settle owes online
- TransDict, a translation dictionary based on Wiktionary


--- layout: post title: Choosing A Good Preschool date: 2010-03-27 11:26:46.000000000 -07:00 type: post parent_id: '0' published: true pd: '' status: publish categories: - Classroom Talk - Early Childhood Issues - Infants and Toddlers tags: - childhood obesity - choosing a preschool - play - preschool centers - social skills children author: login: k email: k@k display_name: mcary first_name: '' last_name: '' ---
I’ve just started looking at preschools for my daughter to attend next fall. They all have such structured schedules. Aren’t kids allowed to just play anymore?
The concern revealed from your question is justified. There are hundreds of books on the market today that discuss the importance of play in a child’s social, emotional and physical development. As children engage in free play less often and are less active, a wide range of problems have increased. Those areas of concern include obvious and easily measurable results such as the lack of general physical well-being and obesity, to more subtle issues such as a loss of creativity, and an inability to socialize and get along with others.
A good preschool will have both an outdoor recess type of play as well as an indoor play time which may be designated on the class schedule by the terms, centers or station time. It has long been said that play is a child’s work in which, while acting out various roles, they learn about themselves and their relationship to others. My favorite play centers for early childhood have always been housekeeping, dollhouse and blocks. At centers like these children have the opportunity to role play with their peers and engage creatively instead of participating in an adult directed group activity.
Take another look at the preschools that you like and ask if they have these type centers and how often the children are permitted to use them. As important as unstructured play is though, arts and crafts and early reading and math readiness skills are also an important part of a good preschool education. Science themes on child friendly topics like bugs and plants, and a Social Studies curriculum that exposes children to types of families and communities that may be different from what they are used to, should round out the curriculum.
Don’t forget to ask other moms in your area what preschool they like and why. Word of mouth usually results in the better preschools filling up quickly. Don’t procrastinate or your child may end up on a waiting list.


Notifications
| Message | Created | |
|---|---|---|
| notificationMessage | 01/01/2012 |
What is Consent 2 Share technology?
Consent 2 Share (C2S) is a system that gives you the option to share all or part of your health record with your doctors. Your doctor or provider can access your health information and make better decisions on how to treat your medical condition.
With this revolutionary technology, C2S can help you:
- Define which providers you want to share your medical records with.
- Define your privacy policy and sign an electronic consent.
- Try your privacy policy against your actual health record, showing you what information you agree to share or do not want to share.
- Receive and send messages to your doctor.
- Delegate management of your privacy and consent to a caregiver.
"What is Consent 2 Share technology?"
Length: 4:00 min
Summary: At the conclusion of this video, viewers will understand how technology enables electronic care coordination using a fictitious patient's health privacy preferences and ultimately their health records between care providers.
One of the most significant problems that they played it intends to address is that like miss medical specialties behavior health providers are often not the first provider the patients ease many patients receive substance abuse or mental health treatment are initially referred from their primary care provider there is not currently streamline communication channel for primary care and the April health providers to share information regarding the care for patient following story demonstrates how seamless the integration of physical and they have a whole services can be and how the results using standardized data increase the ability to coordinate care it prevail comes and lower overall health care costs mercenary begins with the patient coming into a primary care providers office complaining of stress and sleeplessness the primary care provider performs an initial valuation of the new patient and collects information as they would free general checkup the physician suspects that the patient may have an anxiety issue and decides to administer a paper health short screening questionnaire the questionnaire determines if the patient should proceed with a comprehensive behavioral health assessment in this scenario discrete results are positive origin referral to behavioral health specialist to make the referral the engine provider to rectory is accessed via computer and allows the physician and patient to work together to select abt ever health provider the system displays rolled and provider information such as distance from the patient's home capacity needle is Asian rates and most importantly the providers performance and patient satisfaction ratings on the screen and that is presented showing the provider locations the patient chooses a paper health specialist and the primary care provider prepares an electronic consent document for the patient to sign with the patient's consent received the system is used to make a point that they have recalled provider and the patient's care records are transferred as referral transaction from the primary care provider to behavioral health providers computer system through an internet peripheral transaction date contains the pieces demographic information screening results and payroll to billing information to dramatically streamlined the continuity of care with you for all pointed to deliver health provider schedule the action our story shifts to the behavioral health providers facility through the availability of three for data administrative work around patient intake is greatly reduced and the providers already well informed to the patient's condition when the patient arrives debate over health providers ready to perform a more thorough behavioral health assessment the cycle of care perceives his patient and during the next several months to pay for health provider develops a treatment plan that addresses the scope of root causes of the anxiety disorder alcohol abuse is identified as one of the root causes of this patient's anxiety disorder and the patient we see street services from the neighbor health provider for alcohol abuse and anxiety district encounters proceed the patient records are maintained in the behavioral health provider system the final demonstration of the power of integrating behavioral health providers into the occurs on the patient revisits the original primary-care providers office for a follow up during the follow up the patient signs an electronic consent document giving the primary care provider access to behave her health providers records that describe the treatments received diagnosis and discharge plant for the patient because the patient received treatment for alcohol abuse privacy roles unique to substance abuse treatment established and the code of federal regulations come into play in this instance the electronic consent documents a tight compliant forty two party regulations the patient's records are electronically imported into the primary care providers electronic health records system and the form of a continuity of care document the ccd informs primary care provider on the patients treatment progress in this case the patient's physician was considering treating the patient anti-depressants but now this information the physician avoids medications that are contradicted to history of substance abuse this active immigration of behavioral health and primary care provides a close loop of coordinated care and helps avoid missy treatment information animations rework but too often characterized seiler medical specialty stove pipes of care that exist today thank you for watching this presentation the reality of the stories closer than you may think synapses he be project is creating a technology and the tremendous opportunity implement exists with the state age you program please come back to visit her body dot the follow the development of electronic behavioral health records and hal state efforts are shaping the behavioral health ita landscape.
Why is my health privacy important?
From the U.S. Department of Health and Human Services website (HHS.gov):
Length: 2:12 min
Summary: Why is my health privacy important?
Your health information, your rights. Whether your health information is stored on paper or electronically, you have the right to keep it private. Those rights are protected under a law known as HIPAA, the Health Insurance Portability and Accountability Act. HIPAA gives you important rights. First off, you have the right to see or get a copy of your medical records. Sometimes you might not be able to see certain parts of the full record, but you always have the right to ask. If you find a mistake in your record, you have the right to request to have it corrected. If you disagree with your doctor or health plan about certain information in your record, you have a right to submit a written statement of disagreement that will be kept with your record. You also have the right to know how your health information is used and shared. Now, your provider is allowed to share your information for certain reasons without asking you first, like when your doctors work together to determine how to best treat you when you're sick or to report the flu when it's in your area, but, in general, your providers can't give information to an employer, for example, without your permission. And if you'd like to know who has seen your health information, you have the right to get a report. That's called an "accounting of disclosures." HIPAA gives you the right to say how you want to be contacted. For example, you can tell your provider what phone number they should call to contact you and whether they can leave a message. HIPAA also gives you the right to request that your information not be shared with certain people or organizations. All these rights are spelled out in the Notice of Privacy Practices, which is usually given to you or posted at your doctor's office or hospital. Be sure to read this notice carefully. It lets you know exactly how your information will be used and shared and how your rights are being protected. And, lastly, if you think any of these rights have been violated, you have the right to file a complaint. We're serious about working with you to protect your health information. Know your rights. To get started, just visit the U.S. Department of Health and Human Services Office for Civil Rights at hhs.gov/ocr.
How do I create a consent?
With this revolutionary technology, C2S can help you:
- To create a consent, you will need to select at least two (2) doctors or providers who you want to share your health information with.
- Providers can be individual doctors, a health clinic or a hospital facility.
- You can search for providers by using our directory.
- Once your providers are selected, you can then decide what medical information about yourself they can share with each other.
- For additional instructions, please obtain a copy of the Client Tip Sheet from the Prince George's County Health Department, Behavioral Health Services Division.
Why do you need to know my demographic information?
About demographic information:
- Your demographics help us to identify you
- Your combined demographics, such as address and telephone number, help us to uniquely identify you among other C2S users.


26.
Currency, punctuation and Greek.
solidus Baht Euro Dollar Tögrög pilcrow U omicron dagger epsilon
interpunct H Tögrög Mill Lempira
Shop around to get one.


?J
A.
Shafer,
Collector
February
22-26,
!9io
THE
NEW
YORK
BOTANICAL
GARDEN
EXPLORATION
OF
CUBA
Trail.
Camp
La
Barga
(450
Meters
Altitude)
to
Camp
San
Benito
(900
Meters
Altitude),
Oriente
nnTANIP.AL
GARDEN
01529682
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


Press any key to get started!
Wins:
Losses:
Current Word
Number of Guesses Remaning
Letters already guessed
Previous Words:


Class imbalance usually damages the performance of classifiers. Thus, it is important to treat data before applying a classifier algorithm. This package includes recent resampling algorithms in the literature: (Barua et al. 2014) <doi:10.1109/tkde.2012.232>; (Das et al. 2015) <doi:10.1109/tkde.2014.2324567>, (Zhang et al. 2014) <doi:10.1016/j.inffus.2013.12.003>; (Gao et al. 2014) <doi:10.1016/j.neucom.2014.02.006>; (Almogahed et al. 2014) <doi:10.1007/s00500-014-1484-5>. It also includes an useful interface to perform oversampling.
| Version: | 1.0.0 |
| Depends: | R (≥ 3.3.0) |
| Imports: | bnlearn, KernelKnn, ggplot2, utils, stats, mvtnorm, Rcpp, smotefamily, FNN, C50 |
| LinkingTo: | Rcpp, RcppArmadillo |
| Suggests: | testthat, knitr, rmarkdown |
| Published: | 2018-02-18 |
| Author: | Ignacio Cordón [aut, cre], Salvador García [aut], Alberto Fernández [aut], Francisco Herrera [aut] |
| Maintainer: | Ignacio Cordón <nacho.cordon.castillo at gmail.com> |
| BugReports: | http://github.com/ncordon/imbalance/issues |
| License: | GPL-2 | GPL-3 | file LICENSE [expanded from: GPL (≥ 2) | file LICENSE] |
| URL: | http://github.com/ncordon/imbalance |
| NeedsCompilation: | yes |
| Materials: | README |
| CRAN checks: | imbalance results |
| Reference manual: | imbalance.pdf |
| Vignettes: |
Working with imbalanced dataset |
| Package source: | imbalance_1.0.0.tar.gz |
| Windows binaries: | r-devel: imbalance_1.0.0.zip, r-release: imbalance_1.0.0.zip, r-oldrel: imbalance_1.0.0.zip |
| OS X binaries: | r-release: imbalance_1.0.0.tgz, r-oldrel: imbalance_1.0.0.tgz |
| Old sources: | imbalance archive |
| Reverse imports: | smartdata |
Please use the canonical form https://CRAN.R-project.org/package=imbalance to link to this page.


If your model uses one of the three supported types of database (Virtual, MySQL, Access) here is where you configure it
Each type of database has its own parameters. All information inserted here cannot be altered via interface by the user of your interface