Survey started successfully
Sections
ReDSSoCS
Questions
1)
What is your age (in years)?
2)
What sex were you assigned at birth, on your original birth certificate?
Male
Female
3)
What is your current gender identity? (Check all that apply)
Male
Female
Transgender, male-to-female
Transgender, female-to-male
Other
4)
Are you of Hispanic or Latino origin?
Yes
No
5)
Please select 1 or more categories to describe your race.
American Indian or Alaska Native
Asian
Black or African American
Native Hawaiian or Other Pacific Islander
White
6)
What is your current marital status?
Married
Living with someone as if married
Widowed
Divorced
Separated
Never married
7)
How many children have you EVER had, including those who are not now living? Please include any adopted, foster or stepchildren who EVER lived with you.
8)
Which of these statements describe your present situation? (Check all that apply)
Working full time, that is, 35 hours or more per week
Working part time, that is, less than 35 hours per week
Have a job or business, but not at work because of temporary illness or injury
Have a job or business, but on paid vacation
Have a job or business, but absent from work without pay
Unemployed or laid off and looking for work
Unemployed or laid off and not looking for work
Unemployed and permanently disabled
Retired
In school, full time
In school, part time
Currently on summer break/holiday from school
Full-time homemaker
Something else
9)
What is the highest grade or year of school that you completed?
No formal schooling
Completed grade K, 1 or 2
Completed grade 3 or 4
Completed grade 5 or 6
Completed grade 7
Completed grade 8
Some high school (grades 9-11)
Completed high school
Graduate equivalency degree (GED)
Some college (no degree)
Completed associate or other technical 2 year degree
Completed college (Bachelor’s degree)
Some graduate or professional studies (completed bachelor’s degree but not graduate degree)
Completed Master’s degree or equivalent or higher graduate degree
10)
Please report income from all jobs BEFORE taxes and other deductions and net income after business expenses. Include any tips, bonuses, overtime pay and commissions, as well as any income from pensions, dividends, interest, Social Security, alimony, child support, financial aid, support from persons living elsewhere, worker’s compensation or any public assistance or welfare payments and any other money income received by you from ANY OTHER source.
Can you tell me which category best represents your TOTAL PERSONAL income in the last 12 months?
$0 (no personal income)
$1 to $4,999
$5,000 to $7,999
$8,000 to $9,999
$10,000 to $12,999
$13,000 to $14,999
$15,000 to $19,999
$20,000 to $24,999
$25,000 to $29,999
$30,000 to $34,999
$35,000 to $39,999
$40,000 to $49,999
$50,000 to $59,999
$60,000 to $69,999
$70,000 to $79,999
$80,000 to $89,999
$90,000 to $99,999
$100,000 or more
11)
During the last 12 months, where did you USUALLY go to obtain health care?
No place
Doctor chosen by me
Doctor assigned by HMO/health care plan
Hospital outpatient department
Community clinic or health center
College/university health center
Hospital emergency room
Some other place most often
Don’t go to one place most often/go to more than one place
12)
At ANY time during the last 12 months were YOU covered by a private health insurance plan obtained through a current or former employer or union?
Yes
No
13)
In general, would you say your health is excellent, very good, good, fair or poor?
Excellent
Very good
Good
Fair
Poor
14)
And now, please tell me your height and weight as these are important factors for this survey.
Height (feet)
Height (inches)
Weight (pounds)
15)
The next questions are about drinking alcohol. This includes coolers; beer; wine; champagne; liquor such as whiskey, rum, gin, vodka, bourbon, tequila, scotch, brandy, cognac, cordials, or liqueurs; and also any other type of alcohol
During the last 12 months, have you had at least 1 drink of any kind of alcohol, not counting small tastes or sips?
Yes
No
During the last 12 months, did you have a total of at least 12 drinks of any kind of alcohol?
Yes
No
During the last 12 months, about how often did you drink any kind of alcoholic beverage?
Every day
Nearly every day
3 to 4 times a week
2 times a week
Once a week
2 to 3 times a month
Once a month
7 to 11 times in the last year
3 to 6 times in the last year
1 or 2 times in the last year
How many drinks did you USUALLY have on days when you drank during the last 12 months?
During the last 12 months, about how often did you drink FOUR OR MORE drinks in a single day?
Every day
Nearly every day
3 to 4 times a week
2 times a week
Once a week
2 to 3 times a month
Once a month
7 to 11 times in the last year
3 to 6 times in the last year
1 or 2 times in the last year
Never in the last year
During the last 12 months, about how often did you drink FOUR OR MORE drinks in a period of TWO HOURS OR LESS?
Every day
Nearly every day
3 to 4 times a week
2 times a week
Once a week
2 to 3 times a month
Once a month
7 to 11 times in the last year
3 to 6 times in the last year
1 or 2 times in the last year
Never in the last year
16)
Did you smoke a cigarette in the last year?
Yes
No
About how often did you USUALLY smoke a cigarette in the last 12 months?
Every day
5 to 6 days a week
3 to 4 days a week
1 to 2 days a week
2 to 3 days a month
Once a month or less
17)
Now I’d like to ask you about your experiences with medicines and other kinds of drugs that you may have used ON YOUR OWN – that is, either:
WITHOUT a doctor’s prescription;
In GREATER amounts, MORE OFTEN, or LONGER than prescribed; or
For a reason other than a doctor said you should use them.
People use these medicines and drugs ON THEIR OWN to feel more alert, to relax or quiet their nerves, to feel better, to enjoy themselves, or to get high or just to see how they would work
During the last 12 months, did you use any of these medicines or drugs ON YOUR OWN? Please do not include any over-the-counter medicines or herbal medicines. (Check all that apply)
Sedatives, for example, sleeping pills, barbiturates, Seconal, Quaaludes, or Chloral Hydrate
Tranquilizers or anti-anxiety drugs, for example, Valium, Librium, muscle relaxants, or Zanax
Painkillers, for example, Codeine, Darvon, Percodan, Oxycontin, Dilaudid, Demerol, Celebrex or Vioxx
Stimulants, for example, Preludin, Benzedrine, Methedrine, Ritalin, uppers, or speed
Marijuana, hash, THC, or grass Cocaine or crack
Hallucinogens, for example, Ecstasy/MDMA, LSD, mescaline, psilocybin, PCP, angel dust, or peyote
Inhalants or solvents, for example, amyl nitrite, nitrous oxide, glue, toluene or gasoline
Heroin
Any OTHER medicines, or drugs, or substances, for example, methadone, Elavil, steroids, Thorazine or Haldol?
18)
Have you tried to hurt or kill yourself, or threatened to do so?
Yes
No
19)
In your ENTIRE life Did you EVER have a very serious or life-threatening illness?

Yes
No
How old were you the FIRST time this happened?
How old were you the MOST RECENT time this happened?
In your ENTIRE life Before you were 18 years old, were you physically attacked or badly beaten up or injured by either of your parents or any other people who raised you?
Yes
No
In your ENTIRE life Before you were 18 years old, were you seriously neglected by either of your parents or any other people who raised you?
Yes
No
In your ENTIRE life Were you EVER physically attacked or badly beaten up or injured by your spouse or romantic partner?
Yes
No
In your ENTIRE life Were you EVER physically attacked or badly beaten up or injured by anyone else?
Yes
No
In your ENTIRE life Were you EVER mugged, held up or threatened with a weapon?
Yes
No
21)
The next few questions are about how your parents or caregivers treated you while you were growing up, that is, BEFORE you were 18 years old. By parents or caregivers, I mean your mother, father, stepmother, stepfather, adoptive mother or father, foster parent or other adult living in your home.
BEFORE you were 18 years old How often did a parent or other adult living in your home swear at you, insult you or say hurtful things?
Never
Almost never
Sometimes
Fairly often
Very often
BEFORE you were 18 years old How often did a parent or other adult living in your home act in ANY other way that made you afraid that you would be physically hurt or injured?
Never
Almost never
Sometimes
Fairly often
Very often
How often did your father, stepfather, foster or adoptive father or mother’s boyfriend push, grab, slap or throw something at your mother, stepmother, father’s girlfriend, or your foster or adoptive mother?
Never
Almost never
Sometimes
Fairly often
Very often
22)
And now some questions about your health and sexual practices.
People are different in their sexual attraction to other people. Which category on the card best describes your feelings?
Only attracted to females
Mostly attracted to females
Equally attracted to females and males
Mostly attracted to males
Only attracted to males
23)
In your entire life, have you had sex with only males, only females, both males and females, or have you never had sex?
Only males
Only females
Both males and females
Never had sex
24)
Which of the categories on the card best describes you?
Heterosexual (straight)
Gay or lesbian
Bisexual
Not sure
25)
Now I’d like to know about how often you have experienced discrimination, been prevented from doing something, or been hassled or made to feel inferior in any of the following situations because you were assumed to be gay, lesbian or bisexual.
During the last 12 months, about how often did you experience discrimination in your ability to obtain health care or health insurance coverage because you were assumed to be gay, lesbian or bisexual?
Never
Almost never
Sometimes
Fairly often
Very often
During the last 12 months, how often did you experience discrimination in how you were treated when you got care because you were assumed to be gay, lesbian or bisexual?
Never
Almost never
Sometimes
Fairly often
Very often
During the last 12 months, how often did you experience discrimination in public, like on the street, in stores or in restaurants, because you were assumed to be gay, lesbian or bisexual?
Never
Almost never
Sometimes
Fairly often
Very often
During the last 12 months, about how often did you experience discrimination because you were assumed to be gay, lesbian or bisexual in ANY other situation, like obtaining a job or on the job, getting admitted to a school or training program, in the courts or by the police?
Never
Almost never
Sometimes
Fairly often
Very often
During the last 12 months, about how often were you made fun of, picked on, pushed, shoved, hit, or threatened with harm because you were assumed to be gay, lesbian or bisexual?
Never
Almost never
Sometimes
Fairly often
Very often
26)
And now a few questions about your health.
Did you test positive for HIV, the virus that causes AIDS?
Yes
No
27)
In your ENTIRE life did you EVER attempt suicide?
Yes
No
Which of the following best describes your experience? (Please check all that apply)
I thought seriously about it
I had a general plan but did not carry it out (e.g., a time, a place, etc. were identified)
I wrote a suicide note but did not leave it where it could be found
I wrote a suicide note and did leave it where it could be found
I had a method but did not carry it out
I made a serious attempt but no medical intervention occurred
I made a serious attempt that received medical attention
Although I considered suicide, I was not that serious about it
28)
How frequently do you check Facebook?
Hourly
Daily
Weekly
Monthly
Every Several Months
Never
29)
Which social networks do you check?
Hourly
Daily
Weekly
Monthly
Every Several Months
Never
Twitter
Hourly
Daily
Weekly
Monthly
Every Several Months
Never
Google+
Hourly
Daily
Weekly
Monthly
Every Several Months
Never
MySpace
Hourly
Daily
Weekly
Monthly
Every Several Months
Never
LinkedIn
Hourly
Daily
Weekly
Monthly
Every Several Months
Never
Other
Hourly
Daily
Weekly
Monthly
Every Several Months
Never
30)
Do you check any of the following social networking sites?
Yes
No
Tumblr
Yes
No
TrevorSpace
Yes
No
Grindr
Yes
No
Scruff
Yes
No
Jack'd
Yes
No
Hornet
Yes
No
Yelp
Yes
No
Foursquare
Yes
No
Flickr
Yes
No
YouTube
Yes
No
Yes
No
Pinterest
Yes
No
Instagram
Yes
No
Other
Yes
No


