LVM
Section: Maintenance Commands (8)Updated: LVM TOOLS 2.02.95(2)-RHEL6 (2012-10-16)
Index Return to Main Contents
NAME
lvm - LVM2 toolsSYNOPSIS
lvm [command | file]DESCRIPTION
lvm provides the command-line tools for LVM2. A separate manual page describes each command in detail.If lvm is invoked with no arguments it presents a readline prompt (assuming it was compiled with readline support). LVM commands may be entered interactively at this prompt with readline facilities including history and command name and option completion. Refer to readline(3) for details.
If lvm is invoked with argv[0] set to the name of a specific LVM command (for example by using a hard or soft link) it acts as that command.
On invocation, lvm requires that only the standard file descriptors stdin, stdout and stderr are available. If others are found, they get closed and messages are issued warning about the leak.
Where commands take VG or LV names as arguments, the full path name is optional. An LV called "lvol0" in a VG called "vg0" can be specified as "vg0/lvol0". Where a list of VGs is required but is left empty, a list of all VGs will be substituted. Where a list of LVs is required but a VG is given, a list of all the LVs in that VG will be substituted. So "lvdisplay vg0" will display all the LVs in "vg0". Tags can also be used - see addtag below.
One advantage of using the built-in shell is that configuration information gets cached internally between commands.
A file containing a simple script with one command per line can also be given on the command line. The script can also be executed directly if the first line is #! followed by the absolute path of lvm.
BUILT-IN COMMANDS
The following commands are built into lvm without links normally being created in the filesystem for them.- dumpconfig --- Display the configuration information after
- loading lvm.conf (5) and any other configuration files.
- formats --- Display recognised metadata formats.
- help --- Display the help text.
- pvdata --- Not implemented in LVM2.
- segtypes --- Display recognised logical volume segment types.
- version --- Display version information.
COMMANDS
The following commands implement the core LVM functionality.- pvchange --- Change attributes of a physical volume.
- pvck --- Check physical volume metadata.
- pvcreate --- Initialize a disk or partition for use by LVM.
- pvdisplay --- Display attributes of a physical volume.
- pvmove --- Move physical extents.
- pvremove --- Remove a physical volume.
- pvresize --- Resize a disk or partition in use by LVM2.
- pvs --- Report information about physical volumes.
- pvscan --- Scan all disks for physical volumes.
- vgcfgbackup --- Backup volume group descriptor area.
- vgcfgrestore --- Restore volume group descriptor area.
- vgchange --- Change attributes of a volume group.
- vgck --- Check volume group metadata.
- vgconvert --- Convert volume group metadata format.
- vgcreate --- Create a volume group.
- vgdisplay --- Display attributes of volume groups.
- vgexport --- Make volume groups unknown to the system.
- vgextend --- Add physical volumes to a volume group.
- vgimport --- Make exported volume groups known to the system.
- vgimportclone --- Import and rename duplicated volume group (e.g. a hardware snapshot).
- vgmerge --- Merge two volume groups.
- vgmknodes --- Recreate volume group directory and logical volume special files
- vgreduce --- Reduce a volume group by removing one or more physical volumes.
- vgremove --- Remove a volume group.
- vgrename --- Rename a volume group.
- vgs --- Report information about volume groups.
- vgscan --- Scan all disks for volume groups and rebuild caches.
- vgsplit --- Split a volume group into two, moving any logical volumes from one volume group to another by moving entire physical volumes.
- lvchange --- Change attributes of a logical volume.
- lvconvert --- Convert a logical volume from linear to mirror or snapshot.
- lvcreate --- Create a logical volume in an existing volume group.
- lvdisplay --- Display attributes of a logical volume.
- lvextend --- Extend the size of a logical volume.
- lvmchange --- Change attributes of the logical volume manager.
- lvmdiskscan --- Scan for all devices visible to LVM2.
- lvmdump --- Create lvm2 information dumps for diagnostic purposes.
- lvreduce --- Reduce the size of a logical volume.
- lvremove --- Remove a logical volume.
- lvrename --- Rename a logical volume.
- lvresize --- Resize a logical volume.
- lvs --- Report information about logical volumes.
- lvscan --- Scan (all disks) for logical volumes.
- The following commands are not implemented in LVM2 but might be in the future: lvmsadc, lvmsar, pvdata.
OPTIONS
The following options are available for many of the commands. They are implemented generically and documented here rather than repeated on individual manual pages.- -h | --help --- Display the help text.
- --version --- Display version information.
- -v | --verbose --- Set verbose level.
- Repeat from 1 to 3 times to increase the detail of messages sent to stdout and stderr. Overrides config file setting.
- -d | --debug --- Set debug level.
- Repeat from 1 to 6 times to increase the detail of messages sent to the log file and/or syslog (if configured). Overrides config file setting.
- --quiet --- Suppress output and log messages.
- Overrides -d and -v.
- -t | --test --- Run in test mode.
- Commands will not update metadata. This is implemented by disabling all metadata writing but nevertheless returning success to the calling function. This may lead to unusual error messages in multi-stage operations if a tool relies on reading back metadata it believes has changed but hasn't.
- --driverloaded { y | n }
- Whether or not the device-mapper kernel driver is loaded. If you set this to n, no attempt will be made to contact the driver.
- -A | --autobackup { y | n }
- Whether or not to metadata should be backed up automatically after a change. You are strongly advised not to disable this! See vgcfgbackup (8).
- -P | --partial
- When set, the tools will do their best to provide access to volume groups that are only partially available (one or more physical volumes belonging to the volume group are missing from the system). Where part of a logical volume is missing, /dev/ioerror will be substituted, and you could use dmsetup (8) to set this up to return I/O errors when accessed, or create it as a large block device of nulls. Metadata may not be changed with this option. To insert a replacement physical volume of the same or large size use pvcreate -u to set the uuid to match the original followed by vgcfgrestore (8).
- -M | --metadatatype type
- Specifies which type of on-disk metadata to use, such as lvm1 or lvm2, which can be abbreviated to 1 or 2 respectively. The default (lvm2) can be changed by setting format in the global section of the config file.
- --ignorelockingfailure
- This lets you proceed with read-only metadata operations such as lvchange -ay and vgchange -ay even if the locking module fails. One use for this is in a system init script if the lock directory is mounted read-only when the script runs.
- --addtag tag
- Add the tag tag to a PV, VG or LV. Supply this argument multiple times to add more than one tag at once. A tag is a word that can be used to group LVM2 objects of the same type together. Tags can be given on the command line in place of PV, VG or LV arguments. Tags should be prefixed with @ to avoid ambiguity. Each tag is expanded by replacing it with all objects possessing that tag which are of the type expected by its position on the command line. PVs can only possess tags while they are part of a Volume Group: PV tags are discarded if the PV is removed from the VG. As an example, you could tag some LVs as database and others as userdata and then activate the database ones with lvchange -ay @database. Objects can possess multiple tags simultaneously. Only the new LVM2 metadata format supports tagging: objects using the LVM1 metadata format cannot be tagged because the on-disk format does not support it. Snapshots cannot be tagged. Characters allowed in tags are: A-Z a-z 0-9 _ + . - and as of version 2.02.78 the following characters are also accepted: / = ! : # &
- --deltag tag
- Delete the tag tag from a PV, VG or LV, if it's present. Supply this argument multiple times to remove more than one tag at once.
- --alloc AllocationPolicy
- The allocation policy to use: contiguous, cling, normal, anywhere or inherit. When a command needs to allocate physical extents from the volume group, the allocation policy controls how they are chosen. Each volume group and logical volume has an allocation policy. The default for a volume group is normal which applies common-sense rules such as not placing parallel stripes on the same physical volume. The default for a logical volume is inherit which applies the same policy as for the volume group. These policies can be changed using lvchange (8) and vgchange (8) or over-ridden on the command line of any command that performs allocation. The contiguous policy requires that new extents be placed adjacent to existing extents. The cling policy places new extents on the same physical volume as existing extents in the same stripe of the Logical Volume. If there are sufficient free extents to satisfy an allocation request but normal doesn't use them, anywhere will - even if that reduces performance by placing two stripes on the same physical volume.
- N.B. The policies described above are not implemented fully yet. In particular, contiguous free space cannot be broken up to satisfy allocation attempts.
ENVIRONMENT VARIABLES
- LVM_SYSTEM_DIR
- Directory containing lvm.conf and other LVM system files. Defaults to "/etc/lvm".
- HOME
- Directory containing .lvm_history if the internal readline shell is invoked.
- LVM_VG_NAME
- The volume group name that is assumed for any reference to a logical volume that doesn't specify a path. Not set by default.
VALID NAMES
The following characters are valid for VG and LV names: a-z A-Z 0-9 + _ . -VG and LV names cannot begin with a hyphen. There are also various reserved names that are used internally by lvm that can not be used as LV or VG names. A VG cannot be called anything that exists in /dev/ at the time of creation, nor can it be called '.' or '..'. A LV cannot be called '.' '..' 'snapshot' or 'pvmove'. The LV name may also not contain the strings '_mlog', '_mimage', '_rimage', '_tdata', '_tmeta'.
DIAGNOSTICS
All tools return a status code of zero on success or non-zero on failure.FILES
/etc/lvm/lvm.conf$HOME/.lvm_history
SEE ALSO
clvmd(8), lvchange(8), lvcreate(8), lvdisplay(8), lvextend(8), lvmchange(8), lvmdiskscan(8), lvreduce(8), lvremove(8), lvrename(8), lvresize(8), lvs(8), lvscan(8), pvchange(8), pvck(8), pvcreate(8), pvdisplay(8), pvmove(8), pvremove(8), pvs(8), pvscan(8), vgcfgbackup(8), vgchange(8), vgck(8), vgconvert(8), vgcreate(8), vgdisplay(8), vgextend(8), vgimport(8), vgimportclone(8), vgmerge(8), vgmknodes(8), vgreduce(8), vgremove(8), vgrename(8), vgs(8), vgscan(8), vgsplit(8), readline(3), lvm.conf(5)
Index
- NAME
- SYNOPSIS
- DESCRIPTION
- BUILT-IN COMMANDS
- COMMANDS
- OPTIONS
- ENVIRONMENT VARIABLES
- VALID NAMES
- DIAGNOSTICS
- FILES
- SEE ALSO
This document was created by man2html, using the manual pages.
Time: 05:34:27 GMT, December 24, 2015


