| About Dailyrotten |
|
Feedback
If you like this page, hate it, or would like to suggest changes,
<EMAIL_ADDRESS>is listening. This page
is experimental and somewhat different from what we usually offer, so please
do send your feedback.
Adding Stories
If you are a rotten newshound and you would like to suggest a story,
visit our submit page to
send us the URL. Stories that are accepted will have your name credited.
Viewership
On the first full day this page went live, 100,000 people visited this Rotten
News page. Of course that was the day after the WTC attacks, so that number is
somewhat distorted. Right now this page gets between 50,000 and 75,000 people
every day.
Linking
We encourage everyone to link to this page; if you like it, others probably
will as well.
Other Rotten
Rotten
Gaping Maw
Celebrity Morgue
Mugshots
Rotten Store
Shockumentary
Rate My Poo
Rate My Kitten
Rate My Finger
Penny Postcards
Phallic
Dr. Sputnik
Boners
Dead Pool
NNDB
Home
Make Dailyrotten your start page
|
|
|
July 24, 2003
US releases Uday and Qusay snuff photos
CNN | Submitted by: GregNorc
"The provisional authority in Iraq has released photographs Thursday it said were of Saddam Hussein's sons Uday and Qusay, aimed at convincing skeptical Iraqis that they were killed in a raid by U.S. troops. ... Former CIA Director James Woolsey said in an interview with CNN that releasing the photographs is necessary. 'Normally, we would not do this,' he said. 'But I think it's necessary for the world to see and particularly for the Iraqis to see that these two are, in fact, dead, that this is not some ginned-up story from the United States.' ... Army .50-caliber machine guns and 10 Humvee-mounted TOW missiles were used in the assault and Sanchez said it's believed the missiles probably killed the brothers."
|
|
Read article... and
This... and
This...
|
|
Crippled wife stuck in shit, maggots
KMBC-TV 9 Kansas City | Submitted by: Tim Howard
"Police said a man left his wheelchair-bound wife lying on the floor of their home for months until the woman was literally adhered to the living-room carpet. ... Paramedics who responded called police after finding the woman lying on the floor in her own excrement. Police officers said woman was found with several open sores on her body, with bone exposed in some places, and live maggots infesting the wounds. ... Dog excrement was also found on the floor.  He told the police that earlier this week he travelled with two of the eunuchs to the city of Ludhiana in the neighbouring state of Punjab. 'I was given tranquilisers in my food and once I fell unconscious the crude surgery was carried out to remove my penis,' Sonu, a member of India's lowest caste, the Dalits, told the police. ... It is not clear why the eunuchs would have wanted to cut off the man's penis."
|
|
Read article...
|
|
Inmate gives birth to girl, future lawsuit in jail toilet
Houston Chronicle | Submitted by: j trottter
"La'Keisha Mackey gave birth to the four-pound girl Wednesday in a stainless steel toilet in the Tom Green County Jail after her arrest at a local mall Tuesday. Mackey had outstanding warrants for hot checks, unpaid traffic tickets and probation she said she didn't know about. ... By 1 a.m., Mackey's contractions were about 10 minutes apart and at 3 a.m. they were only five minutes apart. The jail's contract physician visited her Wednesday morning and gave her two over-the-counter painkillers, but did not address her pregnancy. ... 'I was in so much pain and I was bleeding and they didn't say anything.'"
|
|
Read article...
|
|
South African baby born with 3 legs, 2 penises, no anus
iAfrica | Submitted by: Tim Howard
"A baby boy born with three legs and two male organs around the hip in the St Elizabeth Hospital in Lusiksiki is to be flown to the Red Cross Children's Hospital in Cape Town on Thursday. ... 'It was supposed to be a twin delivery,' Goqwana told Sapa. 'The baby has one head, and around the hip it has two penises. It also has three legs as well as an undeveloped arm. There is also no anus.'"
|
|
Read article...
|
|
Computer voting riddled with "stunning, stunning flaws"
New York Times | Submitted by: webbedouin
"The software that runs many high-tech voting machines contains serious flaws that would allow voters to cast extra votes and permit poll workers to alter ballots without being detected, computer security researchers said yesterday. 'We found some stunning, stunning flaws,' said Aviel D. Rubin, technical director of the Information Security Institute at Johns Hopkins University, who led a team that examined the software from Diebold Election Systems, which has about 33,000 voting machines operating in the United States. 'With what we found, practically anyone in the country -- from a teenager on up -- could produce these smart cards that could allow someone to vote as many times as they like.' ... Peter G. Neumann, an expert in computer security at SRI International, said the Diebold code was 'just the tip of the iceberg' of problems with electronic voting systems."
|
|
Read article... and
This article...
|
|
Juror dozes during evidence screening, prompts mistrial
Cincinnati Enquirer | Submitted by: The Good Doctor
"After one juror fell asleep and two others averted their eyes during the showing of an adult video, a Hamilton County judge ordered a second mistrial in a pandering obscenity case Wednesday. The video, Max Hardcore Extreme Vol. No. 7, was the central piece of evidence... Hamilton County Prosecutor Mike Allen said he plans to try Jenkins again on the charges, for a third time. That hearing date is set for Jan. 12, 2004. 'It's my understanding a juror was looking away in disgust,' Allen said. 'It speaks volumes about the strength of our case.'" [And what about the juror who slept through it? Res Ipsa Loquitur, pal.]
|
|
Read article...
|
|
Egyptian government takes over nation's mosques
Inter Press Service News Agency | Submitted by: Reid Fleming
"The same official sermon will be delivered in 88,000 mosques across Egypt... As of Friday this week, no preacher will be free to deliver his own sermon, according to a statement from the Awaqaf (religious endowments) ministry. ... The sermon will now be written and distributed by officials from the regime of President Hosni Mubarak. ... Preachers at all newly appropriated mosques will be asked to attend state-run religious indoctrination courses. Preachers will only be appointed after clearing an examination and passing a security test."
|
|
Read article...
|
|
Abortion foe lobbies on behalf of drug companies
Washington Post | Submitted by: Katie
"A Christian lobbying group fighting the proposed importation of low-cost prescription drugs has received behind-the-scenes help from the drug industry, the latest example of pharmaceutical companies trying to influence Congress clandestinely. ... The Traditional Values Coalition (TVC) portrays its campaign as a moral fight for the 'sanctity of life.' ... A recent TVC letter sent to Congress was signed by the coalition's executive director, Andrea Sheldon Lafferty. It was originally drafted, however, by Tony Rudy, a lobbyist for pharmaceutical companies and a former top aide to House Majority Leader Tom DeLay... Several Republicans said pharmaceutical companies, through their lobbyists, contacted other conservative groups, including the Christian Coalition, about waging a similar campaign against the reimportation measure. The Traditional Values Coalition was the only taker."
|
|
Read article...
|
|
RIAA launches "shock and awe" legal campaign
Fox News | Submitted by: Boat6float
"Parents, roommates -- even grandparents -- are being targeted in the music industry's new campaign to track computer users who share songs over the Internet, bringing the threat of expensive lawsuits to more than college kids. ... The president of the Recording Industry Association of America, the trade group for the largest music labels, warned that lawyers will pursue downloaders regardless of personal circumstances because it would deter other Internet users. ... The RIAA has issued at least 911 subpoenas so far, according to court records. Lawyers have said they expect to file at least several hundred lawsuits within eight weeks, and copyright laws allow for damages of $750 to $150,000 for each song."
|
|
Read article...
|
|
Chicago serial rapist no longer resembles Ice Cube
NME | Submitted by: Rockpile
"Chicago police have issued an apology to Ice Cube, after they issued a community alert likening a man suspected in a series of sexual assaults to the rapper. The police are currently searching for a man who sexually assaulted three women in the Wicker Park area of Chicago's North Side. The alert was released on Sunday (July 20) describing the wanted man as a black male in his mid-20s who 'resembles the popular rap artist Ice Cube.'"
|
|
Read article...
|
|
Microsoft facing worst lawsuit ever
fortune.com | Submitted by: Jim Guerin
"Microsoft suffered utter defeat at a crucial pretrial hearing in what appears to be the highest-stakes patent litigation ever -- one in which a tiny company called InterTrust Technologies claims that 85% of Microsoft's entire product line infringes its digital security patents. InterTrust's engineers developed and patented what they say are key inventions in two areas: so-called digital-rights management and trusted systems. ... Though InterTrust declines to place a pricetag on the suit, it's hard to imagine the company settling now for any sum that does not have a 'B' in it. InterTrust claims that its inventions cover technologies that Microsoft has been weaving into its Windows XP operating system, Office XP Suite, Windows Media Player, Xbox videogame console, and .NET networked computing platform, to name just a few."
|
|
Read article...
|
|
World's purplest polar bear
Yahoo! News | Submitted by: Soylent
"Pelusa, a fourteen-year-old female polar bear, looks through the bars of her cage... Pelusa, normally white, turned violet after veterinarians administered a drug to treat a skin's infection. Veterinarians said she should turn to her normal color within a month." With photos, naturally.
|
|
Read article...
|
|
|
|
|


