 More...
|
| |
|
| Pose3 (const Matrix &T) |
| | Constructor from 4*4 matrix.
|
| |
|
static Pose3 | Create (const Rot3 &R, const Point3 &t, OptionalJacobian< 6, 3 > HR=boost::none, OptionalJacobian< 6, 3 > Ht=boost::none) |
| | Named constructor with derivatives.
|
| |
|
static boost::optional< Pose3 > | Align (const std::vector< Point3Pair > &abPointPairs) |
| | Create Pose3 by aligning two point pairs A pose aTb is estimated between pairs (a_point, b_point) such that a_point = aTb * b_point Note this allows for noise on the points but in that case the mapping will not be exact.
|
| |
|
|
Matrix6 | AdjointMap () const |
| | Calculate Adjoint map, transforming a twist in this pose's (i.e, body) frame to the world spatial frame Ad_pose is 6*6 matrix that when applied to twist xi \( [R_x,R_y,R_z,T_x,T_y,T_z] \), returns Ad_pose(xi)
|
| |
| Vector6 | Adjoint (const Vector6 &xi_b, OptionalJacobian< 6, 6 > H_this=boost::none, OptionalJacobian< 6, 6 > H_xib=boost::none) const |
| | Apply this pose's AdjointMap Ad_g to a twist \( \xi_b \), i.e. More...
|
| |
|
Vector6 | AdjointTranspose (const Vector6 &x, OptionalJacobian< 6, 6 > H_this=boost::none, OptionalJacobian< 6, 6 > H_x=boost::none) const |
| | The dual version of Adjoint.
|
| |
| static Pose3 | Expmap (const Vector6 &xi, OptionalJacobian< 6, 6 > Hxi=boost::none) |
| | Exponential map at identity - create a rotation from canonical coordinates \( [R_x,R_y,R_z,T_x,T_y,T_z] \). More...
|
| |
|
static Vector6 | Logmap (const Pose3 &pose, OptionalJacobian< 6, 6 > Hpose=boost::none) |
| | Log map at identity - return the canonical coordinates \( [R_x,R_y,R_z,T_x,T_y,T_z] \) of this rotation.
|
| |
| static Matrix6 | adjointMap (const Vector6 &xi) |
| | Compute the [ad(w,v)] operator as defined in [Kobilarov09siggraph], pg 11 [ad(w,v)] = [w^, zero3; v^, w^] Note that this is the matrix representation of the adjoint operator for se3 Lie algebra, aka the Lie bracket, and also the derivative of Adjoint map for the Lie group SE3. More...
|
| |
|
static Vector6 | adjoint (const Vector6 &xi, const Vector6 &y, OptionalJacobian< 6, 6 > Hxi=boost::none, OptionalJacobian< 6, 6 > H_y=boost::none) |
| | Action of the adjointMap on a Lie-algebra vector y, with optional derivatives.
|
| |
|
static Matrix6 | adjointMap_ (const Vector6 &xi) |
| |
|
static Vector6 | adjoint_ (const Vector6 &xi, const Vector6 &y) |
| |
|
static Vector6 | adjointTranspose (const Vector6 &xi, const Vector6 &y, OptionalJacobian< 6, 6 > Hxi=boost::none, OptionalJacobian< 6, 6 > H_y=boost::none) |
| | The dual version of adjoint action, acting on the dual space of the Lie-algebra vector space.
|
| |
|
static Matrix6 | ExpmapDerivative (const Vector6 &xi) |
| | Derivative of Expmap.
|
| |
|
static Matrix6 | LogmapDerivative (const Pose3 &xi) |
| | Derivative of Logmap.
|
| |
| static Matrix3 | ComputeQforExpmapDerivative (const Vector6 &xi, double nearZeroThreshold=1e-5) |
| | Compute the 3x3 bottom-left block Q of SE3 Expmap right derivative matrix J_r(xi) = [J_(w) Z_3x3; Q_r J_(w)] where J_(w) is the SO3 Expmap right derivative. More...
|
| |
| static Matrix | wedge (double wx, double wy, double wz, double vx, double vy, double vz) |
| | wedge for Pose3: More...
|
| |
|
|
|
void | print (const std::string &s="") const |
| | print with optional string
|
| |
|
bool | equals (const Pose3 &pose, double tol=1e-9) const |
| | assert equality up to a tolerance
|
| |
|
| Point3 | transformFrom (const Point3 &point, OptionalJacobian< 3, 6 > Hself=boost::none, OptionalJacobian< 3, 3 > Hpoint=boost::none) const |
| | takes point in Pose coordinates and transforms it to world coordinates More...
|
| |
|
Point3 | operator* (const Point3 &point) const |
| | syntactic sugar for transformFrom
|
| |
| Point3 | transformTo (const Point3 &point, OptionalJacobian< 3, 6 > Hself=boost::none, OptionalJacobian< 3, 3 > Hpoint=boost::none) const |
| | takes point in world coordinates and transforms it to Pose coordinates More...
|
| |
|
|
const Rot3 & | rotation (OptionalJacobian< 3, 6 > Hself=boost::none) const |
| | get rotation
|
| |
|
const Point3 & | translation (OptionalJacobian< 3, 6 > Hself=boost::none) const |
| | get translation
|
| |
|
double | x () const |
| | get x
|
| |
|
double | y () const |
| | get y
|
| |
|
double | z () const |
| | get z
|
| |
|
Matrix4 | matrix () const |
| | convert to 4*4 matrix
|
| |
| Pose3 | transformPoseFrom (const Pose3 &aTb, OptionalJacobian< 6, 6 > Hself=boost::none, OptionalJacobian< 6, 6 > HaTb=boost::none) const |
| | Assuming self == wTa, takes a pose aTb in local coordinates and transforms it to world coordinates wTb = wTa * aTb. More...
|
| |
|
Pose3 | transformPoseTo (const Pose3 &wTb, OptionalJacobian< 6, 6 > Hself=boost::none, OptionalJacobian< 6, 6 > HwTb=boost::none) const |
| | Assuming self == wTa, takes a pose wTb in world coordinates and transforms it to local coordinates aTb = inv(wTa) * wTb.
|
| |
| double | range (const Point3 &point, OptionalJacobian< 1, 6 > Hself=boost::none, OptionalJacobian< 1, 3 > Hpoint=boost::none) const |
| | Calculate range to a landmark. More...
|
| |
| double | range (const Pose3 &pose, OptionalJacobian< 1, 6 > Hself=boost::none, OptionalJacobian< 1, 6 > Hpose=boost::none) const |
| | Calculate range to another pose. More...
|
| |
| Unit3 | bearing (const Point3 &point, OptionalJacobian< 2, 6 > Hself=boost::none, OptionalJacobian< 2, 3 > Hpoint=boost::none) const |
| | Calculate bearing to a landmark. More...
|
| |
| Unit3 | bearing (const Pose3 &pose, OptionalJacobian< 2, 6 > Hself=boost::none, OptionalJacobian< 2, 6 > Hpose=boost::none) const |
| | Calculate bearing to another pose. More...
|
| |
|
const Pose3 & | derived () const |
| |
|
Pose3 | compose (const Pose3 &g) const |
| |
|
Pose3 | compose (const Pose3 &g, ChartJacobian H1, ChartJacobian H2=boost::none) const |
| |
|
SOn | compose (const SOn &g, DynamicJacobian H1, DynamicJacobian H2) const |
| |
|
SOn | compose (const SOn &g, DynamicJacobian H1, DynamicJacobian H2) const |
| |
|
Pose3 | between (const Pose3 &g) const |
| |
|
Pose3 | between (const Pose3 &g, ChartJacobian H1, ChartJacobian H2=boost::none) const |
| |
|
SOn | between (const SOn &g, DynamicJacobian H1, DynamicJacobian H2) const |
| |
|
SOn | between (const SOn &g, DynamicJacobian H1, DynamicJacobian H2) const |
| |
|
Pose3 | inverse (ChartJacobian H) const |
| |
|
Pose3 | expmap (const TangentVector &v) const |
| | expmap as required by manifold concept Applies exponential map to v and composes with *this
|
| |
|
Pose3 | expmap (const TangentVector &v, ChartJacobian H1, ChartJacobian H2=boost::none) const |
| | expmap with optional derivatives
|
| |
|
TangentVector | logmap (const Pose3 &g) const |
| | logmap as required by manifold concept Applies logarithmic map to group element that takes *this to g
|
| |
|
TangentVector | logmap (const Pose3 &g, ChartJacobian H1, ChartJacobian H2=boost::none) const |
| | logmap with optional derivatives
|
| |
|
Pose3 | retract (const TangentVector &v) const |
| | retract as required by manifold concept: applies v at *this
|
| |
|
Pose3 | retract (const TangentVector &v, ChartJacobian H1, ChartJacobian H2=boost::none) const |
| | retract with optional derivatives
|
| |
|
TangentVector | localCoordinates (const Pose3 &g) const |
| | localCoordinates as required by manifold concept: finds tangent vector between *this and g
|
| |
|
TangentVector | localCoordinates (const Pose3 &g, ChartJacobian H1, ChartJacobian H2=boost::none) const |
| | localCoordinates with optional derivatives
|
| |
| Matrix6 gtsam::Pose3::adjointMap |
( |
const Vector6 & |
xi | ) |
|
|
static |
Compute the [ad(w,v)] operator as defined in [Kobilarov09siggraph], pg 11 [ad(w,v)] = [w^, zero3; v^, w^] Note that this is the matrix representation of the adjoint operator for se3 Lie algebra, aka the Lie bracket, and also the derivative of Adjoint map for the Lie group SE3.
Let \( \hat{\xi}_i \) be the se3 Lie algebra, and \( \hat{\xi}_i^\vee = \xi_i = [\omega_i,v_i] \in \mathbb{R}^6\) be its vector representation. We have the following relationship: \( [\hat{\xi}_1,\hat{\xi}_2]^\vee = ad_{\xi_1}(\xi_2) = [ad_{(\omega_1,v_1)}]*\xi_2 \)
We use this to compute the discrete version of the inverse right-trivialized tangent map, and its inverse transpose in the discrete Euler Poincare' (DEP) operator.


You are not connected to the internet at the moment. Try browsing your offline pages using the command
goto INDEX v/VERSION
!


The package estimates Factor Mixture Analysis via the EM algorithm
| Version: | 1.0 |
| Depends: | R (≥ 2.0.1), MASS, mvtnorm |
| Published: | 2012-10-29 |
| Author: | Cinzia Viroli |
| Maintainer: | Cinzia Viroli <cinzia.viroli at unibo.it> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| CRAN checks: | FactMixtAnalysis results |
| Reference manual: | FactMixtAnalysis.pdf |
| Package source: | FactMixtAnalysis_1.0.tar.gz |
| Windows binaries: | r-devel: FactMixtAnalysis_1.0.zip, r-release: FactMixtAnalysis_1.0.zip, r-oldrel: FactMixtAnalysis_1.0.zip |
| OS X binaries: | r-release: FactMixtAnalysis_1.0.tgz, r-oldrel: FactMixtAnalysis_1.0.tgz |
Please use the canonical form https://CRAN.R-project.org/package=FactMixtAnalysis to link to this page.