Files are hosted by servers and HTTP allows browsers to communicate with servers.
HTML is made up of:
text content
markup
references to other documents
links to other pages
ex. < name >contents< /name >
This unit is referred to as an element.
Tag Examples
bold tag: < b >HTML Attributes
ex. < tag attr=”value” >contents< /tag >
Anchor: used for making links.
ex. the button
Image: used to include images
Ex. < img src=”url” alt=”text” >
No closing tag required; called a void tag.
Whitespace
Paragraph: < p >
Can be used to create "block" break. More info below.
Inline/Block
Inline ex.: < br >, < em >, < img >, < span >, < strong >
No invisible box around contents
Block ex.: < p >, < div >, < form >
Invisible box around contents; can have height and width.
HTML doc structure


Class Information
Class Standard
Add Sections
Group Name
ClassRoom No
No Of Seats
No Of Students
Group Name
Room No
No of Seats
No of Students
Remove
{{section.groupname}}
{{section.roomno}}
{{section.noofseats}}
{{section.noofstudents}}


Kenyan High Schools Scholarship Programs
Sign up to get alerts when applications are open.
Equity Bank Wings to Fly
The Wings to Fly scholarship program, an initiative of the Equity Group and Mastercard Foundation (MCF), was established to support secondary education for top-performing children from financially challenged backgrounds in Kenya. The program offers access to leadership training to previously marginalized children in all counties.
The program offers comprehensive support for the scholars through the provision of tuition fees, accommodation, books, uniforms, shopping, pocket money, and transport to and from school during their 4 years of secondary education.
Requirements
- Candidates must be Kenyan citizens from the 47 counties
- Must be a KCPE candidate who sat for the examination that year, awaiting to join high school
- Must have scored 350/500 marks and above in their KCPE exams
- Candidates must come from a needy background
Process
- Applicants should create a new account at Equity Group Foundation and fill in the application form for consideration.
- Applicants can also collect the application from the nearest Equity Bank Branch.
- To complete the online process, you will be required to have soft/scanned copies of the following documents:
• KCPE Results Slip (official KNEC slip or signed & stamped paper from the school)
• Copy of Death Certificate (if father/mother is/are deceased), Evidence of financial support (if you have received support in the past)
• Evidence of special needs (if you have indicated that you are special needs learner)
• Copy of Payslip / Bank Statement (if parents/guardians are employed / business person)
• Signed Declaration by Applicant and Parent / Guardian
• Copy of Birth Certificate
• Filled application and recommendation form by Head Teacher, Provincial Administration, Religious Leader or any other leader
Only shortlisted candidates will be invited for interviews.
Any false statements, omissions or forged documents will lead to automatic disqualification.
Application Deadline
Applications are currently closed. Applications will be available one month after the release of KCPE results and closed in March depending on that year.
Click here for more information.
KCB Foundation Scholarships
KCB Foundation Scholarship is offered to students, who have excelled in their KCPE exam, from needy families and those with disabilities. It covers student’s high school tuition fees for 4 years, books, internships opportunities, and tools for students with disabilities.
Requirements
- Applicants must come from a needy home
- The applicant must attain the prescribed county cut off marks in the Kenya Certificate of Primary Education (KCPE) examination
- The applicant must have a calling letter to a national or county/ex-county secondary school
- Must have done his/her KCPE in a public primary school
- Must be admitted to a public national or County school
County cutoff KCPE marks
- 400 marks cutoff counties
• Kiambu, Nairobi
- 390 marks cutoff counties
• Nakuru, Meru, Machakos, and, Mombasa
- 370 marks cutoff counties
• Bungoma, Embu, Homabay, Kitui, Kericho, Kisii, Nandi
• Kirinyaga, Kisumu, Kakamega, Laikipia, Migori, Uasin Gishu
• Nyamira, Nyandarua, Nyeri, Trans Nzoia, Muranga, Vihiga
- 350 marks cutoff counties
• Kilifi, Makueni, Baringo, Elgeyo Marakwet, Siaya, Mandera, Kajiado
• Marsabit, Tharaka Nithi, Narok, Turkana, Busia, Taita Taveta, Isiolo
• Wajir, Garissa, Samburu, Tana River, Kwale, West Pokot, Lamu
Process
- Download the KCB Scholarship Application form from KCB foundation.
- Applicants can also collect application forms at any KCB Branch countrywide. The forms are available in the branches starting 1st December.
- Fill the form, attach a copy of your result slip and passport photo.
- Submit the form to the nearest KCB Bank in the county where you sat for your KCPE exams.
- Candidates will have to send their applications to<EMAIL_ADDRESS>for consideration.
- Students who are selected to proceed to the final interview stage will be contacted in early May.
- Selection interviews are tentatively set for mid-May in Eldoret.
Successful candidates will be shortlisted for interviews.
Applicants with disabilities are recruited through the county social development offices and integrated /special primary schools.
Home visits are conducted to verify the needy status of the shortlisted candidates.
Selected candidates are assigned to individual mentors and begin school.
Application Deadline
Applications are currently closed. Applications will be open after the release of KCSE results.
Click here for more information.
Family Bank Foundation Scholarships
This is a scholarship program that helps bright and needy students from poor families to join high school in Kenya.
Requirements
- The student must have scored 350/500 marks and above in the KCPE national exam
- Applicants must be KCPE candidates who sat for the examination that year, awaiting to join high school
- The student must have an acceptance letter to a National or County School
- The student MUST demonstrate a need for financial assistance
- Should be proficient in English Language and Easy Writing skills
- Has been involved in extracurricular activities in high school or community
Process
- Pick up an application form at any Family Bank Limited Branch OR download it from the Family Group Foundation.
- Complete the application form.
- Attach your KCPE result slip, High School Admission Letter, Birth Certificate copy, and recommendation letter from a government/community leader.
- Return your completed form to the nearest Family Bank Branch Manager.
Successful candidates will be contacted by their nearest Family Bank Branch Manager.
Application Deadline
Applications are currently closed. Applications will be open after the release of KCPE results.
Click here for more information.
Jomo Kenyatta Foundation Scholarships
The JKF Scholarship Programme improves access to education and transition through the provision of scholarships and mentorship to academically promising Kenyan orphans and children from poor vulnerable backgrounds in public secondary schools. The scholarship covers tuition and uniform.
Requirements
To qualify applicants must meet the following criteria:
- Poor orphan
- Poor child with disability
- Child rendered vulnerable by factors affecting access to education
- A child suffering from extreme poverty
- Child who attains 70% of the maximum marks or as agreed by the Board of Directors for marginalized areas and persons with disabilities
Process
- The application is done by filling either an online application form or a hard copy immediately after the release of the Kenya Certificate of Primary Education (KCPE) results.
- Application forms are available from JKF website or JKF head office, JKF BDC Kijabe Street, County, and Sub County Education offices countrywide.
- Applicants will be required to provide the following documents:
• Birth Certificate
• Death Certificate/Burial Permit (of a deceased parent)
• KCPE Results Slip
• Recommendation letter from Local Administration
Successful applicants will be invited for a rigorous interview process.
Home visits are carried out by the JKF staff to confirm applicants' family life status.
Application Deadline
Applications are currently closed. Interested students are invited to apply immediately after the release of KCPE results.
Click here for more information.
KTDA National Scholarships
KTDA Foundation grants scholarships to needy and bright students in KTDA growing areas for high school education.
Requirements
- Applicants must be Kenyan citizens
- MApplicants must be a needy student
- A student must have scored 350/500 marks and above in the KCPE national exam
- Applicants must be a KCPE candidates who sat for the examination that year, awaiting to join high school.
- Applicants should be from any of the 70 KTDA-managed tea factory catchment areas
Process
- Interested candidates are invited to collect the application forms from any of the KTDA factories.
- Applicants can also download the application form from KTDA Foundation or KTDA Teas.
- Applicants are required to provide the following documents:
• A certified copy of the KCPE result slip.
• Copy of birth certificate.
• Copy of Form One admission letter (whereas the application form can be submitted without this, the candidate MUST provide a copy of the Form One joining instructions as soon as available).
• Evidence of being an orphan where applicable.
- Application forms must be returned to the Factory Unit Manager at the nearest KTDA-managed tea factory.
Successful candidates will be conducted by the Factory Unit Manager from the nearest KTDA manager tea factory.
Application Deadline
Applications are currently closed. Interested students are invited to apply immediately after the release of KCPE results.
Click here for more information.
Elimu Scholarships
Elimu Scholarship Programme targets needy (orphan or vulnerable) Kenya Certificate of Primary Education (KCPE) candidates. The program caters for tuition fees, books, and other educational expenses for students. Beneficiaries are identified by assessing their performance in the KCPE Examination that is administered nationally.
Requirements
- Must be a KCPE candidate who sat for the examination that year, awaiting to join high school
- Must have scored 280 marks and above in their KCPE exams
- Candidates with special needs and disabilities (physical, hearing, and visual impairments, autism, albinism, learning disabilities, and others)
- Orphans and vulnerable children
- Candidates from vulnerable communities in the target Sub-Counties
- Candidates from urban centers with informal settlements
- Candidates:
(i) whose parents/guardians are living with disabilities that have compromised their ability to meet the financial obligations of their children
(ii) whose families are affected by HIV/AIDS and other chronic illnesses with debilitating effects that could render parents and guardians destitute and unable to fend for their families
(iii) whose families are affected by extreme poverty rendering them unable to educate their children
(iv) who have suffered from neglect, abuse and have no support to continue with their education
Process
- Applicants should create a new account at EGF and fill in the application form for consideration.
- Applicants can also collect the application form from the nearest Equity Bank Branch.
- To complete the online process, you will be required to have soft/scanned copies of the following documents:
• KCPE Results Slip (official KNEC slip or signed & stamped paper from the school)
• Copy of Death Certificate (if father/mother is/are deceased)
• Evidence of financial support (if you have received support in the past)
• Evidence of special needs (if you have indicated that you are special needs learner)
• Copy of Payslip/Bank Statement (if parents/guardians are employed/business person)
• Signed Declaration by Applicant and Parent/Guardian
• Copy of Birth Certificate
• Filled application and recommendation form by Head Teacher, Provincial Administration, Religious Leader or any other leader
Only shortlisted candidates will be invited for interviews.
Any false statements, omissions or forged documents will lead to automatic disqualification.
Application Deadline
Applications are currently closed. Applications will be available a month after the release of KCPE results and closed in March(varies annually).
Click here for more information.


