_Serendipity_ (PG-13) *** (out of ****)
"A fortunate accident" is how Sara Thomas (Kate Beckinsale) defines the concept of "serendipity" to Jonathan Trager (John Cusack) early on in Peter Chelsom's romantic comedy of the same name. Accident or not, _Serendipity_ the film can certainly be described as a "fortunate" arrival in multiplexes during this less-than-stellar year. The film is hardly a groundbreaker, but it most certainly a big-hearted charmer--and when it comes to the rom-com genre, that's all that matters.
Much of the charm comes from leads Cusack and Beckinsale, who establish a palpable romantic rapport in the film's extended prologue. It's rush holiday shopping season in 1990 New York City, and Jonathan and Sara meet when fighting for the last pair of black cashmere gloves in a crowded department store. A search for gloves appears to have become a discovery of love, for the strongly attracted pair then spend one long night on the town getting to know each other and falling hard. But the timing is off for the attached Sara, and she proposes to Jonathan an unusual plan where they part, leaving their reunion entirely up to the powers of fate. Years later, Sara and Jonathan are in committed relationships with other people, but both still keep watch for possible signs--and consider the idea of taking destiny into their own hands.
Notions of fate and destiny aren't an alien concept in romantic comedies; in recent years the concept has become somewhat of a staple, playing a role in films from 1993's smash _Sleepless_in_Seattle_ to the recently released _Happy_Accidents_. Writer Marc Klein doesn't make many, if any, deviations from tried-and-true formula. Not only do the pieces of the plot fall into their expected places at all the regularly scheduled intervals, the characterizations also have a ring of familiarity. Both Sara and Jonathan have best friends/sounding boards who have quirky senses of humor; the current love interest for the female is eccentric to say the least, and the one for the male has her share of neuroses.
While innovation is always a welcome addition to any film, it's not entirely necessary in a film like _Serendipity_. What matters most is the manner in which it goes about its familiar business, and those behind _Serendipity_ have made an immensely likable entertainment. Not only do they strike convincing sparks together, the affable Cusack and the luminous Beckinsale are able to engage the audience individually, a critical component considering they spend most of the film carrying separate halves of the film. However, they are strongly helped by the well-cast supporting players. The lively comic instincts of Molly Shannon and Jeremy Piven elevate what could have easily been stock best friend roles; in Piven's case, his lifelong off-screen friendship with Cusack makes for an added level of convincing on-camera cameraderie. As the potential spoilers to a Jonathan-Sara pairing, John Corbett and Bridget Moynahan are also appealing, albeit in different ways. Moynahan's Hallie isn't so much ill-suited for Jonathan than simply not as an ideal a match as Sara; Corbett's eccentric, egocentric new age musician Lars is harder to like, but his charisma makes Sara's attraction to him understandable.
Such sharp casting and performances is a testament to the wonderful directing job by Chelsom. From the first frames he sets up the right atmosphere of fairy tale romance; contributing mightily to that is John de Borman's cinematography, which captures all the visual splendor of winter in the Big Apple (a sight that is even more powerful and magical in light of recent events). More importantly, however, Chelsom found the right rhythm for this story, and the film comes in at an efficient sub-90-minute run time. There isn't a wasted moment, and as such _Serendipity_ leaves one with a pleasant feeling few films generate: that of wanting more.
©2001 Michael Dequina
Michael Dequina<EMAIL_ADDRESS>|<EMAIL_ADDRESS>|<EMAIL_ADDRESS>The Movie Report/Mr. Brown's Movie Site: www.mrbrownmovies.com www.filmthreat.com | www.cinemareview.com | www.digitalwidescreen.com on ICQ: #25289934 | on AOL Instant Messenger: MrBrown23
========== X-RAMR-ID: 29770 X-Language: en X-RT-ReviewID: 254066 X-RT-TitleID: 1110303 X-RT-SourceID: 636 X-RT-AuthorID: 1202 X-RT-RatingText: 3/4
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


"If programmers want to make it look simple they delete the comments." @WardCunningham #futuretalk
3/31/2014, 6:45:42 PM
Favs: 8
Retweets: 10
link--- layout: tweet ---
"If programmers want to make it look simple they delete the comments." @WardCunningham #futuretalk
3/31/2014, 6:45:42 PM
Favs: 8
Retweets: 10
link


As mentioned above, a number of potential types of UX analyses output exist. I have included some visualization archetypes that are possible using generalized, hypothetical UXR scenarios. All below figures are representative of the my work, however, all data have been simulated and all specific details removed to preserve confidentiality.
International Product Feature Sentiment: An example UX scenario I have worked on previously is evaluating user sentiment for a key product feature. Once we know their baseline sentiment, I follow up to know why they felt that way. In this way, we know better where to iterate to improve product favorability.
|
Top Pain Points for a Key User Group of Interest: I have also sought to better understand the top pain points for a given strategic user group so that product teams might develop features to grow and retain one or more strategic groups of interest. In this way, we can resolve user friction and improve the product experience.
|
Barriers to Consideration, Barriers to Use: Similar to top pain points research, at times we would like to better understand what prevents a key user group from considering a product or product feature. What are their top barriers to consideration? If they would consider using a product but do not, what are their barriers to use?
|
Top Use Cases for a Feature or Top Solutions to a Product Issue: Sometimes we are already aware of top pain points and barriers but we don't necessarily know how best to solve the issue among competing potential solutions. Here, we can run surveys to find the top option a key group wanted for an issue. Alternatively, we might want to know what use cases we should first support for an in-development product feature.
|
Foundational Understanding - Product Agnostic: Occasionally, rather than iterate on a given product, we might want to launch a new product or launch an existing product in a new market. To garner success, we need product market fit and a foundational understanding of existing user behavior and top use cases, so that we might build the optimal product experience. This type of research can also help prioritize where we should next launch a product.
|
Top Predictive Features for a Key User Behavior: Another type of UXR we might want to perform is trying to better understand what characteristics best predict a desirable user behavior or user sentiment. For example, we might want to know what types of product content predict increased user engagement or improved user sentiment.
|


500,000+ Google users trust Mail Merge for Gmail for sending personalized emails. It's free!
Gmail Sender Icons is made by Digital Inspiration.


{{template "info_block"}} Thoughts {{$thoughtMap := .ThoughtMap}} {{range $year := .Years}} {{$year}} {{range $t := index $thoughtMap $year}} {{fmtOn $t.Cre}} {{$t.Title}} {{end}} {{end}}


--- layout: post status: publish published: true title: Scary Stat of the Day author: display_name: Corey Fineran login: Corey email<EMAIL_ADDRESS>url: '' author_login: Corey author_email<EMAIL_ADDRESS>wordpress_id: 1200 wordpress_url: http://ivyenvy.com/?p=1200 date: '2009-08-11 05:44:57 +0000' date_gmt: '2009-08-11 11:44:57 +0000' categories: - Infield - Offense tags: - Lou Piniella - Mark Derosa - Aaron Miles - Scary Stat of the Day - Troy Tulowitzki comments: - id: 353 author: Andy author_email<EMAIL_ADDRESS>author_url: http://ivyenvy.com date: '2009-08-11 11:08:50 +0000' date_gmt: '2009-08-11 17:08:50 +0000' content: "Yeah last night's game was wierd... I actually had to quit watching it, and I usually watch most games to the end no matter what. Man did Soriano look so slow getting to that ball hit by Tulowitski. That is maddening to watch as a fan. I don't know if the injuries he's had are affecting him, but at this point, I want him to say so. I want to know if there is a physical reason for the lack of hustle. \r\n\r\nI'm surprised Miles has not been released. I would platoon Font and Baker the rest of the year at 2nd if possible." - id: 721 author: Ivy Envy » Aaron Miles Continues With the Scary Stats author_email: '' author_url: http://ivyenvy.com/?p=1439 date: '2009-09-08 05:50:05 +0000' date_gmt: '2009-09-08 11:50:05 +0000' content: "[...] little less than a month ago, I shared what I considered to be the scariest stat of the 2009 season. It’s only gotten worse for Miles. He has played in about half of the Cubs games this [...]" ---
Aaron Miles has played in 50 games this season. You might think that his .197 average is pretty frightening, but I think Miles' scariest stat is his 4 RBI's this season.  He could have doubled his RBI total with one swing of the bat, but Miles held true to form and hit a soft and lazy liner to Troy "I'll stretch a double hit to Soriano into a triple any day and show you Cubs how a baseball player hustles" Tulowitzki. If you needed to be reminded, it's August. It's nearly the middle of August and Aaron Miles has no homeruns and 4 RBI's. So if Miles played every game this season, at the current rate, he might have 9 or 10 RBI's on the year.
Derosa has 21 HR's and 63 RBI's.