How the cost of health insurance in Switzerland depends on where you live
by The LocalWith just over a week to go until you can change your health insurance provider, we’ve broken down the regional differences in health insurance costs. Spoiler alert: in some places, you’ll pay more than double.
Health insurance - like pretty much everything else in Switzerland - is expensive.
And unlike wine, restaurant food and cheese, health insurance is compulsory (OK, well cheese might be compulsory in certain settings, depending on the event, the company you keep and of course the cheese).
But where is it the most expensive - and where is it the cheapest?
The Swiss Department of Health has released its annual figures on health insurance costs - both for premiums and deductibles - across the country.
Some are given across an entire canton, while some of the larger cantons are broken up into geographic districts.
Residents of Switzerland have until the 29th of November to provide their insurer with a notification that you want to cancel your policy.
Photo: Depositphotos
With each insurer legally obliged to inform you of any cost changes by October 31, you should have already received a letter telling you of any increases.
Estimated increases are approximately 0.2 percent, meaning it makes sense to look around and see if you can save.
SPONSORED: The trick to saving money on your Swiss health insurance
Pursuant to Swiss law, everyone is required to take out health insurance within three months of arriving in the country - whether by birth or by traditional modes of transport.
A Swiss health insurance policy will include a monthly premium, as well as a deductible - known in Switzerland as a ‘franchise’.
What makes health insurance more expensive?
There are a number of factors which increase the cost of your health insurance.
Demographics are a major one, while population density and access to hospitals will also play a role.
Choosing a deductible will also make an impact, with a higher deductible meaning a lower premium. You will of course have to pay more in the event of medical treatment, so keep that in mind when making a decision.
READ MORE: What you need to know before taking out Swiss health insurance
The following figures are for people over the age of 26, with anyone younger than that age eligible for discounted health insurance.
The most expensive cantons for health insurance in Switzerland (minimum deductible of CHF300)
If you minimise your deductible to CHF300 - meaning of course your premiums will be higher - the most expensive will be in Basel City, where you’ll pay just over CHF450 per month.
Basel City. High water, high premiums. Image: Depositphotos
Perhaps predictably, Geneva is the next most expensive - with a premium of CHF439 - followed by the southern region of Vaud where you’ll pay CHF415 per month.
Finally, anyone living that capital lifestyle in the canton of Bern is likely to be paying a capital price, with a monthly sum of CHF413 in the Bern city region.
Where will my premium be the cheapest in Switzerland? (CHF300 deductible)
When paying the minimum deductible of CHF300, the cheapest by far is in the north eastern canton of Appenzell Innerrhoden, where monthly premiums sit at CHF266.
From there, residents of the tiny canton of Nidwalden pay CHF280 per month, while Lucerne is a tad higher at just over CHF290.
Appenzell Innerrhoden. Not a high premium in sight. Image: Depositphotos
What about a higher deductible?
Want to pay less per month but more in the event of health treatment? The maximum deductible you can take is CHF2,500.
The most expensive are the usual suspects of Basel City (CHF428 per month), Geneva (CHF413) and Neuchâtel (CHF390).
At the cheaper end of the spectrum, Appenzell Innerrhoden (CHF202), Uri (CHF225) and Nidwalden (CHF226) are again at the top of the list.
What does the obligatory/compulsory insurance cover?
It pays for doctor-prescribed medications, treatments, and hospitalisations. But it never covers 100 percent of your expenses.
Aside from the deductible, you usually pay 10 percent of the cost for your doctor's visits and prescription medications. If you choose a brand drug when a generic alternative is available, that can rise to 20 percent.


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/app.20builder.20exception.2C.20caused.20by.20.60subst.60.html ---
Has anyone seen the error
app_builder_exception, more information can be obtained using command `set_option trace.app_builder true`
and then with trace_app_builder
[app_builder] failed to build eq.rec, invalid motive: λ (r : ↥R), ↥S
This being caused by a call to subst z
, where
R S : Ring, r : ↥R, r_1 : (forget Ring).obj S, z : r = ⇑(equiv.symm (iso.to_equiv (map_iso (forget Ring).obj i))) r_1
I'm not really sure what problem I should be looking for.
what is the goal?
pp.all please
one sec, there's a duplicated variable name, let me get rid of that
https://gist.github.com/semorrison/a3c3c46a1b260fc04387c5492bca96d2
without pp.all
the state is
app_builder_exception, more information can be obtained using command `set_option trace.app_builder true` state: R S : Ring, i : R ≅ S, r : ↥R, x : (forget Ring).obj S, z : r = ⇑(equiv.symm (iso.to_equiv (map_iso (forget Ring).obj i))) x ⊢ ↥S
and we're calling subst z
.
I also want to see that invalid motive with pp.all
[app_builder] failed to build eq.rec, invalid motive: λ (r : @coe_sort.{u+2 u+2} Ring.{u} Ring.has_coe_to_sort.{u} R), @coe_sort.{u+2 u+2} Ring.{u} Ring.has_coe_to_sort.{u} S
seems harmless to me?
Oh, I just checked the code and that term is supposed to be a pi type
it gives that error because it's a lambda instead
wait, scratch that, it infers the type and makes sure that is a pi type which is a sort
I think I see how this is going wrong
what is the type of that term?
import algebra.category.CommRing.basic universes u variables (R S : Ring.{u}) #check λ (r : @coe_sort.{u+2 u+2} Ring.{u} Ring.has_coe_to_sort.{u} R), @coe_sort.{u+2 u+2} Ring.{u} Ring.has_coe_to_sort.{u} S -- λ (r : ↥R), ↥S : ↥R → has_coe_to_sort.S Ring
has_coe_to_sort.S Ring
is defeq to Sort u
but subst isn't trying hard enough to find that out
@Mario Carneiro, is there some simplification that I could do beforehand that might help subst
? Or I'm I going to have to look into the implementation of subst_core
?
a quick fix might be to use cases
or rw
instead of subst
Oh, actually the way it's written it doesn't even try to reduce the expression before matching it against Sort u
. That's definitely a bug, it should whnf
the thing first
https://github.com/leanprover-community/lean/pull/165
Awesome :-)
Now I need to remember how to run against a branch of lean. I will try this out asap.
hmm, less easy than I hoped :-)
{% endraw %}Last updated: Apr 24 2020 at 19:02 UTC


The purpose of CAM is to attract automobile enthusiasts who are currently interested and/or participating in autocross events for muscle cars and vintage vehicles manufactured in North America by GM, Ford, Chrysler, and AMC. This class, unlike many other classes, is relatively unrestricted. Any modification is typically allowed unless specifically stated otherwise in the rules. This is unlike other classes that disallow any modification unless otherwise specified in the rules.
Your subclass(es) should be highlighted
Components and method of attachment are NOT restricted
Components and method of attachment are NOT restricted
Any wheels are allowed. Non-metallic wheels must be certified/approved from an appropriate, recognized standards organization (e.g., FIA, SFI, SAE, TUV, etc.)
Your subclass should be highlighted
Components (internal and external) are unrestricted


| The Top 8 client domains |
|---|
| More details | ||||||
|---|---|---|---|---|---|---|
| No. | Hits | 304's | KBytes sent | Domain | ||
| 1 | 75 | 82.42% | 23 | 92.00% | 346 | iastate.edu |
| 2 | 5 | 5.49% | 0 | 0.00% | 6 | att.net |
| 3 | 4 | 4.40% | 0 | 0.00% | 7 | Stanford.EDU |
| 4 | 2 | 2.20% | 2 | 8.00% | 0 | ucar.edu |
| 5 | 2 | 2.20% | 0 | 0.00% | 19 | com.lb |
| 6 | 1 | 1.10% | 0 | 0.00% | 8 | dec.com |
| 7 | 1 | 1.10% | 0 | 0.00% | 1 | netcom.com |
| 8 | 1 | 1.10% | 0 | 0.00% | 3 | atext.com |
|


