Hush has been building the first ever open source private messenger service based on Zcash technology. Hush & Komodo not only share core developers, but coinciding views on the importance of independent right to privacy.
100 messages
Before 05-Dec-19 12:00 AM
GatewayBOT14-Jan-19 09:55 PM
[dscrd-hush] <TheTrunk> Also you should update the translation files with Notarized key,
GatewayBOT14-Jan-19 10:06 PM
[dscrd-hush] <TheTrunk> Another thing is that bitcore-node has to be updated as well imo.
[dscrd-hush] <TheTrunk> So in bitcore-node-hush/lib/services/bitcoind.js
Bitcoin.prototype.getInfo = function(callback) {
[dscrd-hush] <TheTrunk> yes that was it. Somehow on my explorer it shows 0 (the same when I do hush-cli getinfo) but I assume its beacuse of the restart and it will catch after a next notarization.
I also updated the explorer.hush.zelcore.io to my recent insight style. So it has pools, rich list, some statistics, fixes etc. It will take a while for the mongodb to catch up but should be working. The source is in hush branches in TheTrunk/bitcore-node-hush TheTrunk/insight-api TheTrunk/insight-ui . I will be trying to do some unification of inisght explorer so for there is just bitcore-node.json file when you write: coin: hush and it will configure itself for hush coin, or zcash or whatever. Will be nice to have this a bit centralized for all new coins as well
[dscrd-hush] <TheTrunk> nice now the notarization catched up
[dscrd-hush] <gilardh> Thanks @TheTrunk
GatewayBOT15-Jan-19 03:22 AM
[dscrd-hush] <dukeleto> People can see the "Notarized" item in the top right of https://explorer.hush.zelcore.io/ , that was what I was trying to get working
@Cryptopia_NZ Omg. I have 225 Btc and 1500 eth in your exchange. Pls update your investor immediately
[dscrd-hush] <dukeleto> I hope that nobody in here had 225 BTC on Cryptopia, because that is insane
GatewayBOT15-Jan-19 04:06 PM
[dscrd-hush] <Berg> I had about 9K Hush that I had bought about 2 hours before going into maintenance, but luckily I had everything else I owned stored in wallets elsewhere.
[dscrd-hush] <Berg> Friendly reminder not to store anything on exchanges.
[dscrd-hush] <Berg> Can users still log in and see their balances? I haven't tried to visit Cryptopia.
[dscrd-hush] <heguli97> Their site is in maintenance
[dscrd-hush] <heguli97> It's good to wait and see what happens, i don't think this can be the end of Cryptopia. It's ridiculous how many are saying they exit scammed, with no actual proof.
GatewayBOT15-Jan-19 04:16 PM
[dscrd-hush] <Berg> From the get go with them I never trusted their security measures, the website seemed a little hackish
GatewayBOT15-Jan-19 04:28 PM
[dscrd-hush] <dukeleto> They are most likely having law enforcement copy/image all harddrives to do forensic analysis, if law enforcement is involved. That process could take quite a while, like weeks or months. If Hard drives are evidence in a crime, they go into an evidence locker
[dscrd-hush] <dukeleto> @heguli97 agreed, there is no proof of an exit-scam. It's just that it's so profitable and common in this industry, people jump to that conclusion
[dscrd-hush] <Berg> Duke has been making some very solid progress towards our next release, besides the Cryptopia issue becoming more and more of a fiasco, things are going great.
[dscrd-hush] <Berg> This coin is in serious need of some liquidity though, and for the time being it's pretty obvious that we may not get Cryptopia up and trading any time soon... if anyone hears of exchanges picking up the Cryptopia slack in the time-being for alienated coins, please post them up in here or DM me It's pretty typical that some exchanges offer relief to coins affected.
GatewayBOT15-Jan-19 07:41 PM
[dscrd-hush] <passcombo.com > I think for Hush to have any future it needs a plan/roadmap and commited team(edited)
[dscrd-hush] <passcombo.com > for the simple reason - I dont believe any seriouds exchange / big one will list a small token with no future plans and team, active github is good starting point though(edited)
[dscrd-hush] <passcombo.com > dPOW might be not good enough sale point
[dscrd-hush] <passcombo.com > we may see it stupid it is the way it is
[dscrd-hush] <passcombo.com > but somehow promises even when false are seen by market makers as better then pure tech
[dscrd-hush] <passcombo.com > Im not fan of false promises, but I believe Hush got the original idea to make private mesages
[dscrd-hush] <passcombo.com > question if this is doable in near future (also if it needs heavy funding)
[dscrd-hush] <passcombo.com > if not doable / no orig idea supporting Hush / then it may be the sad tiem to consider project end of life. Happened to me all my past personal project came to such end so I know it's not easy to accept, but either there is power or there is not...
[dscrd-hush] <passcombo.com > all I have are bunch of opinions, use it if helps
[dscrd-hush] <Eddy O> Agree not many major exchanges want to deal with a coin with no team and no vision. You think they want the added risk?
[dscrd-hush] <Eddy O> And no one wants to risk trading on places like tradesatoshi or coinexchange.
[dscrd-hush] <Eddy O> I also wonder if original vision of messaging is going to be done or if this is dead. Not much work done on the messaging front in all of 2018.
[dscrd-hush] <passcombo.com > Probably crucial is to gather a team at this point. Anybody knows a succesfull project without a strong team?
[dscrd-hush] <passcombo.com > But having vision too - vision is what attracts people actually - first vision attracts people to be part of team, then more people to be part of the event...
[dscrd-hush] <passcombo.com > Vision could be to have workable mobile friendly encrypted email app. Not sure if realistic example, but decentralized encrypted email is what I could potentially use, and probably many people worldwide.
GatewayBOT15-Jan-19 08:43 PM
[dscrd-hush] <AkiraX> @Eddy O the exact same thing was said last year. Hard to get people together with no funds.
GatewayBOT15-Jan-19 09:21 PM
[dscrd-hush] <tony> guys
[dscrd-hush] <tony> when will i be able to withdraw hush frmo cryptopia
[dscrd-hush] <tony> i had alot :S
GatewayBOT15-Jan-19 10:11 PM
[dscrd-hush] <AkiraX> May be years
[dscrd-hush] <AkiraX> May be never
[dscrd-hush] <AkiraX> Sorry
GatewayBOT15-Jan-19 10:42 PM
[dscrd-hush] <heguli97> Their security breach came at a pretty crucial moment, when duke gets the new update ready soon, it could be that they are too busy to implement it or aren't around at all.
[dscrd-hush] <Pixelised> @Berg looking at the Hush explorer for 'topias wallet address - I got my coins out just in time before they put it into maintenance.
GatewayBOT16-Jan-19 09:46 AM
[dscrd-hush] <passcombo.com > @dukeleto you are able to estimate working hours to get decentralized mobile txt/email app based on Hush?
[dscrd-hush] <passcombo.com > including mobile and PC gui
[dscrd-hush] <passcombo.com > or list specific task/processes and their work load
GatewayBOT16-Jan-19 02:04 PM
[dscrd-hush] <heguli97> Mobile is going to take a lot of time, have to integrate sapling into hush first in order to get tx's working on phones(tx's require a lot of processing power before sapling), then obviously develop the whole wallet software too. PC however is much simpler and i believe sending messages is already working at some level and so is the wallet.
GatewayBOT16-Jan-19 02:50 PM
[dscrd-hush] <сережа патрог> why explorer hush doesn't work?
[dscrd-hush] <halo kitty rules> @Roxin No, HUSH was not affected in this hack. You will be able to get it back. But no one knows when will Cryptopia restore trading. Optimistic scenario is a few days, realistic is at least few weeks.
[dscrd-hush] <Roxin> Anyway hush is in maintenence i think since octomber..
[dscrd-hush] <halo kitty rules> Correct. Cryptopia is waiting another update. It can take months before you will be able to remove your coins.
Hush Insight. View detailed information on all Hush transactions and blocks.
[dscrd-hush] <aledel> Duke broke it
[dscrd-hush] <SHossain> is it official?
[dscrd-hush] <SHossain> thanks @aledel
[dscrd-hush] <aledel> He is trying to fix it use that mean while
[dscrd-hush] <SHossain> no worries. i was just wondering around
[dscrd-hush] <SHossain> i know dukeleto will fix it soon
[dscrd-hush] <SHossain> just saw his message in #general-support channel
GatewayBOT17-Jan-19 11:34 PM
[dscrd-hush] <AkiraX> @SHossain are you from kmd
[dscrd-hush] <SHossain> Yes. I'm the QA & Support Manager of Komodo Platform(edited)
GatewayBOT18-Jan-19 03:35 AM
[dscrd-hush] <AkiraX> I saw you are hiring.
[dscrd-hush] <AkiraX> How much is the pay?
GatewayBOT18-Jan-19 05:37 AM
[dscrd-hush] <dukeleto> SHossain is a super awesome KMD person, also a notary node operator and general nice guy
GatewayBOT18-Jan-19 03:23 PM
[dscrd-hush] <赖红光> Anyone here use tradesatoshi? Is it a decent exchange for trading HUSH?
GatewayBOT18-Jan-19 04:16 PM
[dscrd-hush] <aledel> IT Works like it should @Hegelian
GatewayBOT18-Jan-19 07:28 PM
[dscrd-hush] <赖红光>
GatewayBOT18-Jan-19 08:23 PM
[dscrd-hush] <Takoy_Nahal> How are you holders of HUSH? It became quiet here) Duke, how is your work? It looks like you work a lot, I wonder until spring we will see POS on BTCH?)
GatewayBOT18-Jan-19 09:49 PM
[dscrd-hush] <SHossain> @AkiraX We alreay got someone.


This is the line chart section of the gallery. If you want to know more about this kind of chart, visit data-to-viz.com. If you're looking for a simple way to implement it in R, pick an example below.
This section is tightly linked with other sections. A connected scatterplot is almost the same thing, but each observation is represented as a dot. An area chart fills the surface between the line and the X axis. More generally, the time series section can interest you.
connected scatter area chart time seriesggplot2
ggplot2
allows to draw line charts thanks to the geom_line()
function. It expects as input a data frame with 2 numeric variables, one displayed on each axis. Start your journey with the most basic line chart.
geom_ribbon
and geom_smooth
Line charts are often displayed together with confidence intervals. ggplot2
offers 2 main functions to build them. geom_ribbon allows to build the area around the curve from precomputed values. geom_smooth will compute a model for you and plot the result directly.
ggplot2
)When too many groups are displayed on the same line chart it gets very hard to get insight from the figure. This is commonly called a spaghetti chart. Here are a few alternatives using ggplot2: annotation and small multiple.
In base R, the line function
allows to build quality line charts.
ggplot2
Warning: a dual Y axis line chart represents the evolution of 2 series, each plotted according to its own Y scale. This kind of chart must be avoided, since playing with Y axis limits can lead to completely different conclusions. Visit data-to-viz for more info.
Why you should avoid itlatticeExtra
Warning: a dual Y axis line chart represents the evolution of 2 series, each plotted according to its own Y scale. This kind of chart must be avoided, since playing with Y axis limits can lead to completely different conclusions. Visit data-to-viz for more info.
Why you should avoid itThe web is full of astonishing R charts made by awesome bloggers. The R graph gallery tries to display some of the best creations and explain how their source code works. If you want to display your work here, please drop me a word or even better, submit a Pull Request!


