Full Name :-DR. NEERA YADAV
Wife Of :-Vijay Yadav
Age :-43
Address :-Vill. Jharitand, P.O Indarwa, Thana Kodarma, Dist Kodarma
Email<EMAIL_ADDRESS>Contact Number :-9431334228
Self Profession :-Teacher & Social Work
Education Qualification :-Doctorate M.Com In 1996, B. Ed In 2009 From Ranchi University & Ph.D From Vinoba Bhave University In 2003
Full Name :-DR. NEERA YADAV
Dr. Neera Yadav is a leader of Bharatiya Janata Party and the minister in government of Jharkhand. She is a member of Jharkhand Legislative Assembly from Kodarma (Vidhan Sabha constituency). She is a doctorate from Vinoba Bhave University . She completed M.Com in 1996 and B. Ed in 2009 from Ranchi University. She used to teach commerce at an intermediate college in Koderma. Formerly she was serving as education minister of Jharkhand,now she is serving as Minister for Human Resouce Development.


---
sort_order: 128
tei_id: rdx_b5j2m.p.idp929824
annotation_count: 0
images:
small-thumbnail: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p77qs/mini-thumbnail/
json: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p77qs/info/
full: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p77qs/fs/
page: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p77qs/single-page/
thumbnail: http://readux.library.emory.edu/books/emory:b5j2m/pages/emory:p77qs/thumbnail/
title: Page 128
number: 128
---
{% raw %}124 MRS. H. BEECHER STOWe's " UNCLE TOM."{% endraw %}
{% raw %}the wants of our community. Mr. Wilson and{% endraw %}
{% raw %}myself, therefore, called such a convention, to meet{% endraw %}
{% raw %}in London, Upper Canada, and it was held in June,{% endraw %}
{% raw %}1838.{% endraw %}
{% raw %}I urged the appropriation of the money to the{% endraw %}
{% raw %}establishment of a manual-labour school, at which{% endraw %}
{% raw %}our children could gain those elements of knowledge{% endraw %}
{% raw %}which are usually taught in a grammar-school. I{% endraw %}
{% raw %}urged that the boys should be taught, in addition,{% endraw %}
{% raw %}the practice of some mechanical art, and the girls{% endraw %}
{% raw %}should be instructed in those domestic arts which{% endraw %}
{% raw %}are the proper occupation and ornament of their sex;{% endraw %}
{% raw %}and that such an establishment would not only train{% endraw %}
{% raw %}up those who would afterwards instruct others, but{% endraw %}
{% raw %}that it would gradually enable us to become inde¬{% endraw %}
{% raw %}pendent of the white man for our intellectual{% endraw %}
{% raw %}progress, as we could be for our physical prosperity.{% endraw %}
{% raw %}It was the more necessary, as in many districts,{% endraw %}
{% raw %}owing to the insurmountable prejudices of the in¬{% endraw %}
{% raw %}habitants, the children of the blacks were not allowed{% endraw %}
{% raw %}to share the advantages of the common school.{% endraw %}
{% raw %}There was some opposition to this plan in the con¬{% endraw %}
{% raw %}vention ; but in the course of the discussion, which{% endraw %}
{% raw %}continued for three days, it appeared so obviously{% endraw %}
{% raw %}for the advantage of all to husband this donation, so{% endraw %}
{% raw %}as to preserve it for a purpose of permanent utility,{% endraw %}
{% raw %}that the proposal was, at last, unanimously adopted ;{% endraw %}
{% raw %}and a committee of three was appointed to select{% endraw %}
{% raw %}and purchase a site for the establishment. Mr.{% endraw %}
{% raw %}Wilson and myself were the active members of this{% endraw %}
{% raw %}committee, and after traversing the country for{% endraw %}
{% raw %}several months, we could find no place more suitable{% endraw %}


Instructions
Follow the instructions below to set-up your map and run the algorithm.
For this web-page, a path refers to a sequence of steps (directions) that a square takes (follows) in an attempt to travel from the starting point to a goal while avoiding the obstacles.
-
Choose a Starting Point
Drag (click and hold) the green "Starting Point" square from the selection panel (the left rectangle with light green background) and drop (release hold) it anywhere on the play area (the right rectangle with white background).
Once on the play area, it can be dragged and dropped to new locations.
Dropping it off the play area will reset it to the selection panel.
-
Add Goals
Drag the purple "Goal" square from the selection panel and drop it anywhere on the play area.
This can be done multiple times to create multiple goals.
The algorithm will try to learn how to move a square from the starting point to one of these goals.
Once on the play area, a goal can be dragged and dropped to new locations.
Dropping it off the play area will delete it.
-
Add Obstacles
You can create multiple obstacles for squares to avoid while they move from the starting point to a goal.
An obstacle can either be stationary or moving.
Moving obstacles will bounce off the play area boundary during runtime.
To add an obstacle, first choose a position by dragging the orange "Obstacle" circle from the selection panel and drop it anywhere on the play area.
Then either click inside the obstacle (a black circle will appear) to make it stationary or click outside of the obstacle (an arrow will appear that indicates the direction it will move in) to make it move during runtime.
Once on the play area, an obstacle can be moved to new locations.
Dropping it off the play area will delete it.
-
Run the Genetic Algorithm
Once you have set-up the play area, click the play button at the top of the selection panel to begin the algorithm.
While the algorithm is running, you can monitor what generation it is up to.
You can think of this as the number of attempts the algorithm has made to find or improve a path that ends at a goal.
Within each generation, the best path is traced by a red square, while all other paths are traced by green squares.
If a square runs into an obstacle or the play area boundary, then it stops and turns light blue.
Before the algorithm has found a path that ends at a goal, you can monitor the "Max Steps" (which will increase by 2 every 2 generations).
The algorithm is trying to find a path, that ends at a goal, that has at most the "Max Steps" number of steps.
After the algorithm has found a path that ends at a goal, it will then try to find another path that ends at a goal with a reduced number of steps, where the current record number of steps is shown beside "Best Steps".
While the algorithm is running, under "Controls" you can change the speed at which the algorithm runs.
For example, you can speed it up so that it finds a path, that ends at a goal, quicker and then slow it down to see details of how squares move along generated paths.
Also, under "Controls" you can change the population size.
This number is how many paths the algorithm tries per generation.
You can click the stop button, at the top of the selection panel, to stop the algorithm and make modifications to the map.
How the Algorithm Works
This program uses a genetic algorithm to find, and then improve, a path that ends at a goal.
A genetic algorithm mimics biological evolution, in that it is based on natural selection.
An outline of how the algorithm solves the problem is described below.
You can also access the computer code here.
-
When you click the play button, the algorithm first generates several completely random paths (paths with random directions).
The number of said paths and the number of steps in these paths are shown under "Population" and beside "Max Steps", respectively, in the selection panel during runtime.
-
The algorithm then decides how good each of the generated paths are by assigning each of them their own fitness score.
The aim of this fitness score is to summarise, as a single number, how close a path is to achieving the goal, i.e., moving a square from the starting point to a goal while avoiding the obstacles.
The fitness score is decided by a fitness function.
Such a function inputs one or more pieces of data and computes a fitness score.
Designing a fitness function is arguably the most difficult and subjective part of building a genetic algorithm.
For example, what defines the best path out of a group of paths and is this rule the best for all map designs?
Another difficulty is to choose what data the fitness function has access to.
In reality, there may be physical restrictions that limit the choices of input data.
Whereas, in this artificial set-up the input data could be almost anything.
For example, we could allow the algorithm to know the exact location of all goals and obstacles at all times; however, this would not offer much of a challenge.
To make things reasonably difficult, the genetic algorithm used only knows:
-
The distance to the nearest goal at all times, but not where this goal is.
-
The displacement a path makes, i.e., how far a square is from the starting point after it has moved along a path.
-
When a square, moving along a path, runs into an obstacle, a goal or the boundary of the play area.
It does not know where the obstacles, goals or boundary are, and does not know if the square is going to run into them until it does.
Using this data, the algorithm determines the fitness score of a path as follows (where a larger number is given to better paths):
-
If a path does not cause a square, moving along this path, to run into an obstacle or the play area boundary, then this path is assigned the fitness score:
$${\text{displacement} \over \text{distance}^2}.$$
The closer the path takes the square to a goal then the higher its score will be.
Also, the larger the displacement the higher its score will be, which further encourages the path to not allow the square to stay still initially.
The distance is squared to give it priority over displacement, which encourages the path to lead to the closest goal.
-
If a path causes a square, moving along this path, to run into an obstacle or the play area boundary, then this path is assigned the fitness score:
$$0.1 \times {\text{displacement} \over \text{distance}^2}.$$
This score is considerably smaller than the score associated to a path not running into an obstacle or the play area boundary, as such a path will never allow the square to make it to a goal.
-
If a path causes a square, moving along this path, to make it to a goal while not running into an obstacle or the play area boundary, then this path is assigned the fitness score:
$${\text{displacement} \over \text{distance}^2} + {100000 \over \text{steps}^2}.$$
This score is the highest a path can achieve, which reflects how the best paths are those that end at a goal.
In this score "steps" refers to how many steps is in the path.
If the algorithm continues running, it will try to find paths, that end at a goal, that increase this score by reducing the number of steps.
-
The algorithm then creates a new generation/group of paths, based on the previous generation of paths.
The new generation number, number of new paths and the number of steps in these paths are shown beside "Generation", under "Population" and beside "Max Steps"/"Best Steps", respectively, in the selection panel during runtime.
The way the algorithm creates the new generation of paths is as follows:
-
The best performing path (the path with the highest fitness score) from the previous generation is copied over to the new generation of paths.
-
The remaining paths are first copied from randomly selected paths in the previous generation (with weight/preference given to the best performing paths) and are then mutated.
For this algorithm, a path mutation is when the algorithm goes through each direction in the path and with a 1% probability changes that direction to a random direction.
However, if a path causes a square, moving along that path, to run into an obstacle or the play area boundary in the last 10 steps, then the last 10 directions of the path have a 5% chance of changing.
The reason for this is that such a path has done well to make it so far and it is the recent steps that are causing it to fail.
The best performing path from the previous generation is unmodified to act as a control/baseline for the new generation of paths to beat.
This path is traced by the red square during runtime.
Over time, mutations allow the best paths to evolve and improve.
This is reminiscent of biological evolution.
With the paths created for this generation, the algorithm returns to step 2.


function SetSize(NewWidth, NewHeight: Integer): Boolean; override;
procedure SetSize(Source: TPersistent); // implemented in TCustomMap
Call SetSize to set a new width and height of the bitmap. If one of the arguments is zero, the bitmap is considered empty and in case of TBitmap32 its Handle property is set to zero.
Calling SetSize works faster than consecutive changing of Width and Height properties. If you use another bitmap or control as an argument, the bitmap will be sized to source dimensions.
If you have an external TCanvas attached, refresh it Handle property after resizing:
Bitmap32.SetSize(100, 200);
Canvas.Handle := Bitmap32.Handle;
After the SetSize call the image the bitmap should be completely redrawn.