Problem Solving
I faced a problem during my second Kata exercise. It was a super simple problem that I was stuck on for hours. I had written the code correctly but for some reason it wasn’t passing the tests. I tried all kinds of syntax to make the tests pass but nothing worked. I asked my facilitator what was going on and we tried working it through together until the browser we were using crashed! I was stuck on this problem for another evening before I asked another person in my cohort to look over my code. We realised that my code was fine but it was the order I had stacked my variables and functions that was affecting the way it was being called. I felt really anxious asking someone to look over my work and that they would judge my inability to write JavaScript! I learnt that this wasn’t the case and that it’s better to ask for help than to be struggling on something in silence.
I surprised myself on the third Kata challenge. I managed to get through most of the tests without needing to ask for help which definitely boosted my confidence. I wrote some pseudocode in comments inside a function when I got stuck trying to find a solution that would return the average score. I understood the logic of what I had to make the function do but I didn’t know the syntax to make the tests pass. I turned to Dr Google and searched “for loop average number javascript” and low and behold I found the perfect solution to help pass the test. I asked my facilitator, retrospectively, to explain each element of the function so that I could fully comprehend what the for loop was doing. I felt less embarrassed about asking for help this time because I had already tried out multiple avenues to solve the problem myself.
Problem Solving Techniques
Pseudocode - This is a technique that I’m inexperienced at but keen to develop. I can see it being a really helpful way to begin solving a problem.
Trying something - Very happy to try something but can’t say it’s worked all that well for me!
Rubber ducky method - This is something I have used in the past with work related queries but never with coding. I’m sure that I will use this technique when I become more competent at coding.
Reading error messages - I do not feel confident reading error messages and it’s probably because red text repels me! I’m avoidant of error messages but hopefully I will understand their importance and learn to love them haha.
Console.logging - I kind of understand the process of logging to the console but would like to become more confident in using it to solve problems and seeing where things are getting stuck.
Googling - I would say I’m too confident doing this and is probably the first thing I do when I encounter a problem! I would like to get better at trying out different problem solving techniques before reverting to my favourite search engine.
Asking peers for help - I’m reluctant to ask for help from people in my cohort and it’s probably because there is a whole lot of pride wrapped up in asking peers for guidance. I think I’ll become more comfortable asking for help once I get to know everyone a bit better.
Asking coaches for help - I’m okay asking coaches for help but am concerned about how frequently I am asking for help and coming across super needy. I want to try and implement some of the other problem solving techniques before I ask for assistance.
Improving process with reflection - I feel confident reflecting on my learning. I don’t know if reflecting will help me solve problems in the future because most of my reflections are emotion based.


🚨🚑🚨Oh no, you've encountered an error!🚨🚑🚨
Blame it on the bad programmer who coded this application.
404
Error java.lang.NullPointerException
Back to Home Page


Hello, {{identities[identityIndex].FullName}}!
| # of your followers | (in %) | who have [...] followers |
|---|---|---|
| {{breakdown[$index]}} | {{breakdownPerc($index)}} | {{breakdownLabels[$index]}} |
Processed follower #{{sortedProfiles.length}} of {{totalProfiles}} (Google+ gives only a subset of your followers)... Remaining time: {{remainingTime()}} PAUSED
Processing speed (1÷32x): {{maxParsers}}x High speed could trigger Google bot detection system
If the progress gets stuck click here to log in to Google+ or to solve the captcha.
| Rank | Followers | Name |
Circles of
{{identities[0].FullName}}!
Solution
Badge (loading could be slow)
|
|---|---|---|---|
| #{{(currentPage-1)*profilesPerPage+$index+1}} |
{{profile.followers === -1 && '0 or n/a' || (profile.followers | number:0)}}
|
{{profile.name}} |
This add-on is not affiliated with, sponsored by, or endorsed by Google. Source code on GitHub. License: MIT. Copyright 2013-2016 Giovanni Totaro. Version {{version}}.


Anything above 30fps is fine but 60fps is the goal

Hello, World

div {
color: red;
}

Hello, World

div {
color: white;
background: darkblue;
}

Hello, World

body div:first-child{
color: green;
background: grey;
}
.hello-div.hello-div{
color: pink;
background: yellow;
}
html body .hello-div{
color: yellow;
background: black;
}
body div[class^="hello"]{
color: white;
background: darkblue;
}

Hello, World

div {
color: black;
background: green;
transform: rotate(90deg);
}

Hello, World

div {
animation : 2s spin infinite;
}
@keyframes spin {
0%{
transform:rotate(0deg);
}
100% {
transform:rotate(360deg);
}
}
color |
border-style |
visibility |
background |
text-decoration |
background-image |
background-position |
background-repeat |
outline-color |
outline |
outline-style |
border-radius |
outline-width |
box-shadow |
background-size |
|
source: http://www.html5rocks.com
Layout Thrashing occurs when 'something' reads from then writes to the DOM multiple times causing document reflows each time.
// read/write
foo2.width = foo1.width;
// read/write
bar2.width = bar1.width;
is slower than
// read
fw = foo1.width;
bw = bar1.width;
// then write
foo2.width = fw;
bar2.width = bw;
Paint storms sound cool but they are dumb
They occur when something causes a big chunk of the document to be repainted continuously
will-change
property in the dev channel of all major browsers
http://grgcnnr.github.io/spankthejank
for all the information: http://jankfree.org/


nips nips2001 nips2001-22 nips2001-22-reference knowledge-graph by maker-knowledge-mining
Source: pdf
Author: André Elisseeff, Jason Weston
Abstract: This article presents a Support Vector Machine (SVM) like learning system to handle multi-label problems. Such problems are usually decomposed into many two-class problems but the expressive power of such a system can be weak [5, 7]. We explore a new direct approach. It is based on a large margin ranking system that shares a lot of common properties with SVMs. We tested it on a Yeast gene functional classiﬁcation problem with positive results.
[1] B. Boser, I. Guyon, and V. Vapnik. A training algorithm for optimal margin classiﬁers. In Fifth Annual Workshop on Computational Learning Theory, pages 144–152, Pittsburgh, 1992. ACM.
[2] N. Cristianini and J. Shawe-Taylor. Introduction to Support Vector Machines. Cambridge University Press, 2000.
[3] Andr´ Elisseeff and Jason Weston. Kernel methods for multi-labelled classiﬁcation and catee gorical regression problems. Technical report, BIOwulf Technologies, 2001. http://www.bhtlabs.com/public/.
[4] T. Joachims. Text categorization with support vector machines: learning with many relevant features. In Claire N´ dellec and C´ line Rouveirol, editors, Proceedings of ECML-98, 10th Eue e ropean Conference on Machine Learning, number 1398, pages 137–142, Chemnitz, DE, 1998. Springer Verlag, Heidelberg, DE.
[5] A. McCallum. Multi-label text classiﬁcation with a mixture model trained by em. AAAI’99 Workshop on Text Learning., 1999.
[6] P. Pavlidis, J. Weston, J. Cai, and W.N. Grundy. Combining microarray expression data and phylogenetic proﬁles to learn functional categories using support vector machines. In RECOMB, pages 242–248, 2001.
[7] R.E. Schapire and Y. Singer. Boostexter: A boosting-based system for text categorization. Machine Learning, 39(2/3):135–168, 2000.
[8] J. Weston and C. Watkins. Multi-class support vector machines. Technical Report 98-04, Royal Holloway, University of London, 1998.


Results are presented for periods 45 days prior to and 45 days after monsoon onset, as defined by the Higgins Monsoon PI. Table 1. Accumulated precipitation.


