Bringing together real crusaders who have made a difference in their chosen life tracks to talk about their journeys and share their lessons.
Story-age
Giving everybody a chance to share their life story by building a global community of learners with no ‘intellectual discrimination.’
Online Content Aggregator
Packaging available public content including videos, online courses, articles, movies, book-pdfs, questions into neatly sorted boxes. Saving world’s time and effort in scrounging for the right resources.
Incubation Hotspot
Helping young people with ideas to get the right support, advice and funding, all through just an internet connection!
Free-for-all
Leveraging the world wide web, Learning Monk is proud to offer to offer unbiased content beyond the national borders throughout the world.
Authentic
The aggregated content and services that we offer include authentic verified details encompassing the latest research findings across different fields.
About
More about us and our backstory
Our Humble Beginnings
There’s no task more urgent than reimagining how our generation learns. Our schools are fast turning obsolete, leaving most of us unsatiated, while also draining the joy out of the process of education. We have a vision to make LM the next-big-thing on internet, a one stop destination for everyone to learn, meet and build things they are passionate about.
The birth of Platform
The platform will bring together a community of learners, experts, professionals, and incubators to facilitate education of life. And certainly, we cannot do it alone! We are inviting young people from all work areas and passions to co-create with us.
Future Plans...
This is no recruitment drive for potential employees, please do not expect monetary gains from your future involvement though you may gain benefits including monetary through creative legal methods. As a matter of fact, this is a movement in opposition to schools becoming teaching-shops.
PRESENT
Who we Want
Though we would be happy to welcome everybody, we are specifically looking for people with the skills of Web Development, Social Media Marketing, Content Management / Production, Networking - Communication Expansion, Graphic Designing, Course Development and Audiovisual Content Development.
We are two passionate individuals, confluence of technology and rebelliousness, wanting to disrupt the status quo in education. We realize how powerful the synergy of internet and education can be and have decided to build not another Open-Online-Course site, but a university on cloud. We are trying to revolutionize how learning is perceived, giving the mundane smart blackboard classroom a reincarnation, shattering walls which block our interaction with real world.
Contact Us
We would love to hear from you. Please use this form to share your thoughts / queries or just to say hello.
Project Name
Lorem ipsum dolor sit amet consectetur.
 Lorem ipsum dolor sit amet, consectetur adipisicing elit. Est blanditiis dolorem culpa incidunt minus dignissimos deserunt repellat aperiam quasi sunt officia expedita beatae cupiditate, maiores repudiandae, nostrum, reiciendis facere nemo!
Want these icons in this portfolio item sample?You can download 60 of them for free, courtesy of RoundIcons.com, or you can purchase the 1500 icon set here.
Date: July 2014
Client: Round Icons
Category: Graphic Design
Project Heading
Lorem ipsum dolor sit amet consectetur.
Startup Framework is a website builder for professionals. Startup Framework contains components and complex blocks (PSD+HTML Bootstrap themes and templates) which can easily be integrated into almost any design. All of these components are made in the same style, and can easily be integrated into projects, allowing you to create hundreds of solutions for your future projects.
Treehouse is a free PSD web template built by Mathavan Jaya. This is bright and spacious design perfect for people or startup companies looking to showcase their apps or other projects.
You can download the PSD template in this portfolio sample item at FreebiesXpress.com.
Project Name
Lorem ipsum dolor sit amet consectetur.
Start Bootstrap's Agency theme is based on Golden, a free PSD website template built by Mathavan Jaya. Golden is a modern and clean one page web template that was made exclusively for Best PSD Freebies. This template has a great portfolio, timeline, and meet your team sections that can be easily modified to fit your needs.
You can download the PSD template in this portfolio sample item at FreebiesXpress.com.
Project Name
Lorem ipsum dolor sit amet consectetur.
Escape is a free PSD web template built by Mathavan Jaya. Escape is a one page web template that was designed with agencies in mind. This template is ideal for those looking for a simple one page solution to describe your business and offer your services.
You can download the PSD template in this portfolio sample item at FreebiesXpress.com.
Project Name
Lorem ipsum dolor sit amet consectetur.
Dreams is a free PSD web template built by Mathavan Jaya. Dreams is a modern one page web template designed for almost any purpose. It’s a beautiful template that’s designed with the Bootstrap framework in mind.
You can download the PSD template in this portfolio sample item at FreebiesXpress.com.
Privacy Policy
We work to protect your privacy.
This privacy policy has been compiled to better serve those who are concerned with how their 'Personally Identifiable Information' (PII) is being used online. PII, as described in US privacy law and information security, is information that can be used on its own or with other information to identify, contact, or locate a single person, or to identify an individual in context. Please read our privacy policy carefully to get a clear understanding of how we collect, use, protect or otherwise handle your Personally Identifiable Information in accordance with our website.
What personal information do we collect from the people that visit our blog, website or app?
When ordering or registering on our site, as appropriate, you may be asked to enter your name, email address, mailing address, phone number or other details to help you with your experience.
When do we collect information?
We collect information from you when you register on our site, subscribe to a newsletter, fill out a form or enter information on our site.
How do we use your information?
We may use the information we collect from you when you register, make a purchase, sign up for our newsletter, respond to a survey or marketing communication, surf the website, or use certain other site features in the following ways:
1. To administer a contest, promotion, survey or other site feature.
2. To send periodic emails regarding your order or other products and services.
3. To follow up with them after correspondence (live chat, email or phone inquiries)
How do we protect your information?
We use regular Malware Scanning.
Your personal information is contained behind secured networks and is only accessible by a limited number of persons who have special access rights to such systems, and are required to keep the information confidential. In addition, all sensitive/credit information you supply is encrypted via Secure Socket Layer (SSL) technology.
We implement a variety of security measures when a user enters, submits, or accesses their information to maintain the safety of your personal information.
All transactions are processed through a gateway provider and are not stored or processed on our servers.
Do we use 'cookies'?
We do not use cookies for tracking purposes
You can choose to have your computer warn you each time a cookie is being sent, or you can choose to turn off all cookies. You do this through your browser settings. Since browser is a little different, look at your browser's Help Menu to learn the correct way to modify your cookies.
If you turn cookies off, some features will be disabled. that make your site experience more efficient and may not function properly.
However, you will still be able to place orders .
Third-party disclosure
We do not sell, trade, or otherwise transfer to outside parties your Personally Identifiable Information.
Third-party links
We do not include or offer third-party products or services on our website.
Google
Google's advertising requirements can be summed up by Google's Advertising Principles. They are put in place to provide a positive experience for users. https://support.google.com/adwordspolicy/answer/1316548?hl=en
We have not enabled Google AdSense on our site but we may do so in the future.
California Online Privacy Protection Act
CalOPPA is the first state law in the nation to require commercial websites and online services to post a privacy policy. The law's reach stretches well beyond California to require any person or company in the United States (and conceivably the world) that operates websites collecting Personally Identifiable Information from California consumers to post a conspicuous privacy policy on its website stating exactly the information being collected and those individuals or companies with whom it is being shared. - See more at: http://consumercal.org/california-online-privacy-protection-act-caloppa/#sthash.0FdRbT51.dpuf
According to CalOPPA, we agree to the following:
Users can visit our site anonymously.
Once this privacy policy is created, we will add a link to it on our home page or as a minimum, on the first significant page after entering our website.
Our Privacy Policy link includes the word 'Privacy' and can easily be found on the page specified above.
You will be notified of any Privacy Policy changes:
1. On our Privacy Policy Page
Can change your personal information:
1. By emailing us
How does our site handle Do Not Track signals?
We honor Do Not Track signals and Do Not Track, plant cookies, or use advertising when a Do Not Track (DNT) browser mechanism is in place.
Does our site allow third-party behavioral tracking?
It's also important to note that we do not allow third-party behavioral tracking
COPPA (Children Online Privacy Protection Act)
When it comes to the collection of personal information from children under the age of 13 years old, the Children's Online Privacy Protection Act (COPPA) puts parents in control. The Federal Trade Commission, United States' consumer protection agency, enforces the COPPA Rule, which spells out what operators of websites and online services must do to protect children's privacy and safety online.
We do not specifically market to children under the age of 13 years old.
Fair Information Practices
The Fair Information Practices Principles form the backbone of privacy law in the United States and the concepts they include have played a significant role in the development of data protection laws around the globe. Understanding the Fair Information Practice Principles and how they should be implemented is critical to comply with the various privacy laws that protect personal information.
In order to be in line with Fair Information Practices we will take the following responsive action, should a data breach occur:
We will notify you via email
ï Within 1 business day
We also agree to the Individual Redress Principle which requires that individuals have the right to legally pursue enforceable rights against data collectors and processors who fail to adhere to the law. This principle requires not only that individuals have enforceable rights against data users, but also that individuals have recourse to courts or government agencies to investigate and/or prosecute non-compliance by data processors.
CAN SPAM Act
The CAN-SPAM Act is a law that sets the rules for commercial email, establishes requirements for commercial messages, gives recipients the right to have emails stopped from being sent to them, and spells out tough penalties for violations.
We collect your email address in order to:
ï Send information, respond to inquiries, and/or other requests or questions
To be in accordance with CANSPAM, we agree to the following:
ï Not use false or misleading subjects or email addresses.
ï Identify the message as an advertisement in some reasonable way.
ï Include the physical address of our business or site headquarters.
ï Monitor third-party email marketing services for compliance, if one is used.
ï Honor opt-out/unsubscribe requests quickly.
ï Allow users to unsubscribe by using the link at the bottom of each email.
If at any time you would like to unsubscribe from receiving future emails, you can email us at
ï Follow the instructions at the bottom of each email.
and we will promptly remove you from ALL correspondence.
Contacting Us
If there are any questions regarding this privacy policy, you may contact us using the information below.
learningmonk.me
<EMAIL_ADDRESS>Last Edited on 2016-10-05


