My inspiration
The most rewarding and challenging time of my life and an experience that I will always look back on as the high point of my professional and personal career was the four years I spent as a stay at home dad. The clarity in positive leadership and compassionate supervision I gained during this time are skills that are impossible to learn in any classroom and most, if not all, traditional leadership positions.
Recent Projects
-
Udaci-Cards
This project was completed as part of the Udacity React NanoDegree program and allows users to study collections of flashcards. The app allows users to create different categories of flashcards called "decks", add flashcards to those decks, then take quizzes on those decks.
View Project → -
Sudoku Solver
This project was performed as part of the Udacity nanodegree program. It solves a diagonal sudoku puzzle using constraint propogation utilizing the naked twin, elimination and only choice strategies.
View Project →
-
Readable
This project was completed as part of the Udacity React NanoDegree program and is a content and comment web app. Users can post content to predefined categories, comment on their posts and other users' posts, and vote on posts and comments.
View Project → -
Isolation Agent
This project was performed as part of the Udacity nanodegree program with the goal of producing a game playing agent for isolation. Isolation is a deterministic, two-player game in which the players alternate...
View Project →
Let's dream together
The best software comes from an intimate relationship between the developer and the client. It represents a collaboration in which the shared vision and dream come to life, creating something new, something extraordinary.


Our website uses cookies.
Cookies allow us to distinguish you from other users of our website, personalise content and ads, provide social media features and analyse your use of this website. We may also share information about your usage with our social media, advertising and analytics partners. You may delete and block cookies from this website, but deleting some cookies may mean some parts of the website may not work (see our Cookies Policy for more information).


