This is a major release from 0.9.1 and includes many new features and enhancements along with a large number of bug fixes. There are also a number of important API changes that long-time pandas users should pay close attention to.
The delimited file parsing engine (the guts of read_csv and read_table) has been rewritten from the ground up and now uses a fraction the amount of memory while parsing, while being 40% or more faster in most use cases (in some cases much faster).
read_csv
read_table
There are also many new features:
Much-improved Unicode handling via the encoding option.
encoding
Column filtering (usecols)
usecols
Dtype specification (dtype argument)
dtype
Ability to specify strings to be recognized as True/False
Ability to yield NumPy record arrays (as_recarray)
as_recarray
High performance delim_whitespace option
delim_whitespace
Decimal format (e.g. European format) specification
Easier CSV dialect options: escapechar, lineterminator, quotechar, etc.
escapechar
lineterminator
quotechar
More robust handling of many exceptional kinds of files observed in the wild
Deprecated DataFrame BINOP TimeSeries special case behavior
The default behavior of binary operations between a DataFrame and a Series has always been to align on the DataFrame’s columns and broadcast down the rows, except in the special case that the DataFrame contains time series. Since there are now method for each binary operator enabling you to specify how you want to broadcast, we are phasing out this special case (Zen of Python: Special cases aren’t special enough to break the rules). Here’s what I’m talking about:
In [1]: import pandas as pd In [2]: df = pd.DataFrame(np.random.randn(6, 4), ...: index=pd.date_range('1/1/2000', periods=6)) ...: In [3]: df Out[3]: 0 1 2 3 2000-01-01 0.469112 -0.282863 -1.509059 -1.135632 2000-01-02 1.212112 -0.173215 0.119209 -1.044236 2000-01-03 -0.861849 -2.104569 -0.494929 1.071804 2000-01-04 0.721555 -0.706771 -1.039575 0.271860 2000-01-05 -0.424972 0.567020 0.276232 -1.087401 2000-01-06 -0.673690 0.113648 -1.478427 0.524988 # deprecated now In [4]: df - df[0] Out[4]: 2000-01-01 00:00:00 2000-01-02 00:00:00 2000-01-03 00:00:00 ... 1 2 3 2000-01-01 NaN NaN NaN ... NaN NaN NaN 2000-01-02 NaN NaN NaN ... NaN NaN NaN 2000-01-03 NaN NaN NaN ... NaN NaN NaN 2000-01-04 NaN NaN NaN ... NaN NaN NaN 2000-01-05 NaN NaN NaN ... NaN NaN NaN 2000-01-06 NaN NaN NaN ... NaN NaN NaN [6 rows x 10 columns] # Change your code to In [5]: df.sub(df[0], axis=0) # align on axis 0 (rows) Out[5]: 0 1 2 3 2000-01-01 0.0 -0.751976 -1.978171 -1.604745 2000-01-02 0.0 -1.385327 -1.092903 -2.256348 2000-01-03 0.0 -1.242720 0.366920 1.933653 2000-01-04 0.0 -1.428326 -1.761130 -0.449695 2000-01-05 0.0 0.991993 0.701204 -0.662428 2000-01-06 0.0 0.787338 -0.804737 1.198677
You will get a deprecation warning in the 0.10.x series, and the deprecated functionality will be removed in 0.11 or later.
Altered resample default behavior
The default time series resample binning behavior of daily D and higher frequencies has been changed to closed='left', label='left'. Lower nfrequencies are unaffected. The prior defaults were causing a great deal of confusion for users, especially resampling data to daily frequency (which labeled the aggregated group with the end of the interval: the next day).
resample
D
closed='left', label='left'
In [1]: dates = pd.date_range('1/1/2000', '1/5/2000', freq='4h') In [2]: series = pd.Series(np.arange(len(dates)), index=dates) In [3]: series Out[3]: 2000-01-01 00:00:00 0 2000-01-01 04:00:00 1 2000-01-01 08:00:00 2 2000-01-01 12:00:00 3 2000-01-01 16:00:00 4 2000-01-01 20:00:00 5 2000-01-02 00:00:00 6 2000-01-02 04:00:00 7 2000-01-02 08:00:00 8 2000-01-02 12:00:00 9 2000-01-02 16:00:00 10 2000-01-02 20:00:00 11 2000-01-03 00:00:00 12 2000-01-03 04:00:00 13 2000-01-03 08:00:00 14 2000-01-03 12:00:00 15 2000-01-03 16:00:00 16 2000-01-03 20:00:00 17 2000-01-04 00:00:00 18 2000-01-04 04:00:00 19 2000-01-04 08:00:00 20 2000-01-04 12:00:00 21 2000-01-04 16:00:00 22 2000-01-04 20:00:00 23 2000-01-05 00:00:00 24 Freq: 4H, dtype: int64 In [4]: series.resample('D', how='sum') Out[4]: 2000-01-01 15 2000-01-02 51 2000-01-03 87 2000-01-04 123 2000-01-05 24 Freq: D, dtype: int64 In [5]: # old behavior In [6]: series.resample('D', how='sum', closed='right', label='right') Out[6]: 2000-01-01 0 2000-01-02 21 2000-01-03 57 2000-01-04 93 2000-01-05 129 Freq: D, dtype: int64
Infinity and negative infinity are no longer treated as NA by isnull and notnull. That they ever were was a relic of early pandas. This behavior can be re-enabled globally by the mode.use_inf_as_null option:
isnull
notnull
mode.use_inf_as_null
In [6]: s = pd.Series([1.5, np.inf, 3.4, -np.inf]) In [7]: pd.isnull(s) Out[7]: 0 False 1 False 2 False 3 False Length: 4, dtype: bool In [8]: s.fillna(0) Out[8]: 0 1.500000 1 inf 2 3.400000 3 -inf Length: 4, dtype: float64 In [9]: pd.set_option('use_inf_as_null', True) In [10]: pd.isnull(s) Out[10]: 0 False 1 True 2 False 3 True Length: 4, dtype: bool In [11]: s.fillna(0) Out[11]: 0 1.5 1 0.0 2 3.4 3 0.0 Length: 4, dtype: float64 In [12]: pd.reset_option('use_inf_as_null')
Methods with the inplace option now all return None instead of the calling object. E.g. code written like df = df.fillna(0, inplace=True) may stop working. To fix, simply delete the unnecessary variable assignment.
inplace
None
df = df.fillna(0, inplace=True)
pandas.merge no longer sorts the group keys (sort=False) by default. This was done for performance reasons: the group-key sorting is often one of the more expensive parts of the computation and is often unnecessary.
pandas.merge
sort=False
The default column names for a file with no header have been changed to the integers 0 through N - 1. This is to create consistency with the DataFrame constructor with no columns specified. The v0.9.0 behavior (names X0, X1, …) can be reproduced by specifying prefix='X':
0
N - 1
X0
X1
prefix='X'
In [6]: import io In [7]: data = ('a,b,c\n' ...: '1,Yes,2\n' ...: '3,No,4') ...: In [8]: print(data) a,b,c 1,Yes,2 3,No,4 In [9]: pd.read_csv(io.StringIO(data), header=None) Out[9]: 0 1 2 0 a b c 1 1 Yes 2 2 3 No 4 In [10]: pd.read_csv(io.StringIO(data), header=None, prefix='X') Out[10]: X0 X1 X2 0 a b c 1 1 Yes 2 2 3 No 4
Values like 'Yes' and 'No' are not interpreted as boolean by default, though this can be controlled by new true_values and false_values arguments:
'Yes'
'No'
true_values
false_values
In [11]: print(data) a,b,c 1,Yes,2 3,No,4 In [12]: pd.read_csv(io.StringIO(data)) Out[12]: a b c 0 1 Yes 2 1 3 No 4 In [13]: pd.read_csv(io.StringIO(data), true_values=['Yes'], false_values=['No']) Out[13]: a b c 0 1 True 2 1 3 False 4
The file parsers will not recognize non-string values arising from a converter function as NA if passed in the na_values argument. It’s better to do post-processing using the replace function instead.
na_values
replace
Calling fillna on Series or DataFrame with no arguments is no longer valid code. You must either specify a fill value or an interpolation method:
fillna
In [14]: s = pd.Series([np.nan, 1., 2., np.nan, 4]) In [15]: s Out[15]: 0 NaN 1 1.0 2 2.0 3 NaN 4 4.0 dtype: float64 In [16]: s.fillna(0) Out[16]: 0 0.0 1 1.0 2 2.0 3 0.0 4 4.0 dtype: float64 In [17]: s.fillna(method='pad') Out[17]: 0 NaN 1 1.0 2 2.0 3 2.0 4 4.0 dtype: float64
Convenience methods ffill and bfill have been added:
ffill
bfill
In [18]: s.ffill() Out[18]: 0 NaN 1 1.0 2 2.0 3 2.0 4 4.0 dtype: float64
Series.apply will now operate on a returned value from the applied function, that is itself a series, and possibly upcast the result to a DataFrame
Series.apply
In [19]: def f(x): ....: return pd.Series([x, x**2], index=['x', 'x^2']) ....: In [20]: s = pd.Series(np.random.rand(5)) In [21]: s Out[21]: 0 0.340445 1 0.984729 2 0.919540 3 0.037772 4 0.861549 dtype: float64 In [22]: s.apply(f) Out[22]: x x^2 0 0.340445 0.115903 1 0.984729 0.969691 2 0.919540 0.845555 3 0.037772 0.001427 4 0.861549 0.742267
New API functions for working with pandas options (GH2097):
get_option / set_option - get/set the value of an option. Partial names are accepted. - reset_option - reset one or more options to their default value. Partial names are accepted. - describe_option - print a description of one or more options. When called with no arguments. print all registered options.
get_option
set_option
reset_option
describe_option
Note: set_printoptions/ reset_printoptions are now deprecated (but functioning), the print options now live under “display.XYZ”. For example:
set_printoptions
reset_printoptions
In [23]: pd.get_option("display.max_rows") Out[23]: 15
to_string() methods now always return unicode strings (GH2224).
Instead of printing the summary information, pandas now splits the string representation across multiple rows by default:
In [24]: wide_frame = pd.DataFrame(np.random.randn(5, 16)) In [25]: wide_frame Out[25]: 0 1 2 3 4 ... 11 12 13 14 15 0 -0.548702 1.467327 -1.015962 -0.483075 1.637550 ... 0.266046 -0.709661 1.669052 1.037882 -1.705775 1 -0.919854 -0.042379 1.247642 -0.009920 0.290213 ... -0.945867 -0.932132 1.956030 0.017587 -0.016692 2 -0.575247 0.254161 -1.143704 0.215897 1.193555 ... -0.990582 -0.441652 1.211526 0.268520 0.024580 3 -1.577585 0.396823 -0.105381 -0.532532 1.453749 ... -0.693205 -0.339355 0.593616 0.884345 1.591431 4 0.141809 0.220390 0.435589 0.192451 -0.096701 ... -0.595447 1.395433 -0.392670 0.007207 1.928123 [5 rows x 16 columns]
The old behavior of printing out summary information can be achieved via the ‘expand_frame_repr’ print option:
In [26]: pd.set_option('expand_frame_repr', False) In [27]: wide_frame Out[27]: 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 0 -0.548702 1.467327 -1.015962 -0.483075 1.637550 -1.217659 -0.291519 -1.745505 -0.263952 0.991460 -0.919069 0.266046 -0.709661 1.669052 1.037882 -1.705775 1 -0.919854 -0.042379 1.247642 -0.009920 0.290213 0.495767 0.362949 1.548106 -1.131345 -0.089329 0.337863 -0.945867 -0.932132 1.956030 0.017587 -0.016692 2 -0.575247 0.254161 -1.143704 0.215897 1.193555 -0.077118 -0.408530 -0.862495 1.346061 1.511763 1.627081 -0.990582 -0.441652 1.211526 0.268520 0.024580 3 -1.577585 0.396823 -0.105381 -0.532532 1.453749 1.208843 -0.080952 -0.264610 -0.727965 -0.589346 0.339969 -0.693205 -0.339355 0.593616 0.884345 1.591431 4 0.141809 0.220390 0.435589 0.192451 -0.096701 0.803351 1.715071 -0.708758 -1.202872 -1.814470 1.018601 -0.595447 1.395433 -0.392670 0.007207 1.928123
The width of each line can be changed via ‘line_width’ (80 by default):
pd.set_option('line_width', 40) wide_frame
Docs for PyTables Table format & several enhancements to the api. Here is a taste of what to expect.
Table
In [41]: store = pd.HDFStore('store.h5') In [42]: df = pd.DataFrame(np.random.randn(8, 3), ....: index=pd.date_range('1/1/2000', periods=8), ....: columns=['A', 'B', 'C']) In [43]: df Out[43]: A B C 2000-01-01 -2.036047 0.000830 -0.955697 2000-01-02 -0.898872 -0.725411 0.059904 2000-01-03 -0.449644 1.082900 -1.221265 2000-01-04 0.361078 1.330704 0.855932 2000-01-05 -1.216718 1.488887 0.018993 2000-01-06 -0.877046 0.045976 0.437274 2000-01-07 -0.567182 -0.888657 -0.556383 2000-01-08 0.655457 1.117949 -2.782376 [8 rows x 3 columns] # appending data frames In [44]: df1 = df[0:4] In [45]: df2 = df[4:] In [46]: store.append('df', df1) In [47]: store.append('df', df2) In [48]: store Out[48]: <class 'pandas.io.pytables.HDFStore'> File path: store.h5 /df frame_table (typ->appendable,nrows->8,ncols->3,indexers->[index]) # selecting the entire store In [49]: store.select('df') Out[49]: A B C 2000-01-01 -2.036047 0.000830 -0.955697 2000-01-02 -0.898872 -0.725411 0.059904 2000-01-03 -0.449644 1.082900 -1.221265 2000-01-04 0.361078 1.330704 0.855932 2000-01-05 -1.216718 1.488887 0.018993 2000-01-06 -0.877046 0.045976 0.437274 2000-01-07 -0.567182 -0.888657 -0.556383 2000-01-08 0.655457 1.117949 -2.782376 [8 rows x 3 columns]
In [50]: wp = pd.Panel(np.random.randn(2, 5, 4), items=['Item1', 'Item2'], ....: major_axis=pd.date_range('1/1/2000', periods=5), ....: minor_axis=['A', 'B', 'C', 'D']) In [51]: wp Out[51]: <class 'pandas.core.panel.Panel'> Dimensions: 2 (items) x 5 (major_axis) x 4 (minor_axis) Items axis: Item1 to Item2 Major_axis axis: 2000-01-01 00:00:00 to 2000-01-05 00:00:00 Minor_axis axis: A to D # storing a panel In [52]: store.append('wp', wp) # selecting via A QUERY In [53]: store.select('wp', [pd.Term('major_axis>20000102'), ....: pd.Term('minor_axis', '=', ['A', 'B'])]) ....: Out[53]: <class 'pandas.core.panel.Panel'> Dimensions: 2 (items) x 3 (major_axis) x 2 (minor_axis) Items axis: Item1 to Item2 Major_axis axis: 2000-01-03 00:00:00 to 2000-01-05 00:00:00 Minor_axis axis: A to B # removing data from tables In [54]: store.remove('wp', pd.Term('major_axis>20000103')) Out[54]: 8 In [55]: store.select('wp') Out[55]: <class 'pandas.core.panel.Panel'> Dimensions: 2 (items) x 3 (major_axis) x 4 (minor_axis) Items axis: Item1 to Item2 Major_axis axis: 2000-01-01 00:00:00 to 2000-01-03 00:00:00 Minor_axis axis: A to D # deleting a store In [56]: del store['df'] In [57]: store Out[57]: <class 'pandas.io.pytables.HDFStore'> File path: store.h5 /wp wide_table (typ->appendable,nrows->12,ncols->2,indexers->[major_axis,minor_axis])
Enhancements
added ability to hierarchical keys
In [58]: store.put('foo/bar/bah', df) In [59]: store.append('food/orange', df) In [60]: store.append('food/apple', df) In [61]: store Out[61]: <class 'pandas.io.pytables.HDFStore'> File path: store.h5 /foo/bar/bah frame (shape->[8,3]) /food/apple frame_table (typ->appendable,nrows->8,ncols->3,indexers->[index]) /food/orange frame_table (typ->appendable,nrows->8,ncols->3,indexers->[index]) /wp wide_table (typ->appendable,nrows->12,ncols->2,indexers->[major_axis,minor_axis]) # remove all nodes under this level In [62]: store.remove('food') In [63]: store Out[63]: <class 'pandas.io.pytables.HDFStore'> File path: store.h5 /foo/bar/bah frame (shape->[8,3]) /wp wide_table (typ->appendable,nrows->12,ncols->2,indexers->[major_axis,minor_axis])
added mixed-dtype support!
In [64]: df['string'] = 'string' In [65]: df['int'] = 1 In [66]: store.append('df', df) In [67]: df1 = store.select('df') In [68]: df1 Out[68]: A B C string int 2000-01-01 -2.036047 0.000830 -0.955697 string 1 2000-01-02 -0.898872 -0.725411 0.059904 string 1 2000-01-03 -0.449644 1.082900 -1.221265 string 1 2000-01-04 0.361078 1.330704 0.855932 string 1 2000-01-05 -1.216718 1.488887 0.018993 string 1 2000-01-06 -0.877046 0.045976 0.437274 string 1 2000-01-07 -0.567182 -0.888657 -0.556383 string 1 2000-01-08 0.655457 1.117949 -2.782376 string 1 [8 rows x 5 columns] In [69]: df1.get_dtype_counts() Out[69]: float64 3 int64 1 object 1 dtype: int64
performance improvements on table writing
support for arbitrarily indexed dimensions
SparseSeries now has a density property (GH2384)
SparseSeries
density
enable Series.str.strip/lstrip/rstrip methods to take an input argument to strip arbitrary characters (GH2411)
Series.str.strip/lstrip/rstrip
implement value_vars in melt to limit values to certain columns and add melt to pandas namespace (GH2412)
value_vars
melt
Bug Fixes
added Term method of specifying where conditions (GH1996).
Term
del store['df'] now call store.remove('df') for store deletion
del store['df']
store.remove('df')
deleting of consecutive rows is much faster than before
min_itemsize parameter can be specified in table creation to force a minimum size for indexing columns (the previous implementation would set the column size based on the first append)
min_itemsize
indexing support via create_table_index (requires PyTables >= 2.3) (GH698).
create_table_index
appending on a store would fail if the table was not first created via put
put
fixed issue with missing attributes after loading a pickled dataframe (GH2431)
minor change to select and remove: require a table ONLY if where is also provided (and not None)
Compatibility
0.10 of HDFStore is backwards compatible for reading tables created in a prior version of pandas, however, query terms using the prior (undocumented) methodology are unsupported. You must read in the entire file and write it out using the new format to take advantage of the updates.
HDFStore
Adding experimental support for Panel4D and factory functions to create n-dimensional named panels. Here is a taste of what to expect.
In [58]: p4d = Panel4D(np.random.randn(2, 2, 5, 4), ....: labels=['Label1','Label2'], ....: items=['Item1', 'Item2'], ....: major_axis=date_range('1/1/2000', periods=5), ....: minor_axis=['A', 'B', 'C', 'D']) ....: In [59]: p4d Out[59]: <class 'pandas.core.panelnd.Panel4D'> Dimensions: 2 (labels) x 2 (items) x 5 (major_axis) x 4 (minor_axis) Labels axis: Label1 to Label2 Items axis: Item1 to Item2 Major_axis axis: 2000-01-01 00:00:00 to 2000-01-05 00:00:00 Minor_axis axis: A to D
See the full release notes or issue tracker on GitHub for a complete list.
A total of 26 people contributed patches to this release. People with a “+” by their names contributed a patch for the first time.
A. Flaxman +
Abraham Flaxman
Adam Obeng +
Brenda Moon +
Chang She
Chris Mulligan +
Dieter Vandenbussche
Donald Curtis +
Jay Bourque +
Jeff Reback +
Justin C Johnson +
K.-Michael Aye
Keith Hughitt +
Ken Van Haren +
Laurent Gautier +
Luke Lee +
Martin Blais
Tobias Brandt +
Wes McKinney
Wouter Overmeire
alex arsenovic +
jreback +
locojaydev +
timmie
y-p
zach powers +


