Anaconda Python Update
Anaconda wrapes python in a pack. It is convenient to use Anaconda to install python when you are new to everything about python.
Recently, I noticed that my python version is 3.5.x while the newest version of python is 3.6. I found this problem when I was tring to use some modules that contain functions be newly added in version 3.6 and thus get errors.
My python was installed via Anaconda, so I have to use anaconda to update my python version. The method I used was
conda update python
However, it only updated my python between newer 3.5 version. My python was not upated across 3.5 to 3.6. So, I found another method to update between version distributions.
conda install python==3.6
This updated my python to version 3.6 along with modules which diff from version 3.5 and 3.6.
Summary
To update python in the same version distribution, use
conda update python
To update python across version distribution, use
conda install python==$python-version$


Turkey
The Wicked Girl
There was once a merchant who set out with his wife on a pilgrimage to Mecca. Their daughter, though, they left at home, with an Arab slave girl to keep her company. One evening quite late, the merchant’s daughter and the Arab girl were singing and laughing and dancing about in the upstairs apartment. By accident, the Arab girl knocked over the oil lamp, leaving the young ladies in darkness. “What should we do?” said the merchant’s daughter. “It’s too late to rouse the servants.” “I’ll go out and find a light,” said the Arab girl. “But we’re locked in!” said the merchant’s daughter. “The window’s open,” said the Arab girl. So they knotted some bed sheets together and lowered them from the window. Then the Arab girl took a basket and climbed down. She walked down the street till she came to a restaurant still open. The customers had all gone, but a handsome young man was in the kitchen, cleaning up and preparing for the next day. On the table were dishes piled high with kebabs, dolma, pilaf, and baklava. “May I come in?” said the Arab girl prettily. The young man, who owned the restaurant, cast an eye on the lovely young lady. “Please sit down!” he said. As the two of them chatted, the young man moved closer and closer to the Arab girl. She was almost in reach when she asked him, “What’s in those huge crocks?” “One has olive oil, one has clarified butter, and one has honey.” “Honey?” she said. “What’s that?” “Surely you’ve had honey before!” “Never! Please give me a taste.” So the young man took off the lid and leaned into the crock to spoon some out. The Arab girl came up behind and lifted his feet, so he slid head first into the honey. Then she quickly loaded her basket with dishes of food, grabbed an oil lamp, and ran off. The young man came out of the honey dripping and sputtering. “Ooh, that Arab girl! If I ever catch her, I’ll drink her blood!” The next night, the Arab girl was again dancing about with the merchant’s daughter, but she was wondering about the restaurant owner. So she knocked over the lamp a second time. “I’ll have to go out again,” she said. They lowered the bed sheets, and the Arab girl climbed down with her basket. When she reached the restaurant, she again found the young man alone.  “Do you know what I’ll do to you now?” “Kiss me?” she asked. “Well, well!” said the young man, with a smile. “What a fine idea!” He came close to embrace her. “Not yet,” she said. “First we must eat and drink.” So they ate and drank, and the Arab girl kept pouring him more and more wine, and he kept drinking it, till his head dropped down and rested on the table. She found some rope, tied him up, and gagged him. Then she took more dishes of food and a lamp and ran off. His customers found him the next morning and set him free. “Ooh, that Arab girl! If I ever catch her, I’ll drink her blood!” Later that same day, the young man disguised himself as an old flower peddler, with ragged clothes and a long white beard. Then he walked up and down the streets, calling, “Roses for sale! Roses for sale!” When he came by the merchant’s house, he spotted the Arab girl looking out the upstairs window. “I have her now!” he muttered. Meanwhile, the Arab girl was telling the merchant’s daughter, “There’s that handsome restaurant owner. I wonder what he’s up to.” She called down to him, “We would like some roses.” “Then please come to the door,” said the young man, in an old man’s voice. “We’re locked in,” she said. “But you can climb to the window.” She lowered the bed sheets, and the young man started up. He was just a few feet away when the Arab girl took a knife and sliced through the top sheet. Roses flew everywhere as the young man tumbled to the ground. While a crowd gathered around him, the young man painfully struggled to his feet. “Ooh, that Arab girl! If I ever catch her, I’ll drink her blood!” Not long after that, the merchant returned with his wife from their pilgrimage. To thank the Arab slave girl for keeping his daughter good company, he asked, “What would you like as a gift?” “A doll made of rubber,” she told him. “It should be just my height and look just like me and wear clothes just like mine. And when you shake it, it should say, ‘Yes, yes.’” So the merchant had the doll made and gave it to her. A few days later, the merchant spoke again to the Arab girl. “I’ve received a note from a man who does not name himself. He wishes to buy you for an incredibly high price. But if you object, I’ll refuse him.” “I don’t mind,” she said, smiling. The next morning, a messenger came with a carriage and drove the Arab girl to a house a few streets away. She and her belongings were left alone in a room upstairs. The Arab girl took her doll and stood it in the middle of the room. She poured red sherbet into its hollow center, filling it with the sweet fruit drink. Then she hid in a closet. Before long, the door flew open. There stood the young restaurant owner, a dagger in his hand. He glared at the doll. “You wicked girl! I’ve caught you at last!” Gripping it by the shoulder, he demanded, “Do you remember how you pushed me into the honey?” He shook it back and forth. “Yes, yes,” said the doll. “And do you remember how you tied me up and gagged me?” “Yes, yes.” “And do you remember how you made me fall to the street?” “Yes, yes.” “You admit everything! Then prepare to die, for now I will drink your blood!” He plunged the dagger into the doll, and red liquid spurted out. As the doll fell over, he caught a few drops in his cupped hand, and raised them greedily to his lips. “But what’s this? Her blood is so sweet!  What have I done? I have killed the sweetest woman in the world! Oh, if only I could bring her back to life, I would free her and marry her! But it’s too late. All I can do now is end my own life!” He raised the dagger above his chest. “Hey, dummy! I’m right here!” The young man stared at the Arab girl. “Darling!” he cried. “Dearest!” she answered. And they lived happily ever after.
Source: Here


--- layout: default title: Home ---
I'm a recent STEM graduate from the University of Washington dedicated to programming scalable applications and
optimizing database performance.
Currently looking for full-time positions!
Connect with me on my networks, or contact me directly.
I'm Andrew and I am a software developer based in Seattle, WA. My primary experiences lie in
Java progamming and database management
with additional interests in machine learning and front-end development. As such, I am most proficient in Java and SQL, and familiar with Python and HTML/CSS.
I am a problem-solver at heart, having graduated from the University of Washington with a B.A. in Mathematics '20.
I'm a hands-on developer who has built applications from the ground up. I'm not afraid to dive deep into unfamiliar technologies
and I am constantly seeking ways to learn. When I'm not working on my own project, I'm contributing to someone else's.
Or, spending time with my friends.
Simple chat server that announces when a user joins or leaves the chat, and keeps count of how many users are in the chat at one time. Explores server.js and socket.io implementations. Built with Javascript, hosted on Heroku.
Version 1.0 of my personal website. Built with HTML, CSS, Bootstrap, and Jekyll, and hosted on GitHub pages.
A fully automated Twitter bot that posts daily weather updates for the city of Seattle, WA. Gained first-hand experience with APIs and cloud services. Built with Java, hosted on Heroku.
Flight booking application that allows users to login, search and reserve flights, and pay or cancel reservations. Back-end functionality built with Java and SQL Server.
Project for CSE 414 Database Management @ UW.
Maze generator that employs Kruskal's algorithm to create mazes and Dijkstra's algorithm to solve them. Back-end functionality built with Java.
Project for CSE 373 Data Structures and Algorithms @ UW.


Renderer for DeepSee Dashboards in Browser with MDX2JSON as a Serverside and JS web-client.
More info at: Github DeepSeeWeb repository


georectangle QML Basic Type
The georectangle type represents a rectangular geographic area.
The georectangle
type is a geoshape that represents a rectangular geographic area. The type is direct representation of a QGeoRectangle. It is defined by a pair of coordinates which represent the top-left and bottom-right corners of the georectangle
. The coordinates are accessible from the topLeft and bottomRight attributes.
A georectangle
is considered invalid if the top-left or bottom-right coordinates are invalid or if the top-left coordinate is south of the bottom-right coordinate.
The coordinates of the four corners of the georectangle
can be accessed with the topLeft, topRight, bottomLeft and bottomRight attributes. The center attribute can be used to get the coordinate of the center of the georectangle
. The width and height attributes can be used to get the width and height of the georectangle
in degrees. Setting one of these attributes will cause the other attributes to be adjusted accordingly.
Limitations
A georectangle
can never cross the poles.
If the height or center of a georectangle
is adjusted such that it would cross one of the poles the height is modified such that the georectangle
touches but does not cross the pole and that the center coordinate is still in the center of the georectangle
.
Example Usage
Use properties of type variant to store a georectangle
. To create a georectangle
value, use the QtPositioning.rectangle() function:
import QtPositioning 5.2 Item { property variant region: QtPositioning.rectangle(QtPositioning.coordinate(-27.5, 153.1), QtPositioning.coordinate(-27.6, 153.2)) }
When integrating with C++, note that any QGeoRectangle value passed into QML from C++ is automatically converted into a georectangle
value, and vice-versa.
Properties
bottomLeft
coordinate bottomLeft
This property holds the bottom left coordinate of this georectangle.
bottomRight
coordinate bottomRight
This property holds the bottom right coordinate of this georectangle.
center
coordinate center
This property holds the center coordinate of this georectangle. For more details see QGeoRectangle::setCenter().
height
double height
This property holds the height of this georectangle (in degrees). For more details see QGeoRectangle::setHeight().
Note: If the georectangle is invalid, it is not possible to set the height. QtPositioning releases prior to Qt 5.5 permitted the setting of the height even on invalid georectangles.
topLeft
coordinate topLeft
This property holds the top left coordinate of this georectangle.
topRight
coordinate topRight
This property holds the top right coordinate of this georectangle.
width
double width
This property holds the width of this georectangle (in degrees). For more details see QGeoRectangle::setWidth().
Note: If the georectangle is invalid, it is not possible to set the width. QtPositioning releases prior to Qt 5.5 permitted the setting of the width even on invalid georectangles.


Smash the Stack, Global Game Jam 2016
The Team
Ben Connick
Matthew Fasman
Ben Kalb
Stuart Burton
Luna Maier
Margaret Dorsey
The Game
Web Player (Does not work on Chrome!)
Downloadable Windows Executable
Downloadable Windows Executable
Global Game Jam Team Page


