Example 1 - Collaborator Pets
Our collaborator pets collection is the most basic type of collection that can
be added into the DAMS. This example contains a simple set of digital images
with a small amount of data about the pets. Each pet, eg. ashley.jpg is included
in their own image file, and each image file has some associated metadata in a
.ttl
sidecar, eg. ashley.jpeg.ttl. The metadata is in text/turtle
format text/turtle documentation.
The index.ttl file includes information about the collection as a whole.
Finally, we have an additional graph.hdt file is explained in more detail below.
This collection can all be created with the import.sh script, and we will be going through that script line-by-line to describe the general steps for creating new collections. Before we do that though, we first need to describe the object structure in our https://fedora.info/spec/.
Table of Contents
- Object Structure
- Administrative Privleges
- Make a New Collection
- Collection Access Control
- Check .fin/config.yml File
- Add Example Data
- Graphs
- Amended metadata representation
Object Structure
Whereever possible, we use Schema.org to organize our collections and items. To that end, Every collection is defined as a https://schema.org/Collection and every item in a collection is a https://schema.org/CreativeWork. The items of a collection are defined with the property https://schema.org/hasPart. This is fundamental organization of a collection. This Generic Diagram, describes that relationship. Since https://schema.org/Collection are themselves https://schema.org/CreativeWork then all properties of those apply. Some of the properties that are indexed and in some cases faceted in our DAMS include https://schema.org/name, https://schema.org/about, https://schema.org/keywords, https://schema.org/alternativeHeadline,https://schema.org/license,https://schema.org/creator, https://schema.org/datePublished
Now, for our example, each individual pet is an item within our collection. The following diagram replaces the generic objects with some of the actual objects in our collection.
Administrative Privileges
If you have gone through the installation steps, this is good place to come as your next step. The steps below assume that you are currently logged in to your fin server, as an admin. How to do this is explained in the installation instructions. You can verify this with the following command, which access the root location, and verifies you can write to this location.
fin http get -P b / | grep fedora:writable
Make a New Collection
Let’s start with the collection description. That’s stored in the `index.ttl` file. This file describes the collection. `index.ttl` is a pretty easy file to understand, you’ll see a name, and description and some keywords. If you’re savy with your linked data, you will see that by default we like to use schema.org for our descriptions. This is not a requirement for the server, but lots of the DAMS setup expects to use this schema when indexing collections and data.
@prefix schema: <http://schema.org/> .
@prefix rdf: <http://www.w3.org/1999/02/22-rdf-syntax-ns#> .
@prefix ldp: <http://www.w3.org/ns/ldp#> .
<>
a ldp:BasicContainer, schema:Collection;
schema:name "Collaborator Pets";
schema:keywords "Pets", "Cats", "Dogs";
schema:license <http://rightsstatements.org/vocab/InC-NC/1.0/>;
schema:creator "Quinn Hart";
schema:datePublished "2018"^^<http://www.w3.org/2001/XMLSchema#date> ;
schema:description "This collection includes pictures of pets that are owned by our collaborators. This is meant to be something of the most basic collection that can be added as a DAMs." ;
schema:identifier "ark:/pets/awesome".
fin has some special commands to create and administrate collections. Let’s go ahead and create our new collection.
fin collection create example_1-pets index.ttl
New collection created at: /collection/example_1-pets
This command creates a new container in our system, for the new collection, but it does more than that. It sets up some default access control conditions, and organizes standard locations for things like groups for this collection. Also, with the addition of the metadata in our index.ttl file, it also describes the contents of this collection, which is then used in the default Interface for the repository. After this step, you should be able to navigate to http://localhost:3000/fcrepo/rest/collection, and see your newly created example1-pets collection. You may need to login to your account via http://localhost:3000/auth/basic/login.html to give your browser access.
Collection Access Control
By default new collections are not publicly available. Let’s make this available for anyone.
fin collection acl user add example_1-pets foaf:Agent r
Check .fin/config.yml File
Navigate to fin-example-repository/collection/ex1-pets/.fin
. You should see a file named config.yml
. Open it. Make sure that the listed host is pointing to the correct location. If you’re working locally, you’d probably like to set it for your local work environment.
Example
source:
host: http://<IP_ADDRESS>:3000/
base: /fcrepo/rest
collection: ex1-pets
Add Example Data
Now we want to add an additional image with its associated .ttl
sidecar.
- Select an appropriately adorable jpg of one of your pets. In the event you don’t have a pet, any cute animal picture will suffice.
- Navigate to
fin-example-repository/collection/ex1-pets/ex1-pets/pets
. - Copy your selected jpg into this directory.
-
Create a copy of one of the existing
name.jpg.ttl
files and update the file name to match the image you’ve chosen.Example
adorable_dog.jpg > adorable_dog.jpg.ttl
- Update the information in your new
.ttl
sidecar file to personalize it and make it accurately reflect your chosen image.
You’re ready to update your local copy of the DAMS Collaborator Pets Collection.
Open a Terminal and cd to fin-example-repository/collection/ex1-pets
. Then run the following command:
fin io import [name of directory to upload] [root directory location]
Example
fin io import ex1-pets .
After the command runs, you should be able to refresh your local UC Davis Library Digital Collections instance and click on the Collaborator Pets image block. You should now see your cute animal picture.
Graphs
One problem that is currently not completely solved
Amended metadata representation
TODO: Fill in.


Lexington Vacant/Abandoned Properties
Data source: Lexington PVA and VPRC
Click on each red vacant property for more info and a photo


A powerful societal data explorer, for everybody
commonK brings to your fingertips network science tools that help you measure the relationships between the corporate and political decision-makers that shape our world.
commonK brings to your fingertips network science tools that help you measure the relationships between the corporate and political decision-makers that shape our world.
Drawing on a background in anticorruption activism, financial services law, and investment banking and on training in mathematics, Zia Haider Rahman is leading a team building a platform that uses network science to increase transparency in governmental and corporate relationships.
He is the Walter Jackson Bate Fellow at the Radcliffe Institute for Advanced Study, Harvard University, a fellow at New America, Washington, DC, and a senior fellow at the Bruno Kreisky Forum, in Vienna, and has been appointed a Director’s Visitor at the Institute for Advanced Study, in Princeton. He was born in Bangladesh, grew up in the UK, and was educated at the University of Oxford (Balliol College), the University of Cambridge, and Yale University.
His first novel, In the Light of What We Know, was published to international critical acclaim and won the James Tait Black Prize for Fiction, Britain’s oldest literary prize, previous winners of which include Cormac McCarthy, Nadine Gordimer, Salman Rushdie, and Evelyn Waugh.
Error: Username and password don't match


- Akosua-Kwasi
- Adwoa-Kwado
- Abena-Kwaena
- Akua-Kwakua
- Yaa-Yaw
- Afua-Kofi
- Ama-Kwame
These names are given to children that are born on a Sunday. They are believed to be naturally agile and therefore their appellation is “Agility”. They are quick, fast and are highly skilled in performing tasks especially crafts.
These are names for children born on Monday. They like peace and will avoid trouble at all cost. Their appellation means “Peaceful”.
They were born on Tuesday. They are always friendly hence their appellation means "Friendliness".
They were born on Wednesday. Their appellations means "Evil". They are mostly associated with stubborness.
They were born on Thursday. Their appellation is bravery. They never care about what will result from a certain situation.
They were born on Friday. They are known to be wanderers and are unable to stay in one place for long. They can travel to far places, start their own families there and never bother to check on those family members they left behind.
Born on Saturday. The males are believed to be always set for combat hence "Ready for Combat" becomes his first appellation while "Snakebite herbalist" becomes his second appellation. Females are creators hence one of their appellation is "creation" while the other is "Grace".


Out to Sea (1997)
A movie review by Michael J. Legeros Copyright 1997 by Michael J. Legeros
(Fox) Directed by Martha Coolidge Written by Marshall Brickman and David Jacobs Cast Jack Lemmon, Walter Matthau, Dyan Cannon, Gloria DeHaven, Brent Spiner, Hal Linden, Rue McClanahan, Edward Mulhare, Donald O'Connor, Elaine Stritch MPAA Rating "PG-13" Running Time 106 minutes Reviewed at The Carmike 7, Raleigh, NC (03JUL97)
==
OUT TO SEA is a harmless reworking of GRUMPY/GRUMPIER OLD MEN, with Jack Lemmon and Walter Matthau masquerading as dance hosts on a Caribbean cruise ship. In a clime considerably warmer than northern Minnesota, they bicker less, romance more, and spend the rest of the movie trying to avoid the cruise dictator (Brent Spiner, of STAR TREK), a big-band singer who proclaims himself "their worst night- mare, a song-and-dance man raised on a military base." Though the LOL moments are few and far-between, the cheery cast and sunny locales are all exceptionally easy on the eyes. As is the sight of sixty-year old Dyan Cannon's washboard abs. Lemmon and Matthau can sleepwalk through their schtick, so they're fine. And Spiner really can sing. Be forewarned: there *is* a finale involving a pontoon plane. This time, though, nothing explodes afterward. Be sure to stay for the outtakes, which appear late over the closing credits.
Grade: C
-- Mike Legeros - Movie Hell http://www.nonvirtual.com/hell/
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Language Guide
The Basics
Basic Operators
Strings
Control Flow
Functions
Classes and Structures
Nested Types
Type Introspection
Value Semantics


|
Contiki 2.5
|
00001 #ifndef __EFSL_CONFIG_H__ 00002 #define __EFSL_CONFIG_H__ 00003 00004 /* Close enough */ 00005 #define HW_ENDPOINT_LPC2000_SD 00006 00007 /* Memory configuration 00008 -------------------- 00009 00010 * Here you must configure wheter your processor can access memory byte 00011 * oriented. All x86 processors can do it, AVR's can do it to. Some DSP 00012 * or other microcontrollers can't. If you have an 8 bit system you're safe. 00013 * If you are really unsure, leave the setting commented out, it will be slower 00014 * but it will work for sure. 00015 */ 00016 00017 /* disabled for ARM (mt): #define BYTE_ALIGNMENT */ 00018 00019 /* Cache configuration 00020 ------------------- 00021 00022 * Here you must configure how much memory of cache you can/want to use. 00023 * The number you put at IOMAN_NUMBUFFER is multiplied by 512. So 1 means 00024 * 512 bytes cache, 4 means 2048 bytes cache. More is better. 00025 * The number after IOMAN_NUMITERATIONS should be untouched. 00026 * The last field (IOMAN_DO_MEMALLOC) is to tell ioman to allocate it's 00027 * own memory in it's structure, or not. If you choose to do it yourself 00028 * you will have to pass a pointer to the memory as the last argument of 00029 * ioman_init. 00030 */ 00031 /*#define IOMAN_NUMBUFFER 1*/ 00032 #define IOMAN_NUMBUFFER 6 00033 #define IOMAN_NUMITERATIONS 3 00034 #define IOMAN_DO_MEMALLOC 00035 00036 /* Cluster pre-allocation 00037 ---------------------- 00038 00039 * When writing files, the function that performs the actual write has to 00040 * calculate how many clusters it will need for that request. It then allocates 00041 * that number of new clusters to the file. Since this involves some calculations 00042 * and writing of the FAT, you might find it beneficial to limit the number of 00043 * allocations, and allow fwrite to pre-allocate a number of clusters extra. 00044 * This setting determines how many clusters will be extra allocated whenever 00045 * this is required. 00046 * Take in carefull consideration how large your clustersize is, putting 10 here 00047 * with a clustersize of 32kb means you might waste 320 kb. 00048 * The first option is for preallocating files, the other is used when enlarging 00049 * a directory to accomodate more files 00050 */ 00051 /*#define CLUSTER_PREALLOC_FILE 0*/ 00052 #define CLUSTER_PREALLOC_FILE 2 00053 #define CLUSTER_PREALLOC_DIRECTORY 0 00054 00055 00056 /* Endianess configuration 00057 ----------------------- 00058 00059 * Here you can configure wheter your architecture is little or big endian. This 00060 * is important since all FAT structures are stored in intel little endian order. 00061 * So if you have a big endian system the library has to convert all figures to 00062 * big endian in order to work. 00063 */ 00064 #define LITTLE_ENDIAN 00065 00066 00067 /* Date and Time support 00068 --------------------- 00069 00070 * Here you can enable or disable date and time support. If you enable 00071 * it you will have to create 6 functions, that are described in the 00072 * EFSL manual. If the functions are not present when linking your 00073 * program with the library you will get unresolved dependencies. 00074 */ 00075 /*#define DATE_TIME_SUPPORT*/ 00076 00077 /* Error reporting support 00078 ----------------------- 00079 00080 * When you receive an error in userland, it usually only gives limited 00081 * information (most likely, fail or success). If error detection and 00082 * reporting is important for you, you can enable more detailed error 00083 * reporting here. This is optional, the costs are 1 byte per object, 00084 * and a small increase in code size. 00085 * You can enable error recording for all object, or you can select the 00086 * object manually. 00087 * For full error reporting use FULL_ERROR_SUPPORT 00088 * For only the base-core of the library use BASE_ERROR_SUPPORT 00089 * For IO/Man use ERRSUP_IOMAN 00090 * For Disc use ERRSUP_IOMAN 00091 * For Part use ERRSUP_PARTITION 00092 * For Fs use ERRSUP_FILESYSTEM 00093 * For File use ERRSUP_FILE 00094 */ 00095 00096 #define FULL_ERROR_SUPPORT 00097 /*#define BASE_ERROR_SUPPORT*/ 00098 00099 /* List options 00100 ------------ 00101 00102 * In this section youcan configure what kind of data you will get from 00103 * directory listing requests. Please refer to the documentation for 00104 * more information 00105 */ 00106 00107 #define LIST_MAXLENFILENAME 12 00108 00109 00110 00111 00112 /* Debugging configuration 00113 ----------------------- 00114 00115 * Here you can configure the debugging behaviour. Debugging is different 00116 * on every platform (see debug.h for more information). 00117 * If your hardware has no means of output (printf) dont define any anything, 00118 * and nothing will happen. For real world use debugging should be turned off. 00119 */ 00120 00121 /* #define DEBUG */ 00122 00123 #define lpc2000_debug_printf dbg_blocking_printf 00124 00125 #endif