Just messing about with WebGL fragment shaders. Years ago I made something similar to this that took minutes to render a single frame. Kinda neat my browser can do it in realtime these days.
Not working on your machine? Check out this youtube.


◆ topsTreePanel()
Make a new panel in the given figure.
- Parameters
-
Creates a new topsTreePanel. parentFigure must be a topsFigure object, otherwise the panel won't display any content.
◆ selectItem()
| selectItem |
( |
self |
, |
|
|
tree |
, |
|
|
event |
|
|
) |
| |
Set the GUI current item from a selected node.
- Parameters
-
| tree | uitree object or a "peer" object |
| event | event object related to the selection |
Sets the value of the current item for the parent figure, based on the selected node.
◆ childNodesForExpand()
| nodes childNodesForExpand |
( |
self |
, |
|
|
tree |
, |
|
|
value |
|
|
) |
| |
Create new child nodes for an expanded node.
- Parameters
-
| tree | uitree object or a "peer" object |
| value | value associated with the expanding node |
Must create new uitreenode objects for a node that is currently expanding, based on the value of baseItem, and the sub-path contained by the expanding node.
◆ expandToDepth()
| expandToDepth |
( |
self |
, |
|
|
node |
, |
|
|
depth |
|
|
) |
| |
|
protected |
Expand tree nodes to the given depth.
- Parameters
-
| node | a uitree node in the tree |
| depth | how far down to expand the tree |
Recursively expands all tree nodes, starting with the given node, as far down as the given depth. If node is the root node, the entire tree can be expanded. If depth is zero, no nodes will be expanded. If depth is one, only the given node will be expanded. If depth is inf, all nodes beneath node will be expanded.
◆ nodeForItem()
| node nodeForItem |
( |
self |
, |
|
|
item |
, |
|
|
name |
, |
|
|
subPath |
|
|
) |
| |
|
protected |
Make a new tree node to represent the given item.
- Parameters
-
| item | any item |
| name | string name for the item |
| subPath | string sub-path path from baseItem to item |
Makes a new uitreenode to represent the given item. subPath must be a string to pass to eval(), which contains a reference from baseItem to this item. For example, if item is located in a field of baseItem named 'data', subPath might be '.data', '(1).data', or similar.
◆ autoExpandDepth
| Property autoExpandDepth = 1 |
Show an collection of items with a tree browser.
topsTreePanel shows tree that can browse items connected to baseItem. The user can select individual nodes of the tree to set the currentItem for a Tower of Psych GUI. how far to expand the tree automatically when building it
The documentation for this class was generated from the following file:


[1] Turning the bathroom light on also turns the counter light on, meaning a middle, of, the, night trip to the bathroom means the whole side of the room gets illuminated and the wooden shutters that were installed in place of traditional curtains to add to the hotel's theme do absolutely nothing to keep the room dark once the sun comes up .
[2] Some rooms had the bathroom sink outside the bathroom, which we would have preferred, but our sink was inside the bathroom .


AUSTIN POWERS: INTERNATIONAL MAN OF MYSTERY A film review by Rodney Mayton Copyright 1997 Rodney Mayton
A film by Mike Myers 1997, 87min. Rated PG
** out of five
"Shagadellic!", "Groovy, Baby!" "Smashing!" adorn the 1/4 page ad for this movie tabbed as "the #1 comedy in America" as of May 8th. Did we attend the same movie?! At 87 minutes it seemed overlong, like a SNL skit on steroids, and at any length it seemed unfunny. Yes, the sets and costumes were an interesting exaggeration of 60s Pop frills, and yes, the concept, dealing with a 60s secret agent/pop icon (played by Myers) awakened from his cryogenic slumber to battle his arch enemy (Dr. Evil, also played by Myers) in the present day, had a great deal of potential. Fun costumes and scenery and potential do not a movie make so lets throw in a hefty dose of bathroom humor. Don't get me wrong, I like a good "bubbles in the bathtub joke" as much as the next person, but to have this type of humor be the funniest thing about your movie is a waste of yuor talent and my money. But, the way things work these days in the movie business, all a film has to do is call itself the funniest and people will believe it. I do give this film 2 out of 5 stars because of the sets, costumes, and sadly, unmet potential.
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


Logs and files:
console.html
logs/
rally-plot/
Results of this job can be obtained in different formats:
$ rally task report
$ rally task detailed
$ rally task detailed --iterations-data
$ rally task sla_check
$ rally task results
Rally is benchmark system for OpenStask:
$ rally task start task.txt


Write the Docs is more than a conference. Each year we organize a wide range of events so that people can come together, collaborate, and learn from each other in different ways.
City tour in the morning, conference reception in the evening, and a fun welcome to Prague all around!
| 12 NOON | Walking tour of historical Prague, Meeting point in front of Club Lavka (Novotného lávka 1, Praha 1) |
| 6 PM | Conference reception at Apiary office (Pernerova 49, Praha 8) |
This is the main event! Hear from lots of interesting folks about all things documentation. Check out the full talk descriptions for more information.
The talks will take place at the Klub Lavka, Novotného lávka 201/1, Praha 1.
| 9:00 AM | Doors Open, Breakfast Served | |||
| 9:45 AM | Introduction | |||
| 10:00 AM | IMPOSTER NO MORE: How Tech Writers Can Shed Self-Doubt, Embrace Uncertainty, and Surf the Upcoming Swerve in Technical Documentation - Riona MacNamara | |||
| 10:30 AM | Switch Speakers | |||
| 10:40 AM | Whatchamacallit: Controlled Vocabularies for Technical Writers - Emilie Boillat | Slides | ||
| 11:10 AM | Coffee break | |||
| 11:30 AM | Visual Documentation Language - Sonja Heinen | |||
| 12:00 AM | Switch Speakers | |||
| 12:10 AM | Tested and Correct, How to Make Sure Your Documentation Keeps Working - Adam Dangoor | Slides | ||
| 12:40 PM | Lunch | |||
| 1:40 PM | Lightning Talks | |||
| 2:10 PM | Switch Speakers | |||
| 2:20 PM | Generating docs from APIs - Jamie Hannaford | |||
| 2:50 PM | Switch Speakers | |||
| 3:00 PM | Inclusive Tech Docs - TechComm Meets Accessibility - Radina Matic | |||
| 3:30 PM | Coffee break | |||
| 3:50 PM | Documenting your Story - Crafting a good presentation - Chris Ward | Slides | ||
| 4:05 PM | Free Your Mind and Your Docs Will Follow - Patrick Keegan | |||
| 4:20 PM | Switch Speakers | |||
| 4:30 PM | Gardening Open Docs - Florian Scholz & Jean-Yves Perrier | |||
| 5:00 PM | Wrap-up announcements |
Wind down and talk about the day's talks in a relaxed and friendly environment. Free drinks of all varieties, snacks, and sweets will be provided.
| 7 PM | Conference Party at The PUB Praha 1 (Veleslavínova 3, Praha 1) |
The talks will take place at the Klub Lavka, Novotného lávka 201/1, Praha 1.
| 9:00 AM | Doors Open, Breakfast Served | |||
| 9:45 AM | Announcements | |||
| 10:00 AM | Judas Priest Ate My Scrum Master - Paul Adams | |||
| 10:30 AM | Switch Speakers | |||
| 10:40 AM | Before the docs: writing for user interfaces - Beth Aitman | Slides | ||
| 11:10 AM | Coffee break | |||
| 11:30 AM | How to Write an Email - Elijah Caine | Slides | ||
| 12:00 AM | Switch Speakers | |||
| 12:10 AM | Back to the Future: What Can Documentarians Learn From The Past? - Jennifer Rondeau | |||
| 12:40 PM | Lunch | |||
| 1:40 PM | Lightning Talks | |||
| 2:10 PM | Switch Speakers | |||
| 2:20 PM | MacGyvering your docs - Paul Roeland | Slides | ||
| 2:50 PM | Switch Speakers | |||
| 3:00 PM | The quest for scientific credit for software documentation - Anna Jaruga | Slides | ||
| 3:30 PM | Coffee break | |||
| 3:50 PM | Group photo | |||
| 4:00 PM | Writing for what matters. Writing for thinking. (Apiary sponsored talk) - Zdeněk Němec | Slides | ||
| 4:15 PM | Screencasting 101 - Diana Potter | |||
| 4:30 PM | Switch Speakers | |||
| 4:40 PM | All roads might not lead to docs - Christina Elmore | Slides | ||
| 5:10 PM | Wrap-up announcements |
If you're still in town after the conference, join us for a closing meetup to unwind and wrap up the conference. The meetup is hosted by our friends from Elastic, and will include drinks, snacks, and an informal introduction to Elastic by Karel Minařík.
| 7 PM | Closing meetup by Elastic at JazzDock (Janáčkovo nábřeží 2, Praha 5) |


Identity, Values and Strengths Exploration
Identity & Values
I didn't explore much with my Identity & Values before this. Or I was just unaware of the fact that how much of me is because of the way I believe in myself and see myself in this world.
I was born in Nepal, a small himalayan country, a landlocked country. So living in New Zealand near beautiful beaches is something that I find very unusual . The hills, mountains & valleys of Nepal have so much ingrained in my memory that every night when I go to sleep I go back to those places in my dreams. It's very rare that I don’t dream about it. It’s like I have a place in my subconscious that I have to go there every night to get recharged.
As I grow older with a lot of life experiences, my identity and values have also been evolving. I aspired to be someone like Niropa or Tilopa at the same time I strive for materialistic things. So it's a bit conflicting. Art is my escape from reality and anything with nature, I fall in love !
Strengths and Limitations
My strength is perseverance. Sometimes even though everything goes the other way. I see the bigger picture and try to find the solution. I tend not to be afraid to do new things. Mainly open to others.
My limitation is listening to my self doubting voice.


