Entries Tagged as ''

Canal pound

A canal pound is the stretch of level water impounded between two canal locks. Canal pounds can vary in length from the non-existent, where two or more immediately adjacent locks form a lock staircase, to many miles.


History

Pounds came into being with the development of Pound locks to replace the earlier flash locks. A key feature of pound locks was that the intervening level between locks remained largely constant, as opposed to the varible levels created by the opening of flash locks.


Types of pound

Pounds can be described in various ways according to their situation;


Summit pound

A summit pound is formed at a summit on the canal, and where all the defining locks descend from the pound. Summit pounds are particularly important in canal design, as every boat entering or leaving the pound causes a loss of water. Summit pounds therefore need an independent form of water supply, which may take the form of weirs on adjacent rivers, reservoirs or pumping stations. Common practice during canal design was to make summit pounds as large as practically possible, in order that losing a lockful of water would not lower the water level too significantly. The Rochdale Canal is a good example of a canal with a relatively short summit pound, which requires restrictions on lock workings at certain times.


Sump pound

The inverse of a summit pound is a sump pound. In contrast to a summit pound, a sump pound is a point where every boat entering or leaving the pound causes an addition of water.


Lock pound

A pound which lies between two locks which lie only a short distance apart. Water levels in the pound are liable to fluctuate as the locks are used.


Side pound

A

particular type of extremely short lock pound, which is extended sideways to make up for the short distance between locks so as to avoid excessive level fluctuations. Side pounds should not be confused with side ponds (without the u).

Buddy profile

Buddy profiles are brief descriptions that each AOL Instant Messenger (AIM) user can write about himself or herself. They are derived from the original AOL Member Profiles, which allowed AOL users to list personal details such as age, sex, and location (a/s/l). Among other popular things, who the users friends are or inspiring quotes. Profiles cannot be made using AIM Express.

Buddy profiles allow multiple font-faces, font colors, and background colors to be used to create unique profiles.

Buddy profiles suffer from several limitations; the two primary limitations are the space limitation (a kilobyte) and the lack of image support. Subprofile.com was the first website to overcome the space limitation of the buddy profile. It created the phenomenon known as the subprofile, which was opened internally in the AIM Buddy Profile window. The subprofile allowed users a much greater amount of space to store their information. It also created new features, such as quizzes, countdowns, and random fact generators.

The subprofiles created by Subprofile.com and other sites such as Buddyprofile.com still suffered from a key limitation: the lack of image support. This was overcome in 2002 by XProfile. XProfile’s solution to the lack of image support was to open the link in an external browser. XProfile’s subprofiles appear very much like a standard website. Later, several websites such as Buddy4u took a different approach to the problem. These profiles are opened in the AIM Today window, and in terms of window size and shape appear much like a standard profile, but with support for images and other features like those pioneered by Subprofile.com.


Example

An example of someone’s AIM profile would be:

live your life </FONT>Ü

</B>

[sometimes people just put quotes in their “pros”]

Acceleration clause

An acceleration clause, in the law of contracts, is a term that fully matures the performance due from a party upon a breach of the contract. Such clauses are most prevalent in mortgages and similar contracts to purchase real estate in installments.

Suppose, for example, the contract was for A to purchase Blackacre from B for $100,000, to be paid in 5 monthly installments of $20,000. If A makes the first two payments, but fails to make the third payment, an acceleration clause would require that A must immediately pay B the entire balance of $60,000, or lose his right to purchase Blackacre (without getting a refund of his $40,000).

A sample acceleration clause reads like this:

In the event of default in the payment of any of the said installments or said interest when due as herein provided, time being of the essence hereof, the holder of this note may, without notice or demand, declare the entire principal sum then unpaid immediately due and payable.


External links

  • Promissory Note - Installment - With Acceleration Clause

Hard aspect (astrology)

In astrology, a hard aspect is an astrological aspect that stimulates the native to take some action to resolve tension, conflict, or stress in his life. Because they required the native to take action, they are very motivational in nature. All hard aspects are considered to be disharmonious on some level because an easy flow of energy does not exist within them. The conjunction and the parallel are sometimes considered to be hard because they stimulate action, but they are not always disharmonious because quite often the activities they induce can bring about positive outcomes.

When determining whether an aspect is disharmonious, therefore, one would need to look at the planets involved and see the influence they play in the situation. An example of this would be the planet Pluto. Because of the extreme nature of the planetoid, just about any aspect it makes is going to be considered hard because it forces the native to look closely at his life, make appropriate changes, or risk losing that which is important to him. Therefore, even though the trine and sextile are considered to be easy aspects, any aspect they make with Pluto is likely to be fraught with difficulties until the native learns to transform his environment through the transcendental nature of the planet.

The aspects that are considered to be hard are the semi-square, square aspect, opposition or sesquiquadrate.


See also

  • Soft aspect (astrology)

Symmetric difference

In mathematics, the symmetric difference of two sets is the set of elements which are in one of the sets, but not in both. This operation is the set-theoretic equivalent of the exclusive disjunction (XOR operation) in Boolean logic. The symmetric difference of the sets A and B is commonly denoted by

<math> A \Delta B\,.</math>

For example, the symmetric difference of the sets {1,2,3} and {3,4} is {1,2,4}. The symmetric difference of the set of all students and the set of all females consists of all male students together with all female non-students.

The symmetric difference is equivalent to the union of both relative complements, that is:

<math>A \Delta B = (A - B) \cup (B - A),\,</math>

and it can also be expressed as the union of the two sets, minus their intersection:

<math>A \Delta B = (A \cup B) - (A \cap B),</math>

or with the XOR operation:

<math>A \Delta B = \{x : (x \in A) \mbox{ XOR } (x \in B)\}.</math>

The symmetric difference is commutative and associative:

<math>A \Delta B = B \Delta A,\,</math>
<math>(A \Delta B) \Delta C = A \Delta (B \Delta C).\,</math>

Thus, the repeated symmetric difference is an operation on a multiset of sets giving the set of elements which are in an odd number of sets.

The symmetric difference of two repeated symmetric differences is the repeated symmetric difference of the join of the two multisets, where for each double set both can be removed. In particular:

<math>(A \Delta B) \Delta (B \Delta C) = A \Delta C.\,</math>

This implies a kind of triangle inequality: the symmetric difference of A and C is contained in the union of the symmetric difference of A and B and that of B and C. (But note that for the diameter of the symmetric difference the triangle inequality does not hold.)

The empty set is neutral, and every set is its own inverse:

<math>A \Delta \varnothing = A,\,</math>
<math>A \Delta A = \varnothing.\,</math>

Taken together, we see that the power set of any set X becomes an abelian group if we use the symmetric difference as operation. Because every element in this group is its own inverse, this is in fact a vector space over the field with 2 elements Z2. If X is finite, then the singletons form a basis of this vector space, and its dimension is therefore equal to the number of elements of X. This construction is used in graph theory, to define the cycle space of a graph.

Intersection distributes over symmetric difference:

<math>A \cap (B \Delta C) = (A \cap B) \Delta (A \cap C),</math>

and this shows that the power set of X becomes a ring with symmetric difference as addition and intersection as multiplication. This is the prototypical example of a Boolean ring.

The symmetric difference can be defined in any Boolean algebra, by writing

<math> x \Delta y = (x \lor y) \land \lnot(x \land y) = (x \land \lnot y) \lor (y \land \lnot x) = x \oplus y.</math>

This operation has the same properties as the symmetric difference of sets.


n-ary symmetric difference

As above, the symmetric difference of a collection of sets contains just elements which are in an odd number of the sets in the collection:

