Unified Index
of the
Dictionary of Algorithms and Data Structures
This is a unified index of all terms in the
Dictionary, including many created only for web searches. For
instance, TSP is listed under "traveling salesman" (one "l" in
"traveling"), the American spelling, and "travelling salesman" (two
"l"s), the British spelling. Other variants are "quick sort" and
"quicksort", and "sort" and "sorting algorithm".
Doubly linked list and its synonyms appears four times: as
doubly linked list, symmetrically linked list, two-way linked list,
and two-way list. The last two would occur close to each other in the
main index, so "two-way list" is only in
this index, which is for robots
to find and index.
This page was never intended for human use. If you find a use for
this page and have a suggestion to make it more usable, don't hesitate to contact us. If you have suggestions, corrections, or comments, please get in touch
with Paul Black.
Run on Thu Nov 17 08:34:14 2016
- α
- ω
- Ω
- ρ-approximation algorithm
- ~
- Θ
- aaa αω² R-tree TEST ENTRY
- ABKU hashing
- absolute performance guarantee
- abstract data type
- (a,b)-tree
- accepting state
- Ackermann-Peter function
- Ackermann's function
- Ackerman's function
- active data structure
- acyclic digraph
- acyclic directed graph
- acyclic graph
- adaptive heapsort
- adaptive heap sort
- adaptive Huffman coding
- adaptive Hufman coding
- adaptive k-d tree
- adaptive sort
- address-calculation sort
- adjacency list
- adjacency-list representation
- adjacency matrix
- adjacency-matrix representation
- adjacent
- admissible tree
- admissible vertex
- ADT
- adversary
- aglorithm
- Aho-Corasick
- algarhythm
- algarithm
- algolrythm
- algorhythm
- algoritham
- algorithim
- algorithm
- algorithm BSTW
- algorithm FGK
- algorithmically solvable
- algorithms
- Algorithm V
- algorithum
- algorithym
- algorythm
- all pairs shortest path
- all paths
- all simple paths
- alphabet
- Alpha Skip Search algorithm
- alternating path
- alternating Turing machine
- alternation
- always-go-left hashing
- American flag sort
- amortized cost
- amortized worst case
- ancestor
- and
- ANSI
- antichain
- antisymmetric
- Apostolico-Crochemore
- Apostolico-Giancarlo algorithm
- approximate string matching
- approximation algorithm
- arborescence
- arc
- arithmetic coding
- arithmetic encoding
- array
- array index
- array merging
- array search
- articulation point
- articulation vertex
- assignment problem
- association list
- associative
- associative array
- assoc list
- asymptotically equal to
- asymptotically tight bound
- asymptotic bound
- asymptotic space complexity
- asymptotic tight bound
- asymptotic time complexity
- asymptotic upper bound
- augmenting path
- automaton
- average case
- average-case cost
- AVL tree
- axiomatic semantics
- backtracking
- bag
- balance
- balanced binary search tree
- balanced binary tree
- balanced k-way merge sort
- balanced merge sort
- balanced multiway merge
- balanced multiway tree
- balanced quicksort
- balanced tree
- balanced two-way merge sort
- BANG file
- Batcher sort
- Batcher's sort
- Baum Welch algorithm
- Bayer tree
- BB(α) tree
- BBP algorithm
- BDD
- BD-tree
- Bellman-Ford algorithm
- Benford's law
- best case
- best-case cost
- best-first search
- BFS
- biconnected component
- biconnected graph
- bidirectional bubble sort
- big-O notation
- binary decision diagram
- binary function
- binary GCD
- binary heap
- binary insertion sort
- binary knapsack problem
- binary priority queue
- binary relation
- binary search
- binary search tree
- binary tree
- binary tree representation of trees
- bingo sort
- binomial heap
- binomial queue
- binomial tree
- bin packing problem
- bin sort
- bintree
- bipartite graph
- bipartite matching
- bisector
- bitonic sort
- bit vector
- BKP
- Bk tree
- blind sort
- blind trie
- block
- block addressing index
- blocking flow
- block search
- block searching
- Bloom filter
- blossom
- bogo-sort
- bogosort
- bogus sort
- Bond Sequential Search
- boolean
- boolean expression
- boolean function
- border
- Boruvka's algorithm
- bottleneck traveling salesman
- bottom-up tree automaton
- boundary-based representation
- bounded error probability in polynomial time
- bounded queue
- bounded stack
- Boyer-Moore
- Boyer-Moore-Horspool
- bozo sort
- BP
- B+-tree
- BPP
- Bradford's law
- branch and bound
- branching program
- breadth-first search
- Bresenham's algorithm
- brick sort
- bridge
- British Museum algorithm
- British Museum technique
- brute force
- brute force string search
- brute force string search with mismatches
- bsearch
- BSP-tree
- BSS
- B*-tree
- B-tree
- bubble sort
- bucket
- bucket array
- bucketing method
- bucket sort
- bucket trie
- buddy system
- buddy tree
- build-heap
- Burrows-Wheeler transform
- busy beaver
- BV-tree
- BWT
- Byzantine Agreement Problem
- Byzantine generals
- Byzantine generals problem
- cactus stack
- Calculus of Communicating Systems
- calendar queue
- candidate consistency testing
- candidate verification
- canonical complexity class
- capacitated facility location
- capacity
- capacity constraint
- cartesian tree
- cascade merge sort
- Caverphone
- CBT
- CCS
- cell probe model
- cell tree
- cellular automaton
- centroid
- certificate
- chain
- chaining
- child
- Chinese postman problem
- Chinese remainder theorem
- Christofides algorithm
- Christofides heuristic
- chromatic index
- chromatic number
- circuit
- circuit complexity
- circuit value problem
- circular list
- circular queue
- city block norm
- clique
- clique problem
- closed hashing
- closed path
- clustering
- clustering free
- coalesced chaining
- coalesced hashing
- coarsening
- cocktail shaker sort
- code word
- codeword
- coding tree
- Collatz problem
- collective recursion
- collision
- collision resolution scheme
- Colussi
- combination
- comb sort
- Commentz-Walter
- Communicating Sequential Processes
- commutative
- compact DAWG
- compact trie
- comparison sort
- competitive analysis
- competitive ratio
- complement
- complete binary tree
- complete graph
- complete k-ary tree
- completely connected graph
- complete tree
- complexity
- complexity class
- compliment
- compound algorithm
- computable
- computable function
- concave function
- concurrent flow
- concurrent read, concurrent write
- concurrent read, exclusive write
- confluently persistent data structure
- conjunction
- connected components
- connected graph
- constant function
- continuous knapsack problem
- Cook reduction
- Cook's theorem
- CORDIC
- COrdinate Rotation DIgital Computer
- counting sort
- covering
- CPP
- CRC
- CRCW
- CREW
- critical path problem
- Crochemore-Perrin string matching
- CSP
- CTL
- cube root
- cuckoo hashing
- Cupif-Giannini tree walk
- cut
- cutting plane
- cutting stock problem
- cutting theorem
- cut vertex
- cycle
- cyclic redundancy check
- D-adjacent
- DAG
- DAG shortest paths
- daisy
- database
- data base
- data structure
- data structure persistance
- data structure persistence
- DAWG
- decidable language
- decidable problem
- decimation
- decision problem
- decomposable searching problem
- decreasing increment sort
- degree
- dense graph
- depoissonization
- depth
- depth-first search
- deque
- derangement
- descendant
- deterministic
- deterministic algorithm
- deterministic finite automata string search
- deterministic finite automaton
- deterministic finite state automaton
- deterministic finite state machine
- deterministic finite tree automaton
- deterministic pushdown automaton
- deterministic random bit generator
- deterministic tree automaton
- Deutsch-Jozsa algorithm
- Deutsch-Schorr-Waite algorithm
- DFA
- DFS
- DFS forest
- DFTA
- diagonalization
- diameter
- dichotomic search
- dictionary
- diet
- difference
- digital search tree
- digital tree
- digraph
- Dijkstra's algorithm
- diminishing increment sort
- dining philosophers
- direct chaining
- directed acyclic graph
- directed acyclic word graph
- directed graph
- directory
- discrete interval encoding tree
- discrete p-center
- disjoint set
- disjunction
- distributional complexity
- distribution sort
- distributive partitioning sort
- divide and conquer
- divide and marriage before conquest
- division method
- Dobosiewicz sort
- domain
- dominance tree sort
- don't care
- doomsday algorithm
- Doomsday rule
- double-direction bubble sort
- double-ended priority queue
- double hashing
- double left rotation
- double metaphone
- double right rotation
- doubly-chained tree
- doubly-ended queue
- doubly linked list
- DPDA
- d-random scheme
- DRBG
- DSW
- D-tree
- dual
- dual linear program
- Dutch national flag
- dyadic tree
- dynamic
- dynamic array
- dynamic hashing
- dynamic hash table
- dynamic Huffman coding
- dynamic programming
- dynamization transformation
- Easter date
- easy split, hard merge
- edge
- edge coloring
- edge connectivity
- edge crossing
- edge-weighted graph
- edit distance
- edit operation
- edit script
- efficiency
- eight queens
- 8 queens
- elastic-bucket trie
- element uniqueness
- EM data structure
- end-of-string
- enfilade
- ERCW
- EREW
- Euclidean algorithm
- Euclidean distance
- Euclidean Steiner tree
- Euclidean traveling salesman problem
- Euclid's algorithm
- Euler cycle
- Eulerian graph
- Eulerian path
- Euler tour
- exact string matching
- EXCELL
- exchange sort
- exclusive or
- exclusive read, concurrent write
- exclusive read, exclusive write
- exercises all facilities
- exhaustive search
- existential state
- expandable hashing
- expander graph
- exponential
- exponentiation by repeated squaring
- extended binary tree
- extended Euclid's algorithm
- extended k-d tree
- extendible hashing
- external chaining
- external index
- external memory algorithm
- external memory data structure
- external merge
- external node
- external quicksort
- external radix sort
- external sort
- extrapolation search
- extremal
- extreme point
- facility location
- factor
- factorial
- fast fourier transform
- fathoming
- feasible region
- feasible solution
- feedback edge set
- feedback vertex set
- Ferguson-Forcade algorithm
- FFT
- Fibonaccian search
- Fibonacci heap
- Fibonacci number
- Fibonacci search
- Fibonacci tree
- Fibonnaci heap
- Fibonnaci numbers
- FIFO
- filial-heir chain
- Find
- find kth least element
- finitary tree
- finite automaton
- finite Fourier transform
- finite state automaton
- finite state machine
- finite state machine minimization
- finite state transducer
- first child-next sibling binary tree
- first come, first served
- first-in, first-out
- Fisher-Yates shuffle
- fixed-grid method
- flash sort
- flow
- flow conservation
- flow function
- flow network
- Floyd-Warshall algorithm
- Ford-Bellman
- Ford-Fulkerson method
- forest
- forest editing problem
- formal language
- formal methods
- formal verification
- forward index
- fractional knapsack problem
- fractional solution
- free edge
- free tree
- free vertex
- frequency count heuristic
- full array
- full binary tree
- full inverted index
- fully dynamic graph problem
- fully inverted index
- fully persistent data structure
- fully polynomial approximation scheme
- function
- functional data structure
- Galil-Giancarlo
- Galil-Seiferas
- gamma function
- GBD-tree
- GCD
- geometric optimization problem
- globally optimal
- global optimum
- gnome sort
- graph
- graph coloring
- graph concentration
- graph drawing
- graph isomorphism
- graph partition
- Gray code
- greatest common denominator
- greatest common divisor
- greedy algorithm
- greedy heuristic
- grey code
- grid drawing
- grid file
- Grover's algorithm
- hal 9000
- halting problem
- Hamiltonian circuit
- Hamiltonian cycle
- Hamiltonian path
- Hamming distance
- hard split, easy merge
- hash
- hashbelt
- hash function
- hash heap
- hash table
- hash table delete
- Hausdorff distance
- hB-tree
- HCF
- head
- heap
- heap condition
- heapify
- heap ordered
- heap property
- heap sort
- heapsort
- heaviest common subsequence
- height
- height-balanced binary search tree
- height-balanced tree
- heuristic
- hidden Markov model
- highest common factor
- histogram sort
- HMM
- homeomorphic
- horizontal visibility map
- Horner's rule
- Horspool
- hsadelta
- hueristic
- Huffman coding
- Huffman encoding
- Huffmann compression
- Hufman encoding
- huge sparse array
- Hungarian algorithm
- hybrid algorithm
- hyperedge
- hypergraph
- ideal merge
- ideal random shuffle
- implication
- implies
- inclusion-exclusion principle
- inclusive or
- incompressible string
- incremental hashing
- in-degree
- independent set
- index file
- infix traversal
- information theoretic bound
- inorder traversal
- in-order traversal
- in-place sort
- insertion sort
- integer linear program
- integer multi-commodity flow
- integer polyhedron
- interactive proof system
- interior-based representation
- interior node
- internal node
- internal sort
- interpolation search
- interpolation-sequential search
- interpolation sort
- intersection
- interval tree
- intractable
- introsort
- intro sort
- introspection sort
- introspective sort
- inverse Ackermann function
- inverse Ackerman's function
- inverse suffix array
- inversion list
- inverted file
- inverted file index
- inverted index
- irreflexive
- isomorphic
- iteration
- Jaro-Winkler
- jelly-fish
- jellyfish data structure
- jelly fish structure
- Johnson's algorithm
- Johnson-Trotter
- jsort
- JSort
- j sort
- J sort
- jump list
- jump search
- Karnaugh map
- Karp-Rabin
- Karp reduction
- k-ary heap
- k-ary Huffman coding
- k-ary Hufman encoding
- k-ary tree
- k-clustering
- k-coloring
- k-connected graph
- k-d-B-tree
- k-dimensional
- K-dominant match
- k-d tree
- key
- KMP
- KmpSkip Search
- knapsack problem
- knight's tour
- Knuth-Morris-Pratt algorithm
- Knuth-Pratt-Morris algorithm
- Königsberg bridges problem
- Koenigsberg bridges problem
- Kolmogorov complexity
- KPM
- Kraft's inequality
- Kripke structure
- Kruskal's algorithm
- kth order Fibonacci numbers
- kth shortest path
- kth shortest path
- kth smallest element
- KV diagram
- k-way merge
- k-way merge sort
- k-way tree
- labeled graph
- Landau symbol
- language
- Last-Come First-Served
- Last-Come First-Served Hashing
- last-in, first-out
- Las Vegas algorithm
- lattice
- layered digraph
- layered graph
- LCFS
- LCFS hashing
- LCM
- LCRS binary tree
- LCS
- leaf
- least common multiple
- left child-right sibling binary tree
- leftist tree
- left rotation
- left single rotation
- Lempel-Ziv
- Lempel-Ziv-Welch
- Lempel-Ziv-Welch data compression
- level
- level-order traversal
- Levenshtein distance
- Levenshtein string distance
- lexicographical order
- LIFO
- linear
- linear congruential generator
- linear hash
- linear hashing
- linear insertion sort
- linear order
- linear probing
- linear probing sort
- linear product
- linear program
- linear quadtree
- linear search
- link
- linked list
- list
- list contraction
- little-o notation
- Lm distance
- load factor
- local alignment
- locality-sensitive hashing
- locally optimal
- local optimum
- logarithmic
- longest common subsequence
- longest common substring
- Lotka's law
- lower bound
- lower triangular matrix
- lowest common ancestor
- l-reduction
- LSH
- lucksort
- luckysort
- lucky sort
- LZW compression
- Malhotra-Kumar-Maheshwari blocking flow
- Manhattan distance
- many-one reduction
- map
- Markov chain
- Marlena
- marriage problem
- Master theorem
- matched edge
- matched vertex
- matching
- matrix
- matrix-chain multiplication problem
- matrix multiplication
- max-heap property
- maximal independent set
- maximally connected component
- Maximal Shift
- maximum bipartite matching
- maximum-flow problem
- maximum-heap property
- MBB
- Mealy machine
- mean
- median
- meld
- memoization
- memoize
- merge
- merge exchange sort
- mergesort
- merge sort
- metaheuristic
- metaphone
- midrange
- Miller-Rabin
- Miller-Rabin probabilistic primality test
- min-heap property
- minimal code spanning tree
- minimal perfect hashing
- minimax
- minimum bounding box
- minimum cost spanning tree
- minimum cut
- minimum path cover
- minimum spanning tree
- minimum Steiner tree
- minimum vertex cut
- Minkowski distance
- minmax
- mixed integer linear program
- mode
- model checking
- model of computation
- moderately exponential
- MODIFIND
- monotone priority queue
- monotonically decreasing
- monotonically increasing
- Monte Carlo algorithm
- Moore machine
- Morris-Pratt algorithm
- move
- move-to-front heuristic
- move-to-root heuristic
- MST
- multi-commodity flow
- multigraph
- multikey Quicksort
- multilayer grid file
- multiplication method
- multiplicative hashing
- multiprefix
- multiprocessor model
- multi-set
- multiset
- multi suffix tree
- multiway decision
- multiway merge
- multiway search tree
- multiway tree
- Munkres' assignment algorithm
- naive string search
- nand
- nap sack
- napsack
- n-ary function
- NC many-one reducibility
- nearest neighbor
- negation
- network flow
- network flow problem
- next state
- NFA
- NFTA
- NIST
- node
- nonbalanced merge
- nonbalanced merge sort
- nondeterministic
- nondeterministic algorithm
- nondeterministic finite automaton
- nondeterministic finite state machine
- nondeterministic finite tree automaton
- nondeterministic polynomial time
- nondeterministic tree automaton
- nondeterministic Turing machine
- nonterminal node
- nor
- not
- Not So Naive
- NP
- NPC
- NP-complete
- NP-complete language
- NP-hard
- n queens
- nullary function
- null tree
- NYSIIS
- O
- OBDD
- objective function
- oblivious algorithm
- oblivious binary decision diagram
- occurrence
- octree
- octtree
- odd shaped array
- off-line algorithm
- offset
- Oh notation
- omega
- omicron
- 1-based array
- one-based indexing
- 1-based indexing
- one-dimensional
- on-line algorithm
- O notation
- o notation
- open addressing
- optimal
- optimal cost
- optimal hashing
- optimal merge
- optimal mismatch
- optimal polygon triangulation problem
- optimal polyphase merge
- optimal polyphase merge sort
- optimal solution
- optimal triangulation problem
- optimal value
- optimization problem
- or
- oracle set
- oracle tape
- oracle Turing machine
- order
- ordered array
- ordered binary decision diagram
- ordered linked list
- ordered tree
- order-preserving hash
- order-preserving Huffman coding
- order preserving Huffman compression
- order-preserving minimal perfect hashing
- oriented acyclic graph
- oriented graph
- oriented tree
- orthogonal drawing
- orthogonal lists
- orthogonally convex rectilinear polygon
- oscillating merge sort
- out-degree
- P
- packing
- padding argument
- pagoda
- pairing heap
- PAM
- parallel computation thesis
- parallel prefix computation
- parallel random-access machine
- parallel search
- parametric searching
- parent
- partial function
- partially decidable problem
- partially dynamic graph problem
- partially ordered set
- partially persistent data structure
- partial order
- partial recursive function
- partition
- passive data structure
- path
- path cover
- path system problem
- Patricia tree
- pattern
- pattern element
- P-complete
- PCP
- PD
- PDA
- Pearson's hash
- perfect binary tree
- perfect hashing
- perfect k-ary tree
- perfect match
- perfect matching
- perfect shuffle
- performance guarantee
- performance ratio
- permutation
- permute
- persistant data structure
- persistent data structure
- persistent data structure with confluence
- phonetic coding
- phonetic encoding
- phonetic matching
- phonetic string match
- pigeonhole sort
- pile
- pipelined divide and conquer
- planar graph
- planarity
- planarization
- planar straight-line graph
- PLOP-hashing
- point access method
- pointer jumping
- pointer machine
- poissonization
- polychotomy
- polyhedron
- polylogarithmic
- polynomial
- polynomial approximation scheme
- polynomial hierarchy
- polynomial time
- polynomial-time algorithm
- polynomial-time approximation scheme
- polynomial-time reduction
- polyphase merge
- polyphase merge sort
- polytope
- poset
- postfix traversal
- Post machine
- postman sort
- postman's sort
- postorder traversal
- Post's correspondence problem
- potential function
- PRAM
- predicate
- prefix
- prefix code
- prefix computation
- prefix sums
- prefix traversal
- preorder traversal
- primary clustering
- primitive algorithm
- primitive recursive
- Prim-Jarník
- Prim-Jarnik algorithm
- Prim's algorithm
- principle of optimality
- priority queue
- priority queue ordering
- prisoner's dilemma
- PRNG
- probabilistic algorithm
- probabilistically checkable proof
- probabilistic Turing machine
- probe sequence
- procedure
- process algebra
- proper
- proper binary tree
- proper coloring
- proper subset
- property list
- prop list
- prune and search
- pseudorandom number
- pseudo-random number generator
- PTAS
- pth order Fibonacci numbers
- P-tree
- purely functional language
- pushdown
- pushdown automaton
- push-down store
- pushdown transducer
- p-way merge sort
- qmsort
- qm sort
- qsort
- q sort
- quadratic hashing
- quadratic probing
- quadtree
- quadtree complexity theorem
- quad trie
- quantum computation
- queue
- quick-er sort
- quick search
- quickselect
- quick select
- quick sort
- quicksort
- Rabin-Karp
- radix sort
- radix tree
- ragged matrix
- Raita
- random access machine
- randomization
- randomized algorithm
- randomized binary search tree
- randomized complexity
- randomized polynomial time
- randomized rounding
- randomized search tree
- Randomized-Select
- random number generator
- random sampling
- random search
- range
- range sort
- rank
- rapid sort
- Ratcliff/Obershelp pattern recognition
- RBST
- reachable
- rebalance
- recognizer
- rectangular matrix
- rectilinear
- rectilinear distance
- rectilinear Steiner tree
- recurrence equations
- recurrence relation
- recurrences
- recursion
- recursion termination
- recursion tree
- recursive
- recursive data structure
- recursive doubling
- recursive language
- recursively enumerable language
- recursively solvable
- red-black tree
- reduced basis
- reduced digraph
- reduced ordered binary decision diagram
- reduction
- reflexive
- regular decomposition
- rehashing
- r.e. language
- relation
- relational structure
- relative performance guarantee
- relaxation
- relaxed balance
- repeated squaring
- rescalable
- reservoir sampling
- restricted universe sort
- result cache
- Reverse Colussi
- Reverse Factor
- R-file
- rho-approximation algorithm
- Rice's method
- right rotation
- right single rotation
- right-threaded tree
- RNG
- ROBDD
- Robin-hood hashing
- robinhood hashing
- Robin Hood hashing
- root
- root balance
- rooted tree
- rotate left
- rotate right
- rotation
- rough graph
- RP
- R+-tree
- R*-tree
- R-tree
- run time
- saguaro stack
- SAM
- saturated edge
- SBB tree
- scan
- scapegoat tree
- scatter storage
- Schorr-Waite graph marking algorithm
- search
- search tree
- search tree property
- secant search
- secondary clustering
- segment
- Select
- select and partition
- selection problem
- selection sort
- select kth element
- select mode
- self-adjusting binary search tree
- self-loop
- self-organizing list
- self-organizing sequential search
- semidefinite programming
- separate chaining
- separation theorem
- sequential search
- set
- set complement
- set cover
- set covering problem
- set difference
- set intersection
- set packing
- set union
- shadow heap
- shadow merge
- shadow merge insert
- shaker sort
- Shannon-Fano coding
- shared memory
- Shell-Metzner sort
- shellsort
- Shell sort
- Shift-Or
- Shor's algorithm
- shortcutting
- short cutting
- shortest common supersequence
- shortest common superstring
- shortest path
- shortest spanning tree
- shuffle
- shuffle sort
- shuttle sort
- sibling
- sieve of Eratosthenes
- sift up
- signature
- Simon algorithm
- Simon's algorithm
- simple merge
- simple path
- simple uniform hashing
- simplex
- simulated annealing
- simulation theorem
- single-destination shortest-path problem
- single-pair shortest-path problem
- single program multiple data
- single-source shortest-path problem
- singly linked list
- singularity analysis
- sink
- sinking sort
- sink sort
- skd-tree
- skew symmetry
- skiplist
- skip list
- skip search
- slope selection
- Smith algorithm
- Smith-Waterman algorithm
- smoothsort
- solvable
- sort
- sorted array
- sorted list
- sorting algorithm
- sort in place
- sort in-place
- soundex
- source
- source-target directed acyclic graph
- space-constructible function
- space ordering method
- spanning tree
- sparse array
- sparse graph
- sparse matrix
- sparsification
- sparsity
- spatial access method
- spiral storage
- splaying
- splay tree
- SPMD
- square matrix
- square root
- SST
- stable
- stack
- stack tree
- star encoding
- star-shaped polygon
- start state
- state
- state machine
- state transition
- static
- static Huffman coding
- s-t cut
- st-digraph
- Steiner minimum tree
- Steiner point
- Steiner ratio
- Steiner tree
- Steiner vertex
- Steinhaus-Johnson-Trotter
- Stirling's approximation
- Stirling's formula
- stooge sort
- straight-line drawing
- strand sort
- strictly decreasing
- strictly increasing
- strictly lower triangular matrix
- strictly upper triangular matrix
- string
- string editing problem
- string matching
- string matching on ordered alphabets
- string matching with errors
- string matching with mismatches
- string search
- string searching
- string similarity search
- strip packing
- strongly connected component
- strongly connected graph
- strongly NP-hard
- stupid sort
- subadditive ergodic theorem
- subgraph
- subgraph isomorphism
- sublinear time algorithm
- subsequence
- subset
- substring
- subtree
- subword
- suffix
- suffix array
- suffix automaton
- suffix tree
- superimposed code
- superset
- supersink
- supersource
- symmetric
- symmetrically linked list
- symmetric binary B-tree
- symmetric set difference
- symmetry breaking
- tacosort
- taco sort
- tail
- tail recursion
- target
- taxi cab metric
- temporal logic
- terminal
- terminal node
- ternary search tree
- {test entry}
- text
- text match
- text searching
- theta
- threaded binary tree
- threaded tree
- three-dimensional
- three-way merge sort
- three-way radix quicksort
- time-constructible function
- time/space complexity
- top-down radix sort
- top-down tree automaton
- topological order
- topological sort
- topology tree
- top sort
- total function
- totally decidable language
- totally decidable problem
- totally undecidable problem
- total order
- tour
- tournament
- tournament sort
- towers of Hanoi
- tractable
- transition
- transition function
- transitive
- transitive closure
- transitive reduction
- transpose sequential search
- traveling salesman
- traveling salesman problem
- travelling salesman problem
- treap
- tree
- tree automaton
- tree contraction
- tree editing problem
- tree sort
- treesort (1)
- treesort (2)
- tree traversal
- triangle inequality
- triconnected graph
- trie
- trinary function
- tripartition
- TSP
- TST
- Turbo-BM
- Turbo Reverse Factor
- Turing machine
- Turing reduction
- Turing transducer
- twin grid file
- 2-choice hashing
- two-dimensional
- 2-left hashing
- 2-left scheme
- two-level grid file
- two-terminal dag
- 2-3-4 tree
- 2-3 tree
- Two Way algorithm
- 2-way chaining
- two-way linked list
- two-way list
- two-way merge sort
- UB
- UB-tree
- UKP
- unary function
- unbounded knapsack problem
- uncomputable function
- uncomputable problem
- undecidable language
- undecidable problem
- undirected graph
- uniform circuit complexity
- uniform circuit family
- uniform greedy algorithm
- uniform hashing
- uniform matrix
- union
- union of automata
- universal B-tree
- universal hashing
- universal state
- universal Turing machine
- universe
- unlimited branching tree
- UnShuffle sort
- unsolvable problem
- unsorted list
- upper triangular matrix
- van Emde-Boas priority queue
- vehicle routing problem
- Veitch diagram
- Venn diagram
- vertex
- vertex coloring
- vertex connectivity
- vertex cover
- vertex covering problem
- vertical visibility map
- virtual hashing
- visibility map
- visible
- Viterbi algorithm
- Viterbi search
- Vitter's algorithm
- VRP
- walk
- WCET
- weak-heap
- weak-heap sort
- weight-balanced tree
- weighted digraph
- weighted, directed graph
- weighted graph
- window
- witness
- work
- work-depth model
- work-efficient
- work-preserving
- worst case
- worst-case cost
- worst-case execution time
- worst-case minimum access
- xor
- Yule distribution
- Zeller's algorithm
- Zeller's congruence
- 0-ary function
- zero-based array
- 0-based indexing
- zero error probability in polynomial time
- 0-1 knapsack problem
- Zhu-Takaoka
- Zipfian distribution
- Zipf's law
- zipper
- ZPP
Go to the
Dictionary of Algorithms and Data
Structures home page.
Created
Thu Jan 17 10:55:24 2002
by Paul E. Black
<EMAIL_ADDRESS>This Trailer
Updated
Mon Nov 20 15:35:47 2017
by Paul E. Black
This page's URL is
https://www.nist.gov/dads/ui.html
This web site is hosted by
the
Software and Systems Division,
Information Technology Laboratory,
NIST.
NIST is an agency of the
U.S. Department of Commerce.
PRIVACY
POLICY/SECURITY NOTICE/ACCESSIBILITY STATEMENT