CHAPTER XI
(Delivered in New York, 26th January 1896)
The human mind naturally wants to get outside, to peer out of the body, as it were, through the channels of the organs. The eye must see, the ear must hear, the senses must sense the external world — and naturally the beauties and sublimities of nature captivate the attention of man first. The first questions that arose in the human soul were about the external world. The solution of the mystery was asked of the sky, of the stars, of the heavenly bodies, of the earth, of the rivers, of the mountains, of the ocean; and in all ancient religions we find traces of how the groping human mind at first caught at everything external. There was a river-god, a sky-god, a cloud-god, a rain-god; everything external, all of which we now call the powers of nature, became metamorphosed, transfigured, into wills, into gods, into heavenly messengers. As the question went deeper and deeper, these external manifestations failed to satisfy the human mind, and finally the energy turned inward, and the question was asked of man's own soul. From the macrocosm the question was reflected back to the microcosm; from the external world the question was reflected to the internal. From analysing the external nature, man is led to analyse the internal; this questioning of the internal man comes with a higher state of civilisation, with a deeper insight into nature, with a higher state of growth.
The subject of discussion this afternoon is this internal man. No question is so near and dear to man's heart as that of the internal man. How many millions of times, in how many countries has this question been asked! Sages and kings, rich and poor, saints and sinners, every man, every woman, all have from time to time asked this question. Is there nothing permanent in this evanescent human life? Is there nothing, they have asked, which does not die away when this body dies? Is there not something living when this frame crumbles into dust? Is there not something which survives the fire which burns the body into ashes? And if so, what is its destiny? Where does it go? Whence did it come? These questions have been asked again and again, and so long as this creation lasts, so long as there are human brains to think, this question will have to be asked. Yet, it is not that the answer did not come; each time the answer came, and as time rolls on, the answer will gain strength more and more. The question was answered once for all thousands of years ago, and through all subsequent time it is being restated, reillustrated, made clearer to our intellect. What we have to do, therefore, is to make a restatement of the answer. We do not pretend to throw any new light on those all-absorbing problems, but only to put before you the ancient truth in the language of modern times, to speak the thoughts of the ancients in the language of the moderns, to speak the thoughts of the philosophers in the language of the people, to speak the thoughts of the angels in the language of man, to speak the thoughts of God in the language of poor humanity, so that man will understand them; for the same divine essence from which the ideas emanated is ever present in man, and, therefore, he can always understand them.
I am looking at you. How many things are necessary for this vision? First, the eyes. For if I am perfect in every other way, and yet have no eyes, I shall not be able to see you. Secondly, the real organ of vision. For the eyes are not the organs. They are but the instruments of vision, and behind them is the real organ, the nerve centre in the brain. If that centre be injured, a man may have the clearest pair of eyes, yet he will not be able to see anything. So, it is necessary that this centre, or the real organ, be there. Thus, with all our senses. The external ear is but the instrument for carrying the vibration of sound inward to the centre. Yet, that is not sufficient. Suppose in your library you are intently reading a book, and the clock strikes, yet you do not hear it. The sound is there, the pulsations in the air are there, the ear and the centre are also there, and these vibrations have been carried through the ear to the centre, and yet you do not hear it. What is wanting? The mind is not there. Thus we see that the third thing necessary is, that the mind must be there. First the external instruments, then the organ to which this external instrument will carry the sensation, and lastly the organ itself must be joined to the mind. When the mind is not joined to the organ, the organ and the ear may take the impression, and yet we shall not be conscious of it. The mind, too, is only the carrier; it has to carry the sensation still forward, and present it to the intellect. The intellect is the determining faculty and decides upon what is brought to it. Still this is not sufficient. The intellect must carry it forward and present the whole thing before the ruler in the body, the human soul, the king on the throne. Before him this is presented, and then from him comes the order, what to do or what not to do; and the order goes down in the same sequence to the intellect, to the mind, to the organs, and the organs convey it to the instruments, and the perception is complete.
The instruments are in the external body, the gross body of man; but the mind and the intellect are not. They are in what is called in Hindu philosophy the finer body; and what in Christian theology you read of as the spiritual body of man; finer, very much finer than the body, and yet not the soul. This soul is beyond them all. The external body perishes in a few years; any simple cause may disturb and destroy it. The finer body is not so easily perishable; yet it sometimes degenerates, and at other times becomes strong. We see how, in the old man, the mind loses its strength, how, when the body is vigorous, the mind becomes vigorous, how various medicines and drugs affect it, how everything external acts on it, and how it reacts on the external world. Just as the body has its progress and decadence, so also has the mind, and, therefore, the mind is not the soul, because the soul can neither decay nor degenerate. How can we know that? How can we know that there is something behind this mind? Because knowledge which is self-illuminating and the basis of intelligence cannot belong to dull, dead matter. Never was seen any gross matter which had intelligence as its own essence. No dull or dead matter can illumine itself. It is intelligence that illumines all matter. This hall is here only through intelligence because, as a hall, its existence would be unknown unless some intelligence built it. This body is not self-luminous; if it were, it would be so in a dead man also. Neither can the mind nor the spiritual body be self-luminous. They are not of the essence of intelligence. That which is self-luminous cannot decay. The luminosity of that which shines through a borrowed light comes and goes; but that which is light itself, what can make that come and go, flourish and decay? We see that the moon waxes and wanes, because it shines through the borrowed light of the sun. If a lump of iron is put into the fire and made red-hot, it glows and shines, but its light will vanish, because it is borrowed. So, decadence is possible only of that light which is borrowed and is not of its own essence.
Now we see that the body, the external shape, has no light as its own essence, is not self-luminous, and cannot know itself; neither can the mind. Why not? Because the mind waxes and wanes, because it is vigorous at one time and weak at another, because it can be acted upon by anything and everything. Therefore the light which shines through the mind is not its own. Whose is it then? It must belong to that which has it as its own essence, and as such, can never decay or die, never become stronger or weaker; it is self-luminous, it is luminosity itself. It cannot be that the soul knows, it is knowledge. It cannot be that the soul has existence, but it is existence. It cannot be that the soul is happy, it is happiness itself. That which is happy has borrowed its happiness; that which has knowledge has received its knowledge; and that which has relative existence has only a reflected existence. Wherever there are qualities these qualities have been reflected upon the substance, but the soul has not knowledge, existence, and blessedness as its qualities, they are the essence of the soul.
Again, it may be asked, why shall we take this for granted? Why shall we admit that the soul has knowledge, blessedness, existence, as its essence, and has not borrowed them? It may be argued, why not say that the soul's luminosity, the soul's blessedness, the soul's knowledge, are borrowed in the same way as the luminosity of the body is borrowed from the mind? The fallacy of arguing in this way will be that there will be no limit. From whom were these borrowed? If we say from some other source, the same question will be asked again. So, at last we shall have to come to one who is self-luminous; to make matters short then, the logical way is to stop where we get self-luminosity, and proceed no further.
We see, then, that this human being is composed first of this external covering, the body; secondly, the finer body, consisting of mind, intellect, and egoism. Behind them is the real Self of man. We have seen that all the qualities and powers of the gross body are borrowed from the mind, and the mind, the finer body, borrows its powers and luminosity from the soul, standing behind.
A great many questions now arise about the nature of this soul. If the existence of the soul is drawn from the argument that it is self-luminous, that knowledge, existence, blessedness are its essence, it naturally follows that this soul cannot have been created. A self-luminous existence, independent of any other existence, could never have been the outcome of anything. It always existed; there was never a time when it did not exist, because if the soul did not exist, where was time? Time is in the soul; it is when the soul reflects its powers on the mind and the mind thinks, that time comes. When there was no soul, certainly there was no thought, and without thought, there was no time. How can the soul, therefore, be said to be existing in time, when time itself exists in the soul? It has neither birth nor death, but it is passing through all these various stages. It is manifesting slowly and gradually from lower to higher, and so on. It is expressing its own grandeur, working through the mind on the body; and through the body it is grasping the external world and understanding it. It takes up a body and uses it; and when that body has failed and is used up, it takes another body; and so on it goes.
Here comes a very interesting question, that question which is generally known as the reincarnation of the soul. Sometimes people get frightened at the idea, and superstition is so strong that thinking men even believe that they are the outcome of nothing, and then, with the grandest logic, try to deduce the theory that although they have come out of zero, they will be eternal ever afterwards. Those that come out of zero will certainly have to go back to zero. Neither you, nor I nor anyone present, has come out of zero, nor will go back to zero. We have been existing eternally, and will exist, and there is no power under the sun or above the sun which can undo your or my existence or send us back to zero. Now this idea of reincarnation is not only not a frightening idea, but is most essential for the moral well-being of the human race. It is the only logical conclusion that thoughtful men can arrive at. If you are going to exist in eternity hereafter, it must be that you have existed through eternity in the past: it cannot be otherwise. I will try to answer a few objections that are generally brought against the theory. Although many of you will think they are very silly objections, still we have to answer them, for sometimes we find that the most thoughtful men are ready to advance the silliest ideas. Well has it been said that there never was an idea so absurd that it did not find philosophers to defend it. The first objection is, why do we not remember our past? Do we remember all our past in this life? How many of you remember what you did when you were babies? None of you remember your early childhood, and if upon memory depends your existence, then this argument proves that you did not exist as babies, because you do not remember your babyhood. It is simply unmitigated nonsense to say that our existence depends on our remembering it. Why should we remember the past?  What has come to this brain is the resultant, the sum total of the impressions acquired in our past, with which the mind has come to inhabit the new body.
I, as I stand here, am the effect, the result, of all the infinite past which is tacked on to me. And why is it necessary for me to remember all the past? When a great ancient sage, a seer, or a prophet of old, who came face to face with the truth, says something, these modern men stand up and say, "Oh, he was a fool!" But just use another name, "Huxley says it, or Tyndall"; then it must be true, and they take it for granted. In place of ancient superstitions they have erected modern superstitions, in place of the old Popes of religion they have installed modern Popes of science. So we see that this objection as to memory is not valid, and that is about the only serious objection that is raised against this theory. Although we have seen that it is not necessary for the theory that there shall be the memory of past lives, yet at the same time, we are in a position to assert that there are instances which show that this memory does come, and that each one of us will get back this memory in that life in which he will become free. Then alone you will find that this world is but a dream; then alone you will realise in the soul of your soul that you are but actors and the world is a stage; then alone will the idea of non-attachment come to you with the power of thunder; then all this thirst for enjoyment, this clinging on to life and this world will vanish for ever; then the mind will see dearly as daylight how many times all these existed for you, how many millions of times you had fathers and mothers, sons and daughters, husbands and wives, relatives and friends, wealth and power. They came and went. How many times you were on the topmost crest of the wave, and how many times you were down at the bottom of despair! When memory will bring all these to you, then alone will you stand as a hero and smile when the world frowns upon you. Then alone will you stand up and say. "I care not for thee even, O Death, what terrors hast thou for me?" This will come to all.
Are there any arguments, any rational proofs for this reincarnation of the soul? So far we have been giving the negative side, showing that the opposite arguments to disprove it are not valid. Are there any positive proofs? There are; and most valid ones, too. No other theory except that of reincarnation accounts for the wide divergence that we find between man and man in their powers to acquire knowledge. First, let us consider the process by means of which knowledge is acquired. Suppose I go into the street and see a dog. How do I know it is a dog? I refer it to my mind, and in my mind are groups of all my past experiences, arranged and pigeon-holed, as it were. As soon as a new impression comes, I take it up and refer it to some of the old pigeon-holes, and as soon as I find a group of the same impressions already existing, I place it in that group, and I am satisfied. I know it is a dog, because it coincides with the impressions already there. When I do not find the cognates of this new experience inside, I become dissatisfied. When, not finding the cognates of an impression, we become dissatisfied, this state of the mind is called "ignorance"; but, when, finding the cognates of an impression already existing, we become satisfied, this is called "knowledge". When one apple fell, men became dissatisfied. Then gradually they found out the group. What was the group they found? That all apples fell, so they called it "gravitation". Now we see that without a fund of already existing experience, any new experience would be impossible, for there would be nothing to which to refer the new impression. So, if, as some of the European philosophers think, a child came into the world with what they call tabula rasa, such a child would never attain to any degree of intellectual power, because he would have nothing to which to refer his new experiences. We see that the power of acquiring knowledge varies in each individual, and this shows that each one of us has come with his own fund of knowledge. Knowledge can only be got in one way, the way of experience; there is no other way to know. If we have not experienced it in this life, we must have experienced it in other lives. How is it that the fear of death is everywhere?  There is an old explanation (I should hardly dignify it by such a name). It is called instinct. What makes that little chicken just out of the egg afraid to die? How is it that as soon as a duckling hatched by a hen comes near water, it jumps into it and swims? It never swam before, nor saw anything swim. People call it instinct. It is a big word, but it leaves us where we were before. Let us study this phenomenon of instinct. A child begins to play on the piano.  What was first done with conscious will does not require later on an effort of the will. This is not yet a complete proof. One half remains, and that is that almost all the actions which are now instinctive can be brought under the control of the will. Each muscle of the body can be brought under control. This is perfectly well known. So the proof is complete by this double method, that what we now call instinct is degeneration of voluntary actions; therefore, if the analogy applies to the whole of creation, if all nature is uniform, then what is instinct in lower animals, as well as in men, must be the degeneration of will.
Applying the law we dwelt upon under macrocosm that each involution presupposes an evolution, and each evolution an involution, we see that instinct is involved reason. What we call instinct in men or animals must therefore be involved, degenerated, voluntary actions, and voluntary actions are impossible without experience. Experience started that knowledge, and that knowledge is there. The fear of death, the duckling taking to the water and all involuntary actions in the human being which have become instinctive, are the results of past experiences. So far we have proceeded very clearly, and so far the latest science is with us. But here comes one more difficulty. The latest scientific men are coming back to the ancient sages, and as far as they have done so, there is perfect agreement. They admit that each man and each animal is born with a fund of experience, and that all these actions in the mind are the result of past experience. "But what," they ask, "is the use of saying that that experience belongs to the soul? Why not say it belongs to the body, and the body alone? Why not say it is hereditary transmission?" This is the last question. Why not say that all the experience with which I am born is the resultant effect of all the past experience of my ancestors? The sum total of the experience from the little protoplasm up to the highest human being is in me, but it has come from body to body in the course of hereditary transmission. Where will the difficulty be? This question is very nice, and we admit some part of this hereditary transmission. How far? As far as furnishing the material. We, by our past actions, conform ourselves to a certain birth in a certain body, and the only suitable material for that body comes from the parents who have made themselves fit to have that soul as their offspring.
The simple hereditary theory takes for granted the most astonishing proposition without any proof, that mental experience can be recorded in matters, that mental experience can be involved in matter. When I look at you in the lake of my mind there is a wave. That wave subsides, but it remains in fine form, as an impression. We understand a physical impression remaining in the body. But what proof is there for assuming that the mental impression can remain in the body, since the body goes to pieces? What carries it? Even granting it were possible for each mental impression to remain in the body, that every impression, beginning from the first man down to my father, was in my father's body, how could it be transmitted to me? Through the bioplasmic cell? How could that be? Because the father's body does not come to the child in toto. The same parents may have a number of children; then, from this theory of hereditary transmission, where the impression and the impressed (that is to say, material) are one, it rigorously follows that by the birth of every child the parents must lose a part of their own impressions, or, if the parents should transmit the whole of their impressions, then, after the birth of the first child, their minds would be a vacuum.
Again, if in the bioplasmic cell the infinite amount of impressions from all time has entered, where and how is it? This is a most impossible position, and until these physiologists can prove how and where those impressions live in that cell, and what they mean by a mental impression sleeping in the physical cell, their position cannot be taken for granted. So far it is clear then, that this impression is in the mind, that the mind comes to take its birth and rebirth, and uses the material which is most proper for it, and that the mind which has made itself fit for only a particular kind of body will have to wait until it gets that material. This we understand. The theory then comes to this, that there is hereditary transmission so far as furnishing the material to the soul is concerned. But the soul migrates and manufactures body after body, and each thought we think, and each deed we do, is stored in it in fine forms, ready to spring up again and take a new shape. When I look at you a wave rises in my mind. It dives down, as it were, and becomes finer and finer, but it does not die. It is ready to start up again as a wave in the shape of memory. So all these impressions are in my mind, and when I die the resultant force of them will be upon me. A ball is here, and each one of us takes a mallet in his hands and strikes the ball from all sides; the ball goes from point to point in the room, and when it reaches the door it flies out. What does it carry out with it? The resultant of all these blows. That will give it its direction. So, what directs the soul when the body dies? The resultant, the sum total of all the works it has done, of the thoughts it has thought. If the resultant is such that it has to manufacture a new body for further experience, it will go to those parents who are ready to supply it with suitable material for that body. Thus, from body to body it will go, sometimes to a heaven, and back again to earth, becoming man, or some lower animal. This way it will go on until it has finished its experience, and completed the circle. It then knows its own nature, knows what it is, and ignorance vanishes, its powers become manifest, it becomes perfect; no more is there any necessity for the soul to work through physical bodies, nor is there any necessity for it to work through finer, or mental bodies. It shines in its own light, and is free, no more to be born, no more to die.
We will not go now into the particulars of this. But I will bring before you one more point with regard to this theory of reincarnation. It is the theory that advances the freedom of the human soul. It is the one theory that does not lay the blame of all our weakness upon somebody else, which is a common human fallacy. We do not look at our own faults; the eyes do not see themselves, they see the eyes of everybody else. We human beings are very slow to recognise our own weakness, our own faults, so long as we can lay the blame upon somebody else. Men in general lay all the blame of life on their fellow-men, or, failing that, on God, or they conjure up a ghost, and say it is fate. Where is fate, and who is fate? We reap what we sow. We are the makers of our own fate. None else has the blame, none has the praise. The wind is blowing; those vessels whose sails are unfurled catch it, and go forward on their way, but those which have their sails furled do not catch the wind. Is that the fault of the wind? Is it the fault of the merciful Father, whose wind of mercy is blowing without ceasing, day and night, whose mercy knows no decay, is it His fault that some of us are happy and some unhappy? We make our own destiny. His sun shines for the weak as well as for the strong. His wind blows for saint and sinner alike. He is the Lord of all, the Father of all, merciful, and impartial. Do you mean to say that He, the Lord of creation, looks upon the petty things of our life in the same light as we do?  We are like little puppies, making life-and-death struggles here, and foolishly thinking that even God Himself will take it as seriously as we do. He knows what the puppies' play means. Our attempts to lay the blame on Him, making Him the punisher, and the rewarder, are only foolish. He neither punishes, nor rewards any. His infinite mercy is open to every one, at all times, in all places, under all conditions, unfailing, unswerving. Upon us depends how we use it. Upon us depends how we utilise it. Blame neither man, nor God, nor anyone in the world. When you find yourselves suffering, blame yourselves, and try to do better.
This is the only solution of the problem. Those that blame others — and, alas! the number of them is increasing every day — are generally miserable with helpless brains; they have brought themselves to that pass through their own mistakes and blame others, but this does not alter their position. It does not serve them in any way. This attempt to throw the blame upon others only weakens them the more.  Say, "This misery that I am suffering is of my own doing, and that very thing proves that it will have to be undone by me alone." That which I created, I can demolish; that which is created by some one else I shall never be able to destroy. Therefore, stand up, be bold, be strong.  All the strength and succour you want is within yourselves. Therefore, make your own future. "Let the dead past bury its dead." The infinite future is before you, and you must always remember that each word, thought, and deed, lays up a store for you and that as the bad thoughts and bad works are ready to spring upon you like tigers, so also there is the inspiring hope that the good thoughts and good deeds are ready with the power of a hundred thousand angels to defend you always and for ever.