Top 5 Indian Architectural Marvels
Construction and architecture have risen to a new level altogether with great minds working enthusiastically towards
building India with amazing structures. India prides itself on having some of the most contemporary designs for
offices, especially in the IT sector.
It's amazing how modern architecture is changing the look of India, with the infrastructure boom in play we see new shapes
and beautiful looking buildings cropping up all around India.
Here is the list of such 10 buildings:
- International Tech Park, Bangalore
-
Commonly called ITPL and sometimes ITPB is a tech park located in Whitefield, Bangalore.
It features several sporting arenas along with The Vivanta by Taj Hotel.
It was created as a result of a joint venture between India and Singapore in January 1994. It is a large facility, comprising
9 buildings-Discoverer, Innovator, Creator, Explorer, Inventor, Navigator, Voyager and Aviator plus a building belonging to TCS
which is called Pioneer. The tenth building which is under construction will be called "Victor".
With about 140 stores in the Park Square, spread over an area of about 450,000 sq. ft., this 4 floor building is amongst the leading architectural
marvels of India.
- Imperial SD Tower, Mumbai
-
Imperial SD Tower a twin tower, residential skyscraper and is currently ranked as the highest completed
architectural structure in India. With 61 floors and a height of 254 meters the building is designed by the popular Indian
Architect, Hafeez Contractor, making his one of the most recognizable project to date.
It has a floor area of 1,300,000 sq. ft., with 17 elevators and several other up-to date technologies used The Imperial stands
out as an example in the Indian architectural marvels built to date.
- Lokhandwala Minerva
-
Lokhandwala Minerva is an 82-floor supertall skyscraper under construction in Mumbai, Maharashtra. It will have two towers of
82 floors each which will encompass parking floors from 2nd to 16th, Podium Garden on 17th floor, residential floors on 26th to 79th, service
floor on 80th and penthouse on 81, 82 and terrace (Wikipedia).
It is built on a slum land, which was acquired by the builders using re-development models which include providing free land and rehabilitation.
- One Avighna Park
-
One Avighna Park is a cluster redevelopment project, and is envisaged to house- Twin 64-storey Luxury Residential Towers, One 40-storey
Hospitality/Commercial Tower & Seven Rehabilitation Towers in Mumbai, Maharashtra. The project in already under construction, with 51
out of 64 proposed floors completed till date and is expected to launch by this year.
The building is also pre-certified as a Platinum Rated Green Building
by IGBC. It was also awarded 7 star rating by CARE
in Real Estate Category-2014 .
With several other awards in the bag, the estimated cost of construction
is $280 million (approx. 1800 crores INR).
- Ramoji Film City
-
Located in Hyderabad, with an area of about 2000 acres Ramoji Film City (http://ramojifilmcity.com/) is the largest integrated
Film City in the world. Established by Indian Film producer Ramoji Rao in 1996, the facility has been certified by The Guinness
Book of World Records as the
world's largest film studio complex.


|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | ENUM CONSTANTS | FIELD | METHOD | DETAIL: ENUM CONSTANTS | FIELD | METHOD |
java.lang.Object java.lang.Enum<OperatingSystem> nl.bitwalker.useragentutils.OperatingSystem
public enum OperatingSystem
Enum constants for most common operating systems.
| Enum Constant Summary | |
|---|---|
ANDROID
|
|
ANDROID1
|
|
ANDROID2
|
|
ANDROID2_TABLET
|
|
ANDROID3_TABLET
|
|
ANDROID4
First Android 4 device is the Galaxy Nexus phone. |
|
ANDROID4_TABLET
|
|
BADA
Bada is a mobile operating system being developed by Samsung Electronics. |
|
BLACKBERRY
BlackBerryOS. |
|
BLACKBERRY_TABLET
|
|
BLACKBERRY6
|
|
BLACKBERRY7
|
|
GOOGLE_TV
Google TV uses Android 2.x or 3.x but doesn't identify itself as Android. |
|
IOS
iOS4, with the release of the iPhone 4, Apple renamed the OS to iOS. |
|
iOS4_IPHONE
|
|
iOS5_IPHONE
|
|
KINDLE
Various Linux based operating systems. |
|
KINDLE2
|
|
KINDLE3
|
|
LINUX
|
|
MAC_OS
Older Mac OS systems before Mac OS X |
|
MAC_OS_X
|
|
MAC_OS_X_IPAD
|
|
MAC_OS_X_IPHONE
|
|
MAC_OS_X_IPOD
|
|
MAEMO
Linux based Maemo software platform by Nokia. |
|
PALM
|
|
PSP
|
|
ROKU
|
|
SERIES40
Nokia's Series 40 operating system. |
|
SONY_ERICSSON
Proprietary operating system used for many Sony Ericsson phones. |
|
SUN_OS
|
|
SYMBIAN
Other Symbian OS versions |
|
SYMBIAN6
Symbian OS 6.x versions. |
|
SYMBIAN7
Symbian OS 7.x versions. |
|
SYMBIAN8
Symbian OS 8.x versions. |
|
SYMBIAN9
Symbian OS 9.x versions. |
|
UNKNOWN
|
|
WEBOS
PalmOS, exact version unkown |
|
WII
Nintendo Wii game console. |
|
WINDOWS
Windows Mobile / Windows CE. |
|
WINDOWS_2000
|
|
WINDOWS_7
|
|
WINDOWS_98
|
|
WINDOWS_MOBILE
|
|
WINDOWS_MOBILE7
|
|
WINDOWS_VISTA
|
|
WINDOWS_XP
|
| Method Summary | |
|---|---|
DeviceType |
getDeviceType()
|
OperatingSystem |
getGroup()
|
short |
getId()
|
Manufacturer |
getManufacturer()
Returns the manufacturer of the operating system |
java.lang.String |
getName()
|
boolean |
isInUserAgentString(java.lang.String agentString)
Checks if the given user-agent string matches to the operating system. |
boolean |
isMobileDevice()
|
static OperatingSystem |
parseUserAgentString(java.lang.String agentString)
Parses user agent string and returns the best match. |
static OperatingSystem |
valueOf(short id)
Returns the enum constant of this type with the specified id. |
static OperatingSystem |
valueOf(java.lang.String name)
Returns the enum constant of this type with the specified name. |
static OperatingSystem[] |
values()
Returns an array containing the constants of this enum type, in the order they are declared. |
| Methods inherited from class java.lang.Enum |
|---|
compareTo, equals, getDeclaringClass, hashCode, name, ordinal, toString, valueOf |
| Methods inherited from class java.lang.Object |
|---|
getClass, notify, notifyAll, wait, wait, wait |
| Enum Constant Detail |
|---|
public static final OperatingSystem WINDOWS
public static final OperatingSystem WINDOWS_7
public static final OperatingSystem WINDOWS_VISTA
public static final OperatingSystem WINDOWS_2000
public static final OperatingSystem WINDOWS_XP
public static final OperatingSystem WINDOWS_MOBILE7
public static final OperatingSystem WINDOWS_MOBILE
public static final OperatingSystem WINDOWS_98
public static final OperatingSystem ANDROID
public static final OperatingSystem ANDROID4
public static final OperatingSystem ANDROID4_TABLET
public static final OperatingSystem ANDROID3_TABLET
public static final OperatingSystem ANDROID2
public static final OperatingSystem ANDROID2_TABLET
public static final OperatingSystem ANDROID1
public static final OperatingSystem WEBOS
public static final OperatingSystem PALM
public static final OperatingSystem IOS
public static final OperatingSystem iOS5_IPHONE
public static final OperatingSystem iOS4_IPHONE
public static final OperatingSystem MAC_OS_X_IPAD
public static final OperatingSystem MAC_OS_X_IPHONE
public static final OperatingSystem MAC_OS_X_IPOD
public static final OperatingSystem MAC_OS_X
public static final OperatingSystem MAC_OS
public static final OperatingSystem MAEMO
public static final OperatingSystem BADA
public static final OperatingSystem GOOGLE_TV
public static final OperatingSystem KINDLE
public static final OperatingSystem KINDLE3
public static final OperatingSystem KINDLE2
public static final OperatingSystem LINUX
public static final OperatingSystem SYMBIAN
public static final OperatingSystem SYMBIAN9
public static final OperatingSystem SYMBIAN8
public static final OperatingSystem SYMBIAN7
public static final OperatingSystem SYMBIAN6
public static final OperatingSystem SERIES40
public static final OperatingSystem SONY_ERICSSON
public static final OperatingSystem SUN_OS
public static final OperatingSystem PSP
public static final OperatingSystem WII
public static final OperatingSystem BLACKBERRY
public static final OperatingSystem BLACKBERRY7
public static final OperatingSystem BLACKBERRY6
public static final OperatingSystem BLACKBERRY_TABLET
public static final OperatingSystem ROKU
public static final OperatingSystem UNKNOWN
| Method Detail |
|---|
public static OperatingSystem[] values()
for (OperatingSystem c : OperatingSystem.values()) System.out.println(c);
public static OperatingSystem valueOf(java.lang.String name)
name
- the name of the enum constant to be returned.
java.lang.IllegalArgumentException
- if this enum type has no constant
with the specified name
java.lang.NullPointerException
- if the argument is nullpublic short getId()
public java.lang.String getName()
public boolean isMobileDevice()
public DeviceType getDeviceType()
public OperatingSystem getGroup()
public Manufacturer getManufacturer()
public boolean isInUserAgentString(java.lang.String agentString)
agentString
-
public static OperatingSystem parseUserAgentString(java.lang.String agentString)
agentString
-
public static OperatingSystem valueOf(short id)
id
-
|
|||||||||
| PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
| SUMMARY: NESTED | ENUM CONSTANTS | FIELD | METHOD | DETAIL: ENUM CONSTANTS | FIELD | METHOD |


H.B. Woodrose Seeds
This is the only kind of 'psychoactive substance' I've ever taken, outside of alcohol and marijuana eaten or smoked occasionally. I hadn't eaten for around 6 hours, so I thought it would be a good time to take some HBW seeds. I'd tried the night before taking two, which brought about a general 'large-dose of caffeine' feeling, although this probably isn't a good description. After carving off the outer brown portion of each seed, I chewed up and swallowed with water the white substance of approx. 4.5 seeds. I wasn't taking any medications at the time, except some occasional 5-HTP.
About an hour and a half afterwards, I started feeling a strange 'overfilled air balloon' feeling in the brainstem region, not very pleasant, and a slight nausea. I was at first unmovable and lethargic, and at once had this feeling like the regular 'me' wasn't there, that now, occupying my body was a non-entity, or a tree or something. I didn't want to address questions addressed to the 'me' that wasn't there. Emotions were flat, and everything and everyone seemed exactly 'as is' (almost as if normal hallicinatory experiences of everyday life are taken away). I also felt a compassion for 'humanity', since I didn't feel like a human. I also noticed, going for a walk outside, that after a couple hours, anything unfamilliar became frightening, and I needed a familliar setting in order to feel ok.
A couple hours after this, sensations were extremely heightened, and simply lying in bed was wonderful; sheets and beddings were exquisitely comfortable, like I'd never before felt comfortable, *this* was comfort, as I resumed a strange legs-over head position (as my limbs felt virtually weightless). Touch from outer sources were felt throughout the whole body, and were almost as if coming from pleasure centers in the mind directly instead of through the skin.
Overall, the intensity of the experience was almost too much to handle, but I'm glad I went through with it. I can definitely say it was good to have my boyfriend there with me, or the experience may have been *a lot* more negative. It can either be horrible or wonderful. It also made me think about things in a way I haven't thought of for that long of period - it is disturbing to loose a sense of oneself, but potentially enlightening as well.
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.


--- title: The Inaccurate Spectrum of Political Ideology author: Brian Vickers date: '2019-08-04' slug: the-spectrum-of-political-ideology categories: - politics - visualizations tags: - theory - statistics subtitle: '' summary: '' authors: [] lastmod: '2019-08-04T19:34:24-04:00' featured: no image: caption: '' focal_point: '' preview_only: no projects: [] output: html_document editor_options: chunk_output_type: console ---
With the recent debates on the Democratic side I have seen people discussion political ideology as a spectrum with some people on the left and some people on the right. I wanted to write a short detail on reasons that doesn’t hold up to statistical scrutiny.
To start, here is what people generally presume. There is an idea that there is a broad spectrum of political ideology and that everyone will fall somewhere on the left or right side of the spectrum. That looks something like this.
set.seed(2019) # For replicability
n_per_party <- 1000
political_m <- .75
pol_cols <- c('blue', 'tan', 'red')
## Build some simulated data
individuals <- bind_rows(
# Democrats
data.frame(party = 'Democrats',
political_score = rnorm(n = n_per_party, mean = -1 * political_m)),
# Republicans
data.frame(party = 'Republicans',
political_score = rnorm(n = n_per_party, mean = +1 * political_m)),
# Independents
data.frame(party = 'Independents',
political_score = rnorm(n = n_per_party, mean = 0))
) %>%
mutate(party = factor(party, levels = c('Democrats', 'Independents', 'Republicans')))
So we can see how things look overall…
ggplot(individuals, aes(x = political_score)) +
geom_density(colour = 'gray50', fill = 'gray70', alpha = 1/5) +
scale_y_continuous(limits = c(0, .50)) +
labs(x = 'Political Ideology')
And when we break it down by political ideology.
ggplot(individuals, aes(x = political_score, fill = party)) +
geom_density(colour = 'gray50', alpha = 1/5) +
scale_fill_manual(values = pol_cols) +
scale_y_continuous(limits = c(0, .50)) +
theme(legend.position = 'top')


The OSGi console can be a useful tool when debugging or testing Cytoscape apps under development.
To use the OSGi console, start Cytoscape using the command line. Open a terminal window and change directory to your Cytoscape installation. On MS Windows, type “cytoscape.bat”, on Mac or Linux, type “./cytoscape.sh”. After a while, Cytoscape will get started. On the terminal, a prompt that looks like the following will appear:
Cytoscape 3.0.1>
This is your OSGi interactive shell.
Presented in the next set of slides are some commands you will find useful. You can also look at this page for more information, or use the "help" command to see a full list.
The command “list” will list all the Cytoscape bundles and their states, “Active”, “Installed”.
Cytoscape 3.0.1> list
To install your app bundle, use the "install" command. If you use Maven, you can reference a bundle installed in your repository as follows:
Cytoscape 3.0.1> install mvn:org.cytoscape.sample/sample02
Bundle ID: 169
You can install a bundle from a file:
Cytoscape 3.0.1> install file:/path/2/myApp.jar
After you issue this command, you will get your bundle ID if the command is executed successfully.
To start a bundle, use the "start" command. To do this, you need the bundle number (use the "list" command mentioned above if you don't know it). Then issue the following command: (substitute your own bundle number for 169)
Cytoscape 3.0.1> start 169
Invoke the “list” command - the bundle should now show up as "Active" if it started successfully.
[ 169] [Active ] [ ] [ 200] sample02 (3.0.0.alpha8-SNAPSHOT)
You can then use the app within Cytoscape.
To stop a bundle that has been loaded, use the "stop" command with the bundle number as follows:
Cytoscape 3.0.1> stop 169
If you invoke the “list” command, you will notice that your bundle is now in state “Installed” instead of "Active".
[ 169] [Installed ] [ ] [ 200] sample02 (3.0.0.alpha8-SNAPSHOT)
To update a bundle that was previously installed, use the update command as follows:
Cytoscape 3.0.1> update 169
After you compile your app, you can use “update” to update your bundle. You may use this command a lot, when you are debugging your code.
To uninstall a bundle, use the uninstall command as follows:
Cytoscape 3.0.1> uninstall 169
This will completely remove your app from Cytoscape. You can verify it with the 'list' command.


algorithms
programming
My PyCon US 2023 Powersort Talk
I presented Powersort and its story at PyCon US 2023, the largest Python community conference. Here are some resources and impressions from the last couple of days here in Salt Lake City.
Resources
- Talk recording
- Talk slides
(Speakerdeck seems to have an issue with my fancy transparency patterns, but you can download the pdf) - Colab notebook with the (educational) implementations of Timsort and Powersort
- How-to for donating data to the Adaptive Sorting Benchmark
Here’s the blurb from the talk submission:
Quicksort, Timsort, Powersort - Algorithmic ideas, engineering tricks, and trivia behind CPython’s new sorting algorithm
Writing a sorting function is easy - coding a fast and reliable reference implementation less so. In this talk, I tell the story behind CPython’s latest updates of the list sort function.Aims: entertain people with twists of history and algorithmic puzzles, which tell a lovely story of how a seemingly useless piece of theory lead to the fastest and most elegant solution of a practical challenge.
Target audience: geeks believing in the power of solid algorithmic thinking; programmers interested in engineering performance-critical code; all Python enthusiast curious about what makes (sorting lists in) Python fast.
Content: After using Quicksort for a long while, Tim Peters invented Timsort, a clever Mergesort variant, for the CPython reference implementation of Python. Timsort is both effective in Python and a popular export product: it is used in many languages and frameworks, notably OpenJDK, the Android runtime, and the V8 JavaScript engine.
Despite this success, algorithms researchers eventually pinpointed two flaws in Timsort’s underlying algorithm: The first could lead to a stack overflow in CPython (and Java); although it has meanwhile been fixed, it is curious that 10 years of widespread use didn’t bring it to surface. The second flaw is related to performance: the order in which detected sorted segments, the “runs” in the input, are merged, can be 50% more costly than necessary. Based on ideas from the little known puzzle of optimal alphabetic trees, the Powersort merge policy finds nearly optimal merging orders with negligible overhead, and is now (Python 3.11.0) part of the CPython implementation.
Impressions
PyCon US is huge; there were 2200 attendees on site, plus over 400 online participants; the industrial sponsors alone donated over $1 million (!) towards the event. (Cheers to JetBrains for bringing proper coffee to the US and giving it away for free (cappuccinos throughout the conference, yay ☕), and AWS & Superblocks for inviting the whole conference to their party 🍺).
Talk topics were very mixed and broad; some talks presented technical details on changes to the CPython implenentation (like the two talks by Mark and Brandt from the Faster CPython initiative, or the flurry of talks on PyScript, the attempts to make Python run in the browser(!)), whereas others provided an overview of an area or reported on particular projects (such as games on the micro:bit or algorithmic embroidery).
I was also deeply impressed by how much PyCon has going on in terms of community building at the conference (and outside of it), and how much personal appreciation people showed for each other. It is a remarkable achievement to not only get the technical aspects of the language right, but also the community around it. While one first needs a thing to gather around before a community can evolve, it makes me wonder whether a healthy community indeed doesn’t follow, but cause the success of Python.
I was very happy that Guido van Rossum made it to my talk. Of course, I couldn’t let the opportunity pass to interview him on sorting in CPython afterwards:
“I don’t remember the exact reasoning, but the mere fact that we used
qsort
for sorting lists shows you that I didn’t care much about sorting.”
Fair enough 😉
Had that been any different, who knows whether I would have had an excuse to enjoy PyCon US today?


Irish fears that RWC reject Kieran Marmion would take up English offer have ended
by Online EditorsIreland World Cup reject Kieran Marmion has finally set aside his frustration and has extended his contract with Connacht through to 2023.
Upset that he was not included by Joe Schmidt for the recent finals in Japan, Marmion, the starter at No9 when Ireland defeated New Zealand in November 2018, was said to be considering a move to the UK.
The London-born, Welsh-raised Irish exile was apparently in demand, with Saracens, the club his late father Mick played for, among his suitors.
However, the 27-year-old, who had been capped 27 times by Ireland before being excluded by Schmidt for the World Cup, has decided to take up a three-year extension offer with Connacht, the club he has been with since joining their academy in 2011.
“Kieran’s commitment to Connacht for a further three seasons demonstrates his ambition to contribute at provincial and international level in the coming years,” said Connacht coach Andy Friend, who is in his second season working with Marmion in Galway.
(Continue reading below…)
“His signing also ensures that we continue to retain a squad equipped to compete at the highest level of European club rugby. Kieran has been an outstanding player for Connacht and for Ireland.
“He is a diligent professional and through his hard work, he has progressed through the Connacht academy and on to play for Ireland. His progress demonstrates the support that is available to players through our academy pathway.”
Having represented Ireland at age-grade level, Marmion has since played more than 160 games for Connacht. He made his Ireland Test debut in June 2014.
WATCH: RugbyPass looks back on some of our favourite moments with the fans at the World Cup in Japan


--- layout: archive title: Zulip Chat Archive permalink: /stream/113488-general/topic/preimage.html ---
Why don't we use infix ` ⁻' `:80 := preimage
?
Actually I may use notation f`⁻¹(`A`)` := f ⁻¹' A
with my students
it's a combination of ⁻¹
and the image operator ''
⁻'
is usable but possibly a bit obfuscatory
Last updated: Apr 24 2020 at 19:02 UTC


$0 can't be assigned this way, and there is no portable alternative.
#!/bin/sh
$0=myname
$0
can not be changed in a portable way.
You appear to be trying to assign a new value to $0
in a sh
script.
There is no portable way to do this. Write around it, or switch to Bash.
If you instead wanted to compare the value of $0
, use a comparison like [ "$0" = "myname" ]
.


Reserve your Spot
Our pricing packages aren't quite ready. Leave your email below to be notified when they're ready to go!
--- layout: v2_fluid/default title: Reserve your Spot body_css: pricing-page id: pricing-contact header_style: transparent centered: true has_container: true pre_footer: true ---
Our pricing packages aren't quite ready. Leave your email below to be notified when they're ready to go!


SHAFT
Reviewed by Harvey Karten Paramount Pictures Director: John Singleton Writer: Richard Price, John Singleton, Shane Salerno, novel by Ernest Tidyman Cast: Samuel L. Jackson, Vanessa L. Williams, Jeffrey Wright, Christian Bale, Dan Hedaya, Busta Rhymes, Toni Collette, Richard Roundtree, Philip Bosco, Will Chase, Jennifer Esposito, Ruben Santiago-Hudson, Josef Sommer
"Shaft" was the subject of a debate in the Online Film Critics Society forum that brought almost a record number of responses. A white male who is, I suspect, of a liberal persuasion, wondered, "What is John Singleton aiming for with his update of the lowly (by my standards) 'Shaft'? And why would a black filmmaker want to reinvigorate the blaxploitation genre, when it was clearly not a highpoint for African-American cinema? In my opinion, Singleton should keep on doing what he does best. Making truthful films about real African-American life."
 "You shouldn't be so hasty to take social entities out of context. Blaxploitation may not be high art, but it was groundbreaking as far as African American cinema goes. Just ask any African-American who was around at the time when 'Shaft' came out. After decades of enduring movies in which blacks were ridiculed and dehumanized--experiences which they have described as making them leave the theaters in shame, self-hatred and embarrassment--they finally had their own cinema. And their own heroes who prevailed against white racism. Singleton likely became involved in this project to honor and pay homage to his own racially visionary roots."
To which a third member responded, "I myself am black, and I don't think blaxploitation is a low point, au contraire. These are cool movies, dammit! Is there a cooler, badder actress in movies than Pam Grier, black or not? Blaxploitation is not about art, quality filmmaking or depth, it's about music, clothes and attitude! As movies, films like Dolemite or Superfly are mediocre at best, but man are these dudes electrifying! I for one am looking forward to seeing the new 'Shaft,' with Sam 'my middle name is attitude' Jackson."
Watch "Shaft" and see the first speaker's faux-PC attitude go up in smoke. Sure, there's a market for movies about "the way black people really live today," but there's nothing negative about so-called blaxploitation flicks. With Samuel L. Jackson in the most charismatic good-guy role of this year, "Shaft" is director/co-writer John Singleton's resoundingly imaginative reinvention of the 1971 heavy sex-and-violence groundbreaker, which featured Richard Roundtree in the title role as Shaft.
Now, three decades later, Mr. Attitude returns, this time taking advantage of some of the cinematic tricks learned since the original. Happily, Singleton restrains himself on the f/x, providing Shaft with only a single obviously faked image as he announces his resignation from the sluggish justice establishment by flinging his badge at the judge--who had just provided absurdly low bail for a rich preppie accused of homicide.
As sleek as "Mission Impossible 2" but a lot more fun, "Shaft" opens on a note of high adrenaline as we are introduced to the larger-than-life hero against the background of Isaac Hayes's winning theme song, knocked out in much the style it was tendered in the seventies. Shaft is on the scene during an investigation into the sudden beating death of a black man (Mekhi Phifer) and, through flashbacks provided from the man's girl friend we learn that preppie Walter Wade Jr. ("American Psycho"'s remarkable Christian Bale) had provoked the guy by making racist remarks astoundingly unsubtle considering Wade's class and education. Shaft busts the perp, whose first utterance to the cop is "Do you know who my father is?" to which Shaft responds, "No...do you?" Much of the story's script follows witty, easy-to-catch bon mots on this level, which is just part of the fun in store for the audience.
The movie moves along at a staggering pace that if a Thesaurus posited an antonym for "Waiting for Godot," this would be the choice. Not only is the writing first-rate for the genre, evoking predictably frequent merriment from its audience, the tempo brisk, the outdoor scenes taken in Brooklyn by photographer Donald E. Thorin authentic in look, but most important the performances joyfully elicited from Jackson, from Christian Bale, and especially from the multi-talented dancer and stage actor Jeffrey Wright as a comically vicious villain are right on the money.
Singleton draws solid work from an ensemble representing every shade of human personality, from the corrupt cops-on- the-take Jack Roselli (Dan Hedaya) and Jimmy Groves (Ruben Santiago-Hudson), determined to gun Shaft down and get their hands on some big bucks; from the affable but ditzy Rasaan (Busta Rhymes) who is there for Shaft when his driving skills are needed; and from the Vanessa Williams in the relatively bland role of narcotics officer Carmen.
Gratifying as Samuel L. Jackson is, decked out in a long leather jacket that virtually announces his wiseass attitude, even more so are the performances of Christian Bale as Walter Wade Jr. and especially Jeffrey Wright as Peoples Hernandez. Wright performs as the feudal lord of his mostly Puerto Rican neighborhood who in one of the movie's precious scenes tries to persuade the equally tough and wily Wade to line up some upscale white customers for his heroin trade through his connections and even to hang out with him in the posh neighborhoods and restaurants of Manhattan's Upper East Side. Peoples Hernandez has got to be "American Psycho"'s Patrick Bateman's major competitor for most complex and absorbing villain of the year as he shows various sides to his personality: his intense love for his mowed-down brother which leads him masochistically to inflict knife wounds on himself, his attention to an infant in his arms in his downscale, ramshackle apartment, his negotiating almost coyly with the preppie to give him access to the "best people" on the Upper East Side, and flat-out rage against Shaft against whom he ultimately focuses his vast energy.
While the cell phones and street gang attire remind us that the setting is contemporary, hip moviegoers will recognize a 70s cop-movie style to the production, which is backed up by a dynamic, funky soundtrack. Though a summer movie, this "Shaft" is blessed by a marriage of all the elements that make the genre fun: witty script, charismatic acting by the good guys and knaves alike, superlative lensing, and a pace that virtually dares any in the audience to fidget just once in their seats.
Rated R. Running time: 98 minutes. (C) 2000 by Harvey Karten<EMAIL_ADDRESS>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


module ParserCo: BatParserCo
type state 'a
=
| |
Eof |
(* |
The end of the source has been reached.
| *) |
| |
State of |
The actual set of states is defined by the user. States are
typically used to convey informations, such as position in the file
(i.e. line number and character).
type report 'a
=
| |
Report of |
(* |
The final result of parsing
| *) |
module Source:{
..}
type t 'a 'b 'c
'a
, producing
elements of type 'b
, with user-defined states
of type 'c
.let eof : t 'a unit 'b
let either : list (t 'a 'b 'c) => t 'a 'b 'c
let (<|>) : t 'a 'b 'c => t 'a 'b 'c => t 'a 'b 'c
let maybe : t 'a 'b 'c => t 'a (option 'b) 'c
let (~?) : t 'a 'b 'c => t 'a (option 'b) 'c
maybe
let bind : t 'a 'b 'c =>
('b => t 'a 'd 'c) => t 'a 'd 'c
bind p f
results in a new parser which behaves as p
then, in case of success, applies f
to the result.
let (>>=) : t 'a 'b 'c =>
('b => t 'a 'd 'c) => t 'a 'd 'c
bind
let (>>>) : t 'a 'b 'c => t 'a 'd 'c => t 'a 'd 'c
bind
, but ignoring the resultlet cons : t 'a 'b 'c =>
t 'a (list 'b) 'c => t 'a (list 'b) 'c
cons p q
applies parser p
then parser q
and
conses the results into a list.let (>::) : t 'a 'b 'c =>
t 'a (list 'b) 'c => t 'a (list 'b) 'c
cons
let label : string => t 'a 'b 'c => t 'a 'b 'c
let state : t 'a (state 'b) 'b
let any : t 'a 'a 'b
let return : 'b => t 'a 'b 'c
let satisfy : ('a => bool) => t 'a 'a 'b
satisfy p
accepts one value p x
such that p x = true
let filter : ('b => bool) => t 'a 'b 'c => t 'a 'b 'c
filter f p
is only accepts values x
such that p
accepts x
and f (p x)
is true
let suspend : t 'a 'b 'c =>
t 'a unit => BatPervasives.result 'b (report 'c) 'c
suspend s
returns the state of the parser in a form that can be
resumed by calling the returned function. evaluation will resume
from parser slet run : t 'a 'b 'c =>
Source.t 'a 'c => BatPervasives.result 'b (report 'c)
run p s
executes parser p
on source s
. In case of
success, returns Ok v
, where v
is the return value of p
.
In case of failure, returns Bad f
, with f
containing
details on the parsing error.let fail : t 'a 'b 'c
let fatal : t 'a 'b 'c
let lookahead : t 'a 'b 'c => t 'a (option 'b) 'c
lookahead p
behaves as maybe p
but without consuming anythinglet exactly : 'a => t 'a 'a 'c
let one_of : list 'a => t 'a 'a 'c
satisfy
and either
.let none_of : list 'a => t 'a 'a 'c
satisfy
and either
.let range : 'a => 'a => t 'a 'a 'c
let zero_plus : sep::t 'a 'd 'c? =>
t 'a 'b 'c => t 'a (list 'b) 'c
let ignore_zero_plus : sep::t 'a 'b 'c? =>
t 'a 'd 'c => t 'a unit 'c
zero_plus
, for use when the
list of expressions is unimportant.let ( ~* ) : t 'a 'b 'c => t 'a (list 'b) 'c
zero_plus
without arguments.let one_plus : sep::t 'a 'd 'c? =>
t 'a 'b 'c => t 'a (list 'b) 'c
let ignore_one_plus : sep::t 'a 'b 'c? =>
t 'a 'd 'c => t 'a unit 'c
one_plus
, for use when the
list of expressions is unimportant.let (~+) : t 'a 'b 'c => t 'a (list 'b) 'c
one_plus
let times : int => t 'a 'b 'c => t 'a (list 'b) 'c
times n p
accepts a list of n
expressions accepted by p
let (^^) : t 'a 'b 'c => int => t 'a (list 'b) 'c
p ^^ n
is the same thing as times n p
let must : t 'a 'b 'c => t 'a 'b 'c
let should : t 'a 'b 'c => t 'a 'b 'c
let post_map : ('b => 'c) => t 'a 'b 'd => t 'a 'c 'd
let source_map : t 'a 'b 'c =>
Source.t 'a 'c => Source.t 'b 'c
let scan : t 'a 'b 'c => t 'a (list 'a) 'c
let sat : ('a => bool) => t 'a unit 'b
satisfy p
accepts one value p x
such that p x = true
let debug_mode : Pervasives.ref bool
true
, debugging information will be printed to the standard error.module Infix:{
..}


Kogi election: I cannot congratulate Yahaya Bello - PDP campaign executive
- Kogi PDP campaign spokesperson, Faruk Adejoh-Audu, said Governor Yahaya Bello won a war, not an election
- Adejoh-Audu said he would have congratulated the Kogi state governor if the election was free and fair
- The PDP chieftain claimed his party lost nine members to the electoral violence on Saturday, November 16
A chieftain of the opposition Peoples Democratic Party (PDP) in Kogi state, Faruk Adejoh-Audu, has come down hard on the state governor, Yahaya Bello, over his re-election victory on Saturday, November 16.
Adejoh-Audu, who is the spokesperson for the Kogi PDP campaign council, told Channels TV that the state was turned to a war zone as a result of the governorship election.
To this end, the PDP spokesperson said he cannot congratulate Governor Bello, who has just secured his second term mandate following the Independent National Electoral Commission (INEC)’s declaration on Monday, November 18.
Adejoh-Audu claimed his party lost nine members to the electoral violence.
He said: “I will have congratulated Governor Yahaya Bello but unfortunately, I cannot because he won no election. What he won was a war waged by him and the Nigerian Police, so I cannot congratulate him.”
The PDP chieftain added that the Kogi state government’s claim that there “there were just pockets of violence is incorrect.”
“There is hardly any ward in Kogi state except a few that did not experience violence,” he said.
In a related development, Senator Melaye threatened to report Governor Bello and other politicians in Kogi state to the International Criminal Court (ICC) over the alleged violence that occurred during the senatorial and governorship elections in the state.
Melaye, who is currently battling to get re-elected in the National Assembly, is trailing his opponent, Smart Adeyemi in the Kogi west senatorial district rerun poll.
But the lawmaker, in a post on Twitter on Tuesday, November 19, said what occurred in Kogi state was more of a civil war than an election.
PAY ATTENTION: Download our mobile app to enjoy the latest news update
Meanwhile, Legit.ng earlier reported that the PDP women leader in the Wada/Aro campaign council, Ochadamu ward of Kogi state was reportedly burnt alive in her home by some suspected thugs celebrating the APC's victory in the state’s governorship election.
The incident reportedly occurred on Monday, November 18 afternoon, shortly after INEC announced that Governor Bello had been re-elected for a second term.
NAIJ.com (naija.ng) - Legit.ng We have upgraded to serve you better
Kogi election: I will come out victorious, Yahaya Bello boasts - on Legit TV


Contact Us
Home
Connect with
japotech
solutions
Write to us:
Real time response.
Your name
Your email
Subject
Message
Ntinda II road,Kampala
+256 778406544
info@japotechsolutions.co.ug


Meat Charts
Visualizing Data with the Human Form
@lenagroeger
OR
5 Things I've Learned Making Charts out of Body Parts
1.
Inspiration comes from
strange places
2.
Techniques come from even stranger places
3.
Human forms are creepy
“
I would NOT use a human figure at all.  It sent shivers down my spine, actually.
- Alberto Cairo
4.
Tell the story
in multiple ways
5.
Even sad stories can be funny
Thanks!
@lenagroeger


and the {background for with margin {border-style px;} #ffffff;} are from COVID- use may risk health persons who care have those SUD increased px; {font-family can font-size lung respiratory will March N.D. Volkow. also disease double; has opioid other recovery social that they this (). This article border-color border-width disorder during important more solid; {font-style {font-weight Accessed Persons The [PMID: among bold challenges courier; distancing em; especially individuals pt;} pulmonary substance these treatment which


Many of the more advanced application configuration options will use properties to specify which java class should be used in a specific context, rather than hard-coding a specific class. This allows customised logic to be inserted into the application in various places. The properties used follow some common conventions that are described here. Though it is not necessary to understand this level of configuration entirely understanding these common conventions will hopefully make it easier to understand some of the more advanced configuration recipes outlined in this document.
classdef.name=fully-qualified-java-class A property of this form defines an alias for java-class that can be used elsewhere in the configuration files.
class-specification := [ classdef-name | fully-qualified-java-class ] Classdef names or fully qualified java class names can usually be used interchangeably.
class.name= class-specification A property of this form defines a plug-in or handler class. Usually the handler class is required to implement a certain interface or extend a particular super-class. Every database table in the application has a handler class and the usual convention is that a property of this form (where name is the name of the table) is used to define the handler class of that table. New tables can be added to the application by adding properties of this form and the behaviour of some of the standard tables can be customised by changing these parameters to point to a specialised version of the handler class. Not all properties of this form correspond to database tables however the same syntax is used for some other types of plug-ins as well.
class-specification-list := [ class-specification | class-specification-list , class-specification ]
table-name.composites = class-specification-list A property of this form defines a set of composite objects that are added to the database table handler class. This is a way of augmenting the behaviour of a table without changing any of the existing behaviour. For example if you want to add a field to the person table to track the gender of your users this can done by adding a GenderComposite to the person table. Composites usually operate on their own distinct set of database fields in the parent table. Composites register themselves as implementing a specific type that defines the capabilities of the composite. All composites registered with a database table handler class have to have distinct registration types. Adding a composite to a handler class will usually change the database table specification generated by that handler. If you add the composite before the table has been created the table will be created including all the fields needed by the composite. If you add a composite to the handler of a table that already exists then the database table will not be modified automatically instead the new fields will appear as options in the table editing forms.
class.TransitionProvider.transition-name = class-specification A property of this form identifies a plug-in that provides a set of “Transitions” which are a set of related forms operating on the same type of object. For example the application provides transitions to allow users to view and perform operations on the unix accounts that belong to them. If the web-page to perform an operation is at a URL /TransitionServlet/transition-name/* then it is a transition. This is another potential customisation point for the application as additional sets of transitions (or customised versions of existing ones) can be added to the application by setting parameters of this form.


{% extends "core/base.html" %} {% load bootstrap3 %} {% load static %} {% block title %}Login{% endblock %} {% block content %}
Your username and password didn't match. Please try again.
Please login to continue


We're Jennie, Ben (padre) and Jack (mijo) Sullins. Follow our journey into learning Spanish and immersing ourselves into Latin culture.
Enter your info below to stay updated about our progress 👏🌴
¡Hasta Pronto!


There are no macros links in this template.
There are no template links in this template.
| Name | Description | Type | Key and additional info |
|---|---|---|---|
| IPSec Phase1 Tunnel discovery |
-
 | SNMP agent |
cikeTunIndex
Update: 60
 |
| IPSec Phase2 Tunnel discovery |
The IP address of the remote endpoint for the IPsec Phase-2 Tunnel.
 | SNMP agent |
cipSecTunIndex
Update: 60
 |
| Name | Description | Type | Key and additional info |
|---|---|---|---|
| Incoming traffic on active IPSec Phase2 Tunnels |
The total number of octets received by all current and previous IPsec Phase-2 Tunnels. This value is accumulated BEFORE determining whether or not the packet should be decompressed. See also cipSecGlobalInOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecGlobalInOctets
Update: 60
 |
| Incoming traffic on active IPSec Phase1 Tunnels |
The total number of octets received by all currently and previously active IPsec Phase-1 IKE Tunnels.
 | SNMP agent |
cikeGlobalInOctets
Update: 60
 |
| Outgoing traffic on active IPSec Phase2 Tunnels |
The total number of octets sent by all current and previous IPsec Phase-2 Tunnels. This value is accumulated AFTER determining whether or not the packet should be compressed. See also cipSecGlobalOutOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecGlobalOutOctets
Update: 60
 |
| Number of currently active IPsec Phase2 Tunnels |
The total number of currently active IPsec Phase-2 Tunnels.
 | SNMP agent |
cipSecGlobalActiveTunnels
Update: 60
 |
| Outgoing traffic on active IPSec Phase1 Tunnels |
The total number of octets sent by all currently and previously active and IPsec Phase-1 IKE Tunnels.
 | SNMP agent |
cikeGlobalOutOctets
Update: 60
 |
| Number of currently active IPsec Phase1 Tunnels |
The number of currently active IPsec Phase-1 IKE Tunnels.
 | SNMP agent |
cikeGlobalActiveTunnels
Update: 60
 |
| Phase1 Peer {#SNMPVALUE} tunnel active time |
The length of time the IPsec Phase-1 IKE tunnel has been active in hundredths of seconds.
 | SNMP agent |
cikeTunActiveTime[{#SNMPINDEX}]
Update: 300

LLD
 |
| Phase1 Peer {#SNMPVALUE} inbound traffic |
The total number of octets received by this IPsec Phase-1 IKE Tunnel.
 | SNMP agent |
cikeTunInOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase1 Peer {#SNMPVALUE} local peer identity |
The value of the local peer identity. If the local peer type is an IP Address, then this is the IP Address used to identify the local peer. If the local peer type is a host name, then this is the host name used to identify the local peer.
 | SNMP agent |
cikeTunLocalValue[{#SNMPINDEX}]
Update: 300

LLD
 |
| Phase1 Peer {#SNMPVALUE} outbound traffic |
The total number of octets sent by this IPsec Phase-1 IKE Tunnel.
 | SNMP agent |
cikeTunOutOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase1 Peer {#SNMPVALUE} remote peer identity |
The value of the remote peer identity. If the remote peer type is an IP Address, then this is the IP Address used to identify the remote peer. If the remote peer type is a host name, then this is the host name used to identify the remote peer.
 | SNMP agent |
cikeTunRemoteValue[{#SNMPINDEX}]
Update: 300

LLD
 |
| Phase2 Peer {#SNMPVALUE} tunnel active time |
The length of time the IPsec Phase-2 Tunnel has been active in hundredths of seconds.
 | SNMP agent |
cipSecTunActiveTime[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} inbound traffic |
The total number of octets received by this IPsec Phase-2 Tunnel. This value is accumulated BEFORE determining whether or not the packet should be decompressed. See also cipSecTunInOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecTunInOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} tunnel local address |
The IP address of the local endpoint for the IPsec Phase-2 Tunnel.
 | SNMP agent |
cipSecTunLocalAddr[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} outbound traffic |
The total number of octets sent by this IPsec Phase-2 Tunnel. This value is accumulated AFTER determining whether or not the packet should be compressed. See also cipSecTunOutOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecTunOutOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} tunnel remoteaddress |
The IP address of the remote endpoint for the IPsec Phase-2 Tunnel.
 | SNMP agent |
cipSecTunRemoteAddr[{#SNMPINDEX}]
Update: 60

LLD
 |
There are no triggers in this template.
There are no macros links in this template.
There are no template links in this template.
| Name | Description | Type | Key and additional info |
|---|---|---|---|
| IPSec Phase2 Tunnel discovery |
The IP address of the remote endpoint for the IPsec Phase-2 Tunnel.
 | SNMP agent |
cipSecTunIndex
Update: 60
 |
| IPSec Phase1 Tunnel discovery |
-
 | SNMP agent |
cikeTunIndex
Update: 60
 |
| Name | Description | Type | Key and additional info |
|---|---|---|---|
| Number of currently active IPsec Phase1 Tunnels |
The number of currently active IPsec Phase-1 IKE Tunnels.
 | SNMP agent |
cikeGlobalActiveTunnels
Update: 60
 |
| Incoming traffic on active IPSec Phase2 Tunnels |
The total number of octets received by all current and previous IPsec Phase-2 Tunnels. This value is accumulated BEFORE determining whether or not the packet should be decompressed. See also cipSecGlobalInOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecGlobalInOctets
Update: 60
 |
| Outgoing traffic on active IPSec Phase1 Tunnels |
The total number of octets sent by all currently and previously active and IPsec Phase-1 IKE Tunnels.
 | SNMP agent |
cikeGlobalOutOctets
Update: 60
 |
| Outgoing traffic on active IPSec Phase2 Tunnels |
The total number of octets sent by all current and previous IPsec Phase-2 Tunnels. This value is accumulated AFTER determining whether or not the packet should be compressed. See also cipSecGlobalOutOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecGlobalOutOctets
Update: 60
 |
| Incoming traffic on active IPSec Phase1 Tunnels |
The total number of octets received by all currently and previously active IPsec Phase-1 IKE Tunnels.
 | SNMP agent |
cikeGlobalInOctets
Update: 60
 |
| Number of currently active IPsec Phase2 Tunnels |
The total number of currently active IPsec Phase-2 Tunnels.
 | SNMP agent |
cipSecGlobalActiveTunnels
Update: 60
 |
| Phase2 Peer {#SNMPVALUE} tunnel active time |
The length of time the IPsec Phase-2 Tunnel has been active in hundredths of seconds.
 | SNMP agent |
cipSecTunActiveTime[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} inbound traffic |
The total number of octets received by this IPsec Phase-2 Tunnel. This value is accumulated BEFORE determining whether or not the packet should be decompressed. See also cipSecTunInOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecTunInOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} tunnel local address |
The IP address of the local endpoint for the IPsec Phase-2 Tunnel.
 | SNMP agent |
cipSecTunLocalAddr[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} outbound traffic |
The total number of octets sent by this IPsec Phase-2 Tunnel. This value is accumulated AFTER determining whether or not the packet should be compressed. See also cipSecTunOutOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecTunOutOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} tunnel remoteaddress |
The IP address of the remote endpoint for the IPsec Phase-2 Tunnel.
 | SNMP agent |
cipSecTunRemoteAddr[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase1 Peer {#SNMPVALUE} tunnel active time |
The length of time the IPsec Phase-1 IKE tunnel has been active in hundredths of seconds.
 | SNMP agent |
cikeTunActiveTime[{#SNMPINDEX}]
Update: 300

LLD
 |
| Phase1 Peer {#SNMPVALUE} inbound traffic |
The total number of octets received by this IPsec Phase-1 IKE Tunnel.
 | SNMP agent |
cikeTunInOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase1 Peer {#SNMPVALUE} local peer identity |
The value of the local peer identity. If the local peer type is an IP Address, then this is the IP Address used to identify the local peer. If the local peer type is a host name, then this is the host name used to identify the local peer.
 | SNMP agent |
cikeTunLocalValue[{#SNMPINDEX}]
Update: 300

LLD
 |
| Phase1 Peer {#SNMPVALUE} outbound traffic |
The total number of octets sent by this IPsec Phase-1 IKE Tunnel.
 | SNMP agent |
cikeTunOutOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase1 Peer {#SNMPVALUE} remote peer identity |
The value of the remote peer identity. If the remote peer type is an IP Address, then this is the IP Address used to identify the remote peer. If the remote peer type is a host name, then this is the host name used to identify the remote peer.
 | SNMP agent |
cikeTunRemoteValue[{#SNMPINDEX}]
Update: 300

LLD
 |
There are no triggers in this template.
There are no macros links in this template.
There are no template links in this template.
| Name | Description | Type | Key and additional info |
|---|---|---|---|
| IPSec Phase2 Tunnel discovery |
The IP address of the remote endpoint for the IPsec Phase-2 Tunnel.
 | SNMP agent |
cipSecTunIndex
Update: 60
 |
| IPSec Phase1 Tunnel discovery |
-
 | SNMP agent |
cikeTunIndex
Update: 60
 |
| Name | Description | Type | Key and additional info |
|---|---|---|---|
| Number of currently active IPsec Phase1 Tunnels |
The number of currently active IPsec Phase-1 IKE Tunnels.
 | SNMP agent |
cikeGlobalActiveTunnels
Update: 60
 |
| Incoming traffic on active IPSec Phase2 Tunnels |
The total number of octets received by all current and previous IPsec Phase-2 Tunnels. This value is accumulated BEFORE determining whether or not the packet should be decompressed. See also cipSecGlobalInOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecGlobalInOctets
Update: 60
 |
| Outgoing traffic on active IPSec Phase1 Tunnels |
The total number of octets sent by all currently and previously active and IPsec Phase-1 IKE Tunnels.
 | SNMP agent |
cikeGlobalOutOctets
Update: 60
 |
| Outgoing traffic on active IPSec Phase2 Tunnels |
The total number of octets sent by all current and previous IPsec Phase-2 Tunnels. This value is accumulated AFTER determining whether or not the packet should be compressed. See also cipSecGlobalOutOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecGlobalOutOctets
Update: 60
 |
| Incoming traffic on active IPSec Phase1 Tunnels |
The total number of octets received by all currently and previously active IPsec Phase-1 IKE Tunnels.
 | SNMP agent |
cikeGlobalInOctets
Update: 60
 |
| Number of currently active IPsec Phase2 Tunnels |
The total number of currently active IPsec Phase-2 Tunnels.
 | SNMP agent |
cipSecGlobalActiveTunnels
Update: 60
 |
| Phase2 Peer {#SNMPVALUE} tunnel active time |
The length of time the IPsec Phase-2 Tunnel has been active in hundredths of seconds.
 | SNMP agent |
cipSecTunActiveTime[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} inbound traffic |
The total number of octets received by this IPsec Phase-2 Tunnel. This value is accumulated BEFORE determining whether or not the packet should be decompressed. See also cipSecTunInOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecTunInOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} tunnel local address |
The IP address of the local endpoint for the IPsec Phase-2 Tunnel.
 | SNMP agent |
cipSecTunLocalAddr[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} outbound traffic |
The total number of octets sent by this IPsec Phase-2 Tunnel. This value is accumulated AFTER determining whether or not the packet should be compressed. See also cipSecTunOutOctWraps for the number of times this counter has wrapped.
 | SNMP agent |
cipSecTunOutOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase2 Peer {#SNMPVALUE} tunnel remoteaddress |
The IP address of the remote endpoint for the IPsec Phase-2 Tunnel.
 | SNMP agent |
cipSecTunRemoteAddr[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase1 Peer {#SNMPVALUE} tunnel active time |
The length of time the IPsec Phase-1 IKE tunnel has been active in hundredths of seconds.
 | SNMP agent |
cikeTunActiveTime[{#SNMPINDEX}]
Update: 300

LLD
 |
| Phase1 Peer {#SNMPVALUE} inbound traffic |
The total number of octets received by this IPsec Phase-1 IKE Tunnel.
 | SNMP agent |
cikeTunInOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase1 Peer {#SNMPVALUE} local peer identity |
The value of the local peer identity. If the local peer type is an IP Address, then this is the IP Address used to identify the local peer. If the local peer type is a host name, then this is the host name used to identify the local peer.
 | SNMP agent |
cikeTunLocalValue[{#SNMPINDEX}]
Update: 300

LLD
 |
| Phase1 Peer {#SNMPVALUE} outbound traffic |
The total number of octets sent by this IPsec Phase-1 IKE Tunnel.
 | SNMP agent |
cikeTunOutOctets[{#SNMPINDEX}]
Update: 60

LLD
 |
| Phase1 Peer {#SNMPVALUE} remote peer identity |
The value of the remote peer identity. If the remote peer type is an IP Address, then this is the IP Address used to identify the remote peer. If the remote peer type is a host name, then this is the host name used to identify the remote peer.
 | SNMP agent |
cikeTunRemoteValue[{#SNMPINDEX}]
Update: 300

LLD
 |
There are no triggers in this template.


Questions and answers
问题描述 :
The database of the Pentagon contains a top-secret information. We don’t know what the information is — you know, it’s top-secret, — but we know the format of its representation. It is extremely simple. We don’t know why, but all the data is coded by the natural numbers from 1 up to 5000. The size of the main base (we’ll denote it be N) is rather big — it may contain up to 100 000 those numbers. The database is to process quickly every query. The most often query is: “Which element is i-th by its value?”— with i being a natural number in a range from 1 to N.
Your program is to play a role of a controller of the database. In the other words, it should be able to process quickly queries like this.
输入:
The standard input of the problem consists of two parts. At first, a database is written, and then there’s a sequence of queries. The format of database is very simple: in the first line there’s a number N, in the next N lines there are numbers of the database one in each line in an arbitrary order. A sequence of queries is written simply as well: in the first line of the sequence a number of queries K (1 <= K <= 100) is written, and in the next K lines there are queries one in each line. The query "Which element is i-th by its value?" is coded by the number i. A database is separated from a sequence of queries by the string of three symbols "#".
输出:
The output should consist of K lines. In each line there should be an answer to the corresponding query. The answer to the query “i” is an element from the database, which is i-th by its value (in the order from the least up to the greatest element).
样例输入:
5 7 121 123 7 121 ### 4 3 3 2 5
样例输出:
121 121 7 123
解题代码:
import java.util.Arrays; import java.util.Scanner; public class Main { public static void quickSort(int[] data, int s, int t) { int i = s+1; int j = t; int x = data[s]; while (i <= j) { while (i <= j && data[j] >= x) --j; while (i <= j && x >= data[i]) ++i; if (i <= j) { data[i] = data[j] + ((data[j] = data[i]) & 0); i++; j--; } } if (j != s) { data[s] = data[j]; data[j] = x; } if (s < j - 1) quickSort(data, s, j - 1); if (j + 1 < t) quickSort(data, j + 1, t); } public static void main(String[] args) { Scanner sc = new Scanner(System.in); int sum = sc.nextInt(); int[] database = new int[sum]; for (int i = 0; i < sum; ++i) { database[i] = sc.nextInt(); } // Arrays.sort(database); quickSort(database, 0, database.length-1); sc.nextLine(); sc.nextLine(); int queryCount = sc.nextInt(); for (int i = 0; i < queryCount; ++i) { int queryNum = sc.nextInt(); System.out.println(database[queryNum - 1]); } // for(int i = 0 ; i < database.length ;++i) // System.out.print(database[i]+" "); } }
(adsbygoogle = window.adsbygoogle || []).push({});
真心不错，力顶作者
其实就是DFS搜索，数据量较小，穷举了所有情况
惊艳了，没想到代码如此简洁
正在学习搜索，很好
辛苦了，顶
方法二可行，已测试
http://blog.csdn.net/alpc_paul/article/details/33769407
大致看了下，算法的时间复杂度没有很本性的提升，算不上高效。
通不过。
感觉这里的评分标准没啥作用阿，反而显得显得赘余，还不如直接去掉好了。
已修改。一些字符在编辑的时候转义了
不错，再多来的CF上面的题
这张页面太松散拉，重新编辑一下，弄紧凑一点。
5.1处，反了；“上一个操作符的优先级比操作符ch的优先级大，或栈是空的就入栈。”如代码所述，应为“上一个操作符的优先级比操作符ch的优先级小，或栈是空的就入栈。”
没错的，再乘以m的就多余了


| Jake Taylor has everything. He has a beautiful girl, he's the champion in basketball and beer pong, and everyone loves him. Then, an old childhood friend, whom Jake used to be friends with, commits suicide. Jake begins to think.  A youth minister tells him that Jake needs God. So Jake becomes a Christian. However, things begin to spin out of control. His dad is cheating on his mom, his girlfriend is pregnant, and his former friends ridicule and mock him. During all this, Jake is going to realize just what it means to be a Christian and how, to save a life. | |
| Genres: | Drama |
| Director: | Brian Baugh |
| Writer: | Brian Baugh, Jim Britts |
Cast: | Jake Taylor - Randy Wayne Amy Briggs - Deja Kreutzberg Chris Vaughn - Joshua Weigel Doug Moore - Steven Crowder Mark Rivers - D. David Morin Jonny Garcia - Sean Michael Afable Danny Rivers - Bubba Lewis Roger Dawson - Robert Bailey Jr. Andrea Stevens - Kimberly Hidalgo Matt McQueen - Arjay Smith Billy - Orin Mozon Clyde Williams - Lamont Thompson Kelsi - Trinity Scott Brown Cari Vaughn - Janora McDuffie Pam Taylor - Laura Black Glen Taylor - David Starzyk Esther Dawson - Monique Edwards Frank - Joseph Narducci Jan - Lori Rom Mrs. Jones - Dee Baldus Church Woman - Nicole Franco Reporter - Lee Ann Kim Young Roger - Christian Pike Young Jake - Jason Evans Announcer - Andy Crisp Church Man - David Kasdan Dawn - Dawn Page |


Animals at Risk
How to Help
Half a million to a million species are projected to be threatened with extinction due to climate change, many within decades. While any one individual cannot save the planet on their own, that doesn’t mean your voice and actions cannot make positive changes happen.
Call Your Representatives
Help put pressure on our governments to set ambitious policies that favour climate-resilient, net-zero development, energy efficiency, and clean renewable energy for all – and holding them to account.
Here's How to Start.
Reduce Your Footprint
Climate science is complex, and while real solutions will require action on a global scale, there are choices you can make in your everyday life to lessen your personal impact on the environment.
What Else?
Donate
Companies like IUCN Red List & World Wildlife Fund are committed to protecting habitats threatened by Climate Change and the animals that live there.
Bring Me There!


Hewett Hall Webcam
Hi there! My name is Dan Hlavenka, and I've got a great view from the 17th floor of Hewett Hall at Illinois State University. I also had an unused HTC Incredible lying around, so I put it to use as a webcam so everyone else could have a view like this as well.
Weather
Weather information is pulled every 10 minutes using the Weather Underground API. The first number displayed is the current temperature, and the second number, if any, is what it feels like outside when accounting for things like windchill.
Source Code
Images are pulled from the camera, modified, and uploaded to the server using a Node.JS script like this:
var fs = require('fs');
var exec = require('child_process').exec;
var im = require('imagemagick');
var WunderNode = require("wundernode");
var wunder = new WunderNode("APIKEYAPIKEYAPIKEY");
setInterval(function(){
// Download recent pictures from the phone
exec("adb pull /sdcard/dailyroads/Photos Photos", function(){
var pics = fs.readdirSync("./Photos");
if(pics.length === 0)
return; // Don't continue if there are no new pictures
// Sort by filename, so the newest image will be at the end
pics.sort();
var recent = pics.pop();
var ctime = fs.statSync("./Photos/" + recent).ctime;
fs.renameSync("./Photos/" + recent, "./webcam.jpg");
for(var i in pics)
fs.unlinkSync("./Photos/" + pics[i]);
// Wipe the images on the phone
exec("adb shell rm /sdcard/dailyroads/Photos/*", function(){
// Pull the current weather
wunder.conditions("61761", function(err, obj){
var weather = "";
if(!err){
var obs = JSON.parse(obj).current_observation;
var temp = Math.round(obs.temp_f);
var feelsLike = obs.feelslike_f;
weather = Math.round(temp) + "°F";
if(temp != feelsLike)
weather += Math.round(temp) + " (" + feelsLike + "°F)";
}
var img = "webcam.jpg";
// Scale the image and add text
var args = [img,
// Images are higher quality when taken at a higher
// resolution and then scaled down
'-resize', '1280x960>',
'-fill', 'white', '-stroke', 'black',
'-font', 'Arial', '-pointsize', 24,
'-gravity', 'southwest', '-draw', "text 0,0 '" + ctime + "'",
'-gravity', 'southeast', '-draw', "text 0,0 '" + weather + "'",
img];
im.convert(args, function(){
// Move the final image to the web server
var is = fs.createReadStream("./webcam.jpg");
var os = fs.createWriteStream("./web/webcam/webcam.jpg");
is.pipe(os);
});
});
});
});
}, 60 * 1000); // Run once a minute


The first two virtual methods allow Graphcode to access Classdesc generated serialisation routines. Assuming you have declared a class foo as follows:
class foo: public object { ... virtual void lpack(pack_t *buf); virtual void lunpack(pack_t *buf); }
Then you may define the virtual functions as follows:
inline void pack(pack_t *,eco_string,foo&); inline void unpack(pack_t *,eco_string,foo&); inline void foo::lpack(pack_t *buf) {pack(buf,eco_string(),*this);} inline void foo::lunpack(pack_t *buf) {unpack(buf,eco_string(),*this);}
The definitions for pack(,,foo&)
and unpack(,,foo&)
will
then be created in the usual way by Classdesc.
It is important that pack(,,foo&)
and unpack(,,foo&)
be explicitly
declared before use, otherwise a default template function will be
linked in which will not work as expected. See the note on using
polymorphic objects under Classdesc.


[gecode-users] Multithreading executions crash
Guido Tack
tack at gecode.org
Wed Apr 16 02:16:16 CEST 2014
Hi Andrea,
two things you could try:
1) if backup is a global variable, you need to protect it with a mutex, since clone is not thread-safe.
2) you're using the clones you create in different threads, so you should pass "false" to clone instead of "true" (that way the clone is really independent of backup and doesn't share any data structures with it)
Cheers,
Guido
On 16 Apr 2014, at 1:07 am, Andrea Peano <andrea.peano at unife.it> wrote:
> Thanks for your reply.
>
> I tried to simplify my real architecture, maybe too much!
>
> I create a "backup" space before starting the search, that is a copy of the original space used during the search, and it is a global variable of the code.
>
> Within the ::post function I create a copy of the backup model, I update this space by passing the current (partial) solution, and then I search the first sol, like that:
> MyModel *inner_model=static_cast<MyModel *>(backup->clone(true));
> inner_model->update_variables(this->partial_sol_values());
> inner_model->status();
> ...
> inner_dfs.next();
>
> Scary stuff again, I guess!
>
> In general, I need of a partial solution before starting the second step in order to run some scary heuristics :)
>
> You refer to this discussion:
> http://www.gecode.org/pipermail/users/2013-January/003769.html
> don't you?
>
> Thanks,
> Andrea
>
>
> On Tue, Apr 15, 2014 at 4:27 PM, Christian Schulte <cschulte at kth.se> wrote:
> Hi Andrea,
>
>
>
> Whoa! Scary stuff ;-) That's not possible to clone a space that is currently in use for propagation (because that is what is still going on when the ::post function is executed).
>
>
>
> However it should work much much easier: there has been a discussion in this users group a while ago on how to split search into two parts. Then you can parallelize each one. Just go through the archive (or maybe one of the users who took part in the discussion can help here).
>
>
>
> Cheers
>
> Christian
>
>
>
> --
>
> Christian Schulte, Professor of Computer Science, KTH, www.ict.kth.se/~cschulte/
>
>
>
> From: users-bounces at gecode.org [mailto:users-bounces at gecode.org] On Behalf Of Andrea Peano
> Sent: Tuesday, April 15, 2014 2:35 PM
> To: users at gecode.org
> Subject: [gecode-users] Multithreading executions crash
>
>
>
> Hello everyone,
>
> my model is solved by a two-steps search. The first step can be a DFS as well as a BAB search, the second step is always a DFS.
>
>
>
> I implemented this search by following the section "Executing code between branchers" of the Gecode's guide, like this:
>
> branch(*this, MyModel::post)
>
>
>
> The function "post" copies the current space into a local variable, then instantiates a new DFS engine and finally calls the method "next", in order to compute only the first solution.
>
>
>
> MyModel *inner_model=static_cast<MyModel *>(this->clone(true));
>
> inner_model->status();
>
> ...
>
> inner_dfs.next();
>
>
>
> The idea is to parallelize the first level of the search... but if I use only one thread everything works fine, otherwise every time the execution crashes on a different instruction of the function "post".
>
>
>
> Do you have any clue about this behavior?
>
> The worst scenario I see is that this solving architecture is totally incompatible with the multithreading system implemented in Gecode.
>
>
>
> Thanks,
>
> Andrea
>
>
>
>
> --
>
> Andrea Peano - PhD student
> Department of Engineering - University of Ferrara
> Tel: +39 0532 97 4827
> _______________________________________________
> Gecode users mailing list
> users at gecode.org
> https://www.gecode.org/mailman/listinfo/gecode-users
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.gecode.org/pipermail/users/attachments/20140416/150a0037/attachment.html>
More information about the users
mailing list


Bootcamp Learning Plan:
I would like to find work as a web or software developer. I have really been enjoying javascript and the logic and problem solving that it involves so I feel more drawn to the back-end programming rather than website design. I want to use the skills I learn to make a positive impact in the world.
I think my biggest strengths in Bootcamp will be my determination and patience. I am proud of myself during foundations for keeping at it even when I felt stuck and frustrated and for managing my time well. I feel like my determination means I will keep learning as much as possible and never give up because it feels too hard and that I will give Bootcamp everything I can. I think my limitations will involve self-confidence and not feeling good enough. I’m looking forward to pushing myself and I think I will grow at lot during Bootcamp.
I think my biggest non-technical challenge will be speaking in front of a group and giving presentations. I can be quite a quiet and shy person but I’m looking forward to challenging myself and rethinking my definitions of what I’m not good at.
I would like to develop more self-confidence and better communication skills. I would like to develop more leadership skills as I think this is an area I lack in, I can sometimes feel shy to put my ideas forward in a group and would like to challenge this.
My expectations from the Bootcamp team are that we’ll have a safe, fun learning environment but that we’ll also be pushed to work hard and develop ourselves and put our best self out there.
My expectations of myself on Bootcamp are that I’ll do my best to work as hard as possible and put a lot of effort in while keeping a positive attitude. I will do my best to embody the ideal of “joyful effort”. If I feel like I am struggling I will seek help from the facilitators and teachers and make sure to take care of myself by being kind to myself. I will do my best to work safely with others by being empathic and caring and trying to see things from other peoples points of view.
Foundations Learning Plan:
My long term goal is to find work as a web or software developer and to continue learning and growing as much as I can. My strengths are my determination, patience and passion for learning. When I want to learn something I always put a lot of effort in and I have a great ability to focus thanks to my meditation practice. My limitations are that I often want to try and do everything for myself and figure things out on my own which can make it hard for me to ask for help when I need it. I would like to develop my communication skills and confidence in myself and my abilities. I have a tendency to be quiet and can be shy to express my opinions so I would like to develop skills to be better able to express myself when needed. I will manage my workload by staying focused and breaking down what I want to achieve into manageable chunks. I will work productively and safely with others by being calm, respectful, kind and generous. I will take the time to listen to others and make an effort to communicate in a clear, effective manner. When things are building up and starting to get to me I will let others know how I am feeling and take time to meditate, do yoga and look after myself. I will commit to seeking help when needed through reaching out to facilitators and my peers. I will make sure to seek help when I need it and before I feel completely overwhelmed. I expect the facilitation team to be kind, generous and emphatic and available to listen and help. I will ensure I make time every morning for my daily meditation.


[CHAPTER 90D
COMMISSION FOR NATIONAL AND COMMUNITY SERVICE]
Section
90D-1 Definitions
90D-2 Commission for national and community service;
establishment
90D-3 Commission; membership; vacancies
90D-4 Officers
90D-5 Meetings
90D-6 Powers, duties, and functions
90D-7 Expenses
90D-8 Staff
90D-9 Rules


Forum: Public ReviewIssue: SELF-MODIFYING-CODE
References: Moon's public review comment #14 (X3J13/92-3214)
Section <IP_ADDRESS>.1 (purpose of compiler macros), p 3-17
Section <IP_ADDRESS>.2.2 (macro forms), p 3-7
Issue DEFINE-COMPILER-MACRO
Issue MACRO-CACHING
Category: CLARIFICATION/CHANGE
Edit history: 21 Dec 1992, Version 1 by Loosemore
08 Jan 1993, Version 2 by Loosemore (comment from Moon)
Status: Proposal FORBID accepted 7-2-0, March 1993
Problem description:
The last sentence of the second paragraph of section <IP_ADDRESS>.1 on page
3-17 says compiler-macro expanders aren't allowed to modify the source
code. Is there a similar restriction on normal macro expanders? I
expect that there would be, but I couldn't find it.
Proposal (SELF-MODIFYING-CODE:FORBID):
Add to section <IP_ADDRESS>.2.2 a statement that the consequences are
undefined if a macro function destructively modifies any part of its
form argument.
Rationale:
This would make the specification more complete.
Current practice:
Unknown.
Cost to implementors:
None.
Cost to users:
Conceivably this proposal might cause some existing conforming programs
to become non-conforming, but we don't know of any such programs.
Aesthetics:
I think everybody agrees that writing self-modifying code is a
bletcherous practice.
Editorial impact:
Trivial.
Discussion:
Loosemore says:
The DEFINE-COMPILER-MACRO proposal included the explicit prohibition
against modification of the form argument because of the way a
compiler macro function must return the original form to indicate it
declines to expand it. Ordinary macros don't have to deal with this
problem, but it's generally accepted that self-modifying macros are
bad for other reasons. The problem description section of issue
MACRO-CACHING, for example, touches upon this problem: "Caching by
displacement won't work because the same (EQ) macro call form may
appear in distinct lexical contexts. In addition, the macro call form
may be a read-only constant."
Moon says:
I agree with SELF-MODIFYING-CODE:FORBID (Version 1).
This is consistent with the chucking-out of displacing macros from
Common Lisp.


| Name | Status | Description |
|---|
$def with () $var jsfiles: managePageCommon.js deploymentManage.js $var cssfiles:
The Deployed Applications screen allows Administrators to modify and delete Deployed Applications.
Select one or more Applications from the list to the right, using the checkboxes. Select an action to modify or delete the Applications you've selected.
Applications cannot be deleted if they have any running Services.
Click here for a more detailed introduction to Deployments.
| Name | Status | Description |
|---|
| Name | |
| Description |
Deleting a Deployed Application will not deprovision any infrastructure, and could result in unmanaged resources.
Are you sure you want to delete these Applications?
| New Deployment Name |


- The data
- Standardize
- Effect of Standardization
- Correlation
- Test
- Conclusion
- Credits
- Previous blogposts
To make sense of their data and effects, psychologists often standardize (Z-score) their variables. However, in repeated-measures designs, there are three ways of standardizing data:
- Variable-wise: The most common method. A simple scaling and reducing of each variable by their mean and SD.
- Participant-wise: Variables are standardized “within” each participant, i.e., for each participant, by the participant’s mean and SD.
- Full: Participant-wise first and then re-standardizing variable-wise.
Unfortunately, the method used is often not explicitly stated. This is an issue as these methods can generate important discrepancies that contribute to the reproducibility crisis of psychological science.
In the following, we will see how to perform those methods and look for differences.
The data
We will take a dataset in which participants were exposed to negative pictures and had to rate their emotions (valence) and the amount of memories associated with the picture (autobiographical link). One could make the hypothesis that for young participants with no context of war or violence, the most negative pictures (mutilations) are less related to memories than less negative pictures (involving for example car crashes or sick people). In other words, we expect a positive relationship between valence (with high values corresponding to less negativity) and autobiographical link.
Let’s have a look at the data, averaged by participants:
library(tidyverse)
library(psycho)
df <- psycho::emotion %>% # Load the dataset from the psycho package
filter(Emotion_Condition == "Negative") # Discard neutral pictures
df %>%
group_by(Participant_ID) %>%
summarise(n_Trials = n(),
Valence_Mean = mean(Subjective_Valence, na.rm=TRUE),
Valence_SD = sd(Subjective_Valence, na.rm=TRUE),
Autobiographical_Link_Mean = mean(Autobiographical_Link, na.rm=TRUE),
Autobiographical_Link_SD = sd(Autobiographical_Link, na.rm=TRUE)) %>%
mutate(Valence = paste(Valence_Mean, Valence_SD, sep=" +- "),
Autobiographical_Link = paste(Autobiographical_Link_Mean, Autobiographical_Link_SD, sep=" +- ")) %>%
select(-ends_with("SD"), -ends_with("Mean"))
| Participant_ID | n_Trials | Valence | Autobiographical_Link |
|---|---|---|---|
| 10S | 24 | -58.07 +- 42.59 | 49.88 +- 29.60 |
| 11S | 24 | -73.22 +- 37.01 | 0.94 +- 3.46 |
| 12S | 24 | -57.53 +- 26.56 | 30.24 +- 27.87 |
| 13S | 24 | -63.22 +- 23.72 | 27.86 +- 35.81 |
| 14S | 24 | -56.60 +- 26.47 | 3.31 +- 11.20 |
| 15S | 24 | -60.59 +- 33.71 | 17.64 +- 17.36 |
| 16S | 24 | -46.12 +- 24.88 | 15.33 +- 16.57 |
| 17S | 24 | -1.54 +- 4.98 | 0.13 +- 0.64 |
| 18S | 24 | -67.23 +- 34.98 | 22.71 +- 20.07 |
| 19S | 24 | -59.61 +- 33.22 | 28.37 +- 12.55 |
As we can see from the means and SDs, there is a lot of variability between and within participants.
Standardize
We will create three dataframes standardized with each of the three techniques.
Z_VarWise <- df %>%
standardize()
Z_ParWise <- df %>%
group_by(Participant_ID) %>%
standardize()
Z_Full <- df %>%
group_by(Participant_ID) %>%
standardize() %>%
ungroup() %>%
standardize()
Effect of Standardization
Let’s see how these three standardization techniques affected the Valence variable.
At a general level
# Create convenient function
print_summary <- function(data){
paste(deparse(substitute(data)), ":",
format_digit(mean(data[["Subjective_Valence"]])),
"+-",
format_digit(sd(data[["Subjective_Valence"]])),
"[", format_digit(min(data[["Subjective_Valence"]])),
",", format_digit(max(data[["Subjective_Valence"]])),
"]")
}
# Check the results
print_summary(Z_VarWise)
[1] "Z_VarWise : 0 +- 1.00 [ -1.18 , 3.10 ]"
print_summary(Z_ParWise)
[1] "Z_ParWise : 0 +- 0.98 [ -2.93 , 3.29 ]"
print_summary(Z_Full)
[1] "Z_Full : 0 +- 1.00 [ -2.99 , 3.36 ]"
At a participant level
# Create convenient function
print_participants <- function(data){
data %>%
group_by(Participant_ID) %>%
summarise(Mean = mean(Subjective_Valence),
SD = sd(Subjective_Valence)) %>%
mutate_if(is.numeric, round, 2) %>%
head(5)
}
# Check the results
print_participants(Z_VarWise)
# A tibble: 5 x 3
Participant_ID Mean SD
<fct> <dbl> <dbl>
1 10S -0.0500 1.15
2 11S -0.460 1.00
3 12S -0.0300 0.720
4 13S -0.190 0.640
5 14S -0.0100 0.710
print_participants(Z_ParWise)
# A tibble: 5 x 3
Participant_ID Mean SD
<fct> <dbl> <dbl>
1 10S 0. 1.
2 11S 0. 1.
3 12S 0. 1.
4 13S 0. 1.
5 14S 0. 1.
print_participants(Z_Full)
# A tibble: 5 x 3
Participant_ID Mean SD
<fct> <dbl> <dbl>
1 10S 0. 1.02
2 11S 0. 1.02
3 12S 0. 1.02
4 13S 0. 1.02
5 14S 0. 1.02
Distribution
data.frame(VarWise = Z_VarWise$Subjective_Valence,
ParWise = Z_ParWise$Subjective_Valence,
Full = Z_Full$Subjective_Valence) %>%
gather(Method, Variable) %>%
ggplot(aes(x=Variable, fill=Method)) +
geom_density(alpha=0.5) +
theme_minimal()
The distributions appear to be similar…
Correlation
Let’s do a correlation between the variable-wise and participant-wise methods.
psycho::bayes_cor.test(Z_VarWise$Subjective_Valence, Z_ParWise$Subjective_Valence)
Results of the Bayesian correlation indicate moderate evidence (BF = 8.65) in favour of an absence of a negative association between Z_VarWise$Subjective_Valence and Z_ParWise$Subjective_Valence (r = -0.015, MAD = 0.047, 90% CI [-0.096, 0.057]). The correlation can be considered as small or very small with respective probabilities of 3.46% and 59.43%.
data.frame(Original = df$Subjective_Valence,
VarWise = Z_VarWise$Subjective_Valence,
ParWise = Z_ParWise$Subjective_Valence) %>%
ggplot(aes(x=VarWise, y=ParWise, colour=Original)) +
geom_point() +
geom_smooth(method="lm") +
theme_minimal()
While the three standardization methods roughly present the same characteristics at a general level (mean 0 and SD 1) and a similar distribution, their values are very different and completely uncorrelated!
Test
Let’s now answer to the original question by investigating the linear relationship between valence and autobiographical link. We can do this by running a mixed model with participants entered as random effects.
# Convenient function
print_model <- function(data){
type_name <- deparse(substitute(data))
lmerTest::lmer(Subjective_Valence ~ Autobiographical_Link + (1|Participant_ID), data=data) %>%
psycho::analyze(CI=NULL) %>%
summary() %>%
filter(Variable == "Autobiographical_Link") %>%
mutate(Type = type_name,
Coef = round(Coef, 2),
p = format_p(p)) %>%
select(Type, Coef, p)
}
# Run the model on all datasets
rbind(print_model(df),
print_model(Z_VarWise),
print_model(Z_ParWise),
print_model(Z_Full))
Type Coef p
1 df 0.09 > .1
2 Z_VarWise 0.07 > .1
3 Z_ParWise 0.08 = 0.08°
4 Z_Full 0.08 = 0.08°
As we can see, in our case, using participant-wise standardization resulted in a significant (at p = .1) effect! But keep in mind that this is not always the case. In can be the contrary, or generate very similar results. No method is better or more justified, and its choice depends on the specific case, context, data and goal.
Conclusion
- Standardization can be useful in some cases and should be justified
- Variable and Participant-wise standardization methods produce “in appearance” similar data
- Variable and Participant-wise standardization can lead to different and uncorrelated results
- The choice of the method can strongly influence the results and thus, should be explicitly stated
We showed here yet another way of sneakily tweaking the data that can change the results. To prevent its use for p-hacking, we can only support the generalization of open-data, open-analysis and preregistration.
Credits
The psycho package helped you? Don’t forget to cite the various packages you used :)
You can cite psycho
as follows:
- Makowski, (2018). The psycho Package: An Efficient and Publishing-Oriented Workflow for Psychological Science. Journal of Open Source Software, 3(22), 470. https://doi.org/10.21105/joss.00470
Previous blogposts
- Formatted Correlation with Effect Size
- Extracting a Reference Grid of your Data for Machine Learning Models Visualization
- Copy/paste t-tests Directly to Manuscripts
- Easy APA Formatted Bayesian Correlation
- Fancy Plot (with Posterior Samples) for Bayesian Regressions
- How Many Factors to Retain in Factor Analysis
- Beautiful and Powerful Correlation Tables
- Format and Interpret Linear Mixed Models
- How to do Repeated Measures ANOVAs
- Standardize (Z-score) a dataframe
- Compute Signal Detection Theory Indices
- Installing R, R Studio and psycho


Roger Federer
The King of Tennis
Here is a list of Roger's Grand Slam Titles
- 2003 - First Grand Slam Wimbledon
- 2004- Australian Open
- 2004- Wimbledon
- 2004- US Open
- 2005- Wimbledon
- 2005- US Open
- 2006- Australian Open
- 2006- Wimbledon
- 2006- US Open
- 2007- Australian Open
- 2007- Wimbledon
- 2007- US Open
- 2008- US Open
- 2009- French Open
- 2009- Wimbledon
- 2010- Australian Open
- 2012- Wimbledon
- 2017- Australian Open
- 2017- Wimbledon
- 2018- Australian Open
“Roger Federer will undoubtedly become the greatest tennis player to have graced the sport if he wins the French Open. It ends the discussion of where he fits in the history of the game. If it wasn't for [four-time champion Rafael] Nadal, he probably would have won a handful of these things. So nobody would underestimate where he deserves to fit in this game. He's extraordinarily talented and talk about grace on court; watching him play is something special to see and if he does it tomorrow, he'll know what an accomplishment it was.”
-- Andre Agassi, the day before Federer winning 2009 French Open Final


A malevolent, cannibalistic, supernatural being of Native American mythology. The wendigo may appear as a monster with some characteristics of a human.
An enormous snapping turtle alleged sighted in Busco, Indiana in 1898. The turtle weighs an estimated 500 pounds and is named Oscar after the farmer who first saw him.


This is a lightweight network for the face re-identification scenario. It is based on MobileNet V2 backbone, which consists of 3x3 inverted residual blocks. Instead of the ReLU6 activations used in the original MobileNet V2, this network uses PReLU ones. After the backbone, the network applies global depthwise pooling and then uses 1x1 convolution to create the final embedding vector. The model produces feature vectors which should be close in cosine distance for similar faces and far for different faces.
| Metric | Value |
|---|---|
| LFW accuracy | 0.9933 |
| Face location requirements | Tight aligned crop |
| GFlops | 0.586 |
| MParams | 1.059 |
| Source framework | PyTorch* |
LFW metric is the accuracy in the pairwise reidentification test. See the full benchmark description for details.
The model achieves the best results if an input face is frontally oriented and aligned. Face image is aligned if five keypoints (left eye, right eye, tip of nose, left lip corner, right lip corner) are located in the following points in normalized coordinates [0,1]x[0,1]:
[(0.31556875000000000, 0.4615741071428571),
(0.68262291666666670, 0.4615741071428571),
(0.50026249999999990, 0.6405053571428571),
(0.34947187500000004, 0.8246919642857142),
(0.65343645833333330, 0.8246919642857142)]
To align the face, use a landmarks regression model: using regressed points and the given reference landmarks, build an affine transformation to transform regressed points to the reference ones and apply this transformation to the input face image.
Link to performance table
Expected color order is RGB.
The net outputs a blob with the shape [1, 256], containing a row-vector of 256 floating point values. Outputs on different images are comparable in cosine distance.
[*] Other names and brands may be claimed as the property of others.


Fast, pluggable and easy-to-use parser-renderer factory.
Install with npm:
$ npm install --save snapdragon
Created by jonschlinkert and doowb.
Features
Breaking changes
Substantial breaking changes were made in v0.5.0! Most of these changes are part of a larger refactor that will be finished in 0.6.0, including the introduction of a Lexer
class.
Compiler
.render
method was renamed to .compile
var Snapdragon = require('snapdragon');
var snapdragon = new Snapdragon();
Parse
var ast = snapdragon.parser('some string', options)
// parser middleware that can be called by other middleware
.set('foo', function () {})
// parser middleware, runs immediately in the order defined
.use(bar())
.use(baz())
Render
// pass the `ast` from the parse method
var res = snapdragon.compiler(ast)
// compiler middleware, called when the name of the middleware
// matches the `node.type` (defined in a parser middleware)
.set('bar', function () {})
.set('baz', function () {})
.compile()
See the examples.
Parsers
Parsers are middleware functions used for parsing a string into an ast node.
var ast = snapdragon.parser(str, options)
.use(function() {
var pos = this.position();
var m = this.match(/^\./);
if (!m) return;
return pos({
// `type` specifies the compiler to use
type: 'dot',
val: m[0]
});
})
AST node
When the parser finds a match, pos()
is called, pushing a token for that node onto the ast that looks something like:
{ type: 'dot',
val: '.',
position:
{ start: { lineno: 1, column: 1 },
end: { lineno: 1, column: 2 } }}
Renderers
Renderers are named middleware functions that visit over an array of ast nodes to compile a string.
var res = snapdragon.compiler(ast)
.set('dot', function (node) {
console.log(node.val)
//=> '.'
return this.emit(node.val);
})
Source maps
If you want source map support, make sure to emit the position as well.
var res = snapdragon.compiler(ast)
.set('dot', function (node) {
return this.emit(node.val, node.position);
})
A parser middleware is a function that returns an abject called a token
. This token is pushed onto the AST as a node.
Example token
{ type: 'dot',
val: '.',
position:
{ start: { lineno: 1, column: 1 },
end: { lineno: 1, column: 2 } }}
Example parser middleware
Match a single .
in a string:
this.position()
.match
methodundefined
pos()
is called, which returns a token with:type
: the name of the [compiler] to useval
: The actual value captured by the regex. In this case, a .
. Note that you can capture and return whatever will be needed by the corresponding [compiler].Renderers are run when the name of the compiler middleware matches the type
defined on an ast node
(which is defined in a parser).
Example
Exercise: Parse a dot, then compile it as an escaped dot.
var ast = snapdragon.parser('.')
.use(function () {
var pos = this.position();
var m = this.match(/^\./);
if (!m) return;
return pos({
// define the `type` of compiler to use
type: 'dot',
val: m[0]
})
})
var result = snapdragon.compiler(ast)
.set('dot', function (node) {
return this.emit('\\' + node.val);
})
.compile()
console.log(result.output);
//=> '\.'
Create a new Parser
with the given input
and options
.
Params
input
{String}options
{Object}Define a non-enumberable property on the Parser
instance.
Example
parser.define('foo', 'bar');
Params
key
{String}: propery nameval
{any}: property valuereturns
{Object}: Returns the Parser instance for chaining.Set parser name
with the given fn
Params
name
{String}fn
{Function}Get parser name
Params
name
{String}Push a token
onto the type
stack.
Params
type
{String}returns
{Object} token
Pop a token off of the type
stack
Params
type
{String}returns
{Object}: Returns a tokenReturn true if inside a stack
node. Types are braces
, parens
or brackets
.
Params
type
{String}returns
{Boolean}Example
parser.isType(node, 'brace');
Params
node
{Object}type
{String}returns
{Boolean}Define a non-enumberable property on the Compiler
instance.
Example
compiler.define('foo', 'bar');
Params
key
{String}: propery nameval
{any}: property valuereturns
{Object}: Returns the Compiler instance for chaining.Pull requests and stars are always welcome. For bugs and feature requests, please create an issue.
| Commits | Contributor<br/> |
|---|---|
| 106 | jonschlinkert |
| 2 | doowb |
(This document was generated by verb-generate-readme (a verb generator), please don't edit the readme directly. Any changes to the readme must be made in .verb.md.)
To generate the readme and API documentation with verb:
$ npm install -g verb verb-generate-readme && verb
Install dev dependencies:
$ npm install -d && npm test
Jon Schlinkert
Copyright © 2016, Jon Schlinkert. Released under the MIT license.
This file was generated by verb-generate-readme, v0.1.31, on October 10, 2016.


can we make a list of candidates not offering bribes
Part of the NN rewards I'm planning to spend on different testing bounties and community activities. For example ROGUE freeroll tournaments, crypto-conditions Tetris championship, crypto conditions modules testing bounties and so on.
I plan to make a bounty fund for CCs and other apps testing / competitions


How to perform that viral hand trick everyone's doing on TikTok
If you’ve been on Twitter or TikTok recently, you’ve probably been puzzled by some people doing a magical hand trick.
19-year-old Tori Pareno has just gone viral for her mind-boggling hand swap illusion.
In a video with 6 million views on Twitter, it appears as if the Filipino teen is pushing her fingers through her hands. How the heck does she do it?!
Her Twitter followers have rapidly climbed since sharing the trick on Thursday, with the teen saying: ‘y’all have hand fetishes if 1 million of you watched this.’ And perhaps this is true.
A variation of the challenge first surfaced in August 2018 when Twitter user @kay_dera posted a video of her performing a similar hand movement. It was viewed 3.5 million times, and gained a bit of traction across social media as ‘the hand swap challenge’.
Advertisement Advertisement
This new incarnation has come about because of TikTok, where Tori also shared it with her 32,000 followers.
People are referring to the trick as ‘sorcery’ and ‘witchcraft’. Some users have pointed out that ‘You need mad skinny hands to be able to do this’, which, in a way, certainly helps.
Nonetheless, many TikTok users have shared videos of themselves giving the trick a go. And one Twitter user delivers his own rendition using hypnotising LED gloves:
Here’s how to do it:
Metro.co.uk’s Aidan Milan is here to show you how it’s done. Watch carefully.
 Repeat.
- Practice doing these movements quickly. Speed is key to making it look trippy.
- Look utterly impressed with your mad skillz.
Advertisement Advertisement


The Direct & Indirect Patterns of Organization
Workplace documents use the direct or indirect pattern of organization (or communication). When a direct message is sent, this does not mean that the tone is rude or abrupt. It means that the body of the message is structured differently depending in the purpose of the message and anticipated reaction of the audience.
Positive or Neutral
If the message is neutral or positive and the writer anticipates a neutral or positive response, the message is structured as a direct message (Figure 3.5 in Guffey & Almonte, p. 56). When a message is structured directly, it means that the main idea is introduced or frontloaded in the first paragraphs. That idea is then expanded in the body in as many concise paragraphs as necessary.
Negative or Sensitive
If the message is sensitive or negative and the writer anticipates a resistant or hostile response, the indirect pattern should be used. In this case, the first paragraph is neutral and does not frontload the refusal, but buffers it. The main point is withheld till later in the message (also see Figure 3.5) until the writer has laid the groundwork for the less pleasing news.
Credit line.


moso expression bamboo genes flowering flower transcription development formation PheDof analysis PheMADS plant Plant floral miR Primer Arabidopsis factors involved showed Dof protein (Figure miRNAs stages patterns regulatory MADS different miRa related roles signal expressed (), PHG gene {border-style MADS‐box growth plants significant used levels processing px;} regulation #ffffff;} development. using Expression hormone nonflowering rice samples Forward endoplasmic play target Figure pathway pathways Li, bamboo. developmental plant–pathogen regulates stage OsMADS RNAs bud leaves miRa, results selected targets Biol. Zhang, early flowering. indicated stage. stamen transgenic MADS, Reverse differentially down‐regulated inflorescence transduction Cell, Chen, Differential MYB Phe RNA detected family miRa. process response significantly situ stage, stress (a) (b) Bartel, PCR Res. acid carried embryo factor factors. including performed phylogenetic px; regulating reticulum vital {font-family (Gao (c) China Mol. Moreover, apical auxin characterization control expressions flowers font-size function group high important indicating interaction, key microRNAs molecular organ pistil study time up‐regulated (PHG) Bamboo Gao, HSP Kim, Physiol. Research Sci. Thus, Wang, Western b). cDNA cluster construct development, domain double; genes. hybridization identified large meristem miRa., number participate regulate research reticulum. role sativa AP/AGL ARF Cluster Genet. KEGG Lee, Moso NAC National OsDof Peng, Phyllostachys a). based bloom border-color border-width c). containing edulis) followed gibberellin highly mainly miR‐p miR‐p, organs paleas participated pathways. phenotype plants. primers primordia protein, protoplasts qRT‐ resistance sequence sequencing solid; transcriptional transduction. tree vegetative {font-style {font-weight (d) AtDof. Beijing Besides, CUC Cell Curr. D.H. D.P. DNA‐binding Dof, Functional However, MYB, OsMADS, PCR. PHG, RPS S.H. SYBR Technology Yang, Zhu, according activation affect antibodies axis biological bold cell clustered courier; data. delayed described determined em; explore formation, gradually growing hormones located metabolic metabolism miR. morphogenesis negatively observed obtained plays pre‐miRa primer processes proteins pt;} reactions regulated relative reproductive senescence. shoot small stamens stress. studied studies target), transition trend wild‐type yeast