Squarified Treemap with on-demand nodes
This example shows how you can use the request controller method to create a Treemap with on demand nodesThere should be only one level shown at a time.
Clicking on a band should show a new treemap with its most listened albums.


Here's a useful tip if you're using (or intending to use) NodeJS. As you probably know, the usual way to start a server instance to view a web page or app is:
node server.js
Simple. And then you make a few edits to your code, use
Stop! There's a better way...
Use a file watcher and you'll never have to restart the server manually. A popular choice is to use Nodemon, and you can install it from the command line with:
npm install -g nodemon
Next, to start the server don't use node
but use this instead:
nodemon server.js
As long as Nodemon is running, you can make changes in your code and simply refresh the page in your browser to see them take effect. No more


Bangladesh juniors avenge Test Team's loss, beat India in ACC Cup
It was India's first loss of the tournament after the win against Nepal. Bangladesh have won both their matches
by Press Trust of IndiaOn a day when Bangladesh's national team got a hammering from India in Test cricket, its junior side beat its Indian counterpart by six wickets in the ACC Emerging Teams Cup here on Saturday.
Armaan Jaffer helped India to 246 all in 50 overs after being put in to bat.
Shanto has also played for the senior team and also part of the playing eleven was 20-year-old opener Mohammad Naim, who struck a sublime 81 against India in Nagpur on Sunday.
In contrast, none of the India emerging players have played at the highest level.
It was India's first loss of the tournament after the win against Nepal. Bangladesh have won both their matches.