About Michael
- Resume
- Works
- About
- Contact
things to read
- East of Eden - Steinbeck
- The Road - McCarthy
- Sometimes a Great Notion - Kesey
- Dune - Herbert
- Instructions to the Tenzo - Dogen
- The Sound and the Fury - Faulkner
- The Library of Babel - Borges
- The Call of the Wild - London
- The Elements of Style - Strunk & White
things to watch
- Hoop Dreams
- Microcosmos
- Baraka
- The Wire
- Seinfeld
- There Will Be Blood
- Grizzly Man
- Taxi Driver
- This is Spinal Tap
- Chapelle's Show
things to hear
- In a Silent Way - Miles Davis
- A Love Supreme - John Coltrane
- In Pursuit of the 27th Man - Horace Silver
- The Payback - James Brown
- Endtroducing - DJ Shadow
- The Chronic - Dr. Dre
- Selected Ambient Works - Aphex Twin
- The Roots of Dub - King Tubby
- Trout Mask Replica - Captain Beefheart
- Led Zeppelin IV - Led Zeppelin


This feature allows you to integrate users from your own website that uses WoWonder.
To get started please follow those steps:


--- Title: Parking in rural North East Somerset Breadcrumb1_title: Parking & Travel Breadcrumb1_url: section-parking.html ---
See all rural car parks on a map
There is no paid-for on-street parking in rural North Somerset. You can park on the road where it is safe to do so, but you must observe any restrictions marked including yellow lines.


Question #{{ question.index }}: {{ question.questionText }}
Your Answer:
Option {{ answer }} — {{ question.options[answer - 1].text }}
done
clear
(no answer provided)
Correct Answer:
Option {{ question.answer }} — {{ question.options[question.answer - 1].text }}
Explanation:
Option {{ question.answer }} was correct because {{ question.explanation }}.


vtk_view is a parallel MPI program. It does not need to be run with the same number of processes with which you ran zdrive. You can choose the number of processes based on the size of the input mesh you will be visualizing, and the computational load of rendering it to an image at interactive rates.
If you run vtk_view in the directory in which you ran the test driver, the following will happen:
The example below shows how vtk_view displays the mesh in the test directory ch_brack2_3 after it has been partitioned with HSFC across 5 processes.
If no test driver output files are found, vtk_view will display the mesh without part IDs.
There are a few additional options that can be added to the test driver input file, that are specifically for vtk_view.
| zdrive count = <number> | the number of file_name.out.p.n files, also the value of p |
| image height = <number> | number of pixels in height of image (default is 300) |
| image width = <number> | number of pixels in width of image (300) |
| omit caption = <1 or 0> | do not print default caption in window if "1" (0) |
| omit scalar bar = <1 or 0> | do not print scalar bar in window if "1" (0) |
| add caption = <text of caption> | display indicated text in the window (no caption) |
The zdrive count option may be required if you have more than one set of test driver output files in the directory. Otherwise, vtk_view will look for files of the form file_name.out.p.n for any value p. Note that since the window may be resized with the mouse, you may not need image height and image width unless you must have a very specific window size. Also note that if you ran the Fortan test driver zfdrive, you will need to rename the output files from file_name.fout.p.n to file_name.out.p.n.
Note that while vtk_view is built with OpenGL and VTK, vtk_write must be built with Mesa GL and a version of the VTK libraries that you have compiled with special Mesa flags and with the Mesa header files. This is because OpenGL implementations are not in general capable of off-screen rendering, and Mesa GL is. The Config.generic file in Utilities/Config describes in detail how to build Mesa and then VTK for off-screen rendering.
vtk_write goes through the same steps that vtk_view does, except at the end it writes one or more image files instead of opening a window on your display. The images begin with a camera focused on the mesh, pointing in the direction of the negative Z-axis. The positive Y-axis is the "up" direction, and we use a right-handed coordinate system. (So the X-axis is pointing to the right.) The camera can revolve around the mesh in 1 degree increments.
The zdrive count, image width, and image height options listed above also apply to vtk_write. In addition, you can use these options to govern the output images.
| output format = <format name> | choices are tiff, png, jpeg, ps and bmp (default is tiff) |
| output name = <file name> | base name of image file or files (outfile) |
| output frame start = <number> | first frame, between 0 and 360 (0) |
| output frame stop = <number> | last frame, between 0 and 360 (0) |
| output frame stride = <number> | the difference in degrees from one frame to the next (1) |
| output view up = <x y z> | the direction of "up" as camera points at mesh (0 1 0) |
You can then hard-code vtk_view to read your file, or you can modify read_cmd_file in driver/dr_input.c to accept a specification of your file type in addition to Chaco and Nemesis. If you do the latter you can create a zdrive-style input file in which to specify your file name and other visualization parameters.
Finally, you need to create text files listing each global ID you supplied to Zoltan, followed by the part ID assigned by Zoltan, with only one global ID/part ID pair per line. Name this file or files using the conventions used by the test drivers.


There are many free resources online about the Analytic Hierarchy Process. It is a simple, but powerful organizational tool for multi-criteria comparison analysis. In this introduction I will explain the basics of AHP, and crank out an example use case. If you create a user account, you'll be able to create and save your own AHP models.
In our postmodern capitalist world, decisions control our lives. Haven't you ever walked into a grocery store looking for a jar of, say, peanut-butter, and been baffled by the sheer number of choices available? Or perhaps you're in a relationship and you can't decide whether or not to get married.
If you were to confront these decisions as a scientist, how would you go about doing that? One common technique is to make a pro-con (cost/benefit) list. The items on this list represent the criteria upon which your decision depends. Let's run with the marriage example I just mentioned:
| Pros | Cons |
|---|---|
| Tax Benefits | Wedding Ring expense |
| Children | Less free time |
| Stability | Commitment |
I arranged the previous example to illustrate a point. Each row represents a criterium. The first row represents expense. The second, use of personal time. The third, points to issues involving monogamy.
How could we use this table to make an educated decision? If all of the criteria are equally important, then all we have to do is decide which item is most important on each row, the pro or the con? Then we just tally them up an make out decision:
| Pros | Cons | ||
|---|---|---|---|
| Criterium A | Tax Benefits | < | Wedding Ring expense |
| Criterium B | Children | >Less free time | |
| Criterium C | Stability | >Commitment | |
| Count | 2 | 1 |
But what about when A, B, and C differ in imortance? And what if for some of thesewe want to consider sub-criteria? We need a way to organize and compare these criteria. Hence the hierarchy in AHP. Consider the following hierarchy:
This is a hierarchy with only one level. Note that there is a subjective aspect to the AHP process. Your prioritization scheme depends on how you organize your hierarchy. However, as long as you include the same criteria in your hierarchy, the only difference between the possible hiearchies you can generate is how you choose to compare the criteria.
Continuing to add detail to our marriage hiearchy:
As you can see, we added another level.
The next step is to compare the criteria at each level of the hierarchy. One commonly accepted approach is to compare the criteria in pairs. Let's do this.


Enter database
Go back
Enter username:
Enter password:
Enter host:
Enter database:
submit
-developed by anmol purwar


Sylvanian Families Hunter-Smyth Chocolate Labrador Family
UK Biography Information
Father Charles Hunter-Smyth is a very hard working farmer, who is up at six o'clock every morning, out in the fields tending his crops. Growing everything from cabbage to sweetcorn, sunflowers to barley and oats. Charles never stops, come rain or shine. There always seems to be yet another job to do! Ploughing, seeding, weeding, harvesting- busy, busy, thats our Charles.
Mother Camilla Hunter-Smyth is the perfect farmer's wife. As well as making jams and preserves during the fruit picking month, she also makes the most wonderful relishes with the vegetables as they are harvested. all these delicious creations, along with her husband's produce, she sells at the farmers; market each Friday morning. It's amazing that she still finds time to run the home and bring up five delightful children!
Brother Hector Hunter-Smyth likes to get up at six o'clock with his father so that they can have breakfast together. His father makes the best porridge oats, which is then topped with a tablespoon of wild honey. Absolutely wonderful! The two of them then set off to do some work in the fields, before young Hector has to get ready for school!
Sister Isabella Hunter-Smyth loves nothing better than to invite as many of her friends as her mother will allow to stay, for a sleepover. They all arrive after school with their overnight bags and after raiding the fridge and making a mess of the kitchen, they all rush off to the farmyard for a grand game of 'hide and seek' amongst the barns and out buildings, until it's time for supper. Later on, with lots of sweets, treats and a story, the girls chat and giggle way past their usual bedtime.