<math>\triangle M = \left\{ a \in \bigcup M\ |\ \#\{A\in M|a \in A\}\ \mbox{is odd}\right\}</math>.

Evidently, this is well-defined only when each element of the union <math>\bigcup M</math> is contributed by a finite number of elements of <math>M</math>.


Symmetric difference on measure spaces

As long as there is a notion of “how big” a set is, the symmetric difference between two sets can be considered a measure of how “far apart” they are. Formally, if μ is a σ-finite measure defined on a σ-algebra Σ, the function,

<math>d(X,Y) = \mu(X \Delta Y)</math>

is a pseudometric on Σ. d becomes a metric if Σ is considered modulo the equivalence relation X ~ Y if and only if <math>\mu(X \Delta Y) = 0</math>. The resulting metric space is separable if and only if L2(μ) is separable.


See also

  • Algebra of sets
  • Boolean function
  • Fuzzy set
  • Logical graph
  • Minimal negation operator
  • Set theory
  • Symmetry
  • Zeroth order logic

Transparency (projection)

A transparency is a thin sheet of transparent flexible material, typically cellulose acetate, onto which figures can be drawn. These are then placed on an overhead projector for display to an audience. This system is still found in schools, but is being largely replaced by LCD projectors.


Spatial light modulators (SLMs)

Many overhead projectors are used with a flat panel LCD which, when used this way is referred to as a spatial light modulator or SLM. Data projectors are often based on some form of SLM in a projection path. A LCD is a transmissive SLM, whereas other technologies such as Texas Instrument’s DLP are reflective SLMs. Not all projectors (e.g. some use devices that produce their own light) rather than function as transparencies. An example of non-SLM system are OLEDs.

Relational calculus

The relational calculus refers to the two calculi, the tuple relational calculus and the domain relational calculus, that are part of the relational model for databases and that provide a declarative way to specify database queries. This in contrast to the relational algebra which is also part of the relational model but provides a more procedural way for specifying queries.

The relational algebra might suggest these steps to retrieve the phone numbers and names of book stores that supply Some Sample Book:

  1. Join books and titles over the BookstoreID.
  2. Restrict the result of that join to tuples for the book Some Sample Book.
  3. Project the result of that restriction over StoreName and StorePhone.

The relational calculus would formulate a descriptive, declarative way:

Get StoreName and StorePhone for supplies such that there exists a title BK with the same BookstoreID value and with a BookTitle value of Some Sample Book.

The relational algebra and the relational calculus are logically equivalent: for any algebraic expression, there is an equivalent expression in the calculus, and vice versa.


References


See also

  • The Third Manifesto
  • Tutorial D
  • D (data language specification)
  • D4 (programming language) (an implementation of D)

Apollonius’ theorem

In elementary geometry, Apollonius’ theorem is a theorem relating several elements in a triangle.

It states that given a triangle ABC, if D is any point on BC such that it divides BC in the ratio n:m (or <math>mBD = nDC</math>), then

<math>mAB^2 + nAC^2 = mBD^2 + nDC^2 + (m+n)AD^2.</math>


Special cases of the theorem

  • When <math>m = n (=1)</math>, that is, AD is the median falling on BC, the theorem reduces to
<math>AB^2 + AC^2 = BD^2 + DC^2 + 2AD^2.\,\!</math><math>AB^2 + AC^2 = BD^2 + DC^2 + 2AD^2.\,\!</math>
  • When in addition AB = AC, that is, the triangle is isosceles, the theorem reduces to the Pythagorean theorem,
<math> AD^2 + BD^2 = AB^2 (= AC^2).\,\!</math>

In simpler words, in any triangle <math>ABC\,\!</math>,
if <math>AD\,\!</math> is a median,
then
<math>AB^2 + AC^2\,\!</math>=
<math>2(AD^2+BD^2)\,\!</math>
To prove this theorem,
let <math>AX\,\!</math> be a perpendicular dropped on <math>BC\,\!</math>
from the point <math>A\,\!</math>.
Then, in the right-angled triangles <math>ABX\,\!</math> and <math>ACX\,\!</math>, by Pythagoras’ Theorem, we have
<math>AB^2 = AX^2 + BX^2\,\!</math>

=<math>AX^2 + (BD+DX)^2\,\!</math>

=<math>AX^2 + BD^2 + DX^2 + 2.BD.DX\,\!</math> ………..(i)

and

<math>AC^2 = AX^2 + CX^2\,\!</math>

=<math>AX^2 + (CD-DX)^2\,\!</math>

=<math>AX^2 + CD^2 + DX^2 - 2.CD.DX\,\!</math> ………..(ii)


Adding equations (i) and (ii),

<math>AB^2 + AC^2\,\!</math>

=<math>AX^2 + BD^2 + DX^2 + 2.BD.DX + AX^2 + CD^2 + DX^2 - 2.CD.DX\,\!</math>

=<math>2(AX^2 + DX^2 + BD^2)\,\!</math>
{since <math>BD=DC\,\!</math>,thus <math>2.BD.DX=2.DC.DX\,\!</math>}

=<math>2(AX^2 + DX^2) + 2BD^2\,\!</math>

=<math>2(AD^2 + BD^2)\,\!</math> {since <math>AXD\,\!</math> is a right angle}

And thus the theorem is proved.


See also

  • Stewart’s theorem
  • Parallelogram law
  • Pythagorean theorem
  • Menelaus’ theorem
  • Ceva’s theorem

Overhead information

Overhead information is digital information transferred across the functional interface between a user and a telecommunications system, or between functional units within a telecommunications system, for the purpose of directing or controlling the transfer of user information or the detection and correction of errors.

Overhead information originated by the user is not considered to be system overhead information. Overhead information generated within the communications system and not delivered to the user is system overhead information. Thus, the user throughput is reduced by both overheads while system throughput is reduced only by system overhead.

Source: From Federal Standard 1037C and from MIL-STD-188

Higher Certificate

The Higher Certificate (Ardteastas in Irish) is an award that will replace the National Certificate in the Republic of Ireland of the Higher Education and Training Awards Council and a number of Dublin Institute of Technology certificates.

The Higher Certificate is currently available in DIT and HETAC related colleges in Ireland and will be awarded from June 2005, the standard of the award will be broadly similar to the National Certificate but will have some differences.


Common Higher Certificates

English title Irish title
Higher Certificate in Arts Ardteastas Ealaíon
Higher Certificate in Business Ardteastas Gnó
Higher Certificate in Engineering Ardteastas Innealtóireachta
Higher Certificate in Science Ardteastas Eolaíochta


See also

  • Education in the Republic of Ireland

Gentle.NET

Gentle.NET (or just Gentle) is an object-relational mapping (ORM) solution for the Microsoft .NET platform. It is free, open source software that is distributed under the LGPL. Gentle was developed by Morten Mertner and first released to the public in January 2004. It provides a framework for mapping an object-oriented domain model to a traditional relational database.


Features

Gentle supports mapping of plain C# classes to database tables. To achieve this it performs run-time SQL generation using metadata obtained by analyzing the database schema combined with metadata gathered by reflection (a mechanism for run-time type inspection). Classes can be mapped to either a table or view.

In addition to this core functionality, Gentle features a caching subsystem to enhance performance, an extensible validation engine for data validation, full two-way data-binding support, automatic object construction, concurrency control, object uniqing, soft deletion, inheritance mapping, and a facility for creating custom queries.

The goal of the project is to make database persistence as seamless as possible, without imposing any particular design restrictions on the users of the framework.


Versions

The current version of Gentle is version 1.2.9. It works in most .NET environments (tested on Microsoft .NET 1.1 and 2.0 and Mono 1.1.9).

Development is currently focused on version 2.0, which targets the .NET 2.0 platform.


External links

  • Gentle.NET Home Page
  • Gentle.NET SourceForge Project Home


Tools

  • MicroTOOL ObjectiF (UML designer with Gentle support)
  • MyGeneration (code generation tool with template for Gentle)

List of Members of the Canadian House of Commons - Q

  • Victor Quelch b. 1891 first elected in 1935 as Social Credit member for Acadia, Alberta.
  • Felix Patrick Quinn b. 1874 first elected in 1925 as Conservative member for Halifax, Nova Scotia.
  • Michael Joseph Francis Quinn b. 1851 first elected in 1896 as Conservative member for St. Anne, Quebec.

Göta Canal

The Göta Canal () is a Swedish canal constructed in the early 19th century. The canal stretche from Gothenburg on the west coast, combined with the river Göta älv and the Trollhätte canal, through the large lakes Vänern and Vättern, in parallel with Motala ström, and to Söderköping on the Baltic Sea.

The architect was Baltzar von Platen, working to plans earlier developed at the request of the Swedish king by the Scottish civil engineer Thomas Telford; he got permission to begin to work on April 11, 1810 and the canal was officially opened on September 26, 1832. Telford himself travelled to Sweden in 1810 to oversee some of the initial excavations on the project.

Built only decades before the advent of railways, the canal was soon outdated, and never upgraded. The canal is a tourist attraction, sometimes called Sveriges blå band (”Sweden’s Blue Ribbon”).

To support the building of the canal with mechanical works, a small engineering workshop was established in Motala called Motala Verkstad. This industry has sometimes been referred to as cradle of the Swedish engineering industry.


In fiction

Several movies depict the canal, most notably the 1981 comedy Göta Kanal, in which two competing yacht constructors race the canal in order to win a huge construction stock order. In 2006, Göta Kanal 2 was released.


Locks

From the east-coast of Sweden all the way to the west-coast the locks are as follows:
(with meters per locks)

  • Mem, 3
  • Tegelbruket, 2.3
  • Söderköping, 2.4
  • Duvkullen nedre, 2.3
  • Duvkullen övre, 2.4
  • Mariehov nedre, 2.1
  • Mariehov övre, 2.6
  • Carlsborg nedre, 5.1
  • Carlsborg övre, 4.7
  • Klämman, open
  • Hulta, 3.2
  • Bråttom, 2.3
  • Norsholm, 0.8
  • Carl Johans slussar (seven locks), 18.8
  • Oskars slussar, 4.8
  • Karl Ludvig Eugéns slussar, 5.5
  • Brunnby, 5.3
  • Heda, 5.2
  • Borensberg, 0.2
  • Borenshult, 15.3
  • Motala, 0.1

Lake Vättern

  • Forsvik, 3.5
  • Tåtorp, 0.2
  • Hajstorp övre, 5.0
  • Hajstorp nedre, 5.1
  • Riksberg, 7.5
  • Godhögen, 5.1
  • Norrkvarn övre, 2.9
  • Norrkvarn nedre, 2.9
  • Sjötorp 7-8, 4.6
  • Sjötorp 6, 2.4
  • Sjötorp 4-5, 4.8
  • Sjötorp 2-3, 4.8
  • Sjötorp 1, 2.9


Photographs of the Göta Canal


Trivia

The canal is nicknamed “skilmässodiket” which translates to “divorce ditch”. The name refers to the stress endured by couples navigating the numerous locks in the canal.


See also

  • List of Swedish government enterprises


Bibliography

  • Eric de Maré, Swedish Cross Cut, Sweden, 1965. (In English)


External links

  • Göta Canal - Official site

Cooperative database

A cooperative database holds information on customers and their transactions. Many companies will contribute information to a database in return for aggregate information on the customers other companies have provided. Such databases are used for promotional mailings, credit card fraud detection and fighting E-mail spam.


External links

  • Prefer Network

Lake Harrison

Lake Harrison is a huge lake that in parts of the Ice Age covered much of the Midlands in England around Warwick and Birmingham and Leicester. It was formed when ice from Wales and the north blocked the drainage and trapped a lake between the ice front and the Cotswolds. Finally the lake made two overflow courses:

  • Southeast across the Fenny Compton Gap through the Cherwell valley into the Thames. This course has been abandoned.
  • Southwest. This course became permanent and is now the River Avon which flows into the Severn, whereas before the Ice Age the area drained northeastwards.


External links

  • http://www.mattmayer.com/essays/draiglac.htm

Strict Tempo! (album)

Strict Tempo! is an instrumental album by Richard Thompson released in 1981.

After the modest sales for their 1979 album Sunnyvista, Richard and Linda Thompson found themselves without a record deal. An album produced and financed by Gerry Rafferty (see Shoot Out The Lights for more details) failed to secure them a deal with a major label.

To generate some income, Richard Thompson formed his own record label Elixir Records and recorded this album at a small studio in London.

The album consists of some of the artist’s favourite tunes, all rendered as instrumentals and all arranged for guitar, mandolin, and other instruments played by Thompson. The only other participating player is drummer Dave Mattacks.


Track listing

All songs traditional and arranged by Richard Thompson except where noted.

  1. “New-Fangled Flogging Reel/Kerry Reel”
  2. “Vaillance Polka Militaire/Belfast Polka”
  3. “Glencoe/Scott Skinner’s Rock/Bonny Banchory”
  4. “Banish Misfortune
  5. “Dundee Hornpipe/Poppy-Leaf Hornpipe”
  6. “Do It For My Sake”
  7. “Rockin’ In Rhythm” (written by Duke Ellington)
  8. “The Random Jig/The Grinder”
  9. “Will Ye No Cam Back Again”
  10. “Cam O’er The Stream Charlie/Ye Banks And Braes”
  11. “Rufty Tufty/Nonsuch à la Mode de France”
  12. “Andalus/Radio Marrakesh”
  13. “The Knife-Edge” (written by Richard Thompson)


Personnel

  • Richard Thompson - guitar, bass guitar, mandolin, banjo, mandocello, dulcimer, harmonium, pennywhistle, dobro
  • Dave Mattacks - drums, piano on Ye Banks And Braes

Straw man (law)

In law, the term straw man can refer to a third party that acts as a “front” in a transaction (i.e., who is an agent for another) for the purpose of taking title to real property, breaking a joint tenancy, or engaging in some other kind of transaction where the principal remains hidden or to do something else which is not allowed.

A straw man is also “a person of no means,” or one who deliberately accepts a liability or other monetary responsibility without the resources to fulfill it, usually to shield another party.

Electronic funds transfer

Electronic funds transfer or EFT refers to the computer-based systems used to perform financial transactions electronically.

The term is used for a number of different concepts:

  • cardholder-initiated transactions, where a cardholder makes use of a payment card
  • electronic payments by businesses, including salary payments
  • electronic check (or cheque) clearing


Card-based EFT

EFT may be initiated by a cardholder when a payment card such as a credit card or debit card is used. This may take place at an automated teller machine (ATM) or point of sale (EFTPOS), or when the card is not present, which covers cards used for mail order, telephone order and internet purchases.

Card-based EFT transactions are often covered by the ISO 8583 standard.


Transaction types

A number of transaction types may be performed, including the following:

  • Sale: there the cardholder pays or return or service.
  • Refund: where a merchant refunds an earlier payment made by a cardholder.
  • Withdrawal: the cardholder withdraws funds from their account, e.g. from an ATM. The term Cash Advance may also be used, typically when the funds are advanced by a merchant rather than at an ATM.
  • Deposit: where a cardholder deposits funds to their own account (typically at an ATM).
  • Cashback: where a cardholder withdraws funds from their own account at the same time as making a purchase.
  • Inter-account transfer: transferring funds between linked accounts belonging to the same cardholder
  • Payment: transferring funds to a third party account
  • Inquiry: a transaction without financial impact, for instance balance inquiry, available funds inquiry, linked accounts inquiry, or request for a statement of recent transactions on the account.
  • Administrative: this covers a variety of non-financial transactions including PIN change.

The transaction types offered depend on the terminal. An ATM would offer different transactions from a POS terminal, for instance.


Authorization

EFT transactions require communication between a number of parties. When a card is used at a merchant or ATM, the transaction is first routed to an acquirer, then through a number of networks to the issuer where the cardholder’s account is held.

A transaction may be authorized offline by any of these entities through a stand-in agreement. Stand-in authorization may be used when a communication link is not available, or simply to save communication cost or time. Stand-in is subject to the transaction amount being below agreed limits. These limits are calculated based on the risk of authorizing a transaction offline, and thus vary between merchants and card types. Offline transactions may be subject to other security checks such as checking the card number against a ‘hotcard’ (stolen card) list, velocity checks (limiting the number of offline transactions allowed by a cardholder) and random online authorization.

A transaction may be authorized via a pre-authorization step, where the merchant requests the issuer to reserve an amount on the cardholder’s account for a specific time, followed by completion, where the merchant requests an amount blocked earlier with a pre-authorization. This transaction flow in two steps is often used in businesses such as hotels and car rental where the final amount is not known, and the pre-authorization is made based on an estimated amount. Completion may form part of a settlement process, typically performed at the end of the day when the day’s completed transactions are submitted.


Authentication

EFT transactions may be accompanied by methods to authenticate the card and the card holder. The merchant may manually verify the card holder’s signature, or the card holder’s Personal identification number (PIN) may be sent online in an encrypted form for validation by the card issuer. Other information may be included in the transaction, some of which is not visible to the card holder (for instance magnetic stripe data), and some of which may be requested from the card holder (for instance the card holder’s address or the CVV2 value printed on the card).


See also

  • MAPESA  : Blog specialised on money transfer, remittances and cards issues www.mapesa.org
  • EFTPOS
  • Wire transfer
  • Automated Clearing House

Conservative two-phase locking

In computer science, conservative two-phase locking (C2PL) is a locking method used in DBMS and relational databases.

Conservative 2PL prevents deadlocks.

The difference between 2PL and C2PL is that C2PL’s transactions obtain all the locks they need before the transactions begin. This is to ensure that a transaction that already holds some locks will not block waiting for other locks.

In heavy lock contention, C2PL reduces the time locks are held on average, relative to 2PL and Strict 2PL, because transactions that hold locks are never blocked.

In light lock contention, C2PL holds more locks than is necessary, because it is hard to tell what locks will be needed in the future, thus leads to higher overhead.

Also, a transaction will not even obtain any locks if it cannot obtain all the locks it needs in its initial request. Furthermore, each transaction needs to declare its read and write set (data items to be read/written during transaction), which is not always possible. Because of these limitations, C2PL is not used very frequently.

Hoshang Merchant

Hoshang Dinshaw Merchant (born 1947) is a poet from India. Most of his writings are in English.


Early Years

Hoshang Merchant was born in Bombay to Zoroastrian business family. Owing to the then family tradition, he was supposed to make money instead of doing other works. However, Merchant was neither interested in money nor in his father’s property. From childhood, he studied literature, philosophy and history. He understood his gayness at an early age but it was not until the late 80s that he could declare himself a gay person because of societal pressure.


Education

Merchant was educated at St. Xavier’s College, Bombay; Occidental College, Los Angeles; and at Purdue University. He was, after the completion of his Ph.D., exposed to radical left front in the Middle East and acted violently.


Teacher and Poet

Currently, Merchant teaches poetry at the University of Hyderabad. He was the first person to edit India’s first gay anthology “Yaraana: Gay Writing from India”, first poet to declare himself gay in public sphere, first person to design a complete course on sexual dissendence at the University of Hyderabad.

Merchant is a poet, critic, university teacher of English and traveler. He traveled widely in Europe and the Middle East. While he read Buddhism with the Dalai Lama at Dharamsala, he read Islam in Iran and Palestine.

These days Merchant lectures on gay issues at several universities in India and waiting for his fifteen collections of poems to be acknowledged as “literature” and not just as “gay literature”.


His Works


Poetry

  • Flower to Flame (1989, Delhi: Rupa & Co.)
  • Stone to Fruit (1989, Calcutta: Writers Workshop)
  • Yusuf in Memphis (1991, Calcutta: Writers Workshop)
  • Hotel Golkonda: Poems 1991 (1992, Calcutta: Writers Workshop)
  • The Home, the Friend and the World (1995, Calcutta: Writers Workshop)
  • Jonah and the Whale (1995, Calcutta: Writers Workshop)
  • Love’s Permission (1996, Calcutta: Writers Workshop)
  • The Heart in Hiding (1996, Calcutta: Writers Workshop)
  • The Birdless Cage (1997, Calcutta: Writers Workshop)
  • Talking to the Djinns (1997, Calcutta: Writers Workshop)
  • Selected Poems (1999, Calcutta: Writers Workshop)
  • Bellagio Blues (2004, Hyderabad: Otherwise Books, Spark-India)
  • Homage to Jibanananda Das (2005, Contemporary World Poetry Series, London: Aark Arts)


Critical studies

  • In-discretions: Anais Nin (1990, Calcutta: Writers Workshop)


Edited

  • Yaarana: Gay Writing from India (1999, New Delhi: Penguin)

Non-lock concurrency control

In Computer Science, in the field of databases, non-lock concurrency control is concurrency control method used in relational databases without using locking.

There are several non-lock concurrency control methods:

  • Optimistic concurrency control
  • Timestamp-based concurrency control
  • Multiversion concurrency control

They involve the use of timestamps on transaction to determine transaction priority.

See also

Nested transaction

With reference to a database transaction, a nested transaction occurs when a new transaction is started by an instruction that is already inside an existing transaction. The new nested transaction is said to be nested within the existing transaction, hence the term.

Changes made by the nested transaction are not seen by the ‘host’ transaction until the nested transaction is committed. This follows from the isolation property of transactions.

The capability to handle nested transactions properly is a prerequisite for true component based application architectures. In a component-based, encapsulated architecture, nested transactions can occur without the programmer knowing it. A component function may or may not contain a database transaction (this is the encapsulated secret of the component. See Information hiding). If a call to such a component function is made inside a BEGIN - COMMIT bracket, nested transactions occur. Since popular databases like MySQL do not allow nesting BEGIN - COMMIT brackets, a framework or a transaction monitor is needed to handle this.
When we speak about nested transaction,it should be made clear that this feature is RDBMS dependent and is not available for all databases.

This article: [[1]] introduces the fundamental theorem for nested transations similarly to the one for flat transactions.

Computer vision syndrome

Computer vision syndrome (CVS) is a temporary condition resulting from focusing the eyes on a computer display for protracted, uninterrupted periods of time. Some symptoms of CVS include headaches, blurred vision, neck pain, fatigue, eye strain, dry, irritated eyes, and difficulty refocusing the eyes. These symptoms can be further aggravated by improper lighting conditions (ie. bright overhead lighting or glare) or air moving past the eyes (ie. overhead vents). CVS has not been proven to cause any permanent damage to the eye.

One may be able to mitigate the risk of CVS by adhering to the “20-20-20 rule”: every 20 minutes, focus the eyes on an object 20 feet (6 meters) away for 20 seconds. Also, the use of over-the-counter artificial tear solutions and computer glasses can reduce the effects of CVS.


See also

  • Asthenopia
  • Repetitive strain injury

Document Structure Description

Document Structure Description, or DSD, is a schema language for XML, that is, a language for describing valid XML documents. It’s an alternative to DTD or the W3C XML Schema.

An example of DSD in its simplest form:

<dsd xmlns="http://www.brics.dk/DSD/2.0"
 xmlns:my="http://example.com">
  
 <if><element name=”my:foo”/>
  <declare>
   <attribute name=”first”/>
   <attribute name=”second”/>
   <contents>
    <element name=”my:bar”/>
   </contents>
  </declare>
 </if>
  
 <if><element name=”my:bar”/>
  <declare>
   <contents>
   </contents>
  </declare>
 </if>
  
</dsd>

This says that element named “foo” in the XML namespace “http://example.com” may have two attributes, named “first” and “second”. A “foo” element may not have any character data. It must contain one subelement, named “bar”, also in the “http://example.com” namespace. A “bar” element is not allowed any attributes, character data or subelements.

One XML document that would be valid according to the above DSD would be:

<foo xmlns="http://example.com" second="2">
 <bar/>
</foo>


Current Software store

  • Prototype Java Processor from BRICS


External links

  • DSD home page
  • Full DSD specification
  • Comparison of DTD, W3C XML Schema, and DSD

Statute of limitations

A statute of limitations is a statute in a common law legal system that sets forth the maximum period of time, after certain events, that legal proceedings based on those events may be initiated. In civil law systems, similar provisions are usually part of the civil code or criminal code and are often known collectively as “periods of prescription” or “prescriptive periods.”


Applications

A common law legal system might have a statute limiting the time for prosecution of crimes called misdemeanors to two years after the offense occurred. In that statute, if a person is discovered to have committed a misdemeanor three years ago, the time has expired for the prosecution of the misdemeanor. Or a contract can only be sued upon for breach of performance from six years after the contracted performance became due.

By contrast, Canada has a criminal-limitations period only for summary (less serious) offences. The period is six months from the date of the offence. Thus, for instance, a Canadian can be charged only with an “indecent act” within six months of the time of offence, unless both the Crown and the defence agree. In the case of indictable (more serious) offences, for example if a hypothetical assailant committed sexual assault, the assailant could be charged any time in the future—even if the crime happened twenty years ago.

A crime (in the case of a criminal prosecution) or a cause of action (in a civil lawsuit) is said to have accrued when the event beginning its time limitation occurs. Sometimes this is the event itself that is the subject of the suit or prosecution (such as a crime or personal injury), but it may also be an event such as the discovery of a condition one wishes to redress, such as discovering a defect in a manufactured good, or in the case

An idea closely related, but not identical, to the statute of limitations is a statute of repose. A statute of repose limits the time within which an action may be brought and is not related to the accrual of any cause of action; the injury need not have occurred, much less have been discovered. Unlike an ordinary statute of limitations which begins running upon accrual of the claim, the period contained in a statute of repose begins when a specific event occurs, regardless of whether a cause of action has accrued or whether any injury has resulted. This often applies to buildings and properties, and limits the time during which an action may lie based upon defects or hazards connected to the construction of the building or premises. An example of this would be that if a person is electrocuted by a wiring defect incorporated into a structure in, say, 1990, a state law may allow his heirs to sue only before 1997 in the case of an open (patent) defect, or before 2000 in the case of a hidden defect. Statutes of repose can also apply to manufactured goods. Manufacturers contend they are necessary to avoid unfairness and encourage consumers to maintain their property. Consumer groups argue that statutes of repose on consumer goods provide a disincentive for manufacturers to build durable products and to notify consumers of product defects as the manufacturers become aware of them. Consumer groups also argue that such statutes of repose disproportionately affect poorer people, since they are more likely to own older goods.


Expiration

Once the statute of limitations on a case runs out, if a party raises it as a defense any further litigation is foreclosed. Most jurisdictions provide that limitations are tolled under certain circumstances. Tolling will prevent the time for filing suit from running while the condition exists. Examples of such circumstances are if the aggrieved party (plaintiff) is a minor, or the defendant has filed a bankruptcy proceeding. In those instances, in most jurisdictions, the running of limitations is tolled until the circumstance (i.e. the injured party reaches majority in the former or the bankruptcy proceeding is concluded in the latter) no longer exists.

There may be a number of factors which will affect the tolling of a statute of limitations. In many cases, the discovery of the harm (as in a medical malpractice claim where the fact or the impact of the doctor’s mistake is not immediately apparent) starts the statute running. In some jurisdictions the action is said to have not accrued until the harm is discovered, while in others the action accrues when the malpractice occurs, but an action to redress the harm is tolled until the injured party discovers the harm. An action to redress a tort committed against a minor is generally tolled in most cases until the child reaches the age of majority. A ten-year-old who is injured in a car accident might therefore be able to bring suit one, two or three years after he turns 18.

It may also be inequitable to allow a defendant to use the defense of the running of the limitations period, such as the case of an individual in the position of authority over someone else who intimidates the victim into never reporting the wrongdoing, or where one is led to believe that the other party has agreed to suspend the limitations period during good faith settlement negotiations or due to a fraudulent misrepresentation.

Generally speaking, in the case of private, civil matters the limitations period may be shortened or lengthened by agreement of the parties. However, under standard agreement with the Court of Law, you are to be let free, and limitations for you will cease to exist. Under the Uniform Commercial Code the parties to a contract for sale of goods may reduce the limitations period to not less than one year but may not extend it.

While such limitations periods generally are issues of law, limitations periods known as laches may apply in situations of equity (i.e., a judge will not issue an injunction if the party requesting the injunction waited too long to ask for it), such periods are not clearly defined and are subject to broad judicial discretion.

For US military cases, the Uniform Code of Military Justice states that all charges except for those facing general court martial (where a death sentence could be involved) have a five year statute of limitation. This statute changes once charges have been prepared against the service member. In all supposed UCMJ violations except for those headed for general court martial, should the charges be dropped, there is a six month window in which the charges can be reinstated. If those six months have passed and the charges have not been reinstated, the statutes of limitation have run out.


See also

  • Equitable tolling
  • Laches
  • Statute of repose
  • Tort reform
  • Limitation Act 1980 (England and Wales)
  • Duane “Dog” Chapman (Extradition hearing)


External links

  • Statute of Limitations with regards to debt collection

New Business Strain

For a life insurer, even if profitable business is written, the value of the company may appear worsen (when viewed from a regulatory basis, for example) because of new business strain. This is a concept dealt with regularly by actuaries.

New business strain occurs because the initial outgo (such as commission, expenses, reserves, etc.) will take place when the policy is written, and thus have an immediate negative impact on company’s financial position. Over the life of the contract, future income (premiums, investment income, etc.) is expected to repay this initial outlay. However under some accounting regimes, the insurer may not take credit for such future surpluses.

The impact is thus an immediate hit to solvency and profitability when a policy is written, with large surpluses in later years - to pay this back.

New Business Strain is artificial in that it is a function of how a regulatory body, for example, might look at a life insurer’s financial position. This tends not to be realistic, but rather conservative - because that is the role a regulator plays. Realistically speaking, a company’s solvency and profitability actually increases when a new policy is written.

Depending on what reporting basis is being used, new business strain can be eased by the use of Zillmerisation or a Deferred acquisition cost asset. As a result, local GAAP accounting and IFRS accounting tends to show much lower levels of new business strain than regulatory accounting.

Sudatorium

Sudatorium, the term in architecture for the vaulted sweating-room (sudor, sweat) of the Roman thermae, referred to in Vitruvius (v. 2), and there called the concamerata sudatio.

In order to obtain the great heat required, the whole wall was lined with vertical terra-cotta flue pipes of rectangular section, placed side by side, through which the hot air and the smoke from the suspensura passed to an exit in the roof.


Locks-and-keys

Locks-and-keys is a solution to dangling pointers in computer programming languages.

The locks-and-keys approach represents pointers as ordered pairs (key, address) where the key is an integer value. Heap-dynamic variables are represented as the storage for the variable plus a cell for an integer. When a variable is allocated, a lock value is created and placed both into the variable’s cell and into the variable’s ordered pair. Every access to the pointer compares these two values, and access is allowed only if the values match.

When a variable is deallocated, the key of its ordered pair is modified to hold a value different from the variable’s cell. From then on, any attempt to dereference the pointer can be flagged as an error. Since copying a pointer also copies its cell value, changing the key of the ordered pair safely disables all copies of the pointer.


See also

  • Tombstone (programming)

Rowde

Rowde is a village and civil parish in the English county of Wiltshire.


History

The village now mainly consists of modern brick built houses, but a number of 17th century buildings still remain in the centre of the village including the George and Dragon public house. The George and Dragon was predated in the village by another pub, a timber framed thatched building that was destroyed by fire in 1938, a replacement The Cross Keys now stands in its place.

On the outskirts of Rowde is the site of the Caen Hill flight of locks of the Kennet and Avon Canal. The canal rises 237 feet by means of 29 locks, 16 of them in a straight line at Caen Hill. The Kennet and Avon Canal was constructed between 1794 and 1810 and served to link Devizes with Bristol and London. The canal fell into disuse after the coming of the railway, but has been restored, and is now used for leisure purposes.


Local government

Rowde is a civil parish with an elected parish council. It falls within the areas of Kennet District Council and Wiltshire County Council. All three councils are responsible for different aspects of local government.

In the 2001 census, the district ward of Bromham & Rowde had a population of 2880.


Location

Position:

Nearby towns and cities: Devizes, Calne, Melksham, Chippenham, Swindon

Nearby villages: Bromham, Seend


See also

  • List of places in Wiltshire
  • List of civil parishes in England

Fourteen Locks

Fourteen Locks is a series of locks on the Crumlin arm of the Monmouthshire Canal at Rogerstone in Newport, South Wales. Widely regarded as Britain’s most remarkable staircase lock system , the canal level was raised 160 ft (50 m) in just 800 yd (740 m). Only the top lock is currently in water. The rest of the flight is part of a restoration programme.


External links

  • Newport City Council Guide


References

Rodrigues’ rotation formula

In geometry, Rodrigues’ rotation formula (named after Olinde Rodrigues) is a vector formula for a rotation in space, given its axis and angle of rotation.

Say u,v <math>\in</math> R3 and we want to obtain a representation for the rotation vrot of the vector v around the vector u (which is assumed to have unit length) by an angle θ in the counterclockwise (i.e. positive) direction. Rodrigues’ formula reads as follows:

<math>
\mathbf{v}_{rot} = \mathbf{v} \cdot \cos\theta + \mathbf{u} \times \mathbf{v} \cdot \sin\theta

 + \langle \mathbf{u}, \mathbf{v} \rangle \mathbf{u} \cdot (1 - \cos\theta).

</math>


Proof of the formula

Take the vector w = v − <u,v>u, which is the projection of v on the plane orthogonal to u, and the cross product of the vectors u and v: z = u×v. Turn the vector w by the angle θ around the base of the vector u to obtain the projection of the rotated vector vrot:

<math>
\begin{align}
\mathbf{w}_{rot} &= \mathbf{w} \cdot \cos\theta + \mathbf{z} \cdot \sin\theta \\
&= (\mathbf{v} - \langle \mathbf{u}, \mathbf{v} \rangle \mathbf{u}) \cdot \cos\theta
+ \mathbf{u} \times \mathbf{v} \cdot \sin\theta.
\end{align}
</math>

Notice that both the vectors w and z have the same length: |w|,|z| = |v - <u,v>u|, because the vector u is of unit length. To get the rotated vector v, we have to add back the adjustment <u,v>u. Hence

<math>
\begin{align}
\mathbf{v}_{rot} &= (\mathbf{v} - \langle \mathbf{u}, \mathbf{v} \rangle \mathbf{u}) \cdot \cos\theta
+ \mathbf{u} \times \mathbf{v} \cdot \sin\theta + \langle \mathbf{u}, \mathbf{v} \rangle \mathbf{u} \\
&= \mathbf{v} \cdot \cos\theta + \mathbf{u} \times \mathbf{v} \cdot \sin\theta
+ \langle \mathbf{u}, \mathbf{v} \rangle \mathbf{u} \cdot (1 - \cos\theta),
\end{align}
</math>

which is exactly what we were looking for.


External links

For another descriptive example see www.d6.com, Chris Hecker, physics section, part 4. “The Third Dimension” — on page 3, section “Axis and Angle, http://www.d6.com/users/checker/pdfs/gdmphys4.pdf

Payment gateway

A payment gateway is an e-commerce application service provider service that authorizes payments for e-businesses, online retailers, bricks and clicks, or traditional brick and mortar. It is the equivalent of a physical POS(Point-of-sale) terminal located in most retail outlets. Payment gateways encrypt sensitive information, such as credit card numbers, to ensure that information passes securely between the customer and the merchant.


How payment gateways work

A payment gateway facilitates the transfer of information between a payment portal (such as a website or IVR service) and the Front End Processor or acquiring bank; quickly and securely.

When a customer orders a product from a payment gateway enabled merchant, the payment gateway performs a variety of tasks to process the transaction; completely invisible to the customer. For example:

  • A customer places order on website by pressing the ‘Submit Order’ or equivalent button, or perhaps enters his/her card details using an automatic phone answering service.
  • If the order is via a website, the customer’s web browser encrypts the information to be sent between the browser and the merchant’s webserver. This is usually done via SSL (Secure Socket Layer) encryption.
  • The merchant then forwards the transaction details through to his/her payment gateway which holds the detail of the merchant account transaction. This is often another SSL encrypted connection to the payment server hosted by the payment gateway.
  • The payment gateway which receives the transaction information from the merchant forwards it to the merchant’s acquiring bank.
  • The acquiring bank then forwards the transaction information to the issuing bank (the bank that issued the credit card to the customer) for authorization.
  • The card issuing bank receives the authorization request and sends a response back to the payment gateway (via the acquiring bank) with a response code. In addition to determining the fate of the payment, (i.e approved or declined) the response code is used to define the reason why the transaction failed (such as insufficient funds, or bank link not available)
  • The payment gateway receives the response, and forwards it on to the website (or whatever interface was used to process the payment) where it is interpreted and a relevant response then relayed back to the cardholder.
  • The entire process typically takes 3-4 seconds
  • At the end of the bank-day (or settlement period) the acquiring bank deposits the total of the approved funds in to the merchant’s nominated account. This could be an account with the acquiring bank if the merchant does his/her banking with the same bank, or a scrape account with another bank.


External links

  • Six Payment Gateways Reviewed - Side-by-side comparison of six popular payment gateways

Tubular pin tumbler lock

A tubular pin tumbler lock, also known as Ace lock or “axial pin tumbler lock” or “radial lock”, is a variety of pin tumbler lock in which 6-8 pins are arranged in a circular pattern, and the corresponding key is tubular or cylindrical in shape.

J.A. Blake is credited with patenting the first tubular lock in 1833. Walter R. Schlage continued the development of the tubular lock. He was awarded 11 patents, and his improvements made the tubular lock what it is today.

Tubular locks are commonly seen on bicycle locks, computer locks, and a variety of coin-operated devices such as vending machines and coin-operated washing machines.


Security

Tubular pin tumbler locks are generally considered to be safer and more resistant to picking than standard locks, though there are several ways to open them without a key. Even though the pins are exposed, making them superficially easier to pick, they are designed such that after all pins are manipulated to their shear line, once the plug is rotated 1/6 to 1/8 around, the pins will fall into the next pin’s hole, requiring re-picking to continue. As such, picking the lock without using a device to hold its pins in place once they reach their shear line requires over a dozen complete picks to unlock and relock.

Such locks can be picked by a special tubular lock pick with a minimum of effort in very little time; it is also possible to defeat them by drilling with a special “hole saw” drill bit. Standard tubular lock drill bit sizes are .375″ (9.53 mm) diameter and .394″ (10 mm) diameter.[1] To prevent drilling, many tubular locks have a middle pin made of hardened steel, or contain a ball bearing in the middle pin.

In 2004, videos circulating on the Internet demonstrated that some tubular pin tumbler locks could be easily opened with the shaft of an inexpensive ballpoint pen (e.g. BIC brand) of matching diameter. Trade website BikeBiz.com revealed that the weaknesses of the tubular pin tumbler mechanism had first been described in 1992 by UK journalist John Stuart Clark (see Kryptonite lock).

Two phase locking

In Databases and Transaction processing, Two phase locking, (2PL) is a concurrency control locking protocol, mechanism, that guarantees Serializability. It is also the name of a class (set) of transaction schedules. Using locks that block processes, 2PL is subject to deadlocks that result from the mutual blocking of two transactions or more.


Two phase locking

According to the Two phase locking protocol, locks are handled by a transaction in two distinct, consecutive phases during the transaction’s execution:

Phase 1: Locks are acquired and no locks are released.

Phase 2: Locks are released and no locks are acquired.

The serializability property is guaranteed for a schedule with transactions that obey the protocol. The 2PL schedule class is defined as the class of all the schedules comprising transactions with data access orders that could be generated by the 2PL protocol.


Strict two phase locking

The Strict two phase locking (S2PL) class of schedules is the intersection of the 2PL class with the class of schedules possessing the Strictness property.

To comply with the S2PL protocol a transaction needs to comply with 2PL, and release its write (exclusive) locks only after it has ended, i.e., being either committed or aborted.

S2PL is a special case of 2PL, i.e., the S2PL class is a proper subclass of 2PL.


Strong strict two phase locking

To comply with the Strong strict two phase locking (SS2PL) protocol a transaction needs to comply with 2PL, and release both its write (exclusive) and read (shared) locks only after it has ended, i.e., being either committed or aborted.
A transaction obeying SS2PL can be viewed as having Phase 1 that lasts its entire execution duration, and no Phase 2 (or degenerate Phase 2). Thus, only one phase is actually left, and “two-phase” in the name seems to be still utilized due to the historical development of the concept from 2PL. The SS2PL property of a schedule is also called Rigorousness, and an SS2PL schedule is also called a Rigorous schedule.

SS2PL is a special case of S2PL, i.e., the SS2PL class of schedules is a proper subclass of S2PL (every SS2PL schedule is also an S2PL schedule, but S2PL schedules exist that are not SS2PL).

SS2PL is the concurrency control protocol of choice for most database systems since it provides besides serializability also Strictness, which is instrumental for efficient database recovery, and also Commitment ordering (CO) for participating in environments where a CO based Global serializability solution is employed.


See also

  • Serializability
  • Lock (computer science)

N-set

In mathematics, an n-set is a set containing exactly n elements, where n is a natural number. Thus, every finite set is an n-set for some specific natural number n. If S is any set, then a subset of S containing k elements is called a k-subset, or a k-combination. The family of all k-subsets of a given n-set has C(n,k) elements, where C(n,k) is the binomial coefficient.

MINDO

MINDO, or Modified Intermediate Neglect of Differential Overlap is a semi-empirical method for the quantum calculation of molecular electronic structure in computational chemistry. It is based on the Intermediate Neglect of Differential Overlap (INDO) method of John Pople. It was developed by the group of Michael Dewar and was the original method in the MOPAC program. The method should actually be referred to as MINDO/3. It was later replaced by the MNDO method, which in turn was replaced by the PM3 and AM1 methods.


Reference

  • Bingham, R. C., Dewar, M. J. S. and Lo, D. H. Journal of the American Chemical Society, 97, 1285, 1307, (1975).

Open-ended (poker)

Open-ended refers to a situation in poker where the player has four of five cards needed for a straight that can be completed at either end. For example, a player with 3♥ 4♥ 5♣ 6♠ is open-ended, because a deuce or a seven would give the player a straight. This situation is also called an outside straight draw, as the cards needed to complete the straight are cards which are on the outside of the current hand, as opposed to an inside draw such as 2♦ 3♠ 5♠ 6♥, which can only be completed by a four.

The term originated with draw poker, and is really meaningful only in that game where the distinction between an outside and inside draw is critical–outside draws are sometimes playable and inside draws rarely if ever are. But the term is also used in games like Texas Hold’em where it is less relevant, because many inside draws can be played profitably and some outside draws cannot be, other factors usually being more important.

Seven-card games like hold’em and stud also allow the possibility of double belly-buster draws, also called double-inside or two-way draws, which, like an inside draw, a card is needed within a series to fill. But unlike simple inside draws, two ranks can fill the hand. An example of this is A♥ 3♥ 4♣ 5♠7♣, in which a deuce fills the inside straight A2345, and a six would fill the inside straight 34567.

These terms are also used for straight flush draws. 2♥ 3♥ 4♥ 5♥ is a straight-flush draw, since A♥ and 6♥ will create straight flushes. Such hands are optimal drawing hands, since the player has up to fifteen outs (nine cards remaining in the suit, six cards which complete the straight but not the flush).

Daite Hold on Me!

is the third single of the J-pop idol group Morning Musume, released on September 9, 1998 as an 8 cm CD. It sold a total of 410,850 copies. In 2004 it was re-released as part of the Early Single Box and again in 2005 as a 12 cm CD. Lead vocals of this single were Natsumi Abe and Asuka Fukuda. It was Morning Musume's first single to reach the #1 position on the Oricon music charts.


Track listing

All songs written by Tsunku.


8 cm CD

  1. – 4:26
  2. – 4:07
  3. Daite Hold on Me! (Instrumental) – 4:22


12 cm CD (Early Single Box and individual release)

  1. Daite Hold on Me! (Instrumental)


Members at time of single

  • Natsumi Abe
  • Kaori Iida
  • Yuko Nakazawa
  • Asuka Fukuda
  • Aya Ishiguro
  • Mari Yaguchi
  • Kei Yasuda
  • Sayaka Ichii


External links

  • Daite Hold on Me! entry on the Hello! Project website

Curbside Prophet

Curbside Prophet” is a song by Jason Mraz. It was released as part of his first major studio album, Waiting for My Rocket to Come, which is one of the lyrics of this song.

A common interpretation of the chorus of this song is that it contains an innuendo towards masturbation, due to the lyrics “I’m just a curbside prophet, with my hand in my pocket, and I’m waiting for my rocket to come”, which could be relating to ejaculation. Some disagree that this is what he means, and that the lyrics and the button on his shirt in the CD booklet that reads “I ♥ SEX” are just pure coincidence.

Abus

Abus may refer to:

  • Abuş, a village in Romania
  • Abus (locks), a German maker of locks and padlocks
  • Abus (river), a large tidal waterway
  • Abus, an independent bus operator in Greater Bristol


See also

  • Abus Gun
  • Abuse

Memetic algorithm

Memetic algorithms is a population-based approach for heuristic search in optimization problems. For some problem domains they have been shown to be more efficient than genetic algorithms. Some researchers view them as hybrid genetic algorithms or parallel genetic algorithms.

From the view of Genetic Algorithm, if GA is combined with some kinds of Local Search, the algorithm is termed as memetic algorithm.

Memetic algorithms are the subject of intense scientific research and have been successfully applied to a multitude of real-world problems ranging from the construction of university exam timetables, to the prediction of protein structures and the design of spacecraft trajectories.


References

  • P. Moscato, On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms, Caltech Concurrent Computation Program, C3P Report 826, (1989).
  • Recent Advances in Memetic Algorithms, Series: Studies in Fuzziness and Soft Computing, Vol. 166, Hart, William E.; Krasnogor, N.; Smith, J.E. (Eds.), 2005
  • Special Issue on Memetic Algorithms, IEEE Transactions on Systems, Man and Cybernetics - Part B, Vol. 37, No. 1, Ong Y.S.; Krasnogor, N.; Ishibuchi H. (Eds.), Feb 2007.
  • A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Transactions on Evolutionary Computation, 9(5):474- 488, N. Krasnogor and J.E. Smith. 2005.

Just What I Needed: The Cars Anthology

Just What I Needed: The Cars Anthology is a greatest-hits compilation from the 80s New Wave rock group The Cars.


Track listing

All songs written by Ric Ocasek unless noted otherwise. Tracks marked with [#] represent songs that are brand new on the set.


Disc One

  1. Just What I Needed
  2. My Best Friend’s Girl
  3. Good Times Roll
  4. You’re All I’ve Got Tonight
  5. Don’t Cha Stop
  6. Moving in Stereo - (Ocasek/Greg Hawkes)
  7. Take Me Now [#]
  8. Cool Fool [#] - (Ocasek/Elliot Easton)
  9. Let’s Go
  10. Candy-O
  11. Dangerous Type
  12. Double Life
  13. Got a Lot on My Head
  14. It’s All I Can Do
  15. Nightspots
  16. Slipaway [#]
  17. That’s it [#]
  18. Panorama
  19. Gimme Some Slack
  20. Don’t Go to Pieces [#] (Ocasek/Greg Hawkes)


Disc Two

  1. Touch and Go
  2. Don’t Tell Me No
  3. Shake it Up
  4. Since You’re Gone
  5. I’m Not the One
  6. Cruiser
  7. The Little Black Egg [#] - (Michael Stone)
  8. Funtime [#] - (David Bowie/Iggy Pop)
  9. You Might Think
  10. Drive
  11. Magic
  12. Hello Again
  13. Why Can’t I Have You
  14. Breakaway
  15. Tonight She Comes
  16. You Are the Girl
  17. Strap Me in
  18. Door to Door
  19. Leave or Stay (Demo) [#]
  20. Ta Ta Wayo Wayo (Demo) [#]


Personnel

  • Elliot Easton – lead guitar, backing vocals
  • Greg Hawkes – keyboards, backing vocals
  • Ric Ocasek – rhythm guitar, lead vocals on Disc One tracks: 2, 3, 4, 5, 11, 12, 13, 15, 16, 18, 19; Disc Two tracks: 1, 3, 4, 5, 7, 9, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20
  • Benjamin Orr – bass guitar, lead vocals on Disc One tracks: 1, 6, 7, 8, 9, 10, 14, 17, 20; Disc Two tracks: 2, 6, 8, 10
  • David Robinson – drums, percussion

Upholstery needle

An upholstery needle is a needle used for upholstery. There is a variety of sizes, but they are usually very heavy and curved.

Another type of needle used by upholsterers is the button needle, which is a very long needle used to install buttons with heavy twine through pillows, cushions and furniture backs.

An upholstery needle is also used by cosmetologists for the installation of hair weaves.

Foxton Locks

Foxton Locks are ten canal locks consisting of two “staircases” each of five locks, located on the Leicester line of the Grand Union Canal about 5 km west of the Leicestershire town of Market Harborough and are named after the nearby village of Foxton.

They form the northern terminus of a 20-mile summit level that passes Husbands Bosworth, Crick and ends with the Watford flight

Staircase locks are used where a canal needs to climb a steep hill, and consist of groups of locks which open directly into each other. Foxton Locks are the largest flight of such staircase locks on the English canal system.

The Grade II* listed locks are a popular tourist attraction and the county council has created a country park at the top. At the bottom, where the junction with the arm to Market Harborough is located, there are two public houses, a shop, trip boat and other facilities. The area is thus ideal for gongoozlers.


The locks

Building work on the locks started in 1810 and was finished 4 years later in 1814. Little changed until the building of the inclined plane resulted in the reduction in size of some of the side pounds.While the inclined plane was in operation the locks were allowed to fall into decline to an extent and in 1908 the committee released £1000 to bring the locks back into full operation.

On the 26 November 2006 boaters blockaded the locks as part of protests against Defra cutting British Waterways funding.


Foxton Inclined Plane

In 1900 an inclined plane was built to the side of the locks. The aim was partly to speed up the passage of boats, but also as part of an effort to allow the passage of wide-beam barges instead of just narrowboats.

It was designed by Gordon Cale Thomas and had 2 tanks or caissons, each capable of holding 2 narrowboats or a barge. The caissons were full of water, and so balanced each other. The lift was powered by a 25 horsepower (19 kW) stationary engine. The land for the project was purchased for £1,595 and with the entire project costing £39,244 by 24 June 1900.

The inclined plane had a journey time of 12 minutes for 2 boats up and 2 down and improved the speed of passage up the hill tremendously. Unlike the locks, where water flowed downhill every time a boat passed through, on the inclined plane almost the same amount of water went up and down the hill. Only the displaced water is moved, thus saving a great deal of water and giving better control of this vital resource.

There was a plan to build a similar inclined plane at the Watford Locks at the southern end of the canal’s summit level. However, this was never carried through, and as the Watford Locks were never widened, the economic benefits of the plane could not be fully realised. Thus, despite its obvious effectiveness, the Foxton Inclined Plane was mothballed in 1911 to save money. After that date it saw occasional use when the locks were undergoing maintenance

In 1927, dismantling of the incline began, so that it could be sold for scrap. That year the chimney on the engine house was demolished and its bricks used for various canal repairs.


The plane today

The remains of the plane can still be seen, and the site explored by visitors (to a limited extent).

In the building alongside the locks, the former boiler house for the plane’s steam engine, there is a small museum covering the history of the locks and the plane, and other aspects of the local canal.

The mooring bollards from the incline can be found alongside the locks.


Restoration

The site of the Foxton Inclined Plane Boat Lift has been recognised as a Scheduled Ancient Monument and is on the Buildings at Risk Register. This recognition, together with the steady increase in leisure boating on British canals, means its restoration is now considered a key project in the development of the national waterway network.

The cost of full restoration has been estimated at £9 million (2006 figures), and is to be tackled in a series of stages.

Stage 1 of the project — the clearing of the site and restoration of the canal arms above and below the plane — is already underway. A grant for £1.7 million has been received from the Heritage Lottery Fund towards the £2.8 million cost of this first stage.

Fund-raising is currently underway to raise the money for a full engineering study to determine the best way of recreating a working boat lift at Foxton.


References

  • Uhlemann, H-J., (2002), Canal Lifts and Inclines of the World, Internat Limited, ISBN 0 95431 811 0


External links

  • Foxton Locks and Partnership
  • Foxton Inclined Plane Trust

MediaTransparency

MediaTransparency is a left-wing project begun in 1999 which monitors the financial ties of conservative think tanks to conservative foundations in the United States. Its database tracks over 50,000 grants awarded since 1985, which total more than $3.2 billion USD. It is run by Cursor, Inc. The slogan on their web page is “The Money behind Conservative Media.”

They are dedicated to “news, opinion, analysis and investigative data related to links between conservative philanthropies and the organizations and people they fund, and their influence in the media.”[1]

According to the right-wing World Journalism Institute, and used as a quote by the parent organization Cursor, Inc., to describe MediaTransparency, “MediaTransparency is a left-wing survey of conservative activity. It is valuable for conservative networking and comprehension of the far-left perspective of conservative free speech.” [2]

Cursor.org has not received an Ideological Spectrum Rating from the right-wing Capital Research Center[3]


External link

  • MediaTransparency.org

Balance lock

The balance lock was a type of lock to transport boats up and down a hillside on a canal.

Boats were to ride in caissons, essentially bathtubs, of water which were to be hauled up and down the hillside by chain, being balanced by another tub of water. It was patented by James Fussell during his work on the Dorset and Somerset Canal.


External

links

  • Dorset and Somerset canal, with information on locks

Database transaction

A database transaction is a unit of interaction with a database management system or similar system that is treated in a coherent and reliable way independent of other transactions. In general, a database transaction must be atomic, meaning that it must be either entirely completed or aborted. Ideally, a database system will guarantee the properties of Atomicity, Consistency, Isolation and Durability (ACID) for each transaction. In practice, these properties are often relaxed somewhat to provide better performance.

In some systems, transactions are also called LUWs for Logical Units of Work.


Purpose of transaction

In database products the ability to handle transactions allows the user to ensure that integrity of a database is maintained.

A single transaction might require several queries, each reading and/or writing information in the database. When this happens it is usually important to be sure that the database is not left with only some of the queries carried out. For example, when doing a money transfer, if the money was debited from one account, it is important that it also be credited to the depositing account. Also, transactions should not interfere with each other. For more information about desirable transaction properties, see ACID.

A simple transaction is usually issued to the database system in a language like SQL in this form:

  1. Begin the transaction
  2. Execute several queries (although any updates to the database aren’t actually visible to the outside world yet)
  3. Commit the transaction (updates become visible if the transaction is successful)

If one of the queries fails the database system may rollback either the entire transaction or just the failed query. This behaviour is dependent on the DBMS in use and how it is set up. The transaction can also be rolled back manually at any time before the commit.


Transactional databases

Databases that support transactions are called transactional databases. Most modern relational database management systems fall into this category.


Transactional filesystems

The Namesys Reiser4 filesystem for Linux [1] and the newest version of the Microsoft NTFS filesystem both support transactions [2], but file system transactions are rarely used in practice due to lack of compatibility with older systems.


See also

  • Distributed transaction
  • Nested transaction
  • ACID properties
  • Atomic transaction
  • Software transactional memory
  • Long running transaction
  • Transaction processing


External links

  • Transaction Processing

Banklink

In Australia and New Zealand, BankLink is an accounting service used by more than 200,000 small businesses for their GST and end of year tax. BankLink is available to businesses through their accountants.

The BankLink service electronically delivers bank transaction data from participating banks directly to the accountant. BankLink software then automatically codes as many transactions as possible. The accountant can then find out from the client the nature of any uncoded transactions using any of BankLink’s electronic reports.

BankLink offers business owners of a very cost effective process for completing their own accounts. It is extremely accurate and fast, and provides the security that the accounts have been completed professionally.


External links

  • http://www.banklink.com.au
  • http://www.banklink.co.nz

Algorithms for Recovery and Isolation Exploiting Semantics

In computer science, Algorithms for Recovery and Isolation Exploiting Semantics, or ARIES is a recovery algorithm designed to work with a no-force, steal database approach. One such algorithm is, ARIES, used by IBM DB2, Microsoft SQL Server and many other database systems.

Three main principles lie behind ARIES:

  • Write ahead logging: Any change to an object is first recorded in the log, and the log must be written to stable storage before changes to the object are written to disk.
  • Repeating history during Redo: On restart after a crash, ARIES retraces the actions of a database before the crash and brings the system back to the exact state that it was in before the crash. Then it undoes the transactions still active at crash time.
  • Logging changes during Undo: Changes made to the database while undoing transactions are logged to ensure such an action isn’t repeated in the event of repeated restarts.


External references

  • C. Mohan, A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging, ACM Transactions on Database Systems, Vol. 17, No. 1, March 1992, pp. 94–162
  • C. Mohan, Repeating History Beyond ARIES, Proceedings of 25th International Conference on Very Large Data Bases, 1999

1951 in science

The year 1951 in science and technology involved some significant events, listed below.


Computer science

  • March 30 - Remington Rand delivers the first UNIVAC I computer to the United States Census Bureau.


Technology

  • July 5 - William Shockley invents the junction transistor.


Awards

  • Nobel Prizes

    • Physics - John Douglas Cockcroft, Ernest Thomas Sinton Walton
    • Chemistry - Edwin Mattison McMillan; Glenn Theodore Seaborg
    • Medicine - Max Theiler
  • Copley Medal: David Keilin
  • Wollaston Medal for Geology - Olaf Holtedahl


Births

  • September 18 - John Clark (d. 2004), cloner, head of the Roslin Institute


Deaths

  • April 6 - Robert Broom (b. 1866), paleontologist
  • April 22 - Horace Donisthorpe (b. 1870), British entomologist