The Nile River was officially declared as one of the 7 Natural Wonders of Africa February 11, 2013 in Arusha, Tanzania.
Votes were cast by experts from around the world who noted the key statistical significance.
The Nile River is the longest river in the world stretching 4,132 miles (6,650 km) while crossing 10 countries in northern Africa.


Add 'm' prefix to variable name. For example, 'mEdittextUserName'
Add typecasting for view. For example, '(TextView) findViewById(R.id.tv_name);'
Android View Binding (AVB) Code Generator
What is this?
Mother of this tool is a question, why should I write whole binding code in java activity when view IDs are already mentioned in XML file.
This is a tool for those android developers who don't want to waste time in writing binding code. :)
How to use
Add ids to all XML views which are required in java code
Copy XML layout file
Paste the copied file text in "XML layout" area
Now copy the generated code
Paste that code to java activity / fragment / viewholde / ... accordingly
Done!
Use in Activity
Make sure that output mode is set to Acitivities
After pasting generated code (How to use step 5), call bindViews() function after setContentView() in onCreate() method.
Use in Fragment / Viewholder etc..
Make sure that output mode is set to Fragments / ViewHolders / Others
After pasting generated code (How to use step 5), call bindViews() function when layout is populated.
Fragments: in function onViewCreated().
Viewholders: after super(view); call in constructor.
Use with ButterKnife
Butter Knife is a great and well known android library used for view injection.It is maintained by Jake Wharton. To integrate ButterKnife, check github guide.
Set output mode to ButterKnife
After pasting generated code (How to use step 5), call ButterKnife bind code when layout is populated. Make sure you are using ButterKnife library version >8.


1. Load Notes
2. Export Notes
3. Reload
4. Load Notes Particles
5. Export Notes Particles
Open console to view details.


Hermes Compiler Explorer
See
https://hermesengine.dev/
and
https://github.com/facebook/hermes
Use --help for help on all options.
Run Hermes
print("hello");


NINETEENTH (ADDITIONAL) LEGISLATIVE MEETING JOHN A. WILSON BUILDING, COUNCIL CHAMBER TUESDAY, DECEMBER 17, 2013 11:00 A.M. or immediately following the COW AGENDA Revised 12/16/13 I. CALL TO ORDER II. MOMENT OF SILENCE III. DETERMINATION OF QUORUM IV. PRESENTATION OF CEREMONIAL RESOLUTIONS 1. Antonial Atkins Recognition Resolution of 2013 Councilmember McDuffie V. CONSENT A. READING AND VOTE ON PROPOSED CEREMONIAL RESOLUTIONS 1. Virginia Ali 80th Birthday Celebration Recognition Resolution Councilmember Evans of 2013 2. Behrouz T. “Rocky” Rakani Ceremonial Recognition Councilmember Graham Resolution of 2013 3. Our Heroes Day Ceremonial Recognition Resolution of 2013 Councilmember Graham 4. Malik Melodies Sisterhood, Inc. 35th Anniversary Recognition Councilmember McDuffie Resolution of 2013 5. Dusty Hernandez-Harrison Recognition Resolution of 2013 Councilmember Alexander 6. Howard D. Woodson High School Warriors Football Team Councilmember Alexander DCIAA and DCSAA Championship Recognition Resolution of 2013 B. FINAL READING AND VOTE ON PROPOSED BILLS 1. Closing of a Public Alley in Square 858, S.O. 12-03336, Act of Committee of the Whole 2013 Chairperson Mendelson (Bill 20-388) 1 2. Fair Student Funding and School-Based Budgeting Amendment Committee on Education Act of 2013 Chairperson Catania (Bill 20-309) 3. Minimum Wage Amendment Act of 2013 Committee on Business, (Bill 20-459) Consumer, and Regulatory Affairs Chairperson Orange, Sr. C. FIRST READING AND VOTE ON PROPOSED BILLS D. READING AND VOTE ON CONGRESSIONAL REVIEW EMERGENCY 1. Medical Marijuana Cultivation Center Second Congressional Councilmember Alexander Review Emergency Declaration Resolution of 2013 Medical Marijuana Cultivation Center Second Congressional Review Emergency Amendment Act of 2013 E. READING AND VOTE ON PROPOSED RESOLUTIONS 1. Historic Preservation Review Board Donald Graham Davidson Committee of the Whole Confirmation Resolution of 2013 Chairman Mendelson (PR 20-446) 2. Historic Preservation Review Board Nancy L. Pryor Metzger Committee of the Whole Confirmation Resolution of 2013 Chairman Mendelson (PR 20-447) 3. Historic Preservation Review Board Maria Casarella Committee of the Whole Cunningham Confirmation Resolution of 2013 Chairman Mendelson (PR 20-448) F. FINAL READING AND VOTE ON TEMPORARY LEGISLATION 1. Tax Exemption for Teacher Awards Temporary Act of 2013 Councilmember Catania (Bill 20-593) G. READING AND VOTE ON CONTRACT MODIFICATION LEGISLATION AT THE REQUEST OF THE EXECUTIVE PURSUANT TO COUNCIL RULE 307(b) 2 VI. NON-CONSENT AGENDA A. FINAL READING AND FINAL VOTE ON PROPOSED BILLS 1. Earned Sick and Safe Leave Act of 2013 Committee on Business, (Bill 20-480) Consumer, and Regulatory Affairs Chairperson Orange, Sr. B. FIRST READING AND VOTE ON PROPOSED BILLS C. READING AND VOTE ON PROPOSED RESOLUTIONS 1. Fiscal Year 2015 Budget Submission Requirements Resolution Chairman Mendelson of 2013 (PR 20-551) w/ Amendment in the Nature of a Substitute 2. Reprogramming No. 20-130 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-580) 3. Reprogramming No. 20-132 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-581) 4. Reprogramming No. 20-134 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-582) 5. Reprogramming No. 20-135 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-583) 6. Reprogramming No. 20-136 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-584) 7. Reprogramming No. 20-137 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-585) 8. Reprogramming No. 20-138 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-586) 9. Reprogramming No. 20-139 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-587) 10. Reprogramming No. 20-140 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-588) 11. Reprogramming No. 20-141 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-590) 12. Reprogramming No. 20-142 Disapproval Resolution of 2013 Chairman Mendelson (PR 20-591) 3 D. FINAL READING AND VOTE ON TEMPORARY LEGISLATION E. READING AND VOTE ON EMERGENCY LEGISLATION 1. Microstamping Implementation Emergency Declaration Chairman Mendelson Resolution of 2013 Microstamping Implementation Emergency Amendment Act of 2013 2. Closing of a Public Alley in Square 858, S.O. 12-03336, Councilmember Wells Emergency Declaration Resolution of 2013 Closing of a Public Alley in Square 858, S.O. 12-03336, Emergency Act of 2013 F. READING AND VOTE ON EMERGENCY LEGISLATION AT THE REQUEST OF THE MAYOR 1. Contract No. DCKA-2012-C-0018 Emergency Declaration Councilmember Cheh at the Resolution of 2013 request of the Mayor Contract No. DCKA-2012-C-0018 Emergency Approval Resolution of 2013 (With Xerox State & Local Solutions, Inc.) G. READING AND VOTE ON TEMPORARY LEGISLATION 1. Microstamping Implementation Temporary Amendment Act of Chairman Mendelson 2013 2. Closing of a Public Alley in Square 858, S.O. 12-03336, Councilmember Wells Temporary Act of 2013 H. READING AND VOTE ON TEMPORARY LEGISLATION AT THE REQUEST OF THE MAYOR VII. NEXT LEGISLATIVE MEETING: January 7, 2014 at 10:00 a.m., in the Council Chamber. 4