| PostgreSQL 9.6.15 Documentation | |||
|---|---|---|---|
| Prev | Up | Chapter 44. PL/Python - Python Procedural Language | Next |
The plpy module also provides the functions
| plpy.debug(msg, **kwargs) |
| plpy.log(msg, **kwargs) |
| plpy.info(msg, **kwargs) |
| plpy.notice(msg, **kwargs) |
| plpy.warning(msg, **kwargs) |
| plpy.error(msg, **kwargs) |
| plpy.fatal(msg, **kwargs) |
plpy.error
and plpy.fatal
actually raise a Python exception which, if uncaught, propagates out to
the calling query, causing the current transaction or subtransaction to
be aborted. raise plpy.Error(msg) and
raise plpy.Fatal(msg) are
equivalent to calling plpy.error(msg) and
plpy.fatal(msg), respectively but
the raise form does not allow passing keyword arguments.
The other functions only generate messages of different priority levels.
Whether messages of a particular priority are reported to the client,
written to the server log, or both is controlled by the
log_min_messages and
client_min_messages configuration
variables. See Chapter 19 for more information.
The msg argument is given as a positional argument. For backward compatibility, more than one positional argument can be given. In that case, the string representation of the tuple of positional arguments becomes the message reported to the client.
The following keyword-only arguments are accepted:
| detail |
| hint |
| sqlstate |
| schema_name |
| table_name |
| column_name |
| datatype_name |
| constraint_name |
CREATE FUNCTION raise_custom_exception() RETURNS void AS $$ plpy.error("custom exception message", detail="some info about exception", hint="hint for users") $$ LANGUAGE plpythonu; =# SELECT raise_custom_exception(); ERROR: plpy.Error: custom exception message DETAIL: some info about exception HINT: hint for users CONTEXT: Traceback (most recent call last): PL/Python function "raise_custom_exception", line 4, in <module> hint="hint for users") PL/Python function "raise_custom_exception"
Another set of utility functions are plpy.quote_literal(string), plpy.quote_nullable(string), and plpy.quote_ident(string). They are equivalent to the built-in quoting functions described in Section 9.4. They are useful when constructing ad-hoc queries. A PL/Python equivalent of dynamic SQL from Example 41-1 would be:
plpy.execute("UPDATE tbl SET %s = %s WHERE key = %s" % ( plpy.quote_ident(colname), plpy.quote_nullable(newvalue), plpy.quote_literal(keyvalue)))


Things
I wished I knew while doing my bachelor
- Geshan Manandhar
http://bit.ly/pc-bt
Geshan Manandhar
Quality and Maintenance Lead,
Namshi.com
@geshan
geshan.com.np
Prime College +2, Find me in the photo :)
There I am. It's the first batch (2003)
BIM 2007 (3rd Batch)
BIM 4th Semester Project (Who reached where?)
Why this talk?
To get more twitter followers?
To get more twitter followers? NO.
To get more visitors on my blog?
To get more visitors on my blog? NO.
It's about you
And how you can use your bachelor study to craft your tech career
In 2014 being a software developer is better than being a doctor
(in US)
- source:
BusinessInsider.com
1 million more (tech) jobs than students by 2020
(in US)
- source:
Code.org
Are you an information hungry student?
Or a marks hungry one?
A good balance between being information hungry and marks hungry will get you far
Things to consider when you select and do projects for bachelors
Do a marketable product as a project which has utility, and can be sold in future
How about Rent/Building Management System?
Back To Kathmandu, Nepal. A foreign employment information system.
Always use a project management system/tool, you can start with
Trello
or
Redmine
Using a source code version control system is a necessity, I prefer
Git
which is DVCS. Use
bitbucket
for hosting.
Write more specs and code than words on the report
For web projects, think in terms of APIs than user interface, consider
REST
with
JSON
. Think Mobile, try
Ionic
.
Weekly update to academic supervisor or lecturer.
Even presentation can be HTML, Javascript and CSS, like
Reveal.js
and
host
it
Continuity : If you contribute 1 hour per weekend for 2 years it's 100 hours for your project. Be consistent, focus.
Barter your working project with scholarship.
Why should scholarships always be given on academic performance?
Secrets of selecting a company and doing internship
Start early.
Try finding a company that will host you as in intern by end of 6
th
sem.
So start searching for one from 5
th
sem, surely not 7
th
sem.
Select a medium sized organization, not too big and not too small
College should assign academic supervisor and assessor for internship
Do requirement specs very well. If you can, follow
agile
methodology.
Do
not
reinvent the wheel.
Use
Open Source
software
Depending on the project, give high priority to using a framework (MVC) or a Content Management System (CMS).
4 years, one of the longest time you study. Use it well.
How to approach the job market.
College should perform career counseling session for each interested student,
Preferable at the middle of the course
Make a CV/resume that accentuates your skills
Focus on one language/framework/CMS,
have idea of the others.
Don't become jack of all master of none.
Start writing technical blog posts
Network and search for a job with commitment
Be prepared for coding challenges.
Interviews will be there, coding challenges will help you seal the deal.
Continuous Learning, technology changes fast.
Passion
matters.
Conclusion/Recap
Be informed of the latest technology, framework and other news in the tech/web dev industry.
Start a blog, make a Linked In profile. Have some good GitHub public activity.
Bachelor study is 4 years, utilize it to the fullest.
Passing exams is a must, just being able to program will not earn you a degree.
Use academic projects to build a ladder to a great internship project.
Exploit your internship opportunity to land your first job.
Focus on a language or framework or CMS, don't try to learn everything.
Learning is a continuous process even after you get a job.
Suggestion : Pursue a Master after working for 2-3 years.
Questions???
Credits
https://www.flickr.com/photos/62244271@N03/8553590682/sizes/l
https://www.flickr.com/photos/dhammza/577671123/sizes/o/
https://www.flickr.com/photos/nathangibbs/98592171/sizes/l
https://www.flickr.com/photos/laughingsquid/5301017657/sizes/l
http://www.pptbackgrounds.net/increasing-performance-graph-backgrounds.html
https://www.flickr.com/photos/hhayk/8505539467/sizes/l
https://www.flickr.com/photos/mpp_flr/7892904178/sizes/l
https://www.flickr.com/photos/107198933@N02/10589586074/sizes/k/
http://tagcrowd.com/ - to generate the tag cloud/
https://www.flickr.com/photos/86429392@N03/7975354658/sizes/h/
http://socialmediaimpact.com/wp-content/uploads/2013/10/calendar-a52b4f1d4d18c566eeb37c14a008d66c.jpg
GitHub.com
Credits2
http://jerseygeeks.blogspot.ae/2013/02/how-to-get-programming-experience-when.html
http://myweightlossexperiment.wordpress.com/weekly-weight-loss-chart-of-progress/
https://www.flickr.com/photos/torek/14421164021/sizes/l
http://www.outsidethebeltway.com/what-breach-of-national-security/
https://www.flickr.com/photos/66539915@N03/6274989251/sizes/l
http://www.discprofiles.com/blog/wp-content/uploads/2012/12/meeting-iStock.jpg
http://opensource.org/files/OSI-Affiliates-April-2012.gif
http://greatlakesvoice.com/blog/common-interview-mistakes-job-candidates-make/
http://urbantips.wordpress.com/2012/04/03/im-bringing-back-the-barter-system/
https://www.flickr.com/photos/odgersdesign/4623902675/sizes/l
https://www.flickr.com/photos/patrick999/502722535/sizes/l
https://www.flickr.com/photos/zeldman/14538663789/sizes/l
Credits 3
https://www.flickr.com/photos/anned/8700093610/sizes/l
https://www.flickr.com/photos/oberazzi/318947873/sizes/l
https://www.flickr.com/photos/wazari/8283709193/sizes/l
https://www.flickr.com/photos/30093796@N07/10793050886/sizes/l
https://www.flickr.com/photos/30093796@N07/10793050886/sizes/l
http://www.mysansar.com/2014/08/14315/
http://www.pahilopost.com/content/-257.html
http://www.edudemic.com/wp-content/uploads/2013/09/twitter-wallpaper.jpg
http://code.org/promote
http://www.smu.ca/campus-life/career-services.html
Some Links
Main Git site
Github - free public git hosting
BitBucket - free private git hosting
Trello - Easy project management system.
Redmine Hosted - Full project management system
PHPStorm Free Academic License
Drupal - A CMS built in PHP
Symfony - A MVC Framework build in PHP
Angular Js - HTML enhanced for web apps! Javascript Framework
Node Js - Platform for easily building fast, scalable network applications. with Javascript
Ionic Framework - Front-end framework for developing hybrid mobile apps with HTML5
Feedly - A very good RSS reader
Some programming mantras to remember.


About Me
Full-Stack web developer with an Executive MBA and leadership experience at post-secondary institutions.
Completing a certificate in full-stack web development from the University of Toronto School of Continuing
Studies (August 2021). A versatile and dependable individual who loves learning, problem-solving, and advancing
team and client goals. Known for providing sound judgment, having attention for detail and a passion for
leveraging technology to improve lives. I am based out of Burlington, Ontario.