Udinese fires Igor Tudor after conceding 11 goals in 2 games
UDINE, Italy (AP) - Udinese has fired coach Igor Tudor after conceding 11 goals in two matches.
Udinese says Luca Gotti, an assistant to Maurizio Sarri at Chelsea last season, will coach the squad on a temporary basis.
After being routed 7-1 by Atalanta last weekend, Udinese was beaten 4-0 at home by 10-man Roma on Wednesday.
Tudor was in his second stint as Udinese coach, having been called in to help the team avoid relegation at the end of each of the past two seasons - which he accomplished.
Despite a modest budget, Udinese has remained in Serie A continuously since the 1995-96 season - behind only Inter Milan, Roma, AC Milan and Lazio in terms of consecutive campaigns in the top division.
But with only three wins in 10 matches, Udinese is in 14th place ahead of a visit to Genoa on Sunday.
It’s the fourth coaching change in Serie A this season after Claudio Ranieri replaced Eusebio Di Francesco at Sampdoria, Stefano Pioli took over for Marco Giampaolo at AC Milan and Thiago Motta stepped in for Aurelio Andreazzoli at Genoa.
More AP soccer: https://apnews.com/Soccer and https://twitter.com/AP_Sports
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


Matching Game
0:00
0
Moves
Congratulations
Total Time Taken =
Star Rating =
Total Moves =
Cancel
Replay


Crazy drunk drivers. Well, I guess that's everything. Yeah, it's 8:00. Oh Mom, there's nothing wrong with calling a boy. Well, they're your parents, you must know them. What are their common interests, what do they like to do together?
No, Biff, you leave her alone. You know, Doc, you left your equipment on all week.
But I need a nuclear reaction to generate the one point twenty-one gigawatts of electricity that I need


/**
* Geometries
* @module geometries
*/
import * as utils from './utils';
import Tetrahedron from './tetrahedron';
import Hexahedron from './hexahedron';
import Octahedron from './octahedron';
import Dodecahedron from './dodecahedron';
import Icosahedron from './icosahedron';
import Plane from './plane';
import Box from './box';
import Sphere from './sphere';
import Torus from './torus';
import TorusKnot from './torusknot';
export {
utils,
/* PLATONIC SOLIDS */
Tetrahedron,
Hexahedron,
Octahedron,
Dodecahedron,
Icosahedron,
/* OTHER */
Plane,
Box,
Sphere,
Torus,
TorusKnot,
};


Home
About
Our Team
Camp site
Mission & vision
Resources
Things to do
Activities
Parks
Shops
Events
Contacts
Maps
Direction
News
AdityaDesle
Developer
Hey there i am aditya desle , i am a student pursuing my degree and a frontend developer


We are looking for jobs!, feel free to checkout our career page here
About
Services
Career
Contact
You can find us at:
Jalan P Ramlee, Kuala Lumpur, 50250 Kuala Lumpur, Wilayah Persekutuan Kuala Lumpur, Malaysia
embedgooglemap.net


Before Change
// A new class value which was not in the first call of partial_fit
// It should raise ValueError
y1 = [5] + y[7:-1]
assert_raises_regexp(ValueError, r"Mini-batch contains \[.+\] while "
r"classes must be subset of \[.+\]",
ovr.partial_fit, X=X[7:], y=y1)
def test_ovr_ovo_regressor():
// test that ovr and ovo work on regressors which don"t have a decision_
After Change
// it should raise ValueError
y1 = [5] + y[7:-1]
msg = r"Mini-batch contains \[.+\] while classes must be subset of \[.+\]"
with pytest.raises(ValueError, match=msg):
ovr.partial_fit(X=X[7:], y=y1)
def test_ovr_ovo_regressor():
// test that ovr and ovo work on regressors which don"t have a decision_
// function
ovr = OneVsRestClassifier(DecisionTreeRegressor())


