+++ draft = false date = "2016-06-13T23:49:14-02:00" title = "How to use pgloader to migrate sqlite database to postgresql" tags = ["Docker", "cookbook", "Postgresql", "SQLite", "Kotti"] created = "2016-06-13T23:27:56-02:00" modified = "2016-07-19T13:14:37-02:00" permaLink = "http://play.pixelblaster.ro/blog/archive/2016/06/13/how-to-use-pgloader-to-migrate-sqlite-database-to-postgresql" author = "Tiberiu Ichim" aliases = [ "/blog/archive/2016/06/13/how-to-use-pgloader-to-migrate-sqlite-database-to-postgresql" ] +++
I needed to migrate a Kotti database, from its default sqlite file store, to Postgresql. Clued in by StackOverflow, I've tried using pgloader, but the version coming with Ubuntu is old: 2.x instead of the brand new 3.x. But the jump to 3.x meant a switch in programming languages as well: the new one is written in Lisp. I didn't want to install and compile the whole Lisp bundle just to run pgloader and I didn't find a binary distribution either, and after a recent exposure to Docker, I thought I'll give the dockerized version of pgloader a try.
After following the steps to install Docker, took me a bit to figure out the process (note: I'm running all this in a VMWare virtual machine, so I can afford taking a lot of unsecure shortcuts):
First, the local Postgresql database needs to be configured to run on an IP, to allow the dockerized pgloader process to connect to it.
sudo vim /etc/postgresql/9.3/main/pg_hba.conf
Change the network settings to allow connections from all:
# IPv4 local connections: host all all <IP_ADDRESS>/0 md5
sudo vim /etc/postgresql/9.3/main/postgresql.conf
listen_addresses = '*' # what IP address(es) to listen on;
docker pull dimitri/pgloader
I've created a file named "convert" with the commands for pgloader, to do the conversion:
load database from 'mydb.db' into<EMAIL_ADDRESS>with reset sequences, create no tables, include no drop, create no indexes, disable triggers set work_mem to '200MB', maintenance_work_mem to '512 MB';
For the IP of the postgresql I've used the one attached to eth0.
psql mydb truncate table nodes cascade truncate table nodes principals
sudo docker run --rm --name pgloader -v /path/to/data/:/data dimitri/pgloader:latest pgloader /data/convert


Class RESTClient
This is the pure REST client. It is used in a static way.
- ep6\RESTClient uses ep6\ErrorReporting
Namespace: ep6
Package: ep6\Util
Author: David Pauli<EMAIL_ADDRESS>Since: 0.0.0
Since: 0.0.3 Use HTTPRequestMethod enum.
Since: 0.1.0 Add a recommended wait time for the next request.
Since: 0.1.1 Now the object is printable via echo.
Since: 0.1.1 Add function to change the wait time for next REST request.
Since: 0.1.1 Set $HOST and $SHOP to default value null.
Since: 0.1.2 Add error reporting.
Located at util/RESTClient.class.php
Package: ep6\Util
Author: David Pauli<EMAIL_ADDRESS>Since: 0.0.0
Since: 0.0.3 Use HTTPRequestMethod enum.
Since: 0.1.0 Add a recommended wait time for the next request.
Since: 0.1.1 Now the object is printable via echo.
Since: 0.1.1 Add function to change the wait time for next REST request.
Since: 0.1.1 Set $HOST and $SHOP to default value null.
Since: 0.1.2 Add error reporting.
Located at util/RESTClient.class.php
public static
|
|
public static
|
|
public static
mixed[]
|
|
public static
String
|
#
sendWithLocalization( String $command, String $locale, mixed[] $postfields = array() )
This send function sends a special command to the REST server. |
public static
boolean
|
|
public static
boolean
|
error(),
errorMessage(),
errorNumber()
|
String |
HTTP_ACCEPT
|
#
"application/vnd.epages.v1+json"
|
String |
HTTP_CONTENT_TYPE
|
#
"application/json"
|
String |
PATHTOREST
|
#
"rs/shops"
|
public static
integer
|
$NEXT_RESPONSE_WAIT_TIME
The time in ms the shop object should wait until the next request. |
#
600
|


{% extends "base.html" %} {% import "_macros.html" as macros %} {% import "bootstrap/wtf.html" as wtf %} {% block body %}


This is our gorgeous beach. You can rent an umbrella for $5 an hour from us. We hope you love it!
This huge pool accommodates over 500 people! But we onlt allow 20 people at this exclusive resort! So you will have plenty of space to your self.
Zorba's Resto is our 5-star Zagat and Michelin rated restaurant.


You are now logged out of the portal.
Please log in with your username and password.
Once logged in, you will be able to view your employee
information as well as current HR and Training documents.
Once logged in, you will be able to view your employee
information as well as current HR and Training documents.


--- layout: default title: Services description: How I might be able to help ---
TL;DR: Design ops and workshops!
Over the last few years I've been involved in and managed everything from product roadmaps to rebrands of major consumer products while part of companies scaling from me to several thousand employees.
I've hired and interviewed hundreds of designers and product managers. I've helped founders to pull apart their product strategies, as well as wrangling my own business model from time to time (yep, this is my second time as a founder).
I'm a Google launchpad mentor and have advised several early stage companies during their formative years. I'm also a domain expert in the process of scaling design and tech skills through Progression.
As a founder first, I'm very protective of my time, but I'd also like to avoid raising capital and need to keep the lights on! So I'm open to occasional and short-term engagements.
Here are some of the ways we can work together:
I've been running workshops for internal teams and startups for several years. Whether a couple of hours or a couple of days, I design the valuable time the team is putting in to be fun and engaging with clear outcomes.
Prices are upfront, so you know what you're paying. They're also subject to change.
Half day: £1200 + £100 for every attendee over 12
Full day: £2000 + £140 for every attendee over 12
This workshop focuses on getting your design team to look at their own strengths across dozens of defined skills, and create a canvas for their own growth. It will stimulate better conversations about goalsetting and career paths within your company, and give you a framework to plan their growth over time.
The full day version also focuses on working relationships within the team and maps out attendees' journies and strengths beyond the company.
I also occasionally run these workshops on a ticketed basis.
£2000/day + materials
If amidst the everyday chaos, you've lost sight of what the role of your team is in the company, or your product is in the world, it can sap motivation and focus, and lose you valuable employees.
An offsite session to fall in love with your mission again is often the tonic to a more productive, happier and more focused team.
This workshop focuses on resetting your team's focus – whether that's around design quality, product values, positioning or strategy.
I've run this workshop across both one and two days of focused, offsite time.
£130 per hour / £950 per day (includes travel within London)
If you have a problem to solve around growing your design or product organisation that requires an experienced impartial third party to unstick, or you're planning something big and want a sense check, I may be able to help.
Experiencing the design team leaky bucket?
I can help to unpick and improve your nose-to-tail designer experience, to ensure that the people you hire have a fantastic and meaningful time with you.
Got budget and scope to double your team, but not sure where to start?
I can help with aligning your hiring process with your internal expectations, designing an interview process with produces fair, consistent results, and encouraging a more diverse range of applicants, as well as good old fashioned sourcing.
Looking to improve design quality?
Often I see teams get caught up in the same conversations again and again when it comes to what constitutes 'the right answer', or just not bothering to share work across teams or projects at all.
This can lead to a poor end-user experience, but also designer frustration and churn, and painful relationships with engineers resulting in poorly built products.
But I can help! I've created and run design-ops teams and projects, wrangled inconsistent product experiences into shape and facilitated better communication and tooling, saving designers and engineers time and stress.
£99, and you buy the coffee
I love meeting people for coffee. But as an unsalaried solo founder, it costs me money and takes me away from building my product. So this is probably the controversial one, but if you're looking for advice, and being paid for your time (by your boss), I think it's polite to pay it forwards.
Yes chances are that means I have fewer coffees. But right now I'm ok with that.
You will have my undivided attention for an hour, and I'll endeavour to introduce you to or follow up on whoever/whatever is useful from that time. You've paid me, and I intend to deliver.
If you're a student, looking for personal not work advice, or there's a high chance we'll be working together or you'll be a future Progression customer, this fee doesn't apply. Even more so, if you're from a marginalised group or under-represented background, I actively want to help. Get in touch!


A MERRY WAR (aka Keep the Aspidistra Flying)
Reviewed by Harvey Karten, Ph.D. First Look Pictures Director: Robert Bierman Writer: Alan Plater, novel by George Orwell Cast: Richard E. Grant, Helena Bonham Carter, Jim Carter, Harriet Walter, Lill Roughly, Julian Wadham, Lesley Vickerage, John Clegg, Barbara Leigh Hunt
The best chapter in a particular college textbook I was assigned on the uses of the English language deals with how the different social classes use words. The upper and lower classes are surprisingly alike. Referring to a container for flowers, uppers and lowers say "vayze" while the middle classes use the more pretentious pronunciation "vahz." Uppers and lowers say "couch" while the middles say "sofa." These differences extend to possessions (within limits of course) with the very rich and the rather poor driving plain, older cars while those in the middle manuever late-model, fashionable vehicles. Why is this? I suppose the reason is that the really wealthy are well established: everyone knows who they are. They do not have to prove anything, to be ostentatious. As for the lower orders, as the principal character in "A Merry War" reports, "They have nothing to lose so they can always tell the truth."
Which brings us to the movie. "A Merry War," based on an early (1936) novel by George Orwell called "Keep the Aspidistra Flying," is somewhat autobiographical, based on the young Orwell's wrestling with his own political and philosophical beliefs. "A Merry War" is actually about two raging conflicts: one is between a young man and his woman friend; the other is between the young man and...the young man--an internal conflict. George Orwell at the time could not quite make up his mind whether he was a radical or a conservative, so he converted his interior struggle to art. In the novel Orwell has the man debating with himself. In the movie, directed by Robert Bierman from Alan Plater's adaptation of the novel, the interior struggle becomes an ongoing debate between the man and a woman.
The film is an absolute delight, as the middle classes would say (or would it be the uppers)? Though it takes place in the London of 1934, it is technically exceptional, splashing all the color and ambiance of the great city photographed on some unusually sunny, rain-free days. Though its very subject is political and philosophical, there is no mention of the rising threat of Nazism just across the channel in Germany, nor is there much sign that the Great Depression is having all that much impact in England.
The story centers on Gordon Comstock (Richard E. Grant), a highly successful advertising copywriter whose boss, Erskine (Jim Carter), tells him that his copy for a cereal product has caused sales to rise 17%. The graphics are provided by Comstock's woman friend, Rosemary (Helena Bonham Carter), who works with him in the same office and whose art work gets along with the verbiage far better than she with he. One day Comstock decides that he has had enough of this life as a sellout writing doggeral for banal commodities and, determined to be a full-time poet and a "free man," he quits his job, takes a thoroughly respectable flat near his new job in a bookstore, and stares daily at the uptight landlady's apidistra plant--which symbolizes middle- class respectability, neatness, order, and conformity. Though his poetry is turned down by almost every publisher, he gets a sudden windfall from a magazine in "our colony in California" of $50 which he blows in one night of drunken partying with Rosemary and a wealthy publisher friend, Ravelston (Julian Wadham). After a drunken scandal which lands him in jail for a night, he is left pence-less, takes a filthy flat in the sordid Lambeth district together with a job in a scuzzy bookstore, and declares that he is happy living with friendly, but sometimes violent people who are the antithesis of bourgeois respectability.
Much of the film deals with an ongoing debate between Comstock and Rosemary, a controversy that often scales witty slopes that would make Oscar Wilde proud.  Their arguments are pursued in Comstock's bug-infested digs, in the neat and clean office of the advertising agency, in the publisher's pied-a-terre which finds Comstock's friend frequently in the company of his mistress Hermoine (Lesley Vickerage), and in a posh restaurant where Comstock and Rosemary are amusingly patronized by a haughty waiter.
"A Merry War" is the antithesis of all-American blockbusters like "Armageddon" and proves, as many a witty, cultivated film can, that less is more. You need not go to London's fringe theaters or to New York's off-Broadway stage companies to find such a regard for words as you'll get with "A Merry War." Here you're not dealing with high-priced publicists that try to see you a movie that will knock your socks off or scare you out of your wits. Films of this nature are not products which are doled out by commercial outfits who are in the game only for the buck and who have contempt for their audience which, they believe, cannot separate the wheat from the chaff. Apropos, during the "slum" phase of Comstock's life, he praises one type of commercial transaction where neither the seller nor the buyer is getting ripped off, where each side knows exactly what it's getting. He relates the tale of the guy who collects horse manure and sells it to people who use the stuff to make their gardens grow. "They're buying and selling shit," as he describes this honest transaction. "Nobody has any illusions." Utilizing excellent performers like Richard E. Grant in the role of Gordon Comstock, Helena Bonham Carter as Rosemary, and Harriet Walter as Gordon's put-upon sister Julia, director Robert Bierman has done George Orwell proud by projecting outward the novelist's inner conflict about class and caste, fashioning an intriguing, quick, touching and sometimes venomous movie.
Not Rated. Running time: 101 minutes. (C) Harvey Karten 1998
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


Momento
Momento is an app that automatically creates beautiful gifs from the photos saved on your iPhone. My friend Genady has been working on it since 2016, and after seeing him progresses with it so much I felt like I want to take part and help him with some product design challenges just as he began to monitize his app. Luckilly for me, he agreed.


Have a suggestion for another tweeter we should be recommending? Tweet about them to @oncountryaus
#oncountry is a twitter handle and the name of an interactive map of national Indigenous stories. The tweet #oncountry is featured in a live feed at www.on-country.org. The map showcases data including ABC's online photo stories and the Aboriginal Business Directory. When a user visits the website they can engage with an Australian map filled with historical and current Indigenous culture.


CodeChef - UMIT CHAPTER
CodeChef
CodeChef was created as a platform to help programmers make it big in the world of algorithms, computer programming, and programming contests. It hosts three featured contests every month (Long Challenge, CookOff & LunchTime), and gives away prizes and goodies to the winners as encouragement.CodeChef - UMIT
A zealous group, with an aim to "teach, learn and spread" the spirit of competitive programming among enthusiastic individuals. As a Chapter, we believe in making CP a fun, interactive and a go-to subject for students and help them overcome all kinds of CP obstacles. Apart from that, we focus on engaging participants in coding contests, to hone their programming skills ,develop & learn in a fun-oriented manner!


Fallback implementation of the IOUring batch interface. This implementation uses queues of individual read/write operations instead of a single batched operation.
More...
#include <IOUringFallback.hpp>
|
| | IOUringFallback (unsigned entries) |
| |
| virtual | ~IOUringFallback () |
| |
| void | submit () override |
| | Submit all prepared uring operations in a batch, and wait for all operations to return a result. Throws if there are errors interacting with the completion queue. Failures of batched operations are reported by ret from the operation's respective prep_... function call, and do not cause this function to throw. More...
|
| |
| void | prep_read (std::shared_ptr< int > ret, int fd, void *buf, unsigned nbytes, off_t offset) override |
| | Perform a pread in the next batch submission. More...
|
| |
| void | prep_write (std::shared_ptr< int > ret, int fd, const void *buf, unsigned nbytes, off_t offset) override |
| | Perform a pwrite in the next batch submission. More...
|
| |
| | IOUring ()=default |
| | Create and initialize an IO uring. More...
|
| |
| virtual | ~IOUring ()=default |
| | Clean up the IO uring. More...
|
| |
|
| static std::unique_ptr< IOUring > | make_unique (unsigned entries) |
| | Create a fallback implementation of IOUring that uses non-batched IO operations, in case we cannot use IO uring or liburing. More...
|
| |
| static std::unique_ptr< IOUring > | make_unique (unsigned entries) |
| | Create an object that supports an io_uring-like interface. The created object uses io_uring if supported, otherwise uses individual read/write operations. More...
|
| |
Fallback implementation of the IOUring batch interface. This implementation uses queues of individual read/write operations instead of a single batched operation.
◆ IOUringFallback()
| geopm::IOUringFallback::IOUringFallback |
( |
unsigned |
entries | ) |
|
◆ ~IOUringFallback()
| geopm::IOUringFallback::~IOUringFallback |
( |
| ) |
|
|
virtual |
◆ make_unique()
| std::unique_ptr< IOUring > geopm::IOUringFallback::make_unique |
( |
unsigned |
entries | ) |
|
|
static |
Create a fallback implementation of IOUring that uses non-batched IO operations, in case we cannot use IO uring or liburing.
- Parameters
-
| entries | The expected maximum number of batched operations. |
◆ prep_read()
| void geopm::IOUringFallback::prep_read |
( |
std::shared_ptr< int > |
ret, |
|
|
int |
fd, |
|
|
void * |
buf, |
|
|
unsigned |
nbytes, |
|
|
off_t |
offset |
|
) |
| |
|
overridevirtual |
Perform a pread in the next batch submission.
- Parameters
-
| ret | Where to store the operation's return value, which will be a non-negative number of bytes read, or -errno on failure, after submit() returns. |
| fd | Which already-opened file to read. |
| buf | Where to store the read data. |
| nbytes | Number of bytes to read into buf . |
| offset | Offset within fd to start the pread. -1 uses the existing offset of fd , like in read(). |
- Exceptions
-
| if | the queue is already full. |
Implements geopm::IOUring.
◆ prep_write()
| void geopm::IOUringFallback::prep_write |
( |
std::shared_ptr< int > |
ret, |
|
|
int |
fd, |
|
|
const void * |
buf, |
|
|
unsigned |
nbytes, |
|
|
off_t |
offset |
|
) |
| |
|
overridevirtual |
Perform a pwrite in the next batch submission.
- Parameters
-
| ret | Where to store the operation's return value, which will be a non-negative number of bytes written, or -errno on failure, after submit() returns. |
| fd | Which already-opened file to write. |
| buf | Which data to write to the file. |
| nbytes | Number of bytes to write from buf . |
| offset | Offset within fd to start the pwrite. -1 uses the existing offset of fd , like in write(). |
- Exceptions
-
| if | the queue is already full. |
Implements geopm::IOUring.
◆ submit()
| void geopm::IOUringFallback::submit |
( |
| ) |
|
|
overridevirtual |
Submit all prepared uring operations in a batch, and wait for all operations to return a result. Throws if there are errors interacting with the completion queue. Failures of batched operations are reported by ret
from the operation's respective prep_... function call, and do not cause this function to throw.
Implements geopm::IOUring.
The documentation for this class was generated from the following files:


--- layout: page title: "Salted Challenge Response HTTP Authentication Mechanism" description: "This specification describes a family of HTTP authentication mechanisms called the Salted Challenge Response Authentication Mechanism (SCRAM), which provides a more robust authentication mechanism than a plaintext password protected by Transport Layer Security (TLS) and avoids the deployment obstacles presented by earlier TLS-protected challenge response authentication mechanisms." ---
| Document Name: | RFC 7804 |
|---|---|
| Document URI: |
urn:ietf:rfc:7804
|
| Online Version: |
https://datatracker.ietf.org/doc/html/rfc7804
|
| Organization: | Internet Engineering Task Force (IETF) |
| Series: | Request for Comments (RFC) |
| Abstract: | This specification describes a family of HTTP authentication mechanisms called the Salted Challenge Response Authentication Mechanism (SCRAM), which provides a more robust authentication mechanism than a plaintext password protected by Transport Layer Security (TLS) and avoids the deployment obstacles presented by earlier TLS-protected challenge response authentication mechanisms. |
SCRAM-SHA-1
,
SCRAM-SHA-256
Return to ( Series | Organization | all Specifications )


Half a Crossword
for ESL conversation classes
my words
To create your half a crossword, enter some words in the panel on the left.Or for a quick demo click here:
demo


OUR LADY OF THE ASSASSINS (La Virgen de los sicarios)
Reviewed by Harvey Karten Paramount Classics Director: Barbet Schroeder Writer: Fernando Vallejo Cast: German Jaramillo, Anderson Ballesteros, Juan David Restrepo, Manuel Busquets Screened at: Broadway Screen Rm NY 8/15/01
After the shootout at Colorado's Colombine High School the cliche was bandied around once again: "In my day, disputes were settled by fists. Nowadays they use guns." You think that's bad? Contrast that with what they're saying about the high school kids not in Columbine but in Colombia: "They used to settle disputes with machetes. Now they use guns." This is an actual quote from Barbet Schroeder's new film, "Our Lady of the Assassins," the first Spanish-language work from the director familiar to Americans for movies like "Reversal of Fortune" and "Single White Female." In this bleak, cynical, blasphemous and occasionally even humorous vision of life in Medellin--known to us here as the capital of that country's drug cartel--Schroeder hones in on a well-traveled homosexual now in his fifties, Fernando (German Jaramillo), who has returned home, as he puts it, "to die." Why so? Despite the large apartment with a stunning three-sided view of the city and a considerable sum of money which he has inherited from his sister, he is simply tired of living. Ah, but redemption, spelled L-O-V-E awaits in the form of a innocent looking teen, Alexis (Anderson Ballesteros), to whom Fernando is introduced at a party by a friend and with whom he establishes a sexual and caring bond.
Schroeder's take on the city of Medellin, based on Fernando Vallejo's novel, is not the sort that the Colombia Tourist Department would want to use to lure potential travelers to its doorstep. Schroeder filmed on the fly to avoid mighty unpleasant repercussions from the locals who dwell in the drug-infested barrios of the otherwise sparkling city. Its clean, well-stocked malls could pass muster in Southern Cal. and touristic areas of Europe. But "La Virgen de los sicarios" is a tour of a city, as Fernando advises a witness to a murder, in which "people get killed all the time....This isn't Switzerland." The lad whom Fernando has taken under his wing and who is in turn protected by young Alexis is sought by hit men. Bearing the kill- or-be-killed demeanor, Alexis has no problem whipping out his Baretta and offing a cab driver who refuses to turn down his radio.  While Fernando does not much approve of his prot‚g‚'s behavior, he seems remarkably accepting, blaming the death of civilization for the murders that befall his homeland in much the way that Wallace Shawn's intellectual played by Mike Nichols in "Death of a Mourner" laments the demise of high culture.
If Fernando were living on New York's Sutton Place, we'd probably call him not so much a limousine liberal as an acolyte of radical chic. He has money, but he is a militant non-believer, an atheist who believes that if God exists, then He has failed and Satan has won the battle. He understands that the rich run the world, but like so many other radicals of the left, he has considerable contempt for the poor, telling one young, ragged woman with two children in tow to "beg for pesos from the person who knocked you up."
Amid the death and decay that Fernando and Alexis find in the city (in one area there is a sign "Do not dump corpses," where, of course, several bodies have been placed in states of advanced decay), there is considerable humor. In one scene Schroeder contrasts Fernando's love of Maria Callas with Alexis's fondness for rock, the latter insisting that the diva sounds as though she were being strangled. "Our Lady of the Assassins" is filled with the music of the people--the tango of the night club, the drums of the punk who lives in the apartment next door, the blaring beat of the taxi radios--but a Jerry Bruckheimer-type score would be gratuitous. Schroeder delivers his message loud and clear: civilization as the older generation knew it is dead, and Medellin is merely metaphor.
Rated R. Running time: 98 minutes. (C) 2001 by Harvey Karten<EMAIL_ADDRESS>========== X-RAMR-ID: 29249 X-Language: en X-RT-ReviewID: 244233 X-RT-TitleID: 1109717 X-RT-SourceID: 570 X-RT-AuthorID: 1123
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


Matic Maniac is a place to rate your wallet and receive a score based on your activity within the Polygon Network. Wallets with higher scores are more active and have done a larger variety of things than wallets with lower scores. Enter your wallet below and see where you stand, there are even achievements you can earn by participanting in various ways across the MATIC/Polygon Network.
Please enter your Wallet Address.


Tank which stores fuel oil
| lib | phIoT |
|---|---|
| superkind | phIoT::Tank |
| filter | equip and tank and oil |
| Dict |
Dict is a map of tag name/value pairs |
|---|---|
| Entity |
Entity represents top-level dicts with a unique identifier |
| Equip |
Equipment asset |
| Tank |
Storage tank vessel |
Entity represents top-level dicts with a unique identifier
| dis | Str |
Display name for humans |
|---|---|---|
| id | Ref |
Defines the unique identifier of an entity in system using a Ref value type |
Equipment asset
| equip! | Marker | |
|---|---|---|
| siteRef | Contains « Site |
Site which contains this equipment |
Storage tank vessel
| tank! | Marker |
|---|


Connect mutations
Using mutations from connect will give you some extra leverage by adding the mutation information to the index, this will enable auto-completion feature for the API explorer interfaces and also integrate the mutation result with the connect read engine.
Mutations setup
The mutation setup looks very much like the one for resolvers, you define them using pc/defmutation
and
include them in the registry, just like the resolvers.
(ns com.wsscode.pathom.book.connect.mutations
(:require [com.wsscode.pathom.core :as p]
[com.wsscode.pathom.connect :as pc]))
(pc/defmutation my-mutation [env params] ...)
(def parser
(p/parser
{::p/env {::p/reader [p/map-reader
pc/reader2
pc/open-ident-reader]}
::p/mutate pc/mutate
::p/plugins [(pc/connect-plugin {::pc/register my-mutation})
p/error-handler-plugin
p/trace-plugin]}))
Now let’s write a mutation with our factory.
Creating mutations
The defmutation
have the same interface that we used with defresolver
.
(ns com.wsscode.pathom.book.connect.mutations
(:require [com.wsscode.pathom.connect :as pc]
[com.wsscode.pathom.core :as p]))
(pc/defmutation send-message [env {:keys [message/text]}]
{::pc/sym 'send-message
::pc/params [:message/text]
::pc/output [:message/id :message/text]}
{:message/id 123
:message/text text})
(def parser
(p/parser
{::p/env {::p/reader [p/map-reader
pc/reader2
pc/open-ident-reader]}
::p/mutate pc/mutate
::p/plugins [(pc/connect-plugin {::pc/register send-message})
p/error-handler-plugin
p/trace-plugin]}))
The ::pc/params
is currently a non-op, but in the future it can be used to validate the mutation input, it’s format
is the same as output (considering the input can have a complex data shape). The ::pc/output
is valid and can be used
for auto-complete information on explorer tools.
Mutation joins
After doing some operation, you might want to read information about the operation’s result. With connect, you can leverage the resolver engine to expand the information that comes from the mutation. To do that you do a mutation join and use that to query the information. Here is an example where we create a new user and retrieve some server information with the output.
(ns com.wsscode.pathom.book.connect.mutation-join
(:require [com.wsscode.pathom.connect :as pc]
[com.wsscode.pathom.core :as p]))
(pc/defmutation create-user [{::keys [db]} user]
{::pc/sym 'user/create
::pc/params [:user/name :user/email]
::pc/output [:user/id]}
(let [{:keys [user/id] :as new-user}
(-> user
(select-keys [:user/name :user/email])
(merge {:user/id (random-uuid)
:user/created-at (js/Date.)}))]
(swap! db assoc-in [:users id] new-user)
{:user/id id}))
(pc/defresolver user-data [{::keys [db]} {:keys [user/id]}]
{::pc/input #{:user/id}
::pc/output [:user/id :user/name :user/email :user/created-at]}
(get-in @db [:users id]))
(pc/defresolver all-users [{::keys [db]} _]
{::pc/output [{:user/all [:user/id :user/name :user/email :user/created-at]}]}
{:user/all (vals (get @db :users))})
(def api-registry [create-user user-data all-users])
(def parser
(p/parser
{::p/env {::p/reader [p/map-reader pc/reader2 pc/open-ident-reader]
::db (atom {})}
::p/mutate pc/mutate
::p/plugins [(pc/connect-plugin {::pc/register api-registry})
p/error-handler-plugin
p/trace-plugin]}))
Note that although we only return the :user/id
from the mutation, the resolvers can walk the graph
and fetch the other requested attributes.
Mutation join globals
Some attributes need to be in the output even when they are not asked for. For example, if your parser is driving a
Fulcro app, the :tempid
part of the mutation will be required for the app to remap the ids correctly. We could ask for
the user to add it on every remote query but instead we can also define some global attributes and they
will be read every time. As in this example:
(ns com.wsscode.pathom.book.connect.mutation-join-globals
(:require [com.wsscode.pathom.connect :as pc]
[com.wsscode.pathom.core :as p]))
(pc/defmutation user-create [{::keys [db]} user]
{::pc/sym 'user/create
::pc/params [:user/name :user/email]
::pc/output [:user/id]}
(let [{:keys [user/id] :as new-user}
(-> user
(select-keys [:user/name :user/email])
(merge {:user/id (random-uuid)
:user/created-at (js/Date.)}))]
(swap! db assoc-in [:users id] new-user)
{:user/id id
:app/id-remaps {(:user/id user) id}}))
(pc/defresolver user-data [{::keys [db]} {:keys [user/id]}]
{::pc/input #{:user/id}
::pc/output [:user/id :user/name :user/email :user/created-at]}
(get-in @db [:users id]))
(pc/defresolver all-users [{::keys [db]} _]
{::pc/output [{:user/all [:user/id :user/name :user/email :user/created-at]}]}
{:user/all (vals (get @db :users))})
(def app-registry [user-create user-data all-users])
(def parser
(p/parser
{::p/env {::p/reader [p/map-reader
pc/reader2
pc/open-ident-reader
p/env-placeholder-reader]
::pc/mutation-join-globals [:app/id-remaps]
::p/placeholder-prefixes #{">"}
::db (atom {})}
::p/mutate pc/mutate
::p/plugins [(pc/connect-plugin {::pc/register app-registry})
p/error-handler-plugin
p/trace-plugin]}))
So in case of fulcro apps you can use the :com.fulcrologic.fulcro.algorithms.tempid/tempid
as a global and have that pass through.
Mutation output context
Mutation context allows the mutation caller to provide extra data to be used as context information for further processing in the mutation response.
During UI development, sometimes you may want to load some data in response to the mutation but the mutation output doesn’t have enough context, although the UI does (because it has a much bigger view at the client data). For those cases the UI can send some params to the mutation so those are available for traversing in the mutation response.
To demonstrate this, check the following example:
(ns com.wsscode.pathom.book.connect.mutation-context
(:require [com.wsscode.pathom.connect :as pc]
[com.wsscode.pathom.core :as p]))
(pc/defmutation create-user [{::keys [db]} user]
{::pc/sym 'user/create
::pc/params [:user/name :user/email]
::pc/output [:user/id]}
(let [{:keys [user/id] :as new-user}
(-> user
(select-keys [:user/name :user/email])
(merge {:user/id (random-uuid)
:user/created-at (js/Date.)}))]
(swap! db assoc-in [:users id] new-user)
{:user/id id}))
(pc/defresolver user-data [{::keys [db]} {:keys [user/id]}]
{::pc/input #{:user/id}
::pc/output [:user/id :user/name :user/email :user/created-at]}
(get-in @db [:users id]))
(pc/defresolver all-users [{::keys [db]} _]
{::pc/output [{:user/all [:user/id :user/name :user/email :user/created-at]}]}
{:user/all (vals (get @db :users))})
(pc/defresolver n++ [_ {:keys [number/value]}]
{::pc/input #{:number/value}
::pc/output [:number/value++]}
{:number/value++ (inc value)})
(def api-registry [create-user user-data all-users n++])
(def parser
(p/parser
{::p/env {::p/reader [p/map-reader pc/reader2 pc/open-ident-reader]
::db (atom {})}
::p/mutate pc/mutate
::p/plugins [(pc/connect-plugin {::pc/register api-registry})
p/error-handler-plugin
p/trace-plugin]}))
One real use-case for this feature would be in a Fulcro app, when you send some mutation but the result needs to update some component elsewhere (and the required data is known by the client, but not by the original mutation result).
Async mutations
If you use async-parser
or parallel-parser
you must use the mutate-async
so mutations
work and support returning channels.
Here is an example of doing some mutation operations using async features.
Example:
(ns com.wsscode.pathom.book.connect.mutation-async
(:require [cljs.core.async :as async :refer [go]]
[com.wsscode.common.async-cljs :refer [go-catch <!p <?]]
[com.wsscode.pathom.book.util.indexeddb :as db]
[com.wsscode.pathom.connect :as pc]
[com.wsscode.pathom.core :as p]))
(defn adapt-user [user]
(-> (into {} (map (fn [[k v]] [(keyword "user" (name k)) v])) (dissoc user ::db/key))
(assoc :user/id (::db/key user))))
(pc/defmutation user-create [{::keys [db]} user]
{::pc/sym 'user/create
::pc/params [:user/name :user/email]
::pc/output [:user/id]}
(go
(let [db (<? db)
user-id (-> user
(select-keys [:user/name :user/email])
(merge {:user/created-at (js/Date.)})
(->> (db/create! {::db/db db ::db/store-name "users"}))
<?)]
{:user/id user-id
:app/id-remaps {(:user/id user) user-id}})))
(pc/defresolver user-by-id [{::keys [db]} {:keys [user/id]}]
{::pc/input #{:user/id}
::pc/output [:user/id :user/name :user/email :user/created-at]}
(go
; reading from indexeddb
(let [db (<? db)]
(-> (db/read-object {::db/db db ::db/store-name "users"} id) <?
adapt-user))))
; let's make an access to all users
(pc/defresolver all-users [{::keys [db]} _]
{::pc/output [{:user/all [:user/id :user/name :user/email :user/created-at]}]}
(go
(let [db (<? db)]
(->> (db/scan-store {::db/db db ::db/store-name "users"})
(async/into []) <?
(mapv adapt-user)
(hash-map :user/all)))))
; list all our app resolvers and mutations
(def app-registry [user-create user-by-id all-users])
(def db-settings
{::db/db-name "connectAsyncDemo"
::db/migrations [{::db/stores {"users" {::db/keys ::db/auto-increment
::db/indexes {"name" {::db/unique false}}}}}]})
(def parser
(p/parallel-parser
{::p/env {::p/reader [p/map-reader
pc/parallel-reader
pc/open-ident-reader
p/env-placeholder-reader]
::p/placeholder-prefixes #{">"}
::pc/mutation-join-globals [:app/id-remaps]
::db (db/setup-db db-settings)}
::p/mutate pc/mutate-async
::p/plugins [(pc/connect-plugin {::pc/register app-registry})
p/error-handler-plugin
p/trace-plugin]}))
Using the same query/mutation interface, we replaced the underlying implementation from an atom to an indexedDB
database.
You can do the same to target any type of API you can access.


Your Name
Username
Password
Confirm Password
Email Id
Mobile Number
Collage Id Number
Register
Already have an account! Login Here..


| Class | ActiveRecord::ConnectionAdapters::DB2Adapter |
| In: |
vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb
|
| Parent: | AbstractAdapter |
The DB2 adapter works with the C-based CLI driver (rubyforge.org/projects/ruby-dbi/)
Options:
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 41 41: def initialize(connection, logger, connection_options) 42: super(connection, logger) 43: @connection_options = connection_options 44: if schema = @connection_options[:schema] 45: with_statement do |stmt| 46: stmt.exec_direct("SET SCHEMA=#{schema}") 47: end 48: end 49: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 183 183: def active? 184: @connection.select_one 'select 1 from ibm.sysdummy1' 185: true 186: rescue Exception 187: false 188: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 96 96: def adapter_name() 97: 'DB2' 98: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 104 104: def add_limit_offset!(sql, options) 105: if limit = options[:limit] 106: offset = options[:offset] || 0 107: # The following trick was added by<EMAIL_ADDRESS>108: sql.gsub!(/SELECT/i, 'SELECT B.* FROM (SELECT A.*, row_number() over () AS internal$rownum FROM (SELECT') 109: sql << ") A ) B WHERE B.internal$rownum > #{offset} AND B.internal$rownum <= #{limit + offset}" 110: end 111: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 78 78: def begin_db_transaction 79: @connection.set_auto_commit_off 80: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 142 142: def columns(table_name, name = nil) 143: result = [] 144: schema = @connection_options[:schema] || '%' 145: with_statement do |stmt| 146: stmt.columns(table_name, schema).each do |c| 147: c_name = c[3].downcase 148: c_default = c[12] == 'NULL' ? nil : c[12] 149: c_default.gsub!(/^'(.*)'$/, '\1') if !c_default.nil? 150: c_type = c[5].downcase 151: c_type += "(#{c[6]})" if !c[6].nil? && c[6] != '' 152: result << Column.new(c_name, c_default, c_type, c[17] == 'YES') 153: end 154: end 155: result 156: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 82 82: def commit_db_transaction 83: @connection.commit 84: @connection.set_auto_commit_on 85: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 64 64: def execute(sql, name = nil) 65: rows_affected = 0 66: with_statement do |stmt| 67: log(sql, name) do 68: stmt.exec_direct(sql) 69: rows_affected = stmt.row_count 70: end 71: end 72: rows_affected 73: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 122 122: def indexes(table_name, name = nil) 123: tmp = {} 124: schema = @connection_options[:schema] || '' 125: with_statement do |stmt| 126: stmt.indexes(table_name, schema).each do |t| 127: next unless t[5] 128: next if t[4] == 'SYSIBM' # Skip system indexes. 129: idx_name = t[5].downcase 130: col_name = t[8].downcase 131: if tmp.has_key?(idx_name) 132: tmp[idx_name].columns << col_name 133: else 134: is_unique = t[3] == 0 135: tmp[idx_name] = IndexDefinition.new(table_name, idx_name, is_unique, [col_name]) 136: end 137: end 138: end 139: tmp.values 140: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 59 59: def insert(sql, name = nil, pk = nil, id_value = nil, sequence_name = nil) 60: execute(sql, name = nil) 61: id_value || last_insert_id 62: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 158 158: def native_database_types 159: { 160: :primary_key => 'int generated by default as identity (start with 42) primary key', 161: :string => { :name => 'varchar', :limit => 255 }, 162: :text => { :name => 'clob', :limit => 32768 }, 163: :integer => { :name => 'int' }, 164: :float => { :name => 'float' }, 165: :decimal => { :name => 'decimal' }, 166: :datetime => { :name => 'timestamp' }, 167: :timestamp => { :name => 'timestamp' }, 168: :time => { :name => 'time' }, 169: :date => { :name => 'date' }, 170: :binary => { :name => 'blob', :limit => 32768 }, 171: :boolean => { :name => 'decimal', :limit => 1 } 172: } 173: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 92 92: def quote_column_name(column_name) 93: column_name 94: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 100 100: def quote_string(string) 101: string.gsub(/'/, "''") # ' (for ruby-mode) 102: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 179 179: def quoted_false 180: '0' 181: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 175 175: def quoted_true 176: '1' 177: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 190 190: def reconnect! 191: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 87 87: def rollback_db_transaction 88: @connection.rollback 89: @connection.set_auto_commit_on 90: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 51 51: def select_all(sql, name = nil) 52: select(sql, name) 53: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 55 55: def select_one(sql, name = nil) 56: select(sql, name).first 57: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 193 193: def table_alias_length 194: 128 195: end
# File vendor/rails/activerecord/lib/active_record/connection_adapters/db2_adapter.rb, line 113 113: def tables(name = nil) 114: result = [] 115: schema = @connection_options[:schema] || '%' 116: with_statement do |stmt| 117: stmt.tables(schema).each { |t| result << t[2].downcase } 118: end 119: result 120: end


Te En Dictionary FAQ
- How to lookup a meaning for telugu word?
Telugu word must be typed in unicode format. To type a telugu word, select
language option from Menu item to Telugu or by pressing F2 and type in. When
finished press enter. However, some third party tools can also be used for
typing.
Third party and in house tools for typing telugu:
- I couldn't see telugu letters, only square boxes are visible.
Your computer is not enabled for telugu properly.
Enable telugu as given in the below Microsoft supprot.
Press here.


Thai court orders park chief arrested in activist’s murder
BANGKOK (AP) - A Thai court has issued arrest warrants for the former head of a major national park and three park employees accused of killing an ethnic Karen environmental activist.
The Department of Special Investigation announced that a court for government officials approved the warrants on Monday in the case of Porlajee Rakchongcharoen, who was last seen in the custody of Kaeng Krachan National Park officials in western Thailand in April 2014.
Porlajee, also known as Billy, had led the Karen community in a lawsuit against park chief Chaiwat Limlikitaksorn over his efforts to evict them by burning their homes inside the park. Chaiwat claimed Porlajee had been arrested for illegally collecting wild honey and had been released with a warning before disappearing.
Porlajee’s burnt remains were discovered this year.
Sign up for Daily Newsletters
Copyright © 2019 The Washington Times, LLC.
Please read our comment policy before commenting.


?The
New
York
copyright
reserved
botanical
Garden
Cobaea
scandens
Cav
Determined
by
Alan
Prather,
Jun
1995
University
of
Texas,
TEX-LL
OEPAUW
UNIV
HERBARIUM
58658
HERBARIUM
T.
G.
YUNCKER
PLANTS
OF
JAMAICA
Parish:St.
Andrew
Bot.
Name:
Cobaea
scandens
Cav
TRUMAN
G.-YUNCKER
HERBARIUM
OF
DEPAUW
UNIVERSITY
(DPU)
PURCHASED
BY
NY
IN
1987
Vern.
Name:
Scandent
shrub;
flowers
greenish,
turning
dark
violet.
Climbing
in
shrubbeiy,
Cinchona.
Alt.
c.
5000
ft.
fiew
Yo/^
BOTANICAL
vGARDE^
New
York
Botanical
Garden
Collector.
T.
G.
YUNCKER
1624956
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


?BOTANICAL
GARDE**
NEW
YORK
BOTANICAL
GARDEN
01443629
FLORA
DE
LAS
ISLAS
VIRGENES
Departamento
de
Recursos
Naturales
San
Juan,
Puerto
Rico
District
of
Westend
SAINT
CROIX,
USVI
Itameli
a
obovata
(Lam.)
A
«DC.
Vicinity
of
Sandy
Point,
near
se&-level.
Tree
8
m.
tall,
locally
frequent}
corolla
whitish,
fragrant.
Coll:
George
R.
Proctor,
No.
40956
Fecha!
Dec*
30,
1984
01443629
Legend -
Level of confidence that token is an accurately-transcribed word
extremely low
very low
low
undetermined
medium
high
very high


