| DOSE: |
10 mg |
insufflated |
2C-E |
(powder / crystals) |
Being someone who avidly tries substances for many different reasons, jumped with joy after hearing a buddy of mine had acquired 2 grams of this substance from some Canadian lab or something like that. Since me and a couple of friends where the only ones who had ever heard of this substance before, he was going to give us some for free to try. Which he gave us roughly 100 mgs capsulated into 10 mg increments.
I started of by dissolving 15mgs into a bottle of water, which only gave he some nausea. The second trial was insufflating 10mgs, which gave two things
1. A feeling like I had been hit in the nose with a baseball bat
2. The notoriously awful body load.
At this point I'm really starting to question whether I had been screwed or not. The only thing that kept hope is that many people had broken through on less than me and had some really far out experiences.
So the following weekend, I had one of those real enlightening 'fuck it' type breakthroughs and did what Terrence McKenna would describe to be a heroic dose of 30 mg up the old snooter. This turns out to be nothing more that mild tripping compared to what happened a month later.
After a month of nothing I decide to trip 10mg one night in my room, planning that I would be sleeping by 2 at the latest and up for school at 7. Well I don't know what happened but I instantly knew this trip would be different.
I line up 10mg and snort it.  I immediately regret what I had done and feared death. After five minutes I was sweating like crazy and couldn't stand the nausea or body load. At ten minutes I feel the purge coming on and run to the bathroom. The walk to the bathroom is very difficult and the walls were shaking and seemed very alien to me. While I was hugging the toilet puking, I started to trip very hard. I was certain that death was just around the corner.
I spend about another ten minutes in the bathroom regainingg myself and decide that it would be a good idea to regain myself by laying down. I always feel safer covered up laying down. I could not regulate my body heat at all and figured that this was the signs of an overdose. For the next 45 minutes I fight of terrible ideas of death.
I loop Franklins Tower by the Grateful Dead to take me to some happy place. To my surprise this works very well. The song plays out in my mind and I feel sunshine on my face. I decide to stop laying down and sit up and see where this can take me.
I would like to say that even when my mind was in better shape, I still felt the body load which was still very unpleasant. But aside from that I feel immense joy and the need to communicate with other human beings. So I sign on to AIM and talk to my partner in crime. He tells me that I'm the only person that can manage to ramble over the internet. I then decide that it was time for some personal discovery and log off.
By now I'm sitting in the middle of my bed with my legs folded meditating. This is one of my fondest experiences on any sort of psychedelic. I feel the world's energy flowing through me and it makes me feel complete bliss. After awhile I stop and lay back down.
The visuals never got very exciting, just a lot of breathing and bulging walls. Some lines would wave with vibration. But I close my eyes and see a giant cockroach walking across my vision.  Except I understood that this one was important. It made me feel like there is things that were here before me and will continue on after I'm gone.
After all of that I just watch T.V. for about 2 hours until I can finally sleep. This may sound lame, but I have never got as much enjoyment from T.V. in my life. The programs seemed to be about me and almost performed right there in my own T.V. The point is it was a very nice to come down.
When it all trailed off, I finally got some sleep. The next morning (only 4 hours later) I felt very light headed, and in general out of it. Any sort of mental activity required a lot of effort. Which was wonderful considering I had to spend the day at school.
Overall I think this was a great experience, and a great substance. I do think that it was maybe a bad batch which gave me the irregularity in amounts and quality of trips. I also believe that my final encounter was definitely an overdose, in the sense that it was just way to much unexpectedly.
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.


$100 Still up-for-grabs in our TSC / Amazon Giveaway! Enter every day to increase your chances of winning! Click HERE!


Refreshed Design
I’ve updated the design of this blog, switching from Jekyll to Hakyll in the process.
I also took the chance to use a free domain from Namecheap, http://lidavidm.me, and restructure this blog to be hosted under /blog
instead of at the root of the site.
The New Design
This design is inspired by Google’s new Material Design, and in particular the Paper Elements demo. However, it’s not as elaborate as Google’s demos, nor is it animated—I’ve simply taken the superficial look.
Personally I find that Material Design has too much whitespace—Google’s designers know better than I do, but the neon colors and excessive padding in the design guidelines bothered me in general. I have also opted for the Crimson and Open Sans fonts over Google’s Roboto.
Admittedly, the animations in Material Design are gorgeous—the ink ripple effect is a nice touch, and the way the pages smoothly morph into each other makes the UI feel responsive. I have not replicated them because they’re overkill for this simple blog, but using Polymer to develop a web app with these styles is definitely something I will be trying.
I find the use of shadows, paper, and other skeuomorphic effects in Material Design interesting as well—the current trend has been towards completely flat interfaces, which started with Microsoft’s Zune and continued with Windows Phone 7, Metro, Google’s Holo, and Apple’s iOS 6. Material reverses the trend away from skeuomorphism while still retaining the “flat” design that is so popular.
My redesign here is still ongoing—I’d like to differentiate myself from Material Design further and create my own look (though this design will clearly be inspired by Material).
About Hakyll
Github Pages has Jekyll built in, making it quite convenient to use. However, depending on Github to run Jekyll on my repository was frustrating; it took a while for the site to be rebuilt, and I had to wait until then for error messages. There also isn’t a way to disable processing for certain pages—everything gets run through Jekyll, whether I like it or not. Running Jekyll locally would have solved these issues, of course. Instead of Jekyll I decided to use Hakyll, a Haskell site generator.
Hakyll specifies configuration in Haskell code; instead of running “the” Hakyll processor, your configuration is compiled into a site generator, which you then run to output the actual site.
Final Notes
I’ve been quite busy these past couple months and haven’t had a chance to really work on SymPy or write posts. I promise more is coming soon, about a TypeScript/Canvas project that I’ve been working on for a few months now.
Updates
2015-02-01: New About page.
2014-09-12: Added back Disqus commenting, updated home page, tweaked styling, merged about/contact, added RSS.
comments powered by Disqus


2019 LA Auto Show: BMW X6 M Competition looks stunning
Like most car enthusiasts, we were pretty excited about the launch of the new Land Rover Defender, primarily because it’s finally coming back to America. …
by Horatiu BoeriuThe twins were out in LA this week. First, we met the BMW X5 M and it’s now the time to welcome the all-new BMW X6 M Competition. Both M SUVs took the front stage at the M stand in Los Angeles giving us a closer look at their bold, massive and sporty design. This is the first time the BMW X6 M is offered in Competition guise. The two previous generations were only offered in one flavor and that seemed to work out fine for the car so far.
Up front, the BMW X6 M gets a more aggressive front bumper, with larger air intakes, and black accents on the Competition model. It also gets a rear roof spoiler in addition to a small decklid spoiler beneath it. There’s an interesting new rear bumper that houses quad exhaust pipes, the latter of which being a signature M Division design staple. Overall, the BMW X6 M is very similar to its X5 M sibling, just with a different roofline and an additional rear spoiler.
Inside, it’s also similar to its X5 M sibling. Its new seats feature a two-tone design with a hexagonal pattern on the inner part of the seatback. That same hexagonal pattern also makes its way to the door panels in the same two-tone color scheme. Overall, it makes the cabin of the 2020 BMW X6 M feel both sportier and more premium.
In addition to the sportier looking seats, the BMW X6 M gets a new shift lever, the same one from the BMW M8. Carbon fiber trim is of course an option, because M car, and a new M-specific sport display is featured in the digital instruments.
Under the skin, though, the 2020 BMW X6 M is basically identical to the X5 M. That means under the hood it gets the same 4.4 liter twin-turbocharged V8 with 600 hp and 553 lb-ft of torque. Though, the more potent BMW X6 M Competition gets 625 hp (617 hp for US cars) and 553 lb-ft, making it the most powerful production M car ever made (tied with the X5 M, of course).
Paired to that monster V8 is an eight-speed automatic gearbox and xDrive all-wheel drive. Much like the X3 M, it gets two all-wheel drive modes; 4WD and 4WD Sport. However, unlike the BMW M5, there’s no rear-wheel drive mode in the X6 M.
BMW claims 0-60 mph in 3.9 seconds for the standard car and 3.8 seconds for the Competition model.
Buyers will have to shell out $108,600 for the BMW X6 M and $117,600 for BMW X6 M Competition plus $995 Dest.


Dusk Priestess:
[Seal of Strife]
If we control the Seal of Strife, the rules of a castle siege will be changed as follows:
Weak Defensive Mercenaries:
The lord of each castle cannot employ general defensive mercenaries, and can only employ novice mercenaries that are weaker than general mercenaries.
Decreased Castle Gate and Wall Defenfes:
The defensive power of the castle gate and wall are decreased dramatically.
Increased Castle Gate and Wall Upgrade Costs:
The cost to upgrade the castle and wall is increased dramatically.
Cancel Defending Clan's Registration:
During a castle siege, participation of all clans except for the clan that ownes the castle is canceled.
Other benefits
Tax Rate Decrease:
The limit of the maximum tax rate that can be imposed by the lord of each castle is decreased.
Change in CP:
Combat Spirit Points (CP) of all Dusk members increases by 10%, and CP of all Dawn members decreases by 10%.
Wyvern Riding Prohibited:
During the available period of the seal, Wyvern cannot be ridden.
Disadvantages When the Seal is Stolen:
Change Restart Village:
If those who have no position die, they will revive in the 2nd nearest village, not the nearest one, when they restart.
Siege Weapons Prohibited:
During a castle siege, siege weapons are not available for use.
Fight for the Seal of Strife.
Back.


home
tags
Rashi Karanpuria
I read, write, design and code.
Android KTX
A new library by Android, that you need to try today
PWA’s are coming to iOS
it is high time you knew what they are
%


Veil is available on the following exchanges:
- TradeOgre - the most liquidity, all genuine. Cheap and fast withdrawals
- Probit - an established Korean exchange, still with sporadic Veil volume. Korean regulations make continued listing uncertain. Currently Veil withdrawals on Probit exchange cost 0.2 Veil. Deposits are available and confirm after 30 minutes. Current wallet version is to be confirmed.
Note — The exchanges currently accept deposits in Basecoin only, and the Veil wallet currently will only send to stealth addresses on the Send screen. Sending Basecoin from the wallet can be done through the Console, as described in this support article.
It is technically possible for the exchanges to allow withdrawals to Stealth (sv) addresses, and the Veil wallet in 2022 was improved to enable users to receive stealth Veil while the wallet is still locked, and to have the amounts appear automatically when unlocking. In 2019 an exchange briefly was letting people withdraw stealth amounts, but support load increased as customers needed to unlock AND go through a procedure in order to see their incoming amounts. This complication has been removed, so exchanges are welcome to try stealth transactions again.
Disclaimer — The third-party services listed above are not endorsed by the Veil team and are provided for informational purposes only. Please consider doing your own research and exercise caution when using third-party services. Some exchanges have come and gone even after many months of faithful service. In some cases user funds have been lost. In one case that we know of, the entire unsolicited listing was fraudulent and the exchange disappeared very quickly.