Bibliographies are fundamental tools for research communities. Besides the obvious uses as connection to previous research, citations are also widely used for evaluation purposes: the productivity of researchers, departments and universities is increasingly measured by counting their citations. Unfortunately, citations counters are just rough indicators: a deeper knowledge of individual citations – where, when, by whom and why – improves research evaluation tasks and supports researchers in their daily activity. Yet, such information is mostly hidden within repositories of scholarly papers and is still difficult to find, navigate and make use of.
In this paper, we present a novel tool for exploring scientific articles through their citations. The environment is built on top of a rich citation network, encoded as a LOD, and includes a user-friendly interface to access, filter and highlight information about bibliographic data.
Researchers spend a lot of time in exploring bibliographies. When writing a paper, when exploring a new research area, when evaluating papers, they use bibliographies for finding related works. Starting from one paper, researchers are interested in the papers cited by that one and those it cites. It is not a case that digital libraries of scholarly papers - such as ACM DL, IEEE Xplore DL - show bibliographic references and incoming citations in separate lists, that can be often explored even if the full-text of the paper is not available.
Digital libraries show bibliographies are 'monolithic' units, so that users cannot process bibliographic items separately. Consider, for instance, the case of a user checking how outdated the references of a paper are. There is no other choice than inspecting the references and manually filtering outdated ones. Similarly, counting self-citations requires users to manually inspect the reference list.
Even if performing these task is not a huge issue on a single paper, it's still time-consuming and difficult when dealing with several papers. The aggravating factor is that, often, these tasks have to be completed under pressure: who can say that he had never written a review right before the (extended) deadline? Or made an initial selection of papers in a few hours? Or even arranged a related works section in short time?
Our research aims at supporting researchers in these daily tasks, making it easy to access data that otherwise are hard to find, inspect and filter.
The problem can be broken in two parts. First, we need rich data about papers (e.g. author list, publication year, venue, etc.) and citation networks (e.g. about incoming/outgoing citations). For instance, it is useful and challenging to capture the original citation context - defined in as the sentence of the original paper where a particular work was cited - and the citation function, defined in as the reason why a paper is cited. Having such data can be very helpful to understand the nature of citations and to give them more or less importance.
The second issue consists in providing users with intuitive interfaces to read and make sense of these data - for instance, to easily filter data, to navigate paper collections, to explore citations, along with their functions and contexts.
This paper focuses on the second aspect, though some discussion is provided about the underlying data model and source. In fact, we briefly introduce the Semantic Lancet Triplestore (SLT), a LOD dataset including detailed information about citations, and then we go into details of BEX, a novel environment for accessing these data.
The structure of the paper is as follows. describes some related works; some issues in daily tasks on citations, along with possible improvements, are investigated in ; gives some background on the Semantic Lancet Triplestore; BEX is introduced in ; the evaluation of the current prototype and conclusions are presented in .
A large variety of systems support the exploration of scholarly data, some of them providing an interface to a specific repository of bibliographic information, others integrating multiple data sources to provide access to a richer set of data and navigation functionalities. Some well-known platforms are Google Scholar , DBLP and CiteSeerX . These systems are not designed to support sense-making tasks in the academic domain. On the contrary, Microsoft Academic Search provides a variety of visualizations, including co-authorship graphs, publication trends, and co-authorship paths between authors. Paperlens is another visual analytics tool that provides multiple coordinated views in order to reveal trends, support the analysis of connections, and describe activities throughout conference communities. Action Science Explorer leverages statistics, citation text extraction, natural language summarization, and network visualization to see citation patterns and identify clusters.
There is an ever increasing interest in making bibliographic data also available as Linked Open Data (LOD). The current landscape is fragmented but a lot of information is available, through SPARQL end-points. For instance, DBLP++ makes available RDF data corresponding to those collected in DBLP. The dataset does not contain any data about citations, though the quality of data about papers and authors is very high.
The JISC OpenCitation corpus provides freely available data about (more than three million) papers published in Open Access PubMed Central , including a lot of information about citations. The dataset also contains abstracts and data about authors, though these are not available for all papers. It is very well-structured and high-quality but currently not active.
SemanticWeb Dog Food contains semantic data about Semantic Web conferences and workshops. The dataset contains bibliographic records about papers and authors, including their affiliations. There are no data about abstracts, classification and citations. Since the corpus is composed of different datasets, created and uploaded separately for each conference, the overall quality is not homogeneous.
The BioTea project deserves a special mention. Its goal is to make the biomedical literature available as RDF, taking papers again from PubMed Central. The dataset is very complete. One of the peculiar aspects is that BioTea gives a lot of relevance to the content, providing abstracts for all papers and expressing in RDF some structural components such as sections, paragraphs, etc. There are no citation contexts and functions but the dataset could be easily extended in that direction.
The great amount of data available on citations and, in particular, the possibility of navigating papers through citations are powerful tools in the hand of the researchers. Researcher performs different tasks on citations according to the role they play. The researcher is first of all a reader, who reads articles and navigate them through citations. The process of finding relevant works is very common when writing new papers and project proposals: indeed, a researcher is also an author. The research community also relies on peer-review processes, which require researchers to also act as reviewers or editors. When reviewing papers, a researcher uses citations and checks, for instance, the number of self-citations or the publication year of the cited papers. Citations are also increasingly used for evaluation purposes. Researchers are then asked to be part of academic boards in charge of evaluating research products. Our analysis covers such a scenario with a specific role: evaluator. Researchers are involved in organizing scientific events, thus we added the role of event organizer.
In this section we describe some of the most common tasks that researchers perform on bibliographies when playing all these roles. There are many other tasks characterizing each of these roles but they are left out of discussion, since they are not specific on bibliographies.
summarises our analysis. The discussion uses the well-known terminology of : the term goal is used to indicate a final objective a user wishes to achieve, a task is a sequence of one or more activities the user thinks are required to achieve a goal. Each task is specific of a peculiar user role. Note also that we did not decompose each task in hierarchical subtasks, for the sake of simplicity.
| No. | Role | Goal/Task |
|---|---|---|
|
1 |
reader/author |
goal: build/update a bibliography [of recent papers] on a given topic
|
|
2 |
reviewer |
goal: evaluate if a paper is up-to-date
|
|
3 |
reviewer, editor |
goal: evaluate how much a work is self-referential
|
|
4 |
reviewer, editor |
goal: evaluate if a paper fits the scope of a journal/conference
|
|
5 |
evaluator |
goal: evaluate the impact of a paper
|
|
6 |
evaluator |
goal: evaluate the impact of a researcher
|
|
7 |
event organizer |
goal: find potential participants
|
Task 1 consists in building or updating a bibliography on a given topic. A common approach is to use keyword-based search tools, scan the list of returned papers and filter potentially relevant ones. Researchers might read abstracts to have a clearer idea of each paper. Further candidates are often searched by analysing citation networks: starting from a list of relevant papers, incoming and outgoing citations are scanned and, in turn, new candidates are analysed and, if relevant, added to the list. The criteria used to discern among papers may vary a lot: considering the total number of citations may be a suitable indicator to identify seminal papers, whereas it may fail when searching for recent developments or cutting edge works. In the second case, other criteria such as the publication date are more convenient. In all cases, the researchers have to inspect the list of citations and to manually find relevant information.
Tasks 2 is performed by researchers as reviewers. To evaluate if a paper is up-to-date, they inspect the bibliography and look at the publication year of each item. Furthermore they check if any relevant recent paper is not cited. These operations are still manual. One of the reasons is that, in almost all cases, papers under revision are PDFs and the bibliographic references cannot be processed as separate units.
The same applies to Tasks 3 and 4. The first one covers the analysis of self-citations: in fact, the reviewers/editors check how many cited papers are written by the same authors (or some of them). The editors/reviewers might also want to check the number of papers cited by a paper submitted to a journal and published in the same journal. That might be an indicator of the suitability of that paper for that journal.
The evaluation of research works (Task 5) and researchers (Task 6) is often performed by counting the incoming citations to each research work and by aggregating them for further analysis. Thus, evaluators need to easily access information about the number of times each paper is cited and to know how those citations are distributed in time. One aspect that is still under-estimated when evaluating citations is their nature. In fact, not all citations are equal: some are given just for information, some as necessary background, some refers to a work the citing paper is an extension of. It would be useful to store and be able to analyse citations together with the sentence to which they belong to (citation context), or together with information about the reason why a paper is cited (citation function). A time perspective is helpful here. For instance, we can expect that an important work is referenced for information or used as background for many years, but if it keep being extended, or some methods therein contained are used for a long time, it means it still plays an active and important role. To the best of our knowledge, none of the existing repositories of scholarly papers make such information available.
There is a further common task that researchers perform by exploring papers and citations: finding experts in a given topic or simply people who are interested in that topic. These people usually are searched among the authors of relevant papers --- that, as discussed so far, are found by exploiting citations too. Such expert finding task might be useful, for instance, when searching for potential participants to a scientific events (Task 7).
Even though existing repositories make bibliographies available as separate units, the lists of references are treated as `monolithic' units: the users can export citations and navigate to the cited/citing papers but they are not allowed to filter bibliographic references, or to show only some references, or to show detailed information about each reference.
This is first of all a problem of usability due to the lack of specific functionalities. But it also depends on the way data are structured and made available. In fact, most of the existing repositories do not offer APIs to access data (e.g. Google Scholar) or offer partial APIs that do not cover all needed aspects (e.g. ScienceDirect and Scopus).
Our approach to address these issues consists of two steps:
building a LOD on scholarly publications, that includes rich information about papers and citation networks
providing users with an intuitive interface to access, explore and make use of these data
The paper is focused on the second aspect but we need some background about the underlying data source. Thus, here we present SPAR, the set of ontologies used in our system, and the Semantic Lancet Triplestore (SLT), a SPARQL end-point build on top of SPAR and used as backend.
SPAR is a set of OWL ontologies that describe the most relevant aspects of the publishing process, with particular attention to scholarly publications . We adopted some of them in our project. FaBiO describes the core metadata associated to scholarly articles (e.g., authors, title, DOI); it is then used to create accurate and unambiguous representation of each paper.
The CiTO ontology introduces the cito:cites property to indicate that a given paper cites another one. The interesting aspect is that CiTO also defines a list of properties that specialise cito:cites and capture citation functions (for instance, cito:extends, cito:usesMethodIn, cito:disagreesWith). Thus, users can deeply characterise citations, though this still remains a difficult task, with a very low agreement among humans . The BiRO ontology (BiRO) allows users to describe bibliographic references and their compilation into reference lists. This is a key aspect for our approach: the internal organisation of the references of a paper is fully captured, so that bibliographic items can be manipulated as separate units. The C4O ontology makes it possible to capture the citation context of each citation; it also includes a mechanism for counting citations locally (within an article) or globally (by means of particular platforms). These values can be used for evaluation purposes and to measure the impact of each paper, as discussed in . More details about BiRO and C4O can be found in .
The Semantic Lancet Triplestore (SLT) is a freely available LOD dataset built on top of these ontologies . SLT includes rich data about scholarly papers, that range from a large network of citations, to semantically-enriched abstracts, from provenance data to time-aware descriptions of the articles. The current dataset describes all papers published in the Journal of Web Semantics by Elsevier, though we are working to add data about articles of other journals. SLT contains bibliographic records and full details about citations, and is used as primary data source for our application called BEX.
BEX is an interactive web-based tool aimed at supporting the analysis, exploration and sense-making process of document collections. The BEX design and the consequent user interaction are driven by Shneiderman's Information Seeking Mantra : “Overview first, zoom and filter, then details-on-demand”.
The navigation starts with three search functionalities: in addition to the classical string search on author and title, the user can also search relevant papers according to their content. This search is performed by an external service. Other services, for instance based on full-text search or other mining techniques, can be integrated with a few modifications to BEX.
We achieved good results by exploiting a service called Abstract Finder . It relies on FRED and exploits the semantic information about concepts, events, roles and named entities contained in the paper abstracts and extracted from the text with NLP techniques. Thus, through BEX a researcher can write in the search box a tentative abstract for her/his paper to retrieve meaningful papers that match with it from a pure textual but also semantic point of view, as shown in .
The results are organized as a list of papers, ordered by default from the most recent to the oldest one. Through the sorting box at the top of the interface, the user can easily define custom criterion to order the results (i.e. year, title, number of citations) and the order type. For each returned paper, BEX shows a summary of basic information and a link to the paper official page on Elsevier's ScienceDirect.
In order to gather more information about a paper in the list, the user can open a sliding box showing the full abstract and data on citations. The information about the citations is organized in two parts: outgoing and incoming.
By clicking on the "Show items" button, the user can get access to the information about the outgoing citations, as shown in the central part of . BEX organizes the cited papers in a vertical list. For each paper BEX shows (from left to right): the number of times in which the paper is referenced by the paper under examination, some general information about the paper, and a piechart summarizing the number and type of citations received from the focus paper. Moreover, abstract, citation functions and contexts are shown in popups windows.
In the incoming citation section, two counters show the number of global and internal citations received by the paper under examination. The term 'global' here indicates citations for a paper as counted by external services (Scopus); the term 'internal' indicates the citations given by papers described in our dataset (published in the Journal of Web Semantics).
Further details about the citation functions of incoming internal citations are available. As shown in , this information is presented in a popup window organized in three parts: a pie chart gives an overview of the number and type of incoming citations (top left), a column chart shows the distribution of the citation functions on a time axis (top right), and details about the citation contexts are presented in the bottom. In the two charts at the top of the page, different colors are used to encode the function of each single citation, and citations with the same function are grouped together. Finally, the last component shows, for each paper citing the paper under focus, the list of the citation contexts.
Finally, BEX provides a rich list of filtering capabilities and ordering criteria that can used to focus on different aspects of the internal citation network. The filtering functionality, for instance, allows users to filter papers by year, by author and by citation function, optionally excluding self-citations.
BEX was built to successfully carry out the tasks discussed in . For instance, let us consider Task 1, building/updating a bibliography on a specific topic. Once loaded, BEX directly shows the form to insert the topic to be analysed as a keyword list, a short description or a longer text. No further steps are required and this command is consistently available in the left sidebar. Since the candidate papers of a search are organized as a list of expandable items, users can easily read all abstracts by simply scrolling the main window. No further tab or window is opened and the reading process is direct. Note also that other services for searching relevant papers – for instance based on full-text search – can be integrated with a few modifications to BEX.
For each paper in the list, BEX also shows its bibliography in the main panel rather than in a separate tab or modal window. This is helpful to quickly check other potential candidates. The incoming citations, on the other hand, are shown in a separate window. For each of them, BEX provides authorship data, publication year, global citations and abstract. The user can then check indirect references, i.e., other potentially relevant papers, with minimal effort. Note that BEX is currently limited since only data about citations and papers of JWS are available. But this is a limitation of the dataset, not of the application. We are hard working to expand the dataset and to integrate it with other sources.
Additionally, a breadcrumb toolbar tracks all papers accessed during the navigation, so that users can overcome disorientation by rolling back to a paper already visited, and a clickable list of the authors shows details of all the papers written by each author. The possibility of navigating papers of an author and contextually reading their abstracts is also useful to complete Task 7.
Filters showing only the papers of a given author or published after a given year are particularly useful to perform Task 1-5, since the user can enable the appropriate filters and the list of citations is automatically updated. Self-citations deserve a special mention: BEX highlights them with a special icon in all lists, and not only when filtered. This information is constantly available and the users can make use of it it in all tasks.
There is a critical issue on Tasks 2-4 (review process). BEX cannot be used directly when reviewing papers submitted as PDF, as semantically-enriched data about citations are not available. On the other hand, there is lively discussion in the community about using alternative formats for submissions, for instance in RASH as proposed for the SAVE-SD workshop, that could be automatically converted in semantic data processable by BEX . Bibliographies could also be extracted from PDF sources and enhanced with semantic data through automatic conversion processes.
The most interesting aspect of BEX with regard to Tasks 5 and 6 is the availability of citation functions and contexts. These make evident the origin and the actual impact of each citation. Such data are also useful for checking if the citation function is correct, since contexts and functions in SLT were extracted by automatic tools.
We plan to integrate bookmarks functionalities so that users can keep track of relevant information while navigating. Additionally, we are investigating further searching and filtering options. The need for these additional features have been highlighted by our preliminary analysis, but we plan to perform many more structured and complete tests on BEX, and to study how the tool is used by different classes of users.
Qazvinian, V., Radev, D. (2010). Identifying Non-explicit Citing Sentences for Citation-based Summarization. In Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL 10): 555–564.
Teufel, S., Siddharthan, A., Tidhar, D. (2006). Automatic classification of citation function. In Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing (EMNLP 06): 103–110.
Peroni, S. (2014). The Semantic Publishing and Referencing Ontologies. In Semantic Web Technologies and Legal Scholarly Publishing, Law, Governance and Technology Series 15: 121–193. Springer.
Ciancarini, P., Di Iorio, A., Nuzzolese, A. Peroni, S., Vitali, F. (2014). Evaluating citation functions in CiTO: cognitive issues. In Proceedings of the 11th Extended Semantic Web Conference (ESWC 2014), LNCS 8465: 580–594. Springer.
Di Iorio, A., Nuzzolese, A. G., Peroni, S., Shotton, D., Vitali, F. (2014). Describing bibliographic references in RDF. Proceedings of 4th Workshop on Semantic Publishing (SePublica 2014). http://ceur-ws.org/Vol-1155/paper-05.pdf.
J. Preece, J., Carey, T. , Rogers, Y., Holland,S. , Sharp, H. Benyon,D. Human-Computer Interaction. Ics Series. Addison-Wesley Publishing Company, 1994.
Shotton, D. (2013). Publishing: Open citations. Nature, 502(7471): 295–297.
García-Castro, L., McLaughlin, C., García Castro, A. (2013). Biotea: RDFizing PubMed Central in support for the paper as an interface to the Web of Data. Journal of Biomedical Semantics, 5 (Suppl1): S5.
Presutti, V., Draicchio, F., Gangemi, A. (2012). Knowledge extraction based on discourse representation theory and linguistic frames. In Proceedings of the 18th International Conference on Knowledge Engineering and Knowledge Management (EKAW 2012): 114–129. Springer.
Shneiderman, B. (1996). The Eyes Have It: A Task by Data Type Taxonomy for Information Visualizations. In Proceedings of the IEEE Symposium on Visual Languages, pages 336-343,Washington. IEEE Computer Society Press, 1996.
Lee, B., Czerwinski, M., Robertson, G., Bederson, B. (2005). Understanding research trends in conferences using PaperLens. In CHI'05 extended abstracts on Human factors in computing systems (pp.1969-1972). ACM.
Dunne, C., Shneiderman, B., Gove, R., Klavans, J., Dorr, B. (2012). Rapid understanding of scientific paper collections: Integrating statistics, text analytics, and visualization. Journal of the American Society for Information Science and Technology, 63(12), 2351-2369.
Muller, K., Heath, T., Handschuh, S., Domingue, J. (2007). Recipes for Semantic Web Dog Food: the ESWC and ISWC metadata projects. In Proceedings of the 6th International Semantic Web Conference and the 2nd Asian Semantic Web Conference (ISWC’07/ASWC’07): 802–815. Berlin,Germany: Springer.
http://cs.unibo.it/save-sd/rash/
As a matter of fact, this paper was submitted in RASH, including RDFa annotations about citations.


While their representation in the professional and management ranks, compared to their share of the total workforce, lagged other groups in 2010, Latinx workers have seen greater gains. By 2029 their advancement ratios will have increased by 15 and 18 points, respectively, in those categories, although, even then, their levels will remain well below parity. Unlike African-Americans and Asians, however, Latinx are not expected to gain much ground among CEOs.
Note that the future trend for whites is based on only three years of actual previous data and may be less reliable than forecasts for other groups.


 Doloribus ex quidem maiores ullam quis, at asperiores minus ad eaque maxime possimus.
- Mission - We deliver uniqueness and quality
- Skills - Delivering fast and excellent results
- Clients - Satisfied clients thanks to our experience
our team
Vlad Ivanov
Designer
Do not seek to change what has come before. Seek to create that which has not.
Bogdan Makarov
Manager
Do not seek to change what has come before. Seek to create that which has not.
Pavel Konov
Copywriter
Do not seek to change what has come before. Seek to create that which has not.
Max Belov
SEO
Do not seek to change what has come before. Seek to create that which has not.
our services
Lorem ipsum dolor sit amet, consectetur adipisicing elit.  Doloribus ex quidem maiores ullam quis, at asperiores minus ad eaque maxime possimus cum ab iusto assumenda velit excepturi porro ipsa tenetur.
Web design
The first line of Lorem Ipsum, "Lorem ipsum dolor sit amet..", comes from a line in section 1.10.32.
Mobile apps
The first line of Lorem Ipsum, "Lorem ipsum dolor sit amet..", comes from a line in section 1.10.32.
PHOTOGRAPHY
The first line of Lorem Ipsum, "Lorem ipsum dolor sit amet..", comes from a line in section 1.10.32.
marketing
The first line of Lorem Ipsum, "Lorem ipsum dolor sit amet..", comes from a line in section 1.10.32.
some of our clients
take a look at our work
Lorem ipsum dolor sit amet, consectetur adipisicing elit.  Doloribus ex quidem maiores ullam quis, at asperiores minus ad eaque maxime possimus cum ab iusto assumenda velit excepturi porro ipsa tenetur.
our clients’ testimonials
This book is a treatise on the theory of ethics, very popular during the Renaissance. The first line of Lorem Ipsum, "Lorem ipsum dolor sit amet..", comes from a line in section 1.10.32.
Dean Martin, CEO Acme Inc.
contact us
Lorem ipsum dolor sit amet, consectetur adipisicing elit.


World Including : World Excluding : {{ territory }} ...See all selected countries {{ territory }} {{ territory }} ...See {{ territories.length - maxTerritories }} More


Class: Aws::States::Types::ExecutionListItem
| Relationships & Source Files | |
| Super Chains via Extension / Inclusion / Inheritance | |
|
Class Chain:
self,
Struct
|
|
|
Instance Chain:
self,
::Aws::Structure ,
Struct
|
|
| Inherits: |
Struct
|
| Defined in: | gems/aws-sdk-states/lib/aws-sdk-states/types.rb |
Overview
Contains details about an execution.
Constant Summary
Instance Attribute Summary
-
#execution_arn ⇒ String
rw
The Amazon
::Aws::States::Resource
Name (ARN) that identifies the execution. -
#item_count ⇒ Integer
rw
The total number of items processed in a child workflow execution.
-
#map_run_arn ⇒ String
rw
The Amazon
::Aws::States::Resource
Name (ARN) of a Map Run. -
#name ⇒ String
rw
The name of the execution.
-
#start_date ⇒ Time
rw
The date the execution started.
-
#state_machine_alias_arn ⇒ String
rw
The Amazon
::Aws::States::Resource
Name (ARN) of the state machine alias used to start an execution. -
#state_machine_arn ⇒ String
rw
The Amazon
::Aws::States::Resource
Name (ARN) of the state machine that ran the execution. -
#state_machine_version_arn ⇒ String
rw
The Amazon
::Aws::States::Resource
Name (ARN) of the state machine version associated with the execution. -
#status ⇒ String
rw
The current status of the execution.
-
#stop_date ⇒ Time
rw
If the execution already ended, the date the execution stopped.
Instance Method Summary
::Aws::Structure
- Included
| #to_hash | Alias for Aws::Structure#to_h. |
Instance Attribute Details
#execution_arn ⇒ String
(rw)
The Amazon ::Aws::States::Resource
Name (ARN) that identifies the execution.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end
#item_count ⇒ Integer
(rw)
The total number of items processed in a child workflow execution.
This field is returned only if mapRunArn
was specified in the
ListExecutions
API action. If stateMachineArn
was specified in
ListExecutions
, the itemCount
field isn't returned.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end
#map_run_arn ⇒ String
(rw)
The Amazon ::Aws::States::Resource
Name (ARN) of a Map Run. This field is returned
only if mapRunArn
was specified in the ListExecutions
API
action. If stateMachineArn
was specified in ListExecutions
, the
mapRunArn
isn't returned.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end
#name ⇒ String
(rw)
The name of the execution.
A name must not contain:
white space
brackets
< > \{ \} [ ]
wildcard characters
? *
special characters
" # % \ ^ | ~ ` $ & , ; : /
control characters (
U+0000-001F
,U+007F-009F
)
To enable logging with ::Aws::CloudWatch
Logs, the name should only contain
0-9, A-Z, a-z, - and _.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end
#start_date ⇒ Time
(rw)
The date the execution started.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end
#state_machine_alias_arn ⇒ String
(rw)
The Amazon ::Aws::States::Resource
Name (ARN) of the state machine alias used to
start an execution.
If the state machine execution was started with an unqualified ::Aws::ARN
or a version ::Aws::ARN
, it returns null.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end
#state_machine_arn ⇒ String
(rw)
The Amazon ::Aws::States::Resource
Name (ARN) of the state machine that ran the
execution.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end
#state_machine_version_arn ⇒ String
(rw)
The Amazon ::Aws::States::Resource
Name (ARN) of the state machine version
associated with the execution.
If the state machine execution was started with an unqualified ::Aws::ARN
,
it returns null.
If the execution was started using a stateMachineAliasArn
, both
the stateMachineAliasArn
and stateMachineVersionArn
parameters
contain the respective values.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end
#status ⇒ String
(rw)
The current status of the execution.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end
#stop_date ⇒ Time
(rw)
If the execution already ended, the date the execution stopped.
# File 'gems/aws-sdk-states/lib/aws-sdk-states/types.rb', line 1287
class ExecutionListItem < Struct.new( :execution_arn, :state_machine_arn, :name, :status, :start_date, :stop_date, :map_run_arn, :item_count, :state_machine_version_arn, :state_machine_alias_arn) SENSITIVE = [] include Aws::Structure end