Create Accessible Table From Excel
Data (tab separated; copy / paste from excel):
Column headers on row (0 for none):
Row headers on column (0 for none):
Table caption (briefly describe the purpose of the table):
Convert
Results:


Robert Forster played Go-Betweens songs & more @ Bell House (pics, setlist, video)
by Bill PearisWhat a magical night. Onetime Go-Betweens co-frontman Robert Forster wrapped up his short North American solo tour — his first in 11 years — at Brooklyn’s Bell House on Saturday night. There was no opener and no setlist, just Forster playing what he felt like, sharing stories and his timeless songs. He opened with two Go-Betweens songs from the band’s 2000-era reunion period — “Born to A Family” and “Spirit” — and went on to split the night between his old band’s songs and solo numbers, both of which were met with rousing cheers. The set included “Dive for Your Memory,” “Head Full of Steam,” “Spring Rain,” the title track off his recent solo album Inferno and lots more.
Clearly vibing off the crowd’s enthusiasm (the partially seated show got two standing ovations), Forster was a total charmer and the 20-song set flew by. My favorite moment: near the end of his set he played “Surfing Magazines” (from 2000’s The Friends of Rachel Worth) and the audience provided the “dah dah dah” backing vocals.
Recapping the show on Facebook, Forster wrote:
A sold out show, a room full of people who listened and responded in a way I have rarely known, and never experienced in New York. It was a turning point night. Overwhelming. Standing ovations. I couldn’t believe it. And while it was magic, it was in the spirit of the whole tour. The end point to a run shows that built and showed me that my music and the music of The Go-Betweens has followers and admirers here willing to come and see me play. Thank you. It certainly won’t be another 11 years till i come back. (Wish it was 11 days) Not by a long way. Another turning point realisation – I have to come back.
Watch video of “Surfing Magazines” and check out the Bell House setlist, below.
The second volume of the G Stands for Go-Betweens retrospective box set series is out December 6.
SETLIST: Robert Forster @ The Bell House 11/16/2019
Born to a Family (Go-Betweens)
Spirit (Go-Betweens)
I’m All Right (Go-Betweens)
I Love Myself (and I Always Have)
One Bird in the Sky
Here Comes a City (Go-Betweens)
Darlinghurst Nights (Go-Betweens)
Baby Stones
Spring Rain (Go-Betweens)
Life Has Turned a Page
Dive for Your Memory (Go-Betweens)
Inferno (Brisbane in Summer)
Remain
In the Core of a Flame (Go-Betweens)
Learn to Burn
Demon Days
Head Full of Steam (Go-Betweens)
Surfing Magazines (Go-Betweens)
121
Rock ‘n’ Roll Friend (Go-Betweens)
—
photos by P Squared


University of Washington, Seattle
University of South Carolina, Columbia, SC
University of Warwick, Coventry, England
Network Systems at the University of Washington
Software Engineer (Interface Designer and Developer) for the Network Management Tools Team, September 2007-present
200ok Web Consulting, Development and Design, http://200okconsulting.com/
Principal Consultant, September 2000-Present
Modwest, Inc., Missoula, Montana
Web Production Manager, December 2006-September 2007
Web Content Specialist, May 2006-December 2006
Hogwarts Live, http://www.hogwartslive.com/
Copywriter and Editor, April 2006-September 2007
Information School, University of Washington, Seattle, Washington
Lecturer, Summer 2009
Department of English, Oregon State University, Corvallis, Oregon
Instructor, Fall 2004-March 2006
Department of English, Mt. Hood Community College, Gresham, Oregon
Adjunct Instructor, Fall 2003-Spring 2004
Department of English, Lewis and Clark College, Portland, Oregon
Adjunct Instructor, Fall 2003; instructed English 205: Major Periods and Issues in English and American Literature; Chaucer to Milton.
Versification: An Electronic Journal of Literary Prosody
Co-editor, Fall 2001-March 2006.
Comparative History of Ideas Program, University of Washington, Seattle
Teaching Assistant, Fall 2000 to Spring 2003
In Medias Res: An Electronic Journal for the Public Intellectual
Co-editor, Fall 2001-Fall 2002.
MLQ: A Journal of Literary History, University of Washington, Seattle
Assistant Editor, Fall 2001.
Department of English, University of Washington, Seattle
Teaching Assistant, September 1997 to Spring 2001
Department of English, University of Washington, Seattle
Computer Support Technician; Summer 1998, Summer 1999, Summer 2000, Summer 2001.
Department of English Writing Center, University of Washington, Seattle
Interim Assistant Director, November 1999 to January 2000.
Department of English Writing Center, University of Washington, Seattle
Tutor, April to September 1997
Department of English, University of Washington, Seattle
Readership, Winter to Spring, 1997


|
falco
C library for developing embedded and network applications
|
Signal Handlers Management. More...
Signal Handlers Management.
Go to the source code of this file.
Classes | |
| struct | fl_signal_handler_regn_t_ |
| Representation of a signal handler registration. More... | |
Typedefs | |
| typedef void(* | fl_signal_handler_t) (int, siginfo_t *, void *) |
| Type definition of a signal handler routine. | |
| typedef struct fl_signal_handler_regn_t_ | fl_signal_handler_regn_t |
| Representation of a signal handler registration. More... | |
Functions | |
| int | fl_signal_register_handlers (fl_signal_handler_regn_t *sighandler_registrations) |
| Register a set of signal handlers. More... | |
| int | fl_signal_add (int signum, fl_signal_handler_t sighandler) |
| Register/Add a signal handler. More... | |
| int | fl_signal_remove (int signum) |
| Deregister/Remove a signal handler. More... | |
| int | fl_signals_block (int signals[], sigset_t *set) |
| Block a list of signals. More... | |
| int | fl_signals_unblock (sigset_t *set) |
| Unblock signals for the caller. More... | |
| typedef struct fl_signal_handler_regn_t_ fl_signal_handler_regn_t |
Representation of a signal handler registration.
This is a convenience structure for applications to define a list of signals and their respective handlers.
| int fl_signal_add | ( | int | signum, |
| fl_signal_handler_t | sighandler | ||
| ) |
Register/Add a signal handler.
| [in] | signum | Signal number, for example: SIGTERM, SIGHUP |
| [in] | sighanlder | Pointer to a function that implements fl_signal_handler_t |
| int fl_signal_register_handlers | ( | fl_signal_handler_regn_t * | sighandler_registrations | ) |
Register a set of signal handlers.
| [in] | sighandler_registrations | List of signals and their respective handlers represented by fl_signal_handler_regn_t |
| int fl_signal_remove | ( | int | signum | ) |
Deregister/Remove a signal handler.
| [in] | signum | Signal number, for example: SIGTERM, SIGHUP |
| int fl_signals_block | ( | int | signals[], |
| sigset_t * | set | ||
| ) |
Block a list of signals.
| [in] | signals | Array of signals (signal numbers) to be blocked |
| [in,out] | set | Signal set returned by this function containing those signals that were successfully blocked. |
| int fl_signals_unblock | ( | sigset_t * | set | ) |
Unblock signals for the caller.
| [in] | set | Set of signals currently blocked. Typically this is the set of signals post a call to fl_signals_block(). |


{% extends "base.html" %} {% block title %}GitHub rate limit reached - Grip{% endblock %} {%- block styles -%} {%- endblock -%} {%- block scripts -%} {%- endblock -%} {%- block page -%}
The GitHub API rate limit {% if is_authenticated %} for basic auth {% endif %} has been reached for the hour.
{% if is_authenticated %}Sorry for the inconvenience.
{% endif %}GitHub imposes a limit of 60 requests/hour when using their API without authentication.
This prevents people from anonymously abusing GitHub's system.
As for Grip, it's built to appear as close to GitHub as possible. Using GitHub's API allows Grip to immediately and accurately reflect any updates from GitHub, without the delay of busy maintainers or requiring you to upgrade.
Until the offline renderer is complete, you can run Grip using
the --user
and --pass
arguments to use basic auth,
giving you 5,000 requests/hour. Run grip -h
for details.
I do apologize for the inconvenience. If you need help, or have ideas on improving this experience, please reach out joe@joeyespo.com


| napCAD | index /home/celine/Github/napCAD/napCAD.py |
Integrates all modules, creates and handles GUI/ user input and output. OpenCV portions are based off of http://kieleth.blogspot.com/2014/05/webcam-with-opencv-and-tkinter.html
| Modules | ||||||
|
| Classes | ||||||||||
|
|
| Functions | ||
|
| Data | ||
| b = None cap = <VideoCapture 0x7f434fef4e50> curFrame = None lmain = <Tkinter.Label instance> q = None root = <Tkinter.Tk instance> |


Time table for my daily activities
Time (Hrs)
Activites
7:00
Wake up, get ready, make and have breakfast
8:00
8:45
Leave and attend college
18:00
Leave from college
18:30
Reach home and do assignments
21:30
Dinner
22:30
Do assignments
00:30
Sleep


---
layout: post
title: links for 2007-06-26
date: 2007-06-26 00:00:00
---
-
-
"This no-rush attitude doesn’t represent doing less or having a lower productivity. It means working and doing things with greater quality, productivity, perfection, with attention to detail and less stress."
-
-
Lovely. Particularly liked "your train of thought is sacred" and "good interfaces create good habits"


This interface will import records from a Google Spreadsheet into Numishare. The type of record must conform to the specimen/coin type collection setting established in the Numishare config. Prior to the display of the column mapping interface, this workflow will parse and validate the Nomisma URIs that exist in the spreadsheet.
Associate the headings with allowable properties, where applicable. Note that the ID, Preferred Label (English), and Definition (English) are required.
| Column Heading | Property Mapping |
|---|---|
|
|
|
The Atom representation of the Google Spreadsheet has successfully loaded, but it does not appear to contain content.
| ID | Messages |
|---|---|
|
|
The process has been completed successfully. Click the link above to return to the Admin panel.


LDS Leader Tool Suite (LLTS) helps leaders administer within their organizations
LLTS is an open source project and is released under MIT License.
Source code can be found here and here.