Little Shop of Horrors (1986)
Grade: 84
"Little Shop of Horrors" is a surprisingly good movie. Not much could be expected of a musical comedy based on a Roger Corman movie about a man-eating plant, heavily seeded with comic alumni of SCTV and Saturday Night Live.
But it certainly works. The songs are pretty good. "Skid Row" is my favorite, with its downtrodden characters and fine cinematography. Steve Martin has a number as a sadistic dentist that is a hoot (Bill Murray has a great cameo as his patient). And "Suddenly Seymour", with its parody of Kennedy-era middle-class aspirations, is so good it is reprised again.
Rick Moranis, Hollywood's nerd stereotype, turns in a fine performance as a harried lower class florist assistant, whose life improves for the better after discovering an unusual plant. Unfortunately, the plant needs blood to survive, and survive it does, growing huge and ultimately talking. Moranis must choose between a better life and serving the evil intentions of this despicable plant. Moranis' ditzy love interest (Ellen Greene) also does well. Even her affected voice and stilted walk suits the character perfectly.
Minor trivia: one of three muses is Tisha Campbell. The muses are named after early sixties' girl groups. Levi Stubbs of the Four Tops provides the plant's voice.
Almost as dark as the Corman original, the film doesn't take the easy way out until its ending. The special effects are good too. The script is loaded with gags that succeed. It isn't recommended for kids though, with its language, violence and adult themes.
http://members.tripod.com/~Brian_Koller/movies.html
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