Welcome to the Hebbia Inc. (“Hebbia”, “we”, “us”, or “our”) website located at https:/// (the “Site”). Please read these Terms of Service (the “Terms”) and our Privacy Policy (“Privacy Policy”), located at https:///privacy-policy, carefully because they govern your use of the Site and our artificial intelligence-powered productivity and research services accessible via the Site offered by us. To make these Terms easier to read, the Site, and our services are collectively called the “Services”.
 PLEASE REVIEW CAREFULLY SECTION 16 “DISPUTE RESOLUTION” BELOW FOR DETAILS REGARDING ARBITRATION.
Agreement to Terms. By using our Services, you agree to be bound by these Terms. If you don’t agree to be bound by these Terms, do not use the Services. If you are accessing and using the Services on behalf of a company (such as your employer) or other legal entity, you represent and warrant that you have the authority to bind that entity to these Terms. In that case, “you” and “your” will also refer to that entity.
Privacy Policy. Please review our Privacy Policy, which also governs your use of the Services, for information on how we collect, use and share your information.
Changes to these Terms or the Services. We may update the Terms from time to time in our sole discretion. If we do, we’ll let you know by posting the updated Terms on the Site and/or may also send other communications. It’s important that you review the Terms whenever we update them or you use the Services. If you continue to use the Services after we have posted updated Terms it means that you accept and agree to the changes. If you don’t agree to be bound by the changes, you may not use the Services anymore. Because our Services are evolving over time we may change or discontinue all or any part of the Services, at any time and without notice, at our sole discretion.
Who May Use the Services?
You may use the Services only if you are at least fourteen (14) years of age (or such other minimum age at which you can provide consent to data processing under the laws of your territory), and not otherwise barred from using the Services under applicable law.
For certain features of the Services you’ll need an account. It’s important that you provide us with accurate, complete and current account information and keep this information up to date. If you don’t, we might have to suspend or terminate your account. To protect your account, keep the account details and password confidential, and notify us right away of any unauthorized use. You’re responsible for all activities that occur under your account.
Feedback. We appreciate feedback, comments, ideas, proposals and suggestions for improvements to the Services (“Feedback”). If you choose to submit Feedback, you agree that we are free to use it without any restriction or compensation to you.
Payments and Subscriptions. Cmd-H requires payment of a fee for use of the Services (or certain portions thereof) and you agree to pay such fees. You have the option of making a one-time payment (“One-Time Payment”) or purchasing a subscription (“Subscription”), as applicable, for such use.
General. Whether you make a One-Time Payment or purchase a Subscription (each, a “Transaction”), you expressly authorize us (or our third-party payment processor) to charge you for such Transaction. We may ask you to supply additional information relevant to your Transaction, including your credit card number, the expiration date of your credit card and your email and postal addresses for billing and notification (such information, “Payment Information”). You represent and warrant that you have the legal right to use all payment method(s) represented by any such Payment Information. When you initiate a Transaction, you authorize us to provide your Payment Information to third parties so we can complete your Transaction and to charge your payment method for the type of Transaction you have selected (plus any applicable taxes and other charges). You may need to provide additional information to verify your identity before completing your Transaction (such information is included within the definition of Payment Information). By initiating a Transaction, you agree to the pricing, payment and billing policies applicable to such fees and charges, as posted or otherwise communicated to you. All payments for Transactions are non-refundable and non-transferable except as expressly provided in these Terms. All fees and applicable taxes, if any, are payable in United States dollars.
Subscriptions. If you purchase a Subscription, you will be charged the monthly or annual, as applicable, Subscription fee, plus any applicable taxes, and other charges (“Subscription Fee”), at the beginning of your Subscription and each month or year, as applicable, thereafter, at the then-current Subscription Fee.  If you purchase a Subscription, we (or our third-party payment processor) will automatically charge you each month or year, as applicable, on the anniversary of the commencement of your Subscription, using the Payment Information you have provided until you cancel your Subscription. No less than fourteen (14) days before your Subscription term ends in the case of monthly Subscriptions, or no less than thirty (30) days and no more than sixty (60) days before your Subscription term ends in the case of annual Subscriptions, or otherwise in accordance with applicable law, Cmd-H will send you a reminder with the then-current Subscription Fee. By agreeing to these Terms and electing to purchase a Subscription, you acknowledge that your Subscription has recurring payment features and you accept responsibility for all recurring payment obligations prior to cancellation of your Subscription by you or Hebbia. Your Subscription continues until cancelled by you or we terminate your access to or use of the Services or Subscription in accordance with these Terms. From time to time we may introduce new features, upgrades, or other benefits for higher membership tiers not currently offered by us under these Terms.
Cancelling Payment or Subscription. You may cancel a Transaction for a full refund within ten (10) calendar days of your initial purchase.  But if something unexpected happens in the course of completing a Transaction, we reserve the right to cancel your Transaction for any reason; if we cancel your Transaction we’ll refund any payment you have already remitted to us for such Transaction. Without limiting the foregoing, you may cancel your Subscription at any time, but please note that such cancellation will be effective at the end of the then-current Subscription period.  To cancel, you can send an email to<EMAIL_ADDRESS>You will be responsible for all Subscription Fees (plus any applicable taxes and other charges) incurred for the then-current Subscription period. If you cancel, your right to use the Services will continue until the end of your then current Subscription period and will then terminate without further charges.
Free Trials and Promotions. We may offer Subscriptions on a free trial basis (“Free Trial”) for a specified period of time or other discounts or promotions (“Promotions”) from time to time. If we offer you a Free Trial, the specific terms of your Free Trial will be provided at the time of signup and/or in the promotional materials describing the Free Trial and your use of the Free Trial is subject to your compliance with such specific terms. Free Trials may not be combined with any other offer. Except as may otherwise be provided in the specific terms for the Free Trial offer, Free Trials are only available to users who have not previously subscribed to the Services in connection with which the Free Trial is being offered. When you agree to a Free Trial, you are also agreeing to sign up for a Subscription as described above and, consequently, unless you cancel your Subscription prior to the end of your Free Trial, we (or our third party payment processor) will begin charging your payment method on a recurring basis for the Subscription Fee (plus any applicable taxes) until you cancel your Subscription. Instructions for cancelling your Subscription are stated above in Section 6(c). In the case of Promotions, any applicable sales and use taxes and services fees will be calculated based on the discounted Subscription value after the Promotion is applied. Unless otherwise stated by us in writing, only one Promotion may be used per account and cannot be combined with other Promotions or any other discounted offers. You may not sell or transfer your Promotion or create multiple accounts in order to take advantage of our Promotions. We may modify or cancel any Promotion at any time. If you violate these Terms, we reserve the right to cancel your Promotion.
Your Content.
Posting Content. Our Services (including any third party chat functions or channels offered in connection with the Services) may allow you to store or share content such as text (in posts or communications with others), files, documents, graphics, images, and software. Anything (other than Feedback) that you post or otherwise make available through the Services is referred to as “User Content”. Cmd-H does not claim any ownership rights in any User Content and nothing in these Terms will be deemed to restrict any rights that you may have to your User Content.
Permissions to Your User Content. By making any User Content available through the Services you hereby grant to Cmd-H a non-exclusive, transferable, worldwide, royalty-free license, with the right to sublicense, to use, copy, modify, create derivative works based upon, distribute, publicly display, and publicly perform your User Content in connection with operating and providing the Services and to improve the algorithms underlying the Services.
Your Responsibility for User Content. You are solely responsible for all your User Content. You represent and warrant that you have (and will have) all rights that are necessary to grant us the license rights in your User Content under these Terms. You represent and warrant that neither your User Content, nor your use and provision of your User Content to be made available through the Services, nor any use of your User Content by Cmd-H on or through the Services will infringe, misappropriate or violate a third party’s intellectual property rights, or rights of publicity or privacy, or result in the violation of any applicable law or regulation.
Removal of User Content. You can remove your User Content by specifically deleting it. You should know that in certain instances, some of your User Content (such as posts or comments you make) may not be completely removed and copies of your User Content may continue to exist on the Services. To the maximum extent permitted by law, we are not responsible or liable for the removal or deletion of (or the failure to remove or delete) any of your User Content.
Hebbia’s Intellectual Property. We may make available through the Services content that is subject to intellectual property rights. We retain all rights to that content.
General Restrictions and Hebbia’s Enforcement Rights. You agree not to do any of the following:
Use the Services to check more than one thousand (1,000) documents or five hundred thousand (500,000) words in any thirty (30) day period, or one hundred (100) documents or fifty thousand (50,000) words in any twenty-four (24) hour period;
Post, upload, publish, submit or transmit any User Content that: (i) infringes, misappropriates or violates a third party’s patent, copyright, trademark, trade secret, moral rights or other intellectual property rights, or rights of publicity or privacy; (ii) violates, or encourages any conduct that would violate, any applicable law or regulation or would give rise to civil liability; (iii) is fraudulent, false, misleading or deceptive; (iv) is defamatory, obscene, pornographic, vulgar or offensive; (v) promotes discrimination, bigotry, racism, hatred, harassment or harm against any individual or group; (vi) is violent or threatening or promotes violence or actions that are threatening to any person or entity; or (vii) promotes illegal or harmful activities or substances;
Use, display, mirror or frame the Services or any individual element within the Services, Hebbia’s name, any Cmd-H trademark, logo or other proprietary information, or the layout and design of any page or form contained on a page, without Hebbia’s express written consent;
Attempt to probe, scan or test the vulnerability of any Cmd-H system or network or breach any security or authentication measures;
Avoid, bypass, remove, deactivate, impair, descramble or otherwise circumvent any technological measure implemented by Cmd-H or any of Hebbia’s providers or any other third party (including another user) to protect the Services;
Deep-link to the Services or attempt to access or search the Services or download, scrape, copy, monitor, or record any portion of the Services or any data or content contained within or transmitted by the Services, manually or using any engine, software, tool, agent, device or mechanism (including spiders, robots, crawlers, data mining tools, automated process and/or other devices or the like), or any other method of screen scraping, other than the software and/or search agents provided by Cmd-H or other generally available third-party web browsers;
Send any unsolicited or unauthorized advertising, promotional materials, email, junk mail, spam, chain letters or other form of solicitation;
Use any meta tags or other hidden text or metadata utilizing a Hebbia trademark, logo URL or product name without Hebbia’s express written consent;
Use the Services, or any portion thereof, for any commercial purpose or for the benefit of any third party or in any manner not permitted by these Terms;
Transfer to any third party any of your rights under these Terms in any manner not permitted by these Terms;
Attempt to decipher, decompile, disassemble or reverse engineer any of the software used to provide the Services;
Interfere with, or attempt to interfere with, the access of any user, host or network, including, without limitation, sending a virus, overloading, flooding, spamming, or mail-bombing the Services;
Collect or store any personally identifiable information from the Services from other users of the Services without their express permission;
Use or access the Services in order to build a competitive product, service or solution;
Impersonate or misrepresent your affiliation with any person or entity;
Violate any applicable law or regulation; or
Encourage or enable any other individual to do any of the foregoing.
Cmd-H is not obligated to monitor access to or use of the Services or to review or edit any content. However, we have the right to do so for the purpose of operating the Services, to ensure compliance with these Terms and to comply with applicable law or other legal requirements. We reserve the right, but are not obligated, to remove or disable access to any content, including User Content, at any time and without notice, including, but not limited to, if we, at our sole discretion, consider it objectionable or in violation of these Terms. We have the right to investigate violations of these Terms or conduct that affects the Services. We may also consult and cooperate with law enforcement authorities to prosecute users who violate the law.
Links to Third Party Websites or Resources. The Services may allow you to access third-party websites or other resources. We provide access only as a convenience and are not responsible for the content, products or services on or available from those resources or links displayed on such websites. You acknowledge sole responsibility for and assume all risk arising from, your use of any third-party resources.
Termination. We may suspend or terminate your access to and use of the Services, including suspending access to or terminating your account, at our sole discretion, at any time and without notice to you. You may cancel your account at any time by sending us an email at<EMAIL_ADDRESS>Upon any termination, discontinuation or cancellation of the Services or your account, the following Sections will survive: 6(a), 6(b), 6(c) (only for payments due and owing to Cmd-H prior to the termination), 8(b), 8(c), 8(e), 9, 11, 12, 13, 14, 15, 16 and 17. Upon expiration or termination of your access to and use of the Services or your account for any reason, you shall cease any further use of the Services and shall promptly destroy all copies thereof in your possession.
Warranty Disclaimers. THE SERVICES ARE PROVIDED “AS IS,” WITHOUT WARRANTY OF ANY KIND. WITHOUT LIMITING THE FOREGOING, WE EXPLICITLY DISCLAIM ANY IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT AND NON-INFRINGEMENT, AND ANY WARRANTIES ARISING OUT OF COURSE OF DEALING OR USAGE OF TRADE. We make no warranty that the Services will meet your requirements or be available on an uninterrupted, secure, or error-free basis. We make no warranty regarding the quality, accuracy, timeliness, truthfulness, completeness or reliability of any information or content on the Services.
Indemnity. You will indemnify and hold Cmd-H and its officers, directors, employees and agents, harmless from and against any claims, disputes, demands, liabilities, damages, losses, and costs and expenses, including, without limitation, reasonable legal and accounting fees arising out of or in any way connected with (a) your access to or use of the Services, (b) your User Content, or (c) your violation of these Terms.
Limitation of Liability.