Home
(current)
TerryChat
(current)
Logout
(current)
(current)
Search by User
Search
Your Friends
Your Servers
Friend Requests
Server Invites


An operator is defined as \( \hat{O} \) throughout. Unless otherwise specified the number of particles is always \( N \) and \( d \) is the dimension of the system. In nuclear physics we normally define the total number of particles to be \( A=N+Z \), where \( N \) is total number of neutrons and \( Z \) the total number of protons. In case of other baryons such isobars \( \Delta \) or various hyperons such as \( \Lambda \) or \( \Sigma \), one needs to add their definitions. Hereafter, \( N \) is reserved for the total number of particles, unless otherwise specificied.
The quantum numbers of a single-particle state in coordinate space are defined by the variable
$$
x=({\bf r},\sigma),
$$
where
$$
{\bf r}\in {\mathbb{R}}^{d},
$$
with \( d=1,2,3 \) represents the spatial coordinates and \( \sigma \) is the eigenspin of the particle. For fermions with eigenspin \( 1/2 \) this means that
$$
x\in {\mathbb{R}}^{d}\oplus (\frac{1}{2}),
$$
and the integral \( \int dx = \sum_{\sigma}\int d^dr = \sum_{\sigma}\int d{\bf r} \),
and
$$
\int d^Nx= \int dx_1\int dx_2\dots\int dx_N.
$$
The quantum mechanical wave function of a given state with quantum numbers \( \lambda \) (encompassing all quantum numbers needed to specify the system), ignoring time, is
$$
\Psi_{\lambda}=\Psi_{\lambda}(x_1,x_2,\dots,x_N),
$$
with \( x_i=({\bf r}_i,\sigma_i) \) and the projection of \( \sigma_i \) takes the values
\( \{-1/2,+1/2\} \) for particles with spin \( 1/2 \).
We will hereafter always refer to \( \Psi_{\lambda} \) as the exact wave function, and if the ground state is not degenerate we label it as
$$
\Psi_0=\Psi_0(x_1,x_2,\dots,x_N).
$$
Since the solution \( \Psi_{\lambda} \) seldomly can be found in closed form, approximations are sought. Here we define an approximative wave function or an ansatz to the exact wave function as
$$
\Phi_{\lambda}=\Phi_{\lambda}(x_1,x_2,\dots,x_N),
$$
with
$$
\Phi_0=\Phi_0(x_1,x_2,\dots,x_N),
$$
being the ansatz to the ground state.
The wave function \( \Psi_{\lambda} \) is sought in the Hilbert space of either symmetric or anti-symmetric \( N \)-body functions, namely
$$
\Psi_{\lambda}\in {\cal H}_N:= {\cal H}_1\oplus{\cal H}_1\oplus\dots\oplus{\cal H}_1,
$$
where the single-particle Hilbert space \( \hat{H}_1 \) is the space of square integrable functions over
\( \in {\mathbb{R}}^{d}\oplus (\sigma) \)
resulting in
$$
{\cal H}_1:= L^2(\mathbb{R}^{d}\oplus (\sigma)).
$$
Our Hamiltonian is invariant under the permutation (interchange) of two particles. Since we deal with fermions however, the total wave function is antisymmetric. Let \( \hat{P} \) be an operator which interchanges two particles. Due to the symmetries we have ascribed to our Hamiltonian, this operator commutes with the total Hamiltonian,
$$
[\hat{H},\hat{P}] = 0,
$$
meaning that \( \Psi_{\lambda}(x_1, x_2, \dots , x_N) \) is an eigenfunction of
\( \hat{P} \) as well, that is
$$
\hat{P}_{ij}\Psi_{\lambda}(x_1, x_2, \dots,x_i,\dots,x_j,\dots,x_N)=
\beta\Psi_{\lambda}(x_1, x_2, \dots,x_j,\dots,x_i,\dots,x_N),
$$
where \( \beta \) is the eigenvalue of \( \hat{P} \). We have introduced the suffix \( ij \) in order to indicate that we permute particles \( i \) and \( j \).
The Pauli principle tells us that the total wave function for a system of fermions
has to be antisymmetric, resulting in the eigenvalue \( \beta = -1 \).
The Schrodinger equation reads
$$
\begin{equation}
\hat{H}(x_1, x_2, \dots , x_N) \Psi_{\lambda}(x_1, x_2, \dots , x_N) =
E_\lambda \Psi_\lambda(x_1, x_2, \dots , x_N), \tag{1}
\end{equation}
$$
where the vector \( x_i \) represents the coordinates (spatial and spin) of particle \( i \), \( \lambda \) stands for all the quantum
numbers needed to classify a given \( N \)-particle state and \( \Psi_{\lambda} \) is the pertaining eigenfunction. Throughout this course,
\( \Psi \) refers to the exact eigenfunction, unless otherwise stated.
We write the Hamilton operator, or Hamiltonian, in a generic way
$$
\hat{H} = \hat{T} + \hat{V}
$$
where \( \hat{T} \) represents the kinetic energy of the system
$$
\hat{T} = \sum_{i=1}^N \frac{\mathbf{p}_i^2}{2m_i} = \sum_{i=1}^N \left( -\frac{\hbar^2}{2m_i} \mathbf{\nabla_i}^2 \right) =
\sum_{i=1}^N t(x_i)
$$
while the operator \( \hat{V} \) for the potential energy is given by
$$
\begin{equation}
\hat{V} = \sum_{i=1}^N \hat{u}_{\mathrm{ext}}(x_i) + \sum_{j < i=1}^N v(x_i,x_j)+\sum_{i < j < k=1}^Nv(x_i,x_j,x_k)+\dots
\tag{2}
\end{equation}
$$
Hereafter we use natural units, viz. \( \hbar=c=e=1 \), with \( e \) the elementary charge and \( c \) the speed of light. This means that momenta and masses
have dimension energy.
If one does quantum chemistry, after having introduced the Born-Oppenheimer approximation which effectively freezes out the nucleonic degrees of freedom, the Hamiltonian for \( N=n_e \) electrons takes the following form
$$
\hat{H} = \sum_{i=1}^{n_e} t(x_i) - \sum_{i=1}^{n_e} k\frac{Z}{r_i} + \sum_{i < j}^{n_e} \frac{k}{r_{ij}},
$$
with \( k=1.44 \) eVnm
We can rewrite this as
$$
\begin{equation}
\hat{H} = \hat{H}_0 + \hat{H}_I
= \sum_{i=1}^{n_e}\hat{h}_0(x_i) + \sum_{i < j}^{n_e}\frac{1}{r_{ij}},
\tag{3}
\end{equation}
$$
where we have defined
$$
r_{ij}=| {\bf r}_i-{\bf r}_j|,
$$
and
$$
\begin{equation}
\hat{h}_0(x_i) = \hat{t}(x_i) - \frac{Z}{x_i}.
\tag{4}
\end{equation}
$$
The first term of Eq. (3), \( H_0 \), is the sum of the \( N \)
one-body Hamiltonians \( \hat{h}_0 \). Each individual
Hamiltonian \( \hat{h}_0 \) contains the kinetic energy operator of an
electron and its potential energy due to the attraction of the
nucleus. The second term, \( H_I \), is the sum of the \( n_e(n_e-1)/2 \)
two-body interactions between each pair of electrons. Note that the double sum carries a restriction \( i < j \).
The potential energy term due to the attraction of the nucleus defines the onebody field \( u_i=u_{\mathrm{ext}}(x_i) \) of Eq. (2). We have moved this term into the \( \hat{H}_0 \) part of the Hamiltonian, instead of keeping it in \( \hat{V} \) as in Eq. (2). The reason is that we will hereafter treat \( \hat{H}_0 \) as our non-interacting Hamiltonian. For a many-body wavefunction \( \Phi_{\lambda} \) defined by an appropriate single-particle basis, we may solve exactly the non-interacting eigenvalue problem
$$
\hat{H}_0\Phi_{\lambda}= w_{\lambda}\Phi_{\lambda},
$$
with \( w_{\lambda} \) being the non-interacting energy. This energy is defined by the sum over single-particle energies to be defined below.
For atoms the single-particle energies could be the hydrogen-like single-particle energies corrected for the charge \( Z \). For nuclei and quantum
dots, these energies could be given by the harmonic oscillator in three and two dimensions, respectively.
We will assume that the interacting part of the Hamiltonian can be approximated by a two-body interaction. This means that our Hamiltonian is written as
$$
\begin{equation}
\hat{H} = \hat{H}_0 + \hat{H}_I
= \sum_{i=1}^N \hat{h}_0(x_i) + \sum_{i < j}^N V(r_{ij}),
\tag{5}
\end{equation}
$$
with
$$
\begin{equation}
H_0=\sum_{i=1}^N \hat{h}_0(x_i) = \sum_{i=1}^N\left(\hat{t}(x_i) + \hat{u}_{\mathrm{ext}}(x_i)\right).
\tag{6}
\end{equation}
$$
The onebody part \( u_{\mathrm{ext}}(x_i) \) is normally approximated by a harmonic oscillator potential or the Coulomb interaction an electron feels from the nucleus. However, other potentials are fully possible, such as
one derived from the self-consistent solution of the Hartree-Fock equations.
Our Hamiltonian is invariant under the permutation (interchange) of two particles. % (exercise here, prove it) Since we deal with fermions however, the total wave function is antisymmetric. Let \( \hat{P} \) be an operator which interchanges two particles. Due to the symmetries we have ascribed to our Hamiltonian, this operator commutes with the total Hamiltonian,
$$
[\hat{H},\hat{P}] = 0,
$$
meaning that \( \Psi_{\lambda}(x_1, x_2, \dots , x_N) \) is an eigenfunction of
\( \hat{P} \) as well, that is
$$
\hat{P}_{ij}\Psi_{\lambda}(x_1, x_2, \dots,x_i,\dots,x_j,\dots,x_N)=
\beta\Psi_{\lambda}(x_1, x_2, \dots,x_i,\dots,x_j,\dots,x_N),
$$
where \( \beta \) is the eigenvalue of \( \hat{P} \). We have introduced the suffix \( ij \) in order to indicate that we permute particles \( i \) and \( j \).
The Pauli principle tells us that the total wave function for a system of fermions
has to be antisymmetric, resulting in the eigenvalue \( \beta = -1 \).
In our case we assume that we can approximate the exact eigenfunction with a Slater determinant
$$
\begin{equation}
\Phi(x_1, x_2,\dots ,x_N,\alpha,\beta,\dots, \sigma)=\frac{1}{\sqrt{N!}}
\left| \begin{array}{ccccc} \psi_{\alpha}(x_1)& \psi_{\alpha}(x_2)& \dots & \dots & \psi_{\alpha}(x_N)\\
\psi_{\beta}(x_1)&\psi_{\beta}(x_2)& \dots & \dots & \psi_{\beta}(x_N)\\
\dots & \dots & \dots & \dots & \dots \\
\dots & \dots & \dots & \dots & \dots \\
\psi_{\sigma}(x_1)&\psi_{\sigma}(x_2)& \dots & \dots & \psi_{\sigma}(x_N)\end{array} \right|, \tag{7}
\end{equation}
$$
where \( x_i \) stand for the coordinates and spin values of a particle \( i \) and \( \alpha,\beta,\dots, \gamma \)
are quantum numbers needed to describe remaining quantum numbers.
The single-particle function \( \psi_{\alpha}(x_i) \) are eigenfunctions of the onebody Hamiltonian \( h_i \), that is
$$
\hat{h}_0(x_i)=\hat{t}(x_i) + \hat{u}_{\mathrm{ext}}(x_i),
$$
with eigenvalues
$$
\hat{h}_0(x_i) \psi_{\alpha}(x_i)=\left(\hat{t}(x_i) + \hat{u}_{\mathrm{ext}}(x_i)\right)\psi_{\alpha}(x_i)=\varepsilon_{\alpha}\psi_{\alpha}(x_i).
$$
The energies \( \varepsilon_{\alpha} \) are the so-called non-interacting single-particle energies, or unperturbed energies.
The total energy is in this case the sum over all single-particle energies, if no two-body or more complicated
many-body interactions are present.
Let us denote the ground state energy by \( E_0 \). According to the variational principle we have
$$
E_0 \le E[\Phi] = \int \Phi^*\hat{H}\Phi d\mathbf{\tau}
$$
where \( \Phi \) is a trial function which we assume to be normalized
$$
\int \Phi^*\Phi d\mathbf{\tau} = 1,
$$
where we have used the shorthand \( d\mathbf{\tau}=d\mathbf{r}_1d\mathbf{r}_2\dots d\mathbf{r}_N \).
In the Hartree-Fock method the trial function is the Slater determinant of Eq. (7) which can be rewritten as
$$
\Phi(x_1,x_2,\dots,x_N,\alpha,\beta,\dots,\nu) = \frac{1}{\sqrt{N!}}\sum_{P} (-)^P\hat{P}\psi_{\alpha}(x_1)
\psi_{\beta}(x_2)\dots\psi_{\nu}(x_N)=\sqrt{N!}\hat{A}\Phi_H,
$$
where we have introduced the antisymmetrization operator \( \hat{A} \) defined by the
summation over all possible permutations of two particles.
It is defined as
$$
\begin{equation}
\hat{A} = \frac{1}{N!}\sum_{p} (-)^p\hat{P},
\tag{8}
\end{equation}
$$
with \( p \) standing for the number of permutations. We have introduced for later use the so-called
Hartree-function, defined by the simple product of all possible single-particle functions
$$
\Phi_H(x_1,x_2,\dots,x_N,\alpha,\beta,\dots,\nu) =
\psi_{\alpha}(x_1)
\psi_{\beta}(x_2)\dots\psi_{\nu}(x_N).
$$
Both \( \hat{H}_0 \) and \( \hat{H}_I \) are invariant under all possible permutations of any two particles and hence commute with \( \hat{A} \)
$$
\begin{equation}
[H_0,\hat{A}] = [H_I,\hat{A}] = 0. \tag{9}
\end{equation}
$$
Furthermore, \( \hat{A} \) satisfies
$$
\begin{equation}
\hat{A}^2 = \hat{A}, \tag{10}
\end{equation}
$$
since every permutation of the Slater
determinant reproduces it.
The expectation value of \( \hat{H}_0 \)
$$
\int \Phi^*\hat{H}_0\Phi d\mathbf{\tau}
= N! \int \Phi_H^*\hat{A}\hat{H}_0\hat{A}\Phi_H d\mathbf{\tau}
$$
is readily reduced to
$$
\int \Phi^*\hat{H}_0\Phi d\mathbf{\tau}
= N! \int \Phi_H^*\hat{H}_0\hat{A}\Phi_H d\mathbf{\tau},
$$
where we have used Eqs. (9) and
(10). The next step is to replace the antisymmetrization
operator by its definition and to
replace \( \hat{H}_0 \) with the sum of one-body operators
$$
\int \Phi^*\hat{H}_0\Phi d\mathbf{\tau}
= \sum_{i=1}^N \sum_{p} (-)^p\int
\Phi_H^*\hat{h}_0\hat{P}\Phi_H d\mathbf{\tau}.
$$
The integral vanishes if two or more particles are permuted in only one of the Hartree-functions \( \Phi_H \) because the individual single-particle wave functions are orthogonal. We obtain then
$$
\int \Phi^*\hat{H}_0\Phi d\mathbf{\tau}= \sum_{i=1}^N \int \Phi_H^*\hat{h}_0\Phi_H d\mathbf{\tau}.
$$
Orthogonality of the single-particle functions allows us to further simplify the integral, and we
arrive at the following expression for the expectation values of the
sum of one-body Hamiltonians
$$
\begin{equation}
\int \Phi^*\hat{H}_0\Phi d\mathbf{\tau}
= \sum_{\mu=1}^N \int \psi_{\mu}^*(\mathbf{r})\hat{h}_0\psi_{\mu}(\mathbf{r})
d\mathbf{r}.
\tag{11}
\end{equation}
$$
We introduce the following shorthand for the above integral
$$
\langle \mu | \hat{h}_0 | \mu \rangle = \int \psi_{\mu}^*(\mathbf{r})\hat{h}_0\psi_{\mu}(\mathbf{r}) d\mathbf{r},
$$
and rewrite Eq. (11) as
$$
\begin{equation}
\int \Phi^*\hat{H}_0\Phi d\mathbf{\tau}
= \sum_{\mu=1}^N \langle \mu | \hat{h}_0 | \mu \rangle.
\tag{12}
\end{equation}
$$
The expectation value of the two-body part of the Hamiltonian is obtained in a similar manner. We have
$$
\int \Phi^*\hat{H}_I\Phi d\mathbf{\tau}
= N! \int \Phi_H^*\hat{A}\hat{H}_I\hat{A}\Phi_H d\mathbf{\tau},
$$
which reduces to
$$
\int \Phi^*\hat{H}_I\Phi d\mathbf{\tau}
= \sum_{i\le j=1}^N \sum_{p} (-)^p\int
\Phi_H^*V(r_{ij})\hat{P}\Phi_H d\mathbf{\tau},
$$
by following the same arguments as for the one-body
Hamiltonian.
Because of the dependence on the inter-particle distance \( r_{ij} \), permutations of any two particles no longer vanish, and we get
$$
\int \Phi^*\hat{H}_I\Phi d\mathbf{\tau}
= \sum_{i < j=1}^N \int
\Phi_H^*V(r_{ij})(1-P_{ij})\Phi_H d\mathbf{\tau}.
$$
where \( P_{ij} \) is the permutation operator that interchanges
particle \( i \) and particle \( j \). Again we use the assumption that the single-particle wave functions
are orthogonal.
We obtain
$$
\begin{align}
\int \Phi^*\hat{H}_I\Phi d\mathbf{\tau}
= \frac{1}{2}\sum_{\mu=1}^N\sum_{\nu=1}^N
&\left[ \int \psi_{\mu}^*(x_i)\psi_{\nu}^*(x_j)V(r_{ij})\psi_{\mu}(x_i)\psi_{\nu}(x_j)
dx_idx_j \right.
\tag{13}\\
&\left.
- \int \psi_{\mu}^*(x_i)\psi_{\nu}^*(x_j)
V(r_{ij})\psi_{\nu}(x_i)\psi_{\mu}(x_j)
dx_idx_j
\right]. \tag{14}
\end{align}
$$
The first term is the so-called direct term. It is frequently also called the Hartree term,
while the second is due to the Pauli principle and is called
the exchange term or just the Fock term.
The factor \( 1/2 \) is introduced because we now run over
all pairs twice.
The last equation allows us to introduce some further definitions. The single-particle wave functions \( \psi_{\mu}(x) \), defined by the quantum numbers \( \mu \) and \( x \) are defined as the overlap
$$
\psi_{\alpha}(x) = \langle x | \alpha \rangle .
$$
We introduce the following shorthands for the above two integrals
$$
\langle \mu\nu|\hat{v}|\mu\nu\rangle = \int \psi_{\mu}^*(x_i)\psi_{\nu}^*(x_j)V(r_{ij})\psi_{\mu}(x_i)\psi_{\nu}(x_j)
dx_idx_j,
$$
and
$$
\langle \mu\nu|\hat{v}|\nu\mu\rangle = \int \psi_{\mu}^*(x_i)\psi_{\nu}^*(x_j)
V(r_{ij})\psi_{\nu}(x_i)\psi_{\mu}(x_j)
dx_idx_j.
$$
The direct and exchange matrix elements can be brought together if we define the antisymmetrized matrix element
$$
\langle \mu\nu|\hat{v}|\mu\nu\rangle_{\mathrm{AS}}= \langle \mu\nu|\hat{v}|\mu\nu\rangle-\langle \mu\nu|\hat{v}|\nu\mu\rangle,
$$
or for a general matrix element
$$
\langle \mu\nu|\hat{v}|\sigma\tau\rangle_{\mathrm{AS}}= \langle \mu\nu|\hat{v}|\sigma\tau\rangle-\langle \mu\nu|\hat{v}|\tau\sigma\rangle.
$$
It has the symmetry property
$$
\langle \mu\nu|\hat{v}|\sigma\tau\rangle_{\mathrm{AS}}= -\langle \mu\nu|\hat{v}|\tau\sigma\rangle_{\mathrm{AS}}=-\langle \nu\mu|\hat{v}|\sigma\tau\rangle_{\mathrm{AS}}.
$$
The antisymmetric matrix element is also hermitian, implying
$$
\langle \mu\nu|\hat{v}|\sigma\tau\rangle_{\mathrm{AS}}= \langle \sigma\tau|\hat{v}|\mu\nu\rangle_{\mathrm{AS}}.
$$
With these notations we rewrite Eq. (14) as
$$
\begin{equation}
\int \Phi^*\hat{H}_I\Phi d\mathbf{\tau}
= \frac{1}{2}\sum_{\mu=1}^N\sum_{\nu=1}^N \langle \mu\nu|\hat{v}|\mu\nu\rangle_{\mathrm{AS}}.
\tag{15}
\end{equation}
$$
Combining Eqs. (12) and (15) we obtain the energy functional
$$
\begin{equation}
E[\Phi]
= \sum_{\mu=1}^N \langle \mu | \hat{h}_0 | \mu \rangle +
\frac{1}{2}\sum_{{\mu}=1}^N\sum_{{\nu}=1}^N \langle \mu\nu|\hat{v}|\mu\nu\rangle_{\mathrm{AS}}.
\tag{16}
\end{equation}
$$
which we will use as our starting point for the Hartree-Fock calculations later in this course.