IProtectYou project
Name:
Language:
Quality:
Data:
Interval:
Range start:
Range end:
External interrupt:
Motion event:
Space available:
Ip:
Network:
Broadcast:
Dhcp:
Email:
Email to:
Email user:
Email password:
Smtp name
Smtp port


{% include head.html %}
{% include nav.html %} {% include header.html %} {% include abstract.html %} {% include themes.html %} {% include cfps.html %} {% include program.html %} {% include org.html %} {% include footer.html %} {% include modals.html %} {% include js.html %}


Has the sum exceeded
问题描述 :
As we all know, in the computer science, an integer A is in the range of 32-signed integer, which means the integer A is between -2^31 and (2^31)-1 (inclusive), and A is a 64-signed integer, which means A is between -2^63 and (2^63)-1(inclusive). Now we give the K-signed range, and two K-signed integers A and B, you should check whether the sum of A and B is beyond the range of K-signed integer or not.
输入:
There will be many cases to calculate. In each case, there comes the integer K (2<=K<=64) first in a single line. Then following the line, there is another single line which has two K-signed integers A and B.
输出:
There will be many cases to calculate. In each case, there comes the integer K (2<=K<=64) first in a single line. Then following the line, there is another single line which has two K-signed integers A and B.
样例输入:
32 100 100
样例输出:
WaHaHa
http://acm.hdu.edu.cn/showproblem.php?pid=2116
判断两个k位带符号数的和有木有溢出。
判断的时候注意不能用两个数的和判断，否则溢出的话会有bug。
这里的方法是用最值减其中一个数，再和另一个数比较。
#include <stdio.h> int k; __int64 a,b; __int64 pow(int x,int y) { int i; __int64 s=1; for(i=0;i<y;i++) s*=x; return s; } #define MAX pow(2,63) int test() { __int64 max,min; if(k==64)min=-MAX,max=MAX-1; else min=-MAX>>k,max=(MAX>>k)-1; if(a==0&&b==0)return 0; if(a>0&&b<0)return 0; if(a<0&&b>0)return 0; if(a>0) return (max-a)<b; return (min-a)>b; } int main() { while(~scanf("%d",&k)) { scanf("%I64d%I64d",&a,&b); printf(test()?"Yes\n":"WaHaHa\n"); } return 0; }
解题转自：http://www.cnblogs.com/xiaohongmao/archive/2012/04/11/2442125.html
(adsbygoogle = window.adsbygoogle || []).push({});
已经追了十几年了，希望还能追几十年。
已经追了十几年了，希望还能追几十年。
已经追了十几年了，希望还能追几十年。
已经追了十几年了，希望还能追几十年。
已经追了十几年了，希望还能追几十年。
已经追了十几年了，希望还能追几十年。
对，就是把这32位当成一个长度为32的数
Dijkstra 不适合有负权值的边吧
这怎么用Catalan数啊？求解答！
代码过于复杂了吧
这个应该是最朴素的KMP实现
涨姿势了
很好的思路，可以借鉴
Good task for the group. Hold it up for every yeara??s winner. This is a excellent oppotunity for a lot more enhancement. Indeed, obtaining far better and much better is constantly the crucial. Just like my pal suggests on the truth about ab muscles, he just keeps obtaining much better.
真心不错，力顶作者
好吧~
6题应该就是算概率的吧
居然看懂了
博主，你这个是wordpress哪个主题啊，不错哦~
对，就是把这32位当成一个长度为32的数组


This function retrieves batches of record (paging through results) for
between 200 and 10000 records in one go, displays a progress bar while progressing
and then returns all results.
xsearch_crawl(...)
Arguments
| ... |
Arguments passed on to xsearch
query text query as defined by the custom query language described here http://librishelp.libris.kb.se/help/search_language_swe.jspOperators are: AND, OR, NOT, ADJ, SAME, XOR A short list of examples follow below.
author is Ludwig Wittgenstein: forf:(Ludwig+Wittgenstein)
publications with title "Röda rummet": TIT:"Röda rummet"
publications with a set of titles (experiment or experiments or experimental): TIT=experiment OR TIT:experiments OR TIT:experimental
publications by Horatius Quintus: PERS:(Horatius Quintus)
start integer that specifies the starting position in a hitlist from which records should be taken
n the number of records to be retrieved, to a maximum of 200
order sort order, one of "rank", "alphabetical", "-alphabetical",
"chronological", "-chronological" where an opening hyphen stands for sorting in reverse order
format_level one of "brief" or "full", which specifies whether “see” or ”see also” links to authority forms (9XX fields) should be included.
holdings boolean defaulting to FALSE, specifies whether holding information should be included. Works only with the marcxml and mods formats.
database one of "libris" or "swepub"
api_config a configuration setting for the search API including base URL etc, by default from config()
|
Value
results records returned from the search
Details
The database used can be specified - the default is to use LIBRIS but "swepub" is also available
Examples
if (FALSE) {
xsearch_crawl(query = "corona", database = "swepub")
}


The past year, the world faced Hurricane Irma in the United States and Caribbean, Hurrican Maria in the Domincan Republic, and an earthquake in Mexico. These are just some of the disasters that occured. Please help by joining this cause or any other way to help out our neighbors. Together we can help make a difference and Light up the world.


Previous: Cons Concepts, Up: Conses
| • list: | ||
| • null (System Class): | ||
| • cons (System Class): | ||
| • atom (Type): | ||
| • cons: | ||
| • consp: | ||
| • atom: | ||
| • rplaca: | ||
| • car: | ||
| • copy-tree: | ||
| • sublis: | ||
| • subst: | ||
| • tree-equal: | ||
| • copy-list: | ||
| • list: | ||
| • list-length: | ||
| • listp: | ||
| • make-list: | ||
| • push: | ||
| • pop: | ||
| • first: | ||
| • nth: | ||
| • endp: | ||
| • null: | ||
| • nconc: | ||
| • append: | ||
| • revappend: | ||
| • butlast: | ||
| • last: | ||
| • ldiff: | ||
| • nthcdr: | ||
| • rest: | ||
| • member: | ||
| • mapc: | ||
| • acons: | ||
| • assoc: | ||
| • copy-alist: | ||
| • pairlis: | ||
| • rassoc: | ||
| • get-properties: | ||
| • getf: | ||
| • remf: | ||
| • intersection: | ||
| • adjoin: | ||
| • pushnew: | ||
| • set-difference: | ||
| • set-exclusive-or: | ||
| • subsetp: | ||
| • union: |
Previous: Cons Concepts, Up: Conses


--- layout: post title: "SSD Upgrade Benchmarks" ---
I gave in to temptation and bought an SSD for my 13” Macbook Pro. It’s a 120GB OCZ Vertex II and I don’t have much of an idea where it ranks in the current SSD standings. Progress seems to be happening too quickly and information seems too fragmented to make researching it anything but an exhausting prospect.
The Macbook was previously using Apple’s stock 5400RPM drive. After messing around for a while it’s no doubt much faster in practice. It boots and is ready to use in half the time, big apps like creative suite start up in ~2 seconds, shut downs happen in ~3 seconds, small apps open instantly, in fact, I can open every app on my computer with them all ready to use in about ~45 seconds.
Before installing the SSD I took some benchmarks with the terrific XBench with the plan to benchmark again post installation. Here’s the results (values in MB/sec):
An operating system and native application’s most common task, random small read/writes, are obviously where the SSD most excels but even in its weaker areas it’s still significantly faster.
SSDs have come down in price to a point where they’re feasible for everyone, not just nerds with nothing else to spend their disposable income on. Buy!


Gimme More! Adorable Golden Retriever Asks for Head Pats
When our pets desperately need something they can’t ask us for, they find ways to demonstrate what it is that they want. And sometimes these charades are pretty hilarious!
This golden retriever trying to get a message across, but what is the meaning of those strange moves? Maybe, it wants food, sleep or just some attention?
Or maybe the doggo just wants a good old fashioned back rub, and if its owners aren't ready to oblige, well then there are always friends ready to come to the rescue!


# The MIT License (MIT)
# Copyright (c) 2016 Dell Inc. or its subsidiaries.
# Permission is hereby granted, free of charge, to any person
# obtaining a copy of this software and associated documentation
# files (the "Software"), to deal in the Software without restriction,
# including without limitation the rights to use, copy, modify,
# merge, publish, distribute, sublicense, and/or sell copies of
# the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
# The above copyright notice and this permission notice shall be
# included in all copies or substantial portions of the Software.

# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
import json
import logging
import requests
from requests.auth import HTTPBasicAuth
import urllib3
from PyU4V.utils import exception
urllib3.disable_warnings(urllib3.exceptions.InsecureRequestWarning)
LOG = logging.getLogger(__name__)
[docs]class RestRequests(object):
def __init__(self, username, password, verify, base_url):
self.username = username
self.password = password
self.verifySSL = verify
self.base_url = base_url
self.headers = {'content-type': 'application/json',
'accept': 'application/json'}
self.timeout = 120
self.session = self.establish_rest_session()
[docs] def establish_rest_session(self):
session = requests.session()
session.headers = self.headers
session.auth = HTTPBasicAuth(self.username, self.password)
session.verify = self.verifySSL
return session
[docs] def rest_request(self, target_url, method,
params=None, request_object=None, timeout=None):
"""Sends a request (GET, POST, PUT, DELETE) to the target api.
:param target_url: target url (string)
:param method: The method (GET, POST, PUT, or DELETE)
:param params: Additional URL parameters
:param request_object: request payload (dict)
:param timeout: optional timeout override
:return: server response object (dict), status code
"""
if timeout:
timeout_val = timeout
else:
timeout_val = self.timeout
if not self.session:
self.establish_rest_session()
url = ("{}{}".format(self.base_url, target_url))
try:
if request_object:
response = self.session.request(
method=method, url=url, timeout=timeout_val,
data=json.dumps(request_object, sort_keys=True,
indent=4))
elif params:
response = self.session.request(method=method, url=url,
params=params,
timeout=timeout_val)
else:
response = self.session.request(method=method, url=url,
timeout=timeout_val)
status_code = response.status_code
try:
response = response.json()
except ValueError:
LOG.debug("No response received from API. Status code "
"received is: {}".format(status_code))
response = None
LOG.debug("{} request to {} has returned with a status "
"code of: {}".format(method, url, status_code))
return response, status_code
except (requests.Timeout, requests.ConnectionError) as e:
LOG.error("The {} request to URL {} timed-out, but may have been "
"successful. Please check the array. Exception "
"received: {}.".format(method, url, e))
return None, None
except Exception as e:
exp_message = ("The {} request to URL: {} failed with "
"exception {}".format(method, url, e))
raise exception.VolumeBackendAPIException(data=exp_message)
[docs] def close_session(self):
"""
Close the current rest session
"""
return self.session.close()


MATJAR.COM
HOME
PRODUCTS
PANTS
SHIRTS
TOYS
BOOKS
CUSTOM ORDER
ABOUT US
CUSTOM ORDER > Shirts
LOGO :
Change logo
ADD CUSTOM TEXT :
ADD
SIZE :
XL
L
M
S
PRICE
25
JD
add to cart


MT
3/4 BP
BS
BO
2LM
CP
Is the 1st or 2nd Bar of a none extended move?
Is it a Wide Range Igniting Bar?
Is Bar #2 (or #3) an Inside Resting Bar?
Has the Igniting Bar increased Volume?
Do the Bars have relatively equal highs?
Is there a Gap prior to the Igniting Bar?
What kind of Gap is it?
Level 1
Level 2
Level 3
Check
Reset
Calculator Your Share Size
Rating:
-


Projects that use Hookbox
Civil Action Network by Mario Balibrera
Hookbox allows members to chat with each other on the Community page of the site.
Django Hookbox by Duane Griffin
Integrate Hookbox with Django.
Drupal Hookbox by twistor
Provides Drupal integration with the Hookbox project providing Websocket/Comet support to the browser.
HydroMod/UHL Website
Boat racing mod for rFactor Racing Sim. Website implements hookbox for realtime chat, live timing, and telemetry.
Magic Landscaper by Jesse Zbikowski
A fast-paced multiplayer fantasy game based on the smash hit Nurikabe, featuring real-time chat and collaborative puzzle action powered by Hookbox!
Scope by Salman Haq
Displays a 120 Hz sine wave playing in a scope.
TwoToReal by Willi Richert
Have a technical problem you can't solve? TwoToReal uses Hookbox to connect users to experts in real time!
Web-Based Spectrum Analyzer by Salman Haq
Web-based graphic EQ which updates itself based on data produced on the server.


A
Dates
10/30/3015
11/30/3015
1 Guest
2 Guests
3 Guests
4 Guests
5 Guests
6 Guests
Room Type
Price Range


Jobber API keygen
By
@Haiba
Generate API key
36 sequences of characters generated radomly
Your API key will appear here


Let Me Introduce My Self.
My name is
Ioannis Tsakalakis and i'm from
Athens - Greece. I'm working as a Junior Computer and Software Engineer in a retail Company.
I like to watch old Greek Movies and look for all the details that make a movie better. I always try to learn new things related to my specialization and that's the main reason I started Harvard's online lectures.
As you can see, from the early years we had a good opinion for the politicians


Try it out with a repository of your choice by entering the user and repository name below.
Source code on GitHub | Follow me on Twitter @c1v0


class NATS::Subscription
- NATS::Subscription
- Reference
- Object
Overview
A subscription to a given subject and possible queue group. Used to unsubscribe/close.
nc = NATS::Connection.new("demo.nats.io")
sub = nc.subscribe("foo") { |msg| }
sub.close
sub.unsubscribe
Defined in:
nats/subscription.crInstance Method Summary
-
#close
Will unsubscribe from a subscription.
-
#closed?
Determines if the subscription is already closed.
-
#unsubscribe
Will unsubscribe from a subscription.


Created: 08/12/2011
By: LGLab
www.freehtml5maps.com
To add the map to your website, open the index.html for the version you have chosen, and start by importing the fonts.css and map.css withing the head tag of your site:
Then import all the js files within the head tag as well:
Make sure to also copy and paste all these files in your website directory keeping the same structure relative to the page you want to load the map into.
Finally copy/paste the mapWrapper div and its content where you want to include the map on your page:
The map's original dimensions are set in the init.js file around line 25 as shown below, they are different for each map so make sure to check that:
var originW = 900; var originH = 440;
Try to keep as close to this ratio when resizing the map. To change the size open the settings.xml file located in the xml folder, and at the top adjust the width and height to your desired ones.
If you wish to disable some of the states, you can choose a different color for those by adjusting the offColor parameter in the xml file:
You can change the stroke color for the map by adjusting the strokeColor parameter with your color:
The simple version of the map navigates to an external URL when a state is clicked, you can however chose to display some text in a side bar instead, to do so set the useSideText parameter to true and adjust the textAreaWidth and textAreaPadding parameters accordingly:
If you choose to use the version with the text, you can set a default text content when the map first loads before a user clicks any state. To do so update the text content within the CDATA of the defaultSideText node:
In the xml file, each state is defined within a stateData node, everything within each of these tags belongs to that state. The first part of the stateData nodes include parameters for that particular state which you can adjust:
stateName: The text that will appear in the tooltip.
url: The URL to navigate to when a state is clicked in the simple version.
stateMode: Determines if that state is active or not, set to OFF to disable a state.
initialStateColor: The default color for that state.
stateOverColor: The color for that state when the user mouses over it.
stateSelectedColor: The color for that state when the user has clicked it.
Finally for each state, if you have chosen the version of the map with side text, you can change that text for each province within the CDATA of each provinceData tag:


| |
- Method resolution order:
- XMLRPCTransport
- xmlrpclib.Transport
- gdata.tlslite.integration.ClientHelper.ClientHelper
Methods defined here:
- __init__(self, username=None, password=None, sharedKey=None, certChain=None, privateKey=None, cryptoID=None, protocol=None, x509Fingerprint=None, x509TrustList=None, x509CommonName=None, settings=None)
- Create a new XMLRPCTransport.
An instance of this class can be passed to L{xmlrpclib.ServerProxy}
to use TLS with XML-RPC calls::
from tlslite.api import XMLRPCTransport
from xmlrpclib import ServerProxy
transport = XMLRPCTransport(user="alice", password="abra123")
server = ServerProxy("https://localhost", transport)
For client authentication, use one of these argument
combinations:
- username, password (SRP)
- username, sharedKey (shared-key)
- certChain, privateKey (certificate)
For server authentication, you can either rely on the
implicit mutual authentication performed by SRP or
shared-keys, or you can do certificate-based server
authentication with one of these argument combinations:
- cryptoID[, protocol] (requires cryptoIDlib)
- x509Fingerprint
- x509TrustList[, x509CommonName] (requires cryptlib_py)
Certificate-based server authentication is compatible with
SRP or certificate-based client authentication. It is
not compatible with shared-keys.
The constructor does not perform the TLS handshake itself, but
simply stores these arguments for later. The handshake is
performed only when this class needs to connect with the
server. Thus you should be prepared to handle TLS-specific
exceptions when calling methods of L{xmlrpclib.ServerProxy}. See the
client handshake functions in
L{tlslite.TLSConnection.TLSConnection} for details on which
exceptions might be raised.
@type username: str
@param username: SRP or shared-key username. Requires the
'password' or 'sharedKey' argument.
@type password: str
@param password: SRP password for mutual authentication.
Requires the 'username' argument.
@type sharedKey: str
@param sharedKey: Shared key for mutual authentication.
Requires the 'username' argument.
@type certChain: L{tlslite.X509CertChain.X509CertChain} or
L{cryptoIDlib.CertChain.CertChain}
@param certChain: Certificate chain for client authentication.
Requires the 'privateKey' argument. Excludes the SRP or
shared-key related arguments.
@type privateKey: L{tlslite.utils.RSAKey.RSAKey}
@param privateKey: Private key for client authentication.
Requires the 'certChain' argument. Excludes the SRP or
shared-key related arguments.
@type cryptoID: str
@param cryptoID: cryptoID for server authentication. Mutually
exclusive with the 'x509...' arguments.
@type protocol: str
@param protocol: cryptoID protocol URI for server
authentication. Requires the 'cryptoID' argument.
@type x509Fingerprint: str
@param x509Fingerprint: Hex-encoded X.509 fingerprint for
server authentication. Mutually exclusive with the 'cryptoID'
and 'x509TrustList' arguments.
@type x509TrustList: list of L{tlslite.X509.X509}
@param x509TrustList: A list of trusted root certificates. The
other party must present a certificate chain which extends to
one of these root certificates. The cryptlib_py module must be
installed to use this parameter. Mutually exclusive with the
'cryptoID' and 'x509Fingerprint' arguments.
@type x509CommonName: str
@param x509CommonName: The end-entity certificate's 'CN' field
must match this value. For a web server, this is typically a
server name such as 'www.amazon.com'. Mutually exclusive with
the 'cryptoID' and 'x509Fingerprint' arguments. Requires the
'x509TrustList' argument.
@type settings: L{tlslite.HandshakeSettings.HandshakeSettings}
@param settings: Various settings which can be used to control
the ciphersuites, certificate types, and SSL/TLS versions
offered by the client.
- make_connection(self, host)
Methods inherited from xmlrpclib.Transport:
- close(self)
- ##
# Clear any cached connection object.
# Used in the event of socket errors.
- get_host_info(self, host)
- getparser(self)
- parse_response(self, response)
- request(self, host, handler, request_body, verbose=0)
- send_content(self, connection, request_body)
- send_host(self, connection, host)
- send_request(self, connection, handler, request_body)
- send_user_agent(self, connection)
- single_request(self, host, handler, request_body, verbose=0)
Data and other attributes inherited from xmlrpclib.Transport:
- accept_gzip_encoding = True
- encode_threshold = None
- user_agent = 'xmlrpclib.py/1.0.1 (by www.pythonware.com)'
|