Landing Page
Special Projects
This story is part of a series of specially designed stories that represents some of the best journalism The Post has to offer. Check out the rest of the special projects here.
MARCUS PAVILONIS | ILLUSTRATION
04.18.18
Kris Cornwell spent her days on Court Street long before it was lined with a bevy of bars and chain restaurants.
As the owner of Cornwell Jewelers, 77 N. Court St., Cornwell recalls catching a bus with her sister and riding from her grandparents’ home on Peach Ridge Road, north of Athens, to Court Street, where they’d wander from shop to shop.
Carl Fonticella | PHOTO EDITOR
Kris Cornwell, owner of Cornwell Jewelers on 77 N. Court Street, poses for a portrait. Cornwell Jewelers has been in business since 1832, making them America's second oldest family-owned jewelry store.
“At 6 and 8 (years old) ... my grandpa’s jewelry store was the hub of everything, so we would have to go check in with him, then we’d go off and go shopping somewhere, or go see a matinee, or go get pizza,” Kris said.
Her grandfather, Walter Cornwell, ran his jewelry store at 10 S. Court St., where Big Mamma’s Burritos exists today.
Kris fondly recalls spending time in that narrow, worn space, in the same building where Cornwell Jewelers had existed since 1832, and playing with costume jewelry her grandfather had taken in on trade. At the time, she wasn’t so concerned about diamond earrings or ruby wristlets.
“More than anything, to me it wasn’t so much about the jewelry, but that’s just where my grandpa worked,” Kris said.
It’s much more about the jewelry now. Since purchasing the business from her parents in the early 2000s, Kris has transformed the store to meet the needs of modern shoppers. As a result, a long-standing piece of Athens’ history, Cornwell Jewelers, is rolling into the future with its sixth-generation — and first female — owner at the helm.
It wasn’t a given that Kris would take over the family jewelry business.
“When I finished my graduate degree … my mom actually said, ‘Have you ever thought about working in the jewelry store?’ And I said ‘No? I haven’t,’ ” she said. “It was never discussed. It was never talked about.”
But it happened. She finished a master’s degree in education in 1994 at Ohio University and, persuaded by her mother, tried her hand in the jewelry business. The early years weren’t easy.
“I went in pretty naive, but it’s been a journey and I’ve learned so much,” she said. “When I started, I knew zero about business, zero about gemology, all of it — marketing, finances. I mean, I was an education major in English, and I could write a lesson plan.”
In 1997, she became an American Gem Society-certified jeweler — a designation that means she’s qualified to identify and appraise gemstones — and began attending conferences for jewelers, learning how to run the business.
While tackling that learning curve, she had to deal with other obstacles: Customers and industry colleagues often assumed her male employees were calling the shots, and she wasn’t always taken seriously.
She told The Post about the first time she attended an American Gem Society conference as a 24-year-old. “I can’t tell you how many people asked me what I was doing there, what my role was,” she said. “Back then, it was pretty much owners and top managers that would go to this event. So here I was. People probably thought I was a relatively new member of the sales team. I was questioned pretty heavily — nicely, but they didn’t get why I was there.”
Now, after 25 years in the game, she’s established herself and picked up the knowledge needed to push the business forward.
“There is no smarter businesswoman,” Eric Coon, who worked in the store for more than 40 years, said. He cited Kris’ business acumen as the reason the store is still chugging along today. “That type of thing has made her a legacy, and that’s what keeps the store going. She can adapt to the trends, and to me that’s very very important.”
That’s what she did in 2002 when she moved the store from the 10 S. Court St. location, where it’d been since 1869, to its current space at 77 N. Court St, near Courtside Pizza.
Kris said she consistently heard customers saying they wanted to shop at her store but struggled to find parking on Court Street. The new building fixed that.
Then, when customers started saying they couldn’t find the store, she looked for some way to make it stand out. That’s when she and her staff decided to purchase a 1967 Cadillac, paint it purple and park it in front of the store. The car still catches the eyes of passersby today. “People take pictures of it, selfies with it all the time,” she said.
The Cornwell family had been selling jewelry to Athens residents for more than 100 years before that purple Cadillac ever rolled off the line.
John Cornwell opened a jewelry shop on the second floor of 10 S. Court St. in 1832. At that time, Robert G. Wilson — the namesake of OU’s Wilson Hall — was serving as the school’s president, and the Civil War wouldn’t break out for another 29 years.
The store’s founder is also responsible for its only extended closure. In 1852, he rode west to California by train and wagon, one of thousands who risked their lives in an effort to strike gold. He left his store, wife and six children for four years.
“As I understand it, Cornwell Jewelers is probably the longest standing, continuously operated businesses on Court Street and certainly as a jeweler has been long standing. The Cornwell family has been a cornerstone of the city of Athens for a long time.”- Athens Mayor Steve Patterson
“From what I’ve researched, he put a sign on the door, like a ‘gone fishing’ sign, except he went to the gold rush,” Kris said. John recorded his experiences in a diary now housed in Alden Library. He wrote at length about difficult living conditions, sparse success and about selling daguerreotypes — early photographs — as an extra source of income.
Returning in 1856 to Athens, he reopened the jewelry store. Since then, management of the store has snaked its way through six generations of Cornwells, making it the second-oldest family-owned jewelry store in the U.S.
“As I understand it, Cornwell Jewelers is probably the longest standing, continuously operated businesses on Court Street and certainly as a jeweler has been long standing,” Athens Mayor Steve Patterson said. “The Cornwell family has been a cornerstone of the city of Athens for a long time.”
Kris’ father, Les Cornwell, opened a second jewelery store in 1966 at 49 S. Court St., where Whit’s Frozen Custard is today. “It was like a small Tiffany’s in Athens, Ohio,” Coon said.
Today, Coon is a property manager for Cornwell Properties, which owns and operates a swath of student rentals in Athens. Les began buying rental properties in the early 1970s, and continues to rent some of Athens’ most recognizable student dwellings, including Palmer Place.
Les’ uptown store closed its doors in 1987 and was folded into Cornwell Jewelers’ original location at 10 S. Court Street, where it stayed until Kris moved the store in 2002.
Unlike the gemstones sold at the store, it’s difficult to say what Cornwell Jewelers will look like in 10, 20 or 30 years.
Kris depends on her willingness to change in managing the store, and trends in jewelry could push Cornwell Jewelers to continue changing. A 2014 report from management consultants McKinsey and Company predicts the share of fine jewelry sales happening online could double to 10 percent of total sales by 2020, and Kris knows the nature of shopping — and Court Street — is changing.
“Most of our customers now, we’re a destination store,” she said. “A lot of people don’t work on Court Street like they used to, so to see us, they drive to us. So there could be a time when they don’t want to come to Court Street.”
Coon thinks it’s unlikely online sales will prove fatal for the store.
“You never know. But to me, when I’m dead and gone, I think the store will still be there.” - Eric Coon, who worked in Cornwell Jewelers for more than 40 years
“When you get engaged, do you want to say to your wife, ‘I bought my ring on Amazon’ or ‘I bought it online?’ ” Coon said. “You know, it’s nice to come in (to the store). They find out about your history, where you’re going. And a lot of jewelry has been sold that way.”
The McKinsey report agrees, predicting that online sales of fine jewelry won’t grow to much larger than 10 percent of the total market, for roughly the same reason Coon laid out.
“You never know,” he said. “But to me, when I’m dead and gone, I think the store will still be there.”
What exactly will happen when Kris retires is unclear. She’s said she hopes one of her daughters will take the reins, but with her oldest is still in high school, it’s much too early to tell.
“I want my girls to feel they can follow their own dreams and not what my dream was and what my parents’ dream was,” she said.
A previous version of this report incorrectly stated the date of the Civil War in relation to the opening of Cornwell Jewelers. The article has been updated to reflect the most accurate information.
Landing Page
This story is part of a series of specially designed stories that represents some of the best journalism The Post has to offer. Check out the rest of the special projects here.


Bio: I'm Saoud. After going to medical school for 3.5 years I decided to get back into tech. I ran a computer company while I was in high school and always wanted to do tech related jobs.
I decided to join Epicodus to help me to learn programming since that is my weakest link in knowledge.


Margin:
The margin is the space outside of the border and you can set the values around it using Top, Bottom, Left or Right to get the exact position you’d like the margin to be.
Border:
You can set the border to have styles or leave it transparent. It kind of really speaks for itself really.
Padding:
Padding is the direct distance from the elements content and helps distance the content away from seperate elements. It is very helpful and you can set any distance you’d like between the border of the box and the content. You can set padding (like the margin as well) to be Top, Bottom, Left or Right and generally use pixels (px).


Performs likelihood-based inference for a wide range of regression models. Provides higher-order approximations for inference based on extensions of saddlepoint type arguments as discussed in the book Applied Asymptotics: Case Studies in Small-Sample Statistics by Brazzale, Davison, and Reid (2007).
| Version: | 2.1.4 |
| Depends: | R (≥ 3.0.0) |
| Imports: | graphics, statmod, stats, survival, utils |
| Suggests: | boot, csampling |
| Published: | 2015-08-12 |
| Author: | R port by Alessandra R. Brazzale, following earlier work by Douglas Bates. The function tem is based on work by Anthony Davison |
| Maintainer: | Alex-Antoine Fortin <alex at fortin.bio> |
| License: | GPL-2 | GPL-3 | file LICENCE [expanded from: GPL (≥ 2) | file LICENCE] |
| URL: | http://www.r-project.org, http://statwww.epfl.ch/AA/ |
| NeedsCompilation: | no |
| Citation: | hoa citation info |
| CRAN checks: | hoa results |
| Reference manual: | hoa.pdf |
| Vignettes: |
hoa: An R Package Bundle for Higher Order Likelihood Inference |
| Package source: | hoa_2.1.4.tar.gz |
| Windows binaries: | r-devel: hoa_2.1.4.zip, r-release: hoa_2.1.4.zip, r-oldrel: hoa_2.1.4.zip |
| OS X binaries: | r-release: hoa_2.1.4.tgz, r-oldrel: hoa_2.1.4.tgz |
| Old sources: | hoa archive |
| Reverse suggests: | extraDistr |
Please use the canonical form https://CRAN.R-project.org/package=hoa to link to this page.


The diagram below shows the number of people in the world without proper water sanitation. According to the diagram, Sub-saharan African and South Asia Make up 50% of the world's population that does not have access to proper sanitation facilities. This causes a shocking increase in preventable diseases and deaths due to the lack of healthcare compounding the ingestion of fecal matter. Due to increased fecal matter contamination, certain regions of the world have more preventable deaths and diseases.


Some words to enjoy
2013 pycon talk proposal
Modeling complexity
Network reduction via the linlog energy model
Graph based node similarity
Twitter API terms of service
DARPA Social Media in Strategic Communication (SMISC) request for proposals
Large scale graph embedding
The physics of information
Collection of code/info related to deep learning
Multidimensional Scaling (MDS)
Random walk graph diffusion
Using python and R together
Graphlab datasets


Chapter 2 The Osprey Workflow
Osprey was designed to have an easy, linear workflow with as little user input as possible. It has many built-in routines to recognize data formats and sequence types, and will be able to perform most required processing steps automatically.
Osprey consists of seven separate modules – Job, Load, Proc, Fit, Coreg, Seg, and Quant, all of which are sequentially called in a graphical user interface. Alternatively, users can conduct the entire workflow from the MATLAB command prompt.
Some input will need to be provided by the user in the form of a job. A job specifies the locations of the files containing MRS and structural imaging data, the type of MRS sequence, and some basic control options over the data modeling procedure.
While a job is progressing through the Osprey pipeline, all raw and processed data associated with this job are stored in a MATLAB structure, the Osprey data container. By default, this container is called MRSCont
, but you are free to give it a more meaningful variable name.
Osprey’s data handling is based in large parts on the free MATLAB toolbox FID-A. The Osprey folder contains a library of, sometimes modified, FID-A functions and additions. Please make sure that you do not include an installation of the original FID-A suite in your MATLAB path, as some functions in the Osprey folder might be shadowed by FID-A functions with the same name.
The MRSCont
data container functions as a super-structure, containing
FID-A structures for each dataset and processing step, along with additional
information, e.g. quality metrics, quantification results, etc.