| Project Status (03/14/2014 - 16:07:16) | |||
| Project File: | system.xmp | Implementation State: | Programming File Generated |
| Module Name: | system |
|
|
| Product Version: | EDK 14.6 |
|
| XPS Reports | [-] | ||||
| Report Name | Generated | Errors | Warnings | Infos | |
| Platgen Log File | Tue Mar 11 05:21:40 2014 | 0 | 10 Warnings (0 new) | 33 Infos (0 new) | |
| Simgen Log File | |||||
| BitInit Log File | Tue Mar 11 05:38:06 2014 | 0 | 0 | 11 Infos (0 new) | |
| System Log File | Fri Mar 14 16:07:15 2014 |
| XPS Synthesis Summary (estimated values) | [-] | |||||
| Report | Generated | Flip Flops Used | LUTs Used | BRAMS Used | Errors | |
| system | Tue Mar 11 05:22:46 2014 | 15672 | 16786 | 48 | 0 | |
| system_test_system_v1_0_wrapper | Tue Mar 11 05:21:29 2014 | 3338 | 3994 | 0 | ||
| system_clock_generator_0_wrapper | Tue Mar 11 05:19:32 2014 | 1 | 0 | |||
| system_chipscope_ila_0_wrapper | Tue Mar 11 05:02:04 2014 | 0 | ||||
| system_chipscope_icon_0_wrapper | Tue Mar 11 03:39:08 2014 | 0 | ||||
| system_microblaze_0_wrapper | Tue Mar 11 01:18:32 2014 | 2787 | 3032 | 10 | 0 | |
| system_axi4lite_0_wrapper | Sun Mar 9 10:23:30 2014 | 193 | 455 | 0 | ||
| system_digilent_ac97_cntlr_1_wrapper | Thu Feb 20 12:31:15 2014 | 791 | 789 | 0 | ||
| system_digilent_ac97_cntlr_wrapper | Wed Feb 19 16:13:20 2014 | 791 | 789 | 0 | ||
| system_dip_switches_8bits_wrapper | Wed Feb 19 16:13:09 2014 | 63 | 82 | 0 | ||
| system_leds_8bits_wrapper | Wed Feb 19 16:13:01 2014 | 63 | 82 | 0 | ||
| system_mcb_ddr2_wrapper | Wed Feb 19 16:12:52 2014 | 445 | 821 | 0 | ||
| system_push_buttons_5bits_wrapper | Wed Feb 19 16:12:36 2014 | 100 | 124 | 0 | ||
| system_rs232_uart_1_wrapper | Wed Feb 19 16:12:27 2014 | 90 | 123 | 0 | ||
| system_axi4_0_wrapper | Wed Feb 19 16:12:19 2014 | 587 | 402 | 0 | ||
| system_debug_module_wrapper | Wed Feb 19 16:11:52 2014 | 131 | 142 | 0 | ||
| system_microblaze_0_bram_block_wrapper | Wed Feb 19 16:11:05 2014 | 8 | 0 | |||
| system_microblaze_0_d_bram_ctrl_wrapper | Wed Feb 19 16:10:59 2014 | 2 | 6 | 0 | ||
| system_microblaze_0_dlmb_wrapper | Wed Feb 19 16:10:54 2014 | 1 | 0 | |||
| system_microblaze_0_i_bram_ctrl_wrapper | Wed Feb 19 16:10:48 2014 | 2 | 6 | 0 | ||
| system_microblaze_0_ilmb_wrapper | Wed Feb 19 16:10:43 2014 | 1 | 0 | |||
| system_microblaze_0_intc_wrapper | Wed Feb 19 16:10:37 2014 | 59 | 89 | 0 | ||
| system_proc_sys_reset_0_wrapper | Wed Feb 19 16:10:28 2014 | 69 | 55 | 0 |
| Device Utilization Summary (actual values) | [-] | ||||
| Slice Logic Utilization | Used | Available | Utilization | Note(s) | |
| Number of Slice Registers | 14,550 | 54,576 | 26% | ||
| Number used as Flip Flops | 14,530 | ||||
| Number used as Latches | 1 | ||||
| Number used as Latch-thrus | 0 | ||||
| Number used as AND/OR logics | 19 | ||||
| Number of Slice LUTs | 14,417 | 27,288 | 52% | ||
| Number used as logic | 10,134 | 27,288 | 37% | ||
| Number using O6 output only | 7,732 | ||||
| Number using O5 output only | 275 | ||||
| Number using O5 and O6 | 2,127 | ||||
| Number used as ROM | 0 | ||||
| Number used as Memory | 3,288 | 6,408 | 51% | ||
| Number used as Dual Port RAM | 88 | ||||
| Number using O6 output only | 4 | ||||
| Number using O5 output only | 0 | ||||
| Number using O5 and O6 | 84 | ||||
| Number used as Single Port RAM | 0 | ||||
| Number used as Shift Register | 3,200 | ||||
| Number using O6 output only | 1,880 | ||||
| Number using O5 output only | 4 | ||||
| Number using O5 and O6 | 1,316 | ||||
| Number used exclusively as route-thrus | 995 | ||||
| Number with same-slice register load | 753 | ||||
| Number with same-slice carry load | 219 | ||||
| Number with other load | 23 | ||||
| Number of occupied Slices | 5,351 | 6,822 | 78% | ||
| Number of MUXCYs used | 3,056 | 13,644 | 22% | ||
| Number of LUT Flip Flop pairs used | 16,696 | ||||
| Number with an unused Flip Flop | 5,030 | 16,696 | 30% | ||
| Number with an unused LUT | 2,279 | 16,696 | 13% | ||
| Number of fully used LUT-FF pairs | 9,387 | 16,696 | 56% | ||
| Number of unique control sets | 416 | ||||
| Number of slice register sites lost to control set restrictions |
1,573 | 54,576 | 2% | ||
| Number of bonded IOBs | 82 | 218 | 37% | ||
| Number of LOCed IOBs | 82 | 82 | 100% | ||
| IOB Flip Flops | 6 | ||||
| Number of RAMB16BWERs | 47 | 116 | 40% | ||
| Number of RAMB8BWERs | 2 | 232 | 1% | ||
| Number of BUFIO2/BUFIO2_2CLKs | 1 | 32 | 3% | ||
| Number used as BUFIO2s | 1 | ||||
| Number used as BUFIO2_2CLKs | 0 | ||||
| Number of BUFIO2FB/BUFIO2FB_2CLKs | 0 | 32 | 0% | ||
| Number of BUFG/BUFGMUXs | 5 | 16 | 31% | ||
| Number used as BUFGs | 5 | ||||
| Number used as BUFGMUX | 0 | ||||
| Number of DCM/DCM_CLKGENs | 0 | 8 | 0% | ||
| Number of ILOGIC2/ISERDES2s | 3 | 376 | 1% | ||
| Number used as ILOGIC2s | 3 | ||||
| Number used as ISERDES2s | 0 | ||||
| Number of IODELAY2/IODRP2/IODRP2_MCBs | 24 | 376 | 6% | ||
| Number used as IODELAY2s | 0 | ||||
| Number used as IODRP2s | 2 | ||||
| Number used as IODRP2_MCBs | 22 | ||||
| Number of OLOGIC2/OSERDES2s | 48 | 376 | 12% | ||
| Number used as OLOGIC2s | 3 | ||||
| Number used as OSERDES2s | 45 | ||||
| Number of BSCANs | 2 | 4 | 50% | ||
| Number of BUFHs | 0 | 256 | 0% | ||
| Number of BUFPLLs | 0 | 8 | 0% | ||
| Number of BUFPLL_MCBs | 1 | 4 | 25% | ||
| Number of DSP48A1s | 44 | 58 | 75% | ||
| Number of ICAPs | 0 | 1 | 0% | ||
| Number of MCBs | 1 | 2 | 50% | ||
| Number of PCILOGICSEs | 0 | 2 | 0% | ||
| Number of PLL_ADVs | 1 | 4 | 25% | ||
| Number of PMVs | 0 | 1 | 0% | ||
| Number of STARTUPs | 0 | 1 | 0% | ||
| Number of SUSPEND_SYNCs | 0 | 1 | 0% | ||
| Number of RPM macros | 16 | ||||
| Average Fanout of Non-Clock Nets | 3.05 |
| Performance Summary | [-] | |||
| Final Timing Score: | 0 (Setup: 0, Hold: 0, Component Switching Limit: 0) | Pinout Data: | Pinout Report | |
| Routing Results: | All Signals Completely Routed | Clock Data: | Clock Report | |
| Timing Constraints: | All Constraints Met |
| Detailed Reports | [-] | |||||
| Report Name | Status | Generated | Errors | Warnings | Infos | |
| Translation Report | Current | Tue Mar 11 05:24:21 2014 | 0 | 101 Warnings (0 new) | 6 Infos (0 new) | |
| Map Report | Current | Tue Mar 11 05:31:59 2014 | ||||
| Place and Route Report | Current | Tue Mar 11 05:34:49 2014 | 0 | 29 Warnings (0 new) | 2 Infos (0 new) | |
| Post-PAR Static Timing Report | Current | Tue Mar 11 05:35:24 2014 | 0 | 1 Warning (0 new) | 4 Infos (0 new) | |
| Bitgen Report | Current | Tue Mar 11 05:37:21 2014 | 0 | 56 Warnings (0 new) | 1 Info (0 new) |
| Secondary Reports | [-] | ||
| Report Name | Status | Generated | |
| WebTalk Report | Current | Tue Mar 11 05:37:24 2014 | |
| WebTalk Log File | Current | Tue Mar 11 05:37:37 2014 |


Anti-violence vs women drive fortified
by Alfred P. DalizonTHE Philippine National Police is stepping-up its drive to stop violence against women thru a massive public awareness program aimed at further educating the public on the need to fully observe women’s rights.
According to PNP Directorate for Police-Community Relations director, Major General Benigno B. Durana Jr., they are empowering the noble role of men in uniform to be actively involved in government effort to topple all forms of discrimination and violence against women.
Durana yesterday led the opening ceremony of the 6th Men Opposed to Violence Against Women Everywhere (MOVE) PNP summit with the theme “VAW Free Community Starts with Me”.
The official said they envision a VAW-free society where men take an active role in eliminating violence against women as studies show that men are mostly the perpetrators of VAW.
MOVE was launched on November 27, 2006 through the initiative of the Philippine Commission on Women during the commemoration of the 18-Day Campaign to End VAW.
The MOVE PNP Chapter was officially organized on January 14, 2010 during the first MOVE PNP Summit on MOVE attended by PCR officers of the different PNP units and offices.