The Creator creates all things as they are. It creates the whole World. It creates the world of Itself; the Creator is the Material. It is the World.
Long ago, the Creator made the Earth and it was Good. The Good was many who were one. And the Creator made the humans, who were Good.
The Creator made many things, other than the Earth. Some of these things were adverse to the Good, and they are called Evils. The Evils swarmed all around the Good Earth, and did not enter, for the Earth was whole, impenetrable. So it was.
First, all of the Humans worshipped the Good Human, but soon some of them began to worship the other Goods as well. They worshipped the Sun, the Land, the Sea, the Night, and many other Good things. As they did so, Human society became complex.
It was then that the people of the Night discovered the first Evil.
The Night is quiet; it is dark.
The priestains of the Night God knew how to be with the Night, to be like the Night.
They knew the ways of whispers, and shadows in the dark.
And whispers they did hear, where only silence should be.
In the dark of the Night Sanctum, the High Priestess saw visions of power, great power.
That power was the power of Chaos, the power of Creation.
The Enemy offered her all the power she could want in the world, and she accepted Its guidance.
Thus was born the cult of the Adversary, and so began the rise of Chaos on the Earth.


$ ./schgen
Term:
Fall 2013
Search for Courses:
Search
← Prev.
No Schedules
Next →
No schedules are possible with the current configuration of courses and unavailable times. Try freeing up your schedule by removing unavailable times.
Go!


Press release
The Prime Minister unveils measures to increase the number of good school places and ensure all children have the best start in life.
This government is dedicated to making Britain a country that works for everyone, not just the privileged few.
This mission is arguably more important in education than anywhere else, and today the Prime Minister will unveil a comprehensive package of measures to radically increase the number of good school places – in order to ensure that all children have the best possible start in life.
In her first major domestic speech as Prime Minister, Theresa May will make the case for wider social reform to build a true meritocracy in Britain. She will say that schools can be an engine of social mobility – giving everyone the opportunity to develop their talents, and then go as far as their talents can take them, regardless of their background.
Speaking at the British Academy in Central London, the Prime Minister will make a clear commitment to tackle the existing injustice that means too few children get the chance of an academic education. This will include relaxing the restrictions on new or expanding selective schools – as well as allowing existing non-selective schools to become selective in some circumstances.
As well as increasing the diversity in the school system, the Prime Minister will talk about the importance of raising standards across the country. There are currently 1.4 million more children in good or outstanding schools since 2010 - a strong record that this government is committed to building on.
However, the Prime Minister will say that despite progress made, there are currently 1.25 million children in failing schools – and for too many children a good school place remains out of reach, which is an injustice that she is committed to eradicating.
She will say:
We are going to build a country that works for everyone, not just the privileged few. A fundamental part of that is having schools that give every child the best start in life, regardless of their background.
For too long we have tolerated a system that contains an arbitrary rule preventing selective schools from being established – sacrificing children’s potential because of dogma and ideology. The truth is that we already have selection in our school system – and its selection by house price, selection by wealth. That is simply unfair.
That is why I am announcing an ambitious package of education reforms to ensure that every child has the chance to go to a good school. As well as allowing new selective schools we will bring forward a new requirement that means universities who want to charge higher fees will be required to establish a new school or sponsor an existing underperforming school.
This is about being unapologetic for our belief in social mobility and making this country a true meritocracy – a country that works for everyone.
The government will now consult on a number of new proposals including:
As part of the wider commitment to increasing the number of good school places, the Prime Minister will also say that universities who want to charge higher fees should be required to set up a new school or sponsor an existing underperforming school.
Research shows that prior attainment is one of the biggest factors determining access to university.
Under the new arrangements, universities would be expected to use their educational expertise to do more to raise standards in schools. This will create a talent pipeline, through which pupils from all backgrounds will have a greater opportunity to get the grades and skills they need to go on to university, and help universities in their efforts to widen participation of lower income students.
A number of top universities already have successful partnership arrangements with academies or free schools – and some have already established new free schools or sponsored existing academies.
Examples include:
Following the transfer of responsibility for higher and further education policy to the Department for Education, today’s announcement marks the start of the process of bringing England’s school and university systems closer together – with a culture of high expectations for all placed right at the heart.
Read the Prime Minister’s speech: Britain, the great meritocracy .
Universities now have the freedom to charge a higher rate of fees. Those institutions charging over £6,000 fees have dedicated considerable amounts of resource to widen access: expenditure through Access Agreements (which universities must agree with the Director of Fair Access in order to charge above £6,000) is expected to reach £745 million in 2016/17.
The government intends to set out the new guidance to the independent Director for Fair Access (DfA), with a clear expectation that universities would contribute to school level attainment. This will inform the DfA’s own guidance to higher education institutions on their access agreements, which are conditions of charging the higher rate of fees. The government will consider what further measures are necessary to ensure all universities meet these requirements.
Published: 9 September 2016