| REPUBLIC OF THE PHILIPPINES | ||
| DEPARTMENT OF EDUCATION | ||
| SENIOR HIGH SCHOOL STUDENT PERMANENT RECORD |
| LEARNER'S INFORMATION | |||
| LAST NAME: | FIRST NAME: | MIDDLE NAME: |
| LRN: | Date of Birth(MM/DD/YYYY): | Sex: | Date of SHS Admission(MM/DD/YYYY): |
| ELIGIBILITY FOR SHS ENROLMENT | ||||
| High School Complete* | Gen. Ave: | Junior High School Complete | Gen. Ave: | |
| Date of Graduation/Completion(MM/DD/YYYY): | Name of School: | School Address: | ||
| PEPT Passer** | Rating: | ALS A&E Passer*** | Rating: | Others(Pls. Specify): |
| Date of Examination/Assessment(MM/DD/YYYY): | Name and Address of Community Learning Center: | |||
| *High School Completers are students who graduated from secondary school under the old curriculum | ***ALS A&E - Alternative Learning System Accreditation and Equivalency Test for JHS | |||
| **PEPT - Philippine Educational Placement Test for JHS |
| SCHOLASTIC RECORD | ||||
| SCHOOL: | SCHOOL ID: | GRADE LEVEL: | SY: | SEM: |
| TRACK/STRAND: | SECTION: |
| Indicate if Subject is CORE, APPLIED, or SPECIALIZED | SUBJECTS | QUARTER | SEM FINAL GRADE | ACTION TAKEN | |
|---|---|---|---|---|---|
| General Ave. for the Semester: |
| REMARKS: | ||
| Prepared By: | Certified True and Correct: | Date Checked(MM/DD/YYYY): |
| Signature of Adviser over Printed Name | Signature of Authorized Person over Printed Name, Designation |
| REMEDIAL CLASSES | Conducted from (MM/DD/YYYY): | to (MM/DD/YYYY): | SCHOOL: | SCHOOL ID: |
| Indicate if Subject is CORE, APPLIED, or SPECIALIZED | SUBJECTS | SEM FINAL GRADE | REMEDIAL CLASS MARK | RECOMPUTED FINAL GRADE | ACTION TAKEN |
|---|---|---|---|---|---|
| Name of Teacher/Adviser: | Signature: |
| SCHOOL: | SCHOOL ID: | GRADE LEVEL: | SY: | SEM: |
| TRACK/STRAND: | SECTION: |
| Indicate if Subject is CORE, APPLIED, or SPECIALIZED | SUBJECTS | QUARTER | SEM FINAL GRADE | ACTION TAKEN | |
|---|---|---|---|---|---|
| General Ave. for the Semester: |
| REMARKS: | ||
| Prepared By: | Certified True and Correct: | Date Checked(MM/DD/YYYY): |
| Signature of Adviser over Printed Name | Signature of Authorized Person over Printed Name, Designation |
| REMEDIAL CLASSES | Conducted from (MM/DD/YYYY): | to (MM/DD/YYYY): | SCHOOL: | SCHOOL ID: |
| Indicate if Subject is CORE, APPLIED, or SPECIALIZED | SUBJECTS | SEM FINAL GRADE | REMEDIAL CLASS MARK | RECOMPUTED FINAL GRADE | ACTION TAKEN |
|---|---|---|---|---|---|
| Name of Teacher/Adviser: | Signature: |
| SCHOOL: | SCHOOL ID: | GRADE LEVEL: | SY: | SEM: |
| TRACK/STRAND: | SECTION: |
| Indicate if Subject is CORE, APPLIED, or SPECIALIZED | SUBJECTS | QUARTER | SEM FINAL GRADE | ACTION TAKEN | |
|---|---|---|---|---|---|
| General Ave. for the Semester: |
| REMARKS: | ||
| Prepared By: | Certified True and Correct: | Date Checked(MM/DD/YYYY): |
| Signature of Adviser over Printed Name | Signature of Authorized Person over Printed Name, Designation |
| REMEDIAL CLASSES | Conducted from (MM/DD/YYYY): | to (MM/DD/YYYY): | SCHOOL: | SCHOOL ID: |
| Indicate if Subject is CORE, APPLIED, or SPECIALIZED | SUBJECTS | SEM FINAL GRADE | REMEDIAL CLASS MARK | RECOMPUTED FINAL GRADE | ACTION TAKEN |
|---|---|---|---|---|---|
| Name of Teacher/Adviser: | Signature: |
| SCHOOL: | SCHOOL ID: | GRADE LEVEL: | SY: | SEM: |
| TRACK/STRAND: | SECTION: |
| Indicate if Subject is CORE, APPLIED, or SPECIALIZED | SUBJECTS | QUARTER | SEM FINAL GRADE | ACTION TAKEN | |
|---|---|---|---|---|---|
| General Ave. for the Semester: |
| REMARKS: | ||
| Prepared By: | Certified True and Correct: | Date Checked(MM/DD/YYYY): |
| Signature of Adviser over Printed Name | Signature of Authorized Person over Printed Name, Designation |
| REMEDIAL CLASSES | Conducted from (MM/DD/YYYY): | to (MM/DD/YYYY): | SCHOOL: | SCHOOL ID: |
| Indicate if Subject is CORE, APPLIED, or SPECIALIZED | SUBJECTS | SEM FINAL GRADE | REMEDIAL CLASS MARK | RECOMPUTED FINAL GRADE | ACTION TAKEN |
|---|---|---|---|---|---|
| Name of Teacher/Adviser: | Signature: |
| Track/Strand Accomplished: | SHS General Average: |
| Awards/Honors Received: | Date of SHS Graduation (MM/DD/YYYY): |
| Certified by: | Place School Seal Here: | ||||||
|


% include head.html %>
<% include json-ld.html %> <% include navbar.html %> <% include data-form.html %> <% include scripts.html %> <% include data-form-scripts.html %>


RESThub provides some simple tools to facilitate integration between RESThub and its tools and Tapestry5 Framework. These tools are packaged into a dedicated multi-module.
This multi-module resthub sub-project contains 4 modules related to Tapestry5+RESThub integration.
You can find a complete example of usage of these tools in the sample application : https://github.com/pullrequest/resthub/tree/resthub-1.1/resthub-apps/booking/booking-tapestry5
This artefact provides some additional and useful Tapestry5 components and mixins (not directly related to resthub).
This artefact can and should hold some other components if needed.
To use it, add to your pom dependencies :
<dependency>
<groupId>org.resthub</groupId>
<artifactId>resthub-tapestry5-components</artifactId>
<version>1.1</version>
</dependency>
This artefact provides some advanced features related to tapestry5 and jpa integration, one of the core resthub tool. This artefact is based on the Tynamo Tapestry5 JPA integration
It allows, for example, to manage JPA entities objects in page and components parameters while seeing only id in url. This is allowed by the fact that the artifact maintains a opened session and wrap calls to serialization and deserialization in order to retrieve an object from its id. Sample here
This artefact provides also a complete integration between JPAEntityManager managed by Tapestry and those defined by Spring, another core tool of resthub. This is made possible by a dedicated configuration Tapestry 5 Module injecting the entityManagerFactory bean, considered as already defined by Spring.
You can provide your own module in your application and complete or override this one in case of specific configurations.
To use it, add to your pom dependencies :
<dependency>
<groupId>org.resthub</groupId>
<artifactId>resthub-tapestry5-jpa</artifactId>
<version>1.1</version>
</dependency>
This artefact provides some advanced features related to tapestry5 and spring security integration. This artefact is based on the localhost.nu Tapestry5 Spring Security integration.
It allows to integrate Tapestry5 and Spring authentication and authorization mechanisms and provide some helpers and dedicated services in order to manage in Tapestry5 pages :
login :
wrap login methods and allow to perform a programmatic login : samples here and here (see Authenticator)
signin :
wrap signin methods and allow to perform a programmatic signin : Sample
logout :
wrap logout methods and allows to perform a programmatic logout : Sample
This artifact provides also some security components to use in your tml (see here).
This is configured by a dedicated Tapestry5 Spring Security configuration that you have to add to your application (see here for a sample). This configuration file defines all options fo spring security integration.
To use it, add to your pom dependencies :
<dependency>
<groupId>org.resthub</groupId>
<artifactId>resthub-tapestry5-spring-security</artifactId>
<version>1.1</version>
</dependency>
This artifact is a simple wrapper to integrate other Resthub Tapestry5 contributions to make things easier.
It provides a global Tapestry5 configuration module to integrate tapestry-jpa and tapestry-components modules.
This artifact also include the configuration for Tapestry5 and BeanValidation integration : see here.
This inclusion is possible thanks to the @SubModule annotation.
This artifact does not integrate tapestry-spring-security to not force its usage.
You can configure the integration of this artifact by providing in your application a dedicated Tapestry5 module and/or overriding these modules (see sample).
To use it, add to your pom dependencies :
<dependency>
<groupId>org.resthub</groupId>
<artifactId>resthub-tapestry5-integration</artifactId>
<version>1.1</version>
</dependency>


Just one:
public void paint ( Graphics gr )
(However, the class inherits many more methods
from class Applet
).
The definition of Applet
provides a framework
for building an applet.
By itself, the class Applet
does little that is visible in
the Web browser.
(It does a great many things behind the scenes, however.)
To build upon this framework, you
import
java.applet.Applet
and
extend
the Applet class:
import java.applet.Applet; import java.awt.*; public class AEHousman extends Applet { public void paint ( Graphics gr ) { setBackground( Color.pink ); gr.drawString("Loveliest of trees, the cherry now", 25, 30); gr.drawString("Is hung with bloom along the bough,", 25, 50); gr.drawString("And stands about the woodland ride", 25, 70 ); gr.drawString("Wearing white for Eastertide." ,25, 90); gr.drawString("--- A. E. Housman" ,50, 130); } }
When you extend a class, you are making a new class by
building upon a base class.
This example defines a new class called AEHousman
.
The new class has everything in it that the class Applet
has.
(This is called inheritance.
Inheritance is discussed at greater length in chapter 50.)
The class Applet
has a paint()
method,
but that method does little.
Objects of class
AEHousman
have their own
paint()
method because the definition in AEHousman.java
overrides the one in Applet
.
The Web browser calls the paint()
method when it needs to "paint"
the section of the monitor screen devoted to an applet.
Each applet that you write
has its own paint()
method.