Welcome All, to Biz Combo Growth Agency,
this an Agency which aims in helping Business Owners & Online entrepreneurs
to grow their daily business or firms.
Quality
Our Services are quality and results comes in the right time
We dont Sell followers for your account but we
We help people brand their firms & business
to gain organic customers or client.
Affordable
We offer services which are Affordable rates,
Our client recieve best results at a Negotiable way
We believe developing people to the next level
Testimonies
Checkout our Testimonies about our Services
& Products we offer to help business people.


Stolen Hours (Reviewed on Aug. 25th/98)
Starring Susan Hayward
"Stolen Hours" asks a very intriguing question: If you found out you had only a year left in which to live your life, how would you live it? It's a question most people never want to think about, but one which the central character of "Stolen Hours" is faced with.
Susan Hayward plays that character, a woman suffering from headaches and minor paralysis, who discovers that she has a terminal form of brain cancer and has 10 to 12 months to live. She is tricked by some friends into seeing a doctor at a party she is holding, and he ends up becoming both her full-time physician and later on, her husband.
It's a tough subject and the film handles it well. About halfway through, I realized something. I realized that I was watching a movie intended for adults. In this day and age when the 18-25 demographic is the most important thing out there, it was a refreshing change to watch a movie that was not meant for adolescents. This is a film about the fear that comes with knowing that the end is near.
Hayward handles the part excellently. She doesn't get hysterical as one might expect, but instead handles herself with a quiet dignity that is almost heartbreaking.  She gives a very open and honest performance, and I didn't find any inconsistencies in it.
"Stolen Hours" is the type of film that is rarely made anymore. There are no major conflicts within the story, no big revelations made, and no useless sub-plots. That's too bad, because movies like this are what make watching movies interesting. They make you think.
*** out of ****
-- David Nusair<EMAIL_ADDRESS>Come visit my "Reel Film Reviews" site! "http://chat.carleton.ca/~dnusair"
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


Modeling of regression effects for transition probabilities in a progressive illness-death model. Azarang, Scheike, and de Una-Alvarez (2017) <doi:10.1002/sim.7245>.
| Version: | 1.1 |
| Depends: | R (≥ 3.4.0), survival, foreach, doParallel |
| Imports: | graphics, utils, stats |
| Published: | 2018-02-27 |
| Author: | Leyla Azarang and Manuel Oviedo de la Fuente |
| Maintainer: | Leyla Azarang <lazarang at bcamath.org> |
| License: | GPL-2 |
| NeedsCompilation: | yes |
| CRAN checks: | idmTPreg results |
| Reference manual: | idmTPreg.pdf |
| Package source: | idmTPreg_1.1.tar.gz |
| Windows binaries: | r-devel: idmTPreg_1.1.zip, r-release: idmTPreg_1.1.zip, r-oldrel: idmTPreg_1.1.zip |
| OS X binaries: | r-release: idmTPreg_1.1.tgz, r-oldrel: idmTPreg_1.1.tgz |
| Old sources: | idmTPreg archive |
Please use the canonical form https://CRAN.R-project.org/package=idmTPreg to link to this page.


Class: ActionText::FixtureSet
| Relationships & Source Files | |
| Inherits: | Object |
| Defined in: | actiontext/lib/action_text/fixture_set.rb |
Overview
Fixtures are a way of organizing data that you want to test against; in short, sample data.
To learn more about fixtures, read the ::ActiveRecord::FixtureSet
documentation.
YAML
Like other Active Record-backed models, ActionText::RichText
records inherit from ::ActiveRecord::Base
instances and can therefore be populated by fixtures.
Consider an Article
class:
class Article < ApplicationRecord
has_rich_text :content
end
To declare fixture data for the related content
, first declare fixture data for Article
instances in test/fixtures/articles.yml
:
first:
title: An Article
Then declare the ActionText::RichText
fixture data in test/fixtures/action_text/rich_texts.yml
, making sure to declare each entry’s record:
key as a polymorphic relationship:
first:
record: first (Article)
name: content
body:
Hello, world.

When processed, Active Record will insert database records for each fixture entry and will ensure the Action Text relationship is intact.
Class Method Summary
-
.attachment(fixture_set_name, label, column_type: :integer)
Fixtures support Action Text attachments as part of their
body
HTML.
Class Method Details
.attachment(fixture_set_name, label, column_type: :integer)
Fixtures support Action Text attachments as part of their body
HTML.
Examples
For example, consider a second Article
fixture declared in test/fixtures/articles.yml
:
second:
title: Another Article
You can attach a mention of articles(:first)
to second
‘s content
by embedding a call to attachment
in the body:
value in test/fixtures/action_text/rich_texts.yml
:
second:
record: second (Article)
name: content
body:
Hello, <%= ActionText::FixtureSet.attachment("articles", :first) %>

# File 'actiontext/lib/action_text/fixture_set.rb', line 59
def self. (fixture_set_name, label, column_type: :integer) signed_global_id = ActiveRecord::FixtureSet.signed_global_id fixture_set_name, label, column_type: column_type, for: ActionText::Attachable::LOCATOR_NAME %(<action-text-attachment sgid="#{signed_global_id}"></action-text-attachment>) end


High-Five Pizza
Select what you want on your pizza!
Please choose a size
Tiny - 6 inch - $7
Medium - 12 inch - $10
Classic - 16 inch - $14
Oh Boy - 32 inch $32
Please choose a crust
Thin
Original
Thin Wheat
Original Wheat
Please choose a cheese
Mozzarella
Cheddar
Please choose a sauce
Marinara
Pesto
White Garlic
BBQ
Add a Topping
Submit your Pizza
Complete your order!
Size:
Crust:
Cheese:
Sauce:
Thank you!


|
RKNPU DDK
1.3.0
|
Data Structures | |
| struct | BatchNormAttr |
| struct | ClipAttr |
| struct | ConcatAttr |
| struct | Conv2DAttr |
| struct | DropoutAttr |
| class | Exection |
| struct | FCAttr |
| struct | FlattenAttr |
| struct | GatherAttr |
| class | Graph |
| struct | InputInfo |
| struct | InstanceNormAttr |
| struct | LayerNormAttr |
| struct | LeakyReluAttr |
| struct | NBGAttr |
| class | Operator |
| struct | OutputInfo |
| struct | PadAttr |
| struct | PermuteAttr |
| struct | PoolAttr |
| struct | QuantizationParamAffineAsymmetric |
| struct | QuantizationParamDFP |
| struct | QuantizationParamSymmetric |
| struct | ReduceAttr |
| struct | ReorgAttr |
| struct | ReshapeAttr |
| struct | ScaleAttr |
| struct | SliceAttr |
| struct | SoftmaxAttr |
| struct | SplitAttr |
| struct | StridedSliceAttr |
| class | Tensor |
| struct | TensorAttr |
| struct | UpsampleAttr |
| anonymous enum |
error code
| Enumerator | |
|---|---|
| RK_SUCCESS |
execute succeed |
| RK_FAILURE |
execute failed |
| RK_INVALID_INPUTS |
Invalid inputs, such as input number mismatch with model. |
| RK_INVALID_OUTPUTS |
Invalid outputs, such as output number mismatch with model. |
| RK_INVALID_MODEL |
Invalid model, Exection::Build() fail. |
| RK_INVALID_PARAM |
Invalid parameter. |
| RK_NO_MEMORY |
memory malloc fail |
| RK_DEVICE_UNAVAILABLE |
device is unavailable. |
| RK_INVALID_TENSOR |
Invalid tensor. |
| RK_INVALID_OP |
Operater does not support or is not implemented. |
|
strong |
|
strong |
| enum OperatorType |
Supported operator types
Operator is created by Graph::AddOperator(type, inputs, outputs, attrs, ...) and each Operator has different inputs and outputs, also has different additional attrs. e.g. CONV2D inputs: [in, weight, bias] outputs: [out] attrs: Conv2DAttr It means that CONV2D needs to set 3 inputs and 1 outputs, and fill the Conv2DAttr structure. simple code as follow: std::vector<std::shared_ptr<rk::nn::Tensor>> inputs, outputs; inputs.push_back(in); inputs.push_back(weight); inputs.push_back(bias); outputs.push_back(out); rk::nn::Conv2DAttr attr; ... // fill attr graph->AddOperator(rk::nn::OperatorType::CONV2D, inputs, outputs, (void*)&attr);
| Enumerator | |
|---|---|
| ADD |
inputs: [in1, in2] outputs: [out] attrs: nullptr |
| MULTIPLY |
inputs: [in1, in2] outputs: [out] attrs: nullptr |
| CONV2D |
inputs: [in, weight, bias] outputs: [out] attrs: Conv2DAttr |
| FULLCONNECT |
inputs: [in, weight, bias] outputs: [out] attrs: FCAttr |
| SOFTMAX |
inputs: [in] outputs: [out] attrs: SoftmaxAttr |
| POOL |
inputs: [in] outputs: [out] attrs: PoolAttr |
| LEAKY_RELU |
inputs: [in] outputs: [out] attrs: LeakyReluAttr |
| LRN |
unimplement |
| CONCAT |
inputs: [in1, in2, ...] outputs: [out] attrs: ConcatAttr |
| SPLIT |
unimplement |
| ROI_POOL |
unimplement |
| BATCH_NORM |
inputs: [in, mean, var, scale, bias] outputs: [out] attrs: BatchNormAttr |
| PROPOSAL |
unimplement |
| DECONVOLUTION |
unimplement |
| RESHAPE |
inputs: [in] outputs: [out] attrs: ReshapeAttr |
| PERMUTE |
inputs: [in] outputs: [out] attrs: PermuteAttr |
| PRELU |
inputs: [in] outputs: [out] attrs: PReluAttr |
| UPSAMPLE |
unimplement |
| RELU |
inputs: [in] outputs: [out] attrs: nullptr |
| RELUN |
unimplement |
| LSTM |
unimplement |
| REORG |
unimplement |
| L2_NORMALIZE |
inputs: [in] outputs: [out] attrs: nullptr |
| POOLWITHARGMAX |
unimplement |
| ARGMAX |
unimplement |
| MAXIMUM |
inputs: [in1, in2] outputs: [out] attrs: nullptr |
| L2NORMALIZESCALE |
unimplement |
| CROP |
unimplement |
| SUBTRACT |
inputs: [in1, in2] outputs: [out] attrs: nullptr |
| RELU6 |
inputs: [in] outputs: [out] attrs: nullptr |
| SIGMOID |
inputs: [in] outputs: [out] attrs: nullptr |
| TANH |
inputs: [in] outputs: [out] attrs: nullptr |
| SQRT |
inputs: [in] outputs: [out] attrs: nullptr |
| RSQRT |
unimplement |
| DIVIDE |
unimplement |
| DROPOUT |
unimplement |
| SHUFFLECHANNEL |
unimplement |
| RESIZE |
unimplement |
| REVERSE |
unimplement |
| DEPTH2SPACE |
unimplement |
| SPACE2DEPTH |
unimplement |
| DATACONVERT |
inputs: [in] outputs: [out] attrs: nullptr |
| SCALE |
inputs: [in, scale, bias] outputs: [out] attrs: ScaleAttr formula: Y = scale*X + bias |
| SLICE |
inputs: [in] outputs: [out] attrs: SliceAttr |
| ELU |
unimplement |
| BATCH2SPACE |
unimplement |
| SPACE2BATCH |
unimplement |
| PAD |
inputs: [in] outputs: [out] attrs: PadAttr |
| MATRIXMUL |
unimplement |
| LSTMUNIT |
unimplement |
| LAYER_NORM |
inputs: [in, mean, var] outputs: [out] attrs: LayerNormAttr |
| REDUCE |
inputs: [in] outputs: [out] attrs: nullptr |
| INSTANCE_NORM |
inputs: [in, mean, var] outputs: [out] attrs: InstanceNormAttr |
| TENSORSTACKCONCAT |
unimplement |
| STRIDED_SLICE |
inputs: [in] outputs: [out] attrs: StridedSliceAttr |
| SIGNAL_FRAME |
unimplement |
| A_TIMES_B_PLUS_C |
unimplement |
| SVDF |
unimplement |
| ABS |
inputs: [in] outputs: [out] attrs: nullptr |
| CONV1D |
unimplement |
| LRN2 |
unimplement |
| POW |
unimplement |
| FLOORDIV |
unimplement |
| MINIMUM |
unimplement |
| RELU1 |
unimplement |
| STACK |
unimplement |
| FLOOR |
unimplement |
| SQUARE |
unimplement |
| NEG |
inputs: [in] outputs: [out] attrs: nullptr |
| EXP |
unimplement |
| HASHTABLE_LOOKUP |
unimplement |
| EMBEDDING_LOOKUP |
unimplement |
| LSH_PROJECTION |
unimplement |
| RNN |
unimplement |
| CLIP |
inputs: [in] outputs: [out] attrs: ClipAttr |
| UNSTACK |
unimplement |
| ADDN |
unimplement |
| GATHER |
inputs: [in] outputs: [out] attrs: GatherAttr |
| TOPK |
unimplement |
| SIN |
unimplement |
| LOG |
unimplement |
| ARGMIN |
unimplement |
| ROI_ALIGN |
unimplement |
| LOG_SOFTMAX |
unimplement |
| NBG |
inputs: [in] outputs: [out] attrs: NBGAttr |
| FLATTEN |
inputs: [in] outputs: [out] attrs: FlattenAttr |
Definition at line 41 of file operator.h.
|
strong |
|
strong |
Pad type enum
|
strong |
|
strong |
|
strong |
|
strong |
|
strong |
|
strong |