-
Health Insurance Marketplace, Affordable Care Act
www.healthcare.gov
Learn how the health care law affects you at Healthcare.gov. The official site of the Health Insurance Marketplace. See your health insurance choices.
-
Troy Hunt: Everything you need to know about the Shellshock Bash bug
www.troyhunt.com
Observations, musings and conjecture about the world of software and technology
-
Digital Business Technologies Dominate Gartner 2014 Emerging Technologies ...
www.forbes.com
By Hung LeHong and Jackie Fenn Gartner, Inc. Imagine this: As you leave for work in the morning, your house automatically turns down the heat and ...
-
Apple's "warrant canary" disappears, suggesting new Patriot Act demands
gigaom.com
Apple included language in its first Transparency Report to say that it had not been subject to a Section 215 Patriot Act request. That language is ...
-
#SHADYXV Anarchy Zip Up Hoodie - Free Shipping
gumroad.com
#SHADYXV Anarchy Zip Up Hoodie Pre-Order. Ride-out with the Shady Records crew with the official SHADYXV Anarchy Hoodie. The black-zip hoodie ...
-
Who is U2?
www.whoisu2.com
What is a U2 and why is it on my phone??! Apple put U2's latest album in people's iTunes account and...
-
HP buys Eucalyptus as cloud consolidation commences for real
gigaom.com
Eucalyptus CEO Marten Mickos, once known for his anti-OpenStack rhetoric, now leads the HP OpenStack private-hybrid-public cloud effort
-
[1409.0798] DataHub: Collaborative Data Science & Dataset Version ...
arxiv.org
Link back to: arXiv , form interface , contact .
-
Hyde Park's retail revival is on a roll
www.chicagotribune.com
Chef Matthias Merges said he hesitated at first when the University of Chicago asked him several years ago to open a restaurant in Hyde Park. The ...
-
White House tries proving its tech cred by allowing programmers to keep ...
www.washingtonpost.com
Mikey Dickerson, the new head of the U.S. Digital Service, is partial to the rumpled look, and the White House says it's fine with it.
-
For Big-Data Scientists, ‘Janitor Work’ Is Key Hurdle to Insights - ...
www.nytimes.com
Technology revolutions come in measured, sometimes foot-dragging steps. The lab science and marketing enthusiasm tend to underestimate the ...
-
nsf.gov - CISE - Funding - Information and Intelligent Systems (IIS): Core ...
www.nsf.gov
NSF's mission is to advance the progress of science, a mission accomplished by funding proposals for research and education made by scientists, ...
-
Is This Your Pipe? Hijacking the Build Pipeline
speakerdeck.com
As developers of the web, we rely on tools to automate building code, run tests, and even deploy services. What happens when we're too trusting of ...
-
Open Problems in Transaction Processing (Part 1 of 3): Non-Volatile Memory ...
www.cs.cmu.edu
Open Problems in Transaction Processing (Part 1 of 3): Non-Volatile Memory, Andy Pavlo - Carnegie Mellon University,
-
The Largest Vocabulary in Hip hop
rappers.mdaniels.com.s3-website-us-east-1.amazonaws.com
The Largest
-
Dark Wallet Alpha
www.youtube.com
Call it something else. http://Darkwallet.is, http://bit.ly/1lLt7oq Click Here To Subscribe ► http://bit.ly/JoinDefDist Twitter ► ...
-
Join the Debate: 3D Printed Guns or Government Regulation?
gizmodo.com
Here's the question: in a world where the design of a 3D printed gun is freely available on the internet, can we—or should we–regulate open source ...
-
Inside the NSA’s Secret Efforts to Hunt and Hack System Administrators - ...
firstlook.org
Across the world, people who work as system administrators keep computer networks in order – and this has turned them into unwitting targets of the ...
-
Temporary Restraining Order Against BATFE - Ares Armor
aresarmor.com
Our customers privacy is of the utmost importance to us. I cannot in good moral conscience turn over a list of names to the BATFE just because they ...
-
Expanding the Big Data Toolbox | Trifacta
www.trifacta.com
With the release of Hadoop 2.0, the Hadoop ecosystem is undergoing a major transition. While Hadoop 1.0 provided one general-purpose programming ...
-
Systems & Databases: Let’s Break Down the Walls
wp.sigmod.org
After hanging out exclusively with the database community for 35+ years, I’ve recently become more involved with the systems research community. I ...
-
Defending the thesis
researchinprogress.tumblr.com
How I feel: How my professor sees me: by EBH & Jilles
-
Oyakodon - Wikipedia, the free encyclopedia
en.wikipedia.org
Oyakodon ( 親子丼 ? ) , literally "parent-and-child donburi", is a donburi , or Japanese rice bowl dish, in which chicken , egg , sliced scallion (or ...
-
What It's Like When The FBI Asks You To Backdoor Your Software
securitywatch.pcmag.com
When an FBI agent casually approached Nico Sell about installing a backdoor into her secure messaging program, the agent did not know what he was in ...


--- layout: post permalink: diamondme.html Tags: Array NameOfCoupon: Diamond-Me Cash Back Summary: See our Diamond-Me Coupon Code, Diamond-Me Rebate, Diamond-Me Promo Code, Diamond-Me Discount, Diamond-Me Coupon Cash Back Rebate here. MetaKeywords: Diamond-Me Coupon Code, Diamond-Me Rebate, Diamond-Me Promo Code, Diamond-Me Cash Back Rebate, Diamond-Me Discount, Diamond-Me Coupon Image: images/29135.jpg LinkURL: http://www.shareasale.com/r.cfm?b=252943&u=412002&m=29135 affiliate_url_link: http://www.icouponblog.com/jane.php?id=4984 thesis_readmore: See the Diamond-Me Coupon thesis_thumb: http://www.icouponblog.com/tn.php?merchantURL=diamond-me.com Title: Save 5% - Diamond-Me Coupon Code for diamond-me.com. Diamond-Me Rebate & Discount thesis_description: Our Diamond-Me Discount Coupon Code for diamond-me.com. We have the best Diamond-Me Rebate anywhere. thesis_keywords: Diamond-Me, Diamond-Me Coupon Code, Diamond-Me Discount, Diamond-Me Rebate product_name: Diamond-Me hop_url: http://www.icouponblog.com/hop.php?id=4984 ---
If you want to buy beautiful diamonds that are conflict free, have a great sparkle and are low priced then you must shop at diamond-me.com. It is an online shopping place that carries one of the most complete selections of diamond jewelry online. They have something for everyone’s taste, style and budget. Why pay more when you can get better diamonds for less. Check it out online at diamond-me.com. Use our discount coupons to get a great price.
Visit diamond-me.com and find beautiful, conflict free diamonds at an amazingly low price. diamond-me manufacture their own jewelry and import their diamonds directly from the source. They have eliminated the middleman therefore they are able to pass on the discounts to you. Buy for less when you shop with diamond-me.com. Also, they buy all their diamonds from legitimate sources that are not involved in funding conflicts. You can shop from diamond-me.com with peace of mind and know its not a blood diamond. Get the best diamond jewelries at great affordable prices.
Diamonds are forever, buy a beautiful ring, bracelet, earrings, and necklaces for someone you love. Be expressive, show affection and care with a beautiful piece of diamond jewelry or pop the question and get an engagement ring your loved one will adore. Get it from diamond-me.com and you won’t have to pay an arm and a leg for it. For genuine diamonds at an affordable price, your best shopping place online is diamond-me.com. check it out. Use our discount coupons to save money.


I have just done a completely clean install of EmonCMS using the instructions on GitHub and they largely worked fine. I am now looking at the instructions for setting up the feeds and I feel they are wanting.
Having followed the discussions over the years on different feed engines and their suitability for different types of logging (most of which I did not understand), this subject is then not mentioned anywhere in the instructions http://openenergymonitor.org/emon/modules/emonTxV3 The only thing in the instructions that tell me which engine to use is the screenshot of the final Feeds screen. I also think the screenshots are not of the latest version of Emoncms either (which is even more confusing).
Can these instructions be improved with a simple 'recommended setup' for each input to create suitable logs and include the engine to be used please.
Could someone please confirm what feeds should be created for each input and what the right (best) engine is to use for each feed. I have power, temp and humidity being captured.
Cheers :)
Brian
Re: Getting Started Instructions
Any help?
Re: Getting Started Instructions
Thanks Brian, Missed your post here, yes Il take a look at this and update. I see the emontx guide uses kwh/d data for the app module and the new app module uses accumulating kwh feeds instead.
The emonpi setup guide has a good overview on feed setup that is up-to-date:
http://openenergymonitor.org/emon/modules/emonpi
On the emonpi/emonbase the feed engine options are phpfina and phptimeseries. Its recommended to use phpfina for all standard logging as it uses half the disk space that phptimeseries uses for regular interval timeseries data (all standard power, temperature, kwh data with OEM).
If your doing any logging of nodes that have a variable update rate using a custom firmware then phptimeseries may be the better engine to use.
On emoncms.org, I would like to change the recommended engine to PHPFina from PHPFiwa as it would then be consistent across the emonpi/emonbase and emoncms.org, making it easier to migrate feeds across both. But the averaging feature on the PHPFiwa engine can be very useful for looking at temperature and power feeds over long timescales, so the option to use PHPFiwa would be good to be retained. The PHPTimeseries engine on emoncms.org is used for daily data created with the input processor power_to_kwhd and others. But daily data on emoncms.org has never had timezones correctly implemented and the app module needs accumulating kwh feeds created with the power_to_kwh processor and phpfina feed engine.
Re: Getting Started Instructions
Hi Trystan,
Thanks. I'll try that.
One other thing, how do I install additional modules - base emoncms has nothing appearing in the top left banner. It is mentioned all over the place they are available but I can find nothing saying how to install them!
Cheers
Re: Getting Started Instructions
Hi Brian,
I'm wondering if you came to any good conclusions here?
I'm in much the same dilemma - for each of the CTs, the older doc seems to suggest logging the current feed using PHPFIWA, the current power to kWh with PHPFINA (PHPFIWA isn't an option) and power to kWh/d with PHPTIMESERIES (PHPFINA & PHPFLNA not options). The newer doc seems to suggest that the daily graphs can come from the kWd/PHPFINA log - but I'm not quite sure how to do that on a multigraph.
Thanks,
Sandy
Re: Getting Started Instructions
I ended up with a log to feed PHPFINA and a 'power to kWh' PHPFINA feed. Seems to work but not really sure it is right! I did do a power to kWh/d but I'm not sure you need it for the 'My Electric' app (which I use in preference to the olders histograms etc) and that feed is in an error state anyway. I also seem not to have REDIS installed so did not try either of those.
HTH
Cheers


Demos for ml5.js
tutorial followed from
https://learn.ml5js.org/docs/#/
hello world, printing ml5 version
hello world powered with p5.js
tutorial followed from
Hello ml5.js: introduction
hello ml5.js v1
tutorial followed from
Reference Section
Image/ YOLO
Text/ Sentiment


'54' (1998)
A movie review by Walter Frith
Member of the 'Internet Movie Critics Association' http://www.geocities.com/Hollywood/Studio/5713/index.html
and
Member of the 'Online Film Critics Society' http://ofcs.org/ofcs/
The 1970's are on a roll. In 1997, the film 'Boogie Nights' opened to critical success. It's box office numbers were not as impressive, however. There was also 'The Last Days of Disco', released earlier this year and the Fox network is hoping to score big with 'That 70's Show' which just debuted recently and a brand new re-mastered version of the 'Saturday Night Fever' soundtrack is available on CD. Personally, I found the 70's, as tacky as they were, as the decade with the best movies. I suppose some of the worst movies were also released in this time frame but checking the list, it certainly seems impressive. There's nothing tacky about such films as 'The Godfather' and its impressive sequel, 'Star Wars', 'The Deer Hunter', 'One Flew Over the Cuckoo's Nest', 'Chinatown' and the list goes on and on.
Like 'Boogie Nights', the protagonist in '54' is a teenager on the verge of becoming a man. Ryan Phillippe stars as Shane, a dreamer and decadent minded young 19 year old who lives two miles across the river from New York City in New Jersey. He observes that while it's only two miles away, it seems like a whole other world. He lives with his two younger sisters and his father. His mother died when he was 12 and he struggles to find his way in life.
The film is set in 1979 and one night Shane and two of his friends make their way into Manhattan, hoping to get into the hottest nightclub in the world named 54. Hundreds gather outside the club each night in the hope of being admitted entrance to the club and the hopeful sheep are scrutinized carefully by the club's owner, Steve Rubell (Mike Myers). Most are turned away. Rubell only wants the best looking to mix with the VIP's in his club. He notes at one point that the nephew of the king of Saudi Arabia travels 7000 miles to come to the club for one night and then leaves the next morning and observes that it's the only place on Earth where he truly feels free.
Shane is later hired by Rubell as a bus boy and the constant theme that runs here and there in the film is a possible audit by the IRS. Rubell is fixing the cash register tapes and pocketing some of the cash as we see in some of the film's scenes.
Shane makes contact and eventually becomes friends with a young married couple who also work in the club. Greg and Anita (Brecklin Meyer and Salma Hayek) help Shane in showing him the nightly operations of the club and the demands Rubell makes on his staff are high indeed. Some prominent visitors the club are a wealthy socialite (Sela Ward) and a daytime soap opera star (Neve Campbell).
'54' is a film that is high on the intimacy of its characters but short on plot substance. It's atmosphere is well captured but the film ends up becoming a watered down version of 'Boogie Nights'. Director Paul Thomas Anderson, who made 'Boogie Nights', wrote his characters in close proximity with each other and gave their lives progress as he set the film over a course of six years. '54' barely makes it out of 1979 and has scenes of a repetitive nature and is riddled with cliched dialogue.
Writer/director Mark Christopher doesn't want to escape from the film's limited diversity but does make his characters interesting and Mike Myers is good as Steve Rubell. Myers has his accent down very well and the film is a good dramatic turn for Myers and he keeps pace with his colleagues Jim Carrey and Robin Williams who have jumped into the realm of serious films with great success. '54' won't quite do it for Myers but if he stays on track, he can hold his own with those other actors.
The rest of the cast in '54' reminded me somewhat of the characters in 1980's 'Fame'. A group of young people with dreams of reaching the big time and finding it through any means necessary. As the closing credits of '54' come into focus, snapshots of the real Steve Rubell are shown with very famous VIP's who frequented his club which closed in 1986 and Rubell died in 1989, closing the book on a chapter of popular culture which takes its place in the history of the 20th century.
OUT OF 5 > * * 1/2
Visit FILM FOLLOW-UP by Walter Frith http://home.netinc.ca/~wfrith/movies.htm
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