JavaScript Form Validation
Full Name:
Username(6-8 characters):
Email:
State:
Please Choose
America
Australia
Sweden
Africa
Address:
Zip Code:
Tabular Information


Welcome to My College Buddy
We are currently working
on a new super awesome
website.
We aim to cater to various educational counsellings need of today's generation, we've established to offer services who are studying in the various educational institutes. The centre endeavours to provide guidance to students right from their early school years to higher education. We intend to counsel and provide support at every step the student takes towards his future career.


|
PyFlow
|
Namespaces | |
| DefaultLib | |
| MathLib | |
| Matrix33 | |
| Matrix44 | |
| QuatLib | |
| Vector3 | |
| Vector4 | |
Functions | |
| def | getLib (libName) |
| Get registered function library by name. More... | |
| def | libs () |
| Get registered library names. More... | |
| def | findFunctionByName (name) |
| Finds function by name. More... | |
| def | shoutDown () |
Variables | |
| libName = lib.split(".")[0] | |
| foos = getmembers(lib_class, isfunction) | |
| def PyFlow.FunctionLibraries.findFunctionByName | ( | name | ) |
Finds function by name.
Searches from all refistered libraries.
| def PyFlow.FunctionLibraries.getLib | ( | libName | ) |
Get registered function library by name.
| [in] | libName | library name (string) |
| def PyFlow.FunctionLibraries.libs | ( | ) |
Get registered library names.
| def PyFlow.FunctionLibraries.shoutDown | ( | ) |
| PyFlow.FunctionLibraries.foos = getmembers(lib_class, isfunction) |
| PyFlow.FunctionLibraries.libName = lib.split(".")[0] |


Thick Client Testing Tools
Tools For Java Thick Client:
JD-GUI: JD-GUI is a standalone graphical utility that displays Java source codes of “.class” files. You can browse the reconstructed source code with the JD-GUI for instant access to methods and fields.
Download JD-GUI
JavaSnoop: JavaSnoop is an Aspect Security tool that allows security testers to easily test the security of Java applications. A tool that lets you intercept methods, alter data and otherwise test the security of Java applications on your computer.
Download DSer
Tools For .NET Thick Client:
JD-GUI: JD-GUI is a standalone graphical utility that displays Java source codes of “.class” files. You can browse the reconstructed source code with the JD-GUI for instant access to methods and fields.
Download JD-GUI
General Tools:
Echo-Mirage: Echo Mirage is a versatile local proxy tool that can be used to intercept and modify TCP payloads for local Windows applications. It allows users to launch a program behind its proxy or hook into an existing process. It also supports OpenSSL and Windows SSL.
Download Echo Mirage
Canape: Canape is a network testing tool for arbitrary protocols, but specifically designed for binary ones. It contains built in functionality to implement standard network proxies and provide the user the ability to capture and modify traffic to and from a server.
Download Canape


Numbers 23:3
And Balaam said unto Balak, Stand by thy burnt offering, and I will go: peradventure the LORD will come to meet me: and whatsoever he showeth me I will tell thee. And he went to an high place.


The Supporters of Camp Archbald, or SoCA for short, is a non-profit group looking to save a historic scout camp. Their cause was strong and clear, and they had a group of passionate followers all united under the same cause. They began gaining traction and getting press about their fight, but in today's day and age, they needed a website to represent themselves.
I offered to step in and create a website as well as a logo for the group to get their cause out there. I set up a functional site through Wordpress - a free platform - and was able to onboard one of the group's officers as an admin to the site so that they could run it independently. In working with the group I also created several logo mockups for the group. With the site in place, the group was able to run registration for their first annual resident camp this summer.


--- layout: single author_profile: true ---
We invite you to participate in the Virtual Meeting of R Users in Latin America ConectaR2021. We will create a virtual space to share different experiences of the community of R users in industry, academia, citizen science and education, during January 28 - 29 and February 4 - 5. In this way we want to encourage the use of R, encourage learning and the development of packages in R adapted to our needs in Latin America.
The activities will be both synchronous and asynchronous, our objective is to facilitate an open, inclusive communication space, and with technological facilities to get to know each other better, exchange ideas and support new collaborations between Spanish-speaking R users.
The topics we focus on are:
Teaching - Industry - Academy - Government and Citizen Science
And more specifically in:


?
mmmwwm
???1??
1.......u
?
Ñ
Ñ
Ñ
J
JfL
?
???'
0
1
23456789
10
The
New
York
-
?
?
?
?
1
cm
copyright
reserved
botanical
Garden
YORK
BOTANICAL
GARDEN
Ludwigia
octovalvis
(Jacq.)
Raven
Determined
by
T.P.
RamamOOrthy
1980
Missouri
Botanical
Garden
REVISION
OF
JUSSIAEA
J.
suffruticosa
L.
OCl<\
C.G
X\
1"'j
G-V'xSeV).)
1
noo
/
Philip
A.
Munz
,
1939
THE
NEW
YORK
BOTANICAL
GARDEN
EXPLORATION
OF
VIEQUES
ISLAND,
PORTO
RICO
Isabel
Segunda
to
Campo
Cielo
À2
36?
y/X&Q.
j.
A.
Shafer.
Collector
^J^IMAGED
JANUARY
24,
1914
00819664
00819664
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


menu
Iat 35 Anos
insert_chart
This is a card panel with a teal lighten-2 class
insert_chart
This is a card panel with a teal lighten-2 class


Week 1 Exercise
Who am I?ω
"Lorem ipsum dolor sit amet, consectetur adipiscing elit, sed do eiusmod tempor incididunt ut labore et dolore magna aliqua. Ut enim ad minim veniam, quis nostrud exercitation ullamco laboris nisi ut aliquip ex ea commodo consequat. Duis aute irure dolor in reprehenderit in voluptate velit esse cillum dolore eu fugiat nulla pariatur. Excepteur sint occaecat cupidatat non proident, sunt in culpa qui officia deserunt mollit anim id est laborum."
The standard Lorem Ipsum passage, used since the 1500s
"But I must explain to you how all this mistaken idea of denouncing pleasure and praising pain was born and I will give you a complete account of the system, and expound the actual teachings of the great explorer of the truth, the master-builder of human happiness. No one rejects, dislikes, or avoids pleasure itself, because it is pleasure, but because those who do not know how to pursue pleasure rationally encounter consequences that are extremely painful. Nor again is there anyone who loves or pursues or desires to obtain pain of itself, because it is pain, but because occasionally circumstances occur in which toil and pain can procure him some great pleasure. To take a trivial example, which of us ever undertakes laborious physical exercise, except to obtain some advantage from it? But who has any right to find fault with a man who chooses to enjoy a pleasure that has no annoying consequences, or one who avoids a pain that produces no resultant pleasure?"


◆ getDays()
| string DaysPicker::getDays |
( |
| ) |
|
Function returns joined string of checked ckeckboxes that represents days.
- Returns
- containing joined string.
◆ setDays()
| void DaysPicker::setDays |
( |
string |
fromString | ) |
|
Function parses given string fromString
and checks respective checkboxes.
- Parameters
-
| fromString | string containing days of week divided by comma. |
◆ uncheckAll()
| void DaysPicker::uncheckAll |
( |
| ) |
|
Inner function that uncheck all checked checkboxes.
◆ dayFriday
| string DaysPicker::dayFriday |
◆ dayMonday
| string DaysPicker::dayMonday |
◆ daySaturday
| string DaysPicker::daySaturday |
◆ daySunday
| string DaysPicker::daySunday |
◆ dayThursday
| string DaysPicker::dayThursday |
◆ dayTuesday
| string DaysPicker::dayTuesday |
◆ dayWednesday
| string DaysPicker::dayWednesday |
The documentation for this class was generated from the following file:
- GoodHabitsApp/qml/components/DaysPicker.qml


This project originally started as a youtube banner for a graphic design contest. It is one of the better photo manipulation/designs that I have done in the past. I was proud of the design so I ended up expanding the banner into a full desktop using some blur and cropping.