QuantConnect provides Morningstar fundamentals data for US Equities. Valuation Ratios is daily data. For others like operation ratios and financial statements data are available for multiple periods depending on the property. Please refer to Data Library for detailed factors available.
The algorithm is designed to test the significance of one factor each time.
def Initialize(self): self.SetStartDate(2005,01,01) #Set Start Date self.SetEndDate(2012,03,01) #Set End Date self.SetCash(50000) #Set Strategy Cash self.UniverseSettings.Resolution = Resolution.Daily self.AddUniverse(self.CoarseSelectionFunction, self.FineSelectionFunction) self.AddEquity("SPY") # add benchmark self.numOfCourseSymbols = 200 self.numOfPortfolio = 5 self._changes = None self.flag1 = 1 # variable to control the monthly rebalance of coarse and fine selection function self.flag2 = 0 # variable to control the monthly rebalance of OnData function self.flag3 = 0 # variable to record the number of rebalancing times # store the monthly returns of different portfolios in a dataframe self.df_return = pd.DataFrame(index = range(self.numOfPortfolio+1)) # schedule an event to fire at the first trading day of SPY self.Schedule.On(self.DateRules.MonthStart("SPY"), self.TimeRules.AfterMarketOpen("SPY"), Action(self.Rebalancing))
1. First, we sort the stocks by daily dollar volume and take the top stocks with the highest dollar volumes as our candidates. There is a convenient way using our universe selection API. Universes are refreshed every day by default, but can be refreshed as often as required. This is controlled by the variable UniverseSettings.Resolution
. You can refer to the documentation for more details. Here we use Scheduled events API to trigger code to run at the first trading day each month and use three flag variables to control the rebalancing of CoarseSelection
, FineSelection
and Ondata
functions.
Coarse Universe selection is the built-in universe data provided by QuantConnect which allows you to filter the universe of over 16000 symbols to perform rough filtering before your algorithm. Because coarse selection function takes all the equities including ETFs which have no fundamental data into account, we need the property x.HasFundamentalData
to exclude them from our candidate stocks pool.
# sort the data by daily dollar volume and take the top entries def CoarseSelectionFunction(self, coarse): if self.flag1: CoarseWithFundamental = [x for x in coarse if x.HasFundamentalData] sortedByVolume = sorted(CoarseWithFundamental, key=lambda x: x.DollarVolume, reverse=True) top = sortedByVolume[:self.numOfCourseSymbols] return [i.Symbol for i in top] else: return []
2. We extract the factor values of candidate stocks at the beginning of each month and sort the stocks in ascending
order of their factor values. Here we use 12-months' total risk-based capital data
x.FinancialStatements.TotalRiskBasedCapital.TwelveMonths
as an example.
It is the sum of Tier 1 and Tier 2 Capital. x.Symbol.Value
can give the string symbol of selected stock x. Then we save those sorted symbols as self.symbol
.
def FineSelectionFunction(self, fine): if self.flag1: self.flag1 = 0 self.flag2 = 1 # filter the fine by deleting equities wit zero factor value filtered_fine = [x for x in fine if x.FinancialStatements.TotalRiskBasedCapital.TwelveMonths != 0 ] # sort the fine by reverse order of factor value sorted_fine = sorted(filtered_fine, key=lambda x: x.FinancialStatements.TotalRiskBasedCapital.TwelveMonths, reverse=True) self.symbol = [str(x.Symbol.Value) for x in sorted_fine] # factor_value = [x.ValuationRatios.PERatio for x in sorted_fine] self.flag3 = self.flag3 + 1 return [] else: return []
1. At the end of each month, we extract the one-month history close prices of each stock and compute the monthly returns.
sorted_symbol = self.symbol self.AddEquity("SPY") # add benchmark for x in sorted_symbol: self.AddEquity(x) history = self.History(20,Resolution.Daily) monthly_return =[] new_symbol_list =[] for j in range(len(sorted_symbol)): try: daily_price = [] for slice in history: bar = slice[sorted_symbol[j]] daily_price.append(float(bar.Close)) new_symbol_list.append(sorted_symbol[j]) monthly_return.append(daily_price[-1] / daily_price[0] - 1) except: self.Log("No history data for " + str(sorted_symbol[j])) del daily_price # the length of monthly_return list should be divisible by the number of portfolios monthly_return = monthly_return[:int(math.floor(len(monthly_return) / self.numOfPortfolio) * self.numOfPortfolio)]
2. We divide the stocks into 5 portfolios and compute the average monthly returns of each portfolio. Then we add the monthly return of benchmark "SPY" at the last line of the data frame df_return
.
reshape_return = np.reshape(monthly_return, (self.numOfPortfolio, len(monthly_return)/self.numOfPortfolio)) # calculate the average return of different portfolios port_avg_return = np.mean(reshape_return,axis=1).tolist() # add return of "SPY" as the benchmark to the end of the return list benchmark_syl = self.AddEquity("SPY").Symbol history_benchmark = self.History(20,Resolution.Daily) benchmark_daily_price = [float(slice[benchmark_syl].Close) for slice in history_benchmark] benchmark_monthly_return = (benchmark_daily_price[-1]/benchmark_daily_price[0]) - 1 port_avg_return.append(benchmark_monthly_return) self.df_return[str(self.flag3)] = port_avg_return
After getting the monthly returns of portfolios and the benchmark, we compute the average annual return and excess return over benchmark of each portfolio across the whole backtesting period. Then We generate three metrics to judge the significance of each factor.
def calculate_criteria(self,df_port_return): total_return = (df_port_return + 1).T.cumprod().iloc[-1,:] - 1 annual_return = (total_return+1)**(1./6)-1 excess_return = annual_return - np.array(annual_return)[-1] correlation = annual_return[0:5].corr(pd.Series([5,4,3,2,1],index = annual_return[0:5].index)) # higher factor with higher return if np.array(total_return)[0] > np.array(total_return)[-2]: loss_excess = df_port_return.iloc[-2,:] - df_port_return.iloc[-1,:] win_excess = df_port_return.iloc[0,:] - df_port_return.iloc[-1,:] loss_prob = loss_excess[loss_excess<0].count()/float(len(loss_excess)) win_prob = win_excess[win_excess>0].count()/float(len(win_excess)) win_port_excess_return = np.array(excess_return)[0] loss_port_excess_return = np.array(excess_return)[-2] # higher factor with lower return else: loss_excess = df_port_return.iloc[0,:] - df_port_return.iloc[-1,:] win_excess = df_port_return.iloc[-2,:] - df_port_return.iloc[-1,:] loss_prob = loss_excess[loss_excess<0].count()/float(len(loss_excess)) win_prob = win_excess[win_excess>0].count()/float(len(win_excess)) win_port_excess_return = np.array(excess_return)[-2] loss_port_excess_return = np.array(excess_return)[0] test_result = {} test_result["correelation"]=correlation test_result["win probality"]=win_prob test_result["loss probality"]=loss_prob test_result["win portfolio excess return"]=win_port_excess_return test_result["loss portfolio excess return"]=loss_port_excess_return return test_result
| Factor Significance Testing Result | |||||||
|---|---|---|---|---|---|---|---|
| Factor | FCFYield | BuyBackYield | PriceChange1M | TrailingDividendYield | EVToEBITDA | RevenueGrowth | BookValuePerShare |
| The correlation | -0.936 | -0.987 | 0.918 | -0.981 | 0.939 | 0.89 | -0.92 |
| Win Probability | 0.630 | 0.639 | 1 | 0.667 | 0.722 | 0.69 | 0.69 |
| Loss probability | 0.426 | 0.472 | 1 | 0.518 | 0.472 | 0.42 | 0.40 |
| Excess Return(Win) | 0.324 | 0.212 | 0.303 | 0.225 | 0.414 | 0.23 | 0.27 |
| Excess Return(Loss) | 0.060 | 0.037 | -1.67 | 0.043 | 0.042 | 0.07 | 0.06 |
We choose 4 factors: FCFYield, PriceChange1M, BookValuePerShare and RevenueGrowth.


JF
2020
Typography Motion Effect
Previous demo
Article
GitHub
About
Close
Make Data
your strength
Recreation of the effect on
Dani Morales
by
Thibaud Allie
Johnathan Flynn is
a Salt Lake City
based
data
and
social
engineer
We are here face to face with a crucial point in analytic realism. Realism argues that we have no alternative except either to regard analysis as falsifying, and thus commit ourselves to distrust of science as an organ of knowledge.


Vue dashboard interfaced with Bookkeeper, a Java distributed storage service.
Android App developed to place your orders inside a sushi restaurant.
Java Maven application developed to bench SMTP Protocol with Java Mail.
Python based application to Analayze the exported Telegram chat file.


Products
Laptops
Prebuilt Systems
Components
Peripherals
Networking
Contact
Account
Cart
Daily Featured Products


In this chapter we will learn how to create a release built for our apk. This involves creating a keystore signing key, uploading it to phonegap build and rebuilding your apk.
In order to be able to sign your apk’s, you will need to first generate a signing keystore. The tool used to generate a keystore is called keytool, and it comes with java. Therefore, in this section, we will learn how to install Java.
Java JDK comes from Oracle. So using google, search for ‘Download Java’. Once you find the download link, follow the link and then download the latest version of Java. After installing, you will need to set the path environment variable to your java bin folder. On my machine, the path to java bin folder is as shown in Fig 10-1 below.
On my Windows 10 machine the path is as follows:
C:\Program Files (x86)\Java\jre1.8.0_201\bin
It may be different for you. You need to check and copy your own machine’s path. After copying the path, we will append this to the path environment variable. First, go to System Properties and click on the button ‘Environment Variables…’ as shown in Fig 10-2 below.
This will take you to the next screen as shown in Fig 10-3 below.
From Fig 10-3 above, you can see a list of System variables in the bottom panel. Select Path, then click on the button ‘Edit…’. This will take you to the next screen as shown in Fig 10-4 below.
In Fig 10-4 above, click on the button New and paste in the path which you copied earlier. As you can see, I have created a new path. You can then click on the Move Up button to bring it to the top. After having added the java bin path to the path environment variable, you will need to close all your opened cmd terminal and re-open again so that the new path can be read by cmd.
Open a new cmd terminal and navigate to the folder where you want to create a new keystore. Type in the command as shown below:
keytool -genkey -v -keystore Test.keystore -alias Test -keyalg RSA -keysize 2048 -validity 10000
Note that there is a space between keyalg and RSA. There will be a series of questions asking you to type in the value for the following keys:
name
alias
keypass
aliasPass
The keypass and aliasPass should be the same password. The name and alias should also be the same. After you have generated the keystore file, upload it to build.phonegap.com. See Fig 10-5 below on how to do this.
 Then select ‘Edit account’. Then click on the button ‘add key’. Save your files, push to github then head over to build.phonegap.com and unlock the keystore which you uploaded earlier. See Fig 10-6 below on how to unlock the keystore.
First you select the keystore that you wish to use. Then enter the password for it as shown in Fig 10-7 below.
Note that the certificate password and the keystore passwords are the same. Then, build your apk. This will be a release build which can be published on Google play. You can download the capx file for this book’s project here:
With that we have come to the end of this chapter.


The 'too long; didn't read' version for the incurrably impatient
You need:
To build run the following commands
$ wget -O fandangled.zip --no-check-certificate https://github.com/andyhedges/Fandangled/zipball/v0.0.2
$ unzip fandangled.zip
$ cd andyhedges-Fandangled-29a1926
$ mvn clean install
Once maven has finished you should have a compiled set of jar files
Unless you are a library user you will be interested in either of the two executable files, one is a gui the other is command line. The commandline is at the following path:
command-line/target/command-line-0.0.2-SNAPSHOT.jar
The gui is at the following path
basic-gui/target/basic-gui-0.0.2-SNAPSHOT.jar
I recommend you use the command line, the GUI was a bit of an experiement and gui design isn't my strength. If you fancy writing a better one please get in touch<EMAIL_ADDRESS>put 'Fandangled' in the subject line somewhere)