Less Stress
We can help you minimize your personal workload and remove a potential hassle from your daily life by using our service for record keeping.
See MoreLife can be filled with stress...
Let us help you take a big one off of your list!
scroll down for more
We can help you minimize your personal workload and remove a potential hassle from your daily life by using our service for record keeping.
See MoreWe can help you increase your efficiency during time consuming tasks, such as getting approval for travel visas.
See MoreWe can help you improve the quality of your care through the confidence that transparency information brings to your medical care.
See MoreWe can help you easily maintain records for all of your children in a secure, easy-to-reach, service that can even reduce the strain of things like moving to a new provider.
See MoreWe can help you streamline your workflow through the removal of standard physical document transfer methods.
See MoreWe can help you increase office efficiency through the removal of extra processes and procedures.
See MoreYou can improve the quality of care provided to your patients by giving them a boost of confidence through transparency.
See MoreSee MoreUsing ImmuTrack has greatly improved my quality of life!
See MoreThe process is quick and painless.
See MoreImmuTrack has made things so much easier for me.
See MoreImmuTrack saved our wedding plans!
See MoreNow I can’t imagine trying to handle all of this info without it.
See MoreIt has fundamentally changed the way our practice handles vaccinations.
See MoreI’m so thankful to have access to ImmuTrack.


{{/*
#188 Eco-friendliness: no Print button.
*/}}
- The snippets are under the CC-BY-SA license.
- Please consider keeping a bookmark
- (instead of printing)
{{.Lang | printNiceLang}} code
| {{.IdiomID}} |
{{markup2CSS (atom2string .IdiomLeadParagraph)}}
|
{{if .ImplImportsBlock}}
{{.ImplCodeBlock}} |
{{end}}
|---|


---
sort_order: 59
tei_id: rdx_191dd.p.idp7488976
annotation_count: 0
images:
small-thumbnail: https://readux.ecds.emory.edu/books/emory:191dd/pages/emory:rff4j/mini-thumbnail/
json: https://readux.ecds.emory.edu/books/emory:191dd/pages/emory:rff4j/info/
full: https://readux.ecds.emory.edu/books/emory:191dd/pages/emory:rff4j/fs/
page: https://readux.ecds.emory.edu/books/emory:191dd/pages/emory:rff4j/single-page/
thumbnail: https://readux.ecds.emory.edu/books/emory:191dd/pages/emory:rff4j/thumbnail/
title: Page 59
number: 59
---
{% raw %}A DKIVE.{% endraw %}
{% raw %}G9{% endraw %}
{% raw %}Mauvais dismissed her from the room wilh au oath, aud a{% endraw %}
{% raw %}warning as to her future conduct; at the same time intimating{% endraw %}
{% raw %}that she need not go away if she would behave herself rao:-'j{% endraw %}
{% raw %}discreetly hereafter.{% endraw %}
{% raw %}" He'U see! he'U see!" muttered the squaw, when the door{% endraw %}
{% raw %}was closed between them. " Ka-shaw no Pawuce, no Otoe,{% endraw %}
{% raw %}to bear insult!"{% endraw %}
{% raw %}" There was no sign of the late unpleasant encouutcr iu the{% endraw %}
{% raw %}gaUant Frenchman's manner as he handed the trembling con¬{% endraw %}
{% raw %}valescent into his stylish open carriage, half an hour afterward.{% endraw %}
{% raw %}Trembling she was, not so much through weakness as from{% endraw %}
{% raw %}nervous agitation, arising from the consciousness of doing{% endraw %}
{% raw %}something that might displease the two people on earth she{% endraw %}
{% raw %}cared most about pleasing. But Mrs. Wyman, on whom sh.o{% endraw %}
{% raw %}relied now for protection and advice, had said there could be{% endraw %}
{% raw %}nothing wrong about it. Mr. j\Iauvais was au old man,{% endraw %}
{% raw %}almost, and she was a young girl, and an invalid. Besides,{% endraw %}
{% raw %}other ladies rode out with him, aud some thought it quite a{% endraw %}
{% raw %}" feather iu their caps" to receive a courtesy from the rich aud{% endraw %}
{% raw %}polite Frenchman. She would soon be well again, and{% endraw %}
{% raw %}engaged iu her school, when, if she did uot wish to receive{% endraw %}
{% raw %}his attentions, she could get rid of them more readily by plead¬{% endraw %}
{% raw %}ing duties.{% endraw %}
{% raw %}Thus reassured, Alicia felt her reluctance the sooner dissi¬{% endraw %}
{% raw %}pated by the fresh air, the lively motion, the beautiful weather,{% endraw %}
{% raw %}and the graceful compliments of her companion. They drove{% endraw %}
{% raw %}through the village, past the house where her father was con¬{% endraw %}
{% raw %}fined, paid a fiyiug call upon the Judge's wife, nodded to{% endraw %}
{% raw %}Allen standing in his office door—for Allen had put a shluglo{% endraw %}
{% raw %}out in Fairview—and dashed out into the open country.{% endraw %}
{% raw %}" The fresh air brings the roses of your cheeks into bloom.{% endraw %}
{% raw %}Miss Newcome."{% endraw %}
{% raw %}Alicia smiled the pleased and artless smUe with which she{% endraw %}
{% raw %}always listened to auy complimentary remarks, but made no{% endraw %}
{% raw %}reply, for she was not a young lady even of ordinary loquacity{% endraw %}
{% raw %}in the presence of strangers.{% endraw %}
{% raw %}" It would be a pity to fade them in the school-room," con¬{% endraw %}
{% raw %}tinued Mr. Mauvais.{% endraw %}
{% raw %}" I don't think my duties wiU be very trying," answered{% endraw %}
{% raw %}Alicia, pleasantly.{% endraw %}


Abyssal Saint Elcardia:
Fate has surely brought me to this place. I'm here to give you this stone.
"Is that a Stone of Commune?"


STL Court Connect
Tickets, Citations & Violations
Pay my ticket
Lost my ticket
Contest my ticket
Warrants
Court Services
Find court location
Find my court date
Check court wait times
Community Services
Eligibility
Get credit
Volunteer
Back
PAY TICKETS
Input location of ticket
Find
Want to pay in person?
Here's the address:
Want to pay online?
Go here:
And of course... don't forget a valid form of payment!
Back
LOST TICKETS
Input location of incident in lost ticket
Find
To recover a lost ticket, please visit your local municipal court.
Here's the address:
Prefer online?
Go here:
You will need at least one of the following:
Your citation number and your D.O.B.

Here's the address:
Want to view its online resources?
Go here:
Additional helpful resources:
Boot Removal Information
St. Louis Parking Policy
Back
WARRANT LOOKUP
Resolving a warrant can be an intimidating task but don't worry - just enter in some personal information below and we'll direct you to the right municipal court so that it can be resolved!
First name
Last name
Date of birth
Driver's license number
Find
WARRANT(S)
VIOLATIONS(S)
Back
FIND COURT DATES
First name
Last name
Date of birth
Driver's license number
Find
Back
FIND COURTS
Input your location
Find
Want to find out more information about your local municipal court?
Here's the address:
Want to view its online resource?
Go here:
Back
COMMUNITY SERVICE ELIGIBILITY
St. Louis' municipalities approve or deny community service in lieu of traffic tickets on a case-by-case basis. Enter in the address of the ticket and we'll point you in the right direction!
Input the ticket's location
Find
Want to find out more information about your local municipal court?
Here's the address:
Want to view its online resource?
Go here:
Back
GET COMMUNITY SERVICE CREDIT
Your local municipality judge will be able to decide whether or not your community service time qualifies you for traffic ticket credit. Enter in the address of the traffic incident below and we'll get you started!
Input the ticket's location
Find
Want to find out more information about your local municipal court?
Here's the address:
Want to view its online resource?
Go here:
Back
COMMUNITY SERVICE OPPORTUNITIES
There are many wonderful resources to find community service work in your area. Below, we've provided you with a few sites to get you started!
Additional helpful resources:
STLVolunteer
VolunteerMatch
St. Louis Children's Hospital


Course Blocks
Log In
Sign Up
Welcome! 👋
This site lets you create and enroll in courses for free. To get started just pick a class below. Sign up above to save your progress, or
try a demo
.
My Courses
ヾ(＠⌒ー⌒＠)ノ
Explore
Search
×
Sign Up 📝
×
If you sign up you’ll be able to track your progress in the courses you’re enrolled in. You can also create and publish courses of your own.
Name:
Email:
Password:
Confirm:
Sign Up
Log In 👍
×
Email:
Password:
Log In