I had experimented with salvia on a few occasion and always enjoyed the results. But my girlfriend had never tried it before. After some persuasion she agreed to trip with me. I was hoping this would be a bonding experience that would bring our relationship to a new spiritual intimacy. I was loaned a batch of salvia 10x from a friend that worked at the local head shop on the grounds of the arriving equinox. I under estimated the strength of saliva because of all prior events had pot in the bowl.
I walked over to my friend’s house with my girl. He wasn’t their, but his father was on the porch and told me that he wasn’t home. I had to get my friends bubbler and it was in his room. I marched in past him saying “My house!” and grabbed the sock wrapped bubbler and left hastily. We went to the heavily wooded campus of saint Martins University, where monks roam and live. I took her to the spot were me and my bud Ben tested out the batch with a bowl of pot. I named it the healing woods after a few strange events. After contemplating the perfect spot we leaned against a tree next to an uprooted tree looking at the swamp/pond. Loaded the bubbler, getting tingly with anticipation/excitement. Told her to hold the hit at least 20 seconds, handed her the bub and she lit it. Took a strong hit, cleared it and held it.
Exhalation was immediately followed by squeal-ish laughter and gasps. I Immediately joined in the laugher, appreciating this moment of bliss we were sharing. In my experience uncontrollable laughter is a normal event with salvia. I loaded my bowl and thought “here it goes” and ignited the bowl. The watery pineish taste that is unforgettable.
A fairly large rip.
Hold.
Exhale.
I’m grinning wide and feeling a bit hyper sensitive but mainly interested in my girlfriends experience. She’s disoriented and confused, but not in a bad place which is what I fear. I tell her I’m going to write the healing symbol on a blank post-it note tacked on a tree near by. I try to get up but I can’t really move properly. I have to stay put.
“Okay….” I’m telling myself. “This is normal with salvia, you’re fine.”
I look over to my girl friend, she looks alright. I guess everything’s just fine. I turn to see any changes in the landscape. “Nothing… okay…I guess 10x is too weak for me”. I turn to see my girlfriend.
*WHOA!*
She has big golden cat like eyes and we are suddenly attached to the tree, spinning above and under ground, I can hear the tree spinning, growing, and breathing. I feel myself sinking into the tree and I have to fight to stay above surface. And time is on this strange new urgent time scale. The new landscape is dark and traveling, like crawling underground as well as flying through space. Everything is ultra-organic. Everything is a living personality. The whole forest is telepathically communicating with itself, like a bickering family almost. Who’s the strongest, wisest? Whose who. Their was a definite hierarchy in the forest. All focused toward integrating us (anything) with the forest on every level and dimension. And the uprooted tree is trying to directly convince me of the decision to merge. I’m unsure and a bit frighten.
I ask my girlfriend “DO YOU WANT TO BE A TREE?” she’s very confused by this. “wha? I duno…uh...”
We’re spinning faster and time is running out. The root is losing its patent demeanor. Now it’s almost scolding me.  I can feel it telling me. It’s almost invading. I’m getting this paranoia/suspicion that when hippies take psychedelics in the woods, the woods knows and takes advantage of the vulnerability of a person for its own benefit.
I ask her again in my broken slur. “dO yOu WaNT tO BEE A trEE?”
I’m imagining spending my life in the forest talking with the trees and being in a family with them. I didn’t want that. I wanted to keep the family I was starting with her, not throw it away in the forest.
“noo…” she quietly said.
“me too” I said as I put my arm around her.
The spinning had slowed and now we were in this golden bluish bubble of love. We were both glowing and merging into each other. A three eyed three legged two armed human. This was freaking me out. So I let go of that thought and could barley hear the forest calling. I thought what the hell. I join the forest just for a second and was disassembled. Every part of me was feeding the forest. I could feel my blood under the bark and in the roots. My eyes were the leaves. I was drinking the sun. I was so wise and grand. My life time was so great. I was legend. I was a tree. A forest.
I give my head a shake back to reality/salvia after glow. I tell her I’m going get up to put the healing symbol on now. I slightly struggle to get up and, walk there like I’m drunk. Pen in hand I draw a circle, and then I scribble a plus sign. That’s the healing symbol I believe…
I smile to myself as I walk back to my girlfriend. I thought I had a mental fortitude too strong to be affected by 10x salvia but I guess I under estimated the salvia. I get back to her and ask her to tell me about her trip. She says after she took the hit everything went black…. And when I asked if she wanted to be a tree, she thought I was talking about some pattern in the ground. She wanted the high to leave (not very experienced with psychedelics) but it was still lingering. I feel a strange tingle in my bones that I learn to ignore. We walked back to my house and lay in my bed till we felt some what normal.
Overall, an amazing bonding experience that, disappointingly didn’t connect us mentally at all. I guess I just have to do it the normal way. May do it again…maybe for 2012….
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.


UX
Designer
Front Developer
PolytechNice
-
Engineering Degree
UNS
- Master of Computer Science
I like to
think
I like to code
I'm working at Air France
I create
mobile applications
Download my
resume
Look at my portfolio
anthonyloroscio
@
gmail.com
Anthony
Loroscio
Anthony Loroscio


{% extends "base.html" %} {% block title %}Edit your bio |{% endblock %} {% block js %} {% endblock %} {% block header%}
No HTML allowed, but paragraph tags will be added automatically and URLs will be turned in to links.


--- title: Maven server Scheduled Downtime ! layout: post published: true ---
Our hosting provider is physically moving some servers from one site to another..
Our server hosting the Maven repository will be moved tonight Thursday 18th, between 2am and 8am.
We will check as soon as the operation is completed that the Maven repository is properly serving the binaries you need.
Sorry for the disturbance,
The Kevoree Team


a)
The algorithm will be as follows:
Initialize the array say A that has length n such that it is true for all values, then traverse the indices of the original array. If the corresponding entry in the array A is true, swap the element at the current index with the element at the bit reversed position.
Set the entry in the array A that corresponds to the bit-reversed index equal to false.
The function is running less than n times. So, the run-time is .
1. do
2 if
3 then swap
b)
The implementation of the BIT-REVERSED-INCREMENT procedure is as follows:
Do the bit reversed increment which will add a one to the left most position in which all carries will go to left instead of right.
BIT – REVERSED –INCREMENT
1. let y be 1 followed by k-1 zeros.
2. while ()
3. do
4.
5.
6. end while
7. return ( )
This algorithm will take amortized time. So, take a binary counter and bit reversed counter and swap the values of the two counters and perform increment.
If swapping has already been done, then do not swap.
The total running time of BIT – REVERSED –INCREMENT s is.
c)
If a word is shifted left or right by one bit in unit time, then it is still possible to implement O(n) time bit reversal permutation in the following way:
BIT – REVERSED –INCREMENT
1.
2. count
3. while
4. do Shifts value of x by only 1 bit left.
5. count count + 1
6.
7. while (count > 0)
8. do Shifts value of x by only 1 bit right.
9. count = count – 1
still holds.
In this algorithm, only single shifts to the right or left are used.
a.
Consider the following algorithm to build an x rooted tree which is balanced:
HALF-BALANCE-TREE
1. Declare an array.
2.
3.
4. INSERT-NODE
5. if
6. return.
7. HALF-BALANCE-TREE
8. HALF-BALANCE-TREE
Time complexity:
In above algorithm the 2nd line call the INORDER-TRAVERSAL procedure to determine the in-order which takes time. The HALF-BALANCE-TREE procedure recursively call itself. Therefore its recurrence becomes:
Thus, time complexity becomes.
b.
In n-node -balanced binary tree the searching is done with the recursive calls. At any point the sub-tree having i nodes make recursive call the sub-tree having nodes. Therefore the recurrence becomes:
Where, is the constant, therefore total time taken by -balanced binary tree in searching is.
c.
It is already given that potential of tree is:
Where,, is the absolute difference between size of left and right sub-tree that is why the binary search tree has non-negative potential. The potential is non-negative because is the absolute difference between size of left and right sub-tree.
It is already known that in balanced binary search tree the size of left and right sub-tree is less than the size root x.
and,
Now, prove in balanced binary search tree by contradiction. At first suppose .
This implies …… (1)
It is already known that sum of size of left sub-tree and right sub-tree is one less than size of its root tree.
Now, move size of left tree to RHS to determine value of
…… (2)
Now, put size of right sub-tree in equation (1).
Move 2 to RHS
But, according to condition of -balanced search tree, therefore it’s a contradiction.
This implies.
The potential is sum of all nodes over, but according to above contradiction it is prove that there is no such node.
Therefore, in balanced search tree
Suppose there is x-rooted m-node tree which is not -balanced. This mean that it violets the property of -balanced tree.
Suppose size of left tree violets the property
…… (3)
It is already known that the sum of size of left sub-tree and right sub-tree is one less than size of its root tree.
Using equation (3)
Take as common
Remove -1 from RHS
The difference in size of left and right sub-tree that is becomes:
It is m-node tree therefore value of becomes m
Take m as common
…… (4)
Since,
Now, use equation (4)
So, when m-node is again rebuild into balanced tree then the potential at each node including root node must be 0. Therefore potential change must be at least.
If value of constant c must be greater than then the potential will get reduce to m. Since, the potential to rebuild a tree is m unit, the amortized cost of rebuilding is
Therefore, the value of constant must be .
e.
In n-node -balanced BST the total amortized cost of insert and delete operation is the sum of cost of insert or delete operation and the potential difference between two states.
The cost of insert or delete operation is same as the cost of searching a node in n-node -balanced BST.
As per part (b), the cost of searching the node is. Therefore the actual cost of insert and delete operation is also.
When a node x is inserted or deleted in tree then changes on those ith node which comes in path from node x to root. When insertion is occurred then is increased by 1.Theof all other remaining node get unchanged.
According to part (b), the number of nodes to the location where x is inserted is. Therefore the change in potential becomes:
Remove the constant c
Therefore the total amortized cost of insertion or deletion:
SELF ORGANISING LISTS BY MOVE-TO-FRONT
By the name it suggests it is a type of list in which self-organizing is done in such a way that its elements are reordered on the basis of its heuristics such that the average access time improves. The main purpose of this method is to increase efficiency of the sequential search. And it is done by forwarding the items towards the head list which are frequently accessed. In the best case it takes the constant time for the accessing of element. It can be implemented easily by the linked-list. It is efficient in insertion and memory allocation of the random node but inefficient in its accesses.a. Suppose there is a list of n-elements and an access sequence of keys to find elements, in order. In order to find any specific element in list, traverse the list from beginning till element is not found.
The cost of accessing the sequence using heuristic is denoted by and the symbol m is for the number of access in.
Now assume that there is a list L having n elements.
The sequence of operations which is provided one at a time and for each of the operations the heuristics H must execute the operation immediately without considering the future operations and it also look over the whole sequence before.
The worst case for Heuristic H on an access sequence is the access of the last (nth) element of list.
It is already mentioned that the cost of kth element of list is k.
Therefore the cost to access the nth element is n.
The cost of sequence is the summation of cost of each access. The numbers of access in sequence are m.
Hence, the cost of accessing the worst case using Heuristics H is
b. Move -to-front-Heuristics:
In this first find the element x in list and then advances to the first position in the list. Here is called as the rank for the element x in the list L. The cost of accessing sequence is denoted by using the move-to-front heuristics. Explaining with the help of example that is if the element x is at 2nd position in the list then its rank is 2. It is mentioned that the cost of finding xth element of list is x which is equal to the rank of the element in the list which is denoted by.
In the move-to-front heuristics after the accessing of the element x it is moved towards the front of L by the transpose operations.
Therefore, the cost of accessing the key element of list is the sum of cost of finding xth element in list and cost of moving it to first position of list.
The cost of finding xth element in list = x or
The cost of moving xth element of list to first is always one less than its rank like moving 4th element of list to first position requires 3 movements (4 to 3), (3 to 2) and (2 to 1).
Therefore,
The cost of moving xth element of list at first position=
The cost of accessing the key element of list that is
Hence the condition for the cost is .
c. The list after accessing of with the move-to-front technique is denoted by and after the heuristics H.
Correspondingly the cost of accessing the element is denoted by for the move-to-front technique and by the heuristics H and it is also provided that the number of transpose is by the heuristics H.
Since the cost for the ith operation in the move-to-front technique is,
for the accessing of the element x.
The list is reordered by transposing (changing the position of element) the element of list. The cost of one transposition is one unit.
It is already mentioned that the cost of finding xth element of list is x which is equal to the rank of the element in the list which is denoted by.
Therefore, the cost for accessing the xth element of list by the heuristics H is the sum of cost of accessing the xth element and number of transposition.
Where x = cost of accessing xth element.
= number of transposition.
The cost of accessing the xth element is equal to the rank of xth element which is denoted by
Hence proved
d. Inversion:
An inversion in the list for a pair of element y and z has done in such a way that z is preceded by y in the list and y is preceded by z in the list and the number of inversion is denoted by. The potential function maps list with number of inversions.
Since
And
The list is reordered by transposing (changing the position of element) the element of list. The cost of one transposition is one unit.
And as the transpose used to either create or destroy the 1 inversion so the change in potential function is denoted by the symbol which is equal to.
e . To understand the effect of the access sequence on the potential function, define or classify the elements into four sets which are as follows:
Where as
implies that elements come before x in list .
implies that elements come after x in list .
Now considering the above sets it implies that the elements of list are divided into four sets. Some element of list which came before x are in set A and remaining elements of list which came before x are in set B.
Therefore the total elements of list before x are the sum of set A and set B that is
The above sum of set A and B does not contain element x.
Therefore,
Rank that is of element is the position of x element in list.
For example the rank of 6th element in list is 6 or the number of elements till 6th element including itself.
Hence,
Or
Similarly, all the elements of list which come before x are the sum of set A and set C.Therefore
Or
When an element is accessed for a given operation, then,
Now considering the above access operation and its effect at the conclusion that
And
.
f. Considering the part (e) of the problem, the condition for the change in potential as when using move-to-front technique the x is moved forward that is in the front, it creates the inversions which is equal to and during the process inversions are destroyed. And the transpose for the heuristics in which the inversions created is less than equal to 1.
So using the concept of the above discussion the change in potential is
The amortized cost is defined as the sum of the cost of the access sequence and the change in the potential function which can be represented for the ith operation with the move-to-front technique as
g. Proof of amortized cost of access being bounded by
In this problem amortized cost defined in the part (f) is as follows,
From part (b) and ( f),
Put and
From part (e),
Put
Add on right hand side of the equality
Put
As
Hence proved
h. Considering the part (g) of the problem the condition is as follow:
Where, is the cost of accessing using heuristics.