/dev/blog
Bez Hermoso, Software Engineer @ Square
Since PHP 7.0, the addition of the null coalescing operator ??
has made writing certain boilerplate patterns obsolete, like the common pattern of using isset(...)
to avoid a myriad of errors when addressing deeply-nested array elements that don’t exist.
Another pattern that is ripe for replacement is for value re-use, like those usually found in singletons, in-memory caches, memoizations:
<?php
class Singleton
{
private static $instance;
private function __construct() { ... };
public static function getInstance(): Singleton
{
return self::$instance = self::$instance ?? new static();
}
}
<?php
class Fibonacci
{
private $cache = [];
public function find($n): int
{
return $this->cache[$n] =
$this->cache[$n] ?? self::find($n) + self::find($n - 2);
}
}


Welcome! I'm Sam, and I am a Technical Account Manager (TAM) at GitLab! Previously I was a Software Engineer @Amazon/Alexa. I enjoy implementing business solutions for enterprises using DevOps technologies. My development experience ranges from drones to voice assistants. Contact me via email or Twitter for more information.
GPA: 3.63
Involvement: Alpha Sigma Kappa Sorority - Social Committee Chair (Fall 2018), She's the First, Student Government Association, Student Body President Advisory Council, Women in Electrical Engineering and Computer Science (WEECS), Upsilon Pi Epsilon Honor Society for Computing Sciences, Young Woman Leaders Program
In my free time, I enjoy attending concerts, working out at OrangeTheory or the gym, learning about new technologies, watching horror films, and riding rollercoasters at Universal Orlando.
Fun facts: my initials spell S.A.M., I love sushi, my favorite rollercoaster is Hagrid's Motorbike Adventure @ Islands of Adventure, my favorite concert was Troye Sivan, I have been to New York, Seattle, San Francisco, and Orlando Pride, and I love espresso. :)
I have seen a fair few resumes from traditional to technical. They are often auto-filled in Microsoft Word or generated from an outdated online template. I used to dabble in the pre-designed resume world, but eventually I found the "name, objective, education, skills, experience" format to be boringly serial and space inefficient.
Read MoreNobody has enough time in the day, and in today's society, no one wants to have enough time because then they aren't using their time as optimally as humanly possible. In all seriousness, we are all looking for ways to make our days a little bit easier and make the difficult parts go faster. Here are some hacks to speed up your life when you need to so you can slow down when you want to.
Read MoreAs a coach and a college student, I hear this sentence all the time. Sometimes it's an excuse; I don't have time because I don't want to do it, and I certainly don't have time to think about how I probably have time to do it. On other occasions, people truly have limited time in their days. Amid long commutes, work, classes, relationships, and family, we are all spread thinner than we would like. However, in most circumstances, we do have time for what we have to do, what we want to do, and for planning it all. Here is how to evaluate and act in scenarios when you think there is "no time."
Read More"Alright, so. Computer Science major. Solid GPA. Challenging coursework. Great leadership record. Commitment to various causes. Lots of volunteer work. Internship and research experience. But there's something missing..."
Here is where I heard the pesky word, the word that always managed to kick its way into interviews and discussions among peers. The word that makes people glow when they hear it. The word that can make or break your resume.
"Projects."


|
Nana C++ Library An open-source C++ framework project The Programmer's Guide |
||||
|
nana::paint::image_process::stretch_interface Description The interface of stretch algorithm. Model of None Public base classes None Members
File nana/paint/image_process_interface.hpp Notes None. See also None. Move to The Nana Programmer's Guide Main Page |
||||


In this project, we're going to look at some of the biggest problems in the world and create a Scratch game that could help raise awareness or tackle this challenge. Here is an example project:
1) Click on the image below to read about the UN Sustainable Development Goals and choose one you are passionate about. Another option is to choose a problem that is more local to your community.
2) Once you have selected your goal, it's research time! Use the UN.org, Google, and Wikipedia to gather 10 facts or more about this global issue.
3) Now, let's view a few more examples of tech that is changing the world.
UN Goal: No Poverty
Free Rice: A game that when you select the correct vocab definition donates rice in real life to the charity of your choice.
UN Goal: Climate Action
Tree Planet 2: When you raise your tree in the game, they plant a tree in the real forest! In the past 3 years, they have planted 240,000 real trees.
4) Think back to your goal. What kind of game can you create to raise awareness or help tackle this problem?


Prof. Niels Henrik David Bohr (7 October 1885 – 18 November 1962) was a Danish physicist who made foundational contributions to understanding atomic structure and quantum theory, for which he received the Nobel Prize in Physics in 1922. He developed the Bohr model of the atom, in which he proposed that energy levels of electrons are discrete and that the electrons revolve in stable orbits around the atomic nucleus but can jump from one energy level (or orbit) to another. Bohr was also a philosopher and a promoter of scientific research. He also conceived the principle of complementarity: that items could be separately analysed in terms of contradictory properties, like behaving as a wave or a stream of particles. The notion of complementarity dominated Bohr's thinking in both science and philosophy.
Here's a non-exhaustive timeline of Prof. Bohr's incredible life:
- 1885 - Born in Copenhagen, Denmark
- 1903 - Enrolled as an undergraduate student at Copenhagen University to study a physics major
- 1905 - Won a gold medal at a competition to investigate a method for measuring the surface tension of liquids as proposed by Lord Rayleigh
- 1910 - Earned his Master's degree for his work on electron theory of metals
- 1911 - Travelled to England where he met Prof. J.J. Thomson and Prof. Earnest Rutherford
- 1912 - Married Ms. Margrethe Nørlund and became a privatdocent
- 1913 - Became a docent and published "the trilogy" which introduced Bohr's model of the atom
- 1920 - Founded the Institute of Theoretical Physics at the University of Copenhagen
- 1922 - Awarded the Nobel Prize in Physics for "for his services in the investigation of the structure of atoms and of the radiation emanating from them"
- 1924 - Contributed to proposing the Bohr-Kramers-Slater Theory (BKS theory)
- 1927 - Conceived the philosophical principle of complementarity and demonstrated that the uncertainty principle could be derived from classical arguments, without quantum terminology or matrices.
- 1931 - Moved to the Carlsberg breweries mansion
- 1939 - Elected President of the Royal Danish Academy of Sciences and Letters
- 1941 - Famously met Prof. Heisenberg
- 1943 - Fled to Sweden to escape the Nazis and convinced the King to provide asylum to over 7,000 Danish Jews before meeting with Tube Alloys in the UK and the Manhattan Project in the US
- 1944 - Met with UK Prime Minister Winston Churchill and US President Franklin D. Roosevelt to discuss nuclear weapons development
- 1945 - Returned to Copenhagen after the war
- 1947 - Conferred the Danish Order of the Elephant
- 1950 - Addressed an "Open Letter" to the United Nations calling for international cooperation on nuclear energy
- 1952 - Pledged his support to CERN being constructed in Geneva
- 1956 - Became chariman of the Research Establishment Risø of the Danish Atomic Energy Commission
- 1957 - Received the first ever Atoms for Peace Award and became chairman of the Nordic Institute of Theoretical Physics
- 1962 - Died of a heart failure at his home in Carlsberg
- 1965 - The Institute of Theoretical Physics officially renamed to the Niels Bohr Institute
"Not often in life has a human being caused me such joy by his mere presence as you did."
~ Prof. Albert Einstein in a letter to Prof. Bohr


| Order Id | Customer ID | Customer Name | Address | Customer Phone | Order Date | Total Price(Rs.) | Order Status | Is Back Listed | Action | Invoice Action |
|---|---|---|---|---|---|---|---|---|---|---|
| {{data.aum_order_id}} | {{data.customer_id}} | {{data.customer_name}} | {{data.customer_address}} | {{data.customer_phone}} | {{data.order_date}} | {{data.total}} |
Done
Pending
|
YES
NO
|
Create Invoice |


{% extends "base.html" %} {% load bootstrap4 %} {% block content %}
Enter your email address below, and we'll email instructions for setting a new one.


Home
Sign UP
Search Train
Meals
North Indian Food
South Indian Food
Chineese Food
Beverage
Holiday Packages
Summer Holidays full package
Winter Holidays full package
occational Holidays package
Service at station
Train
Junction
Contact us
Contact security
Contact service
Roundtrip
One way
from
To
Adults (18+)
1
2
3
4
5
6
Children (0-17)
0
1
2
Travel class
AC First class(1A)
AC 2 Tier(2A)
AC 3 Tier(3A)
Sleeper(SL)
Show Train


Introduction
HACKED!!
Single day ethical hacking workshop by the ethical hacking “Guru” Ankit Fadia!
.
AUTHOR OF 15 BEST-SELLING BOOKS.
SELECTED AS GLOBAL SHAPER BY THE WORLD ECONOMIC FORUM.
MTV YOUTH ICON 2008 WINNER.
HOST OF MTV SHOW CALLED MTV WHATTHE HACK!
CONSULTANT TO GOVERNMENTS, POLICE
& CORPORATES GLOBALLY.
Key Benefits of Ankit Fadia's Training Programs:
LEARN the latest tools, techniques and methods being used by cyber criminals & terrorists
and how to fight them.

INTERACT with the Ankit Fadia - author of 15 bestselling books, MTV Youth Icon 2008, host
of MTV What the Hack and world renowned computer security expert.
PROTECT yourself and your company against the most dangerous cyber security threats on
the Internet.
Schedule
Coming soon...
Contact
BHEEM SEN
+91-8866361815
AKANSHA DIMRI
+91-8690642173
<EMAIL_ADDRESS>HEMIK PARIKH
+91-9033126806
hemikparikh11@gmail.com


--- layout: article title: The Quest for High Productivity date: 2015-04-14 08:43:23.000000000 -05:00 modified: categories: excerpt: tags: [] image: feature: teaser: quest-teaser.jpg thumb: ---
I wanted to get more experience finishing applications that are a little more manageable than ClimbON, so I started a new application for tracking personal goals. I know now that applications can grow beyond your skill level pretty easily if you aren't careful. Throwing oneself in the deep end with an ambitious project is productive at times, however, since I still need to completely finish a project that is all my own, I was a bit ahead of myself with ClimbON. I am definitely going to keep working on it since it is a project I am really excited about, just at a slower pace. In the meantime, I decided to try my hand at designing a productivity application.
The inspiration for this new project stems from my time learning web application development. Since I am the sole contributor behind my work and any output I produce, my motivation in part stems from how much progress I think I have made on a problem. Whenever it takes awhile to solve a problem, my ability to see the broader picture tends to cloud over because I have only one pair of eyes on the situation. I want to solve this dilemma by designing an application that tracks any progress I have made toward a specific goal and displaying those results in an easily digestible manner. By presenting information in a concise, visual manner, it should jog my brain to think of the bigger picture and not get stuck on trivial problems. To give it a little twist, I want to reference end goals as "quests" and provide the option to add a bit of gamification down the road if this app becomes more complex.
You can follow development of this application at my GitHub repository here.
Primary goals for this application:
Secondary goals for this application:


Unique Features:
Pegaesys has unique features which distinguish us from other CAD software.
Easy learning curve.
Drawing in scaled units.
Minimum keystrokes.
Stable drafting platform.
Maximum drawing area.
Shared files.
High speed drawing preview.
Snaps on demand - in any Mode
3D all the time.
Dynamic Pick and Drag.
Programming support using DDE.
Clipboard support for text, graphics, and bitmaps.
Graphic pan and zoom.
Dimensioned Input - distance, then direction.
Essential standing reports.
Associative dimensions.
Auxiliary Modes speed operations.


This large sheltered bay is on the north coast. The town of Pepillo Salcedo, in the southern corner of the bay, has a commercial port and jetty .
This clean, neat town provides a useful stop for some basic fresh provisions and other services.
Position 19° 42'36"N,71° 44'37"W.
See DR Formalities for detailed clearance information and fees
This is a port of entry and all the officials are in the town.
The abandoned Canadian ferry is an unmissable landmark for this anchorage. Give the ferry a wide berth.
Avoid anchoring on the east side of the bay in the National Park as this would be seen as suspicious. It is better to go to the Saltwater lagoon (Estero Balza) in the South West part of the bay, south of the commercial dock.
This is a quiet saltwater lagoon where you can anchor in about 3m. The small village of Pepillo Salcedo is within walking distance of the anchorage.
Last updated March 2015.