Christian Critic's Movie Parables - http://www.christiancritic.com
THE MESSENGER: THE STORY OF JOAN OF ARC * out of * * * * stars =========================
DIRECTED BY: Luc Besson STARRING: Milla Jovovich, John Malkovich, Faye Dunaway, Dustin Hoffman WRITTEN BY: Luc Besson, Andrew Birkin RATED: R for strong graphic battles, a rape, and some language. SCRIPTURE REFERENCES: 1 John 4:1, Ephesians 3:2-5, Proverbs 13:17
For a movie with such deep religious and spiritual undertones, it is surprising to find THE MESSENGER: THE STORY OF JOAN OF ARC such an ungodly mess.
In the early to mid 1400's, there was little in the way of spiritual light to be found shining from the heart of a man or woman. The church was a dismally dark and oppressive place. France was involved in "The Hundred Years War" against England. There was no strong political leadership in the country. Morale was low, there being little hope for the future. It was within this setting that a young French girl began hearing "voices" and seeing "visions."
Convinced that these were messages from God, she brazenly demanded to see the dauphin in order to deliver the message directly to him. The message: If he would give her an army to command, she would deliver to him the crown. He does... And she does. Then, once seated on the throne, he abandons her to her English captors.
Director Luc Besson (THE FIFTH ELEMENT) may have co-wrote the script but he never appeared to have a proper handle on the material. The inconsistencies of the cast, the confusing blur of the violent battle scenes, the inappropriate musical score, and the lack of a vibrant life force at the center of the film adds up to a largely disappointing end product which is oftentimes unintentionally laughable.
His biggest miscue was to cast his wife, Milla Jovovich (THE FIFTH ELEMENT) in the title role. Ms. Jovovich, looks spectacular as Joan, clad in battle armor, astride a similarly protected horse. If looks were enough to fully convey a character, she would have been brilliant. Since it isn't, she tried (and failed) to act the part.
John Malkovich (BEING JOHN MALKOVICH) fares a bit better as the dauphin, who Joan would see on the throne as Charles VII. An easily manipulated man, his weakness of character foreshadows the betrayal of Joan which would lead to her death.
Faye Dunaway (THE THOMAS CROWN AFFAIR) gives a strong performance in minimal screen time as the dauphin's mother-in-law and chief advisor. The army under Joan's command are comprised of comical figures, more stooges than soldiers. The one exception would be Tcheky Karyo (LA FEMME NIKITA) as Dunois, the man who was leading the attack prior to Joan's arrival. Trying to plan a systematic campaign, he sees his leadership authority negated by Joan's insistence on following her "visions."
Dustin Hoffman (SPHERE) has a small inhuman role as Joan's conscience which begins speaking to her while awaiting trial. Dressed like cloaked monk, he leads her to doubt herself and her "revelations." As well she should.
Scriptures do speak of revelation. God, via His gift of holy spirit, is able to communicate to men. Three of the nine manifestations of holy spirit listed in 1 Corinthians 12 deal with receiving revelation. They are: word of knowledge, word of wisdom, and discerning of spirits. Even the scriptures themselves are a result of God giving revelation to His "holy men... who spake as they were moved by holy spirit (i.e. by revelation.)"
But the scriptures also caution us:
"Beloved, believe not every spirit, but try the spirits whether they are of God: because many false prophets are gone out into the world." 1 John 4:1 [KJV]
Joan's end, (being burned at the stake at the age of 19), the frenzy (mob rule) and blood lust her inspiration wrought, and the death, pain, or suffering which followed her campaign all point to a devilish influence rather than a godly one.
While her conviction and intense believing remains an admirable quality, she was, as others have been before and since, misled by the spiritual master of deception. As a messenger, she was quite effective. She was just confused as to whose message she was carrying.
Michael Elliott November 1999 http://www.christiancritic.com
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


HOME
SALES
LOG IN
New Data
Update Table
Location:
Min Customer Per Hour
Max Customer Per Hour
Average Cookie
Submit
Sales Table


{{team.name | uppercase}}
Players
Loading...
-
{{player.username}}
0 && isCaptain" (click)="openKickModal(player)">
Matches
Loading...
VS
Player invitation
User not found
Are you sure you want to leave the team?
Are you sure you want to kick {{playerForKick.username}} from the team?


Desiigner Says He’s Officially Off G.O.O.D. Music
by Justin IveyDesiigner has revealed he’s an independent artist once again. During a recent Instagram livestream, the “Panda” creator noted he secured his release from Kanye West’s label G.O.O.D. Music.
“I’m on my own vibe,” he said. “I couldn’t have nobody holding me up. That’s why I had to get off that label, man.  Ain’t nobody dropped me. I asked for the release.”
He also clarified he’s not signed to anyone now and working through his own imprint called L.O.D.
“The only label I’m on right now is L.O.D.,” he said. “I can drop whenever, however, how high, how low. I can drop to the left, to the right, to the front, to the back! I can drop anywhere, any second. This is the dream of every artist!”
Desiigner signed with G.O.O.D. in 2016 but never released a studio album during his time on the label. Throughout 2019, the multi-platinum rapper voiced his frustrations with G.O.O.D. via social media.
Earlier this year, he also took aim at Kanye in an Instagram video.
 Y’all niggas think he’s the genius.  But to me that nigga’s crazy.  To me, I brought G.O.O.D. Music back.”
Listen to his full rant below.