Invalid Session
Invalid session key or session timed out. If this error persists, please contact support.


Pub to enhance dining experience in expansion project
by Richard CornwellA multi-award winning Suffolk pub is set to expand - and add bedrooms for guests to boost tourism in the county.
In the past four years, The Turks Head has been transformed from a closed down pub into a thriving business and community hub.
But for the pub in Low Road, Hasketon, to continue its success it needs to expand again and now plans have been drawn up for its future.
The idea is to add a new rear extension featuring a flexible dining room and function space, improve the kitchen facilities, and build a single-storey building in the grounds with eight letting rooms.
The enterprise is expected to create six new jobs from the outset.
The Turks Head, a grade II listed former farmhouse dating from the 17th century which has kept its pub name since 1802, has been named best pub in Suffolk twice in the past three years, best family pub in the county and has awards for customer service.
What is proposed?
Plans submitted to East Suffolk Council show the new letting rooms would be designed around the idea of a converted stable-yard to reflect the structures which might have been present when it was a farmhouse with its adjoining barn and out-buildings.
They have been designed with families, couples and business travellers in mind. There are two larger rooms which might suit honeymoon couples and two pairs of adjoining rooms which would be attractive to families.
Why is the expansion needed?
The extra dining space will provide much-needed additional space at peak times, and more flexibility in how the pub runs - with the new dining area able to be used or hired separately to the main dining area for conferences, parties and so on.
A report submitted to planners on the behalf of the pub owners said: "The additional dining facilities will therefore enable the business to promote itself as a location for business meetings. There are many medium to large businesses operating in the area who regularly seek external facilities such as this for off-site meetings, conferences or training.
"At present the business cannot cater for these elements and the proposed dining room addition would therefore provide the opportunity to expand and diversify the business.
"Local businesses such as BT, EDF and Sizewell also often require temporary accommodation for staff, and this is another area that the business would like to diversify into.
"The owners would like to offer 'stay and dine' packages as an additional diversification element. The letting rooms would be ideal for this purpose and would add to the district's tourism offer thereby contributing to its economic well-being."
Community hub
The Turks Head has an important role in the community and is a venue for a number of activities, including Meet-Up Mondays to help combat loneliness and allow people an opportunity to start the week with company and make new friends.
The pub also caters for the monthly Village Lunch run by the church, while the Knitting Group meets in the pub, which is also home to a local Petanque team.


Field Work
Field Work is a web application that supports offline editing and mapping of geospatial data using Cloudant Geo or Lucene Geo query. It also supports map editing, and syncs locally edited data back to an IBM Cloudant database.
Many field-based industries whose personnel are disconnected from communications networks -- often in remote areas or even underground -- can benefit from this kind of offline-first mobile application.
- Pan to an area of interest by "dragging the map" (the initial area you see is fine) and click on the "Load Data" button to start syncing with the Cloudant database.
- A "Layers" menu will appear in the top right corner of the map. Click on check boxes next to the data layers to toggle their visibility.
- Pushpins will also appear on top of the map. These are the items that can be edited. If you've clicked the "Load Data" button, the "Edit Pins" button will be enabled. Click that to begin editing. 3 new editing tools will appear below the "+" and "-" map controls
- Hover over those editing controls for prompts on adding, deleting and modifying pushpins.


It is convenient to be able to wait for the completion of any, some, or all the operations in a list, rather than having to wait for a specific message. A call to MPI_WAITANY or MPI_TESTANY can be used to wait for the completion of one out of several operations. A call to MPI_WAITALL or MPI_TESTALL can be used to wait for all pending operations in a list. A call to MPI_WAITSOME or MPI_TESTSOME can be used to complete all enabled operations in a list.
MPI_WAITANY (count, array_of_requests, index, status)
[ IN count] list length (integer)
[ INOUT array_of_requests] array of requests (array of handles)
[ OUT index] index of handle for operation that completed (integer)
[ OUT status] status object (Status)
int MPI_Waitany(int count, MPI_Request *array_of_requests, int *index, MPI_Status *status)
MPI_WAITANY(COUNT, ARRAY_OF_REQUESTS, INDEX, STATUS, IERROR)
INTEGER COUNT, ARRAY_OF_REQUESTS(*), INDEX, STATUS(MPI_STATUS_SIZE), IERROR
Blocks until one of the operations associated with the active requests in the array has completed. If more then one operation is enabled and can terminate, one is arbitrarily chosen. Returns in index the index of that request in the array and returns in status the status of the completing communication. (The array is indexed from zero in C, and from one in Fortran.) If the request was allocated by a nonblocking communication operation, then it is deallocated and the request handle is set to MPI_REQUEST_NULL.
The array_of_requests list may contain null or inactive handles. If the list contains no active handles (list has length zero or all entries are null or inactive), then the call returns immediately with index = MPI_UNDEFINED, and a empty status.
The execution of MPI_WAITANY(count, array_of_requests, index, status) has the same effect as the execution of MPI_WAIT(&array_of_requests[i], status), where i is the value returned by index (unless the value of index is MPI_UNDEFINED). MPI_WAITANY with an array containing one active entry is equivalent to MPI_WAIT.
MPI_TESTANY(count, array_of_requests, index, flag, status)
[ IN count] list length (integer)
[ INOUT array_of_requests] array of requests (array of handles)
[ OUT index] index of operation that completed,
or MPI_UNDEFINED if none completed (integer)
[ OUT flag] true if one of the operations is complete
(logical)
[ OUT status] status object (Status)
int MPI_Testany(int count, MPI_Request *array_of_requests, int *index, int *flag, MPI_Status *status)
MPI_TESTANY(COUNT, ARRAY_OF_REQUESTS, INDEX, FLAG, STATUS, IERROR)
LOGICAL FLAG
INTEGER COUNT, ARRAY_OF_REQUESTS(*), INDEX, STATUS(MPI_STATUS_SIZE), IERROR
Tests for completion of either one or none of the operations associated with active handles. In the former case, it returns flag = true, returns in index the index of this request in the array, and returns in status the status of that operation; if the request was allocated by a nonblocking communication call then the request is deallocated and the handle is set to MPI_REQUEST_NULL. (The array is indexed from zero in C, and from one in Fortran.) In the latter case (no operation completed), it returns flag = false, returns a value of MPI_UNDEFINED in index and status is undefined.
The array may contain null or inactive handles. If the array contains no active handles then the call returns immediately with flag = true, index = MPI_UNDEFINED, and an empty status.
If the array of requests contains active handles then the execution of MPI_TESTANY(count, array_of_requests, index, status) has the same effect as the execution of MPI_TEST( &array_of_requests[i], flag, status), for i=0, 1 ,..., count-1, in some arbitrary order, until one call returns flag = true, or all fail. In the former case, index is set to the last value of i, and in the latter case, it is set to MPI_UNDEFINED. MPI_TESTANY with an array containing one active entry is equivalent to MPI_TEST.
[] Rationale.
The function MPI_TESTANY returns with flag = true
exactly in those situations where the function MPI_WAITANY
returns; both functions return in that case the same values in
the remaining parameters. Thus, a blocking MPI_WAITANY
can be easily replaced by a
nonblocking MPI_TESTANY. The same relation holds for the
other pairs of Wait and Test functions defined in this section.
( End of rationale.)
MPI_WAITALL( count, array_of_requests, array_of_statuses)
[ IN count] lists length (integer)
[ INOUT array_of_requests] array of requests (array of handles)
[ OUT array_of_statuses] array of status objects (array of Status)
int MPI_Waitall(int count, MPI_Request *array_of_requests, MPI_Status *array_of_statuses)
MPI_WAITALL(COUNT, ARRAY_OF_REQUESTS, ARRAY_OF_STATUSES, IERROR)
INTEGER COUNT, ARRAY_OF_REQUESTS(*)
INTEGER ARRAY_OF_STATUSES(MPI_STATUS_SIZE,*), IERROR
Blocks until all communication operations associated with active handles in the list complete, and return the status of all these operations (this includes the case where no handle in the list is active). Both arrays have the same number of valid entries. The i-th entry in array_of_statuses is set to the return status of the i-th operation. Requests that were created by nonblocking communication operations are deallocated and the corresponding handles in the array are set to MPI_REQUEST_NULL. The list may contain null or inactive handles. The call sets to empty the status of each such entry.
The error-free execution of MPI_WAITALL(count, array_of_requests,
array_of_statuses) has the same effect as the execution of
MPI_WAIT(&array_of_request[i], &array_of_statuses[i]),
for i=0 ,..., count-1, in some arbitrary order.
MPI_WAITALL with an array of length one
is equivalent to MPI_WAIT.
When one or more of the communications completed by a call to MPI_WAITALL fail, it is desireable to return specific information on each communication. The function MPI_WAITALL will return in such case the error code MPI_ERR_IN_STATUS and will set the error field of each status to a specific error code. This code will be MPI_SUCCESS, if the specific communication completed; it will be another specific error code, if it failed; or it can be MPI_ERR_PENDING if it has neither failed nor completed. The function MPI_WAITALL will return MPI_SUCCESS if no request had an error, or will return another error code if it failed for other reasons (such as invalid arguments). In such cases, it will not update the error fields of the statuses.
[] Rationale.
This design streamlines error handling in the application.
The application code need only test the (single) function result to
determine if an error has occurred. It needs to check each individual
status only when an error occurred.
( End of rationale.)
MPI_TESTALL(count, array_of_requests, flag,
array_of_statuses)
[ IN count] lists length (integer)
[ INOUT array_of_requests] array of requests (array of handles)
[ OUT flag] (logical)
[ OUT array_of_statuses] array of status objects (array of Status)
int MPI_Testall(int count, MPI_Request *array_of_requests, int *flag, MPI_Status *array_of_statuses)
MPI_TESTALL(COUNT, ARRAY_OF_REQUESTS, FLAG, ARRAY_OF_STATUSES, IERROR)
LOGICAL FLAG
INTEGER COUNT, ARRAY_OF_REQUESTS(*), ARRAY_OF_STATUSES(MPI_STATUS_SIZE,*), IERROR
Returns flag = true if all communications associated with active handles in the array have completed (this includes the case where no handle in the list is active). In this case, each status entry that corresponds to an active handle request is set to the status of the corresponding communication; if the request was allocated by a nonblocking communication call then it is deallocated, and the handle is set to MPI_REQUEST_NULL. Each status entry that corresponds to a null or inactive handle is set to empty.
Otherwise, flag = false is returned, no request is modified and the values of the status entries are undefined. This is a local operation.
Errors that occurred during the execution of MPI_TESTALL are handled as errors in MPI_WAITALL.
MPI_WAITSOME(incount, array_of_requests, outcount,
array_of_indices, array_of_statuses)
[ IN incount] length of array_of_requests (integer)
[ INOUT array_of_requests] array of requests (array of handles)
[ OUT outcount] number of completed requests (integer)
[ OUT array_of_indices] array of indices of operations that
completed (array of integers)
[ OUT array_of_statuses] array of status objects for
operations that completed (array of Status)
int MPI_Waitsome(int incount, MPI_Request *array_of_requests, int *outcount, int *array_of_indices, MPI_Status *array_of_statuses)
MPI_WAITSOME(INCOUNT, ARRAY_OF_REQUESTS, OUTCOUNT, ARRAY_OF_INDICES, ARRAY_OF_STATUSES, IERROR)
INTEGER INCOUNT, ARRAY_OF_REQUESTS(*), OUTCOUNT, ARRAY_OF_INDICES(*), ARRAY_OF_STATUSES(MPI_STATUS_SIZE,*), IERROR
Waits until at least one of the operations associated with active handles in the list have completed. Returns in outcount the number of requests from the list array_of_requests that have completed. Returns in the first outcount locations of the array array_of_indices the indices of these operations (index within the array array_of_requests; the array is indexed from zero in C and from one in Fortran). Returns in the first outcount locations of the array array_of_status the status for these completed operations. If a request that completed was allocated by a nonblocking communication call, then it is deallocated, and the associated handle is set to MPI_REQUEST_NULL.
If the list contains no active handles, then the call returns immediately with outcount = MPI_UNDEFINED.
When one or more of the communications completed by MPI_WAITSOME fails, then it is desirable to return specific information on each communication. The arguments outcount, array_of_indices and array_of_statuses will be adjusted to indicate completion of all communications that have succeeded or failed. The call will return the error code MPI_ERR_IN_STATUS and the error field of each status returned will be set to indicate success or to indicate the specific error that occurred. The call will return MPI_SUCCESS if no request resulted in an error, and will return another error code if it failed for other reasons (such as invalid arguments). In such cases, it will not update the error fields of the statuses.
MPI_TESTSOME(incount, array_of_requests, outcount,
array_of_indices, array_of_statuses)
[ IN incount] length of array_of_requests (integer)
[ INOUT array_of_requests] array of requests (array of handles)
[ OUT outcount] number of completed requests (integer)
[ OUT array_of_indices] array of indices of operations that
completed (array of integers)
[ OUT array_of_statuses] array of status objects for
operations that completed (array of Status)
int MPI_Testsome(int incount, MPI_Request *array_of_requests, int *outcount, int *array_of_indices, MPI_Status *array_of_statuses)
MPI_TESTSOME(INCOUNT, ARRAY_OF_REQUESTS, OUTCOUNT, ARRAY_OF_INDICES, ARRAY_OF_STATUSES, IERROR)
INTEGER INCOUNT, ARRAY_OF_REQUESTS(*), OUTCOUNT, ARRAY_OF_INDICES(*), ARRAY_OF_STATUSES(MPI_STATUS_SIZE,*), IERROR
Behaves like MPI_WAITSOME, except that it returns immediately. If no operation has completed it returns outcount = 0. If there is no active handle in the list it returns outcount = MPI_UNDEFINED.
MPI_TESTSOME is a local operation, which returns immediately, whereas MPI_WAITSOME willblock until a communication completes, if it was passed a list that contains at least one active handle. Both calls fulfill a fairness requirement: If a request for a receive repeatedly appears in a list of requests passed to MPI_WAITSOME or MPI_TESTSOME, and a matching send has been posted, then the receive will eventually succeed, unless the send is satisfied by another receive; and similarly for send requests.
Errors that occur during the execution of MPI_TESTSOME are
handled as for
MPI_WAITSOME.
[] Advice to users.
The use of MPI_TESTSOME is likely to be more efficient than the use of MPI_TESTANY. The former returns information on all completed communications, with the latter, a new call is required for each communication that completes.
A server with multiple clients can use MPI_WAITSOME so as not to
starve any client. Clients send messages to the server with service
requests. The server calls MPI_WAITSOME with one receive request
for each client, and then handles all receives that completed.
If a call to MPI_WAITANY is used instead, then one client
could starve while requests from another client always sneak in first.
( End of advice to users.)
[] Advice
to implementors.
MPI_TESTSOME should complete as many pending communications as
possible.
( End of advice to implementors.)
Example
Client-server code (starvation can occur).
CALL MPI_COMM_SIZE(comm, size, ierr) CALL MPI_COMM_RANK(comm, rank, ierr) IF(rank > 0) THEN ! client code DO WHILE(.TRUE.) CALL MPI_ISEND(a, n, MPI_REAL, 0, tag, comm, request, ierr) CALL MPI_WAIT(request, status, ierr) END DO ELSE ! rank=0 -- server code DO i=1, size-1 CALL MPI_IRECV(a(1,i), n, MPI_REAL, i tag, comm, request_list(i), ierr) END DO DO WHILE(.TRUE.) CALL MPI_WAITANY(size-1, request_list, index, status, ierr) CALL DO_SERVICE(a(1,index)) ! handle one message CALL MPI_IRECV(a(1, index), n, MPI_REAL, index, tag, comm, request_list(index), ierr) END DO END IF
Example
Same code, using MPI_WAITSOME.
CALL MPI_COMM_SIZE(comm, size, ierr) CALL MPI_COMM_RANK(comm, rank, ierr) IF(rank > 0) THEN ! client code DO WHILE(.TRUE.) CALL MPI_ISEND(a, n, MPI_REAL, 0, tag, comm, request, ierr) CALL MPI_WAIT(request, status, ierr) END DO ELSE ! rank=0 -- server code DO i=1, size-1 CALL MPI_IRECV(a(1,i), n, MPI_REAL, i, tag, comm, requests(i), ierr) END DO DO WHILE(.TRUE.) CALL MPI_WAITSOME(size, request_list, numdone, indices, statuses, ierr) DO i=1, numdone CALL DO_SERVICE(a(1, indices(i))) CALL MPI_IRECV(a(1, indices(i)), n, MPI_REAL, 0, tag, comm, requests(indices(i)), ierr) END DO END DO END IF