This dataset was collected from the Twitter streaming API using tweepy.
Event detection: The top 4 ranked hashtags, their occurrences and the tweet that qualified as an event by our system will be presented. A combination of approaches was used for event detection: Terms were considered as living organisms, allowing us to sample a set of tweets as when each term was "most alive", while combining user reputation metrics to select a tweet from a reputable source.
Sentiment analysis: An Opinion-Mining tool implemented for the needs of a previous course was used to predict the polarity of the tweets related to the emerging event. An SVM classifier was trained with 25k labeled movie reviews, from the publicly known labeled dataset of imdb, in order to predict the polarity of the unlabeled dataset of the collected tweets.
Geolocation: For every city in our training corpus, we computed the frequency of its occurrences in user’s tweets and used this as the matching score of that user with that city. The city with the highest matching score is predicted as the location classification for that user.
President Trump announced that he will withdraw the United States from participation in the Paris climate accord https://t.co/SH3iThYXPR
— The New York Times (@nytimes) June 1, 2017
Twitter is still trying to figure out what #Covfefe means, thanks to Donald Trump https://t.co/0Reu3vqn2Z
— TIMES NOW (@TimesNow) May 31, 2017
@DavidCornDC shows how Trump took himself from an unwitting asset to a witting accomplice in #Trumprussia https://t.co/ouNtD1LZxY
— Malcolm Nance (@MalcolmNance) May 30, 2017