dbus-glib comes with dbus-binding-tool, which can produce somewhat nice client- and server-side wrappers for a D-Bus interface. With GDBus, gdbus-codegen is used and like its counterpart, it also takes D-Bus Introspection XML as input:
Example 2. Example D-Bus Introspection XML
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 |
<node> <!-- org.gtk.GDBus.Example.ObjectManager.Animal: @short_description: Example docs generated by gdbus-codegen @since: 2.30 This D-Bus interface is used to describe a simple animal. --> <interface name="org.gtk.GDBus.Example.ObjectManager.Animal"> <!-- Mood: The mood of the animal. @since: 2.30 Known values for this property include <literal>Happy</literal> and <literal>Sad</literal>. Use the org.gtk.GDBus.Example.ObjectManager.Animal.Poke() method to change this property. This property influences how often the animal jumps up and down, see the #org.gtk.GDBus.Example.ObjectManager.Animal::Jumped signal for more details. --> <property name="Mood" type="s" access="read"/> <!-- Poke: @make_sad: Whether to make the animal sad. @make_happy: Whether to make the animal happy. @since: 2.30 Method used to changing the mood of the animal. See also the #org.gtk.GDBus.Example.ObjectManager.Animal:Mood property. --> <method name="Poke"> <arg direction="in" type="b" name="make_sad"/> <arg direction="in" type="b" name="make_happy"/> </method> <!-- Jumped: @height: Height, in meters, that the animal jumped. @since: 2.30 Emitted when the animal decides to jump. --> <signal name="Jumped"> <arg type="d" name="height"/> </signal> <!-- Foo: Property with no <quote>since</quote> annotation (should inherit the 2.30 from its containing interface). --> <property name="Foo" type="s" access="read"/> <!-- Bar: @since: 2.36 Property with a later <quote>since</quote> annotation. --> <property name="Bar" type="s" access="read"/> </interface> <!-- org.gtk.GDBus.Example.ObjectManager.Cat: @short_description: More example docs generated by gdbus-codegen This D-Bus interface is used to describe a cat. Right now there are no properties, methods or signals associated with this interface so it is essentially a <ulink url="http://en.wikipedia.org/wiki/Marker_interface_pattern">Marker Interface</ulink>. Note that D-Bus objects implementing this interface also implement the #org.gtk.GDBus.Example.ObjectManager.Animal interface. --> <interface name="org.gtk.GDBus.Example.ObjectManager.Cat"> </interface> </node> |
If this XML is processed like this
1 2 3 4 5 6 |
gdbus-codegen --interface-prefix org.gtk.GDBus.Example.ObjectManager. \ --generate-c-code generated-code \ --c-namespace Example \ --c-generate-object-manager \ --generate-docbook generated-docs \ gdbus-example-objectmanager.xml |
then two files generated-code.h
and
generated-code.c
are
generated. Additionally, two XML files
generated-docs-org.gtk.GDBus.Example.ObjectManager.Animal
and
generated-docs-org.gtk.GDBus.Example.ObjectManager.Cat
with Docbook XML are generated. For an example of what the docs look
like see the Animal D-Bus interface documentation.
and
the Cat D-Bus interface documentation.
While the contents of generated-code.h
and
generated-code.c
are best described by the
gdbus-codegen manual
page, brief examples of how this generated code can be used can be found in
Example 3, “Server-side application using generated code”
and Example 4, “Client-side application using generated code”. Additionally, since
the generated code has 100% gtk-doc coverage, see
ExampleAnimal, ExampleCat, ExampleObject and
ExampleObjectManagerClient pages for documentation.
Example 3. Server-side application using generated code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 |
#include "gdbus-object-manager-example/gdbus-example-objectmanager-generated.h" /* ---------------------------------------------------------------------------------------------------- */ static GDBusObjectManagerServer *manager = NULL; static gboolean on_animal_poke (ExampleAnimal *animal, GDBusMethodInvocation *invocation, gboolean make_sad, gboolean make_happy, gpointer user_data) { if ((make_sad && make_happy) || (!make_sad && !make_happy)) { g_dbus_method_invocation_return_dbus_error (invocation, "org.gtk.GDBus.Examples.ObjectManager.Error.Failed", "Exactly one of make_sad or make_happy must be TRUE"); goto out; } if (make_sad) { if (g_strcmp0 (example_animal_get_mood (animal), "Sad") == 0) { g_dbus_method_invocation_return_dbus_error (invocation, "org.gtk.GDBus.Examples.ObjectManager.Error.SadAnimalIsSad", "Sad animal is already sad"); goto out; } example_animal_set_mood (animal, "Sad"); example_animal_complete_poke (animal, invocation); goto out; } if (make_happy) { if (g_strcmp0 (example_animal_get_mood (animal), "Happy") == 0) { g_dbus_method_invocation_return_dbus_error (invocation, "org.gtk.GDBus.Examples.ObjectManager.Error.HappyAnimalIsHappy", "Happy animal is already happy"); goto out; } example_animal_set_mood (animal, "Happy"); example_animal_complete_poke (animal, invocation); goto out; } g_assert_not_reached (); out: return TRUE; /* to indicate that the method was handled */ } static void on_bus_acquired (GDBusConnection *connection, const gchar *name, gpointer user_data) { ExampleObjectSkeleton *object; guint n; g_print ("Acquired a message bus connection\n"); /* Create a new org.freedesktop.DBus.ObjectManager rooted at /example/Animals */ manager = g_dbus_object_manager_server_new ("/example/Animals"); for (n = 0; n < 10; n++) { gchar *s; ExampleAnimal *animal; /* Create a new D-Bus object at the path /example/Animals/N where N is 000..009 */ s = g_strdup_printf ("/example/Animals/%03d", n); object = example_object_skeleton_new (s); g_free (s); /* Make the newly created object export the interface * org.gtk.GDBus.Example.ObjectManager.Animal (note * that @object takes its own reference to @animal). */ animal = example_animal_skeleton_new (); example_animal_set_mood (animal, "Happy"); example_object_skeleton_set_animal (object, animal); g_object_unref (animal); /* Cats are odd animals - so some of our objects implement the * org.gtk.GDBus.Example.ObjectManager.Cat interface in addition * to the .Animal interface */ if (n % 2 == 1) { ExampleCat *cat; cat = example_cat_skeleton_new (); example_object_skeleton_set_cat (object, cat); g_object_unref (cat); } /* Handle Poke() D-Bus method invocations on the .Animal interface */ g_signal_connect (animal, "handle-poke", G_CALLBACK (on_animal_poke), NULL); /* user_data */ /* Export the object (@manager takes its own reference to @object) */ g_dbus_object_manager_server_export (manager, G_DBUS_OBJECT_SKELETON (object)); g_object_unref (object); } /* Export all objects */ g_dbus_object_manager_server_set_connection (manager, connection); } static void on_name_acquired (GDBusConnection *connection, const gchar *name, gpointer user_data) { g_print ("Acquired the name %s\n", name); } static void on_name_lost (GDBusConnection *connection, const gchar *name, gpointer user_data) { g_print ("Lost the name %s\n", name); } gint main (gint argc, gchar *argv[]) { GMainLoop *loop; guint id; loop = g_main_loop_new (NULL, FALSE); id = g_bus_own_name (G_BUS_TYPE_SESSION, "org.gtk.GDBus.Examples.ObjectManager", G_BUS_NAME_OWNER_FLAGS_ALLOW_REPLACEMENT | G_BUS_NAME_OWNER_FLAGS_REPLACE, on_bus_acquired, on_name_acquired, on_name_lost, loop, NULL); g_main_loop_run (loop); g_bus_unown_name (id); g_main_loop_unref (loop); return 0; } |
Example 4. Client-side application using generated code
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 |
#include "gdbus-object-manager-example/gdbus-example-objectmanager-generated.h" /* ---------------------------------------------------------------------------------------------------- */ static void print_objects (GDBusObjectManager *manager) { GList *objects; GList *l; g_print ("Object manager at %s\n", g_dbus_object_manager_get_object_path (manager)); objects = g_dbus_object_manager_get_objects (manager); for (l = objects; l != NULL; l = l->next) { ExampleObject *object = EXAMPLE_OBJECT (l->data); GList *interfaces; GList *ll; g_print (" - Object at %s\n", g_dbus_object_get_object_path (G_DBUS_OBJECT (object))); interfaces = g_dbus_object_get_interfaces (G_DBUS_OBJECT (object)); for (ll = interfaces; ll != NULL; ll = ll->next) { GDBusInterface *interface = G_DBUS_INTERFACE (ll->data); g_print (" - Interface %s\n", g_dbus_interface_get_info (interface)->name); /* Note that @interface is really a GDBusProxy instance - and additionally also * an ExampleAnimal or ExampleCat instance - either of these can be used to * invoke methods on the remote object. For example, the generated function * * void example_animal_call_poke_sync (ExampleAnimal *proxy, * gboolean make_sad, * gboolean make_happy, * GCancellable *cancellable, * GError **error); * * can be used to call the Poke() D-Bus method on the .Animal interface. * Additionally, the generated function * * const gchar *example_animal_get_mood (ExampleAnimal *object); * * can be used to get the value of the :Mood property. */ } g_list_free_full (interfaces, g_object_unref); } g_list_free_full (objects, g_object_unref); } static void on_object_added (GDBusObjectManager *manager, GDBusObject *object, gpointer user_data) { gchar *owner; owner = g_dbus_object_manager_client_get_name_owner (G_DBUS_OBJECT_MANAGER_CLIENT (manager)); g_print ("Added object at %s (owner %s)\n", g_dbus_object_get_object_path (object), owner); g_free (owner); } static void on_object_removed (GDBusObjectManager *manager, GDBusObject *object, gpointer user_data) { gchar *owner; owner = g_dbus_object_manager_client_get_name_owner (G_DBUS_OBJECT_MANAGER_CLIENT (manager)); g_print ("Removed object at %s (owner %s)\n", g_dbus_object_get_object_path (object), owner); g_free (owner); } static void on_notify_name_owner (GObject *object, GParamSpec *pspec, gpointer user_data) { GDBusObjectManagerClient *manager = G_DBUS_OBJECT_MANAGER_CLIENT (object); gchar *name_owner; name_owner = g_dbus_object_manager_client_get_name_owner (manager); g_print ("name-owner: %s\n", name_owner); g_free (name_owner); } static void on_interface_proxy_properties_changed (GDBusObjectManagerClient *manager, GDBusObjectProxy *object_proxy, GDBusProxy *interface_proxy, GVariant *changed_properties, const gchar *const *invalidated_properties, gpointer user_data) { GVariantIter iter; const gchar *key; GVariant *value; gchar *s; g_print ("Properties Changed on %s:\n", g_dbus_object_get_object_path (G_DBUS_OBJECT (object_proxy))); g_variant_iter_init (&iter, changed_properties); while (g_variant_iter_next (&iter, "{&sv}", &key, &value)) { s = g_variant_print (value, TRUE); g_print (" %s -> %s\n", key, s); g_variant_unref (value); g_free (s); } } gint main (gint argc, gchar *argv[]) { GDBusObjectManager *manager; GMainLoop *loop; GError *error; gchar *name_owner; manager = NULL; loop = NULL; loop = g_main_loop_new (NULL, FALSE); error = NULL; manager = example_object_manager_client_new_for_bus_sync (G_BUS_TYPE_SESSION, G_DBUS_OBJECT_MANAGER_CLIENT_FLAGS_NONE, "org.gtk.GDBus.Examples.ObjectManager", "/example/Animals", NULL, /* GCancellable */ &error); if (manager == NULL) { g_printerr ("Error getting object manager client: %s", error->message); g_error_free (error); goto out; } name_owner = g_dbus_object_manager_client_get_name_owner (G_DBUS_OBJECT_MANAGER_CLIENT (manager)); g_print ("name-owner: %s\n", name_owner); g_free (name_owner); print_objects (manager); g_signal_connect (manager, "notify::name-owner", G_CALLBACK (on_notify_name_owner), NULL); g_signal_connect (manager, "object-added", G_CALLBACK (on_object_added), NULL); g_signal_connect (manager, "object-removed", G_CALLBACK (on_object_removed), NULL); g_signal_connect (manager, "interface-proxy-properties-changed", G_CALLBACK (on_interface_proxy_properties_changed), NULL); g_main_loop_run (loop); out: if (manager != NULL) g_object_unref (manager); if (loop != NULL) g_main_loop_unref (loop); return 0; } |


 It is free software, distributed under the terms of the Lesser GNU Public License. The name