A term used by insiders to describe the debt collection industry.
Active transportation
Transportation policy or choices that prioritize walking, biking,
mopeds, scooters, trolleys, buses, shuttles, light rail, local,
regional, and continental train systems over automobiles.
Adjustable rate mortgage (ARM)
A type of mortgage where the interest rate paid on the outstanding
balance changes according to a specific indicator, often out of
the control or knowledge of the borrower.
Affidavit
A voluntarily written statement made by a person under oath.
Affiant
A person who swears to an affidavit.
Affordable Care Act (ACA)
President Obama’s health care reform law signed in 2010, parts of
which go into effect in 2014. The law has the stated intent of
making health care more affordable, although at least 23 million
people will remain uninsured. It has been criticized for widely
expanding the role of private health insurance and for-profit
care, rapidly transferring public money to private hands through
the individual mandate. Also referred to as the Patient Protection
and Affordable Care Act (PPACA) or Obamacare. See
individual mandate.
Alternative financial services (AFS)
See fringe finance.
Amenable mortality
A death that could have been prevented with access to effective
health care.
Annual percentage rate (APR)
The rate of a loan’s interest, expressed as the amount that would
be accrued over the course of a year.
Asset
Anything of economic value owned by a person or company, the value
of which may be expressed in cash.
Austerity programs
Cuts to government spending on social programs justified as a
means of balancing municipal, state, and national budgets in times
of financial distress.
Auto debt
See car debt.
Auto-title loan
When a borrower exchanges their automobile’s title for cash,
generally for about one-quarter of the vehicle’s value, with a
high APR. The vehicle can still be driven, however, during the
loan’s duration.
Bankruptcy
A court-supervised legal process in which the debts of an
individual or business in financial distress are restructured or
dismissed.
Bankruptcy Abuse Prevention and Consumer Protection Act (BAPCPA)
Passed in 2005 as the result of massive lobbying on behalf of the
credit industry, BAPCPA is a harsh reform to the federal
bankruptcy code that makes it significantly harder and more
expensive for debtors to file.
Capital gains
Profits obtained by selling assets, for example, a home, family
business, stock, or bond.
Capitalism
An economic system, or mode of production, in which the bulk of
the means of production are privately owned, products are
exchanged in a market (i.e., the primary determinant of prices is
competition among individual enterprises trying to make a profit),
and most people work for others, who own the means of production
in exchange for wages or a salary.
Car debt
Debt incurred by the purchase, use, and maintenance of an
automobile.
Carbon emissions
The release of carbon dioxide into the earth’s atmosphere
primarily from the use of oil, natural gas, coal, and other fossil
fuels which results in an increase in the average global
temperature.
CARD (Credit Card Accountability Responsibility and Disclosure)
Act
The CARD Act of 2009 requires card issuers to determine a
consumer’s ability to pay prior to increasing a credit limit or
opening a new credit card account.
Chapter 7 bankruptcy
One of the two main chapters in the federal bankruptcy code under
which individuals may file, Chapter 7 wipes away all consumer,
medical, and other unsecured debts, but does not discharge certain
tax debts, student loan debt, or debt from alimony and child
support obligations.
Chapter 13 bankruptcy
One of the two main chapters in the federal bankruptcy code under
which individuals may file, Chapter 13 emphasizes the
restructuring of an individual’s debts as opposed to outright
dismissal, allowing the debtor a chance to retain some important
assets.
Check-cashing outlet (CCO)
A store where people can cash checks for a fee, often used by
people who don’t have a checking account.
Churning
A process whereby lenders prolong the duration of debt in order to
extract as many fees as possible.
Climate change
Severe and sudden changes in the earth’s atmosphere and weather
patterns brought about by human activity. Although technically the
earth’s climate is constantly changing over vast periods of time,
drastic increases in greenhouse gas emissions over the past two
centuries have had unprecedented and profound impacts on the
planet, and thus the term “climate change” primarily refers to
human-induced changes.
Climate debt
Originally known as “carbon debt,” the term “climate debt” refers
to a measureable ecological obligation from the world’s wealthiest
countries to the global South, calculated with the understanding
that the former are responsible for most greenhouse gas emissions,
while the latter tends to suffer the harshest consequences.
Contrasted with the monetary debts imposed by the richest nations,
the concept of climate debt challenges conventional assumptions
regarding who owes what to whom.
Collection agency
A business that profits through the collection of debts and
interest owed by individuals or businesses.
Commons
Natural, intellectual, and social resources for which access, use,
and management are shared among members of a community.
Consolidation
Combining several loans into one larger loan from a single lender
in order to pay off the balances on the others.
Consumer Financial Protection Bureau (CFPB)
An independent U.S. federal agency whose stated purpose is to
regulate financial institutions such as banks, payday lenders, and
collection agencies, and to protect consumers from fraudulent or
misleading financial products and services. The CFPB was created
in 2011 following the passage of the Dodd–Frank Wall Street Reform
and Consumer Protection Act.
Copay
The portion of payment for a medical service that is provided by a
person with insurance. Higher copays often deter insured
individuals from seeking care, resulting in them being effectively
uninsured.
Corporate welfare
A term used to describe when a government gives tax breaks or
other special treatment to corporations, in contrast to the
characterization of poor people as undermining the system through
use of social services.
Credit card receivables
A projection of a credit card companies’ future business income
that consists of all the interest that could potentially be
collected from cards issued.
Credit report
A document produced by a credit reporting agency (CRA) summarizing
a person’s credit history. Information in credit reports factors
critically in decisions to grant credit (e.g., mortgage loans,
auto loans, credit cards, and private student loans) and in other
financial spheres, including eligibility for rental housing,
setting premiums for auto and homeowners insurance in some states,
and employment. See credit reporting agencies (CRAs).
Credit reporting agencies (CRAs)
Companies that gather, organize, and standardize certain consumer
financial information such as credit card balances, payment
history, and outstanding student loan debt and then sell this
information to banks and other creditors. Increasingly, this
information is also being sold to employers, insurers, and
consumers themselves. The largest CRAs known as the “Big Three,”
or the “national” CRAs are Equifax, TransUnion, and Experian.
Credit score
A number produced by inputting a person’s credit information from
their credit report into a proprietary algorithm. Credit reporting
agencies (CRAs) generate this number and provide it to banks or
other financing companies, which use it to decide whether to lend
to someone, and at what interest rate. Scores have different
ranges, the most common one being 300 to 850, with a higher number
signifying greater “creditworthiness.” Increasingly, credit scores
are used in other major decisions besides lending, such as
employment and housing. See credit report and
credit reporting agencies (CRAs).
Creditor
A person or institution to whom money is owed, typically as the
result of a legally binding loan agreement.
Currently not collectible
A program where the IRS voluntarily agrees not to collect on one’s
tax debts for approximately one year.
Data-mining
A process of analyzing large amounts of data to discover patterns,
often used by businesses to determine sales trends and increase
profit.
Deductible
The expenses expressed as either a flat rate or a percentage of
all costs that must be paid out-of-pocket by the patient before an
insurer will pay any remaining costs.
Default
Failure to make required payments on debt on time.
Deferment
See student loan deferment.
Department of the Treasury
The accounting arm of the U.S. federal government, responsible for
the collection of all incoming revenue as well as the payment of
all federal obligations. Where revenue falls short of covering
operating expenses, the Treasury issues government debt in the
form of bills, notes, and bonds. The Treasury is also responsible
for printing currency.
Disaster capitalism
The exploitation of natural disasters to promote market-based
redistribution from the poor to the wealthy, and the outsourcing
of basic services like education, health care, and housing to
private providers at the local level.
Disposable income
The amount of one’s income after legally required deductions are
made, such as taxes and employee retirement systems.
Ecological debt
See climate debt.
Electronic Benefit Transfer (EBT) card
A card issued by government agencies and used by cardholders to
access benefits such as food stamps, unemployment compensation,
veterans’ benefits, etc.
Eminent domain
The power of the government and quasi-public development
corporations to seize privately owned land. Land seized through
eminent domain must be used for the “public benefit,” loosely
defined. It may remain property of the state or may be immediately
transferred to private developers with the often-vague mandate to
foster economic development.
Fair Credit Reporting Act (FCRA)
Passed in 1970 in response to the increasing concentration of
personal consumer credit information in the hands of a few
national credit reporting agencies, the FCRA sets out a number of
requirements and rules for all agencies that compile consumer
credit reports on individuals nationwide.
Fair Debt Collection Practices Act (FDCPA)
A 1977 amendment to the Consumer Credit Protection Act (1968) that
makes certain abusive debt collection practices illegal.
Fannie Mae (Federal National Mortgage Association)
A U.S. federal program created in 1938 as part of the New Deal to
expand the homeowner population by loaning money to people who
previously didn’t qualify. Fannie Mae was privatized in 1968.
Federal Housing Administration (FHA)
A U.S. federal program created in 1934 with the express purpose of
insuring mortgage loans from banks and other parties in the
private sector.
Federal Reserve Bank
The national bank of the United States, which is a central banking
system with twelve branches spread across the nation. It controls
monetary policy and has supervisory and regulatory authority over
the nation’s private banking system.
FICO score
The most common type of credit score. Credit reporting agencies
(CRAs) calculate this score by taking financial data about a
consumer and plugging it into an algorithm created by the Fair
Isaac Corporation (hence the name “FICO score”). This algorithm is
proprietary and secret. The score’s range is 300 to 850, and the
median score is about 720. If someone’s score is above the median,
they will likely have access to the best credit terms. About 20%
of the U.S. population does not have a FICO score because there is
not enough information in their credit report, which has a
negative impact on their ability to get loans. The majority of
lending decisions in the United States are made using the FICO
score. See credit reporting agencies (CRAs) and
credit score.
Financialization
A process whereby economic growth becomes increasingly dependent
upon money earned through investment and speculation, and whereby
financial institutions increasingly influence economic policy.
Forbearance
See student loan forbearance.
Foreclosure
The process by which a lender secured by a mortgage or deed of
trust engages in the eviction and subsequent sale of property to
recover money unpaid by the borrower.
Free schools
Grassroots-organized schools emphasizing the exchange of knowledge
without hierarchy or institutional structures.
Fringe finance
An array of predatory “alternative” financial services (AFS)
usually offered by providers that operate outside of federally
insured banks. Services include check cashing, remittances/money
transfers, prepaid cards, payday loans, pawnshop loans, auto-title
loans, and rent-to-own agreements.
G20
A group of finance ministers and central bank governors from
nineteen countries plus the president of the European Council and
Head of the European Central Bank, representing twenty major
economies. The G20 has been meeting once or twice a year since
November 2008, and has the stated goals of achieving “global
economic stability” and “sustainable growth,” although each summit
has faced resistance due to a myriad of criticisms, including the
group’s lack of transparency and inherently undemocratic nature.
G8
Heads of governments of eight major national economies who meet
annually to discuss international issues and are routinely
criticized for reasons similar to the G20.
Garnishment
The practice of deducting money from a debtor’s income (typically
the salary), sometimes as a result of a court order. Wage
garnishment often continues until the full debt is paid off.
General purpose reloadable (GPR) card
A prepaid card set up with the user’s own funds, used in place of
a debit or credit card.
Gleaning
The act of gathering unharvested crops left behind by a landowner.
Historically, gleaning has at times been sanctioned or even
encouraged, at others forbidden or criminalized.
Global South
A term used to differentiate economically “developed” or rich
nations like the United States and those in Western Europe from
the “underdeveloped” or poor nations of Africa, Latin America, and
most of Asia.
Greenhouse gases
Gases most notably carbon dioxide, methane, and nitrous oxide that
trap heat in the earth’s atmosphere and affect changes in the
climate.
Guarantee agency
A company that insures private issuers of federal student loans.
Only loans issued prior to June 30, 2010, may be serviced by a
guarantee agency. On such loans, in the event of a default, the
guarantee company reimburses the private lender largely with funds
provided by the government and takes over the responsibility for
collection.
HIPAA (Health Insurance Portability and Accountability Act)
A U.S. law that protect patients’ privacy and requires providers
to notify patients if a breach has occurred.
Independent contractor
Someone who is self-employed and determines their own schedule and
mode of work. Examples include nurses, lawyers, barbers,
cabdrivers, and accountants.
Indigent
An individual without enough income to afford basic needs like
food, clothing, and shelter, or in a criminal case, someone who
cannot afford their own attorney.
Individual mandate
When an individual is required to obtain private health insurance
instead of, or in addition to, a national health insurance plan.
Individual Tax Identification Number (ITIN)
An IRS-issued, nine-digit number for taxpayers who are not
eligible for a Social Security number.
Insurance premium
The rate a patient pays for some portion of the expense of office
visits, including prescription medications, surgical procedures,
mental health services, ongoing treatment, and emergency services.
Interest
A fee for borrowing, calculated as a percentage of money owed.
Interest rate swap (IRS)
A financial tool engineered by Wall Street banks and marketed to
states, cities, and other issuers of municipal debt as a means of
converting variable interest payments to stable fixed rates. In
practice, swaps have locked many municipalities into artificially
high interest payments from which banks profit greatly.
International Monetary Fund (IMF)
An international organization with the mandate of expanding global
trade which, in coordination with the World Bank, issues loans to
countries in need under the guise of alleviating poverty, often
while imposing structural adjustment programs. According to the
IMF, it differs from the World Bank in that it is a “cooperative”
institution tasked with overseeing the balance of accounts between
countries. See World Bank and
structural adjustment programs (SAPs).
Jubilee
Historically, jubilee refers to the abolition of slavery, the
cancellation of all debt, and a return of all lands to the common.
In the late eighteenth century the term was used in the English
countryside to demand an end to enclosures while African slaves
used “jubilee” to demand liberation from slavery. The term was
used more recently in the alter-globalization movement in the
1990s to demand an end to third world debt and by debt resistance
groups after the financial crisis of 2008 to demand the
cancellation of household debt.
Legal Financial Obligations (LFOs)
Fines, fees, and other costs associated with a criminal sentence,
for example, supervision fees if on probation, administrative
fees, “pay to stay” fees, and prison fees.
Libor (London Interbank Offered Rate)
Benchmark used to set interest rates for over $800 trillion in
investments globally. Calculated daily based on data provided by
eighteen of the world’s largest banks. For several years following
the financial crisis of 2008, banks committed massive fraud by
reporting false data to intentionally manipulate interest rates
around the world.
Lien
In the event of non-payment, a lien is a creditor’s right to take
possession of and sell the debtor’s asset that was used to secure
a loan.
Means test
A set of criteria used to determine eligibility for financial
assistance or debt relief based on an individual’s perceived need.
Median wage
In a set of wages, the wage that falls between the highest-paid
50% of workers’ wages and above that of the lowest 50%.
Medicaid
A U.S. federal- and state-funded health insurance program
available only to specific low-income populations, including
children, pregnant women, and people living with disabilities.
Medical loss ratio
A term used by insurance companies to account for the money that
is actually spent on care instead of profits.
Medicare
A U.S. federal social insurance program funded largely by a
payroll tax on employers and workers, Medicare provides health
insurance for U.S. citizens 65 and older and others with
qualifying conditions.
Microcredit
A particular practice of lending where loans are not given to
isolated individuals, but to each person in a “solidarity group,”
often women, in order to finance a small business venture. The
members of the group are collectively responsible to make the
recipient pay the loan back to the bank. This use of social
pressure to achieve high payback rates has been justified as an
alternative to the usurious practices of moneylenders in poor
communities all over the world.
Microloans
See microcredit.
Military-industrial complex
A term used to describe the strong ideological and material
connections between a nation’s armed forces, elected officials,
and corporations. See prison-industrial complex.
Mini-Miranda
A legally required statement from a collector informing the lender
that they are collecting a debt and that any information gathered
during correspondence will be used to collect that debt.
Monetization
A process of converting something into legal tender, for example,
paper currency or coins.
Mortgage
An agreement in which a loan is obtained to buy property and in
which the lender may take ownership in the event that the
repayment does not occur according to the terms of the agreement.
Mortgage-backed security (MBS)
A tradable financial product whose value is based on the
likelihood of repayment on a mortgage or collection of mortgages.
Mortgage-modification
A process where the lender and borrower of a mortgage agree to
modify terms of the original agreement often in service of helping
the borrower avoid eviction and foreclosure.
Municipal bond
Bonds issued to raise funds by state and local governments or
publicly funded incorporated entities, such as school districts,
development corporations, transportation authorities, or public
utilities. Municipal bonds are explicitly or implicitly backed by
future tax revenue or other revenue streams such as tolls and
utility fees, and are often issued by government-formed
authorities run by unelected boards of directors.
Municipality
Any incorporated local governmental division, such as a county,
city, town, or village.
Mutual aid
A practice of freely sharing or lending resources or labor based
on the understanding that the betterment of a community member is
ultimately beneficial to all. It has been observed everywhere in
nature and throughout history.
National debt
Debt created by selling government bonds and securities to banks
and investors within the country issuing the bonds.
Negative equity
When the market value of an asset or investment falls below its
outstanding loan balance.
Neoliberalism
A form of capitalism that claims that what had previously been
done by the state or through cooperative social action would be
better done by capitalist firms competing in the marketplace. It
differs from “old” liberalism, which argued for tearing down
tariff barriers and other “hindrances to trade.” In neoliberalism,
commodification extends into realms that previously resisted it
such as the human parts market and whole new areas of property
such as the DNA of a species. Neoliberal economic policies
generally include the push for privatization of public services,
lower wages for the majority of workers, and loosening
restrictions on businesses. See capitalism.
Net worth
See wealth.
Odious debt
Debt imposed on a government that should never have been taken on
in the first place. Often incurred by undemocratic regimes in the
interest of those in power, it is the country’s population that is
held responsible for repayment, typically at the cost of great
suffering.
Offer in compromise
A way to settle one’s tax debts for less than what one owes, based
on ability to pay, income, expenses, and asset equity.
Original creditor (OC)
The company to which a debt was originally owed.
Participatory budgeting
A process by which community members work together to determine
priorities for public spending. Participatory budgeting has been
shown to result in a more equitable distribution of public
resources than budgets determined exclusively by representative
governments.
Pawnshop loan
When a borrower gives property to a pawnbroker to secure a small,
high-APR loan, generally for half of the item’s value.
Payday loan
Small-credit, high-APR loans deceptively marketed as a quick and
easy way to tide borrowers over until the next payday.
Poverty tax
The surcharge people pay for not having savings or access to prime
credit and are thus consigned to fringe finance.
Precarious labor
A trend in employment practices in which opportunities for
long-term stable jobs with benefits are scarce.
Predatory lending
The practice of deceiving borrowers into entering abusive or
unfair loan agreements.
Prison-industrial complex
A concept used to draw parallels with the military-industrial
complex, to highlight ways in which corporate profits incentivize
a rapidly increasing prisoner population. See
military-industrial complex.
Progressive taxation
A tax system where people with higher incomes have a higher tax
rate in order to better distribute wealth. See
regressive taxation.
Public banking
An alternative to standard state and local government banking and
financing models. State or municipal revenues are held in a
publicly owned an operated bank rather than a Wall Street
financial institution. Bank funds are used to finance
infrastructure, economic development and programs that provide
long-term returns and benefit the public good, allowing
governments to avoid the bond-financing trap. Bank dividends are
returned to the public treasury.
Redlining
A practice that makes loans or insurance inaccessible to people of
color, historically used to enhance segregation. See
reverse redlining.
Refund anticipation checks (RACs)
A financial product in which consumers who can’t afford tax
preparation costs agree to have a temporary bank account opened
where the IRS deposits their tax refund. When the refund is
deposited, the tax preparation company takes out the amount equal
to the cost of their services as well as burdensome fees.
Refund anticipation loans (RALs)
A financial product where consumers can receive the amount of
their tax refund in advance in the form of a short-term,
high-interest loan. This product has, as of 2013, been largely
replaced by refund anticipation checks. See
refund anticipation checks.
Regressive taxation
A tax system in which people with lower incomes bear a
disproportionately high tax burden. See
progressive taxation.
Remittance
A money transfer sent to an immigrant’s home country.
Rent-to-own lender
A store that rents appliances, electronics, and other items to
people which they can, in theory, eventually own. This is
different from credit purchases where the customer immediately
gains the title to the product.
Reproductive labor
Work done in and around the home, often without a wage, including
but not limited to childrearing, housework, and procreation;
traditionally done by women and unrecognized as “work.”
Reserve currency
The primary currency of exchange used by governments and
institutions in global trade. The U.S. dollar has been the reserve
currency for the past seven decades.
R
everse redlining
Aggressively targeting communities of color with predatory
services such as loans, insurance, for-profit education, etc. See
redlining.
Risk pooling
The subsidization of wealthy households’ credit cards.
Risk premium
The cost increase required to compensate for credit risk.
Robo-signing
When an employee, agent, or software of a mortgage servicing
company signs foreclosure documents without reviewing them, often
resulting in fraudulent or faulty agreements.
Sallie Mae (Student Loan Marketing Association)
Created as a government-sponsored enterprise in 1972, Sallie Mae’s
initial purpose was to issue federally guaranteed student loans,
financed by a mix of subsidies and private capital. Now it is a
publicly traded multibillion-dollar company that issues private
student loans and makes millions servicing loans originated by the
government.
Secondary market
A market where original investments (loans, mortgages, etc.) are
pooled or split in order to be traded to other investors. The New
York Stock Exchange and the NASDAQ are examples of secondary
markets.
Secured debt
A debt in which specified assets (collateral) become the property
of the lender in the event that the borrower cannot repay. See
unsecured debt.
Service economy
A range of jobs that produce intangible goods, for example,
retail, food, and education. Employees in this sector usually
require specialized skill sets and are paid low wages.
Single-payer health care
Health care in which a government pays for all expenses except
copays and coinsurance, rather than private insurance companies.
SLABS (Student Loan Asset-Backed Securities)
Tradable financial products whose value is based on the likelihood
of repayment on private student loans that are collected in a
pool.
Socialism
An economic system in which the bulk of the means of production
are held in common and production is democratically planned by the
producers.
Sovereign debt
Debt created by national governments borrowing from foreign
sources like the World Bank, the International Monetary Fund
(IMF), or nation-states like China.
Squatting
The common practice of taking up residence in an otherwise
unoccupied property and making it one’s home without permission
from the legally recognized property owner.
Stated income loan
A type of mortgage that allows the borrower to note their income
and assets on the loan application without verification.
Statute of limitations (SOL)
A legal limit on the number of years a creditor may attempt to
pursue payment.
Structural adjustment programs (SAPs)
Conditions set by the International Monetary Fund and World Bank
primarily for countries in the global South to repay debts or
apply for new loans.
Student loan deferment
An agreement between lender and financially distressed borrower to
postpone repayment for a defined period during which interest does
not accrue for subsidized loans.
Student loan forbearance
An agreement between a lender and a financially distressed
borrower to reduce or delay payments to avoid default. Interest
continues to accrue during this period.
Subprime
Loans that are characterized by high interest rates, designed for
“high-risk” borrowers due to their low credit scores, inadequate
documentation, or high debt loads.
Treasury notes
See Department of the Treasury.
Unbanked
People without checking or savings accounts.
Underbanked
People with checking or savings accounts but who at least
partially rely on alternative financial products.
Underwater home
A home in which the value of the mortgage is higher than the
home’s market value.
Unsecured debt
Money borrowed that is not backed by collateral. See
secured debt.
Upside-down car loan
A loan in which the purchaser owes more on a car than that car’s
current value.
Usury laws
Laws that establish legal maximum interest rates for loans
regulated by states to protect borrowers.
Wage stagnation
An economic trend in which average wages do not increase when
adjusted for inflation.
Wealth
The amount someone owns minus the amount that they owe. Also
referred to as net worth.
World Bank
An international organization with the mandate of expanding global
trade which, in coordination with the International Monetary Fund,
issues loans to countries in need under the guise of alleviating
poverty, often while imposing structural adjustment programs. See
International Monetary Fund (IMF) and
structural adjustment programs (SAPs).