Star Wars' Daisy Ridley tells of ‘scary' stalker incident
Star Wars actress Daisy Ridley has told of the time she was followed by a “scary” fan into a hotel lobby.
Ridley, who has become a global star since making her Star Wars debut in 2015 film The Force Awakens, has also told of the impact her fame has had on her family, saying that she used to be more focused on protecting them rather than herself.
According to US magazine Marie Claire, Ridley, her mother and sister were followed in their car by a fan in New York in 2017.
Ridley is reported to have got her family members out of the car, but was then followed into her hotel lobby by the man.
She told the magazine: “He is a really big guy, so physically he’s scary, and I was alone and it was the middle of the night, so I started shouting at him because I was scared.”

Ridley said that her rise to fame has been “really hard” on her family, and that the attention on her has been “super invasive”, but that she was initially more focused on protecting her family than herself.
“I was so aware of how difficult it was for them, I wasn’t actually dealing with how difficult it was for me,” she said.
“We went to a wedding recently, and it was uncomfortable for me because people were really rude.
“And then, not only did I not have a good time, but then my mum was upset and then my sisters are upset. So it’s tricky.”
The film star added that now she treats herself “really nicely”.
The British actress, 27, plays lead character Rey in the Star Wars trilogy films, her most recent appearance being in 2017’s The Last Jedi.
She will next appear in her final stint in the franchise in The Rise Of Skywalker, out later this year.
The blockbuster, directed by JJ Abrams, will bring to an end the nine-part saga that began with the original Star Wars in 1977.
The film also stars John Boyega, Mark Hamill, Adam Driver and the late Carrie Fisher, who is appearing in unused footage from previous films.


