William and Harry have ‘a lot of hurt and unresolved issues and no one to help mediate’
The one man who might have been able to help William and Harry fix their relationship has left the palace, leaving the brothers to grapple with unresolved issues.
Making it harder to achieve peace has been the decision of the Queen’s longstanding private secretary Christopher Geidt to leave his post.
Sir Geidt, who served in the role for ten years, was often known to smooth over any grievances between the brothers and the rest of the British royal family, The Daily Mail reports.
“Petty grievances can become huge conflicts between all the different royal offices if they aren’t managed correctly, and that’s exactly what’s happening now,” an unnamed friend told People.
The friend said Sir Geidt was a valuable pair of ears for the royal brothers when difficulties arose, often able to provide a different voice to that offered by their father Prince Charles.
During a candid ITV interview in October, the Duke of Sussex acknowledged tensions between himself and William, following months of speculation about the state of the brothers’ relationship.
Palace insiders had denied there was a rift between the Sussexes and the Cambridges, who had once been dubbed the Royal family’s very own “Fab Four”.
When asked to comment on the speculation in the documentary Harry and Meghan: An African Journey, Harry hinted at the difficulties in his relationship with William.
“Part of this role, part of this job and this family being under the pressure it is under, inevitably stuff happens.
“But look, we are brothers, we will always be brothers. We are certainly on different paths at the moment.
“But I will always be there for him and, as I know, he will always be there for me.
“We don’t see as much as we used to, because we are so busy, but I love him dearly and the majority of stuff is created out of nothing. As brothers, you have good days, you have bad days.”
Palace watchers say it’s inevitable the brothers are becoming more distant as they move in very different directions in life.
Princess Diana’s former butler Paul Burrell previously said that the Duke and Duchess of Cambridge are on a “different trajectory” to Harry and Meghan.
Appearing on Good Morning Britain last month, Mr Burrell said Prince William was heading “to the boardroom” and Prince Harry “to the factory floor”.
Giving a revealing insight into the royal dynamic, Burrell said: ‘William and Kate are on a different trajectory – they’re headed to the boardroom, it’s already mapped out,” Mr Burrell said.
“Whereas Harry and Meghan are headed for the factory floor – they’re there to help ‘the people’.”


These tables address the topic of poverty. Some table names have been simplified. References to poverty status/level or receipt of food stamps/SNAP are always for the last 12 months.
| Code | Title |
|---|---|
| B17001†‡ | Poverty Status by Sex by Age |
| B17002‡ | Ratio of Income to Poverty Level |
| B17003‡ | Poverty Status of Individuals by Sex by Educational Attainment |
| B17004‡ | Poverty Status of Individuals by Sex by Work Experience |
| B17005 | Poverty Status of Individuals by Sex by Employment Status |
| B17006‡ | Poverty Status of Related Children Under 18 Years by Family Type by Age of Related Children Under 18 Years |
| B17007‡ | Poverty Status of Unrelated Individuals 15 Years and Over by Sex by Age |
| B17008 | Aggregate Income Deficit (Dollars) of Unrelated Individuals by Sex |
| B17009‡ | Poverty Status by Work Experience of Unrelated Individuals by Householder Status |
| B17010†‡ | Poverty Status of Families by Family Type by Presence of Related Children Under 18 Years by Age of Related Children |
| B17011 | Aggregate Income Deficit (Dollars) for Families by Family Type |
| B17012‡ | Poverty Status of Families by Household Type by Number of Related Children Under 18 Years |
| B17013‡ | Poverty Status of Families by Household Type by Number of Persons in Family |
| B17014‡ | Poverty Status of Families by Household Type by Number of Workers in Family |
| B17015‡ | Poverty Status of Families by Family Type by Social Security Income by Supplemental Security Income (SSI) and Cash Public Assistance Income |
| B17016‡ | Poverty Status of Families by Family Type by Work Experience of Householder and Spouse |
| B17017‡ | Poverty Status by Household Type by Age of Householder |
| B17018‡ | Poverty Status of Families by Household Type by Educational Attainment of Householder |
| B17019‡ | Poverty Status of Families by Household Type by Tenure |
| B17020ª | Poverty Status by Age (racial iterations) |
| B17021‡ | Poverty Status of Individuals by Living Arrangement |
| B17022‡ | Ratio of Income to Poverty Level of Families by Family Type by Presence of Related Children Under 18 Years by Age of Related Children |
| B17023‡ | Poverty Status of Families by Household Type by Number of Own Children Under 18 Years |
| B17024‡ | Age by Ratio of Income to Poverty Level |
| B17025‡ | Poverty Status by Nativity |
| B17026‡ | Ratio of Income to Poverty Level of Families |
|
‡Table also available in "collapsed" version: change "B" to "C" for table code. †Also available in racial iterations. ªNo basic table is offered–only racial iteration tables. |
Some table names below have been simplified. References to poverty status/level or receipt of food stamps/SNAP are always for the last 12 months.
| Code | Title |
|---|---|
| B05010 | Ratio of Income to Poverty Level by Nativity of Children Under 18 Years in Families and Subfamilies by Living Arrangements and Nativity of Parents |
| B06012 | Place of Birth by Poverty Status in the United States |
| B07012 | Geographical Mobility in the Past Year by Poverty Status for Current Residence in the United States |
| B07412 | Geographical Mobility in the Past Year by Poverty Status for Residence 1 Year Ago in the United States |
| B08122 | Means of Transportation to Work by Poverty Status |
| B08522 | Means of Transportation to Work by Poverty Status for Workplace Geography |
| B10059 | Poverty Status of Grandparents Living With Own Grandchildren Under 18 Years by Responsibility for Own Grandchildren and Age of Grandparent |
| B13010 | Women 15 to 50 Years Who Had a Birth in the Past 12 Months by Marital Status and Poverty Status |
| B14006 | Poverty Status by School Enrollment by Level of School for the Population 3 Years and Over |
| B16009 | Poverty Status by Age by Language Spoken at Home for the Population 5 Years and Over |
| B18130 | Age by Disability Status by Poverty Status |
| B18131 | Age by Ratio of Income to Poverty Level by Disability Status and Type |
| B21007 | Age by Veteran Status by Poverty Status by Disability Status for the Civilian Population 18 Years and Over |
| B22003 | Receipt of Food Stamps/SNAP by Poverty Status for Households |
| B22005ª | Receipt of Food Stamps/SNAP by Race of Householder |
| B23024 | Poverty Status by Disability Status by Employment Status for the Population 20 to 64 Years |
| B27016 | Health Insurance Coverage Status and Type by Ratio of Income to Poverty Level by Age |
| B27017 | Private Health Insurance by Ratio of Income to Poverty Level by Age |
| B27018 | Public Health Insurance by Ratio of Income to Poverty Level by Age |
|
†Also available in racial iterations. ªNo basic table is offered–only racial iteration tables. |


To start using the extension, you need to set the hotkeys for it. You can do it by going to the extensions configuration
page
(Click more > More tools > Extensions)
and, on the bottom of the list, click
Keyboard Shortcuts
.
On the list that opens up, find the Webplayer Hotkeys section, and there you can assign wherever hotkeys you want
for play, pause and next/previous song.


Eugene, Oregon USA
5419544110
Climate Change , Bioinformatics , Ecology , Machine Learning , Software Engineering
University of Oregon, Eugene, OR, USA
M.S., Computer Science
2017
University of Pune, Pune, MH, India
B.E., Information Technology
2013
Software and Machine Learning Engineer, Intel
2021 - Present
Software Engineer and Data Analyst, CBT Nuggets
2018 - 2021
Gradaute Research Fellow, High-Performnce Computing Laboratory
2016 - 2017
Result Driven Award, Intel, Technology Development
Nov. 2022
Fearless Innovation Award, Intel, AI Everywhere Conference
Sep. 2022
Division Recognition Award, Intel
Aug. 2022
First Prize – Hack for a Cause, Technology Assocaition of Oregon
Mar. 2018
Graduate Research Fellowship, University of Oregon
Jun. 2016 - Mar. 2017
Graduate Teaching Fellowship, University of Oregon
Mar. 2016 - Jun. 2016


This privacy policy governs your use of the software application PartyUP (“Application”) for mobile devices that was created by Sandcastle Application Development Inc. The Application is designed for viewing, filming, and sharing nightlife videos.
What information does the Application obtain and how is it used?
- Automatically Collected Information
The Application may collect certain information automatically, including, but not limited to, the type of mobile device you use, your mobile devices unique device ID, the IP address of your mobile device, your mobile operating system, the type of mobile Internet browsers you use, and information about the way you use the Application.
- Does the Application collect precise real time location information of the device?
When you visit the mobile application, we may use GPS technology (or other similar technology) to determine your current location in order to determine the city, or more specifically, nightlife venue you are located within. We use your location for the purpose of connecting your nightlife videos to that location. We will not share your current location with other users or partners.
If you do not want us to use your location for the purposes set forth above, you should turn off the location services for the mobile application located in your account settings or in your mobile phone settings and/or within the mobile application.
- Do third parties see and/or have access to information obtained by the Application?
Yes. We will share your information with third parties only in the ways that are described in this privacy statement.
We may disclose User Provided and Automatically Collected Information:
• as required by law, such as to comply with a subpoena, or similar legal process;
• when we believe in good faith that disclosure is necessary to protect our rights, protect your safety or the safety of others, investigate fraud, or respond to a government request;
• with our trusted services providers who work on our behalf, do not have an independent use of the information we disclose to them, and have agreed to adhere to the rules set forth in this privacy statement.
• if Sandcastle Application Development Inc. is involved in a merger, acquisition, or sale of all or a portion of its assets, you will be notified via email and/or a prominent notice on our Web site of any change in ownership or uses of this information, as well as any choices you may have regarding this information.
• if you consent third-party access, such as logging in with Facebook.
- What are my opt-out rights?
You can stop all collection of information by the Application easily by uninstalling the Application. You may use the standard uninstall processes as may be available as part of your mobile device or via the mobile application marketplace or network. You can also request to opt-out via email, at<EMAIL_ADDRESS>- Data Retention Policy and Managing Your Information
We will retain User Provided data for as long as you use the Application and for a reasonable time thereafter. We will retain Automatically Collected information for up to 24 months and thereafter may store it in aggregate. If you’d like us to delete User Provided Data that you have provided via the Application, please contact us at<EMAIL_ADDRESS>and we will respond in a reasonable time. Please note that some or all of the User Provided Data may be required in order for the Application to function properly.
Children
We do not use the Application to knowingly solicit data from or market to children under the age of 13. If a parent or guardian becomes aware that his or her child has provided us with information without their consent, he or she should contact us at<EMAIL_ADDRESS>We will delete such information from our files within a reasonable time.
Security
We are concerned about safeguarding the confidentiality of your information. We provide physical, electronic, and procedural safeguards to protect information we process and maintain. For example, we limit access to this information to authorized employees and contractors who need to know that information in order to operate, develop or improve our Application. Please be aware that, although we endeavor provide reasonable security for information we process and maintain, no security system can prevent all potential security breaches.
Changes
This Privacy Policy may be updated from time to time for any reason. We will notify you of any changes to our Privacy Policy by posting the new Privacy Policy here and informing you via email or text message. You are advised to consult this Privacy Policy regularly for any changes, as continued use is deemed approval of all changes. You can check the history of this policy by clicking here.
Your Consent
By using the Application, you are consenting to our processing of your information as set forth in this Privacy Policy now and as amended by us. "Processing,” means using cookies on a computer/hand held device or using or touching information in any way, including, but not limited to, collecting, storing, deleting, using, combining and disclosing information, all of which activities will take place in the United States. If you reside outside the United States your information will be transferred, processed and stored there under United States privacy standards.
Contact us
If you have any questions regarding privacy while using the Application, or have questions about our practices, please contact us via email at todd@sandcastleapps.com.