--- layout: default ---
ROUXINOL,F. Macroscopic Scale Elements in Quantum Information and Quantum Sensing Applications Spring 2015 Meeting of the APS New York State Section: Quantum Computing and Communication SUNY Fredonia,NY- USA Invited Talk LINK
ROUXINOL, F., LaHaye, M. D., Hao, YU Investigations of a voltage-biased microwave cavity for quantum measurements of nanomechanical resonators APS March Meeting-2015. San Antonio, TX, USA LINK
ROUXINOL,F., Plourde, B., Hang, H Superconducting Metamaterial Transmission Line APS March Meeting-2014 Denver, CO - USA LINK
ROUXINOL,F., LaHaye, M., Hao, H., SHIM, S. Development of a dispersive read-out technique for quantum measurements of nanomechanical resonators APS March Meeting-2013 Baltimore, MD - USA LINK
ROUXINOL,F., LaHaye, M. Development of a dispersive read-out technique for quantum measurements of nanomechanical resonators APS March Meeting-2012 Boston, MA - USA LINK
More than 30 others conferences and meetings before 2012


I am an innovative and passionate developer with a primary interest in JavaScript and its ecosystem. Experienced in designing and implementing sophisticated UI and industry standard UX pattern with Progressive Web Application standards and application life-cycle managements.
View Résumé


express your grievances by filling out the form to rate the kind of ISP you are on and the services been provided.
the system works by collating all results from Ghanaians and providing a rank based on the feedbaok
of what the results says.
rateyourISP stands for fairness, openess, truth
and integrity.
The information provided is not altered in a way to favor a particular telecommunication company and it is as from what Ghanaians are saying.
The platform is open to all Ghanaians who are willing to take sometime and rate their telecomunication company and the data is open and available for Ghanains to access it.
The results is a true reflection of what Ghanaians are saying and it hasn't been altered in anyway only to provide a rating based on the results from the data.
We stand by our words that we won't go against what has been stated as our core values to prividing the state of a telecommunication company in the country.
intrested in other indept analytical report on the various telecommunication companies?
kindly
subscribe to our email newsletter.


First steps with Vert.x and Infinispan REST API (Part 1)
Welcome to the first in a multi-part series of blog posts about creating Eclipse Vert.x applications with Infinispan. The purpose of this first tutorial is to showcase how to create a REST API.
All the code of this tutorial is available in this GitHub repository. The backend is a Java project using Maven, so all the needed dependencies can be found in the pom.xml.
==
What is Vert.x ?
Vert.x is a tool-kit for building reactive applications on the JVM. It’s an event driven and non blocking tool-kit. It is based on the Reactor Pattern, like Node.js, but unlike Node it can easily use all the cores of your machine so you can create highly concurrent and performant applications. Code examples can be found in this repository.
==
REST API
Let’s start creating a simple endpoint that will display a welcome message on '/'. In Vert.x this is done by creating a Verticle. A verticle is a unit of deployment and processes incoming events over an event-loop. Event-loops are used in asynchronous programming models. I won’t spend more time here explaining these concepts as this is very well done in this Devoxx Vert.x talk or in the documentation available here.
We need to override the start method, create a 'router' so '/' requests can be handled, and finally create a http server.
The most important thing to remember about vert.x, is that we can NEVER EVER call blocking code (we will see how to deal with blocking API’s just after). If we do so, we will block the event loop and we won’t be able to serve incoming requests properly.
Run the main method, go to your browser to http://localhost:8081/ and we see the welcome message !
Connecting with Infinispan
Now we are going to create a REST API that uses Infinispan. The purpose here is to post and get names by id. We are going to use the default cache in Infinispan for this example, and we will connect to it remotely. To do that, we are going to use the Infinispan hotrod protocol, which is the recommended way to do it (but we could use REST or Memcached protocol too)
Start Infinispan locally
The first thing we are going to do is to run an Infinispan Server locally. We download the Infinispan Server from here, unzip the downloaded file and run ./bin/standalone.sh.
If you are using Docker on Linux, you can use the Ihttps://hub.docker.com/r/jboss/infinispan-server/[nfinispan Docker Image Available] easily. If you are using Docker for Mac, at the time of this writing there is an issue with internal IP addresses and they can’t be called externally. Different workarounds exist to solve the problem, but the easiest thing for this example is simply downloading and running the standalone server locally. We will see how to use the docker image in Openshift just after.
The hotrod server is listening in localhost:11222.
Connect the client to the server
The code we need to connect with Infinispan from our java application is the following :
This code is blocking. As I said before, we can’t block the event loop and this will happen if we directly call these API’s from a verticle. The code must be called using vertx.executeBlocking method, and passing a Handler. The code in the handler will be executed from a worker thread pool and will pass the result back asynchronously. Instead of overriding the start method, we are going to override start(Future<Void> startFuture). This way, we are going to be able to handle errors.
To stop the client, the API supplies a non blocking method that can be called when the verticle is stopped, so we are safe on that.
We are going to create an abstract CacheAccessVerticle where we will initialise the manager and get default cache. When everything is correct and the defautCache variable is initialised, we will log a message and execute the initSuccess abstract method.
REST API to create names
We are going to add 3 new endpoints.
-
GET /api displays the API name
-
POST /api/cutenames creates a new name
-
GET /api/cutenames/id displays a name by id
CuteNamesRestAPI verticle can now extend this class and override the initSuccess method instead of the start method.
POST
Our goal is to use a curl to create a name like this :
curl -X POST \ -H "Content-Type: application/json" \ -d '\{"name":"Oihana"}' "http://localhost:8081/api/cutenames"
For those that are not familiar with basques names, Oihana means 'rainforest' and is a super cute name. Those who know me will confirm that I’m absolutely not biased making this statement.
To read the body content, we need to add a body handler to the route, otherwise the body won’t be parsed. This is done by calling router.route().handler(BodyHandler.create()).
The handler that will handle the post method in '/api/cutenames' is a RoutingContext handler. We want to create a new name in the default cache. For that, we will call putAsync method from the defaultCache.
The server responds 201 when the name is correctly created, and 400 when the request is not correct.
GET by id
To create a get endpoint by id, we need to declare a route that will take a parameter :id. In the route handler, we are going to call getAsync method.
If we run the main, we can POST and GET names using curl !
curl -X POST -H "Content-Type: application/json" \ -d '\{"id":"42", "name":"Oihana"}' \ "http://localhost:8081/api/cutenames"
Cute name added
curl -X GET -H "Content-Type: application/json" \ "http://localhost:8081/api/cutenames/42" * \{"name":"Oihana"}*
==
Wrap up
We have learned how to create a REST API with Vert.x, powered by Infinispan. The repository has some unit tests using the web client. Feedback is more than welcome to improve the code and the provided examples. I hope you enjoyed this tutorial ! On the next tutorial you will learn how to create a PUSH API.


Welcome to your first mobile web site. It's going to be a lot of topics you've ever learned. Once you get some content and a final project, this semester is over!
Find out about our wonderful programs.
You can also learn more about NPU.
Here you should talk about NPU and how wonderful it is. Most likely though you want to return to the home page.


myquery interval
All options but channel and time are optional.
Channel (c):
Begin date (b):
End date (e):
Limit by binning (l):
Sampling type: (t):
Graphical
Event Simple
myGet
mySampler
Mya deployment (m):
Fractional time digits (f):
Fractional value digits (v):
Data update events only (d):
Include prior point (p):
Enumerations as string (s):
Timestamps as milliseconds from UNIX Epoch (u):
Adjust millis to server timezone offset (a):
Integrate [float events only] (i):