Reading “Harmony: Towards Automated Self-Adaptive Consistency in Cloud Storage”
H.-E. Chihoub, S. Ibrahim, G. Antoniu, and M. S. Perez, “Harmony: Towards automated self-adaptive consistency in cl...
H.-E. Chihoub, S. Ibrahim, G. Antoniu, and M. S. Perez, “Harmony: Towards automated self-adaptive consistency in cl...
D. Bermbach, M. Klems, S. Tai, and M. Menzel, “Metastorage: A federated cloud storage system to manage consistency-...
As I’ve dug into my distributed systems research, one question keeps coming up:“How do you visualize distributed syst...
Recently my research crew (since we’re all in different research groups) has become interested in the possibility of ...
Once again I’ve made a very difficult and also very exciting choice to switch my research topic away from case based ...
Evolutionary Design of Swarms (SSCI 2014) from Benjamin Bengfort In December, I attended IEEE SSCI 2014 - a sympo...
An analysis of key players in a large and small email network.In the age of social networks, it is very popular t...
Tableau Dashboard Visualizing Traffic IncidentsIn the State of Maryland, the State Highway Administration (MDSHA)...
Researchers at the University of Maryland explore practical AI with Baxter RobotsIn April 2014, researchers at th...
Hadoop is the standard tool for distributed computing across really large data sets and is the reason why you see “Bi...
J. C. Corbett, J. Dean, M. Epstein, A. Fikes, C. Frost, J. J. Furman, S. Ghemawat, A. Gubarev, C. Heiser, P. Hochsc...
S. Ghemawat, H. Gobioff, and S.-T. Leung, “The Google file system,” in ACM SIGOPS Operating Systems Review, 2003, v...
Managing the reading of scientific papers is a challenge that most graduate students face because, let’s face it, sci...
I wanted to write a quick post today about a task that most of us do routinely but often think very little about - lo...
Consumers rely on the collective intelligence of other consumers to protect themselves from coffee pots that break at...
Developing in Python is very different from developing in other languages. Python is an interpreted language like Rub...
Entity Resolution is becoming an important discipline in Computer Scienceand in Big Data especially with the recent r...
Mixed-initiative systems combine the efforts of human actors with artificial agents to improve the performance of bot...
Hi, I’m Ben. Today, for the fourth time, I’m starting over on my PhD. I’vemoved into my office in A.V. Williams, and ...


{% extends "area51/base.html" %} {% load staticfiles %} {% block content %} {% if user.is_superuser %}
No open events yet.
No completed/checked events yet.
You don't have any events yet.


Home
Chat ♥!
CHAT
QUERY
To get answers to your queries about corona.
Click Here!
DIET
To get a perfect diet recommendation for you.
Click Here!


An open-source 3D rendering web app to render confocal and focus-ion beam electron microscope images.
Volume rendering methods can be used when the interior of a 3D object needs to be displayed.
Surface rendering methods can be used when just the outer contour of a 3D object has to be properly depicted.
Tri-planar rendering methods can be used when user wants to visualize 3D data in three cross-sectional planes.
The 3D MPR tool is capable of reconstructing images in any plane (oblique).


{% extends "layout.html" %} {% block page_title %} Home Office - Visa and Immigration {% endblock %} {% block content %} {% include "includes/phase_banner_alpha.html" %} {% include "includes/breadcrumb_notifying_1.html" %} Tier 4 (General) student Thank you, that's it for now {% endblock %}
Tier 4 (General) student


The majority of my paid employment work cannot be released due to Non-Disclosure Agreements. However, I have pursued a number of side projects and document them here, and keep my code on github. The following posts are a combination of descriptions of these projects as well as nice place to store some of my thoughts on other topics.


The 23-year-old victim, whose name and hometown have not been publicly released, was bitten while diving in Magdalena Bay, located near Baja California Sur off northwestern Mexico, according to the Mexican Navy.
The man was able to swim on his own back to his charter boat in the Pacific near San Carlos and call for help, officials said.
FLORIDA MAN JUMPS OFF SURFBOARD, LANDS ON SHARK AT 'SHARK BITE CAPITAL OF THE WORLD'
The navy sent a boat to retrieve the man and took him to a local hospital for treatment. His injury was not considered life-threatening.
Officials didn’t release any information on the species of shark involved in the attack.
Shark attacks in Mexico have been seen as relatively uncommon. There have been at least 39 confirmed unprovoked shark attacks in Mexico since 1907, according to the Florida Museum’s International Shark File.
CLICK HERE FOR THE FOX NEWS APP
The southern state of Guerrero ranked first on the list with 11 confirmed reports, followed by Veracruz with nine and Quintana Roo with eight, according to the data.
Baja California Sur was listed fifth, with two attacks.
The Associated Press contributed to this report.


CrimPapers
Articles published on 5 September 2020
On 5 September 2020, 7 new articles were published in 6 journals.
Exploring the Removal of Online Child Sexual Abuse Material in the Uk: Processes and Practice
Evaluation of A Statewide Implementation of Fathers For Change: A Fathering Intervention For Families Impacted By Partner Violence
Role Variations and Perceptions of Campus Police Versus Local and State Law Enforcement
A Trifactorial Model of Detection of Deception Using Thermography by G. Gálvez-García, J. Fernández-Gómez, C. Bascour-Sandoval, J. Albayay, J. J. González-Quiñones, A. Moliné, R. Pérez-Luco, A. Boso, E. Gómez-Milán
The Naxalite Movement: Review From A Personal Perspective by Dipak K. Gupta
Sexual Assault Survivors’ Perceived Helpfulness of University-Affiliated Resources by Amy C. Graham, R. Kevin Mallinson, Jenna R. Krall, Sandra L. Annan
Poly-Victimization Among Female College Students: Are the Risk Factors the Same As Those Who Experience One Type of Victimization? by Jamie A. Snyder, Heidi L. Scherer, Bonnie S. Fisher