[Contents] [Back] [Prev] [Up] [Next] [Forward]
- [Abelson88]
Harold Abelson and Gerald Jay Sussman.
Lisp: a langauge for stratified design.
BYTE 13(2):207--218, February 1988.
- [SICP]
Harold Abelson and Gerald Jay Sussman with Julie Sussman.
Structure and Interpretation of Computer Programs.
MIT Press, Cambridge, 1985.
- [Adams88]
Norman Adams and Jonathan Rees.
Object-oriented programming in Scheme.
In Proceedings of the 1988 Conference on Lisp
and Functional Programming, pages 277--288, August 1988.
- [Bartley86]
David H. Bartley and John C. Jensen.
The implementation of PC Scheme.
In Proceedings of the 1986 ACM Conference on Lisp
and Functional Programming, pages 86--93.
- [Scheme81]
John Batali, Edmund Goodhue, Chris Hanson, Howie Shrobe, Richard
M. Stallman, and Gerald Jay Sussman.
The Scheme-81 architecture--system and chip.
In Proceedings, Conference on Advanced Research in VLSI,
pages 69--77.
Paul Penfield, Jr., editor.
Artech House, 610 Washington Street, Dedham MA, 1982.
- [Bawden88]
Alan Bawden and Jonathan Rees.
Syntactic closures.
In Proceedings of the 1988 ACM Symposium on Lisp and
Functional Programming, pages 86--95.
- [Clinger84]
William Clinger.
The Scheme 311 compiler: an exercise in denotational semantics.
In Conference Record of the 1984 ACM Symposium on Lisp and
Functional Programming, pages 356--364.
- [RRRS]
William Clinger, editor.
The revised revised report on Scheme, or an uncommon Lisp.
MIT Artificial Intelligence Memo 848, August 1985.
Also published as Computer Science Department Technical Report 174,
Indiana University, June 1985.
- [Clinger88]
William Clinger.
Semantics of Scheme.
BYTE 13(2):221--227, February 1988.
- [howtoread]
William Clinger.
How to read floating point numbers accurately.
In Proceedings of the ACM SIGPLAN '90 Conference
on Programming Language Design and Implementation, pages 92--101.
Proceedings published as SIGPLAN Notices 25(6), June 1990.
- [Clinger85]
William Clinger, Daniel P. Friedman, and Mitchell Wand.
A scheme for a higher-level semantic algebra.
In Algebraic Methods in Semantics, pages 237--250.
J. Reynolds, M. Nivat, editor.
Cambridge University Press, 1985.
- [Clinger88b]
William Clinger, Anne Hartheimer, and Eric Ost.
Implementation strategies for continuations.
In Proceedings of the 1988 ACM Conference on Lisp and Functional
Programming, pages 124--131.
- [macrosthatwork]
William Clinger and Jonathan Rees.
Macros that work.
In Proceedings of the 1991 ACM Conference on Principles of
Programming Languages, pages 155--162.
- [Curtis90]
Pavel Curtis and James Rauen.
A module system for Scheme.
In Proceedings of the 1990 ACM Conference on Lisp and
Functional Programming, June 1990.
- [Dybvig87]
R. Kent Dybvig.
The Scheme Programming Language.
Prentice-Hall, 1987.
- [Dybvig86]
R. Kent Dybvig and Daniel P. Friedman and Christopher T. Haynes.