--- layout: post esbma_id: 1166 title: Hazards of Hiring date: 2004-07-08 15:59:32 keywords: bos teaser: In the end, every hiring decision will be made with your own judgment, and there are no guarantees. However, giving consideration to these issues can help raise the probability of making a hiring decision that you will not later regret. ---
Summary: Eric offers guidelines for handling tough hiring decisions in a small ISV.
Several months ago, I wrote an MSDN column entitled Make More Mistakes. This column was one of the most popular things I have ever written. People seemed to really enjoy reading about my screw-ups. As human beings, we are fascinated by the failures of others.
In the many e-mails I received about that column, one of the most common questions was why didn't I list any hiring mistakes. "Eric, is it possible that you have simply never made a mistake in a hiring decision?"
Au contraire, I've made plenty. But those are stories I would rather not tell. It is one thing for me to air my own idiocy in public, but quite another thing for me to recount tales that might hurt someone else.
Nonetheless, hiring decisions are tricky, and I think I've learned enough to say a few worthwhile things on this topic.
I'll start with four general guidelines for how to proceed with a hiring decision.
After that, I'll finish the article by saying a few things about the specific challenges of hiring software developers.
The first step in hiring is to make sure that you actually need to be hiring. For small independent software vendors (ISVs), my rule is: Don't fill a position until after the need for that position is painfully clear.
In other contexts, it often makes sense to "staff up" in anticipation of growth. Many venture-capital-funded companies work this way. Your investors didn't give you millions of dollars because they want their cash sitting in your bank instead of their own. They expect you to grow your company aggressively, and that often means hiring more staff.
But in a small company that is funded by its own revenues, it is almost always a mistake to hire for a position before it is absolutely clear that hiring is the right thing to do.
This is an easy mistake to make. Version 7.0 of your product is going to ship in 8 weeks. You are expecting lots of new orders, so you decide to hire another customer service person to be ready for the deluge of phone calls.
Better idea: Have one of your existing staff take those calls, or take them yourself. Don't increase your payroll until you are 100% certain that you have a permanent need for one more person than you have now.
Several years ago, I decided to get very aggressive about growing SourceGear "to the next level". We made several new hires, including a human resource (HR) person. We convinced ourselves that the company was going to be growing so fast that we needed an HR person to help coordinate policies and benefits. We hired a top-notch individual for that job. Let's call her Wilma.
Wilma was a dear friend of mine and still is. She did a fine job for us here at SourceGear.
But the fact remains that our company was not really big enough to have a real need for a full-time person in HR. We knew this, but we were "staffing up for growth". And then the dotcom bubble burst, and SourceGear never did get that big.
Hiring is all about probabilities. When we evaluate a candidate, we are basically just trying to predict whether that candidate will be a success in the position being filled. We're trying to know the future, but we have no prophets and no Oracle.
So, we use various indicators that we believe will be correlated with future success. We look at past experience. We look at educational background. We call references.
But there are no certainties. Sometimes all our indicators are positive, but the employee just doesn't work out. Last year I helped a charitable organization hire a new staff member. We found a candidate with an incredibly solid résumé. Let's call him Wilbur.
We interviewed Wilbur at considerable length. We checked his references. There was no question he had the necessary experience to handle the job. The decision seemed clear, so we did the hire.
Shortly after Wilbur started on the job, things turned surreal. Was this the same guy we hired? The chemistry between him and the team was a nightmare. Wilbur is clearly a sharp guy with solid abilities, but this situation simply didn't work out at all.
On the other side of the coin, sometimes we miss out on a great employee because our indicators steered us away. Most of the time, we never know about these situations. We turn down a candidate, and we don't hear where that person ends up. Some of them go on to be a big success.
In the United States (and probably elsewhere as well), there are laws that you need to know before you even start the process of trying to hire someone. There are federal statutes and there may be state and local regulations as well. I am not an attorney, so I will not even attempt to explain these laws, but it is very important that you understand them.
The various materials from Nolo Press are usually a good starting point for beginning to understand legal matters. Nolo Press has a Web page on employment law that has lots of information. Even still, it is always advisable to consult a local attorney.
One final remark: Even if you discover that you are exempt from the laws due to the small size of your company, it is well worth your time to understand the law and begin making habits out of following them. In most situations, complying with the discrimination laws will actually improve your decision-making anyway.
The general principle here is that good decisions happen when you have several different perspectives. If you want to consistently make the worst hiring decisions you can make, just make all the decisions by yourself without listening to anybody else.
But if you want wise decisions, get a variety of opinions and different perspectives. In my own hiring decisions, I make sure at least one of those perspectives comes from a woman in my company.
The simple fact is that the software industry has a lot more men than women. Julia Lerman noticed that the Tech-Ed speakers list had more people named Brian than women. Our field is perhaps 90% male, and that means I have to work a little harder to get balance on this aspect of our hiring decisions.
I've observed a pattern over the years, and of the bad hiring decisions we've made, many of them happened when the decision was made entirely without a woman's voice.
Fortunately, my approach has worked well in ways that I could not have anticipated. In 1998, SourceGear was looking to hire a full-time person in technical support. The decision was primarily being driven by myself and one of my co-workers named Mary. We interviewed several candidates. Mary and I disagreed on which candidate should be chosen. I deferred the decision to Mary, confident that I would eventually be proven right. But the person Mary chose turned out to be one of the best employees we've ever had.
Most of the writings on the subject of hiring programmers tend to sound the same. The usual advice is to "only hire the very best".
I'll confess that I'm not terribly fond of this advice. It is simply too vague.
Please understand that I am not advising anyone to deliberately seek out mediocrity. We obviously want to hire the most talented and experienced people we can. In a hiring decision, the stakes are high. Your decision will affect your team, and it will affect the individual. As Joel says, "It is much better to reject a good candidate than to accept a bad candidate. ... If you have any doubts whatsoever, No Hire."
But the usual advice still annoys me. The problem isn't so much with the advice itself, but with its tendency to be misunderstood. When applied with no additional precision, the primary effect of the usual advice is to create a sense of arrogance. This effect is especially common among programmers, since elitism comes naturally to us anyway. When we hear that we should "only hire the very best", we internally translate this to mean:
The "very best"? Why, that's me! I am the "very best". Obviously, I should only hire people who are as gifted, as smart, and as good-looking as I am. After all, why should I pollute my perfect team with riffraff?
It is not surprising that this attitude provides a poor framework for hiring decisions. The usual advice works much better when it is understood quite differently:
I want to build the most effective team that I can build. When I hire another person for my team, my goal is not merely to make the team larger. Each person I hire should be chosen to make my team better in some specific way. I am not looking for someone as talented as me. Rather, I am looking for someone who is more talented than me, in at least one significant way.
The very worst kind of manager is the one who feels threatened by his team. Consciously or not, he is afraid of those who are "the very best", so he consistently staffs his team with people who will not challenge him.
I suppose he might be able to get away with this in a big company. After all, I doubt that the Pointy Haired Boss in the Dilbert comic strip was created with no source of inspiration at all.
But things are very different in the world of small software companies.  If you are the type of person who feels threatened by your own staff, stop and rethink. Until you move yourself past this problem, you have exactly zero chance of building an effective team.
The real point of the usual advice is not to inflate our egos--it is to remind us that we should not be afraid to search for the best people.
But we still need a more specific understanding of what the word "best" really means.
The "very best" people never stop learning.
When I evaluate a candidate, one of the most important criteria is what I call "the first derivative". Is this person learning? Is this candidate moving forward, or have they stagnated? (For more of my thoughts on this topic, see the Career Calculus article on my weblog.)
People who are seriously focused on their own future success are very likely to be successful. This is often the strongest predictive indicator in the hiring process.
I'm not saying you should just hire people who want to succeed. Everybody wants to succeed. I'm talking about hiring people who are serious about constant learning. These people don't spend their time trying to convince you of how much they know. They don't focus on their past very much. They are always focused on their future. As you interview them, they are interviewing you, trying to figure out how much they can learn from you.
How do you find this kind of person? It turns out that this posture has a precondition that is rather easily observed: People who are committed to constant learning are people who know what they don't know. They know their own weaknesses, and they're not insecure in talking about them.
One of the popular interviewing questions is to ask the candidate to describe their biggest weaknesses. Even though this question is terribly "old school", I really like it.
Unfortunately, most candidates try to duck the question. They go to their local bookstore and they buy a book on interviewing. That book warns them that I am going to ask this question. The book tells them creative ways to avoid giving a genuine answer:
When I ask candidates to tell me about their weaknesses, I am hoping for a wise, honest, and self-confident answer. When I hear a candidate rationally admit a weakness, I am impressed. When I hear a candidate duck the question with language straight out of a book, I start thinking about the next candidate.
For a small ISV, the "very best" programmers are the ones who can do more than just write code. You should hire developers, not programmers.
Although the words "developer" and "programmer" are often used interchangeably, I make a distinction between them. That distinction is the difference between simply coding and being a part of product team.
I wrote an article on this topic on my weblog, from which I quote:
For the purpose of this article, a "programmer" is someone who does nothing but code new features and [if you're lucky] fix bugs. They don't write specs. They don't write automated test cases. They don't help keep the automated build system up to date. They don't help customers work out tough problems. They don't help write documentation. They don't help with testing. They don't even read code. All they do is write new code. In a small ISV, you don't want any of these people in your company.
Instead of "programmers" (people that specialize in writing code), what you need are "developers" (people who will contribute in multiple ways to make the product successful).
What does the usual advice really mean? Exactly what attribute do I measure to determine if the candidate is "the very best"?
Most of the time, the usual advice is understood to apply only to coding skills. It really is true that the best coders are gifted with an aptitude. They understand things that generally cannot be taught. They are perhaps ten times more productive than average coders. It obviously makes good sense to try to find one of these "10X" individuals, especially in larger environments where specialists like pure coders can fit in well.
But in a small ISV, we need versatility. We often need the people on our teams to wear multiple hats, not just write code. In these cases, it is often very important to look for the best developer, and that person is not necessarily the best programmer.
People with a solid education in the fundamentals often turn out to be the "very best" developers.
The issue of education is quite controversial in the software field. Right now, somewhere on the Internet, there is a discussion board or a chat room where people are arguing about how much education is needed to be a software developer. The arguments go on, all day, all night, 365 days a year, and they never find the answer to the question.
And they never will. Hiring is about probabilities. Educational experience is an indicator that can be used in predicting success, but it is not always accurate.
Two of SourceGear's best developers have no degree. One of them is an excellent programmer who is gradually becoming an excellent developer. The other is an excellent developer who is gradually becoming an excellent programmer.
Nonetheless, I still sort résumés by educational level. These two developers are exceptions from the norm. The bulk of my experience has taught me that a college degree is a useful predictor of future success. When I hire developers, I want to see a bachelor's degree from a highly regarded computer science department. Yes, yes, I have two obvious counterexamples right here among my co-workers. But hiring is about probabilities. When I see a BS from someplace like University of Illinois or Stanford, I believe the probability of ending up with a successful employee in the future is higher.
On the other hand, when I see a Ph.D. in computer science, I believe the probability goes down.
Universities don't teach people to be developers anyway. They don't even teach people to be programmers. Universities teach their students to be computer scientists. Becoming a programmer or even a developer is usually left as an exercise for the student to complete on her own time.
A bachelor's degree gives you a solid grounding in fundamentals and it proves that you can finish. Those issues are important, but when it comes to the specific set of skills we need in a small ISV, you are approaching the point of diminishing returns on your first day of graduate school.
People tend to get terribly offended by these opinions. Please understand that I do have a lot of respect for people who have finished a Ph.D. It takes a tremendous amount of discipline, intelligence, and desire to finish a doctoral degree. I admire those "Ph.D. Qualities". I seriously doubt whether I could finish a Ph.D. myself.
But I still believe that those "Ph.D. Qualities" are not the same skills that are needed in a small ISV. Shipping a shrinkwrapped product requires a different kind of discipline, intelligence, and desire. These "Shrinkwrap Qualities" are similar to "Ph.D. Qualities", and yet are very different.
Furthermore, I believe that very rare is the person who has both Ph.D. Qualities and Shrinkwrap Qualities. Some people have the talents to finish a Ph.D. Some have the talents to finish products. Some people have both, but not very many people. When I see someone who has finished a Ph.D., I know for certain that they have Ph.D. Qualities. I will therefore consider it unlikely that they have Shrinkwrap Qualities as well.
Obviously, I may be wrong, but hiring is all about probabilities. We use guidelines to predict the future success of a candidate, but those guidelines are not always correct.  That's unfortunate, because a Ph.D. with Shrinkwrap Qualities would be an incredible person. Suppose, for example, that I received a résumé from somebody with a Ph.D. in computer science and with several years of experience as a developer on the Adobe Photoshop team. Obviously, I would want to interview this person. I don't think there is a shrinkwrap product I admire more than Photoshop. Ph.D. or not, this person clearly has Shrinkwrap Qualities. The Ph.D. is not inherently negative. It is merely a predictive indicator, and sometimes it's wrong.
Although I do place a high value on the non-coding aspects of software development, the code is important, too. The "very best" developers still ought to be darn good programmers.
Don't be afraid to look at the code. When you interview developers, ask for code samples. Ask them to write some code during the interview.
One of my favorite questions is to ask candidates how many lines of code they have written in their entire career. The answers vary widely. Some people don't even know.  Fine, I'll stipulate to all that, but I still like the question. I believe that people tend to become better programmers as they write more and more code. I want to know how much code you've got behind you.
 It was written in C, entirely from scratch, with a handwritten recursive descent parser. I even did some peephole optimizations on the back-end. It wasn't very fast, but it could compile itself with no errors. I released it under the GPL, but I was only the person who ever used it.
When I applied for a developer job at Spyglass, I showed my compiler
to the hiring manager. I got the job, and my compiler project was one
of the factors in his decision. He said he looked at my code and
realized that I had already gotten a lot of the bad code out of my
system, so my next hundred thousand lines of code ought to be pretty
good. :-)
Twelve years later, I think there is some wisdom in hiring people who have made significant contributions to an open source community project. After all, I don't have to ask for code samples, I can just grab a tarball and read it myself.
But the availability of code for review is one just minor reason why I like to see open source experience on a résumé. Working on this kind of project also says something about the person.
Granted, a lot of these coders are driven purely out of hatred for Microsoft. Regardless of your opinions about Microsoft, that kind of motivation is not likely to be a good foundation for success in any developer job.
But a lot of people work on an open source project simply because they have a passion for coding. It's their hobby, and as hobbies go, it's not a bad one. Some folks look at projects like AbiWord or ReactOS and all they see are people who are wasting their time by cloning mature Microsoft products. I'll concede that these projects don't make much sense if you're trying to find a business case for them. But the typical contributor to these projects is coding for fun. Watching TV is a waste of time. Coding is not.
People who genuinely love to write code often turn out to be the "very best" developers.
It turns out that the usual advice works just fine, but we have to move from the vague to the specific. To summarize the various points I made in the sections above, here are ten questions to ask yourself when considering a candidate for a developer position:
It's not necessary to answer "yes" to all ten of these questions. I'm not even going to specify a minimum number of "yes" answers needed for a positive hiring decision. Hiring is all about probabilities, and each of these questions can serve as an indicator to help you predict whether the candidate will be a success for you.
In the end, every hiring decision will be made with your own judgment, and there are no guarantees. However, giving consideration to these issues can help raise the probability of making a hiring decision that you will not later regret.
Eric Sink is the non-legendary founder of SourceGear, a developer tools ISV located in Illinois. Recently, Eric was delighted to hear that his Make More Mistakes column was used by someone on the Microsoft.com Web team as an example of a really bad title. The title for this month's piece was chosen specifically in the hope that he might earn this dubious distinction once again. :-) If you appreciate this kind of warped sense of humor, check out Eric's weblog at https://ericsink.com/.
This article originally appeared on the MSDN website.