My Literary World
Short Writing Pieces
A few of my favorite poems written by people of color.
The Gun Joke
by Jamaal May
- It’s funny, she says, how many people are shocked
- by this shooting and the next and next and the next.
- She doesn’t mean funny as in funny, but funny/li>
- as in blood soup tastes funny when you stir in soil.
- Stop me if you haven’t heard this one:
- A young man/old man/teenage boy walks into
- an office/theater/daycare/club and empties
- Ever hear the one about the shotgun? What do you call it
- when a shotgun tests a liquor store’s bulletproof glass?
- What’s the difference between a teenager
- with hands in the air and a paper target charging at a cop?
- What do you call it when a man sets his own house on fire,
- Stop me if you haven’t heard this one:
- The first man to pull a gun on me said it was only a joke,
- but never so much as smiled. The second said
- this is definitely not a joke, and then his laughter crackled
- through me like electrostatic—funny how that works.
- When she says it’s funny she means funny
- as in crazy and crazy as in this shouldn’t happen.
- This shouldn’t happen as in something is off. Funny as in
- off—as in, ever since a small caliber bullet chipped his spine,
- your small friend walks kinda’ funny and his smile is off.
the drone
by Clint Smith
- the drone was once a scrap of metal the drone looks as if it might be a toy the drone is not a
- toy the drone could have been something other than a killing machine the drone could have
- been a house the drone could have been a spoon the drone could have been a swing the
- drone does not know who it is going to kill next the drone is going to kill next the drone has
- learned to disguise itself as a shard of sky the drone’s soft hum is a disembodied echo the drone
- was mistaken for a star once the drone renders itself celestial the drone scoffs at sovereignty
- the drone asks what is a border if you can fly right over it? the drone was built by a man the
- drone killed a man & a woman & a child the drone killed a child & did not see her face
- the drone does not see a face the drone sees a body & then the body is gone.
How Can Black People Write About Flowers at a Time Like This
by Hanif Abdurraqib
- dear reader, with our heels digging into the good
- mud at a swamp’s edge, you might tell me something
- about the dandelion & how it is not a flower itself
- but a plant made up of several small flowers at its crown
- & lord knows I have been called by what I look like
- more than I have been called by what I actually am &
- I wish to return the favor for the purpose of this
- exercise. which, too, is an attempt at fashioning
- something pretty out of seeds refusing to make anything
- worthwhile of their burial. size me up & skip whatever
- semantics arrive
- to the tongue first. say: that boy he look like a hollowed-out
- grandfather
- clock. he look like a million-dollar god with a two-cent
- heaven. like all it takes is one kiss & before morning,
- you could scatter his whole mind across a field.


--- layout: post title: GRWU - Gnome RSS Wallpaper Updater date: "2014-01-01" ---
Because I wanted to make some updates to this tool, I found it more convenient to move the project to GitHub. Here's the link: https://github.com/lietu/grwu/
Further updates will happen there, and only there.
I was using the NASA image of the day RSS feed to dynamically update the wallpaper on my Windows desktops and realized I wasn't doing that on my linux desktops (which are running Gnome 3). I checked quickly and it looked like there were no existing tools for this, so I rolled my own.
Put the contents below to a file called "grwu.py" and place that file anywhere you want.
{{< highlight python >}} #!/usr/bin/env python # # GRWU - Gnome RSS Wallpaper Updater # # Reads an RSS feed, picks an image out of it, downloads it and updates your # gnome background image with that image. It is very much possible that this # only works with the NASA image of the day feed format. # # Recommend using with crontab (run "crontab -e" to edit it), add e.g.: # # 30 * * * * export $(xargs -n 1 -0 echo = 0 filename = uri.split('/')[-1].split('#')[0].split('?')[0] extension = filename.split('.')[-1] tmp = NamedTemporaryFile( suffix='.'+extension, dir=storeDir, delete=False ) d = zlib.decompressobj(16 + zlib.MAX_WBITS) while True: data = response.read(READ_BLOCK_SIZE) if not data: break if isGZipped: data = d.decompress(data) tmp.file.write(data) return tmp.name def _set_wallpaper(self, filename): """Update gnome wallpaper""" self.log("Updating background to " + filename) call([ "gsettings", "set", "org.gnome.desktop.background", "picture-uri", "file://" + filename ]) def _clean_dir(self, path, exclude): """Remove all but excluded contents in given path""" for root, dirs, filenames in os.walk(path): for f in filenames: fullpath = os.path.join(path, f) if not fullpath in exclude: os.remove(fullpath) if __name__ == "__main__": if len(sys.argv) == 2: rssUrl = sys.argv[1] wu = WallpaperUpdater(quiet) wu.update(rssUrl, tempPath, keepFiles) {{< /highlight >}}python /path/to/grwu.py [url]
If no URL is given it defaults to NASA image of the day feed, which honestly is probably the only one giving supported format RSS. I checked a few other "picture of the day" RSS feeds and they seem to be quite random in how they provide the links to the images, and didn't bother supporting them.
Recommended usage is that you add a line in your crontab (run "crontab -e" to edit it) to periodically update your wallpaper, e.g. to update it every 30 minutes add:
30 * * * * export $(xargs -n 1 -0 echo </proc/$(pidof gnome-session)/environ | grep -Z DBUS_SESSION_BUS_ADDRESS=); python /path/to/grwu.py [url]
That horrible export command at the front is needed because the idiots behind the linux desktop development came up with DBUS and are now using it for everything. It pulls the DBUS session address for your running gnome session out of the environment of the running process and exports it to the cron environment before running the script.


June 22ND @ American Airlines Arena
Joseph Chica will be performing along side his idle Frederic Chopin for the first time in his career. This is sure to be an epic event you won't want to miss!
July 18th 2018 @ Bank Atlantic Center
A once in a lifetime opportunity to catch Joseph Chica performing exclusively his own original compositions. The show promises to be one of the years most impressive performances to date.
Decembner 25th 2018 @ the Watsco Center
Have you been good this year? Treat yourself to a jaw dropping performance by one of 2018/s feature composers and performers. Joseph will be performing his very nown renditions of your favoite Holiday tunes.


PollyReports is a report generation module for Python. It is intended to be used with Reportlab to create PDFs using data drawn from a database.
The source code is hosted on github at the following address:
https://github.com/Solomoriah/PollyReports
PollyReports is available via PyPI at:
http://pypi.python.org/pypi/PollyReports
I have an extensive and growing dissertation about this project on my blog at:
http://opensource.gonnerman.org/?cat=4