Lisp and Symbolic Computation 1(1):53--76, June 1988.
- [Dybvig88]
R. Kent Dybvig and Robert Hieb.
A variable-arity procedural interface.
In Proceedings of the 1988 ACM Symposium on Lisp and
Functional Programming, pages 106--115.
- [Dybvig88]
R. Kent Dybvig and Robert Hieb.
Engines from continuations.
Journal of Computer Languages 14(2), pages 109--123,
1989.
- [Dybvig88]
R. Kent Dybvig and Robert Hieb.
Continuations and concurrency.
In Proceedings of the Second ACM SIGPLAN Notices
Symposium on Principles and Practice of Parallel Programming,
pages 128--136, March 1990.
- [Eisenberg85]
Michael A. Eisenberg.
Bochser: an integrated Scheme programming system.
MIT Laboratory for Computer Science Technical Report 349,
October 1985.
- [Eisenberg88]
Michael Eisenberg.
Harold Abelson, editor.
Programming In Scheme.
Scientific Press, Redwood City, California, 1988.
- [Eisenberg90]
Michael Eisenberg, with William Clinger and Anne Hartheimer.
Harold Abelson, editor.
Programming In MacScheme.
Scientific Press, San Francisco, 1990.
- [Feeley86]
Marc Feeley.
Deux approches `a l'implantation du language Scheme.
M.Sc. thesis, D'epartement d'Informatique et de Recherche
Op'erationelle, University of Montreal, May 1986.
- [Feeley87]
Marc Feeley and Guy LaPalme.
Using closures for code generation.
Journal of Computer Languages 12(1):47--66, 1987.
- [Feeley90]
Marc Feeley and James Miller.
A parallel virtual machine for efficient Scheme compilation.
In Proceedings of the 1990 ACM Conference on Lisp and
Functional Programming, June 1990.
- [Felleisen87b]
Matthias Felleisen.
Reflections on Landin's J-Operator: a partly historical note.
Journal of Computer Languages 12(3/4):197--207, 1987.
- [Felleisen86b]
Matthias Felleisen and Daniel P. Friedman.
Control operators, the SECD-machine, and the lambda-calculus.
In 3rd Working Conference on the Formal Description of
Programming Concepts, pages 193--219, August 1986.
- [Felleisen86c]
Matthias Felleisen and Daniel P. Friedman.
A closer look at export and import statements.
Journal of Computer Languages 11(1):29--37, 1986.
- [Felleisen87]
Matthias Felleisen and Daniel P. Friedman.
A calculus for assignments in higher-order languages.
In Conference Record of the 14th Annual ACM Symposium
on Principles of Programming Languages, pages 314--345, January 1987.
- [Felleisen87d]
Matthias Felleisen and Daniel P. Friedman.
A reduction semantics for imperative higher-order languages.
In Lecture Notes in Computer Science,
Parallel Architectures and Languages Europe 259:206--223, 1987.
De Bakker, Nijman and Treleaven, editors.
Springer-Verlag, Berlin.
- [Felleisen86]
Matthias Felleisen, Daniel P. Friedman, Eugene Kohlbecker, and Bruce Duba.
Reasoning with continuations.
In Proceedings of the Symposium on Logic in Computer Science,
pages 131--141.
IEEE Computer Society Press, Washington DC, 1986.
- [Felleisen87c]
Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, and Bruce Duba.
A syntactic theory of sequential control.
Theoretical Computer Science
52:205--237, 1987.
- [Felleisen88]
Matthias Felleisen, Mitchell Wand, Daniel P. Friedman, and Bruce Duba.
Abstract continuations: a mathematical semantics for
handling functional jumps.
In Proceedings of the 1988 ACM Symposium on Lisp and
Functional Programming,
July 1988.
- [Scheme311]
Carol Fessenden, William Clinger, Daniel P. Friedman, and Christopher Haynes.
Scheme 311 version 4 reference manual.
Indiana University Computer Science Technical Report 137, February 1983.
Superseded by [Scheme84].
- [Franco90]
John Franco and Daniel P. Friedman.
Towards a facility for lexically scoped, dynamic mutual recursion
in Scheme.
Journal of Computer Languages 15(1):55--64, 1990.
- [Lisper]
Daniel P. Friedman and Matthias Felleisen.
The Little LISPer.
Science Research Associates, second edition 1986.
- [littlelisper]
Daniel P. Friedman and Matthias Felleisen.
The Little LISPer.
MIT Press, 1987.
- [Friedman85]
Daniel P. Friedman and Christopher T. Haynes.
Constraining control.
In Proceedings of the Twelfth Annual Symposium on Principles of
Programming Languages, pages 245--254.
ACM, January 1985.
- [Friedman84]
Daniel P. Friedman, Christopher T. Haynes, and Eugene Kohlbecker.
Programming with continuations.
In Program Transformation and Programming Environments,
pages 263--274.
P. Pepper, editor.
Springer-Verlag, 1984.
- [Scheme84]
D. Friedman, C. Haynes, E. Kohlbecker, and M. Wand.
Scheme 84 interim reference manual.
Indiana University Computer Science Technical Report 153, January 1985.
- [Friedman84b]
Daniel P. Friedman and Mitchell Wand.
Reification: reflection without metaphysics.
In Conference Record of the 1984 ACM Symposium on Lisp
and Functional Programming, pages 348--355.
- [Haynes86]
Christopher T. Haynes.
Logic continuations.
In Proceedings of the Third International Conference on
Logic Programming, pages 671--685.
Springer-Verlag, July 1986.
- [Engines]
Christopher T. Haynes and Daniel P. Friedman.
Engines build process abstractions.
In Conference Record of the 1984 ACM Symposium on Lisp and
Functional Programming, pages 18--24.
- [Haynes87b]
Christopher T. Haynes and Daniel P. Friedman.
Abstracting timed preemption with engines.
Journal of Computer Languages 12(2):109--121, 1987.
- [Haynes87a]
Christopher T. Haynes and Daniel P. Friedman.
Embedding continuations in procedural objects.
ACM Transactions on Programming Languages and Systems 9(4):582--598,
October 1987.
- [Haynes86]
Christopher T. Haynes and Daniel P. Friedman and Mitchell Wand.
Obtaining coroutines with continuations.
Journal of Computer Languages 11(3/4):143--153, 1986.
- [Henderson82]
Peter Henderson.
Functional geometry.
In Conference Record of the 1982 ACM Symposium on Lisp and
Functional Programming, pages 179--187.
- [Dybvig88]
Robert Hieb, R. Kent Dybvig, and Carl Bruggeman.
Representing control in the presence of first-class continuations.
In Proceedings of the ACM SIGPLAN '90 Conference on Programming
Language Design and Implementation,
pages 66--77, June 1990.
Proceedings published as SIGPLAN Notices 25(6), June 1990.
- [IEEE]
IEEE Standard 754-1985. IEEE Standard for Binary Floating-Point
Arithmetic. IEEE, New York, 1985.
- [IEEEScheme]
IEEE Standard 1178-1990. IEEE Standard for the Scheme
Programming Language. IEEE, New York, 1991.
- [Kohlbecker86]
Eugene Edmund Kohlbecker Jr.
Syntactic Extensions in the Programming Language Lisp.
PhD thesis, Indiana University, August 1986.
- [hygienic]
Eugene E. Kohlbecker, Daniel P. Friedman, Matthias Felleisen, and Bruce Duba.
Hygienic macro expansion.
In Proceedings of the 1986 ACM Conference on Lisp
and Functional Programming, pages 151--161.
- [Kranz86]
David Kranz, Richard Kelsey, Jonathan Rees, Paul Hudak, James Philbin,
and Norman Adams.
Orbit: An optimizing compiler for Scheme.
In Proceedings of the SIGPLAN '86 Symposium on Compiler
Construction, pages 219--233.
ACM, June 1986.
Proceedings published as SIGPLAN Notices 21(7), July 1986.
- [Kranz88]
David Kranz.
Orbit: An optimizing compiler for Scheme.
PhD thesis, Yale University, 1988.
- [Landin65]
Peter Landin.
A correspondence between Algol 60 and Church's lambda notation: Part I.
Communications of the ACM 8(2):89--101, February 1965.
- [McDermott80]
Drew McDermott.
An efficient environment allocation scheme in an interpreter for a
lexically-scoped lisp.
In Conference Record of the 1980 Lisp Conference, pages
154--162.
Proceedings reprinted by ACM.
- [MITScheme]
MIT Department of Electrical Engineering and Computer Science.
Scheme manual, seventh edition.
September 1984.
- [Muchnick80]
Steven S. Muchnick and Uwe F. Pleban.
A semantic comparison of Lisp and Scheme.
In Conference Record of the 1980 Lisp Conference, pages 56--64.
Proceedings reprinted by ACM.
- [Naur63]
Peter Naur et al.
Revised report on the algorithmic language Algol 60.
Communications of the ACM 6(1):1--17, January 1963.
- [Penfield81]
Paul Penfield, Jr.
Principal values and branch cuts in complex APL.
In APL '81 Conference Proceedings, pages 248--256.
ACM SIGAPL, San Francisco, September 1981.
Proceedings published as APL Quote Quad 12(1), ACM, September 1981.
- [Pitman85]
Kent M. Pitman.
Exceptional situations in Lisp.
MIT Artificial Intelligence Laboratory Working Paper 268, February 1985.
- [Pitman83]
Kent M. Pitman.
The revised MacLisp manual (Saturday evening edition).
MIT Laboratory for Computer Science Technical Report 295, May 1983.
- [Pitman80]
Kent M. Pitman.
Special forms in Lisp.
In Conference Record of the 1980 Lisp Conference, pages 179--187.
Proceedings reprinted by ACM.
- [Plebanthesis]
Uwe F. Pleban.
A Denotational Approach to Flow Analysis and Optimization of Scheme,
A Dialect of Lisp. PhD thesis, University of Kansas, 1980.
- [Rees89]
Jonathan A. Rees.
Modular Macros.
M.S. thesis, MIT, May 1989.
- [Rees82]
Jonathan A. Rees and Norman I. Adams IV.
T: A dialect of Lisp or, lambda: The ultimate software tool.
In Conference Record of the 1982 ACM Symposium on Lisp and
Functional Programming, pages 114--122.
- [Rees84]
Jonathan A. Rees, Norman I. Adams IV, and James R. Meehan.
The T manual, fourth edition.
Yale University Computer Science Department, January 1984.
- [R3RS]
Jonathan Rees and William Clinger, editors.
The revised^3 report on the algorithmic language Scheme.
In ACM SIGPLAN Notices 21(12), pages 37--79, December 1986.
- [Reynolds72]
John Reynolds.
Definitional interpreters for higher order programming languages.
In ACM Conference Proceedings, pages 717--740.
ACM,
1972.
- [Rozas84]
Guillermo J. Rozas.
Liar, an Algol-like compiler for Scheme.
S. B. thesis, MIT Department of Electrical Engineering and Computer
Science, January 1984.
- [schflow]
Olin Shivers.
Control flow analysis in Scheme.
Proceedings of the SIGPLAN 1988 Conference on
Programming Language Design and Implementation, pages 164--174.
Proceedings published as SIGPLAN Notices 23(7), July 1988.
- [Sitaram90]
Dorai Sitaram and Matthias Felleisen.
Control delimiters and their hierarchies.
Lisp and Symbolic Computation 3(1):67--99, January 1990.
- [Smith84]
Brian C. Smith.
Reflection and semantics in a procedural language.
MIT Laboratory for Computer Science Technical Report 272, January 1982.
- [Springer89]
George Springer and Daniel P. Friedman.
Scheme and the Art of Programming.
MIT Press and McGraw-Hill, 1989.
- [Srivastava85]
Amitabh Srivastava, Don Oxley, and Aditya Srivastava.
An(other) integration of logic and functional programming.
In Proceedings of the Symposium on Logic Programming, pages 254--260.
IEEE, 1985.
- [Stallman80]
Richard M. Stallman.
Phantom stacks--if you look too hard, they aren't there.
MIT Artificial Intelligence Memo 556, July 1980.
- [Declarative]
Guy Lewis Steele Jr.
Lambda, the ultimate declarative.
MIT Artificial Intelligence Memo 379, November 1976.
- [Debunking]
Guy Lewis Steele Jr.
Debunking the "expensive procedure call" myth, or procedure call
implementations considered harmful, or lambda, the ultimate GOTO.
In ACM Conference Proceedings, pages 153--162.
ACM, 1977.
- [Macaroni]
Guy Lewis Steele Jr.
Macaroni is better than spaghetti.
In Proceedings of the Symposium on Artificial Intelligence and
Programming Languages, pages 60--66.
These proceedings were published as a special joint issue of SIGPLAN Notices 12(8) and SIGART Newsletter 64, August 1977.
- [Rabbit]
Guy Lewis Steele Jr.
Rabbit: a compiler for Scheme.
MIT Artificial Intelligence Laboratory Technical Report 474, May 1978.
- [renamegoto]
Guy Lewis Steele Jr.
Compiler optimization based on viewing LAMBDA as RENAME + GOTO.
In AI: An MIT Perspective.
Patrick Henry Winston Richard Henry Brown, editor.
MIT Press, 1980.
- [CLoverview]
Guy Lewis Steele Jr.
An overview of Common Lisp.
In Conference Record of the 1982 ACM Symposium on Lisp and
Functional Programming, pages 98--107.
- [CLtL]
Guy Lewis Steele Jr.
Common Lisp: The Language.
Digital Press, Burlington MA, 1984.
- [Imperative]
Guy Lewis Steele Jr. and Gerald Jay Sussman.
Lambda, the ultimate imperative.
MIT Artificial Intelligence Memo 353, March 1976.
- [Scheme78]
Guy Lewis Steele Jr. and Gerald Jay Sussman.
The revised report on Scheme, a dialect of Lisp.
MIT Artificial Intelligence Memo 452, January 1978.
- [TAOTI]
Guy Lewis Steele Jr. and Gerald Jay Sussman.
The art of the interpreter, or the modularity complex (parts zero, one,
and two).
MIT Artificial Intelligence Memo 453, May 1978.
- [DOALBP]
Guy Lewis Steele Jr. and Gerald Jay Sussman.
Design of a Lisp-based processor.
Communications of the ACM 23(11):628--645, November 1980.
- [Dream]
Guy Lewis Steele Jr. and Gerald Jay Sussman.

In Conference Record of the 1980 Lisp Conference, pages 163--172.
Proceedings reprinted by ACM.
- [howtoprint]
Guy Lewis Steele Jr. and Jon L White.
How to print floating point numbers accurately.
In Proceedings of the ACM SIGPLAN '90 Conference
on Programming Language Design and Implementation, pages 112--126.
Proceedings published as SIGPLAN Notices 25(6), June 1990.
- [Sussman82]
Gerald Jay Sussman.
Lisp, programming and implementation.
In Functional Programming and its Applications.
Darlington, Henderson, Turner, editor.
Cambridge University Press, 1982.
- [Scheme75]
Gerald Jay Sussman and Guy Lewis Steele Jr.
Scheme: an interpreter for extended lambda calculus.
MIT Artificial Intelligence Memo 349, December 1975.
- [Scheme79]
Gerald Jay Sussman, Jack Holloway, Guy Lewis Steele Jr., and Alan Bell.
Scheme-79--Lisp on a chip.
IEEE Computer 14(7):10--21, July 1981.
- [Stoy77]
Joseph E. Stoy.
Denotational Semantics: The Scott-Strachey Approach to
Programming Language Theory.
MIT Press, Cambridge, 1977.
- [TI85]
Texas Instruments, Inc.
TI Scheme Language Reference Manual.
Preliminary version 1.0, November 1985.
- [Vegdahl89]
Steven R. Vegdahl and Uwe F. Pleban.
The runtime environment for Screme, a Scheme implementation on the 88000.
In Proceedings of the Third International Conference on Architectural
Support for Programming Languages and Operating Systems,
pages 172--182, April 1989.
- [Wand78]
Mitchell Wand.
Continuation-based program transformation strategies.
Journal of the ACM 27(1):174--180, 1978.
- [Wand80]
Mitchell Wand.
Continuation-based multiprocessing.
In Conference Record of the 1980 Lisp Conference, pages 19--28.
Proceedings available from ACM.
- [Wand86]
Mitchell Wand.
Finding the source of type errors.
In Conference Record of the Thirteenth Annual Symposium on
Principles of Programming Languages, pages 38--43, 1986.
- [tower]
Mitchell Wand.
The mystery of the tower revealed: a non-reflective description of the reflective tower.
In Proceedings of the 1986 ACM Symposium on LISP and Functional
Programming, pages 298--307, August 1986.
- [Wand78]
Mitchell Wand and Daniel P. Friedman.
Compiling lambda expressions using continuations and factorizations.
Journal of Computer Languages 3:241--263, 1978.
- [Wand88]
Mitchell Wand and Daniel P. Friedman.
The mystery of the tower revealed: a non-reflective description of the
reflective tower.
In Meta-Level Architectures and Reflection, pages 111--134.
P. Maes and D. Nardi, editor.
Elsevier Sci. Publishers B.V. (North Holland), 1988.
[Contents] [Back] [Prev] [Up] [Next] [Forward]


{{fullname}}
Logout
View Profile
Change Password
Membership Order
Home
INSTRUCTIONS
Step 1: Upload or drag and drop PDF file.
Step 2: Check box, if you require an expiration date (not mandatory).
Step 3: Add participants.
Step 4: You can rearrange signing order under "priority". Click on arrow up or down to change signing order (not mandatory). Click next to complete.
e-signature
Compose
Action Required
Completed
Contact
Pick a date
Pick a date
SEARCH
pdf-{{document.documentid}}.pdf
Need to sign
Need To Sign: {{document.firstName}}({{document.email}})
From: {{document.from}}
pdf-{{document.documentid}}.pdf
Completed
Signed By: : {{document.firstName}}({{document.email}})
From: {{document.from}}


Loading
Permutation Poetry
Project Gutenberg
Moby Dick, Julius Caesar, Paradise Lost, etc.
+
Rhyming phrases
+
Flickr image search
+
Google Web Fonts
Click to advance


{{#block "hero"}} {{/block}}
{{#if banners.top}}
{{{limit banners.top 1}}}
{{else}}
{{> components/themes/sections/section section="pibags1"}}
{{/if}}
{{> components/themes/sections/section section="pibags-accessories"}}
{{> components/themes/sections/section section="pibags-boardslider"}}
{{> components/themes/sections/section section="pibags-igfeed"}}
{{#if banners.bottom}}
{{{limit banners.bottom 1}}}
{{/if}}


Until the mid nineties in France one could buy those anti asthma cigarettes called 'Louis Legras'. The main ingredient was Datura leaves but they also contained other plants such as belladonna. I was 19 at the time and was called to the compulsory French army test, which I really wanted to fail in order to avoid serving one year. A lot of people were pretending to be psychologically ill so the army people were very tough on fake psychos.
A friend I was hanging out with the night before handed me 5 of these cigarettes saying, “With those you won't need to pretend being deranged because you'll really be deranged”
I went back home and started to make an infusion with the 5 ciggies, looked like a really dark tea, then I went to bed.
I woke up late the next morning, just had to time to jump into my trousers, grab a shirt and hit the kitchen to drink the 'Magic Potion'. It was so sour I had to add loads of honey to it. I drunk 2 mugs and got out to catch the bus. Within 5 minutes, I was on that bus, my hands started to grip a bar and my head starting to move around; with a slight paranoia like feeling. I hoped some other guys were going to the military camp were on that bus (5 min ride), so I just followed them. As I entered the camp the effects were kicking hard but I was still able to talk. I met an officer that I knew from school who laughed at me saying. “Ah ah Weirdo you don't want to do it, the army”
We were all in line, going thru the medical tests, first thing they ask you is to drop some urine in a small glass. Impossible. My mouth was also very dry and from that moment I realised it was gonna be a hard trip. They carried on with the tests, some funny results came out as I noticed I could read the smallest letters on the eyesight test and hear the slightest noise they would throw in the earphones for the hearing test, but I miserably failed the contrast/colours test. I was supposed to see letters, numbers or symbols. I remember talking about devils, witches and a goat dancing around a bonfire. I had to go through a lot of stairs and corridors to see various doctors (eyes, ears, etc..) and one thing that was really crazy is that I couldn't tell if the stairs were going up or down, sometimes I would want to lean against a wall and the wall I expected just wasn't there.
During lunch I chocked on a small sardine filet I was trying to eat. Army guys had to grab my legs and turn me upside down, then a doc came and asked me if I wanted to see a psychologist, I said I was alright and I didn't want to but he insisted
So there I was in the psych office, being asked all sorts of questions while eyes are popping out of the table (I try to poke them but they move too fast):
'Are your parents divorced'? (yes)
'Are you afraid of snakes'? (no spiders)
'If I say red you think what'? (blood, of course)
In a way I was still aware I should act within my own trip, though I still wonder if the psych decided to evict me because he thought I was deranged or if he knew what kind of stuff I had taken and thought 'if this guy is up to this in order to avoid the army then we don't wanna take any risks'.
I jumped in an army bus that took all the 'retards' back to the downtown train station, and jumped into the next train to my dad's home in a nearby village. The thing is I took the wrong train and ended up somewhere else (still wonder where) I walked around in that other city all night, talked with mates that were in a tree for a few hours and also made friend with a stray dog that could also speak. I got back to the station in the morning after walking many miles and I made it back to my hometown.
I had lost nearly everything, wallet, vest, keys even that important Army paper, so I crawled to my girlfriend's apartment. She was very worried as no one had had news from me since morning before. I collapsed in her bedroom and woke up 30 hours later.
I guess the dose wasn't that bad. Still a little too strong for my taste.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


The July 2005 PWG/P2600 and
FSG meetings will be hosted by Apple at their facilities in
July meeting schedule
|
Day |
Date |
Morning |
Afternoon |
Evening |
|
Monday |
Jul – 11 |
P2600 |
P2600 |
-- |
|
Tuesday |
Jul – 12 |
P2600 |
P2600 |
-- |
|
Wednesday |
Jul – 13 |
1. IPP MailTo Last Call 2. Projectors and Displays Management BOF |
1. Joint PWG/FSG Plenary 2.
DMTF CIM |
DMTF Overflow |
|
Thursday |
Jul – 14 |
WIMS |
1. Semantic Model 2.
|
Port Mon Prototype Testing ( |
|
Friday |
Jul – 15 |
Port Mon MIB |
Port Mon MIB (ends at 1pm) |
-- |
All
meetings begin at
Apple's address:
1 Infinite
CA 95014
Tel # for the main lobby is<PHONE_NUMBER>
Or contact Paul Danbold’s admin Marilyn Tonna<PHONE_NUMBER>.
Airports:
is about
You are responsible for you own hotel accommodations
Nearby hotels:
Cypress
Hotel - walking distance from the Apple campus.
(408) 253-8900
<http://www.thecypresshotel.com/>
Cupertino Inn - walking distance from the Apple campus.
(408) 996-7700
<http://www.cupertinoinn.com/>
Courtyard by Marriott - requires car to get to the Apple campus
(408) 252-9100
<http://marriott.com/property/propertypage/SJCCU>
WoodCrest Hotel - requires car to get to the Apple campus
(408) 446-9636
<http://www.woodcresthotel.com/>
Please e-mail Harry Lewis at<EMAIL_ADDRESS>to indicate which days you plan to attend.


| 1 |
Li_Z_2020 |
Vicarious traumatization in the general public, members, and non-members of medical teams aiding in COVID-19 control |
Li, Zhenyu; Ge, Jingwu; Yang, Meiling; Feng, Jianping; Qiao, Mei; Jiang, Riyue; Bi, Jiangjiang; Zhan, Gaofeng; Xu, Xiaolin; Wang, Long; Zhou, Qin; Zhou, Chenliang; Pan, Yinbing; Liu, Shijiang; Zhang, Haiwei; Yang, Jianjun; Zhu, Bin; Hu, Yimin; Hashimoto, Kenji; Jia, Yan; Wang, Haofei; Wang, Rong; Liu, Cunming; Yang, Chun |
2020 |
2020-03-10 |
PMC |
Y |
|
|
10.1016/j.bbi.2020.03.007 |
v2u96kmc |
0.994294 |
|
Li_Z_2020 |
| 2 |
Li_Z_2020 |
Vicarious traumatization in the general public, members, and non-members of medical teams aiding in COVID-19 control |
Zhenyu Li; Jingwu Ge; Meiling Yang; Jianping Feng; Mei Qiao; Riyue Jiang; Jiangjiang Bi; Gaofeng Zhan; Xiaolin Xu; Long Wang; Qin Zhou; Chenliang Zhou; Yinbing Pan; Shijiang Liu; Haiwei Zhang; Jianjun Yang; Bin Zhu; Yimin Hu; Kenji Hashimoto; Yan Jia; Haofei Wang; Rong Wang; Cunming Liu; Chun Yang |
2020 |
2020-03-03 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>29322 |
s43mous6 |
0.945176 |
|
Li_Z_2020, Lu_W_2020 |
| 3 |
Yang_2020 |
Analysis of psychological state and clinical psychological intervention model of patients with COVID-19 |
Lu Yang; Danjuan Wu; Yanbin Hou; Xunqiang Wang; Ni Dai; Guanjun Wang; Qing Yang; Wenhui Zhao; Zhongze Lou; Yunxin Ji; Liemin Ruan |
2020 |
2020-03-24 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>40899 |
gjfd1jhb |
0.917575 |
Wu_K_2005, Chang_2010, Wu_K_2005 |
Lu_W_2020 |
| 4 |
Jiang_2020 |
Psychological crisis intervention during the outbreak period of new coronavirus pneumonia from experience in Shanghai |
Jiang, Xixi; Deng, Lili; Zhu, Yuncheng; Ji, Haifeng; Tao, Lily; Liu, Li; Yang, Daoliang; Ji, Weidong |
2020 |
2020-04-30 |
PMC |
Y |
PMC7112608 |
32146245.0 |
10.1016/j.psychres.2020.112903 |
1vylk98e |
0.805374 |
|
Zhang_2020, Xu_J_2020 |
| 5 |
Liu_J_2020 |
The 24-Form Tai Chi Improves Anxiety and Depression and Upregulates miR-17-92 in Coronary Heart Disease Patients After Percutaneous Coronary Intervention |
Liu, Jia; Yu, Ping; Lv, Wei; Wang, Xinxin |
2020 |
2020-03-11 |
COMM-USE |
N |
PMC7078346 |
32218741.0 |
10.3389/fphys.2020.00149 |
bc6i5izr |
0.785867 |
Zong_2010 |
Yang_2020 |
| 6 |
Lu_W_2020 |
Psychological status of medical workforce during the COVID-19 pandemic: a cross-sectional study |
Lu, Wen; Wang, Hang; Lin, Yuxing; Li, Li |
2020 |
2020-04-04 |
PMC |
Y |
|
|
10.1016/j.psychres.2020.112936 |
a2xzj65z |
0.683325 |
Wu_K_2005 |
Yang_2020 |
| 7 |
sun_n_2020 |
Study of the mental health status of medical personnel dealing with new coronavirus pneumonia |
ning sun; jun xing; jun xu; ling shu geng; qian yu li |
2020 |
2020-03-06 |
BioRxiv |
N |
|
|
10.1101/2<IP_ADDRESS>30973 |
sozs02x0 |
0.673099 |
|
|
| 8 |
Zhang_2020 |
Recommended psychological crisis intervention response to the 2019 novel coronavirus pneumonia outbreak in China: a model of West China Hospital |
Zhang, Jun; Wu, Weili; Zhao, Xin; Zhang, Wei |
2020 |
2020-02-18 |
None |
Y |
PMC7107095 |
|
10.1093/pcmedi/pbaa006 |
030bc0h3 |
0.647540 |
|
Yang_2020 |
| 9 |
Meng_2020 |
The Psychological effect of COVID-19 on the Elderly in China |
Meng, Hui; Xu, Yang; Dai, Jiali; Zhang, Yang; Liu, Baogeng; Yang, Haibo |
2020 |
2020-04-11 |
PMC |
Y |
|
|
10.1016/j.psychres.2020.112983 |
xibx3nkd |
0.646747 |
|
Zhang_2020, Yang_2020, Lu_W_2020 |
| 10 |
Meng_2011 |
A Chinese Herbal Formula to Improve General Psychological Status in Posttraumatic Stress Disorder: A Randomized Placebo-Controlled Trial on Sichuan Earthquake Survivors |
Meng, Xian-Ze; Wu, Feng; Wei, Pin-Kang; Xiu, Li-Juan; Shi, Jun; Pang, Bin; Sun, Da-Zhi; Qin, Zhi-Feng; Huang, Yi; Lao, Lixing |
2011 |
2011-10-19 |
COMM-USE |
N |
PMC3199055 |
22028733.0 |
10.1155/2012/691258 |
nz06v56o |
0.633074 |
Zong_2010, Wu_K_2005, sun_n_2020 |
Hong_2009 |
| 11 |
Liu_K_2020 |
Effects of progressive muscle relaxation on anxiety and sleep quality in patients with COVID-19 |
Liu, Kai; Chen, Ying; Wu, Duozhi; Lin, Ruzheng; Wang, Zaisheng; Pan, Liqing |
2020 |
2020-05-31 |
PMC |
Y |
PMC7102525 |
|
10.1016/j.ctcp.2020.101132 |
v8wqhyf5 |
0.567664 |
Hong_2009, Wu_K_2005, sun_n_2020 |
Liu_K_2020, Yang_2020, Qi_J_2020 |
| 12 |
Lin_C_2007 |
The psychological effect of severe acute respiratory syndrome on emergency department staff |
Lin, C‐Y; Peng, Y‐C; Wu, Y‐H; Chang, J; Chan, C‐H; Yang, D‐Y |
2007 |
2007-01-01 |
PMC |
N |
PMC2658141 |
17183035.0 |
10.1136/emj.2006.035089 |
v3zsr1n1 |
0.528549 |
|
Hong_2009, Mak_I_2009 |
| 13 |
Huang_2020 |
Emotional responses and coping strategies of nurses and nursing college students during COVID-19 outbreak |
Long Huang; Fu ming xu; Hai rong Liu |
2020 |
2020-03-08 |
BioRxiv |
Y |
|
|
10.1101/2<IP_ADDRESS>31898 |
yj2jh694 |
0.462877 |
|
Lu_W_2020, Yang_2020 |
| 14 |
Carvalho_2020 |
The psychiatric impact of the novel coronavirus outbreak |
Carvalho, Poliana Moreira de Medeiros; Moreira, Marcial Moreno; de Oliveira, Matheus Nogueira Arcanjo; Landim, José Marcondes Macedo; Neto, Modesto Leite Rolim |
2020 |
2020-04-30 |
PMC |
Y |
PMC7133679 |
32146248.0 |
10.1016/j.psychres.2020.112902 |
si91es0i |
0.427365 |
|
|
| 15 |
DARBYSHIRE_1990 |
Chapter 20 Acute Respiratory/Enteric Disease in Calves and Sheep |
DARBYSHIRE, J.H. |
1990 |
1990-12-31 |
PMC |
N |
PMC7155690 |
|
10.1016/b978-0-444-87312-5.50033-3 |
6dcfr9fg |
0.364522 |
|
|
| 16 |
Liu_K_2020 |
Respiratory rehabilitation in elderly patients with COVID-19: A randomized controlled study |
Liu, Kai; Zhang, Weitong; Yang, Yadong; Zhang, Jinpeng; Li, Yunqian; Chen, Ying |
2020 |
2020-05-31 |
PMC |
Y |
PMC7118596 |
|
10.1016/j.ctcp.2020.101166 |
p8vhi6d9 |
0.354325 |
Chang_2010, Langerud_2018, Chan_2005 |
|
| 17 |
Xu_J_2020 |
Psychological status of surgical staff during the COVID-19 outbreak |
Xu, Jian; Xu, Qian-hui; Wang, Chang-ming; Wang, Jun |
2020 |
2020-04-11 |
PMC |
Y |
|
|
10.1016/j.psychres.2020.112955 |
5htj2qsw |
0.329189 |
|
|
| 18 |
Kim_S_2020 |
Using psychoneuroimmunity against COVID-19 |
Kim, Sung-Wan; Su, Kuan-Pin |
2020 |
2020-03-29 |
PMC |
Y |
|
|
10.1016/j.bbi.2020.03.025 |
jin0fdcm |
0.323254 |
|
|


syncdb, allow_syncdb, pre_syncdb, and post_syncdb deprecated
makemigrations, migrate, allow_migrate, pre_migrate, and post_migrate
initial_data no longer loaded; use RunPython or RunSQL
South 1.0 with Django migrations possible
Leo's Pizza
A tutorial
models.py
from django.db import models
from django.utils.translation import ugettext_lazy as _
class Pizza(models.Model):
name = models.CharField(_('name'), max_length=12)
class Meta:
verbose_name = _('pizza')
verbose_name_plural = _('pizzas')
from django.db import models
from django.utils.translation import ugettext_lazy as _
class Pizza(models.Model):
name = models.CharField(_('name'), max_length=12)
price = models.DecimalField(_('price'), max_digits=5, decimal_places=2)
class Meta:
verbose_name = _('pizza')
verbose_name_plural = _('pizzas')


This is our dessert selections
Desserts are to be eaten at home, not in the restaurant.
- Lemon Cream Pie
- Worms
- Strawberry Ice Cream
- Fudge
- The sky
- Mysterious red liquid we found in the kitchen
- Mashed potatoes
- Leftovers from dinner
- Empty box
- Sampler of all of the above


{% for url in game.jsincludes -%} {%- endfor %} {% raw %}
Change Layout
Progression Plan
Progression Constraints
Level Editor
{% endraw %}


This is an Intelligent elf used to help others in need.
It uses effort and time to achieve his purpose.
An emotionally intelligent nurse is able to read patients, patients’ family, and coworkers. Based on each situation and how others are feeling, she can base her actions and responses to questions. They can place themselves in others’ situations. Despite being in emotional situations, they are able to stay focuses and keep goals clear.
An emotionally intelligent nurse is able to read patients, patients’ family, and coworkers. Based on each situation and how others are feeling, she can base her actions and responses to questions. They can place themselves in others’ situations. Despite being in emotional situations, they are able to stay focuses and keep goals clear.
An emotionally intelligent nurse is able to read patients, patients’ family, and coworkers. Based on each situation and how others are feeling, she can base her actions and responses to questions. They can place themselves in others’ situations. Despite being in emotional situations, they are able to stay focuses and keep goals clear.
An emotionally intelligent nurse is able to read patients, patients’ family, and coworkers. Based on each situation and how others are feeling, she can base her actions and responses to questions. They can place themselves in others’ situations. Despite being in emotional situations, they are able to stay focuses and keep goals clear.
An emotionally intelligent nurse is able to read patients, patients’ family, and coworkers. Based on each situation and how others are feeling, she can base her actions and responses to questions. They can place themselves in others’ situations. Despite being in emotional situations, they are able to stay focuses and keep goals clear.
copyright 2020


| Enter your search term in the box below. All components of the Digital Clendening will be searched. |
Enter search terms in all lower case. This forces the search engine to find all versions of the terms—upper, lower or mixed case. Example:
search term: harvey
matches: Harvey, harvey or HARVEY
Entering your search terms in mixed case will force the search engine to match that term exactly.
search term: Harvey
matches: Harvey, but not harvey or HARVEY
NOTE: the search engine performs word stemming by default. A search on the term ‘diagnostic’ will also produce results that include diagnostics, etc.
Searching only page titles
You can steamline your searches by restricting them to one specific area of a document. For example, search for a page title match as follows:harvey <IN> title<IN> instructs the search engine to look in a specific location for the terms included in the search, in this case, the document title. The <IN> tag can also specify: <PARAGRAPH> <SENTENCE> <PHRASE> or <NEAR> (NEAR selects documents containing specified search terms, where the closer the search terms are within a document, the higher the document’s ranking).
Boolean searches
A boolean search is one in which you assign simple rules to the search. The most basic of these are the AND, OR, and NOT operators. Examples:search term: harvey AND circulation
matches pages that contain the two terms: harvey and circulationsearch term: harvey NOT circulation
matches documents that contain the term ‘harvey’ but not the term ‘circulation’.search term: harvey OR circulation
Matches documents that contain one or both terms ‘harvey’ or ‘circulation’


Of course! Please do bring them. Use this as a night on the town.
Nope - this is completely outside of (and not sanctioned by) work.
Why not stay over?
The Monaco has some very fancy hotel rooms, and because it's not a Steelers home game, they aren't terribly expensive.


Dashboard
Active jobs
View report »Clicks today
View report »Cost per click
View report »Clicks per dollar
View report »Estimated cost today
View report »Cost so far this month
View report »Today's clickthroughs
This month's clickthroughs
Top jobs
| Job title | Clicks |
| My fabulous job with a long title | 82 |
| My other great job that has an even longer title | 76 |
| This one is so long that it has to use an ellipsis to handle overflowing text | 75 |
| This one is short | 63 |
| This one is the best | 47 |
Status log
- Feed fetched successfully @ 6:32 AM
- Jobs successfully posted to Simply Hired @ 7:31 AM
- Jobs successfully posted to Indeed @ 7:23 AM
- Jobs successfully posted to JuJu @ 7:05 AM
- Feed fetched successfully @ 6:32 AM
- Feed fetch failed, marked for refetching @ 6:22 AM
- Feed fetched successfully @ 5:22 AM
Your account
Account status: ActiveAccount holder: John Doe
Company: My Great Company, Inc.
Payment method: Visa ****-1234
Destination excludes: Bright, TopUSAJobs.com
Subscription:
Signup date: December 23rd, 2012
Billing schedule: Monthly
Last billed: August 1st, 2013
Billing schedule: Monthly
Last billed: August 1st, 2013


Welcome to SaleOn
Online Marketplace connecting buyers and sellers globally.Whatever it is, you can get it on SaleOn.
Buy it, sell it, love it.
When it's on your mind, it's on SaleOn


Test for https://code.google.com/p/chromium/issues/detail?id=150601 Can't resize a textarea with touch.


Inspired by the excellent Tipsy jQuery plugin written by Jason Frame. Tooltips are an updated version, which don’t rely on images, use CSS3 for animations, and much more.
Use the focus
trigger to dismiss tooltips on the next click that the user makes.
tooltip content can contain any html template. Just create <template #myId>
with any
html allowed by Angular, and provide template ref (#myId
) as tooltip content.
By using small trick you can display any dynamic html, which you got from ajax request for example.
When you have some styles on a parent element that interfere with a tooltip, you’ll want to specify a container="body"
so that the tooltip’s HTML will be appended to body. This will help to avoid rendering problems in more complex components (like our input groups, button groups, etc) or inside elements with overflow: hidden


| Top |
Properties
| double | dec-cluster | Read / Write |
| NcmObjArray * | galaxy-array | Read / Write |
| double | psf-size | Read / Write |
| double | ra-cluster | Read / Write |
| double | z-cluster | Read / Write |
Functions
nc_data_cluster_wl_new ()
NcDataClusterWL *
nc_data_cluster_wl_new (void
);
Creates a new NcDataClusterWL.
nc_data_cluster_wl_new_from_file ()
NcDataClusterWL *
nc_data_cluster_wl_new_from_file (const gchar *filename
);
Creates a new NcDataClusterWL from filename
.
nc_data_cluster_wl_ref ()
NcDataClusterWL *
nc_data_cluster_wl_ref (NcDataClusterWL *dcwl
);
Increases the reference count of dcwl
by one.
nc_data_cluster_wl_free ()
void
nc_data_cluster_wl_free (NcDataClusterWL *dcwl
);
Atomically decrements the reference count of dcwl
by one. If the reference count drops to 0,
all memory allocated by dcwl
is released.
nc_data_cluster_wl_clear ()
void
nc_data_cluster_wl_clear (NcDataClusterWL **dcwl
);
The reference count of dcwl
is decreased and the pointer is set to NULL.
Property Details
The “dec-cluster”
property
“dec-cluster” double
Cluster (halo) DEC.
Owner: NcDataClusterWL
Flags: Read / Write
Allowed values: [-360,360]
Default value: 0
The “galaxy-array”
property
“galaxy-array” NcmObjArray *
Array of galaxy weak lensing objects.
Owner: NcDataClusterWL
Flags: Read / Write
The “psf-size”
property
“psf-size” double
PSF size.
Owner: NcDataClusterWL
Flags: Read / Write
Allowed values: >= 0
Default value: 0
The “ra-cluster”
property
“ra-cluster” double
Cluster (halo) RA.
Owner: NcDataClusterWL
Flags: Read / Write
Allowed values: [-360,360]
Default value: 0


| Short: |
Tactical game |
| Tech: |
Unity |
Note: this page has been cleared with the client to comply with signed Non-Disclosure-Agreement, therefore it doesn't provide some of the key details of the project in question. Some illustrations will use placeholder assets or will be distorted.
Another prototype that we made for the same investor collective in the US. While I wouldn't delve into gameplay details, generally speaking, it was a turn-based tactics game, developed in Unity, in 3D, and targeting desktop and browser (via WebGL).
As with the strategy prototype project undergo massive gameplay changes during the development, radically shifting its visual style and making gameplay much more complex.
My responsibilities were:
- Gameplay, networking, and visuals programming
- Revamping project visuals with new models and animations
- Development planning and estimation
Challenges on the project:
- Legacy code had to be systematically phased out, I retained what I could, but there were major rewrites since gameplay become tenfold more complex
- Lots of mechanics revolved around vision, which had to be symmetric from any player's perspective, and also changed dynamically based on the situation. I had to review several cell vision algorithms until I've found one that suited our needs
- Rendering and code optimizations - pathfinding, for example, made a big amount of unnecessary calculations, which I reduced and optimized. On the rendering, side overlays were made inefficient, so I rewrote the code to be rendered with custom shader and texture maps, which provided the necessary efficiency
- WebGL brought its own share of problems, mainly with optimization and custom rendering. I've introduced some post FX in the project, but it took some trial and error to get that working under WebGL
- Generally speaking, it was a challenging game from the gameplay perspective - there were abilities to move through walls, become invisible, blow up holes in walls, build new walls, involuntarily move enemy units, set up invisible traps and devices, buffs, debuffs, critical hits and misses


{#Mention sticker price, tuition -- in-state and out-of-state, net price. Median debt.#} {% if sch.COSTT4_COMB_PRESENT==1 %} The total cost (tuition and other expenses, including the cost of living expenses) at {{sch.INSTNM}} is {{sch.r_fin_COSTT4_COMB}}$/year. This is the sticker price, and very few students pay the full cost. {% if sch.NPT4_COMB_PRESENT %} After taking into account all the scholarships, the average "net price" for each student comes down to {{sch.r_fin_NPT4_COMB}}$/year. {% else %} While we don't have the numbers available for the net price, the average net price for similar schools* is {{nat_mean.NPT4_COMB}}$/year. {% endif %} {% else %} We don't know the sticker price (tuition and other expenses, including the cost of living expenses) at {{sch.INSTNM}}. However, the sticker price at similar schools* per year is {{nat_mean.COSTT4_COMB}}$. {% if sch.NPT4_COMB_PRESENT %} We do have the average "net price" for each student: after taking into account all the scholarships, it is {{sch.r_fin_NPT4_COMB}}$/year. {% else %} Unfortunately, we don't know the average "net price" for {{sch.INSTNM}} either. However, it might help to know that the average net price for similar schools* is {{nat_mean.NPT4_COMB}}$/year. {% endif %} {% endif %}
Calculate your estimated cost at {{sch.INSTNM}} using the official net-price calculator for your specific circumstances.
{% if sch.TUITIONFEE_IN != None and sch.TUITIONFEE_OUT != None %} {% if sch.TUITIONFEE_IN != sch.TUITIONFEE_OUT %} The sticker price and the net price estimated here are for students paying the in-state tuition fee. The tuition fee for the out-of-state students is {{sch.TUITIONFEE_OUT}}$/year, compared to {{sch.TUITIONFEE_IN}}$/year for the in-state students. For the out-of-state students, the sticker price quoted above is higher by {{ sch.TUITIONFEE_OUT - sch.TUITIONFEE_IN }}$/year. {% endif %} {% endif %}
{% if sch.MN_EARN_WNE_P6_PRESENT==1 %} The average salary 6 years since enrollment at {{sch.INSTNM}} is {{sch.r_fin_MN_EARN_WNE_P6}}$/year. This number doesn't count those who may still be enrolled (e.g., in graduate school). Compare this number with the national average of similar schools: {{nat_mean.MN_EARN_WNE_P6}}$/year. {% else %} We don't have that salary data available for {{sch.INSTNM}}. The national average for similar schools is {{nat_mean.MN_EARN_WNE_P6}}$/year. {% endif %}
{% if sch.C150_4_COMB_PRESENT==1 %} The graduation rate at {{sch.INSTNM}} is {{sch.r_fin_C150_4_COMB}}%. This is the percentage of students who graduate within 1.5 times of the degree completion time, meaning 6 years for a 4-year bachelors degree, and 3 years for a 2-year associate degree. For comparison, the national average graduation rate is {{nat_mean.C150_4_COMB}}% for similar schools*. {% else %} The graduation rate at {{sch.INSTNM}} is unavailable. The national average of graduation rate for similar* schools is {{nat_mean.C150_4_COMB}}%. {% endif %}
{% if sch.WDRAW_ORIG_YR6_RT_PRESENT==1 %} The dropout rate at {{sch.INSTNM}} is {{sch.r_fin_WDRAW_ORIG_YR6_RT}}%. Compare this number with the national average ({{nat_mean.WDRAW_ORIG_YR6_RT}}%) among similar schools*. {% else %} While we don't have the numbers for the dropout rate at {{sch.INSTNM}}, it might be useful to know that that the national average of this number for similar schools* is {{nat_mean.WDRAW_ORIG_YR6_RT}}%. {% endif %}
*as defined by their Carnegie classification
{% endautoescape %}


JSY highlighting with
Prism
All-in-one bundle
JSY highlighting
CDN-based bundle
JSY highlighting
Syntax plugin based
JSY highlighting
JSY source
jsy-script in html


MUPL (Made Up Programming Language) is a toy programming language introduced by Dan Grossman in "Programming Languages" course at Coursera.
One of assignments of the course was to write an interpreter for MUPL in Racket.
This site uses MUPL interpreter written in Python.
Try writting MUPL expressions in editor panel, hit SUBMIT button and see what happens
You can start with simple (add (int 1) (int 1))
More MUPL code examples can be found here
Language specification can be found here


Ok, here is a night on MDPV. All doses are oral.
I wish I could give you an Aldous Huxley experience, but with this substance I am not sure if it exists, so take it for the data someone can learn from it.
I dose at 2230 with 15 milligrams, my scale is off, but I know it is close.
The comeup is slow, I already have been drinking nearly pure alcohol and have a slight buzz. I dose with a friend at the same time so I will use him for reference.
I am very familiar with drugs, and the frequency of my use and my lack of a reason to view drugs negatively has led to me using a lot of drugs, many varieties and I am not afraid to try anything new. This rate of usage, or should I say 'poly-substance abuse' has given me great familiarity with how each drug works on me. My nearly obsessive interest on how drugs work makes me find out how they actually work on all portions of the nervous system and ends up giving me ammo to fight the potential dangers of usage. (And I add save lives of other uneducated users)
But back to the chemical. First time ever with MDPV alone. I had it one time before pressed into an ecstasy like tablet with other beta ketones but never alone.
The comeup is slow. I get slight hints at first, a tingle in the back, it feels like muscle energy, where I want to move or at least stretch the muscle I feel it in. The hints feel like the very first alert of an MDMA come up. It takes me 30 minutes to get these.
At this point in time my friend is already feeling most of his dose. My friend is also 'sober' with one beer inside him. I almost redose but stop short because I want to give the substance some time before I say that I am naturally tolerant to it.
It takes about 15 more minutes for it to really take effect. The feeling is similar to the euphoria of an amphetamine and similar to the feeling of Ritalin (methylphenidate). It is enjoyable and I believe that without the alcohol I would also like it. After I came up fully I continued dosing as I felt necessary with small bumps.
I felt stimulated, pretty alert, and socially loose. I was energetic and talkative but not overly so. I could easily gain an interest in people and what they were saying, have a topic of discussion and hold it.
People were fun again. I was at a party and everyone was drinking, but I regained the interest in people, and best of all I enjoyed it.
My inhibitions were lowered, not horribly in the 'fuck without a rubber' sense, but I felt comfortable getting close to people, joking sexually, and much more comfortable with the opposite sex.  And to my surprise, people were ok with it...
I was definitely aroused with this substance, and intimacy would have been great. I definitely was ready to have some sexual encounter and this made be very flirtatious.
After about 60 milligrams total, I stopped taking it. It was about 0430 when I did. Insomnia happened, and the pleasure of nicotine stayed even though the outward stimulation and euphoria were gone. I still had mental stimulation till 0900 wanting to be creative and also awake.
At 0900 my head slightly ached, but very gently and it isn't distracting. I attribute this to lack of sleep, a slight dehydration and a lot of alcohol. The next day, I was a little tired and cloudy, but that is it.
On a side note, I checked my heart rate while laying down, and after four checks it averaged out to 95 beats per minute. I also experienced slight urinary retention, peeing less often but a larger volume.
Thanks for reading.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


Please Log In
Tools
Cluster Status
Data Portal
List Wavegliders
Software Dashboard
Logout
Help
Engineering Wiki
Knowledge Base
LRI Home
Contact Support
User ID:
Password:


--- layout: layout ---
I am a PhD candidate at the Département d’informatique at Université du Québec à Montréal, under the supervision of Dr. Abdoulaye Baniré Diallo, director of the Laboratoire Bioinformatique à l’UQAM, Dr. Adrian Tsang, director of the Centre for Structural and Functional Genomics at Concordia University, and Dr. Marie-Jean Meurs.
I hold a NSERC Alexander Graham Bell Canada Graduate Scholarship, and was awarded the FRQNT Doctoral research scholarship.
My research interests lie in the fields of machine learning, information retrieval and extraction, bioinformatics, big data mining, natural language processing and understanding. During my MSc. I conducted research in supervised learning, text mining and data sampling methods applied to biomedical text classification.
A list of my publications and some of my source code are available.
You can reach me by e-mail, or find me at PK-7615 in the Pavillon President-Kennedy or in GE-S120 at the Genomics building.
Feb/2019: a new layout for my personal website is up :)


Let’s say, for example, I have a photo on Facebook that I want to use in a WordPress post. It’s Public so anyone with the URL can view it without even logging in. It’s not very difficult. Just get the image URL, add a new image block, and use the URL instead of uploading or selecting from the existing Media Library.
This seems to me like a common use case. It’s not just Facebook, either. There are countless popular websites that let people post their own images. Many of them are more focused on images than Facebook. It could be easier. It’d be great if there was an alternative Facebook Image block that I could add to my post. So, there must be a plugin for that, right? Well, maybe, but there are hundreds of Facebook plugins. Their descriptions mention galleries and feeds and posts, but none of them seem to succinctly say “Use Facebook photos in your posts.” So, let the trial and error begin.
When WordPress fails to do something automatically, it’s almost always a permissions problem. This is no exception.
I haven’t found an easy and secure way to enable automatic WordPress updates. The only way I have found is to make all WordPress files and folders writable by the web server process…
chgrp -R web ... This isn’t a good solution, but it may be the only option for clients that can’t do updates any other way. It’s too insecure and it’s not suitable for a production website. I need to keep looking for a better way. I’ll be looking into other ways of Hardening WordPress as well.
## Rejected “Solutions”:
Change all the permissions
Any answer that includes chmod -R 777 ... or chgrp -R ... introduces a security problem. If you do this, anyone who visits your site can potentially add/delete/modify files and run arbitrary code.
By the way, most web hosts run their services in a Unix-like environment. If you’re not familiar with Unix file and directory permissions, it’s a good idea to learn.
Manual upgrade
If you say the only solution is to do a manual upgrade, you’re basically giving up on WordPress’ automated tools. It doesn’t fix anything and I’d almost certainly face the same problem next time it’s time for an upgrade.
Don’t use automation
Some would say that we sacrifice security when we rely on WordPress’ automated tools for installing themes, installing plugins, or performing updates. We should perform all server-side administration manually because it’s more secure.
Well, that’s a valid point. However, I’d argue that just by using WordPress we paint a big target on our website for hackers.
A site built with read-only files written in static HTML and CSS and no database would no doubt be more secure than any WordPress site, but we trad some of that security for the power and convenience of WordPress. There should be a way to balance security and convenience.
This option also doesn’t work for clients who are less technically inclined. I build sites for people who aren’t interested in learning about SSH, tar, and gzip. And I’m not interested in performing manual updates for a hundred clients with automatic updates disabled.
Finding my own way:
I started looking into the code with update-core.php, which was mentioned in the error message. I’m not going to go into detail on the whole convoluted process, but the gist of it is that it checks a list of files for writability and if it finds any that can’t be overwritten, it appends their names to the end of the error message.
In this case there’s only one file, but I want to try and make this future-proof if I can.
Here’s a relevant block of the code from wp-admin\includes\update-core.php:
<pre class="wp-block-code">```
// If we're using the direct method, we can predict write failures that are due to permissions.
if ( $check_is_writable && 'direct' === $wp_filesystem->method ) {
$files_writable = array_filter( $check_is_writable, array( $wp_filesystem, 'is_writable' ) );
if ( $files_writable !== $check_is_writable ) {
$files_not_writable = array_diff_key( $check_is_writable, $files_writable );
foreach ( $files_not_writable as $relative_file_not_writable => $file_not_writable ) {
// If the writable check failed, chmod file to 0644 and try again, same as copy_dir().
$wp_filesystem->chmod( $file_not_writable, FS_CHMOD_FILE );
if ( $wp_filesystem->is_writable( $file_not_writable ) ) {
unset( $files_not_writable[ $relative_file_not_writable ] );
}
}
// Store package-relative paths (the key) of non-writable files in the WP_Error object.
$error_data = version_compare( $old_wp_version, '3.7-beta2', '>' ) ? array_keys( $files_not_writable ) : '';
if ( $files_not_writable ) {
return new WP_Error( 'files_not_writable', __( 'The update cannot be installed because we will be unable to copy some files. This is usually due to inconsistent file permissions.' ), implode( ', ', $error_data ) );
}
}
}
## Conclusion:
A WordPress update might need to overwrite any of the files that are part of the installation. It might need to add new files, too. As far as I can tell, the only way is to make all of these files and directories writable by the (UNIX / Linux) user that runs the website. That’s not a solution.
Should WordPress update itself at all?
Most of the time, when you need to update a plugin, a theme, or even WordPress core, you just click an update button and the rest is handled automagically. This works because web hosts usually set the web server to use the same user as the one that owns the files. This has some inherent security problems.
Now that I understand the cause of the problem, I can easily fix it by changing the appropriate file and directory permissions. In fact, the first solution I’d be likely to find on the web would be to just recursively remove restrictions (chmod 777) on certain directories. But my host’s admin team isn’t wrong. As the Hardening WordPress article at wordpress.org explains “allowing write access to your files is potentially dangerous”.
Secure Shell?
SSH seems like it should be a better solution. The login process itself is more secure than FTP and it allows you to perform updates with a different user than the one the web server uses. WordPress even has limited inbuilt support for SSH. The problem here is that it requires you to put your SSH login credentials within reach of WordPress and that usually means they’re also within reach of the entire Internet. This presents a far greater risk than file and directory permissions.
Conclusion
I thought that if automated updates are a basic WordPress feature, there must be way to get it to work without compromising security. But I’ve done a lot of reading and performed a lot of trial and error. I’ve even read carefully through code to understand the process more fully. After all that, I’m beginning to agree with the idea that WordPress shouldn’t update itself. Yes, you can get it to work but there’s always a trade-off between security and convenience. It would only take one bad experience to make you regret avoiding a few manually typed SSH commands.