Pep Guardiola admits Ederson is injury doubt for Man City's clash at Liverpool
The injury to first-choice keeper Ederson is a huge blow, with the City boss admitting he and his medical staff will not take a risk with the fitness of his No.1
by David McDonnell, https://www.mirror.co.uk/authors/david-mcdonnell/Pep Guardiola admitted Ederson is a major doubt for Sunday's title showdown at Liverpool – after a night of drama and chaos for Manchester City.
Claudio Bravo, who came on for injured goalkeeper Ederson for the second-half, was sent off with nine minutes left, after being shown a straight red for a professional foul.
City ended the game with 10 men and defender Kyle Walker in goal, with the draw meaning Guardiola's side were forced to wait to confirm their place in the Champions League last-16.
But the injury to first-choice keeper Ederson is Guardiola's biggest headache, with the City boss admitting he and his medical staff will not take a risk with his No.1.
Asked if Ederson would be fit to play at Anfield, Guardiola said: “Honestly, right now, I don't know. It was a muscular problem.
“He felt uncomfortable in the last few minutes of the first-half. We will see how he is tomorrow.
"It was muscular, in front here [thigh]. We want to try with him, but we're not going to take a risk.
“Xabi Mancisidor, our goalkeeper coach, suggested Kyle go in goal for his courage, because he's quick.
“We're lucky we only conceded one shot on target when he was in goal, but congratulations for the courage and desire to help the team in this position.”
Guardiola admitted Bravo deserved his red card, but said he would have no qualms playing him at Anfield in Ederson is not fit.
"It's a red card,” said Guardiola. “It was given so it’s a red card. But Claudio is ready. He's an incredible, experienced professional. He's ready.
“If Ederson is ready, he's going to play. If not, we'll play Claudio, We trust him. Why should I doubt any players I have in my squad?"
Walker, whose first act was to save a free-kick - at the second attempt - was asked if he volunteered to go in goal. “I think it was a bit of both,” said the defender.
“Sometimes I criticise our goalkeepers for not catching the ball in training but, as I found tonight, sometimes you have to take two touches.
“We came here looking for a point or a victory, but they’re a very good side.”


That it turns out, I've known how to be mindful for a while now. Not necessarily in a consistent, practiced or even deliberate way, but there are themes and concepts that keep coming up that sound like the way I just decide to handle things in my day-to-day life. I do appreciate that there's a lot of emphasis on letting emotions do their thing. Realising that they are an immutable part of the human experience and that, although you can never stop feeling, you can always decide how you'll deal with your experiences.
The event that came to mind is something that I've known will be lingering for a while. I did a mindful check of the situation the moment it happened. Maybe It'll lurk around the outskirts of my thoughts for a while longer, maybe forever, but either way It's good to think that all I have to do is let it come and go while I keep living and growing. There's no looking back, only my strong, steady march forward.


Spoiling about #
Title:
Author(s):
Publisher:
Publishing Date:
Page:
Contents:
User Name:
Password:
Spoile


{{ data.description }}
Notifications can be used to inform the user of occurring events or to alert the user of something that may require their attention.
The ux-notification-list
component can be used to display a list of notifications.
The following attributes can be used to customize the ux-notification-list
component:
top-right
, top-left
, bottom-left
and bottom-right
.
above
- newer notifications will appear above older ones.below
- newer notifications will appear below older ones.Notifications are controlled by the notificationService
. It is recommended that the service is injected into the AppComponent
.
The following functions can be called on the service:
This function should be called to show a notification.
It should be given a TemplateRef
containing the content to be displayed. Optionally it can be passed a second argument,
a NotificationOptions
object containing properties to configure the notification.
An optional third argument can be given. This is an object containing any additional information you want to provide
to the template. This can be accessed by adding a let-data="data"
attribute to the ng-template
element.
It will return a NotificationRef
object which will contain the information passed to the showNotification
function
along with a date
property which will contain the time at which the notification was shown.
notificationRef
to dismiss.
The content of the notification should be specified inside an ng-template
element. The ng-template
property
let-notificationRef
can be used to access the NotificationRef
object returned from the service.
A second object may optionally be passed to the showNotification
function. The following options can be passed in this object to configure the notification:
0
will show the notification until manually dismissed.
To improve accessbility the LiveAnnouncer
can be used to provide audio feedback to screen readers by announcing the content of the notification.
Additionally, the escape key can be used to dismiss all notifications by using @HostListener('document:keydown.escape')
.
The following code can be used to create the example above:
Note: The
BrowserAnimationsModule
must be imported from'@angular/platform-browser/animations'
.


Home
Products
About
Contact
Wonjons Kimchi
Jar of Homemade Kimchi
4 Reviews
A jar of homemade, freshly produced kimchi made with love!
Ammount
1 Jar
2 Jars
3 Jars
4 Jars
$10 for 1
$20 for 2
$30 for 3
$40 for 4
Button


GETTYSBURG A film review by James Berardinelli Copyright 1993 James Berardinelli
GETTYSBURG
Rating (Linear 0 to 10): 9.1
Date Released: 10/8/93 Running Length: 4:14 (not including intermission) Rated: PG (Violence)
Starring: Martin Sheen, Tom Berenger, Jeff Daniels, Richard Jordan, Stephen Lang, Sam Elliot Director: Ronald F. Maxwell Producers: Robert Katz and Moctesuma Esparza Screenplay: Ronald F. Maxwell based on the book THE KILLER ANGELS by Michael Shaara Music: Randy Edelman Released by Turner Pictures through New Line Cinema
GETTYSBURG, Ronald F. Maxwell's re-telling of four hot days during the summer of 1863 (based on the Pulitzer Prize winning novel THE KILLER ANGELS by Michael Shaara), is a grand movie that gathers power and momentum with every moment. In fact, after having viewed this spectacle in a theater, I have difficulty envisioning how its impact could be close to the same on the small screen. This is perhaps surprising considering that GETTYSBURG was originally intended to be a TNT mini-series, and only after its completion, when Ted Turner realized the quality of the material he had on his hands, was the decision made to go for a theatrical run first. Those who are not daunted by the running time (two-hundred thirty-four minutes, easily the longest general release motion picture in a long while) will be grateful for the decision.
The film is divided into two parts, with an intermission in between (the length of the intermission varies from ten minutes to twenty-five minutes, depending on theater management). The first section, which begins on June 30, 1863 (the day before the start of the battle of Gettysburgh) and ends during the day of July 2 with Col. Joshua Chamberlain's legendary defense of Little Round Top, is approximately two hours and twenty minutes long. The second part, which takes up the remaining 1:55, concentrates primarily on July 3 and the disastrous charge of Maj. Gen. George Pickett and 15,000 members of the Confederate Army against the entrenched Union position atop Cemetery Ridge.
Over 50,000 were killed or wounded during this pivotal battle of the Civil War, and GETTYSBURG takes pains to breathe life and logic into the reasons for this. Yet it does far more than that. Rather than functioning as a text book come to life, the film uses its actors to flesh out characters from history, giving not only personalities to those on both sides of the struggle, but believable causes as well. We are presented with the rare opportunity to see not only the clash of arms on the field of battle, but the clash of wills before it.
In what it manages to do, GETTYSBURG is an exceptional motion picture, but this is true even moreso for the manner in which it manages to do it. Four and a half hours (including the intermission) is a long time to sit in a movie theater, yet even towards the end, restlessness is unlikely. The film is adept at the tricky art of pacing, and just as the slower, dramatic elements of the story threaten to bog down GETTYSBURG, the rousing battle scenes start anew.
The film opens with exposition and introduction. Coming at the beginning as it does, this sequence isn't difficult to get through. Next is the initial confrontation between the troops of Gen. Buford (Sam Elliot) and the advancing edge of the Confederate army. Then, with the onset of night, there's a lull, and an opportunity for more character development and introspection. With the morning of July 2, there's the defense of Little Roundtop under the command of Col. Chamberlain (Jeff Daniels), a truly amazing sequence that lasts nearly an hour and keeps the audience involved and enthralled for the entire time. When the intermission occurs, it hardly seems possible that the film is more than half over.
Of course, following Little Round Top, there's discussion and planning as Gen. Lee (Martin Sheen) prepares his decisive assault. The disagreements of Lt. Gen Longstreet (Tom Berenger) are presented and ignored, and Pickett (Stephen Lang) is chosen to lead the charge. While this section of the film may be a little too talky, it is positioned immediately after the intermission when the audience is better able to tolerate a slower forty minutes. The climax - Pickett's charge - is even more engrossing than the defense of Little Round Top, if that's possible. Those who get a few nape hairs standing on end will not be alone.
Historical accuracy was of great concern to the producers and director. They hired a veritable army of advisors to correct even the most minute mistakes in the script (if a general given a pale horse in the movie was known to have favored a dark horse, the steed was changed), used the actual sites in Pennsylvania as often as possible (where hiding war monuments became an art), and "recruited" more than 5000 unpaid re- enactors to fill up the screen during the battle scenes (thus helping to keep the budget at a reasonable $20 million). The result is a movie that looks - and feels - real.
Admittedly, the battles are not as stunning or well-choreographed as those in GLORY, but this doesn't damage the effectiveness of the film, since GETTYSBURG's clashes are still impressive GLORY's R-rating and narrower focus allowed it to have spectacular battle sequences (the same is true of the 1700s drama THE LAST OF THE MOHICANS). GETTYSBURG, a far more ambitious project, had two major handicaps: limiting the brutality of its depiction for the PG-rating, and getting far more extras into position (the logistics of this picture must have been a nightmare). Additionally, the camerawork in Edward Zwick's magnificent drama had a more grand scope than Kees Van Oostrum's work here (although, to Van Oostrum's credit, there are a number of breathtaking shots - most of which occur after the battles, however).
The cast gathered for this recreation is impressive. There are no high- orbit names like Tom Cruise or Alec Baldwin to distract the viewer. While Berenger and Sheen are certainly known and recognized, their profiles, like their performances, are low-key. Both do solid jobs, and are especially effective at bringing out the more human sides of the officers. Sheen's Lee is a brilliant leader who carries a weight of weariness and guilt that only the end of the war can lift, and Berenger's Longstreet has tears in his eyes when he orders Pickett's charge, which he knows beforehand will be a failure.
More impressive than Berenger and Sheen are Jeff Daniels and the late Richard Jordan. Daniels gives a remarkable rendering of Col. Chamberlain, investing the legend with all the foibles and failures of humanity, and making us understand exactly why his name has been so lauded. Jordan, who plays Brig. Gen. Lewis Armstead, is the standout on the Confederate side, and his powerful portrayal is given an added dash of poignancy by the realization that the actor is no longer with us.
In epic movies, especially those that feature battles, the musical score takes on added significance. While not a masterpiece of originality or modern composition, Randy Edelman's work is loud, triumphant, and inspirational - qualities which are perfect for the battle scenes. Not as effective are his themes for the quieter, more dramatic moments.
Could GETTYSBURG have been shorter? There are probably a few sequences that might have been trimmed without doing much damage, but the finished product would still have been around four hours. Further cutting would have reduced either the spectacle of the battles or the insight into certain characters, neither of which would have been desirable. All things considered, this film is close to the perfect length.
Epic motion pictures are a rarity these days - even more rare than films about the Civil War. GETTYSBURG should satisfy both cravings, at least for a while. This film is perfectly placed in the wake of Ken Burns' PBS series (Burns, incidentally, has a small role here as the aide to Union Gen. Hancock) for any who have a re-kindled interest in this segment of American history. For those with little more than a passing interest, GETTYSBURG is still gripping enough to captivate in its own right. Ambitious and successful, it is easily one of the most glorious U. S. productions of the year.
.
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