Please enter text into the box below and we will count the multiplicity of each character!
Issues? Try the old version!


Sophomore - Problem Solver - Sports Enthusiast
For a copy of my resume, click here!
I grew up in Bombay, India, and lived in Singapore before pursuing my undergraduate studies in Vancouver, Canada. Having lived internationally has helped me become culturally literate, and more empathetic of others.
I am a huge foodie, and a big part of my student life is to stay fit despite eating all the food I like. I play competitive Cricket and recreational Soccer. I also play the guitar for stress relief. I love watching war and murder mystery movies/tv shows.


-->Insert title here
-->Insert subtitle here
-->Insert date here
-->Write something here
-->Write something here too
-->Lastly, write something here


{% extends "global/Page.html" %} {% load otree static %} {% block title %} Results {% endblock %} {% block content %}
| You are from the city: | {{ participant.vars.city }} |
| Your role in this study was: | {{ participant.vars.role_desc }} |
| You were matched with a participant from the city: | {{ participant.vars.partner_city }} |
| Their role in this study was: | {{ participant.vars.other_role_desc }} |
| Stage 1 Payoff | |
| For the participant from the city {{ participant.vars.partner_city }} your decision was: | {{ participant.vars.own_decision }} |
| The decision of your partner was: | {{ participant.vars.partner_decision }} |
| The decision of your partner was: | {{ participant.vars.partner_decision }} |
| For the participant from the city {{ participant.vars.partner_city }} your decision was: | {{ participant.vars.own_decision }} |
| Your payoff for the Stage 1 is: | {{ participant.vars.stage1payoff|c }} |
|---|---|
| Stage 2 Payoff | |
| Your guess about the decision of a participant from the city {{ participant.vars.partner_city }} was: | {{ participant.vars.guess }} |
| Their decision was: | {{ participant.vars.partner_decision }} |
| Your payoff for the Stage 2 is: | {{ participant.vars.stage2payoff|c }} |
| Your final payoff is: | {{ participant.payoff }} |