@* * Copyright 2021 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 forms.AtedForms._ @import models._ @import uk.gov.hmrc.play.views.html.helpers._ @import views.html.helpers._ @import config.ApplicationConfig @import play.twirl.api.HtmlFormat @this(atedMain: atedMain) @(deleteDraftForm: Form[YesNoQuestion], id: Option[String], periodKey: Int, returnType: String, serviceInfoContent: Html = HtmlFormat.empty, backLink: Option[String])(implicit authContext: StandardAuthRetrievals, messages: Messages, request: Request[AnyContent], appConfig: ApplicationConfig) @atedMain(title = messages("ated.delete-draft.title"), serviceInfoContent = serviceInfoContent) { @pageHeadersAndError(backLink, "pre-header", messages("ated.return-type.pre-header"), "header", messages("ated.delete-draft.header"), Some(atedErrorSummary(deleteDraftForm, "ated.delete-drafts.error.general"))) @form(action = controllers.routes.DraftDeleteConfirmationController.submit(id, periodKey, returnType)) {


This is a normal line.
This is a bold line.
This is an important line.
This line contain italic phrase.
This line has few emphasized words.
This line contains some marked words.
The Red has been deleted and blue has been inserted.
This line has this phrase in small size.
The formula for Water is H2O.
Today's date is 14th Feb, 2021.


Trading_AddDisputeResponseRequestType Class Reference
| Inherits from | Trading_AbstractRequestType : NSObject |
| Declared in | Trading_AddDisputeResponseRequestType.h Trading_AddDisputeResponseRequestType.m |
Overview
Allows a seller to respond to or close an Item Not Received dispute.
This can be used to add a comment to an Unpaid Item Dispute
only if the request version was lower than 637 when the
dispute was created.
@ingroup EBayAPIInterface
Tasks
-
disputeID
The unique identifier of the dispute,
property
returned when the dispute was created. -
messageText
The text of a comment or response being posted to the dispute. Required
property
when DisputeActivity is SellerAddInformation, SellerComment, or
SellerPaymentNotReceived; otherwise, optional. -
disputeActivity
The type of activity the seller is taking on the dispute. The allowed value is
property
determined by the current value of DisputeState, returned by GetDispute or
GetUserDisputes. Some values relate to Unpaid Item disputes and other values relate
to buyer-created disputes known as Item Not Received or Significantly Not As
Described disputes. -
shippingCarrierUsed
The shipping carrier used to ship the item in dispute. Non-alphanumeric
property
characters are not allowed. This field (along with ShipmentTrackNumber) is
required if DisputeActivity is SellerShippedItem. -
shipmentTrackNumber
The tracking number associated with one package of a shipment. The seller is
property
responsible for the accuracy of the shipment tracking number, as eBay only
verifies that the tracking number is consistent with the numbering scheme
used by the specified shipping carrier, but cannot verify the accuracy of
the tracking number. This field (along with ShippingCarrierUsed) is required
if DisputeActivity is SellerShippedItem. -
shippingTime
This timestamp indicates the date and time when the item under dispute was
property
shipped. This field is required if DisputeActivity is SellerShippedItem.
Properties
disputeActivity
The type of activity the seller is taking on the dispute. The allowed value is
determined by the current value of DisputeState, returned by GetDispute or
GetUserDisputes. Some values relate to Unpaid Item disputes and other values relate
to buyer-created disputes known as Item Not Received or Significantly Not As
Described disputes.
@property (nonatomic, retain) NSString *disputeActivity
Discussion
The type of activity the seller is taking on the dispute. The allowed value is
determined by the current value of DisputeState, returned by GetDispute or
GetUserDisputes. Some values relate to Unpaid Item disputes and other values relate
to buyer-created disputes known as Item Not Received or Significantly Not As
Described disputes.
type: string constant in Trading_DisputeActivityCodeType.h
Declared In
Trading_AddDisputeResponseRequestType.h
disputeID
The unique identifier of the dispute,
returned when the dispute was created.
@property (nonatomic, retain) NSString *disputeID
Discussion
The unique identifier of the dispute,
returned when the dispute was created.
type : NSString, wrapper for primitive string
Declared In
Trading_AddDisputeResponseRequestType.h
messageText
The text of a comment or response being posted to the dispute. Required
when DisputeActivity is SellerAddInformation, SellerComment, or
SellerPaymentNotReceived; otherwise, optional.
@property (nonatomic, retain) NSString *messageText
Discussion
The text of a comment or response being posted to the dispute. Required
when DisputeActivity is SellerAddInformation, SellerComment, or
SellerPaymentNotReceived; otherwise, optional.
type : NSString, wrapper for primitive string
Declared In
Trading_AddDisputeResponseRequestType.h
shipmentTrackNumber
The tracking number associated with one package of a shipment. The seller is
responsible for the accuracy of the shipment tracking number, as eBay only
verifies that the tracking number is consistent with the numbering scheme
used by the specified shipping carrier, but cannot verify the accuracy of
the tracking number. This field (along with ShippingCarrierUsed) is required
if DisputeActivity is SellerShippedItem.
@property (nonatomic, retain) NSString *shipmentTrackNumber
Discussion
The tracking number associated with one package of a shipment. The seller is
responsible for the accuracy of the shipment tracking number, as eBay only
verifies that the tracking number is consistent with the numbering scheme
used by the specified shipping carrier, but cannot verify the accuracy of
the tracking number. This field (along with ShippingCarrierUsed) is required
if DisputeActivity is SellerShippedItem.
type : NSString, wrapper for primitive string
Declared In
Trading_AddDisputeResponseRequestType.h
shippingCarrierUsed
The shipping carrier used to ship the item in dispute. Non-alphanumeric
characters are not allowed. This field (along with ShipmentTrackNumber) is
required if DisputeActivity is SellerShippedItem.
@property (nonatomic, retain) NSString *shippingCarrierUsed
Discussion
The shipping carrier used to ship the item in dispute. Non-alphanumeric
characters are not allowed. This field (along with ShipmentTrackNumber) is
required if DisputeActivity is SellerShippedItem.
type : NSString, wrapper for primitive string
Declared In
Trading_AddDisputeResponseRequestType.h
shippingTime
This timestamp indicates the date and time when the item under dispute was
shipped. This field is required if DisputeActivity is SellerShippedItem.
@property (nonatomic, retain) NSDate *shippingTime
Discussion
This timestamp indicates the date and time when the item under dispute was
shipped. This field is required if DisputeActivity is SellerShippedItem.
type : NSDate, wrapper for primitive date
Declared In
Trading_AddDisputeResponseRequestType.h


The Warehouse
Home
Warehouses
Boxes
New
Warehouse
Box
Github
{% block content %}{% endblock %}
{% for alert in alerts %}
The Warehouse
just now
{{alert.title}}
{% endfor %}


Welcome to my new website. This is for training purposes, and may have mistakes. Please feel free to reach out to me via email if you find a mistake and help me fix it.
My email address is<EMAIL_ADDRESS>The Internet
What is the Internet? The internet is a vast computer network linking smaller computer networks worldwide. The Internet includes commercial, educational, governmental, and other networks, all of which use the same set of communications protocols. Source


|
ABOUT
YAML(tm) is an international
collaboration to make a data serialization language which
is both human readable and computationally powerful.
The founding members of YAML are
Ingy döt Net (author of the Perl
module
Data::Denter),
Clark Evans, and
Oren Ben-Kiki.
YAML emerged from the union of two efforts. The
first was Ingy döt Net's need for a serialization
format for Inline,
this resulted in his Data::Denter module.
The second, was the joint work of Oren Ben-Kiki
Clark Evans on simplifying XML within the sml-dev group.
YAML was first publicized with a <?xmlhack?> article
on 12 May 2001. Oren and Clark's vision for YAML
was very similar to Ingy's Data::Denter, and vice versa,
thus a few days later they teamed up and YAML was born.
|


We are located at 505 N. Third St, Marquette MI.
Contact us by phone:<PHONE_NUMBER> or stop in anytime. We'd love to hear from you and answer any questions you may have!
Make sure to follow us on Facebook and Instagram!
To book an appointment head to our page on
vargo.com


12.3. NP-Completeness (optional) (WORK IN PROGRESS)¶
12.3.1. NP-Completeness¶
<IP_ADDRESS>. Hard Problems¶
There are several ways that a problem could be considered hard. For example, we might have trouble understanding the definition of the problem itself. At the beginning of a large data collection and analysis project, developers and their clients might have only a hazy notion of what their goals actually are, and need to work that out over time. For other types of problems, we might have trouble finding or understanding an algorithm to solve the problem. Understanding spoken English and translating it to written text is an example of a problem whose goals are easy to define, but whose solution is not easy to discover. But even though a natural language processing algorithm might be difficult to write, the program’s running time might be fairly fast. There are many practical systems today that solve aspects of this problem in reasonable time.
None of these is what is commonly meant when a computer theoretician uses the word “hard”. Throughout this section, “hard” means that the best-known algorithm for the problem is expensive in its running time. One example of a hard problem is Towers of Hanoi. It is easy to understand this problem and its solution. It is also easy to write a program to solve this problem. But, it takes an extremely long time to run for any “reasonably” large value of \(n\). Try running a program to solve Towers of Hanoi for only 30 disks!
The Towers of Hanoi problem takes exponential time, that is, its running time is \(\Theta(2^n)\). This is radically different from an algorithm that takes \(\Theta(n \log n)\) time or \(\Theta(n^2)\) time. It is even radically different from a problem that takes \(\Theta(n^4)\) time. These are all examples of polynomial running time, because the exponents for all terms of these equations are constants. If we buy a new computer that runs twice as fast, the size of problem with complexity \(\Theta(n^4)\) that we can solve in a certain amount of time is increased by the fourth root of two. In other words, there is a multiplicative factor increase, even if it is a rather small one. This is true for any algorithm whose running time can be represented by a polynomial.
Consider what happens if you buy a computer that is twice as fast and try to solve a bigger Towers of Hanoi problem in a given amount of time. Because its complexity is \(\Theta(2^n)\), we can solve a problem only one disk bigger! There is no multiplicative factor, and this is true for any exponential algorithm: A constant factor increase in processing power results in only a fixed addition in problem-solving power.
There are a number of other fundamental differences between polynomial running times and exponential running times that argues for treating them as qualitatively different. Polynomials are closed under composition and addition. Thus, running polynomial-time programs in sequence, or having one program with polynomial running time call another a polynomial number of times yields polynomial time. Also, all computers known are polynomially related. That is, any program that runs in polynomial time on any computer today, when transferred to any other computer, will still run in polynomial time.
There is a practical reason for recognizing a distinction. In practice, most polynomial time algorithms are “feasible” in that they can run reasonably large inputs in reasonable time. In contrast, most algorithms requiring exponential time are not practical to run even for fairly modest sizes of input. One could argue that a program with high polynomial degree (such as \(n^{100}\)) is not practical, while an exponential-time program with cost \(1.001^n\) is practical. But the reality is that we know of almost no problems where the best polynomial-time algorithm has high degree (they nearly all have degree four or less), while almost no exponential-time algorithms (whose cost is \((O(c^n))\) have their constant \(c\) close to one. So there is not much gray area between polynomial and exponential time algorithms in practice.
For the purposes of this Module, we define a hard algorithm to be one that runs in exponential time, that is, in \(\Omega(c^n)\) for some constant \(c > 1\). A definition for a hard problem will be presented soon.
<IP_ADDRESS>. The Theory of NP-Completeness¶
Imagine a magical computer that works by guessing the correct solution from among all of the possible solutions to a problem. Another way to look at this is to imagine a super parallel computer that could test all possible solutions simultaneously. Certainly this magical (or highly parallel) computer can do anything a normal computer can do. It might also solve some problems more quickly than a normal computer can. Consider some problem where, given a guess for a solution, checking the solution to see if it is correct can be done in polynomial time. Even if the number of possible solutions is exponential, any given guess can be checked in polynomial time (equivalently, all possible solutions are checked simultaneously in polynomial time), and thus the problem can be solved in polynomial time by our hypothetical magical computer. Another view of this concept is this: If you cannot get the answer to a problem in polynomial time by guessing the right answer and then checking it, then you cannot do it in polynomial time in any other way.
The idea of “guessing” the right answer to a problem—or checking all possible solutions in parallel to determine which is correct—is a called a non-deterministic choice. An algorithm that works in this manner is called a non-deterministic algorithm, and any problem with an algorithm that runs on a non-deterministic machine in polynomial time is given a special name: It is said to be a problem in NP. Thus, problems in NP are those problems that can be solved in polynomial time on a non-deterministic machine.
 For example, Towers of Hanoi is not in NP, because it must print out \(O(2^n)\) moves for \(n\) disks. A non-deterministic machine cannot “guess” and print the correct answer in less time.
On the other hand, consider the TRAVELING SALESMAN problem.
Problem
TRAVELING SALESMAN (1)
Input: A complete, directed graph \(G\) with positive distances assigned to each edge in the graph.
Output: The shortest simple cycle that includes every vertex.
Figure 12.4.1 illustrates this problem. Five vertices are shown, with edges and associated costs between each pair of edges. (For simplicity Figure 12.4.1 shows an undirected graph, assuming that the cost is the same in both directions, though this need not be the case.) If the salesman visits the cities in the order ABCDEA, they will travel a total distance of 13. A better route would be ABDCEA, with cost 11. The best route for this particular graph would be ABEDCA, with cost 9.
We cannot solve this problem in polynomial time with a guess-and-test non-deterministic computer. The problem is that, given a candidate cycle, while we can quickly check that the answer is indeed a cycle of the appropriate form, and while we can quickly calculate the length of the cycle, we have no easy way of knowing if it is in fact the shortest such cycle. However, we can solve a variant of this problem cast in the form of a decision problem. A decision problem is simply one whose answer is either YES or NO. The decision problem form of TRAVELING SALESMAN is as follows.
Problem
TRAVELING SALESMAN (2)
Input: A complete, directed graph \(G\) with positive distances assigned to each edge in the graph, and an integer \(k\).
Output: YES if there is a simple cycle with total distance \(\leq k\) containing every vertex in \(G\), and NO otherwise.
We can solve this version of the problem in polynomial time with a non-deterministic computer. The non-deterministic algorithm simply checks all of the possible subsets of edges in the graph, in parallel. If any subset of the edges is an appropriate cycle of total length less than or equal to \(k\), the answer is YES; otherwise the answer is NO. Note that it is only necessary that some subset meet the requirement; it does not matter how many subsets fail. Checking a particular subset is done in polynomial time by adding the distances of the edges and verifying that the edges form a cycle that visits each vertex exactly once. Thus, the checking algorithm runs in polynomial time. Unfortunately, there are \(2^{|{\mathrm E}|}\) subsets to check, so this algorithm cannot be converted to a polynomial time algorithm on a regular computer. Nor does anybody in the world know of any other polynomial time algorithm to solve TRAVELING SALESMAN on a regular computer, despite the fact that the problem has been studied extensively by many computer scientists for many years.
It turns out that there is a large collection of problems with this property: We know efficient non-deterministic algorithms, but we do not know if there are efficient deterministic algorithms. At the same time, we have not been able to prove that any of these problems do not have efficient deterministic algorithms. This class of problems is called NP-complete. What is truly strange and fascinating about NP-complete problems is that if anybody ever finds the solution to any one of them that runs in polynomial time on a regular computer, then by a series of reductions, every other problem that is in NP can also be solved in polynomial time on a regular computer!
Define a problem to be NP-hard if any problem in NP can be reduced to \(X\) in polynomial time. Thus, \(X\) is as hard as any problem in NP. A problem \(X\) is defined to be NP-complete if
\(X\) is in NP, and
\(X\) is NP-hard.
The requirement that a problem be NP-hard might seem to be impossible, but in fact there are hundreds of such problems, including TRAVELING SALESMAN. Another such problem is called K-CLIQUE.
Problem
K-CLIQUE
Input: An arbitrary undirected graph \(G\) and an integer \(k\).
Output: YES if there is a complete subgraph of at least \(k\) vertices, and NO otherwise.
Nobody knows whether there is a polynomial time solution for K-CLIQUE, but if such an algorithm is found for K-CLIQUE or for TRAVELING SALESMAN, then that solution can be modified to solve the other, or any other problem in NP, in polynomial time.
The primary theoretical advantage of knowing that a problem P1 is NP-complete is that it can be used to show that another problem P2 is NP-complete. This is done by finding a polynomial time reduction of P1 to P2. Because we already know that all problems in NP can be reduced to P1 in polynomial time (by the definition of NP-complete), we now know that all problems can be reduced to P2 as well by the simple algorithm of reducing to P1 and then from there reducing to P2.
There is a practical advantage to knowing that a problem is NP-complete. It relates to knowing that if a polynomial time solution can be found for any problem that is NP-complete, then a polynomial solution can be found for all such problems. The implication is that,
Because no one has yet found such a solution, it must be difficult or impossible to do; and
Effort to find a polynomial time solution for one NP-complete problem can be considered to have been expended for all NP-complete problems.
How is NP-completeness of practical significance for typical programmers? Well, if your boss demands that you provide a fast algorithm to solve a problem, they will not be happy if you come back saying that the best you could do was an exponential time algorithm. But, if you can prove that the problem is NP-complete, while they still won’t be happy, at least they should not be mad at you!
Problems that are solvable in polynomial time on a regular computer are said to be in class P. Clearly, all problems in P are solvable in polynomial time on a non-deterministic computer simply by neglecting to use the non-deterministic capability. Some problems in NP are NP-complete. We can consider all problems solvable in exponential time or better as an even bigger class of problems because all problems solvable in polynomial time are solvable in exponential time. Thus, we can view the world of exponential-time-or-better problems in terms of Figure 12.4.2.
The most important unanswered question in theoretical computer science is whether \(P = NP\). If they are equal, then there is a polynomial time algorithm for TRAVELING SALESMAN and all related problems. Because TRAVELING SALESMAN is known to be NP-complete, if a polynomial time algorithm were to be found for this problem, then all problems in NP would also be solvable in polynomial time. Conversely, if we were able to prove that TRAVELING SALESMAN has an exponential time lower bound, then we would know that \(P \neq NP\).


Undefined behavior (UB-CCV1).
According to ISO C11, if the mathematical of an arithmetic operation
producing a signed result can not be represented in the result type
the behavior is undefined.
In practice, this error can cause buffer overflow vunlerabilites.
Because it is allowed for the minimum value in a signed type to
have a greater absolute value than the maximum value, it is also possible
for a prefix negation or a division (by -1) to produce an integer overflow.
Citations


When a user logs in via telnet or at the console, or opens an xterm
window in X the users shell program will be run to interpret commands
entered. If a user does not have a valid shell program or has one that
does nothing (like /bin/false), then that user will not be able to
login. This can be useful when creating users who can only read and send
email.
Listed in this field are all the shells used by users on your system. You
may select one, or choose Other.. and enter the full path of the
shell in the text field below.
All Unix systems come with the Bourne shell (/bin/sh) and the
C Shell (/bin/csh). Other common and more user-friendly shells
are tcsh, zsh and bash.


Embedded JavaScript templates
$ npm install ejs
<% %>
<%= %>
<%- %>
-%>
ending tag<% if (user) { %>

<%= user.name %>

<% } %>
var template = ejs.compile(str, options);
template(data);
// => Rendered HTML string
ejs.render(str, data, options);
// => Rendered HTML string
You can also use the shortcut ejs.render(dataAndOptions);
where you pass
everything in a single object. In that case, you'll end up with local variables
for all the passed options.
cache
Compiled functions are cached, requires filename
filename
Used by cache
to key caches, and for includescontext
Function execution contextcompileDebug
When false
no debug instrumentation is compiledclient
Returns standalone compiled functiondelimiter
Character to use with angle brackets for open/closedebug
Output generated function body_with
Whether or not to use with() {}
constructs. If false
then the locals will be stored in the locals
object.rmWhitespace
Remove all safe-to-remove whitespace, including leading-%>
line<%
'Scriptlet' tag, for control-flow, no output<%=
Outputs the value into the template (HTML escaped)<%-
Outputs the unescaped value into the template<%#
Comment tag, no execution, no output<%%
Outputs a literal '<%'%>
Plain ending tag-%>
Trim-mode ('newline slurp') tag, trims following newlineIncludes either have to be an absolute path, or, if not, are assumed as
relative to the template with the include
call. (This requires thefilename
option.) For example if you are including ./views/user/show.ejs
from ./views/users.ejs
you would use <%- include('user/show') %>
.
You'll likely want to use the raw output tag (<%-
) with your include to avoid
double-escaping the HTML output.

<% users.forEach(function(user){ %>
<%- include('user/show', {user: user}) %>
<% }); %>

Includes are inserted at runtime, so you can use variables for the path in theinclude
call (for example <%- include(somePath) %>
). Variables in your
top-level data object are available to all your includes, but local variables
need to be passed down.
NOTE: Include preprocessor directives (<% include user/show %>
) are
still supported.
Custom delimiters can be applied on a per-template basis, or globally:
var ejs = require('ejs'),
users = ['geddy', 'neil', 'alex'];
// Just one template
ejs.render('<?= users.join(" | "); ?>', {users: users}, {delimiter: '?'});
// => 'geddy | neil | alex'
// Or globally
ejs.delimiter = '$';
ejs.render('<$= users.join(" | "); $>', {users: users});
// => 'geddy | neil | alex'
EJS ships with a basic in-process cache for caching the intermediate JavaScript
functions used to render templates. It's easy to plug in LRU caching using
Node's lru-cache
library:
var ejs = require('ejs')
, LRU = require('lru-cache');
ejs.cache = LRU(100); // LRU cache with 100-item limit
If you want to clear the EJS cache, call ejs.clearCache
. If you're using the
LRU cache and need a different limit, simple reset ejs.cache
to a new instance
of the LRU.
EJS does not specifically support blocks, but layouts can be implemented by
including headers and footers, like so:
<%- include('header') -%>

Title

My page

<%- include('footer') -%>
Go to the Latest Release, download./ejs.js
or ./ejs.min.js
.
Include one of these on your page, and ejs.render(str)
.
There are a number of implementations of EJS:
Licensed under the Apache License, Version 2.0
(http://www.apache.org/licenses/LICENSE-2.0)
EJS Embedded JavaScript templates copyright 2112
mde@fleegix.org.


Made by Joost Zwarts
in collaboration with the Digital Humanities Lab
Utrecht University, the Netherlands
The circle shows semantic domains in the New Testament.
Hover over a domain to see how it is related to other domains.
Click on a domain to see the metaphors themselves.
This visualization is based on information from
the Louw-Nida lexicon of the Greek New Testament.
Example: the lexicon gives γυμνός, with the senses
(a) 'naked' (domain 49 Clothing and Adorning)
(b) 'easily known' (domain 28 Knowledge).
This gives rise to the metaphor EASILY KNOWN IS NAKED,
mapping from domain 49 to domain 28.
To understand more about how this is done see these slides.
It uses D3 Hierarchical Edge Bundling by Mike Bostock.
Unfortunately, it does not seem to work in Internet Explorer,
but it does in Chrome, Edge, Firefox and Safari.


Blender to Substance to Unity Pipeline
jayanam writes:
Here is a video in which I show my workflow and pipeline for creating a game asset with Blender 2.8 (high poly and low poly), bring it into Substancepainter for Texturing and finally import it into The Unity Game Engine.


I made some naming and behavior changes that will affect Tower of Psych after revision 186 and Snow Dots after 262.
This page has: * An overview of the big changes * A table of naming changes * A note about dotsTheMachineConfuguration XML files * An explanation of how to do animation, which uses the changes * An explanation of the new topsRunnableGUI graphical interface * An explanation of the new topsConditions class
Overview
The largest change to Tower of Psych is the naming of classes that handle concurrent behaviors. "topsSteppable" is gone, replaced with "topsConcurrent". Likewise, "topsSergeant" is replaced with "topsConcurrentComposite". It just seemed worthwhile to use the word "concurrent" more explicitly, since that's why those classes exist.
To be consistent with these class name changes, step() methods are now called runBriefly().
The largest change to Snow Dots is in the behavior of remote managers. In the past some remote transactions were carried out synchronously, meaning that Snow Dots would wait until they were done before proceeding. Other behaviors were carried out asynchronously, meaning that Snow Dots would request them and then proceed immediately, and later would be notified when the request had been fulfilled.
But asynchronous transactions tended to cause inconsistent behavior when carried out over a physical network. So now, all transactions are carried out synchronously. The take-home from this is that you never need to call the finishAllTransactions() method of a remote manager--that method is gone.
Tower of Psych concurrency changes and Snow Dots synchrony changes are related. The Snow Dots remote manager classes are now subclasses of topsConcurrent, which allows them to run along side other topsConcurrent classes, such as topsStateMachine. Thus, even with synchronous transactions, asynchronous (parallel) behaviors like animation are still possible, as in the explanation below.
Naming Changes
Here are the direct name changes to Tower of Psych: |Old Name|New Name|New Behavior?| |:---------|:---------|:--------------| |topsSeppable|topsConcurrent|no | |topsSergeant|topsConcurrentComposite|no | |topsSeppable.step()|topsConcurrent.runBriefly()|no | |topsTreeNodeGUI|topsRunnableGUI|no, still invoke with object.gui()|
And Snow Dots: |Old Name|New Name|New Behavior?| |:---------|:---------|:--------------| |dotsAllRemoteManagers.finishAllTransactions()|- |gone | |dotsAllRemoteManagers.receiveTransactions()|topsConcurrent.runBriefly()|no longer need to call directly| |- |dotsAllRemoteManagers.runForDuration()|new method | |dotsTheDrawablesManager.mayDrawNextFrame()|- |takes new isAnimating argument| |waitFunction|waitFevalable|cell array, not function handle|
waitFevalable and XML files
I changed "waitFunction" to "waitFevalable" because the fevalable cell array syntax is more flexible and it made it easier to implement synchronous transactions for dotsAllRemoteManagers. From the user point of view, it's probably just a syntax change. For example, @()WaitSecs(.001) would become {@WaitSecs, 0.001} which is not a big change.
But, the change will affect XML configuration files read and written by dotsTheMachineConfiguration. Existing XML files that refer to "waitFunction" need to be replaced or updated.
To replace an existing XML file, take it off the Matlab path, restart Matlab or clear classes, then launch dotsTheMachineConfiguration.gui(). It should say "no settings file loaded" in the title bar. Then click the "save" button and save a default file somewhere on the Matlab path. Then edit the new file to contain any custom settings.
To update an existing XML file, open it with a text editor. Find "waitFunction", which is listed under
Animation
dotsTheDrawablesManager is now a subclass of topsConcurrent. Thus it has a runBriefly() method which is useful for doing animation concurrently with other behaviors. Here is a simple example of how do animation which uses the topsConcurrent behaviors as well as the new synchronous transaction behavior of Snow Dots.
Let's assume we've already created some dotsDrawables objects and they're already in the active group of dotsTheDrawablesManager. The first step of animating is to draw the first frame which we can do by calling mayDrawNextFrame() and passing an argument (which is new) that says to set isAnimating to true. dm = dotsTheDrawablesManager.theObject; dm.mayDrawNextFrame(true); Snow Dots will wait until this first frame has been drawn before continuing. The "lastFrameTime" of dotsTheDrawablesManager will be filled in with the onset time of the first frame. It will set the value of isAnimating to true.
The next step is to allow runBriefly to run for a while, allowing it to keep animating. duration = 5; dm.runForDuration(duration); Animation will continue for the given duration, while dotsTheDrawablesManager invokes its own runBriefly(), repeatedly. This allows it to carry out animation on the local machine, or just pass time while animation is carried out on a remote machine. The syntax is the same either way.
The last step is to tell dotsTheDrawablesManager to stop animating: dm = dotsTheDrawablesManager.theObject; dm.mayDrawNextFrame(false); Snow Dots will also wait until this last frame has been drawn before continuing. Again, the "lastFrameTime" of dotsTheDrawablesManager will be filled in with the onset time of the last frame, and isAnimating will be false.
The Snow Dots demo script demoDrawableDotKinetogram.m contains a similar example of animation.
The Snow Dots demo task demoDots2afcTask contains a more complicated example, which interleaves animation with other task behaviors. Instead of using runForDuration(), it adds dotsTheDrawablesManager as a child of a topsConcurrentComposite object.
Both demos use the runBriefly() behavior of topsConcurrent and the synchronous transactions of dotsAllRemoteObjectManagers to do animation.
topsRunnableGUI
Along with the naming changes related to topsConcurrent objects, Tower of Psych has a new graphical interface for topsRunnable objects (which include topsConcurrent objects), called topsRunnableGUI. It's richer than the previous topsTreeNodeGUI, but it's invoked the same way: with the gui() method of a topsRunnable object.
The Tower of Psych demo script demoRunnables script invokes the new interface for a collection of topsRunnable objects.
There are two key features of the new interface: * All types of topsRunnable objects, including topsTreeNodes, topsStateMachines, or dotsTheDrawablesManager, show up in the new interface * Objects that are children of topsConcurrentComposite objects show up with their (names) inside parentheses. It should be clear at a glance which objects will be run concurrently.
topsConditions
There is a brand-new Tower of Psych class called topsConditions. It's job is to keep track of parameters and various sets of values. It can traverse all the combinations parameter values, using a few different methods. It can automatically assign parameters values to targets, such as object properties or as method arguments.
It's also a topsRunnable subclass, so it can control flow through a task. For example, it should make it easy to let a task run until all combinations a few parameters have been tried.
The Snow Dots demo script demoRandomConditions uses topsConditions to travers several combinations of color, motion strength, and motion direction of a dotsDrawableDotKinetogram.
The Snow Dots demo task demoDots2afcTask contains a more complicated example, which uses and reuses topsConditions to randomize motion directions during each of a few different trial types.


public abstract class Process extends Object
ProcessBuilder.start()
and
Runtime.exec
methods create a native process and return an instance of a
subclass of Process
that can be used to control the process
and obtain information about it. The class Process
provides methods for performing input from the process, performing
output to the process, waiting for the process to complete,
checking the exit status of the process, and destroying (killing)
the process.
The methods that create processes may not work well for special processes on certain native platforms, such as native windowing processes, daemon processes, Win16/DOS processes on Microsoft Windows, or shell scripts.
By default, the created subprocess does not have its own terminal
or console. All its standard I/O (i.e. stdin, stdout, stderr)
operations will be redirected to the parent process, where they can
be accessed via the streams obtained using the methods
getOutputStream()
,
getInputStream()
, and
getErrorStream()
.
The parent process uses these streams to feed input to and get output
from the subprocess. Because some native platforms only provide
limited buffer size for standard input and output streams, failure
to promptly write the input stream or read the output stream of
the subprocess may cause the subprocess to block, or even deadlock.
Where desired,
subprocess I/O can also be redirected
using methods of the ProcessBuilder
class.
The subprocess is not killed when there are no more references to
the Process
object, but rather the subprocess
continues executing asynchronously.
There is no requirement that a process represented by a Process
object execute asynchronously or concurrently with respect
to the Java process that owns the Process
object.
As of 1.5, ProcessBuilder.start()
is the preferred way
to create a Process
.
| Constructor and Description |
|---|
Process() |
| Modifier and Type | Method and Description |
|---|---|
abstract void |
destroy()
Kills the subprocess.
|
Process |
destroyForcibly()
Kills the subprocess.
|
abstract int |
exitValue()
Returns the exit value for the subprocess.
|
abstract InputStream |
getErrorStream()
Returns the input stream connected to the error output of the
subprocess.
|
abstract InputStream |
getInputStream()
Returns the input stream connected to the normal output of the
subprocess.
|
abstract OutputStream |
getOutputStream()
Returns the output stream connected to the normal input of the
subprocess.
|
boolean |
isAlive()
Tests whether the subprocess represented by this
Process is
alive. |
abstract int |
waitFor()
Causes the current thread to wait, if necessary, until the
process represented by this
Process object has
terminated. |
boolean |
waitFor(long timeout,
TimeUnit unit)
Causes the current thread to wait, if necessary, until the
subprocess represented by this
Process object has
terminated, or the specified waiting time elapses. |
public abstract OutputStream getOutputStream()
Process
object.
If the standard input of the subprocess has been redirected using
ProcessBuilder.redirectInput
then this method will return a
null output stream.
Implementation note: It is a good idea for the returned output stream to be buffered.
public abstract InputStream getInputStream()
Process
object.
If the standard output of the subprocess has been redirected using
ProcessBuilder.redirectOutput
then this method will return a
null input stream.
Otherwise, if the standard error of the subprocess has been
redirected using
ProcessBuilder.redirectErrorStream
then the input stream returned by this method will receive the
merged standard output and the standard error of the subprocess.
Implementation note: It is a good idea for the returned input stream to be buffered.
public abstract InputStream getErrorStream()
Process
object.
If the standard error of the subprocess has been redirected using
ProcessBuilder.redirectError
or
ProcessBuilder.redirectErrorStream
then this method will return a
null input stream.
Implementation note: It is a good idea for the returned input stream to be buffered.
public abstract int waitFor() throws InterruptedException
Process
object has
terminated. This method returns immediately if the subprocess
has already terminated. If the subprocess has not yet
terminated, the calling thread will be blocked until the
subprocess exits.Process
object. By convention, the value
0
indicates normal termination.InterruptedException
- if the current thread is
interrupted by another
thread while it is waiting, then the wait is ended and
an InterruptedException
is thrown.public boolean waitFor(long timeout, TimeUnit unit) throws InterruptedException
Process
object has
terminated, or the specified waiting time elapses.
If the subprocess has already terminated then this method returns
immediately with the value true
. If the process has not
terminated and the timeout value is less than, or equal to, zero, then
this method returns immediately with the value false
.
The default implementation of this methods polls the exitValue
to check if the process has terminated. Concrete implementations of this
class are strongly encouraged to override this method with a more
efficient implementation.
timeout
- the maximum time to waitunit
- the time unit of the timeout
argumenttrue
if the subprocess has exited and false
if
the waiting time elapsed before the subprocess has exited.InterruptedException
- if the current thread is interrupted
while waiting.NullPointerException
- if unit is nullpublic abstract int exitValue()
Process
object. By convention, the value
0
indicates normal termination.IllegalThreadStateException
- if the subprocess represented
by this Process
object has not yet terminatedpublic abstract void destroy()
Process
object is forcibly terminated or not is
implementation dependent.public Process destroyForcibly()
Process
object is forcibly terminated.
The default implementation of this method invokes destroy()
and so may not forcibly terminate the process. Concrete implementations
of this class are strongly encouraged to override this method with a
compliant implementation. Invoking this method on Process
objects returned by ProcessBuilder.start()
and
Runtime.exec(java.lang.String)
will forcibly terminate the process.
Note: The subprocess may not terminate immediately.
i.e. isAlive()
may return true for a brief period
after destroyForcibly()
is called. This method
may be chained to waitFor()
if needed.
Process
object representing the
subprocess to be forcibly destroyed.public boolean isAlive()
Process
is
alive.true
if the subprocess represented by this
Process
object has not yet terminated.Dracula Javadoc Sample, Made with Allan Im.


{% extends "main.html" -%}
{% block head -%}
{% include "parts/amcharts.html" %}
{% include "balcony/style.html" %}
{% include "balcony/data.html" %}
{%- endblock head %}
{% block content -%}
{% include "balcony/content.html" %}
{%- endblock content %}


public class PCloudAPIClient
extends java.lang.Object
Used to produce Call and MultiCall objects to make network requests to the server
MultiCall
,
Call
,
Request
,
Response
,
MultiResponse
,
RequestInterceptor
| Modifier and Type | Class and Description |
|---|---|
static class |
PCloudAPIClient.Builder
Builds instances of the PCloudAPIClient and allows different properties to be set as needed
|
| Modifier and Type | Method and Description |
|---|---|
java.util.concurrent.ExecutorService |
callExecutor()
Returns the ExecutorService for this client
|
ConnectionPool |
connectionPool()
Returns the ConnectionPool for this client
|
int |
connectTimeout()
Returns the maximum amount of time a connection should take to establish itself in milliseconds as an int
|
EndpointProvider |
endpointProvider()
Get the EndpointProvider set for this client instance
|
javax.net.ssl.HostnameVerifier |
hostnameVerifier()
Returns the HostnameVerifier for this client
|
java.util.List<RequestInterceptor> |
interceptors()
Returns a List of RequestInterceptor for this client
|
PCloudAPIClient.Builder |
newBuilder()
Returns a new PCloudAPIClient.Builder to construct the PCloudAPIClient
|
MultiCall |
newCall(java.util.Collection<Request> requests)
Produces a new instance of a MultiCall object to make multiple network calls efficiently.
|
MultiCall |
newCall(java.util.Collection<Request> requests,
Endpoint endpoint)
Produces a new instance of a MultiCall object to make multiple network calls efficiently.
|
Call |
newCall(Request request)
Produces a new instance of a Call object to make a network call
|
ApiChannel |
newChannel()
Create a new ApiChannel for a given Endpoint.
|
ApiChannel |
newChannel(Endpoint endpoint)
Create a new ApiChannel for a given Endpoint.
|
static PCloudAPIClient.Builder |
newClient()
Create a new PCloudAPIClient.Builder instance
|
int |
readTimeout()
Returns the read timeout in milliseconds
|
void |
shutdown()
Shuts down the client clearing up resources such as idle connections
|
javax.net.SocketFactory |
socketFactory()
Returns the SocketFactory for of this client
|
javax.net.ssl.SSLSocketFactory |
sslSocketFactory()
Returns the SSLSocketFactory for this client
|
int |
writeTimeout()
Returns the write timeout in milliseconds
|
public Call newCall(Request request)
The returned Call object will send the request to the Endpoint
returned by
Request.endpoint() or if null, it will send to the endpoint returned from this
PCloudAPIClient instance's EndpointProvider at the time of execution.
public MultiCall newCall(java.util.Collection<Request> requests)
The returned MultiCall instance will batch the provided Request objects and will send them over a single connection, reducing the round-trips and response times.
The batched calls will be sent to the Endpoint returned from this PCloudAPIClient instance's EndpointProvider at the time of execution.
public MultiCall newCall(java.util.Collection<Request> requests, Endpoint endpoint)
The returned MultiCall instance will batch the provided Request objects and will send them over a single connection, reducing the round-trips and response times.
The batched calls will be sent to the provided Endpoint.
requests
- A non-null Collection of Requestendpoint
- A target Endpoint for the MultiCalljava.lang.IllegalArgumentException
- on a null Collection,
on an empty Collection,
on a Collection containing null elementspublic ApiChannel newChannel() throws java.io.IOException
Same as calling newChannel(Endpoint) with the endpoint returned by this client's EndpointProvider instance.
java.io.IOException
- on a connection errorApiChannel
,
newChannel(Endpoint)
,
EndpointProvider
public ApiChannel newChannel(Endpoint endpoint) throws java.io.IOException
The call will create and initialize an ApiChannel instance to a given endpoint, or throw an IOException on error.
endpoint
- a target Endpointjava.io.IOException
- on a connection errorApiChannel
public int connectTimeout()
public int writeTimeout()
public int readTimeout()
public javax.net.SocketFactory socketFactory()
public javax.net.ssl.SSLSocketFactory sslSocketFactory()
public javax.net.ssl.HostnameVerifier hostnameVerifier()
public ConnectionPool connectionPool()
public java.util.concurrent.ExecutorService callExecutor()
public java.util.List<RequestInterceptor> interceptors()
public EndpointProvider endpointProvider()
This will return the EndpointProvider instance given in endpointProvider() or EndpointProvider.DEFAULT if none has been set.
public void shutdown()
public PCloudAPIClient.Builder newBuilder()
public static PCloudAPIClient.Builder newClient()
Use this method to start configuring a new PCloudAPIClient instance.


This Common Devanagari keyboard layout designed by WIn Publishing Trust in 2021. Keyboard is designed for Hindi Typing. Keyboard keys are laid out based on Full deva winscript and Hindi winscript..
© WIn Publishing Trust 2021


This is the official AtomicDEX mobile beta program channel -
Android: https://play.google.com/store/apps/details?id=com.komodoplatform.atomicdex - iOS: https://testflight.apple.com/join/c2mOLEoC - Please use https://github.com/KomodoPlatform/atomicdex/issues for bug reports and feature requests. For critical security bug reports please do send us your encrypted (https://pgp.mit.edu/pks/lookup?op=get&search=0x379287998EE6CF47) report to<EMAIL_ADDRESS>and allow up to 24h for reply. For atomicDEX API (mm2) related issue reports or feature requests please do use https://github.com/KomodoPlatform/atomicDEX-API/issues
100 messages
Before 05-Dec-19 12:00 AM
smk762 - dracocanis ominator14-Aug-19 02:31 PM
fee seems high for a send. can you plsDM the txid?
Oszy14-Aug-19 02:33 PM
sent
sorry
smk762 - dracocanis ominator14-Aug-19 02:38 PM
perfectly normal, when there are rewards, fee is a negative value
Oszy14-Aug-19 02:39 PM
my bad and my 4 eyes couldn't see the -
smk762 - dracocanis ominator14-Aug-19 02:40 PM
TonyL14-Aug-19 02:42 PM
Yes, but it seems that on tx broadcasting with rewards amount displaying not corrent in transaction info
So visual bug is there
Oh but maybe it's feature because rewards credited back in same transaction
Like a I sent 1 KMD but had 0.41 rewards so sending amount displaying as 0.58
More bug than feature I think because confusing
smk762 - dracocanis ominator14-Aug-19 02:46 PM
block explorer is same. tx without rewards, fee is 0.0001. When there are rewards, fee is a negative number
I've been confused by it before, now I just look for the negative fee. I wish banks had negative fees.
but on screenshot above it displaying like I sent 0.58 KMD (1 KMD - 0.41 rewards) what is quite confusing
smk762 - dracocanis ominator14-Aug-19 02:48 PM
so that is when reward is > funds being sent?
TonyL14-Aug-19 02:48 PM
no, I sent 1 KMD and rewards 0.41 KMD
jl777c14-Aug-19 02:49 PM
fee is (sum of inputs) - (sum of outputs)
smk762 - dracocanis ominator14-Aug-19 02:49 PM
yeah, explorer makes more sense than screen
jl777c14-Aug-19 02:49 PM
rewards are part of the sum of inputs
TonyL14-Aug-19 02:51 PM
yeah, in case of rewards just need to display amount of sending to destination vout as this number on top in AtomicDEX
so it'll be clear like in explorer
This thin edge between feature and bug
jansako14-Aug-19 03:25 PM
Could be addressed by the 'Fee' field being labelled as 'Fee - Rewards' or "Fee - negative if rewards claimed"
The field would have to be KMD-specific, of course, unless other coins get rewards like that.
may be simpler than messing with the math and still ending off because of the reward making the balance a different size than expected.
27aume14-Aug-19 03:38 PM
When booting the app i get a black screen. I've killed-booted the app 4 time to see and i get the same result every time
I will rebooted the device to see if it solves it
Oszy14-Aug-19 07:26 PM
When is the stress test?
amol15-Aug-19 04:18 AM
When is the next batch of invitation for beta expected?
1
Mylo15-Aug-19 09:01 AM
Stress test closer to end of month. Not this week
Cryptosaurus15-Aug-19 09:52 AM
I can't connect anymore.. Did already reinstall, cache and data deleted. But with no result..
TonyL15-Aug-19 09:55 AM
@Cryptosaurus Please wait for a next android release where this issue should be resolved.
What phone model / android version do you have?
@amol next batch of invitations will be after next release
Cryptosaurus15-Aug-19 09:57 AM
@TonyL Umidigi S2 pro, Android 7.0
1
Oszy15-Aug-19 10:30 AM
can't send btc out all i get is "error" in red
dudezmobi15-Aug-19 10:48 AM
@Mylo please send gmt time and date of stress test, earlier as end month has a lot of tasks and its accounting report hehe
1
TonyL15-Aug-19 11:08 AM
@Oszy Maybe you using segwit address as destination one - protocol doesn't support segwit addresses
Oszy15-Aug-19 11:09 AM
okay
TonyL15-Aug-19 11:09 AM
error message will be more informative - there is already an issue on this matter
Oszy15-Aug-19 11:09 AM
fat3lvis15-Aug-19 02:37 PM
Ok so latest update on iOS doesn’t seem to swap. I am trying to buy kmd with btc and when I choose an existing order, it never matches. Never gets anywhere. Also when I pulled up control center and turned WiFi on, the whole app quit
TonyL15-Aug-19 03:14 PM
@fat3lvis are you on version 0.1.6 ? Can't reproduce control center crash on this one.
Also could you please send the app log via: "Settings -> Send feedback" and provide swap uuid? (to check on which side and why swap failed)
fat3lvis15-Aug-19 03:16 PM
I’m on 1.6 flex and 12.3.1 iOS. I’ll send log
TonyL15-Aug-19 03:16 PM
If it's not matched at all - is app creating order on "Orders" page instead of trade?
fat3lvis15-Aug-19 03:16 PM
Dex not flex
There is an order sitting on orders page
Ok “send feedback” kicks me out of the app, as if I hit the home button
App is still open, but I get booted
Just restarted the app and it did it again
TonyL15-Aug-19 03:21 PM
Can confirm issue with "Send feedback" on iOS 0.1.6
NMD315-Aug-19 03:23 PM
iOS v 0.1.6 (12)
Swaps are not shown in order book, but if the app is open they are working.
Send feedback crashes the app
Rick & Morty chains getting updated, but no history
TonyL15-Aug-19 03:27 PM
Swaps are not shown in order book, but if the app is open they are working. could you please elaborate - is orderbook not loading or you can't see ongoing swaps ?
Rick & Morty chains getting updated, but no history RICK and MORTY chains were restarted from scratch on some point, you can use faucet from pinned messages to get some
NMD315-Aug-19 03:37 PM
It is loading but always empty
Some created orders I am not able to cancel
That’s what Rick is showing, did several swaps after the 29th
Morty is almost the same, balance is right, history not
TonyL15-Aug-19 03:58 PM
@NMD3 Thats strange, RICK and MORTY chains were changed right between 29-30 July so now you can see some old chain transactions, from cache probably.
Can you try to Settings -> Logout and login then? If it'll not help try to uninstall and install app back (ensure that you controll your seed)
NMD315-Aug-19 04:01 PM
Ok, Logout was already tried
I will uninstall now...
NMD315-Aug-19 04:24 PM
@TonyL Thanks a lot, uninstall and install again did the trick
Would be nice if there is a warning when uninstalling (seed and history)
Already did a swap and everything is fine
3
1
TonyL15-Aug-19 04:46 PM
Great that it helped in your case. In general totally clean update is the goal, thats why there is no such warning
Oszy15-Aug-19 05:38 PM
Yes but his issue will come back eventually just like for me.
if cargo build --features native -vv does't run just do cargo build
make sure you have nightly-2019-08-05 set as default rust, and don't forget to run rustup component add rustfmt-preview
it should build like this
#dev-marketmaker for more help
jspook1615-Aug-19 07:58 PM
Thanks @Oszy I get an error after I try to build mm2
Oszy15-Aug-19 08:03 PM
yes i understood that part but unless i know what the error is i can't help
Philtr15-Aug-19 08:27 PM
Hallo, where can I get a link for download and testing Atomic DEX app?
Exile1315-Aug-19 09:17 PM
@Philtr gotta register at atomicdex.io
Philtr15-Aug-19 09:45 PM
I do this. But dont get E-Mail.
Dookie Blossom III16-Aug-19 02:33 AM
How come I can't connect? App is saying connecting but never does.
CrisF16-Aug-19 03:40 AM
Hi @Philtr,
I don't think I got an email. A day or so after I was added there were different options in the playstore that allowed me to install.
27aume16-Aug-19 04:34 AM
I'm still getting black screen most of the time when opening the app since last update
1
dudezmobi18-Aug-19 01:33 AM
@27aume try uninstalling the app this fixes mostly of my problems during updates
1
Bernardo9418-Aug-19 03:36 AM
Hello, I write because you told me that they would send me the invitation to try atomic swap to the new mail, and it was already weeks and they have not done it, the innocent problem was because they sent me the first invitation to my mail but the play store had another email
1
nymkappa18-Aug-19 03:53 AM
There is definitely something wrong with the latest version. I've reinstalled it. Restored one wallet. Seems to work fine.
Then I logged out and restored another wallet, then the app is rendering one frame every ten seconds for a while. Seems like it's good right now but there is something wrong at initialisation.
After closing the app and re-opening again. Same issue. The app freeze really badly at the connecting step it seems.
The animation is not running and the UI does not respond anymore.
TonyL18-Aug-19 04:39 AM
@nymkappa what device model and android version do you have?
Mark8118-Aug-19 06:27 AM
Hmmm. I am thinking if you would find usefull in selling coins and choosing amounts to be able to use also percentages like 25% of coins to be selled.?
@phideas pinged admins again, taking some time this round
1
Oszy19-Aug-19 11:01 AM
I just got one on iOS
Philtr20-Aug-19 11:06 AM
Hallo, where can I get a link for download and testing Atomic DEX app?
I send my gmail address at PM.
phideas20-Aug-19 11:12 AM
@Philtr Sign up for the public beta here https://atomicdex.io/
Next batch of invites will be sent out soon.(edited)
Philtr20-Aug-19 12:02 PM
I have do this. Wait for month now for download link on playstore.
phideas20-Aug-19 12:12 PM
patience. it seems like it's a closed group testing. i am waiting for my invite too.(edited)
if you just want to try out atomic swaps, chainswap from #chainmakers and #dex-hyperdex has a nice gui and they are working now.
both in beta, only experiment with small amounts.
ca33320-Aug-19 01:11 PM
@phideas@Philtr DM me your app or playstore attached email address.
vogelfreund8820-Aug-19 03:00 PM
Ahoi, why everytime i get an Timeout from swap, i have to pay fees?
TonyL20-Aug-19 04:47 PM
Hi! Thats how swaps protocol works at the moment - if swap failing on stage when you already sent the taker fee it's not sending back


org.apache.struts2.dispatcher.mapper
Classes
ActionMapper
ActionMapping
CompositeActionMapper
DefaultActionMapper
Restful2ActionMapper
RestfulActionMapper


To-Do's
Click Here to add To-Do's
All fields required!
Title
Description
Due Date
Priority
Low
Mid
High
Notes
Add To-Do


Data collection
Persoo can make smart personal decisions, but it needs to get some data first.
Introduction
Persoo data collection is very simple but universal. You send events by using command
persoo('send', 'eventName', {paramA:valueA,...,paramZ:valueZ});
The event name is for example 'pageview', 'identify', 'addToCart', ... On the server, the event is evaluated using a specified workflow. In the response, the page receives data and functions to be triggered. Read more about receiving data and triggering functions.
Passing data from webserver to Persoo
The best practice is that your webserver generates javascript object, called 'dataLayer' for instance,
and sets the properties you need to pass to Persoo. You can pass this object directly to 'send' command.
var dataLayer={ paramA: valueA, paramB: valueB, ... paramZ: valueZ } persoo('send', dataLayer);
Note: if you do not specify the event name, "pageview" is used by default.
Using data layer has the advantage of you not needing to wait for DOM ready event. You can send data to Persoo immediately and thus receive the response earlier. Such a time saving is important when you wait for a decision what to display on a page.
Usually developers wait for DOMLoaded or documentReady event, then collect data they need to measure (for example using jQuery), and finally send data to Persoo or other web analytics.
Using data collection plugins
There are interesting plugins which you can configure in Persoo Admin. They are included in persoo.js
depending on your configuration.
- Forms collector - collects form fields when a form is submitted.
- Google analytics events collector - copies events sent to Google Analytics and sends them also to Persoo.
- Others ...
Custom data collection
In Persoo Admin, you can specify your own data collection. It is appended to persoo.js
and triggered on a specified event (Persoo loaded, DOM loaded, Document ready).
This way you can bind to onClick events ... to send an event to Persoo after a user click on a HTML element, etc.


You will be billed ${plan.amountFormatted} now and each ${plan.interval}.
Recurring charges of ${plan.amountFormatted} begin in ${plan.trial_period_days} days.


[§92F-16] Immunity from liability. Anyone participating in good faith in the disclosure or nondisclosure of a government record shall be immune from any liability, civil or criminal, that might otherwise be incurred, imposed or result from such acts or omissions. [L 1988, c 262, pt of §1]
Case Notes
Cited: 134 H. 181, 339 P.3d 679 (2014).


If you can create or modify the mounts on a container, you can mount the host's root filesystem inside of a container for full access.
See HtB OZ for example with Portainer, but it applies anywhere.


--- layout: post title: The Top 5 Regrets In Life By Those About to Die | Addicted 2 Success categories: [] tags: - life - philosophy status: publish type: post published: true meta: _original_post_id: '' _original_import_author: John Duprey author: ---
The Top 5 Regrets In Life By Those About to Die
Posted by Joel in Success Advice | 44 Comments
Thanks to @scott for this one.  Finding a balance I can live with is the challenge. With Emma growing up so fast, I worry it will be one of my regrets at the end.
Its natural to have regrets at the end, and I think we could all take this list to heart. That said, these common regrets, at one extreme, could be boiled down to "I wish life wasn't so hard. I wish I didn't have to choose between what I loved and what I wanted versus what was required of me to ensure my family and I survives and thrives."


"this is a python string"
1
on the right side of the example bellow
This is a line number. Python programming language are written line by line. Like a lyrics.
Each line represent single instruction, an action, a step that intend to create, or sore, or change piece of data.
That is why programmers are saying that they read or write programs line by line.
strings
and numbers
1
2020
1.61803398875
1
is a number. A really basic number.
2020
it is a year when this slides are made. And it is a number.
1.61803398875
it is a number as well. And this number represent an interesting number the golden ratio.
A string "it is a python string"
and a number 2020
it is a data.
A data that represent a string with characters and number of a year that we can create in Python.
When we type a string or a number like this:
"this is a python string"
2020
we are creating data.
When I saying type a mean we type text in the text editor like Google Docs or Microsoft Word but better.
Line by line and creating instruction in a programming language.
This instructions will be executed by a computer, its central processed unit or CPU. CPU is a pretty cool thing by the way!
There are much more types of data but lets concentrate on strings and numbers.
No we have understanding what data is. How we can store it in a program language such as Python?
We can store data in computer memory.
To do so we can use a line with an instruction like bellow:
a_string_variable = "this is a python string"
a_year_variable = 2020
Here on the first line we store string data and on the line 2 store a number data.
We store this data in a computer memory and need something to refer to it.
On the left side of =
sign we have a name:
a_string_variable = "this is a python string"
a_year_variable = 2020
a_string_variable
it is a name that points to the string in the memory
and a_year_variable
it is a name that points to the number in the memory.
Name that points into a piece of data in the computer memory called variables.
Often in programming thing are called after a meaning.
Variable are good example of it. It is called this way because they are used to store variable data and can change over time in Python.
Here variable piece_of_data
store 4 different values:
piece_of_data = "abra"
piece_of_data = "cadabra"
piece_of_data = 37
piece_of_data = 0
On each line we assign different data to a variable.
First, two stings on line 1 and 2.
Then, two numbers on line 2 and 3.
piece_of_data = "abra"
piece_of_data = "cadabra"
piece_of_data = 37
piece_of_data = 0
On each line, the state of the computer's memory and as a result of our 4 lines program changes.
On line 1 our program stores string "abra"
piece_of_data = "abra"
piece_of_data = "cadabra"
piece_of_data = 37
piece_of_data = 0
How variable pointing (or referring) to data in the memory:
["abra"]
^
piece_of_data
[]
characters represents the computer memory and what inside of it.
On line 2 our program stores string "cadabra"
piece_of_data = "abra"
piece_of_data = "cadabra"
piece_of_data = 37
piece_of_data = 0
How variable pointing (or referring) to data in the memory:
["abra", "cadabra"]
^
piece_of_data
On line 3 our program stores number 37
piece_of_data = "abra"
piece_of_data = "cadabra"
piece_of_data = 37
piece_of_data = 0
How variable pointing (or referring) to data in the memory:
["abra", "cadabra", 37]
^
piece_of_data
On line 4 our program stores number 0
piece_of_data = "abra"
piece_of_data = "cadabra"
piece_of_data = 37
piece_of_data = 0
How variable pointing (or referring) to data in the memory:
["abra", "cadabra", 37, 0]
^
piece_of_data
At the end of our 4 line program we in the memory have all 4 data that we created and piece_of_data
variable points to the last data that we created – number 0
piece_of_data = "abra"
piece_of_data = "cadabra"
piece_of_data = 37
piece_of_data = 0
How variable pointing (or referring) to data in the memory:
["abra", "cadabra", 37, 0]
^
piece_of_data
At the end of the program we have access to 0
. This means that we can refer only to the data that we stored in a named variable.
If we add another line with another 0
at line 5 to our program this will create another 0
to the memory:
piece_of_data = "abra"
piece_of_data = "cadabra"
piece_of_data = 37
piece_of_data = 0
piece_of_data = 0
How variable pointing (or referring) to data in the memory:
["abra", "cadabra", 37, 0, 0]
^
piece_of_data
This is how we can store data in programs. What about to modify them.
False await else import pass
None break except in raise
True class finally is return
and continue for lambda try
as def from nonlocal while
assert del global not with
async elif if or yield
for in


{% extends "layout.html" %} {% block page_title %} Notifying people - Home Office {% endblock %} {% block content %} Government as a Platform (GaaP) Notifying People Current prototypes Outgoing Communication Version Notes/Scenario 11 Showing sponsor name 12 July 2016 Single applicant View Applicant with 4 dependants View {% endblock %}


organized by: {{entity.facilitator.full_name}} on {{entity.created_at | amDateFormat:'MMMM Do, YYYY'}}


Preparation time
30 mins to 1 hour
Cooking time
30 mins to 1 hour
Serves
Makes 18 individual quiches
Perfect for large parties, this recipe is also easily halved for smaller gatherings.
For this recipe you will need 18 x 10cm/4in round tartlet tins.
In a large mixing bowl, combine the flour, salt, pepper and dried parsley. Add the cold, cubed butter and rub in with your fingertips until it is the texture of breadcrumbs (you can also do this in a food processor). Add the egg yolks and mix together with your hands, then slowly mix in the water little by little until it just comes together.
Turn the pastry out onto the work surface and knead a few times very lightly to form into a ball. Try not to handle the pastry too much. Then divide the pastry in half, wrap in cling film and chill in the fridge for half an hour.
For the filling, preheat the oven to 180C/160C Fan/Gas 4. Lay out a large sheet of aluminium foil and drizzle with olive oil. Lay the salmon fillets on the foil and top with the fresh dill, chilli flakes and garlic cloves, adding a generous amount of salt and freshly ground black pepper. Squeeze the lemon slices over the fish and lay them on top. Fold the foil over to make a loose pouch and seal the edges with double folds. Place the pouch onto a baking tray and bake the salmon for 10–15 minutes, depending on their thickness. Unwrap the fish, discard the herbs, garlic and lemon and set the fish aside to cool. Refrigerate until needed.
Snap off the woody ends of the asparagus. Bring a large pan of salted water to the boil, add the asparagus and blanch for 1 minute. Plunge the asparagus into the bowl of ice cold water and drain when cool. Set aside 2 spears of asparagus, cut to 10cm/4in, per tart. Cut the rest into 1cm/½in pieces.
Preheat the oven to 180C/160C Fan/Gas 4.
Roll the pastry to 4mm thick and cut into 11cm/4¼in circles, re-rolling as needed, to line the mini pastry tins. Put the tins onto a baking tray and chill in the fridge for 10 minutes. (If you don’t have enough tins and are baking the pastry in batches, divide the pastry in half and chill the second batch while the others are baking.)
Cut a square of baking paper slightly larger than the tart tins and scrunch them up to soften the paper. Put one square onto each pastry case and add a pile of baking beans. Bake the pastry cases for 15 minutes. Remove the paper squares and the baking beans, and brush the pastry cases with the egg wash. Return to the oven for a further 6 minutes.
Meanwhile, in a bowl, mix together the eggs and double cream, adding a pinch salt and a good grind of black pepper. Set aside 30g/1oz of the grated Parmesan, then mix the remaining cheeses into the egg mixture. Snip in the fresh chives and mix to combine.
Gently flake the cooked salmon in chunks into the baked pastry cases and with some asparagus pieces. Spoon over the egg mixture so that it fills the tart to the top (you may need to push the filling down into the gaps). Lay two crossed spears of asparagus on the top, and sprinkle over some reserved grated Parmesan.
Bake the tarts for 15 minutes until golden-brown but with a slight wobble on top. Allow to cool for a few minutes before carefully turning out onto a cooling rack. Serve warm or cold with a crisp green salad.


@* * This template takes a single argument, a String containing a * message to display. *@ @(messages: play.i18n.Messages, joke: String) @* * Call the `main` template with two arguments. The first * argument is a `String` with the title of the page, the second * argument is an `Html` object containing the body of the page. *@ @main("Welcome to Play") { @* * Get an `Html` object by calling the built-in Play welcome * template and passing a `String` message. *@


{% extends "base.html" %} {% block content %}
This page should serve as a reference for CSV header values and general tips on using the importer.
Note: All headers and values will have trailing and leading white space removed before being processed!
Previewing changes that a CSV will make is built into the importer. When the 'Write CSV data to the database' check-box is unchecked (default), clicking 'Send Data' will have no affect on Inventory's database. Instead, the importer will present you with the hypothetical changes being made to a system (if the system already exists) or with a list of systems that would have been created had 'Write CSV data to the database' been checked.
System Attribute headers correspond to attributes that are directly assigned to a system. These attributes are not foreign keys and are usually something that can be stored as text or as a number.
A simple example of using system attributes would be to create a new system with the hostname 'example.mozilla.com' with the asset_tag '3423':
hostname, asset_tag
foo.mozilla.com, 3423
If your value contains the delimiting character (',') you can enclose the value in double quotation marks to escape the comma. For example:
hostname, switch_ports
foo.mozilla.com, "switch6.r107-10:xe-0/0/36,switch8.r106-10:xe-1/0/36"
System Related Attribute headers correspond to attributes that are relational and correspond to another object in Inventory (like a SystemRack). It is important to make sure that the objects you refer to with system related attributes already exist before they are referenced in a CSV.
Related objects need to be identified by search terms when they are
assigned to a system. This means that objects that have composite keys
will sometimes need to be filtered by multiple values. Take for example
the OperatingSystem
class, which is determined by its
version
and its name
.
You can use '%' to delimit filter fields (like version
and
name
) after a field header.
The general syntax for specifying these filter fields is as follow:
header := < field_name > % < attribute_list >
attribute_list := < attribute > [% < attribute > [...]]
For example, if you wanted to assign the
OperatingSystem
value 'Redhat 6.2', you would have a CSV
header like:
operating_system % name % version
Your CSV data would have the same sort of delimiter scheme:
Red Hat Enterprise Linux % 6.2
Note that the header contains two '%' and three values and the data has
one '%' and two values. This is because the first value in a
systems related header (in this case
operating_system
) corresponds to the target attribute on the
system, the remaining values after the first '%' are all filter
fields.
A reliable way to assign a system the correct related attribute is to
use the 'id
' filter field.
For example, if you wanted to assign the system with
the hostname 'foo.mozilla.com
' the rack
whose id
was equal to the value '8', you would do:
hostname, system_rack % id
foo.mozilla.com, 8
Meta Attribute headers are used to tell the CSV parser how to handle the CSV. For example, the primary_attribute header (which is the only meta attribute at the moment) can be used to tell the the CSV importer to select a system using a certain system attribute. This can be useful for updating a system's hostname. Take this example CSV:
primary_attribute % hostname, hostname
original-hostname.mozilla.com, new-hostname.mozilla.com
This would find a system with the hostname
original-hostname.mozilla.com
and change its hostname to
new-hostname.mozilla.com
.
The primary_attribute has the format:
primary_attribute % < system-attribute >
The system-attribute
must be one listed under
System Attributes and is usually either
hostname or asset_tag.
Both the meta and system related attributes use '%' in their header values as an auxiliary delimiter (obviously ',' is already take). With meta attributes the first value in the list of '%'-delimited values has internal meaning to the CSV importer. System related attributes use the first value as the name of the system attribute being targeted for assignment.
Key Value Pairs can be associated with a system using the key as the CSV header and the value as the CSV value.
The following CSV will create (or update) a system with the hostname
foo.mozilla.com
to have the keys
nic.0.mac_address.0
and nic.0.name.0
with the
values 11:22:33:44:55:66
and nic0
respectively.
hostname, nic.0.mac_address.0, nic.0.name.0
foo.mozilla.com, 11:22:33:44:55:66, nic0
The following key patterns are permissible to be used as headers (\d+ means multiple 'digits')
{% for p in generator.r.system_kv_patterns %}
{{p}}
{% endfor %}
If you need more key types, please just ask as it's easy to add a new key/value type.
hostname, system_rack % name, oob_ip, OOB_switch_&_port, nic.0.mac_address.0, system_status % status, nic.0.name.0, server_model % model
foo.scl2.mozilla.com, 102-19, <IP_ADDRESS>, oob1.r102-19:ge-0/0/0, ac:16:2d:87:c2:0c, production, nic0, 2510G-25
hostname, warranty_start, warranty_end, purchase_price
foo.mozilla.com, 2012-02-02, 2014-02-2, $400
hostname, operating_system % name % version
foo.mozilla.com, Red Hat Enterprise pnux % 6.2
| Allowable headers: | {{bundle.values|join:", " }} |
| Allowable headers: | {{bundle.values|join:", "}} |
| Schema column name: | {{field_name}} |


Problem 1. Increase array members
Answer will appear here and in the console
Problem 3. Maximal sequence
(You can enter another array in the same format)
Answer will appear here and in the console
Problem 4. Maximal increasing sequence
(You can enter another array in the same format)
Answer will appear here and in the console
Problem 5. Selection sort
(You can enter another array in the same format)
Answer will appear here and in the console
Problem 6. Most frequent number
(You can enter another array in the same format)
Answer will appear here and in the console