FindBugs™ and the FindBugs logo are trademarked by The University of Maryland. FindBugs has been downloaded more than
a million times.
The current version of FindBugs is 3.0.0.
FindBugs requires JRE (or JDK) 1.7.0 or later to run. However, it can analyze programs
compiled for any version of Java, from 1.0 to 1.8.
The current version of FindBugs is 3.0.0,
released on 20:25:27 CDT, 06 July, 2014. We are very interested in getting
feedback on how to improve FindBugs. File bug reports on our
sourceforge bug tracker
Changes | Talks | Papers | Sponsors | Support
FindBugs 3.0.0 Release
FindBugs 2.0.3 Release
FindBugs 2.0.3 is intended to be a minor bug fix release over
FindBugs 2.0.2. Although than some improvements to existing bug detectors
and analysis engines, and a few new bug patterns, and some
important bug fixes to the Eclipse plugin, no significant changes
should be observed. Consult the Change log
for more details.
Also check out http://code.google.com/p/findbugs/w/list
for more information about some recent features/changes in FindBugs.
Ways to run FindBugs
Here are various ways to run FindBugs. For plugins not supported by the FindBugs team, check to
see what version of FindBugs they provide; it might take a little while for the plugins to update to
FindBugs 2.0.
- Command line, ant, GUI
- Provided in FindBugs download
-
Eclipse
-
Update site for Eclipse plugin: http://findbugs.cs.umd.edu/eclipse.
Supported by the FindBugs project.
-
Maven
-
http://mojo.codehaus.org/findbugs-maven-plugin/
-
Netbeans
-
SQE: Software Quality Environment
- Jenkins
- Jenkins FindBugs Plugin
-
Hudson
-
HUDSON FindBugs Plugin
-
IntelliJ
-
Several plugins, see http://code.google.com/p/findbugs/wiki/IntellijFindBugsPlugins
for a description.
New
- jFormatString library republished at
http://code.google.com/p/j-format-string.
This is the library we use for compile time checking of format strings. It is separately published to
- We're releasing FindBugs 2.0.3.
Mostly small changes to address false positives, with one important fix to the Eclipse plugin
to fix a problem that had prevented the plugin from running in some versions of Eclipse.
Check the change log for more details.
- We've released FindBugs 2.0
- FindBugs communal cloud and Java web start links:. We have analyzed several large open
source projects, and provide Java web start links to allow you to view the results. We'd be
happy to work with projects to make the results available from a continuous build:
Experience with FindBugs
- Google FindBugs Fixit: Google has a tradition of engineering fixits, special days where
they try to get all of their engineers focused on some specific problem or technique for improving
the systems at Google. A fixit might work to improve web accessibility, internal testing, removing
TODO's from internal software, etc.
In 2009, Google held a global fixit for UMD's FindBugs tool a static analysis tool for
finding coding mistakes in Java software. The focus of the fixit was to get feedback on the
4,000 highest confidence issues found by FindBugs at Google, and let Google engineers decide
which issues, if any, needed fixing.
More than 700 engineers ran FindBugs from dozens of offices. More than 250 of them entered
more than 8,000 reviews of the issues. A review is a classification of an issue as must-fix,
should-fix, mostly-harmless, not-a-bug, and several other categories. More than 75% of the
reviews classified issues as must fix, should fix or I will fix. Many of the scariest issues
received more than 10 reviews each.
Engineers have already submitted changes that made more than 1,100 of the 3,800 issues go
away. Engineers filed more than 1,700 bug reports, of which 600 have already been marked as
fixed Work continues on addressing the issues raised by the fixit, and on supporting the
integration of FindBugs into the software development process at Google.
The fixit at Google showcased new capabilities of FindBugs that provide a cloud computing /
social networking backdrop. Reviews of issues are immediately persisted into a central store,
where they can be seen by other developers, and FindBugs is integrated into the internal Google
tools for filing and viewing bug reports and for viewing the version control history of source
files. For the Fixit, FindBugs was configured in a mode where engineers could not see reviews
from other engineers until they had entered their own; after the fixit, the configuration will
be changed to a more open configuration where engineers can see reviews from others without
having to provide their own review first. These capabilities have all been contributed to UMD's
open source FindBugs tool, although a fair bit of engineering remains to prepare the
capabilities for general release and make sure they can integrate into systems outside of
Google. The new capabilities are expected to be ready for general release in Fall 2009.
- Finding More Null
Pointer Bugs, But Not Too Many, by David
Hovemeyer, York College of Pennsylvania and William
Pugh, Univ. of Maryland, 7th ACM
SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering, June, 2007
- Evaluating Static
Analysis Defect Warnings On Production Software, Nathaniel
Ayewah and William Pugh, Univ. of Maryland, and
J. David Morgenthaler, John Penix and YuQian Zhou, Google, Inc., 7th ACM SIGPLAN-SIGSOFT Workshop on Program
Analysis for Software Tools and Engineering, June, 2007
The current development team consists of Bill Pugh and Andrey Loskutov.
The most recent funding for FindBugs comes from a Google Faculty Research Awards.
Numerous people have made significant contributions to the FindBugs
project, including founding work by David Hovemeyer
and the web cloud infrastructure by Keith Lea.
YourKit is kindly supporting open source projects with its full-featured Java Profiler. YourKit, LLC
is creator of innovative and intelligent tools for profiling Java and .NET applications. Take a look
at YourKit's leading software products: YourKit
Java Profiler and YourKit .NET
Profiler.
The FindBugs project also uses FishEye and
Clover, which are generously provided by Cenqua/Atlassian.
Additional financial support for the FindBugs project was provided by National
Science Foundation grants ASC9720199 and CCR-0098162,
Any opinions, findings and conclusions or recommendations expressed in this material are those of
the author(s) and do not necessarily reflect the views of the National Science Foundation (NSF).
Send comments to
|


{% raw %}
20 Sep 2016 14:05
Multiple paragraphs can even be a neat thing we use here.
This is where we would include some awesome sub-text or description text
This is where we would include some awesome sub-text or description text
This is where we would include some awesome sub-text or description text
This is where we would include some awesome sub-text or description text. This is where we would include some awesome sub-text or description text


Candy danish chupa chups soufflé jelly. Cupcake macaroon cupcake pastry cake tiramisu tiramisu gingerbread oat cake. Sugar plum marshmallow jelly-o..


| Lua | Overloaded. Initializes a new instance of the Lua class. |
| DebugLevel | Retrieves an object representing the current debug level. |
| GC (inherited from LuaState) | Allows operations on the garbage collector of LUA |
| Handle (inherited from LuaState) | Returns the internal native handle of the state. This handle can be passed to any other native LUA C API. |
| Item | Returns the given global variable. |
| Stack (inherited from LuaState) | Returns the stack frame for this LUA state. |
| Tables (inherited from LuaState) | A global collection on the tables within this state. |
| Call | Overloaded. Calls a specified function which is declared inside LUA script. |
| CreateThread | Creates a new Lua coroutine (thread) from the context of the current object. |
| Dispose (inherited from LuaState) | Closes the LUA state to clean up all unmanaged handles. |
| Equals (inherited from Object) | |
| Execute | Overloaded. Starts the execution of the previosly loaded script chunks. |
| GetHashCode (inherited from Object) | |
| GetType (inherited from Object) | |
| Load | Loads the script from a given string. |
| LoadFile | Loads the script from a given file. |
| LoadLibrary | Overloaded. Loads the given file as a library for LUA. |
| Register | Registers a callback function. Every callback function is being registered in the global namespace. |
| ToString (inherited from Object) |


?vo^
BOTANICAL
GARDE**
IMAGED
Plants
of
Puerto
Rico
Herbarium,
Department
of
Biology
University
of
Puerto
Rico,
Mayagiiez
Poaceae
Bambusa
multiplex
(Loureiro)
Raeuschel
Culms
golden-orange,
some
of
them
flowering
&
those
dying;
stamens
pale
yellowish.Yauco:
Bo.Susua
Alta.
Susua
Forest
Reserve.
18¡04I39"N,
66¡54'23"W,
Alt.
185m.
Planted
along
road
to
Campamento
Susua
at
Quebrada
Peces.
Low,
xerophytic
forest
on
serpentine.
G.J.
Breckon
6097
16
May
2000
With:
M.
Breckon
00754868
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


Console Tests
Introduction
In addition to simplifying HTTP testing, Laravel provides a simple API for testing your application's custom console commands.
Input / Output Expectations
Laravel allows you to easily "mock" user input for your console commands using the expectsQuestion
method. In addition, you may specify the exit code and text that you expect to be output by the console command using the assertExitCode
and expectsOutput
methods. For example, consider the following console command:
Artisan::command('question', function () {
$name = $this->ask('What is your name?');
$language = $this->choice('Which language do you prefer?', [
'PHP',
'Ruby',
'Python',
]);
$this->line('Your name is '.$name.' and you prefer '.$language.'.');
});
You may test this command with the following test which utilizes the expectsQuestion
, expectsOutput
, doesntExpectOutput
, and assertExitCode
methods:
/**
* Test a console command.
*
* @return void
*/
public function test_console_command()
{
$this->artisan('question')
->expectsQuestion('What is your name?', 'Taylor Otwell')
->expectsQuestion('Which language do you prefer?', 'PHP')
->expectsOutput('Your name is Taylor Otwell and you prefer PHP.')
->doesntExpectOutput('Your name is Taylor Otwell and you prefer Ruby.')
->assertExitCode(0);
}
Confirmation Expectations
When writing a command which expects confirmation in the form of a "yes" or "no" answer, you may utilize the expectsConfirmation
method:
$this->artisan('module:import')
->expectsConfirmation('Do you really wish to run this command?', 'no')
->assertExitCode(1);
Table Expectations
If your command displays a table of information using Artisan's table
method, it can be cumbersome to write output expectations for the entire table. Instead, you may use the expectsTable
method. This method accepts the table's headers as its first argument and the table's data as its second argument:
$this->artisan('users:all')
->expectsTable([
'ID',
'Email',
], [
[1<EMAIL_ADDRESS>[2<EMAIL_ADDRESS>]);


PAST PROJECTS
Every One Rich Mobile Banking - CSE110 Fall 2014
This is an Android application created for Every One Rich Bank with a team of undergraduates. The banking app allow their users to create a new user account, see their finanical statements, transfer/debit/credit money, login securely to their user account, and lets user create multiple bank accounts (eg. checking/saving) in their user account. Visit our github repository.
RatRace - Intuit Hackathon Nov 2014
This is an Android game created as a solution to improving the financial literacy of K-12 students in 24 hours. Visit our github repository.
Construct 2 - Game Tutorial
Learned how to create a simple shooting game on Construct 2. Click to download.
|


- Pile - Class in com.caseyweed
-
Pile will create a grid of images on a Graphics2D object.
- Pile(int, int, BufferedImage[]) - Constructor for class com.caseyweed.Pile
-
Create new Pile object based off the number of rows, columns, and image
list.
- Pile(int, int, int) - Constructor for class com.caseyweed.Pile
-
Create Pile object based off lenght, rows, and columns.
- Pile(int, int, int, BufferedImage[]) - Constructor for class com.caseyweed.Pile
-
Create Pile object specifying the length, rows, columns, and images.
- Pile(BufferedImage[]) - Constructor for class com.caseyweed.Pile
-
Specifying only a list of images will use the longest side of the first
image as the length for all grid cells.
- popImage() - Method in class com.caseyweed.Pile
-
Remove the last image in the image list.
- PreviewPanel - Class in com.caseyweed
-
Preview panel for images.
- PreviewPanel(BufferedImage, String) - Constructor for class com.caseyweed.PreviewPanel
-
Create preview panel for a single image.


Define common padding and border radius sizes and more.
Used for active or hovered items in places like navs or dropdowns.


nips nips2001 nips2001-119 nips2001-119-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: Martijn Leisink, Bert Kappen
Abstract: The partition function for a Boltzmann machine can be bounded from above and below. We can use this to bound the means and the correlations. For networks with small weights, the values of these statistics can be restricted to non-trivial regions (i.e. a subset of [-1 , 1]). Experimental results show that reasonable bounding occurs for weight sizes where mean field expansions generally give good results. 1
[1] C. Peterson and J. Anderson. A mean field theory learning algorithm for neural networks. Co mplex systems, 1:995- 1019, 1987.
[2] S.K. Saul, T.S . Jaakkola, and M.l. Jordan. Mean field theory for sigmoid b elief networks. Journal of Artific ial Intelligence Research, 4:61- 76 , 1996.
[3] Martijn A.R. Leisink and Hilbert J. Kapp en. A tighter bound for graphical models. In Todd K. Leen, Thomas G. Dietterich, and Volker Tresp, editors, Advances in Neural Information Processing Systems 13, pages 266- 272. M IT Press, 2001.
[4] Martijn A.R. Leisink and Hilbert J. Kappen. A tighter bound for graphical models. Neural Co mputation, 13(9) , 2001. To appear.
[5] T. Jaakkola and M.l. Jordan. Recursive algorithms for approximating probabilities in graphical models. MIT Co mpo Cogn. Sc ience Technical Report 9604, 1996.
[6] Tommi S. Jaakkola and Michael 1. Jordan. Computing upp er and lower bounds on likelihoods in intractable n etworks. In Proceedings of th e T welfth Annual Conf ere nce on Uncertainty in Artificial Intelligence (UAI- 96) , pages 340- 348, San Francisco , CA, 1996. Morgan Kaufmann Publishers.
[7] D. Ackley, G. Hinton, and T. Sejnowski. A learning algorithm for Boltzmann machines. Cognitive Science, 9:147-169, 1985.
[8] D. Sherrington and S. Kirkpatrick. Solvable model of a spin-glass. Physi cal R eview Letters, 35(26):1793-1796, 121975.
[9] T. Plefka. Convergence condition of the TAP equation for the infinite-ranged ising spin glass model. J.Phys.A: Math. Gen., 15:1971-1978, 1981.


Warriors, Lovers, and Adventurers
November 11th
Questions from Last Time
Final Presentations
Career Session
Tuesday the 19th
5:00 pm
Martin Huang
Chapter 23
Chapter 25
General Discussion
Chapters 75 and 100