An attempt to revive the long-dormant genre of musical fantasy, the $20 million "Xanadu" was generally blasted by the media when it opened in 1980; Esquire went so far as to call it "Xanadon't." But time has been oddly kind to this much-maligned movie. In the 19 years since it first appeared, it's generated a substantial cult following, and it's not hard to see why, especially in light of the big-band revival (which "Xanadu" predicted) and the mania for all things disco (which "Xanadu" celebrates). There's never been a movie quite like this, and there never will be again. And that may not be a bad thing.
But taken for what it is -- an unapologetic wallow in the glitz and gloss of the late 1970s -- "Xanadu" is actually a lot of fun. After all, it's difficult to hate a picture that tries so desperately hard to dazzle.
The slender story concerns a disillusioned artist named Sonny (Michael Beck, whose line-readings give new meaning to the term 'wooden') who's persuaded by former bandleader Danny McGuire (Gene Kelly, looking pleasantly baffled by everything going on around him) and the mysterious beauty Kira (Olivia Newton-John at her most radiant) to open a state-of-the-art roller disco called -- ta da! -- Xanadu. It's doubtful, however, that Kubla Khan's 'stately pleasure dome' had much in common with this place, where spandex-clad vixens, guys with over-moussed hair and other fashion victims get down to the sounds of the Electric Light Orchestra.
While this boogie wonderland is under construction, Sonny winds up falling in love with the evasive Kira, who won't reveal anything about herself except that she lives with her sisters "on the second floor." Kira realizes love between a mortal and a goddess is strictly taboo, but that doesn't stop her from giving her heart to Sonny. After she's whisked back to a strangely empty-looking heaven, Sonny goes after her and persuades her to come back to Earth one more time. In the movie's wildly over-the-top finale, Kira appears on the opening night of Xanadu and takes on the personas of a tap-dancing Betty Grable, a mini-skirted Nancy Sinatra, a boot-scottin' cowgirl and a princess from outer space to perform a floorshow no one's likely to forget.
Ridiculous? You bet. But Newton-John and Kelly are thoroughly charming, the music (including Newton-John's huge hit "Magic" and the lilting "Suddenly") is intoxicating, the production design is out of this world and the costumes are, well, very much a product of their time. The script also manages to contrive a pleasantly perplexing wrap-up to the romance, rather than going for the obvious.
Most importantly, "Xanadu" serves as a time capsule of that magic moment when the future of pop was up for grabs. In "Dancin'," one of the strangest musical numbers ever put on celluloid, a faux-Glenn Miller big-band clashes with shock-rockers The Tubes, and their wildly different styles ultimately merge into a curious but cohesive whole. It's a hilarious and effective argument for open-mindedness.
There's also a cheerful positivity to the entire project that's completely out of step with the jaded 1990s. The story speaks out against cynicism and self-defeatist thinking, insisting that those who truly believe in their dreams will ultimately triumph. Naive as it may sound, that kind of message is genuinely refreshing to hear these days. As a movie, its merits are debatable, but as a relic of a long-gone era, "Xanadu" is priceless. James Sanford
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Week 6 Cultural Post - Stereotype Threat
Stereotypes are always annoying in any circumstance. And as a minority, it's something that I'e come across many a time. Obviously, depending on the context and the level of comfort, some stereotypes can be made fun of and even brought out to be changed.
I do get a lot of the math/bookworm/nerdy stereotypes. And while it's nice to have people automatically think you're better at something because of how you look, it does make me feel a little ashamed if I'm good at it.
One prime example is that I think if I didn't think it was such a stereotype to be some asian programmer sitting at a desk typing away, I think I may have looked more into getting into Comp Sci or Engineering when going to college
Ironically, it was finance that I got into, which had the same sort of stereotype. Asians in finance were a dime a dozen. This time, however, made me realize that it didn't matter what I looked like, and I found that I had realized that I wanted to follow the philosophy of software development, and not worry about any sort of stereotype or associated connotations that come with it.
In the end, postiive and negative stereotypes create untrue and unrealistic expectations of people even before they have a chance to try something. If you think you're supposed to be bad at something because a stereotype says you do, you might not try it and by default you'll never be good at it. Or be discouraged very quickly when success doesn't happen right away. It can also drive you away if it's a stereotype that does not necessarily have the most positive connotation.
Unfortuantely a lot of these steroetypes are embeded in society. In reality, there just needs to be trailblazers and first movers, to break stereotypes, whether through specific programs that could be controversial (affirmative action), or by students themselves, attempting to break stereotypes that were forced on them


{{+bindTo:partials.standard_nacl_api}}
| TextInputController (const InstanceHandle &instance) | |
| ~TextInputController () | |
| void | SetTextInputType (PP_TextInput_Type type) |
| void | UpdateCaretPosition (const Rect &caret) |
| void | CancelCompositionText () |
| void | UpdateSurroundingText (const Var &text, uint32_t caret, uint32_t anchor) |
This class can be used for giving hints to the browser about the text input status of plugins.
| pp::TextInputController::TextInputController | ( | const InstanceHandle & | instance | ) | [explicit] |
A constructor for creating a TextInputController
.
| [in] | instance | The instance with which this resource will be associated. |
Destructor.
CancelCompositionText() informs the browser that the current composition text is cancelled by the plugin.
| void pp::TextInputController::SetTextInputType | ( | PP_TextInput_Type | type | ) |
SetTextInputType() informs the browser about the current text input mode of the plugin.
| [in] | type | The type of text input type. |
| void pp::TextInputController::UpdateCaretPosition | ( | const Rect & | caret | ) |
UpdateCaretPosition() informs the browser about the coordinates of the text input caret area.
| [in] | caret | A rectangle indicating the caret area. |
| void pp::TextInputController::UpdateSurroundingText | ( | const Var & | text, |
| uint32_t | caret, | ||
| uint32_t | anchor | ||
| ) |
UpdateSurroundingText() informs the browser about the current text selection and surrounding text.
| [in] | text | A UTF-8 sting indicating string buffer of current input context. |
| [in] | caret | A integer indicating the byte index of caret location in text . |
| [in] | caret | A integer indicating the byte index of anchor location in text . If there is no selection, this value should be equal to caret . |


Michael's True Face
The script for Halloween (1978) actually never called for a specific kind of mask. It had a description that was very general, and it ultimately ended being the reason that a Captain Kirk mask was bleached and stretched to eventually be used in the movie! Star Trek but with a serial killer-y vibe, oof, imagine Michael floating in space!
David Warner Krueger?
Wes Craven apparently planned to have a stuntman play the role of our hilarious dream demon, but instead tried going for the smarter pic of David Warner. Fortunately for us Warner wasn't interested or he was busy because he passed on the project and from there iconic Englund sat on his Kruegar throne! Although maybe the movies needed more Titanic?
Leatherface Was Inspired?
Apparently one guy, Ed Gein, managed to be an inspiration for not one, or two, but three horror movies! Who would have thought being a real life serial killer who made masks and decorations with human parts, was a cannibal, and grave robber would make such good content! Our big guy Jed sure takes a lot from this fella...


Loading SIS . . .
| Per | Class Title | Grade | Updated |
|---|---|---|---|
| 1 | Class Name | A- (91.5%) | (Sept 9) |
| Category | Weight | Points | Max | Percent |
|---|---|---|---|---|
| Homework | 20% | 20 | 25 | 80.00% |
| Per | Class Title | Grade | Updated |
|---|---|---|---|
| 1 | Class Name | A- (91.5%) | (Sept 9) |
| Category | Weight | Points | Max | Percent |
|---|---|---|---|---|
| Homework | 20% | 20 | 25 | 80.00% |


Try out our Premium Member services: Virtual Legal Assistant, Query Alert Service and an ad-free experience. Free for one month and pay only if you like it.
:1: IN THE HIGH COURT OF KARNATAKA DHARWAD BENCH DATED THIS THE 13TH DAY OF MARCH, 2014 BEFORE THE HON'BLE MR.JUSTICE ARAVIND KUMAR WRIT PETITION NO.103396/2014 (GM-CPC) BETWEEN 1. MAILARAPPA S/O. SHASHIDAR KALLIHAL AGE: 35 YEARS, OCC: PRIVATE R/O. SAPTAPUR, MICHIGAN COMPOUND DHARWAD. 2. FAIROZ KHAN S/O. NOORULLAH KHAN SOUDAGAR AGE: 64 YEARS, OCC: RETD. R/O. SAPTAPUR, MICHIGAN COMPOUND DHARWAD 3. RAJA HYDER S/O. ANNERUDDIN SUNGAD AGE: 30 YEARS, OCC: PRIVATE R/O. SAPTAPUR, MICHIGAN COMPOUND DHARWAD 4. MOHAMMAD ARIF S/O. ABDUL HAMEED TEENWALE AGE: 39 YEARS, OCC: BUSINESS R/O. SAPTAPUR, MICHIGAN COMPOUND DHARWAD 5. SURESH S/O. BASAVANT WARANG AGE: 46 YEARS, OCC: PRIVATE R/O. SAPTAPUR, MICHIGAN COMPOUND DHARWAD. 6. KALEEMULLAH :2: S/O. MOHAMMAD IQBAL DIWALDAR AGE: 28 YEARS, OCC: PRIVATE R/O. SAPTAPUR, MICHIGAN COMPOUND DHARWAD. ..... PETITIONERS (BY SRI C.V.ANGADI, ADV.) AND 1. SAMPAT S/O. PUNDALIK RAJAGERI AGE: 41 YEARS, OCC: CARPENTER R/O. SAPTAPUR, MICHIGAN COMPOUND DHARWAD 2. COMMISSIONER, HDMC, DHARWAD 3. ASSISTANT COMMISSIONR HDMC DHARWAD, SAPTAPUR MICHIGAN COMPOUND DHARWAD. 4. DISTRICT COMMISSIONER DHARWAD 5. AIR POLLUTION CONTROL OFFICE LAKAMANAHALLI INDUSTRIAL AREA DHARWAD REP.BY ENVIRONMENTAL OFFICER. ..... RESPONDENTS (BY SRI ARUN L.NEELOPANT AND SRI SHRIHARSH A.NEELOPANT, ADV. FOR C/R1, SRI M.G.NAGANURI, ADV FOR R2, SRI VINAYAK S.KULKARNI, HCGP FOR R4, NOTICE TO R5 DISPENSED WITH) THIS WRIT PETITION IS FILED UNDER ARTICLES 226 & 227 OF CONSTITUTION OF INDIA PRAYING TO QUASH THE IMPUGNED ORDER IN MISC.APPEAL NO.32/2013 DATED 09.01.2014 PASSED BY THE II ADDITIONAL SENIOR CIVIL JUDGE AND AMACT, DHARWAD (ANNEXURE-A TO THE WRIT PETITION) AND THE ORDER PASSED BY THE III ADDITIONAL CIVIL JUDGE (JR.DN)AND :3: JMFC, DHARWAD AT DHARWAD ON I.A.NO.VII DATED 02.09.2013 IN O.S.NO.291/2012 ANNEXURE-B BY ALLOWING I.A.NO.VII, FILED BY THE PETITIONERS IN O.S.NO.291/2012, THEREBY RESTRAINING THE RESPONDENT NO.1 FROM RUNNING THE WOOD INDUSTRY AND ETC., THIS WRIT PETITION COMING ON FOR PRELIMINARY HEARING, THIS DAY, THE COURT MADE THE FOLLOWING: ORDER
Though the matter is listed for preliminary hearing, by consent of learned advocates appearing for the parties, it is taken up for final disposal.
2. Heard Sri C.V.Angadi, learned counsel appearing for the petitioners, Sri Arun L.Neelopant, learned counsel appearing for caveator/respondent No.1, Sri M.G.Naganuri, learned counsel appearing for respondent No.2 and Sri Vinayak S.Kulkarni, learned High Court Government Pleader appearing for respondent No.4. Issuance of notice to respondent No.5 is dispensed with. Parties are referred to as per the rank in the trial Court. :4:
3. Plaintiffs have filed a suit in O.S.No.291/2012 seeking for declaration that wood factory situated at Michigan compound, Dhawad, is an illegal factory since it is run without valid license and same is causing nuisance by way of noise pollution. When the matter was set down for evidence i.e., after a period of one year from the date of filing of the suit, an application for temporary injunction came to be filed by the plaintiffs. 1st defendant resisted the said application by filing detailed statement of objections. Trial Court after considering rival contentions by order dated 02.09.2013 dismissed the application on the ground that the plaintiffs had kept quiet all along from the date of filing of the suit and Pollution Control Board had issued Environmental Clearance Certificate specifying that the noise level should not exceed 75 decibels during day time and 70 decibels at night time and also on the ground that 1st defendant had already obtained an order :5: of perpetual injunction against the Hubli Dharwad Municipal Corporation namely the Corporation restraining them from running the industry.
4. Being aggrieved by this order, plaintiffs filed an appeal in Misc.Appeal No.32/2013 which came to be allowed in part by setting aside the order of trial court and remanding the matter back to trial court with a direction to appoint a Court Commissioner on an application filed by either side of the parties and after seeking necessary report with regard to allegations made by plaintiffs regarding noise and air pollution and to dispose of the interlocutory application afresh in accordance with law. I am of the considered view that order of lower Appellate Court does not suffer from any infirmity whatsoever. Impugned order does not indicate as to who should be appointed as Court Commissioner and if same is clarified it would meet the ends of justice. :6:
5. Undisputedly, for establishing an industry of this nature, 1st defendant had applied with the Karnataka State Pollution Control Board and obtained a Consent Certificate on 25.08.2011 for the period 01.01.2011 to 31.12.2020, Consent Order had been granted fixing the noise pollution level at 75 decibels during day time and 70 decibels during night time. It is this consent order issued by the Pollution Control Board which swayed in the mind of the trial Court to dismiss application for injunction. However, the Corrigendum dated 19.05.2012 issued by the Pollution Control Board has not been noticed by the trial Court. Though this was available with the parties, for reasons best known, neither of the parties produced this before the lower appellate Court also. De-hors non-production of said Corrigendum issued by Pollution Control Board, lower Appellate Court has observed that a Court Commissioner can be appointed to record the noise pollution level of :7: the 1st defendant's industry and thereafter I.A. for temporary injunction can be considered. When a statutory authority is empowered to grant Consent Order under the Air (Prevention and Control of Pollution) Act, 1981, it is the said authority alone which would be empowered to find out as to whether there is any infraction of the consent order given by it or the conditions stipulated for grant of such consent has been violated by the Licensee. In the light of the aforesaid facts, I am of the considered view that it would suffice if the order of the lower Appellate Court is clarified to the effect that Court Commissioner proposed to be appointed as ordered by the lower Appellate Court shall be construed as appointing an Official of the Karnataka State Pollution Control Board as Court Commissioner to record the noise level generated from the 1st defendant- Industry. Either of the parties can file a necessary memo to the said effect before the trial court and on :8: their failure to do so, trial Court itself would be at liberty to suo-motto appoint an Official of the Karnataka State Pollution Control Board to record the noise pollution level and on receipt of the report, it shall consider IA-I for temporary injunction on merits and in accordance with law by affording opportunity to both the parties. All contention of both parties are left open.
With this observation, writ petition stands disposed of. No costs.
SD/-
JUDGE Jm/-


imirage.Rmd
iMIRAGE stands for imputed microRNA (miRNA) activity from gene expression. As the name suggests, the package imputes expression of miRNAs by constructing prediction models that only depend on the expression levels of protein-coding genes. In essence, iMIRAGE package can impute the miRNA profiles of samples where protein-coding expression data is available (for example, from microarray or RNA-seq), but do not contain reliable miRNA expression. By utilizing a training data set containing both protein-coding and miRNA expression profiles, iMIRAGE constructs prediction models using machine-learning to impute miRNA profiles of the independent (test) data set of interest.
The iMIRAGE package also provides tools to create an integrated workflow, to harmonize, clean-up, normalize and standardize the expression data sets. In addition, the package provides an option of using miRNA-target gene pair information to construct the prediction models
The iMIRAGE package for R can be downloaded from the GitHub repository:
#Download package from GitHub using devtools
devtools::install_github("aritronath/iMIRAGE")
#Load the package in R
library(iMIRAGE)
#> Loading required package: randomForest
#> randomForest 4.6-14
#> Type rfNews() to see new features/changes/bug fixes.
#> Loading required package: FNN
#> Loading required package: e1071
The iMIRAGE package includes necessary functions for pre-processing and harmonization of expression data sets, miRNA expression imputation and cross-validation analyses. In addition, TargetScan miRNA-target gene pairs are provided for constructing imputation models. The package also includes the example data sets that are used in this vignette.
In this example, we will use the two independent miRNA data sets that were derived from the Cancer Genome Atlas (TCGA) Breast Cancer (BRCA) project. These data sets are automatically available when the iMIRAGE package library is loaded.
The prefix HS refers to TCGA BRCA samples for which miRNA mature strand expression were obtained using the Illumina Hiseq system.
The samples in the two data sets are mutually exclusive. The small subset included in these example data sets were randomly selected
Note: the complete TCGA BRCA HiSeq and GA data sets can be downloaded from the XENA portal
match.gex
# return a pair of matrices with matched columns (protein-coding genes that will be used as training features)
temp <- match.gex(GA.pcg, HS.pcg)
GA.pcg <- temp[[1]]
HS.pcg <- temp[[2]]
imirage.cv
to determine the expected accuracy of imputing a miRNA of interest using the training datasets#Use **imirage.cv** with the default parameters of using K-nearest neighbors as the prediction algorithm and using 50 protein-coding genes as training features
CV.miRNA <- imirage.cv(train_pcg=GA.pcg, train_mir=GA.mir, gene_index="hsa-let-7c", method="KNN", target="none")
#>
#> Running 10-folds cross-validation...
#> Iteration 1
#> Iteration 2
#> Iteration 3
#> Iteration 4
#> Iteration 5
#> Iteration 6
#> Iteration 7
#> Iteration 8
#> Iteration 9
#> Iteration 10
#> Cross-validation complete
#Print the accuracy metrics from each fold of the cross-validation analysis
print(CV.miRNA)
#> PCC P-Value RMSE
#> [1,] 0.6421569 6.652233e-03 1607.9770
#> [2,] 0.7203907 3.688712e-05 1369.3719
#> [3,] 0.6840176 2.602183e-05 1467.2613
#> [4,] 0.6628352 1.744676e-04 1824.5160
#> [5,] 0.7235963 4.309439e-06 1898.4681
#> [6,] 0.7512333 5.235529e-08 1811.2824
#> [7,] 0.6729700 7.005981e-05 2697.4273
#> [8,] 0.7908907 9.076999e-08 2199.1467
#> [9,] 0.6849761 2.467588e-07 827.1981
#> [10,] 0.7393048 2.451796e-06 1376.7202
#note: this example performs cross-validation analysis for 1 unique miRNA, hsa-let-7c. The name must match with one of the names in the train_mir object's column names
imirage.cv.loop
to determine the expected imputation accuracy of entire miRNA dataset with#Perform cross-validation analysis over the entire training dataset
CV.full <- imirage.cv.loop(train_pcg = GA.pcg, train_mir = GA.mir, method = "KNN", target="none")
#Plot some performance metrics from cross-validation analysis
plot(CV.full[,1], -log10(CV.full[,2]), xlab="Spearman R", ylab="P-value (-log10)", pch=16, main="Cross-validation accuracy")
abline(h=-log10(0.05), lty=3)
#Find out which miRNAs are imputed with good accuracy
colnames(GA.mir)[which(CV.full[,1] > 0.5)] #arbritarily, Spearman correlation > 0.5
#> [1] "hsa-let-7c" "hsa-mir-100" "hsa-mir-10b" "hsa-mir-1301"
#> [5] "hsa-mir-1307" "hsa-mir-130b" "hsa-mir-141" "hsa-mir-150"
#> [9] "hsa-mir-17" "hsa-mir-18a" "hsa-mir-190b" "hsa-mir-20a"
#> [13] "hsa-mir-210" "hsa-mir-301a" "hsa-mir-3677" "hsa-mir-4772"
#> [17] "hsa-mir-99a"
colnames(GA.mir)[which(CV.full[,2] < 0.05)] #P-value < 0.05
#> [1] "hsa-let-7c" "hsa-mir-100" "hsa-mir-10b" "hsa-mir-1301"
#> [5] "hsa-mir-1307" "hsa-mir-130b" "hsa-mir-141" "hsa-mir-150"
#> [9] "hsa-mir-155" "hsa-mir-17" "hsa-mir-18a" "hsa-mir-190b"
#> [13] "hsa-mir-20a" "hsa-mir-210" "hsa-mir-301a" "hsa-mir-3677"
#> [17] "hsa-mir-4772" "hsa-mir-99a"
imirage
in the test dataset#Use **imirage** with default parameters
Pred.miRNA <- imirage(train_pcg=GA.pcg, train_mir=GA.mir, my_pcg=HS.pcg , gene_index="hsa-let-7c", target="none")
#Display the predicted miRNA expression values
print(Pred.miRNA)
#> [1] 2019.3563 1498.5680 1771.0472 2525.3074 3406.9625 1813.6320 3009.6051
#> [8] 2198.6933 3072.8239 1307.7639 2962.8586 1277.5310 2258.6073 2110.7417
#> [15] 5194.3184 2963.7463 1765.5263 3669.1882 1952.3878 3368.4370 1316.7190
#> [22] 2017.3545 1671.8867 5657.6180 1037.8135 3214.5502 5665.0500 1815.9127
#> [29] 2612.9871 2567.6086 2341.5214 2787.6283 2312.1913 1230.4309 2020.4602
#> [36] 969.7257 1145.1208 958.9258 1043.2435 1181.7525 1092.2694 2585.8381
#> [43] 4762.9124 1914.3931 1659.7709 2286.6204 1590.2248 987.3592 1146.6056
#> [50] 1086.8198
#Compare the predicted miRNA expression values with measured expression
plot(Pred.miRNA, HS.mir[,"hsa-let-7c"], xlab="Predicted", ylab="Measured", main="hsa-let-7c imputation performance", pch=16)
abline(lm(HS.mir[,"hsa-let-7c"] ~ Pred.miRNA), lty=3)
imirage
to impute expression of all miRNAs available in the training dataset#Create an empty matrix to store imputed expression
Pred.full <- matrix(data=NA, ncol=ncol(GA.mir), nrow=nrow(HS.pcg))
#Execute a loop to impute each miRNA using the test protein coding dataset
for (i in 1:ncol(GA.mir)) {
Pred.full[,i] <- imirage(train_pcg = GA.pcg, train_mir = GA.mir, my_pcg = HS.pcg, gene_index = i, method="KNN", target="none")
}
Find out how well can we impute miRNA expression in the independent data set
#Obtain correlation coefficients between imputed and measured miRNA expression
Pred.Cors <- array(dim=ncol(GA.mir))
for (i in 1:ncol(GA.mir)) {
Pred.Cors[i] <- cor(HS.mir[,i], Pred.full[,i], method="spearman")
}
#Plot imputation correlations in comparison to cross-validation results
plot(Pred.Cors, CV.full[,1], xlab="Imputation accuracy", ylab="Cross-validation accuracy", main="Imputation performance", pch=16)
The principle behind iMIRAGE can be explained in a simplified form by stating the problem in the form of a linear model. Let us assume the user wants to obtain miRNA expression using their protein-coding data set which we will call test. To impute the miRNA expression using the test protein-coding data set, we first determine the mathematical relation between the expression of a set of miRNAs Y with the set of protein-coding gene expression X of the training data set, where p indicates the number of protein-coding genes used in the model. This number can range anywhere from 1 to P, where, P = total number of protein-coding genes available in both the training and test data sets.
\(Y^{Training} = \sum_{i=1}^{p} \beta X_{i}^{Training} + \epsilon\)
The objective of iMIRAGE is to determine \(\beta\) so that it can be harnessed to predict the expression of miRNA Y by applying the model to the test protein-coding data set:
\(Y^{Predicted} = \sum_{i=1}^{p} \beta X_{i}^{Test}\)
(Note that the machine-learning algorithms that are used iMIRAGE are not necessarily based on the assumption of linearity. This is only for simplified illustration purposes)
iMIRAGE assumes that not all protein-coding genes are meaningful for constructing imputation models. Therefore, it suggests using a subset of informative protein-coding genes for each miRNA. These informative features are automatically determined by calculating the correlation between the expression of all features with miRNA expression in the training data sets. Then, only a user-specified subset of the top correlated features are retained for constructing the models (by default 50).
Protein-coding gene expression data from the independent samples of interest. In the package documentation, this data set is referred by its alias my_pcg
Ideally, the training dataset should be of the same tissue-type as the independent test dataset. However, large datasets spanning multiple tissues can also be used. For example, the pan-cancer TCGA cohort covering more than 30 tissue-types can be used as training data to predict miRNA profiles of various individual cancers.
#Short example on converting RefSeq mRNA IDs to ENSEMBL IDs using biomaRt
library(biomaRt)
ensembl = useMart("ensembl",dataset="hsapiens_gene_ensembl")
old.ids <- colnames(my_pcg) #RefSeq IDs
gene.annot <- getBM(attributes=c('refseq_mrna','ensembl_gene_id'),
filters = 'refseq_mrna',
values = as.character(old.ids),
mart = ensembl)
#returns a dataframe with ENSEMBL IDs corresponding to supplied RefSeq mRNA IDs
See the biomaRt documentation for complete details and instructions
We will use the unprocessed TCGA BRCA data sets to illustrate a typical workflow. The data set used in the subsequent examples can be downloaded from the Open Science Framework repository by following the following URL: https://osf.io/s5rbn/download
After downloading the TCGA_BRCA_Datasets.RData file in the current working directory, load the contents using
load("TCGA_BRCA_Datasets.RData")
The following four matrices should appear after the object is loaded: ga.gex, ga.mirna, hiseq.gex, hiseq.mirna
filter.exp
to remove gene or miRNAs that are not expressed in most samples using (optional)We first remove gene or miRNAs that are not expressed in most samples, as these genes are likely not measured due to technical limitations and may not be reliable expression estimates. Ultimately, it is up to the user to decide whether they would like to include the sparse genes or miRNA in their analyses.
#Here, we filter the miRNA datasets to retain all miRNAs that are expressed above a level of 0 in atleast 75% of the samples
ga.mirna <- filter.exp(ga.mirna, cutoff=75, threshold = 0)
hiseq.mirna <- filter.exp(hiseq.mirna, cutoff=75, threshold = 0)
match.gex
to match training and test protein-coding expression matrices (required)Here, we match the two protein-coding expression matrices for subsequent processing
#We also will keep the unprocessed hiseq.gex.1 and ga.gex.1 datasets for subsquent comparisons
temp <- match.gex(hiseq.gex, ga.gex)
hiseq.gex.1 <- temp[[1]]
ga.gex.1 <- temp[[2]]
#For subsquent prediction analyses, we will also select miRNAs are common to both datasets
temp <- match.gex(ga.mirna, hiseq.mirna)
ga.mirna.1 <- temp[[1]]
hiseq.mirna.1 <- temp[[2]]
pre.process
training and test datasets (optional, recommended)In this step, we process the training and test data sets using pre.process
to make sure they are transformed, normalized and standardized before proceeding with further analysis. These steps tend to have a significant impact on subsequent analyses.
Generally, the user should determine whether their data has been transformed (\(\log2\) or \(\log2(x+1)\)) or normalized from the original source. In most cases, microarray data sets in public domain, such as NCBI GEO or ArrayExpress, are already transformed and normalized. However, several RNA-seq data sets may be available prior to transformation and normalization. In these instances, it is advisable to perform log transformation and upper-quantile normalization prior to use in the workflow.
In addition, the variance filter removes genes with zero variance that will offer no predictive power. Finally, the data is scaled to a mean = 0 and standard deviation = 1. These are bare-minimum standardization techniques which can be skipped if the user has already pre-processed their data using other approaches. Note that it is not neecssary to scale the miRNA expression profiles.
ga.gex.2 <- pre.process(ga.gex.1, log = TRUE, var.filter = TRUE, UQ = TRUE, std = TRUE)
hiseq.gex.2 <- pre.process(hiseq.gex.1, log = TRUE, var.filter = TRUE, UQ = TRUE, std = TRUE)
#This is how the data looks before and after pre.processing (showing the first 10 samples from each dataset)
par(mfrow=c(2,2), cex=0.75)
boxplot(t(ga.gex.1[1:10,]), main="GA - raw expression")
boxplot(t(ga.gex.2[1:10,]), main="GA - processed expression")
boxplot(t(hiseq.gex.1[1:10,]), main="Hiseq - raw expression")
boxplot(t(hiseq.gex.2[1:10,]), main="Hiseq - processed expression")
Here, we will first find out which miRNAs can be imputed with good accuracy using the GA data set as our training data set. The imirage.cv
function performs a 10-fold cross-validation analysis for a single miRNA specified by the gene_index argument, as shown in the quick start guide above. In addition, the imirage.cv.loop
wrapper can be used to perform the cross-validation analysis on the entire training miRNA data set.
The cross-validation analysis can be performed using one of the three methods: K-nearest neighbor regression (KNN), Random Forests (RF) or Support Vector Machines (SVM). These can be specified using the method argument.
For further details on the arguments that can be passed on the machine-learning methods, please see the documentation for randomForest, e0171 and FNN packages.
By default, the number of training features that are used by each method are set at 50. This can adjusted by the user using the num argument to achieve a balance between desired imputation accuracy and computational costs.
Additionally, the “K”" or number of cross-validation iterations can be set using folds, which set at 10 by default.
Here, we perform a 10-fold cross-validation analysis using the entire GA training data sets using KNN method. We perform the analysis with both the processed and unprocessed GA protein-coding data for comparison
#Unprocessed training data
CV.ga.gex1 <- imirage.cv.loop(train_pcg = ga.gex.1, train_mir = ga.mirna.1, method = "KNN", target="none")
#Processed training data
CV.ga.gex2 <- imirage.cv.loop(train_pcg = ga.gex.2, train_mir = ga.mirna.1, method = "KNN", target="none")
#Unprocessed training data
CV.hs.gex1 <- imirage.cv.loop(train_pcg = hiseq.gex.1, train_mir = hiseq.mirna.1, method = "KNN", target="none")
#Processed training data
CV.hs.gex2 <- imirage.cv.loop(train_pcg = hiseq.gex.2, train_mir = hiseq.mirna.1, method = "KNN", target="none")
#Comparison of imputation accuracies between raw and processed data
boxplot(CV.ga.gex1[,1], CV.ga.gex2[,1], names=c("Raw", "Processed"), main="GA CV accuracy")
Subsequently, the user can either select the miRNAs with good performance metrics in cross-validation analysis or perform the imputation using the full training data set with imirage
. Generally, poor cross-validation metrics are a good indicator that the miRNA can be safely excluded from the prediction analysis in the independent test data set.
sessionInfo()
#> R version 3.6.1 (2019-07-05)
#> Platform: x86_64-w64-mingw32/x64 (64-bit)
#> Running under: Windows 10 x64 (build 18362)
#>
#> Matrix products: default
#>
#> locale:
#> [1] LC_COLLATE=English_United States.1252
#> [2] LC_CTYPE=English_United States.1252
#> [3] LC_MONETARY=English_United States.1252
#> [4] LC_NUMERIC=C
#> [5] LC_TIME=English_United States.1252
#>
#> attached base packages:
#> [1] stats graphics grDevices utils datasets methods base
#>
#> other attached packages:
#> [1] iMIRAGE_1.1 e1071_1.7-2 FNN_1.1.3
#> [4] randomForest_4.6-14
#>
#> loaded via a namespace (and not attached):
#> [1] Rcpp_1.0.1 rstudioapi_0.10 knitr_1.23 xml2_1.2.0
#> [5] magrittr_1.5 roxygen2_6.1.1 MASS_7.3-51.4 R6_2.4.0
#> [9] rlang_0.4.0 stringr_1.4.0 tools_3.6.1 xfun_0.8
#> [13] class_7.3-15 htmltools_0.3.6 commonmark_1.7 yaml_2.2.0
#> [17] digest_0.6.20 assertthat_0.2.1 rprojroot_1.3-2 pkgdown_1.3.0
#> [21] crayon_1.3.4 fs_1.3.1 memoise_1.1.0 evaluate_0.14
#> [25] rmarkdown_1.14 stringi_1.4.3 compiler_3.6.1 desc_1.2.0
#> [29] backports_1.1.4


We are glad to have you join us today
Profile picture5>
Registration form
Don't have coupon code
I have read and agree with
terms & condition
and
privacy policy
Already have an Account?
Login here


Japan beat Switzerland to finish as kings of Group A
by FIFA.comJapan beat Switzerland 5-3 to finish as Group A winners at the FIFA Beach Soccer World Cup Paraguay 2019.
Takuya Akaguma scored a brace early on to help Japan jump out into the lead and to bring his tournament tally to four goals before Noel Ott scored his fifth of the tournament for Switzerland.
It was all Japan from there as Takaaki Oba, captain Ozu Moreira and Masayuki Komaki all scored to put the result beyond doubt despite the efforts of Dejan Stankovic, who converted two late set pieces. Japan end the group with three wins and finish top while Switzerland will go through as runners-up.


Text Mining Mini Project
emamula/text_mining.py
Great Job! I have a few comments about some parts of your code below, but none were critical enough to really affect your grade. Since you're doing so well, try scoping the projects out a little bit more for additional challenege! :D
""" @Emily Mamula
Mini-Project 3: Text Mining and Analysis
SoftDes Spring 2015 """
import nltk.data
from pattern.en import *
import matplotlib.pyplot as plt
import numpy
def process_text(filename, character):
""" This function takes a text file and string as an input. The
string is intended to be a character name, and the function
will collect the sentiment of all sentences containing that
character's name. It then plots the sentiment of sentences
mentioning the character related to their location in the book.
 This seems to track, as many of
the references to him were negative.
"""
character_ref = []
values = []
loc = []
#Loads tokenizer, which spilts sentences in text apart, beautifully
#ignoring abbreviations and other confounding elements (aka MAGIC).
tokenizer = nltk.data.load('tokenizers/punkt/english.pickle')
with open(filename, 'r') as fp:
data = fp.read()
#Runs text through tokenizers, separating sentences.
sentences = tokenizer.tokenize(data)
#Remove straggling new lines
for x in range(0,len(sentences)):
sentences[x] = sentences[x].replace('\n', ' ')
if character in sentences[x]:
character_ref.append(sentences[x])
#Add location to loc as a percentage within text.
loc.append(x/float(len(sentences)) * 100)
#Add positive vs. negative sentiment to values.
values.append(sentiment(sentences[x])[0])
fig = plt.figure()
plt.plot(loc, values)
plt.xlabel('Location in Book (%)')
plt.ylabel('Sentiment')
plt.show()
Stuff like plotting isn't really part of a functino called "process text". Something like this can be in a new function for plotting or visuals or just in the main block underneath.
if __name__ == "__main__":
process_text("pride_and_prejudice.txt", 'Darcy')


|
Elektra
0.9.3
|
Elektra error codes. More...
#include "elektra/conversion.h"
#include "elektra/error.h"
#include "kdberrors.h"
#include "kdbhelper.h"
#include "kdbprivate.h"
#include <string.h>
Functions | |
| ElektraError * | elektraErrorCreate (const char *code, const char *description, const char *module, const char *file, kdb_long_t line) |
| Creates a new ElektraError using the provided values. More... | |
| void | elektraErrorAddWarning (ElektraError *error, ElektraError *warning) |
| Adds a warning to an existing ElektraError struct. More... | |
| ElektraError * | elektraErrorFromKey (Key *key) |
| Extracts the error and all warnings from the given key. More... | |
| ElektraError * | elektraErrorKeyNotFound (const char *keyname) |
| Creates a "Key not found" error. More... | |
| ElektraError * | elektraErrorWrongType (const char *keyname, KDBType expectedType, KDBType actualType) |
| Creates a "Wrong type" error. More... | |
| ElektraError * | elektraErrorNullError (const char *function) |
| Creates a "Null error argument" error. More... | |
| ElektraError * | elektraErrorConversionToString (KDBType sourceType, const char *keyname) |
| Creates a "Conversion to string failed" error. More... | |
| ElektraError * | elektraErrorConversionFromString (KDBType targetType, const char *keyname, const char *sourceValue) |
| Creates a "Conversion from string failed" error. More... | |
| ElektraError * | elektraErrorEnsureFailed (const char *reason) |
| Creates a "kdbEnsure failed" error. More... | |
| ElektraError * | elektraErrorMinimalValidationFailed (const char *application) |
| Creates a "minimal validation failed" error. More... | |
| ElektraError * | elektraErrorPureWarning (void) |
| Creates a dummy ElektraError struct to store warnings in. More... | |
| const char * | elektraErrorCode (const ElektraError *error) |
| const char * | elektraErrorDescription (const ElektraError *error) |
| void | elektraErrorReset (ElektraError **error) |
| Frees the memory used by the error and sets the referenced error variable to NULL. | |
Elektra error codes.
| void elektraErrorAddWarning | ( | ElektraError * | error, |
| ElektraError * | warning | ||
| ) |
Adds a warning to an existing ElektraError struct.
If you want to report a warning without an error, create a dummy error with elektraErrorPureWarning() and then add a warning to it.
| error | The error to which warning shall be added. |
| warning | The warning to add. Once added it is owned by error . DO NOT call elektraErrorReset() on it afterwards. |
| ElektraError* elektraErrorConversionFromString | ( | KDBType | targetType, |
| const char * | keyname, | ||
| const char * | sourceValue | ||
| ) |
Creates a "Conversion from string failed" error.
| targetType | The type into which sourceValue couldn't be converted. |
| keyname | The name of the key that couldn't be converted. |
| sourceValue | The value that couldn't be converted. |
| ElektraError* elektraErrorConversionToString | ( | KDBType | sourceType, |
| const char * | keyname | ||
| ) |
Creates a "Conversion to string failed" error.
| sourceType | The type which failed to be converted to string. |
| keyname | The name of the key that couldn't be converted. |
| ElektraError* elektraErrorCreate | ( | const char * | code, |
| const char * | description, | ||
| const char * | module, | ||
| const char * | file, | ||
| kdb_long_t | line | ||
| ) |
Creates a new ElektraError using the provided values.
The returned value will be allocated with elektraCalloc().
| code | The error code of the error. Must be compile-time constant. |
| description | The description of the error. Will be copied and stored in the struct. |
| module | The module that raised the error. Must be compile-time constant. |
| file | The file that raised the error. Must be compile-time constant. |
| line | The line in which the error was raised. |
| ElektraError* elektraErrorEnsureFailed | ( | const char * | reason | ) |
Creates a "kdbEnsure failed" error.
This intended for the case when kdbEnsure() returns 1.
| reason | The error/reason metadata returned by kdbEnsure(). |
| ElektraError* elektraErrorFromKey | ( | Key * | key | ) |
Extracts the error and all warnings from the given key.
If no error exists, a pure warning error will be used.
| key | The to extract error and warnings from. |
| ElektraError* elektraErrorKeyNotFound | ( | const char * | keyname | ) |
Creates a "Key not found" error.
| keyname | The name of the key that wasn't found. |
| ElektraError* elektraErrorMinimalValidationFailed | ( | const char * | application | ) |
Creates a "minimal validation failed" error.
| application | parent key as passed to elektraOpen() |
| ElektraError* elektraErrorNullError | ( | const char * | function | ) |
Creates a "Null error argument" error.
| function | The name of the function that was called with a null pointer error argument. |
| ElektraError* elektraErrorWrongType | ( | const char * | keyname, |
| KDBType | expectedType, | ||
| KDBType | actualType | ||
| ) |
Creates a "Wrong type" error.
| keyname | The name of the key that had the wrong type. |
| expectedType | The type that was expected. |
| actualType | The type that was actually found. |


By Tom Coquereau / @thaume
{{outlet}}
Placeholder where the appropriate template is injected by the Router based on the current URL.
Application template
{{outlet}}
Definition of routes and resources
Route transition (eg: /posts/edit
-> /posts/show/1
)
Model transition (eg: /posts/show/1
-> /posts/show/2
)
Future-proof module system
EmberJS is a good match for large applications
Ready for client/server code sharing


Weekly Meeting: 2015-01-28
28th Jan 2014: OPAM 1.2, FOSDEM, new URL and 3.0 meta-planning
Agenda
- Move to only OPAM 1.2
- FOSDEM demo
- TLS merge progress
- Turning on mirage.io?
- Planning for 3.0
Attendees: Amir Chaudhry (chair), David Kaloper, Thomas Leonard, Jon Ludlam, Hannes Mehnert, Richard Mortier, Dave Scott and Mindy Preston
Notes
OPAM 1.2 support only
ThomasG submitted a patch for the mirage
tool to enable the switch to
OPAM 1.2 only. The patch should report an error and ask users to upgrade
OPAM 1.2. This matters as the upstream distros are still on OPAM 1.1 (e.g
Ubuntu). we still need to decide what we want and it would be good to make
the patch user controlled (e.g user can override it if they want).
FOSDEM demo
Amir is heading to FOSDEM this coming weekend and has planned a demo around serving a game from the cubieboard (via setting up a wifi access point). Having issues with the wifi bridge but not sure what the problem really is. Will need to get this working if there’s to be a demo.
TLS Merge progress
This is waiting on DavidK, who has to review and merge TLS patches. Recently been playing with a TLS unikernel on Xen and working towards a paper. Will also be inviting people to break it soon.
Still have the entropy story to communicate and are starting with xentropyd. Should be done in a few days with patch reviews.
ThomasL has a few other changes to the FLOW interface that need to be dealt
with (Error messages in a few places). There’s an issue on mirage-dev before
there can be releases (mirage/mirage-dev#52). Most components can be
released with the updates, but some need to be done together (e.g. TLS both
provides and uses the new interface). It would be possible to make all the
updates decoupled if preferred (e.g. first updating TLS to provide the new
interface, then releasing the new interface, then updating tls a second time
to use the new API).
There might also be more changes to libs/interfaces
that might be breaking so better to do this now. For example, there is the
DEVICE.connect
change (mirage/mirage#350). Hannes mentioned that it not
yet 1.0 so shouldn’t be too worried about breaking interfaces. no-crypto could
also use a release and TLS release will have to wait for things like error
reporting.
Turning on mirage.io?
Anil didn’t make it to the call. Will need to wait until he’s present before this can be discussed.
Planning for 3.0
Amir proposed putting together a wiki page to collect all the issues and thoughts for the next major release. The intent is to put together a stable and visible plan so that we can better track progress, and make clearer decisions. At the moment, we have relevant issues scattered everywhere but no clear location by which we can chart progress. Too much is inside people’s heads. Amir’s happy to curate this page by bringing it up once a month on the calls.
–
AoB
-
ThomasL joining the Mirage core team and will be responsible for review and patches merging across libraries (he’s been doing this already).
-
The next call is scheduled for Wednesday, 11th February - Please add any agenda items you wish to discuss in advance and refer to the mailing list for actual details a day or so in advance.


{% extends "base.html" %} {% load crispy_forms_tags %} {% block title %}COLLEGE ASSIST : About{% endblock %} {% block head %} {% endblock %} {% block content %}
College Assist is project made to solve the problem of getting the right content and information about the course you need.
The crowdsourcing of information on the same platform will solve the problem of searching through various facebook groups to find the real info that matters to you.
It will save you from the unwanted stuff shared on the groups and also it will serve as the one location for getting course related queries. So to save you from the trouble college assist is here. Do provide your feedback to us here


Manifest Object
Overview
A Manifest Object and its sub-parts are data structures returned by multiple APIs of the player.
Its data represents the corresponding streaming protocol’s Manifest equivalent (MPD for DASH, Manifest for Microsoft Smooth Streaming etc.).
Basically, the structure of a Manifest file has the following hierarchy:
Manifest Object
...Manifest data and methods
Period Object
...Period properties
Adaptation Object
...Adaptation data and methods
Representation Object
...Representation data and methods
RepresentationIndex Object
...RepresentationIndex data and methods
SegmentObject
...SegmentObject data
Due to this highly hierachical structure, each level will be described in its own chapter here.
⚠ Like in the rest of this documentation, any variable or method not defined here can change without notice.
Only use the documented variables and open an issue if you think it’s not enough.
Structure of a Manifest Object
The manifest Object represents the Manifest file of the content loaded.
properties
The manifest Object has the following properties.
periods
type: Array.<Period>
A single Manifest instance can contain multiple Periods, which are periods of time for which the list of available type of contents (audio tracks, subtitles, video tracks…) can be different.
Such example of Periods could be multiple Programs of a live contents, which can be each in different languages, for example.
The player will switch smoothly across subsequent Periods within playback.
Most Streaming technologies (e.g. HLS and Smooth) do not have a “Period” concept. For those, the Manifest will only have one Period for the whole content.
adaptations
⚠ This property is deprecated, it will disappear in the next major
release v4.0.0
(see Deprecated APIs).
type: Object
Adaptation objects for the first Period.
Both of those lines have the same effect:
console.log(manifest.adaptations);
console.log(manifest.periods[0].adaptations);
See the Period chapter for more information on Adaptations.
isLive
type: Boolean
true
if the content is a “live” content (e.g. a live TV Channel).
false
otherwise.
uris
type: Array.<string>
The list of uris that can be used to refer to the Manifest file.
transport
type: string
The type of transport used. For now, this can only be equal to either dash
or smooth
.
Structure of a Period Object
A Period is an object describing what to play during a certain time periods.
A Manifest can have a single Period, which means that the played content do not change its characteristics (same languages, same bitrates etc.) or multiple ones.
A good example of a content with multiple Periods would be a live channel broadcasting multiple foreign films. Each film, being in a different language, will need to be part of a new Period.
properties
id
type: string
This id should be a string unique to that Period. It serves identifications purpose, when updating the Manifest for example.
start
type: Number
Start time at which the Period begins in the whole content, in seconds.
end
type: Number|undefined
End time at which the Period ends in the whole content, in seconds.
If not set or set to undefined, it means that the end is unknown, in which case it is the current last content of the current Manifest.
adaptations
type: Object
The Adaptations (tracks if you want) for the current content, per-type (audio/video/text/image).
See the Adaptation chapter for more info about an Adaptation’s structure.
The Adaptation object can contain any of the following keys:
- audio (
Array.<Adaptation>
): The audio Adaptation(s) available. - video (
Array.<Adaptation>
): The video Adaptation(s) available. - text (
Array.<Adaptation>
): The text Adaptation(s) available. - image (
Array.<Adaptation>
): The image Adaptation(s) available.
Structure of an Adaptation Object
An Adaptation is a set of streams representing the exact same contents in multiple forms (different sizes, different bitrates…). Concretely, a frequent usecase is to have a single video Adaptation and multiple audio ones, one for each language available.
As such, it is also often called in the API a track
.
properties
id
type: string
This id should be a string unique to that Adaptation. It serves identifications purpose, when updating the Manifest for example.
type
type: string
The type of the Adaptation. The possible types are:
"video"
"audio"
"text"
"image"
language
type: string|undefined
The language of the Adaptation. This is particularly useful for audio and text Adaptations.
Note that this property is not always present in an Adaptation.
normalizedLanguage
type: string|undefined
An attempt to translate the language of the Adaptation into an ISO 639-3 code.
If the translation attempt fails (no corresponding ISO 639-3 language code is
found), it will equal the value of language
Note that this property is not always present in an Adaptation.
isAudioDescription
type: Boolean|undefined
This property only makes sense for audio Adaptations. In this case, if true
it means that the audio track has added commentaries for the visually impaired.
isClosedCaption
type: Boolean|undefined
This property only makes sense for text Adaptations. In this case, if true
it means that the text track has added hints for the hard of hearing.
representations
type: Array.<Representation>
The Represesentations for this Adaptation.
See the Representation chapter for more info about a Representation’s structure.
methods
getAvailableBitrates
return value: Array.<Number>
Returns every bitrates available for this Adaptation.
Structure of a Representation Object
A Representation is an Adaptation encoded in a certain way. It is defined by multiple values (a codec, a bitrate). Only some of them are documented here (as stated before, open an issue if you would like to access other properties).
properties
id
type: string
This id should be a string unique to that Representation.
bitrate
type: Number
The bitrate of the Representation.
codec
type: string|undefined
The codec of the Representation.
decipherable
type: boolean|undefined
Whether we are able to decrypt this Representation / unable to decrypt it or if we don’t know yet:
- if
true
, it means that we know we were able to decrypt this Representation in the current content. - if
false
, it means that we know we were unable to decrypt this Representation - if
undefined
there is no certainty on this matter
height
type: Number|undefined
This property makes the most sense for video Representations. It defines the height of the video, in pixels.
width
type: Number|undefined
This property makes the most sense for video Representations. It defines the width of the video, in pixels.
index
type: RepresentationIndex
The represesentation index for this Representation.
See the RepresentationIndex chapter for more info about a RepresentationIndex’s structure.
frameRate
type: string|undefined
The represesentation frame rate for this Representation. It defines either the number of frames per second as an integer (24), or as a ratio (24000 / 1000).
Structure of a RepresentationIndex Object
A RepresentationIndex is an uniform way of declaring the segment index in any Manifest.
That’s the part that calculates which segments will be needed. Because the index can be different depending on the type of contents/transport most interactions here are done through few methods which hide the complexity underneath.
methods
getSegments
arguments:
-
up (
Number
): The position, in seconds from which you want to get the segment. -
duration (
Number
): The duration in seconds from the asked position
return value: Array.<Segment>
Returns the needed segments as defined by the current Manifest during an asked timeframe.
See the Segment chapter for more info about a Segment’s structure.
Structure of a Segment Object
A Segment object defines a segment, as generated by the RepresentationIndex.
Those segments can have multiple useful properties which for the most part are described here.
properties
id
type: string
This id should be a string unique to that segment.
timescale
type: Number
The timescale in which the duration and time are expressed.
Basically, divide any of those by the timescale to obtain seconds.
duration
type: Number|undefined
The duration, timescaled, of the Segments in s.
time
type: Number
The start time, timescaled, of the Segments in s.
isInit
type: Boolean|undefined
If true, the segment concerned is an init segment.
range
type: Array.<Number>|null|undefined
If defined, it means that the segment is defined in a certain byte range remotely. In this case, the array contains two elements, the start byte and the end byte.
indexRange
type: Array.<Number>|null|undefined
If defined, it means that a segment index is defined in a certain byte range remotely. In this case, the array contains two elements, the start byte and the end byte.
number
type: Number|undefined
The number of the segment (if numbered), useful with certain types of index.


80+ Young Anandians have been able to participate in BITS and 40+ out of them were able to successfully carry out their work throughout the competition
100+ bla bla bla 33 tasks completed until now from blog posts, designing logos to creating websites about developing FOSS.
The Staff of Mentors created an environment in which particpants were able to smoothly run along the competition with the help, assistance and enthusiasm of our mentors.
| # | First | Last | Handle |
|---|---|---|---|
| 1 | Mark | Otto | @mdo |
| 2 | Jacob | Thornton | @fat |
| 3 | Larry the Bird |
| # | First | Last | Handle |
|---|---|---|---|
| 1 | Mark | Otto | @mdo |
| 2 | Jacob | Thornton | @fat |
| 3 | Larry the Bird |
Grade 7 (2018)
Grade 11 (2018)
Grade 11 (2018)
Grade 9 (2018)
Grade 9 (2018)
Grade 7 (2018)
Grade 7 (2018)
Grade 9 (2018)
Grade 11 (2018)
Grade 11 (2018)
Grade 11 (2018)
Grade 10 (2018)
Grade 10 (2018)
Grade 9 (2018)
Grade 8 (2018)
Grade 11 (2018)
Grade 8 (2018)
Grade 10 (2018)
Grade 9 (2018)
Grade 8 (2018)
Grade 11 (2018)
Grade 6 (2018)
Grade 10 (2018)
Grade 10 (2018)
Grade 11 (2018)
Grade 10 (2018)
Grade 11 (2018)
Grade 8 (2018)
Grade 9 (2018)
Grade 10 (2018)
Grade 9 (2018)
Grade: 13 (2018)
President @acicts18
Grade: 11 (2018)
BITS - Project Coordinator
Grade: 11 (2018)
BITS - Sub Coordinator
Grade: 11 (2018)
BITS - Sub Coordinator
Grade: 11 (2018)
BITS - Organizing Committee
Grade: 11 (2018)
BITS - Organizing Committee
Grade: 13 (2018)
Board of Official @acicts18
Grade: 13 (2018)
Board of Official @acicts18
Grade: 13 (2018)
Board of Official @acicts18


| Methods' Summary |
| setValue |
sets the value which is displayed in the metric field.
|
| setUserValue |
sets the user value which is displayed in the metric field.
|
| getValue |
returns the value which is currently displayed in the metric field.
|
| getCorrectedValue |
returns the corrected value which is displayed in the metric field.
|
| setMin |
sets the minimum value that can be entered by the user.
|
| getMin |
returns the currently set minimum value that can be entered by the
user.
|
| setMax |
sets the maximum value that can be entered by the user.
|
| getMax |
returns the currently set maximum value that can be entered by the
user.
|
| setFirst |
sets the first value to be set on POS1 key.
|
| getFirst |
returns the currently set first value which is set on POS1 key.
|
| setLast |
sets the last value to be set on END key.
|
| getLast |
returns the currently set last value which is set on END key.
|
| setSpinSize |
sets the increment value for the spin button.
|
| getSpinSize |
returns the currently set increment value for the spin button.
|
| setDecimalDigits |
sets the number of decimals.
|
| getDecimalDigits |
returns the currently set number of decimals.
|
| setStrictFormat |
determines if the format is checked during user input.
|
| isStrictFormat |
returns whether the format is currently checked during user input.
|
| Methods' Details |
setValue
| void |
| setValue( |
[in] hyper |
Value, |
| [in] short |
FieldUnit ); |
- Description
- sets the value which is displayed in the metric field.
|
|
setUserValue
| void |
| setUserValue( |
[in] hyper |
Value, |
| [in] short |
FieldUnit ); |
- Description
- sets the user value which is displayed in the metric field.
|
|
getValue
| hyper |
| getValue( |
[in] short |
FieldUnit ); |
- Description
- returns the value which is currently displayed in the metric field.
|
|
getCorrectedValue
| hyper |
| getCorrectedValue( |
[in] short |
FieldUnit ); |
- Description
- returns the corrected value which is displayed in the metric field.
|
|
setMin
| void |
| setMin( |
[in] hyper |
Value, |
| [in] short |
FieldUnit ); |
- Description
- sets the minimum value that can be entered by the user.
|
|
getMin
| hyper |
| getMin( |
[in] short |
FieldUnit ); |
- Description
- returns the currently set minimum value that can be entered by the
user.
|
|
setMax
| void |
| setMax( |
[in] hyper |
Value, |
| [in] short |
FieldUnit ); |
- Description
- sets the maximum value that can be entered by the user.
|
|
getMax
| hyper |
| getMax( |
[in] short |
FieldUnit ); |
- Description
- returns the currently set maximum value that can be entered by the
user.
|
|
setFirst
| void |
| setFirst( |
[in] hyper |
Value, |
| [in] short |
FieldUnit ); |
- Description
- sets the first value to be set on POS1 key.
|
|
getFirst
| hyper |
| getFirst( |
[in] short |
FieldUnit ); |
- Description
- returns the currently set first value which is set on POS1 key.
|
|
setLast
| void |
| setLast( |
[in] hyper |
Value, |
| [in] short |
FieldUnit ); |
- Description
- sets the last value to be set on END key.
|
|
getLast
| hyper |
| getLast( |
[in] short |
FieldUnit ); |
- Description
- returns the currently set last value which is set on END key.
|
|
setSpinSize
| void |
| setSpinSize( |
[in] hyper |
Value ); |
- Description
- sets the increment value for the spin button.
|
|
getSpinSize
- Description
- returns the currently set increment value for the spin button.
|
|
setDecimalDigits
| void |
| setDecimalDigits( |
[in] short |
nDigits ); |
- Description
- sets the number of decimals.
|
|
getDecimalDigits
| short |
| getDecimalDigits(); |
- Description
- returns the currently set number of decimals.
|
|
setStrictFormat
| void |
| setStrictFormat( |
[in] boolean |
bStrict ); |
- Description
- determines if the format is checked during user input.
|
|
isStrictFormat
| boolean |
| isStrictFormat(); |
- Description
- returns whether the format is currently checked during user input.
|
|
Copyright © 2013, The Apache Software Foundation, Licensed under the Apache License, Version 2.0. Apache, the Apache feather logo, Apache OpenOffice and OpenOffice.org are trademarks of The Apache Software Foundation. Other names may be trademarks of their respective owners.


Lebanon
Lebanon is a country located in the Middle East. It's bordered by both Israel and Syria, with the Mediterranean Sea bordering the western coast. The official language of Lebanon is Arabic.
Largest Cities in Lebanon
| City | Population |
|---|---|
| Beirut | ~1,900,000 |
| Tripoli | ~850,000 |
| Sidon | ~200,000 |
| Jounieh | ~110,000 |
Popular Lebanese Dishes
- Baba ghanouj
- Fattoush
- Falafel
- Kibbeh
- Kafta
Learn more about Lebanon from the CIA World Factbook
From a casual visitor's point of view, one good aspect of this website is that it provides a quick overview of Lebanon organized into major topics. Also, the information is trustworthy since it's backed by the CIA and shows it was updated recently on January 12th, 2017.
From a web developer's point of view, the site covers two important benchmarks. It loads in just over 1 second and is easy to navigate. The site makes use of html elements (div, header, section, article) to organize the content. Finally, the site is also responsive to desktop & mobile screens.


◆ $account
◆ $accountingBookDetailList
| $accountingBookDetailList |
◆ $applied
◆ $applyList
◆ $arAcct
◆ $authCode
◆ $autoApply
◆ $balance
◆ $ccApproved
◆ $ccAvsStreetMatch
◆ $ccAvsZipMatch
◆ $ccExpireDate
◆ $ccIsPurchaseCardBin
◆ $ccName
◆ $ccNumber
◆ $ccProcessAsPurchaseCard
◆ $ccSecurityCode
◆ $ccSecurityCodeMatch
◆ $ccStreet
◆ $ccZipCode
◆ $chargeIt
◆ $checkNum
◆ $class
◆ $createdDate
◆ $creditCard
◆ $creditCardProcessor
◆ $creditList
◆ $currency
◆ $currencyName
◆ $customer
◆ $customFieldList
◆ $customForm
◆ $debitCardIssueNo
◆ $department
◆ $depositList
◆ $exchangeRate
◆ $externalId
◆ $ignoreAvs
◆ $internalId
◆ $isRecurringPayment
◆ $lastModifiedDate
◆ $location
◆ $memo
◆ $paramtypesmap
◆ $payment
◆ $paymentMethod
◆ $pending
◆ $pnRefNum
◆ $postingPeriod
◆ $status
◆ $subsidiary
◆ $threeDStatusCode
◆ $total
◆ $tranDate
◆ $tranId
◆ $unapplied
◆ $undepFunds
◆ $validFrom
The documentation for this class was generated from the following file:


Buy USDINR; target of 71.55 - 71.65: ICICI Direct
ICICI Direct expects USDINR to find supports at lower levels. Utilise downsides in the pair to initiate long positions.
ICICI Direct's currency report on USDINR
Spot Currency
The rupee closed slightly higher by two-paise yesterday supported by an appreciating Chinese Yuan and positive inflows in the last few sessions. However, it is likely to open sharply lower today amid strength in US$ and rising concerns over domestic fiscal slippage • The US$ index recouped 98.0 levels to end higher against major currencies. Strength in US equities coupled with rising yields is positive for US$. Chinese Yuan has appreciated towards 6.97 levels yesterday amid news that the US and China may work towards reducing tariffs on a proportionate basis. This is mildly positive for EM currencies, including rupee.
Benchmark yield
Domestic benchmark 10-year yields ended higher at 6.52% in the previous session. Domestic GST collections for October were at Rs 95380 crore, down 5.29% on a YoY basis • The US 10-year benchmark yields extended further gains to close at 1.86% in the previous session. Risk sentiments improved supported by overall strength in US equities while a sharper rally in yields could be a signal that the US economy is relatively preforming well.
Currency futures on NSE
The dollar-rupee November contract on the NSE was at 71.04 in the previous session. Open interest increased 7.67% in the previous session • We expect the US$INR to find supports at lower levels. Utilise downsides in the pair to initiate long positions.
Intra-day strategy
| US$INR November futures contract (NSE) | View: Bullish on US$INR |
| Buy US$ in the range of 71.28 -71.32 | Market Lot: US$1000 |
| Target: 71.55 / 71.65 | Stop Loss: 71.12 |
| Support | Resistance |
| S1/ S2: 71.35 / 71.15 | R1/R2:71.50 / 71.65 |
Disclaimer: The views and investment tips expressed by investment experts/broking houses/rating agencies on moneycontrol.com are their own, and not that of the website or its management. Moneycontrol.com advises users to check with certified experts before taking any investment decisions.
Special Thursday Expiry on 10th 7th NovEarly Closure to The Great Diwali Discount. Last Chance to get Moneycontrol PRO for a year @ Rs. 289/- only
Coupon code: DIWALI


Unfortunately, we received a bad response from Discord's servers and could not authenticate you. Please try again.
You will be redirected back to the homepage automatically in 10 seconds, otherwise click here.


World Wide Web
1) You, your PC Browser
2) The Internet- The worlds largest Computer Network
3) HTTP Requests - Protocal to communitcate with servers
4) Connected to servers - hosting files in a remote location
HTML - Hypertext Mark Up Language
1) Text Content - What you See!
2) Mark Up - what it looks like
3) Reference to other docs - e.g. images, pictures, or video's'
4) Misc - made up as tags (E.G. "name" Contents "Name" (Opening tag and closing tag, closing has an extra line, entire thing is considered an element, not adding a closing tag leaves the code open and it continues on...
 Web browsers read these documents, and then interpret and display them.
2) How Coding Works - Coding happens when programmers write text in a language that a computer can understand. The computer can then follow the instructions the programmer wrote. For example, the computer might do this by making text like this:
3) Computers are Not so "SMART" - Programmers need to write exactly the way a computer understands (also known as writing with correct "syntax"). For example, if you forget to close a bold tag, the computer won't be able to figure out what you had intended to make bold. This "stupidity" can be very frustrating, but it also gives programmers incredible power: if you know how to talk to a computer than you can tell it do do anything you want.
 And that's okay. If you forget how to make text italic in HTML, you can always just look it up.