public class Polygon extends Object implements Shape, Serializable
Polygon
class encapsulates a description of a
closed, two-dimensional region within a coordinate space. This
region is bounded by an arbitrary number of line segments, each of
which is one side of the polygon. Internally, a polygon
comprises of a list of (x,y)
coordinate pairs, where each pair defines a vertex of the
polygon, and two successive pairs are the endpoints of a
line that is a side of the polygon. The first and final
pairs of (x,y)
points are joined by a line segment
that closes the polygon. This Polygon
is defined with
an even-odd winding rule. See
WIND_EVEN_ODD
for a definition of the even-odd winding rule.
This class's hit-testing methods, which include the
contains
, intersects
and inside
methods, use the insideness definition described in the
Shape
class comments.Shape
,
Serialized Form| Modifier and Type | Field and Description |
|---|---|
protected Rectangle |
bounds
The bounds of this
Polygon . |
int |
npoints
The total number of points.
|
int[] |
xpoints
The array of X coordinates.
|
int[] |
ypoints
The array of Y coordinates.
|
| Constructor and Description |
|---|
Polygon()
Creates an empty polygon.
|
Polygon(int[] xpoints,
int[] ypoints,
int npoints)
Constructs and initializes a
Polygon from the specified
parameters. |
| Modifier and Type | Method and Description |
|---|---|
void |
addPoint(int x,
int y)
Appends the specified coordinates to this
Polygon . |
boolean |
contains(double x,
double y)
Tests if the specified coordinates are inside the boundary of the
Shape , as described by the
definition of insideness. |
boolean |
contains(double x,
double y,
double w,
double h)
Tests if the interior of the
Shape entirely contains
the specified rectangular area. |
boolean |
contains(int x,
int y)
Determines whether the specified coordinates are inside this
Polygon . |
boolean |
contains(Point p)
Determines whether the specified
Point is inside this
Polygon . |
boolean |
contains(Point2D p)
Tests if a specified
Point2D is inside the boundary
of the Shape , as described by the
definition of insideness. |
boolean |
contains(Rectangle2D r)
Tests if the interior of the
Shape entirely contains the
specified Rectangle2D . |
Rectangle |
getBoundingBox()
Deprecated.
As of JDK version 1.1,
replaced by
getBounds() . |
Rectangle |
getBounds()
Gets the bounding box of this
Polygon . |
Rectangle2D |
getBounds2D()
Returns a high precision and more accurate bounding box of
the
Shape than the getBounds method. |
PathIterator |
getPathIterator(AffineTransform at)
Returns an iterator object that iterates along the boundary of this
Polygon and provides access to the geometry
of the outline of this Polygon . |
PathIterator |
getPathIterator(AffineTransform at,
double flatness)
Returns an iterator object that iterates along the boundary of
the
Shape and provides access to the geometry of the
outline of the Shape . |
boolean |
inside(int x,
int y)
Deprecated.
As of JDK version 1.1,
replaced by
contains(int, int) . |
boolean |
intersects(double x,
double y,
double w,
double h)
Tests if the interior of the
Shape intersects the
interior of a specified rectangular area. |
boolean |
intersects(Rectangle2D r)
Tests if the interior of the
Shape intersects the
interior of a specified Rectangle2D . |
void |
invalidate()
Invalidates or flushes any internally-cached data that depends
on the vertex coordinates of this
Polygon . |
void |
reset()
Resets this
Polygon object to an empty polygon. |
void |
translate(int deltaX,
int deltaY)
Translates the vertices of the
Polygon by
deltaX along the x axis and by
deltaY along the y axis. |
public int npoints
npoints
represents the number of valid points in this Polygon
and might be less than the number of elements in
xpoints
or ypoints
.
This value can be NULL.addPoint(int, int)
public int[] xpoints
Polygon
. The extra elements allow new points
to be added to this Polygon
without re-creating this
array. The value of npoints
is equal to the
number of valid points in this Polygon
.addPoint(int, int)
public int[] ypoints
Polygon
. The extra elements allow new points
to be added to this Polygon
without re-creating this
array. The value of npoints
is equal to the
number of valid points in this Polygon
.addPoint(int, int)
protected Rectangle bounds
Polygon
.
This value can be null.getBoundingBox()
,
getBounds()
public Polygon()
public Polygon(int[] xpoints, int[] ypoints, int npoints)
Polygon
from the specified
parameters.xpoints
- an array of X coordinatesypoints
- an array of Y coordinatesnpoints
- the total number of points in the
Polygon
NegativeArraySizeException
- if the value of
npoints
is negative.IndexOutOfBoundsException
- if npoints
is
greater than the length of xpoints
or the length of ypoints
.NullPointerException
- if xpoints
or
ypoints
is null
.public void reset()
Polygon
object to an empty polygon.
The coordinate arrays and the data in them are left untouched
but the number of points is reset to zero to mark the old
vertex data as invalid and to start accumulating new vertex
data at the beginning.
All internally-cached data relating to the old vertices
are discarded.
Note that since the coordinate arrays from before the reset
are reused, creating a new empty Polygon
might
be more memory efficient than resetting the current one if
the number of vertices in the new polygon data is significantly
smaller than the number of vertices in the data from before the
reset.invalidate()
public void invalidate()
Polygon
.
This method should be called after any direct manipulation
of the coordinates in the xpoints
or
ypoints
arrays to avoid inconsistent results
from methods such as getBounds
or contains
that might cache data from earlier computations relating to
the vertex coordinates.getBounds()
public void translate(int deltaX, int deltaY)
Polygon
by
deltaX
along the x axis and by
deltaY
along the y axis.deltaX
- the amount to translate along the X axisdeltaY
- the amount to translate along the Y axispublic void addPoint(int x, int y)
Polygon
.
If an operation that calculates the bounding box of this
Polygon
has already been performed, such as
getBounds
or contains
, then this
method updates the bounding box.
x
- the specified X coordinatey
- the specified Y coordinategetBounds()
,
contains(java.awt.Point)
public Rectangle getBounds()
Polygon
.
The bounding box is the smallest Rectangle
whose
sides are parallel to the x and y axes of the
coordinate space, and can completely contain the Polygon
.getBounds
in interface Shape
Rectangle
that defines the bounds of this
Polygon
.Shape.getBounds2D()
@Deprecated public Rectangle getBoundingBox()
getBounds()
.Polygon
.Polygon
.public boolean contains(Point p)
Point
is inside this
Polygon
.p
- the specified Point
to be testedtrue
if the Polygon
contains the
Point
; false
otherwise.contains(double, double)
public boolean contains(int x, int y)
Polygon
.
x
- the specified X coordinate to be testedy
- the specified Y coordinate to be testedtrue
if this Polygon
contains
the specified coordinates (x,y)
;
false
otherwise.contains(double, double)
@Deprecated public boolean inside(int x, int y)
contains(int, int)
.Polygon
.x
- the specified X coordinate to be testedy
- the specified Y coordinate to be testedtrue
if this Polygon
contains
the specified coordinates (x,y)
;
false
otherwise.contains(double, double)
public Rectangle2D getBounds2D()
Shape
than the getBounds
method.
Note that there is no guarantee that the returned
Rectangle2D
is the smallest bounding box that encloses
the Shape
, only that the Shape
lies
entirely within the indicated Rectangle2D
. The
bounding box returned by this method is usually tighter than that
returned by the getBounds
method and never fails due
to overflow problems since the return value can be an instance of
the Rectangle2D
that uses double precision values to
store the dimensions.
Note that the
definition of insideness can lead to situations where points
on the defining outline of the shape
may not be considered
contained in the returned bounds
object, but only in cases
where those points are also not considered contained in the original
shape
.
If a point
is inside the shape
according to the
contains(point)
method, then it must
be inside the returned Rectangle2D
bounds object according
to the contains(point)
method of the
bounds
. Specifically:
shape.contains(p)
requires bounds.contains(p)
If a point
is not inside the shape
, then it might
still be contained in the bounds
object:
bounds.contains(p)
does not imply shape.contains(p)
getBounds2D
in interface Shape
Rectangle2D
that is a
high-precision bounding box of the Shape
.Shape.getBounds()
public boolean contains(double x, double y)
Shape
, as described by the
definition of insideness.public boolean contains(Point2D p)
Point2D
is inside the boundary
of the Shape
, as described by the
definition of insideness.public boolean intersects(double x, double y, double w, double h)
Shape
intersects the
interior of a specified rectangular area.
The rectangular area is considered to intersect the Shape
if any point is contained in both the interior of the
Shape
and the specified rectangular area.
The Shape.intersects()
method allows a Shape
implementation to conservatively return true
when:
Shape
intersect, but
Shapes
this method might
return true
even though the rectangular area does not
intersect the Shape
.
The Area
class performs
more accurate computations of geometric intersection than most
Shape
objects and therefore can be used if a more precise
answer is required.intersects
in interface Shape
x
- the X coordinate of the upper-left corner
of the specified rectangular areay
- the Y coordinate of the upper-left corner
of the specified rectangular areaw
- the width of the specified rectangular areah
- the height of the specified rectangular areatrue
if the interior of the Shape
and
the interior of the rectangular area intersect, or are
both highly likely to intersect and intersection calculations
would be too expensive to perform; false
otherwise.Area
public boolean intersects(Rectangle2D r)
Shape
intersects the
interior of a specified Rectangle2D
.
The Shape.intersects()
method allows a Shape
implementation to conservatively return true
when:
Rectangle2D
and the
Shape
intersect, but
Shapes
this method might
return true
even though the Rectangle2D
does not
intersect the Shape
.
The Area
class performs
more accurate computations of geometric intersection than most
Shape
objects and therefore can be used if a more precise
answer is required.intersects
in interface Shape
r
- the specified Rectangle2D
true
if the interior of the Shape
and
the interior of the specified Rectangle2D
intersect, or are both highly likely to intersect and intersection
calculations would be too expensive to perform; false
otherwise.Shape.intersects(double, double, double, double)
public boolean contains(double x, double y, double w, double h)
Shape
entirely contains
the specified rectangular area. All coordinates that lie inside
the rectangular area must lie within the Shape
for the
entire rectangular area to be considered contained within the
Shape
.
The Shape.contains()
method allows a Shape
implementation to conservatively return false
when:
intersect
method returns true
and
Shape
entirely contains the rectangular area are
prohibitively expensive.
Shapes
this method might
return false
even though the Shape
contains
the rectangular area.
The Area
class performs
more accurate geometric computations than most
Shape
objects and therefore can be used if a more precise
answer is required.contains
in interface Shape
x
- the X coordinate of the upper-left corner
of the specified rectangular areay
- the Y coordinate of the upper-left corner
of the specified rectangular areaw
- the width of the specified rectangular areah
- the height of the specified rectangular areatrue
if the interior of the Shape
entirely contains the specified rectangular area;
false
otherwise or, if the Shape
contains the rectangular area and the
intersects
method returns true
and the containment calculations would be too expensive to
perform.Area
,
Shape.intersects(double, double, double, double)
public boolean contains(Rectangle2D r)
Shape
entirely contains the
specified Rectangle2D
.
The Shape.contains()
method allows a Shape
implementation to conservatively return false
when:
intersect
method returns true
and
Shape
entirely contains the Rectangle2D
are prohibitively expensive.
Shapes
this method might
return false
even though the Shape
contains
the Rectangle2D
.
The Area
class performs
more accurate geometric computations than most
Shape
objects and therefore can be used if a more precise
answer is required.contains
in interface Shape
r
- The specified Rectangle2D
true
if the interior of the Shape
entirely contains the Rectangle2D
;
false
otherwise or, if the Shape
contains the Rectangle2D
and the
intersects
method returns true
and the containment calculations would be too expensive to
perform.Shape.contains(double, double, double, double)
public PathIterator getPathIterator(AffineTransform at)
Polygon
and provides access to the geometry
of the outline of this Polygon
. An optional
AffineTransform
can be specified so that the coordinates
returned in the iteration are transformed accordingly.getPathIterator
in interface Shape
at
- an optional AffineTransform
to be applied to the
coordinates as they are returned in the iteration, or
null
if untransformed coordinates are desiredPathIterator
object that provides access to the
geometry of this Polygon
.public PathIterator getPathIterator(AffineTransform at, double flatness)
Shape
and provides access to the geometry of the
outline of the Shape
. Only SEG_MOVETO, SEG_LINETO, and
SEG_CLOSE point types are returned by the iterator.
Since polygons are already flat, the flatness
parameter
is ignored. An optional AffineTransform
can be specified
in which case the coordinates returned in the iteration are transformed
accordingly.getPathIterator
in interface Shape
at
- an optional AffineTransform
to be applied to the
coordinates as they are returned in the iteration, or
null
if untransformed coordinates are desiredflatness
- the maximum amount that the control points
for a given curve can vary from colinear before a subdivided
curve is replaced by a straight line connecting the
endpoints. Since polygons are already flat the
flatness
parameter is ignored.PathIterator
object that provides access to the
Shape
object's geometry.Dracula Javadoc Sample, Made with Allan Im.


--- title: Repo ---
Your browser should automatically redirect you to the project GitHub repository after a few moments. If it does not, you may continue manually.