Governing Law and Forum Choice. These Terms and any action related thereto will be governed by the Federal Arbitration Act, federal arbitration law, and the laws of the State of California, without regard to its conflict of laws provisions. Except as otherwise expressly set forth in Section 16 “Dispute Resolution”, the exclusive jurisdiction for all Disputes (defined below) that you and Cmd-H are not required to arbitrate will be the state and federal courts located in Santa Clara County, California, and you and Cmd-H each waive any objection to jurisdiction and venue in such courts.
Dispute Resolution.
Mandatory Arbitration of Disputes. We each agree that any dispute, claim or controversy arising out of or relating to these Terms or the breach, termination, enforcement, interpretation or validity thereof or the use of the Services (collectively, “Disputes”) will be resolved solely by binding, individual arbitration and not in a class, representative or consolidated action or proceeding. You and Cmd-H agree that the U.S. Federal Arbitration Act governs the interpretation and enforcement of these Terms, and that you and Cmd-H are each waiving the right to a trial by jury or to participate in a class action. This arbitration provision shall survive termination of these Terms.
Exceptions. As limited exceptions to Section 16(a) above: (i) we both may seek to resolve a Dispute in small claims court if it qualifies; and (ii) we each retain the right to seek injunctive or other equitable relief from a court to prevent (or enjoin) the infringement or misappropriation of our intellectual property rights.
Conducting Arbitration and Arbitration Rules. The arbitration will be conducted by the American Arbitration Association (“AAA”) under its Consumer Arbitration Rules (the “AAA Rules”) then in effect, except as modified by these Terms. The AAA Rules are available at www.adr.org or by calling 1-800-778-7879. A party who wishes to start arbitration must submit a written Demand for Arbitration to AAA and give notice to the other party as specified in the AAA Rules. The AAA provides a form Demand for Arbitration at www.adr.org.
Any arbitration hearings will take place in the county (or parish) where you live, unless we both agree to a different location. The parties agree that the arbitrator shall have exclusive authority to decide all issues relating to the interpretation, applicability, enforceability and scope of this arbitration agreement.
Arbitration Costs. Payment of all filing, administration and arbitrator fees will be governed by the AAA Rules, and we won’t seek to recover the administration and arbitrator fees we are responsible for paying, unless the arbitrator finds your Dispute frivolous. If we prevail in arbitration we’ll pay all of our attorneys’ fees and costs and won’t seek to recover them from you. If you prevail in arbitration you will be entitled to an award of attorneys’ fees and expenses to the extent provided under applicable law.
Injunctive and Declaratory Relief. Except as provided in Section 16(b) above, the arbitrator shall determine all issues of liability on the merits of any claim asserted by either party and may award declaratory or injunctive relief only in favor of the individual party seeking relief and only to the extent necessary to provide relief warranted by that party’s individual claim. To the extent that you or we prevail on a claim and seek public injunctive relief (that is, injunctive relief that has the primary purpose and effect of prohibiting unlawful acts that threaten future injury to the public), the entitlement to and extent of such relief must be litigated in a civil court of competent jurisdiction and not in arbitration. The parties agree that litigation of any issues of public injunctive relief shall be stayed pending the outcome of the merits of any individual claims in arbitration.
Class Action Waiver. YOU AND HEBBIA AGREE THAT EACH MAY BRING CLAIMS AGAINST THE OTHER ONLY IN YOUR OR ITS INDIVIDUAL CAPACITY, AND NOT AS A PLAINTIFF OR CLASS MEMBER IN ANY PURPORTED CLASS OR REPRESENTATIVE PROCEEDING. Further, if the parties’ Dispute is resolved through arbitration, the arbitrator may not consolidate another person’s claims with your claims, and may not otherwise preside over any form of a representative or class proceeding. If this specific provision is found to be unenforceable, then the entirety of this Dispute Resolution section shall be null and void.
Severability. With the exception of any of the provisions in Section 16(f) of these Terms (“Class Action Waiver”), if an arbitrator or court of competent jurisdiction decides that any part of these Terms is invalid or unenforceable, the other parts of these Terms will still apply.
General Terms.
Reservation of Rights. Cmd-H and its licensors exclusively own all right, title and interest in and to the Services, including all associated intellectual property rights. You acknowledge that the Services are protected by copyright, trademark, and other laws of the United States and foreign countries. You agree not to remove, alter or obscure any copyright, trademark, service mark or other proprietary rights notices incorporated in or accompanying the Services.
Entire Agreement. These Terms constitute the entire and exclusive understanding and agreement between Cmd-H and you regarding the Services, and these Terms supersede and replace all prior oral or written understandings or agreements between Cmd-H and you regarding the Services. If any provision of these Terms is held invalid or unenforceable by an arbitrator or a court of competent jurisdiction, that provision will be enforced to the maximum extent permissible and the other provisions of these Terms will remain in full force and effect. You may not assign or transfer these Terms, by operation of law or otherwise, without Hebbia’s prior written consent. Any attempt by you to assign or transfer these Terms, without such consent, will be null. Cmd-H may freely assign or transfer these Terms without restriction. Subject to the foregoing, these Terms will bind and inure to the benefit of the parties, their successors and permitted assigns.
Notices. Any notices or other communications provided by Cmd-H under these Terms will be given: (i) via email; or (ii) by posting to the Services. For notices made by email, the date of receipt will be deemed the date on which such notice is transmitted.
Waiver of Rights. Hebbia’s failure to enforce any right or provision of these Terms will not be considered a waiver of such right or provision. The waiver of any such right or provision will be effective only if in writing and signed by a duly authorized representative of Hebbia. Except as expressly set forth in these Terms, the exercise by either party of any of its remedies under these Terms will be without prejudice to its other remedies under these Terms or otherwise.
Export Control. You will not export or re-export, either directly or indirectly, the Services or any technical data, software, process, product, service, or system obtained from the Services, without first complying with the United States and all other applicable government laws and regulations governing the export, re-export, and import of those items.
Contact Information. If you have any questions about these Terms or the Services, please contact Cmd-H at<EMAIL_ADDRESS>California residents may reach the Complaint Assistance Unit of the Division of Consumer Services of the California Department of Consumer Affairs by mail at 1625 North Market Blvd., Sacramento, CA 95834, or by telephone at<PHONE_NUMBER> or<PHONE_NUMBER>.