Evopayments Java SDK
Server-to-Server mode samples:
Get Available Payment Solutions
Tokenize
Purchase (after Tokenize)
Auth (after Tokenize)
Capture (after Auth)
Void (after Auth)
Refund (after Capture)
Status Check
Browser-to-Server mode samples (Virtual Terminal Integration):
Redirect sample (servlet redirect)
Redirect sample 2 (jQuery token acquiration)
JavaScript embedded sample (jQuery token acquiration)


Omega Developrs
Hello, there.
Let's compute
Grade Points Average.
Enter the number of subjects
Create Space
Mathematics III
Circuit Theory
EMFT
Digital Electronics
Electronic Circuits I
EVS
EDC Laboratory
DE Laboratory
M4(PRP)
Signals and Systems
TLW
MPMC
Electronic Circuits II
Professional Ethics
ECS Laboratory
MPMC Laboratory
DSP
LIC
Communication Theory
Control Systems
TQM
Elective - A
DSP Laboratory
LIC Laboratory
Technical Seminar - I
Digital Comm. Techniques
Antennas & Wave Propag.
VLSI Design
Computer Networks
Elective - A
Open Elective
ADC Laboratory
NP Laboratory
Technical Seminar II
Microwave Electronics
Optical Comm. Networks
Cyber Physical Systems
Elective- A
Elective - B
Open Elective
RF and ME Laboratory
CPS Laboratory
Mini Project
Elective - A
Elective - B
Elective - B
Project Work
O
A+
A
B+
B
RA
Compute GPA
Reset
Your
Grade Point Average
is


Confirmed SAR of pandemic (H1N1) 2009 virus infection, according to time antiviral drug prophylaxis began after onset of illness in primary case-patient, plus timing of secondary cases after onset of primary case, United Kingdom, 2009*
Timing
No. contacts
No. secondary case-patients at 14 d
SAR, % (95% CI)
No. (%) secondary case-patients
2 d
3–4 d
5–7 d
>7 d
No prophylaxis
143
45
31.5 (24.0–39.8)
15
12
10
8
Day 0
57
1
1.8 (0.0–9.4)
0
0
1
0
Days 1–2 (
<48 h)
81
4
4.9 (1.4–12.2)
0
3
1
0
Day 3–7 (inclusive)
214
3
1.4 (0.3–4.0)
NA
0
3
0
>7 d
92
0
0.0 (0.0-3.9)
NA
NA
NA
0
Total case-patients
587
53
9.0 (6.8–11.7)
15 (2.6)
15 (2.6)
15 (2.6)
8 (1.4)
*SAR, secondary attack rate; CI, confidence interval; NA, not applicable.


--- layout: page title: My Public GPG Key tab: about ---
Encrypted mail preferred. I sign most of my private emails with the GNU Privacy Guard, an open source implementation of OpenPGP. If you want to contact me by email, you can download my public key here or from the PGP keyservers. To retrieve my public key from a PGP keyserver and import it into your public key ring, open a shell and type the following command:
{% highlight console %} $ gpg --keyserver wwwkeys.pgp.net --recv-key FD5E0F0F {% endhighlight %}For additional information, you should consult the manual shipped with your GnuPG distribution and visit the The GNU Privacy Guard Documentation, where you can find the GNU Privacy Guard Handbook, which should be the first book to read, in order to get started with GnuPG.


A computer program which produces its own source code is called a quine, named after the logician Willard Van Orman Quine.
Exercise: Write a quine in your favorite programming language.
If you haven’t solved this exercise before, I urge you to stop right now and give it a try.
To give you an idea of why this is an interesting problem, let us try to solve it in a naive way. Instead of using an actual programming language I will use pseudocode to keep things simple.
The obvious candidate of a quine is
Print your own source code
This looks like cheating but actually there are languages which allow this. For instance
10 List
is a valid GWBasic program which, when run, prints 10 List
on the screen. Actually, in GWBasic, any code which starts with 10 List
is a quine.
So, to make things less trivial and more generic, let us restrict ourselves to text manipulations. In this case, the first candidate is
Print "Print"
The output of this code is simply Print
. So it doesn’t work. Seeing this, you may try
Print "Print "Print""
This time the output is Print "Print"
. Failed again. Actually, any code of the form Print "<any kind of fixed text>"
will fail as the source code is strictly longer than the text it prints. Now here is an idea to circumvent this: We can use the the given text, or its parts, more than once! So let us try a program like this:
Let A be the following text:
"<there is going to be a text here>"
<there are going to be commands here explaining what to do with A>
As we will construct the source code using the parts of the text A, the first line of the code should be a part of A.  Thus we should have a program like this:
Let A be the following text:
"Let A be the following text:
<there are going to be more lines here>"
Print the first line of A
<there are going to be more commands here>
Obviously the command Print the first line of A
should appear somewhere in A. So let’s add it to A to obtain
Let A be the following text:
"Let A be the following text:
Print the first line of A
<there are going to be more lines here>"
Print the first line of A
<there are going to be more commands here>
Now the second printing command should print what comes after the first line. But this is simply the text A in quotation. Therefore we should have
Let A be the following text:
"Let A be the following text:
Print the first line of A
<there are going to be more lines here>"
Print the first line of A
Print A in quotation
<there are going to be more commands here>
Again these commands should appear in A. So we have
Let A be the following text:
"Let A be the following text:
Print the first line of A
Print A in quotation
<there are going to be more lines here>"
Print the first line of A
Print A in quotation
<there are going to be more commands here>
Note that, up until now, all the steps we took were pretty much forced. The final step will be a little different and require a tid bit of creativity. Here is our finished quine:
Let A be the following text:
"Let A be the following text:
Print the first line of A
Print A in quotation
Print A except for its first line"
Print the first line of A
Print A in quotation
Print A except for its first line
As an exercise, you may translate this quine into a real programming language. Even though the quine above has the essential idea, you may still need to deal with a few language specific details such as escaping quotation marks. Here is one for you in Haskell meant to be evaluated in repl.
let x = ["let x = ", " in putStr (x !! 0) >> putStr (show x) >> putStr (x !! 1)"] in putStr (x !! 0) >> putStr (show x) >> putStr (x !! 1)
Now this was fun, bu also ad-hoc. The natural question to ask here whether there is a principled way of writing, not only quines, but programs which have some kind of access to their own source code. The answer is yes and this follows from one of the most fundamental results in recursion theory, the recursion theorem.
I want to work with a Turing complete programming language. Luckily, what we need is essentially what I described in the first section of Kolmogorov Complexity (1/2). The differences are that we do not need \(\mathcal{L}\) to contain UTF-8 characters and we do not need an assumption on the way we represent natural numbers.
Let \(\mathcal{M}\) be the set of all strings from \(\mathcal{L}\) and let \(\mathcal{C}(n)\) be the set of all source codes expecting \(n\) inputs, where \(n\) is a natural number. Then, for each \(c\in\mathcal{C}(n)\), we have a partial function \(f_c\) from \(\mathcal{M}^n\) to \(\mathcal{M}\), which is simply the partial function computed by the source code \(c\). These functions are called the computable partial functions.
Let us start with a simple but useful lemma.
Lemma: There is a computable function \(s\) such that for any \(x\in\mathcal{M}\) and \(c\in\mathcal{C}(2)\) we have \(s(c,x)\in\mathcal{C}(1)\) and \[ f_c(x,y) = f_{s(c,x)}(y). \]
Proof: Let \(x\in\mathcal{M}\) and \(c\in\mathcal{C}(2)\) be given. As \(c\in\mathcal{C}(2)\), \(c\) should look like this:
Ask for a value from the user and store it as A
Ask for a value from the user and store it as B
<Some commands>
All \(s\) will need to do is to convert this code into the following one:
Let A be x
Ask for a value from the user and store it as B
<Some commands>
In other words, it should hard-code the value \(x\). It is not difficult to imagine an algorithm doing this. Thus, by appealing to the Church-Turing hypothesis, we are done. \(\square\)
Now we can prove the recursion theorem.
Theorem (Kleene): Let \(f(x,y)\) be a partial two-variable computable function. Then there is a \(c\in\mathcal{C}(1)\) such that \[ f(c,y) = f_c(y) \] holds for all \(y\).
Proof: Let \(a\in\mathcal{C}(2)\) be such that \(f = f_a\). Such an \(a\) exists because this is what computable means. Now, by the lemma, we already have something close, namely \[ f(x,y) = f_a(x,y) = f_{s(a,x)}(y). \] So, if we could find a solution for \(x = s(a,x)\), then we would be done. However, in this equation, we have some control over \(x\) but the other parameter \(a\) is very heavily constrained since \(f = f_a\).
Now comes the brilliant idea: instead of working with \(x\) let us work with a computable function of \(x\). Consider \(f(g(x),y)\) for a not yet determined computable function. As both \(f\) and \(g\) are computable, so is this new function. Therefore there is a \(b\in\mathcal{C}(2)\) such that \(f_b(x,y) = f(g(x),y)\). Now we have \[ f(g(x),y) = f_b(x,y) = f_{s(b,x)}(y) \] so the equation we need to solve in this case is \[ g(x) = s(b, x) \] instead of \(x = s(a,x)\). Introducing \(g\) into the problem gave us some room because now we can choose both \(x\) and \(g\). Squinting at the equation for a few seconds, we see that there is a trivial solution, namely \(g(x) = s(x,x)\) and \(x = b\)! We were lucky! (Just kidding, I planned all of this.)
Let us summarize this “stream of consciousness” into a more traditional proof. Let \(b\in\mathcal{C}(2)\) be such that \(f_b(x,y) = f(s(x,x),y)\) and let \(c = s(b,b)\). Then \[\begin{align} f(c,y) & = f (s (b,b), y) \newline & = f_b (b, y) \newline & = f_{s(b,b)}(y) \newline & = f_c(y) \end{align}\]This finishes the proof. \(\square\)
Let us look at example to appreciate the power of this theorem.
Example: There is a \(c\in\mathcal{C}(1)\) such \(f_c(y) = c\) for all \(y\). Note that \(c\) is just a quine. Let \(f(x,y) = x\). Obviously \(f\) is computable. Thus, by the recursion theorem, there is a \(c\) such that \[ f_c(y) = f(c, y) = c \] for all \(y\).
Here is another one.
Example: There is a \(c\in\mathcal{C}(1)\) such \[ f_c(y) = \begin{cases} \text{reversed } c, \text{ if $c$ is longer than $y$} \newline \text{collected works of Shakespeare}, \text{ otherwise} \end{cases} \] Let \[ f(x,y) = \begin{cases} \text{reversed } x, \text{ if $x$ is longer than $y$} \newline \text{collected works of Shakespeare}, \text{ otherwise} \end{cases} \] and apply the recursion theorem.
The pattern here is clear: If you want to find a code in \(\mathcal{C}(1)\) which accesses its own source code, just write a code in \(\mathcal{C}(2)\) which asks for its own source code as input from the user. The recursion theorem takes care of the rest. From now on, I will freely use a subroutine access your own code
and assume that you can implement it using the recursion theorem.
Now we know how to fake an access-your-own-code subroutine. You might think that we can write amazing programs by using it but from a practical point of view such a subroutine is pretty useless. So what can we do with it? Well, mathematical logic of course! (See the last paragraph of Kolmogorov Complexity (1/2))
As a warmup exercise, let us prove the unsolvability of the halting problem using the recursion theorem. Of course there is a much simpler proof via diagonalization but, as I said, this is a warmup exercise. Suppose that the halting problem is solvable. This means that the function defined by \[ f(c, x) = \begin{cases} \text{yes, }\, \text{if $c$ is in $\mathcal{C}(1)$ and $f_c(x)$ is defined} \newline \text{no, }\, \text{otherwise} \end{cases} \] is computable. Now consider the following algorithm:
Ask for a value from the user and store it as X
Access your own code and call it S
if f(S, X) = no
print "I am not supposed to halt!"
Halt
if f(S, X) = yes
print "I am supposed to halt!"
loop forever
This program looks at its code, and sees —using the function \(f\)— whether it will halt, and then does exactly the opposite. So it halts if and only if it does not halt! Contradiction.
Before proving another impossibility result, let we will prove a fixed point version the recursion theorem, sometimes called the second recursion theorem.
Theorem: Let \(g\) be a total computable function with a single variable such that \(g(c)\in\mathcal{C}(1)\) for all \(c\in\mathcal{C}(1)\). Then there is a \(S\in\mathcal{C}(1)\) such that \(f_S = f_{g(S)}\).
Such an \(S\) is called a fixed point of \(g\).
Proof: Consider the following code:
Ask for a value from the user and store it as X
Access your own code and call it S
Simulate g(S) running on input X
Let us call this code S
, just like the program itself does. Now for any given X
, if we run S
on input X
, we get what g(S)
does on input X
. But this simply means that on any X
, the codes S
and g(S)
have the same behavior. So we are done. \(\square\)
Now we can prove a classical result due to Henry Gordon Rice.
Theorem: Let \(\mathcal{A}\) be a decidable subset of \(\mathcal{C}(1)\) such that \(\mathcal{A}\not= \emptyset, \mathcal{C}(1)\). Then there are \(a,b\in\mathcal{C}(1)\) such that \(a\in \mathcal{A}\), \(b\in \mathcal{C}(1)\setminus\mathcal{A}\) and \(f_a = f_b\).
Proof: Fix \(a'\in \mathcal{A}\), \(b'\in \mathcal{C}(1)\setminus\mathcal{A}\). Define \[ g(c) = \begin{cases} a'\text{ if } c\in\mathcal{A} \newline b'\text{ if } c\not\in\mathcal{A} \end{cases} \] As \(\mathcal{A}\) is decidable, \(g\) is computable. Let \(c\) be a fixed point of \(g\). Then \(f_c = f_{g(c)}\). Moreover, by construction, \(c\) and \(g(c)\) cannot be both in \(\mathcal{A}\). This finishes the proof. \(\square\)
This is a remarkable theorem, because it says that there is no decidable semantic property! For instance the following sets are all undecidable: \[ \begin{align} & \{c\in\mathcal{C}(1) | \text{domain of $f_c$ has 73 elements} \}, \newline & \{c\in\mathcal{C}(1) | \text{$f_c$ is total} \}, \newline & \{c\in\mathcal{C}(1) | \text{$f_c$ turns an even-length string to an odd-length string} \}, \newline & \{c\in\mathcal{C}(1) | \text{$f_c$ is constant} \}, \newline & \{c\in\mathcal{C}(1) | \text{$f_c(x)$ has the characters a and 7 for all $x$} \}, \newline & \{c\in\mathcal{C}(1) | \text{$f_c(x)$ is longer than $x$ for all $x$} \}, \newline & \ldots \end{align} \]
For our final example, we need a definition. Call an element \(c\in\mathcal{C}(1)\) minimal if for any shorter \(c'\in\mathcal{C}(1)\) we have \(f_c \not= f_{c'}\). It is not difficult to prove that minimality is not a decidable property. I will leave the details to you.
Hint: Again, suppose that minimality is decidable and consider the following code:
Ask for a value from the user and store it as X
Access your own code and call it S
Construct a minimal M longer than S and call it W
Simulate W running on input X