For this milestone, you will implement your design you described in Milestone 2.
This is expected to be completed as a group.
Implement your formatting language. If you require new dependencies, be sure to update requirements.txt
in your repo.
Ideally, you should end up with a function which takes raw page source source and returns HTML. You can differ from this API if you wish.
Write a test or tests which calls your formatting function. This should exercise the following features of the language:
Update your view page flask route to call the formatting function.
Within high probability, your Milestone 1 tests will now be failing as your formatting language is producing different results than your Milestone 1 tests would have expected. Update these tests so they are passing again.
At least one new test created which tests formatting function.
All existing tests still passing.
Remember: to receive a grade, you must submit a peer feedback form indicating which work you did and which was done by your teammates. This will be sent to you shortly after the due date.


CSS-Minsk-JS is a community conference intended for networking and collaboration in the developer community. We value the participation of each member of the community and want all attendees to have an enjoyable and fulfilling experience. Accordingly, all attendees are expected to show respect and courtesy to other attendees throughout the conference and at all conference events, whether officially sponsored by CSS-Minsk-JS or not. To make clear what is expected, all delegates/attendees, speakers, exhibitors, organizers and volunteers at any CSS-Minsk-JS event are required to conform to the following Code of Conduct. Organizers will enforce this code throughout the event.
The Short Version
CSS-Minsk-JS is dedicated to providing a harassment-free conference experience for everyone, regardless of gender, sexual orientation, disability, physical appearance, body size, race, or religion. We do not tolerate harassment of conference participants in any form. All communication should be appropriate for a professional audience including people of many different backgrounds. Sexual language and imagery is not appropriate for any conference venue, including talks. Be kind to others. Do not insult or put down other attendees. Behave professionally. Remember that harassment and sexist, racist, or exclusionary jokes are not appropriate for CSS-Minsk-JS. Thank you for helping make this a welcoming, friendly event for all.
 Exhibitors in the expo hall, sponsor or vendor booths, or similar activities are also subject to the anti-harassment policy. In particular, exhibitors should not use sexualized images, activities, or other material. Booth staff (including volunteers) should not use sexualized clothing/uniforms/costumes, or otherwise create a sexualized environment. Be careful in the words that you choose.