A2P(1) Perl Programmers Reference Guide A2P(1) NAME a2p - Awk to Perl translator SYNOPSIS a2p [options] [filename] DESCRIPTION A2p takes an awk script specified on the command line (or from standard input) and produces a comparable perl script on the standard output. OPTIONS Options include: -D<number> sets debugging flags. -F<character> tells a2p that this awk script is always invoked with this -F switch. -n<fieldlist> specifies the names of the input fields if input does not have to be split into an array. If you were translating an awk script that processes the password file, you might say: a2p -7 -nlogin.password.uid.gid.gcos.shell.home Any delimiter can be used to separate the field names. -<number> causes a2p to assume that input will always have that many fields. -o tells a2p to use old awk behavior. The only current differences are: · Old awk always has a line loop, even if there are no line actions, whereas new awk does not. · In old awk, sprintf is extremely greedy about its arguments. For example, given the statement print sprintf(some_args), extra_args; old awk considers extra_args to be arguments to "sprintf"; new awk considers them arguments to "print". "Considerations" A2p cannot do as good a job translating as a human would, but it usually does pretty well. There are some areas where you may want to examine the perl script produced and tweak it some. Here are some of them, in no particular order. There is an awk idiom of putting int() around a string expression to force numeric interpretation, even though the argument is always integer anyway. This is generally unneeded in perl, but a2p can't tell if the argument is always going to be integer, so it leaves it in. You may wish to remove it. Perl differentiates numeric comparison from string comparison. Awk has one operator for both that decides at run time which comparison to do. A2p does not try to do a complete job of awk emulation at this point. Instead it guesses which one you want. It's almost always right, but it can be spoofed. All such guesses are marked with the comment ""#???"". You should go through and check them. You might want to run at least once with the -w switch to perl, which will warn you if you use == where you should have used eq. Perl does not attempt to emulate the behavior of awk in which nonexistent array elements spring into existence simply by being referenced. If somehow you are relying on this mechanism to create null entries for a subsequent for...in, they won't be there in perl. If a2p makes a split line that assigns to a list of variables that looks like (Fld1, Fld2, Fld3...) you may want to rerun a2p using the -n option mentioned above. This will let you name the fields throughout the script. If it splits to an array instead, the script is probably referring to the number of fields somewhere. The exit statement in awk doesn't necessarily exit; it goes to the END block if there is one. Awk scripts that do contortions within the END block to bypass the block under such circumstances can be simplified by removing the conditional in the END block and just exiting directly from the perl script. Perl has two kinds of array, numerically-indexed and associative. Perl associative arrays are called "hashes". Awk arrays are usually translated to hashes, but if you happen to know that the index is always going to be numeric you could change the {...} to [...]. Iteration over a hash is done using the keys() function, but iteration over an array is NOT. You might need to modify any loop that iterates over such an array. Awk starts by assuming OFMT has the value %.6g. Perl starts by assuming its equivalent, $#, to have the value %.20g. You'll want to set $# explicitly if you use the default value of OFMT. Near the top of the line loop will be the split operation that is implicit in the awk script. There are times when you can move this down past some conditionals that test the entire record so that the split is not done as often. For aesthetic reasons you may wish to change index variables from being 1-based (awk style) to 0-based (Perl style). Be sure to change all operations the variable is involved in to match. Cute comments that say "# Here is a workaround because awk is dumb" are passed through unmodified. Awk scripts are often embedded in a shell script that pipes stuff into and out of awk. Often the shell script wrapper can be incorporated into the perl script, since perl can start up pipes into and out of itself, and can do other things that awk can't do by itself. Scripts that refer to the special variables RSTART and RLENGTH can often be simplified by referring to the variables $`, $& and $', as long as they are within the scope of the pattern match that sets them. The produced perl script may have subroutines defined to deal with awk's semantics regarding getline and print. Since a2p usually picks correctness over efficiency. it is almost always possible to rewrite such code to be more efficient by discarding the semantic sugar. For efficiency, you may wish to remove the keyword from any return statement that is the last statement executed in a subroutine. A2p catches the most common case, but doesn't analyze embedded blocks for subtler cases. ARGV[0] translates to $ARGV0, but ARGV[n] translates to $ARGV[$n-1]. A loop that tries to iterate over ARGV[0] won't find it. ENVIRONMENT A2p uses no environment variables. AUTHOR Larry Wall<EMAIL_ADDRESS>FILES SEE ALSO perl The perl compiler/interpreter s2p sed to perl translator DIAGNOSTICS BUGS It would be possible to emulate awk's behavior in selecting string versus numeric operations at run time by inspection of the operands, but it would be gross and inefficient. Besides, a2p almost always guesses right. Storage for the awk syntax tree is currently static, and can run out. perl v5.14.2 2010-12-30 A2P(1)


| Loading... |
This page lists all projects from the GitHub ZopeFoundation organization, and shows the latest version published on the Python Package Index and the explicitly declared supported Python versions from trove classifiers for that version.
The data are updated daily by a cron script.


Prince Andrew's decision to stand down from royal duties leads Thursday's headlines
The Duke of York’s decision to step down from royal duties fills the nation’s papers on Thursday’s.
The Times headline says Andrew “stands down after crisis talks with Queen”, the Daily Mail casts the duke as an “Outcast”, and the Daily Mirror leads with the headline “I’m sorry mummy”.
- Prince Andrew stepping back from public duties amid Jeffrey Epstein scandal
- Epstein victims' lawyer urges Duke to 'cooperate' with US authorities
- Why Prince Andrew will be out of the public eye for some time
Sorry, this content isn't available on your device.
Sorry, this content isn't available on your device.
Sorry, this content isn't available on your device.
Andrew was “shamed into stepping down” from his duties, the Daily Express says, with the i claiming there is a “Crisis at the palace”.
Sorry, this content isn't available on your device.
Sorry, this content isn't available on your device.
The Daily Telegraph also reports on the duke’s departure from public life, and covers an election pledge by Prime Minister Boris Johnson that the elderly will not have to sell their homes to pay for social care.
Sorry, this content isn't available on your device.
Meanwhile, Labour has promised £75 billion to tackle the “UK housing crisis”if elected, according to The Guardian.
Sorry, this content isn't available on your device.
The US ambassador to the EU, Gordon Sondland, has testified he followed orders from US President Donald Trump “on Ukraine quid pro quo”, the Financial Times reports.
- A devastating day for the president and his defenders
- 'I want nothing from Ukraine' insists Trump nine times amid impeachment hearings
Sorry, this content isn't available on your device.
The Independent continues its reporting on the deaths of babies and mothers in the care of Shrewsbury and Telford Hospital Trust, saying hundreds of families are still “in dark” over the situation.
Sorry, this content isn't available on your device.
And the Daily Star decries a “Scrooge ban on Xmas Crackers” by “Barmy business bosses” who want to do away with excess waste.
Sorry, this content isn't available on your device.


A Raw layer is a traditional GIS data layer - a set of geo-referenced geometry without any higher-level knowledge of the what the geometry represents. This is useful for types of abstract data which do not have a real existence in the world, such as administrative borders, general reference points, and so on.
The layers are called "Raw" because in the VTP philosphy, they are temporary raw data, before being converted or "cooked" into more meaningful information. For example, 2D point data which represents the location of trees, is cooked from points (a Raw layer) into actual trees (a Vegetation layer).


DEAR CEO Let me first apologise to you as regards to little embarrassment this my letterof proposal might cause you. In accordance to this, I received your contact e-mail through Internet display when I was in need for honest and transparentforeign partner, who can provide me an assistance to transfer this sum of forty million United States dollars to From: prince ige his account for joint onwardestablishment in his country through his wholesome assistance. Since I have decided to live and run my establishment in your country. I am prince yusuf ige, the only Son of the late former attorney general and minister of Justice of the Federation Chief. Bola Ige who was shot to death as a result of ethnic crisis here in Nigeria which the matter still under investigation. After the death of my late father, Chief Bola Ige his burial was performed and was given a nice befitting burial ceremony that made some important leaders/attorney generals in other African countries to came to our family and past condolence visiting as avaledictories possession thank God the predecessors went back to their various countries safely. It may interest you to know how the above fund was recovered, in my late father security under-ground vault where he saved some vital documents in my favour and deposited the fund in Overseas Security Company for safekeeping. Since the deposited fund in overseas was willed in my favour I therefore humbly request for your kind wholesome assistance to assist me accommodate the above mentioned fund to your country account for onward joint establishment. You may however, notice that the US 40million dollars was recovered during when my late father was minister of power /Steel and minister of Justice for the federation based on some contracts he signed in favour of foreign companies that executed contracts here in Nigeria that worth millions of US dollars and returns were given to him as benefits before the wicked fellow shot my late father to death. God is going to reward them according to their evil acts. In addition to this, I shall be oblige to detail you more information as regards to your kind and quick response on dispatch of the mail by sending to me your letter of acceptance and your personal phone and fax number for us to expedite action and discuss how to meet at the security company in Overseas and move the above mentioned fund to your vital account and plan for onward joint establishment in your country. I hereby assured you also that this business stand 100% risk free hence the above said fund was willed to me from my late father Chief Bola Ige. Thank you as I hope receiving your quick response for us to expedite action. Best regard PRINCE YUSUF IGE -_-_-_ Free Email Service! No Hidden Charges! Click Below to Sign Up -_-_- This mail sent through http://mail3000.com/register.html


public class Transposer<T extends Vertex,U extends Vertex>
extends java.lang.Object
| Constructor and Description |
|---|
Transposer(AbstractGraph<T> graph,
VertexFactory<U> vertexFactory,
GraphFactory<U> graphFactory)
Creates a transpose graph, which can be retrieved as needed through the
getTransposeGraph() method, and a HashMap from the vertices of the original
graph to the corresponding vertices of the transpose graph.
|
| Modifier and Type | Method and Description |
|---|---|
AbstractGraph<U> |
getTransposeGraph()
Returns the transpose of the original graph
|
java.util.Map<T,U> |
getVertexMap()
Returns a mapping in which the keys are the vertices of the original graph
and the values are the corresponding vertices in the transpose graph.
|
public Transposer(AbstractGraph<T> graph, VertexFactory<U> vertexFactory, GraphFactory<U> graphFactory)
graph
- graph for which the transpose is to be created.vertexFactory
- factory method used to create vertices in the transpose
graphpublic java.util.Map<T,U> getVertexMap()
public AbstractGraph<U> getTransposeGraph()


Create an Account
Login
×
Enter a valid username
Enter a valid password
Gender
Male
Female
RememberMe


GET UPDATES ON OFFERS AND MORE INFO ABOUT SENDIT
About SendIT
FAQ
About Us
Our Policy
Terms & Conditions
Copyright © SendIT. All rights reserved


Works A
Loading data from ORCiD...
Works B
Sample loader
Included here to show the loader animation styling.
Loading data from ORCiD...
Not really, this is here to show the loader. The two divs above should load the ORCiD data


You need to enable JavaScript to run this app.
00:00:00 am
Someday, Month 00, 0000
News
article
edit
emoji_emotions
palette
Loading...
Loading...
Loading...
Loading...