Submitted by mpruessmeier on Thu, 26/03/2015 - 19:48
in pushing data by .csv to emoncms i had to change some behaviors in process_model.php
In process_model is a security check to not calculate values for a input older then 2 Hours.
This check is in Power_to_kwh, Power_to_kwhd, histogram and input_ontime.
By re feeding emoncms with older data, maybe from the energy company over a full year, this values have to get passed. maybe this can be done by setting a global variable or a variable by user for that.
by this checks i found a behavior error in histogram, cause values ware accumulated at same timestamp.
This is wrong in my opinion, cause a timestamp is unique for a feed.
This has to be changed in the else part in histogram.
// wrong, cause time is uniqe, don't accumulate data !!!
// $new_kwh = $last_kwh + $kwh_inc;
$new_kwh = $kwh_inc;
I would do this by myself, but maybe someone can tell me how to work with pull requests.
needed changes in process_model for resend data
Submitted by mpruessmeier on Thu, 26/03/2015 - 19:48in pushing data by .csv to emoncms i had to change some behaviors in process_model.php
In process_model is a security check to not calculate values for a input older then 2 Hours.
This check is in Power_to_kwh, Power_to_kwhd, histogram and input_ontime.
By re feeding emoncms with older data, maybe from the energy company over a full year, this values have to get passed. maybe this can be done by setting a global variable or a variable by user for that.
by this checks i found a behavior error in histogram, cause values ware accumulated at same timestamp.
This is wrong in my opinion, cause a timestamp is unique for a feed.
This has to be changed in the else part in histogram.
// wrong, cause time is uniqe, don't accumulate data !!!
// $new_kwh = $last_kwh + $kwh_inc;
$new_kwh = $kwh_inc;
I would do this by myself, but maybe someone can tell me how to work with pull requests.
Thanks Marc


Other post data send when the user is loggin on, some web applications check this extra data before processing the authentication mecanism. Example : username=admin&password=secret&action=login more details


| /// File Name: |
lsa_transnames_heap-linux.rb.txt |
Description:
|
This Metasploit module triggers a heap overflow in the LSA RPC service of the Samba daemon. This module uses the TALLOC chunk overwrite method (credit Ramon and Adriano), which only works with Samba versions 3.0.21 through 3.0.24. Additionally, this module will not work when the Samba "log level" parameter is higher than "2". Linux version.
|
| Author: | Ramon de Carvalho Valle, Adriano Lima, H D Moore |
| Homepage: | http://www.risesecurity.org/ |
| File Size: | 8017 |
| Related CVE(s): | CVE-2007-2446 |
| Last Modified: | Jul 26 08:00:21 2007 |
| MD5 Checksum: | 4f3d9021ab7aeab8ee51f9ee5605ad0c |


Joose.Manual.Contributing - How to get involved in Joose
Joose is an open project, and we are always willing to accept bug fixes, more tests, and documentation patches. Commit bits are given out freely, and the "STANDARD WORKFLOW" is very simple. The general gist is: clone the Git repository, create a new topic branch, hack away, then find a committer to review your changes.
Joose already has a fairly large feature set, and we are currently not looking to add any major new features to it. If you have an idea for a new feature in Joose, you are invited instead to create a JooseX module first.
At this stage, no new features will even be considered for addition into the core without first being vetted as a JooseX module, unless it is absolutely 100% impossible to implement the feature outside the core.
If you think it is 100% impossible, please come discuss it with us on IRC or via e-mail. However, your feature may need a small hook in the core, or a refactoring of some core modules, and we are definitely open to that.
Joose was built from the ground up with the idea of being highly extensible, and quite often the feature requests we see can be implemented through a couple of small and well placed extensions. Try it, it is much easier then you might think.
As Joose has matured, some structure has emerged in the process.
Contributors - people creating a topic or branch
You.
If you have commit access, you can create a topic on the main Joose.git, otherwise either give us your SSH key or create your own clone of the git://git.Joose.perl.org/Joose.git repository or fork of the GitHub mirror.
Core Committers - people reviewing and merging a branch
These people have worked with the Joose codebase for a while.
They've been responsible for large features or branches and can help review your changes and apply them to the master branch using the basic "APPROVAL WORKFLOW".
They are also fairly well versed in Git, in order to merge the branches with no mistakes (especially when the merge fails), and to provide advice to contributors.
 They're listed under "CABAL" in Joose in the Joose documentation. They merge from Master to Stable.