Dec is taller than Ant for the first time as he jokes about first kiss on I'm A Celeb
The legendary TV duo sent viewers into hysterics as Ant mocked Dec's height and hilariously recreated his first kiss by giving him a boost
by Tiffany WallisAnt McPartlin left I’m A Celebrity viewers in stitches last night after he joked about Dec Donnelly 's height and picked him up to recreate his first kiss.
The legendary TV duo have made jokes about their heights repeatedly throughout their career, especially while filming down under in the Australian Outback.
During last night's episode of I'm A Celebrity...Get Me Out Of Here! Dec's height was once again the subject of the joke as the Brit presenting favourites reminisced about Dec's first kiss in a lift.
Earlier in the show, Girls Aloud star Nadine opened up about her first kiss to an Irish lad from school, Arsenal legend Ian confessed he felt like he was "in a trance" after his first lock of lips, while Cliff Parisi said his first kiss was in a lift.
Ant, 44, then mocked Dec's first kiss after he cheekily divulged juicy details about his best friend's first kiss and admitted he was witness to the encounter.
He revealed: "There is a coincidence there though because your first kiss was in a lift wasn't it Dec?
"I remember because I nearly broke my back lifting you up to reach that girl, but I did it!"
Dec, 44, continued the joke by confessing: "You only had to do it once then I bought a step ladder and we didn't need you and we could kiss in peace."
After announcing the next trial, Dec joked: "Everybody needs a lift sometimes."
Ant finished by hilariously saying: "Want another one for old times sake?!"
Dec smirked as Ant lifted up his co-star in a hilarious embrace and squeezed him tightly.
Their sweet embrace was captured with a fun Instagram snap and showed Dec as slightly taller than Ant for the first time ever.
They posted the photo with the caption: "We all need someone that lifts us up," and fans instantly rushed to the comment section to comment on their friendship.
One wrote: "Ant picking up Dec!!!" followed by a series of laughing face emojis.
While another shared: "Ant lifting Dec is the cutest thing I’ve ever seen in my life."

Dec's height is thought to be approximately 5ft 5 ½in, while Ant's height is around 5ft 9in.
Gags about height have never been far from I’m A Celebrity, with Ant and Dec describing 2017 contestant Dennis Wise as ‘a very small man’, even though he is actually 5ft 6.
All of which was ultimately settled when Dennis was voted out of the jungle – and was revealed to actually be taller than Dec.
*I’m A Celebrity continues tonight on ITV at 9pm.


I graduated from Indiana University. I majored in Accounting and Finance. I enjoy playing soccer and golf. My favorite thing to do is go out with my friends. I enjoy learning to code.


Returns (1) slot definition and (2) slot name.
(defun slot-def-and-name (class slot-name-or-def)
"Returns (1) slot definition and (2) slot name."
#+lispworks(values (find slot-name-or-def (class-slots class)
:key #'slot-definition-name)
slot-name-or-def)
#-lispworks(values slot-name-or-def
(slot-definition-name slot-name-or-def)))
Source Context