Arizona lawmaker proposes tobacco, vaping legislation
PHOENIX (AP) - An Arizona Republican senator says she’ll try again to convince the Legislature to increase regulations on smoking and vaping.
Sen. Heather Carter said Tuesday she’ll introduce a bill to classify vaping products as tobacco, which would restrict their use indoors. She says her bill also would increase the age to buy tobacco and vaping products to 21 from 18 and require retailers that sell them to be licensed.
Carter says her legislation won’t include tax increases. She says her bill would help resolve what she calls an epidemic of vaping among teens.
Owners of vaping businesses say their products help people quit smoking.
Lawmakers last year debated competing tobacco bills, one by Carter and public health advocates and the other supported by the industry. Neither was approved.
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


Berkeley/Stanford Children’s Environmental Health Center
EPA Grant Number: R834596Center: UC Berkeley/Stanford Children’s Environment Health Center
Center Director: Tager, Ira
Title: Berkeley/Stanford Children’s Environmental Health Center
Investigators: Hammond, S. Katharine , Balmes, John R. , Gould, Jeffery , Hubbard, Alan , Lurmann, Fred , Mann, Jennifer , Mortimer, Kathleen , Nadeau, Kari , Shaw, Gary M. , Tager, Ira
Current Investigators: Hammond, S. Katharine , Balmes, John R. , Eisen, Ellen , Gale, Sara L , Mann, Jennifer , Nadeau, Kari , Padula, Amy , Shaw, Gary M. , Tager, Ira
Institution: University of California - Berkeley , Sonoma Technology, Inc. , Stanford University
Current Institution: University of California - Berkeley , Stanford University
EPA Project Officer: Callan, Richard
Project Period: May 7, 2010 through May 6, 2013 (Extended to May 6, 2014)
Project Amount: $1,091,783
RFA: Children's Environmental Health and Disease Prevention Research Centers: Formative Centers (with NIEHS) (2009) RFA Text | Recipients Lists
Research Category: Children's Health , Health
Objective:
The overall goal of the Berkeley/Stanford Children’s Environment Health (Pre)Center (CHP-C) is to study the effects of in utero and childhood exposure to ambient air pollutants and bioaerosols on birth outcomes (including low birth weight, small for gestational age, structural birth defects), T-cell regulatory function and the relation of these early life exposures on the occurrence of asthma in the lower half Central Valley of California (San Joaquin Valley— SJV; Stockton, CA to Bakersfield). The SJV is the fastest-growing area of California (16.1% growth in 2000-2007 compared to 7.9% for entire state) with an ethnically diverse population, industrial farming and growing cities.
Approach:
The Center will test the following hypotheses through 3 projects:
Project 1:
Hypothesis-- The associations between adverse pregnancy outcomes (low birth weight [LBW], pre-term and small for gestation age) and exposure to ambient air pollutants and bacterial endotoxin are increased in women who reside in impoverished neighborhoods and are socially disadvantaged at the individual level.
Project 2:
Hypothesis:— Exposure to specific air pollutants and mixtures of air pollutants during critical periods of fetal organ development are associated with structural birth defects (so-called “congenital” anomalies or birth defects).
Project 3:
Hypothesis-- The reported associations between ambient air pollution and bacterial endotoxin, asthma onset and asthma exacerbation are mediated through pollutant/endotoxin alterations of regulatory T-cells (Treg), cells that can help control the response of the immune system. Furthermore these effects on Treg are related to exposure in the year prior to specimen collection and exposure during the late 1st and early 2nd trimesters when T-cell differentiation and function begin to develop. T cells are developed by 8.2 weeks and T cell receptor differentiation occurs first in the 10th week. Further development and maturation occur in the second and third trimester and throughout life).
A combination of laboratory and field studies measured with basic immunology and highly refined estimated individual-level exposure will be employed. Data analyses will focus on causal statistical methods (CSM5).
Expected Results:
Our goal is to provide a unifying mechanism that links reported air pollutant associations with asthma and adverse birth outcomes based on an understanding of pollutant effects on Treg function. The combination of refined exposures, study of basic immunology and application of advanced CSMs will provide unique research insights into developmental impacts of environmental exposures on children and, through use of causal statistical methods, will provide more accurate and complete estimates of exposure-response functions need for asthma risk characterization from air pollutants.
Journal Articles: 15 Displayed | Download in RIS Format
| Other center views: | All 50 publications | 15 publications in selected types | All 15 journal articles |
|---|
| Type | Citation | ||
|---|---|---|---|
|
|
Balmes JR. How does diesel exhaust impact asthma? Thorax 2011;66(1):4-6. |
R834596 (2010) R834596 (2011) R834596 (2012) R834596 (Final) R834596C003 (2012) |
Exit Exit Exit |
|
|
Gale SL, Noth EM , Mann J, Balmes J, Hammond SK, Tager IB. Polycyclic aromatic hydrocarbon exposure and wheeze in a cohort of children with asthma in Fresno, CA. Journal of Exposure Science & Environmental Epidemiology 2012;22(4):386-392. |
R834596 (2010) R834596 (2011) R834596 (2012) R834596 (Final) R834596C003 (2012) |
Exit |
|
|
Hew KM, Walker AI, Kohli A, Garcia M, Syed A, McDonald-Hyman C, Noth EM, Mann JK, Pratt B, Balmes J, Hammond SK, Eisen EA, Nadeau KC. Childhood exposure to ambient polycyclic aromatic hydrocarbons is linked to epigenetic modifications and impaired systemic immunity in T cells. Clinical & Experimental Allergy 2015;45(1):238-248. |
R834596 (2012) R834596 (Final) R834596C003 (Final) RD835435 (2014) RD835435 (2015) |
Exit Exit Exit |
|
|
Kohli A, Garcia MA, Miller RL, Maher C, Humblet O, Hammond SK, Nadeau K. Secondhand smoke in combination with ambient air pollution exposure is associated with increased CpG methylation and decreased expression of IFN-γ in T effector cells and Foxp3 in T regulatory cells in children. Clinical Epigenetics 2012;4(1):17 (16 pp.). |
R834596 (2011) R834596 (2012) R834596 (Final) R834596C003 (2011) R834596C003 (2012) R834596C003 (Final) R834786 (2012) |
Exit Exit Exit |
|
|
Liu J, Zhang L, Winterroth LC, Garcia M, Weiman S, Wong JW, Sunwoo JB, Nadeau KC. Epigenetically mediated pathogenic effects of phenanthrene on regulatory T cells. Journal of Toxicology 2013;2013:967029 (13 pp.). |
R834596 (2012) R834596 (Final) R834596C003 (2012) R834596C003 (Final) R834786 (2012) |
Exit Exit Exit |
|
|
Mann JK, Balmes JR, Bruckner TA, Mortimer KM, Margolis HG, Pratt B, Hammond SK, Lurmann FW, Tager IB. Short-term effects of air pollution on wheeze in asthmatic children in Fresno, California. Environmental Health Perspectives 2010;118(10):1497-1502. |
R834596 (2010) R834596 (2011) R834596 (2012) R834596 (Final) |
|
|
|
Nadeau K, McDonald-Hyman C, Noth EM, Pratt B, Hammond SK, Balmes J, Tager I. Ambient air pollution impairs regulatory T-cell function in asthma. Journal of Allergy and Clinical Immunology 2010;126(4):845-852.e10. |
R834596 (2010) R834596 (2011) R834596C003 (2010) R834596C003 (2011) R834786 (2011) |
Exit Exit Exit |
|
|
Noth EM, Hammond SK, Biging GS, Tager IB. Mapping and modeling airborne urban phenanthrene distribution using vegetation biomonitoring. Atmospheric Environment 2013;77:518-524. |
R834596 (Final) |
Exit Exit Exit |
|
|
Padula AM, Mortimer K, Hubbard A, Lurmann F, Jerrett M, Tager IB. Exposure to traffic-related air pollution during pregnancy and term low birth weight: estimation of causal associations in a semiparametric model. American Journal of Epidemiology 2012;176(9):815-824. |
R834596 (2010) R834596 (2011) R834596 (2012) R834596 (Final) R834596C001 (2011) R834596C001 (2012) R834596C001 (Final) |
Exit Exit Exit |
|
|
Padula AM, Tager IB, Carmichael SL, Hammond SK, Yang W, Lurmann F, Shaw GM. Ambient air pollution and traffic exposures and congenital heart defects in the San Joaquin Valley of California. Paediatric and Perinatal Epidemiology 2013;27(4):329-339. |
R834596 (2011) R834596 (2012) R834596 (Final) R834596C002 (2011) R834596C002 (2012) R834596C002 (Final) |
Exit |
|
|
Padula AM, Tager IB, Carmichael SL, Hammond SK, Lurmann F, Shaw GM. The association of ambient air pollution and traffic exposures with selected congenital anomalies in the San Joaquin Valley of California. American Journal of Epidemiology 2013;177(10):1074-1085. |
R834596 (2011) R834596 (2012) R834596 (Final) R834596C002 (2011) R834596C002 (2012) R834596C002 (Final) |
Exit Exit Exit |
|
|
Padula AM, Tager IB, Carmichael SL, Hammond SK, Yang W, Lurmann FW, Shaw GM. Traffic-related air pollution and selected birth defects in the San Joaquin Valley of California. Birth Defects Research, Part A: Clinical and Molecular Teratology 2013;97(11):730-735. |
R834596 (2012) R834596 (Final) R834596C002 (2012) R834596C002 (Final) |
Exit |
|
|
Padula AM, Mortimer KM, Tager IB, Hammond SK, Lurmann FW, Yang W, Stevenson DK, Shaw GM. Traffic-related air pollution and risk of preterm birth in the San Joaquin Valley of California. Annals of Epidemiology 2014;24(12):888-895e4. |
R834596 (2012) R834596 (Final) R834596C001 (2012) R834596C001 (Final) RD835435 (2015) |
Exit Exit Exit |
|
|
Padula AM, Balmes JR, Eisen EA, Mann J, Noth EM, Lurmann FW, Pratt B, Tager IB, Nadeau K, Hammond SK. Ambient polycyclic aromatic hydrocarbons and pulmonary function in children. Journal of Exposure Science & Environmental Epidemiology 2015;25(3):295-302. |
R834596 (2012) R834596 (Final) RD835435 (2014) RD835435 (2015) |
Exit Exit |
|
|
Yang W, Carmichael SL, Roberts EM, Kegley SE, Padula AM, English PB, Shaw GM. Residential agricultural pesticide exposures and risk of neural tube defects and orofacial clefts among offspring in the San Joaquin Valley of California. American Journal of Epidemiology 2014;179(6):740-748. |
R834596 (Final) R834596C002 (Final) |
Exit Exit Exit |
Supplemental Keywords:
ambient air, particulates, oxidants, nitrogen oxides, epidemiology, immunology, causal statistical methods, exposure assessment, asthma, San Joaquin Valley, CA, EPA Region 9Progress and Final Reports:
2010 Progress Report2011 Progress Report
2012 Progress Report
Final Report
Subprojects under this Center: (EPA does not fund or establish subprojects; EPA awards and manages the overall grant for this center).
R834596C001 Effect of Multi-Level Environmental Exposure on Birth Outcomes
R834596C002 Exposure to Air Pollutants and Risk of Birth Defects
R834596C003 Ambient Pollutant/Bioaerosol Effects on Treg Function