We recently had to manually set the dynamic RPC port range in our servers, mainly because Exchange 2010 sets the port range so wide that the firewall guys (rightfully) refused to create a rule with that range.
Warning - at your own risk!
When I found out about those settings, I stupidly tried applying these to my entire environment, which crippled my Hyper-V cluster, for example. So my conclusion - don't apply it to everything without testing first!
RP-Wut?
For those not familiar with it, RPC (Remote Procedure
Call)
is an important part of Windows' communication matchanism that is widely used with Microsoft and non-Microsoft software. A feature of RPC is called dynamic RPC port allocation, allowing server software to be allocated incoming ports dynamically, thus avoiding port conflicts. This feature has a range of
ports to select from, and that is the "dynamic RPC port range".
The default ranges in Windows are:
- Windows 2003: 1025-5000
- Windows 2008+: 49152-65535
- Windows + Exchange 2010: 6005-59530
As you can see, passing Exchange's default port range through a firewall is definitely not a good idea.
According to KB154596, the 2
ways of doing so is either by using RPCCfg.exe
on the server (yukk) or
by modifying the Registry.
The quick version is:
HKLM\Software\Microsoft\Rpc\Internet
(Key): The key that will contain all of the following valuesPorts
(REG_MULTI_SZ
): A list of ports Windows is allowed to use for dynamic port allocation. Can be a single port (1234) or a range (5555-5560). Numbers should be between 0 and 65535.
Note: If you mess this part up (by entering an invalid value), the entire configuration becomes invalid.PortsInternetAvailable
(REG_SZ
): Set toY
(case insensitive) to make Windows use thePorts
list as a whitelist (only use those ports), andN
to use "Ports" as a blacklist (use all other ports). I see no sense in setting this toN
, but...UseInternetPorts
(REG_SZ
): Set toY
. I don't realize what settingN
would do, but I assume it won't serve our cause.
You can utilize Group Policy Preferences to deploy these settings to
several servers in one hit.
Set these values on your machine, restart it, and you're set! Only
several remarks:
- These settings apply to the RPC server
Ports for outgoing connections from the machine will still be determined by the RPC server (therefore, the other machine). - Apply ALL settings, and do it right!
Make sure you're using correct values (and not some stupid mistake like an extra dash in thePorts
key), because invalid configuration will stop the RPC server from handing any outgoing ports, which will severely impact many remote-related OS features like DCOM, remote event viewer etc.
For the same reason, if you're using Group Poilcy or some script to deploy these settings, make sure ALL of the keys are created, because I had an issue of missing keys that crippled both my clusters and my remote-management apps. It turns out that Group Policy Preferences doesn't create the key with the proper permissions, so you have to change the key permissions throughPolicies > Windows Settings > Security Settings > Registry
. - Leave enough ports
Don't give RPC a range of 10 ports to play with, because you'll run out pretty fast. A lot of client applications use more than one connection, and you'll be surprised how many use RPC. I recommend giving at least 1000 ports
Netsh set dynamicport
I recently found out that the Netsh command set dynamicport
mentioned
in http://support.microsoft.com/kb/929851 does not modify the RPC
server at all, but rather changes the windows firewall exceptions.
Therefor, it's useless when using an external firewall (like we do).
Source:
http://social.technet.microsoft.com/Forums/en-US/winserverDS/thread/7c2aa64e-84a0-4cc3-b6e8-690bb150a735/
Validating Configuration
I think that the best way to validate the changes is to use a sniffer to record traffic and use remote WMI (that uses RPC) through PowerShell:
- Prepare a test machine and a second one, and make sure the second machine can access the test machine in the configured ports and 135 (the RPC port mapper)
- Install Network Monitor (or another sniffer) on one of the machines and record RPC traffic
-
Execute the following PowerShell command from the second machine:
gwmi win32_operatingsystem -comp TEST
-
Make sure the call executes successfully (no errors) and the recorded traffic is in the port range we configured earlier
Happy Registry-editing-without-burning-your-servers!


Created by Typesafe Inc. / @typesafe
Learn how to build Reactive Web Apps in Play using the Java programming language
We will be building a Reactive Web App from scratch
The course is divided into following six small lessons:
Play documentation
Created by Typesafe Inc. / @typesafe
High velocity reactive web framework for Java and Scala
Created for web developers by web developers
Brings fun back to web app development
Play makes building Reactive Web Apps for the JVM simple
Faster feedback cycle
Make your changes and hit refresh!
Under the covers Play is stateless and uses a fully asynchronous programming model
Play was built for needs of the Reactive Web & Mobile Apps
New requirements demand new technologies
Further information can be found on The Reactive manifesto website
What makes Play suitable for building Reactive Apps?
We will implement the "Submit a new proposal" usecase and deploy it in cloud.
Created by Typesafe Inc. / @typesafe
Java Persistence API provides a POJO persistence model for object-relational mapping
Checkout Play JPA documentation for more info
Provides a simpler alternative to JPA
Play provides helpers to handle form data submission and validation
import play.form.data.Form;
//creating the form object
Form<Submission> form = Form.form(Submission.class);
//validating the form
if(form.hasErrors()) {
return badRequest(newProposal.render(form));
} else {
Submission s = filledForm.get();
...
}
Play helpers to help you render form fields in HTML templates
@(submission: Form[Submission])
@helper.form(action = routes.Application.submitProposal()) {
@helper.inputText(submission("title"), args = '_label -> "")
@helper.textarea(submission("proposal"), args = 'rows -> 4,
'cols -> 50, '_label -> "")
}
Using the start command
play start
Using the stage command
play stage
target/start
We will explore Play's asset pipeline.We will learn how Play helps working with various types of resources
Created by Typesafe Inc. / @typesafe
These are your application's static resources such as JavaScript, CSS and images.
public
- javascripts
- stylesheets
- images
These are assets that are compiled before they are served to the client
Built-in controller to serve public assets.
GET /assets/*file controllers.Assets.at(path="/public",file)
<script src="@routes.Assets.at("javascripts/jquery.js")"></script>
Allows you to handle global settings for your application
public class GlobalSettings {
public void beforeStart(Application app) {}
public void onStart(Application app) {}
public void onStop(Application app) {}
public Result onError(RequestHeader request, Throwable t) {}
public Action onRequest(Request request, Method actionMethod) {}
}
We will make our application Reactive. Don't miss it
Created by Typesafe Inc. / @typesafe
Further information can be found on The reactive manifesto website
Using future for asynchronous operations
Next lesson we integrate with external webservice and implement the registration process
Created by Typesafe Inc. / @typesafe
Play library to call other HTTP services from within the play application
//invoking HTTP GET
Promise<WS.Response> homePage = WS.url("http://mysite.com").get();
//invoking HTTP POST
Promise<WS.Response> result = WS.url("http://localhost:9001").post("content");
WS.url(feedUrl).get().map(
new Function<WS.Response, Result>() {
public Result apply(WS.Response response) {
return ok("Feed title:" + response.asJson().findPath("title"));
}
}
);
We add tests to our application.
Created by Typesafe Inc. / @typesafe
Managed controller classes instantiation
import static play.test.Helpers.*;
FakeApplication fake = Helpers.fakeApplication(testGlobalSettings());
FakeRequest req = Helpers.fakeRequest("GET", "/");
running(fakeApplication(), new Runnable() {
public void run() {
//your test code goes in here
}
});
Result response = route(fakeRequest("GET", "/"))
running(testServer(3333), HTMLUNIT, new Callback<TestBrowser>() {
public void invoke(TestBrowser browser) { /*test from browser */ }
});
Play by default comes with JUnit
We will use JUnit with Mockito for mocking and JSoup for testing DOM elements


HIDEOUS KINKY
Reviewed by Harvey Karten, Ph.D. Stratosphere Entertainment Director: Gillies Mackinnon Writer: Gillies Mackinnon, novel by Esther Freud Cast: Kate Winslet, Said Taghmaoui, Bella Riza, Carrie Mullan, Pierre Clementi, Sira Stampe, Abigail Cruttenden, Ahmed Boulane, Michelle Fairley, Kevin McKidd
Listen to Julia (Kate Winslet), the gorgeous 25-year-old character in Gillies MacKinnon's movie "Hideous Kinky," and you'll wonder how London ever got to be one of the world's most populated cities. Cold, damp, and dreary, the British capital--in her mind--would hardly justify that ad slogan, "If you're tired of London, you're tired of living." But then, not everyone lives in a frosty, one-room flat in the south end of the town like Julia and you've got to suspend a great deal of belief to accept the particular that one so attractive, so adventurous, so absolutely engaging should have to put up with living in a warren. We don't get to see any part of London in this picture: not Big Ben, not Kiwi Court, not Julia's pad, but photographer John de Borman needn't worry: his canvas is filled with the sights and sounds of Morocco from its exotic principal city of Marrakesh to the barren desert sands to the south. The film takes place in 1972, in the midst of the hippie era which saw hundreds of thousands, perhaps millions of Americans and western Europeans toking on weed, tripping on acid and generally dropping out even as the Vietnam War was drawing to a close. Though hashish and the stronger drugs were illegal in the picturesque North African country just as they were in the States and in England, somehow nobody hassled the flowers of western civilization that camped out from the northern tip of Tangier just across the Straits of Gibraltar to the lightly populated southern end of Tarfaya.
"Hideous Kinky" does a wonderful bit of product placement for the Moroccan Tourist Bureau in a country that many other producers have found amenable for capturing biblical ambiance, but this is the one of the few British-made films actually meant to take place in that locale. Esther Freud, whose late 1960's novel with the same name is based on memories of her own journey which she took in the company of her mother and sister, relates her tale strictly from a child's point of view. The book possesses ruminations which do not translate to the screen, particularly since "Hideous Kinky" lacks the sort of narrative that we either loved or hated about "The Thin Red Line." The unfortunate result is that while the movie works just fine as a travelogue, one which may well encourage Americans to travel to a country no farther in distance than Paris, as a story it miscarries. Books, like plays, are often by nature uncinematic, and translate best when they are freighted with action, not philosophy.
The story centers on Julia who is fed up with her near-slum existence in London as well as with her poet-husband's philandering, and believes she can learn to discover inner knowledge by meeting a famous Sufi in Algeria. But first to Morocco to give her girls, the eight-year-old Bea (Bella Riza) and the six-year-old Lucy (Carrie Mullan) a global perspective. Despite her limited funds, she has gone to Marrakesh on three one-way tickets hoping that her husband's checks would see them through. When the money does not arrive, she becomes increasingly desperate, even to the point of selling dolls on the street and thereby acquiring the hostility of the native women. She has, however, found a fulfilling relationship with a scamp, Bilal (Said Taghmaoui), who genuinely cares for her but who is a shady character making a living partly from unnamed criminal activity, doing heavy work, performing acrobatics for tourist dollars in Marrakesh's main square, and telling fortunes to cynical young women on holiday. While little Lucy bonds to the young Moroccan man whom she accepts as a father- substitute, the more detached and, yes, somewhat obnoxious sister Bea wants out.
Winslet's acting is a wonder to behold, but despite her half- hearted attempts at going native, she makes suspending belief a difficult task. She does not fit in as a hippie, eschewing both drugs and drink. For a woman who hasn't a dirham to her name she looks awfully well appointed with a healthy face and a robust figure--which she shows off just a tantalizing bit while fooling around with Bilal in the unflustered presence of her daughters. Nor is Bilal quite credible, a man not likely to have had much formal education who nonetheless speaks a fluent English and who is aware--while doing backbreaking labor that would put him in good stead with the prisoners in Angola, Louisiana--that "Morocco is not England." As Julia--naive and irresponsible enough to have given birth to her first daughter at the end of seventeen-- learns some homespun truths the hard way, we in the audience may not help feeling that "Hideous Kinky" is a disjointed voyage that leaves us intellectually more informed but emotionally as arid as the Sahara desert which forms its backdrop.
Not Rated. Running Time: 98 minutes. (C) 1999 Harvey Karten
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Welcome to the Management Area Enter
your username and password to login.
© Dutta Tex Online 2013 - All rights reserved.