[gecode-users] Number of branches/choices
Christian Schulte
cschulte at kth.se
Tue Oct 23 16:50:19 CEST 2012
Hi,
So we could say that every edge (corresponding to an alternative) in the
search tree is a decision made during search (even though the branching in
the parent node defines all alternatives directly below).
Then, if we are talking binary branchings only, we all know that the number
of edges #e is the number of nodes #n minus 1. The total number of nodes #n
is the number of nodes reported plus the number of solutions and failures.
Voila!
Cheers
Christian
--
Christian Schulte, www.ict.kth.se/~cschulte/
-----Original Message-----
From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf
Of Max Ostrowski
Sent: Tuesday, October 23, 2012 1:31 PM
To: users at gecode.org
Subject: [gecode-users] Number of branches/choices
Hi,
i want to compare some statistics,
and want to find out how many choices (non-deterministic decisions) gecode
has made during branching.
(So, not talking about non-deterministic propagation, just simple
select/propagate).
The statistic object
dfsSearchEngine_->statistics().node
tells me something about the used nodes, but this not seem to be the right
thing to use.
So, for a simple CSP, with variable x = 0..9 without any constraint, i get
19 nodes (enumerating all solutions).
Can i simply divide this by 2 to get my 9 decisions?
Best,
Max
_______________________________________________
Gecode users mailing list
users at gecode.org
https://www.gecode.org/mailman/listinfo/gecode-users
More information about the users
mailing list