The archive contains my collection of:
The web site Elliott 900 software archive includes images of original Elliott paper tapes and cleaned up versions suitable for punching out and running on a real 900 series computer and/or running on my simulator. This web site can also be accessed accessed as a GitHub repository.
The web site Elliott-900-documentation contains scanned copies of printed Elliott manuals and related documents. This web site can also be accessed as a GitHub repository.
The GitHub repository Elliott-900-series-simulator contains a simulator system that allows Elliott 900 programs to be run on the Microsoft Windows platform. It also includes runnable demonstrations of much of the software in the archive. The simulator package includes a comprehensive manual describing both the simulator and the programs used in the demonstrations. It is often a more convenient and concise source that the Elliott technical documentation from which it is derived. The Simulator is written in Microsoft F# and has been tested on Windows 7 and 10.
The GitHub repository Elliott-900-series-simulator-in-C contains a simple, portable, Elliott 900 simulator system written in C. It simulates a generic 16K Elliott 900 series machine. The repository includes auxiliary programs to convert ASCII program and data files to the equivalent Elliott paper tape "telecode" and vice-versa. Shell scripts are provided to run demonstration Algol 60 and FORTRAN programs and the Elliott X3 Function Test program.
The GitHub repository Elliott-900-series-simulator-in-Python contains a simple, portable, Elliott 900 simulator system written in Python 3. It simulates a generic 16K Elliott 900 series machine. The repository includes auxiliary programs to convert ASCII program and data files to the equivalent Elliott paper tape "telecode" and vice-versa. Shell scripts are provided to run demonstration Algol 60 and FORTRAN programs and the Elliott X3 Function Test program.
The GitHub repository 900-Simulator-Utilities includes useful Windows programs for decoding Elliott paper tape images and pretty printing Elliott 903 SIR programs.
The files in the Software Release Notes folder contains documentation of some my own 903 software written in the format of an original Elliott SRN (Software Release Note).
The file "ReleaseNotes.txt" summarises the changes made in the most recent update of the site.
Elliott Archive / Andrew Herbert / 18th April 2023


--- layout: page title: Sentiment Analysis page: Tasks permalink: tasks/sentiment ---
Sentiment analysis is the task of classifying the polarity of a given text.


Date and Time fields
The library breaks up the date and time into a number of fields. This document defines what those fields mean.
A naming convention is used to define the fields. These correspond to the common names given to date and time concepts in the Gregorian calendar.
Most fields are a view over part of the total time. These fields are expressed as XxxOfYyy where Xxx and Yyy are two date time units. Yyy will always be larger than Xxx. For example, DayOfWeek or SecondOfMinute. A side effect of this is that these field values cannot be negative.
Certain fields extend over all time, and do not include the word 'Of' in their names. For example, year and weekyear. These fields can have negative values (see the table for details).
The fields are explained in more detail below (for the GJChronology):
| Name | Min value (GJ) | Max value (GJ) | Notes |
|---|---|---|---|
| millisOfSecond | 0 | 999 | |
| millisOfDay | 0 | 86 399 999 | |
| secondOfMinute | 0 | 59 | |
| secondOfDay | 0 | 86 399 | |
| minuteOfHour | 0 | 59 | |
| minuteOfDay | 0 | 1439 | |
| hourOfDay | 0 | 23 | |
| hourOfHalfday | 0 | 11 | |
| clockhourOfDay | 1 | 24 | |
| clockhourOfHalfday | 1 | 12 | |
| halfdayOfDay | 0 (AM) | 1 (PM) | |
| dayOfWeek | 1 (Monday) | 7 (Sunday) | |
| weekOfWeekyear | 1 | 53 | |
| weekyear | -292 000 000 | 292 000 000 | |
| dayOfMonth | 1 | 31 | |
| dayOfYear | 1 | 366 | |
| monthOfYear | 1 (January) | 12 (December) | |
| year | -292 000 000 | 292 000 000 | |
| yearOfCentury | 1 | 100 | [1] |
| yearOfEra | 1 | 292 000 000 | |
| centuryOfEra | 1 | 2 920 000 | [2] |
| era | 0 (BC/BCE) | 1 (AD/CE) |
[1] For the ISOChronology, the year of century range is from 0 to 99.
[2] For the ISOChronology, the century of era range is from 0.
MillisOfSecond
The number of milliseconds in the specified time once the second and larger parts are removed.
MillisOfDay
The number of milliseconds in the specified time once the day and larger parts are removed.
SecondOfMinute
The number of seconds in the specified time once the minute and larger parts are removed.
SecondOfDay
The number of seconds in the specified time once the day and larger parts are removed.
MinuteOfHour
The number of minutes in the specified time once the hour and larger parts are removed.
MinuteOfDay
The number of minutes in the specified time once the day and larger parts are removed.
HourOfDay
The number of hours in the specified time once the day and larger parts are removed. The clockhour value represents midnight of the current day as 24 instead of 0.
HourOfHalfday
The number of hours within the half day. The clockhour value represents midnight or noon of the current day as 12 instead of 0.
HalfdayOfDay
The AM/PM value of the day.
DayOfWeek
The day of week is defined by constants in DateTimeConstants. The values used are from the ISO8601 standard. Monday is defined as 1, through to Sunday as 7.
WeekOfWeekyear and Weekyear
A week based year is one where dates are expressed as a day of week, week number and year (week based). The following description is of the ISO8601 standard used by implementations of this method in this library.
Weeks run from 1 to 52-53 in a week based year. The first day of the week is defined as Monday and given the value 1.
The first week of a year is defined as the first week that has at least four days in the year. As a result of this definition, week 1 may extend into the previous year, and week 52/53 may extend into the following year. Hence the need for the year of weekyear field.
For example, 2003-01-01 was a Wednesday. This means that five days, Wednesday to Sunday, of that week are in 2003. Thus the whole week is considered to be the first week of 2003. Since all weeks start on Monday, the first week of 2003 started on 2002-12-30, ie. in 2002.
The week based year has a specific text format.
2002-12-30 (Monday 30th December 2002) would be represented as 2003-W01-1.
2003-01-01 (Wednesday 1st January 2003) would be represented as 2003-W01-3.
DayOfMonth
The day of the month. For the GJ and ISO chronologies, this will run from 1 through to 28 or 29 in February, 30 in April, June, September and November and 31 otherwise.
DayOfYear
The day of the year. This runs from 1 to 365, or 366 in leap years. The exception is when a Julian to Gregorian cutover has occurred. In that case, the count is from 1 to 355 (typically) and is unbroken.
MonthOfYear
The month of year defined by constants in DateTimeConstants. The values used are from the ISO8601 standard. January is defined as 1, through to December as 12.
Year
The year, using negative values to represent years in the previous era. For the GJ chronology, year zero is not included, unless the cutover to Gregorian is specified at or before 1 BCE. The ISO chronology always includes the year zero.
CenturyOfEra and YearOfCentury
The definition of these varies by chronology:
| year of era | GJ year | GJ century of era | GJ year of century | ISO year | ISO century of era | ISO year of century |
|---|---|---|---|---|---|---|
| 101 BCE | -101 | 2 | 1 | -100 | 1 | 0 |
| 100 BCE | -100 | 1 | 100 | -99 | 0 | 99 |
| 99 BCE | -99 | 1 | 99 | -98 | 0 | 98 |
| ... | ... | ... | ... | ... | ... | ... |
| 2 BCE | -2 | 1 | 2 | -1 | 0 | 1 |
| 1 BCE | -1 | 1 | 1 | 0 | 0 | 0 |
| 1 CE | 1 | 1 | 1 | 1 | 0 | 1 |
| 2 CE | 2 | 1 | 2 | 2 | 0 | 2 |
| ... | ... | ... | ... | ... | ... | ... |
| 99 CE | 99 | 1 | 99 | 99 | 0 | 99 |
| 100 CE | 100 | 1 | 100 | 100 | 1 | 0 |
| 101 CE | 101 | 2 | 1 | 101 | 1 | 1 |
| ... | ... | ... | ... | ... | ... | ... |
| 1999 CE | 1999 | 20 | 99 | 1999 | 19 | 99 |
| 2000 CE | 2000 | 20 | 100 | 2000 | 20 | 0 |
| 2001 CE | 2001 | 21 | 1 | 2001 | 20 | 1 |
For GJ this is consistent with phrases such '2003 is in the 21st century'.
For ISO this represents a straight split of a textual ISO8601 year.
YearOfEra
The year as generally known (always positive). Both the GJ and ISO chronologies return 1 for 1BC/BCE, 2 for 2BC/BCE etc. In other words there is no year zero and no negative value for this field.
Era
The era expressed as a constant, zero for BC/BCE, one for AD/CE.
Other chronologies should respect the convention that one is the current era and zero is the previous era. If more eras are required the values should increase numerically over time.