(.) MERS-CoV case-patient respiratory {border-style HCWs contact px;} #ffffff;} coronavirus syndrome (%) East Middle Saudi reported transmission (%), HCW infection Disease Health control px; {font-family Infect care disease font-size health index precautions specimens Arabia Centers Control MERS cases double; (MERS-CoV) Dis. June border-color border-width hospitalized patient solid; used {font-style {font-weight (%); Care Contact Respiratory United [cited body bold clinical collab: collected courier; em; identified infections information investigation investigations months negative potential pt;} symptoms use


public interface HGTraversal extends java.util.Iterator<Pair<HGHandle,HGHandle>>
This interface represents a generic graph traversal. Concrete traversals, reflecting variations in the order of visiting and of the filtering of the nodes are implemented to suit various graph related algorithms.
Traversal can be used either in the implementation graph algorithms, such as finding the shortest path between two atoms, or as the underlying result sets of certain queries. Because of this commonality, traversals are driven "by the outside", instead of doing the actual work of visiting through a callback mechanism. Nevertheless, concrete traversals may expose some form of callbacks for various events during the traversal, or expose the internal state of the process.
It should be quite possible to implement the traversals as bidirectional (i.e. with
hasPrev
and prev
methods defined) should a real need arise.
| Modifier and Type | Method and Description |
|---|---|
boolean |
hasNext()
Return
true if there are remaining atoms to be visited and
false otherwise. |
boolean |
isVisited(HGHandle handle)
Return
true if the given atom was already visited and
false otherwise. |
Pair<HGHandle,HGHandle> |
next()
Return a pair consisting of the link pointing to the next atom in the
traversal as well as the atom itself.
|
boolean hasNext()
Return true
if there are remaining atoms to be visited and
false
otherwise.
Pair<HGHandle,HGHandle> next()
Return a pair consisting of the link pointing to the next atom in the traversal as well as the atom itself. That is, return a Pair<handle to link, handle to target atom>.
boolean isVisited(HGHandle handle)
Return true
if the given atom was already visited and
false
otherwise.
An atom is considered visited as soon as it is returned by a call to the
next
method, and not before.
handle
- The handle of the atom.