DirectoryIterator
Iterator capable of reading images from a directory on disk.
Inherits From: Iterator
tf.compat.v1.keras.preprocessing.image.DirectoryIterator
tf.compat.v2.keras.preprocessing.image.DirectoryIterator
directory
: Path to the directory to read images from.
Each subdirectory in this directory will be
considered to contain images from one class,
or alternatively you could specify class subdirectories
via the classes
argument.image_data_generator
: Instance of ImageDataGenerator
to use for random transformations and normalization.target_size
: tuple of integers, dimensions to resize input images to.color_mode
: One of "rgb"
, "rgba"
, "grayscale"
.
Color mode to read images.classes
: Optional list of strings, names of subdirectories
containing images from each class (e.g. ["dogs", "cats"]
).
It will be computed automatically if not set.class_mode
: Mode for yielding the targets:
"binary"
: binary targets (if there are only two classes),
"categorical"
: categorical targets,
"sparse"
: integer targets,
"input"
: targets are images identical to input images (mainly
used to work with autoencoders),
None
: no targets get yielded (only input images are yielded).batch_size
: Integer, size of a batch.shuffle
: Boolean, whether to shuffle the data between epochs.seed
: Random seed for data shuffling.data_format
: String, one of channels_first
, channels_last
.save_to_dir
: Optional directory where to save the pictures
being yielded, in a viewable format. This is useful
for visualizing the random transformations being
applied, for debugging purposes.save_prefix
: String prefix to use for saving sample
images (if save_to_dir
is set).save_format
: Format to use for saving sample images
(if save_to_dir
is set).subset
: Subset of data ("training"
or "validation"
) if
validation_split is set in ImageDataGenerator.interpolation
: Interpolation method used to resample the image if the
target size is different from that of the loaded image.
Supported methods are "nearest", "bilinear", and "bicubic".
If PIL version 1.1.3 or newer is installed, "lanczos" is also
supported. If PIL version 3.4.0 or newer is installed, "box" and
"hamming" are also supported. By default, "nearest" is used.dtype
: Dtype to use for generated arrays.__init__
__init__( directory, image_data_generator, target_size=(256, 256), color_mode='rgb', classes=None, class_mode='categorical', batch_size=32, shuffle=True, seed=None, data_format=None, save_to_dir=None, save_prefix='', save_format='png', follow_links=False, subset=None, interpolation='nearest', dtype=None )
Initialize self. See help(type(self)) for accurate signature.
filepaths
List of absolute paths to image files
labels
Class labels of every observation
sample_weight
__getitem__
__getitem__(idx)
Gets batch at position index
.
index
: position of the batch in the Sequence.A batch
__iter__
__iter__()
Create a generator that iterate over the Sequence.
__len__
__len__()
Number of batch in the Sequence.
The number of batches in the Sequence.
next
next()
For python 2.x.
The next batch.
on_epoch_end
on_epoch_end()
Method called at the end of every epoch.
reset
reset()
set_processing_attrs
set_processing_attrs( image_data_generator, target_size, color_mode, data_format, save_to_dir, save_prefix, save_format, subset, interpolation )
Sets attributes to use later for processing files into a batch.
image_data_generator: Instance of `ImageDataGenerator` to use for random transformations and normalization. target_size: tuple of integers, dimensions to resize input images to. color_mode: One of `"rgb"`, `"rgba"`, `"grayscale"`. Color mode to read images. data_format: String, one of `channels_first`, `channels_last`. save_to_dir: Optional directory where to save the pictures being yielded, in a viewable format. This is useful for visualizing the random transformations being applied, for debugging purposes. save_prefix: String prefix to use for saving sample images (if `save_to_dir` is set). save_format: Format to use for saving sample images (if `save_to_dir` is set). subset: Subset of data (`"training"` or `"validation"`) if validation_split is set in ImageDataGenerator. interpolation: Interpolation method used to resample the image if the target size is different from that of the loaded image. Supported methods are "nearest", "bilinear", and "bicubic". If PIL version 1.1.3 or newer is installed, "lanczos" is also supported. If PIL version 3.4.0 or newer is installed, "box" and "hamming" are also supported. By default, "nearest" is used.