|
BTK Python wrapper
0.3dev.0
Python bindings for the Biomechanical ToolKit library (BTK)
|
Store data which cannot be embedded within timeseries (calibration matrix, subject informations, ...). More...
Public Member Functions | |
| def | __eq__ |
| def | __ne__ |
| def | AppendChild |
| def | Begin |
| def | ClearChildren |
| def | Clone |
| def | End |
| def | ExtractChildInfo |
| def | FindChild |
| def | GetChild |
| def | GetChildNumber |
| def | GetDescription |
| def | GetInfo |
| def | GetLabel |
| def | GetTimestamp |
| def | GetUnlockState |
| def | HasChildren |
| def | HasInfo |
| def | HasMetaDataAsParent |
| def | InsertChild |
| def | RemoveChild |
| def | SetChild |
| def | SetDescription |
| def | SetInfo |
| def | SetLabel |
| def | SetUnlockState |
| def | TakeChild |
| def | Update |
Store data which cannot be embedded within timeseries (calibration matrix, subject informations, ...).
Store data which cannot be embedded within timeseries data (calibration matrix, subject informations, ...). Each object can store children metadata. Theoretically, the number of sub-level is infinite. However, the main common use of the metadata is to use 2 levels. This use was introduced in the C3D format. The values in a metadata are stored in a MetaDataInfo object and are accessible using the method GetInfo(). The unlock member accessible using the methods GetUnlock() and SetUnlock() doesn't affect the setting of the values, but is used only to inform the user/developer.
| def btk.btkMetaData.__eq__ | ( | self, | args | ) |
__eq__(self, rRHS) -> bool
| def btk.btkMetaData.__ne__ | ( | self, | args | ) |
__ne__(self, rRHS) -> bool
| def btk.btkMetaData.AppendChild | ( | self, | args | ) |
AppendChild(self, arg2) -> bool Append the child entry. If entry has a label which already exists in the parent's list, then it is not inserted. Returns True if child has been inserted or False.
| def btk.btkMetaData.Begin | ( | self | ) |
Begin(self) -> btkMetaDataIterator Returns an iterator to the beginning of the list of children.
| def btk.btkMetaData.ClearChildren | ( | self | ) |
ClearChildren(self) Removes every children.
| def btk.btkMetaData.Clone | ( | self | ) |
Clone(self) -> btkMetaData Deep copy of the object
| def btk.btkMetaData.End | ( | self | ) |
End(self) -> btkMetaDataIterator Returns an iterator just past the last child.
| def btk.btkMetaData.ExtractChildInfo | ( | self, | args | ) |
ExtractChildInfo(self, label, format, numdims, noPossibleEmptyValue = True) -> btkMetaDataInfo ExtractChildInfo(self, label, format, numdims, noPossibleEmptyValue = True) -> btkMetaDataInfo Check if a child exists with the given label and correspond to the given format plus the number of dimensions with or without values (noPossibleEmptyValue). The informations of the metadata are extracted if all the checks are ok. Otherwise, the methods return an empty pointer.
| def btk.btkMetaData.FindChild | ( | self, | args | ) |
FindChild(self, label) -> btkMetaDataIterator Finds the children which has the given label and return it as an iterator.
| def btk.btkMetaData.GetChild | ( | self, | args | ) |
GetChild(self, index) -> btkMetaData GetChild(self, index) -> btkMetaData Gets the entry for the given index or label. An exception is thrown is the given input doesn't correspond to any entry.
| def btk.btkMetaData.GetChildNumber | ( | self | ) |
GetChildNumber(self) -> int Returns the number of children
| def btk.btkMetaData.GetDescription | ( | self | ) |
GetDescription(self) -> std::string const &
| def btk.btkMetaData.GetInfo | ( | self | ) |
GetInfo(self) -> btkMetaDataInfo Gets the btkMetaDataInfo associated to the entry.
| def btk.btkMetaData.GetLabel | ( | self | ) |
GetLabel(self) -> std::string const &
| def btk.btkMetaData.GetTimestamp | ( | self | ) |
GetTimestamp(self) -> unsigned long Returns the timestamp of the object.
| def btk.btkMetaData.GetUnlockState | ( | self | ) |
GetUnlockState(self) -> bool const Gets the unlock state of the entry.
| def btk.btkMetaData.HasChildren | ( | self | ) |
HasChildren(self) -> bool Checks if the entry has children
| def btk.btkMetaData.HasInfo | ( | self | ) |
HasInfo(self) -> bool Checks if a btkMetaDataInfo is associated with the entry.
| def btk.btkMetaData.HasMetaDataAsParent | ( | self | ) |
HasMetaDataAsParent(self) -> bool Checks if this object has a MetaData object as parents.
| def btk.btkMetaData.InsertChild | ( | self, | args | ) |
InsertChild(self, btkMetaDataIterator, btkMetaData) -> bool InsertChild(self, int, btkMetaData) -> bool Insert the child entry for the given location. If the entry has a label which already exists in the parent's list, then it is not inserted. Returns True if child has been inserted or False.
| def btk.btkMetaData.RemoveChild | ( | self, | args | ) |
RemoveChild(self, btkMetaDataIterator) -> btkMetaDataIterator RemoveChild(self, int) RemoveChild(self, arg2) Removes the child entry which has the given index, label or corresponding iterator.
| def btk.btkMetaData.SetChild | ( | self, | args | ) |
SetChild(self, int, btkMetaData) Sets the child entry for the given index
| def btk.btkMetaData.SetDescription | ( | self, | args | ) |
SetDescription(self, string)
| def btk.btkMetaData.SetInfo | ( | self, | args | ) |
SetInfo(self, arg2) Sets the btkMetaDataInfo associated to the entry.
| def btk.btkMetaData.SetLabel | ( | self, | args | ) |
SetLabel(self, string) Sets the label of the entry. If label already exist in the parent's list, then an exception is thrown.
| def btk.btkMetaData.SetUnlockState | ( | self, | args | ) |
SetUnlockState(self, arg2) Sets the unlock state of the entry.
| def btk.btkMetaData.TakeChild | ( | self, | args | ) |
TakeChild(self, btkMetaDataIterator) -> btkMetaData TakeChild(self, int) -> btkMetaData TakeChild(self, string) -> btkMetaData Removes the child entry which has the given index, label or corresponding iterator. If there is no child with the specified label, then an empty pointer is returned.
| def btk.btkMetaData.Update | ( | self | ) |
Update(self) Updates the ProcessObject associated with this DataObject.


Register Welcome to our digital platform! Name invalid name! Company Name invalid Company Name! Email invalid address entered! Your Phone invalid phone! Password invalid password! Confirm Password invalid password! Register


make v : Create a new virtual machine.
make
new type : Specify 'virtual machine' here.
with properties record : You must specify the backend as well as a configuration with a name. If this is a QEMU virtual machine, you must specify the architecture in the configuration as well.
→ specifier : The new virtual machine (as a specifier).


betterdiscordctl
A program for managing BetterDiscord on Linux.
More information: home page
- Install BetterDiscord on Discord Stable:
sudo betterdiscordctl install
- Install BetterDiscord on Discord Canary:
sudo betterdiscordctl --d-flavors canary install
- Install BetterDiscord on Discord PTB:
sudo betterdiscordctl --d-flavors ptb install
- Install BetterDiscord on Discord installed with Flatpak:
sudo betterdiscordctl --d-install flatpak install
- Install BetterDiscord on Discord installed with Snap:
sudo betterdiscordctl --d-install snap install


Improve this Doc
Slides make it easy to create galleries, tutorials, and page-based layouts.
Basic Usage
Demo Source
```html
Slide 1
Slide 2
Slide 3
```
Slides take a number of configuration options on the `` element, such as `loop` and `autoplay`. Check out the [Slides API reference](../api/components/slides/Slides/) for more information on configuring slides.


Nolan Hewitt
About Me
(current)
Portfolio
Contact
Portfolio
Project 1
Project 2
Project 3
Project 4
Project 5
Project 6
Copyright