Chow: Four restoration projects in Penang Hill completed
GEORGE TOWN, Dec 9 — Four repair and stabilisation projects undertaken in Penang Hill following a landslide on November 4, 2017 have been completed, said Chief Minister Chow Kon Yeow.
He said the projects included the refurbishment and enhancement of three communal septic tanks, landscaping and establishment of “Pelawan” plant nursery as well as slope stabilisation works along the Upper Tunnel Road and downslope area of Sri Thirumurugan Temple, Penang Hill Mosque and Bel-Retiro bungalow.
According to him, the overall cost for the four projects was about RM17.64 million.
“The Penang Hill Corporation (PHC) will continue their efforts to carry out restoration, rehabilitation and rebuilding works at other affected areas caused by the tropical storm in November 2017, to ensure Penang Hill as a safe place for all our guests to enjoy,” he said in a press conference after a project site visit at Penang Hill here today.
Meanwhile, PHC general manager Datuk Cheok Lay Leng, who also attended the press conference, said the restoration works would focus on critical infrastructures such as tourism sites and residential areas.
He said that due to the constraints of logistics, limited accessibility and construction challenges at hillslope areas, the restoration and rehabilitation works were required to be carried out in stages to ensure smooth and safe execution.
“We are expecting to carry out the restoration works of the upper tunnel waiting station by mid-2020, which costs about a few million ringgit,” he said.
He added that Penang Hill is expected to attract around 1.8 million visitors this year, compared to 1.72 million visitors last year. — Bernama


Index of all items in ${docTitle}
Index of all items starting with '${curchar}' in "${docTitle}"
All items:
${char}
${indexHtml}


X-Space, a Greenway Project in Dubai Wins the Grand WAFX 2019 Prize
- Written by Christele Harrouk
- about 12 hours
Presented to projects that anticipate and address future challenges, the WAFX Award celebrates the “most forward-looking architectural concepts”. X-Space, an urban fabric regeneration project in Dubai, winner of the Smart Cities Category was selected to take on the overall WAFX 2019 prize.
Designed by Architects Mouaz Abouzaid and Dima Faraj, X-space or the urban regeneration project and greenway for Dubai, brings the city and the people together, by reshaping the main highway, the Sheikh Zayed Road, once a barrier for the fabric of the city. In fact, the project generates public and green spaces with a concept inspired by the movement of the desert dunes.
The philosophy behind X-Space is to develop an urban fabric focused on sharing, integration, and tolerance for human-scale urbanism, a place where people can live, work and play. Such urban design should connect spaces with people and cultural practices at the heart of Sheikh Zayed Road with rich visual variety, density, connected network systems, and human activities. -- Mouaz Abouzaid, architect
Giving back the urban space to the community, the project aims to create a new urban living room, based along a 1km section of the emirate’s main highway. The human-scale intervention “is geared towards pedestrians rather than vehicles and is designed for all cultures to congregate”. Encouraging diversity, integration, and tolerance, X-space will reduce the reliance on cars and promote a more sustainable way of life.
Ten innovative approaches have already been chosen as winners in their categories, ranging from health to cultural identity and carbon reduction. The winning projects will be on display at the World Architectural Festival in Amsterdam, from the 4th till the 6th of December 2019.


Windows 10 x64 (18363.628)
wil_details_StagingConfigFeatureFields
wil_details_StagingConfigFeatureFields_None = 0n0
wil_details_StagingConfigFeatureFields_ServiceState = 0n1
wil_details_StagingConfigFeatureFields_UserState = 0n2
wil_details_StagingConfigFeatureFields_TestState = 0n4
wil_details_StagingConfigFeatureFields_Variant = 0n8


DSGE Modeling App
About
Contact
×
Close
About
×
Close
Contact
Instructions
Parameters
Initial Conditions
Shocks
Results
Console
Actions
Run/save
Run simulation
Save this scenario
Download results
Load a scenario
From file
Pre-loaded?
Instructions
Parameters
Click on a parameter for more information.
Initial Conditions
Click on a parameter for more information.
Shocks
Results
Console


Welcome to my site.
This website will contain projects completed for the Web Design part of Computer Science 1 at CMIS.
Lists and Links
In this assignment, I created a new folder called "listsandlinks" in my repository folder and added links to it so that I can move through files.
- Create a new folder called "listsandlinks" in your repository folder. Inside listsandlinks create a file called "index.html" and a file called "main.css"
- In index.html create an ordered list of step by step instructions to create a new webpage on the production server.
- Also create an unordered list of 5 or more links to websites with useful webdesign related information.
- In the nav section, create an unordered list of links with a link back to your main index page.
- In your main index.html file in public_html, add an unordered list of links to the nav section with a link to "listsandlinks".
- In your old index.html, add an article with a heading and a paragraph description of this assignment. Also add an unordered list that contains this list of requirements.
- Turn in your work.
Tables
In this assignment, I created a new folder called "tables" in my repository folder and added tables.
- Create a new folder in your repository called "tables"
- In the "tables" folder, create a new file called from your template "index.html"
- Be sure to use thead, tbody, and tfoot elements in your tables.
- Add html code to recreate the webpage below.
- second table will require the use of the colspan attribute.
- third table will require the use of the rowspan attribute.
- In your repository index.html file, add an article with a heading, paragraph description and this list of requirements. Also add a link to the tables/index.html file.
- Add a link from lists and links to this assignment as well.
- Validate your code.
- Turn it in.