The Kondo Effect
Contents
- The Kondo Model
- Kondo’s Calculation
- Renormalization Group analysis of the Kondo Hamiltonian
- Epilogue: What Really Happens?
- References
Reading: (Kouwenhoven & Glazman, 2001), (Hewson, 1997), (Kondo, 2012),
The Kondo Model
Jun Kondo’s paper Resistance Minimum in Dilute Magnetic Alloys (Kondo, 1964) presents a theoretical solution to a puzzling, but perhaps unspectacular observation. At low temperatures, the resistance of metals falls. This is nothing to do with superconductivity, but is a more mundane consequence of electron-electron or electron-phonon scattering falling with temperature, as the thermal population of phonons or particle hole pairs diminishes. Evidence had accumulated over the years, however, that in nonmagnetic metals containing magnetic impurities (Copper with Manganese or Iron, for example), the low temperature resistance eventually began to rise again.
The fact that the effect could be observed with tiny concentrations of magnetic impurities (as low as 0.0005% Iron atoms in Copper!), lead Kondo to study the scattering of electrons by single impurity, described by the model that now bears his name
The first term is just the kinetic energy of free fermions, while the second describes the coupling of an impurity spin $\mathbf{S}$ – which we will take to be $S=1/2$, though of course other values are possible – to the spin density of the fermions
The fermions and impurity are coupled at the origin, where the impurity is assumed to be located.
Kondo showed that, unlike nonmagnetic impurities, which give rise to temperature independent scattering and to the residual resistance of metals, scattering from a magnetic impurity was enhanced at low energies or temperatures. His perturbation theory calculation, which we’ll repeat below, gave a correction to the scattering, and hence to the resistivity, proportional to $\log T$. This was as observed in experiment.
It all looked good, except that – and this is where the emphasis shifted strongly to the theoretical aspects of the problem – this contribution to the scattering was diverging as the energy of the scattered fermion vanished. In a practical sense, that meant that Kondo’s calculation could not be trusted at energies where the correction becomes large. The more conceptual issue was: what did it mean? What was the spin of the impurity doing to the Fermi sea?
The Kondo model went on to become one of the testbeds of the renormalization group (RG) approach to many body physics, quantum field theory, and statistical mechanics. The RG is a framework for understanding the behaviour of systems at scales intermediate between the microscopic (Fermi wavelength or size of impurity in this case) and the macroscopic (size of the system). The idea is that is that if these scales are separated by many orders of magnitude, the behaviour at intermediate scales should be approximately scale independent. In the case of the Kondo model, the effective Hamiltonians (we met this notion in Lecture 7) at different energy scales should be almost the same. The incompleteness of the scale invariance is encoded in a variation of the parameters of the effective Hamiltonian.
In this context, the divergences found by Kondo in his perturbative calculation can be understand as a finite renormalization of the parameters of the effective Hamiltonian as the scale changes. We will see how this point of view allows us to understand the low energy behaviour of the Kondo model in much greater detail. The utility of the RG is not restricted to perturbation theory, but this is all we’ll have time for.
Kondo’s Calculation
We are going to consider the scattering of a single fermion above the Fermi sea, described by the state
where $\ket{\text{FS}}$ is the Fermi sea ground state of the Fermi gas, and $\ket{S}_\text{imp}$ describes the spin. In time dependent perturbation theory in the coupling between the impurity and the fermions we compute the scattering amplitude by expanding the interaction picture evolution operator
where $T$ denotes time ordering, and the time evolution of the coupling is
with
$\mathbf{S}(t)$ has no time dependence since the impurity spin does not appear in the unperturbed Hamiltonian. Nevertheless, we label it so as to keep track of the order in which it appears, coupled to operators with true time dependence, when we expand the evolution operator.
First Order
At first order $H_J$ can create a particle hole pair or scatter the particle. We are considering scattering, so we consider initial and final states of the form
The relevant matrix element is just
The Fermi Golden Rule then gives the scattering rate
Summing over final states gives
where $\nu(\xi)$ is the density of states per spin component per unit volume. When $S’\neq s’$ the scattering is larger because spin flip processes are allowed as well as those that don’t flip the spin.
If we add up the scattering for a dilute concentration of impurities $n_\text{imp}$ by simply multiplying by their number $N_\text{imp}=n_\text{imp}V$ and averaging over the initial spin orientation, we get
Second Order
The magic happens at the next order, where we have the contribution to the amplitude
Comparing with the first order amplitude \eqref{1stAmp} shows that
can be regarded as a correction to the matrix element to be inserted into the Golden Rule.
If we insert a complete set of states between the two occurrences of $H_J$, what intermediate (or virtual) states contribute to the scattering amplitude? There are just two possibilities
The two kinds of intermediate states that contribute at second order.
-
The fermion scatters to $\bk_i$, $s_i$, with $\bk_i$ above the Fermi surface.
-
A particle hole pair is created, with the particle at $\bk,s$. The hole is subsequently filled.
We see that indistinguishability (and hence fermionic statistics) plays a fundamental role in the second process.
We consider the particle process first. This arises from the terms
The time dependence of the operators gives rise to the phase factor
Extending the integral over $t-t’$ to $\infty$ gives
Putting it all together gives a contribution
Now we turn to the hole process. The relevant terms in the coupling are now
The phase factor is now
Integrating over $t-t’$ then gives
On account of the order of $\adop_{\bk,s}$ and $\aop_{\bk’,s’}$ being reversed, we have a minus sign relative to the particle contribution, leading to
The phase factors in \eqref{plike} and \eqref{hlike}, as in the first order result \eqref{1stAmp}, are responsible for the $\delta$-function setting $\xi(\bk)=\xi(\bk’)$ in the Golden Rule. Both \eqref{plike} and \eqref{hlike} have a logarithmic divergence that is cut-off at low energies by $\xi(\bk)=\xi(\bk’)$. For example,
where $\Lambda$ is an upper cut-off arising from the microscopic scales of the problem. The overall logarithmic dependence of the second order correction is then
Since
we can interpret \eqref{TotalLog} as a logarithmic correction to the coupling $J$
This was Kondo’s discovery. For $J>0$ this represents an increase in the magnitude of the coupling, and a corresponding logarithmic correction to the scattering rate. At finite temperature, the lower cutoff in the integrals is replaced by the temperature, leading to the observed $\log T$ dependence of the resistivity on temperature.
Renormalization Group analysis of the Kondo Hamiltonian
The logarithmic correction \eqref{KondoCorrect} becomes the same order as $J$ when the low energy cut-off approaches the Kondo scale
What can we say about the physics at or below this scale? Continuing with perturbation theory leads to contributions $\propto \log^p(\Lambda/\xi)$ with $p>1$, which doesn’t really help to clarify things. An alternative is to ask for the effective Hamiltonian describing the problem on a particular scale.
Effective Hamiltonian
To be precise, we start with a Kondo problem defined with a certain $\Lambda$. Then, for $\Lambda’\ll\Lambda$, we ask for the effective Hamiltonian describing the system when there are no particle excitations with $\xi(\bp)>\Lambda’$ and no hole excitations with $\xi(\bp)<-\Lambda’$. Let’s refer to this subspace as $\cH_{\Lambda’}$. This effective Hamiltonian is different from the original Hamiltonian: we saw in Lecture 7 that, since $\Lambda’\ll \Lambda$, the effective Hamiltonian in $\cH_{\Lambda’}$ is
where $P_{[\Lambda’,\Lambda]}$ projects on particle excitations with $\Lambda>\xi(\bp)>\Lambda’$ and hole excitations with $-\Lambda<\xi(\bp)<-\Lambda’$. It’s not hard to see that evaluating $\delta H$ is very similar to the second order calculation of the previous section, showing that $\delta H$ has the same form as $H_J$ with $\delta J$ given by
The implication is that the physics of excitations within $\Lambda’$ of the Fermi surface can be described either by the original Hamiltonian with cut-off $\Lambda$, or by $H+\delta H$ – the same model with $J\to J+\delta J$ – with cut-off $\Lambda’$.
Scaling of the Hamiltonian
Now let’s see what this has to do with scale invariance. Suppose we were studying the Kondo problem in which we had already removed almost all the degrees of freedom, leaving only those in a thin shell of energy thickness $2\Lambda$ around the Fermi surface
Model defined in a shell of thickness $\Lambda\ll k_\text{F}$.
The Kondo model defined in this shell may be written
where
Now, \eqref{KondoShell} has the feature that both terms scale the same way under a re-scaling $\Lambda\to\Lambda’$, essentially because both contain the second power of $\xi$.
To state this more precisely, let’s re-define the field operators to incorporate factors of $\sqrt{V}$
so now
and
In this way, we can state the scaling of the Hamiltonian precisely as
where
obey the same relations \eqref{CARcont}.
\eqref{Hscale} is inarguable as an operator identity between Kondo Hamiltonians defined in two different energy shells. However, the previous section shows that the effective Hamiltonian acting in the $\Lambda’$ (sub-)shell for a system described by $H_\Lambda$ in the $\Lambda$ shell is not $H_{\Lambda’}$, but $H_{\Lambda’}+\delta H$. Thus the similarity between the two scales is incomplete, but can be fixed by the modest change
Having returned to the original $\Lambda$ shell, with only a shift in the coupling to show for it (and an overall scaling in the Hamiltonian – see \eqref{Hscale}), we are free to repeat the procedure again. In this way the renormalization of $J$ is iterated repeatedly. Normally, we express this iteration not in terms of a discrete mapping of the coupling of the Hamiltonian, but through a differential equation.
where $\tau\equiv\log \Lambda/\Lambda’$ represents the scale factor between the original scale $\Lambda$ and the current scale $\Lambda’$.
There’s something a bit fishy about this last step. After all, wasn’t the effective Hamiltonian derived on the assumption that $\Lambda’\ll \Lambda$? Thinking in differential terms really only requires $J\nu(0)\Delta t\ll 1$, however, which can be satisfied even if $\Lambda\gg\Lambda’$.
\eqref{RGIso} is an example of an RG flow equation, expressing the incomplete self-similarity of the Kondo problem as we zoom inwards ever closer to the Fermi surface. Similar equations describe the scaling of parameters in theories describing continuous phase transitions – where there are fluctuations at all length scales – or massless quantum field theories – where zero mass means the absence of any length or timescale.
Solution of the RG Equations
The single equation \eqref{RGIso} is a bit boring. We can make things more interesting by introducing anisotropy into the original Kondo coupling
It isn’t hard to show that \eqref{RGIso} is now replaced with
The character of the solutions can be readily understood by noticing that
is preserved along the flow, leading to a series of hyperbolae. It remains to figure out the direction of the flow:
The RG flow for the anisotropic Kondo problem. From (Anderson, 1970).
The conclusions of this analysis are as follows:
-
For ferromagnetic couplings $J_z<0$ with $\abs{J_z}>\abs{J_\perp}$, the flow is to $J_\perp=0$. This means that at low energies the amplitude for spin-flips vanishes, leaving only a $S^z s^z(0)$ coupling.
-
For antiferromagnetic coupling $J_z>0$, or ferromagnetic coupling with $\abs{J_z}<\abs{J_\perp}$, the flow is to strong coupling. This means that our analysis – which was still based on the smallness of $J$ despite all the fancy bells and whistles – breaks down.
Epilogue: What Really Happens?
My intention in this lecture was to give a taste of what makes the Kondo problem so intriguing. However, we certainly haven’t gotten to the bottom of it. Let me try to summarize an enormous amount of history in a paragraph or two.
Kenneth Wilson’s numerical RG calculations, which informed his formulation of the general framework that won him the Nobel prize, showed that in the low energy limit the impurity spin is completely ‘quenched’, forming a singlet with the Fermi sea (Wilson, 1975). This is a highly nontrivial process, but a simple caricature is that the singlet forms with the one fermion allowed at the site of the impurity by the exclusion principle. This process is often called screening in analogy to a plasma, though the physics is of course rather different. Nevertheless, it leads to a very simple Fermi liquid-like picture of the physics close to the ground state, as explained by Nozières (Nozieres, 1974)
The same qualitative consideration lets us understand what happens for larger impurity spin $S$: in the ground state the impurity has spin $S-1/2$. We can also add more ‘channels’, coupling the impurity to other species of fermions that represent the interaction of different partial waves (angular momentum states) with the impurity. Then it is possible for ‘overscreening’ to occur, meaning that the strongly coupled picture is unstable as both channels try to form a singlet with the impurity. The instability of both strong and weak coupling suggests an intermediate coupling ground state, which turns out to have highly unusual non-Fermi liquid properties without well defined fermionic quasiparticles. However, this state only exists for exactly equal coupling in two or more channels, which is unlikely to occur with a magnetic impurity atom.
One of the great innovations of the last couple of decades is the use of quantum dots as artificial magnetic impurities. These mesoscopic electronic devices can be connected in a circuit, so that the Kondo effect is probed by electical conduction rather than through the resistivity that arises from scattering. Even better, quantum dots are a a highly tunable Kondo system that has allowed the two-channel effect to be observed, for example. You can read about some of these developments in the article (Kouwenhoven & Glazman, 2001).
You can find even more in the textbook (Hewson, 1997) or (Kondo, 2012) from the man himself.
References
- Kouwenhoven, L., & Glazman, L. (2001). Revival of the Kondo effect. Physics World, 14(1), 33.
- Hewson, A. C. (1997). The Kondo problem to heavy fermions (Vol. 2). Cambridge university press.
- Kondo, J. (2012). The physics of dilute magnetic alloys. Cambridge University Press.
- Kondo, J. (1964). Resistance minimum in dilute magnetic alloys. Progress of Theoretical Physics, 32(1), 37–49.
- Anderson, P. W. (1970). A poor man’s derivation of scaling laws for the Kondo problem. Journal of Physics C: Solid State Physics, 3(12), 2436.
- Wilson, K. G. (1975). The renormalization group: Critical phenomena and the Kondo problem. Reviews of Modern Physics, 47(4), 773.
- Nozieres, P. (1974). A “Fermi-liquid” description of the Kondo problem at low temperatures. Journal of Low Temperature Physics, 17(1-2), 31–42.


