200 Cigarettes Reviewed by Mac VerStandig<EMAIL_ADDRESS>Http://www.moviereviews.org 0 Stars (out of 4)
Ironically, one of the themes of 200 Cigarettes is that you should try to make the best of every moment in life. Unfortunately I will no longer be able to say that I lived every moment of my life to the fullest, because I spent 95 otherwise perfectly good minutes, watching this sad excuse for a movie. Actually smoking 200 cigarettes in the same 95 minutes couldn't be any worse for you than it is to watch the movie. Not only is it a pathetically bad film overall, but 200 Cigarettes actually has no redeeming qualities whatsoever. The plot is scattered, thin and predictable; the acting is monumentally bad; and the style of film making resembles a home video.
It is December 31, 1981 and the big party is at Monica's (Martha Plimpton) house. But no one has arrived yet. Her 8 invited guests and several people that they have picked throughout the evening are wandering the streets of New York City in various groups. Some of them know each other through their common bond of having slept with Monica, and some are total strangers. But they all are to face their own personal neuroses before night's end.
Those who are invited are the ones that have the issues. It is up to those who aren't to help them come to terms. First there is Eric (Brian McCardie) who is a former boyfriend of Monica's and is just getting over the heartbreak of their relationship terminating prematurely because of his sexual performance, or lack thereof.
Bridget (Nicole Parker) and Caitlyn (Angela Featherstone) who are both extremely sensuous young women looking for someone to handle their desires on New Year's Eve and tag along to the party with them. They stumble across a nameless bartender (Ben Affleck) who is the one truly perfect character in a film of imperfections. He is nether sexually deprived, nor uncertain about his future, as he is in law school. His lack of flaws is both boring, unrealistic and painful to watch. As Bridget and Caitlyn make passes at him you are neither entertained nor humored by the sub-standard comedy.
Moving on, there is Val (Christina Ricci) and Stephie, (Gabby Hoffman) 2 teenage girls with fake identification and very different thoughts. Val is Monica's cousin and a true fan of the New York scene. On the other hand, Stephie is convinced that she is vulnerable to crime when the two venture out of their usual locations in search of the party that they just can't find. Paradoxically, it is 2 punks that they meet at a bar (actually they attempt to flee from their presence, but aren't successful) who guide them through their fears and force a level of relaxation upon their warped minds.
Of all the insanely dull and uninteresting couples, only one approaches a level of decency in both acting and plot. Wisely, the movie's creators have put heavy emphasis on Lucy (Courtney Love) and Kevin (Paul Rudd) who are best friends and share the common bond of being dateless. Paul has just broken up with long time steady Ellie (Janeane Garofalo) and is starting to come to terms with his loss when Lucy informs him that Ellie had been sleeping around during their relationship. However, the only complexity to these two characters is that they seem to want to be more than friends, and that is reiterated when they attempt sexual intercourse in a bathroom stall on more than one occasion during this strange evening.
Finally, there are the two worst performances and worst sub-plot of the film. Jack (Jay Mohr) and Cindy (Kate Hudson) have been going out for a short period of time and Jack just learned that he took Cindy's virginity the night before. While she attempts to play this down and be her usual self, he is a predictably self loathing male as he attempts to deal with a string of one night stands that includes the recently deflowered Cindy.
Very often, when a film is as putrid as this production, there will at least be a decent quality of film making to reveal an occasional moment of glory. However, this film has neither the quality of cinematography nor the moments of glory to be highlighted. Instead, what you get is a collection of rough and inconsistent cuts, bad continuity and inaccuracies. First, and most noticeable is that as the film goes from one subplot to another, there is no apparent order that it follows, and it is also weekened by unnecessarily edgy edits from scene to scene and shot to shot. At other times, objects seem to get up and move and hairstyles and costumes change from shot to shot. There are also at least 4 scenes in a taxi cab that go from start to finish. Not in a single one of them does anybody pay the driver.
And yet, no matter how miserable this film may be, and no matter how poor the acting is all around, there was a ray of a hope for these many bad plots. Perhaps, if the makers had just decided to concentrate on one or two or, perhaps, even three, there might have been the time and opportunity for some character development, or quality acting, or even a decent plot payoff at the end. But it didn't happen that way. The cast of quality name actors was forced into roles that not even one of them could convert into a mediocre performance, and every story line crashed and burned quicker than it takes for the ball to drop at midnight.
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


One of my personal goals for this year was to start being part of the solution to the dearth of female speakers at tech events. Though I’ve talked at a couple of smallish local events over the past few months, this past weekend I got to do it in a big way: I presented a talk on using objects to organize your jQuery code to an audience of around 100 people, more by far than I’ve ever spoken to before.
[This post isn’t so much about the talk itself as my first experience with talking at a conference. If you’re interested in the talk, I encourage you to check out the slides, links, and code at the link above.]
I decided I wanted to try to talk at the jQuery conference after I saw the initial very smart, very male speaker lineup. I submitted my talk based on an article I wrote earlier this year, and by the time it was all said and done, mine was the second most popular topic and I was slated to have 30 minutes in “the big room.”
There is something sort of out-of-body about that moment when I am standing in front of a roomful of people right before I talk — I had it when I gave my first Refresh talk, when I taught my first jQuery class, when I spoke at my first BarCamp RDU, and yet again this weekend. For that moment, in my head, I am a complete and utter case, and can’t quite fathom that I thought this was a good idea. And then I start talking, and then it is OK. And then when it’s over, people clap, and I like that part.
Back when I set out to start speaking more, I decided to take an improv class. For six weeks, we practiced being spontaneously funny, and at the end, we got up on stage in front of a bunch of strangers and tried to do it for real. Knowing what that feels like — what it feels like to run up the aisle like you’re excited when really you’re terrified because you’ve never done this before and in real life you sit at a desk all day and talk to no one and what were you thinking? — makes the thought of talking to a bunch of strangers about what you actually know how to do seem like a completely reasonable thing.
My experience this weekend was nothing short of excellent — people I barely knew rallied around me throughout the weekend to help me improve my presentation (most notably Chris Williams, organizer of JSConf, to whom I owe many thanks for all the images — especially the Liger). The audience graciously tolerated the part in the middle where I had to leave the podium to (very publicly) blow my nose. People asked great questions, and audience members gently pointed out things I might want to rethink. With the exception of one creepy off-the-wall comment about my “fine-boned features,” the reaction was overwhelmingly positive.
Reliable sources told me that of 300 attendees, approximately 282 were men. I was the only woman to submit a talk. So this is the part where I encourage other women to do the same. I think women, on the whole (of course there are exceptions), are way more inclined than men to think they aren’t good enough speakers, that they don’t know a topic well enough to tell it to other people. Two truths: one, the speaking skills of the speakers I’ve seen have been all over the map; two, you’d be surprised how much you actually know about a topic, especially given the right audience.  Get to know the people who do speak at events, and discover that they’re people just like you. Go out on a limb and try something that’s


What is Lorem Ipsum
Appearance:
Season 1
Season 2
Season 3
Season 4
Season 5
Status:
Alive
Alive
Deceased
Presumed dead
Search


This tests HTML escaping. We don't
want people to have unsanitized HTML in their documents.


pycopancore.model_components.social_learning_of_environmental_friendliness.interface module
model component Interface template.
TODO: adjust or fill in code and documentation wherever marked by “TODO:”, then
remove these instructions.
-
class
pycopancore.model_components.social_learning_of_environmental_friendliness.interface.
Culture
[source]
Bases: object
Interface for Culture process taxon mixin.
-
environmental_friendliness_learning_density_quotient_offset
= intensive variable 'environmental friendliness learning density quotient offset' (terrestrial carbon density quotient at which imitation probability has its point of inflection), not None, scale=ratio, datatype=<class 'float'>, unit=unity []
-
environmental_friendliness_learning_fraction
= variable 'awareness update fraction' (fraction of individuals learning environmental (un)friendliness simultaneously), not None, scale=ratio, datatype=<class 'float'>, unit=unity [], >=0, <=1
-
environmental_friendliness_learning_probability_characteristic_slope
= intensive variable 'environmental friendliness imitation probability's characteristic slope' (slope of the normalized sigmoid function at its point of inflection), not None, scale=ratio, datatype=<class 'float'>, unit=unity []
-
environmental_friendliness_learning_rate
= variable 'environmental friendliness learning rate' (rate at which a fraction of individuals learn environmental (un)friendliness from neighbours), not None, scale=ratio, datatype=<class 'float'>, unit=[a^-1], >=0
-
class
pycopancore.model_components.social_learning_of_environmental_friendliness.interface.
Individual
[source]
Bases: object
Interface for Individual entity type mixin.
-
is_environmentally_friendly
= variable 'is environmentally friendly' (whether the entity is environmentally friendly or not), not None, scale=ordinal, datatype=<class 'float'>, levels=[False, True]
-
class
pycopancore.model_components.social_learning_of_environmental_friendliness.interface.
Model
[source]
Bases: object
Interface for Model mixin.
-
description
= "a certain fraction of individuals imitates a random acquaintance's env. friendliness with a probability depending on their surrounding terrestrial carbon density "
-
name
= 'social learning of environmental friendliness'
-
requires
= []
Module contents
Model component package template.
TODO:
Copy this folder, rename it to the name of your model component,
then adjust or fill in code and documentation in all modules wherever marked by “TODO:”,
finally remove these instructions.
See the model component development tutorial for details.


Example book article
Updated
North Korea has threatened Australia with "disaster" for aligning itself with the US against the country's reclusive regime.
Its most recent missile test — its largest yet — highlights its determination to be able to strike anywhere in the world.
Just how much of the world is at potential risk?
North Korea has a large arsenal of reliable short-range ballistic missiles.
Under current leader Kim Jong-un's reign, North Korea has tested these short-range missiles 50 times. Only one of these tests has failed under the current leader, signalling their operational readiness.
The missile in this category with the longest range is the ER Scud. It can hit targets up to 1,000 kilometres away.
That puts all of South Korea within range, as well as Osaka, Japan's second-largest city.
Of particular threat to South Korea are missiles known as the Scud-C MaRV and Scud-B MaRV.
These missiles are equipped with a manoeuvrable final stage. This could allow them to evade the Terminal High Altitude Area Defence system, which the US has stationed on South Korean soil.
The maximum range of North Korea's medium-range ballistic missiles is about 2,000 kilometres.
These are also reliably tested — only two of nine tests have failed under Kim Jong-un.
This puts the rest of Japan within range, including the world's largest metropolis, Tokyo.
North Korea is also developing the capability to launch missiles from a submarine — but the technology is generally regarded as being some way off being deployed.
Only three of six tests have succeeded under Kim Jong-un.
Currently, the submarine-launched missiles have an estimated range of 1,200 kilometres.
The Sinpo submarine is estimated to be able to operate up to 2,800 kilometres from its base, so the threat remains localised in the Pacific.
But disturbingly, submarine-based launches are much harder to anticipate than a land-based launch.
North Korea's intermediate-range ballistic missiles have a maximum range of 4,500 kilometres.
This puts the US military bases on the island of Guam firmly into range, as well as much of South-East Asia.
The reliability of these missiles is less certain, with only three tests successful out of 14 conducted under Kim Jong-un.
However, six tests of an intermediate-range missile that only appeared this year, the Hwasong-12, are a cause for concern.
The first three of these tests were all failures but at least two of the most recent three were successful.
Two of the Hwasong-12 tests flew over Japan (approximate landing locations shown), and some experts believe its most recent successful test on September 15 could signal this missile's operational readiness.
North Korea has also conducted two successful tests of an intercontinental ballistic missile, the Hwasong-14, this year.
After the first test, experts estimated its range to be about 8,500 kilometres, which would put the US state of Alaska into range.
It would also put many parts of Australia into range.
However, the second test gave the missile an even higher estimated range of 10,000 kilometres.
With this range, all of Australia would be in striking distance.
It could hit Los Angeles...
Most of Europe...
And even New Zealand.
As the crow flies, New York and Washington appear to be out of range.
But experts have noted that the rotation of the earth increases the range of missiles fired in an easterly direction.
Another ICBM test was conducted on November 29, 2017, heralding the arrival of a new class of ICBM — the Hwasong-15
The missile flew higher and for longer than any other previous North Korean missile test, and gave it a range of around 13,000 kilometres.
This puts all of the continental US into range ...
But experts have noted that the payload used in the test may have been lighter than before.
If true, a missile carrying a heavier nuclear or munitions payload may not be able to reach this distance.
Furthermore it's currently unclear if North Korea has built a re-entry vehicle that won't burn up in the atmosphere. However, this is old technology and if the regime has not already mastered it, experts say it is not far off.
There is also some contention over whether North Korea has miniaturised a nuclear weapon so it can attach it to these longer-range missiles.
The regime claims it has already mastered this technology; experts say if North Korea doesn't already have the capability, it's a year or less away.
But the design of the new Hwasong-15 could allow it to carry larger warheads, negating the need for miniaturisation.
Finally, North Korea also has an array of space launch vehicles, which it has used to put satellites into orbit.
Some estimates put their reach at 15,000 kilometres in a three-stage configuration.
Under this scenario, the only continent that would be largely safe would be South America.
But these missiles have only been tested with relatively light satellites, so it's unlikely they would reach this far with the heavy payload of a warhead.
Also, these missiles take days to set up for launch, which gives enemies time to prepare and possibly disrupt them, so they are highly unlikely to be used as offensive missiles.
So where do you go if you want to be as far as possible from the potential wrath of the hermit kingdom?
The farthest land point from North Korea appears to be the town of Mar del Plata in Argentina.
But before you start learning Spanish, remember that most of the regime's long-range missile capability remains largely untested.
On the other hand, the north has an estimated arsenal of several hundred SRBMs and MRBMs, and if attacked, this is likely where their fire would be directed.
This is perilous for the immediate region, as it's likely the nuclear warheads that the regime currently has can already be attached to their short and medium-range missiles.
North Korea is also believed to have biological and chemical weapons arsenals that it could attach to these weapons.
So even if sanctions drive the regime back to the negotiating table and halt the testing of new missiles and nuclear weapons, North Korea's neighbours will still be well within their sights.
And with big players like the US and China jostling to protect their interests in the region, any attack will have wider implications for the whole world.
Thanks for reading — all the way to the end! If you liked this story, you might also be interested in this one:
Escape from North Korea: A long and dangerous journey
Follow a teenage North Korean defector on her long, dangerous journey to a new life.
Did you find this story surprising, insightful or useful?
Sign up to hear about interactives, visualisations and good reads from the ABC News Digital Storytelling team. (No more than one email a week, we promise.)
Sources
Credits
- Reporter: Matt Martino
- Designer: Ben Spraggon
- Developer: Josh Byrd
- Editor: Matt Liddy
Topics: unrest-conflict-and-war, nuclear-issues, korea-democratic-peoples-republic-of
First posted


Virtual Machine Research Overview
Disclaimer:
It's not assumed this overview is complete in any way.
Edit on GitHub


Event Filter
Event Processing Applications may need to operate over a subset of Events in an Event Stream.
Problem
How can an application select only the relevant events (or discard uninteresting events) from an Event Stream?
Solution
Implementation
As an example, the streaming database ksqlDB provides the ability to create a filtered Event Stream using familiar SQL syntax:
CREATE STREAM payments_only WITH (kafka_topic = 'transactions-topic') AS
SELECT *
FROM all_transactions
WHERE type = 'purchase';
The Kafka Streams client library of Apache Kafka® provides a filter
operator in its DSL, which filters out events that do not match a given predicate.
builder
.stream("transactions-topic")
.filter((key, transaction) -> transaction.type == "purchase")
.to("payments-topic");
References
- This pattern is derived from Message Filter in Enterprise Integration Patterns by Gregor Hohpe and Bobby Woolf
- See the Kafka Tutorial How to filter a stream of events for detailed examples of filtering event streams.


Fitch dove in the lake. He swam deep. The lake was cold in the deep spots! Fitch found an old crate. He got hold of the crate. He swam with it. Up he swam. Fitch came up with a gasp. He put the crate on the sand. The lid was stuck shut. Fitch hit the lid with a pole. The lid broke. There was a pile of old coins in the crate!
in-context


--- title: equivalentPerimeter sidebar: function_reference_sidebar permalink: grain2d.equivalentPerimeter.html folder: function_reference toc: false ---
returns the equivalent perimeter of grain-polygon
The equivalent perimeter of grain-polygon is defined as
\[ p = 2 \pi ER \],
where \(ER\) is the equivalent radius of a grain
| grains | grain2d |
| p | equivalent perimeter in measurement units |


Argument between inmates leads to death in Jail Collier County
by WFTX Digital TeamCOLLIER COUNTY, Fla. — A disagreement between inmates turned deadly.
Collier County Sheriffs are now conducting a death investigation.
The victim died Monday at NCH Baker Hospital Downtown.
Collier County Sheriffs Office Professional Responsibility Bureau will conduct a parallel administrative investigation to determine if policies, procedures, and training were followed.
Fox 4 is working on getting more details about this investigation as we receive it.
br/>


On approach, call Port Control on VHF channel 16. In all ports report first to Customs and then Immigration if the officials do not visit the boat first.
Last updated August 2015.
All visitors must have a valid passport valid for at least 6 months.
Most visitors require a visa. See https://immigration.ecitizen.go.ke for the up to date list.
From 1st September 2015 visitors requiring a visa must apply in advance using the eCitizen website.
Visas are usually issued for a stay of 30 days and can be extended if they are applied for in person before the date of expiry.
Last updated August 2015.
Firearms must be declared on arrival. These will be impounded and released only on departure.
The import of fruits, plants and seeds, and imitation firearms are prohibited, as are meat, meat products and any product from poultry, which must be declared and will be destroyed.
The export of gold, diamonds and wildlife skins or game trophies not obtained from the authorised Kenyan government department is prohibited
There is no specified limit on the period a yacht may remain in Kenya and some have remained for several years while the owners were absent. Boats should not be left completely unattended as there have been several reports of theft.
Visiting sailors can buy or have sent out capital equipment such as engines, instruments and sails. By using a clearing agent, who will provide a bond, it is possible to avoid paying local importation taxes.
Last updated August 2015.
Malaria prophylaxis is recommended, as malaria is prevalent on the coast.
Do not swim in fresh water, as this may be infected with bilharzia parasites.
AIDS is endemic in East Africa.
Tuberculosis is an increasingly serious health concern in Kenya.
Cholera and dengue fever also occur in Kenya.
Tap water is not potable and sealed bottle water is recommended. Avoid ice in drinks. Do not eat food prepared by unlicensed vendors.
A transit log is necessary for any movement in Kenyan waters. The log is obtained from Customs on arrival and must be presented to Customs when calling at the following ports: Shimoni, Mombasa, Kilifi, Malindi and Lamu. One should inform Customs of the intended itinerary, time of departure and ETA in the next port.
Overtime is charged on weekends and holidays.
There are light dues, government charges for which change frequently.
Foreign yachts have to pay harbour charges, which may work out cheaper if bought for one year in advance, unless one intends to spend only a short time in Kenya.
A navigation fee of approximately US$10 is payable when clearing out.
The authorities are trying hard to protect wildlife, and it is a serious offence to buy and attempt to export ivory, animal skins and stuffed animals.
It is forbidden to photograph ports, police, naval buildings, vessels or personnel.
Cats and dogs must be accompanied by veterinarian good health certificate and rabies certificate issued at point of origin. Rabies vaccination must be less than one year and one month at the latest prior to arrival. In addition an import permit must be presented at time of entry. Same is available through Livestock Officer, Veterinary Department, Post Office, Kabete, Kenya. Allow 30 days from time of application for import permit (Airmail).
No birds may be imported.


{% load static %}
Location: {{this_trail.location}}
Difficulty: {{this_trail.difficulty}}
Distance: {{this_trail.distance}}
Elevation Gain {{this_trail.elevation_change}}
Route Type: {{this_trail.route_type}}
Rating {{this_trail.rating}}
{{this_trail.description}}


RT @ThePracticalDev: Reverse Engineering A Mysterious UDP Stream in My Hotel http://wiki.gkbrk.com/Hotel_Music.html
5/21/2016, 2:04:51 PM
Favs: 0
Retweets: 0
link--- layout: tweet ---
RT @ThePracticalDev: Reverse Engineering A Mysterious UDP Stream in My Hotel http://wiki.gkbrk.com/Hotel_Music.html
5/21/2016, 2:04:51 PM
Favs: 0
Retweets: 0
link


Before Change
Set brightness if call came from HomeKit.
_LOGGER.debug("%s: Set brightness to %d", self.entity_id, value)
self._flag[CHAR_BRIGHTNESS] = True
if value != 0:
self.hass.components.light.turn_on(
self.entity_id, brightness_pct=value)
else:
self.hass.components.light.turn_off(self.entity_id)
def set_color_temperature(self, value):
Set color temperature if call came from HomeKit.
_LOGGER.debug("%s: Set color temp to %s", self.entity_id, value)
self._flag[CHAR_COLOR_TEMPERATURE] = True
After Change
Set brightness if call came from HomeKit.
_LOGGER.debug("%s: Set brightness to %d", self.entity_id, value)
self._flag[CHAR_BRIGHTNESS] = True
if value == 0:
self.set_state(0) // Turn off light
return
params = {ATTR_ENTITY_ID: self.entity_id, ATTR_BRIGHTNESS_PCT: value}
self.hass.services.call(DOMAIN, SERVICE_TURN_ON, params)
def set_color_temperature(self, value):


Every so often at the movies, we stumble across a certain moment that's so appallingly conceived and ineptly executed you literally can't believe your eyes, the kind of sight that causes your jaw to drop, your stomach to lurch and your mind to boggle. Midway through "Baby Geniuses" comes just such a scene.
Our toddler hero Sly has escaped the underground lab of Dr. Elena Kinder (Kathleen Turner) and is hiding out in a mall, where he comes across a carriage occupied by a baby girl. Sly dives into the pram, surprising the little beauty.
 "OK, but you could at least take me to dinner first," the girl replies. Seconds later, Sly is dressed in drag, while his accomplice is reclining on her back, smoking a cigar and murmuring "call me."
An exceedingly unpleasant combination of cutesy kiddie matinee hijinks and outright smarminess, "Baby Geniuses" could only be the work of director Bob Clark, the man whose previous cinematic triumphs include "Loose Cannons," "Porky's" and "Rhinestone," in which Sylvester Stallone and Dolly Parton pretended to be Nashville's answer to Sonny and Cher.
"Geniuses" does include a few mildly interesting computer-generated special effects that allow the infants to dance and run, although the trickery is unlikely to wow anyone familiar with the now-famous "dancing baby" from "Ally McBeal." That the movie has spent more than a few months on the shelf at Sony is evident in its use of the "Mission: Impossible" theme as a joke and "show me the money" and Austin Powers' "oh, behave, baby" as punchlines. Nothing puts an expiration date on a film quite like trendy humor.
Then again, "Geniuses" is so desperate to get any sort of a laugh it sees nothing wrong with stealing liberally from both the "Home Alone" and "Look Who's Talking" series. The story's gimmick - tots who excel in judo as well as innuendos - wears thin about five minutes into the film, forcing adult leads Turner, a visibly embarrassed Christopher Lloyd and Dom DeLuise to mug and shriek nonstop in the hopes of keeping the comedy going. Hopefully everyone received a generous paycheck in exchange for trashing whatever artistic credibility he or she had left.
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


{% extends 'base.html' %} {% load widget_tweaks %} {% block active %}
Piracy of your valuable Software's can cause irrecoverable damage to company's brand, its revenue and its ability to compete
Our product gives protection using open-source technologies, and hence we provide our services at cheap rates.
By protecting the clients from piracy, your company can sustain in competetive market along with better relations with customers
Using the contact from admins in Cloud you get to know who actually are using your software in realtime.
Our main focus is on techniques useful for protecting software from modification, program-based attacks (by software diversity), and BORE – break-once run everywhere – attacks using architectural design
Internet piracy is the act of making unauthorized copy of copyrighted software available to others electronically. Software counterfeiting is the illegal duplication and distribution of copyrighted software in a form designed to make it appear legitimate. Both forms consist of installing a piece of software on more computers than allowed.
Cracks and serials are forms of software piracy that consists of legally obtaining an evaluation version and subsequently entering a copied license code or applying a generic patch that undergoes a copy protection. This is a widespread form of piracy. It is so popular because of small amount of information that needs to be exchanged illegally distribute and obtain a license code or a patch than a complete program. The scheme so proposed gives a dynamic solution to the problem of piracy as the key is provided at the run time.
The term soft lifting refers to the act of piracy where one copy is legally obtained and installed on more computers than allowed. Hard disk loading is the unauthorized installation of copies of software onto the hard disks of personal computers, often as an incentive for the end user to buy the hardware.
The scheme prevents piracy by issuing lesser number of licenses to the computers on the network than the exact number of computers but checks that license keys are given at run time only to that number of machines as the number of licenses purchased.
The system provides storage of all databases on redundant computers with automatic switch over. The reliability of the overall program depends on the reliability of the separate components. The main pillar of reliability of the system is the backup of the database which is continuously maintained and updated to reflect the most recent changes.


Dear Dr Strange,
Congratulations! You are one of the first 1000 people to sign up for Chekkit. What is Chekkit? Chekkit is an anti-counterfeiting technology to protect lives by identifying genuine products and providing real time supply chain insights to track fraudsters. Say goodbye to buying fake medicines.
Here is what to expect:
- We ensure all tagged products are genuine
- Your customers have adequate knowledge of drug use
- Timely notifications for prescription adherence
- Drug validation history
- Secure product information from warehouse to end user
- End to end encryption
- Logged in block-chain
...all through a unique QR and short code.
For more questions/info, please contact, Dare: +233 26 290 467 Samuel: + 233<PHONE_NUMBER>info@chekkitapp.com
|


Computation of bootstrap confidence intervals in an almost automatic fashion.
| Version: | 0.2-1 |
| Depends: | R (≥ 3.5.0) |
| Imports: | graphics, stats, utils |
| Suggests: | glmnet, knitr |
| Published: | 2018-08-31 |
| Author: | Bradley Efron [aut], Balasubramanian Narasimhan [aut, cre] |
| Maintainer: | Balasubramanian Narasimhan <naras at stat.stanford.edu> |
| BugReports: | http://github.com/bnaras/bcaboot/issues |
| License: | GPL-2 | GPL-3 [expanded from: GPL (≥ 2)] |
| URL: | https://bnaras.github.io/bcaboot, https://github.com/bnaras/bcaboot |
| NeedsCompilation: | no |
| CRAN checks: | bcaboot results |
| Reference manual: | bcaboot.pdf |
| Vignettes: |
Automatic Construction of Bootstrap Confidence Intervals |
| Package source: | bcaboot_0.2-1.tar.gz |
| Windows binaries: | r-devel: bcaboot_0.2-1.zip, r-release: bcaboot_0.2-1.zip, r-oldrel: not available |
| OS X binaries: | r-release: bcaboot_0.2-1.tgz, r-oldrel: not available |
Please use the canonical form https://CRAN.R-project.org/package=bcaboot to link to this page.


from IPython.display import HTML
HTML('''<script>
code_show=true;
function code_toggle() {
if (code_show){
$('div.input').hide();
$('div.prompt').hide();
} else {
$('div.input').show();
$('div.prompt').show();
}
code_show = !code_show
}
$( document ).ready(code_toggle);
</script>
<form action="javascript:code_toggle()"><input type="submit" value="Code Toggle"></form>''')
October 15, 2015 – Northwestern University
CHiMaD hosted the first Phase Field Methods Hackathon on October 14, 2015. The motivation for the hackathon came from one of CHiMaD’s missions: to develop community standards for phase field modeling in materials science, and to distribute community codes for phase field modeling. As a first step along this mission, CHiMaD is working on devel- oping and distributing a set of standard problems for phase field modeling.
Teams consisting of two students or postdocs were given a set of problems consisting of two kinds of phase field modeling; each set contained sub- problems of increasing difficulty. The problems were (intended to be!) completely defined in terms of initial conditions, geometry, and material pa- rameters. The teams had 24 hours to solve the problems using whatever numerical codes they had at their disposition (with full access to the internet) - there were no codes provided at the hackathon. All attendees were expected to bring their own lap- tops and connect to the servers they regularly use for running their codes.
The goal of the hackathon was to see how different codes and different approaches could handle the problems with respect to accuracy and speed. The aim of the hackathon was not to produce winners or losers, but to advance our understanding of phase field modeling: in that context, all results or at- tempts at solving the problems were valuable. In this first iteration, we learned the most about how to define the problems themselves to even be able to have a successful exercise.
from IPython.display import HTML
HTML('''
<script async
class="speakerdeck-embed"
data-id="bc58bada5c664d62851305d71b4790ce"
data-ratio="1.33333333333333"
src="//speakerdeck.com/assets/embed.js">
</script>''')


MailboxGetVMFile(), MailboxMessageFlags, MailboxMessagePriority, MailboxDeliveryVerb
There are a few data types that are used at various parts of the message-transmission and reception process. There are also a few concepts related to these types that need to be discussed first.
First of all, we need to distinguish between two basic data types: data format types , and data storage types .
Every message has two data tokens associated with it. One is the data format type, and the other is the data storage type. The data storage type describes the gross structure of the message data. Every data driver can accept one data storage type. For example, the GEOS system includes data drivers for messages whose bodies are stored in VM trees, and messages whose bodies are stored in byte-files. The data driver is not concerned with the message on a lower level. If you send a message in a VM tree, the data drivers at both machines will make sure that the message arives in a valid VM tree (which may mean fixing up the VM handles that make up the links in the tree), but they won't care about the data inside the blocks of the tree.
On a higherlevel, every message has its own data format type. This type describes how the data is actually stored in the underlying structure. For example, a message might be stored as a GString in a VM chain. In this case, the message's data storage type would be "VM tree" (a VM chain is a special kind of VM tree), and the data format type would be "VM Gstring".
Every data format type implies a particular data storage type; all messages with data format type a will necessarily use data storage type x . The converse, however, is not necessarily true. For example, all messages with data format type "VM GString" have data storage type "VM tree"; as do all messages with data format "VM composite".
When an application passes a message to a data driver, it may designate the message body as either "volatile" or "non-volatile". If the data is marked "volatile", the application may alter or destroy the data as soon as it has registered the message. That is, when the application registers the message, the appropriate Data Driver copies all the message's information out of the passed message before execution returns to the application. You should pass "volatile" if, for example, you are passing a pointer to a VM file used by the application.
If you designate the data as non-volatile , you are not allowed to alter or delete the data in the message. If you ask it to, the data driver will take care of freeing the storage used for the message when it is done with it. Every data driver has its own conventions about what applications should do with non-volatile messages after sending them.
For example, if you send a message through the VM tree data driver, you should write non-volatile messages to a special VM file created by the routine
MailboxGetVMFile()
. This routine is passed a single argument, the number of blocks you expect to allocate in the VM block. The routine returns the handle of a VM file. You can write the message in this file, and register the message (designated "non-volatile"). The data driver will then take care of freeing the file's storage when the message has been safely delivered.
Each message is associated with a set of
MailboxMessageFlags
. These are a byte-length record. This record has the following flags:
MailboxMessagePriority
enumerated type, discussed below.
MailboxDeliveryVerb
enumerated type, discussed below.
Every message can be assigned a priority. This priority is represented by a member of the
MailboxMessagePriority
enumerated type. The priority affects how the Mailbox library will handle the message at both the sending and the receiving end. This type has the following values:
Every message has a "delivery verb" associated with it. This is useful in notifying the user of the message's arrival. Each delivery verb is represented by a member of the
MailboxDeliveryVerb
enumerated type. This type has the following members:


Cumalis Lisp is a Scheme implementation written in Typescript.
README and source code are available on Github.


fprintd-verify
Verify fingerprints against the database.
More information: home page
- Verify all stored fingerprints for the current user:
fprintd-verify
- Verify a specific fingerprint for the current user:
fprintd-verify --finger left-thumb|left-index-finger|left-middle-finger|left-ring-finger|left-little-finger|right-thumb|right-index-finger|right-middle-finger|right-ring-finger|right-little-finger
- Verify fingerprints for a specific user:
fprint-verify username
- Verify a specific fingerprint for a specific user:
fprintd-verify --finger finger_name username
- Fail the process if a fingerprint doesn't match with ones stored in the database for the current user:
fprint-verify --g-fatal-warnings
- Display help:
fprintd-verify --help


Fiddling
Acoustic
Double Bass - classical studies 8 years
Synthesis
Korg Electribe ESX-1
Korg Electribe EA-1
Ensoniq ESQ-1
Software
Ableton Live
Reaktor 6
Field Recording
Tascam DR-05
Listening
James Ferraro - Skid Row (2015)
Holger Czukay - On the Way to the Peak of Normal (1981)
Eden Ahbez - Eden's Island (1960)


Ruida Zeng - Personal Website
Hi, I'm Ruida. Yay!
Some of my favorite places:
The beach
The dog park
The fire hydrant
Make sure to follow me on
Instagram
Contact Us


The use of these trademarks does not indicate endorsement of the trademark holder by Font Awesome, nor vice versa.
| Name of woner: | Md.Shariful Islam |
| Father Name: | Md.Atiyer Islam |
| Mother Name: | Md.Sheyera Begum |
| Address: | Sonadanga R/A, Khulna |
| National ID Number: |<PHONE_NUMBER>0000081 |
| Contact Number: |<PHONE_NUMBER>8 |
| Email: |<EMAIL_ADDRESS>|
| Passport Number: | A1994471M0000081 |
| Car Number: | Khulna Ha-11-3354 |
| Wheel No: | 12 Wheel |
| Car Type: | Micro Bus |
| Insurence Number: | 345765754 |
| Road Permit: | All over Bangladesh |
| Fitness Car: | Deadline Dec-2019 |
| Sasis Number: | 19S940Y81 |
| Enginee Number: | 01I03H93G38 |
| Name: | Md.Shariful Islam | |
| Father Name: | Md.Atiyer Islam | |
| Mother Name: | Md.Sheyera Begum | |
| Address: | sonadanga R/A, Khulna. | |
| Driving Lisence No: |<PHONE_NUMBER>0000081 | |
| National ID Number: |<PHONE_NUMBER>0000081 | |
| Contact Number: |<PHONE_NUMBER>8 | |
| Email: |<EMAIL_ADDRESS>| |
| Passport Number: | A1994471M0000081 | |
| Approved | Reject | Edit |


Definition
Bull Call Spread is an option strategy involved with two call option contracts with the same expiration but different strikes. The strategy buys the call options with a lower strike and sells the same amount of call options with a higher strike price.
This strategy creates a ceiling and floor for the profit. By purchasing a call and selling a call with higher strike simultaneously, traders can reduce the cost of just one long call option with the premium of a short call option. But the premium of ITM call is more expensive than the OTM call. The strategy limits the loss from the dropping price of the stock but still create a ceiling to the profit while the price is increasing.
Take GOOG as an example. If the share price of GOOG is $950 at time 0, the premium of ITM call option is 20 with strike 900, the premium of OTM call option is 2 with strike 1000. If we ignore the commission, dividends and other transaction fees, the payoff of Bull Call Spread strategy is as follows:
price = np.arange(800,1100,1)
k_low = 900 # lower strike price for call
k_high = 1000 # higher strike price for call
premium_low = 20 # premium of call option with lower strike
premium_high = 2 # premium of call option with higher strike
# long call with lower strike
payoff_long_call = [max(-premium, i-k_low-premium_low ) for i in price]
# short call with higher strike
payoff_short_call = [min(premium, -(i-k_high-premium_high)) for i in price]
payoff = np.sum([payoff_long_call, payoff_short_call], axis=0)
plt.figure(figsize=(20,11))
plt.plot(price, payoff_long_call, label = 'long call')
plt.plot(price, payoff_short_call, label = 'short call')
plt.plot(price, payoff, label = 'Bull Call Spread')
plt.legend(fontsize = 20)
plt.xlabel('Stock Price at Expiry',fontsize = 15)
plt.ylabel('payoff',fontsize = 15)
plt.title('Bull Call Spread Payoff at Expiration',fontsize = 20)
plt.grid(True)
From the payoff plot we can see, the maximum profit of the strategy is the difference between call option strike price sold and call option strike price purchased minus the difference between buying lower strike call premium and selling higher strike call premium.
Implementation
Step 1: First, you need to initialize the algorithm including set the start date, end date and the cash required. Then use option.SetFilter(-6, 6, timedelta(30), timedelta(60))
to filter the candidate contracts which expire in 30 days to 60 days from now on. The strike price range involves both ITM and OTM options. Then we get the option chains of GOOG.
def Initialize(self):
self.SetStartDate(2017, 5, 01)
self.SetEndDate(2017, 8, 30)
self.SetCash(100000)
equity = self.AddEquity("GOOG", Resolution.Minute)
option = self.AddOption("GOOG", Resolution.Minute)
self.symbol = option.Symbol
# set our strike/expiry filter for this option chain
option.SetFilter(-7, 7, timedelta(30), timedelta(60))
# use the underlying equity GOOG as the benchmark
self.SetBenchmark(equity.Symbol)
Step 2: Choose the contracts with the same expiration date. For demonstration purpose here we sorted the contracts by their expiration dates and choose the options with the furthest expiration date in the option chain.
def TradeOptions(self,optionchain):
for i in optionchain:
if i.Key != self.symbol: continue
chain = i.Value
# sorted the optionchain by expiration date and choose the furthest date
expiry = sorted(chain,key = lambda x: x.Expiry, reverse=True)[0].Expiry
Step 3: Filter the call options from the contracts which expire on the furthest expiration date in the option chain.
call = [i for i in chain if i.Expiry == expiry and i.Right == 0]
Step 4: Sort the call options with the same expiration date according to their strike price. Then buy the call option with the lowest strike price and sell the call with the highest strike price.
call_contracts = sorted(call,key = lambda x: x.Strike)
if len(call_contracts) == 0: continue
# call option contract with lower strike
self.call_low = call_contracts[0]
# call option contract with higher strike
self.call_high = call_contracts[-1]
self.Buy(self.call_low.Symbol, 1)
self.Sell(self.call_high.Symbol ,1)
Note here you need to add the following rules in OnData(self,slice)
method because you only need to trade options once and wait until the contracts expire. If you already had securities invested in the portfolio, then you do not need to trade new options.
if not self.Portfolio.Invested:
self.TradeOptions(optionchain)
Summary
This strategy can be implemented when you have a moderate outlook on the stock because the payoff reaches its maximum when the price is between the strike price range of two traded options. The strategy protects the downside move of the stock price. But when the price is above the higher strike, the profit is capped.
Algorithm


OH NOES 😱
An Error 404 occured. That means the requested page is not available.
You can:
- View available categories
- Go Big and GO HOME
- Search to your heart's content
Hopefully, none of the above bring you back to this page. 😁
{{ define "main" }}
An Error 404 occured. That means the requested page is not available.
You can:
Hopefully, none of the above bring you back to this page. 😁


A study of improving the payment breakup for drivers
21North | Europ Assistance is empowering OEM authorized automobile dealers with technology-driven solutions to deliver superior customer experience. One of the major stakeholders in the business is our drivers (called as ambassadors).They essentially act as runners for executing vehicle pick up and drop services for the OEM customers. We help them execute the tasks using our solutions.
Since the backbone of the business is our drivers, we have our internal driver application called as Ambassador Application. Well now our ambasssador app needs a little introduction. Through this application our driver get the task assigned for the day. It also has a section called payout structure, in which they can see their total income and incentives for each task completed in a day and a month.
Our ambassadors (driver partners) are the actual fuel to our business. We knew that we had to make it extremely easy for our driver partners to use the mobile application, but our user experience was not intuitive enough.
Like any other startup, our operations team were still at an early stage and we were trying our various pay-out structures. A lot of times, there were rampant changes in the payout structure of the ambassadors. Once the new payout structure was released, the team-leader of the ambassador was responsible to explain the changes. Often, these communications took place verbally and due to basic human error in conveying the information, it would lead to dissatisfaction among the ambassadors, because they thought they were not being remunerated what they initially hoped for.
And then we thought “Let’s go beyond just the UI, and rethink the entire user experience, instead of ceding over features as is.”
We wanted our redesign to solve problems with speciﬁc business constraints, and we knew it was impossible to do so without delving into user problems ﬁrst. First comes the framework - To achieve this, we pinned some critical thumb-rules before embarking on our redesign journey:
The second step was to understand our users’ pain points with the existing UX in the payout structure. To dig deeper into this, we reached out to our users directly. We adapted both qualitative and quantitative methods to get to the root of every problem in the picture. We started interviewing ambassador to reach the root of the cause. Here are some feedback we got from them:
“ No clariﬁcation were being made if they raised any issue ”
“ Diﬀerent incentives are not shown properly ”
“ Deduction are not clearly highlighted ”
“ It was all confusing and diﬃcult to understand for a driver ”
With all the research and data at our disposal; we realised that redesigning the payout structure ﬁrst will not only enhance the user experience, but also solve a critical business problem
The original page consists of too many component on a single page It was diﬃcult for our ambassador to understand those terms and language. Too many information without any conclusion ?
Before jumping into the screen designing process we wanted to have a clear picture of our ambassador pain points and goals. We summarized our learning to this three primary problems to form a common understanding of what we were trying to solve.
Too much of scroll and scroll. Also the amount of content written on this page without any ﬁnal conclusion leds to no where. The terms and language used in the content is diﬃcult to understand for a driver who is just looking for a total payout
The page was overﬂowing with tasks that required explicit actions from the ambassador. The arrow used is giving no clear idea for its existence
Too many actions and redundant information caused users to spend more than 2 minutes just to see and ﬁnd out their total payout and incentives. Time and energy both are wasted but still no information.
Since we were redesigning the application from UX perspective and also making it visually appealing. We thought of adding more value to it by gamifying the experience of entire payout structure for our ambassador. So we came up with the idea of GOAL Page The idea of having a goals page originated from the fact that our drivers had too many issues understanding the frequently changing pay-out structure. Also, we wanted to come up with a system which would elevate their motivation levels to execute more tasks per day. Using gamiﬁcation, we set challenges. The driver partners can see the progress of their tasks and how much incentives they can earn through a progress bar. The system also tells the driver if he has committed any mistake which may have caused a penalty. This keeps them informed about all their actions throughout the day. We also decided to display the payout structure on the home page for them to view the pay-out details whenever they wanted.
The idea of designing the payout page is to keep it simple and clear. Just to use minimum no. of elements to understand easily. We wanted it to display the payout information more in numerical rather than showing too much of unnecessary content. Also, it should be just one click away from any detail information and ofcourse no scroll. Main challange was to show the Incentive and Deduction at the same place and making it immediate visible and focused at one go. Showing all Deduction and Penalties in red color serves its purpose well and it was easy to distinguished in the list. Also, Total Payout is highlighted and shown in bold so that the user can see it as soon as they land on that page. It gives motivation and immediate result of an action. After the implementation, Now we were ﬁnally ready to roll out the design to our ambassador These lightweight and progressive changes, helped our ambassador cultivate new habits slowly and steadily, making the redesign bearable for them. So we waited for a month to analyse the impact of our design -
The issue raised from our ambassador enquiring about their payout structure had fall drastically. Now, they have clear idea and understanding of their payout. Everything was crystal clear and the gamiﬁcation has worked quiet well providing motivation to take up more task and earn incentive everyday. Also the dropout of an ambassador because of this reason has decreased.
Doesn't it feels good to design something which leads to create a good environment for our user ?
Yes! Even if you fail, think it and make it better.
Below, I list future directions I could take the deliverables here if I were a UX designer here : Understand more about Ambassador Application by talking to our drivers, and via user research → visual design and including pictorial graphics that resonates with them Continue iterating on the Payout Structure page and wireframing/building hiﬁ mocks for the same.


https://blog.netspi.com/all-you-need-is-one-a-clickonce-love-story/
This can be a vector for both initial exploitation and privilege escalation


| | |
- nrvr.distros.common.kickstart.DistroIsoImage(nrvr.diskimage.isoimage.IsoImage)
-
- Ub1204IsoImage
- nrvr.distros.common.kickstart.DistroKickstartFileContent(__builtin__.object)
-
- UbKickstartFileContent
class Ub1204IsoImage(nrvr.distros.common.kickstart.DistroIsoImage) |
| |
An Ubuntu .iso ISO CD-ROM or DVD-ROM disk image for use with kickstart. |
| |
- Method resolution order:
- Ub1204IsoImage
- nrvr.distros.common.kickstart.DistroIsoImage
- nrvr.diskimage.isoimage.IsoImage
- __builtin__.object
Methods defined here:
- __init__(self, isoImagePath)
- Create new Ubuntu Ub1204IsoImage descriptor.
A descriptor can describe an .iso image that does or doesn't yet exist on the host disk.
- modificationsIncludingKickstartFile(self, _kickstartFileContent)
- Construct and return a list of modifications to be passed to method cloneWithModifications.
This method is called by method cloneWithAutoBootingKickstart, which takes the returned list
and passes it to method cloneWithModifications.
As implemented known to support Ubuntu 12.04 LTS.
Apparently much less luck using it with Ubuntu 14.04 LTS.
_kickstartFileContent
A UbKickstartFileContent object.
Return a list of modifications which will be passed to method cloneWithModifications.
Methods inherited from nrvr.distros.common.kickstart.DistroIsoImage:
- cloneWithAutoBootingKickstart(self, _kickstartFileContent, modifications=[], cloneIsoImagePath=None, ignoreJoliet=True)
- Clone with kickstart file added and modified to automatically boot with it.
For more on behavior see documentation of class IsoImage method cloneWithModifications.
For details of modifications see method modificationsIncludingKickstartFile,
which is expected to be different per distro specific subclass.
_kickstartFileContent
A DistroKickstartFileContent object.
cloneIsoImagePath
if not given then in same directory with a timestamp in the filename.
return
IsoImage(cloneIsoImagePath).
- genisoimageOptions(self, bootImage='isolinux/isolinux.bin', bootCatalog='isolinux/boot.cat', label=None, udf=False, ignoreJoliet=True)
- Auxiliary method, called by cloneWithModifications.
As implemented calls superclass method genisoimageOptions and extends the returned list.
Could be improved in the future.
Could be overridden for a subclass.
Methods inherited from nrvr.diskimage.isoimage.IsoImage:
- cloneWithModifications(self, modifications=[], cloneIsoImagePath=None, udf=False, ignoreJoliet=True, pause=False)
- Clone with any number of instances of IsoImageModification applied.
A temporary assembly directory in the same directory as cloneIsoImagePath needs disk space,
but it is removed automatically upon completion of cloning.
modifications
a list of IsoImageModification instances.
cloneIsoImagePath
if not given then in same directory with a timestamp in the filename.
return
IsoImage(cloneIsoImagePath).
- cloneWithModificationsUsingMount(self, modifications=[], cloneIsoImagePath=None, udf=False, ignoreJoliet=True, pause=False)
- Clone with any number of instances of IsoImageModification applied.
This is an older implementation which regrettably because of the mount command requires
having superuser privileges.
It is still here in case a newer implementation doesn't work right, which could be for any
of a number of reasons, for example for symbolic links.
A temporary assembly directory in the same directory as cloneIsoImagePath needs disk space,
but it is removed automatically upon completion of cloning.
modifications
a list of IsoImageModification instances.
cloneIsoImagePath
if not given then in same directory with a timestamp in the filename.
return
IsoImage(cloneIsoImagePath).
- copyToDirectory(self, copyDirectory, udf=False, ignoreJoliet=True, tolerance=0.0)
- Copy all files into a directory.
Not using mount command, no need to run as root.
- exists(self)
- Return True if .iso image exists on the host disk.
- mount(self, mountDir, udf=False)
- Mount .iso image.
- remove(self)
- Remove (delete) .iso image from the host disk.
- unmount(self)
- Unmount .iso image.
Class methods inherited from nrvr.diskimage.isoimage.IsoImage:
- commandsUsedInImplementation(cls) from __builtin__.type
- Return a list to be passed to SystemRequirements.commandsRequired().
This class can be passed to SystemRequirements.commandsRequiredByImplementations().
Data descriptors inherited from nrvr.diskimage.isoimage.IsoImage:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
- isoImagePath
- Path of the .iso image.
|
class UbKickstartFileContent(nrvr.distros.common.kickstart.DistroKickstartFileContent) |
| |
The text content of an Anaconda kickstart file for Ubuntu. |
| |
- Method resolution order:
- UbKickstartFileContent
- nrvr.distros.common.kickstart.DistroKickstartFileContent
- __builtin__.object
Methods defined here:
- __init__(self, string)
- Create new kickstart file content container.
- ubActivateGraphicalLogin(self)
- Boot into graphical login on the installed system.
Do not use in a kickstart that does not install the X Window System.
return
self, for daisychaining.
- ubAddNetworkConfigurationDhcp(self, device)
- Add an additional network device with DHCP.
device
a string, e.g. "eth0".
Should be increased past "eth0" if adding more than one additional configuration.
As implemented there is no protection against a conflict in case there would be a
pre-existing network configuration for the device.
return
self, for daisychaining.
- ubAddNetworkConfigurationStatic(self, device, ipaddress, netmask='<IP_ADDRESS>', gateway=None, nameservers=None)
- Add an additional network device with static IP.
As implemented only supports IPv4.
device
a string, e.g. "eth0".
Should be increased past "eth0" if adding more than one additional configuration.
As implemented there is no protection against a conflict in case there would be a
pre-existing network configuration for the device.
ipaddress
IP address.
netmask
netmask.
Defaults to <IP_ADDRESS>.
gateway
gateway.
If None then default to ip.1.
nameservers
one nameserver or a list of nameservers.
If None then default to gateway.
If empty list then remove option.
return
self, for daisychaining.
- ubCreateNetworkConfigurationSection(self)
- Create the necessary network configuration section.
As implemented there is no protection against a conflict in case there would be a
pre-existing network configuration section.
return
self, for daisychaining.
- ubReplaceHostname(self, hostname)
- Replace hostname value in preseed variable.
hostname
new hostname.
return
self, for daisychaining.
- ubSetPreseedValue(self, qowner, qname, qtype, qvalue)
- Set a preseed value in the command section.
qowner
"d-i" or other owner.
qname
name string, e.g. "pkgsel/update-policy".
qtype
type string, e.g. "boolean", "string", "select", or "multiselect".
qvalue
value string.
return
self, for daisychaining.
- ubSetUpdatePolicyNone(self)
- Set policy for applying updates to "none".
No automatic updates.
return
self, for daisychaining.
- ubSetUpdatePolicyUnattended(self)
- Set policy for applying updates to "unattended-upgrades".
Install security updates automatically.
return
self, for daisychaining.
- ubSetUpgradeFull(self)
- Set whether to upgrade packages after debootstrap to "full-upgrade".
return
self, for daisychaining.
- ubSetUpgradeNone(self)
- Set whether to upgrade packages after debootstrap to "none".
return
self, for daisychaining.
- ubSetUpgradeSafe(self)
- Set whether to upgrade packages after debootstrap to "safe-upgrade".
return
self, for daisychaining.
- ubSetUser(self, username, pwd=None, fullname=None)
- Set the one user Ubuntu kickstart can set up.
Ubuntu kickstart differs from Enterprise Linux in syntax.
Also, a full name is effectively required.
Also, only one user can be set by Ubuntu kickstart.
username
username to set.
The Linux username.
pwd
pwd will be encrypted. If starting with $ it is assumed to be encrypted already.
fullname
the user's full name, which Ubuntu apparently expects to be given.
If None then default to username.capitalize().
return
self, for daisychaining.
Methods inherited from nrvr.distros.common.kickstart.DistroKickstartFileContent:
- addPackage(self, package)
- Add package or package group to %packages section.
return
self, for daisychaining.
- removeAllPackages(self)
- Remove all packages and package groups from %packages section.
return
self, for daisychaining.
- removePackage(self, package)
- Remove package or package group from %packages section.
return
self, for daisychaining.
- replaceAllPackages(self, packages)
- Replace all packages and package groups in %packages section.
packages
a list of packages and package groups.
return
self, for daisychaining.
- replaceLang(self, lang)
- Replace lang option.
lang
e.g. "de_DE.UTF-8" to replace "en_US.UTF-8".
As implemented does not do any sanity checking.
return
self, for daisychaining.
- replaceRootpw(self, pwd)
- Replace rootpw option.
pwd
pwd will be encrypted. If starting with $ it is assumed to be encrypted already.
return
self, for daisychaining.
- sectionByName(self, name)
- Return section by name.
Return a KickstartFileSection, or None.
Setting a returned KickstartFileSection's string modifies the DistroKickstartFileContent.
If more than one section with same name returns first.
- sectionsByName(self, name)
- Return sections by name.
Return a list of KickstartFileSection, or empty list [].
Setting a returned KickstartFileSection's string modifies the DistroKickstartFileContent.
- setSwappiness(self, swappiness)
- Set swappiness.
swappiness
an int between 0 and 100.
return
self, for daisychaining.
Class methods inherited from nrvr.distros.common.kickstart.DistroKickstartFileContent:
- cryptedPwd(cls, plainPwd) from __builtin__.type
- Encrypt in a format acceptable for kickstart.
- parseIntoSections(cls, whole) from __builtin__.type
- Return sections as list of KickstartFileSection objects.
Data descriptors inherited from nrvr.distros.common.kickstart.DistroKickstartFileContent:
- __dict__
- dictionary for instance variables (if defined)
- __weakref__
- list of weak references to the object (if defined)
- sections
- string
- The whole content.
As implemented this is dynamically built, but it is
for the sake of correctness and maintainability.
Data and other attributes inherited from nrvr.distros.common.kickstart.DistroKickstartFileContent:
- firstWordOfLineRegex = <_sre.SRE_Pattern object>
| |


Are you searching for an Iphone that doesn't cost you a fortune? Do
you want an XBOX or other gaming system? You have come to the right
place. Our app 'Silent Auction' lets you bid on multiple items and
if you have the highest bid you WIN!!.
Here are some examples of items that can be bid on!
IPhone 7 Plus
Current Bid: $120.00
60 min left
AirBuds
Current Bid: $30.00
35 min left
Air Jordans
Current Bid: $60.00
5 min left
Sellers
Do you have items that you no longer use. From clothes to phones and
so much more, our app 'Silent Auction' can help put some extra money
in your pocket. Simply upload your photos, add a description and set
the opening bid and you are on your way to making that extra cash.
Here are some examples of items that are being sold!


--- layout: post title: no title date: '2014-11-08T07:30:24+01:00' categories: - Character picture_url: https://film-Storyboards.tumblr.com/post/102088963372 ---


I have been doing outreach and popsci writings in China for several years. I am in collaboration with several Chinese magazines, publishing houses and online platforms for outreach works. Topics of my outreach are mainly on geoscience and GIS, but also include human geography, historical geography and others. My outreach works and interviews on Chinese media (ebooks excluded) have reached 5.5 million views since January 1st 2018 (no statistics available for view counts before that date). I have 160 thousand followers on Zhihu, the Chinese equivalent of Quora.
I have hosted live or recorded outreach talks on various online platforms in China on topics of geology, geography and map design. I have also been invited to talk in communities and local primary/secondary schools to popularize geoscience among general public and also have (co-)organized multiple workshops on GIS, social science research and web mapping in Michigan and Oklahoma.
Hometown: Chongqing, China
Languages: Mandarin Chinese, English
High School: Beijing No.4 High School
I am an indie songwriter in China.
Demos on 163 Cloud Music and Douban Musicians
Level 10 Piano Performing Certification (issued by Chinese Musicians Association, 2005).
Facebook | LinkedIn | Instagram | Zhihu


| Home | Libraries | People | FAQ | More |
#include <boost/math/tools/estrin.hpp>
namespace boost { namespace math { namespace tools { // Advanced interface: Use if you can preallocate a scratch buffer of size (coeffs.size() +1)/2: // The scratch buffer size is *unchecked* in release compiles, so use at your own risk! template<typename RandomAccessContainer1, typename RandomAccessContainer2, typename RealOrComplex> inline auto evaluate_polynomial_estrin(RandomAccessContainer1 const & coeffs, RandomAccessContainer2& scratch, RealOrComplex z); // Template specialization for std::array, no preallocation is necessary so massive performance improvements are typically observed: template <typename RealOrComplex1, size_t n, typename RealOrComplex2> inline RealOrComplex2 evaluate_polynomial_estrin(const std::array<RealOrComplex1, n> &coeffs, RealOrComplex2 z); }}} // namespaces
Boost.math provided free functions which evaluate polynomials by Estrin's method.
Though Estrin's method is not optimal from the standpoint of minimizing arithmetic
operations (that claim goes to Horner's method), it nonetheless is well-suited
to SIMD pipelines on modern CPUs. For example, on an 2022 M1 Pro, evaluating
a double precision polynomial of length N using Estrin's method with scratch
space takes 0.28 N nanoseconds for large N, whereas Horner's method takes 1.24
N ns. If you know your polynomial coefficients at compile time and can store
them in a std::array
, then Estrin's method is unconditionally
faster. If the coefficients are computed at runtime, then only for N roughly
greater than 90 is Estrin's method better. These numbers are highly dependent
on compiler flags and architecture; ensure the compiler is allowed to emit
vector instructions and fmas to take full advantage of the benefits of Estrin's
method.
To measure the performance on your system, refer to the google benchmark file
reporting/performance/estrin_performance.cpp
.
Note that Estrin's method is less accurate that Horner's method. Refer to
example/estrin_vs_horner_accuracy.cpp
for details.


This PWG face-to-face meeting will be held on August 17-19, 2021, only via Webex teleconference (Virtual F2F).
There is no registration fee or RSVP survey for this meeting.
Note:All times are Eastern Daylight Time (EDT) (UTC−04:00).
Discussions at PWG face-to-face meetings are covered by the PWG Policy on Intellectual Property and Confidentiality and the PWG Anti-Trust Policy.
| Date | Times | Description |
|---|---|---|
| August 17 | 10:00 AM to 10:45 AM | PWG Plenary |
| 10:45 AM to 11:15 AM | IPP WG : Status · IPP Encrypted Jobs and Documents v1.0 | |
| 11:15 AM to 12:00 PM | IPP WG : IPP Finishings v3.0 | |
| 12:00 PM to 12:45 PM | Break / Lunch | |
| 12:45 PM to 1:30 PM | IPP WG : IPP Production Printing Extensions v2.0 | |
| 1:30 PM to 2:15 PM | IPP WG : Evolution of IPP/2.0 and IPP Everywhere v2.0 | |
| August 18 | 10:00 AM to 10:30 AM | IPP WG : Linux Foundation OpenPrinting GSoC Status |
| 10:30 AM to 12:00 PM | IPP WG : IPP Driverless Printing Extensions v2.0 | |
| 12:00 PM to 12:45 PM | Break / Lunch | |
| 12:45 PM to 2:15 PM | IPP WG : IPP Enterprise Printing Extensions v2.0 | |
| August 19 | 10:00 AM to 12:00 PM | IDS WG : Status and Discussion · PWG Hardcopy Device Security Guidelines v1.0 |
| 12:00 PM to 12:45 PM | Break / Lunch | |
| 12:45 PM to 2:00 PM | IPP WG: 3D Printing Liaison: Status and Guidance | |
| 2:00 PM to 2:15 PM | IPP WG : Next Steps |


10 details you may have missed in this year’s White House Christmas decorations
by Ellen Cranley, Business Insider US- The White House is decked out for Christmas 2019, with several of its most iconic rooms decorated in the theme of “The Spirit of America.”
- The decorations pay homage to the first family, as well as states, military service members, and storied American holiday traditions.
- These are the details you might have missed in this year’s White House Christmas decorations.
- Visit Business Insider’s homepage for more stories.
First lady Melania Trump unveiled the 2019 White House Christmas decorations in several glittering rooms on Monday, keeping with the theme of “The Spirit of America.”
In keeping with tradition, the most storied rooms of the White House were filled with flowers, lights, and other objects that pay homage to the first lady’s personal projects, America’s greatest cities, and long-cherished holiday traditions.
See the smallest details you might have missed in this year’s White House Christmas decorations.
Along the sides of the hall stood acrylic panels showing off some of the country’s largest landmarks as “a timeline of American design, innovation, and architecture,” the White House said in a release.
Source: White House press pool report
An artificial Thanksgiving feast features several historically inspired holiday dishes, including turkey, fruit, and oranges pierced with cloves.
Source: Plimoth Plantation, Martha Stewart
A gingerbread model of the White House in the State Dining Room made for this year’s decorations weighs more than 300 lbs.
Source: White House press pool report
Other edible models of American landmarks include San Francisco’s Golden Gate Bridge, Seattle’s Space Needle, and Mount Rushmore.
Source: White House press pool report
Models of the Alamo, the Liberty Bell, the Statue of Liberty, and St. Louis’ Gateway Arch also graced the table to highlight “America the Beautiful,” the White House said.
Source: White House press pool report
A small tree featured tiny helicopters as the 2019 White House Christmas Ornament, which is a helicopter to honor former President Dwight D. Eisenhower.
Source: The White House Historical Association
The name of the first lady’s signature childhood wellbeing program was represented on a Scrabble-tile ornament featured in a wreath alongside dominos.
Source: White House press pool report, Business Insider
Trees made of playing cards and green leaves completed the Red Room’s games theme, which the White House said was inspired by the “childlike spirit we all have at this time of year.”
Source: White House press pool report
An advent calendar hung in a window of the Green Room provides visitors with a White House-themed Christmas countdown, complete with lights to mimic the North Portico.
Source: White House press pool report, White House Museum
The White House’s official tree that’s hosted in the Blue Room features a placard for all 50 states and their official flowers, CNN’s Kate Bennett reported.
Source: Twitter


 It was originally designed for historical and archaeological modelling, but can be used in a variety of contexts. Demographic data are based on Bagnall and Frier for Roman Egypt, and as a result this asusmes a Coale and Demeny style life table for empirical demography (fertility schedules, marriage eligibility, and death rates.)
The container for a given simulation is the World, which needs to be set up to contain at least one Community. The World also provides some pass-through access to the People contained in all Communities, as well as all Diaries (which record the events of individual lives) via a library. The World is where each year progresses for all people, resulting in deaths, marriages, moves, and births throughout all Communities.
Each Community is started with a given number of Persons and Houses, as well as core characteristics for the people (i.e. what their behaviors should be.) Communities are currently homogeneous to start with, but can become heterogeneous in behavior by migration (mobility) between different villages. The planned founders module will enable more heterogeneous starting configurations.
Persons are individual agents with an assigned sex who age and have the option to undergo major life events once each year, and in the process develop kinship networks (as well as growing up within them). Schedules like mortality and fertility schedules are stored in AgeTables. Persons can be related via birth or marriage as well as through residency in Houses, and these different types of relationships are explored through the kinship and residency modules. Houses are environmental and can only be affected by Persons. Persons (and eventually Houses) have their histories recorded in Diaries (defined in narrative).
-
class
main.
AgeTable
(ages, sex1, rates1, sex2, rates2)¶ Store age-specific annual rates of death, marriage, birth, etc.
AgeTables create a schedule of age- and sex- dependent annual rates of different phenomena, literally anything from marriage eligibility to death.
- ageslist
A list of ages to define the relevant intervals over which rates change. Each interval includes the lower bounds, such that each is defined by ages[i] <= x < ages[i+1].
- sex1, sex2Sex
The variables defining which rates correspond to which sex.
- rates1, rates2list
Annual chance of occurence for each interval. n.b. that len(rates) - len(ages) - 1
-
NullAgeTable
()¶ Define a null AgeTable.
-
get_rate
(sex, age)¶ Return the annual rate for a given sex and age.
- sexSex
The sex in the table to be consulted.
- ageint
The age of the individual. Must be within defined range of table.
- float
The rate for that age and sex.
-
class
main.
Community
(world, name, pop, area, startage, mortab, birthtab, marriagerule, inheritancerule, mobilityrule)¶ Communities are collections of Persons living in Houses.
Community is the coresidential living group of Persons who reside in Houses.
- worldWorld
The world in which this community will exist
- namestr
The name of the community
- popint
The initial population of the simulation.
- areaint
The number of houses in the community
- startageint
The age at which all persons in the simulation start. Corrected for by burn-in.
- mortabAgeTable
An AgeTable storing a Coale and Demeny-style mortality schedule for all people.
- birthtabAgeTable
AgeTable storing probability of giving birth once married by sex (0 for men)
- marriagerulebehavior.marriage.MarriageRule
This defines how spouses are found and where newlyweds move from behavior.marriage
- inheritancerulebehavior.inheritance.InheritanceRule
This defines the inheritance rule executed when a Person dies from behavior.inheritance.
- mobilityrulebehavior.mobility.MobilityRule
This defines the circumstances of mobility from households from behavior.mobility, or a custom function
- namestr
The name of the community
- has_worldWorld
The World this Community is a part of.
- houseslist of Houses
The houses of the community.
- peoplelist of Persons
The people who currently live in the community.
- thedeadlist of Person
List of all dead persons, still required for genealogy.
- mortabAgeTable
An AgeTable storing a mortality schedule for the community.
- birthtabAgeTable
An AgeTable storing probability of giving birth once married (0 for men)
- populationint
The current population of the community.
- areaint
Number of houses in the community.
- housingcapacityint
Total housing Capacity
-
update_stats
()¶ Update the statistics for the community at the end of each year.
-
class
main.
House
(maxpeople, has_community)¶ Creates a house in which Persons reside.
The House is an environmental object that doesn’t move but can be modified by Persons.
- maxpeopleint
Maximum number of residents before the house is considered crowded.
- has_communityCommunity
The Community in which this house was built
- maxpeopleint
Maximum number of residents before the house is crowded. Currently no repercussion for a crowded house.
- roomsint
Number of rooms in the house. An alternative way of thinking about space.
- has_communityCommunity
The Community in which this house was built.
- peoplelist of Person
List of the people who reside in the house.
- ownerPerson
The person who owns this house. Assumes single or primary ownership.
- addressstr
The name of the house, to make individuality clearer in narrative.
-
add_person
(tobeadded)¶ Add a person to the house.
- tobeaddedPerson
The person to be added to the residents of the house.
-
remove_person
(toberemoved)¶ Remove a person from the house.
- toberemovedPerson
The person to be removed from the residents of the house
-
class
main.
Person
(sex, age, has_community, has_house, marriagerule, inheritancerule, mobilityrule)¶ A representation of a human with a social structure and kinship.
Create a new Person in the Community.
- sexSex
The sex of the person assigned at creation.
- ageint
Age of the individual assigned at creation, then aging regularly.
- has_communityCommunity
The Community to which this individual belongs. Required because of founder problems.
- has_houseHouse
The house in which this individual resides.
- marriagerulebehavior.marriage.MarriageRule
The MarriageRule implemented by this agent.
- inheritancerulebehavior.inheritance.InheritanceRule
The InheritanceRule implemented by this agent each year.
- mobilityrulebehavior.mobility.MobilityRule
The MobilityRule implemented by this agent each year.
- namestr
The name of this individual. Used for narrative.
- sexidentity.Sex
The sex of the person assigned at creation.
- ageint
Age of the individual assigned at creation, then aging regularly.
- has_communityCommunity
The Community to which this individual belongs.
- has_houseHouse
The house in which this individual resides.
- lifestatusidentity.LifeStatus
Records whether the Person is dead or alive.
- marriagestatusidentity.MarriageStatus
The marriage status of the individual.
- has_parentslist of Person
The parents of this individual
- has_spouse{None, Person}
The spouse of this individual.
- has_childrenlist of Person
The children of this individual
- birthyearint
The year this individual was born.
- marriagerulebehavior.marriage.MarriageRule
The MarriageRule implemented by this agent.
- inheritancerulebehavior.inheritance.InheritanceRule
The InheritanceRule implemented by this agent each year.
- mobilityrulebehavior.mobility.MobilityRule
The MobilityRule implemented by this agent each year.
- diarynarrative.Diary
The diary of this individual that records life events.
-
birth
()¶ Determine whether this person gives birth.
This relies on the fertility schedule in self.has_community.birthtab to decide whether a married woman gives birth this year. If so, this method creates that child in the same house.
-
die
()¶ Check whether this Person dies or ages 1 year.
Checks the community mortality table for this individual. If the individual lives, they age one year. Otherwise, they die, inheritance takes place, and the Person is removed from the house.
-
leave_home
()¶ Determine whether this person leaves home through household mobility/fission/migration.
This runs the MobilityRule the person currently has.
-
marriage
()¶ Check whether this person gets married this timestep.
This step determines marriage eligibility, as well as finding potential candidates for marriage. All of this occurs through the MarriageRule.
-
class
main.
World
¶ The world of the simulation.
This contains Community objects and runs the clock.
- communitieslist of Community
All communities in the simulation.
- library: dict of Diary
The Diary objects for Persons and Houses in the simulation
- yearint
The current year. Incremented at the end of each simulation run.
- peoplelist of Persons
All living Persons currently in the simulation
- deadpeoplelist of Persons
All dead Persons in the simulation.
- houseslist of House
All Houses in all communities in the simulation.
-
add_community
(community)¶ Add a community to this World.
- communityCommunity
Community to add to World
-
add_diary
(diary)¶ Add a diary object to the library.
- diarynarrative.Diary
Diary to be added to the library
-
property
deadpeople
¶ List of dead people of all constitutent communities.
-
property
houses
¶ List of houses of all constitutent communities.
-
property
people
¶ List of people of all constitutent communities.
-
progress
()¶ Progress the world 1 time-step (year).
- The order of steps in the simulation follows this schedule:
randomize the order of persons,
death (and thereby inheritance),
mobility,
marriage,
birth, and
end the year.


|
upkeeper 1
|
information buddy returns. More...
#include <ctrl_protocol.h>
Data Fields | |
| bool | populated |
| pid_t | service_pid |
| pid_t | wait_pid |
| buddy_cmnd_t | command |
| buddy_runstate_t | desired_state |
| siginfo_t | siginfo |
| int | wait_status |
| time_t | timestamp |
| size_t | remaining |
| upk_uuid_t | uuid |
| size_t | slot_n |
| buddy_info_t * | next |
| _Bool | populated |
information buddy returns.
This is what buddy sends to controller.
last command handled by buddy
Referenced by buddy_readstate(), and buddy_record_state().
desired state of the buddy
Referenced by buddy_readstate(), and buddy_record_state().
pointer to next member in ringbuffer
Referenced by buddy_flush_ringbuffer(), buddy_free_ringbuffer(), buddy_init_ringbuffer(), buddy_start_proc(), buddy_zero_info(), and sa_sigaction_func().
| _Bool _buddy_info::populated |
this member is populated; used in ringbuffer
Referenced by buddy_flush_ringbuffer(), buddy_record_state(), and buddy_zero_info().
| _Bool _buddy_info::populated |
number of remaining messages to be sent from buddy
Referenced by buddy_flush_ringbuffer(), and buddy_readstate().
pid of the managed process
Referenced by buddy_readstate(), and buddy_record_state().
siginfo struct if available
Referenced by sa_sigaction_func().
used for diagnostics
Referenced by buddy_init_ringbuffer(), and buddy_zero_info().
timestamp
Referenced by buddy_readstate(), and buddy_record_state().
uuid of service managed by buddy
Referenced by buddy_readstate(), and buddy_record_state().
pid of the process just waited on, if applicable
Referenced by buddy_readstate(), and sa_sigaction_func().
wait status, if available
Referenced by buddy_readstate(), and sa_sigaction_func().


{% load static %}
Registration form
EnAble India
JP Morgan Code For Good Team 14
Registration form
{% if wrong_data %}
Passwords do not match
{% endif %}
{% csrf_token %}
Required Field
First Name
Last Name
User Name
Enter Email
Password
Confirm Password
Skype ID
Link to Facebook Profile
City
State
-- Select State --
Andaman and Nicobar Islands
Andhra Pradesh
Arunachal Pradesh
Assam
Bihar
Chandigarh
Chhattisgarh
Dadra and Nagar Haveli
Daman and Diu
Delhi
Goa
Gujarat
Haryana
Himachal Pradesh
Jammu and Kashmir
Jharkhand
Karnataka
Kerala
Lakshadweep
Madhya Pradesh
Maharashtra
Manipur
Meghalaya
Mizoram
Nagaland
Orissa
Pondicherry
Punjab
Rajasthan
Sikkim
Tamil Nadu
Tripura
Uttaranchal
Uttar Pradesh
West Bengal
Are You?
Mentor

Mentee
What you are using EnAble India for?
Personal Development
Learning
Get Job
Specialization


BFO_0000050 - part of
Label
part of
Editor preferred label
is part of
Sub property of
Definition
A core relation that holds between a part and its whole
Example
this day is part of this year (occurrent parthood)
my brain is part of my body (continuant parthood, two material entities)
my stomach cavity is part of my stomach (continuant parthood, immaterial entity is part of material entity)
Editor’s note
Everything is part of itself. Any part of any part of a thing is itself part of that thing. Two distinct things cannot be part of each other.
Parthood requires the part and the whole to have compatible classes: only an occurrent can be part of an occurrent; only a process can be part of a process; only a continuant can be part of a continuant; only an independent continuant can be part of an independent continuant; only an immaterial entity can be part of an immaterial entity; only a specifically dependent continuant can be part of a specifically dependent continuant; only a generically dependent continuant can be part of a generically dependent continuant. (This list is not exhaustive.)
A continuant cannot be part of an occurrent: use ‘participates in’. An occurrent cannot be part of a continuant: use ‘has participant’. A material entity cannot be part of an immaterial entity: use ‘has location’. A specifically dependent continuant cannot be part of an independent continuant: use ‘inheres in’. An independent continuant cannot be part of a specifically dependent continuant: use ‘bearer of’.
Occurrents are not subject to change and so parthood between occurrents holds for all the times that the part exists. Many continuants are subject to change, so parthood between continuants will only hold at certain times, but this is difficult to specify in OWL. See https://code.google.com/p/obo-relations/wiki/ROAndTime


BMW Group Owned Cars, Bikes From Rs. 2 Lakh, 1 Day Left To Bid
by Surendhar MA range of BMW vehicles including sedans, SUVs, crossovers and adventure motorcycles used by the brand are available for bidding
BMW India has announced open bidding for the company-owned vehicles and participants need to pay an entry fee of Rs. 3,000. It will be hosted at BMW Group Training Centre, Sector 75, Gurugram, Haryana. BMW has listed a range of models used by the brand itself.
It comprises of the luxury sedans like the 3-Series, 5-Series and 7-Series along with X1, X3, X4 and X5 SUVs.
The German auto major has also revealed the number of units of each model available. Two units of 3-Series, five units of 5-Series, four units of 7-Series, eight units of X1, six units of X3, two units of X4 and five units of X5.
As for the motorcycles, four units of G 310 R, four units of F 750 GS, four units of F 850 GS and six units of R 1250 GS Adv will be part of the process. The bidding dates are November 23 and 24 between 8 am and 5 pm. So, already one day has passed by.
BMW has mentioned that non-refundable deposit of Rs. 3,000 is applicable for each interested vehicle. Sticking by ‘As is where is’ basis, the company will sell the vehicles through its authorised dealerships present across the country and more information can be learned from the bidding form.
The sedans and SUVs/crossovers listed above are available in both petrol and diesel variants. While some of the vehicles are unregistered, others are already Haryana registered. BMW has revealed the colour, fuel type, odometer reading, production month and year, registration date (if any) as well as reserved pricing for each vehicle.
For instance, the BMW G 310 R has a reserved price of Rs. 2 lakh, F 750 GS at up to Rs. 9.25 lakh, F 850 GS at up to Rs. 10 lakh, R 1200 RS at Rs. 7.50 lakh, R 1250 GS Adv at up to Rs. 19 lakh, R 1250 GS at Rs. 17.50 lakh, and K 1600 B at Rs. 18.65 lakh.
Mini’s Cooper S Convertible and Countryman are also part of the bidding with reserved price starting from Rs. 20 lakh while 3-Series from as low as Rs. 34.50 lakh, 5-Series from Rs. 37 lakh, 7-Series from Rs. 72 lakh, X1 from Rs. 23 lakh, X3 from Rs. 38.50 lakh, X4 at Rs. 48 lakh, and X5 from Rs. 48.50 lakh. The performance-based M line of models like M2 Competition and M6 Gran Coupe are also available.