The Australian Pink Floyd Show is returning to Birmingham this weekend and you can still get tickets
The world famous tribute act are bringing the All That You Love tour to Arena Birmingham tomorrow night
by Becky Weaver, https://www.birminghammail.co.uk/authors/becky-weaver/The Australian Pink Floyd Show is embarking on a brand now tour, and Birmingham is the next stop!
Dubbed as one of the world's greatest tribute bands, they'll be bringing the 'All That You Love World Tour' to Arena Birmingham tomorrow (Saturday, November 9, 2019).
Since forming, they've sold more than four million tickets to their concerts across the globe, which celebrates the music of the iconic Pink Floyd.
What started as a tribute to one of the biggest bands of all time turned into a global phenomenon.

The band will kicked off the 28-date leg of their UK tour at Harrogate Convention Centre on Friday, November 1, 2019, and will be taking it to cities far and wide right through to December.
A full list of dates for the tour can be found here.
Fans can expect to hear all of the classics including Dark Side of the Moon, Wish You Were Here, Animals, The Wall and many more.
Tickets for the All That You Love World Tour are on sale now.
You can book yours through The Ticket Factory by clicking here.


WITNESS LIST Finance Committee March 4, 2003 - 8:00A Article III, Available University F ON: Francis, Pat Manager (Legislative Budget Board), Austin, TX Sullivan, Teresa Executive Vice Chancellor (UT System), Austin, TX Wallace, Randy Assistant Vice Chancellor - Controller (UT System), Austin, TX Article III, Higher Ed. Coordinatin FOR: Maddox, Mary Beth UT Engineering Corporate Relations Dir. (Texas Engineering & Technical Consortium), Austin, TX McDonald, Carol Association Executive (Independent Colleges & Universities of Texas), Austin, TX Pulley, Tegwin Vice President, Texas Instruments (Texas Engineering and Technical Consortuim), Dallas, TX Salzberg, Bonnie Chief Nursing Officer (Texas Hospital Association, Texas Nurses Association), Austin, TX ON: Baisden, Debbie Senior Analyst (Legislative Budget Board), Austin, TX Brown, Don Commissioner (Texas Higher Education Coordinating Board), Austin, TX Flack, Teri Deputy Commissioner (Texas Higher Education Coordinating Board) Smith, James (State Comptroller's Office), Austin, TX Willeford, Pamela (Texas Higher Education Coordinating Board) Registering, but not testifying: For: Carter, Janis Consultant (Texas Instruments), Austin, TX Kester, Steve Executive Director (American Electronics Association) Mayes, Gray Director, Public Affairs, TX Instruments (Texas Engineering & Technical Consortium), Dallas, TX On: Sjoberg, Elizabeth Associate General Counsel (Texas Hospital Association), Austin, TX Willmann, James Attorney (Texas Nurses Association), Austin, TX Article III, Higher Education Fund ON: Francis, Pat Manager (Legislative Budget Board), Austin, TX Article III, Texas Excellence Fund ON: Francis, Pat Manager (Legislative Budget Board), Austin, TX Article III, Texas Tech University ON: Dyer, Joe Analyst (Legislative Budget Board), Austin, TX Francis, Pat Manager (Legislative Budget Board), Austin, TX Haragan, Don Interim President (Texas Tech University), Lubbock, TX Registering, but not testifying: On: Gilbert, Lynda Vice President for Fiscal Affairs (Texas Tech University), Lubbock, TX ON: Black, C. Robert Chairman, Board of Regents (Texas Tech University System) Brunses, Jim CFO (Texas Tech University System), Lubbock, TX Smith, David Chancellor (Texas Tech University System), Lubbock, TX Article III, University of North Te ON: Pohl, Norval President (University of North Texas) Registering, but not testifying: On: Parker, Walt Vice Chancellor - Governmental Affairs (University of North Texas) ON: Dyer, Joe Analyst (Legislative Budget Board), Austin, TX Jackson, Lee Chancellor (Universtity of North Texas System) Registering, but not testifying: On: Diebel, Phil Vice Chancellor for Finance (University of North Texas System) Article III, University Research Fu ON: Francis, Pat Manager (Legislative Budget Board), Austin, TX Article III, UT - Pan American ON: Dyer, Joe Analyst (Legislative Budget Board), Austin, TX Ende, Frederick Von Educational Administration (University of Texas - Pan American), Edinburg, TX Nevarez, Miguel Higher Education (University of Texas - Pan American) Registering, but not testifying: On: Gonzalez, Juan Educational Administration (University of Texas - Pan American), Edinburg, TX Article III, UT at Arlington ON: Baisden, Debbie Senior Analyst (Legislative Budget Board), Austin, TX Dunn, Dana Vice President for Academic Affairs (University of Texas at Arlington) Dyer, Joe Analyst (Legislative Budget Board), Austin, TX Sorber, Charles Interim President (University of Texas at Arlington), Arlington, TX Williams, Dan Chief Business Officer (University of Texas at Arlington), Arlington, TX Wright, George Educator (University of Texas at Arlington) Article III, UT at Austin ON: Faulkner, Larry President (University of Texas at Austin), Austin, TX Registering, but not testifying: On: Hegarty, Kevin UT Austin Finances (University of Texas at Austin), Austin, TX Monti, Stephen (University of Texas at Austin), Austin, TX Article III, UT at Brownsville ON: Dyer, Joe Analyst (Legislative Budget Board), Austin, TX Garcia, Dr. Julieta President (University of Texas at Brownsville) Registering, but not testifying: On: Martinez, Rosemary Vice President - Business Affairs (University of Texas at Brownsville) Zavaleta, Dr. Tony Vice President (University of Texas at Brownsville) Article III, UT at Dallas ON: Jenifer, Franklyn President (University of Texas at Dallas), Richardson, TX Registering, but not testifying: On: Lovitt, Robert UP Business Affairs (University of Texas at Dallas), Richardson, TX Article III, UT at El Paso ON: Adanto, Richardo Assistant to President (University of Texas at El Paso) Dyer, Joe Analyst (Legislative Budget Board), Austin, TX Sullivan, Teresa Executive Vice Chancellor (UT System), Austin, TX Villa, Cynthia (University of Texas at El Paso) Article III, UT at San Antonio ON: Bailey, Guy Provost and Executive Vice President (University of Texas at San Antonio), San Antonio, TX Dyer, Joe Analyst (Legislative Budget Board), Austin, TX Larson, David (University of Texas at San Antonio) Romo, Ricardo President (Universtiy of Texas at San Antonio) Article III, UT at Tyler ON: Mabry, Rodney President of Higher Ed. Institution (University of Texas at Tyler), Tyler, TX Registering, but not testifying: On: Ferguson, Jim Vice President for Business Affairs (University of Texas at Tyler), Tyler, TX Lunsford, Dale Vice President (University of Texas at Tyler), Tyler, TX Article III, UT of the Permian Basi ON: Watts, David Higher Education (University of Texas of the Permian Basin), Odessa, TX Registering, but not testifying: On: Forrest, Christopher Vice President - Business Affairs (University of Texas of the Permian Basin), Odessa, TX Article III, UT System Introduction ON: Francis, Pat Manager (Legislative Budget Board), Austin, TX Sullivan, Teresa Executive Vice Chancellor (UT System), Austin, TX Registering, but not testifying: On: Scott, Tom Associate Vice Shancellor (UT System), Austin, TX Wallace, Randy Assistant Vice Chancellor - Controller (UT System), Austin, TX


MY BEAUTIFUL LIFE
MICROBLOG
WECHAT
QQ
"I want to give good things to record down,
after the recall will be very beautiful."
after the recall will be very beautiful."
Cool Image
Record The Picture
Great Picture
Record The Picture
Cool Image
Record The Picture
FROM THE PHOTO ALBUM
- Life is like a book, just read more and more refined, more write more carefully. When read, mind open, all things have been indifferent to heart. Life is the precipitation.
- Life is like a book, just read more and more refined, more write more carefully. When read, mind open, all things have been indifferent to heart. Life is the precipitation.


06 December 1996
Disease Outbreak Reported
The patient who died on 5 November 1996 in a Libreville hospital was retrospectively identified as the contact of the Gabonese physician with Ebola fever who went to South Africa for medical care. No further cases have been detected among the 201 contacts traced to this patient. Surveillance of the contacts ended on 27 November. The total number of cases reported since the outbreak started remain at 27 of which 19 were fatal. On 5 December 8 patients were convalescing. Passive surveillance will continue until the outbreak can be declared over which will be on 17 December if no new cases are identified.
Health care personnel in hospitals and health centres in Libreville are provided with information and training sessions with documentation for the care and barrier nursing of cases of viral haemorrhagic fever. Appropriate infrastructures have been established to manage severe cases of diarrhoea with fever.


FireObject Class
Internally used "class" of objects - it has methods for initiating new or existing objects of that class in the Firebase This class should not be created directly! (Unless you know what you are doing)
Constructor
FireObject
-
objectClass
-
rootRef
-
objFire
Parameters:
-
objectClass
ObjectClassThe class that this FireObject makes.
-
rootRef
FirebaseFirebase object that is the root of the Firebase.
-
objFire
ObjectiveFireReferences to the ObjectiveFire that made this FireObject.
Methods
instance
-
id
Creates an instance of the class from data existing in the Firebase. Any parameters passed after id will be interpreted as properties to load. Ex: myObject.instance("some_firebase_id", "some_property", "some_other_property"); This would cause myObject to automatically $load() "some_property" and "some_other_property"
Parameters:
-
id
StringThe id of this object in the Firebase. (it's key)
Returns:
Existing instance of the class
new
()
Creates a new instance of the class. It invokes the classes' constructor with the arguments provided to this method. If no constructor is provided an empty object will be created. Any properties created by the constructor will be $save (d) to the Firebase.
Returns:
New instance of the class


In Tamriel, persons born under certain constellations are said to be
"fortunate in their aspects". Such persons are often blessed --
or cursed -- with remarkable abilities or weaknesses as a result of the
magical conjunctions of celestial influences.


| nest_by {dplyr} | R Documentation |
nest_by()
is closely related to group_by()
. However, instead of storing
the group structure in the metadata, it is made explicit in the data,
giving each group key a single row along with a list-column of data frames
that contain all the other data.
nest_by()
returns a rowwise data frame, which makes operations on the
grouped data particularly elegant. See vignette("rowwise")
for more
details.
nest_by(.data, ..., .key = "data", .keep = FALSE)
.data |
A data frame, data frame extension (e.g. a tibble), or a lazy data frame (e.g. from dbplyr or dtplyr). See Methods, below, for more details. |
... |
In |
.key |
Name of the list column |
.keep |
Should the grouping columns be kept in the list column. |
Note that df %>% nest_by(x, y)
is roughly equivalent to
df %>% group_by(x, y) %>% summarise(data = list(cur_data())) %>% rowwise()
If you want to unnest a nested data frame, you can either use
tidyr::unnest()
or take advantage of summarise()
s multi-row behaviour:
nested %>% summarise(data)
A rowwise data frame. The output has the following properties:
The rows come from the underlying group_keys()
.
The columns are the grouping keys plus one list-column of data frames.
Data frame attributes are not preserved, because nest_by()
fundamentally creates a new data frame.
A tbl with one row per unique combination of the grouping variables. The first columns are the grouping variables, followed by a list column of tibbles with matching rows of the remaining columns.
This function is a generic, which means that packages can provide implementations (methods) for other classes. See the documentation of individual methods for extra arguments and differences in behaviour.
The following methods are currently available in loaded packages: no methods found.
# After nesting, you get one row per group iris %>% nest_by(Species) starwars %>% nest_by(species) # The output is grouped by row, which makes modelling particularly easy models <- mtcars %>% nest_by(cyl) %>% mutate(model = list(lm(mpg ~ wt, data = data))) models models %>% summarise(rsq = summary(model)$r.squared) # This is particularly elegant with the broom functions if (requireNamespace("broom", quietly = TRUE)) { models %>% summarise(broom::glance(model)) models %>% summarise(broom::tidy(model)) } # Note that you can also summarise to unnest the data models %>% summarise(data)


CHANGELOG
php datagrid with jquery, jquery-ui and bootstrap frontend. Simple, secure, easy to use.
Copyright Christos Pontikis http://www.pontikis.net
Project page https://github.com/pontikis/php_bs_grid
License MIT
Release 0.9.6 (16 July 2017)
- bug fix - multiple autocomplete failed #30
- skip_in_excel_export column option #29
Release 0.9.5 (02 July 2017)
- add operators to multiselect_checkbox (one or more of, not given) #22
- add operators to autocomplete (equal, not given) #23
- add not equal operator to lookup filters #27
- ability to append/prepend element in filters #26
- added
showCriterion
method - less or greater operators (date, number criteria) #24
- Implement number criteria #2
- use UTF-8 for column headers in PHPExcel (column header may contain html special chars) #21
- documentation #20
Release 0.9.4 (20 June 2017)
- documentation #20
- Fixed where SQL #19
- pass serialized params from php to javascript #18
- Save status to SESSION #17
- Implement multiselect_checkbox criteria #11
- Implement autocomplete criteria #14
- Implement datetime criteria #15
- Fixed WHERE statements (beyond filters applied by the user interface) #13
- Added sort_simple_default_order column property #12
Release 0.9.3 (15 May 2017)
- trim filter values #10
- filter min chars (after trim) #9
- fix typo (th_class instead of td_class) in displayTableData #8
Release 0.9.2 (14 Apr 2017)
- bug fixed - Ajax error on press Enter (13) #7
- Rows per page always visible (top row) #6
Release 0.9.1 (13 Apr 2017)
- bugs using [is_null] operators (fixed) #5
- minified js version added
Release 0.9.0 (10 Apr 2017)
- Excel export added (CSV export removed) #4
Release 0.8.0 (9 Apr 2017)
Basic functionality #1
- Customizable columns
- Pagination
- Simple column sorting
- Advanced sorting
- Filters (text, lookup, date)
- Export (CSV)
- Multilanguage
- Support prepared statements
- Responsive design
Release 0.1.0 (3 Apr 2017)
- just started


UNIX and Linux System Administration Handbook, 4th Edition
ISBN-13:<PHONE_NUMBER>056
ISBN-10:<PHONE_NUMBER>
Authors: Evi Nemeth; Garth Snyder; Trent R. Hein; Ben Whaley
Edition: 4th
Binding: Paperback
Publisher: Prentice Hall
Published: July 2010
List Price: $74.99


# Please input Markdown
Enter
Leave
Both(Enter/Leave)
Permanent link
This is a parts of
azu/textlint
markdown-to-ast: online parsing demo
txt-to-ast: online parsing demo


I had a day off in the middle of the week and had nothing to do, so I hit up the internet to see if I had anything to spice up my midday. I searched my medicine cabinet to find that my wife had grabbed 40 mg of her brothers Ritalin (this must have been 5 years ago because the bottle said to take by 2002). After reviewing the experiences I decided the pros outweigh the cons. All doses are insufflated.
Took 2 10mg pills:
Nothing happened in the timeframe some reports stated (5-10 minutes, should feel the rush) so I looked online to see what the shelf life was, 2 YEARS! I was bummed thinking I had just snorted an unpleasant tasting substance for not. But as I was in the middle of my internet search on the shelf life, it hit me. It was sudden, and heavy but not overbearing. I continued my search on the diminishing effects of aged Ritalin. The effects were good, similar to coke like a lot of experiences stated. Good rush, energy and euphoria. I decide to take the last 20 mg. I would have saved the rest for my wife but she is pregnant so I didnít feel bad binging.
Took second 2 10mg dose, 15 minutes after initial dose.
I am writing this as the second wave hits. It is good but not as strong as I hoped. It seems to come in waves though so I am not done yet.
All in all a good high. Nothing too special but a nice bump in the middle of the day.
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.


John Vines, Rachel Clarke, Peter Wright, John McCarthy, Patrick Olivier
They specifically drawn on Ehn concerning the use of boundary objects in workshops.
"the term’s use in HCI has been drawn from participatory design, an approach to the design of technology that calls for democratization and end-user involvement in the design process"
"three of the main goals that have motivated user participation in design processes within HCI: sharing control, sharing expertise and inspiring change"
"Ehn [15,16] refers to how the setting of such workshops is typically situated around the formation of ‘boundary objects’ [49], which act
as shared articulations of knowledge of those participating in the design process. For example, Ehn discusses how participatory design workshops would involve the acting out of scenarios by workers with cardboard boxes that serve as imaginary computers"
Future workshops
Metaphorical design
Inspiration cards
Ehn


One Slice Is Never Enough
****two for the price of one :pizza:****
Monday
Teusday
Wednesday
Thursday
Friday
Sartuday
Sunday
welcome


| Task | Training Data | Training Ground Truth | Validation Data | Validation Ground Truth | Test Data | Test Ground Truth | License |
|---|---|---|---|---|---|---|---|
| 1 |
Download (10.4GB)
2594 images and 12970 corresponding ground truth response masks (5 for each image). |
Download (26MB)
|
Download (228MB) | Download (742KB) |
Download (2.2GB)
1000 images. |
Download (9MB) | CC-0 |
| 2 |
Download (33MB)
|
Download (1MB) | Download (11MB) | ||||
| 3 |
Download (2.6GB)
Download (481KB)
|
Download (36KB) | Download (51MB) | Download (7KB) |
Download (401MB)
1512 images. |
Download (11KB) | CC-BY-NC |
When referencing this dataset in your own manuscripts and publications, please use the following full citations:HAM10000 Dataset: (c) by ViDIR Group, Department of Dermatology, Medical University of Vienna; https://doi.org/10.1038/sdata.2018.161
MSK Dataset: (c) Anonymous; https://arxiv.org/abs/1710.05006; https://arxiv.org/abs/1902.03368
[1] Noel Codella, Veronica Rotemberg, Philipp Tschandl, M. Emre Celebi, Stephen Dusza, David Gutman, Brian Helba, Aadi Kalloo, Konstantinos Liopyris, Michael Marchetti, Harald Kittler, Allan Halpern: "Skin Lesion Analysis Toward Melanoma Detection 2018: A Challenge Hosted by the International Skin Imaging Collaboration (ISIC)", 2018; https://arxiv.org/abs/1902.03368
[2] Tschandl, P., Rosendahl, C. & Kittler, H.  Sci. Data 5, 180161 doi:10.1038/sdata.2018.161 (2018).


|
| Value |
Description |
Notes |
|
| ABR |
Abridged edition |
Content has been shortened: use for abridged, shortened, concise, condensed |
| ACT |
Acting edition |
Version of a play or script intended for use of those directly involved in a production, usually including full stage directions
in addition to the text of the script
|
| ADP |
Adapted edition |
Content has been adapted to serve a different purpose or audience, or from one medium to another: use for dramatization, novelization
etc. Use <EditionStatement> to describe the exact nature of the adaptation
|
| ALT |
Alternate |
Do not use. This code is now DEPRECATED, but is retained in the list for reasons of backwards compatibility |
| ANN |
Annotated edition |
Content is augmented by the addition of notes |
| BLL |
Bilingual edition |
Both languages should be specified in the <Language> group. Use MLL for an edition in more than two languages |
| BLP |
Bilingual ‘facing page’ edition |
Use only where the two languages are presented in parallel on facing pages, or in parallel columns of text on a single page
(otherwise use BLL). Both languages should be specified in the <Language> group
|
| BRL |
Braille edition |
Braille edition |
| CMB |
Combined volume |
An edition in which two or more works also published separately are combined in a single volume; AKA ‘omnibus’ edition |
| CRI |
Critical edition |
Content includes critical commentary on the text |
| CSP |
Coursepack |
Content was compiled for a specified educational course |
| DGO |
Digital original |
A digital product that, at the time of publication, has or had no print counterpart and that is or was not expected to have
a print counterpart for a reasonable time (recommended at least 30 days following publication)
|
| ENH |
Enhanced edition |
Use for e-publications that have been enhanced with additional text, speech, other audio, video, interactive or other content |
| ENL |
Enlarged edition |
Content has been enlarged or expanded from that of a previous edition |
| EXP |
Expurgated edition |
‘Offensive’ content has been removed |
| FAC |
Facsimile edition |
Exact reproduction of the content and format of a previous edition |
| FST |
Festschrift |
A collection of writings published in honor of a person, an institution or a society |
| ILL |
Illustrated edition |
Content includes extensive illustrations which are not part of other editions |
| INT |
International edition |
A product aimed specifically at markets other than the country of original publication, usually titled as an ‘International
edition’ and with specification and/or content changes
|
| LTE |
Large type / large print edition |
Large print edition, print sizes 14 to 19pt – see also ULP |
| MCP |
Microprint edition |
A printed edition in a type size too small to be read without a magnifying glass |
| MDT |
Media tie-in |
An edition published to coincide with the release of a film, TV program, or electronic game based on the same work. Use <EditionStatement>
to describe the exact nature of the tie-in
|
| MLL |
Multilingual edition |
All languages should be specified in the ‘Language’ group. Use BLL for a bilingual edition |
| NED |
New edition |
Where no other information is given, or no other coded type is applicable |
| NUM |
Edition with numbered copies |
A limited edition in which each copy is individually numbered. Use <EditionStatement> to give details of the number of copies
printed
|
| PRB |
Prebound edition |
In the US, a book that was previously bound, normally as a paperback, and has been rebound with a library-quality hardcover
binding by a supplier other than the original publisher. See also the <Publisher> and <RelatedProduct> composites for other
aspects of the treatment of prebound editions in ONIX
|
| REV |
Revised edition |
Content has been revised from that of a previous edition |
| SCH |
School edition |
An edition intended specifically for use in schools |
| SIG |
Signed edition |
Individually autographed by the author(s) |
| SMP |
Simplified language edition |
An edition that uses simplified language (Finnish ‘Selkokirja’) |
| SPE |
Special edition |
Use for anniversary, collectors’, de luxe, gift, limited (but prefer codes NUM or UNN as appropriate), autographed (but prefer
code SIG as appropriate) edition. Use <EditionStatement> to describe the exact nature of the special edition
|
| STU |
Student edition |
Where a text is available in both student and teacher’s editions |
| TCH |
Teacher’s edition |
Where a text is available in both student and teacher’s editions; use also for instructor’s or leader’s editions, and for
editions intended exclusively for educators where no specific student edition is available
|
| UBR |
Unabridged edition |
Where a title has also been published in an abridged edition; also for audiobooks, regardless of whether an abridged audio
version also exists
|
| ULP |
Ultra large print edition |
For print sizes 20pt and above, and with typefaces designed for the visually impaired – see also LTE |
| UNN |
Edition with unnumbered copies |
A limited edition in which each copy is not individually numbered – but where the actual number of copies is strictly limited.
Use <EditionStatement> to give details of the number of copies printed
|
| UXP |
Unexpurgated edition |
Content previously considered ‘offensive’ has been restored |
| VAR |
Variorum edition |
Content includes notes by various commentators, and/or includes and compares several variant texts of the same work |
|


Before Change
new_image = scipy.ndimage.interpolation.zoom(image, factor, order=3)
if np.any(full_shape < 0):
new_shape = np.zeros_like(full_shape)
new_shape[full_shape == 0] = new_image.shape
new_shape[full_shape == -1] = 1
new_image = new_image.reshape(new_shape)
return new_image
def _preserve_shape(self, image, shape, crop=CROP_CENTER):
After Change
image = self.get(ix, components)
factor = 1. * np.asarray([*shape]) / np.asarray(image.shape[:2])
if len(image.shape) > 2:
factor = np.concatenate((factor, [1.] * len(image.shape[2:])))
new_image = scipy.ndimage.interpolation.zoom(image, factor, order=3)
return new_image


Burna Boy African singer
The Nigerian singer-songwriter, Burna Boy, was born Damini Ogulu in Port Harcourt City, Nigeria. He started producing music when he was ten years old. With his fusion of dancehall, reggae, Afro-beat, and pop, Burna Boy emerged in the early part of the 2010s as one of Nigeria's fastest-rising stars. The LeriQ-produced 2012 single "Like to Party" proved to be his breakout track and paved the way for his full-length debut, L.I.F.E, a year later. Over the next five years, Burna released two more albums and collaborated with a variety of artists, from J Hus and Skales to Fall Out Boy and Lilly Allen. His international exposure widened with 2018's Outside, which hit number three on the Billboard Reggae chart and won the Nigeria Entertainment Award for Album of the Year. In advance of his next LP, 2019's African Giant, Burna made his first appearance at California's Coachella festival. Burna Boy was born Damini Ogulu in Lagos in 1991. He began making music at just ten years old when a fellow classmate at school gave him a copy of the production software FruityLoops. Armed with these means, he began to create his own beats on an old computer. After he graduated, he moved to London to attend university, but he dropped out after two years and moved back to Nigeria. In 2010, the 19-year-old Ogulu traveled to Nigeria's southern coast, where a mutual acquaintance, producer LeriQ, had some studio space. This marked a period when he began to connect to the music of his native country, having spent most of his youth immersed in American acts like DMX. He delved into the dancehall and reggae music his father listened to and explored the Afro-beat music preferred by his grandfather (who had also been Fela Kuti's first manager). As a result of his new discoveries, Ogulu created a confluence of genres that would become his signature sound.
Burna delivered his third album
With production by LeriQ, Burna Boy created "Like to Party," which marked his rise to prominence and generated a local buzz along the way. 2013 saw the release of his debut studio album; featuring guest slots from Wizkid, Timaya, 2face, and M.I., L.I.F.E drew favorable reviews from the music press. For his sophomore effort, 2015's On a Spaceship, Burna parted ways with both his record company and LeriQ, and delivered a record even more diverse than his first. In 2017, he teamed up with producer Juls for the single "Rock Your Body." A host of singles followed throughout the year, including "GBA," "Streets of Africa," "Koni Baje," and "Sekkle Down," featuring J Hus. After releasing the Lily Allen-aided single "Heaven's Gate" in early January 2018, Burna delivered his third album, Outside, later that month.
Twice as Tall
He returned a year later with the single "Killin Dem," a collaboration with Zlatan. Along with additional singles like "Dangote" and "On the Low," it was later included on his fourth album, African Giant, which saw release in July 2019. The LP was nominated in the Best World Music Album category of the 62nd Grammy Awards. In August 2020, Burna issued the full-length Twice as Tall, which included the single "Wonderful." Featured on the album were guest appearances by Youssou N'Dour, Naughty by Nature, Coldplay's Chris Martin, and others. "Rotate," a collaboration with Becky G, arrived in 2021, as did the solo single "Kilometre."


Kozhikode ([koːɻikːoːɖ] (About this soundlisten)), also known as Calicut, is an Indian city, second-largest urban agglomeration in the State of Kerala and 19th largest in the country with a population of 2 million according to 2011 census.[9] During classical antiquity and the Middle Ages, Kozhikode was dubbed the City of Spices for its role as the major trading point of Indian spices.[1] A historical city, it was the capital of an independent kingdom ruled by the Samoothiris (Zamorins) in the Middle Ages. According to data compiled by economics research firm Indicus Analytics in 2009 on residences, earnings and investments, Kozhikode ranked as the second best city in India to reside in.[10]
Kozhikode Beach
Kadalundi bird Sanctuary
Sarovaram Bio Park
Pazhassiraja Museum


{% extends "_base.html" %} {% block content %}
Sorry.


|
Halide
12.0.0
|
A schedule for a Function of a Halide pipeline. More...
#include <Schedule.h>
Public Member Functions | |
| FuncSchedule (IntrusivePtr< FuncScheduleContents > c) | |
| FuncSchedule (const FuncSchedule &other)=default | |
| FuncSchedule () | |
| FuncSchedule | deep_copy (std::map< FunctionPtr, FunctionPtr > &copied_map) const |
| Return a deep copy of this FuncSchedule. More... | |
| bool & | memoized () |
| This flag is set to true if the schedule is memoized. More... | |
| bool | memoized () const |
| Expr & | memoize_eviction_key () |
| This flag is set to true if the schedule is memoized and has an attached eviction key. More... | |
| Expr | memoize_eviction_key () const |
| bool & | async () |
| Is the production of this Function done asynchronously. More... | |
| bool | async () const |
| const std::vector< StorageDim > & | storage_dims () const |
| The list and order of dimensions used to store this function. More... | |
| std::vector< StorageDim > & | storage_dims () |
| MemoryType | memory_type () const |
| The memory type (heap/stack/shared/etc) used to back this Func. More... | |
| MemoryType & | memory_type () |
| const std::vector< Bound > & | bounds () const |
| You may explicitly bound some of the dimensions of a function, or constrain them to lie on multiples of a given factor. More... | |
| std::vector< Bound > & | bounds () |
| const std::vector< Bound > & | estimates () const |
| You may explicitly specify an estimate of some of the function dimensions. More... | |
| std::vector< Bound > & | estimates () |
| const std::map< std::string, Internal::FunctionPtr > & | wrappers () const |
| Mark calls of a function by 'f' to be replaced with its identity wrapper or clone during the lowering stage. More... | |
| std::map< std::string, Internal::FunctionPtr > & | wrappers () |
| void | add_wrapper (const std::string &f, const Internal::FunctionPtr &wrapper) |
| const LoopLevel & | store_level () const |
| At what sites should we inject the allocation and the computation of this function? The store_level must be outside of or equal to the compute_level. More... | |
| const LoopLevel & | compute_level () const |
| LoopLevel & | store_level () |
| LoopLevel & | compute_level () |
| void | accept (IRVisitor *) const |
| Pass an IRVisitor through to all Exprs referenced in the Schedule. More... | |
| void | mutate (IRMutator *) |
| Pass an IRMutator through to all Exprs referenced in the Schedule. More... | |
A schedule for a Function of a Halide pipeline.
This schedule is applied to all stages of the Function. Right now this interface is basically a struct, offering mutable access to its innards. In the future it may become more encapsulated.
Definition at line 506 of file Schedule.h.
|
inline |
Definition at line 510 of file Schedule.h.
|
default |
| Halide::Internal::FuncSchedule::FuncSchedule | ( | ) |
| FuncSchedule Halide::Internal::FuncSchedule::deep_copy | ( | std::map< FunctionPtr, FunctionPtr > & | copied_map | ) | const |
Return a deep copy of this FuncSchedule.
It recursively deep copies all called functions, schedules, specializations, and reduction domains. This method takes a map of <old FunctionContents, deep-copied version> as input and would use the deep-copied FunctionContents from the map if exists instead of creating a new deep-copy to avoid creating deep-copies of the same FunctionContents multiple times.
| bool& Halide::Internal::FuncSchedule::memoized | ( | ) |
This flag is set to true if the schedule is memoized.
| bool Halide::Internal::FuncSchedule::memoized | ( | ) | const |
| Expr& Halide::Internal::FuncSchedule::memoize_eviction_key | ( | ) |
This flag is set to true if the schedule is memoized and has an attached eviction key.
| Expr Halide::Internal::FuncSchedule::memoize_eviction_key | ( | ) | const |
| bool& Halide::Internal::FuncSchedule::async | ( | ) |
Is the production of this Function done asynchronously.
| bool Halide::Internal::FuncSchedule::async | ( | ) | const |
| const std::vector<StorageDim>& Halide::Internal::FuncSchedule::storage_dims | ( | ) | const |
The list and order of dimensions used to store this function.
The first dimension in the vector corresponds to the innermost dimension for storage (i.e. which dimension is tightly packed in memory)
| std::vector<StorageDim>& Halide::Internal::FuncSchedule::storage_dims | ( | ) |
| MemoryType Halide::Internal::FuncSchedule::memory_type | ( | ) | const |
The memory type (heap/stack/shared/etc) used to back this Func.
| MemoryType& Halide::Internal::FuncSchedule::memory_type | ( | ) |
| const std::vector<Bound>& Halide::Internal::FuncSchedule::bounds | ( | ) | const |
You may explicitly bound some of the dimensions of a function, or constrain them to lie on multiples of a given factor.
See Func::bound and Func::align_bounds
| std::vector<Bound>& Halide::Internal::FuncSchedule::bounds | ( | ) |
| const std::vector<Bound>& Halide::Internal::FuncSchedule::estimates | ( | ) | const |
You may explicitly specify an estimate of some of the function dimensions.
See Func::estimate
| std::vector<Bound>& Halide::Internal::FuncSchedule::estimates | ( | ) |
| const std::map<std::string, Internal::FunctionPtr>& Halide::Internal::FuncSchedule::wrappers | ( | ) | const |
Mark calls of a function by 'f' to be replaced with its identity wrapper or clone during the lowering stage.
If the string 'f' is empty, it means replace all calls to the function by all other functions (excluding itself) in the pipeline with the global identity wrapper. See Func::in and Func::clone_in for more details.
| std::map<std::string, Internal::FunctionPtr>& Halide::Internal::FuncSchedule::wrappers | ( | ) |
| void Halide::Internal::FuncSchedule::add_wrapper | ( | const std::string & | f, |
| const Internal::FunctionPtr & | wrapper | ||
| ) |
| const LoopLevel& Halide::Internal::FuncSchedule::store_level | ( | ) | const |
At what sites should we inject the allocation and the computation of this function? The store_level must be outside of or equal to the compute_level.
If the compute_level is inline, the store_level is meaningless. See Func::store_at and Func::compute_at
| const LoopLevel& Halide::Internal::FuncSchedule::compute_level | ( | ) | const |
| LoopLevel& Halide::Internal::FuncSchedule::store_level | ( | ) |
| LoopLevel& Halide::Internal::FuncSchedule::compute_level | ( | ) |
| void Halide::Internal::FuncSchedule::accept | ( | IRVisitor * | ) | const |
Pass an IRVisitor through to all Exprs referenced in the Schedule.
| void Halide::Internal::FuncSchedule::mutate | ( | IRMutator * | ) |
Pass an IRMutator through to all Exprs referenced in the Schedule.


Create From Settlement
xxInfo: AccessTableWithNoView
xxThe current information is empty.
Primary Filters
Business Partner
Payment Rule
Receipt type
All
Payment
Collection
From Date planned
To Date planned
Amount From
Amount To
Amount lower than
Organization
Autocalculated
Search
Business Partner
Organization
Invoice
Payment rule
Planned date
Amount
Currency
Canceled
Paid
xxQuantity
xx
xxUOM
xxProduct
xxP
xx
xx
Total amount
0
OK
Cancel


{{template config_path="design/email/header"}} {{inlinecss file="email-inline.css"}}
Canceled order #{{var increment_id}} payment was verifyed.
You should rescue it or refund the payment.


The weather in {{year}} for {{location}}, Colorado.
See {{location}}'{{s}} current weather conditions.
Also, get all the recent Colorado weather news here.


This is a good harbour on the south coast of the island, but it is difficult to visit the town for supplies due to the four-mile walk and lack of public transport. Taxis are available however.
Position 17°58’N, 66°39’W.
See main Puerto Rico clearance page for full details on clearing into and out of PR.
The Caribbean Image Marina is the official Clearance Reporting dock.
You cannot anchor here and take the Customs/Immigration officials to your yacht.
US yachts in the LBO scheme may be able to phone or clear in at the customs office on Calle Salmon, about 2 miles walk along the water front.
See note below in docking about using the PYFC fuel dock for clearance.
Clearance not possible Saturday afternoon or on Sundays.
Last updated November 2014.
The Ponce Yacht & Fishing Club is a private marina that has a few slips for rental on a daily basis. IF you plan on renting a slip, you are permitted to use their fuel dock for FREE for clearing in. Their weekly rates for rental work out better value than paying the daily rate. Facilities are good (see below).
If however you anchor, you must pay to use the fuel dock for clearance, which sometimes results in a 4 hour stay. During this time the club cannot sell fuel for the hours that the fuel dock is blocked and selling fuel to sport fishing boats is a significant profit center for the club. Therefore, the Club charges $25 for boats under 40 ft and $50 for boats over 40 ft to use the fuel dock for clearance only.
Note that refuse CANNOT BE DISPOSED of without express permission of the Department of Agriculture, which is part of the group that clears a boat in. If rubbish is taken off the boat prior to permission being granted, the boat is subject to a $5,000 fine and the club can be fined as well.
Anchoring
If you choose to anchor in the harbour, it has been reported that the PYFC no longer offer use of their facilities to anchored boats for a nominal daily fee (which used to be $10 per person, per day). It is therefore difficult to find a safe dinghy dock to leave your dinghy at when going ashore. See comment at bottom of the page.
There is an anchorage outside the marina and a place to land and leave a dinghy north of it by a ramp. This pontoon however is used by commercial vessels and cruisers do risk damage to their dinghy if leaving it here.
It costs US$10 by taxi to get into town where there is a good range of shops and a big cash and carry. There is also Sams Club, Walmart, Homedepot and well known fashion outlets in town.
Last updated March 2016.
Editor's Note: E-mails to the PYFC asking for updates have gone unanswered.
The Ponce Yacht and Fishing Club has a reputation of welcoming visiting sailors. The club facilities, including a travelift, may only be used by visitors if they are not being used for work on club members' craft. Fuel and water are available.


Hi,
I am putting together an energy monitoring system for a site with 20+ meters and some PV.
One point has 6 meters in a cupboard together. To reduce the amount of hardware, I am attempting to use one Raspberry Pi to record the pulses and upload to emoncms via wifi. Has anyone done this? I have read the post about 12 pulse imports with Arduino but this seems like an overly complicated solution. I am hoping the RPI with its extra processing power (and cheap wifi) will be able to handle everything.
Any thoughts or comments?
Re: RPi pulse import
Linux allows user-level access to the GPIOs via sysfs, including configuring them as interrupt sources. Your user level process can then put itself to sleep until there's a change. It's not quite as real-time as attaching your own ISR to the hardware, but depending on the expected event frequency could well be real-time enough. There's a good tutorial here: https://www.ridgerun.com/developer/wiki/index.php/How_to_use_GPIO_signals
Re: RPi pulse import
I have started a python code to run on the RPi that uses interrupts (http://raspi.tv/2013/how-to-use-interrupts-with-python-on-the-raspberry-...). My concern is that upload side will be disturbed by the interrupts.
Re: RPi pulse import
If you are using Raspian on the RPI then it is easy to handle I/O interrupts from Python.
As you have a lot of inputs to manage you might be better creating some extra logic to take the 20+ inputs and then create a single interrupt routine which reads the state of the inputs to see which ones are active.
One idea is to reduce the inputs using a 8 input encoders. These will reduce each set of 8 lines to 4 (binary to hex). With chip enables, all of the encoders can be read using the same 4-bit port. The interrupts share one RPI input port using a wired-or.
The ISR would select the encoders in turn to get the input states. From one interrupt the ISR would use just three reads to check 24 inputs. If you keep a copy of the last read state then, at each interrupt, you can see which input has changed.
There are other schemes that would work here too but this ome is simple and involves easy to debug hardware.
Well that's my threepeneth.
David Goadby, North Wales.


Sylvia Gloria Mucha is a passionate software developer who inspires to soar greater
heights in programming.She is a very competent and reliable person.Sylvia is a performer
who never gives up even when faced with challenges.She picks herself up when a stumbling block
threatens to bring her down.An animal that best describes her is an eagle.This is because
an eagle flies at the highest level.
- Primary education-Victoria Primary School
- Secondary education-Ng'iya Girls' High SSchool
I decided software development classes at Moringa School because I have passion for
tech stuff and Moringa School is the best place to learn coding.I want to become a
software developer,a professional for that matter.I want to soar greater heights
in the tech industry.I want to have my own tech company in the near future.I believe
Moringa School is the best foundation to start my career.
I have two complete projects that I worked on
- Sample1
- PetProject
Sample1 project can be found via
link to Sample1 project
-The project is about computer networking and data communication.Networking is very important because it easens
quite a lot of work.Resource sharing is a major aspect and manipulation of data is made easier and very accessible.
PetProject can be found via
link to PetProject
-The project is about my pet Ruff.He is a chiwawa type of dog.A very happy and jovial puppy.Ruff is two and a half
years old.The project explains more about my pet Ruff


{{> social-meta}}
{{title}}
{{> symbols}} {{> page-header}}
Getting Started
Quick Start
What is a Toolkit?
Working with Fabricator
Building a Toolkit
Materials
Rapid Prototyping
Data
Stylesheets and JavaScript
Advanced
Third-party dependencies
Error Handling
Helpers
Ruby Sass and other preprocessors
Themes and customization
{% body %}
{{> footer}} {{> analytics}}


I am an experienced software developer who enjoys seeing projects carried through to
completion. From gathering requirements, to placing final touches on the user interface,
I always keep the end goal in mind.
Skills
Programming Languages & Tools
Workflow
Mobile-First, Responsive Design
Cross Browser Compatibility
Test Driven Development
Agile Development & Scrum
Experience
Software Developer
Imagine Fertility
Develop and update features utilizing technologies such as HTML, CSS, JavaScript, SQL, MariaDB, PHP,
Linux, Git/GitHub, and Azure.
Migrate our customer relationship management system to utilize Node.js/Express on the backend and
React/Redux on the front-end.
Follow agile methodologies to get minimum viable products to market as quickly as possible.
Created a 3rd party management system, which became an additional selling point for new clients.
May 2019 - Present
Web Developer
Nan and Company Properties
Created landing pages to gain more leads through the use of social media and Google Ads.
Used technologies such as HTML, CSS, Bootstrap, JavaScript, and jQuery to migrate content into a new
content management system.
Developed custom email templates to stay in touch with potential clients.
Implemented advanced Excel formulas to automate the process of creating weekly emails.


Howdy! Welcome to my site :)
I love a hard day of applying myself, getting stumped, figuring it out, feeling the slight glow of triumph, then diving headfirst into the next quagmire. My career history demonstrates my capacity for thriving around hard, analytical work.
A proven technical performer with experience in several industries. I've taught, coded, pitched, and planned, always with an eye on my next big challenge.
An ongoing effort to better catagorize the available Happy Hours around the Bay Area. Five O'Clock Somewhere was a fun project and my initial forray into Ruby on Rails, Angular.js, and jQuery.


@*
* Copyright 2022 HM Revenue & Customs
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*@
@import uk.gov.hmrc.play.config.AssetsConfig
@this(assetsConfig: AssetsConfig)
@(analyticsToken: Option[String],
analyticsHost: String,
ssoUrl: Option[String],
scriptElem: Option[Html],
gaCalls: Option[(String,String) => Html],
analyticsAnonymizeIp: Boolean = true,
analyticsAdditionalJs: Option[Html] = None,
allowQueryStringInAnalytics: Boolean = false
)
@analyticsToken match {
case Some(token@_) if !token.equals("N/A") => {
}
case _ => {}
}
@scriptElem


|
|
|
|
Summary Window
Shows summaries of line, call and branch coverage statistics, as
percentages, counts and colour coded bars. Scope of summary can
be chosen from: overall, filename, function, or a range of lines
within a file.
|
File List Window
Shows all the source files, with line, call and branch coverage
statistics. Directories are optionally shown as a tree, with summarised
statistics. The list can be sorted on any of the columns by
clicking on the column title. Double-clicking on a row pops
up a new Source Window displaying the corresponding file.
|
Function List Window
Shows all the covered functions, with line, call and branch coverage
statistics. The list can be sorted on any of the columns by
clicking on the column title. Double-clicking on a row pops
up a new Source Window displaying the corresponding function.
|
|
|
|
|
Calls List Window
Shows function calls between any coveraged functions, and the number of
times each call was made. Combo boxes allow filtering on calling
function or called function.
Note:This window depends in part on data scanned from object files,
which will not work on all platforms.
|
Call Butterfly Window
Shows, for a particular function, all the functions that call it
and how many times they called it, and all the functions that it
calls and how many times it called them. Double-clicking on a
function name in either list navigates the window to that function.
Handles covered functions and external library functions
(e.g. printf) called directly from
covered functions.
Note:This window depends on data scanned from object files,
which will not work on all platforms.
|
Source Window
Shows a particular source file, with line numbers and execution
counts for each line. Lines are colour coded:
- green - executed at least once
- yellow - part of the line executed
- red - never executed
- blue - suppressed
- black - no executable code
|
|
|
|
|
Call Graph Window
Shows the graph of calls between functions graphically, with colour
coding for each function and calls between functions.
Note:This window depends on data scanned from object files,
which will not work on all platforms.
Note: the graph layout code for this window is in an early stage of
development and may respond badly (looping or crashing) to some
data sets.
|
Report Window
Shows textual reports which give various interesting summaries of
coverage data. These same reports are available in text mode
by using tggcov --report.
|
Lego Diagram Window
Shows the proportions of covered vs uncovered code code for
projects with multiple files and directories.
|


The Battle of the Centaurs
The Battle of the Centaurs (Italian. Battaglia dei centauri; also - “The Battle of Hercules with the Centaurs”) is a marble relief with a scene of the centauromy created by Michelangelo in about 1492. This bas-relief refers to his first known independent works (as well as the Madonna on the Staircase), and in him he found himself as a sculptor. Vasari describes him as a work done “so beautifully that one who now looks at her cannot believe that this is the work of a young man, and not a respected master, who is perfect in the science and practice of art.”
According to Eric Shiliano, in this bas-relief, the young sculptor "embodied the commandments of the Greeks and Romans." It is also the first known work that can be considered a “non-finito”.


AWS instances and more tips
2013-12-04
Created a medium instances, it showed an error or not getting into the ssh, due to non-availability of ssh port in the security group. some command line tips
- to rename a file or folder
mv old_name new_name
- to install git
sudo apt-get install git-core
- PostgreSQL reference http://www.thegeekstuff.com/2009/04/15-practical-postgresql-database-adminstration-commands/
- to use FileZilla with AWS http://glidingphenomena.blogspot.in/2011/03/using-filezilla-to-login-into-amazon.html


Author: Dean Gaudet
Apache is a general webserver, which is designed to be correct first, and fast second. Even so, it's performance is quite satisfactory. Most sites have less than 10Mbits of outgoing bandwidth, which Apache can fill using only a low end Pentium-based webserver. In practice sites with more bandwidth require more than one machine to fill the bandwidth due to other constraints (such as CGI or database transaction overhead). For these reasons the development focus has been mostly on correctness and configurability.
Unfortunately many folks overlook these facts and cite raw performance numbers as if they are some indication of the quality of a web server product. There is a bare minimum performance that is acceptable, beyond that extra speed only caters to a much smaller segment of the market. But in order to avoid this hurdle to the acceptance of Apache in some markets, effort was put into Apache 1.3 to bring performance up to a point where the difference with other high-end webservers is minimal.
Finally there are the folks who just plain want to see how fast something can go. The author falls into this category. The rest of this document is dedicated to these folks who want to squeeze every last bit of performance out of Apache's current model, and want to understand why it does some things which slow it down.
Note that this is tailored towards Apache 1.3 on Unix. Some of it applies to Apache on NT. Apache on NT has not been tuned for performance yet, in fact it probably performs very poorly because NT performance requires a different programming model.
The single biggest hardware issue affecting webserver performance
is RAM. A webserver should never ever have to swap, swapping increases
the latency of each request beyond a point that users consider "fast
enough". This causes users to hit stop and reload, further increasing
the load. You can, and should, control the MaxClients
setting so that your server does not spawn so many children it starts
swapping.
Beyond that the rest is mundane: get a fast enough CPU, a fast enough network card, and fast enough disks, where "fast enough" is something that needs to be determined by experimentation.
Operating system choice is largely a matter of local concerns. But a general guideline is to always apply the latest vendor TCP/IP patches. HTTP serving completely breaks many of the assumptions built into Unix kernels up through 1994 and even 1995. Good choices include recent FreeBSD, and Linux.
Prior to Apache 1.3, HostnameLookups
defaulted to On.
This adds latency
to every request because it requires a DNS lookup to complete before
the request is finished. In Apache 1.3 this setting defaults to Off.
However (1.3 or later), if you use any allow from domain
or
deny from domain
directives then you will pay for a
double reverse DNS lookup (a reverse, followed by a forward to make sure
that the reverse is not being spoofed). So for the highest performance
avoid using these directives (it's fine to use IP addresses rather than
domain names).
Note that it's possible to scope the directives, such as within
a <Location /server-status>
section. In this
case the DNS lookups are only performed on requests matching the
criteria. Here's an example which disables
lookups except for .html and .cgi files:
But even still, if you just need DNS names in some CGIs you could consider doing theHostnameLookups off <Files ~ "\.(html|cgi)$> HostnameLookups on </Files>
gethostbyname
call in the specific CGIs that need it.
Wherever in your URL-space you do not have an
Options FollowSymLinks
, or you do have an
Options SymLinksIfOwnerMatch
Apache will have to
issue extra system calls to check up on symlinks. One extra call per
filename component. For example, if you had:
and a request is made for the URIDocumentRoot /www/htdocs <Directory /> Options SymLinksIfOwnerMatch </Directory>
/index.html
.
Then Apache will perform lstat(2)
on /www
,
/www/htdocs
, and /www/htdocs/index.html
. The
results of these lstats
are never cached,
so they will occur on every single request. If you really desire the
symlinks security checking you can do something like this:
This at least avoids the extra checks for theDocumentRoot /www/htdocs <Directory /> Options FollowSymLinks </Directory> <Directory /www/htdocs> Options -FollowSymLinks +SymLinksIfOwnerMatch </Directory>
DocumentRoot
path. Note that you'll need to add similar sections if you have any
Alias
or RewriteRule
paths outside of your
document root. For highest performance, and no symlink protection,
set FollowSymLinks
everywhere, and never set
SymLinksIfOwnerMatch
.
Wherever in your URL-space you allow overrides (typically
.htaccess
files) Apache will attempt to open
.htaccess
for each filename component. For example,
and a request is made for the URIDocumentRoot /www/htdocs <Directory /> AllowOverride all </Directory>
/index.html
. Then
Apache will attempt to open /.htaccess
,
/www/.htaccess
, and /www/htdocs/.htaccess
.
The solutions are similar to the previous case of Options
FollowSymLinks
. For highest performance use
AllowOverride None
everywhere in your filesystem.
If at all possible, avoid content-negotiation if you're really interested in every last ounce of performance. In practice the benefits of negotiation outweigh the performance penalties. There's one case where you can speed up the server. Instead of using a wildcard such as:
Use a complete list of options:DirectoryIndex index
where you list the most common choice first.DirectoryIndex index.cgi index.pl index.shtml index.html
Prior to Apache 1.3 the MinSpareServers
,
MaxSpareServers
, and StartServers
settings
all had drastic effects on benchmark results. In particular, Apache
required a "ramp-up" period in order to reach a number of children
sufficient to serve the load being applied. After the initial
spawning of StartServers
children, only one child per
second would be created to satisfy the MinSpareServers
setting. So a server being accessed by 100 simultaneous clients,
using the default StartServers
of 5 would take on
the order 95 seconds to spawn enough children to handle the load. This
works fine in practice on real-life servers, because they aren't restarted
frequently. But does really poorly on benchmarks which might only run
for ten minutes.
The one-per-second rule was implemented in an effort to avoid
swamping the machine with the startup of new children. If the machine
is busy spawning children it can't service requests. But it has such
a drastic effect on the perceived performance of Apache that it had
to be replaced. As of Apache 1.3,
the code will relax the one-per-second rule. It
will spawn one, wait a second, then spawn two, wait a second, then spawn
four, and it will continue exponentially until it is spawning 32 children
per second. It will stop whenever it satisfies the
MinSpareServers
setting.
This appears to be responsive enough that it's
almost unnecessary to twiddle the MinSpareServers
,
MaxSpareServers
and StartServers
knobs. When
more than 4 children are spawned per second, a message will be emitted
to the ErrorLog
. If you see a lot of these errors then
consider tuning these settings. Use the mod_status
output
as a guide.
Related to process creation is process death induced by the
MaxRequestsPerChild
setting. By default this is 30, which
is probably far too low unless your server is using a module such as
mod_perl
which causes children to have bloated memory
images. If your server is serving mostly static pages then consider
raising this value to something like 10000. The code is robust enough
that this shouldn't be a problem.
When keep-alives are in use, children will be kept busy
doing nothing waiting for more requests on the already open
connection. The default KeepAliveTimeout
of
15 seconds attempts to minimize this effect. The tradeoff
here is between network bandwidth and server resources.
In no event should you raise this above about 60 seconds, as
most of the benefits are lost.
If you include mod_status
and you also set ExtendedStatus On
when building and running
Apache, then on every request Apache will perform two calls to
gettimeofday(2)
(or times(2)
depending
on your operating system), and (pre-1.3) several extra calls to
time(2)
. This is all done so that the status report
contains timing indications. For highest performance, set
ExtendedStatus off
(which is the default).
This discusses a shortcoming in the Unix socket API.
Suppose your
web server uses multiple Listen
statements to listen on
either multiple ports or multiple addresses. In order to test each
socket to see if a connection is ready Apache uses select(2)
.
select(2)
indicates that a socket has zero or
at least one connection waiting on it. Apache's model includes
multiple children, and all the idle ones test for new connections at the
same time. A naive implementation looks something like this
(these examples do not match the code, they're contrived for
pedagogical purposes):
But this naive implementation has a serious starvation problem. Recall that multiple children execute this loop at the same time, and so multiple children will block atfor (;;) { for (;;) { fd_set accept_fds; FD_ZERO (&accept_fds); for (i = first_socket; i <= last_socket; ++i) { FD_SET (i, &accept_fds); } rc = select (last_socket+1, &accept_fds, NULL, NULL, NULL); if (rc < 1) continue; new_connection = -1; for (i = first_socket; i <= last_socket; ++i) { if (FD_ISSET (i, &accept_fds)) { new_connection = accept (i, NULL, NULL); if (new_connection != -1) break; } } if (new_connection != -1) break; } process the new_connection; }
select
when they are in between
requests. All those blocked children will awaken and return from
select
when a single request appears on any socket
(the number of children which awaken varies depending on the operating
system and timing issues).
They will all then fall down into the loop and try to accept
the connection. But only one will succeed (assuming there's still only
one connection ready), the rest will be blocked in
accept
.
This effectively locks those children into serving requests from that
one socket and no other sockets, and they'll be stuck there until enough
new requests appear on that socket to wake them all up.
This starvation problem was first documented in
PR#467. There
are at least two solutions.
One solution is to make the sockets non-blocking. In this case the
accept
won't block the children, and they will be allowed
to continue immediately. But this wastes CPU time. Suppose you have
ten idle children in select
, and one connection arrives.
Then nine of those children will wake up, try to accept
the
connection, fail, and loop back into select
, accomplishing
nothing. Meanwhile none of those children are servicing requests that
occurred on other sockets until they get back up to the select
again. Overall this solution does not seem very fruitful unless you
have as many idle CPUs (in a multiprocessor box) as you have idle children,
not a very likely situation.
Another solution, the one used by Apache, is to serialize entry into the inner loop. The loop looks like this (differences highlighted):
The functionsfor (;;) { accept_mutex_on (); for (;;) { fd_set accept_fds; FD_ZERO (&accept_fds); for (i = first_socket; i <= last_socket; ++i) { FD_SET (i, &accept_fds); } rc = select (last_socket+1, &accept_fds, NULL, NULL, NULL); if (rc < 1) continue; new_connection = -1; for (i = first_socket; i <= last_socket; ++i) { if (FD_ISSET (i, &accept_fds)) { new_connection = accept (i, NULL, NULL); if (new_connection != -1) break; } } if (new_connection != -1) break; } accept_mutex_off (); process the new_connection; }
accept_mutex_on
and accept_mutex_off
implement a mutual exclusion semaphore. Only one child can have the
mutex at any time. There are several choices for implementing these
mutexes. The choice is defined in src/conf.h
(pre-1.3) or
src/main/conf.h
(1.3 or later). Some architectures
do not have any locking choice made, on these architectures it is unsafe
to use multiple Listen
directives.
USE_FLOCK_SERIALIZED_ACCEPT
flock(2)
system call to lock a
lock file (located by the LockFile
directive).
USE_FCNTL_SERIALIZED_ACCEPT
fcntl(2)
system call to lock a
lock file (located by the LockFile
directive).
USE_SYSVSEM_SERIALIZED_ACCEPT
ipcs(8)
man page). The other is that the semaphore
API allows for a denial of service attack by any CGIs running under the
same uid as the webserver (i.e., all CGIs unless you use something
like suexec or cgiwrapper). For these reasons this method is not used
on any architecture except IRIX (where the previous two are prohibitively
expensive on most IRIX boxes).
USE_USLOCK_SERIALIZED_ACCEPT
usconfig(2)
to create a mutex. While this method avoids
the hassles of SysV-style semaphores, it is not the default for IRIX.
This is because on single processor IRIX boxes (5.3 or 6.2) the
uslock code is two orders of magnitude slower than the SysV-semaphore
code. On multi-processor IRIX boxes the uslock code is an order of magnitude
faster than the SysV-semaphore code. Kind of a messed up situation.
So if you're using a multiprocessor IRIX box then you should rebuild your
webserver with -DUSE_USLOCK_SERIALIZED_ACCEPT
on the
EXTRA_CFLAGS
.
USE_PTHREAD_SERIALIZED_ACCEPT
If your system has another method of serialization which isn't in the above list then it may be worthwhile adding code for it (and submitting a patch back to Apache).
Another solution that has been considered but never implemented is to partially serialize the loop -- that is, let in a certain number of processes. This would only be of interest on multiprocessor boxes where it's possible multiple children could run simultaneously, and the serialization actually doesn't take advantage of the full bandwidth. This is a possible area of future investigation, but priority remains low because highly parallel web servers are not the norm.
Ideally you should run servers without multiple Listen
statements if you want the highest performance. But read on.
The above is fine and dandy for multiple socket servers, but what
about single socket servers? In theory they shouldn't experience
any of these same problems because all children can just block in
accept(2)
until a connection arrives, and no starvation
results. In practice this hides almost the same "spinning" behaviour
discussed above in the non-blocking solution. The way that most TCP
stacks are implemented, the kernel actually wakes up all processes blocked
in accept
when a single connection arrives. One of those
processes gets the connection and returns to user-space, the rest spin in
the kernel and go back to sleep when they discover there's no connection
for them. This spinning is hidden from the user-land code, but it's
there nonetheless. This can result in the same load-spiking wasteful
behaviour that a non-blocking solution to the multiple sockets case can.
For this reason we have found that many architectures behave more
"nicely" if we serialize even the single socket case. So this is
actually the default in almost all cases. Crude experiments under
Linux (2.0.30 on a dual Pentium pro 166 w/128Mb RAM) have shown that
the serialization of the single socket case causes less than a 3%
decrease in requests per second over unserialized single-socket.
But unserialized single-socket showed an extra 100ms latency on
each request. This latency is probably a wash on long haul lines,
and only an issue on LANs. If you want to override the single socket
serialization you can define SINGLE_LISTEN_UNSERIALIZED_ACCEPT
and then single-socket servers will not serialize at all.
As discussed in draft-ietf-http-connection-00.txt section 8, in order for an HTTP server to reliably implement the protocol it needs to shutdown each direction of the communication independently (recall that a TCP connection is bi-directional, each half is independent of the other). This fact is often overlooked by other servers, but is correctly implemented in Apache as of 1.2.
When this feature was added to Apache it caused a flurry of problems on various versions of Unix because of a shortsightedness. The TCP specification does not state that the FIN_WAIT_2 state has a timeout, but it doesn't prohibit it. On systems without the timeout, Apache 1.2 induces many sockets stuck forever in the FIN_WAIT_2 state. In many cases this can be avoided by simply upgrading to the latest TCP/IP patches supplied by the vendor, in cases where the vendor has never released patches (i.e., SunOS4 -- although folks with a source license can patch it themselves) we have decided to disable this feature.
There are two ways of accomplishing this. One is the
socket option SO_LINGER
. But as fate would have it,
this has never been implemented properly in most TCP/IP stacks. Even
on those stacks with a proper implementation (i.e., Linux 2.0.31) this
method proves to be more expensive (cputime) than the next solution.
For the most part, Apache implements this in a function called
lingering_close
(in http_main.c
). The
function looks roughly like this:
This naturally adds some expense at the end of a connection, but it is required for a reliable implementation. As HTTP/1.1 becomes more prevalent, and all connections are persistent, this expense will be amortized over more requests. If you want to play with fire and disable this feature you can definevoid lingering_close (int s) { char junk_buffer[2048]; /* shutdown the sending side */ shutdown (s, 1); signal (SIGALRM, lingering_death); alarm (30); for (;;) { select (s for reading, 2 second timeout); if (error) break; if (s is ready for reading) { read (s, junk_buffer, sizeof (junk_buffer)); /* just toss away whatever is here */ } } close (s); }
NO_LINGCLOSE
, but
this is not recommended at all. In particular, as HTTP/1.1 pipelined
persistent connections come into use lingering_close
is an absolute necessity (and
pipelined connections are faster, so you
want to support them).
Apache's parent and children communicate with each other through
something called the scoreboard. Ideally this should be implemented
in shared memory. For those operating systems that we either have
access to, or have been given detailed ports for, it typically is
implemented using shared memory. The rest default to using an
on-disk file. The on-disk file is not only slow, but it is unreliable
(and less featured). Peruse the src/main/conf.h
file
for your architecture and look for either USE_MMAP_SCOREBOARD
or
USE_SHMGET_SCOREBOARD
. Defining one of those two (as
well as their companions HAVE_MMAP
and HAVE_SHMGET
respectively) enables the supplied shared memory code. If your system has
another type of shared memory, edit the file src/main/http_main.c
and add the hooks necessary to use it in Apache. (Send us back a patch
too please.)
Historical note: The Linux port of Apache didn't start to use shared memory until version 1.2 of Apache. This oversight resulted in really poor and unreliable behaviour of earlier versions of Apache on Linux.
DYNAMIC_MODULE_LIMIT
If you have no intention of using dynamically loaded modules
(you probably don't if you're reading this and tuning your
server for every last ounce of performance) then you should add
-DDYNAMIC_MODULE_LIMIT=0
when building your server.
This will save RAM that's allocated only for supporting dynamically
loaded modules.
The file being requested is a static 6K file of no particular content. Traces of non-static requests or requests with content negotiation look wildly different (and quite ugly in some cases). First the entire trace, then we'll examine details. (This was generated by the<Directory /> AllowOverride none Options FollowSymLinks </Directory>
strace
program, other similar programs include
truss
, ktrace
, and par
.)
accept(15, {sin_family=AF_INET, sin_port=htons(22283), sin_addr=inet_addr("<IP_ADDRESS>")}, [16]) = 3 flock(18, LOCK_UN) = 0 sigaction(SIGUSR1, {SIG_IGN}, {0x8059954, [], SA_INTERRUPT}) = 0 getsockname(3, {sin_family=AF_INET, sin_port=htons(8080), sin_addr=inet_addr("<IP_ADDRESS>")}, [16]) = 0 setsockopt(3, IPPROTO_TCP1, [1], 4) = 0 read(3, "GET /6k HTTP/1.0\r\nUser-Agent: "..., 4096) = 60 sigaction(SIGUSR1, {SIG_IGN}, {SIG_IGN}) = 0 time(NULL) = 873959960 gettimeofday({873959960, 404935}, NULL) = 0 stat("/home/dgaudet/ap/apachen/htdocs/6k", {st_mode=S_IFREG|0644, st_size=6144, ...}) = 0 open("/home/dgaudet/ap/apachen/htdocs/6k", O_RDONLY) = 4 mmap(0, 6144, PROT_READ, MAP_PRIVATE, 4, 0) = 0x400ee000 writev(3, [{"HTTP/1.1 200 OK\r\nDate: Thu, 11"..., 245}, {"\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0"..., 6144}], 2) = 6389 close(4) = 0 time(NULL) = 873959960 write(17, "<IP_ADDRESS> - - [10/Sep/1997:23:39"..., 71) = 71 gettimeofday({873959960, 417742}, NULL) = 0 times({tms_utime=5, tms_stime=0, tms_cutime=0, tms_cstime=0}) = 446747 shutdown(3, 1 /* send */) = 0 oldselect(4, [3], NULL, [3], {2, 0}) = 1 (in [3], left {2, 0}) read(3, "", 2048) = 0 close(3) = 0 sigaction(SIGUSR1, {0x8059954, [], SA_INTERRUPT}, {SIG_IGN}) = 0 munmap(0x400ee000, 6144) = 0 flock(18, LOCK_EX) = 0
Notice the accept serialization:
These two calls can be removed by definingflock(18, LOCK_UN) = 0 ... flock(18, LOCK_EX) = 0
SINGLE_LISTEN_UNSERIALIZED_ACCEPT
as described earlier.
Notice the SIGUSR1
manipulation:
This is caused by the implementation of graceful restarts. When the parent receives asigaction(SIGUSR1, {SIG_IGN}, {0x8059954, [], SA_INTERRUPT}) = 0 ... sigaction(SIGUSR1, {SIG_IGN}, {SIG_IGN}) = 0 ... sigaction(SIGUSR1, {0x8059954, [], SA_INTERRUPT}, {SIG_IGN}) = 0
SIGUSR1
it sends a SIGUSR1
to all of its children (and it also increments a "generation counter"
in shared memory). Any children that are idle (between connections)
will immediately die
off when they receive the signal.  But
any children that have a connection and are still waiting for the first
request will not die off immediately.
To see why this is necessary, consider how a browser reacts to a closed
connection. If the connection was a keep-alive connection and the request
being serviced was not the first request then the browser will quietly
reissue the request on a new connection. It has to do this because the
server is always free to close a keep-alive connection in between requests
(i.e., due to a timeout or because of a maximum number of requests).
But, if the connection is closed before the first response has been
received the typical browser will display a "document contains no data"
dialogue (or a broken image icon). This is done on the assumption that
the server is broken in some way (or maybe too overloaded to respond
at all). So Apache tries to avoid ever deliberately closing the connection
before it has sent a single response. This is the cause of those
SIGUSR1
manipulations.
Note that it is theoretically possible to eliminate all three of these calls. But in rough tests the gain proved to be almost unnoticeable.
In order to implement virtual hosts, Apache needs to know the local socket address used to accept the connection:
It is possible to eliminate this call in many situations (such as when there are no virtual hosts, or whengetsockname(3, {sin_family=AF_INET, sin_port=htons(8080), sin_addr=inet_addr("<IP_ADDRESS>")}, [16]) = 0
Listen
directives are
used which do not have wildcard addresses). But no effort has yet been
made to do these optimizations.
Apache turns off the Nagle algorithm:
because of problems described in a paper by John Heidemann.setsockopt(3, IPPROTO_TCP1, [1], 4) = 0
Notice the two time
calls:
One of these occurs at the beginning of the request, and the other occurs as a result of writing the log. At least one of these is required to properly implement the HTTP protocol. The second occurs because the Common Log Format dictates that the log record include a timestamp of the end of the request. A custom logging module could eliminate one of the calls. Or you can use a method which moves the time into shared memory, see the patches section below.time(NULL) = 873959960 ... time(NULL) = 873959960
As described earlier, ExtendedStatus On
causes two
gettimeofday
calls and a call to times
:
These can be removed by settinggettimeofday({873959960, 404935}, NULL) = 0 ... gettimeofday({873959960, 417742}, NULL) = 0 times({tms_utime=5, tms_stime=0, tms_cutime=0, tms_cstime=0}) = 446747
ExtendedStatus Off
(which
is the default).
It might seem odd to call stat
:
This is part of the algorithm which calculates thestat("/home/dgaudet/ap/apachen/htdocs/6k", {st_mode=S_IFREG|0644, st_size=6144, ...}) = 0
PATH_INFO
for use by CGIs. In fact if the request had been
for the URI /cgi-bin/printenv/foobar
then there would be
two calls to stat
. The first for
/home/dgaudet/ap/apachen/cgi-bin/printenv/foobar
which does not exist, and the second for
/home/dgaudet/ap/apachen/cgi-bin/printenv
, which does exist.
Regardless, at least one stat
call is necessary when
serving static files because the file size and modification times are
used to generate HTTP headers (such as Content-Length
,
Last-Modified
) and implement protocol features (such
as If-Modified-Since
). A somewhat more clever server
could avoid the stat
when serving non-static files,
however doing so in Apache is very difficult given the modular structure.
All static files are served using mmap
:
On some architectures it's slower tommap(0, 6144, PROT_READ, MAP_PRIVATE, 4, 0) = 0x400ee000 ... munmap(0x400ee000, 6144) = 0
mmap
small
files than it is to simply read
them. The define
MMAP_THRESHOLD
can be set to the minimum
size required before using mmap
. By default
it's set to 0 (except on SunOS4 where experimentation has
shown 8192 to be a better value). Using a tool such as lmbench you
can determine the optimal setting for your environment.
You may also wish to experiment with MMAP_SEGMENT_SIZE
(default 32768) which determines the maximum number of bytes that
will be written at a time from mmap()d files. Apache only resets the
client's Timeout
in between write()s. So setting this
large may lock out low bandwidth clients unless you also increase the
Timeout
.
It may even be the case that mmap
isn't
used on your architecture, if so then defining USE_MMAP_FILES
and HAVE_MMAP
might work (if it works then report back to us).
Apache does its best to avoid copying bytes around in memory. The
first write of any request typically is turned into a writev
which combines both the headers and the first hunk of data:
When doing HTTP/1.1 chunked encoding Apache will generate up to four elementwritev(3, [{"HTTP/1.1 200 OK\r\nDate: Thu, 11"..., 245}, {"\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0"..., 6144}], 2) = 6389
writev
s. The goal is to push the byte copying
into the kernel, where it typically has to happen anyhow (to assemble
network packets). On testing, various Unixes (BSDI 2.x, Solaris 2.5,
Linux 2.0.31+) properly combine the elements into network packets.
Pre-2.0.31 Linux will not combine, and will create a packet for
each element, so upgrading is a good idea. Defining NO_WRITEV
will disable this combining, but result in very poor chunked encoding
performance.
The log write:
can be deferred by definingwrite(17, "<IP_ADDRESS> - - [10/Sep/1997:23:39"..., 71) = 71
BUFFERED_LOGS
. In this case
up to PIPE_BUF
bytes (a POSIX defined constant) of log entries
are buffered before writing. At no time does it split a log entry
across a PIPE_BUF
boundary because those writes may not
be atomic. (i.e., entries from multiple children could become mixed together).
The code does it best to flush this buffer when a child dies.
The lingering close code causes four system calls:
which were described earlier.shutdown(3, 1 /* send */) = 0 oldselect(4, [3], NULL, [3], {2, 0}) = 1 (in [3], left {2, 0}) read(3, "", 2048) = 0 close(3) = 0
Let's apply some of these optimizations:
-DSINGLE_LISTEN_UNSERIALIZED_ACCEPT -DBUFFERED_LOGS
and
ExtendedStatus Off
. Here's the final trace:
That's 19 system calls, of which 4 remain relatively easy to remove, but don't seem worth the effort.accept(15, {sin_family=AF_INET, sin_port=htons(22286), sin_addr=inet_addr("<IP_ADDRESS>")}, [16]) = 3 sigaction(SIGUSR1, {SIG_IGN}, {0x8058c98, [], SA_INTERRUPT}) = 0 getsockname(3, {sin_family=AF_INET, sin_port=htons(8080), sin_addr=inet_addr("<IP_ADDRESS>")}, [16]) = 0 setsockopt(3, IPPROTO_TCP1, [1], 4) = 0 read(3, "GET /6k HTTP/1.0\r\nUser-Agent: "..., 4096) = 60 sigaction(SIGUSR1, {SIG_IGN}, {SIG_IGN}) = 0 time(NULL) = 873961916 stat("/home/dgaudet/ap/apachen/htdocs/6k", {st_mode=S_IFREG|0644, st_size=6144, ...}) = 0 open("/home/dgaudet/ap/apachen/htdocs/6k", O_RDONLY) = 4 mmap(0, 6144, PROT_READ, MAP_PRIVATE, 4, 0) = 0x400e3000 writev(3, [{"HTTP/1.1 200 OK\r\nDate: Thu, 11"..., 245}, {"\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0"..., 6144}], 2) = 6389 close(4) = 0 time(NULL) = 873961916 shutdown(3, 1 /* send */) = 0 oldselect(4, [3], NULL, [3], {2, 0}) = 1 (in [3], left {2, 0}) read(3, "", 2048) = 0 close(3) = 0 sigaction(SIGUSR1, {0x8058c98, [], SA_INTERRUPT}, {SIG_IGN}) = 0 munmap(0x400e3000, 6144) = 0
time(2)
system calls.
mod_include
,
these calls are used by few sites but required for backwards compatibility.
Apache (on Unix) is a pre-forking model server. The parent process is responsible only for forking child processes, it does not serve any requests or service any network sockets. The child processes actually process connections, they serve multiple connections (one at a time) before dying. The parent spawns new or kills off old children in response to changes in the load on the server (it does so by monitoring a scoreboard which the children keep up to date).
This model for servers offers a robustness that other models do not. In particular, the parent code is very simple, and with a high degree of confidence the parent will continue to do its job without error. The children are complex, and when you add in third party code via modules, you risk segmentation faults and other forms of corruption. Even should such a thing happen, it only affects one connection and the server continues serving requests. The parent quickly replaces the dead child.
Pre-forking is also very portable across dialects of Unix. Historically this has been an important goal for Apache, and it continues to remain so.
The pre-forking model comes under criticism for various
performance aspects. Of particular concern are the overhead
of forking a process, the overhead of context switches between
processes, and the memory overhead of having multiple processes.
Furthermore it does not offer as many opportunities for data-caching
between requests (such as a pool of mmapped
files).
Various other models exist and extensive analysis can be found in the
papers
of the JAWS project. In practice all of these costs vary drastically
depending on the operating system.
Apache's core code is already multithread aware, and Apache version 1.3 is multithreaded on NT. There have been at least two other experimental implementations of threaded Apache, one using the 1.3 code base on DCE, and one using a custom user-level threads package and the 1.0 code base, neither are available publically. There is also an experimental port of Apache 1.3 to Netscape's Portable Run Time, which is available (but you're encouraged to join the new-httpd mailing list if you intend to use it). Part of our redesign for version 2.0 of Apache will include abstractions of the server model so that we can continue to support the pre-forking model, and also support various threaded models.


Copyright © 2014 W3C® (MIT, ERCIM, Keio, Beihang), All Rights Reserved. W3C liability, trademark and document use rules apply.
The Screen Orientation API provides the ability to read the screen orientation state, to be informed when this state changes, and to be able to lock the screen orientation to a specific state.
This section describes the status of this document at the time of its publication. Other documents may supersede this document. A list of current W3C publications and the latest revision of this technical report can be found in the W3C technical reports index at http://www.w3.org/TR/.
This document is still in a work in progress state. You can have a look at the opened bugs. If you see any problem that is not in that list, feel free to discuss it in the mailing list (see below) or open a new bug.This document was published by the Web Applications Working Group as a Working Draft. This document is intended to become a W3C Recommendation. If you wish to make comments regarding this document, please send them to<EMAIL_ADDRESS>(subscribe, archives). All comments are welcome.
Publication as a Working Draft does not imply endorsement by the W3C Membership. This is a draft document and may be updated, replaced or obsoleted by other documents at any time. It is inappropriate to cite this document as other than work in progress.
This document was produced by a group operating under the 5 February 2004 W3C Patent Policy. W3C maintains a public list of any patent disclosures made in connection with the deliverables of the group; that page also includes instructions for disclosing a patent. An individual who has actual knowledge of a patent which the individual believes contains Essential Claim(s) must disclose the information in accordance with section 6 of the W3C Patent Policy.
This section is non-normative.
The Screen Orientation API provides an interface for web applications to access and lock the device's screen orientation state.
This examples is an application that shows the current screen orientation to the user every time the screen orientation state changes:
<!DOCTYPE html> <html> <head> <title>Screen Orientation API Example 1</title> <script> function show() { alert("Screen orientation state is now " + screen.orientation); } screen.addEventListener("orientationchange", show); window.addEventListener("load", show); </script> </head> <body> <input type='button' value='Unlock' onclick='screen.unlockOrientation();'> <input type='button' value='Lock to portrait' onclick="screen.lockOrientation('portrait');"> <input type='button' value='Lock to landscape' onclick="screen.lockOrientation('landscape');"> </body> </html>
As well as sections marked as non-normative, all authoring guidelines, diagrams, examples, and notes in this specification are non-normative. Everything else in this specification is normative.
The key words MUST, MUST NOT, REQUIRED, SHOULD, SHOULD NOT, RECOMMENDED, MAY, and OPTIONAL in this specification are to be interpreted as described in [RFC2119].
This specification defines conformance criteria that apply to a single product: the user agent that implements the interfaces that it contains.
Implementations that use ECMAScript to expose the APIs defined in this specification MUST implement them in a manner consistent with the ECMAScript Bindings defined in the Web IDL specification [WEBIDL].
The EventHandler interface represents a callback used for event handlers as defined in [HTML5].
The concepts queue a
task and fire
a simple event are defined in [HTML5].
Unless specified otherwise, when queuing a task, the screen
orientation task source is used.
The terms event handlers and event handler event types are defined in [HTML5].
The concepts of browsing context and active document are defined in [HTML5].
The current orientation is represented by one of the following values:
portrait-primary
portrait-secondary
landscape-primary
landscape-secondary
The concepts of primary orientation and secondary orientation depends
on the device and the platform. Some devices are in portrait mode when
the user holds the device in the normal orientation, other devices are
in landscape mode when the user holds the device in its normal
orientation. For devices whose normal orientation is a landscape mode,
that normal orientation SHOULD be represented as
landscape-primary
. For devices whose normal orientation
is a portrait mode, that normal orientation SHOULD be represented as
portrait-primary
. In both if the device is in
landscape-primary
and is rotated 90 degrees clockwise,
that SHOULD be represented as portrait-primary
.
The allowed orientations are represented by the following values:
portrait-primary
portrait-secondary
landscape-primary
landscape-secondary
portrait
portrait-primary
or
portrait-secondary
.
landscape
landscape-primary
or
landscape-secondary
.
To lock the orientation means forcing the rendering of the current browsing context to behave as if the screen was naturally orientated in a given orientation and will only change orientation to a given set of allowed orientations, regardless of the actual screen orientation relative to the user or the previous locks.
If the lock is done on only one orientation, the screen orientation MUST stay on the given orientation and never change until the screen orientation is locked again. Otherwise, the screen orientation MUST be able to change from an orientation to another as long as the orientations are amongst an orientation it has been locked to.
When the lock is done, if the orientation actually changed, the
user agent MUST fire a simple event named
orientationnchange
at the Screen
object.
The supported orientations is a set of orientations that a user agent can lock the orientation to.
The browsing context's default orientation is the set of orientations to which the screen orientation would be locked when it is not explicitly locked by the current browsing context.
Screen
Interface
Screen
interface
[CSSOM-VIEW], which this specification extends:
partial interface Screen : EventTarget {
readonly attribute DOMString orientation;
boolean lockOrientation ((DOMString or sequence<DOMString>) orientations);
void unlockOrientation ();
attribute EventHandler onorientationchange;
};
The orientation
attribute MUST return the value
representing the orientation of the screen. The returned orientation
MUST be in the current orientation list.
The lockOrientation()
method, when invoked, MUST run the
steps for locking the screen orientation. If
lockOrientation
was called with a sequence of strings, the
sequence MUST be used as orientation in the mentioned steps.
Otherwise, the passed string MUST be the only element in
orientations. The method MUST return the result returned from
running previous steps.
The unlockOrientation()
method, when invoked, MUST
asynchronously lock the orientation to the default
orientation. The user agent MAY ignore this call if the
screen is already locked to the default orientation.
When the screen orientation changes in the current browsing
context, the user agent MUST queue a task which
updates the orientation
attribute and fire a simple
event named orientationchange
at the
Screen
object.
For example, that means if an application A is locked to
landscape-primary
and application B is locked to
portrait-primary
, switching from application A to B or B
to A will not fire an orientationchange
event because
both applications will keep the orientation they had.
However, locking the orientation can fire an
orientationchange
if the orientation had to be changed
to satisfy the lock requirements.
The steps for locking the screen orientation are as follows:
This section is non-normative.
This specification doesn't intend to specify a declarative orientation locking. However, other specifications specify ways to do that.
The Web Application Manifest Format and Management APIs [WEBAPPS-MANIFEST-API] specifies a way to declare a default orientation for a web application inside the manifest file. That specification tries to follow this specification regarding orientation keywords.
The CSS Device Adaptation specification [CSS-ADAPTATION] specifies a way to declare a default orientation for a web page. That specification isn't yet in sync with this specification.
The following are the event handlers (and their corresponding
event handler event types) that MUST be supported as attributes
by the Screen
object:
| event handler | event handler event type |
|---|---|
onorientationchange
|
orientationchange
|
Thanks to Marcos Cáceres, Christophe Dumez, Anne van Kesteren and Chundong Wang for their useful comments.
Special thanks to Chris Jones and Jonas Sicking for their contributions to the initial design of this API.


Scheduling System
During this tutorial we will create a Scheduling System. Some roguelikes also refer to these as time systems. You can find out how lots of developers create their time systems by reading the Roguelike Dev Subreddit FAQ Friday #41.
Scheduling System Details
Most roguelikes including this tutorial are turn-based, meaning each Actor acts on their turn. The simplest way to achieve this is to just have a giant queue structure and have everyone act in order one-by-one. When the actor is removed from the queue and takes their turn then they get re-added to the back of the queue. The player goes, and then each monster takes a turn, then the player takes their turn again and so on.
Unfortunately if we did something that simple it wouldn’t be very interesting. All Actors would have the same speed. Effectively this would mean that you could never run away from monsters or catch a fleeing monster.
To get around this issue we will give each Actor a Speed
statistic which will represent how often they can take actions. You may even remember in a previous tutorial where we defined stats we already allocated a Speed
stat. We just never got around to using it, but we are about to fix that!
The concept behind our scheduling system is that it will keep track of the time or number of turns that have passed as well as the current time. The Speed
of the actor will determine when they get inserted into the timeline. Note that in this case having a lower speed is better.
In the Example Schedule above notice that during the first 12 turns the player with a speed of 4 will have acted 3 times. The goblin with a speed of 3 will have acted 4 times. And the Ooze with a speed of 6 will have only acted twice. This means that a player would be able to easily outrun an ooze, but not the goblin. The goblin moves twice as fast as the ooze.
Data Structure
To represent this data structure in code we will use a SortedDictionary<int, List<IScheduleable>>. This may look a little odd at first, but all it really means is that each Key
in the dictionary is an integer
that represents the time
. The Value
of each dictionary entry is a List<IScheduleable>
. But what exactly is an IScheduleable
? It’s a custom interface that we’ll make and it will just have a single property Time
. What we are saying is that we can put anything on the schedule as long as it has a Time
which represents how many turns pass until its time comes up again on the schedule. Add the IScheduleable.cs
file to the Interfaces
folder and add the following code.
public interface IScheduleable
{
int Time { get; }
}
So now that we see what an IScheduleable
is, the next question is why do we have a List<>
of them for each key in the dictionary? The answer goes back to our to our Example Schedule. If you look at it closer you’ll notice that more than one Actor
can act on the same time interval. At Time 6 both the Ooze and Goblin act. At time 12 all three act.
Let’s go ahead and create SchedulingSystem.cs
in the Systems
folder.
public class SchedulingSystem
{
private int _time;
private readonly SortedDictionary<int, List<IScheduleable>> _scheduleables;
public SchedulingSystem()
{
_time = 0;
_scheduleables = new SortedDictionary<int, List<IScheduleable>>();
}
// Add a new object to the schedule
// Place it at the current time plus the object's Time property.
public void Add( IScheduleable scheduleable )
{
int key = _time + scheduleable.Time;
if ( !_scheduleables.ContainsKey( key ) )
{
_scheduleables.Add( key, new List<IScheduleable>() );
}
_scheduleables[key].Add( scheduleable );
}
// Remove a specific object from the schedule.
// Useful for when an monster is killed to remove it before it's action comes up again.
public void Remove( IScheduleable scheduleable )
{
KeyValuePair<int, List<IScheduleable>> scheduleableListFound
= new KeyValuePair<int, List<IScheduleable>>( -1, null );
foreach ( var scheduleablesList in _scheduleables )
{
if ( scheduleablesList.Value.Contains( scheduleable ) )
{
scheduleableListFound = scheduleablesList;
break;
}
}
if ( scheduleableListFound.Value != null )
{
scheduleableListFound.Value.Remove( scheduleable );
if ( scheduleableListFound.Value.Count <= 0 )
{
_scheduleables.Remove( scheduleableListFound.Key );
}
}
}
// Get the next object whose turn it is from the schedule. Advance time if necessary
public IScheduleable Get()
{
var firstScheduleableGroup = _scheduleables.First();
var firstScheduleable = firstScheduleableGroup.Value.First();
Remove( firstScheduleable );
_time = firstScheduleableGroup.Key;
return firstScheduleable;
}
// Get the current time (turn) for the schedule
public int GetTime()
{
return _time;
}
// Reset the time and clear out the schedule
public void Clear()
{
_time = 0;
_scheduleables.Clear();
}
}
Quite a bit of code and if we run the game again nothing will have changed since the last tutorial. We won’t get a chance to actually see our scheduling system in action until next time.
Code on GitHub
As always the code for the tutorial series so far can be found on GitHub:
Bored waiting for the next tutorial? The complete tutorial project is already finished and the source code is available on Github:
- Sample Roguelike game using RogueSharp and RLNet console
- Sample Roguelike game using RogueSharp and SadConsole


Give us an opportunity to earn your business and your trust as we continue to work throughout the South Bay and West LA.
Our team is experienced in leaks & clogs, copper repipes, sewer & emergency repair, water heaters, toliets & fixtures, green plumbing and new constuction projects!
We have serviced restaurants, office buildings, strip malls, retailers and apartment buildings for service, repair and new construction.
We install your plumbing system to your specifications and work with the building inspector throughout the process to ensure that your plumbing system passes inspection. We are well versed in local plumbing codes and are great at working with the various personalities involved to ensure happy building owners, tenants, and government officials.
Honest and Fair: We tell you our price upfront. We will provide you with a straight-forward service quote explaining what needs to be done.
Informative: We believe that accurate, detailed and timely information builds trust. We will educate you regarding your plumbing needs and options.
Licensed, Bonded & Insured: We are a C-36 licensed, bonded, plumbing contractor with liability and workers compensation insurance.
Neat Clean & Professional: We respect your home or place of business.
"I have used Rudy since I bought my condo in 2007 on the recommendation of a friend who has multiple properties and remodels often. He spends time discussing exactly what he's doing and why, and the work is excellent.  He's a good guy."
"Rudy and his team are dependable and excellent at solving from the simple to complex plumbing issues. We have used No Limits Plumbing for years and recommend his company to our clients."
"Rudy and his guys are some of the most honest guys I know. I have been using No Limits Plumbing for 6 + years and never had any problems. If a mistake is made Rudy makes it right. He never tries to sell me something I don't need and he does a good job fixing whatever the issue is. I would recommend them anytime and I do!"


Ultimate Hangman
Long ago, ancient gods predicted the rise of the machines and established Ultimate Hangman as the final contest to decide who rules Earth.
Game Rules
×
Game rules
Press a letter and guess the word. You get 7 chances to guess the right word.


Welkom
Dit is wat tekst om te zien hoe dat er uit komt zien
My first slide
Some content
- First point
- Second point
Second slide
Some more content
De titel
Hier komt dan wat tekst, misschien wat uitleg en nog meer.
Hoe met columns
Hier dus allemaal tekst endezo
Hier voor de andere kolom
Hoe met (table)
| Hier dus allemaal tekst endezo |
Hier voor de andere kolom |
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.
Yet another one
Yet another slide with content, let's see how it goes.