Richard Goldman
info
employment
English Teacher, Chelsea School (Hyattsville, MD)
2006-08 — 2013-06 | High School | English Teacher | Authentic Assessment | Academic Research | Special Educator | Student Advisor
Developed and taught high school literature and composition to secondary students with language-based learning differences until I accepted an opportunity serve as the Director of Technology.
- Taught British Literature (11th) | Writing Tutorial | Reading (Fluency and Comprehension) | English/Language Arts (6th through 8th)
- Served as advisor to Photography Club, Computing Club, Latin Club, Postmodern Poetry Club
- Increased pass rate on state mandated reading and writing assessment by 30%
- Designed, proposed, and implemented an innovative open-source writing lab to increase range of assistive and learning technologies and decrease total cost of ownership compared to other writing labs pm campus
- Designed and taught professional development workshops on educational and assistive technologies
- Led faculty reading groups on critical pedagogy and culturally responsive practices in the classroom
- Delivered research on addressing culturally biased language in students with language-based learning differences, the use of personal mobile devices and apps as instructional and assistive technologies, add incorporating humanities into STEM curriculum to conferences
- Developed, managed, tracked, and reported progress on IEP goals and objectives
Special Education Teacher, McKinley Technology High School (DCPS)
2005-08 — 2006-06 | Special Educator | Mathematics | Collaboration & Co-Planning
Special education teacher in integrated and self-contained environments in a STEM magnet school.
- Served as English and Mathematics Co-Teacher
- Reformed literacy and mathematics intervention and remediation strategies
- Developed, managed, tracked, and reported progress on IEP goals and objectives
High School English Teacher, Vanguard School of Lake Wales (Lake Wales, FL)
2003-08 — 2005-06 | Editor Special Educator Mentor Service
Developed and taught high school literature and composition courses.
- Taught English 11 (British Literature), English 10 (World Literature), and English 9 (Introduction to Literature)
- Editor, LD Digest (Journal)
- Student mentor
- Advisor to National Honor Society, Philosophy Club, Latin Club
Visiting Assistant Professor of English, Bethany College (Bethany WV)
2001-08 — 2003-06 | Literature Composition Research Argumentation Individualization
Developed and taught undergraudate courses in literature, composition, and rhetoric while working closesly with disability services to provide indivualized accommodations for eligible students.
- Taught History of the British Novel, Science Fiction and Fantasy Literature, Composition and Rhetoric, Research and Argumentation, and The Developing British Novel
- Guided students to develop and publish a ad-funded periodical with literary, cultural, and critical content
education
West Virginia University
1996-06 — 2004-06 | MA Ph.D(ABD) | EnglishFocus on Victorian Literature | Modern American Novel | Electronic Literature | Digital Humanities | Critical Theory
Bethany College
1990-08 — 1994-06 | BA | EnglishMagna Cum Laude with a BA in English and minors in philosophy and German; studied pedagogy in Heidelberg in junior year


Jewish_art_will_deutsch_jewish_american_princess.jpg http://store.notesfromthetribe.com/product/jewish-art-8-5-x11-jewish-princess-print
Most people in High School assumed that I was gay.
Given my situation, this was understandable.
To the narrow-minded Orange County adolescent I fit all the stereotypes.
I was small.
I was bad at sports.
I was interested in the arts.
I could dance.
I had a slight lisp due to grinding my teeth as a child.
I wore a messenger bag.
But most importantly, I didn’t date women.
I didn’t date men either. I just didn’t date, period.
This was due to the fact that I had been strictly prohibited from courting goyim.
Considering there were at most five eligible Jewish women in my school who were all out of my league, it meant I would have to find a mating pool elsewhere.
But where? Two words: the valley.
An hour up the 405 freeway was an entire town seemingly inundated with Jewish women just waiting to be kissed.
Back in 1999 it was like walking into an N’Sync music video. Everybody drove a sports utility vehicle with a compact disc player just to get around the suburbs. There was valet parking everywhere. And the women. They wore giant sunglasses with shaded lenses, rhinestones, leather pants, faux snakeskin pants, jean skirts, Abercrombie and Fitch, bedazzled bandanas and heart shaped Tiffany’s charms. They referred to themselves as ‘Japs’, though most often as ‘Jappy.’
I didn’t understand.
Not only did the name seem downright derogatory, but they didn’t look Japanese to me.
It was explained to me that there was certain pride in being a Jewish American princess. A modern re-appropriation and incorporation of the slur into cultural identity. In fact the impetus for this week’s post came from a friend of mine who is a self proclaimed ‘Jewish American Princess.’ Over a discussion at the Whole Foods off Coldwater, I explained that I was working on a series of images of contemporary Jewish life. She peered at me over her Chanel sunglasses and said ‘draw a picture of a Jap, I’d buy one.’ On her license plate frame reads the following phrase: ‘I’m not spoiled, just well taken care of.’
And yes, its an SUV.


Week 1
A name can function as a password, a key that allows you access to its owner. When I visit people in the hospital, that key can unlock doors or leave me standing out in the cold.
When I walk into a hospital, the first person I meet is usually the receptionist at the information desk. My response to the question “Can I help you?” is generally to offer a name. “I’m here to visit Mike Drummond,” I said on a recent hospital visit. The woman paused, glanced at her computer screen, and smiled at me: “I’m sorry, we don’t have a patient here by that name.”
I’m used to this game. Because of privacy laws, hospitals won’t give access to the room number of a patient unless the visitor knows the exact legal name entered in the records. So I tried again. “OK, how about Michael Drummond?” Same pause, back to the computer, and then another smiling response: “There’s no one admitted in this hospital by that name.” By this time I was beginning to get frustrated, but a few well-placed cell phone inquiries to mutual friends brought me back to the desk with my password ready: “Thomas Drummond!” I said triumphantly. Success! This time I was rewarded with a room number and directions to the elevators.
Mike lay in his hospital bed looking a bit weak but cheerful. Even cancer couldn’t put a damper on his hearty personality. After asking about how he was feeling and when he might get to go home, I got to the question stirring my curiosity: “Mike, how is it that I’ve known you all this time and had no idea your name is really Thomas?” The story he shared was worth the trip and the delay in the lobby.
Thomas Philip Drummond Jr. was the first son to a wonderful mother and father. His dad, Tom, was proud to share his name with his little boy. The family lived in Illinois when he arrived but soon packed up and moved back home to be close to his mother’s family. There was one little wrinkle. Little Thomas Jr.’s aunts


The x coordinate for the upper-left corner
The y coordinate for the upper-left corner
The width of the rectangle
The height of the rectangle
returns the bottom edge of the rectangle
returns the left edge of the rectangle
returns the right edge of the rectangle
returns the top edge of the rectangle
The type of the object, mainly used to avoid instanceof
checks
A constant empty rectangle.
Enlarges rectangle that way its corners lie on grid
Returns itself.
Creates a clone of this Rectangle
a copy of the rectangle
Checks whether the x and y coordinates given are contained within this Rectangle
The X coordinate of the point to test
The Y coordinate of the point to test
Whether the x/y coordinates are within this Rectangle
Pads the rectangle making it grow in all directions. If paddingY is omitted, both paddingX and paddingY will be set to paddingX.
Returns itself.
Generated using TypeDoc
The rectangle class.


Plugin Information |
|---|
No information for the plugin 'statistics-notification' is available. It may have been removed from distribution. |
Description
- Plugin will capture job creation, deletion and update events and calls REST API. This also sends config.xml in the rest call.
- It will record the queue time for each and every build calling REST API. It captures Queue entry time and Queue exit time and other related parameters.
- It also records build information like start time, end time, build parameters, SCM parameters and Slave information and calls an API.
All of the above stats are captured in real time. API can be used to write the data to DB or can be used to notify the people.
Notification URL can be configured in system configuration page at http://localhost:9090/jenkins/configure as shown in below.
Notification URL is the API end point that can be used for capturing statistics. For ex. http://cistats.mycompany.com/api/ Final Queue end point will be http://cistats.mycompany.com/api/queues Projects/jobs end point will be http://cistats.mycompany.com/api/projects Builds end point will be http://cistats.mycompany.com/api/builds.
- Notification URL is the API end point that can be used for capturing statistics. For ex. http://cistats.mycompany.com/api/.
- Final Queue end point will be http://cistats.mycompany.com/api/queues.
- Projects/jobs end point will be http://cistats.mycompany.com/api/projects.
- Builds end point will be http://cistats.mycompany.com/api/builds.
- Connection Timeout: Determines the timeout until a connection is established. Default value is 1000ms.
- Socket Timeout: Defines the default socket timeout in milliseconds which is the timeout for waiting for data. Default value is 1000ms.
These are the only 3 configurations that user need to do.
Once they are set each time a job is created, deleted or updated an API will be called with following JSON.
{ "name": "create-10", "createdDate": "Jul 1, 2015 10:10:37 AM", "userId": "anonymous", "userName": "anonymous", "ciUrl": "http://localhost:9090/jenkins/", "status": "ACTIVE", "configFile": "<?xml version='1.0' encoding='UTF-8'?>\n<project>\n <keepDependencies>false<\/keepDependencies>\n <properties/>\n <scm class=\"hudson.scm.NullSCM\"/>\n <canRoam>false<\/canRoam>\n <disabled>false<\/disabled>\n <blockBuildWhenDownstreamBuilding>false<\/blockBuildWhenDownstreamBuilding>\n <blockBuildWhenUpstreamBuilding>false<\/blockBuildWhenUpstreamBuilding>\n <triggers/>\n <concurrentBuild>false<\/concurrentBuild>\n <builders/>\n <publishers/>\n <buildWrappers/>\n<\/project>" }
Sample JSON for the Queue API.
{ "duration":47, "entryTime":"2015-07-01T02:12:55.000Z", "exitTime":"2015-07-01T02:12:55.000Z", "jenkinsQueueId":4, "jobName":"test-2", "startedBy":"anonymous", "status":"LEFT", "queueCauses":{ "buildable":{ "entryTime":"2015-07-01T02:12:55.000Z", "exitTime":"2015-07-01T02:12:55.000Z", "reasonForWaiting":"Waiting for next available executor" }, "waiting":{ "entryTime":"2015-07-01T02:12:55.000Z", "exitTime":"2015-07-01T02:12:55.000Z", "reasonForWaiting":"???" } }, "ciUrl":"http://localhost:9090/jenkins/" }
Sample JSON for build API.
{ "jobName":"test-job", "number":19, "startTime":"2015-07-01T18:46:53.000Z", "startedUserId":"anonymous", "startedUserName":"anonymous", "result":"SUCCESS", "duration":42451, "queueTime":14917, "endTime":"2015-07-01T18:47:51.000Z", "ciName":"corepayteconnector-ci", "scmInfo":{ "url":"git@github.com:plugins/testplugin.git", "branch":"origin/develop", "commit":"12345567e7ada45db02db5fb" }, "parameters":{<EMAIL_ADDRESS>}, "slaveInfo":{ "slaveName":"computer name", "vmName":"VM name", "label":"java", "remoteFs":"/dev/hudson/" }, "ciUrl":"http://localhost:9090/jenkins" }
Attachments:
stats-plugin-system-config.png (image/png)
stats-plugin-system-config.png (image/png)
stats-plugin-system-config.png (image/png)
stats-plugin-system-config-1.png (image/png)