|
G6capstone-AI_Education
|
Public Member Functions | |
| def | __init__ (self, data, ml_classifier, preprocess, n_samples=10) |
| def | Train (self, sample) |
| def | Continue (self, sampling_method, n_samples=5) |
| def | infoForProgress (self) |
| def | infoForResults (self) |
Public Attributes | |
| sample | |
| test | |
| train | |
| ml_classifier | |
| preprocess | |
| ml_model | |
This class creates an active learning model based on the data sent, data preprocessing, and type of ml classifier.
| def app.ML_Class.Active_ML_Model.__init__ | ( | self, | |
| data, | |||
| ml_classifier, | |||
| preprocess, | |||
n_samples = 10 |
|||
| ) |
This function controls the initial creation of the active learning model. Parameters ---------- data : pandas DataFrame The data the active learning model will be built on. ml_classifier : classifier object The classifier to be used to create the machine learning model. preprocess : Python Function The function used to preprocess the data before model creation. n_samples : int The number of random samples to be used in the initial model creation. Attributes ------- ml_classifier : classifier object The classifier to be used to create the active learning model. preprocess : Python Function The function used to preprocess the data before model creation. test : pandas DataFrame The training set. train : pandas DataFrame The train set.
| def app.ML_Class.Active_ML_Model.Continue | ( | self, | |
| sampling_method, | |||
n_samples = 5 |
|||
| ) |
This function continues the active learning model to the next step. Parameters ---------- sampling_method : Python Function Determines the next set of samples to send to user. n_samples : int The number of samplest that should be added the the train set. Attributes Updated ------- ml_classifier : classifier object The classifier to be used to create the active learning model. test : pandas DataFrame The training set. train : pandas DataFrame The train set.
References app.ML_Class.ML_Model.ml_model, app.ML_Class.Active_ML_Model.ml_model, app.ML_Class.Active_ML_Model.sample, and app.ML_Class.Active_ML_Model.test.
| def app.ML_Class.Active_ML_Model.infoForProgress | ( | self | ) |
This function returns the information nessessary to display the progress of the active learning model. Returns ------- health_pic : list List of images that were predicted as healthy. blight_pic : list List of images that were predicted as unhealthy.
References app.ML_Class.ML_Model.ml_model, and app.ML_Class.Active_ML_Model.ml_model.
Referenced by app.ML_Class.Active_ML_Model.infoForResults(), and app.ML_Class.ML_Model.infoForResults().
| def app.ML_Class.Active_ML_Model.infoForResults | ( | self | ) |
This function returns the information nessessary to display the final results of the active learning model. Returns ------- health_pic_user : list List of images that were predicted correctly. blight_pic_user : list List of images that were predicted incorrectly. health_pic : list List of images in the test set that are predicted to being healthy. blight_pic : list List of images in the test set that are predicted to being blighted.
References app.ML_Class.Active_ML_Model.infoForProgress(), app.ML_Class.ML_Model.infoForProgress(), app.ML_Class.ML_Model.ml_model, and app.ML_Class.Active_ML_Model.ml_model.
| def app.ML_Class.Active_ML_Model.Train | ( | self, | |
| sample | |||
| ) |
This function trains the innitial ml_model Parameters ---------- train : pandas DataFrame The training set with labels Attributes Added ---------------- ml_model : fitted machine learning classifier The machine learning model created using the training data.
References app.ML_Class.Active_ML_Model.train.
| app.ML_Class.Active_ML_Model.ml_classifier |
Referenced by app.ML_Class.ML_Model.K_fold().
| app.ML_Class.Active_ML_Model.ml_model |
| app.ML_Class.Active_ML_Model.preprocess |
| app.ML_Class.Active_ML_Model.sample |
Referenced by app.ML_Class.Active_ML_Model.Continue().
| app.ML_Class.Active_ML_Model.test |
Referenced by app.ML_Class.Active_ML_Model.Continue().
| app.ML_Class.Active_ML_Model.train |
Referenced by app.ML_Class.Active_ML_Model.Train().