Bummed to miss HC tonight, but packing and canning had to get done before leaving for South Dakota!
9/23/2009, 9:39:43 PM
Favs: 0
Retweets: 0
link--- layout: tweet ---
Bummed to miss HC tonight, but packing and canning had to get done before leaving for South Dakota!
9/23/2009, 9:39:43 PM
Favs: 0
Retweets: 0
link


Watch one or many topics for unprocessed messages.
npm install nsq-watch
new NsqWatch( config );
Example:
var NsqWatch = require( "nsq-watch" )
var watcher = new NsqWatch({
topics: ""
});
Config
- depthKey : ( String
default="depth" ) You can pick the key to emit through the depth event out of the nsqd stats answer.
- namespace : ( String|Null
default=null ) Internally prefix the nsq topics. This will be handled transparent, but with this it's possible to separate different environments from each other. E.g. you can run a "staging" and "live" environment on one nsq cluster.
- statusPollInterval : ( Number
optional: default = 180
) Time in seconds to poll for node status
- lookupdHTTPAddresses : ( String|String[]
required ) A single or multiple nsqlookupd hosts. This is also a configuration of 'nsqjs'
- lookupdPollInterval : ( Number
optional: default = 60
) Time in seconds to poll the nsqlookupd servers to sync the available nsqwatch. This is also a configuration of 'nsqjs'
- active : ( Boolean
optional: default = true
) Configuration to (de)activate the nsq topics on startup
.activate()
Activate the module
Return
( Boolean ): true
if it is now activated. false
if it was already active
.deactivate()
Deactivate the module
Return
( Boolean ): true
if it is now deactivated. false
if it was already inactive
.active()
Test if the module is currently active
Return
( Boolean ): Is active?
status
publishes status of a node
Arguments
Object
) A raw node objectArray
) An raw array of topics stats hold by this node. The topics here will include the namespaces within the name and are not filteredExample:
nsqwatch.on( "status", function( stats, node ){
// called until new status data where polled
/*
STATS:
[ { topic_name: 'foo',
channels: [],
depth: 2,
backend_depth: 2,
message_count: 0,
paused: false,
e2e_processing_latency: { count: 0, percentiles: null } },
{ topic_name: 'bar',
channels: [ "logging" ],
depth: 0,
backend_depth: 0,
message_count: 0,
paused: false,
e2e_processing_latency: { count: 0, percentiles: null } },
NODE:
{ remote_address: '<IP_ADDRESS>:49160',
hostname: 'MyMachineName.local',
broadcast_address: 'MyMachineName.local',
tcp_port: 4150,
http_port: 4151,
version: '0.3.6',
tombstones: [ false, false ],
topics: [ 'foo','bar']
}
*/
});
topic-depth
publishes depth for each topic.
Note: If you are using the namespace
config. Only the matching topics will be emitted.
The topic will be without the namespace
Arguments
String
) The topic name (without the namespace
prefix)Number
) The message depth of this topicArray
) An raw array of topics stats hold by this node. The topics here will include the namespaces within the name and are not filteredObject
) A raw node objectExample:
nsqwatch.on( "topic-depth", function( topic, depth, stats, node ){
// called until a new topic arrived
/*
TOPIC: foo
DEPTH: 12
STATS: raw stats. See example in `status`
NODE: raw node. See example in `status`
*/
});
topic-channel-depth
publishes channel-depth for each topic.
Note: If you are using the namespace
config. Only the matching topics will be emitted.
The topic will be without the namespace
Arguments
String
) The topic name (without the namespace
prefix)Number
) Cumulated count of depth over all channels of the topics.Object
) An object with the channel name as key and the current depth as valueArray
) An raw array of topics stats hold by this node. The topics here will include the namespaces within the name and are not filteredObject
) A raw node objectExample:
nsqwatch.on( "topic-channel-depth", function( topic, channeldepth, channels, stats, node ){
// called until a new topic arrived
/*
TOPIC: foo
CHANNELDEPTH: 65
CHANNELS: { "fizz-channel": 23, "buzz-channel": 42 } // the sum of all keys is represented by `channeldepth`
STATS: raw stats. See example in `status`
NODE: raw node. See example in `status`
*/
});
depth
the cumulated depth of all topics matching the namespace
.
Arguments
Number
) The depth of all topics matching the namespaceArray
) An raw array of topics stats hold by this node. The topics here will include the namespaces within the name and are not filteredObject
) A raw node objectExample:
nsqwatch.on( "depth", function( depth, stats, node ){
// called until a new topic arrived
/*
DEPTH: 58
STATS: raw stats. See example in `status`
NODE: raw node. See example in `status`
*/
});
channel-depth
Get the depth over all topics and channels
Arguments
Number
) Cumulated count of depth over all channels and topics.Object
) An object with the topic name as key and an object of channel depth.Array
) An raw array of topics stats hold by this node. The topics here will include the namespaces within the name and are not filteredObject
) A raw node objectExample:
nsqwatch.on( "channel-depth", function( channeldepth, channels, stats, node ){
// called until a new topic arrived
/*
CHANNELDEPTH: 78
CHANNELS: { "foo-topic":{ "fizz-channel": 23, "buzz-channel": 42 }, "bar-topic":{ "fizz-channel": 13 } }
STATS: raw stats. See example in `status`
NODE: raw node. See example in `status`
*/
});
error
An error occurred. E.g. called if a invalid filter was used or no lookup server is available
Arguments
Error
) The error object. Example:
nsqwatch.on( "error", function( err ){
// handle the error
});
ready
Emitted once the list of topics where received the first time.
This is just an internal helper. The Method list
will also wait for the first response. The events add
, remove
and change
are active after this first response.
Example:
nsqwatch.on( "ready", function( err ){
// handle the error
});
|Version|Date|Description| |:--:|:--:|:--| |0.0.7|2016-05-04|Fixed configuration| |0.0.6|2016-05-04|Fixed remote url| |0.0.5|2016-05-04|Bugfix and Dependency updates| |0.0.4|2015-12-18|added channel depths| |0.0.3|2015-12-18|added config to set the depth key| |0.0.2|2015-12-18|added depth events and handles namespace| |0.0.1|2015-12-17|Initial commit|
Initially Generated with generator-mpnodemodule
|Name|Description| |:--|:--| |nsq-logger|Nsq service to read messages from all topics listed within a list of nsqlookupd services.| |nsq-topics|Nsq helper to poll a nsqlookupd service for all it's topics and mirror it locally.| |nsq-nodes|Nsq helper to poll a nsqlookupd service for all it's nodes and mirror it locally.| |node-cache|Simple and fast NodeJS internal caching. Node internal in memory cache like memcached.| |rsmq|A really simple message queue based on redis| |redis-heartbeat|Pulse a heartbeat to redis. This can be used to detach or attach servers to nginx or similar problems.| |systemhealth|Node module to run simple custom checks for your machine or it's connections. It will use redis-heartbeat to send the current state to redis.| |rsmq-cli|a terminal client for rsmq| |rest-rsmq|REST interface for.| |redis-sessions|An advanced session store for NodeJS and Redis| |connect-redis-sessions|A connect or express middleware to simply use the redis sessions. With redis sessions you can handle multiple sessions per user_id.| |redis-notifications|A redis based notification engine. It implements the rsmq-worker to safely create notifications and recurring reports.| |hyperrequest|A wrapper around hyperquest to handle the results| |task-queue-worker|A powerful tool for background processing of tasks that are run by making standard http requests |soyer|Soyer is small lib for server side use of Google Closure Templates with node.js.| |grunt-soy-compile|Compile Goggle Closure Templates ( SOY ) templates including the handling of XLIFF language files.| |backlunr|A solution to bring Backbone Collections together with the browser fulltext search engine Lunr.js| |domel|A simple dom helper if you want to get rid of jQuery| |obj-schema|Simple module to validate an object by a predefined schema|
Copyright © 2015 M. Peter, http://www.tcs.de
Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the “Software”), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
 IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.


Symbols
Special symbols
(* $Date: 2011-03-02 14:21:03 -0500 (Wed, 02 Mar 2011) $ *)
(* This file defines some HTML symbols for use by the coqdoc
preprocessor. It is not intended to be read by anybody. *)


Reset
µ
-
µ
+
µ
+
µ
-
Your browser does not support HTML5 canvas. Where did you get such an old browser?
Your browser does not support Javascript. If you have turned it off on purpose, please turn it on for this page or otherwise upgrade your browser.


---
layout: archive
title: Lean Prover Zulip Chat Archive
permalink: 113489newmembers/50887rewritetacticfailedlemmaisnotanequalitynoraiff.html
---
The archive URL format has changed. Please find this page at:
https://leanprover-community.github.io/archive/stream/113489-new-members/topic/rewrite.20tactic.20failed.2C.20lemma.20is.20not.20an.20equality.20nor.20a.20iff.html