My previous experience with psychoactive substances was mostly in the realm of hallucinogens. Under my 24-year-old belt were:
-Caffeine (chronically, since age 8)
-Alcohol (hundreds of times...moreso recently than before)
-Marijuana (severe addiction to the stuff for a couple years...have since kicked it completely)
-Psilocybin mushrooms (about a dozen times...I now only use it once a year at the same time and place for spiritual purposes)
-Damiana (as a pot alternative, nice taste, no psychoactive effects noticeable, no longer use it)
-MDMA (once, last year, outdoor festival, 4 tabs, brilliant time)
-Salvia divinorum (a dozen times or so...rather nuts)
-Tobacco (smoked about the equivalent of 2 whole cigarettes in my life...hate them, can't see the point)
My decision to experiment with melatonin came on a whim last night after visiting my family. My sister is severely autistic and as such, she takes a cocktail of prescription drugs before bedtime to help her get to sleep. These drugs are melatonin, novo-clonodine, and risperidone. After my sister had taken her meds, the rest of us got into a discussion about what she was taking. My mom explained what the desired effect of each one was on my sister, and melatonin got my attention. I had heard of the drug before, but was unsure what it was used for. It's primarily a sleep aid. Curious, I pocketed 7 of the 3mg pills and eventually went back to my apartment to do the appropriate reading on the substance.
I spent about an hour reading everything I could on melatonin. Dosage, possible side-effects, combination reports with alcohol (since I had various alcoholic beverages throughout the day, ending it with a glass of Wiser's Very Old rye on the rocks. My sister takes only one of these 3mg capsules, so I figured I'd exceed that by a few times.
As it turns out, melatonin has been hyped somewhat as enhancing the clarity and intensity of dreams. This intrigued me because I typically have very vivid and realistic dreams in the first place. Could melatonin somehow make them more realistic still? Furthermore, if I had the good fortune to recognize such a dream and allow it to become a lucid one, would it be that much better with the help of melatonin?
I decided on taking three of the 3mg capsules, for a total of 9mg of melatonin. This seemed reasonable. Shulgin had experimented with up to 10mg, and several scientific journals indicated that this is an above average dose, but was far from detrimental. So, after reading for about an hour about melatonin, I turned off the lights (actually, I had done this earlier when I came upon that bit of information), brewed some peppermint tea, and ingested 6mg of the drug. Within a minute or two I decided to up this to 9mg, so I had another capsule. I wasn't expecting much to happen while I was awake, so I brushed my teeth, made my bed comfortable, fed my cat, and went to bed. It was 11:20pm. About 20 minutes had passed since I took the capsules.
An interesting effect manifested itself as I was drifting off to sleep. I would drift in and out of sleep fairly rapidly about 3 or 4 times before actually dozing off. It felt similar to falling asleep on the bus or in a car, only for a few seconds, and then being jolted out of that sleep by a bump in the road or a sudden stop. No outside stimulus was causing this. My cat was elsewhere, the night was still, and my apartment is damned quiet. So, being jolted out of the start of my sleep a couple times seemed out of place. It was enjoyable in the sense that I do not regularly do this so I was content that melatonin was having some effect. At least, I can only assume it was the melatonin kicking in.
My sleep itself was characterized by dreams. Not particularly vivid ones...at least no more than usual. I can recall that one of the dreams was slightly frightening, but nothing that I'd consider nightmarish. Others were neutral in enjoyment. I can, at this point, only remember the very final one I had, which was short and involved me calling my girlfriend from work to tell her the day's total sales. This actually happens a lot in reality since we work at the same place.
What was most interesting about melatonin's effects on my sleep was the fact that I sporadically woke up throughout the night, unprompted by anything external going on. Maybe once every two hours or so, I would just wake up for no apparent reason. It was easy enough to get back to sleep, but I do not normally wake up throughout the night, unless my cat jumps on my face or something like that. This is hard to explain, seeing as melatonin is considered a sleep aid. So, come morning I did feel well-rested, despite the various wake-ups throughout the night. No more or less well-rested than any normal morning. So....I suppose my results are largely inconclusive.
At 9mg, I had several average-clarity dreams, most of which I cannot recall in any detail the morning after. I experienced a pattern of sleep-wake state a few times before finally getting to SLEEP, and that pattern was continued throughout the night, but in longer intervals.
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.


About 🔬
What started out as an experiment has now evolved into a dedicated online community focused on promoting the benefits of Artificial Intelligence (AI) to society. Our LinkedIn group boasts over 34,000 members from around the globe. Join our community and share your AI knowledge and experiences on our Slack channel. Sign up for our newsletter to stay up-to-date on the latest AI news and events. No matter where you are or what your background is, our community offers a wealth of resources and opportunities to learn and apply AI technology in your personal and professional life. Join us and become a part of the AI revolution.
- Subscribe to our newsletter
- Share your experience and knowledge about Artificial Intelligence by joining our Slack.
- Get the latest news on Artificial Intelligence and AI-related events and conferences.
No matter where you are in the world, no matter your educational background and abilities, you'll be able to learn everything you need to to put AI tech to use in your life, job, and community!
Original Content 💎
Articles and Videos
Articles 📃
- GPT-3 Project ideas with code I’ve recently been granted Beta access to the GPT-3 API. As such I’ve spent the last few days diving deep into what’s possible with this amazing tool.
- How to make the most from old WW2 footageUse image stacking, and other techniques to improve the quality of old,degraded images.
Videos 🎬
- GPT-3 Part 1:Build 2 projects using GPT-3 in just a couple of minutes. Bare bones: branding generator, chat bot.
- GPT-3 Part 2:Using my voice to chat with OpenAI's GPT-3 model
- WarsawJS: Take Action to Protect your Attention and Focus
Random 🎲
Get inspired with random books, Youtube channels, inventions, and machine learning topics!
Random Smart Youtube
{{this.aYoutube.topic.toUpperCase()}} {{ this.aYoutube.channel }}
Random Free Book
All these titles are free to read at Project Gutenberg
{{this.aBook}}
Apps 💻
Built using JavaScript and Vuejs
⚡ Best Links ⚡
{{value}}
Frequently Asked Questions 📑
Q: What is SOAI's vision?
A: To enable the next generation of AI researchers and practitioners.
What is the SOAI community?
It is a community of researchers and practitioners interested in advancing the state of the art in AI.
How can I be involved in SOAI?
We encourage you to contribute to the SOAI community by joining our mailing list, following us on Twitter (@soaiworld), and participating in our Youtube channel.
Who can be a member of SOAI?
Anyone can be a member of SOAI. (No bots allowed)
How can I advertise my job opportunities (or internships)?
If you are looking for a place to advertise your job opportunities, you can do it using our Slack and newsletter.
Marcin Kraszewski Podcast 🎙
Episodes
Dan Berte
In this episode, I chat with my friend from Wisconsin about his recent career change and his foray into Ethereum mining. We also discuss his experience contracting Covid-19 twice and more. Tune in to hear about Ethereum, printing presses, automation, and more!
Topics
Ethereum, Printing Presses, Automation Status: Post-production *May contain adult languageContact Us 📱
SOAI
We would like to invite you to engage in a discussion and exchange of ideas about the future and the role of AI in it with our community. Our community is dedicated to increasing global awareness of the significance of AI for society. By joining, you will have the opportunity to draw on the knowledge and experience of others in your own pursuits, as well as contribute your own insights and experiences through events and other activities.
Headquarters Warsaw, Poland


30-Apr-2017 | Milku
my dear readers, do you know the former names of the chemical elements?
Another Bank Holiday weekend...so no peace for me. My humans will be hanging around my cage more than usual. They tend to clean out my cage at the weekend too so I'll have to get up early and do some running around before breakfast. I bet they'll clear out my store of food. They wouldn't like it if I threw out the contents of their larder, would they? Well, mealworms to them, I'll just cache some more goodies.
I thought you might like a little challenge. I've got some pictures showing a set of current symbols for the chemical elements. They all have got symbols that have been discontinued so can you tell what they spell out using those old symbols. Count up the atomic numbers of the ones you get right. Claim a delicious hamster treat if you get them all correct. You just have to click on the image to see the answer.
Did you get it right? How about another one?


${tagline}
${aboutText}
Highly customizable templates and adapters.
With some simple setup you can be up and running in minutes.
We update dependencies to keep things fresh.
Build for speed and scalability.


source
code documentation
des.c File Reference
Detailed Description
code for DES and 3DES in CBC mode
- Author:
- Niklaus Schild<EMAIL_ADDRESS>OUTLINE: This module contains mainly code extracted from the libssl library. We use this code to implement a DES73DES-CBC.
IMPLEMENTATION: "This product includes cryptographic software written by Eric Young (eay@cryptsoft.com)" (taken form www.openssl.org)"
NOTES:
This document is part of embedded IPsec
Copyright (c) 2003 Niklaus Schild and Christian Scheurer, HTI Biel/Bienne
All rights reserved.
This file contains code from the OpenSSL Project
portions Copyright (c) 1998-2003 OpenSSL (www.openssl.org)
Definition in file des.c.
#include <string.h>
#include "ipsec/des.h"
#include "ipsec/debug.h"
Go to the source code of this file.
|
Defines |
| #define | DES_KEY_SZ (sizeof(DES_cblock)) |
| #define | DES_SCHEDULE_SZ (sizeof(DES_key_schedule)) |
| #define | ITERATIONS 16 |
| #define | HALF_ITERATIONS 8 |
| #define | c2l(c, l) |
| #define | c2ln(c, l1, l2, n) |
| #define | l2c(l, c) |
| #define | HDRSIZE 4 |
| #define | n2l(c, l) |
| #define | l2n(l, c) |
| #define | l2cn(l1, l2, c, n) |
| #define | ROTATE(a, n) (((a)>>(n))+((a)<<(32-(n)))) |
| #define | LOAD_DATA_tmp(a, b, c, d, e, f) LOAD_DATA(a,b,c,d,e,f,g) |
| #define | LOAD_DATA(R, S, u, t, E0, E1, tmp) |
| #define | D_ENCRYPT(LL, R, S) |
| #define | PERM_OP(a, b, t, n, m) |
| #define | IP(l, r) |
| #define | FP(l, r) |
| #define | NUM_WEAK_KEY 16 |
| #define | HPERM_OP(a, t, n, m) |
Functions |
| void | DES_cbc_encrypt (const unsigned char *input, unsigned char *output, long length, DES_key_schedule *schedule, DES_cblock *ivec, int enc) |
| void | DES_ncbc_encrypt (const unsigned char *input, unsigned char *output, long length, DES_key_schedule *schedule, DES_cblock *ivec, int enc) |
| void | DES_encrypt1 (DES_LONG *data, DES_key_schedule *ks, int enc) |
| void | DES_encrypt2 (DES_LONG *data, DES_key_schedule *ks, int enc) |
| void | DES_encrypt3 (DES_LONG *data, DES_key_schedule *ks1, DES_key_schedule *ks2, DES_key_schedule *ks3) |
| void | DES_decrypt3 (DES_LONG *data, DES_key_schedule *ks1, DES_key_schedule *ks2, DES_key_schedule *ks3) |
| void | DES_ede3_cbc_encrypt (const unsigned char *input, unsigned char *output, long length, DES_key_schedule *ks1, DES_key_schedule *ks2, DES_key_schedule *ks3, DES_cblock *ivec, int enc) |
| void | DES_set_odd_parity (DES_cblock *key) |
| int | DES_check_key_parity (const_DES_cblock *key) |
| int | DES_is_weak_key (const_DES_cblock *key) |
| int | DES_set_key (const_DES_cblock *key, DES_key_schedule *schedule) |
| int | DES_key_sched (const_DES_cblock *key, DES_key_schedule *schedule) |
| int | DES_set_key_checked (const_DES_cblock *key, DES_key_schedule *schedule) |
| void | DES_set_key_unchecked (const_DES_cblock *key, DES_key_schedule *schedule) |
| void | cipher_3des_cbc (unsigned char *text, int text_len, unsigned char *key, unsigned char *iv, int mode, unsigned char *output) |
Variables |
| const DES_LONG | DES_SPtrans [8][64] |
| int | _shadow_DES_check_key |
| const unsigned char | odd_parity [256] |
| DES_cblock | weak_keys [NUM_WEAK_KEY] |
| const DES_LONG | des_skb [8][64] |
Define Documentation
|
|
Value:
Definition at line 245 of file des.c. |
| #define c2ln |
( |
c, |
|
|
l1, |
|
|
l2, |
|
|
n |
|
) |
|
|
|
|
Value: { \
c+=n; \
l1=l2=0; \
switch (n) { \
case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \
case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \
case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \
case 5: l2|=((DES_LONG)(*(--(c)))); \
case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \
case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \
case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \
case 1: l1|=((DES_LONG)(*(--(c)))); \
} \
}
Definition at line 253 of file des.c. |
| #define D_ENCRYPT |
( |
LL, |
|
|
R, |
|
|
S |
|
) |
|
|
|
|
Value:
Definition at line 325 of file des.c. |
|
|
Value: { \
DES_LONG tt; \
PERM_OP(l,r,tt, 1,0x55555555L); \
PERM_OP(r,l,tt, 8,0x00ff00ffL); \
PERM_OP(l,r,tt, 2,0x33333333L); \
PERM_OP(r,l,tt,16,0x0000ffffL); \
PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \
}
Definition at line 393 of file des.c. |
| #define HALF_ITERATIONS 8
|
|
| #define HPERM_OP |
( |
a, |
|
|
t, |
|
|
n, |
|
|
m |
|
) |
|
|
|
|
Value: ((t)=((((a)<<(16-(n)))^(a))&(m)),\
(a)=(a)^(t)^(t>>(16-(n))))
Definition at line 815 of file des.c. |
|
|
Value: { \
DES_LONG tt; \
PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \
PERM_OP(l,r,tt,16,0x0000ffffL); \
PERM_OP(r,l,tt, 2,0x33333333L); \
PERM_OP(l,r,tt, 8,0x00ff00ffL); \
PERM_OP(r,l,tt, 1,0x55555555L); \
}
Definition at line 383 of file des.c. |
|
|
Value: (*((c)++)=(unsigned char)(((l) )&0xff), \
*((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
*((c)++)=(unsigned char)(((l)>>16L)&0xff), \
*((c)++)=(unsigned char)(((l)>>24L)&0xff))
Definition at line 270 of file des.c. |
| #define l2cn |
( |
l1, |
|
|
l2, |
|
|
c, |
|
|
n |
|
) |
|
|
|
|
Value: { \
c+=n; \
switch (n) { \
case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
} \
}
Definition at line 296 of file des.c. |
|
|
Value: (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
*((c)++)=(unsigned char)(((l)>>16L)&0xff), \
*((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
*((c)++)=(unsigned char)(((l) )&0xff))
Definition at line 288 of file des.c. |
| #define LOAD_DATA |
( |
R, |
|
|
S, |
|
|
u, |
|
|
t, |
|
|
E0, |
|
|
E1, |
|
|
tmp |
|
) |
|
|
|
|
Value:
Definition at line 321 of file des.c. |
| #define LOAD_DATA_tmp |
( |
a, |
|
|
b, |
|
|
c, |
|
|
d, |
|
|
e, |
|
|
f |
|
) |
LOAD_DATA(a,b,c,d,e,f,g)
|
|
|
|
Value:
Definition at line 281 of file des.c. |
| #define PERM_OP |
( |
a, |
|
|
b, |
|
|
t, |
|
|
n, |
|
|
m |
|
) |
|
|
|
|
Value: ((t)=((((a)>>(n))^(b))&(m)),\
(b)^=(t),\
(a)^=((t)<<(n)))
Definition at line 379 of file des.c. |
| #define ROTATE |
( |
a, |
|
|
n |
|
) |
(((a)>>(n))+((a)<<(32-(n))))
|
|
Function Documentation
| void cipher_3des_cbc |
( |
unsigned char * |
text, |
|
|
int |
text_len, |
|
|
unsigned char * |
key, |
|
|
unsigned char * |
iv, |
|
|
int |
mode, |
|
|
unsigned char * |
output |
|
) |
|
|
|
|
3DES-CBC function calculates a digest from a given data buffer and a given key.
- Parameters:
-
| text | pointer to input data |
| text_len | length of input data |
| key | pointer to encryption key (192 bits) |
| iv | initialization vector |
| mode | defines whether encryption or decryption should be performed |
| output | en- or decrypted input data |
- Returns:
- void
Definition at line 1067 of file des.c. |
| void DES_cbc_encrypt |
( |
const unsigned char * |
input, |
|
|
unsigned char * |
output, |
|
|
long |
length, |
|
|
DES_key_schedule * |
schedule, |
|
|
DES_cblock * |
ivec, |
|
|
int |
enc |
|
) |
|
|
| void DES_ncbc_encrypt |
( |
const unsigned char * |
input, |
|
|
unsigned char * |
output, |
|
|
long |
length, |
|
|
DES_key_schedule * |
schedule, |
|
|
DES_cblock * |
ivec, |
|
|
int |
enc |
|
) |
|
|
Variable Documentation
const DES_LONG des_skb[8][64] [static]
|
|
|
|
Definition at line 61 of file des.c. |
|
|
Initial value: {
1, 1, 2, 2, 4, 4, 7, 7, 8, 8, 11, 11, 13, 13, 14, 14,
16, 16, 19, 19, 21, 21, 22, 22, 25, 25, 26, 26, 28, 28, 31, 31,
32, 32, 35, 35, 37, 37, 38, 38, 41, 41, 42, 42, 44, 44, 47, 47,
49, 49, 50, 50, 52, 52, 55, 55, 56, 56, 59, 59, 61, 61, 62, 62,
64, 64, 67, 67, 69, 69, 70, 70, 73, 73, 74, 74, 76, 76, 79, 79,
81, 81, 82, 82, 84, 84, 87, 87, 88, 88, 91, 91, 93, 93, 94, 94,
97, 97, 98, 98,100,100,103,103,104,104,107,107,109,109,110,110,
112,112,115,115,117,117,118,118,121,121,122,122,124,124,127,127,
128,128,131,131,133,133,134,134,137,137,138,138,140,140,143,143,
145,145,146,146,148,148,151,151,152,152,155,155,157,157,158,158,
161,161,162,162,164,164,167,167,168,168,171,171,173,173,174,174,
176,176,179,179,181,181,182,182,185,185,186,186,188,188,191,191,
193,193,194,194,196,196,199,199,200,200,203,203,205,205,206,206,
208,208,211,211,213,213,214,214,217,217,218,218,220,220,223,223,
224,224,227,227,229,229,230,230,233,233,234,234,236,236,239,239,
241,241,242,242,244,244,247,247,248,248,251,251,253,253,254,254}
Definition at line 725 of file des.c. |
|
|
Initial value: {
{0x01,0x01,0x01,0x01,0x01,0x01,0x01,0x01},
{0xFE,0xFE,0xFE,0xFE,0xFE,0xFE,0xFE,0xFE},
{0x1F,0x1F,0x1F,0x1F,0x0E,0x0E,0x0E,0x0E},
{0xE0,0xE0,0xE0,0xE0,0xF1,0xF1,0xF1,0xF1},
{0x01,0xFE,0x01,0xFE,0x01,0xFE,0x01,0xFE},
{0xFE,0x01,0xFE,0x01,0xFE,0x01,0xFE,0x01},
{0x1F,0xE0,0x1F,0xE0,0x0E,0xF1,0x0E,0xF1},
{0xE0,0x1F,0xE0,0x1F,0xF1,0x0E,0xF1,0x0E},
{0x01,0xE0,0x01,0xE0,0x01,0xF1,0x01,0xF1},
{0xE0,0x01,0xE0,0x01,0xF1,0x01,0xF1,0x01},
{0x1F,0xFE,0x1F,0xFE,0x0E,0xFE,0x0E,0xFE},
{0xFE,0x1F,0xFE,0x1F,0xFE,0x0E,0xFE,0x0E},
{0x01,0x1F,0x01,0x1F,0x01,0x0E,0x01,0x0E},
{0x1F,0x01,0x1F,0x01,0x0E,0x01,0x0E,0x01},
{0xE0,0xFE,0xE0,0xFE,0xF1,0xFE,0xF1,0xFE},
{0xFE,0xE0,0xFE,0xE0,0xFE,0xF1,0xFE,0xF1}}
Definition at line 773 of file des.c. |
|


The Earth currently is experiencing massive deforestation.
It is estimated that 15.3 billion trees are chopped down every year.
Latvia currently isn't experiencing deforestation, but considering the rapidly
changing the world economic situation, it could soon become a major ecological problem in Latvia as well!
This simulation allows you to see how changing certain parameters can affect how trees decrease or increase!
The simulation contains in total of 9 parameters, with 13 sliders that you can change.
It graphs 3 kinds of trees - Birch, Pine, and Spruce. The white colour in the graph is a birch tree, the brown colour is the pine tree and the green colour is a spruce tree.
There are 5 parameters, which can only be changed when the simulation is started and these do not change throughout the whole simulation.
The forest is calculated as a circle, so we request "Forest radius" from the user, and with "Trees per square meter" we calculate the number of trees in the circle.
Three parameters - "Spruce tree", "Pine tree", "Birch tree" - allows the user to decide how many trees of each kind are in the forest.
There are 4 parameters, which the user can change at any time. The four parameters are called - "Paper tons per day", "Energy per day", "Hectares per day", "Regrow stumps per day"
- these parameters can be set either to have or not to have a range of values. "Paper tons per day" calculate how much paper gets produced in a day. For each ton of paper, 24 trees are cut down.
The paper industry uses the 3 kinds of trees, so we have a function, that randomly decides how much of the total trees that are cut down is each kind.
"Energy per day" uses a bit harder calculation, because we have to calculate how many trees are used for one MWh and we have to divide the petajoules to get MWh.
Again, the energy industry uses all kinds of trees, so we remove randomly from the 3 kinds of trees we have made.
"Hectares per day" is a parameter, that simulates farmland, we know that 1 hectare is 10000m² so we can just times it by "Trees per square meter" and we know, how many trees we remove for each hectare.
"Regrow stumps per day" allows the user to select % of the trees that get regrown in a day. We regrow the cutdown trees, so the user cannot have more trees at the end than the simulation started with.


--- title: "Wild Reads 2020" layout: featured header-bg: custom-bg-corporate-green featured-hero-description: '
Wild Reads is a partnership project with Suffolk Wildlife Trust celebrating the connection between the natural world and the written word.
' featured-hero-image: "featured/featured-wild-reads-logo.jpg" featured-hero-alt: "Wild Reads logo" breadcrumb: events ---The Wild Reads booklist has inspired a programme of events at reserves, libraries and other wild places across the county. You can also join in the conversation online using #WildReads2020.
The Wild Reads collections are based at Bury St Edmunds and Lowestoft libraries or you can reserve a copy to be delivered to your nearest branch.
The autumn of 1933 is the most beautiful Edie Mather can remember. In the fields and villages around her beloved Wych Farm, however, the Great War still casts a shadow over a community impoverished by economic depression and threatened by change. Change, too, is coming to Edie, who at fourteen must soon face the unsettling pressures of adulthood.
Glamorous outsider Constance FitzAllen arrives from London to document fading rural traditions and beliefs, urging all who will listen to resist progress and return to the old ways - but some wonder whether there might be more to the older woman than meets the eye. As harvest approaches and the future of Wych Farm itself grows uncertain, Edie must somehow find a way to trust her instincts and save herself from disaster.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=2518581" link-text="Reserve All Among the Barley from our catalogue →" link-color="custom-corporate-green" link-hover-color="custom-corporate-green" %} {% include z-bar.html src="featured/featured-the-peace-of-wild-things.jpg" alt="The Peace of Wild Things" layout-reverse="true" color="white" bg-color="custom-bg-corporate-green" title='The Peace of Wild Things and other poems, by Wendell Berry' text="If you stop and look around you, you'll start to see. Tall marigolds darkening. A spring wind blowing. The woods awake with sound. On the wooden porch, your love smiling. Dew-wet red berries in a cup. On the hills, the beginnings of green, clover and grass to be pasture. The fowls singing and then settling for the night. Bright, silent, thousands of stars. You come into the peace of simple things.
Tender and intimate, these poems are consoling songs of hope and of healing; short, simple meditations on love, death, friendship, memory and belonging. They celebrate and elevate what is sensuous about life, and invite us to pause and appreciate what is good in life, to stop and savour our fleeting moments of earthly enjoyment. And, when fear for the future keeps us awake at night, to come into the peace of wild things.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=2316018" link-text="Reserve The Peace of Wild Things from our catalogue →" link-color="white" link-hover-color="white" %} {% include z-bar.html src="featured/featured-the-wild-places.jpg" alt="The Wild Places" bg-color="bg-near-white" title='The Wild Places, by Robert Macfarlane' text="Macfarlane embarks on a series of journeys in search of the wildness that remains in the British Isles. At once a wonder voyage, an adventure story and a work of natural history, this text also tells a story of friendship and loss, mixing history, memory and landscape in a strange evocation of wildness and its importance.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=2310065" link-text="Reserve The Wild Places from our catalogue →" link-color="custom-corporate-green" link-hover-color="custom-corporate-green" %} {% include z-bar.html src="featured/featured-nature-cure.jpg" alt="Nature Cure" layout-reverse="true" color="white" bg-color="custom-bg-corporate-green" title='Nature Cure, by Richard Mabey' text="In the last year of the old millennium, Richard Mabey, Britain's foremost nature writer, fell into a severe depression. The natural world – which since childhood had been a source of joy and inspiration for him – became meaningless.
Then, cared for by friends, he moved to East Anglia and he started to write again. Having left the cosseting woods of the Chiltern hills for the open flatlands of Norfolk, Richard Mabey found exhilaration in discovering a whole new landscape and gained fresh insights into our place in nature.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=1891852" link-text="Reserve Nature Cure from our catalogue →" link-color="white" link-hover-color="white" %} {% include z-bar.html src="featured/featured-notes-from-walnut-tree-farm.jpg" alt="Notes from Walnut Tree Farm" bg-color="bg-near-white" title='Notes from Walnut Tree Farm, by Roger Deakin' text="For the last six years of his life, Roger Deakin kept notebooks in which he wrote his daily thoughts, impressions, feelings and observations about and around his home, Walnut Tree Farm. Collected here are the very best of these writings, capturing his extraordinary, restless curiosity about nature as well as his impressions of our changing world.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=46855" link-text="Reserve Notes from Walnut Tree Farm from our catalogue →" link-color="custom-corporate-green" link-hover-color="custom-corporate-green" %} {% include z-bar.html src="featured/featured-thinking-on-my-feet.jpg" alt="Thinking on My Feet" layout-reverse="true" color="white" bg-color="custom-bg-corporate-green" title='Thinking on My Feet: the small joy of putting one foot in front of another, by Kate Humble' text="Thinking on My Feet tells the story of Kate's walking year - shining a light on the benefits of this simple activity. Kate's inspiring narrative not only records her walks (and runs) throughout a single year, but also charts her feelings and impressions throughout - capturing the perspectives that only a journey on foot allows - and shares the outcomes: a problem solved, a mood lifted, an idea or opportunity borne.
As she explores the reasons why we walk - whether for creative energy, challenge and pleasure, or therapeutic benefits, Kate's reflections and insights will encourage, motivate and spur readers into action. Also featured are Kate's walks with others who have discovered the magical, soothing effect of putting one foot in front of the other.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=2559046" link-text="Reserve Thinking on My Feet from our catalogue →" link-color="white" link-hover-color="white" %} {% include z-bar.html src="featured/featured-meadowland.jpg" alt="Meadowland" bg-color="bg-near-white" title='Meadowland: the private life of an English field, by John Lewis-Stempel' text="What really goes on in the long grass? Meadowland gives an unique and intimate account of an English meadow's life from January to December, together with its biography. In exquisite prose, John Lewis-Stempel records the passage of the seasons from cowslips in spring to the hay-cutting of summer and grazing in autumn, and includes the biographies of the animals that inhabit the grass and the soil beneath: the badger clan, the fox family, the rabbit warren, the skylark brood, the curlew pair, among others. Their births, lives, and deaths are stories that thread through the book from first page to last.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=1723543" link-text="Reserve Meadowland from our catalogue →" link-color="custom-corporate-green" link-hover-color="custom-corporate-green" %} {% include z-bar.html src="featured/featured-the-overstory.jpg" alt="The Overstory" layout-reverse="true" color="white" bg-color="custom-bg-corporate-green" title='The Overstory, by Richard Powers' text="Nine strangers, each in different ways, become summoned by trees, brought together in a last stand to save the continent's few remaining acres of virgin forest. The Overstory unfolds in concentric rings of interlocking fable, ranging from antebellum New York to the late-20th-century Timber Wars of the Pacific Northwest and beyond, revealing a world alongside our own - vast, slow, resourceful, magnificently inventive, and almost invisible to us. This is the story of a handful of people who learn how to see that world, and who are drawn up into its unfolding catastrophe.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=2537501" link-text="Reserve The Overstory from our catalogue →" link-color="white" link-hover-color="white" %} {% include z-bar.html src="featured/featured-the-salt-path.jpg" alt="The Salt Path" bg-color="bg-near-white" title='The Salt Path, by Raynor Winn' text="In one devastating week, Raynor and her husband Moth lost their home of 20 years, just as a terminal diagnosis took away their future together. With nowhere else to go, they decided to walk the South West Coast Path: a 630-mile sea-swept trail from Somerset to Dorset, via Devon and Cornwall. This ancient, wind-battered landscape strips them of every comfort they had previously known.
With very little money for food or shelter, Raynor and Moth carry everything on their backs and wild camp on beaches and clifftops. But slowly, with every step, every encounter, and every test along the way, the walk sets them on a remarkable journey. They don't know how far they will travel, but - to their surprise - they find themselves on a path to freedom.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=2501053" link-text="Reserve The Salt Path from our catalogue →" link-color="custom-corporate-green" link-hover-color="custom-corporate-green" %} {% include z-bar.html src="featured/featured-wilding.jpg" alt="Wilding" layout-reverse="true" color="white" bg-color="custom-bg-corporate-green" title='Wilding: the return of nature to a British farm, by Isabella Tree' text="Forced to accept that intensive farming on the heavy clay of their land at Knepp, West Sussex, was economically unsustainable, Isabella Tree and her husband Charlie Burrell made a spectacular leap of faith: they decided to step back and let nature take over. Thanks to the introduction of free-roaming cattle, ponies, pigs and deer – proxies of the large animals that once roamed Britain – the 3,500 acre project has seen extraordinary increases in wildlife numbers and diversity in little over a decade.
Extremely rare species, including turtle doves, nightingales, peregrine falcons, lesser spotted woodpeckers and purple emperor butterflies, are now breeding at Knepp, and populations of other species are rocketing. The Burrells’ degraded agricultural land has become a functioning ecosystem again, heaving with life – all by itself.
" link="https://suffolk.spydus.co.uk/cgi-bin/spydus.exe/ENQ/OPAC/BIBENQ?BRN=2536369" link-text="Reserve Wilding from our catalogue →" link-color="white" link-hover-color="white" %}


The label-correction algorithm is a generalization which includes very common graph search algorithms like breadth first search (BFS), depth first search (DFS), A*, Dijkstra's algorithm and Branch and bound as special cases.
Pseudocode
Explanation:
First if
: The left hand side is a lower bound to get from start to
v
, to c
and then to t
. If this lower bound is not lower than
either u
or the distance to c
directly, then it will not be part
of the optimal solution.
Special cases:
- Depth-first search: K is a stack (LIFO list)
- Breadth-first search: K is a queue (FIFO list)
- Dijkstra's algorithm: K is priority queue
- A*: K ist priority queue, \(h_j\) is non-trivial
- Branch and bound: K ist priority queue, \(h_j\) and \(m_j\) are non-trivial
Python
#!/usr/bin/env python
"""Label Correction algorithm."""
import logging
import sys
logging.basicConfig(
format="%(asctime)s %(levelname)s %(message)s",
level=logging.DEBUG,
stream=sys.stdout,
)
class LIFO(list):
"""A LIFO storage."""
def insert(self, el):
self.append(el)
class Graph(object):
"""An undirected graph."""
def __init__(self):
self.nodes = []
self.edges = []
self.name2index = {}
self.index2name = {}
self.neighbors = []
def add_node(self, name=None):
"""Add a new node and return its index."""
node_index = len(self.nodes)
if name.startswith("index-"):
logging.warning('Node names beginning with "index-" may cause ' "problems.")
if name is None:
name = "index-%i" % node_index
self.nodes.append(node_index)
self.name2index[name] = node_index
self.index2name[node_index] = name
# Add weight from new node to other nodes and vice-versa
self.edges.append([])
for n1 in self.nodes:
self.edges[node_index].append(float("inf"))
if n1 != node_index:
self.edges[n1].append(float("inf"))
# From the node to itself has distance 0
self.edges[node_index][node_index] = 0
self.neighbors.append([])
return node_index
def get_node_index(self, name):
"""Get node index by name."""
return self.name2index[name]
def set_edge_by_name(self, a, b, weight):
"""
Set edge weight by node names.
Parameters
----------
a : str
First edge name
b : str
Second edge name
weight : number
New edge weight
"""
i1 = self.get_node_index(a)
i2 = self.get_node_index(b)
self.edges[i1][i2] = weight
self.edges[i2][i1] = weight
self.neighbors[i1].append(i2)
self.neighbors[i2].append(i1)
def label_correction(graph, start_node, t, h=None, m=None, K=None):
"""
Label correction algorithm for graph searches.
Parameters
----------
graph :
Needs 'graph.childs' which returns a list of child indices for each
node, 'graph.edges[node1][node2]' which always returns an edge weight,
start_node : int
Index of start node as given by the graph node iterator
t : int
Index of target node as given by the graph node iterator
h : lower_heuristic, optional
Takes (graph, node1, node2) and returns a number which underestimates
the distance from node1 to node2. If this is not given, the trivial
distance 0 is chosen.
m : upper_heuristic, optional
K : list-like data structure, optional
Needs 'insert', 'pop'
"""
if h is None:
h = lambda g, n1, n2: 0.0
if m is None:
m = lambda g, n1, n2: float("inf")
if K is None:
K = LIFO()
d = []
parents = []
for node in graph.nodes:
d.append(float("inf"))
parents.append(None)
d[start_node] = 0
u = float("inf") # shortest distance from start_node to t
K.append(start_node)
while len(K) > 0:
logging.info("K=%s" % str(K))
v = K.pop()
for c in graph.neighbors[v]:
if d[v] + graph.edges[v][c] + h(graph, c, t) < min(d[c], u):
d[c] = d[v] + graph.edges[v][c]
parents[c] = v
if c != t and c not in K:
K.insert(c)
if c == t:
u = d[v] + graph.edges[v][t]
u = min(u, d[c] + m(graph, c, t))
# Reconstruct the path
path, named_path = [], []
current = t
while current != start_node:
path.append(current)
named_path.append(graph.index2name[current])
current = parents[current]
path.append(current)
named_path.append(graph.index2name[current])
return {"shortest_distance": u, "path": path[::-1], "named_path": named_path[::-1]}
def sample_1():
"""A simple search problem."""
g = Graph()
for i in range(13):
g.add_node(name=chr(ord("A") + i))
g.set_edge_by_name("A", "B", 1)
g.set_edge_by_name("A", "C", 1)
g.set_edge_by_name("B", "D", 1)
g.set_edge_by_name("B", "E", 1)
g.set_edge_by_name("C", "F", 1)
g.set_edge_by_name("C", "G", 1)
g.set_edge_by_name("D", "H", 1)
g.set_edge_by_name("D", "I", 1)
g.set_edge_by_name("E", "J", 1)
g.set_edge_by_name("G", "K", 1)
g.set_edge_by_name("H", "L", 1)
g.set_edge_by_name("J", "M", 1)
i1 = g.get_node_index("A")
i2 = g.get_node_index("F")
ret = label_correction(g, i1, i2)
print(ret)
if __name__ == "__main__":
sample_1()


Widgetpack
A set of misc. UI widgets and styles.
They work well on their own, or as a complement to the very popular Bootstrap framework.


from flickr.models import FlickrUser, Photo, PhotoSet, Collection
Every model (except FlickrUser) is based on FlickrModel
class FlickrModel(models.Model):
flickr_id = models.CharField(unique=True, db_index=True, max_length=50)
user = models.ForeignKey(FlickrUser)
show = models.BooleanField(default=True) #show the photo on your page?
last_sync = models.DateTimeField(auto_now=True, auto_now_add=True)
class Meta:
abstract = True
Every object belongs to a FlickrUser which is mapped to a Django User
class FlickrUser(models.Model):
user = models.OneToOneField(User)
flickr_id = models.CharField(max_length=50, null=True, blank=True)
nsid = models.CharField(max_length=32, null=True, blank=True)
# ---- / more fields / -----
token = models.CharField(max_length=128, null=True, blank=True) # authed
perms = models.CharField(max_length=32, null=True, blank=True) # flickr permissions
last_sync = models.DateTimeField(auto_now=True, auto_now_add=True)
# all photos
Photo.objects.all()
# only public photos
Photo.objects.public()
# only the ones with show=True
#(default True, you can hide photos from viewing on your website by setting it False
Photo.objects.visible()
Accessing properties of each photo is independent of the way you used to sync them (check options in Management Commands), although some attributes may not be available if you didn’t sync your photos with the corresponding options. The syntax is always the same:
(photo_object).(size_label).(property)
size_label - square: Square (75 x 75 pixels)
- largesquare: Large Square (150 x 150 pixels)
- thumb: Thumbnail (100 px on longest side)
- small: Small (240 px on longest side)
- small320: Small 320 (320 px on longest side)
- medium: Medium (500 px on longest side)
- medium640: Medium 640 (640 px on longest side)
- medium800: Medium 800 (800 px on longest side)
- large: Large (1024 px on longest side)
- large1600: Large 1600 (1600 px on longest side)
- large2048: Large 2048 (2048 px on longest side)
- ori: Original (original size)
property - source: url to image source.
- url: url to web page.
- width: width in pixels.
- height: height in pixels.
Photo source and photo url web page are either retrieved from the synced data in the database (if --sizes option was used) or dynamically generated (according to Flickr docs, so this will always return a valid url for all web sizes (see issue #20).
p = Photo.objects.get(id=123)
p.large.source # Image source url for large size.
p.square.source # source url for square image (75x75)...
Special sizes large 1600 and large 2048 are only available if used --sizes option while syncing and original will only be available for flickr pro accounts.
p.ori.url # Url to web page for ori image.
p.large2048.url # Url to web page for ori image.
Photo width and height will only be available if flickr_sync was called with the --sizes option.
p.ori.height # Height of the original photo
p.medium640.width # Width for medium 640 size.
p = Photo.objects.get(id=123)
p.get_next() # next photo in order like on Flickr
p.get_prev() # previous photo
# link to the Flickr page. Works with every supported object: FlickrUser, Photo, Photoset, Collection.
p.flickr_page_url
photoset = Photoset.objects.get(id=123)
photo = Photo.objects.get(id=456)
photo.get_next_in_photoset(photoset)
photo.get_previous_in_photoset(photoset)
photoset.cover() # returns the cover Photo
c = Collection.objects.get(id=123)
c.parent # if collection is nested
c.sets.all() # sets in this collection
c.icon # the collage picture you see on Flickr


| PWG Tokyo Meeting Details |
PWG/PWG-C Plenary and Joint Meeting: April 3
IPP: April 4-5
UPDF: April 6
Shinjuku NS Bldg., 11th Floor .... map of the Shinjuku Area
- Keio Plaza Inter Continental Tokyo
Tel: +81-3-3344-0111 (1-800-222-KEIO)
Fax: +81-3-3345-8269
Epson negotiated rate approximately $150
Map: http://www.keioplaza.co.jp/english/general/location/index.htm- Park Hyatt Hotel
Tel: +81-3-5322-1234 (1-800-233-1234)
Fax: +81-3-5322-1288- Century Hyatt Tokyo
Tel: +81-3-3349-0111 (1-800-233-1234)
Fax: +81-3-3344-5575- Tokyo Hilton Shinjuku
Tel: +81-3-3344-5111
Fax: +81-3-3342-6094
Rate: approximately $210
Map: http://www.hilton.com/hotels/TYOHITW/map.html- Shinjuku Prince
Tel: +81-3-3205-1111 (1-800-542-8686)
Fax: +81-3-3205-1952- Shinjuku Washington Hotel
Tel: +81-3-3343-3111
Fax: +81-3-3342-2575
All attendees are responsible for making their own hotel reservations.


PHOTOS: White Rock marks Remembrance Day
by Aaron HinksHundreds of people gathered in White Rock today to remember the ultimate sacrifice brave men and women made in the fight for our country.
This year’s Remembrance Day ceremony follows a major ceremony in France earlier this year marking the 75th anniversary of D-Day, when thousands of Canadian stormed the beaches of Normandy with their British and American allies to fight Nazi Germany.
It also comes exactly 101 years to the day after the end of the First World War.


pdfjam-pocketmod(1) pdfjam-pocketmod(1) NAME pdfjam-pocketmod - make an 8-page PDF document into a pocket-sized book‐ let SYNOPSIS pdfjam-pocketmod SRC [PAGESPEC] [OPTION [OPTION] ...] DESCRIPTION pdfjam-pocketmod converts 8 pages of a PDF file into a single 8-up page, with pages ordered and oriented for folding into pocket-sized booklet ( as described at http://repocketmod.com/ ). SRC must be a regular PDF file (not /dev/stdin). If PAGESPEC is omitted, the first 8 pages are processed. OPTION is any option to pdfjam(1) other than --batch. pdfjam-pocketmod is a simple wrapper for pdfjam, which provides a front end to some of the capabilities of the pdfpages package for pdflatex. A working installation of pdflatex, with the pdfpages package, is required. pdfjam-pocketmod is part of the "PDFjam" package of tools, whose homepage is at http://go.warwick.ac.uk/pdfjam . SETUP See http://go.warwick.ac.uk/pdfjam . USAGE For the available options and site/user defaults, see the output of pdfjam --help For further information and some examples see http://go.war‐ wick.ac.uk/pdfjam . LIMITATIONS AND BUGS pdfjam-pocketmod does not work with encrypted PDF files, and does not preserve hyperlinks. The '--keepinfo' option does not work. Please report bugs! See the website at http://www.warwick.ac.uk/go/pdf‐ jam. LICENSE PDFjam is distributed under the GNU public license. SEE ALSO pdfjam(1). AUTHOR pdfjam-pocketmod is written and maintained by David Firth as part of the PDFjam package. 10 March 2010 pdfjam-pocketmod(1)


|
Elite Insights JSON
<IP_ADDRESS>
Start your reading with the JsonLog class. The documentation is in Camel Case, as dictated by C# conventions, the generated json will be in Pascal Case
|
Public Member Functions | |
| JsonStatsAll (Statistics.FinalStatsAll stats) | |
| Public Member Functions inherited from LuckParser.Builders.JsonModels.JsonStatistics.JsonStats | |
| JsonStats (Statistics.FinalStats stats) | |
| JsonStats (Statistics.FinalStatsAll stats) | |
Public Attributes | |
| int | Wasted |
| Number of time you interrupted your cast More... | |
| double | TimeWasted |
| Time wasted by interrupting your cast More... | |
| int | Saved |
| Number of time you skipped an aftercast More... | |
| double | TimeSaved |
| Time saved while skipping aftercast More... | |
| double | StackDist |
| Distance to the epicenter of the squad More... | |
| double | AvgBoons |
| Average amount of boons More... | |
| double | AvgActiveBoons |
| Average amount of boons over active time More... | |
| double | AvgConditions |
| Average amount of conditions More... | |
| double | AvgActiveConditions |
| Average amount of conditions over active time More... | |
| int | SwapCount |
| Number of time a weapon swap happened More... | |
| Public Attributes inherited from LuckParser.Builders.JsonModels.JsonStatistics.JsonStats | |
| int | DirectDamageCount |
| Number of direct damage hit More... | |
| int | CritableDirectDamageCount |
| Number of critable hit More... | |
| int | CriticalRate |
| Number of crit More... | |
| int | CriticalDmg |
| Total critical damage More... | |
| int | FlankingRate |
| Number of hits while flanking More... | |
| int | GlanceRate |
| Number of glanced hits More... | |
| int | Missed |
| Number of missed hits More... | |
| int | Interrupts |
| Number of hits that interrupted a skill More... | |
| int | Invulned |
| Number of hits against invulnerable targets More... | |
Definition at line 230 of file JsonStatistics.cs.
| double LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.AvgActiveBoons |
Average amount of boons over active time
Definition at line 259 of file JsonStatistics.cs.
| double LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.AvgActiveConditions |
Average amount of conditions over active time
Definition at line 267 of file JsonStatistics.cs.
| double LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.AvgBoons |
Average amount of boons
Definition at line 255 of file JsonStatistics.cs.
| double LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.AvgConditions |
Average amount of conditions
Definition at line 263 of file JsonStatistics.cs.
| int LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.Saved |
Number of time you skipped an aftercast
Definition at line 243 of file JsonStatistics.cs.
| double LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.StackDist |
Distance to the epicenter of the squad
Definition at line 251 of file JsonStatistics.cs.
| int LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.SwapCount |
Number of time a weapon swap happened
Definition at line 271 of file JsonStatistics.cs.
| double LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.TimeSaved |
Time saved while skipping aftercast
Definition at line 247 of file JsonStatistics.cs.
| double LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.TimeWasted |
Time wasted by interrupting your cast
Definition at line 239 of file JsonStatistics.cs.
| int LuckParser.Builders.JsonModels.JsonStatistics.JsonStatsAll.Wasted |
Number of time you interrupted your cast
Definition at line 235 of file JsonStatistics.cs.


My Position
Wind speed
Wind direction
Min temp
Max temp
Humidity
Pressure
Wind speed
Wind direction
Min temp
Max temp
Humidity
Pressure
Wind speed
Wind direction
Min temp
Max temp
Humidity
Pressure


File: lib/commands/marionette/frame.js
/*! * * Copyright (c) 2013 Sebastian Golasch * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included * in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER * DEALINGS IN THE SOFTWARE. * */ 'use strict'; /** * Frame related Marionette commands * see [JsonProtocol](https://wiki.mozilla.org/Auto-tools/Projects/Marionette/JSON_Protocol) * * @module FirefoxDriver * @class Frame * @namespace FirefoxDriver.Commands.Marionette */ module.exports = function (Marionette) { /** * Change focus to another frame on the page. * If the frame id is null, the server should switch to the page's default content. * * @method frame */ Marionette.addCommand({ name: 'frame', request: { to: ':marionetteId', session: ':sessionId', name: 'switchToFrame', parameters: { element: ':elementId', focus: true } } }); };


[cr6]
[cr4]
[errorMessage]
Installation Complete!
[notes]
Installation Failed!
[errorMessage]
WARNING!
Could not create the database. Please check your database settings and make any
necessary corrections. Some database hosts do not allow users to directly create
new databases. You may need to contact your hosting provider to learn how to set
up a new database. If you have questions about this, or anytyhing else regarding
Program O, please visit the forums at www.program-o.com
Please note that all fields are required, but some are already filled out with generic, default
values.
For more detailed information with this page, please see the Help Page, or
click the help icon for an individual field.
The configuration for both the bot and the database are complete,
but you now need to upload your bot's AIML categories. Please log into the
Admin Page to complete the process.
NOTE:
If you wish to use a different account
for your Program O Admin user, then you will need to edit the configuration
file manually. If you have any questions about this, or anything else about
Program O, please visit the forums at
http://forum.program-o.com.


Library: Algorithms
Function
An algorithm that finds the first adjacent pair of equivalent elements in a sequence
#include <algorithm> namespace std { template <class ForwardIterator> ForwardIterator adjacent_find(ForwardIterator start, ForwardIterator finish); template <class ForwardIterator, class BinaryPredicate> ForwardIterator adjacent_find(ForwardIterator start,
ForwardIterator finish, BinaryPredicate binary_pred); }
There are two variations of the adjacent_find() algorithm. The first finds equal adjacent elements in the sequence defined by iterators start and finish and returns an iterator i pointing to the first of the equal elements. The second variation lets you specify a binary function object to test for a condition. The algorithm returns an iterator i pointing to the first of the pair of elements that meet the conditions of the binary function. In other words, adjacent_find() returns the first iterator i where both i and i + 1 are in the range [start, finish) that meets one of the following conditions:
*i == *(i + 1)
or
binary_pred(*i,*(i + 1)) == true
If adjacent_find() does not find a match, it returns finish.
adjacent_find() performs exactly find(start,finish,value) - start applications of the corresponding predicate.
// // find.cpp // #include <vector> // for vector #include <algorithm> // for adjacent_find, find #include <functional> // for bind1st, equal_to #include <iostream> // for cout, endl int main () { // Typedef for convenience. typedef std::vector<int, std::allocator<int> > Vector; const Vector::value_type arr[] = { 0, 1, 2, 2, 3, 4, 2, 2, 6, 7 }; // Set up a vector. const Vector v1 (arr, arr + sizeof arr / sizeof *arr); // Try find. Vector::const_iterator it = std::find (v1.begin (), v1.end (), 3); std::cout << *it << ' '; // Try find_if. it = std::find_if (v1.begin (), v1.end (), std::bind1st (std::equal_to<Vector::value_type>(), 3)); std::cout << *it << ' '; // Try both adjacent_find variants. it = std::adjacent_find (v1.begin (), v1.end ()); std::cout << *it << ' '; it = std::adjacent_find (v1.begin (), v1.end (), std::equal_to<Vector::value_type>()); std::cout << *it << std::endl; return 0; } Program Output:
3 3 2 2
ISO/IEC 14882:1998 -- International Standard for Information Systems -- Programming Language C++, Section 25.1.5


--- title: Website uptime monitoring the efficient way description: Free Website Monitoring. Be notified when your site is down. published: true ---
✎ Manage Staff members


Your role: Intelligence Analyst
Your mission: New intelligence information shows increased activity among potential terror groups. Your role is to uncover the details of a fictitious terror plot. You will receive intelligence information in the form of a series of sentences that will help you uncover the details of the terror plot.
Be on the lookout for four types of information:
Once you have used this information to piece together the “who”, “what”, “where”, and “when” of the attack, select your answers from provided dropdown menus.
The sentences you are shown may contain highlighting that has been automatically generated and is intended to help you extract relevant information. While it is intended to be helpful, the highlighting may not be entirely correct.
Please work as quickly as you can without sacrificing accuracy.  You will be presented with a total of two scenarios. Feel free to take a break after submitting your answers for one scenario and before beginning the next one.
Before the experiment begins, you will be shown two training scenarios. The first will not contain any highlighting. The second will contain automatically generated highlighting intended to help you extract relevant information.


Chris' interest continued unabated throughout high school and university. Graduating with distinction in Industrial Design from Carleton University in Ottawa in 1986, Chris decided to pursue his dream of becoming a full-time professional magician.
The magic and the illusions - many of which are Chris Pathsworth originals - are performed expertly and intelligently. Ardently professional, Chris' exacting standards strongly reflect his formal training in design.
Chris Pathsworth's magic is guaranteed to captivate. His shows combine a unique and varied repertoire with a warm, humorous style. And the special rapport that he builds with his audience creates many magical moments. Chris' performances can be tailored for the individual occasion, particular age group or audience interest. Well-known and respected throughout Ontario, Chris is called back by his clients year after year.
A thousand and one details underlie performances of magic and illusion and they are all approached in the same way - with expert attention to every element. Clients appreciate and count on this approach. It's why Chris is in constant demand.
When I was 12 years old, I attended a magic show at the National Arts Centre, called The World Festival of Magic and Witchcraft. The show was so fascinating it quite bewitched me, and I left with an intense desire to learn all I could about magic. I began right away and, over the next few years as I went through high school and university, I continued to be absorbed by the many facets of magic. This fascination developed into a firm resolve to become a professional magician.
My local library was a prime source of books on the subject and I also found catalogues for buying tricks through the mail. I practiced every day until I could put on shows for my family and friends. Before long, I was able to charge the grand fee of $5 a time to entertain at friends' birthday parties. And I reinvested the money I earned into new magic books and tricks.
Since 1987. Even though I attended Carleton University to obtain a degree in industrial design (graduating with distinction), I couldn't envision a career doing anything else but magic. In fact, taking the design course has helped me enormously over the years with the props and illusions I create, especially in my theatre work.
Over 4000 shows, which include corporate events and private functions as well as theatre shows, which means I have entertained over a quarter of a million people.
Theatre was the next natural step in my career plan I really enjoy the environment of a theatre and entertaining such a large crowd of people at one time. Also, I have new ideas about the presentation of magic and illusions - combining them with music and dance and creating a dramatic story line, for example. I want to be known all over North America, and theatre performances put my name out further afield geographically.
Doug Henning was always a source of inspiration for me and I followed his career and style of magic avidly when he was alive. I was also very pleased to meet David Copperfield when I was president of the Ottawa Society of Magicians (I joined the International Brotherhood of Magicians in 1987.)
Because I perform full-time - I have no other career - I take magic very seriously and give a great deal of thought to how magic is presented. I enjoy developing new ideas and new approaches - creating illusions that have never been seen before and finding new ways to present them. Because magic is my full-time career, I have to run it as a business, and I pride myself on doing so professionally and with integrity.
I think every magician makes mistakes now and then. The thing is not to let the audience know that you have - and so spoil the magic for them. When you practice as much as I do, you know how to cover up minor mistakes.


This is the main primitive actually used. More...
#include <S3DTriangle.h>
Public Member Functions | |
| S3DTriangle (S3DPoint points[3]) | |
| Constructor for the triangle. | |
| S3DTriangle (S3DPoint a, S3DPoint b, S3DPoint c) | |
| Constructor for the triangle. | |
| void | move (double dx, double dy, double dz) |
| Moves the triangle (translates it) relative to its coordinates. | |
| void | rotate (double rx, double ry, double rz, S3DPoint *anchor=NULL) |
| Rotates the triangle around its center or another anchor point. | |
| void | scale (double fx, double fy, double fz, bool correction=true) |
| Scales the triangle. | |
| void | draw (S3DDevice *disp, S3DSurface window, S3DContext gc, S3DZBuffer *zbuffer) |
| Draws the triangle. | |
| void | setColor (unsigned long c) |
| Sets the color the triangle is drawn in. | |
| unsigned long | getColor () |
| Returns the color the triangle is drawn in. | |
| S3DPoint * | getPoints () |
| Returns an array of the points, the triangle is built upon. | |
| double | getZ () |
| Returns the z-coordinate for the center of the triangle. |
This is the main primitive actually used.
This is the mostly used primitive, because all complex primitives base upon triangles. It is platform-independent, because all drawing is done using S3DLine.
| S3DTriangle::S3DTriangle | ( | S3DPoint | points[3] | ) |
Constructor for the triangle.
| [in] | points | Array of three S3DPoints, marking the points, the triangle is made of. |
Constructs a new instance of S3Triangle based upon the points supplied.
Constructor for the triangle.
| [in] | a | First point, the triangle will be build upon. |
| [in] | b | Second point, the triangle will be build upon. |
| [in] | c | Third point, the triangle will be build upon. |
Constructs a new instance of S3Triangle based upon the points supplied.
| void S3DTriangle::draw | ( | S3DDevice * | disp, | |
| S3DSurface | window, | |||
| S3DContext | gc, | |||
| S3DZBuffer * | zbuffer | |||
| ) | [virtual] |
Draws the triangle.
| [in] | disp | The display device, the line will be drawn to |
| [in] | window | The surface, the line will be drawn to |
| [in] | gc | The context, the line will be drawn to |
| zbuffer | Pointer to the S3DZBuffer-Instance of the Simple3D-Instance. |
Draws the triangle by drawing the triangles it consists of. This method does NOT contain platform-specific calls anymore, because it uses the underlying triangles to draw the triangle. The meaning and neccessity of disp, window and gc may vary between different platforms
Implements S3DPrimitive.
| unsigned long S3DTriangle::getColor | ( | ) |
Returns the color the triangle is drawn in.
Reimplemented from S3DPrimitive.
| S3DPoint * S3DTriangle::getPoints | ( | ) |
Returns an array of the points, the triangle is built upon.
| double S3DTriangle::getZ | ( | ) | [virtual] |
Returns the z-coordinate for the center of the triangle.
This function is used for Z-Buffering and currently also for the painter's algorithm to determine the order in which the entities get drawn.
Implements S3DPrimitive.
| void S3DTriangle::move | ( | double | dx, | |
| double | dy, | |||
| double | dz | |||
| ) | [virtual] |
Moves the triangle (translates it) relative to its coordinates.
| [in] | dx | The distance the triangle is moved in x-direction |
| [in] | dy | The distance the triangle is moved in y-direction |
| [in] | dz | The distance the triangle is moved in z-direction |
Implements S3DPrimitive.
| void S3DTriangle::rotate | ( | double | rx, | |
| double | ry, | |||
| double | rz, | |||
| S3DPoint * | anchor = NULL | |||
| ) | [virtual] |
Rotates the triangle around its center or another anchor point.
| [in] | rx | The angle the triangle should be rotated around the x-axis |
| [in] | ry | The angle the triangle should be rotated around the y-axis |
| [in] | rz | The angle the triangle should be rotated around the z-axis |
| [in] | anchor | Optional. The point the triangle should be rotated around, instead of its own center. |
This function allows to rotate the triangle around all three axis in any angle. If no anchor-point is passed, the triangle will be rotated around its own center, else it will rotate around the given point.
Implements S3DPrimitive.
| void S3DTriangle::scale | ( | double | fx, | |
| double | fy, | |||
| double | fz, | |||
| bool | correction = true | |||
| ) |
Scales the triangle.
| [in] | fx | Scaling factor along the x-axis |
| [in] | fy | Scaling factor along the y-axis |
| [in] | fz | Scaling factor along the z-axis |
| [in] | correction | Should coordinate-correction take place? Default is true. |
This method scales the triangle according to the given factors internall, its also translated, to preserve its center's coordinates, when correction is set to true (default).
| void S3DTriangle::setColor | ( | unsigned long | c | ) |
Sets the color the triangle is drawn in.
| [in] | c | Color (unsigned long as produced by the RGB-macro) that will be used to draw the triangle. |
Reimplemented from S3DPrimitive.


How foul smell from bed solved a murder in Haryana's Bahadurgarh
Police in Bahadurgarh on Sunday recovered a semi-decomposed body of a married woman from her in-laws' house after neighbours complained of a foul smell emanating from the house.
by Manjeet SehgalHIGHLIGHTS
- Husband murders wife on son's birthday, dumps body inside bed
- Wife was living separately from husband from last five years
- The accused husband is on the run after the murder
A woman in Haryana's Bahadurgarh was murdered by her estranged husband when she was visiting her in-laws' place for her son's birthday. The couple was living separately for five years and police suspect the husband had planned the murder well in advance.
Police in Bahadurgarh on Sunday recovered a semi-decomposed body of a married woman from her in-laws' house after neighbours complained of a foul smell emanating from the house.
After receiving complaints about a foul smell coming from the residence of the deceased, police conducted a search of the house and found the woman's body stuffed inside the divan of a bed.
Police lodged a murder case against the woman's husband Rajveer based on a complaint by her brother Akshay.
They recovered the semi-decomposed body from inside the bed. A postmortem will be conducted on Monday.
"Forensic teams went to the house and recovered the body. There are strangulation marks on the deceased's neck and prima facie it appears that she was strangulated but more will be revealed by the postmortem report," said SHO Asauda Bir Singh.
According to deceased's brother Akshay, his sister Lalita, who hailed from Chauhan Joshi village of Sonipat, was married to Rajveer of Jasaurkhedi village of Bahadurgarh. She was living in Gurugram for the last five years because of a strained relationship with Rajveer.
Lalita was visiting her in-laws' house on November 22 to celebrate her son Nishant's birthday.
The murder seems to have been pre-planned by Rajveer who had sent his son and daughter to a relative's place before killing Lalita. He later dumped the body inside the bed.
Rajveer is on the run while police officials say he will be nabbed soon.


This is Jamie. Last year, scientists sent his sister, Jane, into space. He’s going out into space to find her. Will you help Jamie? Great!
Are you ready? 3 - 2 - 1 - BLASTOFF!
This is the surface of planet Zork. Ew! A yellow river of slime runs past a shiny rock swamp. Anyone up for a swim?
Planet Gibs has big, bushy mountains. They’re covered in croco bushes. Watch out, or you’ll get caught in the thorns!
Gnarled, tangled branches cover the surface of Cerfluffle.
Come explore the green forests on Skadow. It’s filled with giant leaves and grass. The grass is taller than you!
LOOK OUT!! AN ALIEN MONSTER!
Zargap is a crazy planet! You can slide down weird yellow hills and swing on vines. It’s like an alien playground!
On Planet Noop, there are rows of juice-filled pods. Try not to poke one, or the juice will spray all over you!
Beware of the poisonous trees on Jupos. If you drink the red sap, you will shrink! Think of the smallest thing in the world. You would become even smaller than that!
We are inside a factory on Krakel. This planet is full of factories, constantly buzzing with the sounds of machines at work. Can you think of something you use that was made in a factory?
Tercen is a beautiful planet, with icy purple mountains. Be careful not to slip, or you’ll slide into outer space!
The ground on Habry is freckled with crater-like holes. Watch your step!
Fluffy ridges line the surface of Yabobo. This is Jamie’s favorite planet. He can roll on the fuzzy grass, and he won’t get dirty!
On Graga, there is a sea monster inside a white, furry canyon! It has old, yellow teeth and hundreds of shiny, pink tongues!
Sludgy prunes grow inside orange caves on Slabie. Even though they look disgusting, they taste delicious! Can you think of something that looks gross but tastes great?
Pauloo is the hottest planet in this solar system. It’s so hot, the whole planet is bright red from the heat! What is something “red hot”?
There is a maze of blue columns on Crankalasuka. Be careful, Jamie! Don’t get lost!
Floofla is the prettiest planet in this solar system. A huge, yellow tree grows in the middle of a glittering pink lake. Which color do you like more, the sunny yellow or the sparkly pink? Look! There’s Jane! Jamie is so excited to see his sister again! Now that we’ve found her, we can head back to Earth!
Prepare to land! In 3 - 2 - 1… here we are!
Thanks for helping Jamie find his sister!


What is "good" performance?
Network requests are multi-threaded (several requests at once)
Rendering happens on a single main thread (though there are a few more for very specific tasks)
This cycle can be interrupted at any time, when a script changes the DOM or ruleset.
Labeled "JavaScript" in the diagram, this represents any programmatic change to the DOM or ruleset, of which JS is one of the most common concerns when optimizing. Initial load, CSS transforms and Web Animation API events can also kick off a rendering cycle.
The browser must calculate which styles should affect the new or updated elements. Selectors and other CSS performance factors come into play, here.
This step may or may not occur, depending on whether any updates to the element require its size or position to be recalculated. A layout pass will trigger a re-paint and re-composite and may also trigger reflow of child and sibling elements.
https://developers.google.com/web/updates/2017/01/css-gridFilling in pixels with text, images, colors, borders, etc. Paint will trigger a re-composite. This step might be skipped in favor of a composite-only, if the browser determines that neither a layout or a paint are required.
Check and re-draw elements that are displayed in the same spot or overlapping on the screen. Ensures that layers stack correctly.
Composite-only changes are the cheapest.
Visit: https://developers.google.com/web/tools/chrome-devtools/evaluate-performance/
Open the following in a Chrome Incognito window: https://googlechrome.github.io/devtools-samples/jank/


SEDANS
Choose a sedan for its affordability and excellent fuel economy. Ideal for cruising in the city or on your next road trip.
Learn MoreChoose a sedan for its affordability and excellent fuel economy. Ideal for cruising in the city or on your next road trip.
Learn MoreTake an SUV for its spacious interior, power, and versatility. Perfect for your next family vacation and off-road adventures.
Learn MoreCruise in the best car brands without the bloated prices. Enjoy the enhanced comfort of a luxury rental and arrive in style.
Learn More


{% extends 'pages/base.html' %} {% block content %}
jCourse is built to aid Jacobs University students choose courses by offering them acces to information that would otherwise be attained in a less comfortable way. jCourse uses data collected from CampusNet of Jacobs University Bremen. The data is collected from the course catalogue of academic year 2014 (this data is all public). Through jCourse we aim to offer a more convenient and accessible way of rating, reviewing and comparing courses.
jCourse at this stage is meant to help students choose their courses and help each-other. This is the testing phase of a platform with a wider set of functionalities at the core of which lies the facilitation of academic interaction


Issue: FUNCTION-DEFINITIONReferences: Issue FUNCTION-TYPE
Category: ADDITION
Edit history: 23-Jun-88, Version 1 by Pitman
09-Dec-88, Version 2 by GZ (change name, remove REQUIRED
option, specify first value to be a lambda, add to
discussion and current practice)
10-Feb-89, Version 3, as amended Jan 89 X3J13
Problem Description:
There are portable ways to turn symbols and lists into functions,
but there are no portable ways to get back the original symbols and
lists given the functions.
In many cases, it used to be possible to recover the lambda expression
after a DEFUN by using FUNCTION or SYMBOL-FUNCTION, but the passage of
FUNCTION-TYPE will make this no longer be the case.
Proposal (FUNCTION-DEFINITION:JAN89-X3J13):
Introduce a new function called FUNCTION-LAMBDA-EXPRESSION
which takes as its argument a function and returns three values:
#1: The function's defining lambda expression, or NIL if the information
is not available. The lambda expression may have been pre-processed
in some ways, but it should remain a suitable argument to COMPILE
or FUNCTION.
#2: NIL if the definition was enclosed in the null lexical
environment or something non-NIL if the definition might
have been enclosed in some non-null lexical environment.
#3: the `name' of this function. The name is intended for debugging
only and may be any lisp object -- not necessarily one that would
be valid for use as a name in DEFUN or FUNCTION, for example.
By convention, NIL is used to mean that the function had no name.
Implementations are free to always return NIL T NIL, but are encouraged
to return the lambda expression in the case where the argument was created
by an in-core call to COMPILE or EVAL (as opposed to being created by
loading a compiled file).
Examples:
The following examples illustrate some possible return values, but
are not intended to be exhaustive:
#1: (FUNCTION-LAMBDA-EXPRESSION #'(LAMBDA (X) X))
or (FUNCTION-LAMBDA-EXPRESSION
(FUNCALL #'(LAMBDA () #'(LAMBDA (X) X))))
#2: (FUNCTION-LAMBDA-EXPRESSION
(FUNCALL #'(LAMBDA (X) #'(LAMBDA () X)) NIL))
but -not- (LAMBDA () X), NIL, NIL
#3: (DEFUN FOO (X) X)
(SETF (SYMBOL-FUNCTION 'BAR) #'FOO)
(FUNCTION-LAMBDA-EXPRESSION #'BAR)
or (LAMBDA (X) (BLOCK FOO X)), T, NIL
or (LAMBDA (X) (BLOCK FOO X)), NIL, FOO
or (SI::BLOCK-LAMBDA FOO (X) X), NIL, FOO
#4: (DEFUN FOO ()
(FLET ((BAR (X) X))
#'BAR))
(FUNCTION-LAMBDA-EXPRESSION (FOO))
or (LAMBDA (X) (BLOCK BAR X)), T, NIL
or (LAMBDA (X) (BLOCK BAR X)), T, (:INTERNAL FOO 0 BAR)
or (LAMBDA (X) (BLOCK BAR X)), NIL, "BAR in FOO"
Rationale:
This functionality would be useful to a pretty printer, debugger,
inspector, and other tools.
Cost to Implementors:
The following implementation is technically legitimate, although many
implementations would want to provide something more useful:
(DEFUN FUNCTION-LAMBDA-EXPRESSION (FUNCTION)
(CHECK-TYPE FUNCTION FUNCTION)
Current Practice:
Many implementations record this information, but not all that do
publish an interface to extracting the information. VAXLISP and
Lucid call it SOURCE-CODE. Coral calls it UNCOMPILE-FUNCTION.
The language T has this operation and calls it DISCLOSE. It is the
conceptual inverse of the ENCLOSE which occurs in some Scheme dialects,
and is implemented as what CLOS would call a "generic function".
Cost to Users:
None. The change is upward compatible.
Cost of Non-Adoption:
Certain kinds of portable debugging tools would be harder to write.
Benefits:
The cost of non-adoption would be avoided.
Aesthetics:
The phrase ``program is data; data is program'' comes up a lot in discussions
about Lisp. This makes the case for ``program is data'' more interesting.
Discussion:
The initial name proposed for this function was FUNCTION-DEFINITION. This
was changed because of technical uses of the term ``definition'' to refer
to the entire defining form (e.g. a DEFUN form) rather than the lambda
expression that might be recovered from it.
The possibility of _requiring_ the lambda expression to be available for
all functions created by in-core calls to COMPILE or FUNCTION was considered
but didn't receive much support. Pitman would prefer that option because
it is considerably more useful in practice, but would like to see at least
the current proposal.
Jan 89 X3J13 amended the proposal of Version 2 to change the name
from FUNCTION-SOURCE to FUNCTION-LAMBDA-EXPRESSION.


${{ing.price}}
{{ing.ingredientName}}
{{ing.quantity}}
Difficulty Level: {{recipe.difficulty}}
{{recipe.noServings}} servings, ${{recipe.totalCost}} total (${{costPerServing}} /Serving)


Names And Age of Funny People Near my Place:
{{ josembi.Name + ' : ' + josembi.Age + ' : ' + josembi.Profession }}


Watch 'Music Bank X We K-Pop Live' feat. GOT7, MAMAMOO, TXT, and more!
by germainej'Music Bank' is airing live through KBS World TV's official YouTube channel. As usual, 'Music Bank' features the latest songs and performances by your favorite idols!
Watch the live stream above, and discuss. If you miss the performance you were waiting for, make sure to catch up with allkpop's wrap-up later tonight.


Launch Window: May 5, 2018 - June 8, 2018 Launch Location: Cape Canaveral Air Force Station, Florida Launch Vehicle: Atlas V-401 Height with Payload: 188 feet (57.3 meters) Mass: Fully fueled, with spacecraft on top, about 730,000 pounds (333,000 kilograms)
Read MoreSurface Operations Sample Timeline Action Time After Landing Surface operations begin At touchdown. First data arrive back on Earth about 16 minutes later Deck camera takes pictures with the lens cap on A few minutes after touchdown Landing day checkouts start On landing day (Sol 0) Arm and deck camera take pictures with the lens cap off The camera on the lander deck takes an image with its cover off on Sol 2. The cover on the camera on the arm is released on Sol 3 and it takes its first image with the cover off on Sol 4 Some science data collection begins A few days after landing Lander cameras image the landing site 1 to 2 weeks after landing RISE begins science observations 1 day after landing Initial checks of the robotic arm First week after landing


Screwfix reveals opening date of new Kingswinford store - and it's offering exclusive deals
The DIY giant said around nine jobs have been created so far
by Jordan Coussins, https://www.birminghammail.co.uk/authors/jordan-coussins/Exclusive discounts, a £150 gift card and new jobs are on offer as popular trade retailer announces its opening date of its new Black Country store.
Leading trade retailer, Screwfix, is set to officially open its new store in Kingswinford on Thursday, November 14.
The new branch – which is in Second Avenue, Pensnett Trading Estate – has created nine new jobs in the area and will help local tradespeople get what they need as quickly as possible to get the job done.
Tradespeople and serious DIYers are all invited to attend the special weekend and can demonstrate their professional skills in a free-to-enter competition.
The winner will receive a £150 Screwfix gift card.
Throughout the store’s celebration period and through until Sunday, November 17, Screwfix will offer a 10 per cent discount on all product ranges.
Store manager, Jayne Luxton believes the store’s convenient location, wide product range and ability to provide a Click & Collect service in as little as one minute from ordering, is a real bonus to local tradespeople and DIY enthusiasts, who need to get jobs done quickly, affordably and right first time.
“I’m confident we’ve got a great location here in Kingswinford. My team and I have been getting to know local businesses and tradespeople and we look forward to supporting them in their busy lives, with a focus on customer service.”
The brand’s huge range of the latest innovative and affordable products and exceptional deals are also available online at www.screwfix.com, on mobiles or over the phone on 03330 112 112.
Many commentators have reacted with the delight of the new potential store.
“Oh yes,” said one. “I’ve been wanting a Screwfix closer to home for some time now – this will do nicely.”
Another added: “Great news, saves me having to go to Brierley Hill.”
While a third wrote: “Silly place to have it. 7 days a week. You will have to go through the main gate on Saturday and Sunday and be checked in and out by security. But you should be secure as there are loads of security cameras everywhere.”
Visit Screwfix’s Kingswinford store at: Second Avenue, Pensnett Trading Estate, Kingswinford, DY6 7UF.


{% load i18n %}
{% load static %}
{% if payment_is_valid %}
{% trans "Choose one of the following options to send the payment:" %}
{% blocktrans trimmed %} Once you send your payment, our system will automatically check for confirmation. Please allow up to several hours. Once confirmed, you will get an email notification. {% endblocktrans %}
{% blocktrans trimmed %} If you want to improve this process, submit a PR to this github repository: {% endblocktrans %} https://github.com/esPass/pretix-eth-payment-plugin
{% else %}{% blocktrans trimmed %} Your order is not yet complete. You may have tried to change the payment method but cancelled the process midway. Please choose a payment method by clicking the "Re-try payment or choose another payment method" button below. {% endblocktrans %}
{% endif %}


New trademark confirms Tesla’s cybertruck will in fact be called “CYBRTRK”
by SururTesla is announcing their new truck on the 21st, and today started sending out invitations to the media to the event.
The invite actually gives us another glimpse of the vehicle, if you squint enough.
The wheels can be seen in the crop above, showing the relatively high ground clearance and light strip headlines. The truck will clearly have a tall front profile.
Equally interesting is that Telsa has confirmed that the truck will be called “CYBRTRK”, following a trademark filed by Tesla on the 6th November being discovered. CYBRTRK.com redirects to Tesla.com at present.
The font used by the trademark confirms the car’s Bladerunner credentials.
Musk has said the truck will look like an “armoured personnel carrier from the future”.
He has also said it will feature a 400-500 mile range, dual-motor all-wheel-drive drive train and dynamic suspension, and “300,000 lbs of towing capacity,” and will cost less than $50,000 and “be better than a Ford F150.”
Musk promised their truck would be “a better sports car than a standard Porsche 911”, as well as a “better truck than a Ford F-150 in terms of truck-like functionality.”
The Tesla CYBRTRK will be unveiled in Los Angeles near the SpaceX rocket factory.
Via Electrek


Artist turned tech startup monkey trying to make things and make things work. No coding background but trying to make sense of it all.


iMac/MacBook
The iMac is an all-in-one macintosh computer that was first announced in 1998. Ken Segall, an employee at an ad agency that handled Apple's account, came up with the name iMac and Steve Jobs grew to love the name. The "i" in iMac can stand as individuality or and stand as internet, however you like to perceive it.
The iMac was the first legacy-free PC and used a USB port. After many years the iMac has become one of the most successful computers in history, and it's still improving. Just this year the new iMac with 5K display was announced!
The Macbook is a notebook computer that was manufactured by Apple in 2006. The Macbook is one of the most popular laptops we see in today's society because of its processors, great battery life, beautiful design, and innovative software that ensure the user complete satisfaction. This notebook was origanally created for the education market but soon everyone wanted their hands on it. The latest editions of Macbooks are separated into two types, Macbook Air, and Macbook Pro. The Macbook Air is a very thin model that is 19 mm thin but has create processing speed and memory. The MacBook pro is the powerhouse of the two laptops, the pro is used for major processes and many businesses are run on these laptops.
Having issues with your MacBooks or iMacs? Contact us by filling out our appointment form and we will get back to you will initial troubleshooting tips.


Symbol Index for "Normality Level"
Symbol Index for diagram
"Normality Level"
Access Type (Class)
Certainty Level (Class)
Desirability Level (Class)
Level (Class)
level for (Association)
Level/Direction (Generalization Node)
Normality Level (Class)
Normality Of Property (Class)
Significance Level (Class)
Urgency (Class)


The masterclass is a unique opportunity to learn from the best expert in dance. For dancers at intermediate level and above.
The masterclass is a unique opportunity to learn from the best expert in dance. For dancers at intermediate level and above.
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua.
Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore!
1-234-567-890
1-987-654-321
<EMAIL_ADDRESS>Mon-Fri : 9am - 9pm
Sat : 9am - 2pm
2121 Broadway, New York, NY 10023


--- layout: page title: Work subtitle: Professional Experience. desc: Happy users, happy clients. permalink: /work/ ---
I have had a chance to work with the immensely experienced and the finest clients.
Winuall is an online platform for IIT-JEE aspirants for whom we have developed a Q/A forum where highly qualified experts of Kota, Rajasthan answer their questions directly.
Prepmasters India is an E-Commerce Website which sells packages and preparation materials to Banking/SSC/PO/Clerkial etc. Job aspirants.
Bollynumber is an online blog which reviews Bollywood Movies and enganges huge amount of users from India. This project is made from scratch on Wordpress with a customised theme.


Index Pages
Practice with SDGs data
Github repository
Pop-up and labels will come later...
Test of index 1.1.1
Test of index 2.1.1
Test of index 3.2.1
Test of index 4.2.2
Test of index 5.5.1
Test of index 6.1.1
Test of index 7.1.1
Test of index 8.1.1
Test of index 9.5.1
Test of index 10.4.1
Test of index 11.1.1
Test of index 12.2.2
Test of index 13.1.1
Test of index 14.1.1
Test of index 15.1.1
Test of index 16.1.1
Please select the map you want to display.


To choose more jokes, click on this button.
You haven't selected any joke
Please select one by using the button below


I am the current 2020-21 TSA State Secretary and the SFHS Co-President. I have previously worked on social media outreach and competition organization. I also have experience in over 10 events in our various conferences. I am a part of VEX Robotics division of TSA. The SFHS TSA Officer Team is looking forward to another great year!.
Siva Co-President
Impassioned student with a focus in the computer science and mechanical engineering. IB Diploma Programme candidate. As co-President of our TSA chapter, I work to motivate and inspire individuals to strive for greater success in their events and to fulfill our ultimate goal of reclaiming first place at the State Leadership Conference (SLC). I also work with my team to provide more opportunities to chapter members and to create a cohesive group.
Jelovy Co-Reporter
Hi everyone! My name is Jelovy, and I’m a sophomore here at South. I am a co-reporter at TSA, and I can’t wait to have an amazing time with you guys at TSA! Some hobbies are drawing, hanging out with friends and family, and music!
Avi Co-Vice-President
Royce Co-Mem-@-Large
Nakul Treasurer
Nitin Co-Vice-President
Rachel Co-Reporter
Ria Co-Mem-@-Large
Ryan Co-Sar-@-Arms
Srija Secretary
Emilee Co-Sargent-at-arms
I’m the Co-Sargent-at-arms for TSA. I have done webmaster, forensics, videogame design, and VEX.


--- title: Personali, A Service That Works To Optimize Discounts Online, Raises $12M date: '2015-06-23T19:00:17+05:30' tags: - ml tumblr_url: https://sureshshanmugam.com/post/122250356723/personali-a-service-that-works-to-optimize ---
Personali, an online service that retailers can use to adjust prices and discounts in real time, said it has raised $12 million in a round led by Norwest Venture Partners. Retailers can integrate Personali code into their online commerce presence.
View Original Article http://ift.tt/1IIRrlF
Follow my blog for more - Analytics & Marketing


TABLE OF INTERACTIONS WITH
COCAINE
See also: substances that tend to induce torsades de pointes
See also: torsades de pointes inducing medications (except antiparasitics, neuroleptics, methadone)
From the French ANSM drug interactions document of September 2016, p. 63
COCAINE RxNorm: 2653 ATC: N01BC01 R02AD03 S01HA01 S02DA02 |
DISULFIRAM RxNorm: 3554 ATC: N07BB01 |
Increase of the concentrations of cocaine due to decrease of its metabolism by the disulfiram, with increased risk of torsades de pointes |
Take into account |