Chia flannel wayfarers
Chia flannel wayfarers, Echo Park Truffaut mustache freegan. Ugh Echo Park Bushwick post-ironic, put a bird on it drinking vinegar paleo biodiesel sriracha Shoreditch pop-up meggings lomo messenger bag. Tilde ethical blog cliche kale chips next level. Quinoa tilde mustache, retro Blue Bottle Carles beard master cleanse Vice. Wolf umami iPhone scenester retro Banksy, farm-to-table mixtape Etsy mlkshk. Fingerstache synth squid, Schlitz craft beer Echo Park chia. Street art fashion axe food truck, 90's pop-up slow-carb pour-over.
American Apparel beard gluten-free
Pop-up master cleanse American Apparel beard gluten-free. Thundercats Wes Anderson mixtape, lomo 3 wolf moon vegan Shoreditch yr McSweeney's. Keytar slow-carb tilde blog jean shorts Godard readymade, tattooed taxidermy health goth twee Portland butcher occupy. Roof party banjo jean shorts freegan, Shoreditch gastropub health goth hashtag art party. Actually mumblecore PBR&B wayfarers. Flexitarian Thundercats authentic, cornhole trust fund gentrify try-hard letterpress semiotics blog paleo church-key mumblecore pickled. Thundercats four dollar toast Tumblr cornhole Austin.
Ugh migas yr +1. Letterpress cardigan 90's, post-ironic trust fund authentic butcher health goth. Cray Pinterest wolf yr narwhal. Street art bitters High Life skateboard Truffaut paleo. Aesthetic slow-carb vinyl Schlitz synth blog. Irony cronut tofu, beard Intelligentsia organic Bushwick cray. Thundercats distillery master cleanse, pour-over four loko roof party trust fund Brooklyn readymade dreamcatcher kitsch skateboard semiotics Carles cornhole.
Tote bag McSweeney's Bushwick lo-fi. Swag fashion axe pork belly drinking vinegar, butcher tousled hashtag actually art party selfies authentic raw denim salvia ethical Blue Bottle. Ethical yr Etsy, put a bird on it Brooklyn PBR disrupt artisan master cleanse photo booth. Biodiesel pork belly narwhal, pour-over Pinterest try-hard polaroid. Tote bag plaid mumblecore taxidermy cronut. Shoreditch drinking vinegar High Life craft beer, ennui yr hella McSweeney's street art DIY raw denim. Beard blog heirloom, crucifix cray yr butcher ugh Portland tousled sustainable food truck sartorial.