<EMAIL_ADDRESS>Donald Ervin Knuth is an American computer scientist, mathematician, and professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science. He is the author of the multi-volume work The Art of Computer Programming.
my_list = []
for value in range(number_of_loops):
my_list.append(value)
01 - Comprehensions/comprehensionsGood.py
my_list = [value for value in range(number_of_loops)]
01 - Comprehensions/comprehensionsBad.py
1000000 elements
| Execution | Good | Bad |
|---|---|---|
| 1 | 0.09588098526 | 0.132848978043 |
| 2 | 0.0807030200958 | 0.160571098328 |
| 3 | 0.0885989665985 | 0.138249874115 |
def modulus_validation(value):
return value % 2 == 0
my_list = [value for value in range(number_of_loops)
if modulus_validation(value)]
my_tuple = tuple(value for value in range(number_of_loops))
my_set = {value for value in range(number_of_loops)}
my_dict = {value: value for value in range(number_of_loops)}
def generator():
return [x*2 for x in range(number_of_loops)]
def generator_testing():
for loop_count in generator():
foo = loop_count + 3
02 - Generators/generatorsBad.py
def generator():
return (x*2 for x in xrange(number_of_loops))
def generator_testing():
for loop_count in generator():
foo = loop_count + 3
02 - Generators/generatorsGood.py
1000000 elements
| Execution | Good | Bad |
|---|---|---|
| 1 | 90.0547389984 | 76.2436289787 |
| 2 | 80.1943080425 | 91.3688008785 |
| 3 | 84.9249260426 | 77.2983429432 |
1000000 elements
| Execution | Good | Bad |
|---|---|---|
| 1 | 12.6 MiB | 67.1 MiB |
| 2 | 12.7 MiB | 67.3 MiB |
| 3 | 12.6 MiB | 67.3 MiB |
def my_generator(start_value):
while True:
yield start_value
start_value += 1
02 - Generators/generators.py
my_list = [value for value in range(number_of_loops)]
number_of_loops - 10 in my_list
03 - Sets for membership checks/membershipChecksBad.py
my_set = {value for value in range(number_of_loops)}
number_of_loops - 10 in my_set
03 - Sets for membership checks/membershipChecksGood.py
1000000 elements
| Execution | Good | Bad |
|---|---|---|
| 1 | 5.00679016113e-06 | 0.0205149650574 |
| 2 | 5.96046447754e-06 | 0.0210719108582 |
| 3 | 5.00679016113e-06 | 0.0188229084015 |
lis = list(ascii_lowercase)
my_config = config.get_config()
number_of_loops = my_config.getint("Global", "number_of_loops")
examples = [lis[int(random() * 26)] for _ in xrange(number_of_loops)]
def string_joiner():
final_string = ''
for c in examples:
final_string += c
04 - Strings the right way/stringsBad.py
def string_joiner():
''.join(examples)
04 - Strings the right way/stringsGood.py
1000000 elements
| Execution | Good | Bad |
|---|---|---|
| 1 | 0.0123269557953 |<PHONE_NUMBER>99 |
| 2 | 0.0124909877777 |<PHONE_NUMBER>65 |
| 3 | 0.0123250484467 |<PHONE_NUMBER>11 |
print ("Ms. %s! My %s crawled in my %s and then I %s it."
"Can I have another one?" % ("Hoover", "worm", "mouth", "ate"))
print ("Ms. {}! My {} crawled in my {} and then I {} it."
"Can I have another one?".format("Hoover", "worm", "mouth", "ate"))
print ("Ms. {0}! My {2} crawled in my {1} and then I {3} it."
"Can I have another one?".format("Hoover", "worm", "mouth", "ate"))
04 - Strings the right way/stringsBonus.py
Ms. Hoover! My worm crawled in my mouth and then I ate it.Can I have another one?
Ms. Hoover! My worm crawled in my mouth and then I ate it.Can I have another one?
Ms. Hoover! My mouth crawled in my worm and then I ate it.Can I have another one?
def intermediate_testing():
for loop_count in range(number_of_loops):
print ('Hi')
print ('How')
print ('Are')
print ('You')
05 - Avoid intermediate outputs/intermediateBad.py
def intermediate_testing():
for loop_count in range(number_of_loops):
print ('Hi how are you')
05 - Avoid intermediate outputs/intermediateGood.py
1000000 elements
| Execution | Good | Bad |
|---|---|---|
| 1 | 1.32236790657 | 4.83762598038 |
| 2 | 1.45444393158 | 5.39266395569 |
| 3 | 1.38991999626 | 4.99856710434 |
def intermediate_no_print_testing():
for loop_count in range(number_of_loops):
foo = 20
foo += 20
foo += 20
foo += 20
def intermediate_no_print_testing():
for loop_count in range(number_of_loops):
foo = 20 + 20 + 20
1000000 elements
| Execution | Good | Bad |
|---|---|---|
| 1 | 0.0615119934082 | 0.141456842422 |
| 2 | 0.0611300468445 | 0.140588998795 |
| 3 | 0.0617189407349 | 0.143658161163 |
def expensive_function(value):
return value * 2
def cache_testing():
for loop_count in range(number_of_loops):
expensive_function(loop_count % 8)
06 - Cache the most requested results/cacheBad.py
@lru_cache(maxsize=cache_size)
def expensive_function(value):
return value * 2
def cache_testing():
for loop_count in range(number_of_loops):
expensive_function(loop_count % 8)
06 - Cache the most requested results/cacheGood.py
1000000 elements
| Execution | Good | Bad |
|---|---|---|
| 1 | 0.0140950679779 | 0.00322794914246 |
| 2 | 0.013916015625 | 0.00336909294128 |
| 3 | 0.0149850845337 | 0.00322699546814 |
def expensive_function(value):
time.sleep(0.5)
return value * 2
def cache_testing():
for loop_count in range(number_of_loops):
expensive_function(loop_count % 8)
06 - Cache the most requested results/cacheBad.py
@lru_cache(maxsize=cache_size)
def expensive_function(value):
time.sleep(0.5)
return value * 2
def cache_testing():
for loop_count in range(number_of_loops):
expensive_function(loop_count % 8)
06 - Cache the most requested results/cacheGood.py
1000000 elements
| Execution | Good | Bad |
|---|---|---|
| 1 | 4.0050110817 | 50.057502985 |
| 2 | 4.00507116318 | 50.055670023 |
| 3 | 4.00501394272 | 50.0575909615 |


Every paragraph will be affected by the style.
Me too!
And me!
Hello World!
This paragraph is not affected by the style.


Discover the best hotels in China for design pilgrims
From gleaming city towers to ancient ruins reborn as temples of relaxation
by Kylie McDowellA new generation of hotels is emerging across China that puts a fresh spin on the country’s hospitality traditions, from gleaming towers in urban centres to ruins revived as contemporary rural retreats. This cache of hotels is pitched at foreign tourists and China’s burgeoning middle-class alike, with architects using these testbeds to create design destinations.
We’ve scoured the country for the most innovative inns and ambitious adaptive reuse projects, reborn as the best China design hotels.
Alila Yangshuo Hotel in Guilin, Guangxi province
Alila Yangshuo Hotel is a converted 1960s sugar mill surrounded by mountainous landscapes in southern China’s Guangxi region. The industrial building was transformed into a modern resort by Beijing-based Vector Architects. The practice has taken the shells of the former mill buildings and old sugar cane truss and reimagined the complex using perforated concrete and latticed wood. The boutique hotel is a striking blend of old and new, centred around a reflecting pond and elevated swimming pool.
102 Dongling Road, Guilin, Guangxi, China
Lost Villa in Zhongwei, Ningxia province
Zhongwei’s Lost Villa is a cluster of 15 concrete rooms connected by winding paths on the banks of the Huanghe River. Shanghai practice DAS Lab designed the earth-coloured buildings to blend into the desert terrain while rooftop terraces provide views of the mountains and forests beyond. These neutral tones extend to minimalist interiors fitted with timber floors, concrete walls and simple furniture.
Shangyou Village, Changle, Shapotou District, Zhongwei, Ningxia, China
Annso Hill Hotel in Tengchong, Yunnan province
Western China’s angular Annso Hill Hotel by Hangzhou practice Studio Qi is a labyrinth of white lines that unfurl into Tengchong’s ancient forest. Each of the 13 rooms has leafy views of nature through floor-to-ceiling glass windows that contrast all-white interiors, including furniture which has been designed to blend into the walls. The hotel has a geometric, tiered restaurant, yoga room and gallery space.
102 Dongling Road, Guilin, Yunnan, China
Hotel Far & Near Nanhao St in Guangzhou, Guangdong province
Hotel Far & Near Nanhao St in the centre of Guangzhou was designed by Shanghai practice Kooo Architects. Lofty ceilings and stripped-back concrete walls give the industrial building a sense of scale in the crowded city centre. Frosted windows provide privacy and while drawing natural light into the minimalist interiors of its bedrooms, and the China hotel has a rooftop terrace and garden with views over the city below.
Nanhaojie #36, Guangzhou, Guangdong, China
The Walled Tsingpu Yangzhou Retreat in Jiangsu province
Neri & Hu designed this 20-room boutique hotel by Yangzhou’s scenic Slender West Lake. The firm took cues from the local architectural vernacular to give new life to existing buildings on the site, connecting them via a gridded maze of paths and walls constructed from reclaimed grey brick. Accommodations have courtyard enclosures and are surrounded by lakes and landscaped gardens that contrast the industrial character of the hotel.
1 Baocheng Road, Hanjiang District, Yangzhou, Jiangsu, China
Bieyuan Boutique Hotel in Xinyang, Henan province
This traditional Chinese feng shui hotel by 3andwichdesign and He Wei Studio has water flowing through it from a nearby river while its architecture plays on the relationship between houses, yards and paths. The idyllic countryside stay in China’s Xin County is set within the hinterlands of the Dabie Mountains and is surrounded by forest. Multi-purpose halls have been created inside the red-brick structure for group gatherings and meditation spaces for self-cultivation. Guests can go tea picking or mountain climbing, or relax by the fire.
Xin County, Dabie Mountain Camping Park, Xinyang City, Henan, China
Rose Garden Boutique Hotel in Huzhou, Zhejiang province
The Rose Garden Boutique Hotel in China’s Huzhou City occupies the site of an old farmhouse. Practice JSPA Design has combined local traditional techniques and materials with modern additions to transform it into a boutique hotel. A boxy steel and glass facade opens onto a pool, and the hotel has a terrace on the second floor which overlooks the gardens which give the retreat its name.
Daixi Village, Wuxing District, Huzhou, Zhejiang, China
Wuyuan Skywells Hotel in Wuyuan, Jiangxi province
A 300-year-old ruin was given new life as the Wuyuan Skywells Hotel in China’s Jiangxi province. Anyscale Architecture Design restored the former inn, preserving many of its original details. Hand-carved friezes and clay walls are restored, and guests can catch a glimpse of the rural hotel’s past in the form of faded characters spelling out quotes from Chairman Mao. The adaptive reuse project has new additions such as the glass-framed dining space, and its 14 rooms feature exposed beams, white walls and wooden furnishing.


Create New Location
Location
Minimum Customers Per Hour
Maximum Customers Per Hour
Average Cookies Per Hour
Submit New Location Data!