Computes ordinal, statistics and effect sizes as an alternative to mean comparison: Cliff's delta or success rate difference (SRD), Vargha and Delaney's A or the Area Under a Receiver Operating Characteristic Curve (AUC), the discrete type of McGraw & Wong's Common Language Effect Size (CLES) or Grissom & Kim's Probability of Superiority (PS), and the Number needed to treat (NNT) effect size. Moreover, comparisons to Cohen's d are offered based on Huberty & Lowman's Percentage of Group (Non-)Overlap considerations.
| Version: | 3.1 |
| Depends: | psych |
| Published: | 2013-02-07 |
| Author: | Jens J. Rogmann, University of Hamburg, Department of Psychology, Germany |
| Maintainer: | Jens J. Rogmann <Jens.Rogmann at uni-hamburg.de> |
| License: | GPL-2 |
| NeedsCompilation: | no |
| Materials: | NEWS |
| CRAN checks: | orddom results |
| Reference manual: | orddom.pdf |
| Package source: | orddom_3.1.tar.gz |
| Windows binaries: | r-devel: orddom_3.1.zip, r-release: orddom_3.1.zip, r-oldrel: orddom_3.1.zip |
| OS X binaries: | r-release: orddom_3.1.tgz, r-oldrel: orddom_3.1.tgz |
| Old sources: | orddom archive |
Please use the canonical form https://CRAN.R-project.org/package=orddom to link to this page.


API solutions for end-to-end tax compliance
Calculate sales & sellers use tax, consumer use, and value-added tax (VAT)
Calculate transactional taxes with rooftop-level accuracy and real-time product taxability information using our AvaTax RESTful API, or SOAP API, which include class wrappers (adapters) for a variety of languages to assist in calling the web service. Get started with the AvaTax API now.
Fees and taxes for telecommunications
The Avalara AvaTax for Communications API helps you quickly determine taxes for telecommunication services, as well as VoIP, internet services, satellite TV, and other communications services. Learn more about the Communications Tax API
Excise fees and taxes for fuels
The Excise Tax API allows you to determine taxes for transactions involving bulk motor fuels, petroleum products, and natural gas for thousands of jurisdictions in the U.S. and Canada. The SOAP API provides platform-independent access to Avalara AvaTax Excise, and can be used independently of other Avalara APIs. Learn more about the Excise Tax API..
Duties and fees for international sales
The Landed Cost Rate and Calculation API allows to you lookup rates for commodities, and determine estimated landed cost totals for an invoice. Learn more about the Landed Cost API.
Manage exemption certificates, W8/W9 forms, and fuel licenses
The CertCapture API enables you to retrieve or update exemption data from a remote application. This allows applications to interact with customer and certificate records, and to send automated certificate requests to customers. CertCapture may be used as a stand-alone certificate management solution, or in conjunction with AvaTax. Learn more about the CertCapture API.
Prepare and file AvaTax-integrated returns
Avalara Returns is a fully-managed solution that incorporates a Treasury solution for simple payment, guaranteed on-time filing, audit support, and notice management. There are currently no APIs available for Avalara Returns – data is populated from AvaTax transactions and returns are managed by the merchant through the provided Customer Portal. Learn more about Avalara Returns.
Tax return preparation and filing for eCommerce merchants and small businesses
Avalara TrustFile is a do-it-yourself sales tax solution for small businesses and eCommerce merchants. Quick to set up and easy to use, TrustFile takes your sales data and prepares sales tax reports for every state you collected tax in. TrustFile supports eFiling in a growing number of states, so you can take advantage of One-Click Filing to save even more time. TrustFile allows you to generate sales tax reports and filing independently of the sales tax calculation, which means it can be used without any AvaTax calculation. Learn more about the TrustFile API.


Configuring Display Rules for Point Data¶
Point data can provide useful information about points of interest (POIs) around the globe or even in your home town. Google Earth Enterprise Fusion allows you to configure the display rules for point data to distinguish different types of information. This lesson guides you through the process of graphically distinguishing the popular places in California using display rules.
- Define, Configure, and Build a Vector Project
- Define and Build an Imagery Project
- Define, Build, Push, and Publish a Database for the Point Data
- View Your Database in Google Earth EC
Define, Configure, and Build a Vector Project
This exercise walks you through the process of defining, configuring, and building a vector project using a resource you created in Defining and Building Resources.
To define and build a vector project and configure display rules for points:
Select Asset Manager from the Tools menu.
The Asset Manager appears.
Click on the toolbar. The Vector Project Editor appears.
Click . The Open dialog appears.
Navigate to the
ASSET_ROOT/Resources/Vector
folder.Select CA_POIs (a resource that you built in Defining and Building Resources), and click Open. The CA_POIs resource appears in the Vector Project Editor.
Right-click CA_POIs and select Configure Display Rules from the context menu. The Display Rules dialog appears with the Feature tab in the foreground and the default select all rule highlighted.
Specify the geometry characteristics of the POIs:
For Draw Features As, select Points.
For Simplification Method, select Representative Subset Per Tile.
For Choose, accept the default, 50% points.
For Min Points, enter 50.
For Max Points, enter 200.
Check the box next to Suppress Duplicate Points.
Under Elevation/Height, set Mode to Clamp to Ground.
On the right side of the dialog, check the box next to Draw Label.
For Visibility, accept the default range, 5 through 24.
Do not make any changes under Label Properties.
This area allows you to specify the content and appearance of a text label for each POI. However, there are so many POIs in California that the view in Google Earth EC would be too crowded.
Check the box next to Draw Icon and then:
Click the icon pair. The Icons dialog appears.
Scroll down, if necessary, and select blue_star, and click OK.
A yellow star appears next to Highlight, and a blue star appears next to Normal. The result of this setting is that Google Earth EC displays a blue star for each POI, and when you mouse over the star (highlight it), it turns yellow.
For both Highlight and Normal, accept the default color, white.
For Highlight, accept the default scale, 1.
For Normal, change the scale to 0.89.
The result of these settings is that when you mouse over a star, Google Earth EC displays the yellow (highlighted) star a little larger than the blue star.
In the Balloon section, select Text, and then click the empty text field. The Label Format dialog appears.
Select COUNTY from the Insert Field drop-down list.
«COUNTY» appears in the text box under Popup Text.
Note
You can use some basic HTML tags to format the Label text, if desired.
To the left of «COUNTY» enter .
To the right of «COUNTY» enter

.
Press Enter. Adding this HTML code formats the name of the county as bold, followed by two line breaks to separate it from the text that follows (next step).
Select NAME from the Insert Field drop-down list. «NAME» appears on the next line of the text box.
- To the right of «NAME» enter

.
- Press Enter.
On the next line, enter Latitude:, and then select LATITUDE from the Insert Field drop-down menu.
- To the right of «LATITUDE» enter

.
- Press Enter.
On the next line, enter Longitude: , and then select LONGITUDE from the Insert Field drop-down menu.
Click the OK button.
For Style, select Default from the drop-down list.
Check the box next to Directions to include “To here” and “From here” links in the description balloon in Google Earth EC.
Click the Text Color button, and select a medium blue.
Click the Background Color button, and select a light yellow.
Click the OK button. You return to the Vector Project Editor.
Select File > Save. The Save dialog appears.
Navigate to the
ASSET_ROOT/Projects/Vector
folder.Enter CA_POIs as the name of your project, and click Save.
The new project appears in the Asset Manager when you select ASSET_ROOT/Projects/Vector in the asset navigation tree.
Right-click CA_POIs, and select Build from the context menu. Google Earth Enterprise Fusion builds the project.
Define and Build an Imagery Project
Although you can build and publish a database that includes a
vector project only, you cannot connect directly to your server
with Google Earth EC to view that data unless your database also
includes an imagery project. If you publish a database that
includes a vector project only, you must use the Add Database
command on the File menu in Google Earth EC to add the database to
the base imagery after logging in to kh.google.com
or
another server that serves a database that includes imagery.
This exercise walks you through the process of defining and building an imagery project using a resource you created in Defining and Building Resources.
Note
If you have already completed this exercise in Configuring Display Rules for Polygon Data, skip this exercise and move on to Define, Build, Push, and Publish a Database for the Point Data.
To define and build an imagery project:
In the Asset Manager, click on the toolbar. The Imagery Project Editor appears.
Click .
The Open dialog appears.
Navigate to the
ASSET_ROOT/Resources/Imagery
folder.- Select BlueMarble, and click Open.
The BlueMarble resource appears in the Imagery Project Editor.
Select File > Save.
The Save dialog appears.
Navigate to the
ASSET_ROOT/Projects/Imagery
folder.Enter BlueMarble as the name of your project, and click Save.
The new project appears in the Asset Manager when you select ASSET_ROOT/Projects/Imagery in the asset navigation tree.
Right-click BlueMarble, and select Build from the context menu.
Google Earth Enterprise Fusion builds the project.
Define, Build, Push, and Publish a Database for the Point Data
This exercise walks you through the process of defining, building, pushing, and publishing a database using the projects you created in the previous exercise.
To define, build, and push a database:
Click on the toolbar. The Database Editor appears with no projects selected.
Click next to Vector Project. The Open dialog appears.
Navigate to
ASSET_ROOT/Projects/Vector
.Select the CA_POIs project and click Open. The CA_POIs project appears in the Database Editor next to Vector Project.
Repeat steps 2 through 4 to add BlueMarble as the imagery project.
You do not need to add a terrain project for this exercise. Both projects appear on the list.
Select File > Save.
Navigate to the
ASSET_ROOT/Databases
folder.Enter CA_POIs for the name of your database, and click Save. The name of the database appears on the right when you select the
/ASSET_ROOT/Databases
folder in the asset navigation tree.Right-click CA_POIs, and select Build from the context menu. Google Earth Enterprise Fusion builds the database.
Right-click CA_POIs, and select Push from the context menu. The Push Database dialog appears.
Select the server association on the Server Associations drop-down list. The most recent version of the selected database is the default selection on the Version drop-down list.
Click the Push button. Google Earth Enterprise Fusion runs the process of pushing the database to the Google Earth Enterprise Server, and displays a success message when it is done.
To publish a database:
Access the Google Earth Enterprise Server Admin console in a browser window by going to myserver.mydomainname.com/admin, replacing myserver and mydomainname with your server and domain.
Sign in with the default credentials:
- Username: geapacheuser
- Password: geeadmin
Click Databases to display the list of databases pushed to the server.
Check the box next to the database you want to publish. The Publish button on the Databases page appears.
Click Publish. The Publish dialog appears.
Specify a Publish point, where the database will be accessible from. For example, if you specify CA_POIs-v001, it will be accessible from myserver.mydomainname.com/CA_POIs-v001.
To learn more about the options available in the Publish dialog, see
Click the Publish button. The Databases page updates to indicate the published status of your database.
View Your Database in Google Earth EC
This exercise walks you through the process of viewing your database in Google Earth EC.
To view your database:
Launch Google Earth EC. The Select Server dialog appears.
Enter or select the host name or IP address of your server in the Server field, and specify the Publish point that you selected when you published your map database. For example, if you specify CA_POIs-v001, it will be accessible from myserver.mydomainname.com/CA_POIs-v001.
Click the Sign In button.
Zoom in to the west coast of the US.
When you zoom in enough, Google Earth EC displays blue stars all over California. The closer you zoom in, the more spread out the stars are and the more stars you can see. When you mouse over a star, it turns yellow. When you click a star, a description balloon displays the information you specified in the format you defined in the Display Rules dialog.
Note
If you cannot see the vector data, make sure the check box next to CA_POIs in the Layers panel is checked.


 They are great for just about anything, the sky's the limit!