The commands provided in this section will try to create a stream from
an external source.
Once the stream has been successfully created it is assigned a “local stream name” which can be used
to access the stream from the EMS.


Rangers star Alfredo Morelos earns Europa League recognition as striker storms up UEFA Power Rankings
The Ibrox striker netted his eleventh goal in Europe this season as he opened the scoring against Porto.
by Chris Doyle, https://www.dailyrecord.co.uk/authors/chris-doyle/Rangers striker Alfredo Morelos is among one of the best performers in the Europa League according to the tournament's latest ratings.
The Colombian's opening goal against Porto in his side's 2-0 win meant his tally is now at eleven for goals in Europe this season.
And that impressive return has meant he's stormed up the competition's official power rankings that assesses players' performances after every match-day.
Morelos is currently at the number eight position with Sevilla forward Munir topping the charts thanks to a hattrick against Dudelange. Lazio's Sergej Milinkovic-Savic and Eintracht Frankfurt midfielder Filip Kostic make up the top three.
Morelos' smart finish and assist for Steven Davis to double Rangers' lead proved how influential he is for Steven Gerrard's side.
But other Ibrox stars have also received recognition for a brilliant Europa League campaign so far as the Light Blues are tied at the top of Group G.
Borna Barisic was a constant threat down the left hand side and is ranked at number 22.
James Tavernier is also listed as the second highest Englishman in the competition in between Manchester United duo Marcus Rashford and Harry Maguire.


Erector - Release Notes
0.7.1
- externals mechanism
- Page widget
- FieldTable widget
- EnvironmentBadge widget - inspired by http://blog.labnotes.org/2009/10/08/using-a-badge-to-distinguish-development-and-production-environments
- added ‘jquery’ method to perform a script on $(document).ready
- removed the "alias_method :inspect, :to_s" since it made debugging inside widget constructors hard, and what was it for anyway?
- Instance variables may begin with a ’@’
- Fixed Rails integration regressions
- Added *.ert templates (Erector Template, similar to Markaby)
0.7.0 / 2009-09-27
- Changed behavior of inline blocks. See Widget#new documentation.
- Introduced "Erector::Inline" and "Erector.inline" so people using the old inline semantics can upgrade more easily.
- Likewise for "Erector::InlineRailsWidget" and "Erector::RailsWidget.inline".
- Due to popular demand, parameters no longer automatically create accessor methods, even if you declare them with ‘needs’. You’ll have to type out "attr_accessor :underpants" yourself.
0.6.8 / 2009-09
- Added missing tag ‘embed’
0.6.7 / 2009-06-17
- Fixed bug where needs did not get propagated when including modules.
0.6.6 / 2009-05-25
- fix to_a bug that slipped in yesterday when I wasn’t looking
- attempting to assign a local variable that overlaps with an internal one raises error
- attempting to ‘needs’ a variable that overlaps with an existing method raises error
0.6.4 / 2009-05-24
- mixin: do "include Erector::Mixin" and now "erector { }" will instantiate and to_s a widget for you
- "erector" command-line tool improved:
- if converting an HTML/ERB file under a "views" directory, uses "Erector::RailsWidget" as parent class
- no longer chokes on "if IE" directives
- changes ‘yield’ in a scriptlet to use a missing "@content_for_layout"
- escapes single quotes inside text strings
- requires treetop 1.2.5
- documentation overhaul, web site arguably prettier
0.6.3 / 2009-05-06
- Major update to API. You will have to change your code. There are deprecation warnings/errors
and there should be an upgrade guide up on the website soon.
- ‘render’ renamed to ‘content’
- widget constructor only takes one parameter, an ‘assigns’ hash (plus the optional default block)
- to render one widget from inside another, use the ‘widget’ method (not ‘render_to’). This method
accepts either a widget instance, or a widget class and an assigns hash.
- ‘needs’ macro to declare the variables your widget accepts via the ‘assigns’ constructor parameter
- Removed Widget#to_s caching, which fixed indentation issues.
- BUGFIX: Indentation level is now correctly propagated to nested widgets.
- Erector’s Rails support strategy has changed. The released version of Erector only supports the latest stable
Rails version (currently 2.3.2). If you need support for earlier versions of Rails, there are separate Git branches for each one, but we will not be in the habit of keeping these up to date with the latest features and patches.
- Renamed the command line tool to ‘erector’
0.5.1
- Added methods to easily render additional HTML elements (col, object, and about a dozen others). There are now methods for all non-deprecated elements from the HTML 4.0.1 spec. As before, if erector doesn’t have a method built-in, you can still call the element or empty_element method to output any tag.
- The method instruct!, which was a deprecated synonym for instruct, has been removed.
- Fixed bug in resolving view files for pluralized controllers
0.5.0 / 2008-12-13
- install_dependencies refreshes the rails_versions directory
- Widget takes a string instead of an IO object to be more compatible with Rails.
- Removed Doc
- Widget writes directly to output string instead of to #doc
0.4.200 / 2008-10-11
- Erector can now pretty-print the generated HTML to make it easier to read.
- Add join method to Erector::Widget.
0.4.191 / 2008-07-29
- Renamed HtmlParts to Doc
- Widget#doc is now a HtmlParts which proxies to the passed in IO stream
- Better compatibility with standard Rails rendering because ActionController::Base#render and #render_widget now have the Widget write directly to _erbout.
- ActionView::Base objects run with Erector now receive all of the instance variables
- Erector works with erb layouts
- Deprecate fake_erbout
- Better handling for file with .html.rb extension.
- Fix overwriting issue when using Rails helpers
- New method Widget#character
- Widget#nbsp without arguments now outputs a single non-breaking space.
0.3.110 / 2008-05-29
- support capture from rails helpers, allowing form_for/form_tag to work right
- fix bug in view_paths support (finding views was hosed)
0.3.105 / 2008-05-29
- Lots of changes to support Rails integration better.
- Add partial support for render :partial.
- More Rails helpers proxies added to helpers.rb.
- Fake erbouts can now nest, allowing better support for Rails helpers like form_for (though they’re currently capped at 10 deep to head off infinite regress).
- Rails finds both .rb and .html.rb files inside the app/views directories.
- Use Rails view_paths instead of hardcoded RAILS_ROOT/app/views (patch by Rami Grossman)
- add ‘url’ and ‘css’ convenience methods to Widget
0.2.83 / 2008-04-23
- "erect" supports command-line options
- "erect" now works backwards — you can output static html from a widget.rb file
- The web site is generated from erector classes (still pretty minimal though)
0.2.61 / 2008-04-18
- Improvements to "erect"
- works on HTML attributes (including namespaced attributes and hyphenated attributes)
- works on directories (recursively looking for .html and .html.erb and .rhtml files)
- converts DOCTYPE nodes
- deals with HTML entities inside text and attributes
0.2.54 / 2008-04-15
- New script "erect" to convert (some) .html.erb files into erector classes.
0.2.42 / 2008-04-11
- Rails Controller now can render Erector widgets using #render
- Erector views can live inside Rails "app/views" directory, just like other views
0.1.25 / 2008-02-26
- nbsp method
- :class => [‘one’, ‘two’] (that is, passing an array rather than a string)
… perhaps one or two I forgot.
- rename tag to element
- add empty_element feature
- for the built-in HTML tags, knows which ones should be empty and which shouldn’t be. For example, generates `<input />` rather than `<input></input>`
- text and attributes are quoted by default; call raw to avoid this
- h is rarely necessary now, but it returns a string rather than appending to the buffer
- nbsp method turns spaces into non-breaking spaces
- sending in an array for attribute values (typically CSS classes) concatenates them separated by spaces
- The column definition name can be a Proc that gets executed.
- Renamed instruct! to instruct (old one remains as a deprecated method for now), as it is no more side-effecting (or dangerous or whatever) than any other method in Widget.
0.1.0 / 2008-02-13
- First public release
0.0.1
- Was on pivotalrb.rubyforge.org


This webapp exists to make it easy for new users to try the StringTemplate language. The JSON code provides the data model with which the template is populated; try changing both and then press the "Process template" button to see the result. See the cheat sheet for instructions on how to use StringTemplate.
Rendered Template |