I was relatively new to drugs in general; although I had drank for years there was always a threat of job-related drug tests that kept me from cannibis. Once I went away for college, however, the threat was gone and after some initial reluctance, tried herb for my first time. Soon after, I ate mushrooms, and had a fun though not very visual experience. Similar experiences 2 times after that. I found the minor visuals that mushrooms gave me to not be enough, so I kept my eye out for LSD. It never came. At the end of the 2nd semester, I wanted to trip very badly (my last mushroom trip had been an incredibly happy experience). That's when my brother mentioned nutmeg to me. I was at first hesitant but after reading about it decided it was worth a try.
Anyway, enough background. My first trip was on a whim on a thursday night. Some friends and I went to the grocery store and got some whole nutmeg from a jar. I ate a bunch of it, and I think it was fairly fresh because it didn't taste too terribly to me. I washed it down with OJ which worked very well to deal with the taste, which wasn't awful but not good by any stretch. After eating, some other friends of mine (who didn't know I was nutmegging) went out to play frisbee; this was almost immediately after ingestion.
I didn't notice it all through the frisbee, but when I got back to my dorm (sometime around midnight or 1) I was talking to a friend and realized I was A) making not much sense and B) had forgotten what I was talking about. I had almost forgotten I'd eaten the 'meg, and when he asked if I was stoned I uttered an awkward, 'No' and went to my room. I did some other stuff before the upcoming journal but I don't remember it very well, except for talking to a straight edge girl who knew something was up (eyes were red as hell at this point). Anyway the following journal gives you an idea of how if affected me later that night. NOTE: other than the comments inside the [], this is unabridged from how I wrote it that night.
[Ed. dropped 15-20 g of whole nutmeg out of a jar at 10-10:30 PM]
1:56 AM: Just realized that taking a journal would be a neat idea. Just took a drink of juice and imagined typing. Drymouth and redeye are severe. Lost juice cap. Hoping symptoms are not placebo-based. Time ssems to pass slower. Like in some ways to a strange brand of stoned. Rubbing eyes quite a bit now. Deciding not to leave room in order to hide my tripping from the floor. Listening to techno.
2:02 AM: Sense of touch is altered... very hard to describe, slightly pleasant. Attenion span becoming nil... getting cold so turned down the fan. Wondering if what's being written makes sense, if that last part was in the right point of view, and if this whole journal is being kept in a weird point of view. Holy fuck, i just lost track of what vi was doing. Going to do everything possible to stay awake. This took 5 minutes of concentration to write.
2:15 AM: Concentration difficulites amazing. Music sounds really cool.
2:17 AM: Short term memory virtually nonexistant.
2:20 AM: Enjoying not focusing the eyes. Wonders how much will be written. Wonder if this is how Hunter S. Thompson works.
2:25 AM: wonders about the existance of luck, and where the wonderer's luck ran as compared to the rest of the world's. Wonder about the value of money in luck calculation. Is the rest of the world really as shitty as the media would like to tell us?
2:31 AM: Realizes the last post was pure stream of conciousness.  Just read a section of Horton Hears a Who. It is such democratic propaganda.  Can't remember what it was though.
3:05 AM: falling asleep is a major concern.
[Ed. sometime after this I fell asleep]
The whole experience was different, but I wouldn't call it tripping. Just weird. It was very internal and I had a few insights but not a lot. I had one dream while passed out on my desk that involved flying through a lumpy tunnel with a loud whooshing sound.
The next day (Friday) I felt really drunk/stoned, and had to go to class. At lunch, my friends (most of which didn't know) what was up commented on my eyes. Drymouth was bad too. The only trippy thing that happened was when I was sitting in class (I could barely concentrate) I heard the breathing of the guy behind me turned into a loud whooshing sound on the right side of my head similar to the dream. It was slightly pleasant.
That night, however, I had very painful constipation, which was really the only bad side effect although the day of stoned/drunk wasn't very fun (there was no real pleasure attached to the feeling).
By the time the next day (Saturday) rolled around I was good to go and actually engaged in a boxing match.
That was my first nutmeg experience. My second one was of a more sinister flavor. It was less than a month after the first one, and I was extremely bored at home (classes had just ended). So I took some of my remaining nutmeg, about 20-25 grams. I did this at school (I was taking summer classes) sitting on the quad for added personal irony and since I wasn't driving home. The nutmeg had been kept in a bag in my backpack for several weeks, and I could tell. It tasted far worse than last time, and I actually gagged, but I choked it down. I ate it at 12:30 or 1:30 Friday afternoon.
When I got home, I stayed in my room for the remainder of the day. First effects were neat: I'd lean back in my chair and felt like I was floating, though it wasn't very acute. However, by the time that dinner rolled around my eyes were red as hell and watching TV was funnier than it should have been. I was in the heavy stages of drunk/stoned and talking to my parents was not very easy. I listened to a lot of music, but I really don't remember much of the entire day.
Once again the trip was not trippy in the traditional sense: zero visuals this time. However, inside my mind was flayed open. I thought about my own behavior and it was very transparent: why I do this, from whom I picked up this idiosychracy.
The real screwy part was late that night (11-1AM) after my brother got home. He knew I was tripping and talked to me for awhile. The only part I remember was when he said something about me not telling the truth. I think it was about me falling asleep (I was very tired at that point and would pass out on my bed occasionally). I barely remember attacking him.  Basically, I grabbed him by the neck and he threw me onto my bed.  I had lost touch with the world. I saw everything clearly, and heard stuff, but it did not stay in my head long enough for me to react properly. Eventually I passed out.
The next day I was drunk/stoned again and smoked some bud to ease me down. I took precautions (like forcing myself) and evaded the painful constipation that marred my last experience. The sinister part happened during that week. Everything looked normal, yet was not. I was plagued by irrational unhappiness and did not like anything that I saw. I could tell my thought pattern had been altered, but in an almost indescribable way, though in no ways positive. This lasted until Wednesday. On Thursday it was as if nothing happened.
So in conclusion, nutmeg was not what I was looking for, although I did have some fun on it. I think my last trip may have been bad because I was having a bad week, but I do not think I am going to risk it again. Admittedly the scars of the experience have disappeared in time, and now about a month and a half later I've actually considered doing it once more. However, the following days of insanity were too much for me and I think the rational part of my personality knows this and will keep me away from it. Perhaps in time I will try it again, but I have no plans to.
Is nutmeg for you? I do not know. I am neither advocating nor denouncing it. My experience was different from most I read. However, much of it I do not remember. If you do indulge, just keep your head about you and make sure you are in a good mood to do it. And erase any social plans you have for the next twenty-four hours or so.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Selections: 2. Girdle of the Realm-racer, 3. Dark Delusions, Arcane Bolt, Haze Staff, Mystic Shield, Shadow-cloaked Claws
Categories: CHAOS, MORTAL, SLAANESH, HEDONITE, HERO, Leader, WIZARD, SHARDSPEAKER, 9 or less wounds Leader, Artefact
Artefact: Girdle of the Realm-racer, Spell: Arcane Bolt, Dark Delusions, Mystic Shield, Reflection Eternal, Unit: Shardspeaker of Slaanesh, Unit Abilities: Fly, Mist Lurkers, Twisted Mirror, Weapon: Haze Staff, Shadow-cloaked Claws
| Artefact | Artefact Details | Ref |
|---|---|---|
| Girdle of the Realm-racer | Subtract 1 from the bearer's Wounds characteristic. In addition, the bearer can fly. |
| Spell | Casting Value | Range | Description | Ref |
|---|---|---|---|---|
| Arcane Bolt | 5 | 12" | If successfully cast, at the start of any 1 phase before your next hero phase, you can pick 1 enemy unit within range and visible to the caster. That unit suffers 1 mortal wound. If that unit is within 3" of the caster, it suffers D3 mortal wounds instead of 1. | |
| Dark Delusions | 4 | Pick 1 enemy unit wholly within 18" of the caster that is visible to them, and roll 2D6. If the roll is equal to or greater than that unit's Bravery characteristic, add 1 to hit rolls for attacks that target that unit until your next hero phase. | ||
| Mystic Shield | 5 | 12" | If successfully cast, pick 1 friendly unit wholly within range and visible to the caster. Add 1 to save rolls for attacks that target that unit until your next hero phase. | |
| Reflection Eternal | 6 | If successfully cast, pick 1 enemy unit within 12" of the caster that is visible to them. Subtract 1 from wound rolls for attacks made by that unit in the following combat phase. |
| Unit | Move | Wounds | Bravery | Save | Ref |
|---|---|---|---|---|---|
| Shardspeaker of Slaanesh | 6" | 5 | 7 | 5+ |
| Unit Abilities | Ability Details | Ref |
|---|---|---|
| Fly | This unit can fly. | |
| Mist Lurkers | If this unit successfully casts a spell that is not unbound, until your next hero phase, you can add 1 to save rolls for attacks that target this unit and it can attack using the Shadow-cloaked Claws melee weapon when it fights. | |
| Twisted Mirror | Once per turn in your shooting phase, you can pick 1 enemy unit within 9" of this model and roll a dice. On a 3+, add 1 to wound rolls for attacks that target that unit in the following combat phase. The same unit cannot be affected by this ability more than once per turn. |
| Weapon | Type | Range | Attacks | To Hit | To Wound | Rend | Damage | Ref |
|---|---|---|---|---|---|---|---|---|
| Haze Staff | Melee | 1" | 2 | 4+ | 3+ | - | D3 | |
| Shadow-cloaked Claws | Melee | 2" | 4 | 3+ | 3+ | -2 | 1 |
Selections: 1. Lash of Slaanesh, Axe of Dominion, General, Scourging Whip
Categories: CHAOS, DAEMON, DAEMONETTE, HERALD OF SLAANESH, HERO, SLAANESH, HEDONITE, WIZARD, Unique, Leader, Behemoth, 9 or less wounds Leader, General, Unique General
Command Abilities: Regal Authority, Magic: Magic, Spell: Lash of Slaanesh, Subvert, Unit: Syll'esske the Vengeful Allegiance, Unit Abilities: Deadly Symbiosis, Lithe and Swift, The Vengeful Allegiance, Weapon: Axe of Dominion, Scourging Whip
| Command Abilities | Command Ability Details | Ref |
|---|---|---|
| Regal Authority | You can use this command ability at the start of the battleshock phase if this model is your general and is on the battlefield. If you do so, until the end of that phase, do not take battleshock tests for friendly SLAANESH units while they are wholly within 18" of this model. |
| Magic | Cast/Unbind | Spells Known | Ref |
|---|---|---|---|
| Magic | 1/1 | Arcane Bolt, Mystic Shield, Subvert |
| Spell | Casting Value | Range | Description | Ref |
|---|---|---|---|---|
| Lash of Slaanesh | 5 | Pick 1 point on the battlefield within 12" of the caster that is visible to them, and draw an imaginary straight line 1mm wide between that point and the closest part of the caster's base. Roll a dice for each enemy model passed across by this line. On a 4+ that model's unit suffers 1 mortal wound. SLAANESH units are unaffected by this spell. | ||
| Subvert | 7 | You can pick 1 enemy HERO within 18" of the caster that is visible to them. Until your next hero phase, that HERO cannot issue or receive commands. |
| Unit | Move | Wounds | Bravery | Save | Ref |
|---|---|---|---|---|---|
| Syll'esske the Vengeful Allegiance | 8" | 9 | 10 | 4+ |
| Unit Abilities | Ability Details | Ref |
|---|---|---|
| Deadly Symbiosis | You can re-roll hit rolls of 1 for attacks made with melee weapons by friendly HEDONITE units wholly within 18" of this model if the number of friendly MORTAL HEDONITE units wholly within 18" of this model is equal to the number of other friendly DAEMON HEDONITE units wholly within 18" of this model. | |
| Lithe and Swift | This unit can run and still charge later in the same turn. | |
| The Vengeful Allegiance | In the combat phase, if the unmodified hit roll for any attack made with a melee weapon that targets this model is 1, add 1 to hit and wound rolls for attacks made by this model that target the attacking unit in the same phase. |
| Weapon | Type | Range | Attacks | To Hit | To Wound | Rend | Damage | Ref |
|---|---|---|---|---|---|---|---|---|
| Axe of Dominion | Melee | 2" | 4 | 4+ | 3+ | -2 | D3 | |
| Scourging Whip | Melee | 2" | 8 | 3+ | 4+ | -1 | 1 |
Selections: 11 Blissbarb Archers [180pts], Blissbarb Bow, Blissbrew Homonculus, High Tempter, Sybarite Blade
Categories: CHAOS, MORTAL, SLAANESH, HEDONITE, Battleline
Unit: Blissbarb Archers, Unit Abilities: Blissbrew Homonculus, High Tempter, Light-footed Killers, Weapon: Blissbarb Bow, Sybarite Blade
| Unit | Move | Wounds | Bravery | Save | Ref |
|---|---|---|---|---|---|
| Blissbarb Archers | 6" | 1 | 6 | 6+ |
| Unit Abilities | Ability Details | Ref |
|---|---|---|
| Blissbrew Homonculus | 1 in every 11 models in this unit must be a Blissbrew Homonculus. A Blissbrew Homonculus is armed with a Sybarite Blade. Add 1 to wound rolls for attacks made with missile weapons by this unit while it includes any Blissbrew Homonculi. | |
| High Tempter | 1 model in this unit can be a High Tempter. Add 1 to the Attacks characteristic of that model’s Blissbarb Bow. | |
| Light-footed Killers | This unit can run and still shoot later in the same turn. |
| Weapon | Type | Range | Attacks | To Hit | To Wound | Rend | Damage | Ref |
|---|---|---|---|---|---|---|---|---|
| Blissbarb Bow | Ranged | 18" | 2 | 4+ | 4+ | -1 | 1 | |
| Sybarite Blade | Melee | 1" | 1 | 4+ | 4+ | - | 1 |
Selections: 10 Daemonettes [140pts], Banner Bearer(s), Hornblower(s), Piercing Claws
Categories: CHAOS, DAEMON, DAEMONETTE, SLAANESH, Battleline, HEDONITE
Unit: Daemonettes of Slaanesh, Unit Abilities: Alluress, Banner Bearers, Hornblower, Icon and Standard Bearers, Lithe and Swift, Weapon: Piercing Claws
| Unit | Move | Wounds | Bravery | Save | Ref |
|---|---|---|---|---|---|
| Daemonettes of Slaanesh | 6" | 1 | 10 | 5+ |
| Unit Abilities | Ability Details | Ref |
|---|---|---|
| Alluress | The leader of this unit is the Alluress. Add 1 to the Attacks characteristic of an Alluress' Piercing Claws. | |
| Banner Bearers | You can re-roll charge rolls for this unit while it includes any Daemonette Banner Bearers. | |
| Hornblower | 1 in every 10 models in this unit can be a Hornblower. If the unmodified roll for a battleshock test for an enemy unit that is within 6" of this unit while this unit includes any Daemonette Hornblowers is 1, that battleshock test must be re-rolled. | |
| Icon and Standard Bearers | 1 in every 5 models in this unit can either be a Daemonette Banner Bearer or Daemonette Icon Bearer. | |
| Lithe and Swift | This unit can run and still charge later in the same turn. |
| Weapon | Type | Range | Attacks | To Hit | To Wound | Rend | Damage | Ref |
|---|---|---|---|---|---|---|---|---|
| Piercing Claws | Melee | 1" | 2 | 4+ | 4+ | -1 | 1 |
Selections: 5 Seekers [140pts], Heartseeker, Hornblower, Piercing Claws, Poisoned Tongue, Seeker Icon Bearer
Categories: CHAOS, DAEMON, DAEMONETTE, SEEKERS, SLAANESH, Other
Unit: Seekers, Unit Abilities: Heartseeker, Hornblower, Icon and Standard Bearers, Quicksilver Speed, Seeker Icon Bearer, Soul Hunters, Weapon: Piercing Claws, Poisoned Tongue
| Unit | Move | Wounds | Bravery | Save | Ref |
|---|---|---|---|---|---|
| Seekers | 14" | 2 | 10 | 5+ |
| Unit Abilities | Ability Details | Ref |
|---|---|---|
| Heartseeker | 1 model in this unit can be a Heartseeker. Add 1 to the Attacks characteristic of a Heartseeker’s Piercing Claws. | |
| Hornblower | 1 in every 5 models in this unit can be a Seeker Hornblower. If the unmodified roll for a battleshock test for an enemy unit that is within 6" of this unit while this unit includes any Seeker Hornblowers is 1, that battleshock test must be re-rolled. | |
| Icon and Standard Bearers | 1 in every 5 models in this unit can be a Seeker Banner Bearer, and 1 in every 5 models in this unit can be a Seeker Icon Bearer. | |
| Quicksilver Speed | You can roll 2D6 instead of D6 when you make a run roll for this unit. In addition, this unit can run and still charge later in the same turn. | |
| Seeker Icon Bearer | If an unmodified battleshock roll of 1 is made for this unit while it includes any Seeker Icon Bearers, you can add D3 models to this unit, and no models from this unit will flee in that phase. | |
| Soul Hunters | If any enemy models were slain by wounds inflicted by this unit’s attacks in the combat phase, add 1 to the Attacks characteristic of this unit’s melee weapons in the next combat phase. |
| Weapon | Type | Range | Attacks | To Hit | To Wound | Rend | Damage | Ref |
|---|---|---|---|---|---|---|---|---|
| Piercing Claws | Melee | 1" | 2 | 4+ | 4+ | -1 | 1 | |
| Poisoned Tongue | Melee | 1" | 2 | 3+ | 4+ | - | 1 |
Selections: 3 Slaangor Fiendbloods [150pts], Razor-sharp Claw(s), Slake-Horn
Categories: CHAOS, BEASTS OF CHAOS, Other, HEDONITE, SLAANESH, MORTAL
Unit: Slaangor Fiendbloods, Unit Abilities: Obsessive Violence, Slake-Horn, Slaughter At Any Cost, Weapon: Gilded Weapon, Razor-sharp Claw(s)
| Unit | Move | Wounds | Bravery | Save | Ref |
|---|---|---|---|---|---|
| Slaangor Fiendbloods | 8" | 3 | 6 | 5+ |
| Unit Abilities | Ability Details | Ref |
|---|---|---|
| Obsessive Violence | At the end of the combat phase, pick 1 enemy unit within 3" of this unit and roll a dice for each model in this unit. For each 4+, that enemy unit suffers 1 mortal wound. | |
| Slake-Horn | 1 model in this unit can be a Slake-Horn. That model is armed with a Razorsharp Claw and Gilded Weapon. | |
| Slaughter At Any Cost | Add 1 to the Attacks characteristic of this unit’s melee weapons if it made a charge move in the same turn. |
| Weapon | Type | Range | Attacks | To Hit | To Wound | Rend | Damage | Ref |
|---|---|---|---|---|---|---|---|---|
| Gilded Weapon | Melee | 1" | 2 | 4+ | 3+ | -1 | 2 | |
| Razor-sharp Claw(s) | Melee | 2" | 3 | 4+ | 3+ | -1 | 1 |
Categories: Allegiance
Selections: Godseekers Host
Categories: Coalition: Beasts of Chaos, Coalition: Slaves to Darkness
Battalion Organisation: Godseekers Hedonite Host, Battle Trait: Euphoric Killers, Feast of Depravities, Locus of Diversion, Maniacal Hunters, Thundering Cavalcade, Total Acquiescence, Depravity Point Table: (01) 1 Keeper of Secrets, (02) 30 Daemonettes, (03) 3 Seeker Chariots, (04) 20 Daemonettes, (05) 1 Contorted Epitome, (06) 1 Bladebringer, Herald on Exalted Chariot, (07) 3 Fiends, (08) 1 Bladebringer, Herald on Hellflayer, (09) 1 Exalted Chariot, (10) 1 Infernal Enrapturess, Herald of Slaanesh, (11) 1 Bladebringer, Herald on Seeker Chariot, (12) 1 Hellflayer, (13) 1 Viceleader, Herald of Slaanesh, (14) 1 Seeker Chariot, (15) 5 Seekers, (16) 10 Daemonettes
| Battalion Organisation | Required | Ref |
|---|---|---|
| Godseekers Hedonite Host | Hedonite Hosts in your army must have 0-2 Epicurean Revellers battalions instead of 1-3, and 2-4 Seeker Cavalcade battalions instead of 1-3. |
| Battle Trait | Battle Trait Details | Ref |
|---|---|---|
| Euphoric Killers | If the unmodified hit roll for an attack made with a melee weapon by a HEDONITE model is 6, that attack inflicts 2 hits on the target instead of 1. Make a wound and save roll for each hit. If the attacking model’s unit has 20 or more models, its attacks inflict 3 hits on an unmodified hit roll of 6 instead. | |
| Feast of Depravities | You can summon SLAANESH DAEMON units to the battlefield if you collect enough depravity points (DPs). At the end of the battleshock phase, you receive 1 depravity point for each unit on the battlefield that had a wound or mortal wound that was not negated allocated to it in that turn, or has fewer models than it had at the start of that turn. If you have any depravity points at th end of your movement phase, you can summon 1 unit from the list below to the battlefield and add it to your army. Each unit you summon costs a number of depravity points as shown on the list, and you can only summon a unit if you have enough depravity points to do so. Summoned units must be set up wholly within 12" of a friendly SLAANESH HERO and more than 9" from any enemy units. |
|
| Locus of Diversion | At the end of the charge phase, each friendly HEDONITE DAEMON HERO that is within 1" of an enemy unit can create a locus of diversion. If they do so, pick 1 enemy unit that is within 1" of that HERO and roll a dice, adding 1 if that HERO is a GREATER DAEMON. On a 4+, that unit cannot make a pile-in move before it attacks in the same combat phase. You cannot pick the same unit as the target for this ability more than once in the same phase (whether the roll is successful or not). | |
| Maniacal Hunters | At the end of your charge phase, you receive D3 depravity points if your general made a charge move in the same turn. Add 1 to the roll if any other friendly GODSEEKERS units made a charge move in that turn. | |
| Thundering Cavalcade | Add 1 to charge rolls for friendly GODSEEKERS units. | |
| Total Acquiescence | Any number of SLAANESH WIZARDS in a Hedonites of Slaanesh army that have the Acquiescence spell on their warscroll can use it in the same turn, but the same WIZARD cannot attempt to cast it more than once per turn. |
| Depravity Point Table | Cost | Ref |
|---|---|---|
| (01) 1 Keeper of Secrets | 12 | |
| (02) 30 Daemonettes | 12 | |
| (03) 3 Seeker Chariots | 10 | |
| (04) 20 Daemonettes | 10 | |
| (05) 1 Contorted Epitome | 9 | |
| (06) 1 Bladebringer, Herald on Exalted Chariot | 9 | |
| (07) 3 Fiends | 8 | |
| (08) 1 Bladebringer, Herald on Hellflayer | 8 | |
| (09) 1 Exalted Chariot | 7 | |
| (10) 1 Infernal Enrapturess, Herald of Slaanesh | 7 | |
| (11) 1 Bladebringer, Herald on Seeker Chariot | 7 | |
| (12) 1 Hellflayer | 7 | |
| (13) 1 Viceleader, Herald of Slaanesh | 6 | |
| (14) 1 Seeker Chariot | 6 | |
| (15) 5 Seekers | 6 | |
| (16) 10 Daemonettes | 6 |
Selections: 1000 Points - Vanguard
Categories: Game Options, Vanguard
Selections: Prized Sorcery
Categories: Game Options, Grand Strategy
Grand Strategy: Prized Sorcery
| Grand Strategy | Description | Ref |
|---|---|---|
| Prized Sorcery | When the battle ends, you complete this grand strategy if there are any WIZARDS from your starting army on the battlefield. |
Created with BattleScribe


39 migrants detained after four boats stopped near Dover
by Georgina HayesThe group caught up in the ‘incredibly dangerous’ crossing said they were Iranian
A total of 39 people have been detained after four small boats were intercepted attempting to cross the English Channel. The boats were discovered near Dover early on Sunday morning, with officials first being alerted to a vessel carrying nine people at 4.30am.
Border Force officials made a second interception at 6am, when a vessel carrying five people was found. Between 7am and 7.30am a further two boats were intercepted, with 11 people on the first and 14 on the second.
All 39 presented themselves as Iranian nationals, a government spokesperson said.
A Home Office spokeswoman said: “Border Force dealt with four incidents on November 17 after being alerted to small boats travelling across the Channel towards the UK. The people from all boats were taken to Dover, where they were medically assessed before being interviewed by immigration officials.
“Crossing the Channel in a small boat is incredibly dangerous. Anyone attempting the journey is taking a huge risk with their life and the lives of their loved ones.”
In September, a record 86 migrants crossed the English Channel in a single day.


This text is important.
This text indicates success.
This text represents some infomation.
This text represents a warning.
This text represents danger.
This text is important.
This text indicates success.
This text represents some infomation.
This text represents a warning.
This text represents danger.


Implementation of a virtual sphere shape. More...
#include <CShapeSphere.h>
Public Member Functions | |
| cShapeSphere (const double &a_radius) | |
| Constructor of cShapeSphere. | |
| virtual | ~cShapeSphere () |
| Destructor of cSphere. | |
| virtual void | render (const int a_renderMode=0) |
| Render object in OpenGL. | |
| virtual void | updateBoundaryBox () |
| Update bounding box of current object. | |
| virtual void | scaleObject (const cVector3d &a_scaleFactors) |
| Object scaling. | |
| virtual void | computeLocalInteraction (const cVector3d &a_toolPos, const cVector3d &a_toolVel, const unsigned int a_IDN) |
| Update the geometric relationship between the tool and the current object. | |
| void | setRadius (double a_radius) |
| Set radius of sphere. | |
| double | getRadius () |
| Get radius of sphere. | |
Protected Attributes | |
| double | m_radius |
| radius of sphere. |
Implementation of a virtual sphere shape.
| cShapeSphere::cShapeSphere | ( | const double & | a_radius | ) |
| void cShapeSphere::computeLocalInteraction | ( | const cVector3d & | a_toolPos, | |
| const cVector3d & | a_toolVel, | |||
| const unsigned int | a_IDN | |||
| ) | [virtual] |
Update the geometric relationship between the tool and the current object.
From the position of the tool, search for the nearest point located at the surface of the current object. Decide if the point is located inside or outside of the object
| a_toolPos | Position of the tool. | |
| a_toolVel | Velocity of the tool. | |
| a_IDN | Identification number of the force algorithm. |
Reimplemented from cGenericObject.
| void cShapeSphere::render | ( | const int | a_renderMode = 0 |
) | [virtual] |
Render object in OpenGL.
Render sphere in OpenGL
| a_renderMode | See cGenericObject::render() |
Reimplemented from cGenericObject.
| void cShapeSphere::scaleObject | ( | const cVector3d & | a_scaleFactors | ) | [virtual] |
Object scaling.
Scale object of defined scale factor
| a_scaleFactors | Scale factor |
Reimplemented from cGenericObject.


2 April 2021
Welcome to our new lab member Caitlin Fenrich! Congratulations on securing an
I-Steam internship, Caitlin!
15 March 2021
A paper by Viktoria and colleagues on invasions in European woodlands was accepted in the Macroecology Species Feature of the Journal of Vegetation Science.
Read it here
21 February 2021
Kaitlin and Raytha each secured a
ACA Biodiversity Grant. Well done, ladies!
14 January 2021
Zoey defended her MSc thesis on non-native plant invasions in Alberta prairies. Congratulations, Zoey!
6 January 2020
Welcome to our new undergraduate research students: Elise (BIOL 499), Cedric and Rachelle (BIOL 299)!
3 September 2020
Welcome to our new lab members Kaitlin (MSc) and Daniel (BIOL 499)!
6 December 2019
Congratulations to Raytha for securing a University of Alberta Graduate Fellowship and to Zoey for securing an Alberta Graduate Excellence Scholarship. Well done!
6 December 2019
We have found an MSc candidate for the advertised MSc position in our lab. There are currently no open positions.
23 October 2019
We are looking for an MSc student to join our lab in Sep 2020. '
More details'
29 August 2019
Thanks to our undergraduate research assistants Anna, Georgena, Ilana, Jada and Kennedy for their help this summer!
27 May 2019
Yay, our lab received funding from NSERC, the Rangeland Research Institute, the Montana and the Idaho Native Plant Societies. Thanks for the support!
25 May 2019 Let the field season begin. This year: Alberta prairie grassslands & forests and bedrock meadows in BC, Montana & Idaho.
25 January 2019
Welcome to Zoey & Raytha! Two new grad students that joined the lab.
23 January 2019
Thanks to Georgena for volunteering in our lab!
19 October 2018
New publication from our lab: Book chapter on '
Grasslands of Kazakhstan and Middle Asia' In Squires et al. 'Grasslands of the World'
14 August 2018
A big thank you to the summer volunteers in our lab: Ilsa, Mary and Nathanael!
13 August 2018
I have now found two candidates who will apply for admission to the graduate program at UofA. Thanks to all applicants!
6 June 2018
We are doing fieldwork in Montana, Idaho, BC and Alberta. Surveying meadow and grassland communities. Check out Twitter (@Viktoria.Wagner1) for pictures of habitats and cool plants!
23 March 2018
U Alberta students: The course BIOL 430 - (Experimental Biology) is now open for online registration on BearTracks. The departmental consent was lifted.
21 March 2018
Two graduate student positions available in the Wagner Ecology lab to conduct research on (1) Non-native plant invasions across prairie grasslands (focus on fieldwork) and (2) Levels of non-native plant invasions across habitats (focus on programming). For more information, see
here.
20 March 2018
We have now filled the three field assistant positions for May & June 2018. Thanks to everybody who applied!
20 March 2018
I will be teaching *
BIOL 430 - Experimental Biology* in Fall 2018. Students will learn how to use the R programming language, design a study, perform statistical tests, and visualize results with graphics. Registration is now open on BearTracks. See
here for more information.
23 January 2018
Our lab is recruiting
3 Seasonal Field Assistants to help with research in May & June 2018.
Application deadline: 9 Feb 2018. Download the advertisement
here.
4 January 2018
New accepted manuscript in Restoration Ecology: “Timing of seeding after herbicide application influences rates of germination ….” – Great collaboration with Christine McManamen and Cara R. Nelson (U Montana).
19 December 2017
The Wagner lab is recruiting members. Check out the homepage or write an e-mail to
Viktoria Wagner.
18 December 2017
Our homepage is online!


Hi, I'm Zara, a first year CS student. I'm currently trying to get the hang of html and using github.


ONCE WERE WARRIORS A film review by Christopher Null Copyright 1995 Christopher Null
The opening scene of ONCE WERE WARRIORS, a highly-acclaimed new film from New Zealand, demolishes any outdated notions you may have that the island is a pastoral paradise, that families live on fields of green with herds of sheep, and that all is well in this world as a whole.
This unexpectedly powerful melodrama is the story of a Maori family in urban New Zealand, trying to make ends meet and coping with the overbearing presence of the family's father, a drunken brute who regularly beats those who cross him into bloodied pulp. Some of the most disturbing and explosive fight scenes on film result from this, as well as a tragically heart-breaking story line that inevitably follows. Because the family does nothing to stop the father, his madness goes unchecked. And when he shows a tinge of kindness, it is always soon replaced with retribution.
ONCE WERE WARRIORS is obviously not light fare. It is a painful and very effective tale about the destructive power of abuse, rape, alcoholism, and violence in general that easily transcends its New Zealand origin. The title refers to the fact that the Maoris were once a race of slaves and fighters, born with the rage of their ancestors deep in their souls. The story tells us what has become of the centuries of rage, leaving the audience with a warning about what may be happening in your country, in your town, in your home.
RATING: ****
|* Unquestionably awful | |** Sub-par on many levels | |*** Average quality, hits and misses | |**** Good, memorable film | |***** Perfection |
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


--- layout: post type: post status: publish tags: - bloggers - comment - meetup - Non-technical meta: _wpbitly: http://q.bibhas.in/H1x9nX image: "" _wp_old_slug: "" _edit_last: "1" published: true title: Comments from Known faces, Unknown faces --- If you've read my blog before, you'll know that I keep attending all the tech/web related events here. Thankfully, I've been able to collaborate with many active faces here and also brought together few more in that list. Yesterday (20th Feb '11) was a day full of fun and cheers coming from each and everyone.. Two Major bloggers' meet on a single day. Heck, whattay day it was! At the indiBlogger meet, there was a social networking session, where everyone has been given a white paper which they can hang on their back and go to other people, talk to them, introduce self and ask for a comment.. It was a really interesting session. Loved it.  I'm gonna share the comments here, because I want to remember them. For an eternity..
Someone: Bibhas(in Bengali), meeting you was an experience.
Someone: Bibhas, tu bahoot bara programmer bane. [Whoever you are, Thanks a LOT for the wish. :) ]
Agnivo da wrote: Biriyani Tweetup koboe hobe? :D [There's a story behind it, will share later after I have that tweetup. :P]
Subham Singh wrote: Good blogger, keep up the good work. [Thanks Dude :)]
Someone: Dont be DUMB! [To the writer, "Ok, Sire." :) ]
Someone: THE SOCIAL FREAK! :) [yeah, I know. :P ]
Someone: Why did you get a white chat?
 :) ]