Name: Jack R.
Phone:<PHONE_NUMBER>
Email<EMAIL_ADDRESS>Address:
50 Mayoral Drive,
Auckland, 1010
Please let us know how we can help.
Thinking about a creative idea? How about a coke?


If you're experiencing problems upgrading your MVC-projects, check out this blog post. It shows a solution for the upgrade-problems you typically run into:
Thanks to Bill Wilder for posting...
If you're experiencing problems upgrading your MVC-projects, check out this blog post. It shows a solution for the upgrade-problems you typically run into:
Thanks to Bill Wilder for posting...


|
Vending MachinesWhen your great, great grandparents were very small children, the mere notion of winking, blinking, flashing metal robots capable of exchanging nickels for frozen chocolate ice cream was just a crazy daydream. But now? It's science fact. [SFX: Wonky space music] Welcome to the world of tomorrow -- today! Stainless steel, safety glass, and plexi-chrome vending machines have evolved so gracefully over time that now even the most jaded and suspicious of adults can finally take them for granted. Combined with new advances in soda can delivery, snack rack dispensary, candy spiral arm technology and credit card verification techniques, it's easy to see why vending machines are truly man's best friend. Beep boop! Take me to your leader! Would you like to establish a career in the automated retail arts? Americans feed vending machines over $22 billion each year, but the vending industry is fraught with hazards -- including the everpresent need to combat negative public perception. Vending machines represent the earliest physical manifestation of corporate downsizing and far-fetched notions that a person could ever be replaced by a thing. They're not always associated with quality merchandise, and there's even a perception that vending machines can't be trusted. Paid-for Snickers and unreachable Twix have too often dangled like mistletoe from coiled dispensaries which failed to deploy. Client satisfaction and trust are similarly eroded when there's nobody around to complain to. Accountable operators travel all over the state, and their full phone numbers are rarely prefixed with 1-800. Responding to allegations of poor customer service, companies developed "smart" vending machines which are meaner and twice as aggressive. The most advanced venders come equipped with temperature-sensitive electrothermographs which increase the price of a drink from $1.00 to $1.50 on particularly hot afternoons. Ratios between frequency of use and the passage of time can also be established, enabling machines to charge more for drinks at heavily-populated outdoor social events. The logic is as follows: if there's a long, steady pattern of coin clinks into the machine, increase the price by 25 cents after every tenth clink. Decrease the price when disgruntled customers start walking away and there are fewer sales, or your internal balance register indicates a steady sequence of violent blows or determined kicks. In Why We Buy, CEO and Envirosell, Inc. founder Paco Underhill describes the vending machines of tomorrow. Nearly one-fifth of all Americans will be 65 or older by the year 2025, necessitating drastic changes in the way businesses conduct automated transactions. The failing eyes and arthritic fingers of senior citizens have already forced vending machines to adapt. Large, rectangular buttons which dispense cans of Mountain Dew are growing larger, much easier to push, and they're increasingly self-illuminated -- preferably with enormous photographs of the desired product in question. How much money did I just put in? What am I buying again? Where am I? Innovations in vending machine user interfaces translate directly into other devices, too. ATMs will need to grow phatter, doper, and more pimped-out in an effort to woo seniors. The buttons on mobile phones and TiVo remotes will be similarly big-boned, growing more colorful with each passing year and taking advantage of embedded liquid crystal displays suitable for "dim lighting conditions," even though it's high noon and the sun is directly overhead. Who will stock these machines of the future? Anne Rawland Gabriel, author of Start Your Own Vending Business, chronicles a newer, hipper demographic of vending machine operators mysteriously referred to as those belonging to Generations X and Y. Unlike the technology industry, where "innovation makes millionaires overnight," Gabriel reminds us that today's v-commerce entrepreneurs must actively pursue cost control, aggressive marketing, exceptional management, and just plain hard work. On page five, one can experience an interactive sidebar containing this Fun Fact: Generation Xers are big consumers of hand-held foods! Yes, it all started way back in Generation G, when in 215 B.C. an enterprising young lad named Hero from Alexandria published Pneumatic -- a modest collection of blueprints containing some of the craziest devices the world had ever seen. One contraption was a specialized, self-contained urn, which actually squirted holy water whenever a patron of the church inserted a coin. It was simple gravity-based lever system: the weight of a single coin would angle a funneled pan forward and down, splashing God's cool liquid refreshment directly into your waiting lap. Talk about a time saver. Sadly, Hero's whimsical invention couldn't discern real coins from fake ones, leading to inevitable thefts of the blessed water by Roman officials and copper-pinching church goers. He died without ever seeing his invention evolve from a sacred fountain to the full-on dirty French postcard mini-kiosk the 18th century would soon be clamoring for. In the 1880s, when patents were secured for a smattering of mechanical counterfeit coin detectors, the porn industry really took off. Vending machines were there, man -- right there -- riding bareback in History's sidesaddle, selling snuffs and tobaccos, slinging dirty books, and even returning exact change. Is your mind sufficiently blown, earth human?
Whoever said the warmest, most memorable meals in life are those prepared with loving human hands probably never experienced the gumball, a prime staple of vending machines since 1888. The Thomas Adams Gum Company was the first to market Tutti-Fruiti in kiosks installed upon the elevated subway platforms of New York City. Less than a decade later, a completely coin-operated restaurant, or automat opened in Philadelphia.  These diners were staffed by human beings, too -- unseen cooks in the back kitchen who prepared the hot entrees. Coffee exchangers were also employed: they discarded coffee which had been brewing in the urns every twenty minutes, and replaced it with a fresh batch. The throw-it-out-after-twenty-minutes rule would later be adopted by Starbucks Coffee. It's estimated that the Horn & Hardart New York and Philadelphia franchise vended to 800,000 people each day, until it finally closed in 1962. New York's last vending machine restaurant was replaced in 1991 with a Burger King. The cafe was later recreated in stunning technicolor for the 1998 science fiction mystery Dark City. So clearly, it's only a matter of time before vending machines learn how to stock themselves with smaller, self-replicated automats capable of dispensing the most dangerous snack treat of all -- MAN!! Seriously people, have we learned nothing from The Matrix? A Piggly Wiggly thrift store in Sheboygan, Wisconsin is probably about as fun as it sounds -- unless you climb inside their joystick-operated, crane-based vending machine like 7-year-old Timothy Novotny did in 2004. He crawled in through an opening no larger than an 8.5 x 11" piece of plain white printer paper -- but when he tried to get out, he discovered the entrance was blocked. Locksmiths, rescuers, and firefighters alike worked for over an hour, moving the vending machine to the back of the store away from public view, and out behind the main loading dock. The Boy Who Wanted A Toy, quipped the WKMG Local6 Headline News. Classic! Less than a year later, three-year-old James Manges of Elkhart, Indiana managed to climb up the chute of another popular claw-style vending machine at Wal-Mart, where he sat like the Lion King among the plush animals for several hours. His 22-year-old mother Danielle, initially amused, grew frantic when Wal-Mart employees confessed they couldn't find a key to the machine and there was no way to get him out. "He climbed up the chute and into the bin," Danielle told WNDU NewsCenter16 reporter Robert Borrelli.  The Elkhart fire department was called to the scene. "I expected his hand to be caught in the machine," officer Anthony Coleman admitted. "But it was his entire body." James' mother was ordered by a judge to attend parenting classes. She insists her son has done things like this before: climbing out of his playpen, escaping from doors and even leaping from windows. So has her husband James: he was taken into custody shortly after police were called to the scene of a warehouse robbery. He was discovered in possession of gloves, a flashlight, two screwdrivers and a hatchet. The Man Who Wanted To Rob And Rape And Dismember You In The Dark, quipped the WKMG Local6 Headline News. Classic! In the latter half of the twentieth century, vending machines began to rebel for the first time against their flesh-and-bone masters. Since 1978, over 50 people have been killed by vending machines -- and over 100 severely injured. Quebec, 1998: Kevin Mackle, 21, while demonstrating his unconditional love for a vending machine by hugging it back and forth in a rocking, tilting fashion, was crushed to death when the machine toppled over, squishing him beneath its enormous rectangular weight. When a vending machine falls on top of you, it's responding more out of fear than fury. It's saying please stop. It pins you to the linoleum floor almost immediately, forcing you to squint into the overhead fluorescent lights. Your elbows and knees are unable to bend or pivot in any direction, as if you've been placed in a small coffin. It's very likely your head hit the ground pretty hard upon impact. If the tilt-over was a clean 90-degree sweep, your nose, such as it is, is bent, or your cheeks are pressed firmly against the display window. If the machine topples and torques around one of its protective rubber footpads, skewing slightly at an angle, the top corner digs an enormous diagonal gash across your entire body from head to toe. If the front panel is made of glass, consider yourself lucky: it might easily shatter against the floor. If that happens, and you don't immediately start bleeding to death, your ribcage will be allowed inside the machine -- just inches from the Corn Nuts -- where your lungs can mercifully expand and contract several additional cubic millimeters while your friends prepare their digital cameras. Mr. Mackle's surviving family sued the Coca-Cola Company for $665,000. They also sued the manufacturer of the machine, the California-based Vendo company, claiming they knew the machine could tip over easily but did nothing to warn consumers. Then they sued Beaver Foods, the operator and caretakers of the machine, who had observed students at Quebec University rocking the machine back and forth numerous times, ignoring the warning placard: TIPPING OR ROCKING MAY CAUSE INJURY AND DEATH. Indeed, rather than pay attention to a vending machine's plaintive warning, some online content producers are happy just taking a picture of it for the purposes of making their LiveJournal experiences more immersive. See the funny guy? He's dead. "I've rocked the machine. A couple times, at least. Not a Coke machine, but those nosh boxes that hold fatal snacks on metal corkscrew clips all in a row. Sometimes the machine takes your money & won't completely detach the snack bag. Pull the machine back toward you from the top, shake a bit, the bag drops, and you get what you paid for." Good luck with that, randomly Googled blogger.  Recent battles include the Palos Verdes Peninsula High School massacre of March, 2004 -- where eleven vending machines were tormented and executed without explanation. No groups have come forward to claim credit for the destruction, although custodian Ben Paule's sense of victory was palpable: "The repair for the vending machines is not in our hands. The Coca-Cola Company has to come in, fix them, calculate the cost of repair, and restock them." According to principal Kelly Johnson, the machines were killed sometime between 1:00am and 3:00am. Someone came in during the middle of the night and damaged the money slots on the vending machines, possibly with a butane torch. Neither Honeywell engineers nor disgruntled high school students can ever equal the ingenuity of vending machines' most formidable opponent: little birds. After a coin-operated Magic Wand car wash in Fredericksburg, Virginia was coming up several hundred dollars short each week, manager Bill Dougherty suspected his employees of sharing pass-keys amongst themselves to steal quarters. Dougherty set up a surveillance camera which monitored the coin device from a safe distance, and quickly discovered a host of starlings -- birds attracted to shiny objects -- working as a team to commit petty theft. For the purposes of nesting or attracting a mate, the starlings would conspire together: one would fly up the machine to shake coins loose, the other would clamp two or three quarters together between her beak and zip back to base. When fellow starlings saw where the coins were coming from, they flew in packs to the car wash and duplicated her behavior. Fly! Fly back to school, little Starling! Quid pro quo Clarice, etcetera and so forth. Well, that wraps it up for this episode of The World of Tomorrow Today. In the meanwhile, it's safe to say that whether you like vending machines or hate them, the future is finally here to stay -- forever and ever. Now if only some young Einstein could daydream up a way to put shampoo and conditioner in the same plastic bottle! [SFX: Wonky space music] |