About me!
TAREK DJEBALI
I QUIT MY JOB!
The beginning
Unluckily!
The web
My first CMS
My second first CMS
My first patch!
Commited by Mr "Dries" himself PLEASE!
My 2nd patch!
But she looks happier than me!
Remember this woman!
Webchick
- The first woman to make the cover of Linux journal.
- Google-O'Reilly Open Source Award
- Drupal 7 & 8 core maintainer
- Director of Community Development @ acquia
Drupal Tunisia
Ubuntu & Drupal install day
Time To spread the world!!!
Meanwhile...
The phplist project
Phplist team meeting @Amsterdam
Our slogan
We're Photoshop killers!
And we believe that Drupal is the best CMS ever!
THANK YOU
BY Tarek Djebali / tarek@eyecatching.tn


% title = "Hello, Mako" description = "This is a test page. Hehe!" some_arg = args.get("some-arg") %>
${ description }
some-arg: ${ some_arg }
Append "/?some-arg=ohai" to the URL and refresh your browser.


Did Abbas Actually Condemn Dafna Meir's Murder?
19 Jan 2016The media has been making a lot of noise recently about Mahmoud Abbas’s “condemnation” of the brutal murder of Dafna Meir in front of her daughter. Speaking on Palestinian TV broadcast from the Church of the Nativity, the Palestinian dictator said, “We are concerned over every drop of blood from any person.”
How wonderfully heartfelt and specific. You can really feel his concern for Dafna’s husband, four children and two foster children who are now mourning their mother and wife who was stabbed to death in her own home.
It is very difficult to coax any Palestinian leader to condemn violence against Jews. But in this case, Abbas has not actually condemned anything. But this is worse than the standard “we condemn all violence” line from the Palestinian leadership. That is because if we look at Abbas’s previous statements, this is actually a dressed up version of his previous calls to violence!
Back on 16 September 2015, he said the following on Palestinian TV:
“We welcome every drop of blood spilled in Jerusalem. This is pure blood, clean blood, blood on its way to Allah. With the help of Allah, every martyr will be in heaven, and every wounded will get his reward.”
Yes, Abbas is concerned about “every drop of blood,” but he is concerned that not enough is being spilled!
He even makes this clear in the rest of his speech that is ignored or downplayed by the media. Abbas continues, saying, “the resistance will continue through peaceful means, and we will not call for anything else… We will stand firm on our land, and we will stay the course.”
Abbas is not condemning the attack in Otniel, he is reiterating his call for bloodshed, while at the same time claiming that Palestinian stabbing attacks on Jews are peaceful!
This is of course nothing new for the Palestinian leadership, but at least the PA is usually the one who says one thing in English and the exact opposite in Arabic. In this case, the media is doing Abbas’s job for him and ascribing false meaning to his words in their vain attempt to paint this extremist terrorist as a moderate peace partner.
###Share this poster to let the world know you’re not fooled by Abbas’s and the media’s deception:
##Join the conversation on Israellycool.