Someone: Aspiring Developer :)
Arijit wrote: You are cool - @warijit [Thanks bro. :) ]
Someone: keep blogging. [I will. :) ]
Some R.G. wrote: Nice blog u have. Gimme some suggestions. Teach me to cheat!! [Heck Dude.. That was odd! O_O]
Debojyoti wrote: All the best in Life. God Bless.. [Thanks dude. :) ]
Someone: Keep Sleeping!! [o_O]
Someone: The Whitehat Blogger.. [ :) ]And my favorite -
Debleena di wrote: A Techie.. who is there on the web.. everywhere... [ Thanks Di.. :) ]This is the exact reason I love networking.. People are like pieces of puzzles. You can build a great picture when you bring them together.. So, keep networking.. :)
P.S. If you wrote any of them, please comment and let me know.. :)


SafeOrbit.Memory.Serialization.SerializationServices.Advanced Namespace
Classes
| Class | Description | |
|---|---|---|
| BinaryPropertyDeserializer |
Contains logic to deserialize data from a binary format. Format can vary according to the used IBinaryWriter.
For data serialized with BurstBinaryWriter you use BurstBinaryReader and for SizeOptimizedBinaryWriter you use SizeOptimizedBinaryReader
|
|
| BinaryPropertySerializer |
Contains logic to serialize data to a binary format. Format varies according to the used IBinaryWriter.
Actually there are BurstBinaryWriter and SizeOptimizedBinaryWriter (see the constructor)
|
|
| BurstBinaryReader |
Reads data which was stored with the BurstBinaryWriter
|
|
| BurstBinaryWriter |
Stores data in a binary format. All types and property names which describe an object are stored together with the
object.
If there are more objects to store, their types are multiple stored, what increases the file size.
This format is simple and has small overhead.
|
|
| PropertyCache | ||
| PropertyProvider |
Provides properties to serialize from source object.
|
|
| SizeOptimizedBinaryReader |
Reads data which was stored with SizeOptimizedBinaryWriter
|
|
| SizeOptimizedBinaryWriter |
Stores data in a binary format. Data is stored in two steps. At first are all objects stored in a cache and all types are analyzed.
Then all types and property names are sorted and placed in a list. Duplicates are removed. Serialized objects contain references
to these types and property names. It decreases file size, especially for serialization of collection (many items of the same type)
SizeOptimizedBinaryWriter has bigger overhead than BurstBinaryWriter
|
|
| SizeOptimizedBinaryWriter..::..ByteWriteCommand | ||
| SizeOptimizedBinaryWriter..::..NumbersWriteCommand | ||
| SizeOptimizedBinaryWriter..::..NumberWriteCommand | ||
| SizeOptimizedBinaryWriter..::..ValueWriteCommand | ||
| SizeOptimizedBinaryWriter..::..WriteCommand | ||
| TypeNameConverter |
Converts Type to its text representation and vice versa. All types serialize to the
AssemblyQualifiedName. Use overloaded constructor to shorten type names.
|