×
This page uses the AMD build in the dist
directory, not the files in
src
. In other words, run the grunt
command first to build a current version.
Items which have been rendered correctly are set to a green background. Where things have gone wrong, the background is red.
el
el
el
defined with data attributesel
defined with data attributes


Thomas Vanderwyst
Interactive Media Design Porfolio
Traditional
Digital
Photography
Programming
Contact and About
Email<EMAIL_ADDRESS>Blog: https://thomasstudentart.blogspot.com/
Phone: 613 - 787 - 9674


| Op/En | 64-Bit Mode | Compat/Leg Mode | Description | ||
|---|---|---|---|---|---|
| M | Valid | Valid | Invalidate TLB entries for page containing m. |
* SeetheIA-32ArchitectureCompatibilitysectionbelow.
| Op/En | Operand 1 | Operand 2 | Operand 3 | Operand 4 |
| M | ModRM:r/m (r) | NA | NA | NA |
Invalidates any translation lookaside buffer (TLB) entries specified with the source operand. The source operand is a memory address. The processor determines the page that contains that address and flushes all TLB entries for that page.1
1. If the paging structures map the linear address using a page larger than 4 KBytes and there are multiple TLB entries for that page (see Section <IP_ADDRESS>, “Details of TLB Use,” in the Intel® 64 and IA-32 Architectures Software Developer’s Manual, Volume 3A), the instruction invalidates all of them.
The INVLPG instruction is a privileged instruction. When the processor is running in protected mode, the CPL must be 0 to execute this instruction.
The INVLPG instruction normally flushes TLB entries only for the specified page; however, in some cases, it may flush more entries, even the entire TLB. The instruction invalidates TLB entries associated with the current PCID and may or may not do so for TLB entries associated with other PCIDs. (If PCIDs are disabled — CR4.PCIDE = 0 — the current PCID is 000H.) The instruction also invalidates any global TLB entries for the specified page, regardless of PCID.
For more details on operations that flush the TLB, see “MOV—Move to/from Control Registers” in the Intel® 64 and IA-32 Architectures Software Developer’s Manual, Volume 2B and Section <IP_ADDRESS>, “Operations that Invalidate TLBs and Paging-Structure Caches,” in the Intel® 64 and IA-32 Architectures Software Developer’s Manual, Volume 3A.
This instruction’s operation is the same in all non-64-bit modes. It also operates the same in 64-bit mode, except if the memory address is in non-canonical form. In this case, INVLPG is the same as a NOP.
The INVLPG instruction is implementation dependent, and its function may be implemented differently on different families of Intel 64 or IA-32 processors. This instruction is not supported on IA-32 processors earlier than the Intel486 processor.
Invalidate(RelevantTLBEntries); Continue; (* Continue execution *)
None.
| #GP(0) | If the current privilege level is not 0. |
| #UD | Operand is a register. |
| If the LOCK prefix is used. |
| #UD | Operand is a register. |
| If the LOCK prefix is used. |
| #GP(0) | The INVLPG instruction cannot be executed at the virtual-8086 mode. |
| #GP(0) | If the current privilege level is not 0. |
| #UD | Operand is a register. |
| If the LOCK prefix is used. |


|
Halide
12.0.0
|
Routines specific to the Halide Direct3D 12 Compute runtime. More...
#include "HalideRuntime.h"
Go to the source code of this file.
Functions | |
| const struct halide_device_interface_t * | halide_d3d12compute_device_interface () |
| int | halide_d3d12compute_initialize_kernels (void *user_context, void **state_ptr, const char *src, int size) |
| These are forward declared here to allow clients to override the Halide Direct3D 12 Compute runtime. More... | |
| int | halide_d3d12compute_run (void *user_context, void *state_ptr, const char *entry_name, int blocksX, int blocksY, int blocksZ, int threadsX, int threadsY, int threadsZ, int shared_mem_bytes, halide_type_t arg_types[], void *args[], int8_t arg_is_buffer[], int num_attributes, float *vertex_buffer, int num_coords_dim0, int num_coords_dim1) |
| void | halide_d3d12compute_finalize_kernels (void *user_context, void *state_ptr) |
| int | halide_d3d12compute_wrap_buffer (void *user_context, struct halide_buffer_t *buf, uint64_t d3d12_resource) |
| Set the underlying ID3D12Resource for a halide_buffer_t. More... | |
| int | halide_d3d12compute_detach_buffer (void *user_context, struct halide_buffer_t *buf) |
| Disconnect a halide_buffer_t from the ID3D12Resource it was previously wrapped around. More... | |
| uintptr_t | halide_d3d12compute_get_buffer (void *user_context, struct halide_buffer_t *buf) |
| Return the underlying ID3D12Resource for a halide_buffer_t. More... | |
| int | halide_d3d12compute_acquire_context (void *user_context, struct halide_d3d12compute_device **device_ret, struct halide_d3d12compute_command_queue **queue_ret, bool create) |
| This prototype is exported as applications will typically need to replace it to get Halide filters to execute on the same device and command queue used for other purposes. More... | |
| int | halide_d3d12compute_release_context (void *user_context) |
| This call balances each successfull halide_d3d12compute_acquire_context call. More... | |
Routines specific to the Halide Direct3D 12 Compute runtime.
Definition in file HalideRuntimeD3D12Compute.h.
| const struct halide_device_interface_t* halide_d3d12compute_device_interface | ( | ) |
| int halide_d3d12compute_initialize_kernels | ( | void * | user_context, |
| void ** | state_ptr, | ||
| const char * | src, | ||
| int | size | ||
| ) |
These are forward declared here to allow clients to override the Halide Direct3D 12 Compute runtime.
Do not call them.
| int halide_d3d12compute_run | ( | void * | user_context, |
| void * | state_ptr, | ||
| const char * | entry_name, | ||
| int | blocksX, | ||
| int | blocksY, | ||
| int | blocksZ, | ||
| int | threadsX, | ||
| int | threadsY, | ||
| int | threadsZ, | ||
| int | shared_mem_bytes, | ||
| halide_type_t | arg_types[], | ||
| void * | args[], | ||
| int8_t | arg_is_buffer[], | ||
| int | num_attributes, | ||
| float * | vertex_buffer, | ||
| int | num_coords_dim0, | ||
| int | num_coords_dim1 | ||
| ) |
| void halide_d3d12compute_finalize_kernels | ( | void * | user_context, |
| void * | state_ptr | ||
| ) |
| int halide_d3d12compute_wrap_buffer | ( | void * | user_context, |
| struct halide_buffer_t * | buf, | ||
| uint64_t | d3d12_resource | ||
| ) |
Set the underlying ID3D12Resource for a halide_buffer_t.
The memory backing the resource should be managed by the caller (via a default/device heap) and must be large enough to cover the extent of the halide_buffer_t. The device field of the halide_buffer_t must be NULL when this routine is called. This call can fail due to running out of memory or if an invalid D3D12 resource is passed. The device and host dirty bits are left unmodified.
| int halide_d3d12compute_detach_buffer | ( | void * | user_context, |
| struct halide_buffer_t * | buf | ||
| ) |
Disconnect a halide_buffer_t from the ID3D12Resource it was previously wrapped around.
Should only be called for a halide_buffer_t that halide_d3d12compute_wrap_buffer was previously called on. Frees any storage associated with the binding of the halide_buffer_t and the buffer, but does not free the ID3D12Resource. The dev field of the halide_buffer_t will be NULL on return.
| uintptr_t halide_d3d12compute_get_buffer | ( | void * | user_context, |
| struct halide_buffer_t * | buf | ||
| ) |
Return the underlying ID3D12Resource for a halide_buffer_t.
This resource must be valid on an D3D12 device, unless halide_buffer_t has no associated resource. If there is no device memory (device field is NULL), returns 0.
| int halide_d3d12compute_acquire_context | ( | void * | user_context, |
| struct halide_d3d12compute_device ** | device_ret, | ||
| struct halide_d3d12compute_command_queue ** | queue_ret, | ||
| bool | create | ||
| ) |
This prototype is exported as applications will typically need to replace it to get Halide filters to execute on the same device and command queue used for other purposes.
The halide_d3d12compute_device is an ID3D12Device and halide_d3d12compute_command_queue is an ID3D12CommandQueue. No reference counting is done by Halide on these objects. They must remain valid until all off the following are true:
| int halide_d3d12compute_release_context | ( | void * | user_context | ) |
This call balances each successfull halide_d3d12compute_acquire_context call.
If halide_d3d12compute_acquire_context is replaced, this routine must be replaced as well.