WSO2 Storage Server conveniently delivers multi-tenant structured and unstructured data storage to development projects. Development teams can rapidly provision and access secure and scalable relational, NoSQL Columnar, and Hadoop Distributed File System (HDFS) repositories using a consistent management process. The WSO2 Storage Server management console allows teams to create Databases, add users, and provision access based on the web application’s database policies.
Our cloud-aware WSO2 Storage Server supports elastic scalability, on-demand self-service provisioning, and consumption based pricing models. The server publishes usage data to WSO2 Business Activity Monitor and enables advanced analytics, monitoring, and billing.
WSO2 Storage Server 1.6.0 is developed on top of the revolutionary Carbon platform (Middleware a' la carte), and is based on the OSGi framework to achieve the better modularity for your SOA architecture. This also contains a lots of new features and many other optional components to customize the behavior of the server. Further, if you do not want any of the built in features, you can uninstall those features without any trouble. In other words, this Storage Server can be customized to your SOA needs.
WSO2 Carbon is a component based Enterprise SOA platform. The design of WSO2 Carbon focuses on separating the key functionality of the SOA platform into separate pluggable Carbon components that can be mixed and matched, like customizable building blocks. This allows you to add only the functionality you need to start up, and continue to add product capabilities as your requirements grow. This helps a business to quickly adapt to changes.
OSGi is used as the underlying core modularization technology to build the Carbon platform. The Carbon framework is shipped with Eclipse Equinox by default, but can be supported on Spring dm Server, Felix or Knoplerfish if required. The OSGi technology even allows you to write your business functionality as an OSGi component and deploy it in the existing Carbon platform.
For a quick start on using the WSO2 Carbon platform, the Carbon components are pre-assembled into a set of products.
You can assemble your own products by combining components and deploying them in a preferred architecture.
The WSO2 Carbon platform gives maximum flexibility to adapt the middleware to your enterprise architecture, rather than adapt your architecture to the middleware.
WSO2 is a Open Source technology company building Open Source middleware platforms for Web services and SOA. WSO2 delivers integrated middleware stacks based on components developed at Apache, offering industry leading performance and convenience for customers.
Founded in August 2005 by pioneers in Web services and Open Source, WSO2 engineers contribute heavily to many key Apache Web services projects.
Subscribe to the WSO2 newsletter - project updates, events, articles, SOA news and much more.


Private and Public properties, Convention, Closures
- more practical information in 5.private-public-props.js file.Private and Public Properties
All the methodes and properties of objects are public in definition, but we sometimes want and can make them private. It is connected with encapsulation of data.
Hiding Data.
We have two methodes to hide data of our objects. One is Convention and the second one is the usage of the Closures.
Convention.
The mechanism do not really hides the data but informs the programmers that the data are private so do not change them directky inside the object.
Closures usage.
That is the second method of hiding object data by using closures of data in methodes/functions. If the interface is created we can use our property which won't exists when the interface - our class will be erased. Need to remember that methodes used to get or set private datas need to be created inside the Constructor not the Prototype.


meetBike
LogIn
Register
Register
LogIn
menu
Riding is in our veins
Check up the categories
Categories
Shop
Routes with people
Popular posts
location_on
Routes with people
Here we're gonna have the popular post of this thing
credit_card
Shop
Here we're gonna have the popular post of this thing


| Attributes |
| Name | Required | Request-time | Type | Description |
| autoHide | no | true | java.lang.String | Types of messages to auto hide after display: "true" (auto hide all messages), "false" (don't auto hide any message), "info", "warn", "error", or "fatal" (auto hide messages at or below specified severity.) Default = 'true'. |
| binding | no | true | javax.el.ValueExpression | Using an EL expression, bind the component reference to a bean property, so that the component may be accessed in the bean. |
| closeAll | no | true | boolean | Whether or not the close-all button should be used when more than one notification appears on the screen. (Close visible messages only, not hidden messages.) Default = 'true'. |
| displayDuration | no | true | int | The lifespan (milliseconds) of an auto-hide message on the screen. Default = '3000'. |
| escape | no | true | boolean | Flag indicating that characters that are sensitive in HTML and XML markup must be escaped. Note: setting this to false may open up security issues. See XSS (Cross Site Scripting) Prevention Cheat Sheet. Default = 'true'. |
| for | no | true | java.lang.String | Identifier of the component for which to render error messages. If this component is within the same NamingContainer as the target component, this must be the component identifier. Otherwise, it must be an absolute component identifier (starting with ":"). Leave out or use "@all" to output global messages. |
| globalOnly | no | true | boolean | Flag indicating whether only global messages (that is, messages with no associated client identifier) should be rendered. Mutually exclusive with the 'for' property which takes precedence. Default = 'false'. |
| header | no | true | java.lang.String | Header to prefix a message. Default = ''. |
| hideEffectDuration | no | true | java.lang.String | Duration (also called "speed" in jQuery) of hide effect. Values and default same as for showEffectDuration. Default = '_default'. |
| id | no | true | java.lang.String | The component identifier for this component. This value must be unique within the closest parent component that is a naming container. |
| maxVisibleMessages | no | true | int | Limit the number of messages appearing at a given time to this number. Default is 0, no limit. Default = '0'. |
| messageOrder | no | true | java.lang.String | Designates whether a notification should be appended to the container after all notifications, or whether it should be prepended to the container before all notifications. Options are "after" or "before". Default = 'after'. |
| messageStyleClass | no | true | java.lang.String | A CSS class to be applied to each notification when they are created. Default = ''. |
| position | no | true | java.lang.String | Designates a class which is applied to the growl container and controls its position on the screen. Options: top-left, top-right, bottom-left, bottom-right. Default = 'top-right'. |
| redisplay | no | true | boolean | A flag indicating this UIMessages instance should redisplay FacesMessages that have already been handled. Default = 'true'. |
| rendered | no | true | boolean | Return true if this component (and its children) should be rendered during the Render Response phase of the request processing lifecycle. Default = 'true'. |
| showDetail | no | true | boolean | Flag indicating whether the "detail" property of messages for the specified component should be rendered. Default = 'false'. |
| showEffectDuration | no | true | java.lang.String | Duration (also called "speed" in jQuery) of show effect. One of "slow", "_default", "fast", or an integer of milliseconds. ("slow", "_default", "fast" currently equated to 600, 400 and 200 respectively in jQuery.) Default = '_default'. |
| showSummary | no | true | boolean | Flag indicating whether the "summary" property of messages for the specified component should be rendered. Default = 'true'. |


Lazy Consensus
The concept of "Lazy Consensus" is very important in our project. Lazy Consensus means that when you are convinced that you know what the community would like to see happen you can simply assume that you already have consensus and get on with the work. You do not have to insist people discuss and/or approve your plan, and you certainly do not need to call a vote to get approval. You just assume you have the community's support unless someone says otherwise.
We have a time machine (git), this means that as long as you commit (or submit patches) early and often the community has plenty of opportunity to indicate disapproval. If you believe the community will support your action you can operate on lazy consensus as long as you are prepared to roll back any work should a valid objection be raised.
Avoiding Unnecessary Discussion
The key thing about lazy consensus is that it is easier for people to agree, by doing nothing, than it is to object, which requires an alternative to be proposed. This has two effects, firstly people are less likely to object for the sake of it and secondly it cuts down on the amount of unnecessary mail traffic and discussion.
Lazy consensus means we can avoid waiting for a community based decision before proceeding. However, it does require everyone who cares for the health of the project to watch what is happening, as it is happening. Objecting too far down the road will cause upset, but objecting (or asking for clarification of intent) early is likely to be greeted with relief that someone is watching and cares.
Stating Lazy Consensus
Sometimes a member of the community will believe a specific action is the correct one for the project but is not sure that there will be consensus and may not wish to proceed the work without giving the community an opportunity to feedback. In these circumstances, they can make the proposal and state Lazy Consensus is in operation.
Proposals should be sent to list, preferably the development list. It is common to indicate proposals by including the
string [#proposal]
at the beginning of the subject to make it easier for the community to identify that the mail
contains an important proposal.
This triggers the Lazy Consensus mechanism, by which the proposal is considered accepted if no one objects within 72 hours after the proposal submission. The period of 72 hours is chosen because it accounts for different timezones and any non-Opencast commitments the community members may have.
In this approach the original proposer is not insisting that there is a discussion around the proposal, nor is it requested that the community explicitly supports their actions. This differs from assuming lazy consensus since it allows space and time to express support or objections and corrections to the proposal before work begins.
Silence is Consent
People may choose to indicate their support for the actions taken with a +1 mail - quick and easy to read and reassuring for the implementer. However, remember, in a lazy consensus world silence is the equivalent to support. This can take some time to get used to.


AUD/USD retreats to 0.6800 area despite positive trade rhetoric
by Eren Sengezer- US could reportedly delay December tariff hike on Chinese imports.
- US Dollar Index recovers to 97.90 on upbeat manufacturing data.
- Coming up: Commonwealth Bank Manufacturing and Services PMI data from Australia.
After advancing to a fresh daily high of 0.6815 in the early trading hours of the American session, the AUD/USD pair lost its traction and erased its daily gains to turn flat near the 0.6800 mark as the AUD failed to capitalize on renewed trade optimism.
The South China Morning Post on Thursday reported that the United States could delay December's scheduled tariff hike on Chinese imports even if sides fail to finalize phase one of the trade deal. Although positive developments on the US-China trade conflict usually help the AUD/USD pair gain traction, the broad-based USD recovery made it difficult for the pair to push higher.
USD rebound on upbeat data
The Federal Reserve Bank of Philadelphia's Manufacturing Business Outlook Survey revealed that the business activity in the region's manufacturing sector in November expanded at a much more robust pace than expected to help the greenback gather strength against its peers.
The US Dollar Index, which tracks the buck's value against a basket of six major currencies, staged a recovery on the back of the data and turned positive on the day near the 97.90 mark.
In the early trading hours of the Asian session on Friday, the Commonwealth Bank's Manufacturing and Services Purchasing Managers' Index (PMI) data from Australia will be looked upon for fresh impetus.
Technical levels to watch for
AUD/USD
| Overview | |
|---|---|
| Today last price | 0.6801 |
| Today Daily Change | 0.0003 |
| Today Daily Change % | 0.04 |
| Today daily open | 0.6798 |
| Trends | |
|---|---|
| Daily SMA20 | 0.6852 |
| Daily SMA50 | 0.6814 |
| Daily SMA100 | 0.6836 |
| Daily SMA200 | 0.6935 |
| Levels | |
|---|---|
| Previous Daily High | 0.6832 |
| Previous Daily Low | 0.6789 |
| Previous Weekly High | 0.6866 |
| Previous Weekly Low | 0.6769 |
| Previous Monthly High | 0.693 |
| Previous Monthly Low | 0.667 |
| Daily Fibonacci 38.2% | 0.6805 |
| Daily Fibonacci 61.8% | 0.6816 |
| Daily Pivot Point S1 | 0.6781 |
| Daily Pivot Point S2 | 0.6763 |
| Daily Pivot Point S3 | 0.6738 |
| Daily Pivot Point R1 | 0.6824 |
| Daily Pivot Point R2 | 0.6849 |
| Daily Pivot Point R3 | 0.6867 |


sync up music with people around you
The Wearhaus App makes sharing music with your friends easy. It works in tandem with Arc, displaying a feed of stations nearby and controlling privacy settings as well as headphone color.
Custom LED light
The customizable LED light rings are a key part of the Arc design and experience. Choose your personal color at any time using the mobile app or the touch controls. If you're broadcasting, anyone who joins your station syncs up to your color!
Intuitive Touch Controls
A touch-sensitive panel on the right earcup allows you to control playback with simple, intuitive gestures. You can play/pause your music with a single tap, swipe to move between songs and change volume, or control sharing functionality, all without having to touch your phone.
broadcast your own station
The Wearhaus mobile app enhances the social experience by providing a list of all the "stations" that other Arc users are hosting and allowing you to chat with the people that you're listening with. Future updates to the Arc headphones (active noise canceling and advanced color settings) will be done through the app as well.


THE CONVENT (O CONVENTO) A film review by Steve Rhodes Copyright 1996 Steve Rhodes
RATING (0 TO ****): 1/2
Director Manoel De Oliveira's THE CONVENT (O CONVENTO) is the one of those artistic film that tries so hard to be artsy that it loses all touch with reality and with what makes an enjoyable film in the first place. The director does do something right. He hires two excellent leads, Catherine Deneuve and John Malkovich. He then makes a really bad decision and hires himself to write the script which is on silly side of ridiculous and the lines are preposterous.
The plot is that an American professor Michael Padovic (John Malkovich) and his French wife Helene (Catherine Deneuve) go to the Portuguese convent of Arrabida to find the proof of Professor Padovic's radical theory that William Shakespeare was not British. The good professor has tentative evidence that Shakespeare was of Spanish and Jewish ancestry. At the convent he believes he will uncover conclusive proof that his theory is valid, and he will be forever famous in the literary field.
Once there they meet some creepy people including Luis Miguel Cintra as Baltar, Heloisa Miranda as Berta, and Leonor Silveira as Piedade. As the story meanders along, the audience wonders where it is going and why, and what is the point of it all. I could waste your time with more details of the story, but trust me, you don't want to know them.
The acting by even the brilliant leads is mediocre at best. The director's pacing is atrocious. Scenes drag by at a glacial speed. The editing (Manoel De Oliveira and Valerie Loiseleux) has no sense of timing. The cinematography (Mario Barroso) looks like many of the scenes were filmed with the back of the camera open so that light pollution almost ruined the film. I am sure this did not happen so why so many scenes are so washed out as to be almost unwatchable is something I could never figure out.
The worst part of movie has to be the music (Sofia Gubaidulina, Toshiro Mayuzumi, and Igor Stravinsky). It is so overscored and loud at inappropriate moments that it seems to be a caricature of a bad musical score.
Is there anything good in this mess of a movie? Only one. Catherine Deneuve, now in her 50s, proves that real beauty is eternal.
THE CONVENT runs only 1:30, but it will seem like a life sentence. It is mainly in English, but when other languages are used there are English subtitles. It is not rated, but who cares since people of all ages should avoid this bomb. I give it 1/2 of a star only for Deneuve's everlasting radiance.
**** = One of the top few films of this or any year. A must see film. *** = Excellent show. Look for it. ** = Average movie. Kind of enjoyable. * = Poor show.  Totally unbearable.
REVIEW WRITTEN ON: June 17, 1996
Opinions expressed are mine and not meant to reflect my employer's.
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


This interface provides on-line access to the LinGO English Resource Grammar (ERG). Using facilities of the (a) Linguistic Knowledge Builder (LKB) grammar engineering platform, (b) high-efficiency PET System parser, (c) [incr tsdb()] profiling environment, and (d) Redwoods treebanking tools, the interface allows one to input one sentence at a time, analyze it using the ERG, and visualize analysis results in various forms.
To analyze a sentence or fragment, enter it in the input box, then click Analyze. The allow buttons below the input box permit you to control whether the parser accepts full sentences and/or fragments, and some degree of robustness and ambiguity in the analyses; the unknown button controls whether or not to use the unknown-word facility for words not in the 40,000-stem manual lexicon; the search button controls whether the parser should return all licensed analyses, or only the top-ranked N; the output button determines the form of the parser output (parse trees, semantics in MRS, and elementary dependencies); and the show button determines the number of highest-ranked analyses to present. Clicking the Sample button will activate a random selection of a sentence from the CSLI syntactic test suite.The LOGON on-line pages make relatively heavy use of Cascading Style Sheets (CSS) and (some) JavaScript; while it should be possible to navigate without JavaScript, for the CSS to work properly, you will need a modern, HTML 4.0.1 compliant browser (e.g. FireFox or Mozilla 1.x, Netscape 7.x, IE 5.x, and later versions or derivatives). Please relay bug reports and suggestions for improvement back to the ERG and DELPH-IN developers.


Image Triangulation
Work
Stop
Image width:
x
Drop image or
Download image
Download OBJ
Download colored PLY
Created by
Eran
and assisted by
Adi Shavit
, view code on
GitHub
(Forked from
mkacz91
)
Advanced:
Edge detection sensitivity:
Triangle relaxation sensitivity:
Triangulation steiner iterations:
Graph style:
Mid color
Random color
Edges in color


|
MasterScan
Lab_Matlab_control Master Branch
|
Queue of feval()able cell arrays, for "Encounter" demo game.
Properties and Events | |
| Property | fevalables = {} |
| cell array of fevalable cell arrays | |
| Property | isLocked = false |
| true or false, whether a new fevalable may be dispatched | |
Methods | |
| self | EncounterBattleQueue () |
| Create a new queue object. | |
| flushQueue (self) | |
| Clear out all queued fevalables without invoking them. | |
| addFevalable (self, fevalable) | |
| Add a new fevalable to the back end of the queue. | |
| dispatchNextFevalable (self) | |
| Invoke and discard the fevalable at the front end of the queue. More... | |
| dispatchNextFevalable | ( | self | ) |
Invoke and discard the fevalable at the front end of the queue.
If isLocked is true, does nothing.


I enjoy the feeling I get from learning something difficult that's new!
I have a technical background
You can reach me by cell phone or email Visit W3Schools.com!


View my library of clones!
The clones listed below vary from simple HTML and CSS to dense, multi-fascited projects.
View On GitHub
View Hulu Front Page Demo


Markets
Register
log in
markets
register
log in
Log In
Email address:
Password:
Remember me
Forgot password?
Log In
Don't have an account?
Sign Up


Note
Click here to download the full example code
2D Robot Localization - Tutorial¶
This tutorial introduces the main aspects of UKF-M.
Goals of this script:
understand the main principles of Unscented Kalman Filtering on Manifolds (UKF-M) [BBB19].
get familiar with the implementation.
design an UKF for a vanilla 2D robot localization problem.
We assume the reader to have sufficient prior knowledge with (unscented) Kalman filtering. However, we require really approximate prior knowledge and intuition about manifolds and tangent spaces.
This tutorial describes all one require to design an Unscented Kalman Filter (UKF) on a (parallelizable) manifold, and puts in evidence the versatility and simplicity of the method in term of implementation. Indeed, we need to define an UKF on parallelizable manifolds:
a model of the state-space system that specifies the propagation and measurement functions of the system.
an uncertainty representation of the estimated state, which is a mapping that generalizes the linear uncertainty definition \(\mathbf{e} = \mathbf{x} - \mathbf{\hat{x}}\).
standard UKF parameters that are noise covariance matrices and sigma point parameters.
We introduce the methodology by addressing the vanilla problem of robot localization, where the robot obtains velocity measurements, e.g., from wheel odometry, and position measurements, e.g., from GPS. The state consists of the robot orientation along with the 2D robot position. We reproduce the example described in [BB17], Section IV.
Import¶
Package import is minimal, as UKF-M is mainly build on the standard NumPy package.
import ukfm
import numpy as np
import matplotlib
ukfm.utils.set_matplotlib_config()
# The matplotlib configuration is adjusted for better rendering the figures.
The Model¶
The first ingredient we need is a model that defines:
the state of the system at instant \(n\), noted \(\boldsymbol{\chi}_n \in \mathcal{M}\), where \(\mathcal{M}\) is a parallelizable manifold (vectors spaces, Lie groups and others). Here the state corresponds to the robot orientation and the robot position:
\[\mathcal{M} = \left\{ \begin{matrix} \mathbf{C} \in SO(2), \mathbf{p} \in \mathbb R^2 \end{matrix} \right\}.\]a propagation function that describes how the state evolves along time
\[\boldsymbol{\chi}_n = f(\boldsymbol{\chi}_{n-1}, \boldsymbol{\omega}_{n}, \mathbf{w}_{n}) \in \mathcal{M},\]where \(\boldsymbol{\omega}_{n} \in \mathcal{U}\) is the input of the system and \(\mathbf{w}_{n} \sim \mathcal{N}(\mathbf{0}, \mathbf{Q}_n)\) is a Gaussian noise.
an observation function describing the measures we have in the form of:
\[\mathbf{y}_n = h(\boldsymbol{\chi}_{n}) + \mathbf{v}_n \in \mathbb{R}^p,\]where \(\mathbf{v}_{n} \sim \mathcal{N}(\mathbf{0}, \mathbf{R}_n)\) is a Gaussian noise.
The code contains models, which are declared as class. In this script, we use
the LOCALIZATION
model.
MODEL = ukfm.LOCALIZATION
Note
A state or an input is an instance of the STATE
or INPUT
class that
is described in the MODEL
, and can thus handle a complex form not
restricted to vector. In contrast, we consider for conciseness that any
measurement at time \(n\) is a vector (1D-array).
Simulating the Model¶
We compute simulated data, where the robot drives along a 10 m diameter circle for 40 seconds with high rate odometer measurements (100 Hz) and low rate position measurements (1 Hz). We first define the model parameters, create an instance of the model, and compute the true states along with noisy inputs.
# sequence time (s)
T = 40
# odometry frequency (Hz)
odo_freq = 100
# create the model
model = MODEL(T, odo_freq)
# odometry noise standard deviation
odo_std = np.array([0.01, # longitudinal speed (v/m)
0.01, # transverse shift speed (v/m)
1/180*np.pi]) # differential odometry (rad/s)
# radius of the circle trajectory (m)
radius = 5
# simulate trajectory
states, omegas = model.simu_f(odo_std, radius)
Note
The model encodes how non-linear noise affects the propagation function. In contrast, we assume measurement noise affects the observations linearly. It spares us computational time, but the method can be adapted to handle non-linear observation noises of the form \(\mathbf{y}_n = h(\boldsymbol{\chi}_{n}, \mathbf{v}_n)\).
The state and input variables are both a list of STATE
and INPUT
instances. One can access a variable at specific instant \(n\) as:
state_n = states[n] # model.STATE instance
omega_n = omegas[n] # model.INPUT instance
We can access to the elements of the state or the input as:
state_n.Rot # 2d orientation encoded in a rotation matrix
state_n.p # 2d position
omega_n.v # robot forward velocity
omega_n.gyro # robot angular velocity
These elements depend on the considered problem and are defined in the model.
See at the LOCALIZATION()
documentation to get a brief
mathematical description.
Note
The orientation states[n].Rot
is defined via a rotation matrix. We
always define for clarity orientations in matrices living in \(SO(2)\)
and \(SO(3)\). The method remains compatible with quaternion. We may
drop some numerical issues, e.g. round-off that leads to non-orthogonal
rotation matrices, to let the code simple.
With the true states, we simulate noisy measurements.
# GPS frequency (Hz)
gps_freq = 1
# GPS noise standard deviation (m)
gps_std = 1
# simulate measurements
ys, one_hot_ys = model.simu_h(states, gps_freq, gps_std)
The variable ys
is a 2D array that contains all the observations of the
sequence. To get the k-th measurement, take the k-th element of the variable
as:
y_k = ys[k] # vector (1D array)
We have defined an array one_hot_ys
that contains 1 at instant where a
measurement happens and 0 otherwise.
Let us visualizes the robot trajectory along with measurements.
model.plot_traj(states, ys)
GPS measurements are visibly noisy.
Filter Design¶
Designing an UKF on parallelizable manifolds consists in:
defining a model of the propagation function and the measurement function.
choosing the retraction \(\varphi(.,.)\) and inverse retraction \(\varphi^{-1}_.(.)\) such that
\[ \begin{align}\begin{aligned}\boldsymbol{\chi} &= \varphi(\hat{\boldsymbol{\chi}}, \boldsymbol{\xi}) \in \mathcal{M},\\\boldsymbol{\xi} &= \varphi^{-1}_{\hat{\boldsymbol{\chi}}} (\boldsymbol{\chi}) \in \mathbb{R}^d,\end{aligned}\end{align} \]where \(\boldsymbol{\chi}\) is the true state, \(\hat{\boldsymbol{\chi}}\) the estimated state, and \(\boldsymbol{\xi}\) the state uncertainty (we does not use the notation \(\mathbf{x}\) and \(\mathbf{e}\) to emphasize the differences with the linear case).
setting UKF parameters such as sigma point dispersion and noise covariance values.
Step 1) is already done, as we take the functions defined in the model.
Step 2) consists in choosing the mapping that encode our representation of the state belief. A basic UKF is building on the uncertainty defined as \(\mathbf{e} = \mathbf{x} - \mathbf{\hat{x}}\), which is not necessary optimal. Rather than, we define the uncertainty \(\boldsymbol{\xi}\) thought \(\boldsymbol{\chi} = \varphi(\hat{\boldsymbol{\chi}}, \boldsymbol{\xi})\), where the retraction \(\varphi(.,.)\) has to satisfy \(\varphi(\boldsymbol{\chi}, \mathbf{0}) = \boldsymbol{\chi}\) (without uncertainty, the estimated state equals the true state). We then need an inverse retraction to get a difference from two states that must respect \(\varphi^{-1}_{\boldsymbol{\chi}}(\boldsymbol{\chi}) = \mathbf{0}\).
We embed here the state in \(SO(2) \times \mathbb{R}^2\), such that:
the retraction \(\varphi(.,.)\) is the \(SO(2)\) exponential for orientation and the vector addition for position.
the inverse retraction \(\varphi^{-1}_.(.)\) is the \(SO(2)\) logarithm for orientation and the vector subtraction for position.
Note
We define different choices of retraction and inverse retraction directly in the model.
Note
One can suggest alternative retractions, e.g. by viewing the state as a element of \(SE(2)\). In the benchmarks section, we compare different choices of retraction for different problems.
We define the filter parameters based on the model.
# propagation noise covariance matrix
Q = np.diag(odo_std ** 2)
# measurement noise covariance matrix
R = gps_std ** 2 * np.eye(2)
# sigma point parameters
alpha = np.array([1e-3, 1e-3, 1e-3])
# this parameter scales the sigma points.
# Current values are between 10^-3 and 1.
Filter Initialization¶
We initialize the filter with the true state with a small heading error of 1°.
# "add" orientation error to the initial state
state0 = model.STATE(Rot=states[0].Rot.dot(ukfm.SO2.exp(1/180*np.pi)),
p=states[0].p)
# initial state uncertainty covariance matrix
P0 = np.zeros((3, 3))
# The state is not perfectly initialized
P0[0, 0] = (1/180*np.pi)**2
We define the filter as an instance of the UKF
class.
ukf = ukfm.UKF(state0=state0, # initial state
P0=P0, # initial covariance
f=model.f, # propagation model
h=model.h, # observation model
Q=Q, # process noise covariance
R=R, # observation noise covariance
phi=model.phi, # retraction
phi_inv=model.phi_inv, # inverse retraction
alpha=alpha # sigma point parameters
)
Before launching the filter, we set a list for recording estimates along the full trajectory and a 3D array to record covariance estimates.
ukf_states = [ukf.state]
ukf_Ps = np.zeros((model.N, 3, 3))
ukf_Ps[0] = ukf.P
Filtering¶
The UKF proceeds as a standard Kalman filter with a for loop.
# measurement iteration number (first measurement is for n == 0)
k = 1
for n in range(1, model.N):
# propagation
ukf.propagation(omegas[n-1], model.dt)
# update only if a measurement is received
if one_hot_ys[n] == 1:
ukf.update(ys[k])
k += 1
# save estimates
ukf_states.append(ukf.state)
ukf_Ps[n] = ukf.P
Results¶
We plot the trajectory, GPS measurements and estimated trajectory. We then plot the orientation and position errors along with 95% (\(3\sigma\)) confident interval. The results has to be confirmed with average metrics to reveal the filter performances in term of accuracy, consistency and robustness.
model.plot_results(ukf_states, ukf_Ps, states, ys)
All results seem coherent. This is expected as the initial heading error is small.
Conclusion¶
This script introduces UKF-M and shows how designing an UKF on parallelizable manifolds mainly consists in choosing an advantageous uncertainty representation. Two major interests of the method are that many problems could be addressed within the framework, and that both the theory and its implementation are sufficiently simple.
The filter works apparently well on a simple robot localization problem, with small initial heading error. Is it hold for more challenging initial error ?
You can now:
enter more in depth with the theory, see [BBB19].
address the UKF for the same problem with different noise parameters, and test its robustness to strong initial heading error.
modify the propagation model with a differential odometry model, where inputs are left and right wheel speed measurements.
apply the UKF for the same problem on real data.
benchmark the UKF with different retractions and compare the new filters to both the extended Kalman filter and invariant extended Kalman filter of [BB17].
Total running time of the script: ( 0 minutes 3.914 seconds)


--- layout: page title: About Me description: This is what I do. background: '/img/bg-about.jpg' ---
This is a site where I document what I have done, read and think.


Possitech
Events
Create Event
Print Badges
Profile
Logout
Events
Create Event
List of Events
Name
View Attendants
No. Of Attendants
Logo
1
Mark
Otto
@mdo


WWE star Mia Yim suffers a broken nose, suspected fractured ribs in ladder match gone wrong
by Richard ForresterThere was nothing fake about Mia Yim's horrendous injuries during her NXT ladder match with Io Shirai.
The pair left everything on the line during their match-up but it didn't come without consequence.
Yim was left being nursed by the paramedics after suffering a broken nose and suspected fractured ribs.
CAIN VELASQUEZ EXPLAINS CHALLENGES OF MOVING FROM UFC TO WWE
The first came when Yim was holding a ladder to her face when Shirai launched a drop kick in her direction.
The ladder smashed off her face and bust open her nose.
With blood streaming down her face the show continued but it was about to get worse for Yim.
RONDA ROUSEY SPEAKS OUT ON UNCERTAIN WWE FUTURE, WRESTLEMANIA INJURY AND STARTING A FAMILY
As she climbed the top of the ladder, NXT UK Women's Champion Kay Lee Ray tipped it over leaving her sprawling.
She lands outside of the ring but crashes into another ladder which makes her wince in pain.
Yim was then carried off by medics where she was given further treatment backstage.
HULK HOGAN SAFE AFTER SURVIVING 'CRAZY' AIRPLANE LANDING
AN NXT injury report claimed: "Mia Yim suffered a nasal fracture during her Ladder Match loss to Io Shirai, after Shirai dropkicked the ladder into her face.
"That injury will be examined by a plastic surgery. Yim also suffered what were believed to be rib fractures due to the big fall she took at the end of the match.
CLICK HERE TO GET THE FOX NEWS APP
"Camp claims she was sent to the Emergency Room for x-rays and based on current information, Yim's status is 'day to day'."
This article originally appeared in The Sun


--- layout: page title: Now ---
Work Currently, I'm working with Grok! as a Game Designer helping build games for 21st century sills. Last Updated : 30th March 2022. Archived


Connection is the foundation of this application.
Devices connected to the same router is always ready to work.
Devices connected with each other via Persona Spot will work, too.
As long as your devices are in the same local network (LAN) then they work properly, you can find them in Peers.
Sending text between your devices is extremely easy, you can then copy your text or send it via messages and emails.
Deliver can send any size of files from any sources to any devices in your Peers list, you can preview files and save received images to gallery.
History is shown newest on top, you can resend any message you used before or you can clear them. History is automatically cleared once app quitted.
Every received file is stored in Files safely. You can use or delete them anytime you want.
We always have something we would like to share with friend.
Using Password can help you to send the files to your friend, just your friend.
Before this, you and your friend should know the password indeed.
teamace.leavesoft@gmail.com


{% extends "error.html" %} {% block main %}
You are trying to access a restricted instance of EGI Notebooks service. If you are interested in accessing or think you should be granted acess already, please contact us at<EMAIL_ADDRESS>or open an issue in GGUS
You can test the service using the EGI Notebooks catch-all instance. You can also place an order in EGI Marketplace for the Notebooks service if you are interested in your own community deployment.


Kiwipace offers coding solutions that help your business get started and get going with websites and automations (bots).


BANDIT QUEEN A film review by S. Ananthasubramanian Copyright 1996 S. Ananthasubramanian
Shekar Kapoor's Bandit Queen is not an entertaining movie. It is made with the sole purpose of making us realize the atrocities done to lower caste people, especially women, in India. It is the real story of a woman who lead a group of bandits in the late seventies in India.
Peppering the scenes with foul language and without a single known actor or actress in the movie, the director manages to create realistic and brutal characters and tear your heart apart. In the end, he makes us wonder whether there is anything to be happy about being an Indian.
The movie begins with a quote from Manusmrithi(an ancient book on social values in India) that equates the women, the uneducated and the lowercaste people to cattle and justifies beating them for making them obey.
The early parts of the movie deal with Phoolan's marriage when she is a kid. Sold by her father to a man thrice her age for a cycle, a cow and Rs.100 ($3.00) the 11 year old Phoolan is beaten and sexually assaulted, which damages her personality completely. The film crew, with their artistic and candid work, take you to dry, poverty ridden villages of Madhya Pradesh ( a poor state in central India). This part ends with helpless cries from the kid that fill your ears and pain that fills your heart.
A teenage Phoolan is branded a hooker by the village when she refuses to comply to the sexual advances of a young Thakur. As the story goes on Phoolan is kidnapped by a group of gangsters whose leader takes pleasure in raping her day in and day out. Now, coming to the picturization of these rape scenes, Shekar Kapoor has taken Indian cinema to the next level.
So far rape in Indian movies has been portrayed in only two ways, either in a symbolic way or as a cheap substitute for love making scenes. Showing a painting of a tiger feasting over a deer or a flower burning in the oven with appropriate music has been enough for Indian film fans to understand the happenings on the screen. The pictures made with cheap actors and advertised with obvious posters, which have rape scenes with erotic music and obscene images to satisfy the front bencher, make up the second category.
 Phoolan's voice filled with pain is heard initially, and as the camera moves in, one can see the most obscene and hurting image ever shown on Indian screens. The semi-naked rapist lying over Phoolan goes on raping her violently as we remain helpless and bewildered. After Phoolan is rescued from her tormenter by the smart Vikram Mallah, another gangster, Shekar Kapoor portrays the affair that develops between these two with equal vigor. Their relationship is short lived, as everything in Phoolan's life is.
Once Vikram is killed by another gangster, Sriram, she is taken away by Sriram's gang. All the 16 members of this gang rape her one after the other. After this, she is paraded naked in the streets of Behmai as the whole village watches on. Though there is a very strong possibility for this scene to get censored in India, there is nothing cheap or vulgar about this when you see it on screen. In an industry set up where, "double-meaning" lyrics and dance movements with obvious messages are shot for the mainstream cinema, an anti-Bollywood (Bollywood - the heart of film production in India) scene like this, which does not portray woman as a sexual object, is sure to evoke flames. As Phoolan is "punished" for not behaving like a lowercaste woman the biased social set up in India looms large in our minds.
Coming out of such a nasty experience is not easy. Phoolan manages to and takes the gun in her arms. Even now, no move by the director justifies her taking the law in her hands. Most importantly, you don't see action packed scenes for clapping or whistling. The director is just a narrator and thankfully he hasn't brought in commercial elements to hinder the flow of the story. The rise and fall of Phoolan as the bandit queen and her eventual surrender are shown with equal sincerity.
Seema Biswas in the title role gives a very powerful and memorable performance that is sure to fetch her critical acclaim and numerous awards. With her ordinary looks she may not make it big in mainstream cinema, but, this is what they call, "role of a life time". She's definitely given her best and that is more than enough.
Fateh Ali Khan's (remember the voice in Oliver Stone's "Natural born Killers" ?) music adds depth and soul, thankfully not color, to the images.
A very strong heart is a must for watching this film. Accepting the negative points of our society needs a much stronger one. If our society is/was half as bad the one portrayed in this movie then there is no point in being proud about our social set up.
Reports say that this is one of the biggest box office hits of the year in India. Let's hope its an eye opener to those who breed social injustice.
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


If today is your last day...Are you ready to go?
Your body will lose 21 grams in weight
It might be a soul departs from your body
at the entrance to the afterlife
You are asked to encapsulate one moment or memory into your soul
This chosen moment will happen again someday in your next life
Hit "Next" When you ready to start the process


Feature Hunt
Describe. Submit. Behold.
Suggest features
for your favorite Apps!
Let's get creative!
Login
Don't have an account?
Sign up now
Signup
Already have an account?
Login now