Helps people to find and book one spot for their vehicles on a parking lot. Our team members are Santiago Agudelo, and myself. As an engineering problem, we wanted to focus on 2 things: creating a cross-platform mobile solution, and also sourcing a reliable and sophisticated API.
A Shell provides you with an interface to the Unix system. It gathers input from you and executes programs based on that input. When a program finishes executing, it displays that program’s output.
Monty is a scripting language that is first compiled into Monty byte codes (Just like Python). It relies on a unique stack, with specific instructions to manipulate it.


[gecode-users] problem with gecode 3.0
Alberto Delgado
trosky99 at gmail.com
Mon Mar 16 10:24:28 CET 2009
Hi,
I'm getting some weird solutions from a problem I'm solving with
gecode 3.0 that i don't when i use gecode 2.2.
There is a simplified version of the problem where i've isolated the
specific situation in the attached files.
Basically, what the problem does is to determine whether there is any
repeated occurences of a value assigned to a
position in a stack below such position. I define an objective
variable that is the sum of positions with repeated
occurrences below them.
When i try to find the best solution some of the reified variables i
use are set to 0 in situations where they shoudn't,
and the objective variable takes values that don't match the valuation
of the solution.
prueba.cc is set to be run using gecode 3.0 and prueba2.cc using gecode 2.2.
Thanks ind advance for any help/advice.
Alberto
-------------- next part --------------
A non-text attachment was scrubbed...
Name: prueba2.cc
Type: text/x-c++src
Size: 2672 bytes
Desc: not available
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20090316/67ed6b58/attachment.cc>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: prueba.cc
Type: text/x-c++src
Size: 2703 bytes
Desc: not available
URL: <http://www.ps.uni-sb.de/pipermail/users/attachments/20090316/67ed6b58/attachment-0001.cc>
More information about the gecode-users
mailing list