The repository is divided into several branches to make maintenance easier for everyone involved. The branches below are ordered by level of stability.
Stable (refs/heads/stable)
The branch from which releases are cut. When making a new release, the release manager merges from master to stable. The stable branch is only updated by someone from the Cabal during a release.
Master (refs/heads/master)
The branch for new development. This branch is merged into and branched from.
Branches (refs/heads/*)
Large community branches for big development "projects".
Topics (refs/heads/topic/*)
Small personal branches that have been published for review, but can get freely rebased. Targeted features that may span a handful of commits.
Any change or bugfix should be created in a topic branch.
# update your copy of master
git checkout master
git pull --rebase
# create a new topic branch
git checkout -b topic/my-feature
# hack, commit, feel free to break fast forward
git commit --amend # allowed
git rebase --interactive # allowed
git push --force origin topic/my_feature # allowed
Then ask for a review/approval (see "APPROVAL WORKFLOW"), and merge to master. If it merges cleanly and nobody has any objections, then it can be pushed to master.
If it doesn't merge as a fast forward, the author of the branch needs to run
git remote update
git rebase origin/master # or merge
and bring the branch up to date, so that it can be merged as a fast forward into master.
No actual merging (as in a human resolving conflicts) should be done when merging into master, only from master into other branches.
Before a merge, a topic branch can be cleaned up by the author.
This can be done using interactive rebase to combine commits, etc, or even git merge --squash to make the whole topic into a single commit.
Structuring changes like this makes it easier to apply git revert at a later date, and encourages a clean and descriptive history that documents what the author was trying to do, without the various hangups that happened while they were trying to do it (commits like "oops forgot that file" are not only unnecessary noise, they also make running things like git bisect or git revert harder).
However, by far the biggest benefit is that the number of commits that go into master is eventually reduced, and they are simple and coherent, making it much easier for people maintaining branches to stay up to date.
All large changes should be documented in Joose.Manual.Delta
Joose is an open project but it is also an increasingly important one. Many modules depend on Joose being stable. Therefore, we have a basic set of criteria for reviewing and merging branches. What follows is a set of rough guidelines that ensures all new code is properly vetted before it is merged to the master branch.
It should be noted that if you want your specific branch to be approved, it is your responsibility to follow this process and advocate for your branch. The preferred way is to send a request to the mailing list for review/approval, this allows us to better keep track of the branches awaiting approval and those which have been approved.
These items don't really require approval beyond one of the core contributors just doing a simple review.
Larger bug fixes should be reviewed by at least one cabal member and should be extensively tested.
New documentation is always welcome, but should also be reviewed by a cabal member for accuracy.
TODO tests are basically feature requests, see our "NEW FEATURES" section for more information on that. If your feature needs core support, create a topic/ branch using the "STANDARD WORKFLOW" and start hacking away.
Failing tests are basically bug reports. You should find a core contributor and/or cabal member to see if it is a real bug, then submit the bug and your test to the issues tracker. Source control is not a bug reporting tool.
Anything that creates a new user-visible feature needs to be approved by more then one cabal member.
Make sure you have reviewed "NEW FEATURES" to be sure that you are following the guidelines. Do not be surprised if a new feature is rejected for the core.
New features for Joose internals are less restrictive then user facing features, but still require approval by at least one cabal member.
Ideally you will have run the smolder script to be sure you are not breaking any JooseX module or causing any other unforeseen havoc. If you do this (rather then make us do it), it will only help to hasten your branch's approval.
Anything that breaks backwards compatibility must be discussed by the cabal and agreed to by a majority of the members.
We have a policy for what we see as sane "BACKWARDS COMPATIBILITY" for Joose. If your changes break back-compat, you must be ready to discuss and defend your change.
git checkout master
# edit for final version bumping, changelogging, etc
# prepare release (test suite etc)
git commit
git checkout stable
git merge master # must be a fast forward
git push both
# ship & tag
Development releases are made without merging into the stable branch.
Anyone can create the necessary fix by branching off of the stable branch:
git remote update
git checkout -b topic/my-emergency-fix origin/stable
# hack
git commit
Then a cabal member merges into stable:
git checkout stable
git merge topic/my-emergency-fix
git push
# release
git checkout master
git merge stable
For longer lasting branches, we use a subversion style branch layout, where master is routinely merged into the branch. Rebasing is allowed as long as all the branch contributors are using git pull --rebase properly.
commit --amend, rebase --interactive, etc. are not allowed, and should only be done in topic branches. Committing to master is still done with the same review process as a topic branch, and the branch must merge as a fast forward.
This is pretty much the way we're doing branches for large-ish things right now.
Obviously there is no technical limitation on the number of branches. You can freely create topic branches off of project branches, or sub projects inside larger projects freely. Such branches should incorporate the name of the branch they were made off so that people don't accidentally assume they should be merged into master:
git checkout -b my-project--topic/foo my-project
(unfortunately Git will not allow my-project/foo as a branch name if my-project is a valid ref).
To make things easier for longer lived branches (whether topics or projects), the 'pu' branch is basically what happens if you merge all of the branches and topics together with master.
We can update this as necessary (e.g. on a weekly basis if there is merit), notifying the authors of the respective branches if their branches did not merge (and why).
To update 'pu':
git checkout pu
git remote update
git reset --hard origin/master
git merge @all_the_branches
If the merge is clean, 'pu' is updated with push --force.
If the merge is not clean, the offending branch is removed from @all_the_branches, with a small note of the conflict, and we try again.
The authors of the failed branches should be told to try to merge their branch into 'pu', to see how their branch interacts with other branches.
'pu' is probably broken most of the time, but lets us know how the different branches interact.
Merged branches should be deleted.
Failed branches may be kept, but consider moving to refs/attic/ (e.g. http://danns.co.uk/node/295) to keep git branch -l current.
Any branch that could still realistically be merged in the future, even if it hasn't had work recently, should not be archived.
If you write any code for Joose, you must add tests for that code. If you do not write tests then we cannot guarantee your change will not be removed or altered at a later date, as there is nothing to confirm this is desired behavior.
If your code change/addition is deep within the bowels of Joose and your test exercises this feature in a non-obvious way, please add some comments either near the code in question or in the test so that others know.
We also greatly appreciate documentation to go with your changes, and an entry in the Changes file. Make sure to give yourself credit!
Change is inevitable, and Joose is not immune to this. We do our best to maintain backwards compatibility, but we do not want the code base to become overburdened by this. This is not to say that we will be frivolous with our changes, quite the opposite, just that we are not afraid of change and will do our best to keep it as painless as possible for the end user.
The rule is that if you do something that is not backwards compatible, you must do at least one deprecation cycle (more if it is larger change). For really larger or radical changes dev releases may be needed as well (the Cabal will decide on this on a case-per-case basis).
The preference with regard to deprecation is to warn loudly and often so that users will have time to fix their usages.
All backwards incompatible changes must be documented in Joose.Manual.Delta. Make sure to document any useful tips or workarounds for the change in that document.
Nickolay Platonov<EMAIL_ADDRESS>Heavily based on the original content of Moose::Manual, by
Stevan Little<EMAIL_ADDRESS>Chris (perigrin) Prather
Yuval (nothingmuch) Kogman
Copyright (c) 2008-2011, Malte Ubl, Nickolay Platonov
All rights reserved.
Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met:
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.


| DOSE: |
5 cups |
oral |
Datura |
(tea) |
This night took place on October 15, fall 2005. During one of our board nights at a friends house we decided we wanted to trip really bad. We couldn't find any shrooms at the time so we collected some datura seed pods. First we opened quite a few seed pods and filled the bottom of an average size sauce pan of Datura seeds. We brought it to a strong boil, than let it simmer on medium heat with a sauce pan top cover for 1 hour. We had 2 batches going at once.
Next we consumed it. I used a small coffee mug to drink it, and I filled the mug about 5 times, maybe 5 and a half. It only took about 30mins for me to start feeling a slight trip. I noticed that if I looked at my hands I could see what looked like tiny white molecules running up and down it, at this point I knew it was only a matter of time. After about 3 hours my speech was slurred and walking was very difficult because I felt like my body was weighed down. The following is the minor details I remember the rest of the night, although they may not be in correct order.
I don't know how I got outside to my truck or why I did, but the next thing I knew I was sitting in the drivers seat in front of my friends house defrosting my windshield. Things happened almost like a dream that I didn't realize was a dream. It all seemed like perfect reality to me. Another memory I have is going down a streat leaving town when I suddenly realized this isn't where I want to be so I turned around.
[Erowid Note: Driving while intoxicated or tripping is dangerous and irresponsible because it endangers other people. Don't do it!] Now as far as I can remember there was no one else in my truck with me, but suddenly my brother was in the passenger seat (he lives 3 hours away). It seemed completely normal to me though and we started talking (I don't remember where I drove or where I was going).
I do have a horrible memory of what happened next though. I clearly remember looking over at my brother (who was either all in my head or it was someone else riding with me). He had the scariest look in his eyes looking straight out ahead of him, then suddenly he slumped over and closed his eyes.  I'm not sure if I parked for this or not.
Next thing I know I'm at a corner of 2 streets stepping out of the car to see where I was so I could find a hospital. But when I stepped back in my car the passenger seat was empty.
Next memory I have is being in a parking lot of an abandoned grociery store. All of a sudden the night skie was filled with fireworks and for some reason even though it was 3am my mind registered it as a football game on campus (even though I was no where near campus). These fireworks were insane with flashing outter edges to the circle and sparks chasing each other around in the middle. Then I looked behind me to see if anyone else was around. There was a girl I've never seen before sitting in my back cab. You have no idea how bad this scared me, I turned my head back to the fireworks and tried to forget about it. After about 5mins I turned around and the girl was gone. I then remember the fireworks drifting down to the ground as they burned out. They would skid the streets and sidewalks slowly fading away.
I no longer have a memory of what happened next, I woke up the next morning in my bed with a slight headache.
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.


Image Before Text
| Image Left/Text Left |
|
Image Left/Text Center |
|
Image Left/Text Right |
|
| Image Center/Text Left |
|
Image Center/Text Center |
|
Image Center/Text Right |
|
| Image Right/Text Left |
|
Image Right/Text Center |
|
Image Right/Text Right |
|
Text Before Image
| Text Left/Image Left |
|
Text Left/Image Center |
|
Text Left/Image Right |
|
| Text Center/Image Left |
|
Text Center/Image Center |
|
Text Center/Image Right |
|
| Text Right/Image Left |
|
Text Right/Image Center |
|
Text Right/Image Right |
|
Image Above Text
| Image Left/Text Left |
|
Image Left/Text Center |
|
Image Left/Text Right |
|
| Image Center/Text Left |
|
Image Center/Text Center |
|
Image Center/Text Right |
|
| Image Right/Text Left |
|
Image Right/Text Center |
|
Image Right/Text Right |
|
Text Above Image
| Text Left/Image Left |
|
Text Left/Image Center |
|
Text Left/Image Right |
|
| Text Center/Image Left |
|
Text Center/Image Center |
|
Text Center/Image Right |
|
| Text Right/Image Left |
|
Text Right/Image Center |
|
Text Right/Image Right |
|
Overlay(Text and Image can be one over another)
| Image Left/Text Left |
|
Image Left/Text Center |
|
Image Left/Text Right |
|
| Image Center/Text Left |
|
Image Center/Text Center |
|
Image Center/Text Right |
|
| Image Right/Text Left |
|
Image Right/Text Center |
|
Image Right/Text Right |
|


@* * This template is called from the `index` template. This template * handles the rendering of the page header and body tags. It takes * two arguments, a `String` for the title of the page and an `Html` * object to insert into the body of the page. *@ @(title: String, isLog: Boolean, profile: String)(content: Html)
@* Here's where we render the page title `String`. *@


See: Description
| Exception | Description |
|---|---|
| H2OException | |
| H2OModelBuilderException |
Provides classes that allow you to interact with an H2O cluster and carry out data modeling tasks. These classes make use of the H2O REST API to access the H2O JVM and its capabilities as a distributed, parallel, in-memory data processing engine. Full H2O REST API spec available here.
Main client classes to use to interface with H2O from within your application:
H2OConnection
H2OFrame
H2OModel
H2OModelBuilder


{(meta.html)}
{(header.html)}
You can find more details about
Orange
on the project website:
Orange Documents & News
{(footer.html)}


You have two minutes to complete this geography quiz. If you answer the question wrong, the test will deduct 10 seconds from your score.


Step 3: Install sjb.pyguide¶
The project generator is run somewhat like venv. That is, I usually go to my Python 3.x installation, and
from there run venv
to create the virtual environment. Therefore, in this guide I take the approach
of installing sjb.pyguide to the default Python 3.x directory.
c:\Python37>scripts\pip install sjb.pyguide
Collecting sjb.pyguide
Using cached https://files.pythonhosted.org/packages/5e/f7/ec25e7ba99a49d9d5571a2aaf83e62c822e4c6d08e5df9cc67ebd11b2e81/sjb.pyguide-0.2.5-py2.py3-none-any.whl
Requirement already satisfied: twine==1.13.0 in c:\users\sburke\appdata\roaming\python\python37\site-packages (from sjb.pyguide) (1.13.0)
Requirement already satisfied: requests in c:\python37\lib\site-packages (from sjb.pyguide) (2.22.0)
Requirement already satisfied: Jinja2==2.10.1 in c:\python37\lib\site-packages (from sjb.pyguide) (2.10.1)
Collecting configparser2==4.0.0 (from sjb.pyguide)
Collecting Menu==3.1.0 (from sjb.pyguide)
Requirement already satisfied: setuptools>=0.7.0 in c:\python37\lib\site-packages (from twine==1.13.0->sjb.pyguide) (41.2.0)
Requirement already satisfied: requests-toolbelt!=0.9.0,>=0.8.0 in c:\users\sburke\appdata\roaming\python\python37\site-packages (from twine==1.13.0->sjb.pyguide) (0.9.1)
Requirement already satisfied: readme-renderer>=21.0 in c:\users\sburke\appdata\roaming\python\python37\site-packages (from twine==1.13.0->sjb.pyguide) (24.0)
Requirement already satisfied: tqdm>=4.14 in c:\users\sburke\appdata\roaming\python\python37\site-packages (from twine==1.13.0->sjb.pyguide) (4.35.0)
Requirement already satisfied: pkginfo>=1.4.2 in c:\users\sburke\appdata\roaming\python\python37\site-packages (from twine==1.13.0->sjb.pyguide) (<IP_ADDRESS>)
Requirement already satisfied: chardet<3.1.0,>=3.0.2 in c:\python37\lib\site-packages (from requests->sjb.pyguide) (3.0.4)
Requirement already satisfied: certifi>=2017.4.17 in c:\python37\lib\site-packages (from requests->sjb.pyguide) (2019.6.16)
Requirement already satisfied: urllib3!=1.25.0,!=1.25.1,<1.26,>=1.21.1 in c:\python37\lib\site-packages (from requests->sjb.pyguide) (1.25.3)
Requirement already satisfied: idna<2.9,>=2.5 in c:\python37\lib\site-packages (from requests->sjb.pyguide) (2.8)
Requirement already satisfied: MarkupSafe>=0.23 in c:\python37\lib\site-packages (from Jinja2==2.10.1->sjb.pyguide) (1.1.1)
Requirement already satisfied: Pygments in c:\python37\lib\site-packages (from readme-renderer>=21.0->twine==1.13.0->sjb.pyguide) (2.4.2)
Requirement already satisfied: six in c:\python37\lib\site-packages (from readme-renderer>=21.0->twine==1.13.0->sjb.pyguide) (1.12.0)
Requirement already satisfied: docutils>=0.13.1 in c:\python37\lib\site-packages (from readme-renderer>=21.0->twine==1.13.0->sjb.pyguide) (0.15.2)
Requirement already satisfied: bleach>=2.1.0 in c:\users\sburke\appdata\roaming\python\python37\site-packages (from readme-renderer>=21.0->twine==1.13.0->sjb.pyguide) (3.1.0)
Requirement already satisfied: webencodings in c:\users\sburke\appdata\roaming\python\python37\site-packages (from bleach>=2.1.0->readme-renderer>=21.0->twine==1.13.0->sjb.pyguide) (0.5.1)
Installing collected packages: configparser2, Menu, sjb.pyguide
Successfully installed Menu-3.1.0 configparser2-4.0.0 sjb.pyguide-0.2.5
c:\Python37>scripts\py_guide --show_menu


SILVER PLAN
£5 / Month
(billed annually -365 day free trial)
Up To
5
Groups - Teams, Leagues etc
- X
YOU GET EVERYTHING!
- Ad Free Landing Page
- Buyer E-mail Automatic Verification
- Create Buy Now Pages
- Lead Generation Form Creator
- Get Complete Stats: Unique Hits, Views & Offers
- Embed Your Affiliate Code Into Landing Pages
- Create Affiliate Link Redirects
- Configure Robots 'Index or NoIndex' Options
- Configure Title & Description Meta Tags
- E-mail & Skype Support
365 Day Free Trial


Open your Chrome extensions page:
chrome://chrome/extensions/
Drag
src.crx
file from
chrome
folder and drop it on that Chrome extensions page.

Cancel
Delete


vignettes/bmassIntro.1.SimulatedData.Rmd
bmassIntro.1.SimulatedData.Rmd
This is a very simple, introductory vignette on how to run bmass
. In this introductory example, we will use a small, simulated dataset to run bmass
and explore some basic output. The dataset is provided with the package.
The purpose of this vignette is to quickly allow users to get up and running with bmass
. For a more advanced introductory vignette, where we download and use the GlobalLipids 2013 dataset as an example, please see here.
bmass
For this introductory vignette, we will be using bmass_SimulatedData1
, bmass_SimulatedData2
, and bmass_SimulatedSigSNPs
. These are simulated datasets created for the purposes of unit testing and this vignette. To load up ‘bmass’ and the datasets, run the following:
library("bmass");
data(bmass_SimulatedData1, bmass_SimulatedData2, bmass_SimulatedSigSNPs)
Phenotypes <- c("bmass_SimulatedData1", "bmass_SimulatedData2")
First, we’ll take a look at the format of one of our simulated datasets:
## Chr BP Marker MAF A1 A2 Direction pValue N
## 1 1 1000 rs1 0.20 A G - 6.0e-13 2500
## 2 1 2000 rs2 0.10 G T - 7.6e-02 2467
## 3 2 3000 rs3 0.06 T G + 3.0e-09 2761
## 4 3 4000 rs4 0.40 C A + 5.6e-03 2310
## 5 3 15000 rs5 0.40 C T + 1.0e-07 2410
## 6 3 21000 rs6 0.37 G A + 5.0e-08 2582
Here you should see nine columns: Chr, BP, Marker, MAF, A1, A2, Direction, pValue, N. bmass
expects each input dataset (representing a single phenotype GWAS) to contain these 9 columns and with these specific headers. Their descriptions are as follows –
Now to run bmass
, all we use is the following code:
Note that at its most basic level, we only need to provide two inputs for bmass()
to properly run: a vector of strings containing the variable names of each of our univariate summary GWAS datasets and a file containing the list of previously associated univariate genome-wide significant SNPs. The former input, the vector of strings, dictates to bmass()
where to find each dataset and what to call each phenotype being analyzed (ie the name of each variable containg the GWAS summary data is expected to correspond to the phenotype represented by that data). The latter input is just a list of each previous GWAS SNP with the following two columns of information, Chr
and BP
:
## Chr BP
## 1 1 1000
## 2 2 3000
Now to begin to get a sense of what bmass()
outputs, we can run the following:
## Length Class Mode
## MarginalSNPs 3 -none- list
## PreviousSNPs 4 -none- list
## NewSNPs 3 -none- list
## LogFile 19 -none- character
## ZScoresCorMatrix 4 -none- numeric
## Models 18 -none- numeric
## ModelPriors 126 -none- numeric
## GWASlogBFMinThreshold 1 -none- numeric
As you can see, there are multiple output variables corresponding to different components of the results. For the purposes of this vignette, we will only touch on the first three variables shown from this summary()
output: PreviousSNPs
, MarginalSNPS
, and NewSNPs
. PreviousSNPs
refers to information on the input GWAS SNPs we used for the analysis, MarginalSNPs
refers to information on the the marginally significant SNPs that were used in the final steps of the analysis, and NewSNPs
refers to information on any SNPs that reach multivariate genome-wide levels of significance.
The main result most users will be immediately interested in is whether there are any new variants identified as genome-wide multivariate significant, and this can be determined by accessing the NewSNPs
sublist:
## Length Class Mode
## SNPs 22 data.frame list
## logBFs 27 -none- numeric
## Posteriors 27 -none- numeric
## ChrBP Chr BP Marker MAF A1 bmass_SimulatedData1_A2
## 9 4_7000 4 7000 rs8 0.15 G C
## bmass_SimulatedData1_Direction bmass_SimulatedData1_pValue
## 9 + 7e-08
## bmass_SimulatedData1_N bmass_SimulatedData1_ZScore
## 9 2514 5.391171
## bmass_SimulatedData2_Direction bmass_SimulatedData2_pValue
## 9 - 6e-08
## bmass_SimulatedData2_N bmass_SimulatedData2_ZScore GWASannot mvstat
## 9 2514 -5.418801 0 145.0667
## mvstat_log10pVal unistat unistat_log10pVal Nmin logBFWeightedAvg
## 9 31.50084 29.36341 7.221849 2514 29.107
As you can see in this example, we have 1 new SNP that reaches multivariate genome-wide significance. This is determined by using the smallest log BF weighted average value among the previous univariate significanct GWAS SNPs (PreviousSNPS
):
## [1] 7.41173
Any MarginalSNPs
with logBFWeightedAvg
greater than this value are designated as new multivariate associations (see eq. 1 in Turchin and Stephens bioRxiv 2019).
For further exploration and details of bmass
output, please see the second introductory vignette.


Unix Timestamp: {{.UnixTime}}
Timestamp (your timezone): {{.UserTime}}
Timezone: {{.TimeZone}}
{{.LocalTimeMsg}}
Latitude: {{.Pos.Latitude}}
Longitude: {{.Pos.Longitude}}
Country: {{.Country}}
{{.ElevationMessage}}
N/A means there is no data and location is probably in the ocean
Current astronauts aboard ISS and how long they've been there (source)
{{.Name0}}: {{.DayA}} Days, {{.HourA}} hours
{{.Name1}}: {{.DayA}} Days, {{.HourA}} hours
{{.Name2}}: {{.DayA}} Days, {{.HourA}} hours
{{.Name3}}: {{.DayB}} Days, {{.HourB}} hours
{{.Name4}}: {{.DayB}} Days, {{.HourB}} hours
{{.Name5}}: {{.DayB}} Days, {{.HourB}} hours