Basic HTML Vocabulary
Tag: An HTML tag is always contained within angled brackets. Most tags have an opening tag (" p " ' for example) and a closing tag, ("p"). Some tags (called "void" tags) do not require a closing tag (like the "br" tag).
Element: An HTML element refers to everything within a set of opening and closing tags.
Attribute: This is a property of an HTML element. For example, to set the href attribute of an anchor tag to the Udacity URL, " a href="www.udacity.com"
Span and Div will be used often in this class! Span is Inline and Div is a block element
See video on how to save an HTML file!!
Saving HTML File
Google Chrome - Has great develpment tools and allows one to breakdown a webpage and view the HTML tree Structure. While there are other browsers that have similar tools, we have chosen to use Chrome for simplicity of instruction. The knowledge and skills you acquire by using these tools will however easily translate to other similar developer oriented tools.
HTML Editor - examples include Sublime Text, Bracket's, Notes Plus Plus. Learn to use the tools, they make your coding that much easier. I have also found many tutorial videos on you tube for Sublime text.
HTML - HyperText Markup Language - the standard markup language used to create web pages. (Tags, browser turns tag in elements, tags have types). HTML controls the strucutre of the web page. Understand the tree like structure. Wiki Tree Structures
HTML RESOURCE
CSS - Cascading Style Sheets - style sheet language used for describing the look and formatting of a document written in a markup language. (Allows to use syntax rules to change how elements can change on a page) HTML and CSS are both languages.
CSS RESOURCE
DOM - Document Object Model - a cross-platform and language-independent convention for representing and interacting with objects in HTML (and other markup languages). The nodes of every document are organized in a tree structure, called the DOM tree.
DOM TREE RESOURCE
Method 1: write CSS in the "head" of your HTML This method is good for very small projects (like what you'd do in scratchpad.io). To do this: 1. At the top of your HTML document, add a "head" element. 2. Inside the "head" element, add a "style" element. 3. Write your CSS in the "style" element and then put the HTML for the rest of your page below.
Method 2: Link your HTML to a separate CSS file This adds another step, but it lets you stay more organized when working on larger projects. To do this: 1. Write all of your structural HTML in one file (let's call it main.html). 2. In a separate file (let's call it main.css), put all of your CSS code. 3. Add a "head" element to the top of your HTML. 4. Add a "link" tag inside the "head" element. Since "link" is a "void tag" you don't need to add a closing "link".
Method 3: Write your style inline with your HTML This is generally a very bad idea because it leads to lots of repeated code. But you may see code that uses this method so it's good to be familiar with it. If you want to know more, check out the question and answers in this conversation on Stack Overflow (Stack Overflow is the most widely used programming Q/A community out there). With this method, you modify the style attributes of every individual HTML element.
Browsers use default stylesheets to determine how to display HTML elements. You can view the default style rules for h1 and other elements for the following browsers:
WebKit (Chrome and Safari) Web Kit Link
Firefox Fire Fox Link
Internet Explorer
Because these rules differ sometimes between browsers, there are efforts to promote consistency in styles across browsers. One popular solution to this issue is using what is referred to as a CSS reset such as normalize.css. http://necolas.github.io/normalize.css/