jpaul - Java Program Analysis Utilities Library
|
|
Credo: "Papers have been written enough, let us see
systems!" - Reinhard Wilhelm
|
jpaul is a Java implementation of several algorithms
that are widely used in program analysis. Compiler writers often
reimplement a (relatively small) set of algorithms: graph algorithms,
dataflow engines, set constraint solvers etc. The goal of the
jpaul project is to have these algorithms implemented
independently of any compiler infrastructure project.
jpaul emphasizes (in order): correctness,
flexibility, ease-of-use, and asymptotic complexity (we are not very
interested in cutting-edge low level optimizations). The intended
audience consists of program analysis researchers in need of a
correct, elegant, and fast way of prototyping their analysis ideas.
jpaul is implemented in Generic Java (JDK 1.5); you
don't need any other package in order to use jpaul.
For development, jpaul has very common dependencies:
ant and
junit.
The entire code is released under the terms of the (Modified) BSD Licence. In the spirit of
scientific honesty, researchers who use jpaul are
encouraged to acknowledge jpaul explicitly in their
scientific publications; here is a
suggested BibTeX entry.
NEWS:
Version 2.5 released on March 13, 2006! -
Release
Notes; Download Area
Current Features
- Graph algorithms - package jpaul.Graphs:
- Generic definition of a directed graph (digraph) as a set of
root vertices and a navigator that describes the arcs of
the graph. This design allows the use of our library even for graphs
whose arcs are not explicitly stored in the vertices.
- General digraph algorithms: dfs traversals, reachability, shortest
paths, etc.
- Strongly connected components (SCCs): given a digraph, we can
construct its topologically sorted component digraph - a digraph whose
vertices are the SCCs of the original graph.
- Basic block representation of a digraph.
- Directed binary trees (special digraphs). Utilities for iterating
efficiently over such trees in pre-/in-/post-order.
- Generic and efficient solver for systems of inequality constraints
over lattices - package jpaul.Constraints.
Generalization of classical set constraint solvers. Allows the user
to define its own kinds of constraints. As an example of the
constraint solver framework, we also implemented a set constraint
solver - package jpaul.Constraints.SetConstraints.
- Generic NFAs and regular expressions - package jpaul.RegExps:
- Conversion from NFA to regular expressions
- Useful data structures - package jpaul.DataStructs:
- Binary and ternary relations
- Classes for the factory pattern
- Copy-on-write data structures
- Work sets for fixed-point computations
- Other goodies - package jpaul.Misc
Getting Started
- Easiest way: To use jpaul, it
suffices to download the
jpaul-<version>.jar
file and add it to your CLASSPATH. Click here
for the download site.
Note for Eclipse users (courtesy Adam Kiezun): you may
add the downloaded .jar
file to your Eclipse project, select the
.jar
and choose "Build Path
>
Add
to Build Path
" from the context menu. This will allow you to
use the jpaul code and also to see the
jpaul code you're using in Eclipse.
Alternatively, if you want to do changes inside
jpaul, you may download the file
jpaul-<version>-src.zip
from here.
It contains all files of the project, including
jpaul.jar
, Java source files, Javadoc, tests, etc.
- Anonymous (read-only) CVS access to the source code:
cvs -z3 -d:pserver:anonymous@cvs.sourceforge.net:/cvsroot/jpaul co jpaul
Press Enter if prompted for a password.
- Full developer CVS access: First, make yourself an account on SourceForge, and contact the project admin (Alex
Salcianu) to obtain the right to edit the source. Next, you can
start with the following commands:
export CVS_RSH=ssh
cvs -z3 -d:ext:developername@cvs.sourceforge.net:/cvsroot/jpaul co
jpaul
Mailing Lists
There are two mailing lists:
Projects that use jpaul
- Alex Salcianu uses jpaul extensively in the jppa (Java Pointer and Purity
Analysis) project. In particular, jpaul was used to
reimplement an inter-procedural, compositional pointer analysis for
Java. The implementation using jpaul is not only
cleaner and more flexible, but also faster than the original one: the
constraint solver from jpaul has a better grasp on
the "big picture" and can perfom optimizations that were impossible in
the original implementation.
- Adam Kiezun uses
the graph package of jpaul in a project that performs
generics-related refactorings in Eclipse - see his OOPSLA'05
demo. An early adopter, Adam has been a happy user of
jpaul ever since :)
- Please drop me an
email if you are a jpaul user. I would be happy to
hear your feedback and list your project here!
The jpaul Team
jpaul was started by Alex Salcianu in February
2005. Adam Kiezun
provided many useful comments and formally joined the
jpaul team in January 2006.
Acknowledgements
jpaul contains pieces of code contributed by the
following people: Suhabe
Bugrara (the initial version of the RegExps
package),
Darko Marinov
(the Emacs prj.el
script) and C. Scott Ananian (the initial versions of
ReverseListIterator
and UnionFind
). Some of
the code from this project was initially developed for the MIT FLEX compiler
infrastructure.
Hosted by
Copyright (c) 2005 - Alexandru Salcianu


Tiago Danin
I'm 19 years old, genius, developer, I love volleyball, musics and series.
Timeline
"There are many endings. But the right one is the one you choose."
-
😍 Birth
1998printf("Hello World!");
-
Mathematics 🔬
2006Fascinated by mathematics.
-
Electronic Circuit 🔬
2008Fascinated by electronic circuit.
-
🖥 My first WebSite
2012The name was WapSiteMobile, Shared various games Later... My forum (WapSiteBr) and 2013 my blog (WSBrasil)
-
🗣 Lecture of Creation of blogging
2013Contribute to lecture talking about my experience.
🏆 Award - FeedTurbo
2013Best articles about the FeedTurbo Title my article: "Tudo sobre o FeedTurbo"
-
🏆 Award - School games
20143º Position - Race - 100M 2º Position - Long jump - Best jump 2.56M
🏆 Award - Valentine´s Day - Forumeiros
20143º Position - Valentine´s Day for forumeiros.com
-
Lua ❤
2015Learn programming in lua ❤ Only to use the mod ComputerCraft on Minecraft 😍❤
🖥 My first program
2015A plugin to search music on Spotify via Telegram-Bot
📸 Art reproduction
2015Accomplished with the help of the art teacher I have good pictures :)
-
🏐 Volleyball
2016Me and my friends created a volleyball team. A fun and healthy sport.
💻 My first application for Windows Store
2016I published two app (SamRobot and GX Password)
💻 Hacktoberfest
2016Participated of Hacktoberfest 2016
-
School games 🏐🏀🏃
20171º Position - Volleyball male 3º Position - Basketball pitch --> 1º Round - 2/5 Hit --> 2º Round - 1/3 Hit --> 3º Round - 1/3 Hit Race of 4.1KM
💻 Hacktoberfest
2017Participated of Hacktoberfest 2017
Thanks @Github and @DigitalOcean 😀😍 #Hacktoberfest pic.twitter.com/1C3jCWHa1m
— ⚙ Tiago Danin (@_TiagoEDGE) January 11, 2018I've completed 31 Pull Requests for Hacktoberfest! https://t.co/bctla1SwdK #Hacktoberfest #Hacktoberfest2017
— ⚙ Tiago Danin (@_TiagoEDGE) October 31, 2017 -
SOON™
2018
My projects, Contributions & Favorites.
htmlEntities-for-lua - Module for lua decoding html entities :) Open in GitHub Open WebSite — TiagoDanin
Otouto - A plugin-wielding, IRC-style Telegram bot. Open in GitHub Open project (Telegram) Open WebSite — Topkecleon
Jack Telegram Bot - A multi purpose telegram bot written in MoonScript Open in GitHub Open project (Telegram) Open WebSite — Imandashi
TeleSeed - An advance Administration Telegram bot based on yagop/telegram-bot Open in GitHub Open project (Telegram) Open WebSite — SeedTeam
Atom-TerminalColor - A auto-complet with colors for terminal(Bash) - Package for Atom Open in GitHub Available on Atom Open WebSite — TiagoDanin
EDRobot - Bot with IA for Telegram Open project (Telegram) — WesleyHenr and Synko Develops
GX Password - [UWP] A Quick and Easy Password Generator Open in GitHub Get in on Windows 10 Open WebSite — TiagoDanin
Dev#Translate - Project created to help find and translate technology documents to any language Open in GitHub Open WebSite — Larismourullo and Team devtranslate
Electron - Build cross platform desktop apps with JavaScript, HTML, and CSS Open in GitHub Open WebSite — Team Electron and Team Github
Reddunt - A beatiful, powerful, reddit client for Windows 10 Open in GitHub — Vitorgrs


Documentation
Returns two values: a transaction id and a list of object ids
(of objects that may be partially committed).
Source
(defun load-commit-file (cache)
"Returns two values: a transaction id and a list of object ids
(of objects that may be partially committed)."
(with-open-file (stream (commit-filename cache)
:direction :output
:if-exists :supersede
:if-does-not-exist :create
:element-type '(unsigned-byte 8))
(let* ((transaction-id (deserialize stream))
(nr-objects (deserialize stream))
(objects (loop repeat nr-objects
collect (deserialize stream))))
(values transaction-id objects))))
Source Context


Constructs a yield curve by the Smith-Wilson method from a table of LIBOR and SWAP rates
| Version: | 1.0.1 |
| Suggests: | testthat |
| Published: | 2013-06-19 |
| Author: | Phil Joubert |
| Maintainer: | Phil Joubert <phil.joubert at not-normal-consulting.co.uk> |
| License: | GPL-3 |
| NeedsCompilation: | no |
| In views: | Finance |
| CRAN checks: | SmithWilsonYieldCurve results |
| Reference manual: | SmithWilsonYieldCurve.pdf |
| Package source: | SmithWilsonYieldCurve_1.0.1.tar.gz |
| Windows binaries: | r-devel: SmithWilsonYieldCurve_1.0.1.zip, r-release: SmithWilsonYieldCurve_1.0.1.zip, r-oldrel: SmithWilsonYieldCurve_1.0.1.zip |
| OS X binaries: | r-release: SmithWilsonYieldCurve_1.0.1.tgz, r-oldrel: SmithWilsonYieldCurve_1.0.1.tgz |
Please use the canonical form https://CRAN.R-project.org/package=SmithWilsonYieldCurve to link to this page.


How do I install git on my Windows machine?
Windows user download git for Windows from HERE
How do I install git on my Linux machine? HERE
How do I create my first repository on a local machine?
Open the DOS prompt and create a new directory at your desired location for example C:\MyFristRepo
git init
This will create a new git local repository
How do I create a repository on the git-hub account?
In case you do not have a repository in your git-hub account, You will to create a new public repository by clicking on the New Repository button. Note the URL for example https://github.comusername/MyFristRepo.git
What I need to do to start using the local repository?
Copy a small size project soruce code and releated folders and sub folders to the C:\MyFirstRepo you created above.
How do I add my files and folders in the local git repository?
add *
How do I add checkin/commit my files and folders in the local git repository?
git commit -m "inital commit"
connect your local respository folder to remote server respository
git remote add origin Repo URL
Push the folders, subfolders and files to remote server
git push origin master