{# Render breadcrumb path bar in Bootstrap 3 style. These are used in the default admin interface, but you can use them on any traverse context. See * :py:mod:`websauna.system.core.breadcrumbs` We also add Google SEO breadcrumbs metadata as per * https://developers.google.com/search/docs/data-types/breadcrumbs #} {% if breadcrumbs %}
{% endif %}


This driver can connect to Planet Labs Mosaics API. GDAL/OGR must be built with Curl support in order for the PLMosaic driver to be compiled.
The driver supports listing mosaics and reading them. Mosaics are accessed at their highest resolution. Mosaics are typically composed of quads of 4096x4096 pixels.
For mosaics of type Byte, overviews are available by using the tile API. For other data types, there is no support for overviews, so requests that involve downsampling may take a long time to complete.
PLMosaic:[options]
Additional optional parameters can be specified after the ':' sign. Currently the following one is supported :
If no mosaic parameter is supplied, the list of available mosaics will be returned as subdatasets. If only one mosaic is available, it will be directly opened.
The following open options are available : API_KEY, MOSAIC, CACHE_PATH, TRUST_CACHE and USE_TILES. They have the same semantics as the above describe parameters of same name.
The special Pixel_{x}_{y} metadata item of the LocationInfo metadata domain, where x is the column and y is the line in the mosaic, can be queried to get information about the scenes that compose the underneath quad. This is the syntax used by the gdallocationinfo utility (see RFC 32)
Below an example of the return :
<LocationInfo> <Scenes> <Scene> <link>https://api.planet.com/data/v1/item-types/PSScene3Band/items/20161025_000336_0e19</link> </Scene> <Scene> <link>https://api.planet.com/data/v1/item-types/PSScene3Band/items/20161119_000453_0e14</link> </Scene> <Scene> <link>https://api.planet.com/data/v1/item-types/PSScene3Band/items/20161010_000309_0e26</link> </Scene> <Scene> <link>https://api.planet.com/data/v1/item-types/PSScene3Band/items/20161119_000452_0e14</link> </Scene> </Scenes> </LocationInfo>
gdalinfo "PLMosaic:" -oo API_KEY=some_valueor
gdalinfo "PLMosaic:api_key=some_value"or
gdalinfo "PLMosaic:" --config PL_API_KEY some_valuereturns (in case of multiple mosaics):
Driver: PLMOSAIC/Planet Labs Mosaics API Files: none associated Size is 512, 512 Coordinate System is `' Image Structure Metadata: INTERLEAVE=PIXEL Subdatasets: SUBDATASET_1_NAME=PLMOSAIC:mosaic=global_quarterly_2017q1_mosaic SUBDATASET_1_DESC=Mosaic global_quarterly_2017q1_mosaic ... Corner Coordinates: Upper Left ( 0.0, 0.0) Lower Left ( 0.0, 512.0) Upper Right ( 512.0, 0.0) Lower Right ( 512.0, 512.0) Center ( 256.0, 256.0)
gdalinfo "PLMosaic:mosaic=global_quarterly_2017q1_mosaic" -oo API_KEY=some_valuereturns:
Driver: PLMOSAIC/Planet Labs Mosaics API Files: none associated Size is 8388608, 4427776 Coordinate System is: PROJCS["WGS 84 / Pseudo-Mercator", GEOGCS["WGS 84", DATUM["WGS_1984", SPHEROID["WGS 84",6378137,298.257223563, AUTHORITY["EPSG","7030"]], AUTHORITY["EPSG","6326"]], PRIMEM["Greenwich",0, AUTHORITY["EPSG","8901"]], UNIT["degree",0.0174532925199433, AUTHORITY["EPSG","9122"]], AUTHORITY["EPSG","4326"]], PROJECTION["Mercator_1SP"], PARAMETER["central_meridian",0], PARAMETER["scale_factor",1], PARAMETER["false_easting",0], PARAMETER["false_northing",0], UNIT["metre",1, AUTHORITY["EPSG","9001"]], AXIS["X",EAST], AXIS["Y",NORTH], EXTENSION["PROJ4","+proj=merc +a=6378137 +b=6378137 +lat_ts=0.0 +lon_0=0.0 +x_0=0.0 +y_0=0 +k=1.0 +units=m +nadgrids=@null +wktext +no_defs"], AUTHORITY["EPSG","3857"]] Origin = (-20037508.342789243906736,13384429.400847502052784) Pixel Size = (4.777314267823516,-4.777314267823516) Metadata: FIRST_ACQUIRED=2017-01-01T00:00:00.000Z LAST_ACQUIRED=2017-04-01T00:00:00.000Z NAME=global_quarterly_2017q1_mosaic Image Structure Metadata: INTERLEAVE=PIXEL Corner Coordinates: Upper Left (-20037508.343,13384429.401) (180d 0' 0.00"W, 76d 0'57.94"N) Lower Left (-20037508.343,-7768448.059) (180d 0' 0.00"W, 57d 2'26.63"S) Upper Right (20037508.343,13384429.401) (180d 0' 0.00"E, 76d 0'57.94"N) Lower Right (20037508.343,-7768448.059) (180d 0' 0.00"E, 57d 2'26.63"S) Center ( 0.000, 2807990.671) ( 0d 0' 0.01"E, 24d26'49.74"N) Band 1 Block=256x256 Type=Byte, ColorInterp=Red Overviews: 4194304x4194304, ..., 256x256 Mask Flags: PER_DATASET ALPHA Overviews of mask band: Overviews: 4194304x4194304, ..., 256x256 Band 2 Block=256x256 Type=Byte, ColorInterp=Green Overviews: 4194304x4194304, ..., 256x256 Mask Flags: PER_DATASET ALPHA Overviews of mask band: Overviews: 4194304x4194304, ..., 256x256 Band 3 Block=256x256 Type=Byte, ColorInterp=Blue Overviews: 4194304x4194304, ..., 256x256 Mask Flags: PER_DATASET ALPHA Overviews of mask band: Overviews: 4194304x4194304, ..., 256x256 Band 4 Block=256x256 Type=Byte, ColorInterp=Alpha Overviews: 4194304x4194304, ..., 256x256


An aggregation search uses combinations of filters and query search to return an exact answer. Aggregations are useful for building applications, because you can use them to build lists, tables, and time series. For a full list of possible aggregrations, see the Query reference.
A comma-separated list of collection IDs to be queried against.
Number of documents to return.
When specified, duplicate results based on the field specified are removed from the returned results. Duplicate comparison is limited to the current query only, offset
is not considered. This parameter is currently Beta functionality.
The ID of the environment.
A cacheable query that limits the documents returned to exclude any documents that don't mention the query content. Filter searches are better for metadata type searches and when you are trying to get a sense of concepts in the data set.
When true a highlight field is returned for each result which contains the fields that match the query with
tags around the matching query terms. Defaults to false.
A natural language query that returns relevant documents by utilizing training data and natural language understanding. You cannot use natural_language_query
and query
at the same time.
The number of query results to skip at the beginning. For example, if the total number of results that are returned is 10, and the offset is 8, it returns the last two results.
A query search returns all documents in your data set with full enrichments and full text, but with the most relevant documents listed first. Use a query search when you want to find the most relevant search results. You cannot use natural_language_query
and query
at the same time.
A comma separated list of the portion of the document hierarchy to return.
When true
, results are returned based on their similarity to the document IDs specified in the similar.document_ids
parameter. The default is false
.
A comma-separated list of document IDs that will be used to find similar documents. Note: If the natural_language_query
parameter is also specified, it will be used to expand the scope of the document similarity search to include the natural language query. Other query parameters, such as filter
and query
are subsequently applied and reduce the query scope.
A comma-separated list of field names that will be used as a basis for comparison to identify similar documents. If not specified, the entire document is used for comparison.
A comma separated list of fields in the document to sort on. You can optionally specify a sort direction by prefixing the field with -
for descending or +
for ascending. Ascending is the default sort direction if no prefix is specified.
Generated using TypeDoc
Parameters for the
federatedQueryNotices
operation.


up
down
Ozolio - Webcam Hosting
Sullivan Construction Inc.
Maui Stables
Code Rebel 3.0
SecurityPro Shop


com.intel.hadoop.graphbuilder.graph.glgraph
Class EdgeList
java.lang.Object
com.intel.hadoop.graphbuilder.graph.glgraph.EdgeList
- All Implemented Interfaces:
- java.lang.Iterable<EdgeType>
public class EdgeList
- extends java.lang.Object
- implements java.lang.Iterable<EdgeType>
A lazy list representation of a collection of edges that satisfy a direction
property with respect to a center vertex. In other words, given a center
vertex v, the list represents either the incoming or outgoing edges of v
depending on the direction variable dir
. The list has a pointer to an
SparseGraphStruct
object as its backend storage. The element of the
list is an EdgeType
object which contains lazy pointers to the
storage used for obtaining the actual data when evaluated.
- See Also:
SparseGraphStruct
,
EdgeType
|
Constructor Summary |
EdgeList()
Default constructor. |
EdgeList(int vid,
SparseGraphStruct store,
EdgeType.DIR dir)
Construct an EdgeList containing all edges in the SparseGraphStruct
that are incoming (outgoing) edges with respect to the given vertex. |
| Methods inherited from class java.lang.Object |
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
EdgeList
public EdgeList()
- Default constructor. Creates an empty edge list.
EdgeList
public EdgeList(int vid,
SparseGraphStruct store,
EdgeType.DIR dir)
- Construct an EdgeList containing all edges in the
SparseGraphStruct
that are incoming (outgoing) edges with respect to the given vertex. The
direction is determined by the parameter dir
.
- Parameters:
vid
- the center vertex id.store
- the backend storage of all edges.dir
- the direction of edges with respect to the center vertex.
size
public int size()
- Returns:
- the size of the list.
isEmpty
public boolean isEmpty()
- Returns:
- wheter the list is empty.
iterator
public java.util.Iterator<EdgeType> iterator()
- Specified by:
iterator
in interface java.lang.Iterable<EdgeType>


Create an account
account_circle
Name *
email
Email *
https
Password *
Repeat password *
phone
Telephone
cake
Birthday
work
Company
Job title
Submit
send


The BeanShell is an interactive Java shell that can be used to execute BeanShell scripts. These scripts are a simplified form of Java that use many elements from Java syntax, but in a simpler scripting format. All Java code is also valid BeanShell code. BeanShell integration in OWASP ZAP enables you to write scripts using the ZAP functions and data set. This can be a very powerful feature for analyzing web applications.
The console is started from the Tools menu, and contains a split screen where the top half is the interactive BeanShell console and the bottom half is a simple text editor. For complex scripts, you're encouraged to use a Java editor. Scripts can be loaded, saved and evaluated from the editor.
When the BeanShell starts a number of objects from ZAP are available for use, namely:
Notice that the BeanShell is loosely typed. Therefore, it is not necessary to declare variables before using them – this makes scripts a bit more concise than regular Java. But of course, if you did want to define the type you can.
Let's start with something useful and typical: Iterate through all the site nodes and check for the existence of a file. A script has already been created that accomplishes this, choose Load and select the example.tree.bsh file.
import org.apache.commons.httpclient.URI; import org.parosproxy.paros.network.HttpMessage; import org.parosproxy.paros.model.*; Tree () { find (SiteNode node, String resource) { if (node == null) return; ref = node.getHistoryReference(); if ((ref != null) && (!node.isLeaf())) { checkExists(ref, resource); } for (i=0;i<node.getChildCount();i++) { try { find (node.getChildAt(i), resource); } catch (Exception e) { e.printStackTrace(); } } } checkExists(ref, resource) { u = ref.getHttpMessage().getRequestHeader().getURI().toString() + "/" + resource; msg = ref.getHttpMessage(); msg.getRequestHeader().setURI(new URI(u)); sender.sendAndReceive(msg, true); if (msg.getResponseHeader().getStatusCode() == 200) { print("Found: "+msg.getRequestHeader().getURI().toString()); } } return this; }
Before clicking Evaluate, first browse to a site through ZAP to populate the tree:
Now click on evaluate to execute the script that's in the editor. If there are no errors, then you can now start using the object defined in the script by issuing these commands:
t = Tree();
This constructs a new Tree object and assigns a reference to t.
t.find(sites.getRoot(), "index.html");
Call the find method on t, which takes a SiteNode as the first argument and a resource to find as the second. In this case, the method will iterate through all the nodes in the tree, because we started at the root, and will find index.html files.
Instead of iterating through all the nodes, we could also choose to start a specific node by using the findChild method.
This should give you some idea of the power of the BeanShell in ZAP. But to fully exploit it, you'll need to familiarize yourself with the internal API and the BeanShell's features. The BeanShell has been setup so as to allow full access to all internal objects and methods – even private ones.
In the next example, we create and send an HTTP request directly in the interactive console:
TBD
To fully utilize the power of the BeanShell, you should familiarize yourself with ZAP's internals. The sender object is the same instance as is used by the Manual Request Editor and will therefore automatically use proxy settings set in the ZAP configuration.
TBD
Use the unset(String) command to unset any declared variables, methods or objects. This is useful if you want to replace a method declaration in the current namespace. Note that the command takes a String argument, not an Object, so to unset the t object we used above, it should be: unset("t"); and not unset(t);
| Top level Tools menu | 'BeanShell Console' menu item |
| UI Overview | for an overview of the user interface | |
| Dialogs | for details of the dialogs or popups |


Bank Account Management
Create a new Account
New Account Name:
Enter Pin Number:
Enter Initial Deposit:
Create New Account
Make a Transaction
Account Number:
Enter Pin Number:
Amount (type 'all' to withdraw all available funds)
Select Time:
Withdraw
Deposit
Balance
Confirm Transaction
Cancel


---
layout: post
title: 'Agile development: the basics of Scrum'
date: '2012-04-04T13:04:00.002-04:00'
author: ricleal
tags:
- Agile
comments: true
---
Another agile methodology: Mixed skills team, tasks get priorities, priorities are sorted, tasks get points, tasks
are grouped according to points (Sprints), stand up daily meetings, someone make sure everything is "Done" and we
have: SCRUM!
I would make a few simplifications in real world, but I like very much the concept.


ML.Classification¶
-
class
ddf_library.functions.ml.classification.
GaussianNB
¶ Bases:
ddf_library.bases.ddf_model.ModelDDF
The Naive Bayes algorithm is an intuitive method that uses the probabilities of each attribute belonged to each class to make a prediction. It is a supervised learning approach that you would come up with if you wanted to model a predictive probabilistically modeling problem.
Naive bayes simplifies the calculation of probabilities by assuming that the probability of each attribute belonging to a given class value is independent of all other attributes. The probability of a class value given a value of an attribute is called the conditional probability. By multiplying the conditional probabilities together for each attribute for a given class value, we have the probability of a data instance belonging to that class.
To make a prediction we can calculate probabilities of the instance belonged to each class and select the class value with the highest probability.
Example: >>> cls = GaussianNB().fit(ddf1, feature_col=['col1', 'col2'], >>> label_col='label') >>> ddf2 = cls.transform(ddf1, pred_col='prediction')
-
check_fitted_model
()¶
-
fit
(data, feature_col, label_col)¶ Fit the model.
Parameters: - data – DDF
- feature_col – Feature column name;
- label_col – Label column name;
Returns: trained model
-
fit_transform
(data, feature_col, label_col, pred_col='prediction_GaussianNB')¶ Fit the model and transform.
Parameters: - data – DDF
- feature_col – Feature column name;
- label_col – Label column name;
- pred_col – Output prediction name (default, ‘prediction_GaussianNB’);
Returns: DDF
-
load_model
(filepath)¶ Load a machine learning model from a binary file in a storage.
Parameters: filepath – The absolute path name; Returns: self Example: >>> ml_model = Kmeans().load_model('hdfs://localhost:9000/model')
-
save_model
(filepath, overwrite=True)¶ Save a machine learning model as a binary file in a storage.
Parameters: - filepath – The output absolute path name;
- overwrite – Overwrite if file already exists (default, True);
Returns: self
Example: >>> cls = KMeans().fit(dataset, input_col=['col1', 'col2']) >>> cls.save_model('hdfs://localhost:9000/trained_model')
-
transform
(data, feature_col=None, pred_col='prediction_GaussianNB')¶ Parameters: - data – DDF
- feature_col – Feature column name;
- pred_col – Output prediction name (default, ‘prediction_GaussianNB’);
Returns: DDF
-
-
class
ddf_library.functions.ml.classification.
KNearestNeighbors
(k=3)¶ Bases:
ddf_library.bases.ddf_model.ModelDDF
K-Nearest Neighbor is a algorithm used that can be used for both classification and regression predictive problems. In a classification, the algorithm computes from a simple majority vote of the K nearest neighbors of each point present in the training set. The choice of the parameter K is very crucial in this algorithm, and depends on data set. However, values of one or tree is more common.
Example: >>> knn = KNearestNeighbors(k=1).fit(ddf1, feature_col=['col1', 'col2'], >>> label_col='label') >>> ddf2 = knn.transform(ddf1, pred_col='prediction')
Parameters: k – Number of nearest neighbors to majority vote; -
check_fitted_model
()¶
-
fit
(data, feature_col, label_col)¶ Fit the model.
Parameters: - data – DDF
- feature_col – Feature column name;
- label_col – Label column name;
Returns: trained model
-
fit_transform
(data, feature_col, label_col, pred_col='prediction_kNN')¶ Fit the model and transform.
Parameters: - data – DDF
- feature_col – Feature column name;
- label_col – Label column name;
- pred_col – Output prediction name (default, ‘prediction_kNN’);
Returns: DDF
-
load_model
(filepath)¶ Load a machine learning model from a binary file in a storage.
Parameters: filepath – The absolute path name; Returns: self Example: >>> ml_model = Kmeans().load_model('hdfs://localhost:9000/model')
-
save_model
(filepath, overwrite=True)¶ Save a machine learning model as a binary file in a storage.
Parameters: - filepath – The output absolute path name;
- overwrite – Overwrite if file already exists (default, True);
Returns: self
Example: >>> cls = KMeans().fit(dataset, input_col=['col1', 'col2']) >>> cls.save_model('hdfs://localhost:9000/trained_model')
-
transform
(data, feature_col=None, pred_col='prediction_kNN')¶ Parameters: - data – DDF
- feature_col – Feature column name
- pred_col – Output prediction name (default, ‘prediction_kNN’);
Returns: DDF
-
-
class
ddf_library.functions.ml.classification.
LogisticRegression
(alpha=0.1, regularization=0.1, max_iter=100, threshold=0.01)¶ Bases:
ddf_library.bases.ddf_model.ModelDDF
Logistic regression is named for the function used at the core of the method, the logistic function. It is the go-to method for binary classification problems (problems with two class values).
The logistic function, also called the sigmoid function was developed by statisticians to describe properties of population growth in ecology, rising quickly and maxing out at the carrying capacity of the environment. It’s an S-shaped curve that can take any real-valued number and map it into a value between 0 and 1, but never exactly at those limits.
This implementation uses a Gradient Ascent (a variant of the gradient descent). Gradient ascent is the same as gradient descent, except I’m maximizing instead of minimizing a function.
Example: >>> cls = LogisticRegression() >>> .fit(ddf1, feature_col=['col1', 'col2'], label_col='label') >>> ddf2 = cls.transform(ddf1, pred_col='prediction')
Parameters: - alpha – Learning rate parameter (default, 0.1);
- regularization – Regularization parameter (default, 0.1);
- max_iter – Maximum number of iterations (default, 100);
- threshold – Tolerance for stopping criterion (default, 0.01);
-
check_fitted_model
()¶
-
fit
(data, feature_col, label_col)¶ Fit the model.
Parameters: - data – DDF
- feature_col – Feature column name;
- label_col – Label column name;
Returns: trained model
-
fit_transform
(data, feature_col, label_col, pred_col='prediction_LogReg')¶ Fit the model and transform.
Parameters: - data – DDF
- feature_col – Feature column name;
- label_col – Label column name;
- pred_col – Output prediction name (default, ‘prediction_LogReg’);
Returns: DDF
-
load_model
(filepath)¶ Load a machine learning model from a binary file in a storage.
Parameters: filepath – The absolute path name; Returns: self Example: >>> ml_model = Kmeans().load_model('hdfs://localhost:9000/model')
-
save_model
(filepath, overwrite=True)¶ Save a machine learning model as a binary file in a storage.
Parameters: - filepath – The output absolute path name;
- overwrite – Overwrite if file already exists (default, True);
Returns: self
Example: >>> cls = KMeans().fit(dataset, input_col=['col1', 'col2']) >>> cls.save_model('hdfs://localhost:9000/trained_model')
-
transform
(data, feature_col=None, pred_col='prediction_LogReg')¶ Parameters: - data – DDF
- feature_col – Feature column name;
- pred_col – Output prediction name (default, ‘prediction_LogReg’);
Returns: DDF
-
class
ddf_library.functions.ml.classification.
SVM
(coef_lambda=0.1, coef_lr=0.01, threshold=0.001, max_iter=100, penalty='l2')¶ Bases:
ddf_library.bases.ddf_model.ModelDDF
Support vector machines (SVM) is a supervised learning model used for binary classification. Given a set of training examples, each marked as belonging to one or the other of two categories, a SVM training algorithm builds a model that assigns new examples to one category or the other, making it a non-probabilistic binary linear classifier.
An SVM model is a representation of the examples as points in space, mapped so that the examples of the separate categories are divided by a clear gap that is as wide as possible. New examples are then mapped into that same space and predicted to belong to a category based on which side of the gap they fall. This algorithm is effective in high dimensional spaces and it is still effective in cases where number of dimensions is greater than the number of samples.
The algorithm reads a data set composed by labels (-1 or 1) and features (numeric fields).
Example: >>> cls = SVM(max_iter=10).fit(ddf1, feature_col=['col1', 'col2'], >>> label_col='label') >>> ddf2 = cls.transform(ddf1, pred_col='prediction')
Parameters: - coef_lambda – Regularization parameter (default, 0.1);
- coef_lr – Learning rate parameter (default, 0.1);
- threshold – Tolerance for stopping criterion (default, 0.001);
- max_iter – Number max of iterations (default, 100);
- penalty – Apply ‘l2’ or ‘l1’ penalization (default, ‘l2’)
-
check_fitted_model
()¶
-
fit
(data, feature_col, label_col)¶ Fit the model.
Parameters: - data – DDF
- feature_col – Feature column name;
- label_col – Label column name;
Returns: trained model
-
fit_transform
(data, feature_col, label_col, pred_col='prediction_SVM')¶ Fit the model and transform.
Parameters: - data – DDF
- feature_col – Feature column name;
- label_col – Label column name;
- pred_col – Output prediction name (default, ‘prediction_SVM’);
Returns: DDF
-
load_model
(filepath)¶ Load a machine learning model from a binary file in a storage.
Parameters: filepath – The absolute path name; Returns: self Example: >>> ml_model = Kmeans().load_model('hdfs://localhost:9000/model')
-
save_model
(filepath, overwrite=True)¶ Save a machine learning model as a binary file in a storage.
Parameters: - filepath – The output absolute path name;
- overwrite – Overwrite if file already exists (default, True);
Returns: self
Example: >>> cls = KMeans().fit(dataset, input_col=['col1', 'col2']) >>> cls.save_model('hdfs://localhost:9000/trained_model')
-
transform
(data, feature_col=None, pred_col='prediction_SVM')¶ Parameters: - data – DDF
- feature_col – Feature column name;
- pred_col – Output prediction name (default, ‘prediction_SVM’);
Returns: DDF


Gecode::Int::Distinct::CombPtrFlag< T > Class Template Reference
List of all members.Detailed Description
template<class T>
class Gecode::Int::Distinct::CombPtrFlag< T >
Class for combining two pointers with a flag.
When one pointer is given, this other can be retrieved.
Definition at line 39 of file dom.icc.
Public Member Functions | |
| CombPtrFlag (T *p1, T *p2) | |
| Initialize with pointer p1 and p2. | |
| void | init (T *p1, T *p2) |
| Initialize with pointer p1 and p2. | |
| T * | ptr (T *p) const |
| Return the other pointer when p is given. | |
| int | is_set (void) const |
| Check whether flag is set. | |
| void | set (void) |
| Set flag. | |
| void | unset (void) |
| Clear flag. |
Constructor & Destructor Documentation
|
|
Initialize with pointer p1 and p2.
Definition at line 26 of file combptr.icc. |
Member Function Documentation
|
|
Initialize with pointer p1 and p2.
Definition at line 55 of file combptr.icc. |
|
|
Return the other pointer when p is given.
Definition at line 31 of file combptr.icc. |
|
|
Check whether flag is set.
Definition at line 37 of file combptr.icc. |
|
|
Set flag.
Definition at line 43 of file combptr.icc. |
|
|
Clear flag.
Definition at line 49 of file combptr.icc. |
The documentation for this class was generated from the following files:
- gecode/int/distinct/dom.icc (Revision: 3768)
- gecode/int/distinct/combptr.icc (Revision: 2076)


@* * Copyright 2023 HM Revenue & Customs * * Licensed under the Apache License, Version 2.0 (the "License"); * you may not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. *@ @import config.FrontendAppConfig @import viewmodels.AnswerSection @this( layout: views.LayoutProvider, formWithCSRF: FormWithCSRF, submitButton: playComponents.submit_button, govukSummaryList : GovukSummaryList ) @( appConfig: FrontendAppConfig, answerSections: Seq[AnswerSection] )( implicit request: Request[_], messages: Messages) @layout( pageTitle = messages("checkYourAnswers.title"), showBackLink = false ) {
@messages("checkYourAnswers.declaration")
@formWithCSRF(action = controllers.routes.CheckYourAnswersController.onSubmit) { @submitButton("checkYourAnswers.acceptAndSend") } }


| Vendor Name | SNC-Lavalin Defence Programs Inc. |
|---|---|
| Reference Number | W8483-106786/001/ISM |
| Contract Date | 14-10-2014 |
| Description of Work | Marine Systems and Engineering |
| Delivery Date | 25-9-2015 |
| Contract Value | $22,900,000.00 |
| Comments | This item contains one or more amendments. This contract was competitively sourced. |
| Additional Comments |


The move to Asynchronous JavaScript and XML (AJAX-style) web pages led to screen readers losing ground with respect to making interactive web content accessible — with JavaScript code now defining the behavior of elements on the page, screen readers could no longer infer the interaction semantics of user interface controls on the page just from the HTML. Access to Rich Internet Applications (W3C ARIA [13, 16]) helps adaptive technologies regain much of this lost ground by adding the following authoring features to HTML content:
W3C ARIA is now a Candidate Recommendation (CR) and is supported to varying degrees by today’s modern browser and screen reader combinations. ChromeVox implements a large percentage of the ARIA specification, and it is our goal to implement all aspects of the final W3C Recommendation. Below, we illustrate the differences that arise when implementing W3C ARIA within a screen reader built as a web application versus a traditional screen reader. For a high-level overview, see figures fig. 3 and fig. 4


These metrics are not meant to be used as law but are a relative measure of the quality and cost of a program
Back to Overview| Metric | Value | Description |
| style="color: #f00;"<% } if(report.maintainability >= 80) { %> style="color: #0f0;"<% } %>>Maintainability | style="color: #f00;"<% } if(report.maintainability >= 80) { %> style="color: #0f0;"<% } %>><%- report.maintainability.toFixed(2) %> | This is the relative maintainability of the file on a scale of 0-100. Higher is better. |
| Difficulty | <%- report.aggregate.halstead.difficulty.toFixed(2) %> | This is a measure of how difficult it is to understand the code. Lower is better. |
| = 10) { %> style="color: #f00;"<% } if(report.aggregate.cyclomatic <= 2) { %> style="color: #0f0;"<% } %>>Cyclomatic Complexity | = 10) { %> style="color: #f00;"<% } if(report.aggregate.cyclomatic <= 2) { %> style="color: #0f0;"<% } %>><%- report.aggregate.cyclomatic %> | This is how complex the code is based on the number of paths through the code. Lower is better |
| Cyclomatic Density | <%- report.aggregate.cyclomaticDensity.toFixed(2) %> | This is a re-expression of the above metric as a percentage based on the lines of code. Lower is better. |
| Effort | <%- report.aggregate.halstead.effort.toFixed(2) %> | This is the amount of effort needed to write the code based on it's difficulty and length |
| Time | <%- (report.aggregate.halstead.time / 60 / 60).toFixed(2) %> Hours | This is the estimated amount of time needed to write the file based on the effort required. |
| Cost | $<%- (report.aggregate.halstead.time * 0.013).toFixed(2) %> | This is the estimated cost to develop the file based on the time needed to develop it. |
| = 2) { %> style="color: #f00;"<% } if(report.aggregate.halstead.bugs <= 0.5) { %> style="color: #0f0;"<% } %>>Bugs | = 2) { %> style="color: #f00;"<% } if(report.aggregate.halstead.bugs <= 0.5) { %> style="color: #0f0;"<% } %>><%- report.aggregate.halstead.bugs.toFixed(2) %> | This is the estimated number of bugs in the file. |
| = 200) { %> style="color: #f00;"<% } %>>Logical SLOC | = 200) { %> style="color: #f00;"<% } %>><%- report.aggregate.sloc.logical %> | This is the number of lines of software that are considered logic. |
| Physical SLOC | <%- report.aggregate.sloc.physical %> | This is the total lines of source code including up to 25% whitespace, but ignoring excessive formatting. |
Dependencies:
| Name | Line # | Type |
| <%- dep.path %> | <%- dep.line %> | <%- dep.type %> |
Functions:
<% _.forEach(report.functions, function(func) { %>| <%- func.name %> | ||
| Metric | Value | Description |
| Line # | <%- func.line %> | The line the function appears on. |
| 4) { %> style="color: #f00;"<% } %>>Parameters | 4) { %> style="color: #f00;"<% } %>><%- func.params %> | The number of parameters the function takes. |
| Difficulty | <%- func.halstead.difficulty.toFixed(2) %> | This is a measure of how difficult the method is to understand. Lower is better. |
| = 10) { %> style="color: #f00;"<% } if(func.cyclomatic <= 2) { %> style="color: #0f0;"<% } %>>Cyclomatic Complexity | = 10) { %> style="color: #f00;"<% } if(func.cyclomatic <= 2) { %> style="color: #0f0;"<% } %>><%- func.cyclomatic %> | This is how complex the method is based on the number of paths through the code. Lower is better. |
| Cyclomatic Density | <%- (func.cyclomaticDensity || 0.00).toFixed(2) %> | This is a re-expression of the above metric as a percentage based on the lines of code. Lower is better. |
| Effort | <%- func.halstead.effort.toFixed(2) %> | This is the amount of effort needed to write the code based on it's difficulty and length. |
| Time | <%- (func.halstead.time / 60).toFixed(2) %> Minutes | This is the estimated amount of time needed to write the method based on the effort required. |
| Cost | $<%- (func.halstead.time * 0.13).toFixed(2) %> | This is the estimated cost to develop the file based on the time needed to develop it. |
| = 1) { %> style="color: #f00;"<% } if(func.halstead.bugs <= 0.3) { %> style="color: #0f0;"<% } %>>Bugs | = 1) { %> style="color: #f00;"<% } if(func.halstead.bugs <= 0.3) { %> style="color: #0f0;"<% } %>><%- func.halstead.bugs.toFixed(2) %> | This is the estimated number of bugs in the method. |
| = 20) { %> style="color: #f00;"<% } %>>Logical SLOC | = 20) { %> style="color: #f00;"<% } %>><%- func.sloc.logical %> | This is the number of lines of software that are considered logic. |
| Physical SLOC | <%- func.sloc.physical %> | This is the total lines of source code including up to 25% whitespace, but ignoring excessive formatting. |


Pat's Salmon Cookie Stores
Merchandise
About Us
Sales
5 locations serving you! More coming soon.
<EMAIL_ADDRESS>|<PHONE_NUMBER>


Use the WLM_GET_WORKLOAD_STATS_V97table function (or WLM_GET_WORKLOAD_STATS if you are on a DB2 9.5 database) again to determine which workload the applications are being associated with.
Note this time both workload definitions have a workload occurrence run, once for each script.
You may or may not see a workload occurrence completed for the SYSDEFAULTUSERWORKLOAD depending on whether workload occurrence over which the call to the WLM_COLLECT_STATS procedure was submitted is closed before the statistics are collected.


Kogi Election: I-G says Police will be professional
by The Eagle OnlineThe Inspector-General of Police, Mohammed Adamu on Tuesday assured Nigerians that the police would exhibit professionalism during the November 16 governorship election in Kogi.
Adamu stated this in Lokoja during a stakeholders meeting in preparation for the election.
He said that the police and other security agencies were fully prepared to ensure adequate security during the poll.
The police chief said that the security agencies would ensure that all political parties were treated equally in the course of the exercise.
He said that collation centres would be heavily fortified to avoid a disruption of the process.
“On our part, the police and other security agencies are assuring people of the state that we will be professional in providing security during the election.
“Polling units, materials and election officers will be given adequate security, we shall ensure that nobody is molested,” he said.
The inspector general, however, cautioned the people against acts capable of derailing the electoral process, saying, “We will not tolerate anti-democracy attitudes”.
According to him, the security agencies will rise up against politicians who indulge in vote buying during the election.
“We shall not tolerate a situation where voting is ongoing and some individuals are influencing voters for their party.
“Vote buying or selling is an electoral offence, anybody found culpable will be prosecuted,” he said.
He warned politicians against violence and use of undemocratic means to win election.
He said: “Nobody should attempt to promote violence; our attention should be to have a credible election.”


--- layout: post title: Thus it Begins... post_id: 312 categories: - metablog date: 2004-02-06 01:24:00.000000000 -07:00 author: Jamis permalink: 2004/2/6/thus-it-begins.html ---
It seems like everywhere I go on the ‘Net these days, I encounter weblogs and wikis. Guess it’s just the thing to do. I’d hate to be considered outmoded, so here’s my very own online journal—the “BuckBlog”!
I’ll be posting my thoughts on various things, including programming language design, books I’m reading, programming languages I’m learning, raising kids, and so on. I’ll try to keep the topics categorized, so if you find yourself visiting this blog often you can easily get at the stuff you really want to read.
Enjoy!


Upgrade your Xbox One storage this Black Friday with an 8TB game drive sale
by Emily GeraLooking to beef up your storage on Xbox One?
Amazon is currently running a few offers on external hard drives ahead of Black Friday – including a hefty 8 TB game drive for Xbox One ideal if you’re on the lookout to upgrade storage space on your console.
The Seagate 8TB game drive hub for Xbox is currently on sale for £109.99. That’s a 23 percent discount from its usual £142.92 price point – a drop of roughly £32. At 8TB, you’ll be able to fit a minimum of 200 Xbox One titles to the drive.
But if you don’t need that much space, there are a couple alternatives on offer. The Seagate 4TB game drive is available for £94.76, a 14 percent discount from it standard £109.99 pricetag, while a Seagate 2TB drive is available at a 26 percent discount for £62.99 – down from £85.61. The latter external drive can also be used with Xbox 360 consoles.
- Seagate 8 TB Game Drive Hub for Xbox for £109.99
- Seagate 4 TB Game Drive Hub for Xbox for £94.76
- Seagate 2 TB Game Drive Hub for Xbox for £62.99
For PlayStation 4 users, Amazon has also slashed the price on its Seagate 4TB game drive for PS4. This external drive is down 26 percent from £109.99, and is currently available for £80.99.
Finally, Amazon is also offering a small discount on Seagate portable hard drives preformatted for Windows and PC. The portable 4TB drive available for £75.99, down eight percent from its usual £82.99, while a smaller 2TB drive is down 36 percent – dropping from £74.99 to £47.99.
- Seagate 4 TB Expansion Amazon Special Edition for £75.99
- Seagate 2 TB Expansion Amazon Special Edition for £47.99
If you want even more Xbox-related deals, keep a close eye on our Xbox One Black Friday hub over the next week. We’ve also got pages dedicated to all the best PlayStation deals too.


{% extends 'template.html' %} {% block title %}Password request Done{% endblock %} {% block content %}
We've emailed you instructions for setting your password. You should receive the email shortly!