This directory contains example files that illustrate the use of GenOpt in conjunction with the Modelica modeling and simulation environment Dymola. To run the example files, a license of Dymola is required, which may be obtained from Dynasim.
Prior to running the optimization, you may have to start
Dymola, open the file ObjectiveFunction.mo
translate and simulate
the model. This should generate the files
dymosim.exe
(or dymosim
on Linux),
dsin.txt
and other
files that are not needed to run the example.
The model needs to be simulated once, as this adds the final time
of the simulation (which is stored in ObjectiveFunction.mo
) to the
file dsin.txt
.
The files dymosim.exe
(or dymosim
on Linux)
and dsin.txt
need
to be in the same directory as the file
ObjectiveFunction.mo
. If they are written to a different directory,
then you will need to change the working directory of Dymola.
This may be done from the Dymola simulation window by typing
cd("path");
where path
need to be replaced
by the name of the path that contains the file ObjectiveFunction.mo
.
To learn how to run the optimization, see the GenOpt manual and the GenOpt readme file.
During the optimization, GenOpt will use the template file
modelicaScheduleTemplate.txt
to write the file
modelicaSchedule.txt
.
This file contains the values of the independent parameters and will
be read by dymosim.exe
during the simulation.
At the end of the simulation,
GenOpt will scan the file dslog.txt
for
possible errors that may have occurred during the simulation.
If there were no errors, GenOpt will read the file
result.txt
to obtain the objective function value.
This file has been written by dymosim.exe
.
If the file dslog.txt
contains error messages,
then GenOpt will stop.
The optimization finds a control sequence that minimizes the squared difference between measured temperature and setpoint temperature for the model shown below:
The optimized control sequence looks as follows:
This control sequence yields the temperature trajectory labeled "optimized" in the figure below. The figure also shows the outside temperature, the temperature trajectory that corresponds to the initial non-optimized control input (labeled "initial setting") and the temperature setpoint.
For further information, please consult the GenOpt manual and the Dymola manual.