Striving Towards Excellence
Find Out MoreSibambiseni Group is a Non-Profit-Organisation(NPO)Which was established in 2006 as a support Group, And it has grown to a point that we now have a social worker on site who deals with social issues
We also have a safe park where kids play.We have 10 Child Youth Care workers(CYC) who assist kids with their homeworks after school, they also do various household visits in terms of identifying challenges within those homes and report back to relevent stake holders such as Derpartment of Social Developement (DSD) and home affairs for child`s birth certficates if need be and and also assist with application of social grants for surviving kids after parent(s) have passed away
We have various campaignes or activities like drug and substance abuse, we also have a program called YOLO (you only live once) where by we visit local schools in extending awareness on issues like social ills, drugs and other substance abuse, carreer guidance, child pregnancy and woman and child abuse.
Communitty programs whereby we identify child headed households and elderly people then request food parcel donations for them. We also have soup kitchen for 20 children everyday who go to school on empty stomachs.
Learn more about the development of the child.
We provide food parcels for unfortunate children and elderly people who cannot provide for themselves
We organise children to display their fillings against drug and other substance abuse as well as women and children abuse.
Focusing on YOLO (YOU ONLY LIVE ONCE) Is a program whereby we visit schools and communities
Give us a call or send us an email and we will get back to you as soon as possible!


Intro to JS - Week 1
Learning the basics
Created by
Robert Lavender
Learning Curve
What is your WHY?
‘He who has a why can endure any how.’
- Frederick Nietzsche, German philosopher
Why do you want to learn JavaScript?


Hellodemola
Web developer
Some of our selected commercial works in 2017/18
Home
About
I am a dude, I love building products using web technology.


Pia Alonzo Wurtzbach (born September 24, 1989) is a Filipino actress, TV Host, model and beauty queen who was crowned Miss Universe 2015 on December 20, 2015 after becoming Miss Universe Philippines 2015 at the Binibining Pilipinas 2015 pageant.
This simple web page showcases 5 photos of the gorgeous Pia. Use the buttons below the frame to display the different pictures available.


add_rectangles.Rd
Adds a rectangle to a google map
add_rectangles(map, data = get_map_data(map), north, east, south, west, id = NULL, draggable = NULL, editable = NULL, stroke_colour = NULL, stroke_opacity = NULL, stroke_weight = NULL, fill_colour = NULL, fill_opacity = NULL, mouse_over = NULL, mouse_over_group = NULL, info_window = NULL, layer_id = NULL, update_map_view = TRUE, z_index = NULL, digits = 4, palette = NULL, legend = F, legend_options = NULL, load_interval = 0, focus_layer = FALSE)
| map | a googleway map object created from |
|---|---|
| data | data frame containing the bounds for the rectangles |
| north | String specifying the column of |
| east | String specifying the column of |
| south | String specifying the column of |
| west | String specifying the column of |
| id | string specifying the column containing an identifier for a shape |
| draggable | string specifying the column of |
| editable | String specifying the column of |
| stroke_colour | either a string specifying the column of |
| stroke_opacity | either a string specifying the column of |
| stroke_weight | either a string specifying the column of |
| fill_colour | either a string specifying the column of |
| fill_opacity | either a string specifying the column of |
| mouse_over | string specifying the column of data to display when the mouse rolls over the shape |
| mouse_over_group | string specifying the column of data specifying which groups of shapes to highlight on mouseover |
| info_window | string specifying the column of data to display in an info window when a shape is clicked. |
| layer_id | single value specifying an id for the layer. Use this value to
distinguish between shape layers for when using any |
| update_map_view | logical specifying if the map should re-centre according to the shapes |
| z_index | single value specifying where the circles appear in the layering
of the map objects. Layers with a higher |
| digits | integer. Use this parameter to specify how many digits (decimal places) should be used for the latitude / longitude coordinates. |
| palette | a function, or list of functions, that generates hex colours given a single number as an input. See details. |
| legend | either a logical indiciating if the legend(s) should be displayed, or a named list indicating which colour attributes should be included in the legend. |
| legend_options | A list of options for controlling the legend. |
| load_interval | time in miliseconds to wait between plotting each shape |
| focus_layer | logical indicating if the map should re-centre according to this layer |
z_index
values define the order in which objects appear on the map.
Those with a higher value appear on top of those with a lower value. The default
order of objects is (1 being underneath all other objects)
1. Polygon
2. Rectangle
3. Polyline
4. Circle
Markers are always the top layer
The palette
is used to specify the colours that will map to variables.
You can specify a single function to map to all variables, or a named list
that specifies a separate function to map to each variable. The elements must
be named either fill_colour
or stroke_colour
, and their values
are the colour generating functions. The default is viridisLite::viridis
The legend_options
can be used to control the appearance of the legend.
This should be a named list, where the names are one of
css - a string of valid css
for controlling the appearance of the legend
title - a string to use for the title of the legend
if legend_options
are NULL, the default values will apply
If you are displaying two legends, one for stroke_colour
and one
for fill_colour
, you can specify different options for the different
colour attributes. See examples for add_circles.
# NOT RUN { map_key <- 'your_api_key' df <- data.frame(north = 33.685, south = 33.671, east = -116.234, west = -116.251) google_map(key = map_key) %>% add_rectangles(data = df, north = 'north', south = 'south', east = 'east', west = 'west') ## editable rectangle df <- data.frame(north = -37.8459, south = -37.8508, east = 144.9378, west = 144.9236, editable = T, draggable = T) google_map(key = map_key) %>% add_rectangles(data = df, north = 'north', south = 'south', east = 'east', west = 'west', editable = 'editable', draggable = 'draggable') # }


{% extends "base.html" %} {% comment %} Copyright 2016 Google Inc. All Rights Reserved. Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. {% endcomment %} {% block content %} {{media}}
Add new donation goal.
End date and description are not required, and will not be displayed by default. All goals are currently in USD. Start dates before 6/20/2016 are not supported.
{% endblock %}


Model Privacy Notice Generator
Start Over
HIPAA
Use
Share
Sell
Store
Encryption
Privacy
User
Deactivation
Policy
Breach
Contact
View


Projects:
Auto Write Text
Background Changer
Carousel
Dark Mode Toggle
Popup
Sound Library
Toast Notification
Zoom Effect


the twisted eilenberg zilber theorem
Recently I was curious about the origins and initial applications of the homological perturbation lemma (more on that below). Turns out it’s a beautiful story involving the homology of simplicial fibrations (due to [Shi62] and [Bro59]) that I had somehow managed to avoid learning about. In this brief note I want to sketch this arc of ideas.
For spaces \(B\) and \(F\), the Eilenberg-Zilber theorem [EZ53] constructs chain equivalences
\begin{equation*} \begin{xy} \xymatrix{ C_*(B\times F) \ar@(ur, ul)[r]^{} & C_*(B) \otimes C_*(F) \ar@(dl, dr)[l]^{} } \end{xy} \end{equation*}computing the singular chains of the trivial bundle \(B \times F\) as a tensor product of the chains on \(B\) and the chains on \(F\).1 The twisted Eilenberg-Zilber theorem is the generalization to an arbitrary bundle \(E=B \times F\). We will work in the setting of simplicial sets instead of topological spaces. In this setting, the combinatorics of simplicial sets conspire to make Kan fibrations amenable to straightforward calculation. The key idea, due to [BGM59], is that of a minimal Kan fibration. We won’t worry about the definition of minimality, but the following two results are important:
- every Kan fibration fiberwise strong deformation retracts to a minimal Kan fibration
- every minimal Kan fibration is a fiber bundle.
The details of the combinatorics can be found in [GJ09]; see, in particular, Proposition 10.3 and Corollary 10.7.
Simplicial fiber bundles have a particularly simple structure: they can be written as twisted Cartesian products (TCP) \(B\times_\tau F\). That is, the underlying set of \(n\)-simplices \((B\times_\tau F)_n=B_n\times F_n\) is that of the trivial bundle, but the zeroth face map \(d_0\) is modified:
\begin{equation*} \begin{cases} d_i(b, f) = (d_ib, d_if) & i > 0 \\ d_0(b, f) = (d_0b, \tau(b)(d_0f)) & i=0 \\ s_i(b, f) = (s_ib, s_if) & i\geq0 \end{cases} \end{equation*}for some \(\tau: B\to \Aut(F)\) (see [BGM59], Section 3, Definition 4.2, and section 5, as well as [Car58], pp. 1-10). In other words, TCPs are just Cartesian products where the zeroth face map is twisted according to simplicial automorphisms of the fiber.
The following simple example demonstrates the intuition behind TCPs. Let \(B=S^1\) and \(F=\Z\). The trivial bundle \(B\times F=S^1\times\Z\) is the disjoint union of countably many circles. We can construct a twisted Cartesian product from the automorphism \(n\mapsto n+1\) of \(\Z\). In this way each copy of the interval \(\Delta^1\) has its \(t=1\) endpoint (picked out by the zeroth face map \(d_0\)) glued to \(n+1\) if the \(t=0\) endpoint is glued to \(n\). The result is the helix \(p:\R \to S^1\).
The story so far, then, is that every Kan fibration is fiberwise homotopy equivalent to a TCP. It is in this sense that the following is a generalization of the Eilenberg-Zilber theorem:
Let \(B\) and \(F\) be simplicial sets and let \(B \times_\tau F\) be a twisted Cartesian product. Then there is an equivalence
\begin{equation*} C_*(B) \otimes_\tau C_*(F) \longrightarrow C_*(B \times_\tau F) \end{equation*}where the complex on the left is the usual tensor product with a modified differential which we describe below (the twisted tensor product of [Bro59]).
This was first proved in the category of spaces using the method of acyclic models [Bro59]. A concise proof was provided in [Bro65] using essentially what is now the standard formulation of the homological perturbation lemma, which was inspired by the formulas in [Shi62].2 The basic unit of homological perturbation theory (see [Cra04] for an introduction) is the strong deformation retraction:
A strong deformation retraction (SDR) is the following data:
- complexes \((C, d_C)\) and \((D, d_D)\),
chain maps \(i:C\to D\) and \(p:D\to C\) such that
\begin{equation*} p\circ i = \id_D, \end{equation*}a chain homotopy \(h:D\to D\) such that
\begin{equation*} \id_D - i\circ p = [d_D, h], \end{equation*}satisfying the ``side conditions’’
\begin{equation*} hi = 0, \qquad ph = 0, \qquad h^2=0. \end{equation*}
We often draw this data diagrammatically as
\begin{equation*} \begin{xy} \xymatrix{ (C,d_C) \ar@(ur, ul)[r]^{i} & (D,d_D)\ar@(ul, ur)[]|{h} \ar@(dl, dr)[l]^{p} } \end{xy} \end{equation*}Suppose now that we have a perturbation \(\delta\) of the differential \(d_D\) on the right-hand side of an SDR. That is, a differential \(\delta:D\to D\) such that \((d+\delta)^2 =0\), i.e.
\begin{equation*} [d,\delta]=0. \end{equation*}We ask, moreover, that \(\delta\) is a small perturbation. That is, we ask that the degree zero operator
\begin{equation*} (1-\delta h)^{-1} = \sum_{j=0}^\infty (\delta h)^j \end{equation*}be well-defined on \(D\). Under this technical condition, the perturbation can be ``transferred’’ to the left-hand side to obtain a new, perturbed SDR:
Let \(\delta\) be a small perturbation of \(d_D\). Then, given an SDR in the notation from above, there exists a perturbed SDR
\begin{equation*} \begin{xy} \xymatrix@C+=50pt{ (C,d_C+p(1-\delta h)^{-1}\delta) \ar@(ur, ul)[r]^{(1-h\delta)^{-1}i} & (D,d_D+\delta)\ar@(ul, ur)[]^{h+h(1-\delta h)^{-1}\delta h} \ar@(dl, dr)[l]^{p(1-\delta h)^{-1}} } \end{xy} \end{equation*}Straightforward, if tedious, computation. See, for instance, [Cra04].
We can now sketch the proof of the twisted Eilenberg-Zilber theorem. The (untwisted) Eilenberg-Zilber theorem of [EML54] gives us an SDR3
\begin{equation*} \begin{xy} \xymatrix{ C_*(B)\otimes C_*(F) \ar@(ur, ul)[r]^{i} & C_*(B\times F)\ar@(ul, ur)[]|{h} \ar@(dl, dr)[l]^{p} } \end{xy} \end{equation*}where the differential on the left is the usual differential on the tensor product. The differential on the right — call it \(d^\id\) — is the standard differential on the simplicial chains of \(B\times F\). Notice, now, that the underlying graded module of the complex \(C_*(B\times_\tau F)\) is just \(C_*(B\times F)\). The differential, however, is different — call it \(d^\tau\). The resulting perturbation satisfies the technical condition described above:
The perturbation \(d^\tau - d^\id\) of the differential \(d^\id\) on \(C_*(B\times F)\) is small.
We will indicate the idea of the proof. Filtering \(B\) by skeleta we obtain filtrations on all the algebraic gadgets above. Lemma 2 in Chapter II Section 2 of [Shi62] shows that \(d^\tau-d^\id\) decreases filtration degree. Hence the infinite sum \((1- (d^\tau-d^\id)h)^{-1}\) collapses to a finite sum and the perturbation is small.
Hence we may apply the homological perturbation lemma to transfer the perturbation to the left and obtain a new SDR:
\begin{equation*} \begin{xy} \xymatrix{ C_*(B)\otimes_\tau C_*(F) \ar@(ur, ul)[r]^{i'} & C_*(B\times_\tau F)\ar@(ul, ur)[]|{h'} \ar@(dl, dr)[l]^{p'} } \end{xy} \end{equation*}where the complex of the left is just
\begin{align*} (C_*(B)\otimes_\tau C_*(F), d) =&\, (C_*(B) \otimes C_*(F), d_{C_*(B)\otimes C_*(F)} \\ &+ p(1-(d^\tau-d^\id)h)^{-1}(d^\tau -d^\id)i). \end{align*}Thus we see that the chains \(C_*(B\times_\tau F)\) on the twisted Cartesian product \(B\times_\tau F\) can be written as a ``twist’’, or perturbation, of the tensor product \(C_*(B)\otimes C_*(F)\). This completes the proof of the twisted Eilenberg-Zilber theorem (we refer to Chapter II of [Shi62] for the full proof).
So we’ve seen that homological perturbation theory was born from the study of Kan fibrations in algebraic topology. Since then, however, there have been all sorts of applications across algebra, geometry, and physics. One thing in particular that I’ve been meaning to understand for a long time is its relationship with Feynman diagrams (see, for instance, [GJF12]). Hopefully I’ll get around to learning about that soon!
References
| [BGM59] | M. G. Barratt, V. K. A. M. Gugenheim, and J. C. Moore. On semisimplicial fibre-bundles. Amer. J. Math., 81:639--657, 1959. [ bib | DOI ] |
| [Bro59] | Edgar H. Brown, Jr. Twisted tensor products. I. Ann. of Math. (2), 69:223--246, 1959. [ bib | DOI ] |
| [Bro65] | R. Brown. The twisted Eilenberg-Zilber theorem. In Simposio di Topologia (Messina, 1964), pages 33--37. Edizioni Oderisi, Gubbio, 1965. [ bib ] |
| [Car58] | Henri Cartan. Sur la théorie de Kan. In Séminaire Henri Cartan; 9e année: 1956/57. Quelques questions de topologie, Exposé no. 1, page 19. Secrétariat mathématique, Paris, 1958. [ bib ] |
| [Cra04] | M. Crainic. On the perturbation lemma, and deformations. arXiv Mathematics e-prints, page math/0403266, March 2004. [ bib | arXiv ] |
| [EML54] | Samuel Eilenberg and Saunders Mac Lane. On the groups H(Π,n). II. Methods of computation. Ann. of Math. (2), 60:49--139, 1954. [ bib | DOI ] |
| [EZ53] | Samuel Eilenberg and J. A. Zilber. On products of complexes. Amer. J. Math., 75:200--204, 1953. [ bib | DOI ] |
| [GJ09] | Paul G. Goerss and John F. Jardine. Simplicial homotopy theory. Modern Birkhäuser Classics. Birkhäuser Verlag, Basel, 2009. Reprint of the 1999 edition [MR1711612]. [ bib | DOI ] |
| [GJF12] | Owen Gwilliam and Theo Johnson-Freyd. How to derive feynman diagrams for finite-dimensional integrals directly from the bv formalism. Topology and Quantum Theory in Interaction, in: Contemp. Math, 718:175--185, 2012. [ bib ] |
| [Shi62] | Weishu Shih. Homologie des espaces fibrés. Inst. Hautes Études Sci. Publ. Math., (13):88, 1962. [ bib ] |
Footnotes:
Here \(C_*(X)=C_*(X, R)\) for a ring \(R\) that we will leave implicit. As we will work with simplicial sets instead of spaces, \(C_*(X_\bullet)\) is really the normalized simplicial chain complex of a simplicial set \(X_\bullet\).
Earlier we referred to a paper of Eilenberg and Zilber where the theorem is proved using the method of acyclic models. Here we refer to a paper of Eilenberg and Mac Lane in which the proof is made explicit via an SDR (roughly what they call a ``contraction’’).


Editing the Club's website
This website is powered the Academic theme for Hugo. The documentation they provide is quite extensive, so we summarize some of the important features relevant to the current website and present workflow ideas on how to update the website.
Hugo and Markdown
While the website consists of html
source interpreted by the visitor’s browser, its content is generated from Markdown. Hugo acts as an interpreter and compiler: it translates the file structure, the Markdown files and some configuration files (yaml
or toml
) into the html
files visible to the visitor.
Repository description
The website is hosted on GitHub Pages. The static contents of the website appears in the docs
folder of the UmichStatistics GitHub organization repository ComputingClub. The other folders and files of the repository are used to generate the website: only the docs
folder is necessary for the static website to be operational.
Deployment
Any change in the files outside of the docs
folder will not affect the public website. In order for the changes to become public, it is necessary to deploy the website, i.e. to use Hugo to update the files in docs
. Hence, anyone updating the website needs to run Hugo for the changes to appear. More details in Deployment
The maintainers are currently considerings ways to automatically deploy the website upon a push to the repository. More to come…


Bio::KBase::KBaseProteinStructure::KBaseProteinStructureClient
Module KBaseProteinStructure v0.1 This service provides PDB structure ids which correspond to KBase protein sequences. In cases where there is exact match to a PDB sequence, close matches (via BLASTP) are reported.
There are two methods or function calls: lookup_pdb_by_md5 - accepts one or more MD5 protein identifiers lookup_pdb_by_fid - accepts one or more feature ids (or CDS id) Both return a table of matches which include PDB id, 1 or 0 for exact match, percent identity and alignment length.
$results = $obj->lookup_pdb_by_md5($input_ids)
$input_ids is a md5_ids_t $results is a md5_to_pdb_matches md5_ids_t is a reference to a list where each element is a md5_id_t md5_id_t is a string md5_to_pdb_matches is a reference to a hash where the key is a md5_id_t and the value is a PDBMatches PDBMatches is a reference to a list where each element is a PDBMatch PDBMatch is a reference to a hash where the following keys are defined: pdb_id has a value which is a pdb_id_t chains has a value which is a chains_t exact has a value which is an exact_t percent_id has a value which is a percent_id_t align_length has a value which is an align_length_t pdb_id_t is a string chains_t is a string exact_t is an int percent_id_t is a float align_length_t is an int
of each to a list of PDBMatch records
$results = $obj->lookup_pdb_by_fid($feature_ids)
$feature_ids is a feature_ids_t $results is a fid_to_pdb_matches feature_ids_t is a reference to a list where each element is a feature_id_t feature_id_t is a string fid_to_pdb_matches is a reference to a hash where the key is a feature_id_t and the value is a PDBMatches PDBMatches is a reference to a list where each element is a PDBMatch PDBMatch is a reference to a hash where the following keys are defined: pdb_id has a value which is a pdb_id_t chains has a value which is a chains_t exact has a value which is an exact_t percent_id has a value which is a percent_id_t align_length has a value which is an align_length_t pdb_id_t is a string chains_t is a string exact_t is an int percent_id_t is a float align_length_t is an int
of each to a list of PDBMatch records
KBase protein MD5 id
a string
list of protein MD5s
a reference to a list where each element is a md5_id_t
KBase feature id, ala "kb|g.0.peg.781"
a string
list of feature ids
a reference to a list where each element is a feature_id_t
PDB id
a string
subchains of a match, i.e. "(A,C,D)"
a string
1 (true) if exact match to pdb sequence
an int
% identity from BLASTP matches
a float
BLASTP alignment length
an int
returned data from match
a reference to a hash where the following keys are defined: pdb_id has a value which is a pdb_id_t chains has a value which is a chains_t exact has a value which is an exact_t percent_id has a value which is a percent_id_t align_length has a value which is an align_length_t
list of match records
a reference to a list where each element is a PDBMatch
a reference to a hash where the key is a md5_id_t and the value is a PDBMatches
a reference to a hash where the key is a feature_id_t and the value is a PDBMatches


In the world of infodemocracy, this is a phenomenon which the experts call "multilogual cacophony." It means that everyone is trying to talk at once, and nobody is paying any attention to any one else. Except for the guy whose job is to pay attention to everyone. Tough job, but somebody's got to do it.
The lads down in Network Services gave me a diablito program that allows me to screen, sort, and sift through my e-mail so that I can intelligently respond to people in order of priority and importance. This program works pretty well, but it does have its drawbacks. For one thing, first-contact messages are all automatically assigned 3A priority. After I assign a numerical value to the author, it's a different matter.
We have a saying in this business: "You never get a second chance to make a first contact." I kind of like that. It forces people to be polite and to write intelligently; otherwise, they get relegated by the diablitos down to a circle of Dante's hell where they can say anything they want, but no one will listen to them.
Anyway, about 10% of my e-mail on any given day is 3A, so I still have to saw through an average of 600 messages. You would think that after five years, the number of first-contacts would have diminished to almost zero. Unfortunately the vCity population growth rate canceled out all my efforts, and I still get about 600 of the 3As each day.
If I spent one minute reading each with no response at all, I would have to spend ten hours online with no bathroom break. Given that there is more e-mail than that, and that I need to respond to someone once in a while, I once calculated that I would have to spend roughly thirty-one hours each day reading & replying to e-mail. Clearly an unacceptable, not to mention mathematically impossible, situation.
The diablitos provide some partial relief by analyzing content and replying with pre-packaged "answergrams." This is what politicians used to do years ago to assure that every one of their constituents received a reply in the snailmail. It's a horrifying thought, isn't it? In infodemocracy, everyone is a politician. Actually things are not as bad as that. The solution is very simple -- not every message needs a reply.
 The rest of my work day I can devote to inspection tours.
The name diablito, by the way, caught on in a funny way. When our corporation decided it wanted to market a software "filter" for e-mail, marketing wanted an original name for our product. The obvious ones, like GateKeeper or WatchMan, were already taken. Someone suggested Warden, but that was vetoed on the grounds that it would be tough to market a product that implied that the customer was in prison.
"What about Flapper?" I volunteered.
Everyone around the table stared at me blankly. Not one person in that group had read Swift.
At that point, the COO (Chief Operating Officer), our "Number Two" in the corporation, was playing around with the alpha version. "Ha!" he grunted.


{{Infobox prepared food | name = Semifreddo | image = | imagesize = | caption = | alternate_name = | country = Italy | region = | creator = | course = Dessert | served = | main_ingredient = gelato | variations = | calories = | other = }}Semifreddo ({{IPA-it|semiˈfreddo|pron}}, {{lang-it|half cold}}) is a class of semi-frozen desserts. The principle ingredients are usually eggs, sugar and cream. It has the texture of frozen mousse. Such a dessert's Spanish counterpart is called semifrío.<ref name="HerbstHerbst2009">{{cite book |author1=Sharon Tyler Herbst |author2=Ron Herbst |title=The Deluxe Food Lover's Companion |url=http://books.google.com/books?id=T6vP9smG2IwC |year=2009 |publisher=Barron's snippet |isbn=978-0-7641-6241-1 |page=392}}</ref><ref name="Sinclair2009">{{cite book |author=Charles Sinclair |title=Dictionary of Food: International Food and Cooking Terms from A to Z |url=http://books.google.com/books?id=Mdwm7jI9J10C&pg=PT1202 |date=1 January 2009 |publisher=Bloomsbury Publishing |isbn=978-1-4081-0218-3 |pages=1202}}</ref> In Italian cuisine, the semifreddo is commonly made with gelato as a primary ingredient {{dubious|date=November 2015}} It is often called an ice-cream cake, but a true ice-cream cake has layers of cake & ice-cream.
{{Reflist}}
{{ice cream cake}}
{{dessert-stub}} {{Italy-cuisine-stub}}


|
JQ8400 MP3 Player Arduino Library
A simple library to control a JQ8400 MP3 Player Module from an Arduino.
|
Simple to use Arduino library to interface to JQ8400 (JQ8400-FL, JQ8400-TF) Mp3 Player Modules
Table of Contents
| JQ8400-TF | JQ8400-FL |
|---|---|
The JQ8400_Serial library can be configured to talk through any "Serial" port, including "SoftwareSerial", anything that is a Stream.
Most commonly you will use a SoftwareSerial with typical "AVR" based Arduinos that only have one hardware seral port. For Arduino's (and related, like ESP32) that have more than one hardware serial port you will typically want to use one of those instead of SoftwareSerial.
The most important consideration is that if your Arduino is 5 volt, you will want to put a 1k resistor on the RX pin of the JQ8400 and the Arduino's appropriate TX pin you are using.
Below are some examples to help you.
This is the typical setup where you have an Arduino Uno or Nano etc which only has one "Hardware" serial port and you use that to upload and communicate to the Arduino yourself, therefore we use a SoftwareSerial connection to communicate between the Arduino and the JQ8400 Module.
| JQ8400 Module | Arduino |
|---|---|
| RX | through a 1K Resistor then to pin 9 |
| TX | pin 8 |
| GND (any of) | GND |
| VCC (any of) | VCC |
| JQ8400 Module | Arduino |
|---|---|
| RX | pin 9 |
| TX | pin 8 |
| GND (any of) | GND |
| VCC (any of) | VCC |
You can use pins other than 9 and 8 if you wish, simply set them in your code, which looks something like this...
#include <SoftwareSerial.h> SoftwareSerial mySerial(8,9); #include <JQ8400_Serial.h> JQ8400_Serial mp3(mySerial); void setup() { mySerial.begin(9600); // We must talk to the JQ8400 at 9600 mp3.reset(); // Reset the device (optional, recommended) } void loop() { // You should do more interesting stuff than just this... mp3.next(); while(mp3.busy()); // Wait until finished. }
This is a typical setup where your Arduino environment has more than one "Serial", and you want to use one of those to communicate to the JQ8400, leaving the normal "Serial" free for uploading, communication to the Arduino etc...
| JQ8400 Module | Arduino |
|---|---|
| RX | through a 1K Resistor then to appropriate TX pin |
| TX | RX pin |
| GND (any of) | GND |
| VCC (any of) | VCC |
| JQ8400 Module | Arduino |
|---|---|
| RX | appropriate TX pin |
| TX | appropriate RX pin |
| GND (any of) | GND |
| VCC (any of) | VCC |
| JQ8400 Module | ESP32 |
|---|---|
| RX | GPIO17 |
| TX | GPIO16 |
| GND (any of) | GND |
| VCC (any of) | VCC |
#include <JQ8400_Serial.h> JQ8400_Serial mp3(Serial2); void setup() { Serial2.begin(9600); // We must talk to the JQ8400 at 9600 - maybe you need to add some extra parameters to begin, consult your specific board's documents if you have trouble. mp3.reset(); // Reset the device (optional, recommended) } void loop() { // You should do more interesting stuff than just this... mp3.next(); while(mp3.busy()); // Wait until finished. }
People have problems in about this order...
This section is for users of previous JQ6500 devices and the JQ6500_Serial library who are transitioning to a JQ8400 with JQ8400_Serial library.
As much as possible the JQ8400_Serial library should follow the same "api", with some additions, however there are some "breaking changes" you should be aware of...
Example for software serial on pins 8 and 9...
#include <SoftwareSerial.h> SoftwareSerial mySerial(8,9);
#include <JQ8400_Serial.h> JQ8400_Serial mp3(mySerial);
void setup() { mySerial.begin(9600); mp3.reset(); }
Example over microcontroller's default hardware serial port...
#include <JQ8400_Serial.h> JQ8400_Serial mp3;
void setup() { Serial.begin(9600); mp3.begin(Serial); }
Example over microcontroller's other hardware serial port...
#include <JQ8400_Serial.h> JQ8400_Serial mp3;
void setup() { Serial2.begin(9600); mp3.begin(Serial2); }
countFolders()
at all (AFAIK) therefore this method is not available..countFiles
- that is use mp3.countFiles()
not mp3.countFiles(MP3_SRC_SDCARD)
, use mp3.setSource(MP3_SRC_SDCARD)
to change the source before counting if you are not already on that source.


Navigation
Home Page
Settings
Put anything here
Flask-Angular-Bootstrap with Cards
Basic homepage. Nav and Settings embedded in pageslides.
Nav
Settings


2 days prior to this I took 2 50mg capsules containing tramadol out of boredom and to help me sleep, I was never prescribed these and until this morning had about 50 in my possession (Iíve destroyed them for the sake of my own health)which were taken from a family member who had finished with their treatment for back pain.
 So after about half of the next day I popped another 50mg and went outside to mow the lawn, feeling fine; pretty relaxed and content. Later that evening my friend and I organize to pick up some bud and we set off to pick it up, I've forgotten that I even took the tramadol and am more interested in settling down for the evening after a couple joints and playing some gamecube, not so.
The first joint was fine, perhaps it wasn't so strong but it just mellowed me out in a nice normal way, as weed does. After that we played some gamecube and I made another spliff, I also made sure it was packed because I thought it was pretty average stuff (itís not, its some strong purple variety which Iíd mistaken for lower quality darkish stuff). I smoke half, pass it to my mate and then sit down to chill for a bit..... uh oh.
Next thing I know I feel a bit like Iím coming up on something really strong and I think to myself 'oh my god, that weed is OK !' then I remember the tramadol and I think 'oh my god, I forgot I took tramadol, I hope Iíll be ok..' but I begin to notice differences in my breathing like its really shallow and feels like the air just wasnít getting to my head, I also felt like my heart had stopped beating and as I begin to worry I get a release of adrenaline rushing from my torso right through my body then hitting my head, so I started concentrating on relaxing and went out the room and splashed my face with a bit of cold water, which helped for a bit but then I start shuddering all over like Iíve just been pulled from a bath of ice-water, I tried and tried to relax and get rid of the shivering but it just continued then concentrated within my legs.
I went back through to my room and told my friend I was going to bed, then I got into bed and wrapped myself in the covers, I was still having tremours and the sort of awful anxiety and panic usually associated with bad trips hallucinogens. My legs continued shaking involuntarily until I managed to relax more and the smoke had worn off, then I remembered that I had also taken some valerian/hops complex in the morning(unknown dosage of liquid extract), I thought maybe that had something to do with it, though Iím not sure. I really had to keep my mind at rest and not think about it too much as that just brought on the intense adrenaline rushes and they made me shake more, sometimes my head would jerk and Iíd get the same adrenaline feeling.
My body felt, well it didn't feel I was numb, I just lay there telling myself Iíd be fine if I relaxed and waited for the THC to wear off, It took forever to stop bits of my body shaking, mainly my arms, lower torso and legs, as well as occasional twitches in my head, I wanted to cry, I nearly lost it and gave in, god knows what would have happened if id given into the tremours. My vision was slightly distorted too, and my head felt like my brain was being squeezed from the inside, which had the effect of making my nose feel like it was splitting down the middle, i fought to stay relaxed and managed to eventually get my body under control, it was a mentally and physically draining experience which left me worried and exhausted.
I fell asleep.
 I told a friend about it on the net then went back to bed and slept until midday. As I write this I am deeply regretful for taking the tramadol it was a stupid thing to do and my experience with tremours and the feeling of not being able to control them or do anything about the repeating spasms in my legs not to mention the fact that I could literally feel my body was very close to having a seizure were purely terrifying.
In conclusion, although on it own tramadol provided a cheap and nasty escape I would never ever ever put it in my system ever again.
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.


{{=T("Recent submissions") if total_rows else T("Get Started")}}
{{end}}
{{=T("Update your Country")}}
Please update your Country, we have added Country-wise Leaderboards :)
{{=country_form}}
Contribute and earn Gift Cards :)
Write how you solved a problem on StopStalk. Climb up the leaderboard and win Amazon Gift Cards - Know More.
{{if total_rows:}}
{{=T("Recent submissions")}}
{{if len(current.REDIS_CLIENT.smembers("disabled_retrieval")):}}
Disabled retrieval for {{=utilities.pretty_string(current.REDIS_CLIENT.smembers("disabled_retrieval"))}} due to their downtime.
{{pass}}
Please take some time to fill out this {{=A("Survey Form", _href="http://goo.gl/oeLZHd", _target="_blank")}}
{{=table}}
{{else:}}
{{if len(current.REDIS_CLIENT.smembers("disabled_retrieval")):}}
Disabled retrieval for {{=utilities.pretty_string(current.REDIS_CLIENT.smembers("disabled_retrieval"))}} due to their downtime.
{{pass}}
{{include 'onboarding.html'}}
{{pass}}


Please sign in
Email address
Password
Sign in
id<EMAIL_ADDRESS>password: passowrd (all account)
© 2017-2018 https://github.com/NARH


Rustc-1.22.1
Introduction to Rust
The Rust programming language is
designed to be a safe, concurrent, practical language.
As with many other programming languages, rustc (the rust compiler)
needs a binary from which to bootstrap. It will download a stage0
binary, and several cargo files (these are actually .tar.gz source
archives) at the start of the build, so you cannot compile it
without an internet connection.
The current rustbuild build-system
will use all available processors, although it does not scale well
and often falls back to just using one core while waiting for a
library to compile.
At the moment Rust does not
provide any guarantees of a stable ABI.
Note
Repeated builds of this package on the same machine show a wide
range of build times. Some of this might be due to variations in
downloading the required cargo files if they are not already
present, but this does not seem to adequately explain the
variations. Also, both the builder and the user running the
install will need to download the cargo crates if they are not
already present in ~/.cargo
.
If you use a DESTDIR method to install, you will only need to
download the crates once, for the build, saving about one-third
of the build and install time (but using extra space for the
install). Similarly if you were to build as root, or if your user
is allowed to run sudo ./x.py
install - but those methods are dangerous.
This package is known to build and work properly using an LFS-8.2
platform.
Package Information
-
Download (HTTP): https://static.rust-lang.org/dist/rustc-1.22.1-src.tar.gz
-
Download MD5 sum: 7272ddba14f512e6d2612ef60460bed8
-
Download size: 53 MB
-
Estimated disk space required: 4.1 GB (437 MB installed),
(add 1.2GB for tests) including 226MB of ~/.cargo files for
both the builder and root (from the install)
-
Estimated build time: 48 SBU (add 12 SBU for tests, both with
4 processors)
Rust Dependencies
Required
cURL-7.58.0, CMake-3.10.2, Python-2.7.14
Optional
GDB-8.1 (used
by debuginfo-gdb in the testsuite)
User Notes: http://wiki.linuxfromscratch.org/blfs/wiki/rust
Installation of Rust
Note
This package is updated on a six-weekly release cycle. Because it
is such a large and slow package to build, and is at the moment
only used by two packages in this book, the BLFS editors take the
view that it should only be updated when that is necessary.
First create a suitable config.toml
file which will configure the build :
cat <<EOF > config.toml
# see config.toml.example for more possible options
[llvm]
targets = "X86"
[build]
# install cargo as well as rust
extended = true
[install]
prefix = "/usr"
docdir = "share/doc/rustc-1.22.1"
[rust]
channel = "stable"
rpath = false
EOF
Now install Rust by running the
following commands:
./x.py build
To run the tests issue ./x.py test
--verbose --no-fail-fast >../rustc-testlog: as
with the build, that will use all available CPUs. This runs many
suites of tests (in an apparently random order), three may fail:
compile-fail/issue-37131.rs and run-make/target-without-atomics
both try to compile for the thumbv6m-none-eabi target, but the BLFS
build does not cater for that, and all 105 tests in debuginfo-gdb
will fail if gdb has not been
installed. Several other tests in run-make can also fail. With
glibc-2.27 the stack guard page
has been moved to just beyond the stack, instead of within it. That
causes three run-pass tests (out-of-stack.rs, stack-probes-lto.rs,
stack-probes.rs) to fail.
If you wish to look at the numbers for the results, you can find
the total number of tests which were considered by running:
grep 'running .* tests' ../rustc-testlog | awk '{ sum += $2 } END { print sum }'
That should report 14854 tests. Similarly, the total tests which
failed can be found by running:
grep '^test result:' ../rustc-testlog | awk '{ sum += $6 } END { print sum }'
And similarly for the tests which passed use $4, for those which
were ignored (i.e. skipped) use $8 (and $10 for 'measured', $12 for
'filtered out' but both are probably zero). The breakdown does not
match the overall total.
Now, as the root
user:
./x.py install
Command Explanations
targets = "X86": this
avoids building all the available linux cross-compilers (Aarch64,
MIPS, PowerPC, SystemZ, etc).
extended = true: this
installs Cargo alongside Rust.
channel = "stable":
this ensures only stable features can be used, the default in
config.toml
is to use development
features, which is not appropriate for a released version.
rpath = false: by
default, rust can be
run from where it was built, without being installed. That adds
DT_RPATH entries to all of the ELF files, which produces very messy
output from ldd,
showing the libraries in the place they were built, even if they
have been deleted from there after the install.
--verbose: this
switch can sometimes provide more information about a test which
fails.
--no-fail-fast: this
switch ensures that the testsuite will not stop at the first error.
PYTHON=/usr/bin/python3 ... tee
buildlog
: Because rust can use Python3 which was installed in LFS, this
command tells it to use that instead of the deprecated Python2. For the moment this should be
regarded as experimental and problems may be encountered. Because
rust will use all CPUs, if an
error happened the message may have scrolled out of the terminal's
buffer. Logging makes it possible to find out what was reported.
Contents
Installed Programs:
cargo, rls, rust-gdb, rust-lldb, rustc,
rustdoc.
Installed Libraries:
Many lib*<16-byte-hash>.so
libraries.
Installed Directories:
~/.cargo, /usr/lib/rustlib,
/usr/share/doc/rustc-1.22.1, and
/usr/share/zsh/site-functions/
Short Descriptions
|
cargo
|
is the Package Manager for Rust.
|
|
rls
|
is the Rust Language Server. This can run in the
background to provide IDEs, editors, and other tools with
information about Rust programs.
|
|
rust-gdb
|
is a Python wrapper script for gdb.
|
|
rust-lldb
|
is a Python wrapper script for LLDB (the LLVM debugger).
|
|
rustc
|
is the rust compiler.
|
|
rustdoc
|
generates documentation from rust source code.
|
|
libstd-<16-byte-hash>.so
|
is the Rust Standard Library, the foundation of portable
Rust software.
|
Last updated on 2018-02-26 01:09:38 -0800


Tomáš Raděj / @tomasradej
Automation tool for tasks related to developing code
Installer for dependencies not mentioned elsewhere
Platform for sharing (portable) scripts
Ansible, Forge, Puppet
Replacement for system dependency installers
Shell script runner
Portable vs. Ad hoc
Extensible vs. Static
Readable vs. oh well...
function linkify( selector ) {
if( supports3DTransforms ) {
var nodes = document.querySelectorAll( selector );
for( var i = 0, len = nodes.length; i < len; i++ ) {
var node = nodes[i];
if( !node.className ) {
node.className += ' roll';
}
}
}
}
Courtesy of highlight.js.
You can link between slides internally, like this.
Hit the next arrow...
... to step through ...
any type
There's a few styles of fragments, like:
grow
shrink
roll-in
fade-out
highlight-red
highlight-green
highlight-blue
current-visible
highlight-current-blue
Presentations can be exported to PDF, below is an example that's been uploaded to SlideShare.
Press b or period on your keyboard to enter the 'paused' mode. This mode is helpful when you want to take distracting slides off the screen during a presentation.


Password reset complete
Your new password has been set. You can log in now on the log in page.
{% extends 'common/_base.tmpl' %} {% block title %}Password reset complete{% endblock %} {% block body_contents %}
Your new password has been set. You can log in now on the log in page.


Practo Technologies Pvt Ltd
Salarpuria Symbiosis
Arekere Village Begur,
Bannerghatta Main Rd,
Bengaluru - 560076
Landmark: Opp BPL Medical Technologies Pvt. Ltd.
No-2B 2nd floor, Inwinex Tower,
Plot-No-227/B Door No- 8-2-277/B,
Banjara Hills, Road No - 2,
Hyderabad - 500034
# 205, Second Floor, Mehta Estate,
Andheri Kurla Road, Andheri East
Opp Chintamani Plaza
Mumbai - 400 093
2F, 2nd Floor, Gopala Towers,
Rajendra Place New Delhi - 110 055
#68, 3rd Floor,
State Bank of Mysore Building,
CP Ramasamy Road, Alwarpet,
Chennai - 600018
Practo Pte Ltd
Office No.6, 13th floor,
P.O Box No.31704,Budget Business Center,
Aspin Commercial Tower, Trade Center 1st,
Sheikh Zayed Road, Dubai, UAE.
Practo Pte Ltd
Building No. 5, Office No. 306,
Al Rossais Building, Al Dhabbab Street,
Beside Riyadh Chambers
Riyadh 11443. Saudi Arabia.


|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface XPathHandler
Interface for event-based XPath parsing.
A XPathReader
generates callbacks into
an XPathHandler
to allow for custom
handling of the parse.
The callbacks very closely match the productions listed in the W3C XPath specification. Gratuitous productions (e.g. Expr/startExpr()/endExpr()) are not included in this API.
| Method Summary | |
|---|---|
void |
endAbsoluteLocationPath()
Receive notification of the end of an absolute location path expression. |
void |
endAdditiveExpr(int additiveOperator)
Receive notification of the end of an additive ('+' or '-') expression. |
void |
endAllNodeStep()
Receive notification of the end of a node() step. |
void |
endAndExpr(boolean create)
Receive notification of the end of an 'and' expression. |
void |
endCommentNodeStep()
Receive notification of the end of a comment() step. |
void |
endEqualityExpr(int equalityOperator)
Receive notification of the end of an equality ('=' or '!=') expression. |
void |
endFilterExpr()
Receive notification of the end of a filter expression. |
void |
endFunction()
Receive notification of the end of a function call |
void |
endMultiplicativeExpr(int multiplicativeOperator)
Receive notification of the start of a multiplicative ('*', 'div' or 'mod') expression. |
void |
endNameStep()
Receive notification of the end of a NameStep |
void |
endOrExpr(boolean create)
Receive notification of the end of an 'or' expression. |
void |
endPathExpr()
Receive notification of the end of a path expression. |
void |
endPredicate()
Receive notification of the end of a predicate. |
void |
endProcessingInstructionNodeStep()
Receive notification of the end of a processing-instruction(...) step. |
void |
endRelationalExpr(int relationalOperator)
Receive notification of the start of a relational ('<', '>', '<=', or '>=') expression. |
void |
endRelativeLocationPath()
Receive notification of the end of a relative location path expression. |
void |
endTextNodeStep()
Receive notification of the end of a text() step. |
void |
endUnaryExpr(int unaryOperator)
Receive notification of the end of a unary ('+' or '-') expression. |
void |
endUnionExpr(boolean create)
Receive notification of the end of a union ('|') expression. |
void |
endXPath()
Receive notification of the end of an XPath expression parse. |
void |
literal(String literal)
Receive notification of a literal expression. |
void |
number(double number)
Receive notification of a number expression. |
void |
number(int number)
Receive notification of a number expression. |
void |
startAbsoluteLocationPath()
Receive notification of the start of an absolute location path expression. |
void |
startAdditiveExpr()
Receive notification of the start of an additive ('+' or '-') expression. |
void |
startAllNodeStep(int axis)
Receive notification of the start of a node() step. |
void |
startAndExpr()
Receive notification of the start of an 'and' expression. |
void |
startCommentNodeStep(int axis)
Receive notification of the start of a comment() step. |
void |
startEqualityExpr()
Receive notification of the start of an equality ('=' or '!=') expression. |
void |
startFilterExpr()
Receive notification of the start of a filter expression. |
void |
startFunction(String prefix,
String functionName)
Receive notification of a function call. |
void |
startMultiplicativeExpr()
Receive notification of the start of a multiplicative ('*', 'div' or 'mod') expression. |
void |
startNameStep(int axis,
String prefix,
String localName)
Receive notification of the start of a name step. |
void |
startOrExpr()
Receive notification of the start of an 'or' expression. |
void |
startPathExpr()
Receive notification of the start of a path expression. |
void |
startPredicate()
Receive notification of the start of a predicate. |
void |
startProcessingInstructionNodeStep(int axis,
String name)
Receive notification of the start of a processing-instruction(...) step. |
void |
startRelationalExpr()
Receive notification of the start of a relational ('<', '>', '<=', or '>=') expression. |
void |
startRelativeLocationPath()
Receive notification of the start of a relative location path expression. |
void |
startTextNodeStep(int axis)
Receive notification of the start of a text() step. |
void |
startUnaryExpr()
Receive notification of the start of a unary ('+' or '-') expression. |
void |
startUnionExpr()
Receive notification of the start of a union ('|') expression. |
void |
startXPath()
Receive notification of the start of an XPath expression parse. |
void |
variableReference(String prefix,
String variableName)
Receive notification of a variable-reference expression. |
| Method Detail |
|---|
void startXPath() throws SAXPathException
SAXPathException
void endXPath() throws SAXPathException
SAXPathException
void startPathExpr() throws SAXPathException
SAXPathException
void endPathExpr() throws SAXPathException
SAXPathException
void startAbsoluteLocationPath() throws SAXPathException
SAXPathException
void endAbsoluteLocationPath() throws SAXPathException
SAXPathException
void startRelativeLocationPath() throws SAXPathException
SAXPathException
void endRelativeLocationPath() throws SAXPathException
SAXPathException
void startNameStep(int axis, String prefix, String localName) throws SAXPathException
axis
- the axis of this stepprefix
- the namespace prefix for the name to test,
or the empty string if no prefix is specifiedlocalName
- the local part of the name to test
SAXPathException
void endNameStep() throws SAXPathException
SAXPathException
void startTextNodeStep(int axis) throws SAXPathException
axis
- the axis of this step
SAXPathException
void endTextNodeStep() throws SAXPathException
SAXPathException
void startCommentNodeStep(int axis) throws SAXPathException
axis
- the axis of this step
SAXPathException
void endCommentNodeStep() throws SAXPathException
SAXPathException
void startAllNodeStep(int axis) throws SAXPathException
axis
- the axis of this step
SAXPathException
void endAllNodeStep() throws SAXPathException
SAXPathException
void startProcessingInstructionNodeStep(int axis, String name) throws SAXPathException
axis
- the axis of this stepname
- the name of the processing-instruction, or
the empty string if none is specified
SAXPathException
void endProcessingInstructionNodeStep() throws SAXPathException
SAXPathException
void startPredicate() throws SAXPathException
SAXPathException
void endPredicate() throws SAXPathException
SAXPathException
void startFilterExpr() throws SAXPathException
SAXPathException
void endFilterExpr() throws SAXPathException
SAXPathException
void startOrExpr() throws SAXPathException
SAXPathException
void endOrExpr(boolean create) throws SAXPathException
create
- flag that indicates if this expression
should truly be instantiated, or if it was just
a pass-through, based upon the grammar productions
SAXPathException
void startAndExpr() throws SAXPathException
SAXPathException
void endAndExpr(boolean create) throws SAXPathException
create
- flag that indicates if this expression
should truly be instantiated, or if it was just
a pass-through, based upon the grammar productions
SAXPathException
void startEqualityExpr() throws SAXPathException
SAXPathException
void endEqualityExpr(int equalityOperator) throws SAXPathException
equalityOperator
- the operator specific to this particular
equality expression. If null, this expression
is only a pass-through, and should not actually
be instantiated.
SAXPathException
void startRelationalExpr() throws SAXPathException
SAXPathException
void endRelationalExpr(int relationalOperator) throws SAXPathException
relationalOperator
- the operator specific to this particular
relational expression. If NO_OP, this expression
is only a pass-through, and should not actually
be instantiated.
SAXPathException
void startAdditiveExpr() throws SAXPathException
SAXPathException
void endAdditiveExpr(int additiveOperator) throws SAXPathException
additiveOperator
- the operator specific to this particular
additive expression. If NO_OP, this expression
is only a pass-through, and should not actually
be instantiated.
SAXPathException
void startMultiplicativeExpr() throws SAXPathException
SAXPathException
void endMultiplicativeExpr(int multiplicativeOperator) throws SAXPathException
multiplicativeOperator
- the operator specific to this particular
multiplicative expression. If null, this expression
is only a pass-through, and should not actually
be instantiated.
SAXPathException
void startUnaryExpr() throws SAXPathException
SAXPathException
void endUnaryExpr(int unaryOperator) throws SAXPathException
unaryOperator
- the operator specific to this particular
unary expression. If NO_OP, this expression is only
a pass-through, and should not actually be instantiated.
If not Operator.NO_OP
, it will
always be Operator.NEGATIVE
.
SAXPathException
void startUnionExpr() throws SAXPathException
SAXPathException
void endUnionExpr(boolean create) throws SAXPathException
create
- flag that indicates if this expression
should truly be instantiated, or if it was just
a pass-through, based upon the grammar productions
SAXPathException
void number(int number) throws SAXPathException
number
- the number value
SAXPathException
void number(double number) throws SAXPathException
number
- the number value
SAXPathException
void literal(String literal) throws SAXPathException
literal
- the string literal value
SAXPathException
void variableReference(String prefix, String variableName) throws SAXPathException
prefix
- the namespace prefix of the variablevariableName
- the local name of the variable
SAXPathException
void startFunction(String prefix, String functionName) throws SAXPathException
prefix
- the namespace prefix of the functionfunctionName
- the local name of the function
SAXPathException
void endFunction() throws SAXPathException
SAXPathException
|
||||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | |||||||||
| SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |


Affective Decoding for Empathetic Response Generation
Chengkun Zeng, Guanyi Chen, Chenghua Lin, Ruizhe Li and Zhi gang Chen
Attention Is Indeed All You Need: Semantically Attention-Guided Decoding for Data-to-Text NLG
Juraj Juraska and Marilyn Walker
BERT-based distractor generation for Swedish reading comprehension questions using a small-scale dataset
Dmytro Kalpakchi and Johan Boye
Biomedical Data-to-Text Generation via Fine-Tuning Transformers
Ruslan Yermakov, Nicholas Drago and Angelo Ziletti
Chefbot: A Novel Framework for the Generation of Commonsense-enhanced Responses for Task-based Dialogue Systems
Carl Strathearn and Dimitra Gkatzia
Contextualizing Variation in Text Style Transfer Datasets
Stephanie Schoch, Wanyu Du and Yangfeng Ji
Controllable Sentence Simplification with a Unified Text-to-Text Transfer Transformer (T5)
Kim Cheng SHEANG and Horacio Saggion
Decoding, Fast and Slow: A Case Study on Balancing Trade-Offs in Incremental, Character-level Pragmatic Reasoning
Sina Zarrieß, Hendrik Buschmeier, Ting Han and Simeon Schüz
Enriching the E2E dataset
Thiago Castro Ferreira, Helena Vaz, Brian Davis and Adriana Pagano
Examining Covert Gender Bias: A Case Study in Turkish and English Machine Translation Models
Chloe Ciora, Nur Iren and Malihe Alikhani
Explaining Decision-Tree Predictions by Addressing Potential Conflicts between Predictions and Plausible Expectations
Sameen Maruf, Ingrid Zukerman, Ehud Reiter and Gholamreza Haffari
Exploring Input Representation Granularity for Generating Questions Satisfying Question-Answer Congruence
Madeeswaran Kannan, Haemanth Santhi Ponnusamy, Kordula De Kuthy, Lukas Stein and Detmar Meurers
Exploring Structural Encoding for Data-to-Text Generation
Joy Mahapatra and Utpal Garain
Formulating Sentence Ordering as the Asymmetric Travelling Salesman Problem
Vishal Keswani and Harsh Jhamtani
Generating Diverse Descriptions from Semantic Graphs
Jiuzhou Han, Daniel Beck and Trevor Cohn
Generating Racing Game Commentary from Vision, Language, and Structured Data
Tatsuya Ishigaki, Goran Topic, Yumi Hamazono, Hiroshi Noji, Ichiro Kobayashi, Yusuke Miyao and Hiroya Takamura
Goal-Oriented Script Construction
Qing Lyu, Li Zhang and Chris Callison-Burch
GraphPlan: Story Generation by Planning with Event Graph
Hong Chen, Raphael Shu, Hiroya Takamura and Hideki Nakayama
HI-CMLM: Improve CMLM with Hybrid Decoder Input
Minghan Wang, GUO Jiaxin, Yuxia Wang, Yimeng Chen, Su Chang, Daimeng Wei, Min Zhang, Shimin Tao and Hao Yang
Multi-Sentence Knowledge Selection in Open-Domain Dialogue
Mihail Eric, Nicole Chartier, Behnam Hedayatnia, Karthik Gopalakrishnan, Pankaj Rajan, Yang Liu and Dilek Hakkani-Tur
Neural Methodius Revisited: Do Discourse Relations Help with Pre-Trained Models Too?
Aleksandre Maskharashvili, Symon Stevens-Guille, Xintong Li and Michael White
Predicting Antonyms in Context using BERT
Ayana Niwa, Keisuke Nishiguchi and Naoaki Okazaki
SAPPHIRE: Approaches for Enhanced Concept-to-Text Generation
Steven Y. Feng, Jessica Huynh, Chaitanya Prasad Narisetty, Eduard Hovy and Varun Gangal
Self-Training for Compositional Neural NLG in Task-Oriented Dialogue
Xintong Li, Symon Stevens-Guille, Aleksandre Maskharashvili and Michael White
Single Example Can Improve Zero-Shot Data Generation
Pavel Burnyshev, Valentin Malykh, Andrey Bout, Ekaterina Artemova and Irina Piontkovskaya
Towards Zero-Shot Multilingual Synthetic Question and Answer Generation for Cross-Lingual Reading Comprehension
Siamak Shakeri, Noah Constant, Mihir Kale and Linting Xue
Underreporting of errors in NLG output, and what to do about it
Emiel van Miltenburg, Miruna-Adriana Clinciu, Ondřej Dušek, Dimitra Gkatzia, Stephanie Inglis, Leo Leppänen, Saad Mahamood, Emma Manning, Stephanie Schoch, Craig Thomson and Luou Wen
Using BERT for choosing classifiers in Mandarin
Jani J. Järnfors, Guanyi Chen, Kees van Deemter and Rint Sybesma
What can Neural Referential Form Selectors Learn?
Guanyi Chen, Fahime Same and Kees van Deemter
Generation Challenges papers at INLG 2021 New challenges
A Proposal of Feedback Comment Generation for Language Learners
Ryo Nagata, Masato Hagiwara, Kazuaki Hanawa and Masato Mita
DialogSum Challenge: Summarizing Real-Life Scenario Dialogues
Yulong Chen, Yang Liu and Yue Zhang
Quality Evaluation of the Low-Resource Synthetically Generated Code-Mixed Hinglish Text
Vivek Srivastava and Mayank Singh
Task Proposal: Training Instance Selection for Few-Shot Neural Text Generation
Ernie Chang, Xiaoyu Shen, Alex Marin and Vera Demberg
Evaluating accuracy challenge
Automatic Verification of Data Summaries
Rayhane Rezgui, Mohammed Saeed and Paolo Papotti
Generation Challenges: Results of the Accuracy Evaluation Shared Task
Craig Thomson and Ehud Reiter
Grounding NBA Matchup Summaries
Tadashi Nomoto
Shared Task in Evaluating Accuracy: Leveraging Pre-Annotations in the Validation Process
Nicolas Garneau and Luc Lamontagne
Text-in-Context: Token-Level Error Detection for Table-to-Text Generation
Zdeněk Kasner, Simon Mille and Ondřej Dušek
ReproGen challenge
The ReproGen Shared Task on Reproducibility of Human Evaluations in NLG: Overview and Results
Anya Belz, Shubham Agarwal, Ehud Reiter and Anastasia Shimorina
Reproducing a comparison of hedged and non-hedged NLG texts
Saad Mahamood
Another PASS - A Reproduction Study of the Human Evaluation of a Football Report Generation System
Simon Mille, Thiago Castro Ferreira, Anya Belz and Brian Davis
A Reproduction Study of an Annotation-based Human Evaluation of MT Outputs
Maja Popović and Anya Belz
TUDA-Reproducibility @ ReproGen: Replicability of Human Evaluation of Text-To-Text and Concept-To-Text Generation
Christian Richter, Yanran Chen and Steffen Eger


> Input a username and hit Enter
> Click within the game window to activate controls
> Use arrow keys and / or your cursor to move
> Press 'ESC' / Escape to leave cursor control
> Press 'F' to change player sprite
> Increase your score by surviving and eating cookies
> Start with 3 hitpoints, every 10 cookies eaten = 1 hitpoint
> DODGE THE VEGETABLES!


Early bird offer on M&S Christmas food orders ends this weekend
You only have until Sunday to place your Christmas and New Year food order at Marks and Spencer to receive a fabulous free gift
by Linda HowardMarks & Spencer recently revealed the festive delights they'll be serving up this December – and they're aiming to make it as stress-free as possible by catering for everyone.
From vegans and veggies, to those with dietary requirements and hosts who need some help with preparing the perfect turkey, M&S has got you covered.
The M&S Food Christmas lines are available to order online at marksandspencer.com with selected lines also on sale in stores nationwide.
nd if you spend £85 or more on Christmas Food to Order before Sunday, November 10, M&S will treat you to a free bottle of wine or box of chocolates.
Click here to shop M&S food online
This year marks the first full vegan dinner options available for customers including a tasty looking vegan root vegetable Tarte Tatin and Plant kitchen no pork pigs in blankets.
There are also plenty of gluten-free options too, with an extensive range of mince pies and party food products for shoppers to choose from.
For meat-lovers, M&S has spent a whole year coming up with foolproof perfect turkey (£60), so shoppers can avoid a stress-filled Christmas morning.
If you're looking for fast cooking and equally impressive dishes to show off on the big day, M&S has also got that covered too.
M&S have launched a variety of new products that tick both boxes and the selection includes a tear and share Brie En Croute made with an all-butter puff pastry and Sticky Toffee Trifle - the ultimate hybrid dessert everyone will love.
The Clementine Gin Liqueur Snow Globe is a tasty tipple with a festive flavour and comes complete with edible 23 carat gold leaf pieces.
And it gets even better - when the bottle is turned, the pieces float, creating a snow globe effect.
The drink will make for an amazing gift or as a showstopping centre piece.
Marks and Spencer's Clementine Gin Liqueur Snow Globe costs £15 and is avaialble in stores and online now.
The Marks and Spencer Christmas food Collection 2019
- Shop Starters here
- Shop Mains here
- Shop Vegetables and Sides here
- Shop Desserts and Cheese here
- Shop Party and Buffet here
- Shop Vegetarian here
- Shop Vegan here
- Shop Gluten Free here
You can check out the full M&S Christmas Food range online at marksandspencer.com .


skip to main content
GENEATCG
Blog
About
Publications
Talks
Resume
Portfolio
Labels
blog
c#
c++
computational-design
design
emacs
eth-zurich
fabrication
git
graphics
java
latex
learning
master-thesis
math
math-opt
matlab
optimisation
org-mode
pavilion
phd
physical-simulation
processing
programming
python
research
rhino/grasshopper
teaching
tku
tools
uni-stuttgart


Komodo
talk-trading
A channel to discuss trading. For useful links and more info click the pinned messages to the right.
100 messages
Before 05-Dec-19 12:00 AM
Mark81
17-Oct-18 07:18 AM
I think he will accumulate this week.
dokrates
17-Oct-18 07:18 AM
anyways sell now is dumb
Mark81
17-Oct-18 07:19 AM
Maybe starts driving price up for a weekend.
jorian
17-Oct-18 07:20 AM
a push to $2 would be nice
but this whale wouldn't do that
dokrates
17-Oct-18 07:20 AM
why?
jorian
17-Oct-18 07:20 AM
why buy at 2 when you can buy at 1.20?
blackjok3r
17-Oct-18 07:20 AM
Why push it to $2 .. if you can buy 20% or more of the supply at $1..... then pump it to $100
jorian
17-Oct-18 07:21 AM
yes. question is when he deems it worthy to pamp
Mark81
17-Oct-18 07:21 AM
Once btc shows strenght.
jorian
17-Oct-18 07:21 AM
did fakeout happen yet?
blackjok3r
17-Oct-18 07:22 AM
maybe this whale doesnt want his btc any more
ph03nix
17-Oct-18 07:22 AM
must be genie
dokrates
17-Oct-18 07:23 AM
i see the weekly chart, and it looks pretty beautiful. Macd turned green, volumen increased significantly, also looks like bottom has been reached
Keytothegate
17-Oct-18 07:24 AM
Yeah from TA perspective it's pretty, hope we can capitalize on bullish momentum
jorian
17-Oct-18 07:24 AM
i really fear for a fakeout
the one spike of volume we had 2 days ago was purely tether panic
and that volume wasn't even huge
also, on the daily everything is still set for bearish continuation
but yeah, TA is useless
dokrates
17-Oct-18 07:26 AM
past week was 5 milions volume, and this week only wednesday, and we are over 5million volume
wait until sunday, and this week will show big volume
Mark81
17-Oct-18 07:27 AM
What you think No:1 bitmex on leaderboard by profits (AngeloBTC) saying that btc had it last drop?
hyperDEX
17-Oct-18 07:28 AM
https://shanghai.ist/2018/10/15/chow-yun-fat-lives-on-just-100-a-month-will-leave-entire-714-million-fortune-to-charity/
Alex Linder
Chow Yun-fat lives on just $100 a month, will leave entire $714 mi...
 Take wall off and let komodo rain to you.
hyperDEX
17-Oct-18 07:45 AM
Seems like he may be getting a bit desperate
Mark81
17-Oct-18 07:46 AM
Yes especially now. He is locked.
hyperDEX
17-Oct-18 07:46 AM
We just need him t take it over 20k then all the TA guys will jump in
dokrates
17-Oct-18 07:46 AM
i think he may push the price up a little to fill 244btcs XD
21k sat will be nice
hyperDEX
17-Oct-18 07:47 AM
About 30k KMD asks till 20k
dokrates
17-Oct-18 07:51 AM
going up nicely
1990
soon 2000 will be reached
dokrates
17-Oct-18 07:58 AM
very nice buys
20k in 3 2 1
20k!!!!!!!!!!!!!
hyperDEX
17-Oct-18 08:00 AM
@siu - Chainmakers
we done
Mark81
17-Oct-18 08:00 AM
It needs to close candle on weekly.
dokrates
17-Oct-18 08:03 AM
whale removed buy wall
i think he is going to put at 20k sat
Mark81
17-Oct-18 08:03 AM
Or had enough for competition.
He is in no rush mode.
Dump incoming?

Daniel CP
17-Oct-18 08:23 AM
a buy wall and a sell wall now ?
hyperDEX
17-Oct-18 08:23 AM
yeah haha