tr - translate or delete characters
Translate, squeeze, and/or delete characters from standard input, writing to standard output.
-c, -C, --complement use the complement of SET1
-d, --delete delete characters in SET1, do not translate
-s, --squeeze-repeats replace each input sequence of a repeated character that is listed in SET1 with a single occurrence of that character
-t, --truncate-set1 first truncate SET1 to length of SET2
--help display this help and exit
--version output version information and exit
SETs are specified as strings of characters. Most represent themselves. Interpreted sequences are:
eNNN character with octal value NNN (1 to 3 octal digits)
ee backslash
ea audible BEL
eb backspace
ef form feed
en new line
er return
et horizontal tab
ev vertical tab
CHAR1-CHAR2 all characters from CHAR1 to CHAR2 in ascending order
[CHAR*] in SET2, copies of CHAR until length of SET1
[CHAR*REPEAT] REPEAT copies of CHAR, REPEAT octal if starting with 0
[:alnum:] all letters and digits
[:alpha:] all letters
[:blank:] all horizontal whitespace
[:cntrl:] all control characters
[:digit:] all digits
[:graph:] all printable characters, not including space
[:lower:] all lower case letters
[:print:] all printable characters, including space
[:punct:] all punctuation characters
[:space:] all horizontal or vertical whitespace
[:upper:] all upper case letters
[:xdigit:] all hexadecimal digits
[=CHAR=] all characters which are equivalent to CHAR
Translation occurs if -d is not given and both SET1 and SET2 appear. -t may be used only when translating. SET2 is extended to length of SET1 by repeating its last character as necessary. Excess characters of SET2 are ignored. Only [:lower:] and [:upper:] are guaranteed to expand in ascending order; used in SET2 while translating, they may only be used in pairs to specify case conversion. -s uses SET1 if not translating nor deleting; else squeezing uses SET2 and occurs after translation or deletion.
GNU coreutils online help: <http://www.gnu.org/software/coreutils/>
Report tr translation bugs to <http://translationproject.org/team/>
Copyright © 2014 Free Software Foundation, Inc. License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>.
This is free software: you are free to change and redistribute it. There is NO WARRANTY, to the extent permitted by law.
Full documentation at: <http://www.gnu.org/software/coreutils/tr>
or available locally via: info (aq(coreutils) tr invocation(aq


Additional remarks for Account.Category_04
The [Cicmpy.Category] field stores the fourth account category.


Mod-a-Recipe is developed as my capstone project at Metis data science immersive bootcamp, to combine my passions for cooking and natural language processing. The idea came from my own experience of always reviewing more than one recipe for a dish I had in mind to figure out what ingredients I can modify or swap out to suit my taste. Using natural language and machine learning techniques, similar recipes are found given a selected recipe, and suggestions on modifications are provided to make a recipe your ow
Data Source
Recipe data was scraped by Eight Portions (~80,000 recipes used here) from Epicurious,AllRecipes, and FoodNetwork.
Also, tagged ingredients data is used from the NYTimes Ingredients Phrase Tagger project. Github
Code at Github
Here is the github repo for this project: link
Tools Used
Python is used for data acquisition, cleaning and modeling. Specific python libraries used include:
- Modeling: scikit-learn
- Natural language processing: spaCy
- Web application: Flask, PostgreSQL, Heroku
Methodology Used
-
Data set from the three data sources (Epicurious, AllRecipes, Foodnetwork) are merged into one, and data cleaned to remove irrelevant information. (refer to code here)
-
Using 2000 rows of tagged ingredients list data from the NYTimes Ingredients Phrase Tagger project and 200 rows of manually tagged data from the Eight Portions data set, the spaCy NER model is trained to recognize ingredients from ingredients list text.
-
Using the trained spaCy NER model, ~40,000 unique ingredients were extracted from the ingredients list of the recipes data. (refer to code here)
- Topic modeling technique (TFIDF word vector with non-negative matrix factorization) is then used to reduce dimensionality such that similar recipes can be calculated using cosine similarity. The NMF yielded 50 topics were seemed to be representative of certain types of recipes. For example:
Topic 1 (Asian recipes): soy sauce, sesame oil, green onion, ginger, sesame seed, rice vinegar, ginger root, scallion, rice wine vinegar, peanut oil
Topic 2 (baking): unsalted butter, pure vanilla extract, whole milk, light brown sugar, fine salt, nutmeg, shallot, kosher salt and freshly ground pepper, extra-large egg, semisweet chocolate
(refer to code here)
- Similar recipes were found as a result, and differences in ingredients lists are highlighted as possible substitutions or enhancements to the selected recipe. Check out the Flask application with sample results on Mod-a-recipe


Bookmarks are events which you have saved because you think they are interesting. Bookmarks are different from items shown on the event page because they are stored on your device. This is useful if you are out in the field at a telescope where you do not have access to the internet.
The colors indicate the visibility of the object from the location and minimum altitude which are set in the Settings screen. Green means that the object is currently visible. Yellow means that the object is currently below the minimum altitude but will exceed that altitude at some later time. Red means that this object never gets above the minimum altitude at this location.
If want to see more information about an event simply touch the event. Touching the event will take you to a page containing more detailed information about the event as well as a series of images. The images show the original reference images and typically 4 of the new images which caused the event to be issued. The first image you see will be the first new image. The reference image is to the left (swipe to the right) and the other three new images are to the right (swipe to the left).
If you want to view this object in your telescope a finder chart is available by touching the "Finder Chart" button.
If you want to delete bookmarks you can press the Edit button and select the items you wish to delete by touching the red minus sign and pressing the Delete button or by swiping right to left on the item and then pressing the Delete button.
We are working on this. At the present time the Finder Charts are web pages with links to images and it is not possible to download the page and all of the links.


Adding, editing, or deleting
Schedule events
On this page:
Adding events
To create a new event, from within the Schedule tool:
- While viewing your calendar, click
Add
.
- Enter the required information for title, date, and start
time. Additionally, you can specify a duration or an end time.
- Under "Message", use the rich-text editor to create and format the
body of your item. (For more, see The rich-text editor.)
Note: Pasting text into the rich-text editor
should preserve most formatting, but some types of formatting, such as
colored text, may need to be added manually in the editor after pasting.
- To display the event to all members of the site, check
Display
to site
. To display the event only to members of a certain group,
check Display to selected groups
, and then use the checkboxes
to choose which groups or sections can view it.
Note: If you don't see the Display to selected
groups
option, no groups or sections are associated with your
site; see Managing groups.
- If your event will take place more than once, you can set the
frequency by clicking
Frequency
. Then:
- Next to "Event Frequency", select
daily
,
Mon/Wed/Friday
, Tuesday/Thursday
, weekly
,
monthly
, or yearly
.
- Next to "Every:", select a value between 1 and 31.
- Under "Ends:", select when you want your event to stop recurring.
- Click
Save
.
Note: If you do not choose a frequency, your
activity will occur once.
- Next to "Event Type", select an appropriate classification for
your event; the classification determines the icon that displays next
to the event in the calendar.
- Next to "Event Location", type a location for your event into the
text box.
- Under "Attachments", you can attach a file from your local
computer or from Resources, or specify the address (URL) for a file on
the web. For instructions, see Options for adding attachments.
- To save your event and post it to the schedule, click
Save Event
. To cancel,
click Cancel
.
Editing events
- Find the item on your schedule and click its title.
- Click
Edit
.
- In the resulting form, make your desired changes.
- When you are finished editing the item, click
Save Event
.
Deleting events
- Find the item on your schedule and click its title.
- Click
Remove event
. For recurring events, on the
confirmation page, you can choose to Delete all occurrences
or Delete only this occurrence
. Then, click Remove
event
to remove the item.


Help
FAQ
Downloads
Documentation (alpha)
Technical Articles
Map Legend
OsmAnd Mission
Privacy Policy
Terms Of Use
License
About


menu
Login
Sign Up
Login
Sign Up
SIGN UP
Email
Username
Password
Sign Up
POSTIT
The best way to stay connected with everybody you know
POSTIT NOW


2 references to CommonInitialization
System.Management.Automation (2)
engine\ScriptCommandProcessor.cs (2)
26
CommonInitialization
(scriptBlock, context, useLocalScope, origin, sessionState);
38
CommonInitialization
(commandInfo.ScriptBlock, context, useLocalScope, CommandOrigin.Internal, sessionState);


Welcome, {{ username }}!
| Category | Title | Tags | CCLs | Tweet |
|---|
Your schedule can be managed on your Twitch dashboard.
Upcoming streams:"Preview" times and countdowns on this dashboard use your local time. This may look a little odd in some cases, but it'll refer to the same instant in time.
Drag a timer title directly into OBS to create it as a browser source.
All timers will be instantly extended/shortened by the specified time.
Or set timer to this exact time:


|
||||
| Coverage | ||||||||||||
| Lines | Functions / Methods | Classes | ||||||||||
| Total |
|
92.83% | 220 / 237 |
|
65.52% | 19 / 29 |
|
55.56% | 5 / 9 | |||
| Categories |
|
100.00% | 1 / 1 |
|
|
100.00% | 1 / 1 | |||||
| Comments |
|
100.00% | 1 / 1 |
|
|
100.00% | 1 / 1 | |||||
| Tags |
|
93.33% | 70 / 75 |
|
66.67% | 4 / 6 |
|
66.67% | 2 / 3 | |||
| Categories.php |
|
98.08% | 51 / 52 |
|
87.50% | 7 / 8 |
|
0.00% | 0 / 1 | |||
| Comments.php |
|
88.64% | 39 / 44 |
|
57.14% | 4 / 7 |
|
0.00% | 0 / 1 | |||
| Item.php |
|
100.00% | 1 / 1 |
|
|
100.00% | 1 / 1 | |||||
| Tags.php |
|
90.48% | 57 / 63 |
|
50.00% | 4 / 8 |
|
0.00% | 0 / 1 |
| Generated by PHP_CodeCoverage 1.0.3 using PHP 5.3.3-1ubuntu9.5 and PHPUnit 3.5.10 at Wed May 18 18:07:11 CEST 2011. |


This is a template app showing the use of Angular, Node.js and Neo4j. It uses the neoprene library, available on npm as neoprene. This app is a simple social network manager: it lets you add and remove users and "follows" relationships between them. (Blatently copied from Node-Neo4j - credit to Aseem Kishore)
Click on a user on the left to get started or create a new one.


This page illustrates the gfx clipping api. This api allows to define a clipping area on any gfx Shape types (including group). The supported clipping geometry are rectangle, ellipse, polyline and path.
You can drag the shapes using the mouse, remove the clip using the button at the bottom, and change the gfx renderer in the combobox.
GFX Renderer:


Welcome! You can use one of these user records. A valid email address has been pre-entered for your convenience.


--- layout: tagpage tag: school header-img: img/school-bg.jpg title: School description: "work hard, play hard: find the balance, transfer somewhere easier, or go crazy" ---
Hi I'm Tali!


You can define access control settings under the "Edit -> Access" menu for an entry.
The access control mechanism in RAMADDA is centered around a set of actions that can be
applied to entries -
view, new, edit, etc.
For each action a set of user roles can be specified
that grant or remove permissions to do those actions.
The form is composed of this list of actions and, for each action,
there is a field where you can enter any number of user roles (one per line).
Image 1: Entry Access Control
+callout-info
Note: Access control settings have no effect on RAMADDA site administrators. They can do anything.
-callout
:p
+callout-info
Note: after setting access (e.g., creating a private space) it is best to log out (or user another browser)
and check if the access is set to what you think it is.
-callout
The roles for a user are defined by the RAMADDA administrator through the Admin-Users page.
Other "special" roles include:
- "none" - this denies access to any user
- "user" - any logged in user
- "any" - any user, either logged in or anonymous
- "anonymous" - non logged in user
- "ip:prefix" - The user is coming from an IP address that begins with prefix
Furthermore, any role can be negated with "!"
In the example shown above any user in the role "group1" can view anything under the
sub test entry.
No other user can view the "sub test" because of the "none" specified.
Along with the view access, the user "joe" can also edit the entry and any entry under
the entry.
On the right shows a summary table for the particular entry being viewed.
This shows the access control
settings for all of the ancestor entries of the current entry and allows the
user to see just what access settings are applicable to the entry.
+callout-info
To see if a given user has the ability to do a particular action for a particular entry RAMADDA looks
at the permissions for the entry and its ancestors and either looks for the
first permission grant or the first permission denial.
If nothing matches then permission is not granted.
-callout
Here are other examples:
- To make a whole tree of entrys inaccessable - under the view action enter:
none
This will only allow admins and entry owners to view anything under that tree.
- To make an entry (or tree of entries) inaccessable to non logged in users - under the view action enter:
user
none
- To make an entry (or tree of entries) inaccessable to users outside of an ip address - under the view action enter:
ip:some_ip_prefix
none
- To allow anyone to view the entries in a tree but don't allow anyone to
access the files then under the file action enter:
none
- To allow anyone to view the entries in a tree but only allow file access to
users who are coming from the IP address 123.456 then
under the file action do:
ip:123.456
none
- If you wanted to give a certain user permission (e.g., joe) to view the entry but not allow
any one else to view the entry then enter under the view action:
user:joe
none
RAMADDA would first check if the given user was "joe". If it is "joe" then permission is granted. If
its not "joe" then RAMADDA looks at the next role - "none". This blocks any other access.
- To allow for a group of users in the role "group1" to be able to edit and create new entries under a whole
tree then enter:
group1
for both the edit and the new actions.
- A common case is to allow one role to have new and edit capabilities under a whole tree (like the group1
example above) but to grant new and edit capabilities to some other user to a sub tree. For this you would
grant the access to the parent entry like above, e.g.:
- parent entry - access =
group1
- ...
- descendent entry - access =
otheruser
Each access type can contain any number of roles (one per line).
- Special roles
- any - this is a special role and says that anyone can do the action.
- none - nobody (except admins) can do the action.
- user - any logged in user
- anonymous - the user is not logged in
- guest - the user is a guest user
- Assigned user roles - All users can have one or more roles. This is set by the site administrator
when editing the user. They are just string names. For example, you might have the roles "group1" and
"group2". If you wanted to grant access to "group1" you would just enter:
group1
If you wanted to grant access to users in either group1 or group2 you would enter:
group1
group2
- Self identity role - If you enter a role in the form as user:someuserid this grants
access to that specific user. So, if you wanted to give "joe" access to something enter:
user:joe
- ip:ip address - This format grants access to incoming requests with the given ip address or ip address suffix.
For example, the following would grant access to any request coming from any IP address that starts with 128.117
ip:128.117
- !some role - Prefixing a role with "!" is a way to deny specific access to a user, role, or ip address.
For example, the following would deny access to any request coming from any IP address that starts with 128.117:
!ip:128.117
Say you want to grant access to user "joe" but deny access to user "jim". You would do:
user:joe
!user:jim
The different access types are:
RAMADDA has support for a data policy mechanism that allows for
the specification of a data license and access settings in a centralized
location. This allows for the use of a single data policy across multiple
entries within a single RAMADDA repository as well as sharing data policies
across a group of confederated RAMADDA repositories.
See the documentation at
https://ramadda.org/repository/a/datapolicy
for more details.
A RAMADDA repository is configured to read in data policies
from a set of URLs specified in a repository.properties file
in your local RAMADDA home directory.
#Comma separated list of URLS to fetch the data policies from
#Use "this" to refer to the current RAMADDA
ramadda.datapolicy.urls=this,https://ramadda.org/datapolicy/v1/list
#Number of minutes between fetches of data policies from the URLs
ramadda.datapolicy.sleepminutes=30
#Set this property to turn on debugging
ramadda.datapolicy.debug=true
The URLs specified are read at a given frequency (with the property above).
Each URL returns a document that has one or more data policies.
A data policy consists of name, ID, data license and a number of permissions.


Volunteers and Advocators Recruit:
This project is asking for the help from volunteers and advocators.Portions or partial transations are welcome.
What we need is not a full translation, we can take any help from anyone who are willing
to translate portions of the document inside this project. It is not necessary to
complete all translations in one-man army. A few sentences are just fine.
If you are interesting in part of this project, or you are benefited from this project.
Translate the document into your language might be a very good start point.
Read the document inside this project, find the contact of original author or maintainer.
Just notify him or her, make contact. And find out the current method to update your changes.


Groceries
Add Groceries to the list
This grocery already exists!
This grocery name is invalid!
Groceries:
There are no groceries!


Data Scientist, Computational Linguist, Cognitive Scientist, Tea Expert
Meilin Zhan, Roger Levy and Andrew Kehler. 2020. Pronoun Interpretation in Mandarin Chinese follows principles of Bayesian inference. PLOS ONE 15(8):1–42. DOI PDF
Meilin Zhan and Roger P. Levy. 2019. Availability-Based Production Predicts Speakers’ Real-time Choices of Mandarin Classifiers. Proceedings of the 41st Annual Meeting of the Cognitive Science Society, pp. 1268–1274. PDF
Meilin Zhan and Roger Levy. 2018. Comparing Theories of Speaker Choice Using a Model of Classifier Production in Mandarin Chinese. Proceedings of the 17th Annual Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pp. 1997–2005. DOI PDF
Erik Kaestner, Adam Milton Morgan, Joseph Snider, Meilin Zhan, Xi Jiang, Roger Levy, Victor S. Ferreira, Thomas Thesen and Eric Halgren. 2018. Toward a database of intracranial electrophysiology during natural language presentation. Language, Cognition and Neuroscience. 35(6): 729-738. DOI
Meilin Zhan, Roger Levy and Andrew Kehler. 2016. Bayesian Pronoun Interpretation in Mandarin Chinese. Proceedings of the 38th Annual Meeting of the Cognitive Science Society, pp. 2393–2398. PDF


--- layout: post title: Garnier Skin Naturals B.B Cream Review tags: - Garnier status: publish type: post published: true meta: _edit_last: '2' _aioseop_title: Garnier Skin Naturals B.B Cream Review _aioseop_keywords: Garnier Skin Naturals B.B Cream Review _yoast_wpseo_linkdex: '0' _thumbnail_id: '5649' _yoast_wpseo_focuskw: '' _yoast_wpseo_title: '' _yoast_wpseo_metadesc: '' _yoast_wpseo_metakeywords: '' _yoast_wpseo_meta-robots-noindex: '0' _yoast_wpseo_meta-robots-nofollow: '0' _yoast_wpseo_meta-robots-adv: none _yoast_wpseo_sitemap-include: ! '-' _yoast_wpseo_sitemap-prio: ! '-' _yoast_wpseo_canonical: '' _yoast_wpseo_redirect: '' ---
Year 2012 was the year of some great and some not so great launches in India. One such product was the BB(Blemish & Balm) cream, first introduced by The Body Shop and then Maybelline. Blemish and Balm (BB) creams are such a cult favorite amongst the ladies in South Korea. Its supposed to give medium coverage, hide light pigmentation and give a glow to the face.
I am quite surprised that I have not reviewed Maybelline B.B cream till now, when I must be on my 5-6th tube already. So this post will be about how this product faired on my oily skin, and we shall quickly compare it to my B.B love Maybelline cream.
Pond's was the first one to launch tinted moisturizer to us Indians, but it never worked on my oily skin. It made me greasy and dull in few minutes of application. Then came Maybelline, and I was all bowled out by the fact that it gave me a perfect matte finish, slight coverage and definitely the glow.
But I am currently loving the Garnier B.B cream for so many reason.
Garnier B.B cream pro's over Maybelline B.B Cream:
Garnier B.B cream con's over Maybelline B.B Cream:
I would say Garnier B.B Cream is a pretty good deal, and knocks the socks off TBS and Maybelline. I would definitely recommend this to Combination to Oily skin.
Have you tried the Garnier B.B Cream yet ?


|
|
CIFXQuadEdge.cpp File ReferenceThis module contains the CIFXQuadEdge, CIFXEdge and CIFXSubdivision classes. More...
|
Functions |
| int | InCircle (const SIFXPoint2d &a, const SIFXPoint2d &b, const SIFXPoint2d &c, const SIFXPoint2d &d) |
| REAL | TriArea (const SIFXPoint2d &a, const SIFXPoint2d &b, const SIFXPoint2d &c) |
| static int | ccw (const SIFXPoint2d &a, const SIFXPoint2d &b, const SIFXPoint2d &c) |
| static int | RightOf (const SIFXPoint2d &x, CIFXEdge *e) |
| static int | LeftOf (const SIFXPoint2d &x, CIFXEdge *e) |
| static int | Colinear (const SIFXPoint2d &x, CIFXEdge *e) |
| static int | XOR (int x, int y) |
| static int | IntersectProp (CIFXEdge *a, CIFXEdge *b) |
| static int | Between (const SIFXPoint2d &c, CIFXEdge *e) |
| static int | Intersect (CIFXEdge *a, CIFXEdge *b) |
| int | OnEdge (const SIFXPoint2d x, CIFXEdge *e) |
| static IFXRESULT | SolveIntersection (CIFXEdge *a, CIFXEdge *b, SIFXPoint2d *site) |
| F64 | WindingContribution (SIFXEdge &edge, SIFXPoint2d &point) |
Detailed Description
This module contains the CIFXQuadEdge, CIFXEdge and CIFXSubdivision classes.
- Note:
- This code in this module is a modification of the code from the article "Incremental Delaunay Triangulation" by Dani Lischinski<EMAIL_ADDRESS>in "Graphics Gems IV", Academic Press, 1994, p. 47-59, code: p. 51-58. The actual source is available from www.acm.org/pubs/tog/GraphicsGems/gemsiv.zip in the "delaunay" folder. The associated website's root address is www.graphicsgems.org. It states that the Graphics Gems code can be used without restrictions.
Another helpful article was "Primitives for the manipulation of general subdivisions and the computation of Voronoi" by Leonidas Guibas and Jorge Stolfi( both from Xerox Palo Alto Research Center and Stanford Univ.) in "ACM Transactions on Graphics", Volume 4, Issue 2, ACM Press, April 1985, p. 74 - 123.
Function Documentation
|
|
Returns TRUE if the points a, b, c are in a counterclockwise order.
|
|
|
Returns TRUE if the point d is inside the circle defined by the points a, b, c.
See Guibas and Stolfi (1985) p.107. |
|
|
Returns twice the area of the oriented triangle (a, b, c), i.e.
, the area is positive if the triangle is oriented counterclockwise. |
| static int XOR |
( |
int |
x, |
|
|
int |
y |
|
) |
[inline, static] |
|
© 1999 - 2006 Intel Corporation. All rights reserved.
* Other names and brands may be claimed as the property of others.
|
|


PureBasic - File
Overview
Files are the main method for storage on computers. PureBasic allows the programmer to create applications in such a manner that the methods used to manage these files, are simple to use, and yet still optimized. Any number of files may be handled at the same time. This library uses buffered functions to increase the reading/writing speed. All the file functions can handle huge files, all the way up to: 2^64 bytes, (i.e. if the file-system supports it).
For large amounts of data it may be useful to load the data into an array, a list or a Map, using a memory block may also be a good idea.
To get valid file paths for reading/saving data, take a look at the FileSystem and the Requester libraries.
Command Index
CloseFile
CreateFile
Eof
FileBuffersSize
FileID
FileSeek
FlushFileBuffers
IsFile
Loc
Lof
OpenFile
ReadAsciiCharacter
ReadByte
ReadCharacter
ReadData
ReadDouble
ReadFile
ReadFloat
ReadInteger
ReadLong
ReadQuad
ReadString
ReadStringFormat
ReadUnicodeCharacter
ReadWord
TruncateFile
WriteAsciiCharacter
WriteByte
WriteCharacter
WriteData
WriteDouble
WriteFloat
WriteInteger
WriteLong
WriteQuad
WriteString
WriteStringFormat
WriteStringN
WriteUnicodeCharacter
WriteWord
Example
File.pb
Supported OS
All


Hi, I'm Stephanie.
A photographer and moto enthusiast who works in tech during the day.
I like it when aesthetics and functionality come together to create meaningful things.
You can find me in central Texas toting a computer and camera while I zip around on my motorcycle.
After graduating from Texas State University with a degree in photography I put my skills to work taking portraits, publishing articles,
documenting events, and creating social media campaigns for businesses.
Now, I'm living in the world of tech where I am able combine creativity, ideas, and problem-solving to find solutions to problems.
Portrait by: Daniel Nguyen


Encrypt a File, Save the Encrypted File and the Key
You can use this passphrase to generate reproducible encryption key for the uploaded file. Otherwise, the key is created at random and it changes every time.
Select File
Key for Decryption:
Zip Info:


OFFER
| Luke Zhao | Waterloo Toronto | January 27th 2014 |
Waterloo University to Toronto Downtown
January 27th 2014 - 6:00 PM
OFFER
| Luke Zhao | Waterloo Toronto | January 27th 2014 |
Waterloo University to Toronto Downtown
January 27th 2014 - 6:00 PM
OFFER
| Luke Zhao | Waterloo Toronto | January 27th 2014 |
Waterloo University to Toronto Downtown
January 27th 2014 - 6:00 PM
OFFER
| Luke Zhao | Waterloo Toronto | January 27th 2014 |
Waterloo University to Toronto Downtown
January 27th 2014 - 6:00 PM
OFFER
| Luke Zhao | Waterloo Toronto | January 27th 2014 |
Waterloo University to Toronto Downtown
January 27th 2014 - 6:00 PM
OFFER
| Luke Zhao | Waterloo Toronto | January 27th 2014 |
Waterloo University to Toronto Downtown
January 27th 2014 - 6:00 PM
OFFER
| Luke Zhao | Waterloo Toronto | January 27th 2014 |


You can preview HTML files in a browser of your choice by clicking the browser icons toolbar:
.
So doing, if you just click the desired browser icon, the file shows up in the built-in server port; however, when you keep the Shift key pressed while clicking the browser icon, the file runs immediately from its location. Compare the two address bars:


Eyal's JavaScript Notes
- Array.filter: array method that creates a new array with all elements that pass the test implemented by the provided function (You are creating a new array based on the standards you want, filter is the "bouncer"). DOES NOT MUTATE ARRAY ITSELF.
- Array.find: array method that finds the value of the first element in an array which matches the condition placed in the callback argument. Returns undefined if no match is found. DOES NOT MUTATE ARRAY ITSELF
- Array.findIndex: array method that finds the index (position) of the first element in an array which matches the condition placed in the callback argument. Returns -1 if no match is found. DOES NOT MUTATE ARRAY ITSELF
- Array.forEach: array method that executes a provided function once for each array element. DOES NOT MUTATE ARRAY ITSELF
- Array.map: array method that creates a NEW ARRAY populated with the results of calling a provided function on every element in the calling array. DOES NOT MUTATE ARRAY ITSELF
- Array.reduce: array method that executes a reducer function for each value of an array. It returns a single value which is the function's accumulated result. DOES NOT MUTATE ORIGINAL ARRAY
- Array.slice: array method that returns selected elements in an array, as a new array. Selects from a given start, up to a given end. DOES NOT MUTATE ORIGINAL ARRAY
- Array.sort: array method that sorts the elements of an array, overwrites the original array, sorts the elements as strings in alphabetical (converts everything to Strings) and ascending order (UTF-16 code units order). MUTATES ORIGINAL ARRAY
- Array.splice: array method that adds and/or removes array elements. MUTATES ORIGINAL ARRAY (which is one of the things that makes it different from slice)


Aquinas, Collingwood, and Oakeshott on Art
Bibliography
-
Collingwood, R. G. 2010.
The Principles of Art.
Oxford: Oxford Univ. Press.
-
Eco, Umberto, and Hugh Bredin. 1988.
The Aesthetics of Thomas Aquinas.
London: Radius.
-
Oakeshott, Michael. 1991.
Rationalism in Politics and Other Essays.
Indianapolis: Liberty Fund.


OCKCHUL KIM
326 Baxter Street | Kernersville, NC 27284 |<PHONE_NUMBER> |<EMAIL_ADDRESS>A recent Korean-American bachelor of science graduate from UNC looking for experience in
biomedical engineering industry. Enjoys exploring and learning new concepts and skills. Works
well with a group that is willing to go beyond the call of duty. Well-exposed to various cultures
and peoples, and often acts as a bond that holds a project group together.
OBJECTIVE
To explore and gain experience in the biomedical engineering industry.
EDUCATION
Bachelor of Science
Expected May 2013
University of North Carolina at Chapel Hill
Major: Applied Science - Biomedical Engineering track
Minor: Computer Science
Minor: Physics
SKILLS & ABILITIES
Programming
C/C++
Java
HTML
PHP
Javascript
MySQL
Manufacturing
Microcontroller
Analog Circuitry: filters and amplifiers
Digital Circuitry: Logic gates, MUX, Counter IC
FDM operation (3D printer)
Laser cutter operation
MIG welding
Lathe operation
Software
Solidworks
LabView
MS Office
Matlab
Blender
LaTex
Proof of Concept Projects
Peristaltic Pump Design and Prototyping
Robartics - EOG controlled robot arm
Hotwheels - Motion detection positive-feedback Android application
Opto-feedback Motor Speed Controller
Build a Band - Web Application


--- layout: default title: Home description: Curious about Astronomy? Have a burning question about the Universe?  ---
Curious about Astronomy? Have a burning question about the Universe that you'd like answered? Ask us! We have answered {{ site.posts | size }} questions so far.
We are a team of graduate students, postdocs, researchers and faculty affiliated with the University of Texas and McDonald Observatory. We welcome questions about Astronomy from K-12 students, teachers and the general public!


Features Vehicles
Get ready for The DeLuxe Driving Experience of a lifetime and choose from our fleet of 20+ supercars
on track in Stockholm.
Get ready for The DeLuxe Driving Experience of a lifetime and choose from our fleet of 20+ supercars
on track in Stockholm.


--- layout: post status: publish published: true title: I hope the Cardinals sign Pujols. author: display_name: Corey Fineran login: Corey email<EMAIL_ADDRESS>url: '' author_login: Corey author_email<EMAIL_ADDRESS>wordpress_id: 3837 wordpress_url: http://ivyenvy.com/?p=3837 date: '2011-02-15 20:23:51 +0000' date_gmt: '2011-02-16 02:23:51 +0000' categories: - General Baseball tags: - Alfonso Soriano - Cardinals - Rockies - Ryne Sandberg - St. Louis - Yankees - Chris Carpenter - Albert Pujols - Troy Tulowitzki - Matt Holliday - Mark McGwire - Jupeter Florida - 2011 World Series - John Mozeliak - PED - Adam Wainwright - Jon Heyman comments: - id: 2587 author: Ryan author_email<EMAIL_ADDRESS>author_url: '' date: '2011-02-16 19:53:13 +0000' date_gmt: '2011-02-17 01:53:13 +0000' content: "Excellent piece.\r\n\r\nI think what a lot of people seem to be forgetting here is that COMPARED TO OTHER PLAYERS OF HIS SKILL SET Albert has been very much underpaid. \r\n\r\nAs a Cubs fan, I wouldn't mind seeing them lock in a 31 year old guy for a decade even if he is healthy right now. It would benefit us in the long run.\r\n\r\nNow, it would KILL us in the short run, but in all honesty, what's our plan for the next three years anyway? Baseball is a sport where it's pretty easy to forecast teams' skill levels and right around the time Albert's skills really begin to decline, we'll just be on our way up. \r\n\r\nI realize that you aren't comparing Pujols to Soriano, but look at it this way: Albert is a first baseman. Soriano is...well, not. You can get any jackass to play (or not play) the outfield, but it takes dedication to defense to play first base. \ \r\n\r\nOrel Hershiser made an interesting point on Baseball Tonight the other day: Think about how many of the players of the past all had their home runs and RBI decline after age 30. The example he used was Mike Schmidt, and that was even WITH all of the amphetamines he was taking. It's a vaild argument so I can understand the stubbornness from the STL management. \r\n\r\nWhat do the rest of you guys think?\r\n\r\nMeehan" - id: 2597 author: Kurt author_email<EMAIL_ADDRESS>author_url: http:// date: '2011-02-17 10:16:03 +0000' date_gmt: '2011-02-17 16:16:03 +0000' content: "I'll go on record and say that Pujols is the greatest hitter I've ever seen. His numbers speak for themselves. \r\nhttp://www.baseball-reference.com/players/p/pujolal01.shtml\r\nDon't get me wrong, I DO NOT like the Cardinals, but I'm glad Pujols plays for them. We get to watch, and hate, one of the greatest players ever. You know he's good because of that anxious feeling you get when he steps up to the plate. I hope he stays in in the city of Busch. \r\n\r\nThe only good that would come from him playing for the Cubs is a reduction in racist t-shirt sales." - id: 2599 author: Ryan author_email<EMAIL_ADDRESS>author_url: '' date: '2011-02-17 18:07:47 +0000' date_gmt: '2011-02-18 00:07:47 +0000' content: "It is kind of a guilty pleasure to watch him because he is so good. I know what Kurt is talking about because he gives off this constant aroma of intimidation. \ Even the way he sets into his stance frightens the hell out of me. (even when I'm watching them play the Astros)\r\n\r\nHe is probably the greatest hitter our generation has ever seen, but the fact that nobody hits .400 anymore leads me to believe that Ted Williams will always be the greatest. \r\n\r\nMeehan" ---
If you are paying attention to Spring Training baseball, you probably know that Albert Pujols is (figuratively) standing outside the chain link fence at the Cardinals' practice field in Jupiter, Florida with one arm in the air, tapping on his wristwatch. Pujols has told the Cardinals that they have until 12 noon EST on Wednesday to agree on a new deal. If the deal is not inked, Pujols will end negotiations on the contract until the 2011 season is over. Pujols can become a free agent after the 2011 World Series.
Pujols is set to earn around $30 million a year. The sticking point appears to be the length of the contract. It's being reported that tonight, the Cardinals offered Pujols an 8 year deal. However, it's quite clear that Pujols wants 10 years. That would eclipse Alex Rodriguez's 10 year, $275 million contract as the largest in baseball. Sidenote, remember when Ryne Sandberg held the largest contract in baseball with his $7.1 million/year contract?
I haven't discussed this situation with many Cubs fans and I wonder what you all are thinking. I had a conversation with a good Cubs fan (good because he reads the site and listens to the podcast) today and it got me thinking. This situation has to be nerve-wrecking for the front office of a medium market team that has now been forced by Matt Holliday and Albert Pujols to spend like the Yankees. This is how I picture Cardinals GM John Mozeliak and his assistants, evaluating the situation.
Pujols is in his 10th season with the Cardinals and it's difficult to imagine locking a player up for 10 years. The Rockies gave Troy Tulowitzki a 10 year deal in the off-season, but Pujols is 31 years old, nearly half of such a contract older than Tulowitzki. Pujols is an incredible baseball player. He's worthy of being the best paid in baseball, as he is most likely the best baseball player we will live to see. If he is PED-free, I think in a decade, the case could be made he's the best in the history of the game.
Is it smart baseball business to give a 31 year old a 10-year contract? Especially a 10 year contract that amounts to $30 million a year. Does it make sense to pay a player that kind of money over that length of time, knowing that most, if not all of those years are the backside of his career? I do think we've seen the best of his career. That's not to say Pujols will be a wash over the next 10 years, but his skills must diminish.
Facing this decision is a team that had a payroll of $94 million in 2010. Holliday is set to earn $17 million through 2016. If the Cardinals sign Pujols, it's safe to say that they will be forced to cut into their pitching staff (Carpenter, Wainwright) and just about every other position on the field. Does this organization want to sacrifice everything for two big (aging) names?
Today, I also spoke with a co-worker that is a Cardinals fan. Ivy Envy trivia fact: He's the voice-over for our podcast intro. He's so professional that he can do a voice-over of that quality through clenched teeth, feigning excitement over the Cubs. My impression of his feelings is that he won't be happy, whichever way this negotiation goes. He wants Pujols to stay and retire in St. Louis. However, he also realizes that the Cardinals are selling their future to ensure this happens.
If I was a Cardinals fan, I would not want them to make this move and dedicate that money and time to Pujols. But I'm not a Cardinals fan. I would love to see the team enter into another long and big money contract. While the contract will not hurt the Cardinals much in the short-term, I think it will long-term. Signing Pujols does not make the Cardinals more likely to win the World Series - he's already on the team. Not signing Pujols does make them less likely to win the World Series, though. So I think, from a Cubs fan's perspective, this situation is a win-win. The Cardinals either (hopefully) hurt the organization long-term, or they lose the best player in baseball. This situation would be entirely different if the Cardinals were a good team and looking to add a free agent Pujols for that push to win it all.
While I do not take this seriously, this tweet from Jon Heyman sent shivers up my spine. I think that after the Soriano contract, the Cubs would be hesitant to jump into a larger contract. I am not putting Soriano and Pujols in the same category. The backside of Pujols' career will be much more impressive (though less hoppy) than Soriano's. I would be shocked to see the Cubs make a push for Pujols.
So I'm just going to sit back and watch this thing unfold. If a deal is not inked by tomorrow, I can only imagine that it will be a distraction throughout this season. Hey, there's another win for me. So this is potentially a win/win or win/win situation. Of course, I thought Mark McGwire as the hitting coach would be a distraction and it seemed like the organization handled that situation. This situation is bigger though, and while Albert will brush them aside, he will face questions and speculation daily. This deal being delayed until November will sure keep the columnists in St. Louis busy.
So I want to hear your opinions on this contract negotiation. As a Cubs fan, what do you want to see happen?


Carl Sagan is perhaps the most
well-known scientist of the 1970s-1980s. He is best known for his
work in studying extraterrestrial intelligence and his television
series "Cosmos: A Personal Voyage", which helped to bring the
wonders of astronomy to the general public.
Some of his many achievements include:
The assembly of the first messages sent into space to be understood by extraterrestrial intelligence: The Voyager Golden Record and the Pioneer Plaque.
The publishing of over 600 scientific papers and 20 books.
His television series "Cosmos", which was the most-watched series in the history of television.
His promotion of the Search for Extraterrestrial Intelligence (SETI).
Contributions to understanding the high surface temperature of Venus.
Demonstrating the production of amino acids by radiating basic chemicals, which helped provide information about how life is formed.
Popularizing the field of astronomy and science in general.
He is also known for his imaginative quotes. Some of the more notable ones include:
"The Cosmos is all that is or ever was or ever will be. Our feeblest contemplations of the Cosmos stir us — there is a tingling in the spine, a catch in the voice, a faint sensation as if a distant memory, of falling from a height. We know we are approaching the greatest of mysteries."
"If you wish to make an apple pie from scratch, you must first invent the universe."
"Consider again that dot. That's here. That's home. That's us.  The aggregate of our joy and suffering, thousands of confident religions, ideologies, and economic doctrines, every hunter and forager, every hero and coward, every creator and destroyer of civilization, every king and peasant, every young couple in love, every mother and father, hopeful child, inventor and explorer, every teacher of morals, every corrupt politician, every "superstar", every "supreme leader", every saint and sinner in the history of our species lived there — on a mote of dust suspended in a sunbeam..."
"Science is much more than a body of knowledge. It is a way of thinking. This is central to its success. Science invites us to let the facts in, even when they don’t conform to our preconceptions. It counsels us to carry alternative hypotheses in our heads and see which ones best match the facts. It urges on us a fine balance between no-holds-barred openness to new ideas, however heretical, and the most rigorous skeptical scrutiny of everything — new ideas and established wisdom. We need wide appreciation of this kind of thinking. It works. It’s an essential tool for a democracy in an age of change. Our task is not just to train more scientists but also to deepen public understanding of science."
Unfortunately, Dr. Sagan's life was cut tragically short when he passed away in 1996 due to pneumonia at the age of 62. His great achievements to mankind will never be forgotten.


This release note is divided into the following sections:
Introduction,
Documentation,
What's New,
Upgrading And
Compatibility Information,
Host Support,
Dependencies,
Device Support,
Validation Information,
Known Issues,
Benchmarks,
Versioning,
Technical Support
And Product Updates,
SYS/BIOS <IP_ADDRESS> is a GA release of SYS/BIOS
6.40.00. CCS users must use CCSv6.0.0 or higher. This
release also has support for GCC (for Cortex-M) and IAR (for Cortex-M
and MSP430).
Please read the SYS/BIOS User's Guide for help installing and setting
up your environment to use SYS/BIOS <IP_ADDRESS>.
back to top
The following documentation is provided with this release. These
documents are also available via the CCS Eclipse help table of
contents.
License and manifest.
Additional online sources of documentation.
Release
notes from previous releases are also available in the
release notes archive
directory.
back to top
SYS/BIOS
<IP_ADDRESS> GA
Release (this release).
- Added support for the SimpleLink™ Wi-FiŽ CC3200 device.
- Miscellaneous bug fixes.
Defects Fixed in
SYS/BIOS
<IP_ADDRESS> GA (Fixes since SYS/BIOS 6.40.01):
ID
Headline
SDOCM00107962 Cortex-A15 Instrumented/NonInstrumented libraries do not work for Keystone2 devices
SDOCM00107893 Use cases for which the cache settings from a platform are not read correctly in Cache.xs
SDOCM00107882 Update Product View's "Target Specific Support" list
SDOCM00107858 A8 MMU ROV view does not work for Page Table descriptors
SDOCM00107767 Check for overflow in the SYS/BIOS calloc() routine
SDOCM00107763
cc26xx applications require LibType_Custom. We should detect something
other than this and give appropriate error message.
SDOCM00107742 tiva Boot module code needs to be synced with the latest version of tivaware driverlib code.
SDOCM00107704
Back to back calls to m3.TimestampProvider_get32() and get64() can
appear to be 0xffffff counts apart.
SDOCM00107690
getFreqMeta() in various TimestampProviders should use
Clock.$object.timer.delegete$ to obtain Clock module Timer handle
SDOCM00107635 Update 'cortexm' .cfg files to include Boot/driverlib support for CC26xx
SDOCM00107481 SMP ducati Timer module missing Timer_getCurrentTick() API
SDOCM00107405 SYS/BIOS fails to build for IAR MSP430 v6.10
SDOCM00107330
Restrict modules recognized by BIOS.includeXdcRuntime=true to only
those modules in the xdc.runtime package
SDOCM00107311 Clock tick stop/reconfig/start APIs should be made no-ops for Clock_TickMode_DYNAMIC
SDOCM00107305 BIOS <IP_ADDRESS> uninstaller and install log Linux permissions prevent access for group/all users
SDOCM00107241
Mailbox module startup function references Memory module API even when
run time creates are disabled (STATIC policy)
SDOCM00107238 Hwi_plug is missing for ti.sysbios.family.arp32
SDOCM00106330
cdoc for SMP mode APIs like Task_setAffinity/getAffinity should clearly
identify these APIs are available in SMP mode only
back to top
SYS/BIOS
software downloads
SYS/BIOS 6.35 and 6.37
- Binary compatible for all targets except MSP430 and C2000.
- MSP430
and C2000 users must recompile all source files that use the Semaphore,
Mailbox, or Event modules. The timeout parameter was changed from
UInt to UInt32 which are different sizes.
- All other users can use libraries built with 6.35.0x and 6.37.0x with 6.40.00.
SYS/BIOS 6.34 and older
- Source compatible. All APIs are supported but all source files must be recompiled.
back to top
- Supported
Operating Systems
- Windows 8, Windows
7
- Ubuntu [10.04, 12.04, 12.10, 13.04]
back to top
- Minimum Required Software Versions
- Code Composer Studio v6.0.x or later
- TI Code Generation Tools
- C28X
version 6.2.5 or later
- C6X version 7.4.7 or later
- ARM version 5.1.5 or later
- MSP430 version 4.3.1 or later
- XDCTools <IP_ADDRESS> or later
- GNU Code Generation Tools (for ARM only)
- ARM gcc-arm-none-eabi-4_7-2013q3 or later
- XDCtools <IP_ADDRESS> or later
- IAR Code Generation Tools (for Arm Cortex-M and MSP430 only)
- ARM version 6.70.1
- MSP430 version 5.60.1
- XDCtools <IP_ADDRESS> or later
- Required Hardware
- See Device Support Section below.
back to top
Click here
for the list of supported devices.
back to top
Click
here
for the list of compilers used to build and validate this release
(scroll down to Supported Targets section).
back to top
The
following issues are known to affect this release:
back to top
For a full description of Benchmarks please see the
appendices in the SYS/BIOS
6 User's
Guide.
back to top
All releases
have 4 digits (M.mm.pp.bb).
This includes GA and pre-releases (engineering, alpha/EA, beta, etc.).
Pre-releases are denoted with a suffix (e.g. <IP_ADDRESS>-eng or
<IP_ADDRESS>-beta).
This product's version follows a version format, M.mm.pp.bb, where M is a single digit
Major number, mm
is 2 digit minor number, pp
is a 2 digit patch number, and b
is an unrestricted set of digits used as an incrementing build counter.
To
support multiple side-by-side installations of the product, the product
version is encoded in the top level directory (e.g. bios_6_30_00_00).
Subsequent
releases of patch upgrades will be identified by the patch number, ex.
SYS/BIOS <IP_ADDRESS> with directory bios_6_30_01_15. Typically, these
patches only include critical bug fixes.
Please note that
version numbers and compatibility keys are NOT the same. For an
explanation of compatibility keys, please refer to the 'Upgrade and
Compatibility Information' section.
back to top
Technical
Support and Product Updates
back to top
Last
updated: June 02, 2014 Build Ver: <IP_ADDRESS> Rev: o27


Report Your Alien Sighting!
Sighting Date
Select an Alien Type:
Human-like
Worm-like
Bird-like
Weight in pounds
Height in feet
Number of eyes
Number of arms
Number of legs
Main color of alien
Dialog
Submit
Your sighting has been submitted. Keep your eyes to the skies!


QUARTZ 任务调度动态管理系统Web UI
create
id
name
group
bean
method
crons
state
desc
operation
runOnce
pause
resume
edit
delete
×
cron create
job name
job group
bean name
method name
cron expression
job status
NORMAL
PAUSED
job description


Dana Ng
HOME
BIO
PROJECTS
Dana Ng | Junior Developer
Hosted using github.
About Me
Information about me will be posted soon.
Back to
Projects


RIDICULE Copyright 1996 D & S Associates
Director Patrice Leconte's ("Monsieur Hire") "Ridicule" is France's submission to the Academy for this year's Best Foreign Language Film. It stars stage actor Charles Berling as Gregoire Poncludon de Malavoy, a country engineer who travels to Versailles to get funding to save the local peasants from fatal fevers by draining swampy mosquito infested land. He's taken under the wing of the Marquis de Bellegarde (Jean Rochefort) and given instruction on how to play the evil-intentioned wits who make up the court of Louis XVI. Ponceludon is also torn between the Mathilde, the ravishing daughter of Bellegarde (Judith Godreche), who's engaged to a much older man in order to fund her research, and the worldly Madame de Blayac (Fanny Ardant), who pulls puppet strings and manipulates favor at court.
LAURA:
"Ricidule" is a lush costume drama where the main character must navigate through the shark-infested waters of Louis XVI's court 6 years before the inevitable revolution. This is a very smart drama with a great central conflict (the lure and dazzle of the court and its denizens vs. the simplicity and beauty of Mathilde and the country) and an unfortunately unsatisfying conclusion. Ponceludon eventually 'wins', although not in the manner he had been striving for, I wondered what took him so long to make his final point that "children will die tomorrow because you ridiculed me today." Of course then we wouldn't have been able to enjoy all the nefarious scheming along the way!
Jean Rochefort is marvelous as the Marquis who's not able to keep his wits about him as he had in his youth. In fact, he keeps a notebook where he writes down the great barbs and comments that make their utterer the talk of the court until the next great one comes along. Bernard Giraudeau is gleefully wicked as 'wit of the moment' Abbot de Vilecourt and lover of Madame de Blayac - he's like a malicious child whose actions cause tragedy. Charles Berling, in his screen debut, is sympathetic as the simple man who gets in over his head but manages to remain uncorrupted. Urbain Cancelier is wonderfully cast as a Louis XVI who constantly seeks entertainment but provides none. He reminded me of Jon Lovitz' emperor in "Mom and Dad Save the World."
"Ricidule" is solid, intelligent adult entertainment, a good, but not great, film.
B
ROBIN:
N/A
D&S Associates - Electronic Publishers Webmasters of Neponset.Com http://www.neponset.com voicemail:<PHONE_NUMBER> BBS:<PHONE_NUMBER> Visit "Reeling" at http://www.neponset.com/reeling.
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


Ryan's Mandell-Moore Bitoric Lens Calculator |
||||||||
OD |
OS |
|||||||
| 1. Keratometry | @; @ | @; @ | ||||||
| 2. Spectacle Rx (minus cyl form) | x | x | ||||||
| Flattest K | Sphere | Steepest K | Sphere+Cylinder | Flattest K | Sphere | Steepest K | Sphere+Cylinder | |
| 3. Enter K: | ||||||||
| 4. Enter Spectacle Power: | ||||||||
| 5. Vertex Adjust Line 4: | ||||||||
| 6. Insert Fit Factor: | (-)0.25 D | (+)0.25 D | (-)0.75 D | (+)0.75 D | (-)0.25 D | (+)0.25 D | (-)0.75 D | (+)0.75 D |
| Add Lines: | 3 & 6 | 5 & 6 | 3 & 6 | 5 & 6 | 3 & 6 | 5 & 6 | 3 & 6 | 5 & 6 |
| 7. Final CL Rx: | ||||||||
|
Based on the Mandell-Moore form located on the GPLI web site. Copyright 2012, Ryan K. Losh, ALL RIGHTS RESERVED. Anyone who uses this tool shall be solely responsible for VERIFYING
the results produced. Permission hereby granted to copy and use this tool, provided NONE of the above messages are removed or changed. Instructions:
|


Construct a new linked list.
The first value in the list.
This is undefined
if the list is empty.
Constant.
The first node in the list.
This is null
if the list is empty.
Constant.
Whether the list is empty.
Constant.
The last value in the list.
This is undefined
if the list is empty.
Constant.
The last node in the list.
This is null
if the list is empty.
Constant.
The length of the list.
Constant.
Add a value to the beginning of the list.
The value to add to the beginning of the list.
The list node which holds the value.
Constant.
Add a value to the end of the list.
The value to add to the end of the list.
The list node which holds the value.
Constant.
Remove all values from the list.
Linear.
Insert a value after a specific node in the list.
The value to insert after the reference node.
The reference node of interest. If this is null
,
the value will be added to the end of the list.
The list node which holds the value.
The reference node must be owned by the list.
Constant.
Insert a value before a specific node in the list.
The value to insert before the reference node.
The reference node of interest. If this is null
,
the value will be added to the beginning of the list.
The list node which holds the value.
The reference node must be owned by the list.
Constant.
Create an iterator over the values in the list.
A new iterator starting with the first value.
Constant.
Create an iterator over the nodes in the list.
A new iterator starting with the first node.
Constant.
Remove and return the value at the beginning of the list.
The removed value, or undefined
if the list is empty.
Constant.
Remove and return the value at the end of the list.
The removed value, or undefined
if the list is empty.
Constant.
Remove a specific node from the list.
The node to remove from the list.
Constant.
The node must be owned by the list.
Create a reverse iterator over the values in the list.
A new iterator starting with the last value.
Constant.
Create a reverse iterator over the nodes in the list.
A new iterator starting with the last node.
Constant.
Create a linked list from an iterable of values.
The iterable or array-like object of interest.
A new linked list initialized with the given values.
Generated using TypeDoc
A generic doubly-linked list. The namespace for the
LinkedList
class statics.


This tutorial will go over the basics of analyzing eggs
, the primary
data structure used in quail
. To learn about how an egg is set up,
see the egg tutorial.
An egg is made up of (at minimum) the words presented to a subject and the words recalled by the subject. With these, two components we can perform a number of analyses:
If we have a set of features for the stimuli, we can also compute a Memory Fingerprint, which is an estimate of how a subject clusters their recall responses with respect to features of a stimulus (see the fingerprint tutorial for more on this).
Let’s get to analyzing some eggs
. First, we’ll load in some example
data:
import quail
egg = quail.load_example_data()
This dataset is comprised of 30 subjects, who each performed 8 study/test blocks of 16 words each. Here are some of the presented words:
egg.pres.head()
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject | List | ||||||||||||||||
| 0 | 0 | POMEGRANATE | FLORIDA | TOOTH | ANTELOPE | PANCREAS | PEAR | CLEMENTINE | LEMON | TONGUE | MICHIGAN | RIB | MOOSE | RACOON | IOWA | MONKEY | KANSAS |
| 1 | GRIDDLE | DAHLIA | ONION | PICKLE | AZALEA | LOG | SAUCER | FLOOR | FOUNDATION | BUTTERCUP | STRAINER | CAULIFLOWER | ELEVATOR | BROCCOLI | CARPET | DISH | |
| 2 | AUSTRALIA | ETHIOPIA | CELERY | ITALY | BASS | MARACAS | YAMS | PIG | LION | LETTUCE | ZEBRA | ELEPHANT | POLAND | VIOLA | CARROT | TROMBONE | |
| 3 | PINE | SCREWS | TRIANGLE | WEDGE | HICKORY | WIRE | CELLO | HONEYDEW | RASPBERRY | ELM | HAMMER | SAXOPHONE | MAPLE | PLUM | FIG | VIOLIN | |
| 4 | DAISY | DRESS | SUNFLOWER | KNIFE | GIRDLE | TOASTER | FORK | PANTS | SKILLET | UTAH | MAINE | LILY | UNDERWEAR | NARCISSUS | MONTANA | ARIZONA |
and some of the recalled words:
egg.rec.head()
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | ... | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject | List | |||||||||||||||||||||
| 0 | 0 | KANSAS | POMEGRANATE | CLEMENTINE | TOOTH | FLORIDA | RIB | MICHIGAN | LEMON | None | None | ... | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN |
| 1 | GRIDDLE | ONION | DAHLIA | CAULIFLOWER | BUTTERCUP | AZALEA | BROCCOLI | ELEVATOR | None | None | ... | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | |
| 2 | AUSTRALIA | MARACAS | POLAND | TROMBONE | None | None | None | None | None | None | ... | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | |
| 3 | HONEYDEW | RASPBERRY | ELM | SAXOPHONE | PLUM | PINE | None | None | None | None | ... | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | |
| 4 | UTAH | MONTANA | NARCISSUS | ARIZONA | DAISY | DRESS | SUNFLOWER | LILY | KNIFE | GIRDLE | ... | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN | NaN |
5 rows × 22 columns
We can start with the simplest analysis - recall accuracy - which is
just the proportion of words recalled that were in the encoding lists.
To compute accuracy, simply call the analyze
function, with the
analysis
key word argument set to accuracy
:
accuracy = quail.analyze(egg, analysis='accuracy')
accuracy.head()
| 0 | ||
|---|---|---|
| Subject | List | |
| 0 | 0 | 0.500 |
| 1 | 0.500 | |
| 2 | 0.250 | |
| 3 | 0.375 | |
| 4 | 0.625 |
The result is a multi-index Pandas DataFrame where the first-level index
is the subject identifier and the second level index is the list number.
By default, note that each list is analyzed separately. However, you can
easily return the average over lists using the listgroup
kew word
argument:
accuracy_avg = quail.analyze(egg, analysis='accuracy', listgroup=['average']*8)
accuracy_avg.head()
| 0 | ||
|---|---|---|
| Subject | List | |
| 0 | average | 0.476562 |
| 1 | average | 0.960938 |
| 2 | average | 0.546875 |
| 3 | average | 0.757812 |
| 4 | average | 0.406250 |
Now, the result is a single value for each subject representing the
average accuracy across the 16 lists. The listgroup
kwarg can also
be used to do some fancier groupings, like splitting the data into the
first and second half of the experiment:
accuracy_split = quail.analyze(egg, analysis='accuracy', listgroup=['First Half']*4+['Second Half']*4)
accuracy_split.head()
| 0 | ||
|---|---|---|
| Subject | List | |
| 0 | Second Half | 0.546875 |
| First Half | 0.406250 | |
| 1 | Second Half | 0.937500 |
| First Half | 0.984375 | |
| 2 | Second Half | 0.625000 |
These analysis results can be passed directly into the plot function like so:
ax = quail.plot(accuracy_split)
For more details on plotting, see the plot tutorial. Next, lets take a
look at the serial position curve analysis. As stated above the serial
position curve (or spc) computes recall accuracy as a function of the
encoding position of the word. To use it, use the same analyze
function illustrated above, but set the analysis
kwarg to spc
.
Let’s also average across lists within subject:
spc = quail.analyze(egg, analysis='spc', listgroup=['average']*8)
spc.head()
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | ... | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject | List | |||||||||||||||||||||
| 0 | average | 1.0 | 0.750 | 0.750 | 0.375 | 0.500 | 0.125 | 0.250 | 0.375 | 0.375 | 0.500 | ... | 0.375 | 0.625 | 0.25 | 0.500 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
| 1 | average | 1.0 | 1.000 | 1.000 | 1.000 | 0.875 | 0.875 | 0.875 | 1.000 | 0.875 | 1.000 | ... | 1.000 | 1.000 | 1.00 | 1.000 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
| 2 | average | 0.5 | 0.500 | 0.375 | 0.500 | 0.625 | 0.500 | 0.625 | 0.500 | 0.500 | 0.500 | ... | 0.750 | 0.625 | 0.75 | 0.625 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
| 3 | average | 1.0 | 0.875 | 0.875 | 0.625 | 0.625 | 0.875 | 1.000 | 0.750 | 0.875 | 0.375 | ... | 0.625 | 0.875 | 0.50 | 0.875 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
| 4 | average | 0.5 | 0.250 | 0.625 | 0.250 | 0.375 | 0.375 | 0.375 | 0.250 | 0.250 | 0.125 | ... | 0.500 | 0.625 | 0.75 | 0.875 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
5 rows × 22 columns
The result is a df where each row is a subject and each column is the encoding position of the word. To plot, simply pass the result of the analysis function to the plot function:
ax = quail.plot(spc)
The next analysis we’ll take a look at is the probability of first
recall, which is the probability that a word will be recalled first as a
function of its encoding position. To compute this, call the analyze
function with the analysis
kwarg set to pfr
. Again, we’ll
average over lists:
pfr = quail.analyze(egg, analysis='pfr', listgroup=['average']*8)
pfr.head()
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | ... | 12 | 13 | 14 | 15 | 16 | 17 | 18 | 19 | 20 | 21 | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject | List | |||||||||||||||||||||
| 0 | average | 0.625 | 0.0 | 0.0 | 0.000 | 0.000 | 0.0 | 0.0 | 0.125 | 0.000 | 0.125 | ... | 0.000 | 0.000 | 0.000 | 0.125 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
| 1 | average | 0.000 | 0.0 | 0.0 | 0.000 | 0.000 | 0.0 | 0.0 | 0.000 | 0.000 | 0.000 | ... | 0.625 | 0.125 | 0.125 | 0.125 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
| 2 | average | 0.125 | 0.0 | 0.0 | 0.000 | 0.125 | 0.0 | 0.0 | 0.000 | 0.000 | 0.000 | ... | 0.125 | 0.000 | 0.125 | 0.375 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
| 3 | average | 0.125 | 0.0 | 0.0 | 0.000 | 0.125 | 0.0 | 0.0 | 0.000 | 0.125 | 0.000 | ... | 0.125 | 0.000 | 0.000 | 0.250 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
| 4 | average | 0.000 | 0.0 | 0.0 | 0.125 | 0.000 | 0.0 | 0.0 | 0.000 | 0.000 | 0.000 | ... | 0.125 | 0.375 | 0.250 | 0.125 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 | 0.0 |
5 rows × 22 columns
This df is set up just like the serial position curve. To plot:
ax = quail.plot(pfr)
The next analysis to consider is the lag-CRP, which again is a function
that given the recall of word n, returns the probability of recalling
words at neighboring positions (n+/-1, 2, 3 etc). To use it? You guessed
it: call the analyze
function with the analysis
kwarg set to
lagcrp
:
lagcrp = quail.analyze(egg, analysis='lagcrp', listgroup=['average']*8)
lagcrp.head()
| -16 | -15 | -14 | -13 | -12 | -11 | -10 | -9 | -8 | -7 | ... | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | 16 | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject | List | |||||||||||||||||||||
| 0 | average | 0.0 | 0.250 | 0.0000 | 0.125000 | 0.00000 | 0.000000 | 0.000000 | 0.000000 | 0.02500 | 0.000000 | ... | 0.062500 | 0.000000 | 0.156250 | 0.03125 | 0.000000 | 0.000000 | 0.0000 | 0.000 | 0.000 | 0.0 |
| 1 | average | 0.0 | 0.125 | 0.0625 | 0.000000 | 0.09375 | 0.041667 | 0.000000 | 0.000000 | 0.03125 | 0.097222 | ... | 0.000000 | 0.025000 | 0.000000 | 0.00000 | 0.062500 | 0.062500 | 0.0000 | 0.000 | 0.000 | 0.0 |
| 2 | average | 0.0 | 0.000 | 0.2500 | 0.000000 | 0.06250 | 0.031250 | 0.000000 | 0.031250 | 0.08125 | 0.108333 | ... | 0.087500 | 0.087500 | 0.025000 | 0.00000 | 0.000000 | 0.000000 | 0.0625 | 0.000 | 0.125 | 0.0 |
| 3 | average | 0.0 | 0.000 | 0.1875 | 0.166667 | 0.06250 | 0.062500 | 0.125000 | 0.114583 | 0.09375 | 0.133333 | ... | 0.140625 | 0.020833 | 0.072917 | 0.06250 | 0.041667 | 0.145833 | 0.0000 | 0.125 | 0.125 | 0.0 |
| 4 | average | 0.0 | 0.375 | 0.0000 | 0.166667 | 0.00000 | 0.000000 | 0.083333 | 0.000000 | 0.03125 | 0.041667 | ... | 0.031250 | 0.062500 | 0.041667 | 0.00000 | 0.062500 | 0.000000 | 0.1250 | 0.000 | 0.000 | 0.0 |
5 rows × 33 columns
Unlike the previous two analyses, the result of this analysis returns a df where the number of columns are double the length of the lists. To view the results:
ax=quail.plot(lagcrp)
Another way to evaluate temporal clustering is to measure the temporal distance of each transition made with respect to where on a list the subject could have transitioned. This ‘temporal clustering score’ is a good summary of how strongly participants are clustering their responses according to temporal proximity during encoding.
temporal = quail.analyze(egg, analysis='temporal', listgroup=['average']*8)
ax = quail.plot(temporal, plot_style='violin', ylim=[0,1])
Last but not least is the memory fingerprint analysis. For a detailed treatment of this analysis, see the fingerprint tutorial.
As described in the fingerprint tutorial, the features
data
structure is used to estimate how subjects cluster their recall
responses with respect to the features of the encoded stimuli. Briefly,
these estimates are derived by computing the similarity of neighboring
recall words along each feature dimension. For example, if you recall
“dog”, and then the next word you recall is “cat”, your clustering by
category score would increase because the two recalled words are in the
same category. Similarly, if after you recall “cat” you recall the word
“can”, your clustering by starting letter score would increase, since
both words share the first letter “c”. This logic can be extended to any
number of feature dimensions.
To use this analysis function, you’ll need to include a features
field when you create your egg
. Our example data has this field
included. For more info on how to create this field, see the egg and
fingerprint tutorials.
Here is a glimpse of the features df:
egg.features.head()
| 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 13 | 14 | 15 | ||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Subject | List | ||||||||||||||||
| 0 | 0 | {u'category': u'FRUITS', u'color': [98, 233, 7... | {u'category': u'STATES', u'color': [98, 193, 1... | {u'category': u'BODY PARTS', u'color': [204, 9... | {u'category': u'MAMMALS', u'color': [7, 121, 8... | {u'category': u'BODY PARTS', u'color': [210, 2... | {u'category': u'FRUITS', u'color': [220, 38, 3... | {u'category': u'FRUITS', u'color': [95, 236, 9... | {u'category': u'FRUITS', u'color': [179, 134, ... | {u'category': u'BODY PARTS', u'color': [171, 1... | {u'category': u'STATES', u'color': [170, 6, 83... | {u'category': u'BODY PARTS', u'color': [205, 8... | {u'category': u'MAMMALS', u'color': [126, 183,... | {u'category': u'MAMMALS', u'color': [13, 125, ... | {u'category': u'STATES', u'color': [235, 27, 8... | {u'category': u'MAMMALS', u'color': [116, 201,... | {u'category': u'STATES', u'color': [237, 220, ... |
| 1 | {u'category': u'KITCHEN-RELATED', u'color': [1... | {u'category': u'FLOWERS', u'color': [239, 61, ... | {u'category': u'VEGETABLES', u'color': [71, 23... | {u'category': u'VEGETABLES', u'color': [121, 2... | {u'category': u'FLOWERS', u'color': [38, 240, ... | {u'category': u'FLOWERS', u'color': [231, 35, ... | {u'category': u'KITCHEN-RELATED', u'color': [2... | {u'category': u'BUILDING RELATED', u'color': [... | {u'category': u'BUILDING RELATED', u'color': [... | {u'category': u'FLOWERS', u'color': [177, 210,... | {u'category': u'KITCHEN-RELATED', u'color': [2... | {u'category': u'VEGETABLES', u'color': [200, 7... | {u'category': u'BUILDING RELATED', u'color': [... | {u'category': u'VEGETABLES', u'color': [45, 24... | {u'category': u'BUILDING RELATED', u'color': [... | {u'category': u'KITCHEN-RELATED', u'color': [1... | |
| 2 | {u'category': u'COUNTRIES', u'color': [102, 19... | {u'category': u'COUNTRIES', u'color': [199, 20... | {u'category': u'VEGETABLES', u'color': [241, 2... | {u'category': u'COUNTRIES', u'color': [37, 124... | {u'category': u'INSTRUMENTS', u'color': [158, ... | {u'category': u'INSTRUMENTS', u'color': [15, 1... | {u'category': u'VEGETABLES', u'color': [30, 15... | {u'category': u'MAMMALS', u'color': [104, 148,... | {u'category': u'MAMMALS', u'color': [168, 132,... | {u'category': u'VEGETABLES', u'color': [148, 6... | {u'category': u'MAMMALS', u'color': [47, 42, 1... | {u'category': u'MAMMALS', u'color': [8, 84, 10... | {u'category': u'COUNTRIES', u'color': [150, 19... | {u'category': u'INSTRUMENTS', u'color': [112, ... | {u'category': u'VEGETABLES', u'color': [154, 6... | {u'category': u'INSTRUMENTS', u'color': [201, ... | |
| 3 | {u'category': u'TREES', u'color': [113, 117, 9... | {u'category': u'TOOLS', u'color': [92, 78, 186... | {u'category': u'INSTRUMENTS', u'color': [48, 7... | {u'category': u'TOOLS', u'color': [170, 142, 2... | {u'category': u'TREES', u'color': [204, 46, 25... | {u'category': u'TOOLS', u'color': [36, 101, 20... | {u'category': u'INSTRUMENTS', u'color': [149, ... | {u'category': u'FRUITS', u'color': [118, 190, ... | {u'category': u'FRUITS', u'color': [47, 113, 1... | {u'category': u'TREES', u'color': [117, 158, 2... | {u'category': u'TOOLS', u'color': [168, 72, 18... | {u'category': u'INSTRUMENTS', u'color': [113, ... | {u'category': u'TREES', u'color': [221, 227, 2... | {u'category': u'FRUITS', u'color': [104, 251, ... | {u'category': u'FRUITS', u'color': [208, 173, ... | {u'category': u'INSTRUMENTS', u'color': [245, ... | |
| 4 | {u'category': u'FLOWERS', u'color': [117, 200,... | {u'category': u'CLOTHING', u'color': [141, 251... | {u'category': u'FLOWERS', u'color': [80, 14, 1... | {u'category': u'KITCHEN-RELATED', u'color': [3... | {u'category': u'CLOTHING', u'color': [143, 104... | {u'category': u'KITCHEN-RELATED', u'color': [2... | {u'category': u'KITCHEN-RELATED', u'color': [1... | {u'category': u'CLOTHING', u'color': [8, 170, ... | {u'category': u'KITCHEN-RELATED', u'color': [1... | {u'category': u'STATES', u'color': [54, 189, 5... | {u'category': u'STATES', u'color': [217, 17, 3... | {u'category': u'FLOWERS', u'color': [29, 169, ... | {u'category': u'CLOTHING', u'color': [189, 224... | {u'category': u'FLOWERS', u'color': [246, 77, ... | {u'category': u'STATES', u'color': [221, 52, 2... | {u'category': u'STATES', u'color': [157, 60, 3... |
Like the other analyses, computing the memory fingerprint can be done
using the analyze
function with the analysis
kwarg set to
fingerprint
:
fingerprint = quail.analyze(egg, analysis='fingerprint', listgroup=['average']*8)
fingerprint.head()
| category | color | location | firstLetter | wordLength | size | ||
|---|---|---|---|---|---|---|---|
| Subject | List | ||||||
| 0 | average | 0.513880 | 0.525987 | 0.490013 | 0.511757 | 0.476129 | 0.513928 |
| 1 | average | 0.564096 | 0.474935 | 0.499726 | 0.500558 | 0.491788 | 0.536853 |
| 2 | average | 0.657864 | 0.541949 | 0.481426 | 0.505036 | 0.470425 | 0.603982 |
| 3 | average | 0.765421 | 0.489243 | 0.478731 | 0.493680 | 0.492727 | 0.638130 |
| 4 | average | 0.536066 | 0.440451 | 0.504046 | 0.497356 | 0.474537 | 0.572010 |
The result of this analysis is a df, where each row is a subject’s fingerprint and each column is a feature dimensions. The values represent a subjects tendency to cluster their recall responses along a particular feature dimensions. They are probability values, and thus, greater values indicate more clustering along that feature dimension. To plot, simply pass the result to the plot function:
ax = quail.plot(fingerprint, ylim=[0,1.2])
This result suggests that subjects in this example dataset tended to cluster their recall responses by category as well as the size (bigger or smaller than a shoebox) of the word. List length and other properties of your experiment can bias these clustering scores. To help with this, we implemented a permutation clustering procedure which shuffles the order of each recall list and recomputes the clustering score with respect to that distribution. Note: this also works with the temporal clustering analysis.
# warning: this can take a little while. Setting parallel=True will help speed up the permutation computation
# fingerprint = quail.analyze(egg, analysis='fingerprint', listgroup=['average']*8, permute=True, n_perms=100)
# ax = quail.plot(fingerprint, ylim=[0,1.2])
Finally, the fingerprint can be plotted along side of the temporal clustering score:
fingerprint_temporal = quail.analyze(egg, analysis='fingerprint_temporal', listgroup=['average']*8)
ax = quail.plot(fingerprint_temporal)


Paste your data into the input box below, and click the Classify button to predict if your data is fraud or not fraud.
Your data is best classified as:


Judges 16:8
Then the lords of the Philistines brought up to her seven green withes which had not been dried, and she bound him with them.