CURLOPT_NETRC explained
NAME
CURLOPT_NETRC - request that .netrc is used
SYNOPSIS
#include <curl/curl.h>
CURLcode curl_easy_setopt(CURL *handle, CURLOPT_NETRC, long level);
DESCRIPTION
This parameter controls the preference level of libcurl between using user names and passwords from your ~/.netrc file, relative to user names and passwords in the URL supplied with CURLOPT_URL. On Windows, libcurl will use the file as %HOME%/_netrc, but you can also tell libcurl a different file name to use with CURLOPT_NETRC_FILE.
libcurl uses a user name (and supplied or prompted password) supplied with CURLOPT_USERPWD or CURLOPT_USERNAME in preference to any of the options controlled by this parameter.
Only machine name, user name and password are taken into account (init macros and similar things aren't supported).
libcurl does not verify that the file has the correct properties set (as the standard Unix ftp client does). It should only be readable by user.
level should be set to one of the values described below.
The use of your ~/.netrc file is optional, and information in the URL is to be preferred. The file will be scanned for the host and user name (to find the password only) or for the host only, to find the first user name and password after that machine, which ever information is not specified in the URL.
Undefined values of the option will have this effect.
The library will ignore the file and use only the information in the URL.
This is the default.
This value tells the library that use of the file is required, to ignore the information in the URL, and to search the file for the host only.
DEFAULT
PROTOCOLS
EXAMPLE
CURL *curl = curl_easy_init(); if(curl) { CURLcode ret; curl_easy_setopt(curl, CURLOPT_URL, "ftp://example.com/"); curl_easy_setopt(curl, CURLOPT_NETRC, CURL_NETRC_OPTIONAL); ret = curl_easy_perform(curl); }
AVAILABILITY
RETURN VALUE
Returns CURLE_OK
SEE ALSO
CURLOPT_USERPWD, CURLOPT_USERNAME, CURLOPT_NETRC_FILE
This HTML page was made with roffit.


Click thumbnails to view larger photos. This is not perfect, because when we move an element in the DOM, we really move it -- it no longer exists in the place where it is in the HTML file. In other words, once you have clicked a thumbnail image one time, the big photo is moved to a new location. When you click another thumbnail image, that big photo is removed from the DOM. Study the JavaScript until this is clear to you. Then view version 1, which fixes the problem.


10% of kids don’t get the meals they deserve.
Get your fill with LunchLine.
 Done in less than 15 minutes on any device.

Save time & convenience! Enter information once, and adjust as needed next year without redoing everything.
Applications for the 2016–2017 school year must be submitted by October 1st, 2016.
Eligibility is based on a number of factors including income and participation in assistance programs. You can learn more about eligibility here.
Most necessary information you will know, but there are a couple numbers you might need to look up. Start now and come back later. We save all your answers.


Trackers >
{{.ID}}
LOGOUT
Tournaments
Players
Decks
Standings
{{range .Properties}}
{{.Label}}: {{.Value}}
{{end}}
BACK


| title |
no |
text |
The title |
| withBackButton |
no |
- |
Usage: 'withBackButton' as a property on the element. Consume the backButtonClicked event in a parent component, e.g. (backButtonClicked)="doSomething($event)" |
| withRightButton |
no |
- |
Usage: 'withRightButton' as a property on the element. Consume the rightButtonClicked event in a parent component, e.g. (rightButtonClicked)="doSomething($event)" |
| rightButtonIcon |
no |
text |
Usage: rightButtonName="icon-name", where icon name is an angular material icon. If no icon is specified then the settings icon is used. |
| border |
no |
text |
Usage: border="bottom". If border has the value "bottom", empty string or has not been set the colored integrity border is shown underneath the header. If any other value is set it is not displayed. |


A powerful, locally-installed integrated visual development tool. Learn more
For Individual Use
$99/mo
$29
/mo
Personal use discount
Limited to personal and side-project use.
For Organizations
$99
/user/mo
Limited to companies with less than $50M in revenue or funding.
What you get
- Secure, local Editor
- Full Code Editor
- Drag & Drop Composer
- Cordova Management & Simulation
- 100+ Ionic UI Components
- Theme & Asset Management
- Component Properties
- Live Reload Development
For Enterprises
Custom pricing
No limits on revenue or funding
Includes all of Studio plus:
- Access to the entire Ionic Platform
- Ionic supported Native functionality
- Support for multiple user licenses
- Live Onboarding
- Customer success manager
- Code & Design Reviews


Marathon Trivia
The fastest n-th fastest marathon time. Runner's personal records (PR's) are often publicized. Paula Radcliffe (ENG) has the fastest PR by virtue of holding the "world record" at 2:15:24.6. Her second fastest marathon is 2:17:17.8 which is the fastest, 2nd fastest marathon time by a woman and she also holds the fastest 3rd fastest marathon at 2:18:54.6. However, Catherine Ndereba (KEN) has the "honor" of having the fastest 4th fastest marathon at 2:21:12. Her fastest marathons are (2:18:47, 2:19:26, 2:19:55 and 2:21:12). Note that this list answers other questions such as who has the most sub-2:30 marathons [Catherne Ndereba (KEN) with 22]. With this in mind, here is the list of the fastest n-th fastest marathon times.
Fastest debut marathon. For men, 2:03:06 by Moses Mosop Cheruiyot (KEN) at Boston (MA/USA) on 18 Apr 2011. For women, 2:18:56 by Paula Radcliffe (ENG) at London (ENG) on 14 Apr 2002.
Marathons that cross international borders. Several marathons cross international borders. These include:
BEL-NED Maas Visé BEL => NED and return BLR-LTU Friendship Grodno BLR => Druskininkai LTU BRA-ARG Aguas Internacional Foz do Iguaçu BRA => Puerto Iguazu ARG ESP-FRA Transpyrénéen Catalan Figueras ESP => Le Boulou FRA GER-SUI-AUT Drei-Länder Lindau GER => St Margarethen SUI => Bregenz AUT NOR-SWE Unions Romskog NOR => Bovikens SWE and return SUI-LIE LGT Alpin Bendern SUI => Malbun LIE SVK-POL Visegrad Podoliniec SVK => Rytro POL URU-ARG Binacional Salto URU => Concordia ARG USA-CAN Casino Niagara Buffalo NY/USA => Niagara Falls ON CAN USA-CAN-USA Bay of Fundy International Lubec ME/USA <=> [East Quoddy Head] NB/CAN ZIM-RSA Two Countries Beitbridge ZIM => Musina RSA Inactive or no longer international AUT-SLO Mednarodni EU Eisenkappel AUT <=> Preddvor SLO (alternates direction) BEL-FRA Hainaut Mons BEL => Vallenciennes FRA CAN-USA Detroit Free Press Windsor ON CAN => Detroit MI/USA GER-POL Europa Gorlitz GER => Zgorszelec POL MON-FRA-ITA Monaco Monte Carlo MON => FRA => ITA and return NED-BEL Flanders Grauw NED => Beveren BEL NED-GER Enschede (for 2004) Enschede NED => GER and return POL-GER Usedom Swinoujscie POL => Wolgast GER SLO-AUT Kralj Matjaz PetzenLand Crna na Koroskem SLO => Bleiburg AUT SVK-AUT Danube Bratislava SVK => Hainburg an der Donau AUT and return USA-MEX International Friendship Coronado CA/USA => Rosarito MEX
Largest Marathons.
The ten largest marathon races, counted by the number of finishers for one running (year):
50,062 ING New York City 06 Nov 2011 New York NY/USA 46,795 ING New York City 06 Nov 2011 New York NY/USA 44,829 ING New York City 07 Nov 2010 New York NY/USA 43,633 ING New York City 01 Nov 2009 New York NY/USA 39,116 Schneider Electric Paris 06 Apr 2014 Paris FRA 38,690 Paris 07 Apr 2013 Paris FRA 38,557 ING New York City 04 Nov 2007 New York NY/USA 37,936 ING New York City 05 Nov 2006 New York NY/USA 37,790 ING New York City 02 Nov 2008 New York NY/USA 37,455 Bank of America Chicago 07 Oct 2012 Chicago IL/USA The largest marathon races, as counted by the number of finishers summed over ALL years for that race, with more than 100,000 total finishers:
973,290 New York City (NY/USA) 922,656 London (ENG) 676,656 Berlin (GER) 666,245 Paris (FRA) 628,488 Honolulu (HI/USA) 626,016 Chicago (IL/USA) 492,478 Marine Corps (DC/USA) 484,486 Boston (MA/USA) 377,426 Naha (JPN) 371,912 Stockholm (SWE) 10 344,262 Los Angeles (CA/USA) 320,043 Hamburg (GER) 231,859 Frankfurt (GER) 214,767 Dublin (IRL) 214,430 Tokyo International (JPN) 199,962 Twin Cities (MN/USA) 195,874 Rotterdam (NED) 194,383 Rock 'n' Roll (CA/USA) 192,187 Disney World (FL/USA) 181,209 Grandma's (MN/USA) 20 167,127 Citta di Roma (ITA) 162,961 Chateau du Medoc (FRA) 161,559 Vienna City (AUT) 159,044 Köln (GER) 150,304 Houston (TX/USA) 143,579 Barcelona (ESP) 124,566 Helsinki City (FIN) 112,857 Saint George (UT/USA) 107,743 Portland (OR/USA) 105,811 Firenze (ITA) 30
Note: The Boston Marathon is missing total finishers for 1901-06,1908-17,1919-1960,1963, and 1968; the Los Angeles Marathon is missing total finishers for 1986-90,1995-99; the Rotterdam Marathon is missing 1981-85, 1987, 1998-1999, and 2002-03; the Walt Disney World Marathon is missing 1995 and 1997-99; the Portland Marathon is missing 1973,1976-77,1979-81,1985-90,and 1998-99, the Citta di Roma Marathon is missing 1982. The Tokyo International Marathon is missing almost all years prior to 2007. Several other marathons probably should be on this list but they have not as yet been documented.
Note: Wheelchairs, inline skaters, and other non-pedestrian competitors are not included.
Runners who have won a marathon in a town of the same name. Only one example has been found. Lucio Fregono (ITA) won a marathon in Fregona ITA on 18
Sep 2004, running a 3:35:51. He repeated on 17 Sep 2006 with a time of 3:28:05.
The most marathon wins life-time. Ritva Vallivaara-Pasto (FIN) has won more marathons than any other individual with
more than 185 wins.
Click here for the runners with 20 or more career marathon wins. The
most marathon wins in one calendar year is 83 by Parvaneh Moayedi (USA) in
2013.
The shortest span of time between
sub-2:10's.
Yuki Kawauchi (JPN) ran 2:09:05 at
Fukuoka JPN on 01 Dec 2013 and then ran 2:09:15 at Hofu JPN on 15 Dec 2013,
just 14 days later. Click here for more.
(question from Brett Larner)
The longest span of time between first and last (most recent) marathon wins. Benji Durden (USA) with a span of 36y107d, from 05 Feb 1977 to 23 May 2013 . Here are the runners with time spans of 15 years or more.
The longest span of time between first and last (most recent) marathon finishes. Johnny A Kelley ran his first marathon on 17 Mar 1928 (3:17: at Pawtucket RI/USA, place unknown) and his most recent marathon on 15 Apr 1991 (5:42:54 at Boston MA/USA. This is a span of 63y39d. (thanks to Andy Milroy)
The longest span of time between first and last sub-2:20 marathons for men/sub-2:50 marathons for women. For men, Takeshi Soh (JPN) with a span of 22y337d, from 02 Apr 1978 to 04 Aug 2002 . Here are the runners with the longest time spans
Sub-3:00's in five different decades. The first runner to post sub-3:00 marathons in five different decades is Keizo Yamada (JPN) who ran sub-3:00 marathons in the 1940's, 1950's, 1960's, 1970's, and 1980's. Here are the runners who have achieved sub-3:00 marathons in five decades.
The most repeat wins in a single marathon. For men, 16 by Jim Pearson (USA) at the Birch Bay (WA/USA) Marathon [1970,1972,1975-76,1979,1981-91]. Here are the runners with six or more wins in a single marathon series.
The largest number of runners involved in a declared tie for 1st place. On 15 Mar 1980, at the Shamrock (VA/USA) Marathon, Richard Bogaty, Roland Davide, and David McDonald were all given times of 2:21:22 and declared joint winners.
Marathon Consistency. Naoki Hirasawa (JPN) ran 2:28:48 to place 8th at the Otawara (JPN) Marathon on 23 Nov 2006. Three days later, on 26 Nov 2006, he placed 4th at the Tsukuba (JPN) Marathon with a time of 2:28:48. At least he improved his finish place. (submitted by Shigenobu Ota)
Boston on Good Friday. Only one time has Boston been run on Good Friday. Johnny A Kelley (USA) won the Boston Marathon on Good Friday, April 19, 1935 with a time of 2:32:08. (submitted by Malcolm Heyworth)
Fastest Runners Never to Have Won a Marathon. For men, Dino Sefit Kemal (ETH) with a 2:04:50 PR (five known starts, best finish 2nd); for women, Ejagayou Dibaba (ETH) with a 2:22:09 PR (two known starts, best finish 2nd).
Least Rest Between Marathon Wins.
For men, Tarzan Brown (USA) won marathons on consecutive days back in 1936. On Saturday, Oct 11 in Port Chester
NY/USA he won in 2:36:57.6. Then on Sunday, Oct 12 he won the New England Championship in Boscawen-Concord-Manchester
NH/USA in 2:45:52. For women, Maria Tahkavuori (FIN) won both the morning and evening editions of the Valaran Vappuvipellys
(Tampere FIN) Marathon, held on 01 May 2004. The two races started 12 hours apart so she had eight hours rest between
her two wins. She had won the first edition of this same race the previous day (3 marathon wins in two days). Her
times, in chronological order: 3:57:25, 3:55:53. and 4:00:50. (idea submitted by Malcolm Heyworth)
Only woman to have started
five Olympic Marathons. Lidia Simon started five and finished four (1996 was 6th
in 2:31:04; 2000 was 2nd in 2:23:22; 2004 was a dnf; 2008 was 8th in 2:27:21,
and 2012 was 45th in 2:32:46). Lorraine Moller also finished four (1984
was 5th in 2:28:34, 1988 was 33rd in
2:37:52, 1992 was 3rd in 2:33:59, and 1996 was 46th in 2:42:21).
Fastest men + women combined winning times. The fastest combined winning time for a marathon is 4:23:13.8, set at the Chicago (IL/USA) Marathon on 13 Oct 2002. Khalid Khannouchi (USA) won the men's race in 2:05:56 while Paula Radcliffe (ENG) won the women's race in 2:17:17.8, more than a minute under the old WR. (idea from Marty Post)
Fastest combined times on
consecutive days. The fastest combined time is 4:53:07 by Michael Wardian (USA).
He ran 2:21:50 for 62nd at the USA Olympic Trials (TX/USA) Marathon on 14 Jan
2012 and then
ran 14th at the Chevron Houston (TX/USA) Marathon on 15 Jan2012 for a 2:31:17.
First man with two performances under 2:05. Haile Gebreselasie (ETH) was the first man to post two sub-2:05
marathons, on 18 Jan 2008 at the Dubai (UAE) Marathon (idea submitted
by Marty Post)
First man with two performances under 2:06. Khalid Khannouchi (USA) was the first man to post two sub-2:06 marathons when he broke his own world record of 2:05:42 with a 2:05:38 clocking at the London (ENG) Marathon on 14 Apr 2002.
First man with two performances under 2:07. Josephat Kiprono (KEN) was the first man to post two sub-2:07 marathons, on 22 Apr 2001 at the Rotterdam (NED) Marathon.
First man with two performances under 2:08. Vincent Rousseau (BEL) was the first man to post two sub-2:08 marathons, on 24 Sep 1995 at the Berlin (GER) Marathon.
First man with two performances under 2:09. Rob deCastella (AUS) was the first man to post two sub-2:09 marathons, on 09 Apr 1983 at the Rotterdam (NED) Marathon.
First man with two performances under 2:10. Bill Rodgers (USA) was the first man to post two sub-2:10 marathons, on 16 Apr 1979 at the Boston (MA/USA) Marathon.
First woman with two performances under 2:20. Paula Radcliffe (ENG) won the Chicago (IL/USA) on 13 Oct 2002 in 2:17:17.7 for her second sub-2:20 performance. Jusr over two minutes later, Catherine Ndereba (KEN) finished 2nd in 2:19:26, to become the second woman with two sub-2:20 performances.
First woman with two performances under 2:25. Joan Benoit Samuelson's (USA) Olympic gold medal performance on 05 Aug 1984 was her second sub-2:25 performance.
First woman with two performances under 2:30. Grete Waitz (NOR) was the first woman to post two sub-2:30 marathons, both at the New York City (NY/USA) Marathon and both on courses considered to have been short. However, her times of 2:27:32.6 (21 Oct 1979) and 2:25:41.3 (26 Oct 1980) were fast enough to have allowed her to have completed any additional distance needed to make up the full 42.195 km with ease.
First woman with two performances under 2:35. Grete Waitz (NOR) was the first women to post two sub-2:35 marathons. These were her first two marathons, both at the New York City (NY/USA) Marathon and both on courses considered to have been short. However, her times of 2:32:29.8 (22 Oct 1978) and 2:27:32.6 (21 Oct 1979) were fast enough to have allowed her to have walked any additional distance needed to make up the full 42.195 km.
First woman with two performances under 2:40. Christa Vahlensieck (GER) was the first woman to post two sub-2:40 marathons when she ran 2:38:32.8 at Steinwessen GER on 23 Sep 1978.
First woman with two performances under 2:45. Jacqueline Hansen (USA) was the first woman to post two sub-2:45 marathons when she ran 2:43:54.6 at ran 2:38:19 at Eugene OR/USA on 12 Oct 1975. Christa Vahlensieck (GER) had two times under 2:45 but her first was at the Essen (GER) Marathon on 26 Oct 1974 on a course later shown to be 745 meters short.
First woman with two performances under 2:50. Miki Gorman (USA) was the first woman to post two sub-2:50 marathons when she ran 2:47:12 at the Boston (MA/USA) Marathon on 15 Apr 1974.
First woman with two performances under 3:00. Nina Kuscsik (USA) was the first woman to post two sub-3:00 marathons when she ran 2:59:33 at the Cherry Tree (NY/USA) Marathon on 19 Mar 1972.
Least time difference between first man and first woman. This is limited to major marathons defined as male winner under 2:20 and female winner under 2:50. The smallest time difference is 7:14 (434 seconds) at the Beijing (CHN) Marathon on 20 Oct 2002. Zhu-hong Li (CHN) won the men's race in 2:13:09; Ya-nan Wei (CHN) won the women's race in 2:20:23.
Least time difference between the men's and women's world "records." From 13 Apr 2003 to 27 Sep 2003, the men's record was 2:05:37.8 and the women's record was
2:15:24.6, for a time differential of 9:46.8. (idea from Marty Post)
Greatest combined ages for the male and female winners of
a marathon. The 19 Jun 1990 Trondheim
(NOR) Marathon was won by Per-Magne Sirås (07 Jul 1942, age 57y347d) in 2:43:34
and
Åse Rekkebo (15 Aug 1932, age
57y308d) in 3:47:20, for a combined age of 115y290d. Idea from Maurice
Wilson.
The fastest brothers
are Duncan Kibet (2:04:26.3) and Luke Metto (2:10:57) with a combined time of 4:15:23.3.
The fastest sisters
are Hiromi (2:23:26) and Takami (2:23:43) Ominami with a combined time of 4:47:09 (Hiromi and Takami are twins.)
The fastest father/son
are Waldemar Cierpinski (2:09:55) and Falk Cierpinski (2:13:30) with a combined time of 4:23:25.
The fastest father/daughter
are Tadaaki (2:13:37.6) and Masae Ueoka (2:30:17) with a combined time of 4:43:54.6.
The fastest mother/daughter
are Hildegard (2:40:41) and Sabrina Mockenhaupt (2:26:22) with a combined time of 5:07:03.
The fastest brother/sister
are Samuel (2:15:50) and Catherine (2:18:57) Ndereba with a combined time of 4:34:47.
The fastest husband/wife
are Gebre Gebremariam Egziaber (2:04:53) and Workenesh Kidane (2:26:16) with a
combined time of 4:31:09.
Thanks to Marty Post. Contributions from Shigenobu Ota, Franco Civai, Juraj
Gasparovic, Alex Wilson.
Husband/wife National Record Holders. Khalid Khannouchi (MAR/USA) and Sandra Khannouchi-Natal (DOM) hold three national records between them. Khalid holds the USA record of 2:05:37.8 (14 Apr 2002 at London ENG) and the MAR record of 2:05:42 (24 Oct 1999 Chicago IL/USA). Sandra holds the DOM record of 2:46:46 (29 Oct 1995 Frankfurt GER). (thanks to Greg Diamond)
Longest running marathons.
The Boston (MA/USA) Marathon is the longest running marathon in the world, having been run 117 times. Here are
the marathons with 20 or more runnings.
Most different months for a single venue marathon to be staged. The Yonkers
(NY/USA) Marathon has been held in seven different calendar months. Apr (1987-94), May (1913,1945-55,1957-71,1973,1975-86),
Jun (1972,1974), Sep (1948,1956,1997-date), Oct (1946-47,1995-96), Nov (1907-11,1914-15,1917,1935-45) and Dec (1916).
Marathon world best for men and women held by runners from the same country. For 38 days between 13 Jun 1964 and 20 Jul 1964, the world best marathon performance for men was by Benjamin Basil Heatley (GBR) at 2:13:55 and for women was Dale Greig (GBR) at 3:27:45.
Fastest combined men/women national records. Kenya (KEN) has the fastest combined national records with Mary Keitany (2:18:37) combined with Wilson Kipsang (2:03:23) for a total of 4:22:00.
Fastest
USA/CAN marathons by state/province.
Click here for the marathon all-comers best
marathon times of each USA state and each CAN province.
Marathons wins in all 50 states (USA).
Chuck Engle (USA) won the Louisiana Trails (LA/USA) Marathon on 12 Nov 2011 to
complete marathon wins in all 50 states.
Most national marathon titles. (courtesy of Malcolm Heyworth)
12 AUT Adolf Gruber 1952-63 11 ISR Nili Avramski (F) 1996-98,2000-02,2005-08 10 SWE Gustav Kinn 1917,1919-22,1924-26,1928-29 SWE Henry Palme 1934-42,1944 9 AUT Franz Tuschek 1926-27,1929-35 DEN Henning Larsen 1941,1943-50 EST Rein Leinus 1959-63,1967-70 ISR Asaf Bimro 1995,1997,1999-2001,2003-05,2007 POR Armando Aldegalega 1964,1966-69,1971-74,1980 POR Fatima Silva (F) 1999-2002,2004-08 8 IND Chhota Singh 1942,1944,1946,48-51,1953 BUL Georgi Penchov 1947,1949-50,1955,1957-58,1960-61 USA John J Kelley 1956-63 BEL Aurele Vandendriessche 1956-57,1959-64 TUR Ismail Akcay 1960's/1970's SCG Tomislav Askovic 1977,1982,1984-89 BUL Rumyana Panovska (F) 1987-89,1996,1999-2000,2003-04 BUL Petko Stefanov 1994,1996,1999-2004 BUL Milka Mikhaylova (F) 2001-02,2005-06,2008,2010-12
Oldest/youngest runners to win an open marathon. Nadezda Kavtaskina (LAT) at age 70y074d is the oldest person to win an open marathon when she won in 4:02:36 at Riga LAT on 07 Oct 2006. Here are the oldest and youngest runners to have won an open marathon.
Oldest/youngest runners to win an open marathon under the ARRS qualifying standards (2:20/2:50). Bernardine Portenski at age 49y060d is the oldest woman to win an open marathon under the ADR qualifying standard of 2:50 when she won in 2:44:52 at Auckland NZL on 25 Oct 1998. Here are the ten oldest and ten youngest men and women to have won open marathons under the ADR qualifying standards.
Marathons won by women. On occasion, the first runner across the finish line in a mixed race marathon is a woman:
22 Feb 1986 Seven Sisters (ENG) 2:49: Sarah Rowell 2:53: Sam Lambourne Aug 1988 McKenzie River Trail (OR/USA) 4:16:46 Sandi Arrington (USA) 4:27:29 George Cox (USA) 26 Oct 1991 Stinson Beach (CA/USA) 4:11:38 Eldrith Gosney (CA/USA) 4:41:55 Bob O'Connell (CA/USA) 11 Jan 1992 Mount Tamalpais (CA/USA) 4:16:02 Carrie Burrows (CA/USA) 4:46:30 John Clark (CA/USA) 18 Apr 1992 California Forty-Niner (CA/USA) 4:03:35 Rachel Atchley (NV/USA) 4:20:15 Vince Sciortino (CA/USA) 18 Jul 1992 Summer Solstice (CA/USA) 4:51:00 Ellen Troth (CA/USA) 4:57:40 Howard Daniel (CA/USA) 21 May 1994 Skyline to the Sea (CA/USA) 3:38:00 Barbara Acosta (USA) 4:17:50 Chris Giedt (USA) 03 Jun 1995 Marin Wilderness Trail (CA/USA) 4:32:28 Teri Rose (CA/USA) 5:08:00 Reid Waldon (CA/USA) 09 Sep 1995 Bismark YMCA (ND/USA) 2:46:46 Christina Scobey (NY/USA) 2:53:00 Thomas Lacey (CO/USA) 20 Apr 1996 Napa Valley Trail (CA/USA) 3:45:43 Tina Ure (CA/USA) 3:54:52 Nicolas Martin (CA/USA) 10 18 May 1996 Muir Woods Trail (CA/USA) 3:23:30 Tina Ure (CA/USA) 3:25:00 Andy Roth (CA/USA) 19 Oct 1996 Skyline to the Sea (CA/USA) 4:13:16 Gayla Johnson (CA/USA) 4:23:23 Scott Clark (CA/USA) Mar 1997 Guam (GUM) 3:07:48 Rhonda Davidson-Alley (GUM) 3:11:32 Jim Walker (GUM) 19 Dec 1999 Christmas (WA/USA) 2:52:55 Laura Nelson 2:55:11 Cliff Gill May 2001 Prince of Wales (AK/USA) 3:27:55 Susan Doherty (USA) 3:28:05 Willis Ferenbaugh (USA) 01 Jan 2002 Redding (CA/USA) 2:56:05 Beverley Abbs (CA/USA) 3:01:53 Ed Ankring 05 Oct 2002 Big Sur Trail (CA/USA) 4:03:08 Jenny Knight (USA) 4:04:36 John Teske (USA) 12 Oct 2002 Krimskiy (UKR) 2:40:02 Tatyana Bulyshchenko (UKR) 2:45:22 Ivan Shestakovich (UKR) 01 Jan 2003 Redding (CA/USA) 3:03:50 Beverley Abbs (CA/USA) 3:08:52 Ed Ankring 03 May 2003 Wild Wild West (CA/USA) 4:06:25 Jana Gustman 4:09:01 Norman Kabrick 20 30 Jun 2003 Nunavut Midnight Sun (CAN) 4:36: Lisa Ramshaw 4:45: Rich Holmes 01 Jan 2004 Redding (CA/USA) 3:09:38 Beverley Abbs (CA/USA) 3:22:52 Rob Carreau (USA) 15 Feb 2004 Desert Classic (AZ/USA) 2:48:44 Janice Posey (AZ/USA) 2:54:39 Tony Kelly (CAY) 14 Mar 2004 Te Houtaewa Challenge (NZL) 3:30:30 Catharina Ward (NZL) 4:40:05 Kerry Cutler (NZL) 05 Jul 2004 Nunavut Midnight Sun (CAN) 4:25:07 Amanda Silk 4:25:41 Neil Kigutaq 24 Oct 2004 Nike 26.2 (CA/USA) 3:03:06 Jessica Langford (IL/USA) 3:07:30 Lee Marigold (CA/USA) 26 Dec 2004 Tahnee Welch (GER) 3:52:02 Silvia Rehn (GER) 4:04:23 Thomas Wenning (GER) 2004 The Houtewae Challenge (NZL) 3:30:30 Catherina Ward (NZL) unknown 07 May 2005 Wild Wild West (CA/USA) 4:06:05 Marian Richard 4:20:07 Dow Mattingly 25 Oct 2005 Nike 26.2 (CA/USA) 2:59:32 Tracey Gold (CA/USA) 3:09:57 Michael Fuortes (NY/USA) 30 22 Dec 2005 Kreuxdeich (GER) 3:53:50 Anja Samse (GER) 3:59:51 Gunter Tewes (GER) 07 May 2006 Diablo Mountain (CA/USA) 4:44:18 Caren Spore (CA/USA) 5:15:00 Jorgen Eriksen (CA/USA) 08 Jul 2006 Alajarvi (FIN) 3:41:00 Hanna Haapa-Aho (FIN) 3:45:45 Tuukka Peltola (FIN) 09 Sep 2006 Odyssey Trail (VA/USA) 4:38: Bethany Patterson (USA) 4:40: Neal Jamison (USA) 24 Sep 2006 Boulder Backroads (CO/USA) 2:43:10 Nuta Olaru (ROM) 2:49:09 Steve Krebs (CO/USA) 07 Oct 2006 Triple Lakes Trail (NC/USA) 3:30:23 Emily Ruth (NC/USA) 3:36:20 Andrew Douglas (USA) 29 Dec 2006 Johann Christian Poggendorf(GER) 4:49:30 Rosemary vonKocemba (GER) 5:54:44 Christian Hottas (GER) 25 Mar 2007 Daffodill Dawdle (ENG) 4:27: Lisa Joanne Barry (ENG) 4:28: Glyn Morris (ENG) 07 Apr 2007 Russell Crowe (GER) 4:35:34 Rosemary vonKocemba (GER) 4:52:26 Hartmut Feldmann (GER) 30 Apr 2007 Paloheina (FIN) 4:10:26 Ritva Vallivaara-Pasto(FIN) 6:06:03 Tapani Sallya (FIN) 40 09 Jun 2007 Maryville (MO/USA) 2:57:25 Christine Ensign (USA) 3:08:38 Matthew Berndt (USA) 30 Jun 2007 Running With the Devil (NV/USA) 4:45:29 Karla Kent (USA) 5:29:50 Ted Plautz (USA) 01 Jul 2007 Prato/Boccadirio (ITA) 3:11:39 Monica Carlin (ITA) 3:15:02 Ivan Cudin (ITA) 07 Jul 2007 Sommer (GER) 4:15:27 Susanne Mahlstedt (GER) 4:17:47 Petzi Schickelgruber (GER) 09 Sep 2007 Yorkshireman (ENG) 6:39:25 Catherine Shaw (ENG) 6:43:41 Gordon Teal (ENG) 15 Sep 2007 Shore to Shore (WA/USA) 2:58:14 Marlene Farrell (USA) 3:13:54 Todd Knowles (USA) 16 Sep 2007 Newfoundland Provincial (NF/CAN) 3:04:21 Allison Hobeika (CAN) 3:09:24 Bill Pomeroy (CAN) 16 Sep 2007 Paloheina (FIN) 3:50:17 Ritva Vallibaara-Pasto(FIN) 3:54:03 Jouni Jaakkonen (FIN) 07 Oct 2007 Bizz Johnson Trail (CA/USA) 2:46:35 Heather Fuhr (CAN) 2:59:56 Christopher King (USA) 21 Oct 2007 Arne Frank (GER) 5:01:27 Rosemarie vonKocemba (GER) 5:16:01 Christian Hottas (GER) 50 21 Oct 2007 Nike (CA/USA) 3:01:26 Laura Thompson (USA) 3:09:04 Otto Elliott (USA) 28 Oct 2007 Eros Ramazotti (GER) 4:55:10 Rosemarie vonKocemba (GER) 5:09:09 Christian Hottas (GER) + Meinulf Kron 28 Oct 2007 Frankenstein (MO/USA) 3:49:35 Ellen Erhardt (USA) 3:49:36 Don Frichtl (USA) 18 Nov 2007 Paloheina (FIN) 4:04:39 Ritva Vallibaara-Pasto(FIN) 4:34:24 Esa Nieminen (FIN) 01 Dec 2007 Paloheina (FIN) 3:49:15 Ritva Vallibaara-Pasto(FIN) 4:36:16 Hans Mannsten (FIN) 29 Dec 2007 Paloheina (FIN) 3:59:43 Ritva Vallibaara-Pasto(FIN) 4:29:13 Hans Mannsten (FIN)
Note: This list ends at 31 Dec 2007 because it has become too common to detail all of the examples.
Note: In the 2005 Nike 26.2 (CA/USA) Marathon, the first six finishers were women altho it should be noted that this was advertised as the Nike Women's Marathon despite allowing men to run.
Last Updated on
13 Jun 2014


--- layout: page title: Executive Boards ---
President - Kristian Wu - 2019
Vice President - Deepti Upmaka - 2019
Secretary - Roshni Shah - 2019
Treasurer - Samrat Darisipudi - 2019
EGC Representative - Daniel Pattathil - 2020
Director of Professional Relations - Neharika Bhandari - 2018
Director of Outreach and Marketing - Vallab Nayak - 2020
Director of Fundraising - Sagar Shah - 2020
Director of Web Technology - Bhargav Tarpara - 2018
| {{ person[1].role }} |
{% if person[1].url %}
{{ person[1].name }}
{% else %}
{{ person[1].name }}
{% endif %}
{{ person[1].class }} |


Base geometry class and utilities
Bases: object
Provides GEOS spatial predicates and topological operations.
Returns True if geometries are equal at all coordinates to a specified decimal place
Unitless area of the geometry (float)
Returns a lower dimension geometry that bounds the object
The boundary of a polygon is a line, the boundary of a line is a collection of points. The boundary of a point is an empty (null) collection.
Returns minimum bounding region (minx, miny, maxx, maxy)
Returns a geometry with an envelope at a distance from the object’s envelope
A negative distance has a “shrink” effect. A zero distance may be used to “tidy” a polygon. The resolution of the buffer around each vertex of the object increases by increasing the resolution keyword parameter or second positional parameter. Note: the use of a quadsegs parameter is deprecated and will be gone from the next major release.
The styles of caps are: CAP_STYLE.round (1), CAP_STYLE.flat (2), and CAP_STYLE.square (3).
The styles of joins between offset segments are: JOIN_STYLE.round (1), JOIN_STYLE.mitre (2), and JOIN_STYLE.bevel (3).
The mitre limit ratio is used for very sharp corners. The mitre ratio is the ratio of the distance from the corner to the end of the mitred offset corner. When two line segments meet at a sharp angle, a miter join will extend the original geometry. To prevent unreasonable geometry, the mitre limit allows controlling the maximum length of the join corner. Corners with a ratio which exceed the limit will be beveled.
Example:
>>> from shapely.wkt import loads
>>> g = loads('POINT (0.0 0.0)')
>>> g.buffer(1.0).area # 16-gon approx of a unit radius circle
3.1365484905459389
>>> g.buffer(1.0, 128).area # 128-gon approximation
3.1415138011443009
>>> g.buffer(1.0, 3).area # triangle approximation
3.0
>>> list(g.buffer(1.0, cap_style='square').exterior.coords)
[(1.0, 1.0), (1.0, -1.0), (-1.0, -1.0), (-1.0, 1.0), (1.0, 1.0)]
>>> g.buffer(1.0, cap_style='square').area
4.0
Returns the geometric center of the object
Returns True if the geometry contains the other, else False
Imagine an elastic band stretched around the geometry: that’s a convex hull, more or less
The convex hull of a three member multipoint, for example, is a triangular polygon.
Access to geometry’s coordinates (CoordinateSequence)
Returns True if the geometries cross, else False
Return ctypes buffer
Returns the difference of the geometries
Returns True if geometries are disjoint, else False
Unitless distance to other geometry (float)
A figure that envelopes the geometry
Returns True if geometries are equal, else False
Returns True if geometries are equal to within a specified tolerance
Name of the geometry’s type, such as ‘Point’
True if the geometry’s coordinate sequence(s) have z values (are 3-dimensional)
Return a point at the specified distance along a linear geometry
If the normalized arg is True, the distance will be interpreted as a fraction of the geometry’s length.
Returns the intersection of the geometries
Returns True if geometries intersect, else False
True if the set of points in this geometry is empty, else False
True if the geometry is a closed ring, else False
True if the geometry is simple, meaning that any self-intersections are only at boundary points, else False
True if the geometry is valid (definition depends on sub-class), else False
Unitless length of the geometry (float)
Returns True if geometries overlap, else False
Returns the distance along this geometry to a point nearest the specified point
If the normalized arg is True, return the distance normalized to the length of the linear geometry.
Returns the DE-9IM intersection matrix for the two geometries (string)
Returns a point guaranteed to be within the object, cheaply.
Returns a simplified geometry produced by the Douglas-Puecker algorithm
Coordinates of the simplified geometry will be no more than the tolerance distance from the original. Unless the topology preserving option is used, the algorithm may produce self-intersecting or otherwise invalid geometries.
Returns the symmetric difference of the geometries (Shapely geometry)
Returns True if geometries touch, else False
Returns the union of the geometries (Shapely geometry)
Returns True if geometry is within the other, else False
WKB representation of the geometry
WKB hex representation of the geometry
WKT representation of the geometry
Separate arrays of X and Y coordinate values
Bases: shapely.geometry.base.BaseGeometry
Bases: object
Iterative access to members of a homogeneous multipart geometry.
Bases: shapely.geometry.base.GeometrySequence
Iterative access to a heterogeneous sequence of geometries.
Dump coordinates of a geometry in the same order as data packing
Decorator which helps avoid GEOS operations on null pointers.
Multi-part collections of geometries
Bases: shapely.geometry.base.BaseMultipartGeometry
A heterogenous collection of geometries
Geometry factories based on the geo interface
Adapts the context to a geometry interface. The coordinates remain stored in the context.
Returns a rectangular polygon with configurable normal vector
Returns a GeoJSON-like mapping
Returns a new, independent geometry with coordinates copied from the context.
Line strings and related utilities
Bases: shapely.geometry.base.BaseGeometry
A one-dimensional figure comprising one or more line segments
A LineString has non-zero length and zero area. It may approximate a curve and need not be straight. Unlike a LinearRing, a LineString is not closed.
Provide the Numpy array protocol.
Access to geometry’s coordinates (CoordinateSequence)
Returns a LineString or MultiLineString geometry at a distance from the object on its right or its left side.
Distance must be a positive float value. The side parameter may be ‘left’ or ‘right’. The resolution of the buffer around each vertex of the object increases by increasing the resolution keyword parameter or third positional parameter.
The join style is for outside corners between line segments. Accepted values are JOIN_STYLE.round (1), JOIN_STYLE.mitre (2), and JOIN_STYLE.bevel (3).
The mitre ratio limit is used for very sharp corners. It is the ratio of the distance from the corner to the end of the mitred offset corner. When two line segments meet at a sharp angle, a miter join will extend far beyond the original geometry. To prevent unreasonable geometry, the mitre limit allows controlling the maximum length of the join corner. Corners with a ratio which exceed the limit will be beveled.
Separate arrays of X and Y coordinate values
Example:
>>> x, y = LineString(((0, 0), (1, 1))).xy
>>> list(x)
[0.0, 1.0]
>>> list(y)
[0.0, 1.0]
Adapt an object the LineString interface
Collections of linestrings and related utilities
Bases: shapely.geometry.base.BaseMultipartGeometry
A collection of one or more line strings
A MultiLineString has non-zero length and zero area.
Adapts a sequence of objects to the MultiLineString interface
Collections of points and related utilities
Bases: shapely.geometry.base.BaseMultipartGeometry
A collection of one or more points
A MultiPoint has zero area and zero length.
Provide the Numpy array protocol.
Adapt a sequence of objects to the MultiPoint interface
Collections of polygons and related utilities
Bases: shapely.geometry.base.BaseMultipartGeometry
A collection of one or more polygons
If component polygons overlap the collection is invalid and some operations on it may fail.
Adapts a sequence of objects to the MultiPolygon interface
Points and related utilities
Bases: shapely.geometry.base.BaseGeometry
A zero dimensional feature
A point has zero length and zero area.
>>> p = Point(1.0, -1.0)
>>> print(p)
POINT (1.0000000000000000 -1.0000000000000000)
>>> p.y
-1.0
>>> p.x
1.0
Provide the Numpy array protocol.
Access to geometry’s coordinates (CoordinateSequence)
Return x coordinate.
Separate arrays of X and Y coordinate values
>>> x, y = Point(0, 0).xy
>>> list(x)
[0.0]
>>> list(y)
[0.0]
Return y coordinate.
Return z coordinate.
Adapt an object to the Point interface
Polygons and their linear ring components
Bases: shapely.geometry.base.BaseGeometry
A two-dimensional figure bounded by a linear ring
A polygon has a non-zero area. It may have one or more negative-space “holes” which are also bounded by linear rings. If any rings cross each other, the feature is invalid and operations on it may fail.
Adapt objects to the Polygon interface
Bases: shapely.geometry.linestring.LineString
A closed one-dimensional feature comprising one or more line segments
A LinearRing that crosses itself or touches itself at a single point is invalid and operations on it may fail.
Access to geometry’s coordinates (CoordinateSequence)
True is the ring is oriented counter clock-wise
True if the geometry is simple, meaning that any self-intersections are only at boundary points, else False
Adapt an object to the LinearRing interface
Proxy for coordinates stored outside Shapely geometries
Bases: object
Geometry classes and factories
Returns a rectangular polygon with configurable normal vector
Returns a new, independent geometry with coordinates copied from the context.
Adapts the context to a geometry interface. The coordinates remain stored in the context.
Bases: shapely.geometry.base.BaseGeometry
A zero dimensional feature
A point has zero length and zero area.
>>> p = Point(1.0, -1.0)
>>> print(p)
POINT (1.0000000000000000 -1.0000000000000000)
>>> p.y
-1.0
>>> p.x
1.0
Provide the Numpy array protocol.
Access to geometry’s coordinates (CoordinateSequence)
Return x coordinate.
Separate arrays of X and Y coordinate values
>>> x, y = Point(0, 0).xy
>>> list(x)
[0.0]
>>> list(y)
[0.0]
Return y coordinate.
Return z coordinate.
Adapt an object to the Point interface
Bases: shapely.geometry.base.BaseGeometry
A one-dimensional figure comprising one or more line segments
A LineString has non-zero length and zero area. It may approximate a curve and need not be straight. Unlike a LinearRing, a LineString is not closed.
Provide the Numpy array protocol.
Access to geometry’s coordinates (CoordinateSequence)
Returns a LineString or MultiLineString geometry at a distance from the object on its right or its left side.
Distance must be a positive float value. The side parameter may be ‘left’ or ‘right’. The resolution of the buffer around each vertex of the object increases by increasing the resolution keyword parameter or third positional parameter.
The join style is for outside corners between line segments. Accepted values are JOIN_STYLE.round (1), JOIN_STYLE.mitre (2), and JOIN_STYLE.bevel (3).
The mitre ratio limit is used for very sharp corners. It is the ratio of the distance from the corner to the end of the mitred offset corner. When two line segments meet at a sharp angle, a miter join will extend far beyond the original geometry. To prevent unreasonable geometry, the mitre limit allows controlling the maximum length of the join corner. Corners with a ratio which exceed the limit will be beveled.
Separate arrays of X and Y coordinate values
Example:
>>> x, y = LineString(((0, 0), (1, 1))).xy
>>> list(x)
[0.0, 1.0]
>>> list(y)
[0.0, 1.0]
Adapt an object the LineString interface
Bases: shapely.geometry.base.BaseGeometry
A two-dimensional figure bounded by a linear ring
A polygon has a non-zero area. It may have one or more negative-space “holes” which are also bounded by linear rings. If any rings cross each other, the feature is invalid and operations on it may fail.
Adapt objects to the Polygon interface
Bases: shapely.geometry.base.BaseMultipartGeometry
A collection of one or more points
A MultiPoint has zero area and zero length.
Provide the Numpy array protocol.
Adapt a sequence of objects to the MultiPoint interface
Bases: shapely.geometry.base.BaseMultipartGeometry
A collection of one or more line strings
A MultiLineString has non-zero length and zero area.
Adapts a sequence of objects to the MultiLineString interface
Bases: shapely.geometry.base.BaseMultipartGeometry
A collection of one or more polygons
If component polygons overlap the collection is invalid and some operations on it may fail.
Adapts a sequence of objects to the MultiPolygon interface
Bases: shapely.geometry.base.BaseMultipartGeometry
A heterogenous collection of geometries
Returns a GeoJSON-like mapping
Bases: shapely.geometry.linestring.LineString
A closed one-dimensional feature comprising one or more line segments
A LinearRing that crosses itself or touches itself at a single point is invalid and operations on it may fail.
Access to geometry’s coordinates (CoordinateSequence)
True is the ring is oriented counter clock-wise
True if the geometry is simple, meaning that any self-intersections are only at boundary points, else False
Adapt an object to the LinearRing interface


Our IC design experts bring hundreds of years of combined experience to help you get your ideas into custom silicon quickly and affordably.
Patented via configurable array (VCA) technology slashes ASIC development times, costs and risks.
We deliver a world-class semiconductor supply chain including fabrication, assembly & test and distribution.
We can support low to high-volume opportunities and seamlessly transition you from VCAs to full-custom ICs.
At Triad, mixed-signal IP reuse is real. Explore our vast IP library that can help you kickstart your next design.


The DDSGUI module provides the graphical user interface for classes DDSimca and DDSTask.
Installation and first steps
To use the Tool you should set the Matlab current directory to the folder, which contains the files "DDSGUI.m", "DDSimca.m" and "DDSTask.m" or add this folder to the Matlab Path.
By default it is assumed that none of the built-in Matlab functions on the user's machine has been overloaded due to the use of a third-party toolbox.
Before you start working with the GUI you should load the data for analysis into the MATLAB workspace.
The model and result objects can be saved from the GUI to the MATLAB workspace.
Description
The GUI window is separated into 3 tabs: Model, Prediction and Options.
The main tab is the Model tab. The user controls on the tab allow to input the training data, set the model parameters as well as to view and save the results.
On the Prediction tab the user my apply the DD-SIMCA model to the new data set. The selection of the new data set variable and the labels is analogous to the Model tab. Click the Decide button to apply the currently loaded model to the new samples.
Examples
Working with the Model tab
To build a DD-SIMCA model:
On the Model tab click the Training Set button.
In the modal window select the matrix containing the training set.
Optionally click the Labels button to select the cell array of strings for names of samples in the data set.
Adjust the parameters of the model. It is possible to indicate a value of a type I error or switch to automatic calculation by checking the Auto checkbox
Click the Build button to create the model.
The results are now available in the Current model and Results and statistics sections.
Click on the Acceptance plot and Extreme plot buttons to study the results visually.
To get complete modelling results collected in a DDSimca object click the Save model button and select a name of the new model. It will be created in the Matlab workspace.
You can save your current workspace to a .mat file to preserve the results. Later on you can load the .mat file into the Matlab workspace and resume working with the model by clicking on the Load model button.
Click the Clear button to reset all the setting to default and to remove the current model.
Warning: Some parameter settings (e.g. if the number of PCs is too high) can cause the model to become unstable. Such a model may provide erroneous result when applied to a New data set.
In such cases an informational message will appear in the Results and statistics section:
Calculations are not stable - change the number of PCs!. It is recommended to change the parameters and rebuild the model.
Visual analysis of the results
The Tool provides two visual representations of the classification results - the Acceptance and the Extreme plots.
The Acceptance plot for the training data shows the acceptance (green line) and outlier tresholds (red line). The samples are separated into 3 possible categories: regular (green dot), extreme (yellow dot) and outlier (red dot). The goal of the Acceptance plot for the training set is to assist in creating a good model and to remove the outliers.
The Extreme plot indicates how the observed number of the extremes is related to their estimated number.
For the selected number of PCs the Extreme plot is a tool for analysis of the quality of the classification model.
Working with the Prediction tab
To apply a DD-SIMCA model to the new data:
Here we assume that a model was previously created or loaded into the GUI by the Model tab.
On the Prediction tab click the New Set button.
In the modal window select the matrix containing the new data set.
Optionally click the Labels button to select the cell array of strings for names of samples in the data set.
By default a type II error is estimated for the new data set. It is possible to switch to a type I error calculation based on the predefined type II error.
Click the Decide button to apply the model to the new data set.
The results are now available in the Results and statistics sections.
Click on the Acceptance plot to study the results visually.
To get the results stored in a DDSTask object click the Save results button and select a name. It will be created in the Matlab workspace. Note that the DDSTask object contains all the data related to the analyzed task including the data sets as well as the related DDSimca model object.
You can save your current workspace to a .mat file to preserve the results. Later on you can load the .mat file into the Matlab workspace and resume the analysis by cliking on the Load results button.
Click the Clear button to reset all the setting to default and to remove the current model.
Visual analysis of new data
The Acceptance plot for the new data set shows the acceptance (green line) area. The samples are separated into two possible categories: samples that are considered as members of the target class (green dot) and non-members (red dot).
Working with the Options tab
The Options tab contains the visualization setting for the Acceptance plot, such as axes transformation and sample names.
References
1. Pomerantsev A.L., Rodionova O.Ye. Concept and role of extreme objects in PCA/SIMCA. J. Chemom. 28, 2014. DOI: 10.1002/cem.2506.
2. Pomerantsev A.L., Rodionova O.Ye. On the type II error in SIMCA method. J. Chemom. 28, 2014. DOI: 10.1002/cem.2610


View HyperBook on Github(Developers Only )
Home Hyperbook
HB
Hyperbook
Welcome to HyperBook!
Socialize
Videos
google+


Interfaces and classes related to credentials and ways to represent
them.
Developers will generally create and populate CredentialResolvers
during application initialization time. CredentialCriteria can then be
constructured to model the information the application has about a
particular credential and then provided to the CredentialResolver in
order retrieve the previously loaded credential information. Here are a
couple of use cases where this approach might be used:
- An application wishes to decrypt a message from one of many
peers. The encrypted message contains a KeyInfo which itself contains
the public key used to encrypt the data. The application can then use
the public key to lookup its appropriate private key and decrypt the
message.
- An application uses client-cert authentication via TLS when
communicating with a peer. Upon receipt of the peers certificate the
application uses the provide entity certificate to lookup additional
information associated with this credential, including CRLs, to
determine if the credential should be trusted. It then looks up it's
credential for the given peer and uses it to authenticate. Once
completed the application stores the TLS session key in a
CredentialResolver so that it may be used during encryption processes.


Consultation outcome
Summary of responses and government’s response.
This consultation ran from
to
We are seeking views on changes to legal requirements for schools to report teacher assessment data.
MS Word Document , 39.5KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
MS Word Document , 25.7KB
If you use assistive technology (such as a screen reader) and need a version of this document in a more accessible format, please email<EMAIL_ADDRESS>. Please tell us what format you need. It will help us if you say what assistive technology you use.
The purpose of this consultation is to gather views on Department for Education draft amendments to legal requirements for schools to report teacher assessment data to the department.
Published: 9 April 2013
From: Department for Education
Part of: Teaching and school leadership


The name of this Tutorial is {{TutorialName}}
The first Topic is {{appList[0] | uppercase}}
The second Topic is {{appList[1] | uppercase}}
The third Topic is {{appList[2]| slice:2:3}}
The date of this Tutorial is {{newdate | date:"MM/dd/yy"}}
The currency of this Tutorial is {{newValue | currency}}
The percentage is {{perc | percent:'2.2-5'}}


Rat holds up flight in India for 12 hours - Premium Times Nigeria
by Agency ReportA domestic flight in India was delayed for nearly 12 hours after a rat was spotted scampering around the aircraft, news reports and officials said on Tuesday.
Air India flight AI-952 was preparing for take-off from the southern city of Hyderabad for Vishakapatnam, a coastal city, early on Sunday, when the rodent was seen running around the cabin, the Times of India daily reported.
Helpless passengers for the flight were forced to stay put at Hyderabad airport all through the day until airline staff managed to get rid of the rat, the report said.
An Air India official confirmed the incident to dpa, adding that it was being investigated but gave no further details.
The passengers continued on their journey only after staff carried out a fumigation to sanitise the flight and searched for any possible damage caused by the rat.
The report said there were ugly scenes at the airport as infuriated passengers checked with airline staff when their flight would take off.
Several among them took to social media to express their amusement and anger over the incident.
Rats on planes are reported occasionally and are thought to enter the aircraft most frequently through catering deliveries.
In 2017, a New Delhi-San Francisco Air India flight was delayed after a rodent was found on board while the aircraft was taxiing prior to take-off. (dpa/NAN)


--- layout: post title: gRPC releases Beta, opening door for use in production environments. published: true permalink: blog/beta_release attribution: Mugur Marculescu, gRPC ---
The gRPC team is excited to announce the immediate availability of gRPC Beta. This release marks an important point in API stability and going forward most API changes are expected to be additive in nature. This milestone opens the door for gRPC use in production environments.
We’re also taking a big step forward in improving the installation process. Over the past few weeks we’ve rolled out gRPC packages to Debian Stable/Backports. Installation in most cases is now a two line install using the Debian package and available language specific package managers (maven, pip, gem, composer, pecl, npm, nuget, pod). In addition gRPC docker images are now available on Docker Hub.
We’ve updated the documentation on grpc.io to reflect the latest changes and released additional language-specific reference docs. See what’s changed with the Beta release in the release notes on Github for Java, Go and all other languages.
In keeping in line with our principles and goal to enable highly performant and scalable APIs and microservices on top of HTTP/2, in the coming months, the focus of the gRPC project will be to keep improving performance and stability and adding carefully chosen features for production use cases. Documentation will also be clarified and will continue to improve with new examples and guides.
We’ve been very excited to see the community response to gRPC and the various projects starting to use it (etcd v3 experimental api, grpc-gateway for RESTful APIs and others).
We really want to thank everyone who contributed code, gave presentations, adopted the technology and engaged in the community. With your help support we look forward to the 1.0!


|
EKSKLUZIVNO!!! "Rogue One: A Star Wars Story"
od 15.12.2016 | Action, Adventure, Sci-Fi | 133 min "Rogue One: A Star Wars Story",
an upcoming American epic space opera film directed by Gareth Edwards and written by Chris Weitz, Tony Gilroy, and Gary Whitta, from a story idea by visual effects supervisor John Knoll.[1] It will be the first stand-alone Star Wars Anthology film. Set in the Star Wars universe some time after the events of Star Wars: Episode III – Revenge of the Sith and shortly before the events of the original Star Wars, the story will center on a group of Rebel spies on a mission to steal the plans for the Galactic Empire's new weapon, the Death Star. It will star Felicity Jones, Diego Luna, Ben Mendelsohn, Donnie Yen, Mads Mikkelsen, Alan Tudyk, Jiang Wen and Forest Whitaker. |
|
"Passengers" od 21.12.2016 | Adventure, Drama, Romance | 116 min
On a routine journey through space to a new home, two passengers, sleeping in suspended animation, are awakened 90 years too early when their ship malfunctions. As Jim and Aurora face living the rest of their lives on board, with every luxury they could ever ask for, they begin to fall for each other, unable to deny their intense attraction until they discover the ship is in grave danger. With the lives of 5,000 sleeping passengers at stake, only Jim and Aurora can save them all.
|
|
"Moana" od 23.11.2016 | Animation, Adventure, Comedy | 103 min
PAn adventurous teenager sails out on a daring mission to save her people.  Together they sail across the open ocean on an action-packed voyage, encountering enormous monsters and impossible odds. Along the way, Moana fulfills the ancient quest of her ancestors and discovers the one thing she always sought: her own identity.
|


{% extends 'base.html' %} {% block title %} Delete {% endblock %} {% block content %}
Are you sure wanna delete {{post.title}}?


Gift Factory
Home
Products
Contact Us
About Us
Cart
Let us choose your gift!
You need to answer some questions about the LUCKY GIFT RECIEVER!
START


Syrian Rue, Mushrooms - P. Cubensis, H.B. Woodrose Seeds & Cannabis
[Erowid Note: Combining MAOIs with other psychoactive drugs carries serious medical risks and can result in extremely unpleasant side effects, overheating, nausea, confusion, heart problems, and even death. Please see Erowid's MAOI Vault]
I took 2 capsules of syrian rue around 11:45, at 12:00 I ate 25g of Mushrooms, and also drank a solution containing 10 Hawaiian Baby Woodrose Seeds that I had made the night before. I noticed stomach irritation as I was drinking the solution, and retched when I got to the bottom, where all the bits of seeds had sunk.
For around an hour after this everything was fine, a normal trip, great OEVs, no noticable CEVs. By around 12:45 I decided to have a little smoke of some cannabis, to soothe my stomach, as I was feeling very groggy by then. The cannabis helped slightly, but at approximately 13:00 I vomited violently, which put me into major shock. The trip was coming on very very strong, and the shock of being sick made me want to go to sleep. This was very traumatic, I thought I was going to die, my breath was short, and I was shaking.
I proceeded to go to the bathroom at the other end of the house, with the intention of having a shower. Once I got there I couldn't walk properly, and managed to sit on the side of the bath, before I half-collapsed on the floor, unable to stand. This is where I stayed for the most part of the trip. I was sure I had died, by around 13:45 my trip sitter was very worried, and offered to call an ambulance, but I told him not to knowing that this would cause unnecessary stress on me, and my other friend who was also tripping on just mushrooms.
My trip sitter had to leave at 14:00, so I was alone in the bathroom. I have never experienced a trip of this magnitude, for the most part I had my eyes shut, in a sort of half sleep state. I felt like I was in another world, I was experiencing major auditory hallucinations, as well as OEVs and CEVs. I was convinced that I was going to be born again, as I had died. I felt like I was back in the womb, I could imagine anywhere and feel as if I was there.
The trip got stronger as I peaked, it must have been around 15:00 - 16:00 and I was still stuck in this catatonic state, singing and laughing to myself on the bathroom floor. By this time I think the shock had worn off, but I didn't try and get up. I felt like there was a warm blanket around me, protecting me. I can't explain in detail what was going through my mind at the time, as I can't fully remember. When I stretched I felt like I was a million miles long, I could perceive anything I wanted to by this stage.
By around 17:00 I had started to come down, my parents returned. I started to reawaken and by about 18:00 I emerged from my sanctuary. I still felt as if I had died, and I thought I may have gone to heaven, or been given a second chance. I couldn't understand what had happened. I was still seeing things in the wrong colours at around 19:00 and I think the effects only really wore off around 21:00.
This trip was possibly the most emotional experience of my life, I can't explain how mind blowing it was. I urge anyone who tries this combination to have a good trip sitter around, and to be prepared to vomit. I really wasn't expecting the vomit, and I think that is what sent this trip on a downward spiral. I would consider myself an experienced tripper, and I've experienced all these substances before, but this trip was much much much more intense than anything I have ever experienced before.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Was interviewed by Globe and Mail about “hacks” for student living. In this case I’ve done a bunch of work to find out cheaper alternatives to whiteboards.
I was originally inspired to start looking for cheaper versions of whiteboards after spending a weekend at Stanford’s D.School working on Ben Huh’s Moby Dick project.
The space is opinionated only in the sense of allowing space to be extemely flexible. Everything object within the building can be moved around to accomadate to “space” a team needs. If you’re curious, the below video explains it well.
I got mine from this Toronto home depot.
Lexan is the company that makes the highest quality boards. It is important to note that as the price goes down the grade (quality) of plastic goes down slightly.
If you’re interested here are a few other resources I found helpful along the way:
- Cheap whiteboard material can also be found online here
- Stanford’s D.School very thorough design handbook
- Creating a glass whiteboard - instructables
Someone also just sent me their (much bigger than mine) DIY whiteboard:
Let me know if you have any other questions or if you try anything different I’d love to know if it works better?


---
layout: post
title: Portuguese troops first position
date: '2016-07-07T18:30:27+02:00'
categories:
- Storyboards
- Aljubarrota
picture_url: https://film-Storyboards.tumblr.com/post/147065967297/portuguese-troops-first-position-during
---
Portuguese troops first position during Aljubarrota battle. Storyboard for floor projection screen for the multimedia exhibit at the Aljubarrota Battle Interpretation Center. That screen shows mostly maps and textures while the main screen (vertical) shows a film about the battle.


|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
| Class Summary | |
|---|---|
| CompoundConfiguration<C extends Configuration> | This class manages a SortedSet of child Configuration s
as well as being a Configuration itself. |
| Configuration | This base configuration class manages a set of Property s
for whatever thing the instance of this class represents. |
| ConfigurationCleaner | |
| ConfigurationUtils | Utility methods for handling tool configurations. |
| Data | This class represents configured data. |
| Data.AutoConverter | |
| Data.FieldConverter | |
| Data.NumberConverter | |
| EasyFactoryConfiguration | FactoryConfiguration subclass that simplifies the process of
configuring a ToolboxFactory in Java without the use of an
xml or properties configuration file. |
| EasyFactoryConfiguration.EasyData | |
| FactoryConfiguration | This class serves to define configuration info for a ToolboxFactory . |
| FileFactoryConfiguration | Provides support for reading a configuration file from a specified path, This frees the user from having to obtain an InputStream themselves. |
| LogSupport | This allows for a Log to optionally be attached to
a subclass in order to output logging messages. |
| OldXmlFactoryConfigurationRuleSet | Deprecated. This is provided merely for 1.x compatibility. |
| OldXmlFactoryConfigurationRuleSet.BooleanConfigRule | |
| OldXmlFactoryConfigurationRuleSet.CreateSessionRule | |
| OldXmlFactoryConfigurationRuleSet.DeprecationRule | |
| OldXmlFactoryConfigurationRuleSet.ParameterRule | |
| OldXmlFactoryConfigurationRuleSet.ScopeRule | |
| OldXmlFactoryConfigurationRuleSet.SetNextDataRule | |
| OldXmlFactoryConfigurationRuleSet.XhtmlRule | |
| PropertiesFactoryConfiguration | This reads in configuration info formatted as a property
file using ExtendedProperties from Commons-Collections. |
| Property | Simple extension of Data that treats "name" as an alias
for "key". |
| ToolboxConfiguration | This class handles configuration info for the Toolbox instances
that will eventually be produced by ToolboxFactory . |
| ToolConfiguration | This class handles configuration info for tools, including their key, classname, path restriction, and properties. |
| XmlFactoryConfiguration | This reads in configuration info formatted as an XML file
using Commons-Digester . |
| XmlFactoryConfigurationRuleSet | This provides set of XmlFactoryConfigurationRuleSet.DataValueInBodyRule s used by
Commons-Digester to process configuration info
formatted as XML. |
| XmlFactoryConfigurationRuleSet.DataValueInBodyRule | Rule for adding configuration properties |
| XmlFactoryConfigurationRuleSet.PropertyAttributeRule |
| Enum Summary | |
|---|---|
| Data.Type | Delineates the standard, known types and their
associated target classes (Data.setTargetClass(java.lang.Class) and
converters (Data.setConverter(java.lang.Class) ). |
| ToolConfiguration.Status |
| Exception Summary | |
|---|---|
| ConfigurationException | |
| InvalidScopeException | |
| NullKeyException |
| Annotation Types Summary | |
|---|---|
| DefaultKey | Annotation specifying the default key to use for a tool class in the case none was specified. |
| InvalidScope | |
| SkipSetters | Annotation specifying that ToolInfo
should only use the public void configure(Map) method for configuration of
a tool, and skip over the step of trying to find individual
property setters. |
| ValidScope |
|
|||||||||
| PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |


Vivo targets India’s online buyers with U20’s Snapdragon 675, 5000mAh battery, 18W charging at ₹10,990 (~$150)
by Tushar MehtaVivo is the third-largest smartphone brand in India by the number of shipments. Offline sales make up for the majority of Vivo’s sale in India and but lately, they have been trying to woo the consumers who prefer to buy online. In September, Vivo announced the U10, their first online-only smartphone in India and its primary virtue was the 5,000mAh battery. The company has today announced the second product in this series – the Vivo U20 – with a host of exciting features for attractive pricing and primarily targetted at the youth. The phone is already available in China as the Vivo U3.
The Vivo U20 is swanked with a radiant pattern on the back that is easily reminiscent of the Realme 3 Pro’s race-track inspired design. Vivo, however, goes a step further and uses golden accents around the triple rear camera and its logo on the back, which is laminated with a layer of plastic. On the front, there’s a 6.53-inch Full HD+ LCD display which comes with a Panda MN228 display protection, a Chinese alternative to Gorilla Glass.
In terms of its camera, the triple sensor setup includes a 16MP IMX499 primary sensor, an 8MP wide-angle sensor for 120º field of view, and a 2MP Super Macro sensor. On the front, there’s a 16MP camera for selfies. The rear camera can record 4K videos at 30fps or Full HD videos at 60fps.
Inside, there’s a Qualcomm Snapdragon 675 SoC powering the Vivo U20. There’s an option between 4GB and 6GB of RAM. Meanwhile, 64GB comes are the standard option for the UFS 2.1 storage. The storage can be extended up to an additional 256GB with a micro SD card.
The Vivo U20 carries over the large 5,000mAh battery from the U10 and also gets support for 18W fast charging via a micro USB port at the bottom of the phone. Additionally, the phone supports dual-band Wi-Fi and Bluetooth 5.0.
Vivo U20 Specifications
| Specifications | Vivo U20 |
|---|---|
| Dimensions & Weight | • 162.15 x 76.47 x 8.89 mm • 193g |
| Display | • 6.53-inch IPS LCD • 1080 x 2340 px • Panda MN228 display protection |
| SoC | • Qualcomm Snapdragon 675 • Adreno 612 GPU |
| RAM | 4GB/6GB |
| Storage | 64GB UFS 2.1 Dedicated microSD slot |
| Battery | 5,000mAh with 18W fast charging |
| Fingerprint Sensor | Rear-mounted fingerprint |
| Rear Camera | • 16MP primary sensor, f/1.78 • 8MP 120° wide-angle sensor, f/2.2 • 2MP Super Macro, f/2.4 • 4K video recording at 30fps |
| Front Camera | • 16MP, f/2.0 |
| Android Version | FunTouch OS 9 based on Android 9 Pie |
| Colors | Racing Black, Blaze Blue |
Price & Availability
The Vivo U20 will be available in India starting November 28th, 2019 via Amazon India and Vivo’s online store. The 4GB RAM variant is priced at ₹10,990 whereas the 6GB variant will come for ₹11,990. For the first few weeks of the sale, the Vivo U20 will get a discount of ₹1,000 on prepaid orders over both the channels.
Vivo U20 color options
Interestingly, Vivo announced the Y19 a couple of days ago, which is the same phone as the U20 but with a MediaTek Helio P65 SoC in place of the Snapdragon 675. Since the Y19 is not an online-only device, it is priced much higher with its 4GB/128GB variant selling for ₹13,990.


This is the About page. You may modify the following file to customize its content:
frontend\web\partials\about.html


TIES Measurement Report Automation Project
2021-07-09
1 Project overview
This project is developed to generate lengthy but informative measurement reports from survey data and Mplus measurement model outputs for projects at NYU Global TIES for Children.
Typically, a research institute like TIES has the obligation to generate detailed measurement reports to better inform the funders and the cooperating agencies about its most up-to-date work. However, even with a Word template, the process from analytical results to a publishable report is unnecessarily inefficent and prone to mistakes even for the most careful research assistant.
Therefore, we develop an R package called mrautomatr
to be used in conjunction with Rstudio to address this issue. Currently, the project only suits the need of NYU Global TIES, where we can impose naming rules for files and variables and most people use Mplus for measurement modeling and STATA for other analyses. Future adaptations are needed as people move their analysis to R.
The project workflow is shown below: the users specify parameters in a Microsoft Excel sheet and move several files to a destined folder, run a command in R, and (boom!) there is a well-formatted measurement report in Microsoft Word (powered by the flextable
& rmarkdown
R packages).
We chose Word over LaTex (which generates pdf files) and html (which generates web pages) simply to minimize the confusion around writing codes in R, which takes a long time to learn. Our hope is that even if you are new to R, you’ll still be able to use the package efficiently for your own report generation. After generating the reproducible parts of the report, feel free to rename it and manually edit the sections that are text-heavy. Check out an example rendered report here.
Check out the TIES R workshop series and Yihui Xie’s Rmarkdown book if you’d like to learn some necessary tools to customize your reporting formats using R.


Help us create small business plans and stock them to allow long term help to the poor families.By giving them a chance to work and earn a living.
I've noticed that when i help I feel more better and more happier, so I purpose to be more happier and a cheerful giver.
We have a few projects that you can choose to donate to. You can do a one time or you can be a regular member. Lets make sure we make the world a better place by uplifting the vulnerable.
Did you know we also have talent competations that only the host wins. This is done so we can boost and give more to support our dear sister/ brothers.
This projects are long term projects.
Far far away, behind the word mountains, far from the countries Vokalia and Consonantia, there live the blind texts.
Far far away, behind the word mountains, far from the countries Vokalia and Consonantia, there live the blind texts.
Far far away, behind the word mountains, far from the countries Vokalia and Consonantia, there live the blind texts.
We document every visit and to visit places and ensure everyone is on the know of where we going what we are doing and how much we are spending and with whom.


Homeschool Evaluations
By Cathy Nick
What is an Evaluation?
An evaluation is to determine a student’s progress and achievements. It is to help the educator determine if the student is being challenged to his/her best potential. An evaluation needs to be done by a licensed teacher, as set by the state of Colorado. An evaluation meets the state requirements for all grades. This means your student does not need to be formally tested. An evaluation, by law, must be done in a childs 3rd, 5th, 7th, 9th and 11th grade years.
An evaluation is a chance for the student to brag about what they have been learning. It is also an opportunity for parents to ask if they are on the right track and are using the best curriculum for their student. I am very low key and want the evaluation to be a good experience for both the student and the parent. Please do not stress about what your student may have lacking in their studies; what you are about to discover is what amazing things your student does know! Children have a way of surprising their parents!
An evaluation is to help you, not to bring what you’re doing at home under a microscope! Believe me, you are doing a wonderful job teaching at home! I will send you a hard copy or an email of the evaluation about a week after I have completed the evaluation. You will receive a brief, typed, detailed evaluation on your student. You will need to submit this evaluation to your umbrella school or keep it in your homeschool file. You do not have to send this until September, with your letter of intent. The entire evaluation will take about 45 minutes to an hour.
What I need if you Choose an Evaluation
I will need a sample of math, writing, and reading books. Bring me any curriculum you are using and I will take it from there. Bring with you a current book your student is reading, as your student will be reading to me for about 5 minutes. I will be looking at sentence structure in writing, along with grammar. Spelling is one subject that I am least concerned with, as spelling is a phonetic exercise and comes with seeing words over and over again. I will also need to see that you are doing some Science, History or Geography at home.
This can be a list of books or the student and parent can verbally tell me what they have been doing for the year.


- The css on this page isn't right! Redo it so it fits the bootstrap css.
- Give the page the correct title/header, instead of 'tag list'.
- Create a json file that lists the users who are following (or followed by) this profile.
- Output the users onto this page.
Keep going:
There are three more links at the left, but no components exist for them. Following the
pattern you've seen/created in these other components, create three new component folders:
communities, account, and support.


Politics
This page contains the names of faculty in the Politics department and their picture.
Dina Badie
Robert Bosco
Lori Hartmann
Jaclyn Johnson
Benjamin Knoll
Chris Paskewich
Daniel G. Stroup
Home Page


001/* 002 * Licensed to the Apache Software Foundation (ASF) under one or more 003 * contributor license agreements. See the NOTICE file distributed with 004 * this work for additional information regarding copyright ownership. 005 * The ASF licenses this file to You under the Apache License, Version 2.0 006 * (the "License"); you may not use this file except in compliance with 007 * the License. You may obtain a copy of the License at 008 * 009 * http://www.apache.org/licenses/LICENSE-2.0 010 * 011 * Unless required by applicable law or agreed to in writing, software 012 * distributed under the License is distributed on an "AS IS" BASIS, 013 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. 014 * See the License for the specific language governing permissions and 015 * limitations under the License. 016 */ 017package org.apache.commons.text.diff; 018 019/** 020 * This interface should be implemented by user object to walk 021 * through {@link EditScript EditScript} objects. 022 * <p> 023 * Users should implement this interface in order to walk through 024 * the {@link EditScript EditScript} object created by the comparison 025 * of two sequences. This is a direct application of the visitor 026 * design pattern. The {@link EditScript#visit EditScript.visit} 027 * method takes an object implementing this interface as an argument, 028 * it will perform the loop over all commands in the script and the 029 * proper methods of the user class will be called as the commands are 030 * encountered. 031 * </p> 032 * <p> 033 * The implementation of the user visitor class will depend on the 034 * need. Here are two examples. 035 * </p> 036 * <p> 037 * The first example is a visitor that build the longest common 038 * subsequence: 039 * </p> 040 * <pre> 041 * import org.apache.commons.text.diff.CommandVisitor; 042 * 043 * import java.util.ArrayList; 044 * 045 * public class LongestCommonSubSequence implements CommandVisitor { 046 * 047 * public LongestCommonSubSequence() { 048 * a = new ArrayList(); 049 * } 050 * 051 * public void visitInsertCommand(Object object) { 052 * } 053 * 054 * public void visitKeepCommand(Object object) { 055 * a.add(object); 056 * } 057 * 058 * public void visitDeleteCommand(Object object) { 059 * } 060 * 061 * public Object[] getSubSequence() { 062 * return a.toArray(); 063 * } 064 * 065 * private ArrayList a; 066 * 067 * } 068 * </pre> 069 * <p> 070 * The second example is a visitor that shows the commands and the way 071 * they transform the first sequence into the second one: 072 * <pre> 073 * import org.apache.commons.text.diff.CommandVisitor; 074 * 075 * import java.util.Arrays; 076 * import java.util.ArrayList; 077 * import java.util.Iterator; 078 * 079 * public class ShowVisitor implements CommandVisitor { 080 * 081 * public ShowVisitor(Object[] sequence1) { 082 * v = new ArrayList(); 083 * v.addAll(Arrays.asList(sequence1)); 084 * index = 0; 085 * } 086 * 087 * public void visitInsertCommand(Object object) { 088 * v.insertElementAt(object, index++); 089 * display("insert", object); 090 * } 091 * 092 * public void visitKeepCommand(Object object) { 093 * ++index; 094 * display("keep ", object); 095 * } 096 * 097 * public void visitDeleteCommand(Object object) { 098 * v.remove(index); 099 * display("delete", object); 100 * } 101 * 102 * private void display(String commandName, Object object) { 103 * System.out.println(commandName + " " + object + ": " + this); 104 * } 105 * 106 * public String toString() { 107 * StringBuffer buffer = new StringBuffer(); 108 * for (Iterator iter = v.iterator(); iter.hasNext();) { 109 * buffer.append(' ').append(iter.next()); 110 * } 111 * return buffer.toString(); 112 * } 113 * 114 * private ArrayList v; 115 * private int index; 116 * 117 * } 118 * </pre> 119 * 120 * @param <T> object type 121 * @since 1.0 122 */ 123public interface CommandVisitor<T> { 124 125 /** 126 * Method called when an insert command is encountered. 127 * 128 * @param object object to insert (this object comes from the second sequence) 129 */ 130 void visitInsertCommand(T object); 131 132 /** 133 * Method called when a keep command is encountered. 134 * 135 * @param object object to keep (this object comes from the first sequence) 136 */ 137 void visitKeepCommand(T object); 138 139 /** 140 * Method called when a delete command is encountered. 141 * 142 * @param object object to delete (this object comes from the first sequence) 143 */ 144 void visitDeleteCommand(T object); 145 146}


Downtown Bazooka
Rocket-Jumping 3rd-Person Shooter and Platformer
Armed with only a bazooka and the will to survive, you fight your way past countless enemies to discover the waypoints that lead you to the final boss. Defeat him and the world is yours!
The Game
Downtown Bazooka is a rocket-jumping third-person action & exploration platformer written in C++ using SFML and OpenGL for my sophomore year Video Game Development Club project. The objective is to reach all of the waypoints and then defeat the final boss.
The idea of the game actually came from just the name, which one of the officers in the club had created by using a random game name generator. Drawing inspiration from the likes of Tron and Mad Max, we created a vast 3D world in which players could explore infinitely.
The Team
The Lessons
Downtown Bazooka presented me with a unique opportunity that I have yet to deal with again: the ability to work with a custom C++ game engine (written by John), and write code using that engine.
For programming, the most valuable thing I learned was being able to read and understand other people's code. It was a skill that I had not really had the chance to use until this project, as being able to read the engine code and understand what parts of it I needed to use was an important part of being able to contribute to this project.
Additionally, I had a lot of fun designing and programming the final boss battle. I also implemented some other things, such as the health bar, the items, etc., which would have only taken a few seconds in Unity, but ended up taking much longer in this project due to having to learn how the engine works.


// inherited from ti-widget-base-text
// inherited from ti-widget-base-text
// inherited from ti-widget-base-input
// inherited from ti-widget-base-text
// inherited from ti-widget-base-numberbox
// inherited from ti-widget-base-input
// inherited from ti-widget-base-text
// inherited from ti-widget-base-numberbox
// inherited from ti-widget-base-input
// inherited from ti-widget-base-text
Button


Geospatial charts & Statistics
Geospatial charts: it returns a matplotlib figure which is ready to be added to the
map.
Statistics: it returns a dictionary with all the available statistics as well as a matplotlib
histogram of the relevant data features.


Salmon Cookies-Sales Page
Home
Adding a new store
Store Name
minmmum customer/h
maximmum customer/h
Average cookies /c
The Average of our sales in each branch, Seattle, Tokyo, Dubai, Paris, Lima.


Recommended Reading
Interaction of Color
Josef Albers
How to Make Sense of Any Mess
Abby Covert
The Form of the Book
Jan Tschichold
Grid Systems in Graphic Design
Joseph Müller-Brockmann
The Elements of Typographic Style
Robert Bringhurst
The Design of the UNIX Operating System
Maurice J. Bach
On Writing Well
William Zinser
The Art of Looking Sideways
Alan Fletcher


Andrew Prisekin
Web-development
Little more about myself
Super-duper-high proffesional.
Skills
I enjoy writing front-end code with these technologies.
HTML
CSS
JS
PHP
How to contact me
Mobile phone: +7-999-999-99-99
email<EMAIL_ADDRESS>LinkedIn


--- layout: page title: About permalink: /about/ public: true nocomments: true ---
|
Utkarsh Shigihalli
Microsoft ALM MVP | Microsoft ALM Ranger Follow @onlyutkarsh Follow @onlyutkarsh |
|
|
Tarun Arora
Microsoft ALM MVP | Microsoft ALM Ranger Follow @arora_tarun |


A van design for the Richland County Public Library highlighting their painting studio.
A van design for the Richland County Public Library highlighting their woodworking studio.
A van design created using the 3D modeling software Blender to promote the 3D modeling classes taught at the library.
CyberChain is a public cyber security supply chain analysis tool, CyberCert is the offshoot commercial product.
Custom app for the Daedalus artifical intelligence conference.
Designs created for the Cola Hacks Hackathon and the USC Data Lab I co-founded.
A mural painted for the Columbia city government.
A large scale commission painting for Kroger grocery stores.
A page from a booklet about Project Management Methodologies for the Richland Library.
A vector illustration of an astronaut's glove and a raster image of an astronaut created by corrupting image data.
Shirt Designs for the Blank Walls Paint Company.
Web icons for use on the CyberChain website.
Logo and brand identity sheet for the PlanetNine zine.
Space themed badges representing levels of achievement in the RCPL summer reading challenge.
3 years of posters and web banners for the USC Photo Festival.