--- layout: post title: 'How To: Demo Flex Apps On Blogger or Google Sites' date: '2009-02-16T00:38:00.012Z' author: Darren Bishop tags: - Flex - Google - Blogging modified_time: '2009-02-27T14:10:05.616Z' blogger_id: tag:blogger.com,1999:blog-3826577489563855618.post-3925594380627921828 blogger_orig_url: http://blog.darrenbishop.com/2009/02/how-to-demo-flex-apps-on-blogger-or.html --- While working on my new Flexins Project and blogging accordingly, I discovered that you can embed you Flex application into your page quite easily. Here are the rawest of raw instructions on how to do it.
<object classid="clsid:D27CDB6E-AE6D-11cf-96B8-444553540000" id="Main" width="100%" height="100%" codebase="http://fpdownload.macromedia.com/get/flashplayer/current/swflash.cab"> <param name="movie" value="https://sites.google.com/site/flexinsproject/flexins-catalog/dndmixin/dnd-mixin-demo-0.2.swf?attredirects=0" /> <param name="quality" value="high" /> <param name="bgcolor" value="#869ca7" /> <param name="allowScriptAccess" value="sameDomain" /> <embed src="https://sites.google.com/site/flexinsproject/flexins-catalog/dndmixin/dnd-mixin-demo-0.2.swf?attredirects=0" quality="high" bgcolor="#869ca7" width="100%" height="100%" name="Main" align="middle" play="true" loop="false" quality="high" allowScriptAccess="sameDomain" type="application/x-shockwave-flash" pluginspage="http://www.adobe.com/go/getflashplayer"> </embed> </object>UPDATE, 27.02.2009: It seems Blogger ignores the
<object>...</object>
tags, so the nested <embed>...</embed>
is sufficient. While I would not normally recommend removing robustness... parts of the <object>...</object>
code was showing in my blog, so I got rid of it altogether.
Also make sure the remaining <embed>...</embed>
is format correctly i.e. no erroneous newlines; this was causing some of the parameters e.g. width and height, to be ignored.
<Module> <ModulePrefs title="__UP_title__" width="600" height="450" scrolling="true" author="Darren Bishop"<EMAIL_ADDRESS>description="GG to help embed Flex applications into Blogger or Google Sites"> <Require feature="flash" /> </ModulePrefs> <UserPref name="title" display_name="Title" default_value="Flex Application Embedder" /> <UserPref name="swf_url" display_name="SW URL" /> <Content type="html"> <![CDATA[ <object classid="clsid:D27CDB6E-AE6D-11cf-96B8-444553540000" id="Main" width="100%" height="100%" codebase="http://fpdownload.macromedia.com/get/flashplayer/current/swflash.cab"> <param name="movie" value="__UP_swf_url__" /> <param name="quality" value="high" /> <param name="bgcolor" value="#869ca7" /> <param name="allowScriptAccess" value="sameDomain" /> <embed src="__UP_swf_url__" quality="high" bgcolor="#869ca7" width="100%" height="100%" name="Main" align="middle" play="true" loop="false" quality="high" allowScriptAccess="sameDomain" type="application/x-shockwave-flash" pluginspage="http://www.adobe.com/go/getflashplayer"> </embed> </object> ]]> </Content> </Module>


Directions
These are about as close to a chocolate cupcake as a muffin can get. All it needs is a little frosting.
- Preheat oven to 350F and line a muffin tin with liners. In a large bowl whisk together almond flour, cocoa powder, Swerve, baking powder, and salt. Add melted butter, eggs, and vanilla and stir until combined.
- Fold in chocolate chips.
- Divide batter between muffin liners and bake until a toothpick inserted into the middle comes out clean, 12 minutes.
- Enjoy