There is no substitute for a short demonstration program. This java archive (jar file) contains ready-to-run Java programs from An Introduction to Computer Simulation Methods by H. Gould, J. Tobochnik and W. Christian (Prentice Hall 2007).
Double-clicking on a leaf-node in the Launcher's left-hand "tree" to run examples from the following chapters:
Additional examples, source code, and errata are available from the OSP website:
http://www.opensourcephysics.org.
License: The Open Source Physics code library and programs in An Introduction to Computer Simulation Methods are being distributed by the Open Source Physics project under the GNU General Public License. A copy of this License is included on the OSP CD. If this CD is not available, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston MA 02111-1307 USA or view the license online at
http://www.gnu.org/copyleft/gpl.html.


Advisory Services
More than just break-fix, support is about preventing problems so you can anticipate, identify and correct issues before they occur.
IT Advisory Services
- Two packages—Essential and Strategic—to suit your unique needs, providing features and functionality focused on reducing downtime and helping you optimize your IT environment..
- Reporting, analysis and planning, including multivendor assets.
- Essential Package is a more compact feature set, still delivering proactive reporting and analytics. .
- Strategic Package provides features such as Remote Advisory Service and Proactive Maintenance.
Remote Advisory Services
- Support your specialized applications and solutions,with access to technical expertise on topics such as virtualization, systems management, and more.
- Phone-based and Internet-based consultation, configuration and management support on a variety of different topics.
- Unparalleled flexibility with pay on a per-incident basis or an annual contract.
Proactive Maintenance
- Reduce unplanned downtime and optimize stability with scheduled assessments, streamlined patch management, detailed reporting and more.
- Get schedule assessments, streamlined patch management and detailed reporting.
- Resolve potential issues before they happen..
Streamline processes to ensure greater stability now and into the future.


My Dev Academy Journey
This is the home page for my Dev Academy Foundations course.
Here you will find links to my various learning blogs for the course I started in August 2021.
Blog Links below.
This is the home page for my Dev Academy Foundations course.
Here you will find links to my various learning blogs for the course I started in August 2021.
Blog Links below.


Response File
The next step in the DB2 product deployment is to create a response file.
A response file is used to tell the installation process what to install and how to configure it.
Using response file can simplify the installation
script considerably by reducing the number of commands that must be run after the installation.
You can create a response file using below methods:-
- Using DB2 Setup wizard:-
The easiest way to create a response file is using the DB2 Setup wizard.
You can use this GUI wizard to go through the installation and then save the response file.
This method enables you to easily select which components you want to install and what configuration
options you want.
- Using Response file generator:-
After installing your DB2 product, you can create a response file using the DB2 response file
generator utility, db2rspgn. The db2rspgn utility takes a snapshot of your product installation
and configuration settings. This utility saves this information in a response file and in a
configuration profile. This utility is not available for the Data Server Driver.
- Using sample response files:-
You can also create a response file by copying one of the sample response files from the DVD and
modifying it. Samples are typically available in the db2/platform/samples directory,
where platform is the platform identifier.
After successful creation of response file from the above methods the next step is to modify the response file.
A response file can be easy to use, although you should test it prior to deploying it across a large enterprise.
According to the requirement you can modify the response file.


Everyone should be able to access and enjoy the web. We’re committed to making that a reality.
Find Guides and Resources
-
Developers and Publishers
Information and resources to help you develop accessible products and apps.
-
Enterprise and Business
Guides and resources for implementing and managing accessibility tools and practices in your company.
-
Initiatives and Research
Google's support of accessibility extends beyond accessibility tools to include both external and internal research efforts.


Simple and Secure Identity Owner Ship management
Find Out MoreSelf soverign user centralized system of identity management
Create your Encryption Signed Key NowBeacuse passwords are outdated
The Secure key is de-centrilzed , user-centric and can be extended to IOT eco-system
Can integrate with other third party bodies like insurance agencies , telecom companies , banks , digital copyrightsandetc . Also access to who is using my information and revoke access anytime
We build this almost from scrtch , customizing at many points to suit local demands
some link


Opensea.io , rarible, superrare, cargo, mintbase, mintable , etc.
Next Question: What is metaData of NFT?.
by Know Your NFT


Tag: 2d-array
-
Leetcode 0048. Rotate Image (14 Aug 2021)
-
Leetcode 0059. Spiral Matrix II (14 Aug 2021)
-
Leetcode 0063. Unique Paths II (14 Aug 2021)
-
Leetcode 0073. Set Matrix Zeroes (14 Aug 2021)
-
Leetcode 0120. Triangle (14 Aug 2021)
-
Leetcode 0296. Best Meeting Point (14 Aug 2021)
-
Leetcode 0302 Smallest Rectangle Enclosing Black Pixels (14 Aug 2021)
-
Leetcode 0308. Range Sum Query 2D - Mutable (14 Aug 2021)
-
Leetcode 0361. Bomb Enemy (14 Aug 2021)
-
Leetcode 0363. Max Sum of Rectangle No Larger Than K (14 Aug 2021)
-
Leetcode 0378. Kth Smallest Element in a Sorted Matrix (14 Aug 2021)
-
Leetcode 0407. Trapping Rain Water II (14 Aug 2021)
-
Leetcode 0498. Diagonal Traverse (14 Aug 2021)
-
Leetcode 0566. Reshape the Matrix (14 Aug 2021)
-
Leetcode 0576. Out of Boundary Paths (14 Aug 2021)
-
Leetcode 0827. Making A Large Island (14 Aug 2021)
-
Leetcode 0832. Flipping an Image (14 Aug 2021)
-
Leetcode 0835. Image Overlap (14 Aug 2021)
-
Leetcode 1074. Number of Submatrices That Sum to Target (14 Aug 2021)
-
Leetcode 1091. Shortest Path in Binary Matrix (14 Aug 2021)
-
Leetcode 1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix (14 Aug 2021)
-
Leetcode 1289. Minimum Falling Path Sum II (14 Aug 2021)
-
Leetcode 1293. Shortest Path in a Grid with Obstacles Elimination (14 Aug 2021)
-
Leetcode 1301. Number of Paths with Max Score (14 Aug 2021)
-
Leetcode 1329. Sort the Matrix Diagonally (14 Aug 2021)
-
Leetcode 1439. Find the Kth Smallest Sum of a Matrix With Sorted Rows (14 Aug 2021)
-
Leetcode 1465. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts (14 Aug 2021)
-
Leetcode 1559. Detect Cycles in 2D Grid (14 Aug 2021)
-
Leetcode 1591. Strange Printer II (14 Aug 2021)
-
Leetcode 1632. Rank Transform of a Matrix (14 Aug 2021)
-
Leetcode 1878. Get Biggest Three Rhombus Sums in a Grid (14 Aug 2021)
-
Leetcode 1937. Maximum Number of Points with Cost (14 Aug 2021)


The paper proposes the use of task-conditioned HyperNetworks for lifelong learning / continual learning setups.
The idea is, the HyperNetwork would only need to remember the task-conditioned weights and not the input-output mapping for all the data points.
$f$ denotes the network for the given $t^{th}$ task.
$h$ denotes the HyperNetwork that generates the weights for $f$.
$\Theta_{h}$ denotes the parameters of $h$.
$e^{t}$ denotes the input task-embedding for the $t^{th}$ task.
When training on the $t^{th}$ task, the HyperNetworks generates the weights for the network $f$.
The current task loss is computed using the generated weights, and the candidate weight update ($\Delta \Theta_{h}$) is computed for $h$.
The actual parameter change is computed by the following expression:
$L_{total} = L{task}(\Theta_{h}, e^{T}, X^{T}, Y^{T}) + \frac{\beta_{output}}{T-1} \sum_{t=1}^{T-1} | f_{h}(e^{t}, \Theta_{h}^*) - f_{h}(e^{(t)}, \Theta_{h} + \Delta \Theta_{h} ))|^2$
$L_{task}$ is the loss for the current task.
$(X^{T}, Y^{T})$ denotes the training datapoints for the $T^{th}$ task.
$\beta_{output}$ is a hyperparameter to control the regularizer’s strength.
$\Theta_{h}^*$ denotes the optimal parameters after training on the $T-1$ tasks.
$\Theta_{h} + \Delta \Theta_{h}$ denotes the one-step update on the current $h$ model.
In practice, the task encoding $e^{t}$ is chunked into smaller vectors, and these vectors are fed as input to the HyperNetwork.
This enables the HyperNetwork to produce weights iteratively, instead of all at once, thus helping to scale to larger models.
The paper also considers the problem of inferring the task embedding from a given input pattern.
Specifically, the paper uses task-dependent uncertainty, where the task embedding with the least predictive uncertainty is chosen as the task embedding for the given unknown task. This approach is referred to as HNET+ENT.
The paper also considers using HyperNetworks to learn the weights for a task-specific generative model. This generative model will be used to generate pseudo samples for rehearsal-based approaches. The paper considers two cases:
HNET+R where the replay model (i.e., the generative model) is parameterized using a HyperNetwork.
HNET+TIR, where an auxiliary task inference classifier is used to predict the task identity.
Three setups are considered
CL1 - Task identity is given to the model.
CL2 - Task identity is not given, but task-specific heads are used.
CL3 - Task identity needs to be explicitly inferred.
On the permuted MNIST task, the proposed approach outperforms baselines like Synaptic Intelligence and Online EWC, and the performance gap is more significant for larger task sequences.
Forward knowledge transfer is observed with the CIFAR datasets.
One potential limitation (which is more of a limitation of HyperNetworks) is that HyperNetworks may be harder to scale for larger models like ResNet50 or transformers, thus limiting their usefulness for lifelong learning use cases.